diff -Nrc3pad gcc-3.2.2/.brik gcc-3.2.3/.brik *** gcc-3.2.2/.brik Wed Feb 5 03:55:24 2003 --- gcc-3.2.3/.brik Tue Apr 22 09:56:16 2003 *************** *** 4,32 **** # ------ -------- 3205162104b ./.cvsignore ! 2801352305b ./BUGS 2171125041b ./COPYING 508743035b ./COPYING.LIB ! 3927827037b ./ChangeLog ! 2859733475b ./FAQ 4190923194b ./GNATS 2229468985b ./INSTALL/README ! 2594642159b ./INSTALL/binaries.html ! 1150299172b ./INSTALL/build.html ! 2138152758b ./INSTALL/configure.html ! 1908954708b ./INSTALL/download.html ! 827688179b ./INSTALL/finalinstall.html ! 2784342709b ./INSTALL/gfdl.html ! 686439052b ./INSTALL/index.html ! 798593089b ./INSTALL/old.html ! 1770994652b ./INSTALL/specific.html ! 379139745b ./INSTALL/test.html 4287295648b ./MAINTAINERS 3313742257b ./Makefile.in 3697693037b ./README 655018850b ./boehm-gc/AmigaOS.c 2411687152b ./boehm-gc/BCC_MAKEFILE ! 1277390130b ./boehm-gc/ChangeLog 3428452570b ./boehm-gc/EMX_MAKEFILE 145946109b ./boehm-gc/MacOS.c 591574792b ./boehm-gc/MacProjects.sit.hqx --- 4,32 ---- # ------ -------- 3205162104b ./.cvsignore ! 2680648595b ./BUGS 2171125041b ./COPYING 508743035b ./COPYING.LIB ! 3991841618b ./ChangeLog ! 835327280b ./FAQ 4190923194b ./GNATS 2229468985b ./INSTALL/README ! 1594371290b ./INSTALL/binaries.html ! 984517660b ./INSTALL/build.html ! 850286653b ./INSTALL/configure.html ! 3411038527b ./INSTALL/download.html ! 371279032b ./INSTALL/finalinstall.html ! 2697832096b ./INSTALL/gfdl.html ! 3334357163b ./INSTALL/index.html ! 503704929b ./INSTALL/old.html ! 4178635678b ./INSTALL/specific.html ! 2431446841b ./INSTALL/test.html 4287295648b ./MAINTAINERS 3313742257b ./Makefile.in 3697693037b ./README 655018850b ./boehm-gc/AmigaOS.c 2411687152b ./boehm-gc/BCC_MAKEFILE ! 1966835067b ./boehm-gc/ChangeLog 3428452570b ./boehm-gc/EMX_MAKEFILE 145946109b ./boehm-gc/MacOS.c 591574792b ./boehm-gc/MacProjects.sit.hqx *************** *** 183,194 **** 2467355438b ./boehm-gc/typd_mlc.c 332085760b ./boehm-gc/version.h 3326583566b ./boehm-gc/win32_threads.c ! 2509440942b ./bugs.html ! 3139906847b ./config-ml.in 3794184949b ./config.guess 1864899138b ./config.if 537897852b ./config.sub ! 3400028451b ./config/ChangeLog 3004978457b ./config/acinclude.m4 3007349820b ./config/mh-a68bsd 1442196770b ./config/mh-aix386 --- 183,194 ---- 2467355438b ./boehm-gc/typd_mlc.c 332085760b ./boehm-gc/version.h 3326583566b ./boehm-gc/win32_threads.c ! 1129492486b ./bugs.html ! 1583135805b ./config-ml.in 3794184949b ./config.guess 1864899138b ./config.if 537897852b ./config.sub ! 114139691b ./config/ChangeLog 3004978457b ./config/acinclude.m4 3007349820b ./config/mh-a68bsd 1442196770b ./config/mh-aix386 *************** *** 232,238 **** 456622165b ./config/mh-vaxult2 3265825290b ./config/mh-x86pic 198559626b ./config/mpw-mh-mpw ! 1384213553b ./config/mpw/ChangeLog 3145098931b ./config/mpw/MoveIfChange 1476422091b ./config/mpw/README 4005879853b ./config/mpw/forward-include --- 232,238 ---- 456622165b ./config/mh-vaxult2 3265825290b ./config/mh-x86pic 198559626b ./config/mpw-mh-mpw ! 108267066b ./config/mpw/ChangeLog 3145098931b ./config/mpw/MoveIfChange 1476422091b ./config/mpw/README 4005879853b ./config/mpw/forward-include *************** *** 262,268 **** 771382916b ./config/mt-x86pic 2416042097b ./configure 3230279174b ./configure.in ! 2762145970b ./contrib/ChangeLog 1948950130b ./contrib/analyze_brprob 550196746b ./contrib/compare_tests 2828387446b ./contrib/convert_to_f2c --- 262,268 ---- 771382916b ./config/mt-x86pic 2416042097b ./configure 3230279174b ./configure.in ! 3512451768b ./contrib/ChangeLog 1948950130b ./contrib/analyze_brprob 550196746b ./contrib/compare_tests 2828387446b ./contrib/convert_to_f2c *************** *** 274,280 **** 109296376b ./contrib/gennews 4256039795b ./contrib/index-prop 3683285493b ./contrib/newcvsroot ! 1731874216b ./contrib/regression/ChangeLog 1757898889b ./contrib/regression/README 1596938872b ./contrib/regression/btest-gcc.sh 4208566980b ./contrib/regression/objs-gcc.sh --- 274,280 ---- 109296376b ./contrib/gennews 4256039795b ./contrib/index-prop 3683285493b ./contrib/newcvsroot ! 2125180271b ./contrib/regression/ChangeLog 1757898889b ./contrib/regression/README 1596938872b ./contrib/regression/btest-gcc.sh 4208566980b ./contrib/regression/objs-gcc.sh *************** *** 283,293 **** 2523431553b ./contrib/test_summary 3362750683b ./contrib/texi2pod.pl 4228623080b ./contrib/warn_summary ! 3102205468b ./faq.html 1005262133b ./fastjar/AUTHORS 1745615150b ./fastjar/CHANGES 1396100520b ./fastjar/COPYING ! 1593465022b ./fastjar/ChangeLog 2770615802b ./fastjar/INSTALL 3714739366b ./fastjar/Makefile.am 39617579b ./fastjar/Makefile.in --- 283,293 ---- 2523431553b ./contrib/test_summary 3362750683b ./contrib/texi2pod.pl 4228623080b ./contrib/warn_summary ! 2887273247b ./faq.html 1005262133b ./fastjar/AUTHORS 1745615150b ./fastjar/CHANGES 1396100520b ./fastjar/COPYING ! 4056720975b ./fastjar/ChangeLog 2770615802b ./fastjar/INSTALL 3714739366b ./fastjar/Makefile.am 39617579b ./fastjar/Makefile.in *************** *** 318,324 **** 1758308615b ./gcc/ABOUT-NLS 2171125041b ./gcc/COPYING 508743035b ./gcc/COPYING.LIB ! 4098147965b ./gcc/ChangeLog 1398127668b ./gcc/ChangeLog.0 2827765101b ./gcc/ChangeLog.1 1199055802b ./gcc/ChangeLog.2 --- 318,324 ---- 1758308615b ./gcc/ABOUT-NLS 2171125041b ./gcc/COPYING 508743035b ./gcc/COPYING.LIB ! 2608914462b ./gcc/ChangeLog 1398127668b ./gcc/ChangeLog.0 2827765101b ./gcc/ChangeLog.1 1199055802b ./gcc/ChangeLog.2 *************** *** 332,338 **** 3797967515b ./gcc/FSFChangeLog.11 4134111346b ./gcc/LANGUAGES 214390302b ./gcc/Makefile.in ! 435752999b ./gcc/NEWS 538471119b ./gcc/ONEWS 2799003008b ./gcc/README-fixinc 2741038711b ./gcc/README.Portability --- 332,338 ---- 3797967515b ./gcc/FSFChangeLog.11 4134111346b ./gcc/LANGUAGES 214390302b ./gcc/Makefile.in ! 1084812157b ./gcc/NEWS 538471119b ./gcc/ONEWS 2799003008b ./gcc/README-fixinc 2741038711b ./gcc/README.Portability *************** *** 532,541 **** 1989930650b ./gcc/ada/86numaux.adb 4223067829b ./gcc/ada/86numaux.ads 176063031b ./gcc/ada/9drpc.adb ! 1702217023b ./gcc/ada/ChangeLog ! 3231195932b ./gcc/ada/Make-lang.in 82447397b ./gcc/ada/Makefile.adalib ! 3584028360b ./gcc/ada/Makefile.in 1238937539b ./gcc/ada/a-astaco.adb 4160306902b ./gcc/ada/a-astaco.ads 1228169839b ./gcc/ada/a-caldel.adb --- 532,541 ---- 1989930650b ./gcc/ada/86numaux.adb 4223067829b ./gcc/ada/86numaux.ads 176063031b ./gcc/ada/9drpc.adb ! 3541119639b ./gcc/ada/ChangeLog ! 1021041780b ./gcc/ada/Make-lang.in 82447397b ./gcc/ada/Makefile.adalib ! 3683211435b ./gcc/ada/Makefile.in 1238937539b ./gcc/ada/a-astaco.adb 4160306902b ./gcc/ada/a-astaco.ads 1228169839b ./gcc/ada/a-caldel.adb *************** *** 1008,1014 **** 2835105488b ./gcc/ada/gnatprep.ads 3865862564b ./gcc/ada/gnatpsta.adb 3829654473b ./gcc/ada/gnatpsys.adb ! 1670534955b ./gcc/ada/gnatvsn.ads 2692053620b ./gcc/ada/gnatxref.adb 577038397b ./gcc/ada/hlo.adb 991320325b ./gcc/ada/hlo.ads --- 1008,1014 ---- 2835105488b ./gcc/ada/gnatprep.ads 3865862564b ./gcc/ada/gnatpsta.adb 3829654473b ./gcc/ada/gnatpsys.adb ! 4288634473b ./gcc/ada/gnatvsn.ads 2692053620b ./gcc/ada/gnatxref.adb 577038397b ./gcc/ada/hlo.adb 991320325b ./gcc/ada/hlo.ads *************** *** 1064,1070 **** 2167962937b ./gcc/ada/lib-xref.ads 1029825782b ./gcc/ada/lib.adb 1122008701b ./gcc/ada/lib.ads ! 3576767122b ./gcc/ada/link.c 1382287720b ./gcc/ada/live.adb 241788297b ./gcc/ada/live.ads 2349274909b ./gcc/ada/machcode.ads --- 1064,1070 ---- 2167962937b ./gcc/ada/lib-xref.ads 1029825782b ./gcc/ada/lib.adb 1122008701b ./gcc/ada/lib.ads ! 3273789304b ./gcc/ada/link.c 1382287720b ./gcc/ada/live.adb 241788297b ./gcc/ada/live.ads 2349274909b ./gcc/ada/machcode.ads *************** *** 1693,1740 **** 1423262391b ./gcc/alias.c 1031959714b ./gcc/attribs.c 3996983224b ./gcc/basic-block.h ! 534677057b ./gcc/bb-reorder.c 518972076b ./gcc/bitmap.c 477755928b ./gcc/bitmap.h 540939972b ./gcc/builtin-attrs.def 1736755746b ./gcc/builtin-types.def ! 3805127813b ./gcc/builtins.c 2454689977b ./gcc/builtins.def 420541423b ./gcc/c-aux-info.c 3749632892b ./gcc/c-common.c 2096270511b ./gcc/c-common.def 17222401b ./gcc/c-common.h 1317742909b ./gcc/c-convert.c ! 2201480607b ./gcc/c-decl.c 487899684b ./gcc/c-errors.c 1391364139b ./gcc/c-format.c 1985388077b ./gcc/c-lang.c 382517507b ./gcc/c-lex.c 835686435b ./gcc/c-lex.h 1191094530b ./gcc/c-objc-common.c ! 1694666955b ./gcc/c-parse.c 4048701711b ./gcc/c-parse.in 492383053b ./gcc/c-parse.y 73956308b ./gcc/c-pragma.c 1212765089b ./gcc/c-pragma.h 3567184655b ./gcc/c-semantics.c 2780104305b ./gcc/c-tree.h ! 2926467753b ./gcc/c-typeck.c 4196427447b ./gcc/caller-save.c 3428212111b ./gcc/calls.c 2908854975b ./gcc/cfg.c 2266313517b ./gcc/cfganal.c 2306033851b ./gcc/cfgbuild.c ! 1200507286b ./gcc/cfgcleanup.c 1219429812b ./gcc/cfglayout.c 1858346793b ./gcc/cfglayout.h 3236894730b ./gcc/cfgloop.c ! 2041391494b ./gcc/cfgrtl.c ! 1806916686b ./gcc/collect2.c 653998699b ./gcc/collect2.h ! 3893532884b ./gcc/combine.c 4122382037b ./gcc/conditions.h ! 595953330b ./gcc/config.gcc 1315260558b ./gcc/config.guess 1761565476b ./gcc/config.in 3356933371b ./gcc/config/1750a/1750a-protos.h --- 1693,1740 ---- 1423262391b ./gcc/alias.c 1031959714b ./gcc/attribs.c 3996983224b ./gcc/basic-block.h ! 3664924098b ./gcc/bb-reorder.c 518972076b ./gcc/bitmap.c 477755928b ./gcc/bitmap.h 540939972b ./gcc/builtin-attrs.def 1736755746b ./gcc/builtin-types.def ! 1602117951b ./gcc/builtins.c 2454689977b ./gcc/builtins.def 420541423b ./gcc/c-aux-info.c 3749632892b ./gcc/c-common.c 2096270511b ./gcc/c-common.def 17222401b ./gcc/c-common.h 1317742909b ./gcc/c-convert.c ! 3121341096b ./gcc/c-decl.c 487899684b ./gcc/c-errors.c 1391364139b ./gcc/c-format.c 1985388077b ./gcc/c-lang.c 382517507b ./gcc/c-lex.c 835686435b ./gcc/c-lex.h 1191094530b ./gcc/c-objc-common.c ! 707725569b ./gcc/c-parse.c 4048701711b ./gcc/c-parse.in 492383053b ./gcc/c-parse.y 73956308b ./gcc/c-pragma.c 1212765089b ./gcc/c-pragma.h 3567184655b ./gcc/c-semantics.c 2780104305b ./gcc/c-tree.h ! 1842642506b ./gcc/c-typeck.c 4196427447b ./gcc/caller-save.c 3428212111b ./gcc/calls.c 2908854975b ./gcc/cfg.c 2266313517b ./gcc/cfganal.c 2306033851b ./gcc/cfgbuild.c ! 1767622119b ./gcc/cfgcleanup.c 1219429812b ./gcc/cfglayout.c 1858346793b ./gcc/cfglayout.h 3236894730b ./gcc/cfgloop.c ! 697357307b ./gcc/cfgrtl.c ! 4092688391b ./gcc/collect2.c 653998699b ./gcc/collect2.h ! 1204798801b ./gcc/combine.c 4122382037b ./gcc/conditions.h ! 1610676755b ./gcc/config.gcc 1315260558b ./gcc/config.guess 1761565476b ./gcc/config.in 3356933371b ./gcc/config/1750a/1750a-protos.h *************** *** 1756,1762 **** 4085134134b ./gcc/config/alpha/alpha-protos.h 830149807b ./gcc/config/alpha/alpha.c 2486755494b ./gcc/config/alpha/alpha.h ! 1955091231b ./gcc/config/alpha/alpha.md 3915788506b ./gcc/config/alpha/alpha32.h 1407988137b ./gcc/config/alpha/crtfastmath.c 221364934b ./gcc/config/alpha/elf.h --- 1756,1762 ---- 4085134134b ./gcc/config/alpha/alpha-protos.h 830149807b ./gcc/config/alpha/alpha.c 2486755494b ./gcc/config/alpha/alpha.h ! 1672390089b ./gcc/config/alpha/alpha.md 3915788506b ./gcc/config/alpha/alpha32.h 1407988137b ./gcc/config/alpha/crtfastmath.c 221364934b ./gcc/config/alpha/elf.h *************** *** 1767,1773 **** 3901756355b ./gcc/config/alpha/linux.h 1830150315b ./gcc/config/alpha/netbsd.h 156117508b ./gcc/config/alpha/openbsd.h ! 2313475776b ./gcc/config/alpha/osf.h 1792826440b ./gcc/config/alpha/osf12.h 3744703656b ./gcc/config/alpha/osf2or3.h 2776242025b ./gcc/config/alpha/osf5.h --- 1767,1773 ---- 3901756355b ./gcc/config/alpha/linux.h 1830150315b ./gcc/config/alpha/netbsd.h 156117508b ./gcc/config/alpha/openbsd.h ! 4018452315b ./gcc/config/alpha/osf.h 1792826440b ./gcc/config/alpha/osf12.h 3744703656b ./gcc/config/alpha/osf2or3.h 2776242025b ./gcc/config/alpha/osf5.h *************** *** 1886,1892 **** 2623962717b ./gcc/config/cris/cris-protos.h 937590356b ./gcc/config/cris/cris.c 1846933412b ./gcc/config/cris/cris.h ! 3975834409b ./gcc/config/cris/cris.md 4228128527b ./gcc/config/cris/cris_abi_symbol.c 2550031006b ./gcc/config/cris/linux.h 907689569b ./gcc/config/cris/mulsi3.asm --- 1886,1892 ---- 2623962717b ./gcc/config/cris/cris-protos.h 937590356b ./gcc/config/cris/cris.c 1846933412b ./gcc/config/cris/cris.h ! 1799638103b ./gcc/config/cris/cris.md 4228128527b ./gcc/config/cris/cris_abi_symbol.c 2550031006b ./gcc/config/cris/linux.h 907689569b ./gcc/config/cris/mulsi3.asm *************** *** 1995,2003 **** 1321445318b ./gcc/config/i386/i386-interix.h 721929446b ./gcc/config/i386/i386-interix3.h 2589129574b ./gcc/config/i386/i386-protos.h ! 2391340311b ./gcc/config/i386/i386.c ! 1737688208b ./gcc/config/i386/i386.h ! 1643637147b ./gcc/config/i386/i386.md 2017248418b ./gcc/config/i386/i386elf.h 1164740130b ./gcc/config/i386/interix.c 3908393755b ./gcc/config/i386/isc.h --- 1995,2003 ---- 1321445318b ./gcc/config/i386/i386-interix.h 721929446b ./gcc/config/i386/i386-interix3.h 2589129574b ./gcc/config/i386/i386-protos.h ! 2676101452b ./gcc/config/i386/i386.c ! 1745281973b ./gcc/config/i386/i386.h ! 1385892283b ./gcc/config/i386/i386.md 2017248418b ./gcc/config/i386/i386elf.h 1164740130b ./gcc/config/i386/interix.c 3908393755b ./gcc/config/i386/isc.h *************** *** 2006,2013 **** 877642037b ./gcc/config/i386/libgcc-x86_64-glibc.ver 2999558891b ./gcc/config/i386/linux-aout.h 2799520524b ./gcc/config/i386/linux-oldld.h ! 2801664794b ./gcc/config/i386/linux.h ! 1758822745b ./gcc/config/i386/linux64.h 83628421b ./gcc/config/i386/lynx-ng.h 372710545b ./gcc/config/i386/lynx.h 4206477894b ./gcc/config/i386/mach.h --- 2006,2013 ---- 877642037b ./gcc/config/i386/libgcc-x86_64-glibc.ver 2999558891b ./gcc/config/i386/linux-aout.h 2799520524b ./gcc/config/i386/linux-oldld.h ! 767649862b ./gcc/config/i386/linux.h ! 2975476387b ./gcc/config/i386/linux64.h 83628421b ./gcc/config/i386/lynx-ng.h 372710545b ./gcc/config/i386/lynx.h 4206477894b ./gcc/config/i386/mach.h *************** *** 2212,2218 **** 1109594909b ./gcc/config/m68k/m68k-psos.h 1870424553b ./gcc/config/m68k/m68k.c 3756685982b ./gcc/config/m68k/m68k.h ! 1833592513b ./gcc/config/m68k/m68k.md 2287927144b ./gcc/config/m68k/m68kelf.h 1120822994b ./gcc/config/m68k/m68kemb.h 947783547b ./gcc/config/m68k/m68kv4.h --- 2212,2218 ---- 1109594909b ./gcc/config/m68k/m68k-psos.h 1870424553b ./gcc/config/m68k/m68k.c 3756685982b ./gcc/config/m68k/m68k.h ! 4063689296b ./gcc/config/m68k/m68k.md 2287927144b ./gcc/config/m68k/m68kelf.h 1120822994b ./gcc/config/m68k/m68kemb.h 947783547b ./gcc/config/m68k/m68kv4.h *************** *** 2324,2330 **** 2743944992b ./gcc/config/mips/iris4loser.h 4137712676b ./gcc/config/mips/iris5.h 1342606731b ./gcc/config/mips/iris5gas.h ! 2714897906b ./gcc/config/mips/iris6.h 2290690324b ./gcc/config/mips/iris6gld.h 3658812670b ./gcc/config/mips/irix6-libc-compat.c 3645898751b ./gcc/config/mips/isa32-linux.h --- 2324,2330 ---- 2743944992b ./gcc/config/mips/iris4loser.h 4137712676b ./gcc/config/mips/iris5.h 1342606731b ./gcc/config/mips/iris5gas.h ! 1473745020b ./gcc/config/mips/iris6.h 2290690324b ./gcc/config/mips/iris6gld.h 3658812670b ./gcc/config/mips/irix6-libc-compat.c 3645898751b ./gcc/config/mips/isa32-linux.h *************** *** 2332,2341 **** 1922092548b ./gcc/config/mips/linux.h 2202363688b ./gcc/config/mips/little.h 3112223626b ./gcc/config/mips/mips-5.h ! 4191298187b ./gcc/config/mips/mips-protos.h ! 4175300921b ./gcc/config/mips/mips.c ! 1450296441b ./gcc/config/mips/mips.h ! 3326013566b ./gcc/config/mips/mips.md 2024693888b ./gcc/config/mips/mips16.S 3451330990b ./gcc/config/mips/netbsd.h 1685635385b ./gcc/config/mips/news4.h --- 2332,2341 ---- 1922092548b ./gcc/config/mips/linux.h 2202363688b ./gcc/config/mips/little.h 3112223626b ./gcc/config/mips/mips-5.h ! 3798369178b ./gcc/config/mips/mips-protos.h ! 4292919872b ./gcc/config/mips/mips.c ! 1682195442b ./gcc/config/mips/mips.h ! 218198435b ./gcc/config/mips/mips.md 2024693888b ./gcc/config/mips/mips16.S 3451330990b ./gcc/config/mips/netbsd.h 1685635385b ./gcc/config/mips/news4.h *************** *** 2431,2440 **** 3618123809b ./gcc/config/pa/pa-oldas.h 3108768032b ./gcc/config/pa/pa-osf.h 2360373262b ./gcc/config/pa/pa-pro-end.h ! 1408239843b ./gcc/config/pa/pa-protos.h ! 4191862649b ./gcc/config/pa/pa.c ! 479563046b ./gcc/config/pa/pa.h ! 3424276871b ./gcc/config/pa/pa.md 2660241824b ./gcc/config/pa/pa32-linux.h 3627454173b ./gcc/config/pa/pa32-regs.h 3477747579b ./gcc/config/pa/pa64-hpux.h --- 2431,2440 ---- 3618123809b ./gcc/config/pa/pa-oldas.h 3108768032b ./gcc/config/pa/pa-osf.h 2360373262b ./gcc/config/pa/pa-pro-end.h ! 944974079b ./gcc/config/pa/pa-protos.h ! 4228751593b ./gcc/config/pa/pa.c ! 2873633316b ./gcc/config/pa/pa.h ! 756298139b ./gcc/config/pa/pa.md 2660241824b ./gcc/config/pa/pa32-linux.h 3627454173b ./gcc/config/pa/pa32-regs.h 3477747579b ./gcc/config/pa/pa64-hpux.h *************** *** 2505,2513 **** 926081320b ./gcc/config/rs6000/netbsd.h 4127185084b ./gcc/config/rs6000/ppc-asm.h 2986503806b ./gcc/config/rs6000/rs6000-protos.h ! 3651688118b ./gcc/config/rs6000/rs6000.c ! 1882734550b ./gcc/config/rs6000/rs6000.h ! 3597268251b ./gcc/config/rs6000/rs6000.md 111710449b ./gcc/config/rs6000/rtems.h 2439652147b ./gcc/config/rs6000/softfloat.h 3703627966b ./gcc/config/rs6000/sol-ci.asm --- 2505,2513 ---- 926081320b ./gcc/config/rs6000/netbsd.h 4127185084b ./gcc/config/rs6000/ppc-asm.h 2986503806b ./gcc/config/rs6000/rs6000-protos.h ! 4042212867b ./gcc/config/rs6000/rs6000.c ! 2995718160b ./gcc/config/rs6000/rs6000.h ! 1487812065b ./gcc/config/rs6000/rs6000.md 111710449b ./gcc/config/rs6000/rtems.h 2439652147b ./gcc/config/rs6000/softfloat.h 3703627966b ./gcc/config/rs6000/sol-ci.asm *************** *** 2602,2609 **** 1221714757b ./gcc/config/sparc/sp86x-elf.h 4023359087b ./gcc/config/sparc/sparc-protos.h 2169834781b ./gcc/config/sparc/sparc.c ! 3432806460b ./gcc/config/sparc/sparc.h ! 879790849b ./gcc/config/sparc/sparc.md 842964351b ./gcc/config/sparc/splet.h 952337645b ./gcc/config/sparc/sun4gas.h 1795303911b ./gcc/config/sparc/sun4o3.h --- 2602,2609 ---- 1221714757b ./gcc/config/sparc/sp86x-elf.h 4023359087b ./gcc/config/sparc/sparc-protos.h 2169834781b ./gcc/config/sparc/sparc.c ! 679741711b ./gcc/config/sparc/sparc.h ! 707642527b ./gcc/config/sparc/sparc.md 842964351b ./gcc/config/sparc/splet.h 952337645b ./gcc/config/sparc/sun4gas.h 1795303911b ./gcc/config/sparc/sun4o3.h *************** *** 2690,2698 **** 3617796239b ./gcc/config/xtensa/t-xtensa 2796950173b ./gcc/config/xtensa/xtensa-config.h 981915907b ./gcc/config/xtensa/xtensa-protos.h ! 1944987627b ./gcc/config/xtensa/xtensa.c ! 2453353978b ./gcc/config/xtensa/xtensa.h ! 830696041b ./gcc/config/xtensa/xtensa.md 2019129276b ./gcc/configure 2239237249b ./gcc/configure.frag 862560733b ./gcc/configure.in --- 2690,2698 ---- 3617796239b ./gcc/config/xtensa/t-xtensa 2796950173b ./gcc/config/xtensa/xtensa-config.h 981915907b ./gcc/config/xtensa/xtensa-protos.h ! 62812165b ./gcc/config/xtensa/xtensa.c ! 507316486b ./gcc/config/xtensa/xtensa.h ! 1348387747b ./gcc/config/xtensa/xtensa.md 2019129276b ./gcc/configure 2239237249b ./gcc/configure.frag 862560733b ./gcc/configure.in *************** *** 2700,2727 **** 2854418854b ./gcc/convert.c 2020855935b ./gcc/convert.h 1230086821b ./gcc/cp/.cvsignore ! 1023496053b ./gcc/cp/ChangeLog 2221404065b ./gcc/cp/ChangeLog.1 2127340768b ./gcc/cp/ChangeLog.2 2546444747b ./gcc/cp/ChangeLog.egcs 2368698010b ./gcc/cp/Make-lang.in 1710026913b ./gcc/cp/NEWS ! 211407592b ./gcc/cp/call.c 4115552602b ./gcc/cp/cfns.gperf 1705070232b ./gcc/cp/cfns.h ! 3828154577b ./gcc/cp/class.c 1309293181b ./gcc/cp/config-lang.in 4084279121b ./gcc/cp/cp-lang.c 2928114977b ./gcc/cp/cp-tree.def 3545021760b ./gcc/cp/cp-tree.h 67222431b ./gcc/cp/cvt.c ! 3933539524b ./gcc/cp/decl.c 3040950596b ./gcc/cp/decl.h ! 662263475b ./gcc/cp/decl2.c 1503739344b ./gcc/cp/dump.c ! 177845186b ./gcc/cp/error.c 197247511b ./gcc/cp/except.c ! 2612079645b ./gcc/cp/expr.c 728682437b ./gcc/cp/friend.c 1574667259b ./gcc/cp/g++.1 3180385434b ./gcc/cp/g++spec.c --- 2700,2727 ---- 2854418854b ./gcc/convert.c 2020855935b ./gcc/convert.h 1230086821b ./gcc/cp/.cvsignore ! 1795683420b ./gcc/cp/ChangeLog 2221404065b ./gcc/cp/ChangeLog.1 2127340768b ./gcc/cp/ChangeLog.2 2546444747b ./gcc/cp/ChangeLog.egcs 2368698010b ./gcc/cp/Make-lang.in 1710026913b ./gcc/cp/NEWS ! 2088201374b ./gcc/cp/call.c 4115552602b ./gcc/cp/cfns.gperf 1705070232b ./gcc/cp/cfns.h ! 596844565b ./gcc/cp/class.c 1309293181b ./gcc/cp/config-lang.in 4084279121b ./gcc/cp/cp-lang.c 2928114977b ./gcc/cp/cp-tree.def 3545021760b ./gcc/cp/cp-tree.h 67222431b ./gcc/cp/cvt.c ! 3585342875b ./gcc/cp/decl.c 3040950596b ./gcc/cp/decl.h ! 952368203b ./gcc/cp/decl2.c 1503739344b ./gcc/cp/dump.c ! 3569782164b ./gcc/cp/error.c 197247511b ./gcc/cp/except.c ! 516514444b ./gcc/cp/expr.c 728682437b ./gcc/cp/friend.c 1574667259b ./gcc/cp/g++.1 3180385434b ./gcc/cp/g++spec.c *************** *** 2736,2754 **** 4041177245b ./gcc/cp/mpw-make.sed 2349927434b ./gcc/cp/operators.def 622478745b ./gcc/cp/optimize.c ! 1765484930b ./gcc/cp/parse.c ! 3428647714b ./gcc/cp/parse.h 1544139953b ./gcc/cp/parse.y ! 1612002219b ./gcc/cp/pt.c 1408553642b ./gcc/cp/ptree.c 3993964584b ./gcc/cp/repo.c 2834061289b ./gcc/cp/rtti.c ! 161492685b ./gcc/cp/search.c 4064329742b ./gcc/cp/semantics.c 2648162646b ./gcc/cp/spew.c 3384697218b ./gcc/cp/tree.c 3946434476b ./gcc/cp/typeck.c ! 1284974262b ./gcc/cp/typeck2.c 1602205564b ./gcc/cppdefault.c 733799898b ./gcc/cppdefault.h 3582099799b ./gcc/cpperror.c --- 2736,2754 ---- 4041177245b ./gcc/cp/mpw-make.sed 2349927434b ./gcc/cp/operators.def 622478745b ./gcc/cp/optimize.c ! 230679025b ./gcc/cp/parse.c ! 586236678b ./gcc/cp/parse.h 1544139953b ./gcc/cp/parse.y ! 534531070b ./gcc/cp/pt.c 1408553642b ./gcc/cp/ptree.c 3993964584b ./gcc/cp/repo.c 2834061289b ./gcc/cp/rtti.c ! 1987668761b ./gcc/cp/search.c 4064329742b ./gcc/cp/semantics.c 2648162646b ./gcc/cp/spew.c 3384697218b ./gcc/cp/tree.c 3946434476b ./gcc/cp/typeck.c ! 3217357018b ./gcc/cp/typeck2.c 1602205564b ./gcc/cppdefault.c 733799898b ./gcc/cppdefault.h 3582099799b ./gcc/cpperror.c *************** *** 2789,2816 **** 3399730921b ./gcc/doc/configterms.texi 2163122922b ./gcc/doc/contrib.texi 2272556046b ./gcc/doc/contribute.texi ! 3074111847b ./gcc/doc/cpp.1 3543132597b ./gcc/doc/cpp.texi 1838233798b ./gcc/doc/cppenv.texi 1958814700b ./gcc/doc/cppinternals.texi 685869710b ./gcc/doc/cppopts.texi ! 1477628931b ./gcc/doc/extend.texi 2634996326b ./gcc/doc/fragments.texi 600815516b ./gcc/doc/frontends.texi ! 3214630123b ./gcc/doc/fsf-funding.7 ! 2397612846b ./gcc/doc/gcc.1 2344693999b ./gcc/doc/gcc.texi 926520134b ./gcc/doc/gccint.texi ! 2862847340b ./gcc/doc/gcov.1 2529603660b ./gcc/doc/gcov.texi ! 261077961b ./gcc/doc/gfdl.7 4217859569b ./gcc/doc/gnu.texi ! 1420728298b ./gcc/doc/gpl.7 2632697239b ./gcc/doc/headerdirs.texi 1425599017b ./gcc/doc/hostconfig.texi 1232987106b ./gcc/doc/include/fdl.texi 2048065465b ./gcc/doc/include/funding.texi ! 1759928844b ./gcc/doc/include/gcc-common.texi 1416455933b ./gcc/doc/include/gpl.texi 3627483023b ./gcc/doc/include/texinfo.tex 4219640220b ./gcc/doc/install-old.texi --- 2789,2871 ---- 3399730921b ./gcc/doc/configterms.texi 2163122922b ./gcc/doc/contrib.texi 2272556046b ./gcc/doc/contribute.texi ! 1535227762b ./gcc/doc/cpp.1 ! 1544384634b ./gcc/doc/cpp.info ! 757073472b ./gcc/doc/cpp.info-1 ! 3446855226b ./gcc/doc/cpp.info-2 ! 636644590b ./gcc/doc/cpp.info-3 ! 3499936017b ./gcc/doc/cpp.info-4 ! 3675380875b ./gcc/doc/cpp.info-5 3543132597b ./gcc/doc/cpp.texi 1838233798b ./gcc/doc/cppenv.texi + 1685544580b ./gcc/doc/cppinternals.info 1958814700b ./gcc/doc/cppinternals.texi 685869710b ./gcc/doc/cppopts.texi ! 3004272717b ./gcc/doc/extend.texi 2634996326b ./gcc/doc/fragments.texi 600815516b ./gcc/doc/frontends.texi ! 3256871866b ./gcc/doc/fsf-funding.7 ! 2658060989b ./gcc/doc/gcc.1 ! 4148415874b ./gcc/doc/gcc.info ! 1053864515b ./gcc/doc/gcc.info-1 ! 4294678088b ./gcc/doc/gcc.info-10 ! 1344046739b ./gcc/doc/gcc.info-11 ! 451582535b ./gcc/doc/gcc.info-12 ! 4084131178b ./gcc/doc/gcc.info-13 ! 1824645699b ./gcc/doc/gcc.info-14 ! 1310951679b ./gcc/doc/gcc.info-15 ! 3633708433b ./gcc/doc/gcc.info-16 ! 2461331410b ./gcc/doc/gcc.info-17 ! 4272216147b ./gcc/doc/gcc.info-18 ! 3012752365b ./gcc/doc/gcc.info-19 ! 2218006986b ./gcc/doc/gcc.info-2 ! 1322735281b ./gcc/doc/gcc.info-20 ! 471346850b ./gcc/doc/gcc.info-21 ! 2053165308b ./gcc/doc/gcc.info-22 ! 3102591020b ./gcc/doc/gcc.info-23 ! 2266643536b ./gcc/doc/gcc.info-3 ! 383482857b ./gcc/doc/gcc.info-4 ! 2120276990b ./gcc/doc/gcc.info-5 ! 2474168124b ./gcc/doc/gcc.info-6 ! 521005660b ./gcc/doc/gcc.info-7 ! 686614003b ./gcc/doc/gcc.info-8 ! 396552069b ./gcc/doc/gcc.info-9 2344693999b ./gcc/doc/gcc.texi + 1868552664b ./gcc/doc/gccint.info + 1364694741b ./gcc/doc/gccint.info-1 + 618166170b ./gcc/doc/gccint.info-10 + 3363182873b ./gcc/doc/gccint.info-11 + 301752520b ./gcc/doc/gccint.info-12 + 4149939712b ./gcc/doc/gccint.info-13 + 949510653b ./gcc/doc/gccint.info-14 + 1642518230b ./gcc/doc/gccint.info-15 + 2069563881b ./gcc/doc/gccint.info-16 + 925078439b ./gcc/doc/gccint.info-17 + 3695438277b ./gcc/doc/gccint.info-18 + 2272377258b ./gcc/doc/gccint.info-19 + 561325731b ./gcc/doc/gccint.info-2 + 3982078308b ./gcc/doc/gccint.info-20 + 3867221700b ./gcc/doc/gccint.info-21 + 3280571445b ./gcc/doc/gccint.info-22 + 2008468483b ./gcc/doc/gccint.info-23 + 797617646b ./gcc/doc/gccint.info-3 + 1305326084b ./gcc/doc/gccint.info-4 + 348735569b ./gcc/doc/gccint.info-5 + 1160338029b ./gcc/doc/gccint.info-6 + 508232037b ./gcc/doc/gccint.info-7 + 3871253182b ./gcc/doc/gccint.info-8 + 976972282b ./gcc/doc/gccint.info-9 926520134b ./gcc/doc/gccint.texi ! 1397513510b ./gcc/doc/gcov.1 2529603660b ./gcc/doc/gcov.texi ! 642118932b ./gcc/doc/gfdl.7 4217859569b ./gcc/doc/gnu.texi ! 422936980b ./gcc/doc/gpl.7 2632697239b ./gcc/doc/headerdirs.texi 1425599017b ./gcc/doc/hostconfig.texi 1232987106b ./gcc/doc/include/fdl.texi 2048065465b ./gcc/doc/include/funding.texi ! 587916905b ./gcc/doc/include/gcc-common.texi 1416455933b ./gcc/doc/include/gpl.texi 3627483023b ./gcc/doc/include/texinfo.tex 4219640220b ./gcc/doc/install-old.texi *************** *** 2822,2828 **** 409601074b ./gcc/doc/makefile.texi 647485435b ./gcc/doc/md.texi 2014418726b ./gcc/doc/objc.texi ! 3181886502b ./gcc/doc/passes.texi 2247614285b ./gcc/doc/portability.texi 2576532070b ./gcc/doc/rtl.texi 3603168219b ./gcc/doc/service.texi --- 2877,2883 ---- 409601074b ./gcc/doc/makefile.texi 647485435b ./gcc/doc/md.texi 2014418726b ./gcc/doc/objc.texi ! 1074700556b ./gcc/doc/passes.texi 2247614285b ./gcc/doc/portability.texi 2576532070b ./gcc/doc/rtl.texi 3603168219b ./gcc/doc/service.texi *************** *** 2838,2844 **** 2184520814b ./gcc/dwarf2.h 31829346b ./gcc/dwarf2asm.c 2077057275b ./gcc/dwarf2asm.h ! 3548213262b ./gcc/dwarf2out.c 1010158138b ./gcc/dwarf2out.h 3359840971b ./gcc/dwarfout.c 3336789552b ./gcc/emit-rtl.c --- 2893,2899 ---- 2184520814b ./gcc/dwarf2.h 31829346b ./gcc/dwarf2asm.c 2077057275b ./gcc/dwarf2asm.h ! 1918216770b ./gcc/dwarf2out.c 1010158138b ./gcc/dwarf2out.h 3359840971b ./gcc/dwarfout.c 3336789552b ./gcc/emit-rtl.c *************** *** 2849,2862 **** 2826708782b ./gcc/except.h 908040152b ./gcc/explow.c 1156766543b ./gcc/expmed.c ! 1153850684b ./gcc/expr.c 980675150b ./gcc/expr.h 1546791101b ./gcc/f/.cvsignore ! 3780604014b ./gcc/f/BUGS ! 557093981b ./gcc/f/ChangeLog 4225493150b ./gcc/f/ChangeLog.0 2403016299b ./gcc/f/Make-lang.in ! 4068129251b ./gcc/f/NEWS 281424983b ./gcc/f/README 3295584012b ./gcc/f/RELEASE-PREP 1934744031b ./gcc/f/ansify.c --- 2904,2917 ---- 2826708782b ./gcc/except.h 908040152b ./gcc/explow.c 1156766543b ./gcc/expmed.c ! 1064280766b ./gcc/expr.c 980675150b ./gcc/expr.h 1546791101b ./gcc/f/.cvsignore ! 2016181825b ./gcc/f/BUGS ! 2146318605b ./gcc/f/ChangeLog 4225493150b ./gcc/f/ChangeLog.0 2403016299b ./gcc/f/Make-lang.in ! 3908583628b ./gcc/f/NEWS 281424983b ./gcc/f/README 3295584012b ./gcc/f/RELEASE-PREP 1934744031b ./gcc/f/ansify.c *************** *** 2882,2888 **** 417834755b ./gcc/f/expr.h 2351117682b ./gcc/f/ffe.texi 782070966b ./gcc/f/fini.c ! 2403387907b ./gcc/f/g77.1 3054392079b ./gcc/f/g77.texi 2824974536b ./gcc/f/g77spec.c 4062822261b ./gcc/f/global.c --- 2937,2965 ---- 417834755b ./gcc/f/expr.h 2351117682b ./gcc/f/ffe.texi 782070966b ./gcc/f/fini.c ! 1751461796b ./gcc/f/g77.1 ! 3841913874b ./gcc/f/g77.info ! 2480007383b ./gcc/f/g77.info-1 ! 2368693530b ./gcc/f/g77.info-10 ! 1452968741b ./gcc/f/g77.info-11 ! 4253343420b ./gcc/f/g77.info-12 ! 1335253876b ./gcc/f/g77.info-13 ! 1460006442b ./gcc/f/g77.info-14 ! 735239497b ./gcc/f/g77.info-15 ! 4083034865b ./gcc/f/g77.info-16 ! 12335273b ./gcc/f/g77.info-17 ! 2200796034b ./gcc/f/g77.info-18 ! 671514182b ./gcc/f/g77.info-19 ! 1680815922b ./gcc/f/g77.info-2 ! 2044269147b ./gcc/f/g77.info-20 ! 863778320b ./gcc/f/g77.info-21 ! 3183619273b ./gcc/f/g77.info-3 ! 79160293b ./gcc/f/g77.info-4 ! 390737386b ./gcc/f/g77.info-5 ! 1607363995b ./gcc/f/g77.info-6 ! 2946328607b ./gcc/f/g77.info-7 ! 102401303b ./gcc/f/g77.info-8 ! 4260619545b ./gcc/f/g77.info-9 3054392079b ./gcc/f/g77.texi 2824974536b ./gcc/f/g77spec.c 4062822261b ./gcc/f/global.c *************** *** 2915,2921 **** 3453379674b ./gcc/f/news0.texi 2696377463b ./gcc/f/parse.c 1067232252b ./gcc/f/proj.h ! 2334980185b ./gcc/f/root.texi 3531682397b ./gcc/f/src.c 246620254b ./gcc/f/src.h 3466162958b ./gcc/f/st.c --- 2992,2998 ---- 3453379674b ./gcc/f/news0.texi 2696377463b ./gcc/f/parse.c 1067232252b ./gcc/f/proj.h ! 2321878455b ./gcc/f/root.texi 3531682397b ./gcc/f/src.c 246620254b ./gcc/f/src.h 3466162958b ./gcc/f/st.c *************** *** 2962,2968 **** 2232338664b ./gcc/f/top.h 3443401298b ./gcc/f/type.c 2499934202b ./gcc/f/type.h ! 1209796418b ./gcc/f/version.c 1781447679b ./gcc/f/version.h 3584291506b ./gcc/f/where.c 819940437b ./gcc/f/where.h --- 3039,3045 ---- 2232338664b ./gcc/f/top.h 3443401298b ./gcc/f/type.c 2499934202b ./gcc/f/type.h ! 1303748387b ./gcc/f/version.c 1781447679b ./gcc/f/version.h 3584291506b ./gcc/f/where.c 819940437b ./gcc/f/where.h *************** *** 2973,2979 **** 2894614091b ./gcc/fixinc/check.tpl 697597425b ./gcc/fixinc/fixfixes.c 3110054233b ./gcc/fixinc/fixinc.dgux ! 15758129b ./gcc/fixinc/fixinc.interix 1474597097b ./gcc/fixinc/fixinc.ptx 1901674452b ./gcc/fixinc/fixinc.svr4 2193207840b ./gcc/fixinc/fixinc.winnt --- 3050,3056 ---- 2894614091b ./gcc/fixinc/check.tpl 697597425b ./gcc/fixinc/fixfixes.c 3110054233b ./gcc/fixinc/fixinc.dgux ! 125459277b ./gcc/fixinc/fixinc.interix 1474597097b ./gcc/fixinc/fixinc.ptx 1901674452b ./gcc/fixinc/fixinc.svr4 2193207840b ./gcc/fixinc/fixinc.winnt *************** *** 2981,2994 **** 1824978333b ./gcc/fixinc/fixincl.c 4214658264b ./gcc/fixinc/fixincl.sh 2178021789b ./gcc/fixinc/fixincl.tpl ! 3312009046b ./gcc/fixinc/fixincl.x 1372603529b ./gcc/fixinc/fixlib.c 971233728b ./gcc/fixinc/fixlib.h 4013194329b ./gcc/fixinc/fixtests.c 2003329934b ./gcc/fixinc/genfixes 605191257b ./gcc/fixinc/gnu-regex.c 1403987073b ./gcc/fixinc/gnu-regex.h ! 2194272133b ./gcc/fixinc/inclhack.def 3327140809b ./gcc/fixinc/mkfixinc.sh 1834585069b ./gcc/fixinc/procopen.c 1750379031b ./gcc/fixinc/server.c --- 3058,3071 ---- 1824978333b ./gcc/fixinc/fixincl.c 4214658264b ./gcc/fixinc/fixincl.sh 2178021789b ./gcc/fixinc/fixincl.tpl ! 2557317697b ./gcc/fixinc/fixincl.x 1372603529b ./gcc/fixinc/fixlib.c 971233728b ./gcc/fixinc/fixlib.h 4013194329b ./gcc/fixinc/fixtests.c 2003329934b ./gcc/fixinc/genfixes 605191257b ./gcc/fixinc/gnu-regex.c 1403987073b ./gcc/fixinc/gnu-regex.h ! 3231767803b ./gcc/fixinc/inclhack.def 3327140809b ./gcc/fixinc/mkfixinc.sh 1834585069b ./gcc/fixinc/procopen.c 1750379031b ./gcc/fixinc/server.c *************** *** 3006,3015 **** --- 3083,3095 ---- 3220984809b ./gcc/fixinc/tests/base/bsd/libc.h 1799847368b ./gcc/fixinc/tests/base/c_asm.h 2725396384b ./gcc/fixinc/tests/base/ctrl-quotes-def-1.h + 192637121b ./gcc/fixinc/tests/base/ctype.h 3049981119b ./gcc/fixinc/tests/base/curses.h 2909636960b ./gcc/fixinc/tests/base/fcntl.h 3901972537b ./gcc/fixinc/tests/base/fixinc-test-limits.h 4150745363b ./gcc/fixinc/tests/base/hsfs/hsfs_spec.h + 1298358958b ./gcc/fixinc/tests/base/internal/sgimacros.h + 2484816269b ./gcc/fixinc/tests/base/internal/wchar_core.h 2118846136b ./gcc/fixinc/tests/base/inttypes.h 92918392b ./gcc/fixinc/tests/base/io-quotes-def-1.h 2670651204b ./gcc/fixinc/tests/base/libgen.h *************** *** 3019,3025 **** 2373596333b ./gcc/fixinc/tests/base/netdnet/dnetdb.h 4211518276b ./gcc/fixinc/tests/base/netinet/ip.h 3107111098b ./gcc/fixinc/tests/base/pixrect/memvar.h ! 634408265b ./gcc/fixinc/tests/base/pthread.h 351364386b ./gcc/fixinc/tests/base/reg_types.h 2876721819b ./gcc/fixinc/tests/base/regex.h 2249464053b ./gcc/fixinc/tests/base/rpc/auth.h --- 3099,3105 ---- 2373596333b ./gcc/fixinc/tests/base/netdnet/dnetdb.h 4211518276b ./gcc/fixinc/tests/base/netinet/ip.h 3107111098b ./gcc/fixinc/tests/base/pixrect/memvar.h ! 372953949b ./gcc/fixinc/tests/base/pthread.h 351364386b ./gcc/fixinc/tests/base/reg_types.h 2876721819b ./gcc/fixinc/tests/base/regex.h 2249464053b ./gcc/fixinc/tests/base/rpc/auth.h *************** *** 3031,3037 **** 135186565b ./gcc/fixinc/tests/base/sparc/asm_linkage.h 1583769396b ./gcc/fixinc/tests/base/stdio.h 1529509815b ./gcc/fixinc/tests/base/stdio_tag.h ! 135522837b ./gcc/fixinc/tests/base/stdlib.h 2907849084b ./gcc/fixinc/tests/base/strings.h 482468002b ./gcc/fixinc/tests/base/sundev/vuid_event.h 1807434691b ./gcc/fixinc/tests/base/sunwindow/win_lock.h --- 3111,3117 ---- 135186565b ./gcc/fixinc/tests/base/sparc/asm_linkage.h 1583769396b ./gcc/fixinc/tests/base/stdio.h 1529509815b ./gcc/fixinc/tests/base/stdio_tag.h ! 3122205252b ./gcc/fixinc/tests/base/stdlib.h 2907849084b ./gcc/fixinc/tests/base/strings.h 482468002b ./gcc/fixinc/tests/base/sundev/vuid_event.h 1807434691b ./gcc/fixinc/tests/base/sunwindow/win_lock.h *************** *** 3046,3053 **** 1230050207b ./gcc/fixinc/tests/base/sys/mman.h 3800154687b ./gcc/fixinc/tests/base/sys/param.h 3041640682b ./gcc/fixinc/tests/base/sys/signal.h 2450632911b ./gcc/fixinc/tests/base/sys/spinlock.h ! 711604668b ./gcc/fixinc/tests/base/sys/stat.h 2422167059b ./gcc/fixinc/tests/base/sys/time.h 2994886866b ./gcc/fixinc/tests/base/sys/times.h 1174710562b ./gcc/fixinc/tests/base/sys/types.h --- 3126,3134 ---- 1230050207b ./gcc/fixinc/tests/base/sys/mman.h 3800154687b ./gcc/fixinc/tests/base/sys/param.h 3041640682b ./gcc/fixinc/tests/base/sys/signal.h + 85483121b ./gcc/fixinc/tests/base/sys/socket.h 2450632911b ./gcc/fixinc/tests/base/sys/spinlock.h ! 2880344765b ./gcc/fixinc/tests/base/sys/stat.h 2422167059b ./gcc/fixinc/tests/base/sys/time.h 2994886866b ./gcc/fixinc/tests/base/sys/times.h 1174710562b ./gcc/fixinc/tests/base/sys/types.h *************** *** 3063,3071 **** 3658835587b ./gcc/flags.h 1465737068b ./gcc/floatlib.c 959822363b ./gcc/flow.c ! 2192581144b ./gcc/fold-const.c 3820449811b ./gcc/fp-test.c ! 2059019769b ./gcc/function.c 316231375b ./gcc/function.h 3058774034b ./gcc/future.options 1214866690b ./gcc/gbl-ctors.h --- 3144,3152 ---- 3658835587b ./gcc/flags.h 1465737068b ./gcc/floatlib.c 959822363b ./gcc/flow.c ! 3465354917b ./gcc/fold-const.c 3820449811b ./gcc/fp-test.c ! 1394029795b ./gcc/function.c 316231375b ./gcc/function.h 3058774034b ./gcc/future.options 1214866690b ./gcc/gbl-ctors.h *************** *** 3076,3082 **** 3633749318b ./gcc/gccspec.c 4197147799b ./gcc/gcov-io.h 3825112355b ./gcc/gcov.c ! 1895463511b ./gcc/gcse.c 802469235b ./gcc/gdbinit.in 4293398944b ./gcc/gen-protos.c 3638083387b ./gcc/genattr.c --- 3157,3163 ---- 3633749318b ./gcc/gccspec.c 4197147799b ./gcc/gcov-io.h 3825112355b ./gcc/gcov.c ! 1524721645b ./gcc/gcse.c 802469235b ./gcc/gdbinit.in 4293398944b ./gcc/gen-protos.c 3638083387b ./gcc/genattr.c *************** *** 3136,3149 **** 3796251430b ./gcc/hooks.c 779103435b ./gcc/hooks.h 519586985b ./gcc/hwint.h ! 3563549730b ./gcc/ifcvt.c 3686080794b ./gcc/input.h 2324132584b ./gcc/insn-addr.h 3301445102b ./gcc/integrate.c 1320722832b ./gcc/integrate.h 3277280645b ./gcc/intl.c 2379664116b ./gcc/intl.h ! 3589497609b ./gcc/intl/ChangeLog 680616337b ./gcc/intl/Makefile.in 1166279255b ./gcc/intl/VERSION 3847321727b ./gcc/intl/bindtextdom.c --- 3217,3230 ---- 3796251430b ./gcc/hooks.c 779103435b ./gcc/hooks.h 519586985b ./gcc/hwint.h ! 2453090619b ./gcc/ifcvt.c 3686080794b ./gcc/input.h 2324132584b ./gcc/insn-addr.h 3301445102b ./gcc/integrate.c 1320722832b ./gcc/integrate.h 3277280645b ./gcc/intl.c 2379664116b ./gcc/intl.h ! 1081445972b ./gcc/intl/ChangeLog 680616337b ./gcc/intl/Makefile.in 1166279255b ./gcc/intl/VERSION 3847321727b ./gcc/intl/bindtextdom.c *************** *** 3175,3181 **** 1121743739b ./gcc/intl/ref-del.sin 1971238900b ./gcc/intl/textdomain.c 503022028b ./gcc/java/.cvsignore ! 94505238b ./gcc/java/ChangeLog 3840961705b ./gcc/java/Make-lang.in 1752055498b ./gcc/java/boehm.c 3814965188b ./gcc/java/buffer.c --- 3256,3262 ---- 1121743739b ./gcc/intl/ref-del.sin 1971238900b ./gcc/intl/textdomain.c 503022028b ./gcc/java/.cvsignore ! 308773326b ./gcc/java/ChangeLog 3840961705b ./gcc/java/Make-lang.in 1752055498b ./gcc/java/boehm.c 3814965188b ./gcc/java/buffer.c *************** *** 3190,3200 **** 698834578b ./gcc/java/decl.c 1301173842b ./gcc/java/except.c 1888306202b ./gcc/java/expr.c ! 1826575023b ./gcc/java/gcj.1 ! 2122686942b ./gcc/java/gcj.texi ! 919789269b ./gcc/java/gcjh.1 533046670b ./gcc/java/gen-table.pl ! 831837047b ./gcc/java/gij.1 2862690686b ./gcc/java/gjavah.c 1545050516b ./gcc/java/java-except.h 1953641142b ./gcc/java/java-opcodes.h --- 3271,3284 ---- 698834578b ./gcc/java/decl.c 1301173842b ./gcc/java/except.c 1888306202b ./gcc/java/expr.c ! 867039953b ./gcc/java/gcj.1 ! 1220042288b ./gcc/java/gcj.info ! 580198789b ./gcc/java/gcj.info-1 ! 1591575875b ./gcc/java/gcj.info-2 ! 2232106844b ./gcc/java/gcj.texi ! 2313957134b ./gcc/java/gcjh.1 533046670b ./gcc/java/gen-table.pl ! 2558615881b ./gcc/java/gij.1 2862690686b ./gcc/java/gjavah.c 1545050516b ./gcc/java/java-except.h 1953641142b ./gcc/java/java-opcodes.h *************** *** 3203,3209 **** 2538410445b ./gcc/java/javaop.def 872575611b ./gcc/java/javaop.h 1618392854b ./gcc/java/jcf-depend.c ! 2109340318b ./gcc/java/jcf-dump.1 1347786459b ./gcc/java/jcf-dump.c 370700983b ./gcc/java/jcf-io.c 981094631b ./gcc/java/jcf-parse.c --- 3287,3293 ---- 2538410445b ./gcc/java/javaop.def 872575611b ./gcc/java/javaop.h 1618392854b ./gcc/java/jcf-depend.c ! 3138781441b ./gcc/java/jcf-dump.1 1347786459b ./gcc/java/jcf-dump.c 370700983b ./gcc/java/jcf-io.c 981094631b ./gcc/java/jcf-parse.c *************** *** 3211,3218 **** 3070824570b ./gcc/java/jcf-reader.c 3086938723b ./gcc/java/jcf-write.c 921328820b ./gcc/java/jcf.h ! 453061584b ./gcc/java/jv-convert.1 ! 622445440b ./gcc/java/jv-scan.1 3491242747b ./gcc/java/jv-scan.c 3805988298b ./gcc/java/jvgenmain.c 686969605b ./gcc/java/jvspec.c --- 3295,3302 ---- 3070824570b ./gcc/java/jcf-reader.c 3086938723b ./gcc/java/jcf-write.c 921328820b ./gcc/java/jcf.h ! 1315261195b ./gcc/java/jv-convert.1 ! 2401697144b ./gcc/java/jv-scan.1 3491242747b ./gcc/java/jv-scan.c 3805988298b ./gcc/java/jvgenmain.c 686969605b ./gcc/java/jvspec.c *************** *** 3225,3244 **** 1057768549b ./gcc/java/lex.h 1290236487b ./gcc/java/mangle.c 624686086b ./gcc/java/mangle_name.c ! 1720459878b ./gcc/java/parse-scan.c 578153036b ./gcc/java/parse-scan.y ! 3319744662b ./gcc/java/parse.c 924019294b ./gcc/java/parse.h ! 2763518333b ./gcc/java/parse.y ! 3063299109b ./gcc/java/rmic.1 ! 2868759624b ./gcc/java/rmiregistry.1 2066605666b ./gcc/java/typeck.c 173829162b ./gcc/java/verify.c 3207437983b ./gcc/java/xref.c 3070080051b ./gcc/java/xref.h 2742723736b ./gcc/java/zextract.c 1459175152b ./gcc/java/zipfile.h ! 235531345b ./gcc/jump.c 1885354315b ./gcc/langhooks-def.h 4163847594b ./gcc/langhooks.c 718654791b ./gcc/langhooks.h --- 3309,3328 ---- 1057768549b ./gcc/java/lex.h 1290236487b ./gcc/java/mangle.c 624686086b ./gcc/java/mangle_name.c ! 2212453332b ./gcc/java/parse-scan.c 578153036b ./gcc/java/parse-scan.y ! 3918875946b ./gcc/java/parse.c 924019294b ./gcc/java/parse.h ! 2160466893b ./gcc/java/parse.y ! 241511114b ./gcc/java/rmic.1 ! 3124361170b ./gcc/java/rmiregistry.1 2066605666b ./gcc/java/typeck.c 173829162b ./gcc/java/verify.c 3207437983b ./gcc/java/xref.c 3070080051b ./gcc/java/xref.h 2742723736b ./gcc/java/zextract.c 1459175152b ./gcc/java/zipfile.h ! 2200195809b ./gcc/jump.c 1885354315b ./gcc/langhooks-def.h 4163847594b ./gcc/langhooks.c 718654791b ./gcc/langhooks.h *************** *** 3280,3286 **** 3712044081b ./gcc/objc/objc-act.c 2554922770b ./gcc/objc/objc-act.h 2534517289b ./gcc/objc/objc-lang.c ! 3629705469b ./gcc/objc/objc-parse.c 1805259703b ./gcc/objc/objc-parse.y 688475759b ./gcc/objc/objc-tree.def 4077044196b ./gcc/optabs.c --- 3364,3370 ---- 3712044081b ./gcc/objc/objc-act.c 2554922770b ./gcc/objc/objc-act.h 2534517289b ./gcc/objc/objc-lang.c ! 1958451116b ./gcc/objc/objc-parse.c 1805259703b ./gcc/objc/objc-parse.y 688475759b ./gcc/objc/objc-tree.def 4077044196b ./gcc/optabs.c *************** *** 3289,3295 **** 1911824904b ./gcc/params.c 2474575794b ./gcc/params.def 840880994b ./gcc/params.h ! 2082043896b ./gcc/po/ChangeLog 4281232887b ./gcc/po/EXCLUDES 275286308b ./gcc/po/da.gmo 276047898b ./gcc/po/da.po --- 3373,3379 ---- 1911824904b ./gcc/params.c 2474575794b ./gcc/params.def 840880994b ./gcc/params.h ! 3997221312b ./gcc/po/ChangeLog 4281232887b ./gcc/po/EXCLUDES 275286308b ./gcc/po/da.gmo 276047898b ./gcc/po/da.po *************** *** 3309,3315 **** 1330626989b ./gcc/po/sv.po 866561722b ./gcc/po/tr.gmo 3345738807b ./gcc/po/tr.po ! 1839892656b ./gcc/predict.c 1371462395b ./gcc/predict.def 204342296b ./gcc/predict.h 542352850b ./gcc/prefix.c --- 3393,3399 ---- 1330626989b ./gcc/po/sv.po 866561722b ./gcc/po/tr.gmo 3345738807b ./gcc/po/tr.po ! 3161983355b ./gcc/predict.c 1371462395b ./gcc/predict.def 204342296b ./gcc/predict.h 542352850b ./gcc/prefix.c *************** *** 3319,3336 **** 2666623009b ./gcc/profile.c 1610870410b ./gcc/protoize.c 2723074973b ./gcc/read-rtl.c ! 2962281463b ./gcc/real.c 2885483337b ./gcc/real.h 1758079687b ./gcc/recog.c 2056680576b ./gcc/recog.h 3611458427b ./gcc/reg-stack.c 57810796b ./gcc/regclass.c ! 3586182830b ./gcc/regmove.c 113125100b ./gcc/regrename.c 3100477763b ./gcc/regs.h ! 55889624b ./gcc/reload.c 834085082b ./gcc/reload.h ! 664936410b ./gcc/reload1.c 4167441145b ./gcc/reorg.c 2715704724b ./gcc/resource.c 2605579460b ./gcc/resource.h --- 3403,3420 ---- 2666623009b ./gcc/profile.c 1610870410b ./gcc/protoize.c 2723074973b ./gcc/read-rtl.c ! 17316212b ./gcc/real.c 2885483337b ./gcc/real.h 1758079687b ./gcc/recog.c 2056680576b ./gcc/recog.h 3611458427b ./gcc/reg-stack.c 57810796b ./gcc/regclass.c ! 2157731750b ./gcc/regmove.c 113125100b ./gcc/regrename.c 3100477763b ./gcc/regs.h ! 3794134282b ./gcc/reload.c 834085082b ./gcc/reload.h ! 1807817122b ./gcc/reload1.c 4167441145b ./gcc/reorg.c 2715704724b ./gcc/resource.c 2605579460b ./gcc/resource.h *************** *** 3353,3359 **** 3014933100b ./gcc/sdbout.c 1391855772b ./gcc/sdbout.h 2225673670b ./gcc/sibcall.c ! 63942362b ./gcc/simplify-rtx.c 3345261950b ./gcc/sort-protos 3407562807b ./gcc/ssa-ccp.c 2078369101b ./gcc/ssa-dce.c --- 3437,3443 ---- 3014933100b ./gcc/sdbout.c 1391855772b ./gcc/sdbout.h 2225673670b ./gcc/sibcall.c ! 2715461417b ./gcc/simplify-rtx.c 3345261950b ./gcc/sort-protos 3407562807b ./gcc/ssa-ccp.c 2078369101b ./gcc/ssa-dce.c *************** *** 3361,3375 **** 332547863b ./gcc/ssa.h 2395322097b ./gcc/stab.def 471587796b ./gcc/stack.h ! 958722845b ./gcc/stmt.c 2592810543b ./gcc/stor-layout.c 3515875777b ./gcc/stringpool.c 567176141b ./gcc/sys-protos.h 482558466b ./gcc/sys-types.h ! 1242992540b ./gcc/system.h 293723253b ./gcc/target-def.h 4078089769b ./gcc/target.h ! 3879441548b ./gcc/testsuite/ChangeLog 986418331b ./gcc/testsuite/README 4258789052b ./gcc/testsuite/README.g++ 174183124b ./gcc/testsuite/README.gcc --- 3445,3459 ---- 332547863b ./gcc/ssa.h 2395322097b ./gcc/stab.def 471587796b ./gcc/stack.h ! 114049826b ./gcc/stmt.c 2592810543b ./gcc/stor-layout.c 3515875777b ./gcc/stringpool.c 567176141b ./gcc/sys-protos.h 482558466b ./gcc/sys-types.h ! 524381800b ./gcc/system.h 293723253b ./gcc/target-def.h 4078089769b ./gcc/target.h ! 2721909951b ./gcc/testsuite/ChangeLog 986418331b ./gcc/testsuite/README 4258789052b ./gcc/testsuite/README.g++ 174183124b ./gcc/testsuite/README.gcc *************** *** 5101,5106 **** --- 5185,5191 ---- 3028501104b ./gcc/testsuite/g++.dg/ext/typeof1.C 2139267109b ./gcc/testsuite/g++.dg/ext/typeof2.C 4011489903b ./gcc/testsuite/g++.dg/ext/typeof3.C + 3374727940b ./gcc/testsuite/g++.dg/ext/typeof4.C 3384117993b ./gcc/testsuite/g++.dg/ext/vla1.C 4261072225b ./gcc/testsuite/g++.dg/ext/vlm1.C 546216042b ./gcc/testsuite/g++.dg/ext/vlm2.C *************** *** 5157,5162 **** --- 5242,5249 ---- 1496969096b ./gcc/testsuite/g++.dg/opt/ptrintsum1.C 571185401b ./gcc/testsuite/g++.dg/opt/reg-stack.C 1557651694b ./gcc/testsuite/g++.dg/opt/reload1.C + 2822399311b ./gcc/testsuite/g++.dg/opt/reload2.C + 2874679179b ./gcc/testsuite/g++.dg/opt/rtti1.C 1124740865b ./gcc/testsuite/g++.dg/opt/static1.C 684782459b ./gcc/testsuite/g++.dg/opt/static2.C 4154721541b ./gcc/testsuite/g++.dg/opt/thunk1.C *************** *** 5186,5192 **** 2096815409b ./gcc/testsuite/g++.dg/other/init1.C 2028368016b ./gcc/testsuite/g++.dg/other/init2.C 2143945221b ./gcc/testsuite/g++.dg/other/linkage1.C ! 2384288796b ./gcc/testsuite/g++.dg/other/pragma-ep-1.C 198088036b ./gcc/testsuite/g++.dg/other/pragma-re-1.C 1453288357b ./gcc/testsuite/g++.dg/other/ptrmem1.C 392352692b ./gcc/testsuite/g++.dg/other/ptrmem2.C --- 5273,5279 ---- 2096815409b ./gcc/testsuite/g++.dg/other/init1.C 2028368016b ./gcc/testsuite/g++.dg/other/init2.C 2143945221b ./gcc/testsuite/g++.dg/other/linkage1.C ! 1073045139b ./gcc/testsuite/g++.dg/other/pragma-ep-1.C 198088036b ./gcc/testsuite/g++.dg/other/pragma-re-1.C 1453288357b ./gcc/testsuite/g++.dg/other/ptrmem1.C 392352692b ./gcc/testsuite/g++.dg/other/ptrmem2.C *************** *** 5231,5236 **** --- 5318,5324 ---- 184359799b ./gcc/testsuite/g++.dg/template/dtor1.C 1161800603b ./gcc/testsuite/g++.dg/template/explicit-instantiation.C 3595433718b ./gcc/testsuite/g++.dg/template/friend.C + 2661209683b ./gcc/testsuite/g++.dg/template/friend16.C 3302501697b ./gcc/testsuite/g++.dg/template/friend3.C 587931705b ./gcc/testsuite/g++.dg/template/friend4.C 3560434139b ./gcc/testsuite/g++.dg/template/friend5.C *************** *** 5272,5277 **** --- 5360,5367 ---- 1028564434b ./gcc/testsuite/g++.dg/template/sizeof1.C 2914549620b ./gcc/testsuite/g++.dg/template/spec1.C 2378483146b ./gcc/testsuite/g++.dg/template/spec2.C + 177374413b ./gcc/testsuite/g++.dg/template/spec7.C + 3516934395b ./gcc/testsuite/g++.dg/template/spec8.C 3770294113b ./gcc/testsuite/g++.dg/template/static1.C 2876903140b ./gcc/testsuite/g++.dg/template/static2.C 1689207326b ./gcc/testsuite/g++.dg/template/strlen1.C *************** *** 5300,5305 **** --- 5390,5396 ---- 1455133800b ./gcc/testsuite/g++.dg/warn/format1.C 886747822b ./gcc/testsuite/g++.dg/warn/format2.C 2805519034b ./gcc/testsuite/g++.dg/warn/friend.C + 334159724b ./gcc/testsuite/g++.dg/warn/implicit-typename1.C 3402610409b ./gcc/testsuite/g++.dg/warn/oldcast1.C 2394314287b ./gcc/testsuite/g++.dg/warn/return-reference.C 3714230484b ./gcc/testsuite/g++.dg/warn/weak1.C *************** *** 7112,7118 **** 3099602163b ./gcc/testsuite/g++.old-deja/g++.ns/using7.C 396388537b ./gcc/testsuite/g++.old-deja/g++.ns/using8.C 536814910b ./gcc/testsuite/g++.old-deja/g++.ns/using9.C ! 3652230393b ./gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog 3728265872b ./gcc/testsuite/g++.old-deja/g++.oliva/ctor1.C 3026414575b ./gcc/testsuite/g++.old-deja/g++.oliva/delete1.C 3639944207b ./gcc/testsuite/g++.old-deja/g++.oliva/delete2.C --- 7203,7209 ---- 3099602163b ./gcc/testsuite/g++.old-deja/g++.ns/using7.C 396388537b ./gcc/testsuite/g++.old-deja/g++.ns/using8.C 536814910b ./gcc/testsuite/g++.old-deja/g++.ns/using9.C ! 624680462b ./gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog 3728265872b ./gcc/testsuite/g++.old-deja/g++.oliva/ctor1.C 3026414575b ./gcc/testsuite/g++.old-deja/g++.oliva/delete1.C 3639944207b ./gcc/testsuite/g++.old-deja/g++.oliva/delete2.C *************** *** 8915,8920 **** --- 9006,9015 ---- 953842788b ./gcc/testsuite/gcc.c-torture/compile/20021205-1.c 3765901682b ./gcc/testsuite/gcc.c-torture/compile/20021212-1.c 1694594576b ./gcc/testsuite/gcc.c-torture/compile/20030110-1.c + 3514558242b ./gcc/testsuite/gcc.c-torture/compile/20030206-1.c + 2261613922b ./gcc/testsuite/gcc.c-torture/compile/20030220-1.c + 3214532330b ./gcc/testsuite/gcc.c-torture/compile/20030305-1.c + 3074411947b ./gcc/testsuite/gcc.c-torture/compile/20030314-1.c 375311401b ./gcc/testsuite/gcc.c-torture/compile/900116-1.c 4181931788b ./gcc/testsuite/gcc.c-torture/compile/900216-1.c 426860692b ./gcc/testsuite/gcc.c-torture/compile/900313-1.c *************** *** 9366,9374 **** 1360698555b ./gcc/testsuite/gcc.c-torture/execute/20020219-1.c 1656358954b ./gcc/testsuite/gcc.c-torture/execute/20020225-1.c 127051635b ./gcc/testsuite/gcc.c-torture/execute/20020227-1.c ! 2757105756b ./gcc/testsuite/gcc.c-torture/execute/20020227-1.x 1982547595b ./gcc/testsuite/gcc.c-torture/execute/20020307-1.c 1497258578b ./gcc/testsuite/gcc.c-torture/execute/20020307-2.c 2236973257b ./gcc/testsuite/gcc.c-torture/execute/20020314-1.c 3091941732b ./gcc/testsuite/gcc.c-torture/execute/20020320-1.c 3564527352b ./gcc/testsuite/gcc.c-torture/execute/20020321-1.c --- 9461,9470 ---- 1360698555b ./gcc/testsuite/gcc.c-torture/execute/20020219-1.c 1656358954b ./gcc/testsuite/gcc.c-torture/execute/20020225-1.c 127051635b ./gcc/testsuite/gcc.c-torture/execute/20020227-1.c ! 2965337212b ./gcc/testsuite/gcc.c-torture/execute/20020227-1.x 1982547595b ./gcc/testsuite/gcc.c-torture/execute/20020307-1.c 1497258578b ./gcc/testsuite/gcc.c-torture/execute/20020307-2.c + 3970771348b ./gcc/testsuite/gcc.c-torture/execute/20020307-2.x 2236973257b ./gcc/testsuite/gcc.c-torture/execute/20020314-1.c 3091941732b ./gcc/testsuite/gcc.c-torture/execute/20020320-1.c 3564527352b ./gcc/testsuite/gcc.c-torture/execute/20020321-1.c *************** *** 9396,9401 **** --- 9492,9502 ---- 3834877290b ./gcc/testsuite/gcc.c-torture/execute/20021118-3.c 624734562b ./gcc/testsuite/gcc.c-torture/execute/20021219-1.c 2820909676b ./gcc/testsuite/gcc.c-torture/execute/20030109-1.c + 855486154b ./gcc/testsuite/gcc.c-torture/execute/20030221-1.c + 821090783b ./gcc/testsuite/gcc.c-torture/execute/20030224-2.c + 4076291177b ./gcc/testsuite/gcc.c-torture/execute/20030307-1.c + 2371585447b ./gcc/testsuite/gcc.c-torture/execute/20030313-1.c + 2637074483b ./gcc/testsuite/gcc.c-torture/execute/20030316-1.c 37158978b ./gcc/testsuite/gcc.c-torture/execute/900409-1.c 1241514475b ./gcc/testsuite/gcc.c-torture/execute/920202-1.c 651529975b ./gcc/testsuite/gcc.c-torture/execute/920302-1.c *************** *** 9829,9835 **** 1827676873b ./gcc/testsuite/gcc.c-torture/execute/scope-1.c 990025742b ./gcc/testsuite/gcc.c-torture/execute/scope-2.c 3788353048b ./gcc/testsuite/gcc.c-torture/execute/shiftdi.c ! 75800580b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c 2726881848b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-2.c 2215607685b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-3.c 4127514660b ./gcc/testsuite/gcc.c-torture/execute/strct-pack-1.c --- 9930,9936 ---- 1827676873b ./gcc/testsuite/gcc.c-torture/execute/scope-1.c 990025742b ./gcc/testsuite/gcc.c-torture/execute/scope-2.c 3788353048b ./gcc/testsuite/gcc.c-torture/execute/shiftdi.c ! 1004975218b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c 2726881848b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-2.c 2215607685b ./gcc/testsuite/gcc.c-torture/execute/stdio-opt-3.c 4127514660b ./gcc/testsuite/gcc.c-torture/execute/strct-pack-1.c *************** *** 10258,10271 **** 1527728757b ./gcc/testsuite/gcc.dg/20020418-2.c 2088656022b ./gcc/testsuite/gcc.dg/20020426-1.c 4234050901b ./gcc/testsuite/gcc.dg/20020426-2.c ! 464722125b ./gcc/testsuite/gcc.dg/20020430-1.c ! 1745642748b ./gcc/testsuite/gcc.dg/20020503-1.c 3667555097b ./gcc/testsuite/gcc.dg/20020517-1.c 536325431b ./gcc/testsuite/gcc.dg/20020523-1.c 1463174796b ./gcc/testsuite/gcc.dg/20020527-1.c 2086765142b ./gcc/testsuite/gcc.dg/20020530-1.c 1518490714b ./gcc/testsuite/gcc.dg/20020616-1.c 344810811b ./gcc/testsuite/gcc.dg/20021014-1.c 1577979025b ./gcc/testsuite/gcc.dg/920413-1.c 2176221389b ./gcc/testsuite/gcc.dg/940409-1.c 1567764883b ./gcc/testsuite/gcc.dg/940510-1.c --- 10359,10377 ---- 1527728757b ./gcc/testsuite/gcc.dg/20020418-2.c 2088656022b ./gcc/testsuite/gcc.dg/20020426-1.c 4234050901b ./gcc/testsuite/gcc.dg/20020426-2.c ! 3359725112b ./gcc/testsuite/gcc.dg/20020430-1.c ! 2963915296b ./gcc/testsuite/gcc.dg/20020503-1.c 3667555097b ./gcc/testsuite/gcc.dg/20020517-1.c 536325431b ./gcc/testsuite/gcc.dg/20020523-1.c 1463174796b ./gcc/testsuite/gcc.dg/20020527-1.c 2086765142b ./gcc/testsuite/gcc.dg/20020530-1.c 1518490714b ./gcc/testsuite/gcc.dg/20020616-1.c 344810811b ./gcc/testsuite/gcc.dg/20021014-1.c + 2919267b ./gcc/testsuite/gcc.dg/20030217-1.c + 1045670620b ./gcc/testsuite/gcc.dg/20030225-1.c + 11242163b ./gcc/testsuite/gcc.dg/20030309-1.c + 3937697137b ./gcc/testsuite/gcc.dg/20030323-1.c + 1058638767b ./gcc/testsuite/gcc.dg/20030414-1.c 1577979025b ./gcc/testsuite/gcc.dg/920413-1.c 2176221389b ./gcc/testsuite/gcc.dg/940409-1.c 1567764883b ./gcc/testsuite/gcc.dg/940510-1.c *************** *** 10324,10329 **** --- 10430,10436 ---- 2673255882b ./gcc/testsuite/gcc.dg/asm-5.c 2560291160b ./gcc/testsuite/gcc.dg/asm-fs-1.c 1287172903b ./gcc/testsuite/gcc.dg/asm-names.c + 1099611642b ./gcc/testsuite/gcc.dg/asmreg-1.c 2801105283b ./gcc/testsuite/gcc.dg/attr-alwaysinline.c 1514674985b ./gcc/testsuite/gcc.dg/attr-invalid.c 1915283314b ./gcc/testsuite/gcc.dg/attr-nest.c *************** *** 10652,10657 **** --- 10759,10766 ---- 3551380716b ./gcc/testsuite/gcc.dg/debug/dwarf2-2.c 1865154101b ./gcc/testsuite/gcc.dg/debug/trivial.c 2108424497b ./gcc/testsuite/gcc.dg/decl-1.c + 3489735771b ./gcc/testsuite/gcc.dg/decl-2.c + 219343109b ./gcc/testsuite/gcc.dg/decl-3.c 2106699188b ./gcc/testsuite/gcc.dg/deprecated.c 462220244b ./gcc/testsuite/gcc.dg/dg.exp 3005671194b ./gcc/testsuite/gcc.dg/divbyzero.c *************** *** 10724,10731 **** --- 10833,10845 ---- 885923224b ./gcc/testsuite/gcc.dg/i386-387-1.c 4204057333b ./gcc/testsuite/gcc.dg/i386-387-2.c 3371905361b ./gcc/testsuite/gcc.dg/i386-bitfield1.c + 3703039330b ./gcc/testsuite/gcc.dg/i386-loop-1.c + 2666972329b ./gcc/testsuite/gcc.dg/i386-loop-2.c 2049230625b ./gcc/testsuite/gcc.dg/i386-mmx-1.c 3973906625b ./gcc/testsuite/gcc.dg/i386-mmx-2.c + 811535520b ./gcc/testsuite/gcc.dg/i386-signbit-1.c + 1624192171b ./gcc/testsuite/gcc.dg/i386-signbit-2.c + 1578707081b ./gcc/testsuite/gcc.dg/i386-signbit-3.c 2923520039b ./gcc/testsuite/gcc.dg/i386-sse-1.c 1935024742b ./gcc/testsuite/gcc.dg/i386-sse-2.c 2407665653b ./gcc/testsuite/gcc.dg/i386-sse-3.c *************** *** 10785,10797 **** 2267400179b ./gcc/testsuite/gcc.dg/noreturn-2.c 1222476594b ./gcc/testsuite/gcc.dg/noreturn-3.c 4260549149b ./gcc/testsuite/gcc.dg/noreturn-4.c ! 1941766090b ./gcc/testsuite/gcc.dg/old-style-asm-1.c 1662299957b ./gcc/testsuite/gcc.dg/pack-test-1.c 2754082325b ./gcc/testsuite/gcc.dg/pack-test-1.h 2875409621b ./gcc/testsuite/gcc.dg/pack-test-2.c 3395691298b ./gcc/testsuite/gcc.dg/pragma-align.c 2976918557b ./gcc/testsuite/gcc.dg/pragma-darwin.c ! 967979463b ./gcc/testsuite/gcc.dg/pragma-ep-1.c 689657683b ./gcc/testsuite/gcc.dg/pragma-ep-2.c 375277958b ./gcc/testsuite/gcc.dg/pragma-ep-3.c 18511022b ./gcc/testsuite/gcc.dg/pragma-re-1.c --- 10899,10911 ---- 2267400179b ./gcc/testsuite/gcc.dg/noreturn-2.c 1222476594b ./gcc/testsuite/gcc.dg/noreturn-3.c 4260549149b ./gcc/testsuite/gcc.dg/noreturn-4.c ! 3873251871b ./gcc/testsuite/gcc.dg/old-style-asm-1.c 1662299957b ./gcc/testsuite/gcc.dg/pack-test-1.c 2754082325b ./gcc/testsuite/gcc.dg/pack-test-1.h 2875409621b ./gcc/testsuite/gcc.dg/pack-test-2.c 3395691298b ./gcc/testsuite/gcc.dg/pragma-align.c 2976918557b ./gcc/testsuite/gcc.dg/pragma-darwin.c ! 2313186581b ./gcc/testsuite/gcc.dg/pragma-ep-1.c 689657683b ./gcc/testsuite/gcc.dg/pragma-ep-2.c 375277958b ./gcc/testsuite/gcc.dg/pragma-ep-3.c 18511022b ./gcc/testsuite/gcc.dg/pragma-re-1.c *************** *** 10802,10807 **** --- 10916,10922 ---- 3519355790b ./gcc/testsuite/gcc.dg/return-type-2.c 3862146754b ./gcc/testsuite/gcc.dg/sequence-pt-1.c 3997091992b ./gcc/testsuite/gcc.dg/setjmp-1.c + 2828537866b ./gcc/testsuite/gcc.dg/sparc-dwarf2.c 802040009b ./gcc/testsuite/gcc.dg/sparc-ret.c 1993113484b ./gcc/testsuite/gcc.dg/special/20000419-2.c 3430419731b ./gcc/testsuite/gcc.dg/special/alias-1.c *************** *** 10833,10838 **** --- 10948,10956 ---- 789972216b ./gcc/testsuite/gcc.dg/ultrasp2.c 2708772692b ./gcc/testsuite/gcc.dg/ultrasp3.c 1890424464b ./gcc/testsuite/gcc.dg/ultrasp4.c + 783369369b ./gcc/testsuite/gcc.dg/ultrasp6.c + 2907651471b ./gcc/testsuite/gcc.dg/ultrasp7.c + 906694114b ./gcc/testsuite/gcc.dg/ultrasp8.c 2258658308b ./gcc/testsuite/gcc.dg/uninit-1.c 608086310b ./gcc/testsuite/gcc.dg/uninit-2.c 2219873069b ./gcc/testsuite/gcc.dg/uninit-3.c *************** *** 10959,10966 **** 2495249432b ./gcc/testsuite/objc.dg/local-decl-1.m 1667427564b ./gcc/testsuite/objc.dg/method-1.m 2835356210b ./gcc/testsuite/objc.dg/method-2.m ! 1830729571b ./gcc/testsuite/objc.dg/naming-1.m ! 250748297b ./gcc/testsuite/objc.dg/naming-2.m 2785734223b ./gcc/testsuite/objc.dg/proto-hier-1.m 888349193b ./gcc/testsuite/objc.dg/special/special.exp 3078900770b ./gcc/testsuite/objc.dg/special/unclaimed-category-1.h --- 11077,11084 ---- 2495249432b ./gcc/testsuite/objc.dg/local-decl-1.m 1667427564b ./gcc/testsuite/objc.dg/method-1.m 2835356210b ./gcc/testsuite/objc.dg/method-2.m ! 4046194509b ./gcc/testsuite/objc.dg/naming-1.m ! 3719205740b ./gcc/testsuite/objc.dg/naming-2.m 2785734223b ./gcc/testsuite/objc.dg/proto-hier-1.m 888349193b ./gcc/testsuite/objc.dg/special/special.exp 3078900770b ./gcc/testsuite/objc.dg/special/unclaimed-category-1.h *************** *** 11059,11080 **** 2559007517b ./gcc/timevar.def 2115869626b ./gcc/timevar.h 2335446483b ./gcc/tlink.c ! 163649448b ./gcc/toplev.c 1100253771b ./gcc/toplev.h ! 4006547771b ./gcc/tradcif.c 840149782b ./gcc/tradcif.y 325171845b ./gcc/tradcpp.c 133942480b ./gcc/tradcpp.h 1565760610b ./gcc/tree-dump.c 177026127b ./gcc/tree-dump.h ! 1491742054b ./gcc/tree-inline.c 2000795530b ./gcc/tree-inline.h ! 2992843029b ./gcc/tree.c 2149556796b ./gcc/tree.def 1200175084b ./gcc/tree.h 2106315745b ./gcc/tsystem.h 4139263293b ./gcc/typeclass.h ! 2642343552b ./gcc/unroll.c 2451297709b ./gcc/unwind-dw2-fde-glibc.c 939184029b ./gcc/unwind-dw2-fde.c 2681777274b ./gcc/unwind-dw2-fde.h --- 11177,11198 ---- 2559007517b ./gcc/timevar.def 2115869626b ./gcc/timevar.h 2335446483b ./gcc/tlink.c ! 1633125668b ./gcc/toplev.c 1100253771b ./gcc/toplev.h ! 2279698662b ./gcc/tradcif.c 840149782b ./gcc/tradcif.y 325171845b ./gcc/tradcpp.c 133942480b ./gcc/tradcpp.h 1565760610b ./gcc/tree-dump.c 177026127b ./gcc/tree-dump.h ! 4108002902b ./gcc/tree-inline.c 2000795530b ./gcc/tree-inline.h ! 1782878008b ./gcc/tree.c 2149556796b ./gcc/tree.def 1200175084b ./gcc/tree.h 2106315745b ./gcc/tsystem.h 4139263293b ./gcc/typeclass.h ! 1488638700b ./gcc/unroll.c 2451297709b ./gcc/unwind-dw2-fde-glibc.c 939184029b ./gcc/unwind-dw2-fde.c 2681777274b ./gcc/unwind-dw2-fde.h *************** *** 11086,11100 **** 1202449654b ./gcc/varasm.c 1377429075b ./gcc/varray.c 251576980b ./gcc/varray.h ! 2865840547b ./gcc/version.c 835289284b ./gcc/version.h 1602668013b ./gcc/vmsdbg.h 4159431942b ./gcc/vmsdbgout.c 3414725237b ./gcc/xcoffout.c 241048359b ./gcc/xcoffout.h ! 3804835603b ./gnats.html 2171125041b ./include/COPYING ! 1284755488b ./include/ChangeLog 218913669b ./include/ansidecl.h 3472518673b ./include/demangle.h 524172850b ./include/dyn-string.h --- 11204,11218 ---- 1202449654b ./gcc/varasm.c 1377429075b ./gcc/varray.c 251576980b ./gcc/varray.h ! 309143238b ./gcc/version.c 835289284b ./gcc/version.h 1602668013b ./gcc/vmsdbg.h 4159431942b ./gcc/vmsdbgout.c 3414725237b ./gcc/xcoffout.c 241048359b ./gcc/xcoffout.h ! 1616768675b ./gnats.html 2171125041b ./include/COPYING ! 595770831b ./include/ChangeLog 218913669b ./include/ansidecl.h 3472518673b ./include/demangle.h 524172850b ./include/dyn-string.h *************** *** 11116,11122 **** 1151436348b ./include/xregex.h 1261882580b ./include/xregex2.h 656627656b ./install-sh ! 2543423086b ./libf2c/ChangeLog 643704007b ./libf2c/Makefile.in 3111321221b ./libf2c/README 308226469b ./libf2c/TODO --- 11234,11240 ---- 1151436348b ./include/xregex.h 1261882580b ./include/xregex2.h 656627656b ./install-sh ! 884630057b ./libf2c/ChangeLog 643704007b ./libf2c/Makefile.in 3111321221b ./libf2c/README 308226469b ./libf2c/TODO *************** *** 11132,11138 **** 2048561220b ./libf2c/libF77/Makefile.in 1384146782b ./libf2c/libF77/Notice 3594711912b ./libf2c/libF77/README.netlib ! 3333503347b ./libf2c/libF77/Version.c 1304659322b ./libf2c/libF77/abort_.c 2143735092b ./libf2c/libF77/c_abs.c 4102372920b ./libf2c/libF77/c_cos.c --- 11250,11256 ---- 2048561220b ./libf2c/libF77/Makefile.in 1384146782b ./libf2c/libF77/Notice 3594711912b ./libf2c/libF77/README.netlib ! 705291937b ./libf2c/libF77/Version.c 1304659322b ./libf2c/libF77/abort_.c 2143735092b ./libf2c/libF77/c_abs.c 4102372920b ./libf2c/libF77/c_cos.c *************** *** 11264,11270 **** 81211418b ./libf2c/libI77/Makefile.in 1384146782b ./libf2c/libI77/Notice 3744878144b ./libf2c/libI77/README.netlib ! 1068556264b ./libf2c/libI77/Version.c 1606913831b ./libf2c/libI77/backspace.c 2398093876b ./libf2c/libI77/close.c 3442307107b ./libf2c/libI77/config.h.in --- 11382,11388 ---- 81211418b ./libf2c/libI77/Makefile.in 1384146782b ./libf2c/libI77/Notice 3744878144b ./libf2c/libI77/README.netlib ! 199281018b ./libf2c/libI77/Version.c 1606913831b ./libf2c/libI77/backspace.c 2398093876b ./libf2c/libI77/close.c 3442307107b ./libf2c/libI77/config.h.in *************** *** 11311,11317 **** 2717291481b ./libf2c/libU77/Makefile.in 572996563b ./libf2c/libU77/PROJECTS 2980229902b ./libf2c/libU77/README ! 3875363173b ./libf2c/libU77/Version.c 1842933802b ./libf2c/libU77/access_.c 4214861580b ./libf2c/libU77/acconfig.h 2301261828b ./libf2c/libU77/aclocal.m4 --- 11429,11435 ---- 2717291481b ./libf2c/libU77/Makefile.in 572996563b ./libf2c/libU77/PROJECTS 2980229902b ./libf2c/libU77/README ! 1494896292b ./libf2c/libU77/Version.c 1842933802b ./libf2c/libU77/access_.c 4214861580b ./libf2c/libU77/acconfig.h 2301261828b ./libf2c/libU77/aclocal.m4 *************** *** 11373,11379 **** 3987376609b ./libf2c/libU77/vxttime_.c 1384146782b ./libf2c/permission.netlib 3513813969b ./libf2c/readme.netlib ! 3047576515b ./libffi/ChangeLog 3479323424b ./libffi/ChangeLog.libgcj 1481682558b ./libffi/ChangeLog.v1 2593181117b ./libffi/LICENSE --- 11491,11497 ---- 3987376609b ./libf2c/libU77/vxttime_.c 1384146782b ./libf2c/permission.netlib 3513813969b ./libf2c/readme.netlib ! 829387645b ./libffi/ChangeLog 3479323424b ./libffi/ChangeLog.libgcj 1481682558b ./libffi/ChangeLog.v1 2593181117b ./libffi/LICENSE *************** *** 11396,11402 **** 4293371769b ./libffi/src/arm/ffi.c 591152992b ./libffi/src/arm/sysv.S 2669027491b ./libffi/src/debug.c ! 269618381b ./libffi/src/ffitest.c 2435449601b ./libffi/src/ia64/ffi.c 1956966073b ./libffi/src/ia64/ia64_flags.h 2886414800b ./libffi/src/ia64/unix.S --- 11514,11520 ---- 4293371769b ./libffi/src/arm/ffi.c 591152992b ./libffi/src/arm/sysv.S 2669027491b ./libffi/src/debug.c ! 967989305b ./libffi/src/ffitest.c 2435449601b ./libffi/src/ia64/ffi.c 1956966073b ./libffi/src/ia64/ia64_flags.h 2886414800b ./libffi/src/ia64/unix.S *************** *** 11407,11418 **** 176940890b ./libffi/src/mips/n32.S 3634355650b ./libffi/src/mips/o32.S 1342850260b ./libffi/src/powerpc/aix.S ! 2356375417b ./libffi/src/powerpc/aix_closure.S 257105690b ./libffi/src/powerpc/asm.h 91989017b ./libffi/src/powerpc/darwin.S ! 1992059182b ./libffi/src/powerpc/darwin_closure.S ! 1107349205b ./libffi/src/powerpc/ffi.c ! 342545621b ./libffi/src/powerpc/ffi_darwin.c 978519837b ./libffi/src/powerpc/ppc_closure.S 1185461672b ./libffi/src/powerpc/sysv.S 1962807490b ./libffi/src/prep_cif.c --- 11525,11536 ---- 176940890b ./libffi/src/mips/n32.S 3634355650b ./libffi/src/mips/o32.S 1342850260b ./libffi/src/powerpc/aix.S ! 1122125803b ./libffi/src/powerpc/aix_closure.S 257105690b ./libffi/src/powerpc/asm.h 91989017b ./libffi/src/powerpc/darwin.S ! 4044999467b ./libffi/src/powerpc/darwin_closure.S ! 1692071312b ./libffi/src/powerpc/ffi.c ! 2961975388b ./libffi/src/powerpc/ffi_darwin.c 978519837b ./libffi/src/powerpc/ppc_closure.S 1185461672b ./libffi/src/powerpc/sysv.S 1962807490b ./libffi/src/prep_cif.c *************** *** 11426,11435 **** 478025840b ./libffi/src/x86/win32.S 216805921b ./libffi/stamp-h.in 508743035b ./libiberty/COPYING.LIB ! 3946655929b ./libiberty/ChangeLog 1980229302b ./libiberty/Makefile.in 4016047250b ./libiberty/README 602306638b ./libiberty/_doprnt.c 640604299b ./libiberty/aclocal.m4 4169173798b ./libiberty/alloca.c 122203256b ./libiberty/argv.c --- 11544,11554 ---- 478025840b ./libffi/src/x86/win32.S 216805921b ./libffi/stamp-h.in 508743035b ./libiberty/COPYING.LIB ! 2977486001b ./libiberty/ChangeLog 1980229302b ./libiberty/Makefile.in 4016047250b ./libiberty/README 602306638b ./libiberty/_doprnt.c + 3848560079b ./libiberty/acconfig.h 640604299b ./libiberty/aclocal.m4 4169173798b ./libiberty/alloca.c 122203256b ./libiberty/argv.c *************** *** 11445,11459 **** 2557767520b ./libiberty/clock.c 3170582338b ./libiberty/concat.c 1987387424b ./libiberty/config.h-vms ! 2319815417b ./libiberty/config.in 4294237366b ./libiberty/config.table 3500529335b ./libiberty/config/mh-aix 3476234501b ./libiberty/config/mh-cxux7 1235651640b ./libiberty/config/mh-fbsd21 2904567379b ./libiberty/config/mh-openedition 2131807358b ./libiberty/config/mh-windows ! 3945236769b ./libiberty/configure ! 1116624814b ./libiberty/configure.in 2478885430b ./libiberty/copying-lib.texi 3329761531b ./libiberty/copysign.c 2979121734b ./libiberty/cp-demangle.c --- 11564,11578 ---- 2557767520b ./libiberty/clock.c 3170582338b ./libiberty/concat.c 1987387424b ./libiberty/config.h-vms ! 257229344b ./libiberty/config.in 4294237366b ./libiberty/config.table 3500529335b ./libiberty/config/mh-aix 3476234501b ./libiberty/config/mh-cxux7 1235651640b ./libiberty/config/mh-fbsd21 2904567379b ./libiberty/config/mh-openedition 2131807358b ./libiberty/config/mh-windows ! 575752138b ./libiberty/configure ! 1313961034b ./libiberty/configure.in 2478885430b ./libiberty/copying-lib.texi 3329761531b ./libiberty/copysign.c 2979121734b ./libiberty/cp-demangle.c *************** *** 11540,11546 **** 991611298b ./libiberty/xstrdup.c 387398324b ./libiberty/xstrerror.c 2171125041b ./libjava/COPYING ! 600502670b ./libjava/ChangeLog 3473562392b ./libjava/ChangeLog-1999 2385951174b ./libjava/ChangeLog-2001 1487334009b ./libjava/HACKING --- 11659,11665 ---- 991611298b ./libiberty/xstrdup.c 387398324b ./libiberty/xstrerror.c 2171125041b ./libjava/COPYING ! 520335338b ./libjava/ChangeLog 3473562392b ./libjava/ChangeLog-1999 2385951174b ./libjava/ChangeLog-2001 1487334009b ./libjava/HACKING *************** *** 12874,12880 **** 799924566b ./libjava/libgcj.spec.in 3885054737b ./libjava/libltdl/.cvsignore 1530919786b ./libjava/libltdl/COPYING.LIB ! 3714466252b ./libjava/libltdl/ChangeLog 3589765398b ./libjava/libltdl/Makefile.am 2495909158b ./libjava/libltdl/Makefile.in 1322928877b ./libjava/libltdl/README --- 12993,12999 ---- 799924566b ./libjava/libgcj.spec.in 3885054737b ./libjava/libltdl/.cvsignore 1530919786b ./libjava/libltdl/COPYING.LIB ! 3841120685b ./libjava/libltdl/ChangeLog 3589765398b ./libjava/libltdl/Makefile.am 2495909158b ./libjava/libltdl/Makefile.in 1322928877b ./libjava/libltdl/README *************** *** 12968,12974 **** 2487590179b ./libjava/sysdep/ia64/locks.h 3446737173b ./libjava/sysdep/powerpc/locks.h 2903495760b ./libjava/sysdep/sparc/locks.h ! 2964965917b ./libjava/testsuite/ChangeLog 3806425466b ./libjava/testsuite/Makefile.am 1096421437b ./libjava/testsuite/Makefile.in 1230501773b ./libjava/testsuite/config/default.exp --- 13087,13093 ---- 2487590179b ./libjava/sysdep/ia64/locks.h 3446737173b ./libjava/sysdep/powerpc/locks.h 2903495760b ./libjava/sysdep/sparc/locks.h ! 4288525704b ./libjava/testsuite/ChangeLog 3806425466b ./libjava/testsuite/Makefile.am 1096421437b ./libjava/testsuite/Makefile.in 1230501773b ./libjava/testsuite/config/default.exp *************** *** 13387,13393 **** 3417667916b ./libjava/verify.cc 3459150705b ./libjava/win32-threads.cc 916359044b ./libjava/win32.cc ! 1019359508b ./libobjc/ChangeLog 3778683951b ./libobjc/Makefile.in 638422313b ./libobjc/NXConstStr.m 3285287551b ./libobjc/Object.m --- 13506,13512 ---- 3417667916b ./libjava/verify.cc 3459150705b ./libjava/win32-threads.cc 916359044b ./libjava/win32.cc ! 3049078639b ./libobjc/ChangeLog 3778683951b ./libobjc/Makefile.in 638422313b ./libobjc/NXConstStr.m 3285287551b ./libobjc/Object.m *************** *** 13442,13448 **** 2005277748b ./libobjc/thr-vxworks.c 2963027857b ./libobjc/thr-win32.c 3239202263b ./libobjc/thr.c ! 8463637b ./libstdc++-v3/ChangeLog 1996982572b ./libstdc++-v3/ChangeLog-2000 3665233589b ./libstdc++-v3/ChangeLog-2001 3601994870b ./libstdc++-v3/Makefile.am --- 13561,13567 ---- 2005277748b ./libobjc/thr-vxworks.c 2963027857b ./libobjc/thr-win32.c 3239202263b ./libobjc/thr.c ! 3164673878b ./libstdc++-v3/ChangeLog 1996982572b ./libstdc++-v3/ChangeLog-2000 3665233589b ./libstdc++-v3/ChangeLog-2001 3601994870b ./libstdc++-v3/Makefile.am *************** *** 13450,13456 **** 201474883b ./libstdc++-v3/README 4114737556b ./libstdc++-v3/acconfig.h 1335999300b ./libstdc++-v3/acinclude.m4 ! 2806298612b ./libstdc++-v3/aclocal.m4 1280750931b ./libstdc++-v3/config.h.in 4214408479b ./libstdc++-v3/config/abi/alphaev67-unknown-linux-gnu/baseline_symbols.txt 1077465800b ./libstdc++-v3/config/abi/extract_symvers --- 13569,13575 ---- 201474883b ./libstdc++-v3/README 4114737556b ./libstdc++-v3/acconfig.h 1335999300b ./libstdc++-v3/acinclude.m4 ! 1757393875b ./libstdc++-v3/aclocal.m4 1280750931b ./libstdc++-v3/config.h.in 4214408479b ./libstdc++-v3/config/abi/alphaev67-unknown-linux-gnu/baseline_symbols.txt 1077465800b ./libstdc++-v3/config/abi/extract_symvers *************** *** 13516,13522 **** 3496359145b ./libstdc++-v3/config/locale/gnu/time_members.h 3232379868b ./libstdc++-v3/config/locale/ieee_1003.1-2001/c_locale.cc 3136594064b ./libstdc++-v3/config/locale/ieee_1003.1-2001/c_locale.h ! 3256263647b ./libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h 3823275112b ./libstdc++-v3/config/locale/ieee_1003.1-2001/messages_members.cc 488667815b ./libstdc++-v3/config/locale/ieee_1003.1-2001/messages_members.h 4256387970b ./libstdc++-v3/config/os/aix/bits/atomicity.h --- 13635,13641 ---- 3496359145b ./libstdc++-v3/config/locale/gnu/time_members.h 3232379868b ./libstdc++-v3/config/locale/ieee_1003.1-2001/c_locale.cc 3136594064b ./libstdc++-v3/config/locale/ieee_1003.1-2001/c_locale.h ! 2429580009b ./libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h 3823275112b ./libstdc++-v3/config/locale/ieee_1003.1-2001/messages_members.cc 488667815b ./libstdc++-v3/config/locale/ieee_1003.1-2001/messages_members.h 4256387970b ./libstdc++-v3/config/os/aix/bits/atomicity.h *************** *** 13547,13553 **** 1503897878b ./libstdc++-v3/config/os/hpux/bits/cpu_limits.h 2727448261b ./libstdc++-v3/config/os/hpux/bits/ctype_base.h 521899911b ./libstdc++-v3/config/os/hpux/bits/ctype_inline.h ! 1287488501b ./libstdc++-v3/config/os/hpux/bits/ctype_noninline.h 4256303940b ./libstdc++-v3/config/os/hpux/bits/os_defines.h 805235121b ./libstdc++-v3/config/os/irix/irix5.2/bits/atomicity.h 734403019b ./libstdc++-v3/config/os/irix/irix5.2/bits/ctype_base.h --- 13666,13672 ---- 1503897878b ./libstdc++-v3/config/os/hpux/bits/cpu_limits.h 2727448261b ./libstdc++-v3/config/os/hpux/bits/ctype_base.h 521899911b ./libstdc++-v3/config/os/hpux/bits/ctype_inline.h ! 766270739b ./libstdc++-v3/config/os/hpux/bits/ctype_noninline.h 4256303940b ./libstdc++-v3/config/os/hpux/bits/os_defines.h 805235121b ./libstdc++-v3/config/os/irix/irix5.2/bits/atomicity.h 734403019b ./libstdc++-v3/config/os/irix/irix5.2/bits/ctype_base.h *************** *** 13584,13592 **** 577770049b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/ctype_inline.h 399834321b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/ctype_noninline.h 157883947b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/os_defines.h ! 1247614208b ./libstdc++-v3/configure 3116040814b ./libstdc++-v3/configure.host ! 2627385010b ./libstdc++-v3/configure.in 282761406b ./libstdc++-v3/configure.target 1637481960b ./libstdc++-v3/docs/doxygen/Intro.3 2829674872b ./libstdc++-v3/docs/doxygen/TODO --- 13703,13711 ---- 577770049b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/ctype_inline.h 399834321b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/ctype_noninline.h 157883947b ./libstdc++-v3/config/os/solaris/solaris2.7/bits/os_defines.h ! 3647444520b ./libstdc++-v3/configure 3116040814b ./libstdc++-v3/configure.host ! 31792307b ./libstdc++-v3/configure.in 282761406b ./libstdc++-v3/configure.target 1637481960b ./libstdc++-v3/docs/doxygen/Intro.3 2829674872b ./libstdc++-v3/docs/doxygen/TODO *************** *** 13698,13710 **** 1196444434b ./libstdc++-v3/include/bits/basic_string.h 3004074520b ./libstdc++-v3/include/bits/basic_string.tcc 179433314b ./libstdc++-v3/include/bits/boost_concept_check.h ! 2325758266b ./libstdc++-v3/include/bits/c++config 3498736544b ./libstdc++-v3/include/bits/char_traits.h 3672868066b ./libstdc++-v3/include/bits/codecvt.h 2442194789b ./libstdc++-v3/include/bits/concept_check.h 329719722b ./libstdc++-v3/include/bits/cpp_type_traits.h 1176672394b ./libstdc++-v3/include/bits/fpos.h ! 2897059516b ./libstdc++-v3/include/bits/fstream.tcc 3886600201b ./libstdc++-v3/include/bits/functexcept.h 3055891139b ./libstdc++-v3/include/bits/generic_shadow.h 1117238130b ./libstdc++-v3/include/bits/gslice.h --- 13817,13829 ---- 1196444434b ./libstdc++-v3/include/bits/basic_string.h 3004074520b ./libstdc++-v3/include/bits/basic_string.tcc 179433314b ./libstdc++-v3/include/bits/boost_concept_check.h ! 1036368554b ./libstdc++-v3/include/bits/c++config 3498736544b ./libstdc++-v3/include/bits/char_traits.h 3672868066b ./libstdc++-v3/include/bits/codecvt.h 2442194789b ./libstdc++-v3/include/bits/concept_check.h 329719722b ./libstdc++-v3/include/bits/cpp_type_traits.h 1176672394b ./libstdc++-v3/include/bits/fpos.h ! 1776886078b ./libstdc++-v3/include/bits/fstream.tcc 3886600201b ./libstdc++-v3/include/bits/functexcept.h 3055891139b ./libstdc++-v3/include/bits/generic_shadow.h 1117238130b ./libstdc++-v3/include/bits/gslice.h *************** *** 13750,13756 **** 1954571679b ./libstdc++-v3/include/bits/stl_uninitialized.h 1856687262b ./libstdc++-v3/include/bits/stl_vector.h 99981565b ./libstdc++-v3/include/bits/stream_iterator.h ! 2491807253b ./libstdc++-v3/include/bits/streambuf.tcc 466836896b ./libstdc++-v3/include/bits/streambuf_iterator.h 1373192946b ./libstdc++-v3/include/bits/stringfwd.h 1571290449b ./libstdc++-v3/include/bits/type_traits.h --- 13869,13875 ---- 1954571679b ./libstdc++-v3/include/bits/stl_uninitialized.h 1856687262b ./libstdc++-v3/include/bits/stl_vector.h 99981565b ./libstdc++-v3/include/bits/stream_iterator.h ! 3082898899b ./libstdc++-v3/include/bits/streambuf.tcc 466836896b ./libstdc++-v3/include/bits/streambuf_iterator.h 1373192946b ./libstdc++-v3/include/bits/stringfwd.h 1571290449b ./libstdc++-v3/include/bits/type_traits.h *************** *** 13910,13916 **** 4158492065b ./libstdc++-v3/include/std/std_utility.h 362016596b ./libstdc++-v3/include/std/std_valarray.h 125145631b ./libstdc++-v3/include/std/std_vector.h ! 2717296741b ./libstdc++-v3/libio/ChangeLog 226381804b ./libstdc++-v3/libio/Makefile.am 4199895907b ./libstdc++-v3/libio/Makefile.in 314955067b ./libstdc++-v3/libio/_G_config.h --- 14029,14035 ---- 4158492065b ./libstdc++-v3/include/std/std_utility.h 362016596b ./libstdc++-v3/include/std/std_valarray.h 125145631b ./libstdc++-v3/include/std/std_vector.h ! 4102282136b ./libstdc++-v3/libio/ChangeLog 226381804b ./libstdc++-v3/libio/Makefile.am 4199895907b ./libstdc++-v3/libio/Makefile.in 314955067b ./libstdc++-v3/libio/_G_config.h *************** *** 14171,14182 **** 1162163080b ./libstdc++-v3/testsuite/27_io/filebuf.cc 4294967295b ./libstdc++-v3/testsuite/27_io/filebuf_members-1.tst 4294967295b ./libstdc++-v3/testsuite/27_io/filebuf_members-1.txt ! 3299934909b ./libstdc++-v3/testsuite/27_io/filebuf_members.cc 4204648704b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-1.tst 4204648704b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-1.txt 655821823b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-2.tst 1896106013b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-3.tst ! 4060177148b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc 1987901042b ./libstdc++-v3/testsuite/27_io/fpos.cc 2165147103b ./libstdc++-v3/testsuite/27_io/fstream.cc 358840366b ./libstdc++-v3/testsuite/27_io/fstream_members.cc --- 14290,14301 ---- 1162163080b ./libstdc++-v3/testsuite/27_io/filebuf.cc 4294967295b ./libstdc++-v3/testsuite/27_io/filebuf_members-1.tst 4294967295b ./libstdc++-v3/testsuite/27_io/filebuf_members-1.txt ! 1936479101b ./libstdc++-v3/testsuite/27_io/filebuf_members.cc 4204648704b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-1.tst 4204648704b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-1.txt 655821823b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-2.tst 1896106013b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals-3.tst ! 3120338832b ./libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc 1987901042b ./libstdc++-v3/testsuite/27_io/fpos.cc 2165147103b ./libstdc++-v3/testsuite/27_io/fstream.cc 358840366b ./libstdc++-v3/testsuite/27_io/fstream_members.cc *************** *** 14292,14298 **** 3594421631b ./ltcf-gcj.sh 30175378b ./ltconfig 2369122487b ./ltmain.sh ! 1935971162b ./maintainer-scripts/ChangeLog 3126840705b ./maintainer-scripts/README 1905552954b ./maintainer-scripts/crontab 4171969357b ./maintainer-scripts/doc_exclude --- 14411,14417 ---- 3594421631b ./ltcf-gcj.sh 30175378b ./ltconfig 2369122487b ./ltmain.sh ! 1660471952b ./maintainer-scripts/ChangeLog 3126840705b ./maintainer-scripts/README 1905552954b ./maintainer-scripts/crontab 4171969357b ./maintainer-scripts/doc_exclude *************** *** 14309,14316 **** 902556840b ./move-if-change 1077958069b ./symlink-tree 1370970362b ./ylwrap ! 1298224910b ./zlib/ChangeLog ! 4044693717b ./zlib/ChangeLog.gcj 1790959550b ./zlib/FAQ 467711448b ./zlib/INDEX 3901505907b ./zlib/Make_vms.com --- 14428,14435 ---- 902556840b ./move-if-change 1077958069b ./symlink-tree 1370970362b ./ylwrap ! 426049005b ./zlib/ChangeLog ! 356214916b ./zlib/ChangeLog.gcj 1790959550b ./zlib/FAQ 467711448b ./zlib/INDEX 3901505907b ./zlib/Make_vms.com *************** *** 14325,14332 **** 1537725969b ./zlib/amiga/Makefile.pup 3919607569b ./zlib/amiga/Makefile.sas 720988996b ./zlib/compress.c ! 449189607b ./zlib/configure ! 908419910b ./zlib/configure.in 3769239525b ./zlib/contrib/README.contrib 215845136b ./zlib/contrib/asm386/gvmat32.asm 4143184108b ./zlib/contrib/asm386/gvmat32c.c --- 14444,14451 ---- 1537725969b ./zlib/amiga/Makefile.pup 3919607569b ./zlib/amiga/Makefile.sas 720988996b ./zlib/compress.c ! 784731032b ./zlib/configure ! 3521535304b ./zlib/configure.in 3769239525b ./zlib/contrib/README.contrib 215845136b ./zlib/contrib/asm386/gvmat32.asm 4143184108b ./zlib/contrib/asm386/gvmat32c.c diff -Nrc3pad gcc-3.2.2/BUGS gcc-3.2.3/BUGS *** gcc-3.2.2/BUGS Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/BUGS Tue Apr 22 06:56:31 2003 *************** *** 2,8 **** GCC Bugs The latest version of this document is always available at ! [1]http://www.gnu.org/software/gcc/bugs.html. _________________________________________________________________ Table of Contents --- 2,8 ---- GCC Bugs The latest version of this document is always available at ! [1]http://gcc.gnu.org/bugs.html. _________________________________________________________________ Table of Contents *************** Table of Contents *** 15,39 **** + [7]Detailed bug reporting instructions for GNAT + [8]Detailed bug reporting instructions when using a precompiled header ! * [9]Managing Bugs (GNATS and the test-suite) ! * [10]Frequently Reported Bugs in GCC ! + [11]General ! + [12]Fortran ! + [13]C ! + [14]C++ ! o [15]Common problems updating from G++ 2.95 to G++ 3.0 ! o [16]Non-bugs ! o [17]Missing features ! o [18]Parse errors for "simple" code ! o [19]Optimization at -O3 takes a very long time _________________________________________________________________ Reporting Bugs ! Our preferred way of receiving bugs is via the [20]GCC GNATS bug reporting system. ! Before you report a bug, please check the [21]list of well-known bugs and, if possible in any way, try a current development snapshot. If you want to report a bug with versions of GCC before 3.1 we strongly recommend upgrading to the current release first. --- 15,38 ---- + [7]Detailed bug reporting instructions for GNAT + [8]Detailed bug reporting instructions when using a precompiled header ! * [9]Frequently Reported Bugs in GCC ! + [10]General ! + [11]Fortran ! + [12]C ! + [13]C++ ! o [14]Common problems updating from G++ 2.95 to G++ 3.0 ! o [15]Non-bugs ! o [16]Missing features ! o [17]Parse errors for "simple" code ! o [18]Optimization at -O3 takes a very long time _________________________________________________________________ Reporting Bugs ! Our preferred way of receiving bugs is via the [19]GCC GNATS bug reporting system. ! Before you report a bug, please check the [20]list of well-known bugs and, if possible in any way, try a current development snapshot. If you want to report a bug with versions of GCC before 3.1 we strongly recommend upgrading to the current release first. *************** Summarized bug reporting instructions *** 101,118 **** Where to post it ! Please submit your bug report directly to the [22]GCC GNATS bug database. Only if this is not possible, mail all information to ! [23]bug-gcc@gnu.org or [24]gcc-bugs@gcc.gnu.org. The GCC lists have message size limits (200 kbytes) and bug reports over those limits will currently be bounced. If your bug is larger ! than that, please post it using the [25]GCC GNATS bug database. Detailed bug reporting instructions ! Please refer to the [26]next section when reporting bugs in GNAT, the ! Ada compiler, or to the [27]one after that when reporting bugs that appear when using a precompiled header. In general, all the information we need can be obtained by collecting --- 100,117 ---- Where to post it ! Please submit your bug report directly to the [21]GCC GNATS bug database. Only if this is not possible, mail all information to ! [22]bug-gcc@gnu.org or [23]gcc-bugs@gcc.gnu.org. The GCC lists have message size limits (200 kbytes) and bug reports over those limits will currently be bounced. If your bug is larger ! than that, please post it using the [24]GCC GNATS bug database. Detailed bug reporting instructions ! Please refer to the [25]next section when reporting bugs in GNAT, the ! Ada compiler, or to the [26]one after that when reporting bugs that appear when using a precompiled header. In general, all the information we need can be obtained by collecting *************** Detailed bug reporting instructions *** 168,174 **** Detailed bug reporting instructions for GNAT ! See the [28]previous section for bug reporting instructions for GCC language implementations other than Ada. Bug reports have to contain at least the following information in --- 167,173 ---- Detailed bug reporting instructions for GNAT ! See the [27]previous section for bug reporting instructions for GCC language implementations other than Ada. Bug reports have to contain at least the following information in *************** Detailed bug reporting instructions for *** 200,206 **** you have to report a bug in gnatprep). When you have checked that your report meets these criteria, please ! submit it according to our [29]generic instructions. (If you use a mailing list for reporting, please include an "[Ada]" tag in the subject.) --- 199,205 ---- you have to report a bug in gnatprep). When you have checked that your report meets these criteria, please ! submit it according to our [28]generic instructions. (If you use a mailing list for reporting, please include an "[Ada]" tag in the subject.) *************** Detailed bug reporting instructions when *** 210,220 **** first thing to do is to delete the precompiled header, and try running the same GCC command again. If the bug happens again, the bug doesn't really involve precompiled headers, please report it without using ! them by following the instructions [30]above. If you've found a bug while building a precompiled header (for instance, the compiler crashes), follow the usual instructions ! [31]above. If you've found a real precompiled header bug, what we'll need to reproduce it is the sources to build the precompiled header (as a --- 209,219 ---- first thing to do is to delete the precompiled header, and try running the same GCC command again. If the bug happens again, the bug doesn't really involve precompiled headers, please report it without using ! them by following the instructions [29]above. If you've found a bug while building a precompiled header (for instance, the compiler crashes), follow the usual instructions ! [30]above. If you've found a real precompiled header bug, what we'll need to reproduce it is the sources to build the precompiled header (as a *************** Detailed bug reporting instructions when *** 224,249 **** Please don't send us the actual precompiled header. It is likely to be very large and we can't use it to reproduce the problem. - - Managing Bugs (GNATS and the test-suite) - - This section contains information mostly intended for GCC - contributors. - - If you find a bug, but you are not fixing it (yet): - 1. Create a (minimal) test-case. - 2. Add the test-case to our test-suite, marking it as XFAIL unless - the bug is a regression. - 3. Add a bug report referencing the test-case to GNATS. - - If you fix a bug for which there is already a GNATS entry: - 1. Remove the XFAIL on the test-case. - 2. Close the bug report in GNATS. - - If you find a bug, and you are fixing it right then: - 1. Create a (minimal) test-case. - 2. Add the test-case to our test-suite, marking it as PASS. - 3. Check in your fixes. _________________________________________________________________ Frequently Reported Bugs in GCC --- 223,228 ---- *************** Detailed bug reporting instructions when *** 251,257 **** Fortran Fortran bugs are documented in the G77 manual rather than explicitly ! listed here. Please see [32]Known Causes of Trouble with GNU Fortran in the G77 manual. _________________________________________________________________ --- 230,236 ---- Fortran Fortran bugs are documented in the G77 manual rather than explicitly ! listed here. Please see [31]Known Causes of Trouble with GNU Fortran in the G77 manual. _________________________________________________________________ *************** FILE *yyin = stdin; *** 283,289 **** There is a common misconception that the GCC developers are responsible for GNU libc. These are in fact two entirely ! separate projects; please check the [33]GNU libc web pages for details. Cannot use preprocessor directive in macro arguments. --- 262,268 ---- There is a common misconception that the GCC developers are responsible for GNU libc. These are in fact two entirely ! separate projects; please check the [32]GNU libc web pages for details. Cannot use preprocessor directive in macro arguments. *************** C++ *** 347,353 **** reported very often, but not yet fixed. While it is certainly better to fix bugs instead of documenting them, this document might save people the effort of writing a bug report when the bug is already ! well-known. [34]How to report bugs tells you how to report a bug. There are many reasons why reported bugs don't get fixed. It might be difficult to fix, or fixing it might break compatibility. Often, --- 326,332 ---- reported very often, but not yet fixed. While it is certainly better to fix bugs instead of documenting them, this document might save people the effort of writing a bug report when the bug is already ! well-known. [33]How to report bugs tells you how to report a bug. There are many reasons why reported bugs don't get fixed. It might be difficult to fix, or fixing it might break compatibility. Often, *************** C++ *** 365,376 **** Common problems updating from G++ 2.95 to G++ 3.0 G++ 3.0 conforms much closer to the ISO C++ standard (available at ! [35]http://www.ncits.org/cplusplus.htm). We have also implemented some of the core and library defect reports (available at ! [36]http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_defects.html & ! [37]http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html respectively). * The ABI has changed. This means that both class layout and name mangling is different. You must recompile all c++ libraries (if --- 344,355 ---- Common problems updating from G++ 2.95 to G++ 3.0 G++ 3.0 conforms much closer to the ISO C++ standard (available at ! [34]http://www.ncits.org/cplusplus.htm). We have also implemented some of the core and library defect reports (available at ! [35]http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_defects.html & ! [36]http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html respectively). * The ABI has changed. This means that both class layout and name mangling is different. You must recompile all c++ libraries (if *************** C++ *** 478,484 **** the nearest representable number. This is not a bug in the compiler, but an inherent limitation ! of the float and double types. Please study [38]this paper for more information. Templates, scoping, and digraphs. --- 457,463 ---- the nearest representable number. This is not a bug in the compiler, but an inherent limitation ! of the float and double types. Please study [37]this paper for more information. Templates, scoping, and digraphs. *************** A B::f1(bool b) *** 584,590 **** References ! 1. http://www.gnu.org/software/gcc/bugs.html 2. http://gcc.gnu.org/bugs.html#report 3. http://gcc.gnu.org/bugs.html#need 4. http://gcc.gnu.org/bugs.html#dontwant --- 563,569 ---- References ! 1. http://gcc.gnu.org/bugs.html 2. http://gcc.gnu.org/bugs.html#report 3. http://gcc.gnu.org/bugs.html#need 4. http://gcc.gnu.org/bugs.html#dontwant *************** References *** 592,624 **** 6. http://gcc.gnu.org/bugs.html#detailed 7. http://gcc.gnu.org/bugs.html#gnat 8. http://gcc.gnu.org/bugs.html#pch ! 9. http://gcc.gnu.org/bugs.html#manage ! 10. http://gcc.gnu.org/bugs.html#known ! 11. http://gcc.gnu.org/bugs.html#general ! 12. http://gcc.gnu.org/bugs.html#fortran ! 13. http://gcc.gnu.org/bugs.html#c ! 14. http://gcc.gnu.org/bugs.html#cplusplus ! 15. http://gcc.gnu.org/bugs.html#updating ! 16. http://gcc.gnu.org/bugs.html#nonbugs ! 17. http://gcc.gnu.org/bugs.html#missing ! 18. http://gcc.gnu.org/bugs.html#parsing ! 19. http://gcc.gnu.org/bugs.html#-O3 ! 20. http://gcc.gnu.org/gnats.html ! 21. http://gcc.gnu.org/bugs.html#known ! 22. http://gcc.gnu.org/gnats.html ! 23. mailto:bug-gcc@gnu.org ! 24. mailto:gcc-bugs@gcc.gnu.org ! 25. http://gcc.gnu.org/gnats.html ! 26. http://gcc.gnu.org/bugs.html#gnat ! 27. http://gcc.gnu.org/bugs.html#pch ! 28. http://gcc.gnu.org/bugs.html#detailed ! 29. http://gcc.gnu.org/bugs.html#where 30. http://gcc.gnu.org/bugs.html#detailed ! 31. http://gcc.gnu.org/bugs.html#detailed ! 32. http://gcc.gnu.org/onlinedocs/g77/Trouble.html ! 33. http://www.gnu.org/software/glibc/ ! 34. http://gcc.gnu.org/bugs.html#report ! 35. http://www.ncits.org/cplusplus.htm ! 36. http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_defects.html ! 37. http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html ! 38. http://www.validlab.com/goldberg/paper.ps --- 571,602 ---- 6. http://gcc.gnu.org/bugs.html#detailed 7. http://gcc.gnu.org/bugs.html#gnat 8. http://gcc.gnu.org/bugs.html#pch ! 9. http://gcc.gnu.org/bugs.html#known ! 10. http://gcc.gnu.org/bugs.html#general ! 11. http://gcc.gnu.org/bugs.html#fortran ! 12. http://gcc.gnu.org/bugs.html#c ! 13. http://gcc.gnu.org/bugs.html#cplusplus ! 14. http://gcc.gnu.org/bugs.html#updating ! 15. http://gcc.gnu.org/bugs.html#nonbugs ! 16. http://gcc.gnu.org/bugs.html#missing ! 17. http://gcc.gnu.org/bugs.html#parsing ! 18. http://gcc.gnu.org/bugs.html#-O3 ! 19. http://gcc.gnu.org/gnats.html ! 20. http://gcc.gnu.org/bugs.html#known ! 21. http://gcc.gnu.org/gnats.html ! 22. mailto:bug-gcc@gnu.org ! 23. mailto:gcc-bugs@gcc.gnu.org ! 24. http://gcc.gnu.org/gnats.html ! 25. http://gcc.gnu.org/bugs.html#gnat ! 26. http://gcc.gnu.org/bugs.html#pch ! 27. http://gcc.gnu.org/bugs.html#detailed ! 28. http://gcc.gnu.org/bugs.html#where ! 29. http://gcc.gnu.org/bugs.html#detailed 30. http://gcc.gnu.org/bugs.html#detailed ! 31. http://gcc.gnu.org/onlinedocs/g77/Trouble.html ! 32. http://www.gnu.org/software/glibc/ ! 33. http://gcc.gnu.org/bugs.html#report ! 34. http://www.ncits.org/cplusplus.htm ! 35. http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_defects.html ! 36. http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html ! 37. http://www.validlab.com/goldberg/paper.ps diff -Nrc3pad gcc-3.2.2/ChangeLog gcc-3.2.3/ChangeLog *** gcc-3.2.2/ChangeLog Wed Feb 5 03:02:21 2003 --- gcc-3.2.3/ChangeLog Tue Apr 22 06:14:01 2003 *************** *** 1,3 **** --- 1,11 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-02-12 Marc Espie + + * config-ml.in: Propagate DESTDIR. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/FAQ gcc-3.2.3/FAQ *** gcc-3.2.2/FAQ Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/FAQ Tue Apr 22 06:56:31 2003 *************** *** 2,8 **** GCC Frequently Asked Questions The latest version of this document is always available at ! [1]http://www.gnu.org/software/gcc/faq.html. This FAQ tries to answer specific questions concerning GCC. For general information regarding C, C++, resp. Fortran please check the --- 2,8 ---- GCC Frequently Asked Questions The latest version of this document is always available at ! [1]http://gcc.gnu.org/faq.html. This FAQ tries to answer specific questions concerning GCC. For general information regarding C, C++, resp. Fortran please check the *************** What is an open development model? *** 126,138 **** the past few months. The paper which started all of this introduced two terms: A cathedral development model versus a bazaar development model. The paper is written by Eric S. Raymond, it is ! called ``[37]The Cathedral and the Bazaar''. The paper is a useful starting point for discussions. _________________________________________________________________ How do I report a bug? ! There are complete instructions [38]here. _________________________________________________________________ How do I get a bug fixed or a feature added? --- 126,138 ---- the past few months. The paper which started all of this introduced two terms: A cathedral development model versus a bazaar development model. The paper is written by Eric S. Raymond, it is ! called ``The Cathedral and the Bazaar''. The paper is a useful starting point for discussions. _________________________________________________________________ How do I report a bug? ! There are complete instructions [37]here. _________________________________________________________________ How do I get a bug fixed or a feature added? *************** How do I get a bug fixed or a feature ad *** 147,153 **** * Hire someone to fix it for you. There are various companies and individuals providing support for GCC. This alternative costs money, but is relatively likely to get results. ! * [39]Report the problem to the GCC GNATS bug tracking system and hope that someone will be kind enough to fix it for you. While this is certainly possible, and often happens, there is no guarantee that it will. You should not expect the same response --- 147,153 ---- * Hire someone to fix it for you. There are various companies and individuals providing support for GCC. This alternative costs money, but is relatively likely to get results. ! * [38]Report the problem to the GCC GNATS bug tracking system and hope that someone will be kind enough to fix it for you. While this is certainly possible, and often happens, there is no guarantee that it will. You should not expect the same response *************** How do I get a bug fixed or a feature ad *** 155,161 **** organization since the people who read GCC bug reports, if they choose to help you, will be volunteering their time. This alternative will work best if you follow the directions on ! [40]submitting bugreports. * Fix it yourself. This alternative will probably bring results, if you work hard enough, but will probably take a lot of time, and, depending on the quality of your work and the perceived benefits --- 155,161 ---- organization since the people who read GCC bug reports, if they choose to help you, will be volunteering their time. This alternative will work best if you follow the directions on ! [39]submitting bugreports. * Fix it yourself. This alternative will probably bring results, if you work hard enough, but will probably take a lot of time, and, depending on the quality of your work and the perceived benefits *************** Does GCC work on my platform? *** 168,175 **** The host/target specific installation notes for GCC include information about known problems with installing or using GCC on particular platforms. These are included in the sources for a release ! in INSTALL/specific.html, and the [41]latest version is always ! available at the GCC web site. Reports of [42]successful builds for several versions of GCC are also available at the web site. _________________________________________________________________ --- 168,175 ---- The host/target specific installation notes for GCC include information about known problems with installing or using GCC on particular platforms. These are included in the sources for a release ! in INSTALL/specific.html, and the [40]latest version is always ! available at the GCC web site. Reports of [41]successful builds for several versions of GCC are also available at the web site. _________________________________________________________________ *************** How to install multiple versions of GCC *** 216,222 **** wish to be sure about which version you are invoking. If you use --prefix, GCC may have difficulty locating a GNU assembler ! or linker on your system, [43]GCC can not find GNU as/GNU ld explains how to deal with this. Another option that may be easier is to use the --program-prefix= or --- 216,222 ---- wish to be sure about which version you are invoking. If you use --prefix, GCC may have difficulty locating a GNU assembler ! or linker on your system, [42]GCC can not find GNU as/GNU ld explains how to deal with this. Another option that may be easier is to use the --program-prefix= or *************** GCC can not find GNU as/GNU ld *** 282,288 **** versions of those programs. To ensure that GCC finds the GNU assembler (the GNU loader), which are ! required by [44]some configurations, you should configure these with the same --prefix option as you used for GCC. Then build & install GNU as (GNU ld) and proceed with building GCC. --- 282,288 ---- versions of those programs. To ensure that GCC finds the GNU assembler (the GNU loader), which are ! required by [43]some configurations, you should configure these with the same --prefix option as you used for GCC. Then build & install GNU as (GNU ld) and proceed with building GCC. *************** Unable to run the testsuite *** 336,342 **** If you get a message about unable to find "standard.exp" when trying to run the GCC testsuites, then your dejagnu is too old to run the GCC tests. You will need to get a newer version of dejagnu from ! [45]http://www.gnu.org/software/dejagnu/dejagnu.html. _________________________________________________________________ How do I pass flags like -fnew-abi to the testsuite? --- 336,342 ---- If you get a message about unable to find "standard.exp" when trying to run the GCC testsuites, then your dejagnu is too old to run the GCC tests. You will need to get a newer version of dejagnu from ! [44]http://www.gnu.org/software/dejagnu/dejagnu.html. _________________________________________________________________ How do I pass flags like -fnew-abi to the testsuite? *************** How can I run the test suite with multip *** 371,377 **** Is there a stringstream / sstream for GCC 2.95.2? Yes, it's at: ! [46]http://gcc.gnu.org/ml/libstdc++/2000-q2/msg00700/sstream. _________________________________________________________________ Miscellaneous --- 371,377 ---- Is there a stringstream / sstream for GCC 2.95.2? Yes, it's at: ! [45]http://gcc.gnu.org/ml/libstdc++/2000-q2/msg00700/sstream. _________________________________________________________________ Miscellaneous *************** dynamic_cast, throw, typeid don't work w *** 470,476 **** [basic.def.odr]. For more details about the way that GCC implements these and other C++ ! features, please read the [47]ABI specification. Note the std::typeinfo_t objects which must be resolved all begin with "_ZTS". Refer to ld's documentation for a description of the "-E" & "-Bsymbolic" flags. --- 470,476 ---- [basic.def.odr]. For more details about the way that GCC implements these and other C++ ! features, please read the [46]ABI specification. Note the std::typeinfo_t objects which must be resolved all begin with "_ZTS". Refer to ld's documentation for a description of the "-E" & "-Bsymbolic" flags. *************** Why do I need autoconf, bison, xgettext, *** 501,510 **** rebuild GCC. In general, the current versions of these tools from ! [48]ftp://ftp.gnu.org/gnu/ will work. At present, Autoconf 2.50 is not supported, and you will need to use Autoconf 2.13; work is in progress to fix this problem. Also look at ! [49]ftp://gcc.gnu.org/pub/gcc/infrastructure/ for any special versions of packages. _________________________________________________________________ --- 501,510 ---- rebuild GCC. In general, the current versions of these tools from ! [47]ftp://ftp.gnu.org/gnu/ will work. At present, Autoconf 2.50 is not supported, and you will need to use Autoconf 2.13; work is in progress to fix this problem. Also look at ! [48]ftp://gcc.gnu.org/pub/gcc/infrastructure/ for any special versions of packages. _________________________________________________________________ *************** Will GCC someday include an incremental *** 560,568 **** References ! 1. http://www.gnu.org/software/gcc/faq.html 2. http://www.eskimo.com/~scs/C-faq/top.html ! 3. http://www.research.att.com/~austern/csc/faq.html 4. http://www.fortran.com/fortran/info.html 5. http://gcc.gnu.org/onlinedocs/libstdc++/faq/index.html 6. http://gcc.gnu.org/java/faq.html --- 560,568 ---- References ! 1. http://gcc.gnu.org/faq.html 2. http://www.eskimo.com/~scs/C-faq/top.html ! 3. http://www.jamesd.demon.co.uk/csc/faq.html 4. http://www.fortran.com/fortran/info.html 5. http://gcc.gnu.org/onlinedocs/libstdc++/faq/index.html 6. http://gcc.gnu.org/java/faq.html *************** References *** 596,611 **** 34. http://gcc.gnu.org/steering.html 35. http://gcc.gnu.org/steering.html 36. http://gcc.gnu.org/faq.html#cathedral-vs-bazaar ! 37. http://www.tuxedo.org/~esr/writings/cathedral-bazaar/ 38. http://gcc.gnu.org/bugs.html 39. http://gcc.gnu.org/bugs.html ! 40. http://gcc.gnu.org/bugs.html ! 41. http://gcc.gnu.org/install/specific.html ! 42. http://gcc.gnu.org/buildstat.html ! 43. http://gcc.gnu.org/faq.html#gas ! 44. http://gcc.gnu.org/install/specific.html ! 45. http://www.gnu.org/software/dejagnu/dejagnu.html ! 46. http://gcc.gnu.org/ml/libstdc++/2000-q2/msg00700/sstream ! 47. http://www.codesourcery.com/cxx-abi/ ! 48. ftp://ftp.gnu.org/gnu/ ! 49. ftp://gcc.gnu.org/pub/gcc/infrastructure/ --- 596,610 ---- 34. http://gcc.gnu.org/steering.html 35. http://gcc.gnu.org/steering.html 36. http://gcc.gnu.org/faq.html#cathedral-vs-bazaar ! 37. http://gcc.gnu.org/bugs.html 38. http://gcc.gnu.org/bugs.html 39. http://gcc.gnu.org/bugs.html ! 40. http://gcc.gnu.org/install/specific.html ! 41. http://gcc.gnu.org/buildstat.html ! 42. http://gcc.gnu.org/faq.html#gas ! 43. http://gcc.gnu.org/install/specific.html ! 44. http://www.gnu.org/software/dejagnu/dejagnu.html ! 45. http://gcc.gnu.org/ml/libstdc++/2000-q2/msg00700/sstream ! 46. http://www.codesourcery.com/cxx-abi/ ! 47. ftp://ftp.gnu.org/gnu/ ! 48. ftp://gcc.gnu.org/pub/gcc/infrastructure/ diff -Nrc3pad gcc-3.2.2/INSTALL/binaries.html gcc-3.2.3/INSTALL/binaries.html *** gcc-3.2.2/INSTALL/binaries.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/binaries.html Tue Apr 22 06:56:34 2003 *************** *** 1,59 **** ! Installing GCC: Binaries ! ! ! ! ! !

W

e are often asked about pre-compiled versions of GCC. While we cannot provide these for all platforms, below you'll find links to binaries for various platforms where creating them by yourself is not easy due to various reasons. !

Please note that we did not create these binaries, nor do we support them. If you have any problems installing them, please contact their makers. !

!

In addition to those specific offerings, you can get a binary distribution CD-ROM from the Free Software Foundation. It contains binaries for a number of platforms, and --- 1,61 ---- ! ! Installing GCC: Binaries ! ! ! ! ! !

Installing GCC: Binaries

! We are often asked about pre-compiled versions of GCC. While we cannot provide these for all platforms, below you'll find links to binaries for various platforms where creating them by yourself is not easy due to various reasons. !

Please note that we did not create these binaries, nor do we support them. If you have any problems installing them, please contact their makers. !

!

In addition to those specific offerings, you can get a binary distribution CD-ROM from the Free Software Foundation. It contains binaries for a number of platforms, and *************** not contain the latest version of GCC, b *** 62,70 **** bootstrapping the compiler. An updated version of that disk is in the works. !

Return to the GCC Installation page ! --- 64,72 ---- bootstrapping the compiler. An updated version of that disk is in the works. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/build.html gcc-3.2.3/INSTALL/build.html *** gcc-3.2.2/INSTALL/build.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/build.html Tue Apr 22 06:56:33 2003 *************** *** 1,100 **** ! Installing GCC: Building ! ! ! ! ! !

N

ow that GCC is configured, you are ready to build the compiler and runtime libraries. !

We highly recommend that GCC be built using GNU make; other versions may work, then again they might not. GNU make is required for compiling GNAT (the Ada compiler) and the Java runtime library. !

(For example, many broken versions of make will fail if you use the recommended setup where objdir is different from srcdir. Other broken versions may recompile parts of the compiler when installing the compiler.) !

Some commands executed when making the compiler may fail (return a nonzero status) and be ignored by make. These failures, which are often due to files that were not found, are expected, and can safely be ignored. !

It is normal to have compiler warnings when compiling certain files. Unless you are a GCC developer, you can generally ignore these warnings unless they cause compilation to fail. !

On certain old systems, defining certain environment variables such as CC can interfere with the functioning of make. !

If you encounter seemingly strange errors when trying to build the compiler in a directory other than the source directory, it could be because you have previously configured the compiler in the source directory. Make sure you have done all the necessary preparations. !

If you build GCC on a BSD system using a directory stored in an old System V file system, problems may occur in running fixincludes if the System V file system doesn't support symbolic links. These problems result in a failure to fix the declaration of size_t in sys/types.h. If you find that size_t is a signed type and that type mismatches occur, this could be the cause. !

The solution is not to use such a directory for building GCC. !

When building from CVS or snapshots, or if you modify parser sources, you need the Bison parser generator installed. Any version 1.25 or later should work; older versions may also work. If you do not modify parser sources, releases contain the Bison-generated files and you do not need Bison installed to build them. !

When building from CVS or snapshots, or if you modify Texinfo documentation, you need version 4.1 or later of Texinfo installed if you want Info documentation to be regenerated. Releases contain Info documentation pre-built for the unmodified documentation in the release. !

Building a native compiler

!

For a native build issue the command make bootstrap. This will build the entire GCC system, which includes the following steps: !

!

If you are short on disk space you might consider make bootstrap-lean instead. This is identical to make bootstrap except that object files from the stage1 and stage2 of the 3-stage bootstrap of the compiler are deleted as soon as they are no longer needed. !

If you want to save additional space during the bootstrap and in the final installation as well, you can build the compiler binaries without debugging information as in the following example. This will save roughly 40% of disk space both for the bootstrap and the final installation. (Libraries will still contain debugging information.) ! 

     make CFLAGS='-O' LIBCFLAGS='-g -O2' \
!        LIBCXXFLAGS='-g -O2 -fno-implicit-templates' bootstrap
!
!

If you wish to use non-default GCC flags when compiling the stage2 and stage3 compilers, set BOOT_CFLAGS on the command line when doing make bootstrap. Non-default optimization flags are less well tested here than the default of -g -O2, but should still work. --- 1,102 ---- ! ! Installing GCC: Building ! ! ! ! ! !

Installing GCC: Building

! Now that GCC is configured, you are ready to build the compiler and runtime libraries. !

We highly recommend that GCC be built using GNU make; other versions may work, then again they might not. GNU make is required for compiling GNAT (the Ada compiler) and the Java runtime library. !

(For example, many broken versions of make will fail if you use the recommended setup where objdir is different from srcdir. Other broken versions may recompile parts of the compiler when installing the compiler.) !

Some commands executed when making the compiler may fail (return a nonzero status) and be ignored by make. These failures, which are often due to files that were not found, are expected, and can safely be ignored. !

It is normal to have compiler warnings when compiling certain files. Unless you are a GCC developer, you can generally ignore these warnings unless they cause compilation to fail. !

On certain old systems, defining certain environment variables such as CC can interfere with the functioning of make. !

If you encounter seemingly strange errors when trying to build the compiler in a directory other than the source directory, it could be because you have previously configured the compiler in the source directory. Make sure you have done all the necessary preparations. !

If you build GCC on a BSD system using a directory stored in an old System V file system, problems may occur in running fixincludes if the System V file system doesn't support symbolic links. These problems result in a failure to fix the declaration of size_t in sys/types.h. If you find that size_t is a signed type and that type mismatches occur, this could be the cause. !

The solution is not to use such a directory for building GCC. !

When building from CVS or snapshots, or if you modify parser sources, you need the Bison parser generator installed. Any version 1.25 or later should work; older versions may also work. If you do not modify parser sources, releases contain the Bison-generated files and you do not need Bison installed to build them. !

When building from CVS or snapshots, or if you modify Texinfo documentation, you need version 4.1 or later of Texinfo installed if you want Info documentation to be regenerated. Releases contain Info documentation pre-built for the unmodified documentation in the release. !

Building a native compiler

!

For a native build issue the command make bootstrap. This will build the entire GCC system, which includes the following steps: !

!

If you are short on disk space you might consider make bootstrap-lean instead. This is identical to make bootstrap except that object files from the stage1 and stage2 of the 3-stage bootstrap of the compiler are deleted as soon as they are no longer needed. !

If you want to save additional space during the bootstrap and in the final installation as well, you can build the compiler binaries without debugging information as in the following example. This will save roughly 40% of disk space both for the bootstrap and the final installation. (Libraries will still contain debugging information.) ! 

          make CFLAGS='-O' LIBCFLAGS='-g -O2' \
!             LIBCXXFLAGS='-g -O2 -fno-implicit-templates' bootstrap
!
!

If you wish to use non-default GCC flags when compiling the stage2 and stage3 compilers, set BOOT_CFLAGS on the command line when doing make bootstrap. Non-default optimization flags are less well tested here than the default of -g -O2, but should still work. *************** around this, by choosing BOOT_CFLA *** 105,176 **** stage1 compiler that were miscompiled, or by using make bootstrap4 to increase the number of stages of bootstrap. !

If you used the flag --enable-languages=... to restrict the compilers to be built, only those you've actually enabled will be built. This will of course only build those runtime libraries, for which the particular compiler has been built. Please note, that re-defining LANGUAGES when calling make bootstrap does not work anymore! !

If the comparison of stage2 and stage3 fails, this normally indicates that the stage2 compiler has compiled GCC incorrectly, and is therefore a potentially serious bug which you should investigate and report. (On a few systems, meaningful comparison of object files is impossible; they always appear "different". If you encounter this problem, you will need to disable comparison in the Makefile.) !

Building a cross compiler

!

We recommend reading the crossgcc FAQ for information about building cross compilers. !

When building a cross compiler, it is not generally possible to do a 3-stage bootstrap of the compiler. This makes for an interesting problem as parts of GCC can only be built with GCC. !

To build a cross compiler, we first recommend building and installing a native compiler. You can then use the native GCC compiler to build the cross compiler. The installed native compiler needs to be GCC version 2.95 or later. !

Assuming you have already installed a native copy of GCC and configured your cross compiler, issue the command make, which performs the following steps: !

!

Note that if an error occurs in any step the make process will exit. !

Building in parallel

!

If you have a multiprocessor system you can use make bootstrap MAKE="make -j 2" -j 2 or just make -j 2 bootstrap for GNU Make 3.79 and above instead of just make bootstrap when building GCC. You can use a bigger number instead of two if you like. In most cases, it won't help to use a number bigger than the number of processors in your machine. !

Building the Ada compiler

!

In order to build GNAT, the Ada compiler, you need a working GNAT compiler (GNAT version 3.13 or later, or GCC version 3.1 or later), since the Ada front end is written in Ada (with some GNAT-specific extensions), and GNU make. !

However, you do not need a full installation of GNAT, just the GNAT binary gnat1, a copy of gnatbind, and a compiler driver which can deal with Ada input (by invoking the gnat1 binary). You can specify this compiler driver by setting the ADAC --- 107,178 ---- stage1 compiler that were miscompiled, or by using make bootstrap4 to increase the number of stages of bootstrap. !

If you used the flag --enable-languages=... to restrict the compilers to be built, only those you've actually enabled will be built. This will of course only build those runtime libraries, for which the particular compiler has been built. Please note, that re-defining LANGUAGES when calling make bootstrap does not work anymore! !

If the comparison of stage2 and stage3 fails, this normally indicates that the stage2 compiler has compiled GCC incorrectly, and is therefore a potentially serious bug which you should investigate and report. (On a few systems, meaningful comparison of object files is impossible; they always appear "different". If you encounter this problem, you will need to disable comparison in the Makefile.) !

Building a cross compiler

!

We recommend reading the crossgcc FAQ for information about building cross compilers. !

When building a cross compiler, it is not generally possible to do a 3-stage bootstrap of the compiler. This makes for an interesting problem as parts of GCC can only be built with GCC. !

To build a cross compiler, we first recommend building and installing a native compiler. You can then use the native GCC compiler to build the cross compiler. The installed native compiler needs to be GCC version 2.95 or later. !

Assuming you have already installed a native copy of GCC and configured your cross compiler, issue the command make, which performs the following steps: !

!

Note that if an error occurs in any step the make process will exit. !

Building in parallel

!

If you have a multiprocessor system you can use make bootstrap MAKE="make -j 2" -j 2 or just make -j 2 bootstrap for GNU Make 3.79 and above instead of just make bootstrap when building GCC. You can use a bigger number instead of two if you like. In most cases, it won't help to use a number bigger than the number of processors in your machine. !

Building the Ada compiler

!

In order to build GNAT, the Ada compiler, you need a working GNAT compiler (GNAT version 3.13 or later, or GCC version 3.1 or later), since the Ada front end is written in Ada (with some GNAT-specific extensions), and GNU make. !

However, you do not need a full installation of GNAT, just the GNAT binary gnat1, a copy of gnatbind, and a compiler driver which can deal with Ada input (by invoking the gnat1 binary). You can specify this compiler driver by setting the ADAC *************** and has a sufficiently recent version; i *** 183,224 **** installed, the build will fail unless --enable-languages is used to disable building the Ada front end. !

Additional build tools (such as gnatmake) or a working GNAT run-time library installation are usually not required. However, if you want to bootstrap the compiler using a minimal version of GNAT, you have to issue the following commands before invoking make bootstrap (this assumes that you start with an unmodified and consistent source distribution): ! 

    cd srcdir/gcc/ada
!     touch treeprs.ads [es]info.h nmake.ad[bs]
!
!

At the moment, the GNAT library and several tools for GNAT are not built by make bootstrap. You have to invoke ! make gnatlib_and_tools in the objdir/gcc subdirectory before proceeding with the next steps. !

For example, you can build a native Ada compiler by issuing the following commands (assuming make is GNU make): ! 

    cd objdir
!     srcdir/configure --enable-languages=c,ada
!     cd srcdir/gcc/ada
!     touch treeprs.ads [es]info.h nmake.ad[bs]
!     cd objdir
!     make bootstrap
!     cd gcc
!     make gnatlib_and_tools
!     cd ..
!
!

Currently, when compiling the Ada front end, you cannot use the parallel build feature described in the previous section. !

Return to the GCC Installation page ! --- 185,226 ---- installed, the build will fail unless --enable-languages is used to disable building the Ada front end. !

Additional build tools (such as gnatmake) or a working GNAT run-time library installation are usually not required. However, if you want to bootstrap the compiler using a minimal version of GNAT, you have to issue the following commands before invoking make bootstrap (this assumes that you start with an unmodified and consistent source distribution): ! 

         cd srcdir/gcc/ada
!          touch treeprs.ads [es]info.h nmake.ad[bs]
!
!

At the moment, the GNAT library and several tools for GNAT are not built by make bootstrap. You have to invoke ! make gnatlib_and_tools in the objdir/gcc subdirectory before proceeding with the next steps. !

For example, you can build a native Ada compiler by issuing the following commands (assuming make is GNU make): ! 

         cd objdir
!          srcdir/configure --enable-languages=c,ada
!          cd srcdir/gcc/ada
!          touch treeprs.ads [es]info.h nmake.ad[bs]
!          cd objdir
!          make bootstrap
!          cd gcc
!          make gnatlib_and_tools
!          cd ..
!
!

Currently, when compiling the Ada front end, you cannot use the parallel build feature described in the previous section. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/configure.html gcc-3.2.3/INSTALL/configure.html *** gcc-3.2.2/INSTALL/configure.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/configure.html Tue Apr 22 06:56:33 2003 *************** *** 1,30 **** ! Installing GCC: Configuration ! ! ! ! ! !

L

ike most GNU software, GCC must be configured before it can be built. This document describes the recommended configuration procedure for both native and cross targets. !

We use srcdir to refer to the toplevel source directory for GCC; we use objdir to refer to the toplevel build/object directory. !

If you obtained the sources via CVS, srcdir must refer to the top gcc directory, the one where the MAINTAINERS can be found, and not its gcc subdirectory, otherwise the build will fail. !

First, we highly recommend that GCC be built into a separate directory than the sources which does not reside within the source tree. This is how we generally build GCC; building where srcdir == objdir should still work, but doesn't get extensive testing; building where objdir is a subdirectory of srcdir is unsupported. !

If you have previously built GCC in the same directory for a different target machine, do make distclean to delete all files that might be invalid. One of the files this deletes is Makefile; if make distclean complains that Makefile --- 1,32 ---- ! ! Installing GCC: Configuration ! ! ! ! ! !

Installing GCC: Configuration

! Like most GNU software, GCC must be configured before it can be built. This document describes the recommended configuration procedure for both native and cross targets. !

We use srcdir to refer to the toplevel source directory for GCC; we use objdir to refer to the toplevel build/object directory. !

If you obtained the sources via CVS, srcdir must refer to the top gcc directory, the one where the MAINTAINERS can be found, and not its gcc subdirectory, otherwise the build will fail. !

First, we highly recommend that GCC be built into a separate directory than the sources which does not reside within the source tree. This is how we generally build GCC; building where srcdir == objdir should still work, but doesn't get extensive testing; building where objdir is a subdirectory of srcdir is unsupported. !

If you have previously built GCC in the same directory for a different target machine, do make distclean to delete all files that might be invalid. One of the files this deletes is Makefile; if make distclean complains that Makefile *************** clean. However, with the recommended me *** 33,142 **** objdir, you should simply use a different objdir for each target. !

Second, when configuring a native system, either cc or gcc must be in your path or you must set CC in your environment before running configure. Otherwise the configuration scripts may fail. !

Note that the bootstrap compiler and the resulting GCC must be link compatible, else the bootstrap will fail with linker errors about incompatible object file formats. Several multilibed targets are affected by this requirement, see host/target specific installation notes. !

To configure GCC: ! 

   % mkdir objdir
!    % cd objdir
!    % srcdir/configure [options] [target]
!
!

Target specification

!
  • GCC has code to correctly determine the correct value for target for nearly all native systems. Therefore, we highly recommend you not provide a configure target when configuring a native compiler. !
  • target must be specified as --target=target when configuring a cross compiler; examples of valid targets would be i960-rtems, m68k-coff, sh-elf, etc. !
  • Specifying just target instead of --target=target implies that the host defaults to target.
!

Options specification

!

Use options to override several configure time options for GCC. A list of supported options follows; configure --help may list other options, but those not listed below may not work and should not normally be used. !

!
--prefix=dirname !
Specify the toplevel installation directory. This is the recommended way to install the tools into a directory other than the default. The toplevel installation directory defaults to /usr/local. !

We highly recommend against dirname being the same or a subdirectory of objdir or vice versa. !

These additional options control where certain parts of the distribution are installed. Normally you should not need to use these options. !

!
--exec-prefix=dirname !
Specify the toplevel installation directory for architecture-dependent ! files. The default is prefix. !
--bindir=dirname !
Specify the installation directory for the executables called by users (such as gcc and g++). The default is ! exec-prefix/bin. !
--libdir=dirname !
Specify the installation directory for object code libraries and ! internal parts of GCC. The default is exec-prefix/lib. !
--with-slibdir=dirname !
Specify the installation directory for the shared libgcc library. The ! default is libdir. !
--infodir=dirname !
Specify the installation directory for documentation in info format. ! The default is prefix/info. !
--mandir=dirname !
Specify the installation directory for manual pages. The default is ! prefix/man. (Note that the manual pages are only extracts from the full GCC manuals, which are provided in Texinfo format. The g77 manpage is unmaintained and may be out of date; the others are derived by an automatic conversion process from parts of the full manual.) !
--with-gxx-include-dir=dirname !
Specify the installation directory for G++ header files. The default is ! prefix/include/g++-v3. !
!
--program-prefix=prefix !
GCC supports some transformations of the names of its programs when installing them. This option prepends prefix to the names of programs to install in bindir (see above). For example, specifying --program-prefix=foo- would result in gcc being installed as /usr/local/bin/foo-gcc. !
--program-suffix=suffix !
Appends suffix to the names of programs to install in bindir (see above). For example, specifying --program-suffix=-3.1 would result in gcc being installed as /usr/local/bin/gcc-3.1. !
--program-transform-name=pattern !
Applies the sed script pattern to be applied to the names of programs to install in bindir (see above). pattern has to consist of one or more basic sed editing commands, separated by semicolons. For example, if you want the gcc program name to be --- 35,144 ---- objdir, you should simply use a different objdir for each target. !

Second, when configuring a native system, either cc or gcc must be in your path or you must set CC in your environment before running configure. Otherwise the configuration scripts may fail. !

Note that the bootstrap compiler and the resulting GCC must be link compatible, else the bootstrap will fail with linker errors about incompatible object file formats. Several multilibed targets are affected by this requirement, see host/target specific installation notes. !

To configure GCC: ! 

        % mkdir objdir
!         % cd objdir
!         % srcdir/configure [options] [target]
!
!

Target specification

!
  • GCC has code to correctly determine the correct value for target for nearly all native systems. Therefore, we highly recommend you not provide a configure target when configuring a native compiler. !
  • target must be specified as --target=target when configuring a cross compiler; examples of valid targets would be i960-rtems, m68k-coff, sh-elf, etc. !
  • Specifying just target instead of --target=target implies that the host defaults to target.
!

Options specification

!

Use options to override several configure time options for GCC. A list of supported options follows; configure --help may list other options, but those not listed below may not work and should not normally be used. !

!
--prefix=dirname !
Specify the toplevel installation directory. This is the recommended way to install the tools into a directory other than the default. The toplevel installation directory defaults to /usr/local. !

We highly recommend against dirname being the same or a subdirectory of objdir or vice versa. !

These additional options control where certain parts of the distribution are installed. Normally you should not need to use these options. !

!
--exec-prefix=dirname !
Specify the toplevel installation directory for architecture-dependent ! files. The default is prefix. !
--bindir=dirname !
Specify the installation directory for the executables called by users (such as gcc and g++). The default is ! exec-prefix/bin. !
--libdir=dirname !
Specify the installation directory for object code libraries and ! internal parts of GCC. The default is exec-prefix/lib. !
--with-slibdir=dirname !
Specify the installation directory for the shared libgcc library. The ! default is libdir. !
--infodir=dirname !
Specify the installation directory for documentation in info format. ! The default is prefix/info. !
--mandir=dirname !
Specify the installation directory for manual pages. The default is ! prefix/man. (Note that the manual pages are only extracts from the full GCC manuals, which are provided in Texinfo format. The g77 manpage is unmaintained and may be out of date; the others are derived by an automatic conversion process from parts of the full manual.) !
--with-gxx-include-dir=dirname !
Specify the installation directory for G++ header files. The default is ! prefix/include/g++-v3. !
!
--program-prefix=prefix !
GCC supports some transformations of the names of its programs when installing them. This option prepends prefix to the names of programs to install in bindir (see above). For example, specifying --program-prefix=foo- would result in gcc being installed as /usr/local/bin/foo-gcc. !
--program-suffix=suffix !
Appends suffix to the names of programs to install in bindir (see above). For example, specifying --program-suffix=-3.1 would result in gcc being installed as /usr/local/bin/gcc-3.1. !
--program-transform-name=pattern !
Applies the sed script pattern to be applied to the names of programs to install in bindir (see above). pattern has to consist of one or more basic sed editing commands, separated by semicolons. For example, if you want the gcc program name to be *************** you could use the pattern *** 147,162 **** --program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/' to achieve this effect. !

All three options can be combined and used together, resulting in more complex conversion patterns. As a basic rule, prefix (and suffix) are prepended (appended) before further transformations can happen with a special transformation script pattern. !

As currently implemented, these options only take effect for native builds; cross compiler binaries' names are not transformed even when a transformation is explicitly asked for by one of these options. !

For native builds, some of the installed programs are also installed with the target alias in front of their name, as in i686-pc-linux-gnu-gcc. All of the above transformations happen before the target alias is prepended to the name - so, specifying --- 149,164 ---- --program-transform-name='s/^gcc$/myowngcc/; s/^g++$/gspecial++/' to achieve this effect. !

All three options can be combined and used together, resulting in more complex conversion patterns. As a basic rule, prefix (and suffix) are prepended (appended) before further transformations can happen with a special transformation script pattern. !

As currently implemented, these options only take effect for native builds; cross compiler binaries' names are not transformed even when a transformation is explicitly asked for by one of these options. !

For native builds, some of the installed programs are also installed with the target alias in front of their name, as in i686-pc-linux-gnu-gcc. All of the above transformations happen before the target alias is prepended to the name - so, specifying *************** before the target alias is prepended to *** 164,196 **** resulting binary would be installed as /usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1. !

As a last shortcoming, none of the installed Ada programs are transformed yet, which will be fixed in some time. !

--with-local-prefix=dirname !
Specify the installation directory for local include files. The default is /usr/local. Specify this option if you want the compiler to ! search directory dirname/include for locally installed header files instead of /usr/local/include. !

You should specify --with-local-prefix only if your site has a different convention (not /usr/local) for where to put site-specific files. !

The default value for --with-local-prefix is /usr/local regardless of the value of --prefix. Specifying --prefix has no effect on which directory GCC searches for local header files. This may seem counterintuitive, but actually it is logical. !

The purpose of --prefix is to specify where to install GCC. The local header files in /usr/local/include--if you put any in that directory--are not part of GCC. They are part of other programs--perhaps many others. (GCC installs its own header files in another directory which is based on the --prefix value.) !

Both the local-prefix include directory and the GCC-prefix include directory are part of GCC's "system include" directories. Although these two directories are not fixed, they need to be searched in the proper order for the correct processing of the include_next directive. The --- 166,198 ---- resulting binary would be installed as /usr/local/bin/i686-pc-linux-gnu-foo-gcc-3.1. !

As a last shortcoming, none of the installed Ada programs are transformed yet, which will be fixed in some time. !

--with-local-prefix=dirname !
Specify the installation directory for local include files. The default is /usr/local. Specify this option if you want the compiler to ! search directory dirname/include for locally installed header files instead of /usr/local/include. !

You should specify --with-local-prefix only if your site has a different convention (not /usr/local) for where to put site-specific files. !

The default value for --with-local-prefix is /usr/local regardless of the value of --prefix. Specifying --prefix has no effect on which directory GCC searches for local header files. This may seem counterintuitive, but actually it is logical. !

The purpose of --prefix is to specify where to install GCC. The local header files in /usr/local/include--if you put any in that directory--are not part of GCC. They are part of other programs--perhaps many others. (GCC installs its own header files in another directory which is based on the --prefix value.) !

Both the local-prefix include directory and the GCC-prefix include directory are part of GCC's "system include" directories. Although these two directories are not fixed, they need to be searched in the proper order for the correct processing of the include_next directive. The *************** local-prefix include directory is search *** 198,204 **** include directory. Another characteristic of system include directories is that pedantic warnings are turned off for headers in these directories. !

Some autoconf macros add -I directory options to the compiler command line, to ensure that directories containing installed packages' headers are searched. When directory is one of GCC's system include directories, GCC will ignore the option so that system --- 200,206 ---- include directory. Another characteristic of system include directories is that pedantic warnings are turned off for headers in these directories. !

Some autoconf macros add -I directory options to the compiler command line, to ensure that directories containing installed packages' headers are searched. When directory is one of GCC's system include directories, GCC will ignore the option so that system *************** directories continue to be processed in *** 206,219 **** may result in a search order different from what was specified but the directory will still be searched. !

GCC automatically searches for ordinary libraries using GCC_EXEC_PREFIX. Thus, when the same installation prefix is used for both GCC and packages, GCC will automatically search for both headers and libraries. This provides a configuration that is easy to use. GCC behaves in a manner similar to that when it is installed as a system compiler in /usr. !

Sites that need to install multiple versions of GCC may not want to use the above simple configuration. It is possible to use the --program-prefix, --program-suffix and --program-transform-name options to install multiple versions --- 208,221 ---- may result in a search order different from what was specified but the directory will still be searched. !

GCC automatically searches for ordinary libraries using GCC_EXEC_PREFIX. Thus, when the same installation prefix is used for both GCC and packages, GCC will automatically search for both headers and libraries. This provides a configuration that is easy to use. GCC behaves in a manner similar to that when it is installed as a system compiler in /usr. !

Sites that need to install multiple versions of GCC may not want to use the above simple configuration. It is possible to use the --program-prefix, --program-suffix and --program-transform-name options to install multiple versions *************** site-specific files for each version. I *** 223,252 **** users to specify explicitly the location of local site libraries (e.g., with LIBRARY_PATH). !

The same value can be used for both --with-local-prefix and --prefix provided it is not /usr. This can be used to avoid the default search of /usr/local/include. !

Do not specify /usr as the --with-local-prefix! The directory you use for --with-local-prefix must not contain any of the system's standard header files. If it did contain them, certain programs would be miscompiled (including GNU Emacs, on certain targets), because this would override and nullify the header file corrections made by the fixincludes script. !

Indications are that people who use this option use it based on mistaken ideas of what it is for. People use it as if it specified where to install part of GCC. Perhaps they make this assumption because installing GCC creates the directory. !

--enable-shared[=package[,...]] !
Build shared versions of libraries, if shared libraries are supported on the target platform. Unlike GCC 2.95.x and earlier, shared libraries are enabled by default on all platforms that support shared libraries, except for libobjc which is built as a static library only by default. !

If a list of packages is given as an argument, build shared libraries only for the listed packages. For other packages, only static libraries will be built. Package names currently recognized in the GCC tree are libgcc (also known as gcc), libstdc++ (not --- 225,254 ---- users to specify explicitly the location of local site libraries (e.g., with LIBRARY_PATH). !

The same value can be used for both --with-local-prefix and --prefix provided it is not /usr. This can be used to avoid the default search of /usr/local/include. !

Do not specify /usr as the --with-local-prefix! The directory you use for --with-local-prefix must not contain any of the system's standard header files. If it did contain them, certain programs would be miscompiled (including GNU Emacs, on certain targets), because this would override and nullify the header file corrections made by the fixincludes script. !

Indications are that people who use this option use it based on mistaken ideas of what it is for. People use it as if it specified where to install part of GCC. Perhaps they make this assumption because installing GCC creates the directory. !

--enable-shared[=package[,...]] !
Build shared versions of libraries, if shared libraries are supported on the target platform. Unlike GCC 2.95.x and earlier, shared libraries are enabled by default on all platforms that support shared libraries, except for libobjc which is built as a static library only by default. !

If a list of packages is given as an argument, build shared libraries only for the listed packages. For other packages, only static libraries will be built. Package names currently recognized in the GCC tree are libgcc (also known as gcc), libstdc++ (not *************** any name, so, if you list package names *** 256,464 **** you will only get static Objective-C libraries. libf2c and libiberty do not support shared libraries at all. !

Use --disable-shared to build only static libraries. Note that --disable-shared does not accept a list of package names as argument, only --enable-shared does. !

--with-gnu-as !
Specify that the compiler should assume that the assembler it finds is the GNU assembler. However, this does not modify the rules to find an assembler and will result in confusion if found assembler is not actually the GNU assembler. (Confusion will also result if the compiler finds the GNU assembler but has not been configured with --with-gnu-as.) If you have more than one assembler installed on your system, you may want to use this option in ! connection with --with-as=pathname. !

The following systems are the only ones where it makes a difference whether you use the GNU assembler. On any other system, --with-gnu-as has no effect. !

    !
  • hppa1.0-any-any !
  • hppa1.1-any-any !
  • i386-any-sysv !
  • i386-any-isc !
  • i860-any-bsd
  • m68k-bull-sysv
  • m68k-hp-hpux
  • m68k-sony-bsd
  • m68k-altos-sysv
  • m68000-hp-hpux
  • m68000-att-sysv !
  • any-lynx-lynxos !
  • mips-any
!

On the systems listed above (except for the HP-PA, for ISC on the 386, and for mips-sgi-irix5.*), if you use the GNU assembler, you should also use the GNU linker (and specify --with-gnu-ld). !

--with-as=pathname !
Specify that the compiler should use the assembler pointed to by pathname, rather than the one found by the standard rules to find an assembler, which are: !
  • Check the ! exec_prefix/lib/gcc-lib/target/version directory, where exec_prefix defaults to prefix which defaults to /usr/local unless overridden by the ! --prefix=pathname switch described above. target is the target system triple, such as sparc-sun-solaris2.7, and version denotes the GCC version, such as 3.0.
  • Check operating system specific directories (e.g. /usr/ccs/bin on Sun Solaris 2).
! Note that these rules do not check for the value of PATH. You may want to use --with-as if no assembler is installed in the directories listed above, or if you have multiple assemblers installed and want to choose one that is not found by the above rules. !
--with-gnu-ld !
Same as --with-gnu-as but for linker. !
--with-ld=pathname !
Same as --with-as, but for the linker. !
--with-stabs !
Specify that stabs debugging information should be used instead of whatever format the host normally uses. Normally GCC uses the same debug format as the host system. !

On MIPS based systems and on Alphas, you must specify whether you want GCC to create the normal ECOFF debugging format, or to use BSD-style stabs passed through the ECOFF symbol table. The normal ECOFF debug format cannot fully handle languages other than C. BSD stabs format can handle other languages, but it only works with the GNU debugger GDB. !

Normally, GCC uses the ECOFF debugging format by default; if you prefer BSD stabs, specify --with-stabs when you configure GCC. !

No matter which default you choose when you configure GCC, the user can use the -gcoff and -gstabs+ options to specify explicitly the debug format for a particular compilation. !

--with-stabs is meaningful on the ISC system on the 386, also, if --with-gas is used. It selects use of stabs debugging information embedded in COFF output. This kind of debugging information supports C++ well; ordinary COFF debugging information does not. !

--with-stabs is also meaningful on 386 systems running SVR4. It selects use of stabs debugging information embedded in ELF output. The C++ compiler currently (2.6.0) does not support the DWARF debugging information normally used on 386 SVR4 platforms; stabs provide a workable alternative. This requires gas and gdb, as the normal SVR4 tools can not generate or interpret stabs. !

--disable-multilib !
Specify that multiple target libraries to support different target variants, calling conventions, etc should not be built. The default is to build a predefined set of them. !

Some targets provide finer-grained control over which multilibs are built (e.g., --disable-softfloat): !

arc-*-elf* !
biendian. !
arm-*-* !
fpu, 26bit, underscore, interwork, biendian, nofmult. !
m68*-*-* !
softfloat, m68881, m68000, m68020. !
mips*-*-* !
single-float, biendian, softfloat. !
powerpc*-*-*, rs6000*-*-* !
aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos, biendian, sysv, aix. !
!
--enable-threads !
Specify that the target supports threads. This affects the Objective-C compiler and runtime library, and exception handling for other languages like C++ and Java. On some systems, this is the default. !

In general, the best (and, in many cases, the only known) threading model available will be configured for use. Beware that on some systems, gcc has not been taught what threading models are generally available for the system. In this case, --enable-threads is an alias for --enable-threads=single. !

--disable-threads !
Specify that threading support should be disabled for the system. This is an alias for --enable-threads=single. !
--enable-threads=lib !
Specify that lib is the thread support library. This affects the Objective-C compiler and runtime library, and exception handling for other languages like C++ and Java. The possibilities for lib are: !
aix !
AIX thread support.
dce !
DCE thread support.
mach !
Generic MACH thread support, known to work on NeXTSTEP. (Please note that the file needed to support this configuration, gthr-mach.h, is missing and thus this setting will cause a known bootstrap failure.)
no !
This is an alias for single.
posix !
Generic POSIX thread support.
pthreads !
Same as posix on arm*-*-linux*, *-*-chorusos* and *-*-freebsd* only. A future release of gcc might remove this alias or extend it to all platforms.
rtems !
RTEMS thread support.
single !
Disable thread support, should work for all platforms.
solaris !
Sun Solaris 2 thread support.
vxworks !
VxWorks thread support.
win32 !
Microsoft Win32 API thread support.
!
--with-cpu=cpu !
Specify which cpu variant the compiler should generate code for by default. This is currently only supported on the some ports, specifically arm, powerpc, and SPARC. If configure does not recognize the model name (e.g. arm700, 603e, or ultrasparc) you provide, please check the configure script for a complete list of supported models. !
--enable-altivec !
Specify that the target supports AltiVec vector enhancements. This option will adjust the ABI for AltiVec enhancements, as well as generate AltiVec code when appropriate. This option is only available for PowerPC systems. !
--enable-target-optspace !
Specify that target libraries should be optimized for code space instead of code speed. This is the default for the m32r platform. !
--disable-cpp !
Specify that a user visible cpp program should not be installed. !
--with-cpp-install-dir=dirname !
Specify that the user visible cpp program should be installed ! in prefix/dirname/cpp, in addition to bindir. !
--enable-maintainer-mode !
The build rules that regenerate the GCC master message catalog gcc.pot are normally disabled. This is because it can only be rebuilt if the complete source tree is present. If you have changed the sources and want to rebuild the --- 258,466 ---- you will only get static Objective-C libraries. libf2c and libiberty do not support shared libraries at all. !

Use --disable-shared to build only static libraries. Note that --disable-shared does not accept a list of package names as argument, only --enable-shared does. !

--with-gnu-as !
Specify that the compiler should assume that the assembler it finds is the GNU assembler. However, this does not modify the rules to find an assembler and will result in confusion if found assembler is not actually the GNU assembler. (Confusion will also result if the compiler finds the GNU assembler but has not been configured with --with-gnu-as.) If you have more than one assembler installed on your system, you may want to use this option in ! connection with --with-as=pathname. !

The following systems are the only ones where it makes a difference whether you use the GNU assembler. On any other system, --with-gnu-as has no effect. !

    !
  • hppa1.0-any-any !
  • hppa1.1-any-any !
  • i386-any-sysv !
  • i386-any-isc !
  • i860-any-bsd
  • m68k-bull-sysv
  • m68k-hp-hpux
  • m68k-sony-bsd
  • m68k-altos-sysv
  • m68000-hp-hpux
  • m68000-att-sysv !
  • any-lynx-lynxos !
  • mips-any
!

On the systems listed above (except for the HP-PA, for ISC on the 386, and for mips-sgi-irix5.*), if you use the GNU assembler, you should also use the GNU linker (and specify --with-gnu-ld). !

--with-as=pathname !
Specify that the compiler should use the assembler pointed to by pathname, rather than the one found by the standard rules to find an assembler, which are: !
  • Check the ! exec_prefix/lib/gcc-lib/target/version directory, where exec_prefix defaults to prefix which defaults to /usr/local unless overridden by the ! --prefix=pathname switch described above. target is the target system triple, such as sparc-sun-solaris2.7, and version denotes the GCC version, such as 3.0.
  • Check operating system specific directories (e.g. /usr/ccs/bin on Sun Solaris 2).
! Note that these rules do not check for the value of PATH. You may want to use --with-as if no assembler is installed in the directories listed above, or if you have multiple assemblers installed and want to choose one that is not found by the above rules. !
--with-gnu-ld !
Same as --with-gnu-as but for linker. !
--with-ld=pathname !
Same as --with-as, but for the linker. !
--with-stabs !
Specify that stabs debugging information should be used instead of whatever format the host normally uses. Normally GCC uses the same debug format as the host system. !

On MIPS based systems and on Alphas, you must specify whether you want GCC to create the normal ECOFF debugging format, or to use BSD-style stabs passed through the ECOFF symbol table. The normal ECOFF debug format cannot fully handle languages other than C. BSD stabs format can handle other languages, but it only works with the GNU debugger GDB. !

Normally, GCC uses the ECOFF debugging format by default; if you prefer BSD stabs, specify --with-stabs when you configure GCC. !

No matter which default you choose when you configure GCC, the user can use the -gcoff and -gstabs+ options to specify explicitly the debug format for a particular compilation. !

--with-stabs is meaningful on the ISC system on the 386, also, if --with-gas is used. It selects use of stabs debugging information embedded in COFF output. This kind of debugging information supports C++ well; ordinary COFF debugging information does not. !

--with-stabs is also meaningful on 386 systems running SVR4. It selects use of stabs debugging information embedded in ELF output. The C++ compiler currently (2.6.0) does not support the DWARF debugging information normally used on 386 SVR4 platforms; stabs provide a workable alternative. This requires gas and gdb, as the normal SVR4 tools can not generate or interpret stabs. !

--disable-multilib !
Specify that multiple target libraries to support different target variants, calling conventions, etc should not be built. The default is to build a predefined set of them. !

Some targets provide finer-grained control over which multilibs are built (e.g., --disable-softfloat): !

arc-*-elf* !
biendian. !
arm-*-* !
fpu, 26bit, underscore, interwork, biendian, nofmult. !
m68*-*-* !
softfloat, m68881, m68000, m68020. !
mips*-*-* !
single-float, biendian, softfloat. !
powerpc*-*-*, rs6000*-*-* !
aix64, pthread, softfloat, powercpu, powerpccpu, powerpcos, biendian, sysv, aix. !
!
--enable-threads !
Specify that the target supports threads. This affects the Objective-C compiler and runtime library, and exception handling for other languages like C++ and Java. On some systems, this is the default. !

In general, the best (and, in many cases, the only known) threading model available will be configured for use. Beware that on some systems, gcc has not been taught what threading models are generally available for the system. In this case, --enable-threads is an alias for --enable-threads=single. !

--disable-threads !
Specify that threading support should be disabled for the system. This is an alias for --enable-threads=single. !
--enable-threads=lib !
Specify that lib is the thread support library. This affects the Objective-C compiler and runtime library, and exception handling for other languages like C++ and Java. The possibilities for lib are: !
aix !
AIX thread support.
dce !
DCE thread support.
mach !
Generic MACH thread support, known to work on NeXTSTEP. (Please note that the file needed to support this configuration, gthr-mach.h, is missing and thus this setting will cause a known bootstrap failure.)
no !
This is an alias for single.
posix !
Generic POSIX thread support.
pthreads !
Same as posix on arm*-*-linux*, *-*-chorusos* and *-*-freebsd* only. A future release of gcc might remove this alias or extend it to all platforms.
rtems !
RTEMS thread support.
single !
Disable thread support, should work for all platforms.
solaris !
Sun Solaris 2 thread support.
vxworks !
VxWorks thread support.
win32 !
Microsoft Win32 API thread support.
!
--with-cpu=cpu !
Specify which cpu variant the compiler should generate code for by default. This is currently only supported on the some ports, specifically arm, powerpc, and SPARC. If configure does not recognize the model name (e.g. arm700, 603e, or ultrasparc) you provide, please check the configure script for a complete list of supported models. !
--enable-altivec !
Specify that the target supports AltiVec vector enhancements. This option will adjust the ABI for AltiVec enhancements, as well as generate AltiVec code when appropriate. This option is only available for PowerPC systems. !
--enable-target-optspace !
Specify that target libraries should be optimized for code space instead of code speed. This is the default for the m32r platform. !
--disable-cpp !
Specify that a user visible cpp program should not be installed. !
--with-cpp-install-dir=dirname !
Specify that the user visible cpp program should be installed ! in prefix/dirname/cpp, in addition to bindir. !
--enable-maintainer-mode !
The build rules that regenerate the GCC master message catalog gcc.pot are normally disabled. This is because it can only be rebuilt if the complete source tree is present. If you have changed the sources and want to rebuild the *************** catalog, configuring with --enable *** 466,491 **** this. Note that you need a recent version of the gettext tools to do so. !
--enable-version-specific-runtime-libs !
Specify that runtime libraries should be installed in the compiler specific ! subdirectory (libsubdir) rather than the usual places. In addition, libstdc++'s include files will be installed in ! libsubdir/include/g++ unless you overruled it by using ! --with-gxx-include-dir=dirname. Using this option is particularly useful if you intend to use several versions of GCC in parallel. This is currently supported by libf2c and libstdc++, and is the default for libobjc which cannot be changed in this case. !
--enable-languages=lang1,lang2,... !
Specify that only a particular subset of compilers and their runtime libraries should be built. For a list of valid values for langN you can issue the following command in the gcc directory of your GCC source tree:
! 
grep language= */config-lang.in
!
! Currently, you can use any of the following: ada, c, c++, f77, java, objc. Building the Ada compiler has special requirements, see below.
If you do not pass this flag, all languages available in the gcc --- 468,493 ---- this. Note that you need a recent version of the gettext tools to do so. !
--enable-version-specific-runtime-libs !
Specify that runtime libraries should be installed in the compiler specific ! subdirectory (libsubdir) rather than the usual places. In addition, libstdc++'s include files will be installed in ! libsubdir/include/g++ unless you overruled it by using ! --with-gxx-include-dir=dirname. Using this option is particularly useful if you intend to use several versions of GCC in parallel. This is currently supported by libf2c and libstdc++, and is the default for libobjc which cannot be changed in this case. !
--enable-languages=lang1,lang2,... !
Specify that only a particular subset of compilers and their runtime libraries should be built. For a list of valid values for langN you can issue the following command in the gcc directory of your GCC source tree:
! 
          grep language= */config-lang.in
!
! Currently, you can use any of the following: ada, c, c++, f77, java, objc. Building the Ada compiler has special requirements, see below.
If you do not pass this flag, all languages available in the gcc *************** sub-tree will be configured. Re-definin *** 493,500 **** make bootstrap does not work anymore, as those language sub-directories might not have been configured! !
--disable-libgcj !
Specify that the run-time libraries used by GCJ should not be built. This is useful in case you intend to use GCJ with some other run-time, or you're going to install it separately, or it just happens not to build on your particular --- 495,502 ---- make bootstrap does not work anymore, as those language sub-directories might not have been configured! !
--disable-libgcj !
Specify that the run-time libraries used by GCJ should not be built. This is useful in case you intend to use GCJ with some other run-time, or you're going to install it separately, or it just happens not to build on your particular *************** may need to port it; in this case, befor *** 505,539 **** configure.in so that libgcj is enabled by default on this platform, you may use --enable-libgcj to override the default. !
--with-dwarf2 !
Specify that the compiler should use DWARF 2 debugging information as the default. !
--enable-win32-registry !
--enable-win32-registry=key !
--disable-win32-registry !
The --enable-win32-registry option enables Windows-hosted GCC to look up installations paths in the registry using the following key: ! 
HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\key
!
!

key defaults to GCC version number, and can be overridden by the ! --enable-win32-registry=key option. Vendors and distributors who use custom installers are encouraged to provide a different key, perhaps one comprised of vendor name and GCC version number, to avoid conflict with existing installations. This feature is enabled by default, and can be disabled by --disable-win32-registry option. This option has no effect on the other hosts. !

--nfp !
Specify that the machine does not have a floating point unit. This ! option only applies to m68k-sun-sunosn and m68k-isi-bsd. On any other system, --nfp has no effect. !
--enable-checking !
--enable-checking=list !
When you specify this option, the compiler is built to perform checking of tree node types when referencing fields of that node, and some other internal consistency checks. This does not change the generated code, but adds error checking within the compiler. This will slow down the --- 507,541 ---- configure.in so that libgcj is enabled by default on this platform, you may use --enable-libgcj to override the default. !
--with-dwarf2 !
Specify that the compiler should use DWARF 2 debugging information as the default. !
--enable-win32-registry !
--enable-win32-registry=key !
--disable-win32-registry !
The --enable-win32-registry option enables Windows-hosted GCC to look up installations paths in the registry using the following key: ! 
          HKEY_LOCAL_MACHINE\SOFTWARE\Free Software Foundation\key
!
!

key defaults to GCC version number, and can be overridden by the ! --enable-win32-registry=key option. Vendors and distributors who use custom installers are encouraged to provide a different key, perhaps one comprised of vendor name and GCC version number, to avoid conflict with existing installations. This feature is enabled by default, and can be disabled by --disable-win32-registry option. This option has no effect on the other hosts. !

--nfp !
Specify that the machine does not have a floating point unit. This ! option only applies to m68k-sun-sunosn and m68k-isi-bsd. On any other system, --nfp has no effect. !
--enable-checking !
--enable-checking=list !
When you specify this option, the compiler is built to perform checking of tree node types when referencing fields of that node, and some other internal consistency checks. This does not change the generated code, but adds error checking within the compiler. This will slow down the *************** specifying list; the categori *** 545,615 **** default when list is not specified is misc,tree,gc; the checks rtl and gcac are very expensive. !
--enable-nls !
--disable-nls !
The --enable-nls option enables Native Language Support (NLS), which lets GCC output diagnostics in languages other than American English. Native Language Support is enabled by default if not doing a canadian cross build. The --disable-nls option disables NLS. !
--with-included-gettext !
If NLS is enabled, the --with-included-gettext option causes the build procedure to prefer its copy of GNU gettext. !
--with-catgets !
If NLS is enabled, and if the host lacks gettext but has the inferior catgets interface, the GCC build procedure normally ignores catgets and instead uses GCC's copy of the GNU gettext library. The --with-catgets option causes the build procedure to use the host's catgets in this situation. !
--with-libiconv-prefix=dir !
Search for libiconv header files in dir/include and ! libiconv library files in dir/lib. !
--with-system-zlib !
Use installed zlib rather than that included with GCC. This option only applies if the Java front end is being built. !
--enable-obsolete !
Enable configuration for an obsoleted system. If you attempt to configure GCC for a system (build, host, or target) which has been obsoleted, and you do not specify this flag, configure will halt with an error message. !

All support for systems which have been obsoleted in one release of GCC is removed entirely in the next major release, unless someone steps forward to maintain the port.

!

Some options which only apply to building cross compilers: !

!
--with-headers=dir !
Specifies a directory which has target include files. This option is required when building a cross ! compiler, if prefix/target/sys-include doesn't pre-exist. These include files will be copied into the gcc install directory. fixincludes will be run on these files to make them compatible with GCC. !
--with-libs=``dir1 dir2 ... dirN'' !
Specifies a list of directories which contain the target runtime libraries. These libraries will be copied into the gcc install directory.
--with-newlib !
Specifies that newlib is being used as the target C library. This causes __eprintf to be omitted from libgcc.a on the assumption that it will be provided by newlib.
!

Note that each --enable option has a corresponding --disable option and that each --with option has a corresponding --without option. !

Return to the GCC Installation page ! --- 547,617 ---- default when list is not specified is misc,tree,gc; the checks rtl and gcac are very expensive. !

--enable-nls !
--disable-nls !
The --enable-nls option enables Native Language Support (NLS), which lets GCC output diagnostics in languages other than American English. Native Language Support is enabled by default if not doing a canadian cross build. The --disable-nls option disables NLS. !
--with-included-gettext !
If NLS is enabled, the --with-included-gettext option causes the build procedure to prefer its copy of GNU gettext. !
--with-catgets !
If NLS is enabled, and if the host lacks gettext but has the inferior catgets interface, the GCC build procedure normally ignores catgets and instead uses GCC's copy of the GNU gettext library. The --with-catgets option causes the build procedure to use the host's catgets in this situation. !
--with-libiconv-prefix=dir !
Search for libiconv header files in dir/include and ! libiconv library files in dir/lib. !
--with-system-zlib !
Use installed zlib rather than that included with GCC. This option only applies if the Java front end is being built. !
--enable-obsolete !
Enable configuration for an obsoleted system. If you attempt to configure GCC for a system (build, host, or target) which has been obsoleted, and you do not specify this flag, configure will halt with an error message. !

All support for systems which have been obsoleted in one release of GCC is removed entirely in the next major release, unless someone steps forward to maintain the port.

!

Some options which only apply to building cross compilers: !

!
--with-headers=dir !
Specifies a directory which has target include files. This option is required when building a cross ! compiler, if prefix/target/sys-include doesn't pre-exist. These include files will be copied into the gcc install directory. fixincludes will be run on these files to make them compatible with GCC. !
--with-libs=``dir1 dir2 ... dirN'' !
Specifies a list of directories which contain the target runtime libraries. These libraries will be copied into the gcc install directory.
--with-newlib !
Specifies that newlib is being used as the target C library. This causes __eprintf to be omitted from libgcc.a on the assumption that it will be provided by newlib.
!

Note that each --enable option has a corresponding --disable option and that each --with option has a corresponding --without option. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/download.html gcc-3.2.3/INSTALL/download.html *** gcc-3.2.2/INSTALL/download.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/download.html Tue Apr 22 06:56:33 2003 *************** *** 1,45 **** ! Downloading GCC ! ! ! ! ! !

G

CC is distributed via CVS and FTP tarballs compressed with gzip or bzip2. It is possible to download a full distribution or specific components. !

Please refer to our releases web page for information on how to obtain GCC. !

The full distribution includes the C, C++, Objective-C, Fortran, Java, and Ada (in case of GCC 3.1 and later) compilers. The full distribution also includes runtime libraries for C++, Objective-C, Fortran, and Java. In GCC 3.0 and later versions, GNU compiler testsuites are also included in the full distribution. !

If you choose to download specific components, you must download the core GCC distribution plus any language specific distributions you wish to use. The core distribution includes the C language front end as well as the shared components. Each language has a tarball which includes the language front end as well as the language runtime (when appropriate). !

Unpack the core distribution as well as any language specific distributions in the same directory. !

If you also intend to build binutils (either to upgrade an existing installation or for use in place of the corresponding tools of your OS), unpack the binutils distribution either in the same directory or a separate one. In the latter case, add symbolic links to any components of the binutils you intend to build alongside the compiler (bfd, binutils, gas, gprof, ld, ! opcodes, ...) to the directory containing the GCC sources. !

Return to the GCC Installation page ! --- 1,47 ---- ! ! Downloading GCC ! ! ! ! ! !

Downloading GCC

! GCC is distributed via CVS and FTP tarballs compressed with gzip or bzip2. It is possible to download a full distribution or specific components. !

Please refer to our releases web page for information on how to obtain GCC. !

The full distribution includes the C, C++, Objective-C, Fortran, Java, and Ada (in case of GCC 3.1 and later) compilers. The full distribution also includes runtime libraries for C++, Objective-C, Fortran, and Java. In GCC 3.0 and later versions, GNU compiler testsuites are also included in the full distribution. !

If you choose to download specific components, you must download the core GCC distribution plus any language specific distributions you wish to use. The core distribution includes the C language front end as well as the shared components. Each language has a tarball which includes the language front end as well as the language runtime (when appropriate). !

Unpack the core distribution as well as any language specific distributions in the same directory. !

If you also intend to build binutils (either to upgrade an existing installation or for use in place of the corresponding tools of your OS), unpack the binutils distribution either in the same directory or a separate one. In the latter case, add symbolic links to any components of the binutils you intend to build alongside the compiler (bfd, binutils, gas, gprof, ld, ! opcodes, ...) to the directory containing the GCC sources. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/finalinstall.html gcc-3.2.3/INSTALL/finalinstall.html *** gcc-3.2.2/INSTALL/finalinstall.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/finalinstall.html Tue Apr 22 06:56:34 2003 *************** *** 1,57 **** ! Installing GCC: Final installation ! ! ! ! ! !

N

ow that GCC has been built (and optionally tested), you can install it with ! 

cd objdir; make install
!
!

We strongly recommend to install into a target directory where there is no previous version of GCC present. !

That step completes the installation of GCC; user level binaries can ! be found in prefix/bin where prefix is the value you specified with the --prefix to configure (or /usr/local by default). (If you specified --bindir, that directory will be used instead; otherwise, if you specified --exec-prefix, ! exec-prefix/bin will be used.) Headers for the C++ and ! Java libraries are installed in prefix/include; libraries ! in libdir (normally prefix/lib); internal ! parts of the compiler in libdir/gcc-lib; documentation in ! info format in infodir (normally prefix/info). !

When installing cross-compilers, GCC's executables ! are not only installed into bindir, that ! is, exec-prefix/bin, but additionally into ! exec-prefix/target-alias/bin, if that directory exists. Typically, such tooldirs hold target-specific binutils, including assembler and linker. !

Installation into a temporary staging area or into a chroot jail can be achieved with the command ! 

make DESTDIR=path-to-rootdir install
!

where path-to-rootdir is the absolute path of a directory relative to which all installation paths will be interpreted. Note that the directory specified by DESTDIR need not exist yet; it will be created if necessary. !

There is a subtle point with tooldirs and DESTDIR: If you relocate a cross-compiler installation with ! e.g. DESTDIR=rootdir, then the directory ! rootdir/exec-prefix/target-alias/bin will be filled with duplicated GCC executables only if it already exists, it will not be created otherwise. This is regarded as a feature, not as a bug, because it gives slightly more control to the packagers using the DESTDIR feature. !

If you built a released version of GCC using make bootstrap then please quickly review the build status page for your release, available from http://gcc.gnu.org/buildstat.html. If your system is not listed for the version of GCC that you built, --- 1,59 ---- ! ! Installing GCC: Final installation ! ! ! ! ! !

Installing GCC: Final installation

! Now that GCC has been built (and optionally tested), you can install it with ! 
     cd objdir; make install
!
!

We strongly recommend to install into a target directory where there is no previous version of GCC present. !

That step completes the installation of GCC; user level binaries can ! be found in prefix/bin where prefix is the value you specified with the --prefix to configure (or /usr/local by default). (If you specified --bindir, that directory will be used instead; otherwise, if you specified --exec-prefix, ! exec-prefix/bin will be used.) Headers for the C++ and ! Java libraries are installed in prefix/include; libraries ! in libdir (normally prefix/lib); internal ! parts of the compiler in libdir/gcc-lib; documentation in ! info format in infodir (normally prefix/info). !

When installing cross-compilers, GCC's executables ! are not only installed into bindir, that ! is, exec-prefix/bin, but additionally into ! exec-prefix/target-alias/bin, if that directory exists. Typically, such tooldirs hold target-specific binutils, including assembler and linker. !

Installation into a temporary staging area or into a chroot jail can be achieved with the command ! 

     make DESTDIR=path-to-rootdir install
!

where path-to-rootdir is the absolute path of a directory relative to which all installation paths will be interpreted. Note that the directory specified by DESTDIR need not exist yet; it will be created if necessary. !

There is a subtle point with tooldirs and DESTDIR: If you relocate a cross-compiler installation with ! e.g. DESTDIR=rootdir, then the directory ! rootdir/exec-prefix/target-alias/bin will be filled with duplicated GCC executables only if it already exists, it will not be created otherwise. This is regarded as a feature, not as a bug, because it gives slightly more control to the packagers using the DESTDIR feature. !

If you built a released version of GCC using make bootstrap then please quickly review the build status page for your release, available from http://gcc.gnu.org/buildstat.html. If your system is not listed for the version of GCC that you built, *************** send a note to *** 60,119 **** that you successfully built and installed GCC. Include the following information: !

    !
  • Output from running srcdir/config.guess. Do not send us that file itself, just the one-line output from running it. !
  • The output of gcc -v for your newly installed gcc. This tells us which version of GCC you built and the options you passed to configure. !
  • Whether you enabled all languages or a subset of them. If you used a full distribution then this information is part of the configure options in the output of gcc -v, but if you downloaded the "core" compiler plus additional front ends then it isn't apparent which ones you built unless you tell us about it. !
  • If the build was for GNU/Linux, also include: !
    • The distribution name and version (e.g., Red Hat 7.1 or Debian 2.2.3); this information should be available from /etc/issue. !
    • The version of the Linux kernel, available from uname --version or uname -a. !
    • The version of glibc you used; for RPM-based systems like Red Hat, Mandrake, and SuSE type rpm -q glibc to get the glibc version, and on systems like Debian and Progeny use dpkg -l libc6.
    ! For other systems, you can include similar information if you think it is relevant. !
  • Any other information that you think would be useful to people building GCC on the same configuration. The new entry in the build status list will include a link to the archived copy of your message.
!

We'd also like to know if the host/target specific installation notes didn't include your host/target information or if that information is incomplete or out of date. Send a note to gcc@gcc.gnu.org telling us how the information should be changed. !

If you find a bug, please report it following our bug reporting guidelines. !

If you want to print the GCC manuals, do cd objdir; make dvi. You will need to have texi2dvi (version at least 4.1) and TeX installed. This creates a number of .dvi files in ! subdirectories of objdir; these may be converted for printing with programs such as dvips. You can also buy printed manuals from the Free Software Foundation, though such manuals may not be for the most recent version of GCC. !

Return to the GCC Installation page ! --- 62,121 ---- that you successfully built and installed GCC. Include the following information: !

    !
  • Output from running srcdir/config.guess. Do not send us that file itself, just the one-line output from running it. !
  • The output of gcc -v for your newly installed gcc. This tells us which version of GCC you built and the options you passed to configure. !
  • Whether you enabled all languages or a subset of them. If you used a full distribution then this information is part of the configure options in the output of gcc -v, but if you downloaded the "core" compiler plus additional front ends then it isn't apparent which ones you built unless you tell us about it. !
  • If the build was for GNU/Linux, also include: !
    • The distribution name and version (e.g., Red Hat 7.1 or Debian 2.2.3); this information should be available from /etc/issue. !
    • The version of the Linux kernel, available from uname --version or uname -a. !
    • The version of glibc you used; for RPM-based systems like Red Hat, Mandrake, and SuSE type rpm -q glibc to get the glibc version, and on systems like Debian and Progeny use dpkg -l libc6.
    ! For other systems, you can include similar information if you think it is relevant. !
  • Any other information that you think would be useful to people building GCC on the same configuration. The new entry in the build status list will include a link to the archived copy of your message.
!

We'd also like to know if the host/target specific installation notes didn't include your host/target information or if that information is incomplete or out of date. Send a note to gcc@gcc.gnu.org telling us how the information should be changed. !

If you find a bug, please report it following our bug reporting guidelines. !

If you want to print the GCC manuals, do cd objdir; make dvi. You will need to have texi2dvi (version at least 4.1) and TeX installed. This creates a number of .dvi files in ! subdirectories of objdir; these may be converted for printing with programs such as dvips. You can also buy printed manuals from the Free Software Foundation, though such manuals may not be for the most recent version of GCC. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/gfdl.html gcc-3.2.3/INSTALL/gfdl.html *** gcc-3.2.2/INSTALL/gfdl.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/gfdl.html Tue Apr 22 06:56:35 2003 *************** *** 1,26 **** ! Installing GCC: GNU Free Documentation License ! ! ! ! !

Installing GCC: GNU Free Documentation License

!

Version 1.1, March 2000

! ! 
Copyright © 2000 Free Software Foundation, Inc.
! 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA
! 
! Everyone is permitted to copy and distribute verbatim copies
! of this license document, but changing it is not allowed.
!
!
  1. PREAMBLE !

    The purpose of this License is to make a manual, textbook, or other written document free in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, --- 1,27 ---- ! ! Installing GCC: GNU Free Documentation License ! ! ! ! ! !

    Installing GCC: GNU Free Documentation License

    Installing GCC: GNU Free Documentation License

    !
    Version 1.1, March 2000
    ! 
         Copyright © 2000 Free Software Foundation, Inc.
!      59 Temple Place, Suite 330, Boston, MA  02111-1307, USA
!      
!      Everyone is permitted to copy and distribute verbatim copies
!      of this license document, but changing it is not allowed.
!
    !
    1. PREAMBLE !

      The purpose of this License is to make a manual, textbook, or other written document free in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, *************** this License preserves for the author an *** 28,39 **** credit for their work, while not being considered responsible for modifications made by others. !

      This License is a kind of "copyleft", which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. !

      We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; --- 29,40 ---- credit for their work, while not being considered responsible for modifications made by others. !

      This License is a kind of "copyleft", which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. !

      We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; *************** it can be used for any textual work, reg *** 41,59 **** whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. !

    2. APPLICABILITY AND DEFINITIONS !

      This License applies to any manual or other work that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. The "Document", below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as "you". !

      A "Modified Version" of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. !

      A "Secondary Section" is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly --- 42,60 ---- whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. !

    3. APPLICABILITY AND DEFINITIONS !

      This License applies to any manual or other work that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. The "Document", below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as "you". !

      A "Modified Version" of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. !

      A "Secondary Section" is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly *************** connection with the subject or with rela *** 64,78 **** commercial, philosophical, ethical or political position regarding them. !

      The "Invariant Sections" are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. !

      The "Cover Texts" are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. !

      A "Transparent" copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of --- 65,79 ---- commercial, philosophical, ethical or political position regarding them. !

      The "Invariant Sections" are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. !

      The "Cover Texts" are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. !

      A "Transparent" copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of *************** format whose markup has been designed to *** 84,90 **** subsequent modification by readers is not Transparent. A copy that is not "Transparent" is called "Opaque". !

      Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed --- 85,91 ---- subsequent modification by readers is not Transparent. A copy that is not "Transparent" is called "Opaque". !

      Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed *************** the DTD and/or processing *** 95,110 **** and the machine-generated HTML produced by some word processors for output purposes only. !

      The "Title Page" means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, "Title Page" means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text. !

    4. VERBATIM COPYING !

      You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other --- 96,111 ---- and the machine-generated HTML produced by some word processors for output purposes only. !

      The "Title Page" means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, "Title Page" means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text. !

    5. VERBATIM COPYING !

      You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other *************** copying of the copies you make or distri *** 114,125 **** compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. !

      You may also lend copies, under the same conditions stated above, and you may publicly display copies. !

    6. COPYING IN QUANTITY !

      If you publish printed copies of the Document numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on --- 115,126 ---- compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. !

      You may also lend copies, under the same conditions stated above, and you may publicly display copies. !

    7. COPYING IN QUANTITY !

      If you publish printed copies of the Document numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on *************** Copying with changes limited to the cove *** 131,142 **** the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. !

      If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages. !

      If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete --- 132,143 ---- the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. !

      If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages. !

      If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete *************** until at least one year after the last t *** 150,198 **** copy (directly or through your agents or retailers) of that edition to the public. !

      It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. !

    8. MODIFICATIONS !

      You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version: !

        !

      1. Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. !
      2. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has less than five). !
      3. State on the Title page the name of the publisher of the Modified Version, as the publisher. !
      4. Preserve all the copyright notices of the Document. !
      5. Add an appropriate copyright notice for your modifications adjacent to the other copyright notices. !
      6. Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below. !
      7. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice. !
      8. Include an unaltered copy of this License. !
      9. Preserve the section entitled "History", and its title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section entitled "History" in the Document, create one --- 151,199 ---- copy (directly or through your agents or retailers) of that edition to the public. !

        It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. !

      10. MODIFICATIONS !

        You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version: !

          !
        1. Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. !
        2. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has less than five). !
        3. State on the Title page the name of the publisher of the Modified Version, as the publisher. !
        4. Preserve all the copyright notices of the Document. !
        5. Add an appropriate copyright notice for your modifications adjacent to the other copyright notices. !
        6. Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below. !
        7. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice. !
        8. Include an unaltered copy of this License. !
        9. Preserve the section entitled "History", and its title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section entitled "History" in the Document, create one *************** stating the title, year, authors, and pu *** 200,206 **** given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. !
        10. Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the "History" section. --- 201,207 ---- given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. !
        11. Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the "History" section. *************** You may omit a network location for a wo *** 208,243 **** least four years before the Document itself, or if the original publisher of the version it refers to gives permission. !
        12. In any section entitled "Acknowledgments" or "Dedications", preserve the section's title, and preserve in the section all the substance and tone of each of the contributor acknowledgments and/or dedications given therein. !
        13. Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. !
        14. Delete any section entitled "Endorsements". Such a section may not be included in the Modified Version. !
        15. Do not retitle any existing section as "Endorsements" or to conflict in title with any Invariant Section. !
        !

        If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles. !

        You may add a section entitled "Endorsements", provided it contains nothing but endorsements of your Modified Version by various parties--for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. !

        You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or --- 209,244 ---- least four years before the Document itself, or if the original publisher of the version it refers to gives permission. !

      11. In any section entitled "Acknowledgments" or "Dedications", preserve the section's title, and preserve in the section all the substance and tone of each of the contributor acknowledgments and/or dedications given therein. !
      12. Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. !
      13. Delete any section entitled "Endorsements". Such a section may not be included in the Modified Version. !
      14. Do not retitle any existing section as "Endorsements" or to conflict in title with any Invariant Section. !
      !

      If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles. !

      You may add a section entitled "Endorsements", provided it contains nothing but endorsements of your Modified Version by various parties--for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. !

      You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or *************** by arrangement made by the same entity y *** 247,266 **** you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. !

      The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. !

    9. COMBINING DOCUMENTS !

      You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice. !

      The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by --- 248,267 ---- you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. !

      The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. !

    10. COMBINING DOCUMENTS !

      You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice. !

      The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by *************** author or publisher of that section if k *** 269,296 **** Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. !

      In the combination, you must combine any sections entitled "History" in the various original documents, forming one section entitled "History"; likewise combine any sections entitled "Acknowledgments", and any sections entitled "Dedications". You must delete all sections entitled "Endorsements." !

    11. COLLECTIONS OF DOCUMENTS !

      You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. !

      You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. !

    12. AGGREGATION WITH INDEPENDENT WORKS !

      A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, does not as a whole count as a Modified Version of the Document, provided no compilation copyright is claimed for the --- 270,297 ---- Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. !

      In the combination, you must combine any sections entitled "History" in the various original documents, forming one section entitled "History"; likewise combine any sections entitled "Acknowledgments", and any sections entitled "Dedications". You must delete all sections entitled "Endorsements." !

    13. COLLECTIONS OF DOCUMENTS !

      You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. !

      You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. !

    14. AGGREGATION WITH INDEPENDENT WORKS !

      A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, does not as a whole count as a Modified Version of the Document, provided no compilation copyright is claimed for the *************** License does not apply to the other self *** 299,313 **** with the Document, on account of their being thus compiled, if they are not themselves derivative works of the Document. !

      If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Document's Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate. !

    15. TRANSLATION !

      Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include --- 300,314 ---- with the Document, on account of their being thus compiled, if they are not themselves derivative works of the Document. !

      If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Document's Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate. !

    16. TRANSLATION !

      Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include *************** original English version of this License *** 318,326 **** between the translation and the original English version of this License, the original English version will prevail. !

    17. TERMINATION !

      You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, --- 319,327 ---- between the translation and the original English version of this License, the original English version will prevail. !

    18. TERMINATION !

      You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, *************** parties who have received copies, or rig *** 328,342 **** License will not have their licenses terminated so long as such parties remain in full compliance. !

    19. FUTURE REVISIONS OF THIS LICENSE !

      The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. See http://www.gnu.org/copyleft/. !

      Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or --- 329,343 ---- License will not have their licenses terminated so long as such parties remain in full compliance. !

    20. FUTURE REVISIONS OF THIS LICENSE !

      The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. See http://www.gnu.org/copyleft/. !

      Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or *************** of any later version that has been publi *** 344,380 **** Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. !

    !

    ADDENDUM: How to use this License for your documents

    !

    To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: ! 

      Copyright (C)  year  your name.
!   Permission is granted to copy, distribute and/or modify this document
!   under the terms of the GNU Free Documentation License, Version 1.1
!   or any later version published by the Free Software Foundation;
!   with the Invariant Sections being list their titles, with the
!   Front-Cover Texts being list, and with the Back-Cover Texts being list.
!   A copy of the license is included in the section entitled ``GNU
!   Free Documentation License''.
!
    !

    If you have no Invariant Sections, write "with no Invariant Sections" instead of saying which ones are invariant. If you have no Front-Cover Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being list"; likewise for Back-Cover Texts. !

    If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. !

    Return to the GCC Installation page ! --- 345,381 ---- Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. !

!

ADDENDUM: How to use this License for your documents

!

To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: ! 

       Copyright (C)  year  your name.
!        Permission is granted to copy, distribute and/or modify this document
!        under the terms of the GNU Free Documentation License, Version 1.1
!        or any later version published by the Free Software Foundation;
!        with the Invariant Sections being list their titles, with the
!        Front-Cover Texts being list, and with the Back-Cover Texts being list.
!        A copy of the license is included in the section entitled ``GNU
!        Free Documentation License''.
!
!

If you have no Invariant Sections, write "with no Invariant Sections" instead of saying which ones are invariant. If you have no Front-Cover Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being list"; likewise for Back-Cover Texts. !

If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/index.html gcc-3.2.3/INSTALL/index.html *** gcc-3.2.2/INSTALL/index.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/index.html Tue Apr 22 06:56:32 2003 *************** *** 1,75 **** ! Installing GCC ! ! ! ! ! !

T

he latest version of this document is always available at http://gcc.gnu.org/install/. !

This document describes the generic installation procedure for GCC as well as detailing some target specific installation instructions. !

GCC includes several components that previously were separate distributions with their own installation instructions. This document supersedes all package specific installation instructions. !

Before starting the build/install procedure please check the host/target specific installation notes. We recommend you browse the entire generic installation instructions before you proceed. !

Lists of successful builds for released versions of GCC are available at http://gcc.gnu.org/buildstat.html. These lists are updated as new information becomes available. !

The installation procedure itself is broken into five steps. !

    !

  1. Downloading the source
  2. Configuration
  3. Building
  4. Testing (optional)
  5. Final install !
!

Please note that GCC does not support make uninstall and probably won't do so in the near future as this would open a can of worms. Instead, we suggest that you install GCC into a directory of its own and simply remove that directory when you do not need that specific version of GCC any longer, and, if shared libraries are installed there as well, no more binaries exist that use them. !

There are also some old installation instructions, which are mostly obsolete but still contain some information which has not yet been merged into the main part of this manual. !

Return to the GCC Installation page !

Copyright © 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc. -

!

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see below). A copy of the license is included in the section entitled "GNU Free Documentation License". !

(a) The FSF's Front-Cover Text is: !

A GNU Manual !

(b) The FSF's Back-Cover Text is: !

You have freedom to copy and modify this GNU Manual, like GNU software. Copies published by the Free Software Foundation raise funds for GNU development. ! --- 1,76 ---- ! ! Installing GCC ! ! ! ! ! !

Installing GCC

! The latest version of this document is always available at http://gcc.gnu.org/install/. !

This document describes the generic installation procedure for GCC as well as detailing some target specific installation instructions. !

GCC includes several components that previously were separate distributions with their own installation instructions. This document supersedes all package specific installation instructions. !

Before starting the build/install procedure please check the host/target specific installation notes. We recommend you browse the entire generic installation instructions before you proceed. !

Lists of successful builds for released versions of GCC are available at http://gcc.gnu.org/buildstat.html. These lists are updated as new information becomes available. !

The installation procedure itself is broken into five steps. !

    !
  1. Downloading the source
  2. Configuration
  3. Building
  4. Testing (optional)
  5. Final install !
!

Please note that GCC does not support make uninstall and probably won't do so in the near future as this would open a can of worms. Instead, we suggest that you install GCC into a directory of its own and simply remove that directory when you do not need that specific version of GCC any longer, and, if shared libraries are installed there as well, no more binaries exist that use them. !

There are also some old installation instructions, which are mostly obsolete but still contain some information which has not yet been merged into the main part of this manual. !

Return to the GCC Installation page !

Copyright © 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.

!

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see below). A copy of the license is included in the section entitled "GNU Free Documentation License". !

(a) The FSF's Front-Cover Text is: !

A GNU Manual !

(b) The FSF's Back-Cover Text is: !

You have freedom to copy and modify this GNU Manual, like GNU software. Copies published by the Free Software Foundation raise funds for GNU development. ! diff -Nrc3pad gcc-3.2.2/INSTALL/old.html gcc-3.2.3/INSTALL/old.html *** gcc-3.2.2/INSTALL/old.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/old.html Tue Apr 22 06:56:35 2003 *************** *** 1,42 **** ! Installing GCC: Old documentation ! ! ! ! !

Old installation documentation

!

Note most of this information is out of date and superseded by the previous chapters of this manual. It is provided for historical reference only, because of a lack of volunteers to merge it into the main manual. !

Here is the procedure for installing GNU CC on a GNU or Unix system. See VMS Install, for VMS systems. !

    !

  1. If you have chosen a configuration for GNU CC which requires other GNU tools (such as GAS or the GNU linker) instead of the standard system tools, install the required tools in the build directory under the names as, ld or whatever is appropriate. This will enable the compiler to find the proper tools for compilation of the program enquire. !

    Alternatively, you can do subsequent compilation using a value of the PATH environment variable such that the necessary GNU tools come before the standard system tools. !

  2. Specify the host, build and target machine configurations. You do this when you run the configure script. !

    The build machine is the system which you are using, the host machine is the system where you want to run the resulting compiler (normally the build machine), and the target machine is the system for which you want the compiler to generate code. !

    If you are building a compiler to produce code for the machine it runs on (a native compiler), you normally do not need to specify any operands to configure; it will try to guess the type of machine you are on and use that as the build, host and target machines. So you don't need --- 1,44 ---- ! ! Installing GCC: Old documentation ! ! ! ! ! !

    Installing GCC: Old documentation

    Old installation documentation

    !

    Note most of this information is out of date and superseded by the previous chapters of this manual. It is provided for historical reference only, because of a lack of volunteers to merge it into the main manual. !

    Here is the procedure for installing GNU CC on a GNU or Unix system. See VMS Install, for VMS systems. !

      !
    1. If you have chosen a configuration for GNU CC which requires other GNU tools (such as GAS or the GNU linker) instead of the standard system tools, install the required tools in the build directory under the names as, ld or whatever is appropriate. This will enable the compiler to find the proper tools for compilation of the program enquire. !

      Alternatively, you can do subsequent compilation using a value of the PATH environment variable such that the necessary GNU tools come before the standard system tools. !

    2. Specify the host, build and target machine configurations. You do this when you run the configure script. !

      The build machine is the system which you are using, the host machine is the system where you want to run the resulting compiler (normally the build machine), and the target machine is the system for which you want the compiler to generate code. !

      If you are building a compiler to produce code for the machine it runs on (a native compiler), you normally do not need to specify any operands to configure; it will try to guess the type of machine you are on and use that as the build, host and target machines. So you don't need *************** to specify a configuration when building *** 44,87 **** configure cannot figure out what your configuration is or guesses wrong. !

      In those cases, specify the build machine's configuration name with the --host option; the host and target will default to be the same as the host machine. (If you are building a cross-compiler, see Cross-Compiler.) !

      Here is an example: ! 

      ./configure --host=sparc-sun-sunos4.1
!
      !

      A configuration name may be canonical or it may be more or less abbreviated. !

      A canonical configuration name has three parts, separated by dashes. ! It looks like this: cpu-company-system. (The three parts may themselves contain dashes; configure can figure out which dashes serve which purpose.) For example, m68k-sun-sunos4.1 specifies a Sun 3. !

      You can also replace parts of the configuration by nicknames or aliases. For example, sun3 stands for m68k-sun, so sun3-sunos4.1 is another way to specify a Sun 3. !

      You can specify a version number after any of the system types, and some of the CPU types. In most cases, the version is irrelevant, and will be ignored. So you might as well specify the version if you know it. !

      See Configurations, for a list of supported configuration names and notes on many of the configurations. You should check the notes in that section before proceeding any further with the installation of GNU CC. !

    !

    Configurations Supported by GNU CC

    !

    Here are the possible CPU types: !

    1750a, a29k, alpha, arm, avr, cn, clipper, dsp16xx, elxsi, fr30, h8300, hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860, i960, m32r, m68000, m68k, m6811, m6812, m88k, mcore, mips, mipsel, mips64, mips64el, --- 46,89 ---- configure cannot figure out what your configuration is or guesses wrong. !

    In those cases, specify the build machine's configuration name with the --host option; the host and target will default to be the same as the host machine. (If you are building a cross-compiler, see Cross-Compiler.) !

    Here is an example: ! 

              ./configure --host=sparc-sun-sunos4.1
!
    !

    A configuration name may be canonical or it may be more or less abbreviated. !

    A canonical configuration name has three parts, separated by dashes. ! It looks like this: cpu-company-system. (The three parts may themselves contain dashes; configure can figure out which dashes serve which purpose.) For example, m68k-sun-sunos4.1 specifies a Sun 3. !

    You can also replace parts of the configuration by nicknames or aliases. For example, sun3 stands for m68k-sun, so sun3-sunos4.1 is another way to specify a Sun 3. !

    You can specify a version number after any of the system types, and some of the CPU types. In most cases, the version is irrelevant, and will be ignored. So you might as well specify the version if you know it. !

    See Configurations, for a list of supported configuration names and notes on many of the configurations. You should check the notes in that section before proceeding any further with the installation of GNU CC. !

!

Configurations Supported by GNU CC

!

Here are the possible CPU types: !

1750a, a29k, alpha, arm, avr, cn, clipper, dsp16xx, elxsi, fr30, h8300, hppa1.0, hppa1.1, i370, i386, i486, i586, i686, i786, i860, i960, m32r, m68000, m68k, m6811, m6812, m88k, mcore, mips, mipsel, mips64, mips64el, *************** mn10200, mn10300, ns32k, pdp11, powerpc, *** 89,98 **** sparclite, sparc64, v850, vax, we32k.
!

Here are the recognized company names. As you can see, customary abbreviations are used rather than the longer official names. !

acorn, alliant, altos, apollo, apple, att, bull, cbm, convergent, convex, crds, dec, dg, dolphin, elxsi, encore, harris, hitachi, hp, ibm, intergraph, isi, --- 91,100 ---- sparclite, sparc64, v850, vax, we32k.
!

Here are the recognized company names. As you can see, customary abbreviations are used rather than the longer official names. !

acorn, alliant, altos, apollo, apple, att, bull, cbm, convergent, convex, crds, dec, dg, dolphin, elxsi, encore, harris, hitachi, hp, ibm, intergraph, isi, *************** mips, motorola, ncr, next, ns, omron, pl *** 100,113 **** sequent, sgi, sony, sun, tti, unicom, wrs.
!

The company name is meaningful only to disambiguate when the rest of the information supplied is insufficient. You can omit it, writing ! just cpu-system, if it is not needed. For example, vax-ultrix4.2 is equivalent to vax-dec-ultrix4.2. !

Here is a list of system types: !

386bsd, aix, acis, amigaos, aos, aout, aux, bosx, bsd, clix, coff, ctix, cxux, dgux, dynix, ebmon, ecoff, elf, esix, freebsd, hms, genix, gnu, linux, linux-gnu, hiux, hpux, iris, irix, isc, luna, lynxos, mach, minix, msdos, mvs, --- 102,115 ---- sequent, sgi, sony, sun, tti, unicom, wrs.
!

The company name is meaningful only to disambiguate when the rest of the information supplied is insufficient. You can omit it, writing ! just cpu-system, if it is not needed. For example, vax-ultrix4.2 is equivalent to vax-dec-ultrix4.2. !

Here is a list of system types: !

386bsd, aix, acis, amigaos, aos, aout, aux, bosx, bsd, clix, coff, ctix, cxux, dgux, dynix, ebmon, ecoff, elf, esix, freebsd, hms, genix, gnu, linux, linux-gnu, hiux, hpux, iris, irix, isc, luna, lynxos, mach, minix, msdos, mvs, *************** vxworks, winnt, xenix. *** 119,150 ****

You can omit the system type; then configure guesses the operating system from the CPU and company. !

You can add a version number to the system type; this may or may not make a difference. For example, you can write bsd4.3 or bsd4.4 to distinguish versions of BSD. In practice, the version number is most needed for sysv3 and sysv4, which are often treated differently. !

linux-gnu is the canonical name for the GNU/Linux target; however GNU CC will also accept linux. The version of the kernel in use is not relevant on these systems. A suffix such as libc1 or aout distinguishes major versions of the C library; all of the suffixed versions are obsolete. !

If you specify an impossible combination such as i860-dg-vms, then you may get an error message from configure, or it may ignore part of the information and do the best it can with the rest. configure always prints the canonical name for the alternative that it used. GNU CC does not support all possible alternatives. !

Often a particular model of machine has a name. Many machine names are recognized as aliases for CPU/company combinations. Thus, the machine name sun3, mentioned above, is an alias for m68k-sun. Sometimes we accept a company name as a machine name, when the name is popularly used for a particular machine. Here is a table of the known machine names: !

3300, 3b1, 3bn, 7300, altos3068, altos, apollo68, att-7300, balance, convex-cn, crds, decstation-3100, --- 121,152 ----

You can omit the system type; then configure guesses the operating system from the CPU and company. !

You can add a version number to the system type; this may or may not make a difference. For example, you can write bsd4.3 or bsd4.4 to distinguish versions of BSD. In practice, the version number is most needed for sysv3 and sysv4, which are often treated differently. !

linux-gnu is the canonical name for the GNU/Linux target; however GNU CC will also accept linux. The version of the kernel in use is not relevant on these systems. A suffix such as libc1 or aout distinguishes major versions of the C library; all of the suffixed versions are obsolete. !

If you specify an impossible combination such as i860-dg-vms, then you may get an error message from configure, or it may ignore part of the information and do the best it can with the rest. configure always prints the canonical name for the alternative that it used. GNU CC does not support all possible alternatives. !

Often a particular model of machine has a name. Many machine names are recognized as aliases for CPU/company combinations. Thus, the machine name sun3, mentioned above, is an alias for m68k-sun. Sometimes we accept a company name as a machine name, when the name is popularly used for a particular machine. Here is a table of the known machine names: !

3300, 3b1, 3bn, 7300, altos3068, altos, apollo68, att-7300, balance, convex-cn, crds, decstation-3100, *************** sun4, symmetry, tower-32, tower. *** 163,375 **** name. If you want to install your own homemade configuration files, you can use local as the company name to access them. If you use ! configuration cpu-local, the configuration name without the cpu prefix is used to form the configuration file names. !

Thus, if you specify m68k-local, configuration uses files m68k.md, local.h, m68k.c, xm-local.h, t-local, and x-local, all in the directory config/m68k. !

Here is a list of configurations that have special treatment or special things you must know: !

vax-dec-vms !
See VMS Install, for details on how to install GNU CC on VMS.
!

Building and Installing a Cross-Compiler

!

GNU CC can function as a cross-compiler for many machines, but not all. !

  • Cross-compilers for the Mips as target using the Mips assembler currently do not work, because the auxiliary programs mips-tdump.c and mips-tfile.c can't be compiled on anything but a Mips. It does work to cross compile for a Mips if you use the GNU assembler and linker. !
  • Cross-compilers between machines with different floating point formats have not all been made to work. GNU CC now has a floating point emulator with which these can work, but each target machine description needs to be updated to take advantage of it. !
  • Cross-compilation between machines of different word sizes is somewhat problematic and sometimes does not work.
!

Since GNU CC generates assembler code, you probably need a cross-assembler that GNU CC can run, in order to produce object files. If you want to link on other than the target machine, you need a cross-linker as well. You also need header files and libraries suitable for the target machine that you can install on the host machine. !

Steps of Cross-Compilation

!

To compile and run a program using a cross-compiler involves several steps: !

  • Run the cross-compiler on the host machine to produce assembler files for the target machine. This requires header files for the target machine. !
  • Assemble the files produced by the cross-compiler. You can do this either with an assembler on the target machine, or with a cross-assembler on the host machine. !
  • Link those files to make an executable. You can do this either with a linker on the target machine, or with a cross-linker on the host machine. Whichever machine you use, you need libraries and certain ! startup files (typically crt....o) for the target machine.
!

It is most convenient to do all of these steps on the same host machine, since then you can do it all with a single invocation of GNU CC. This requires a suitable cross-assembler and cross-linker. For some targets, the GNU assembler and linker are available. !

Configuring a Cross-Compiler

!

To build GNU CC as a cross-compiler, you start out by running ! configure. Use the --target=target to specify the target type. If configure was unable to correctly identify the ! system you are running on, also specify the --build=build option. For example, here is how to configure for a cross-compiler that produces code for an HP 68030 system running BSD on a system that configure can correctly identify: ! 

./configure --target=m68k-hp-bsd4.3
!
!

Tools and Libraries for a Cross-Compiler

!

If you have a cross-assembler and cross-linker available, you should install them now. Put them in the directory ! /usr/local/target/bin. Here is a table of the tools you should put in this directory: !

as !
This should be the cross-assembler. !
ld !
This should be the cross-linker. !
ar !
This should be the cross-archiver: a program which can manipulate archive files (linker libraries) in the target machine's format. !
ranlib !
This should be a program to construct a symbol table in an archive file.
!

The installation of GNU CC will find these programs in that directory, and copy or link them to the proper place to for the cross-compiler to find them when run later. !

The easiest way to provide these files is to build the Binutils package and GAS. Configure them with the same --host and --target options that you use for configuring GNU CC, then build and install them. They install their executables automatically into the proper directory. Alas, they do not support all the targets that GNU CC supports. !

If you want to install libraries to use with the cross-compiler, such as a standard C library, put them in the directory ! /usr/local/target/lib; installation of GNU CC copies all the files in that subdirectory into the proper place for GNU CC to find them and link with them. Here's an example of copying some libraries from a target machine: ! 

ftp target-machine
! lcd /usr/local/target/lib
! cd /lib
! get libc.a
! cd /usr/lib
! get libg.a
! get libm.a
! quit
!

The precise set of libraries you'll need, and their locations on the target machine, vary depending on its operating system. !

Many targets require "start files" such as crt0.o and crtn.o which are linked into each executable; these too should be ! placed in /usr/local/target/lib. There may be several alternatives for crt0.o, for use with profiling or other compilation options. Check your target's definition of STARTFILE_SPEC to find out what start files it uses. Here's an example of copying these files from a target machine: ! 

ftp target-machine
! lcd /usr/local/target/lib
! prompt
! cd /lib
! mget *crt*.o
! cd /usr/lib
! mget *crt*.o
! quit
!
!

Cross-Compilers and Header Files

!

If you are cross-compiling a standalone program or a program for an embedded system, then you may not need any header files except the few that are part of GNU CC (and those of your program). However, if you intend to link your program with a standard C library such as libc.a, then you probably need to compile with the header files that go with the library you use. !

The GNU C compiler does not come with these files, because (1) they are system-specific, and (2) they belong in a C library, not in a compiler. !

If the GNU C library supports your target machine, then you can get the header files from there (assuming you actually use the GNU library when you link your program). !

If your target machine comes with a C compiler, it probably comes with suitable header files also. If you make these files accessible from the host machine, the cross-compiler can use them also. !

Otherwise, you're on your own in finding header files to use when cross-compiling. !

When you have found suitable header files, you should put them in the ! directory /usr/local/target/include, before building the cross compiler. Then installation will run fixincludes properly and install the corrected versions of the header files where the compiler will use them. !

Provide the header files before you build the cross-compiler, because the build stage actually runs the cross-compiler to produce parts of libgcc.a. (These are the parts that can be compiled with GNU CC.) Some of them need suitable header files. !

Here's an example showing how to copy the header files from a target machine. On the target machine, do this: ! 

(cd /usr/include; tar cf - .) > tarfile
!
!

Then, on the host machine, do this: ! 

ftp target-machine
! lcd /usr/local/target/include
! get tarfile
! quit
! tar xf tarfile
!
!

Actually Building the Cross-Compiler

!

Now you can proceed just as for compiling a single-machine compiler through the step of building stage 1. !

If your target is exotic, you may need to provide the header file float.h.One way to do this is to compile enquire and run it on your target machine. The job of enquire is to run on the target machine and figure out by experiment the nature of its floating --- 165,377 ---- name. If you want to install your own homemade configuration files, you can use local as the company name to access them. If you use ! configuration cpu-local, the configuration name without the cpu prefix is used to form the configuration file names. !

Thus, if you specify m68k-local, configuration uses files m68k.md, local.h, m68k.c, xm-local.h, t-local, and x-local, all in the directory config/m68k. !

Here is a list of configurations that have special treatment or special things you must know: !

vax-dec-vms !
See VMS Install, for details on how to install GNU CC on VMS.
!

Building and Installing a Cross-Compiler

!

GNU CC can function as a cross-compiler for many machines, but not all. !

  • Cross-compilers for the Mips as target using the Mips assembler currently do not work, because the auxiliary programs mips-tdump.c and mips-tfile.c can't be compiled on anything but a Mips. It does work to cross compile for a Mips if you use the GNU assembler and linker. !
  • Cross-compilers between machines with different floating point formats have not all been made to work. GNU CC now has a floating point emulator with which these can work, but each target machine description needs to be updated to take advantage of it. !
  • Cross-compilation between machines of different word sizes is somewhat problematic and sometimes does not work.
!

Since GNU CC generates assembler code, you probably need a cross-assembler that GNU CC can run, in order to produce object files. If you want to link on other than the target machine, you need a cross-linker as well. You also need header files and libraries suitable for the target machine that you can install on the host machine. !

Steps of Cross-Compilation

!

To compile and run a program using a cross-compiler involves several steps: !

  • Run the cross-compiler on the host machine to produce assembler files for the target machine. This requires header files for the target machine. !
  • Assemble the files produced by the cross-compiler. You can do this either with an assembler on the target machine, or with a cross-assembler on the host machine. !
  • Link those files to make an executable. You can do this either with a linker on the target machine, or with a cross-linker on the host machine. Whichever machine you use, you need libraries and certain ! startup files (typically crt....o) for the target machine.
!

It is most convenient to do all of these steps on the same host machine, since then you can do it all with a single invocation of GNU CC. This requires a suitable cross-assembler and cross-linker. For some targets, the GNU assembler and linker are available. !

Configuring a Cross-Compiler

!

To build GNU CC as a cross-compiler, you start out by running ! configure. Use the --target=target to specify the target type. If configure was unable to correctly identify the ! system you are running on, also specify the --build=build option. For example, here is how to configure for a cross-compiler that produces code for an HP 68030 system running BSD on a system that configure can correctly identify: ! 

     ./configure --target=m68k-hp-bsd4.3
!
!

Tools and Libraries for a Cross-Compiler

!

If you have a cross-assembler and cross-linker available, you should install them now. Put them in the directory ! /usr/local/target/bin. Here is a table of the tools you should put in this directory: !

as !
This should be the cross-assembler. !
ld !
This should be the cross-linker. !
ar !
This should be the cross-archiver: a program which can manipulate archive files (linker libraries) in the target machine's format. !
ranlib !
This should be a program to construct a symbol table in an archive file.
!

The installation of GNU CC will find these programs in that directory, and copy or link them to the proper place to for the cross-compiler to find them when run later. !

The easiest way to provide these files is to build the Binutils package and GAS. Configure them with the same --host and --target options that you use for configuring GNU CC, then build and install them. They install their executables automatically into the proper directory. Alas, they do not support all the targets that GNU CC supports. !

If you want to install libraries to use with the cross-compiler, such as a standard C library, put them in the directory ! /usr/local/target/lib; installation of GNU CC copies all the files in that subdirectory into the proper place for GNU CC to find them and link with them. Here's an example of copying some libraries from a target machine: ! 

     ftp target-machine
!      lcd /usr/local/target/lib
!      cd /lib
!      get libc.a
!      cd /usr/lib
!      get libg.a
!      get libm.a
!      quit
!

The precise set of libraries you'll need, and their locations on the target machine, vary depending on its operating system. !

Many targets require "start files" such as crt0.o and crtn.o which are linked into each executable; these too should be ! placed in /usr/local/target/lib. There may be several alternatives for crt0.o, for use with profiling or other compilation options. Check your target's definition of STARTFILE_SPEC to find out what start files it uses. Here's an example of copying these files from a target machine: ! 

     ftp target-machine
!      lcd /usr/local/target/lib
!      prompt
!      cd /lib
!      mget *crt*.o
!      cd /usr/lib
!      mget *crt*.o
!      quit
!
!

Cross-Compilers and Header Files

!

If you are cross-compiling a standalone program or a program for an embedded system, then you may not need any header files except the few that are part of GNU CC (and those of your program). However, if you intend to link your program with a standard C library such as libc.a, then you probably need to compile with the header files that go with the library you use. !

The GNU C compiler does not come with these files, because (1) they are system-specific, and (2) they belong in a C library, not in a compiler. !

If the GNU C library supports your target machine, then you can get the header files from there (assuming you actually use the GNU library when you link your program). !

If your target machine comes with a C compiler, it probably comes with suitable header files also. If you make these files accessible from the host machine, the cross-compiler can use them also. !

Otherwise, you're on your own in finding header files to use when cross-compiling. !

When you have found suitable header files, you should put them in the ! directory /usr/local/target/include, before building the cross compiler. Then installation will run fixincludes properly and install the corrected versions of the header files where the compiler will use them. !

Provide the header files before you build the cross-compiler, because the build stage actually runs the cross-compiler to produce parts of libgcc.a. (These are the parts that can be compiled with GNU CC.) Some of them need suitable header files. !

Here's an example showing how to copy the header files from a target machine. On the target machine, do this: ! 

     (cd /usr/include; tar cf - .) > tarfile
!
!

Then, on the host machine, do this: ! 

     ftp target-machine
!      lcd /usr/local/target/include
!      get tarfile
!      quit
!      tar xf tarfile
!
!

Actually Building the Cross-Compiler

!

Now you can proceed just as for compiling a single-machine compiler through the step of building stage 1. !

If your target is exotic, you may need to provide the header file float.h.One way to do this is to compile enquire and run it on your target machine. The job of enquire is to run on the target machine and figure out by experiment the nature of its floating *************** file float.h. If you can't *** 379,385 **** a suitable float.h in some other way (or else, avoid using it in your programs). !

Do not try to build stage 2 for a cross-compiler. It doesn't work to rebuild GNU CC as a cross-compiler using the cross-compiler, because that would produce a program that runs on the target machine, not on the host. For example, if you compile a 386-to-68030 cross-compiler with --- 381,387 ---- a suitable float.h in some other way (or else, avoid using it in your programs). !

Do not try to build stage 2 for a cross-compiler. It doesn't work to rebuild GNU CC as a cross-compiler using the cross-compiler, because that would produce a program that runs on the target machine, not on the host. For example, if you compile a 386-to-68030 cross-compiler with *************** for a 386 as the host). If you want to *** 389,464 **** whether you compile it on a 68030 or with a cross-compiler on a 386, you must specify a 68030 as the host when you configure it. !

To install the cross-compiler, use make install, as usual. !

Installing GNU CC on VMS

!

The VMS version of GNU CC is distributed in a backup saveset containing both source code and precompiled binaries. !

To install the gcc command so you can use the compiler easily, in the same manner as you use the VMS C compiler, you must install the VMS CLD file for GNU CC as follows: !

    !

  1. Define the VMS logical names GNU_CC and GNU_CC_INCLUDE to point to the directories where the GNU CC executables (gcc-cpp.exe, gcc-cc1.exe, etc.) and the C include files are kept respectively. This should be done with the commands: ! 
    $ assign /system /translation=concealed -
!   disk:[gcc.] gnu_cc
! $ assign /system /translation=concealed -
!   disk:[gcc.include.] gnu_cc_include
!
    !

    with the appropriate disk and directory names. These commands can be placed in your system startup file so they will be executed whenever the machine is rebooted. You may, if you choose, do this via the GCC_INSTALL.COM script in the [GCC] directory. !

  2. Install the GCC command with the command line: ! 
    $ set command /table=sys$common:[syslib]dcltables -
!   /output=sys$common:[syslib]dcltables gnu_cc:[000000]gcc
! $ install replace sys$common:[syslib]dcltables
!
    !
  3. To install the help file, do the following: ! 
    $ library/help sys$library:helplib.hlb gcc.hlp
!
    !

    Now you can invoke the compiler with a command like gcc /verbose file.c, which is equivalent to the command gcc -v -c file.c in Unix. !

!

If you wish to use GNU C++ you must first install GNU CC, and then perform the following steps: !

    !

  1. Define the VMS logical name GNU_GXX_INCLUDE to point to the directory where the preprocessor will search for the C++ header files. This can be done with the command: ! 
    $ assign /system /translation=concealed -
!   disk:[gcc.gxx_include.] gnu_gxx_include
!
    !

    with the appropriate disk and directory name. If you are going to be using a C++ runtime library, this is where its install procedure will install its header files. !

  2. Obtain the file gcc-cc1plus.exe, and place this in the same directory that gcc-cc1.exe is kept. !

    The GNU C++ compiler can be invoked with a command like gcc /plus /verbose file.cc, which is equivalent to the command g++ -v -c file.cc in Unix. !

!

We try to put corresponding binaries and sources on the VMS distribution tape. But sometimes the binaries will be from an older version than the sources, because we don't always have time to update them. (Use the /version option to determine the version number of the binaries and --- 391,466 ---- whether you compile it on a 68030 or with a cross-compiler on a 386, you must specify a 68030 as the host when you configure it. !

To install the cross-compiler, use make install, as usual. !

Installing GNU CC on VMS

!

The VMS version of GNU CC is distributed in a backup saveset containing both source code and precompiled binaries. !

To install the gcc command so you can use the compiler easily, in the same manner as you use the VMS C compiler, you must install the VMS CLD file for GNU CC as follows: !

    !
  1. Define the VMS logical names GNU_CC and GNU_CC_INCLUDE to point to the directories where the GNU CC executables (gcc-cpp.exe, gcc-cc1.exe, etc.) and the C include files are kept respectively. This should be done with the commands: ! 
              $ assign /system /translation=concealed -
!             disk:[gcc.] gnu_cc
!           $ assign /system /translation=concealed -
!             disk:[gcc.include.] gnu_cc_include
!
    !

    with the appropriate disk and directory names. These commands can be placed in your system startup file so they will be executed whenever the machine is rebooted. You may, if you choose, do this via the GCC_INSTALL.COM script in the [GCC] directory. !

  2. Install the GCC command with the command line: ! 
              $ set command /table=sys$common:[syslib]dcltables -
!             /output=sys$common:[syslib]dcltables gnu_cc:[000000]gcc
!           $ install replace sys$common:[syslib]dcltables
!
    !
  3. To install the help file, do the following: ! 
              $ library/help sys$library:helplib.hlb gcc.hlp
!
    !

    Now you can invoke the compiler with a command like gcc /verbose file.c, which is equivalent to the command gcc -v -c file.c in Unix. !

!

If you wish to use GNU C++ you must first install GNU CC, and then perform the following steps: !

    !
  1. Define the VMS logical name GNU_GXX_INCLUDE to point to the directory where the preprocessor will search for the C++ header files. This can be done with the command: ! 
              $ assign /system /translation=concealed -
!             disk:[gcc.gxx_include.] gnu_gxx_include
!
    !

    with the appropriate disk and directory name. If you are going to be using a C++ runtime library, this is where its install procedure will install its header files. !

  2. Obtain the file gcc-cc1plus.exe, and place this in the same directory that gcc-cc1.exe is kept. !

    The GNU C++ compiler can be invoked with a command like gcc /plus /verbose file.cc, which is equivalent to the command g++ -v -c file.cc in Unix. !

!

We try to put corresponding binaries and sources on the VMS distribution tape. But sometimes the binaries will be from an older version than the sources, because we don't always have time to update them. (Use the /version option to determine the version number of the binaries and *************** compare it with the source file ve *** 466,508 **** so.) In this case, you should use the binaries you get to recompile the sources. If you must recompile, here is how: !

    !

  1. Execute the command procedure vmsconfig.com to set up the files tm.h, config.h, aux-output.c, and md., and to create files tconfig.h and hconfig.h. This procedure also creates several linker option files used by make-cc1.com and a data file used by make-l2.com. ! 
    $ @vmsconfig.com
!
    !
  2. Setup the logical names and command tables as defined above. In addition, define the VMS logical name GNU_BISON to point at the to the directories where the Bison executable is kept. This should be done with the command: ! 
    $ assign /system /translation=concealed -
!   disk:[bison.] gnu_bison
!
    !

    You may, if you choose, use the INSTALL_BISON.COM script in the [BISON] directory. !

  3. Install the BISON command with the command line: ! 
    $ set command /table=sys$common:[syslib]dcltables -
!   /output=sys$common:[syslib]dcltables -
!   gnu_bison:[000000]bison
! $ install replace sys$common:[syslib]dcltables
!
    !
  4. Type @make-gcc to recompile everything, or submit the file make-gcc.com to a batch queue. If you wish to build the GNU C++ compiler as well as the GNU CC compiler, you must first edit make-gcc.com and follow the instructions that appear in the comments. !
  5. In order to use GCC, you need a library of functions which GCC compiled code will call to perform certain tasks, and these functions are defined in the file libgcc2.c. To compile this you should use the command procedure make-l2.com, which will generate the library libgcc2.olb. --- 468,510 ---- so.) In this case, you should use the binaries you get to recompile the sources. If you must recompile, here is how: !
      !
    1. Execute the command procedure vmsconfig.com to set up the files tm.h, config.h, aux-output.c, and md., and to create files tconfig.h and hconfig.h. This procedure also creates several linker option files used by make-cc1.com and a data file used by make-l2.com. ! 
                $ @vmsconfig.com
!
      !
    2. Setup the logical names and command tables as defined above. In addition, define the VMS logical name GNU_BISON to point at the to the directories where the Bison executable is kept. This should be done with the command: ! 
                $ assign /system /translation=concealed -
!             disk:[bison.] gnu_bison
!
      !

      You may, if you choose, use the INSTALL_BISON.COM script in the [BISON] directory. !

    3. Install the BISON command with the command line: ! 
                $ set command /table=sys$common:[syslib]dcltables -
!             /output=sys$common:[syslib]dcltables -
!             gnu_bison:[000000]bison
!           $ install replace sys$common:[syslib]dcltables
!
      !
    4. Type @make-gcc to recompile everything, or submit the file make-gcc.com to a batch queue. If you wish to build the GNU C++ compiler as well as the GNU CC compiler, you must first edit make-gcc.com and follow the instructions that appear in the comments. !
    5. In order to use GCC, you need a library of functions which GCC compiled code will call to perform certain tasks, and these functions are defined in the file libgcc2.c. To compile this you should use the command procedure make-l2.com, which will generate the library libgcc2.olb. *************** file libgcc2.c. To compile *** 510,524 **** the same distribution that libgcc2.c came from, and make-gcc.com will automatically do all of this for you. !

      To install the library, use the following commands: ! 

      $ library gnu_cc:[000000]gcclib/delete=(new,eprintf)
! $ library gnu_cc:[000000]gcclib/delete=L_*
! $ library libgcc2/extract=*/output=libgcc2.obj
! $ library gnu_cc:[000000]gcclib libgcc2.obj
!
      !

      The first command simply removes old modules that will be replaced with modules from libgcc2 under different module names. The modules new and eprintf may not actually be present in your gcclib.olb--if the VMS librarian complains about those modules --- 512,526 ---- the same distribution that libgcc2.c came from, and make-gcc.com will automatically do all of this for you. !

      To install the library, use the following commands: ! 

                $ library gnu_cc:[000000]gcclib/delete=(new,eprintf)
!           $ library gnu_cc:[000000]gcclib/delete=L_*
!           $ library libgcc2/extract=*/output=libgcc2.obj
!           $ library gnu_cc:[000000]gcclib libgcc2.obj
!
      !

      The first command simply removes old modules that will be replaced with modules from libgcc2 under different module names. The modules new and eprintf may not actually be present in your gcclib.olb--if the VMS librarian complains about those modules *************** not being present, simply ignore the mes *** 526,545 **** next command. The second command removes the modules that came from the previous version of the library libgcc2.c. !

      Whenever you update the compiler on your system, you should also update the library with the above procedure. !

    6. You may wish to build GCC in such a way that no files are written to the directory where the source files reside. An example would be the when the source files are on a read-only disk. In these cases, execute the following DCL commands (substituting your actual path names): ! 
      $ assign dua0:[gcc.build_dir.]/translation=concealed, -
!          dua1:[gcc.source_dir.]/translation=concealed  gcc_build
! $ set default gcc_build:[000000]
!
      !

      where the directory dua1:[gcc.source_dir] contains the source code, and the directory dua0:[gcc.build_dir] is meant to contain all of the generated object files and executables. Once you have done this, you can proceed building GCC as described above. (Keep in mind --- 528,547 ---- next command. The second command removes the modules that came from the previous version of the library libgcc2.c. !

      Whenever you update the compiler on your system, you should also update the library with the above procedure. !

    7. You may wish to build GCC in such a way that no files are written to the directory where the source files reside. An example would be the when the source files are on a read-only disk. In these cases, execute the following DCL commands (substituting your actual path names): ! 
                $ assign dua0:[gcc.build_dir.]/translation=concealed, -
!                    dua1:[gcc.source_dir.]/translation=concealed  gcc_build
!           $ set default gcc_build:[000000]
!
      !

      where the directory dua1:[gcc.source_dir] contains the source code, and the directory dua0:[gcc.build_dir] is meant to contain all of the generated object files and executables. Once you have done this, you can proceed building GCC as described above. (Keep in mind *************** that gcc_build is a rooted *** 547,553 **** names in each element of the search list must be an actual physical device name rather than another rooted logical name). !

    8. If you are building GNU CC with a previous version of GNU CC, you also should check to see that you have the newest version of the assembler. In particular, GNU CC version 2 treats global constant variables slightly differently from GNU CC version 1, and GAS version --- 549,555 ---- names in each element of the search list must be an actual physical device name rather than another rooted logical name). !

    9. If you are building GNU CC with a previous version of GNU CC, you also should check to see that you have the newest version of the assembler. In particular, GNU CC version 2 treats global constant variables slightly differently from GNU CC version 1, and GAS version *************** the read-only bit set, and the linker wi *** 557,563 **** about mismatched psect attributes for these variables. These warning messages are merely a nuisance, and can safely be ignored. !
    10. If you want to build GNU CC with the VAX C compiler, you will need to make minor changes in make-cccp.com and make-cc1.com to choose alternate definitions of CC, CFLAGS, and LIBS. See comments in those files. However, you must --- 559,565 ---- about mismatched psect attributes for these variables. These warning messages are merely a nuisance, and can safely be ignored. !
    11. If you want to build GNU CC with the VAX C compiler, you will need to make minor changes in make-cccp.com and make-cc1.com to choose alternate definitions of CC, CFLAGS, and LIBS. See comments in those files. However, you must *************** compile libgcc2 in order to *** 568,608 **** make-l2.com expects to be able to find it operational in gnu_cc:[000000]gnu-as.exe. !

      To use GNU CC on VMS, you need the VMS driver programs gcc.exe, gcc.com, and gcc.cld. They are distributed with the VMS binaries (gcc-vms) rather than the GNU CC sources. GAS is also included in gcc-vms, as is Bison. !

      Once you have successfully built GNU CC with VAX C, you should use the resulting compiler to rebuild itself. Before doing this, be sure to restore the CC, CFLAGS, and LIBS definitions in make-cccp.com and make-cc1.com. The second generation compiler will be able to take advantage of many optimizations that must be suppressed when building with other compilers. !

    !

    Under previous versions of GNU CC, the generated code would occasionally give strange results when linked with the sharable VAXCRTL library. Now this should work. !

    Even with this version, however, GNU CC itself should not be linked with the sharable VAXCRTL. The version of qsort in VAXCRTL has a bug (known to be present in VMS versions V4.6 through V5.5) which causes the compiler to fail. !

    The executables are generated by make-cc1.com and make-cccp.com use the object library version of VAXCRTL in order to make use of the qsort routine in gcclib.olb. If you wish to link the compiler executables with the shareable image version of VAXCRTL, you should edit the file tm.h (created by vmsconfig.com) to define the macro QSORT_WORKAROUND. !

    QSORT_WORKAROUND is always defined when GNU CC is compiled with VAX C, to avoid a problem in case gcclib.olb is not yet available.

    Return to the GCC Installation page ! --- 570,610 ---- make-l2.com expects to be able to find it operational in gnu_cc:[000000]gnu-as.exe. !

    To use GNU CC on VMS, you need the VMS driver programs gcc.exe, gcc.com, and gcc.cld. They are distributed with the VMS binaries (gcc-vms) rather than the GNU CC sources. GAS is also included in gcc-vms, as is Bison. !

    Once you have successfully built GNU CC with VAX C, you should use the resulting compiler to rebuild itself. Before doing this, be sure to restore the CC, CFLAGS, and LIBS definitions in make-cccp.com and make-cc1.com. The second generation compiler will be able to take advantage of many optimizations that must be suppressed when building with other compilers. !

!

Under previous versions of GNU CC, the generated code would occasionally give strange results when linked with the sharable VAXCRTL library. Now this should work. !

Even with this version, however, GNU CC itself should not be linked with the sharable VAXCRTL. The version of qsort in VAXCRTL has a bug (known to be present in VMS versions V4.6 through V5.5) which causes the compiler to fail. !

The executables are generated by make-cc1.com and make-cccp.com use the object library version of VAXCRTL in order to make use of the qsort routine in gcclib.olb. If you wish to link the compiler executables with the shareable image version of VAXCRTL, you should edit the file tm.h (created by vmsconfig.com) to define the macro QSORT_WORKAROUND. !

QSORT_WORKAROUND is always defined when GNU CC is compiled with VAX C, to avoid a problem in case gcclib.olb is not yet available.

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/specific.html gcc-3.2.3/INSTALL/specific.html *** gcc-3.2.2/INSTALL/specific.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/specific.html Tue Apr 22 06:56:33 2003 *************** *** 1,15 **** ! Host/Target specific installation notes for GCC ! ! ! ! ! !

P

lease read this document carefully before installing the GNU Compiler Collection on your machine. !

  • 1750a-*-*
  • a29k
  • a29k-*-bsd --- 1,17 ---- ! ! Host/Target specific installation notes for GCC ! ! ! ! ! !

    Host/Target specific installation notes for GCC

    ! Please read this document carefully before installing the GNU Compiler Collection on your machine. ! ! !
    !

    1750a-*-*

    !

    MIL-STD-1750A processors. This target is obsoleted in GCC 3.1. !

    The MIL-STD-1750A cross configuration produces output for as1750, an assembler/linker available under the GNU General Public License for the 1750A. as1750 can be obtained at ftp://ftp.fta-berlin.de/pub/crossgcc/1750gals/. A similarly licensed simulator for the 1750A is available from same address. !

    You should ignore a fatal error during the building of libgcc (libgcc is not yet implemented for the 1750A.) !

    The as1750 assembler requires the file ms1750.inc, which is found in the directory gcc/config/1750a. !

    GCC produced the same sections as the Fairchild F9450 C Compiler, namely: !

    Normal !
    The program code section. !
    Static !
    The read/write (RAM) data section. !
    Konst !
    The read-only (ROM) constants section. !
    Init !
    Initialization section (code to copy KREL to SREL).
    !

    The smallest addressable unit is 16 bits (BITS_PER_UNIT is 16). This means that type char is represented with a 16-bit word per character. The 1750A's "Load/Store Upper/Lower Byte" instructions are not used by GCC. !

    !

    a29k

    !

    AMD Am29k-family processors. These are normally used in embedded applications. This configuration corresponds to AMD's standard calling sequence and binary interface and is compatible with other 29k tools. !

    AMD has abandoned this processor. All existing a29k targets are obsoleted in GCC 3.1. !

    You may need to make a variant of the file a29k.h for your particular configuration. !

    !

    a29k-*-bsd

    !

    AMD Am29050 used in a system running a variant of BSD Unix. !

    !

    alpha*-*-*

    !

    This section contains general configuration information for all alpha-based platforms using ELF (in particular, ignore this section for DEC OSF/1, Digital UNIX and Tru64 UNIX). In addition to reading this section, please read all other sections that match your target. !

    We require binutils 2.11.2 or newer. Previous binutils releases had a number of problems with DWARF 2 debugging information, not the least of which is incorrect linking of shared libraries. !

    !

    alpha*-dec-osf*

    !

    Systems using processors that implement the DEC Alpha architecture and are running the DEC/Compaq Unix (DEC OSF/1, Digital UNIX, or Compaq Tru64 UNIX) operating system, for example the DEC Alpha AXP systems. !

    Support for versions before alpha*-dec-osf4 is obsoleted in GCC 3.1. (These are the versions which identify themselves as DEC OSF/1.) !

    In Digital Unix V4.0, virtual memory exhausted bootstrap failures may be fixed by configuring with --with-gc=simple, reconfiguring Kernel Virtual Memory and Swap parameters per the /usr/sbin/sys_check Tuning Suggestions, or applying the patch in http://gcc.gnu.org/ml/gcc/2002-08/msg00822.html. !

    In Tru64 UNIX V5.1, Compaq introduced a new assembler that does not currently (2001-06-13) work with mips-tfile. As a workaround, we need to use the old assembler, invoked via the barely documented -oldas option. To bootstrap GCC, you either need to use the Compaq C Compiler: ! 

       % CC=cc srcdir/configure [options] [target]
!
    !

    or you can use a copy of GCC 2.95.3 or higher built on Tru64 UNIX V4.0: ! 

       % CC=gcc -Wa,-oldas srcdir/configure [options] [target]
!
    !

    As of GNU binutils 2.11.2, neither GNU as nor GNU ld are supported on Tru64 UNIX, so you must not configure GCC with --with-gnu-as or --with-gnu-ld. !

    The --enable-threads options isn't supported yet. A patch is in preparation for a future release. !

    GCC writes a .verstamp directive to the assembler output file unless it is built as a cross-compiler. It gets the version to use from the system header file /usr/include/stamp.h. If you install a new version of DEC Unix, you should rebuild GCC to pick up the new version stamp. !

    Note that since the Alpha is a 64-bit architecture, cross-compilers from 32-bit machines will not generate code as efficient as that generated when the compiler is running on a 64-bit machine because many optimizations that depend on being able to represent a word on the --- 114,245 ----

  • Older systems
! !
!

1750a-*-*

!

MIL-STD-1750A processors. This target is obsoleted in GCC 3.1. !

The MIL-STD-1750A cross configuration produces output for as1750, an assembler/linker available under the GNU General Public License for the 1750A. as1750 can be obtained at ftp://ftp.fta-berlin.de/pub/crossgcc/1750gals/. A similarly licensed simulator for the 1750A is available from same address. !

You should ignore a fatal error during the building of libgcc (libgcc is not yet implemented for the 1750A.) !

The as1750 assembler requires the file ms1750.inc, which is found in the directory gcc/config/1750a. !

GCC produced the same sections as the Fairchild F9450 C Compiler, namely: !

Normal !
The program code section. !
Static !
The read/write (RAM) data section. !
Konst !
The read-only (ROM) constants section. !
Init !
Initialization section (code to copy KREL to SREL).
!

The smallest addressable unit is 16 bits (BITS_PER_UNIT is 16). This means that type char is represented with a 16-bit word per character. The 1750A's "Load/Store Upper/Lower Byte" instructions are not used by GCC. !

!

a29k

!

AMD Am29k-family processors. These are normally used in embedded applications. This configuration corresponds to AMD's standard calling sequence and binary interface and is compatible with other 29k tools. !

AMD has abandoned this processor. All existing a29k targets are obsoleted in GCC 3.1. !

You may need to make a variant of the file a29k.h for your particular configuration. !

!

a29k-*-bsd

!

AMD Am29050 used in a system running a variant of BSD Unix. !

!

alpha*-*-*

!

This section contains general configuration information for all alpha-based platforms using ELF (in particular, ignore this section for DEC OSF/1, Digital UNIX and Tru64 UNIX). In addition to reading this section, please read all other sections that match your target. !

We require binutils 2.11.2 or newer. Previous binutils releases had a number of problems with DWARF 2 debugging information, not the least of which is incorrect linking of shared libraries. !

!

alpha*-dec-osf*

!

Systems using processors that implement the DEC Alpha architecture and are running the DEC/Compaq Unix (DEC OSF/1, Digital UNIX, or Compaq Tru64 UNIX) operating system, for example the DEC Alpha AXP systems. !

Support for versions before alpha*-dec-osf4 is obsoleted in GCC 3.1. (These are the versions which identify themselves as DEC OSF/1.) !

In Digital Unix V4.0, virtual memory exhausted bootstrap failures may be fixed by configuring with --with-gc=simple, reconfiguring Kernel Virtual Memory and Swap parameters per the /usr/sbin/sys_check Tuning Suggestions, or applying the patch in http://gcc.gnu.org/ml/gcc/2002-08/msg00822.html. !

In Tru64 UNIX V5.1, Compaq introduced a new assembler that does not currently (2001-06-13) work with mips-tfile. As a workaround, we need to use the old assembler, invoked via the barely documented -oldas option. To bootstrap GCC, you either need to use the Compaq C Compiler: ! 

        % CC=cc srcdir/configure [options] [target]
!
!

or you can use a copy of GCC 2.95.3 or higher built on Tru64 UNIX V4.0: ! 

        % CC=gcc -Wa,-oldas srcdir/configure [options] [target]
!
!

As of GNU binutils 2.11.2, neither GNU as nor GNU ld are supported on Tru64 UNIX, so you must not configure GCC with --with-gnu-as or --with-gnu-ld. !

The --enable-threads options isn't supported yet. A patch is in preparation for a future release. !

GCC writes a .verstamp directive to the assembler output file unless it is built as a cross-compiler. It gets the version to use from the system header file /usr/include/stamp.h. If you install a new version of DEC Unix, you should rebuild GCC to pick up the new version stamp. !

Note that since the Alpha is a 64-bit architecture, cross-compilers from 32-bit machines will not generate code as efficient as that generated when the compiler is running on a 64-bit machine because many optimizations that depend on being able to represent a word on the *************** target in an integral value on the host *** 245,251 **** cross-compilers on the Alpha for 32-bit machines has only been tested in a few cases and may not work properly. !

make compare may fail on old versions of DEC Unix unless you add -save-temps to CFLAGS. On these systems, the name of the assembler input file is stored in the object file, and that makes comparison fail if it differs between the stage1 and --- 247,253 ---- cross-compilers on the Alpha for 32-bit machines has only been tested in a few cases and may not work properly. !

make compare may fail on old versions of DEC Unix unless you add -save-temps to CFLAGS. On these systems, the name of the assembler input file is stored in the object file, and that makes comparison fail if it differs between the stage1 and *************** unless the comparisons fail without that *** 256,267 **** -save-temps, you will have to manually delete the .i and .s files after each series of compilations. !

GCC now supports both the native (ECOFF) debugging format used by DBX and GDB and an encapsulated STABS format for use only with GDB. See the discussion of the --with-stabs option of configure above for more information on these formats and how to select them. !

There is a bug in DEC's assembler that produces incorrect line numbers for ECOFF format when the .align directive is used. To work around this problem, GCC will not emit such alignment directives while writing ECOFF format debugging information even if optimization is --- 258,269 ---- -save-temps, you will have to manually delete the .i and .s files after each series of compilations. !

GCC now supports both the native (ECOFF) debugging format used by DBX and GDB and an encapsulated STABS format for use only with GDB. See the discussion of the --with-stabs option of configure above for more information on these formats and how to select them. !

There is a bug in DEC's assembler that produces incorrect line numbers for ECOFF format when the .align directive is used. To work around this problem, GCC will not emit such alignment directives while writing ECOFF format debugging information even if optimization is *************** being performed. Unfortunately, this ha *** 269,343 **** side-effect that code addresses when -O is specified are different depending on whether or not -g is also specified. !

To avoid this behavior, specify -gstabs+ and use GDB instead of DBX. DEC is now aware of this problem with the assembler and hopes to provide a fix shortly. !

!

alphaev5-cray-unicosmk*

!

Cray T3E systems running Unicos/Mk. !

This port is incomplete and has many known bugs. We hope to improve the support for this target soon. Currently, only the C front end is supported, and it is not possible to build parallel applications. Cray modules are not supported; in particular, Craylibs are assumed to be in /opt/ctl/craylibs/craylibs. !

You absolutely must use GNU make on this platform. Also, you need to tell GCC where to find the assembler and the linker. The simplest way to do so is by providing --with-as and --with-ld to configure, e.g. ! 

    configure --with-as=/opt/ctl/bin/cam --with-ld=/opt/ctl/bin/cld \
!       --enable-languages=c
!
!

The comparison test during make bootstrap fails on Unicos/Mk because the assembler inserts timestamps into object files. You should be able to work around this by doing make all after getting this failure. !

!

arc-*-elf

!

Argonaut ARC processor. This configuration is intended for embedded systems. !

!

arm-*-aout

!

Advanced RISC Machines ARM-family processors. These are often used in embedded applications. There are no standard Unix configurations. This configuration corresponds to the basic instruction sequences and will produce a.out format object modules. !

You may need to make a variant of the file arm.h for your particular configuration. !

!

arm-*-elf

!

This configuration is intended for embedded systems. !

!

arm*-*-linux-gnu

!

We require GNU binutils 2.10 or newer. !

!

arm-*-riscix

!

The ARM2 or ARM3 processor running RISC iX, Acorn's port of BSD Unix. This configuration is obsoleted in GCC 3.1. !

If you are running a version of RISC iX prior to 1.2 then you must specify the version number during configuration. Note that the assembler shipped with RISC iX does not support stabs debugging information; a new version of the assembler, with stabs support --- 271,345 ---- side-effect that code addresses when -O is specified are different depending on whether or not -g is also specified. !

To avoid this behavior, specify -gstabs+ and use GDB instead of DBX. DEC is now aware of this problem with the assembler and hopes to provide a fix shortly. !

!

alphaev5-cray-unicosmk*

!

Cray T3E systems running Unicos/Mk. !

This port is incomplete and has many known bugs. We hope to improve the support for this target soon. Currently, only the C front end is supported, and it is not possible to build parallel applications. Cray modules are not supported; in particular, Craylibs are assumed to be in /opt/ctl/craylibs/craylibs. !

You absolutely must use GNU make on this platform. Also, you need to tell GCC where to find the assembler and the linker. The simplest way to do so is by providing --with-as and --with-ld to configure, e.g. ! 

         configure --with-as=/opt/ctl/bin/cam --with-ld=/opt/ctl/bin/cld \
!            --enable-languages=c
!
!

The comparison test during make bootstrap fails on Unicos/Mk because the assembler inserts timestamps into object files. You should be able to work around this by doing make all after getting this failure. !

!

arc-*-elf

!

Argonaut ARC processor. This configuration is intended for embedded systems. !

!

arm-*-aout

!

Advanced RISC Machines ARM-family processors. These are often used in embedded applications. There are no standard Unix configurations. This configuration corresponds to the basic instruction sequences and will produce a.out format object modules. !

You may need to make a variant of the file arm.h for your particular configuration. !

!

arm-*-elf

!

This configuration is intended for embedded systems. !

!

arm*-*-linux-gnu

!

We require GNU binutils 2.10 or newer. !

!

arm-*-riscix

!

The ARM2 or ARM3 processor running RISC iX, Acorn's port of BSD Unix. This configuration is obsoleted in GCC 3.1. !

If you are running a version of RISC iX prior to 1.2 then you must specify the version number during configuration. Note that the assembler shipped with RISC iX does not support stabs debugging information; a new version of the assembler, with stabs support *************** included, is now available from Acorn an *** 345,465 **** ftp://ftp.acorn.com/pub/riscix/as+xterm.tar.Z. To enable stabs debugging, pass --with-gnu-as to configure. !

You will need to install GNU sed before you can run configure. !

!

avr

!

ATMEL AVR-family micro controllers. These are used in embedded applications. There are no standard Unix configurations. See "AVR Options" in the main manual for the list of supported MCU types. !

Use configure --target=avr --enable-languages="c" to configure GCC. !

Further installation notes and other useful information about AVR tools can also be obtained from: !

!

We strongly recommend using binutils 2.11 or newer. !

The following error: ! 

  Error: register required
!
!

indicates that you should upgrade to a newer version of the binutils. !

!

c4x

!

Texas Instruments TMS320C3x and TMS320C4x Floating Point Digital Signal Processors. These are used in embedded applications. There are no standard Unix configurations. See "TMS320C3x/C4x Options" in the main manual for the list of supported MCU types. !

GCC can be configured as a cross compiler for both the C3x and C4x architectures on the same system. Use configure --target=c4x --enable-languages="c,c++" to configure. !

Further installation notes and other useful information about C4x tools can also be obtained from: !

!
!

CRIS

!

CRIS is the CPU architecture in Axis Communications ETRAX system-on-a-chip series. These are used in embedded applications. !

See "CRIS Options" in the main manual for a list of CRIS-specific options. !

There are a few different CRIS targets: !

cris-axis-aout !
Old target. Includes a multilib for the elinux a.out-based target. No multilibs for newer architecture variants.
cris-axis-elf !
Mainly for monolithic embedded systems. Includes a multilib for the v10 core used in ETRAX 100 LX.
cris-axis-linux-gnu !
A GNU/Linux port for the CRIS architecture, currently targeting ETRAX 100 LX by default.
!

For cris-axis-aout and cris-axis-elf you need binutils 2.11 or newer. For cris-axis-linux-gnu you need binutils 2.12 or newer. !

Pre-packaged tools can be obtained from ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/. More information about this platform is available at http://developer.axis.com/. !

!

DOS

!

Please have a look at our binaries page. !

You cannot install GCC by itself on MSDOS; it will not compile under any MSDOS compiler except itself. You need to get the complete compilation package DJGPP, which includes binaries as well as sources, and includes all the necessary compilation tools and libraries. !

!

dsp16xx

!

A port to the AT&T DSP1610 family of processors. !

!

*-*-freebsd*

!

The version of binutils installed in /usr/bin is known to work unless otherwise specified in any per-architecture notes. However, binutils 2.12.1 or greater is known to improve overall testsuite results. !

For FreeBSD 1, FreeBSD 2 or any mutant a.out versions of FreeBSD 3: All configuration support and files as shipped with GCC 2.95 are still in place. FreeBSD 2.2.7 has been known to bootstrap completely; however, it is unknown which version of binutils was used (it is assumed that it was the system copy in /usr/bin) and C++ EH failures were noted. !

Support for FreeBSD 1 is obsoleted in GCC 3.1. !

For FreeBSD using the ELF file format: DWARF 2 debugging is now the default for all CPU architectures. It had been the default on FreeBSD/alpha since its inception. You may use -gstabs instead of -g, if you really want the old debugging format. There are --- 347,467 ---- ftp://ftp.acorn.com/pub/riscix/as+xterm.tar.Z. To enable stabs debugging, pass --with-gnu-as to configure. !

You will need to install GNU sed before you can run configure. !

!

avr

!

ATMEL AVR-family micro controllers. These are used in embedded applications. There are no standard Unix configurations. See "AVR Options" in the main manual for the list of supported MCU types. !

Use configure --target=avr --enable-languages="c" to configure GCC. !

Further installation notes and other useful information about AVR tools can also be obtained from: !

!

We strongly recommend using binutils 2.11 or newer. !

The following error: ! 

       Error: register required
!
!

indicates that you should upgrade to a newer version of the binutils. !

!

c4x

!

Texas Instruments TMS320C3x and TMS320C4x Floating Point Digital Signal Processors. These are used in embedded applications. There are no standard Unix configurations. See "TMS320C3x/C4x Options" in the main manual for the list of supported MCU types. !

GCC can be configured as a cross compiler for both the C3x and C4x architectures on the same system. Use configure --target=c4x --enable-languages="c,c++" to configure. !

Further installation notes and other useful information about C4x tools can also be obtained from: !

!
!

CRIS

!

CRIS is the CPU architecture in Axis Communications ETRAX system-on-a-chip series. These are used in embedded applications. !

See "CRIS Options" in the main manual for a list of CRIS-specific options. !

There are a few different CRIS targets: !

cris-axis-aout !
Old target. Includes a multilib for the elinux a.out-based target. No multilibs for newer architecture variants.
cris-axis-elf !
Mainly for monolithic embedded systems. Includes a multilib for the v10 core used in ETRAX 100 LX.
cris-axis-linux-gnu !
A GNU/Linux port for the CRIS architecture, currently targeting ETRAX 100 LX by default.
!

For cris-axis-aout and cris-axis-elf you need binutils 2.11 or newer. For cris-axis-linux-gnu you need binutils 2.12 or newer. !

Pre-packaged tools can be obtained from ftp://ftp.axis.com/pub/axis/tools/cris/compiler-kit/. More information about this platform is available at http://developer.axis.com/. !

!

DOS

!

Please have a look at our binaries page. !

You cannot install GCC by itself on MSDOS; it will not compile under any MSDOS compiler except itself. You need to get the complete compilation package DJGPP, which includes binaries as well as sources, and includes all the necessary compilation tools and libraries. !

!

dsp16xx

!

A port to the AT&T DSP1610 family of processors. !

!

*-*-freebsd*

!

The version of binutils installed in /usr/bin is known to work unless otherwise specified in any per-architecture notes. However, binutils 2.12.1 or greater is known to improve overall testsuite results. !

For FreeBSD 1, FreeBSD 2 or any mutant a.out versions of FreeBSD 3: All configuration support and files as shipped with GCC 2.95 are still in place. FreeBSD 2.2.7 has been known to bootstrap completely; however, it is unknown which version of binutils was used (it is assumed that it was the system copy in /usr/bin) and C++ EH failures were noted. !

Support for FreeBSD 1 is obsoleted in GCC 3.1. !

For FreeBSD using the ELF file format: DWARF 2 debugging is now the default for all CPU architectures. It had been the default on FreeBSD/alpha since its inception. You may use -gstabs instead of -g, if you really want the old debugging format. There are *************** However, as a general user, do not attem *** 471,477 **** compiler with this release. Known to bootstrap and check with good results on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4, 4.5-STABLE and 5-CURRENT. !

In principle, --enable-threads is now compatible with --enable-libgcj on FreeBSD. However, it has only been built and tested on i386-*-freebsd4.5 and alpha-*-freebsd5.0. The static --- 473,479 ---- compiler with this release. Known to bootstrap and check with good results on FreeBSD 3.0, 3.4, 4.0, 4.2, 4.3, 4.4, 4.5-STABLE and 5-CURRENT. !

In principle, --enable-threads is now compatible with --enable-libgcj on FreeBSD. However, it has only been built and tested on i386-*-freebsd4.5 and alpha-*-freebsd5.0. The static *************** should properly complete the bootstrap). *** 488,578 **** supported by FreeBSD will require additional configuration tuning in, at the very least, both boehm-gc and libffi. !

Shared libgcc_s.so is now built and installed by default. !

!

elxsi-elxsi-bsd

!

The Elxsi's C compiler has known limitations that prevent it from compiling GCC. Please contact mrs@wrs.com for more details. !

Support for this processor is obsoleted in GCC 3.1. !

!

h8300-hms

!

Hitachi H8/300 series of processors. !

Please have a look at our binaries page. !

The calling convention and structure layout has changed in release 2.6. All code must be recompiled. The calling convention now passes the first three arguments in function calls in registers. Structures are no longer a multiple of 2 bytes. !

!

hppa*-hp-hpux*

!

We highly recommend using gas/binutils 2.8 or newer on all hppa platforms; you may encounter a variety of problems when using the HP assembler. The HP assembler does not work with the hppa64-hp-hpux11* port. !

Specifically, -g does not work on HP-UX (since that system uses a peculiar debugging format which GCC does not know about), unless you use GAS and GDB and configure GCC with the --with-gnu-as and ! --with-as=... options. !

If you wish to use the pa-risc 2.0 architecture support with a 32-bit runtime, you must use either the HP assembler, gas/binutils 2.11 or newer, or a recent snapshot of gas. !

More specific information to hppa*-hp-hpux* targets follows. !

!

hppa*-hp-hpux9

!

The HP assembler has major problems on this platform. We've tried to work around the worst of the problems. However, those workarounds may be causing linker crashes in some circumstances; the workarounds also probably prevent shared libraries from working. Use the GNU assembler to avoid these problems. !

The configuration scripts for GCC will also trigger a bug in the hpux9 shell. To avoid this problem set CONFIG_SHELL to /bin/ksh and SHELL to /bin/ksh in your environment. !

!

hppa*-hp-hpux10

!

For hpux10.20, we highly recommend you pick up the latest sed patch PHCO_19798 from HP. HP has two sites which provide patches free of charge: !

!

The HP assembler on these systems is much better than the hpux9 assembler, but still has some problems. Most notably the assembler inserts timestamps into each object file it creates, causing the 3-stage comparison test to fail during a make bootstrap. You should be able to continue by saying make all after getting the failure from make bootstrap. !

!

hppa*-hp-hpux11

!

GCC 3.0 and up support HP-UX 11. On 64-bit capable systems, there are two distinct ports. The hppa2.0w-hp-hpux11* port generates code for the 32-bit pa-risc runtime architecture. It uses the HP linker and is currently the default selected by config.guess. The --- 490,580 ---- supported by FreeBSD will require additional configuration tuning in, at the very least, both boehm-gc and libffi. !

Shared libgcc_s.so is now built and installed by default. !

!

elxsi-elxsi-bsd

!

The Elxsi's C compiler has known limitations that prevent it from compiling GCC. Please contact mrs@wrs.com for more details. !

Support for this processor is obsoleted in GCC 3.1. !

!

h8300-hms

!

Hitachi H8/300 series of processors. !

Please have a look at our binaries page. !

The calling convention and structure layout has changed in release 2.6. All code must be recompiled. The calling convention now passes the first three arguments in function calls in registers. Structures are no longer a multiple of 2 bytes. !

!

hppa*-hp-hpux*

!

We highly recommend using gas/binutils 2.8 or newer on all hppa platforms; you may encounter a variety of problems when using the HP assembler. The HP assembler does not work with the hppa64-hp-hpux11* port. !

Specifically, -g does not work on HP-UX (since that system uses a peculiar debugging format which GCC does not know about), unless you use GAS and GDB and configure GCC with the --with-gnu-as and ! --with-as=... options. !

If you wish to use the pa-risc 2.0 architecture support with a 32-bit runtime, you must use either the HP assembler, gas/binutils 2.11 or newer, or a recent snapshot of gas. !

More specific information to hppa*-hp-hpux* targets follows. !

!

hppa*-hp-hpux9

!

The HP assembler has major problems on this platform. We've tried to work around the worst of the problems. However, those workarounds may be causing linker crashes in some circumstances; the workarounds also probably prevent shared libraries from working. Use the GNU assembler to avoid these problems. !

The configuration scripts for GCC will also trigger a bug in the hpux9 shell. To avoid this problem set CONFIG_SHELL to /bin/ksh and SHELL to /bin/ksh in your environment. !

!

hppa*-hp-hpux10

!

For hpux10.20, we highly recommend you pick up the latest sed patch PHCO_19798 from HP. HP has two sites which provide patches free of charge: !

!

The HP assembler on these systems is much better than the hpux9 assembler, but still has some problems. Most notably the assembler inserts timestamps into each object file it creates, causing the 3-stage comparison test to fail during a make bootstrap. You should be able to continue by saying make all after getting the failure from make bootstrap. !

!

hppa*-hp-hpux11

!

GCC 3.0 and up support HP-UX 11. On 64-bit capable systems, there are two distinct ports. The hppa2.0w-hp-hpux11* port generates code for the 32-bit pa-risc runtime architecture. It uses the HP linker and is currently the default selected by config.guess. The *************** pa-risc 2.0 architecture. It must be ex *** 581,600 **** --host=hppa64-hp-hpux11* configure option. Different prefixes must be used if both ports are to be installed on the same system. !

You must use GNU binutils 2.11 or above with the 32-bit port. Thread support is not currently implemented, so --enable-threads does not work. See: !

!

GCC 2.95.x is not supported under HP-UX 11 and cannot be used to compile GCC 3.0 and up. Refer to binaries for information about obtaining precompiled GCC binaries for HP-UX. !

GNU binutils 2.13 or later is recommended with the 64-bit port. The HP assembler is not supported. It is highly recommended that the GNU linker be used as well. Either binutils must be built prior to gcc, or a binary distribution of gcc or binutils must be --- 583,602 ---- --host=hppa64-hp-hpux11* configure option. Different prefixes must be used if both ports are to be installed on the same system. !

You must use GNU binutils 2.11 or above with the 32-bit port. Thread support is not currently implemented, so --enable-threads does not work. See: !

!

GCC 2.95.x is not supported under HP-UX 11 and cannot be used to compile GCC 3.0 and up. Refer to binaries for information about obtaining precompiled GCC binaries for HP-UX. !

GNU binutils 2.13 or later is recommended with the 64-bit port. The HP assembler is not supported. It is highly recommended that the GNU linker be used as well. Either binutils must be built prior to gcc, or a binary distribution of gcc or binutils must be *************** differences in semantics between traditi *** 606,630 **** have been problems reported with various binary distributions. This port still is undergoing significant development. !

!

i370-*-*

!

This port is very preliminary and has many known bugs. We hope to have a higher-quality port for this machine soon. !

!

*-*-linux-gnu

!

If you use glibc 2.2 (or 2.1.9x), GCC 2.95.2 won't install out-of-the-box. You'll get compile errors while building libstdc++. The patch glibc-2.2.patch, that is to be applied in the GCC source tree, fixes the compatibility problems. !

!

Currently Glibc 2.2.3 (and older releases) and GCC 3.0 are out of sync since the latest exception handling changes for GCC. Compiling glibc with GCC 3.0 will give a binary incompatible glibc and therefore cause lots of problems and might make your system completly unusable. This --- 608,632 ---- have been problems reported with various binary distributions. This port still is undergoing significant development. !

!

i370-*-*

!

This port is very preliminary and has many known bugs. We hope to have a higher-quality port for this machine soon. !

!

*-*-linux-gnu

!

If you use glibc 2.2 (or 2.1.9x), GCC 2.95.2 won't install out-of-the-box. You'll get compile errors while building libstdc++. The patch glibc-2.2.patch, that is to be applied in the GCC source tree, fixes the compatibility problems. !

!

Currently Glibc 2.2.3 (and older releases) and GCC 3.0 are out of sync since the latest exception handling changes for GCC. Compiling glibc with GCC 3.0 will give a binary incompatible glibc and therefore cause lots of problems and might make your system completly unusable. This *************** strongly advise to wait for glibc 2.2.4 *** 633,711 **** glibc 2.2.4 whether patches for GCC 3.0 are needed. You can use glibc 2.2.3 with GCC 3.0, just do not try to recompile it. !

!

i?86-*-linux*oldld

!

Use this configuration to generate a.out binaries on Linux-based GNU systems if you do not have gas/binutils version 2.5.2 or later installed. !

This configuration is obsoleted in GCC 3.1. !

!

i?86-*-linux*aout

!

Use this configuration to generate a.out binaries on Linux-based GNU systems. This configuration is being superseded. You must use gas/binutils version 2.5.2 or later. !

!

i?86-*-linux*

!

You will need binutils 2.9.1.0.15 or newer for exception handling to work. !

If you receive Signal 11 errors when building on GNU/Linux, then it is possible you have a hardware problem. Further information on this can be found on www.bitwizard.nl. !

!

i?86-*-sco

!

Compilation with RCC is recommended. Also, it may be a good idea to link with GNU malloc instead of the malloc that comes with the system. !

!

i?86-*-sco3.2v4

!

Use this configuration for SCO release 3.2 version 4. !

!

i?86-*-sco3.2v5*

!

Use this for the SCO OpenServer Release 5 family of operating systems. !

Unlike earlier versions of GCC, the ability to generate COFF with this target is no longer provided. !

Earlier versions of GCC emitted DWARF 1 when generating ELF to allow the system debugger to be used. That support was too burdensome to maintain. GCC now emits only DWARF 2 for this target. This means you may use either the UDK debugger or GDB to debug programs built by this version of GCC. !

Use of the -march=pentiumpro flag can result in unrecognized opcodes when using the native assembler on OS versions before 5.0.6. (Support for P6 opcodes was added to the native ELF assembler in that version.) While it's rather rare to see these emitted by GCC yet, errors of the basic form: ! 

  /usr/tmp/ccaNlqBc.s:22:unknown instruction: fcomip
!   /usr/tmp/ccaNlqBc.s:50:unknown instruction: fucomip
!
!

are symptoms of this problem. You may work around this by not building affected files with that flag, by using the GNU assembler, or by using the assembler provided with the current version of the OS. Users of GNU assembler should see the note below for hazards on doing so. !

The native SCO assembler that is provided with the OS at no charge is normally required. If, however, you must be able to use the GNU assembler (perhaps you're compiling code with asms that require GAS syntax) you may configure this package using the flags --- 635,713 ---- glibc 2.2.4 whether patches for GCC 3.0 are needed. You can use glibc 2.2.3 with GCC 3.0, just do not try to recompile it. !

!

i?86-*-linux*oldld

!

Use this configuration to generate a.out binaries on Linux-based GNU systems if you do not have gas/binutils version 2.5.2 or later installed. !

This configuration is obsoleted in GCC 3.1. !

!

i?86-*-linux*aout

!

Use this configuration to generate a.out binaries on Linux-based GNU systems. This configuration is being superseded. You must use gas/binutils version 2.5.2 or later. !

!

i?86-*-linux*

!

You will need binutils 2.9.1.0.15 or newer for exception handling to work. !

If you receive Signal 11 errors when building on GNU/Linux, then it is possible you have a hardware problem. Further information on this can be found on www.bitwizard.nl. !

!

i?86-*-sco

!

Compilation with RCC is recommended. Also, it may be a good idea to link with GNU malloc instead of the malloc that comes with the system. !

!

i?86-*-sco3.2v4

!

Use this configuration for SCO release 3.2 version 4. !

!

i?86-*-sco3.2v5*

!

Use this for the SCO OpenServer Release 5 family of operating systems. !

Unlike earlier versions of GCC, the ability to generate COFF with this target is no longer provided. !

Earlier versions of GCC emitted DWARF 1 when generating ELF to allow the system debugger to be used. That support was too burdensome to maintain. GCC now emits only DWARF 2 for this target. This means you may use either the UDK debugger or GDB to debug programs built by this version of GCC. !

Use of the -march=pentiumpro flag can result in unrecognized opcodes when using the native assembler on OS versions before 5.0.6. (Support for P6 opcodes was added to the native ELF assembler in that version.) While it's rather rare to see these emitted by GCC yet, errors of the basic form: ! 

       /usr/tmp/ccaNlqBc.s:22:unknown instruction: fcomip
!        /usr/tmp/ccaNlqBc.s:50:unknown instruction: fucomip
!
!

are symptoms of this problem. You may work around this by not building affected files with that flag, by using the GNU assembler, or by using the assembler provided with the current version of the OS. Users of GNU assembler should see the note below for hazards on doing so. !

The native SCO assembler that is provided with the OS at no charge is normally required. If, however, you must be able to use the GNU assembler (perhaps you're compiling code with asms that require GAS syntax) you may configure this package using the flags *************** require GAS syntax) you may configure th *** 713,730 **** use a recent version of GNU binutils; versions past 2.9.1 seem to work well. !

In general, the --with-gnu-as option isn't as well tested as the native assembler. !

Look in gcc/config/i386/sco5.h (search for "messy") for additional OpenServer-specific flags. !

Systems based on OpenServer before 5.0.4 (uname -X will tell you what you're running) require TLS597 from ftp://ftp.sco.com/TLS/ for C++ constructors and destructors to work right. !

The system linker in (at least) 5.0.4 and 5.0.5 will sometimes do the wrong thing for a construct that GCC will emit for PIC code. This can be seen as execution testsuite failures when using -fPIC on 921215-1.c, 931002-1.c, nestfunc-1.c, and gcov-1.c. --- 715,732 ---- use a recent version of GNU binutils; versions past 2.9.1 seem to work well. !

In general, the --with-gnu-as option isn't as well tested as the native assembler. !

Look in gcc/config/i386/sco5.h (search for "messy") for additional OpenServer-specific flags. !

Systems based on OpenServer before 5.0.4 (uname -X will tell you what you're running) require TLS597 from ftp://ftp.sco.com/TLS/ for C++ constructors and destructors to work right. !

The system linker in (at least) 5.0.4 and 5.0.5 will sometimes do the wrong thing for a construct that GCC will emit for PIC code. This can be seen as execution testsuite failures when using -fPIC on 921215-1.c, 931002-1.c, nestfunc-1.c, and gcov-1.c. *************** available. You must install both *** 733,739 **** ftp://ftp.sco.com/Supplements/rs505a/ and OSS499A. !

The dynamic linker in OpenServer 5.0.5 (earlier versions may show the same problem) aborts on certain G77-compiled programs. It's particularly likely to be triggered by building Fortran code with the -fPIC flag. Although it's conceivable that the error could be triggered by other --- 735,741 ---- ftp://ftp.sco.com/Supplements/rs505a/ and OSS499A. !

The dynamic linker in OpenServer 5.0.5 (earlier versions may show the same problem) aborts on certain G77-compiled programs. It's particularly likely to be triggered by building Fortran code with the -fPIC flag. Although it's conceivable that the error could be triggered by other *************** backtrace with a fault occurring in /usr/lib/ld.so.1. This problem has been reported to SCO engineering and will hopefully be addressed in later releases. !

!

i?86-*-udk

!

This target emulates the SCO Universal Development Kit and requires that package be installed. (If it is installed, you will have a /udk/usr/ccs/bin/cc file present.) It's very much like the i?86-*-unixware7* target --- 749,759 ---- running as /usr/lib/ld.so.1. This problem has been reported to SCO engineering and will hopefully be addressed in later releases. !

!

i?86-*-udk

!

This target emulates the SCO Universal Development Kit and requires that package be installed. (If it is installed, you will have a /udk/usr/ccs/bin/cc file present.) It's very much like the i?86-*-unixware7* target *************** default compiler such as OpenServer 5 or *** 760,877 **** generate binaries that will run on OpenServer, Unixware 2, or Unixware 7, with the same warnings and caveats as the SCO UDK. !

This target is a little tricky to build because we have to distinguish it from the native tools (so it gets headers, startups, and libraries from the right place) while making the tools not think we're actually building a cross compiler. The easiest way to do this is with a configure command like this: ! 

    CC=/udk/usr/ccs/bin/cc /your/path/to/gcc/configure \
!       --host=i686-pc-udk --target=i686-pc-udk --program-prefix=udk-
!
!

You should substitute i686 in the above command with the appropriate processor for your host. !

After the usual make bootstrap and make install, you can then access the UDK-targeted GCC tools by adding udk- before the commonly known name. For example, to invoke the C compiler, you would use udk-gcc. They will coexist peacefully with any native-target GCC tools you may have installed. !

!

i?86-*-isc

!

This configuration is obsoleted in GCC 3.1. !

It may be a good idea to link with GNU malloc instead of the malloc that comes with the system. !

In ISC version 4.1, sed core dumps when building deduced.h. Use the version of sed from version 4.0. !

!

i?86-ibm-aix

!

This configuration is obsoleted in GCC 3.1. !

You need to use GAS version 2.1 or later, and LD from GNU binutils version 2.2 or later. !

!

i?86-sequent-bsd

!

This configuration is obsoleted in GCC 3.1. !

Go to the Berkeley universe before compiling. !

!

i?86-sequent-ptx1*, i?86-sequent-ptx2*, i?86-sequent-sysv3*

!

This configuration is obsoleted in GCC 3.1. !

You must install GNU sed before running configure. !

The fixproto shell script may trigger a bug in the system shell. If you encounter this problem, upgrade your operating system or use bash (the GNU shell) to run fixproto. !

!

i860-intel-osf*

!

All support for the i860 processor is obsoleted in GCC 3.1. !

On the Intel Paragon (an i860 machine), if you are using operating system version 1.0, you will get warnings or errors about redefinition of va_arg when you build GCC. !

If this happens, then you need to link most programs with the library iclib.a. You must also modify stdio.h as follows: before the lines ! 

#if     defined(__i860__) && !defined(_VA_LIST)
! #include <va_list.h>
!

insert the line ! 

#if __PGC__
!

and after the lines ! 

extern int  vprintf(const char *, va_list );
! extern int  vsprintf(char *, const char *, va_list );
! #endif
!

insert the line ! 

#endif /* __PGC__ */
!
!

These problems don't exist in operating system version 1.1. !

!

ia64-*-linux

!

IA-64 processor (also known as IPF, or Itanium Processor Family) running GNU/Linux. !

The toolchain is not completely finished, so requirements will continue to change. GCC 3.0.1 and later require glibc 2.2.4. GCC 3.0.2 requires binutils from 2001-09-05 or later. GCC 3.0.1 requires binutils 2.11.1 or later. !

None of the following versions of GCC has an ABI that is compatible with any of the other versions in this list, with the exception that Red Hat 2.96 and Trillian 000171 are compatible with each other: 3.0.2, 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717. --- 762,879 ---- generate binaries that will run on OpenServer, Unixware 2, or Unixware 7, with the same warnings and caveats as the SCO UDK. !

This target is a little tricky to build because we have to distinguish it from the native tools (so it gets headers, startups, and libraries from the right place) while making the tools not think we're actually building a cross compiler. The easiest way to do this is with a configure command like this: ! 

         CC=/udk/usr/ccs/bin/cc /your/path/to/gcc/configure \
!            --host=i686-pc-udk --target=i686-pc-udk --program-prefix=udk-
!
!

You should substitute i686 in the above command with the appropriate processor for your host. !

After the usual make bootstrap and make install, you can then access the UDK-targeted GCC tools by adding udk- before the commonly known name. For example, to invoke the C compiler, you would use udk-gcc. They will coexist peacefully with any native-target GCC tools you may have installed. !

!

i?86-*-isc

!

This configuration is obsoleted in GCC 3.1. !

It may be a good idea to link with GNU malloc instead of the malloc that comes with the system. !

In ISC version 4.1, sed core dumps when building deduced.h. Use the version of sed from version 4.0. !

!

i?86-ibm-aix

!

This configuration is obsoleted in GCC 3.1. !

You need to use GAS version 2.1 or later, and LD from GNU binutils version 2.2 or later. !

!

i?86-sequent-bsd

!

This configuration is obsoleted in GCC 3.1. !

Go to the Berkeley universe before compiling. !

!

i?86-sequent-ptx1*, i?86-sequent-ptx2*, i?86-sequent-sysv3*

!

This configuration is obsoleted in GCC 3.1. !

You must install GNU sed before running configure. !

The fixproto shell script may trigger a bug in the system shell. If you encounter this problem, upgrade your operating system or use bash (the GNU shell) to run fixproto. !

!

i860-intel-osf*

!

All support for the i860 processor is obsoleted in GCC 3.1. !

On the Intel Paragon (an i860 machine), if you are using operating system version 1.0, you will get warnings or errors about redefinition of va_arg when you build GCC. !

If this happens, then you need to link most programs with the library iclib.a. You must also modify stdio.h as follows: before the lines ! 

     #if     defined(__i860__) && !defined(_VA_LIST)
!      #include <va_list.h>
!

insert the line ! 

     #if __PGC__
!

and after the lines ! 

     extern int  vprintf(const char *, va_list );
!      extern int  vsprintf(char *, const char *, va_list );
!      #endif
!

insert the line ! 

     #endif /* __PGC__ */
!
!

These problems don't exist in operating system version 1.1. !

!

ia64-*-linux

!

IA-64 processor (also known as IPF, or Itanium Processor Family) running GNU/Linux. !

The toolchain is not completely finished, so requirements will continue to change. GCC 3.0.1 and later require glibc 2.2.4. GCC 3.0.2 requires binutils from 2001-09-05 or later. GCC 3.0.1 requires binutils 2.11.1 or later. !

None of the following versions of GCC has an ABI that is compatible with any of the other versions in this list, with the exception that Red Hat 2.96 and Trillian 000171 are compatible with each other: 3.0.2, 3.0.1, 3.0, Red Hat 2.96, and Trillian 000717. *************** GCC 3.0.2 is recommended for compiling l *** 882,907 **** GCC 3.0.2 is believed to be fully ABI compliant, and hence no more major ABI changes are expected. !

!

*-lynx-lynxos

!

LynxOS 2.2 and earlier comes with GCC 1.x already installed as /bin/gcc. You should compile with this instead of /bin/cc. You can tell GCC to use the GNU assembler and linker, by specifying --with-gnu-as --with-gnu-ld when configuring. These will produce COFF format object files and executables; otherwise GCC will use the installed tools, which produce a.out format executables. !

!

*-ibm-aix*

!

AIX Make frequently has problems with GCC makefiles. GNU Make 3.76 or newer is recommended to build on this platform. !

Errors involving alloca when building GCC generally are due to an incorrect definition of CC in the Makefile or mixing files compiled with the native C compiler and GCC. During the stage1 phase of the build, the native AIX compiler must be invoked as cc --- 884,909 ---- GCC 3.0.2 is believed to be fully ABI compliant, and hence no more major ABI changes are expected. !

!

*-lynx-lynxos

!

LynxOS 2.2 and earlier comes with GCC 1.x already installed as /bin/gcc. You should compile with this instead of /bin/cc. You can tell GCC to use the GNU assembler and linker, by specifying --with-gnu-as --with-gnu-ld when configuring. These will produce COFF format object files and executables; otherwise GCC will use the installed tools, which produce a.out format executables. !

!

*-ibm-aix*

!

AIX Make frequently has problems with GCC makefiles. GNU Make 3.76 or newer is recommended to build on this platform. !

Errors involving alloca when building GCC generally are due to an incorrect definition of CC in the Makefile or mixing files compiled with the native C compiler and GCC. During the stage1 phase of the build, the native AIX compiler must be invoked as cc *************** does not provide a definition that will *** 912,927 **** If this error occurs during stage2 or later, then the problem most likely is the version of Make (see above). !

The GNU Assembler incorrectly reports that it supports WEAK symbols on AIX which causes GCC to try to utilize weak symbol functionality which is not really supported on the platform. The native as and ld still are recommended. The native AIX tools do interoperate with GCC. !

Building libstdc++.a requires a fix for a AIX Assembler bug APAR IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1). !

libstdc++ in GCC 3.2 increments the major version number of the shared object and GCC installation places the libstdc++.a shared library in a common location which will overwrite the GCC 3.1 version of the shared library. Applications either need to be --- 914,929 ---- If this error occurs during stage2 or later, then the problem most likely is the version of Make (see above). !

The GNU Assembler incorrectly reports that it supports WEAK symbols on AIX which causes GCC to try to utilize weak symbol functionality which is not really supported on the platform. The native as and ld still are recommended. The native AIX tools do interoperate with GCC. !

Building libstdc++.a requires a fix for a AIX Assembler bug APAR IY26685 (AIX 4.3) or APAR IY25528 (AIX 5.1). !

libstdc++ in GCC 3.2 increments the major version number of the shared object and GCC installation places the libstdc++.a shared library in a common location which will overwrite the GCC 3.1 version of the shared library. Applications either need to be *************** be installed for runtime dynamic loading *** 932,960 **** set the F_LOADONLY flag in the shared object for each multilib libstdc++.a installed: !

Extract the shared object from each the GCC 3.1 libstdc++.a archive: ! 

   % ar -x libstdc++.a libstdc++.so.4
!
!

Enable the F_LOADONLY flag so that the shared object will be available for runtime dynamic loading, but not linking: ! 

   % strip -e libstdc++.so.4
!
!

Archive the runtime-only shared object in the GCC 3.2 libstdc++.a archive: ! 

   % ar -q libstdc++.a libstdc++.so.4
!
!

Linking executables and shared libraries may produce warnings of duplicate symbols. The assembly files generated by GCC for AIX always have included multiple symbol definitions for certain global variable and function declarations in the original program. The warnings should not prevent the linker from producing a correct library or runnable executable. !

AIX 4.3 utilizes a "large format" archive to support both 32-bit and 64-bit object modules. The routines provided in AIX 4.3.0 and AIX 4.3.1 to parse archive libraries did not handle the new format correctly. These routines are used by GCC and result in error messages during --- 934,962 ---- set the F_LOADONLY flag in the shared object for each multilib libstdc++.a installed: !

Extract the shared object from each the GCC 3.1 libstdc++.a archive: ! 

        % ar -x libstdc++.a libstdc++.so.4
!
!

Enable the F_LOADONLY flag so that the shared object will be available for runtime dynamic loading, but not linking: ! 

        % strip -e libstdc++.so.4
!
!

Archive the runtime-only shared object in the GCC 3.2 libstdc++.a archive: ! 

        % ar -q libstdc++.a libstdc++.so.4
!
!

Linking executables and shared libraries may produce warnings of duplicate symbols. The assembly files generated by GCC for AIX always have included multiple symbol definitions for certain global variable and function declarations in the original program. The warnings should not prevent the linker from producing a correct library or runnable executable. !

AIX 4.3 utilizes a "large format" archive to support both 32-bit and 64-bit object modules. The routines provided in AIX 4.3.0 and AIX 4.3.1 to parse archive libraries did not handle the new format correctly. These routines are used by GCC and result in error messages during *************** option of the archive command may be use *** 964,970 **** objects using the original "small format". A correct version of the routines is shipped with AIX 4.3.2 and above. !

Some versions of the AIX binder (linker) can fail with a relocation overflow severe error when the -bbigtoc option is used to link GCC-produced object files into an executable that overflows the TOC. A fix for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC) is --- 966,972 ---- objects using the original "small format". A correct version of the routines is shipped with AIX 4.3.2 and above. !

Some versions of the AIX binder (linker) can fail with a relocation overflow severe error when the -bbigtoc option is used to link GCC-produced object files into an executable that overflows the TOC. A fix for APAR IX75823 (OVERFLOW DURING LINK WHEN USING GCC AND -BBIGTOC) is *************** available from IBM Customer Support and *** 972,990 **** techsupport.services.ibm.com website as PTF U455193. !

The AIX 4.3.2.1 linker (bos.rte.bind_cmds Level 4.3.2.1) will dump core with a segmentation fault when invoked by any version of GCC. A fix for APAR IX87327 is available from IBM Customer Support and from its techsupport.services.ibm.com website as PTF U461879. This fix is incorporated in AIX 4.3.3 and above. !

The initial assembler shipped with AIX 4.3.0 generates incorrect object files. A fix for APAR IX74254 (64BIT DISASSEMBLED OUTPUT FROM COMPILER FAILS TO ASSEMBLE/BIND) is available from IBM Customer Support and from its techsupport.services.ibm.com website as PTF U453956. This fix is incorporated in AIX 4.3.1 and above. !

AIX provides National Language Support (NLS). Compilers and assemblers use NLS to support locale-specific representations of various data formats including floating-point numbers (e.g., . vs , for separating decimal fractions). There have been problems reported where --- 974,992 ---- techsupport.services.ibm.com website as PTF U455193. !

The AIX 4.3.2.1 linker (bos.rte.bind_cmds Level 4.3.2.1) will dump core with a segmentation fault when invoked by any version of GCC. A fix for APAR IX87327 is available from IBM Customer Support and from its techsupport.services.ibm.com website as PTF U461879. This fix is incorporated in AIX 4.3.3 and above. !

The initial assembler shipped with AIX 4.3.0 generates incorrect object files. A fix for APAR IX74254 (64BIT DISASSEMBLED OUTPUT FROM COMPILER FAILS TO ASSEMBLE/BIND) is available from IBM Customer Support and from its techsupport.services.ibm.com website as PTF U453956. This fix is incorporated in AIX 4.3.1 and above. !

AIX provides National Language Support (NLS). Compilers and assemblers use NLS to support locale-specific representations of various data formats including floating-point numbers (e.g., . vs , for separating decimal fractions). There have been problems reported where *************** GCC does not produce the same floating-p *** 992,1078 **** expects. If one encounters this problem, set the LANG environment variable to C or En_US. !

By default, GCC for AIX 4.1 and above produces code that can be used on both Power or PowerPC processors. !

A default can be specified with the -mcpu=cpu_type ! switch and using the configure option --with-cpu-cpu_type. !

!

m32r-*-elf

!

Mitsubishi M32R processor. This configuration is intended for embedded systems. !

!

m68000-hp-bsd

!

HP 9000 series 200 running BSD. Note that the C compiler that comes with this system cannot compile GCC; contact law@cygnus.com to get binaries of GCC for bootstrapping. !

!

m6811-elf

!

Motorola 68HC11 family micro controllers. These are used in embedded applications. There are no standard Unix configurations. !

!

m6812-elf

!

Motorola 68HC12 family micro controllers. These are used in embedded applications. There are no standard Unix configurations. !

!

m68k-altos

!

Altos 3068. This configuration is obsoleted in GCC 3.1. !

You must use the GNU assembler, linker and debugger. Also, you must fix a kernel bug. !

!

m68k-apple-aux

!

Apple Macintosh running A/UX. This configuration is obsoleted in GCC 3.1. !

You may configure GCC to use either the system assembler and linker or the GNU assembler and linker. You should use the GNU configuration if you can, especially if you also want to use G++. You enable that configuration with the --with-gnu-as and --with-gnu-ld options to configure. !

Note the C compiler that comes with this system cannot compile GCC. You can find binaries of GCC for bootstrapping on jagubox.gsfc.nasa.gov. You will also a patched version of /bin/ld there that raises some of the arbitrary limits found in the original. !

!

m68k-att-sysv

!

AT&T 3b1, a.k.a. 7300 PC. This version of GCC cannot be compiled with the system C compiler, which is too buggy. You will need to get a previous version of GCC and use it to bootstrap. Binaries are available from the OSU-CIS archive, at ftp://archive.cis.ohio-state.edu/pub/att7300/. !

!

m68k-bull-sysv

!

Bull DPX/2 series 200 and 300 with BOS-2.00.45 up to BOS-2.01. This configuration is obsoleted in GCC 3.1. !

GCC works either with native assembler or GNU assembler. You can use GNU assembler with native COFF generation by providing --with-gnu-as to the configure script or use GNU assembler with stabs-in-COFF encapsulation --- 994,1080 ---- expects. If one encounters this problem, set the LANG environment variable to C or En_US. !

By default, GCC for AIX 4.1 and above produces code that can be used on both Power or PowerPC processors. !

A default can be specified with the -mcpu=cpu_type ! switch and using the configure option --with-cpu-cpu_type. !

!

m32r-*-elf

!

Mitsubishi M32R processor. This configuration is intended for embedded systems. !

!

m68000-hp-bsd

!

HP 9000 series 200 running BSD. Note that the C compiler that comes with this system cannot compile GCC; contact law@cygnus.com to get binaries of GCC for bootstrapping. !

!

m6811-elf

!

Motorola 68HC11 family micro controllers. These are used in embedded applications. There are no standard Unix configurations. !

!

m6812-elf

!

Motorola 68HC12 family micro controllers. These are used in embedded applications. There are no standard Unix configurations. !

!

m68k-altos

!

Altos 3068. This configuration is obsoleted in GCC 3.1. !

You must use the GNU assembler, linker and debugger. Also, you must fix a kernel bug. !

!

m68k-apple-aux

!

Apple Macintosh running A/UX. This configuration is obsoleted in GCC 3.1. !

You may configure GCC to use either the system assembler and linker or the GNU assembler and linker. You should use the GNU configuration if you can, especially if you also want to use G++. You enable that configuration with the --with-gnu-as and --with-gnu-ld options to configure. !

Note the C compiler that comes with this system cannot compile GCC. You can find binaries of GCC for bootstrapping on jagubox.gsfc.nasa.gov. You will also a patched version of /bin/ld there that raises some of the arbitrary limits found in the original. !

!

m68k-att-sysv

!

AT&T 3b1, a.k.a. 7300 PC. This version of GCC cannot be compiled with the system C compiler, which is too buggy. You will need to get a previous version of GCC and use it to bootstrap. Binaries are available from the OSU-CIS archive, at ftp://archive.cis.ohio-state.edu/pub/att7300/. !

!

m68k-bull-sysv

!

Bull DPX/2 series 200 and 300 with BOS-2.00.45 up to BOS-2.01. This configuration is obsoleted in GCC 3.1. !

GCC works either with native assembler or GNU assembler. You can use GNU assembler with native COFF generation by providing --with-gnu-as to the configure script or use GNU assembler with stabs-in-COFF encapsulation *************** by providing --with-gnu-as --stabs *** 1080,1259 **** assembler or for availability of the DPX/2 port of GAS, contact F.Pierresteguy@frcl.bull.fr. !

!

m68k-crds-unos

!

Use configure unos for building on Unos. !

The Unos assembler is named casm instead of as. For some strange reason linking /bin/as to /bin/casm changes the behavior, and does not work. So, when installing GCC, you should install the following script as as in the subdirectory where the passes of GCC are installed: ! 

#!/bin/sh
! casm $*
!
!

The default Unos library is named libunos.a instead of libc.a. To allow GCC to function, either change all references to -lc in gcc.c to -lunos or link /lib/libc.a to /lib/libunos.a. !

When compiling GCC with the standard compiler, to overcome bugs in the support of alloca, do not use -O when making stage 2. Then use the stage 2 compiler with -O to make the stage 3 compiler. This compiler will have the same characteristics as the usual stage 2 compiler on other systems. Use it to make a stage 4 compiler and compare that with stage 3 to verify proper compilation. !

(Perhaps simply defining ALLOCA in x-crds as described in the comments there will make the above paragraph superfluous. Please inform us of whether this works.) !

Unos uses memory segmentation instead of demand paging, so you will need a lot of memory. 5 Mb is barely enough if no other tasks are running. If linking cc1 fails, try putting the object files into a library and linking from that library. !

!

m68k-hp-hpux

!

HP 9000 series 300 or 400 running HP-UX. HP-UX version 8.0 has a bug in the assembler that prevents compilation of GCC. This bug manifests itself during the first stage of compilation, while building libgcc2.a: ! 

_floatdisf
! cc1: warning: `-g' option not supported on this version of GCC
! cc1: warning: `-g1' option not supported on this version of GCC
! ./xgcc: Internal compiler error: program as got fatal signal 11
!
!

A patched version of the assembler is available as the file ftp://altdorf.ai.mit.edu/archive/cph/hpux-8.0-assembler. If you have HP software support, the patch can also be obtained directly from HP, as described in the following note: !

This is the patched assembler, to patch SR#1653-010439, where the assembler aborts on floating point constants. !

The bug is not really in the assembler, but in the shared library version of the function "cvtnum(3c)". The bug on "cvtnum(3c)" is SR#4701-078451. Anyway, the attached assembler uses the archive library version of "cvtnum(3c)" and thus does not exhibit the bug.

!

This patch is also known as PHCO_4484. !

In addition, if you wish to use gas, you must use gas version 2.1 or later, and you must use the GNU linker version 2.1 or later. Earlier versions of gas relied upon a program which converted the gas output into the native HP-UX format, but that program has not been kept up to date. gdb does not understand that native HP-UX format, so you must use gas if you wish to use gdb. !

On HP-UX version 8.05, but not on 8.07 or more recent versions, the fixproto shell script triggers a bug in the system shell. If you encounter this problem, upgrade your operating system or use BASH (the GNU shell) to run fixproto. This bug will cause the fixproto program to report an error of the form: ! 

./fixproto: sh internal 1K buffer overflow
!
!

To fix this, you can also change the first line of the fixproto script to look like: ! 

#!/bin/ksh
!
!
!

m68k-*-nextstep*

!

These configurations are obsoleted in GCC 3.1. !

Current GCC versions probably do not work on version 2 of the NeXT operating system. !

On NeXTStep 3.0, the Objective-C compiler does not work, due, apparently, to a kernel bug that it happens to trigger. This problem does not happen on 3.1. !

You absolutely must use GNU sed and GNU make on this platform. !

On NeXTSTEP 3.x where x < 3 the build of GCC will abort during stage1 with an error message like this: ! 

  _eh
!   /usr/tmp/ccbbsZ0U.s:987:Unknown pseudo-op: .section
!   /usr/tmp/ccbbsZ0U.s:987:Rest of line ignored. 1st junk character
!   valued 95 (_).
!
!

The reason for this is the fact that NeXT's assembler for these versions of the operating system does not support the .section pseudo op that's needed for full C++ exception functionality. !

As NeXT's assembler is a derived work from GNU as, a free replacement that does can be obtained at ftp://ftp.next.peak.org:/next-ftp/next/apps/devtools/as.3.3.NIHS.s.tar.gz. !

If you try to build the integrated C++ & C++ runtime libraries on this system you will run into trouble with include files. The way to get around this is to use the following sequence. Note you must have write permission to the directory prefix you specified in the configuration process of GCC for this sequence to work. ! 

  cd bld-gcc
!   make all-texinfo all-bison all-byacc all-binutils all-gas all-ld
!   cd gcc
!   make bootstrap
!   make install-headers-tar
!   cd ..
!   make bootstrap3
!
!
!

m68k-ncr-*

!

On the Tower models 4n0 and 6n0, by default a process is not allowed to have more than one megabyte of memory. GCC cannot compile itself (or many other programs) with -O in that much memory. !

To solve this problem, reconfigure the kernel adding the following line to the configuration file: ! 

MAXUMEM = 4096
!
!
!

m68k-sun

!

Sun 3. We do not provide a configuration file to use the Sun FPA by default, because programs that establish signal handlers for floating point traps inherently cannot work with the FPA. !

!

m68k-sun-sunos4.1.1

!

It is reported that you may need the GNU assembler on this platform. !

!

m88k-*-svr3

!

Motorola m88k running the AT&T/Unisoft/Motorola V.3 reference port. These configurations are obsoleted in GCC 3.1. !

These systems tend to use the Green Hills C, revision 1.8.5, as the standard C compiler. There are apparently bugs in this compiler that result in object files differences between stage 2 and stage 3. If this happens, make the stage 4 compiler and compare it to the stage 3 --- 1082,1261 ---- assembler or for availability of the DPX/2 port of GAS, contact F.Pierresteguy@frcl.bull.fr. !

!

m68k-crds-unos

!

Use configure unos for building on Unos. !

The Unos assembler is named casm instead of as. For some strange reason linking /bin/as to /bin/casm changes the behavior, and does not work. So, when installing GCC, you should install the following script as as in the subdirectory where the passes of GCC are installed: ! 

     #!/bin/sh
!      casm $*
!
!

The default Unos library is named libunos.a instead of libc.a. To allow GCC to function, either change all references to -lc in gcc.c to -lunos or link /lib/libc.a to /lib/libunos.a. !

When compiling GCC with the standard compiler, to overcome bugs in the support of alloca, do not use -O when making stage 2. Then use the stage 2 compiler with -O to make the stage 3 compiler. This compiler will have the same characteristics as the usual stage 2 compiler on other systems. Use it to make a stage 4 compiler and compare that with stage 3 to verify proper compilation. !

(Perhaps simply defining ALLOCA in x-crds as described in the comments there will make the above paragraph superfluous. Please inform us of whether this works.) !

Unos uses memory segmentation instead of demand paging, so you will need a lot of memory. 5 Mb is barely enough if no other tasks are running. If linking cc1 fails, try putting the object files into a library and linking from that library. !

!

m68k-hp-hpux

!

HP 9000 series 300 or 400 running HP-UX. HP-UX version 8.0 has a bug in the assembler that prevents compilation of GCC. This bug manifests itself during the first stage of compilation, while building libgcc2.a: ! 

     _floatdisf
!      cc1: warning: `-g' option not supported on this version of GCC
!      cc1: warning: `-g1' option not supported on this version of GCC
!      ./xgcc: Internal compiler error: program as got fatal signal 11
!
!

A patched version of the assembler is available as the file ftp://altdorf.ai.mit.edu/archive/cph/hpux-8.0-assembler. If you have HP software support, the patch can also be obtained directly from HP, as described in the following note: !

This is the patched assembler, to patch SR#1653-010439, where the assembler aborts on floating point constants. !

The bug is not really in the assembler, but in the shared library version of the function "cvtnum(3c)". The bug on "cvtnum(3c)" is SR#4701-078451. Anyway, the attached assembler uses the archive library version of "cvtnum(3c)" and thus does not exhibit the bug.

!

This patch is also known as PHCO_4484. !

In addition, if you wish to use gas, you must use gas version 2.1 or later, and you must use the GNU linker version 2.1 or later. Earlier versions of gas relied upon a program which converted the gas output into the native HP-UX format, but that program has not been kept up to date. gdb does not understand that native HP-UX format, so you must use gas if you wish to use gdb. !

On HP-UX version 8.05, but not on 8.07 or more recent versions, the fixproto shell script triggers a bug in the system shell. If you encounter this problem, upgrade your operating system or use BASH (the GNU shell) to run fixproto. This bug will cause the fixproto program to report an error of the form: ! 

     ./fixproto: sh internal 1K buffer overflow
!
!

To fix this, you can also change the first line of the fixproto script to look like: ! 

     #!/bin/ksh
!
!
!

m68k-*-nextstep*

!

These configurations are obsoleted in GCC 3.1. !

Current GCC versions probably do not work on version 2 of the NeXT operating system. !

On NeXTStep 3.0, the Objective-C compiler does not work, due, apparently, to a kernel bug that it happens to trigger. This problem does not happen on 3.1. !

You absolutely must use GNU sed and GNU make on this platform. !

On NeXTSTEP 3.x where x < 3 the build of GCC will abort during stage1 with an error message like this: ! 

       _eh
!        /usr/tmp/ccbbsZ0U.s:987:Unknown pseudo-op: .section
!        /usr/tmp/ccbbsZ0U.s:987:Rest of line ignored. 1st junk character
!        valued 95 (_).
!
!

The reason for this is the fact that NeXT's assembler for these versions of the operating system does not support the .section pseudo op that's needed for full C++ exception functionality. !

As NeXT's assembler is a derived work from GNU as, a free replacement that does can be obtained at ftp://ftp.next.peak.org:/next-ftp/next/apps/devtools/as.3.3.NIHS.s.tar.gz. !

If you try to build the integrated C++ & C++ runtime libraries on this system you will run into trouble with include files. The way to get around this is to use the following sequence. Note you must have write permission to the directory prefix you specified in the configuration process of GCC for this sequence to work. ! 

       cd bld-gcc
!        make all-texinfo all-bison all-byacc all-binutils all-gas all-ld
!        cd gcc
!        make bootstrap
!        make install-headers-tar
!        cd ..
!        make bootstrap3
!
!
!

m68k-ncr-*

!

On the Tower models 4n0 and 6n0, by default a process is not allowed to have more than one megabyte of memory. GCC cannot compile itself (or many other programs) with -O in that much memory. !

To solve this problem, reconfigure the kernel adding the following line to the configuration file: ! 

     MAXUMEM = 4096
!
!
!

m68k-sun

!

Sun 3. We do not provide a configuration file to use the Sun FPA by default, because programs that establish signal handlers for floating point traps inherently cannot work with the FPA. !

!

m68k-sun-sunos4.1.1

!

It is reported that you may need the GNU assembler on this platform. !

!

m88k-*-svr3

!

Motorola m88k running the AT&T/Unisoft/Motorola V.3 reference port. These configurations are obsoleted in GCC 3.1. !

These systems tend to use the Green Hills C, revision 1.8.5, as the standard C compiler. There are apparently bugs in this compiler that result in object files differences between stage 2 and stage 3. If this happens, make the stage 4 compiler and compare it to the stage 3 *************** compiler. If the stage 3 and stage 4 ob *** 1261,1277 **** suggests you encountered a problem with the standard C compiler; the stage 3 and 4 compilers may be usable. !

It is best, however, to use an older version of GCC for bootstrapping if you have one. !

!

m88k-*-dgux

!

Motorola m88k running DG/UX. These configurations are obsoleted in GCC 3.1. !

To build 88open BCS native or cross compilers on DG/UX, specify the configuration name as m88k-*-dguxbcs and build in the 88open BCS software development environment. To build ELF native or cross compilers on DG/UX, specify --- 1263,1279 ---- suggests you encountered a problem with the standard C compiler; the stage 3 and 4 compilers may be usable. !

It is best, however, to use an older version of GCC for bootstrapping if you have one. !

!

m88k-*-dgux

!

Motorola m88k running DG/UX. These configurations are obsoleted in GCC 3.1. !

To build 88open BCS native or cross compilers on DG/UX, specify the configuration name as m88k-*-dguxbcs and build in the 88open BCS software development environment. To build ELF native or cross compilers on DG/UX, specify *************** You set the software development environ *** 1280,1296 **** sde-target command and specifying either m88kbcs or m88kdguxelf as the operand. !

If you do not specify a configuration name, configure guesses the configuration based on the current software development environment. !

!

m88k-tektronix-sysv3

!

Tektronix XD88 running UTekV 3.2e. These configurations are obsoleted in GCC 3.1. !

Do not turn on optimization while building stage1 if you bootstrap with the buggy Green Hills compiler. Also, the bundled LAI System V NFS is buggy so if you build in an NFS mounted --- 1282,1298 ---- sde-target command and specifying either m88kbcs or m88kdguxelf as the operand. !

If you do not specify a configuration name, configure guesses the configuration based on the current software development environment. !

!

m88k-tektronix-sysv3

!

Tektronix XD88 running UTekV 3.2e. These configurations are obsoleted in GCC 3.1. !

Do not turn on optimization while building stage1 if you bootstrap with the buggy Green Hills compiler. Also, the bundled LAI System V NFS is buggy so if you build in an NFS mounted *************** directory, start from a fresh reboot, or *** 1298,1331 **** Otherwise you may have trouble getting clean comparisons between stages. !

!

mips-*-*

!

If you use the 1.31 version of the MIPS assembler (such as was shipped with Ultrix 3.1), you will need to use the -fno-delayed-branch switch when optimizing floating point code. Otherwise, the assembler will complain when the GCC compiler fills a branch delay slot with a floating point instruction, such as add.d. !

If on a MIPS system you get an error message saying "does not have gp sections for all it's [sic] sectons [sic]", don't worry about it. This happens whenever you use GAS with the MIPS linker, but there is not really anything wrong, and it is okay to use the output file. You can stop such warnings by installing the GNU linker. !

It would be nice to extend GAS to produce the gp tables, but they are optional, and there should not be a warning about their absence. !

Users have reported some problems with version 2.0 of the MIPS compiler tools that were shipped with Ultrix 4.1. Version 2.10 which came with Ultrix 4.2 seems to work fine. !

Users have also reported some problems with version 2.20 of the MIPS compiler tools that were shipped with RISC/os 4.x. The earlier version 2.11 seems to work fine. !

Some versions of the MIPS linker will issue an assertion failure when linking code that uses alloca against shared libraries on RISC-OS 5.0, and DEC's OSF/1 systems. This is a bug in the linker, that is supposed to be fixed in future revisions. --- 1300,1333 ---- Otherwise you may have trouble getting clean comparisons between stages. !

!

mips-*-*

!

If you use the 1.31 version of the MIPS assembler (such as was shipped with Ultrix 3.1), you will need to use the -fno-delayed-branch switch when optimizing floating point code. Otherwise, the assembler will complain when the GCC compiler fills a branch delay slot with a floating point instruction, such as add.d. !

If on a MIPS system you get an error message saying "does not have gp sections for all it's [sic] sectons [sic]", don't worry about it. This happens whenever you use GAS with the MIPS linker, but there is not really anything wrong, and it is okay to use the output file. You can stop such warnings by installing the GNU linker. !

It would be nice to extend GAS to produce the gp tables, but they are optional, and there should not be a warning about their absence. !

Users have reported some problems with version 2.0 of the MIPS compiler tools that were shipped with Ultrix 4.1. Version 2.10 which came with Ultrix 4.2 seems to work fine. !

Users have also reported some problems with version 2.20 of the MIPS compiler tools that were shipped with RISC/os 4.x. The earlier version 2.11 seems to work fine. !

Some versions of the MIPS linker will issue an assertion failure when linking code that uses alloca against shared libraries on RISC-OS 5.0, and DEC's OSF/1 systems. This is a bug in the linker, that is supposed to be fixed in future revisions. *************** To protect against this, GCC passes -shared or -call_shared switch. !

mips-mips-bsd

!

MIPS machines running the MIPS operating system in BSD mode. These configurations are obsoleted in GCC 3.1. !

It's possible that some old versions of the system lack the functions memcpy, memmove, memcmp, and memset. If your system lacks these, you must remove or undo the definition of TARGET_MEM_FUNCTIONS in mips-bsd.h. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. --- 1335,1351 ---- linker unless you pass an explicit -shared or -call_shared switch. !

mips-mips-bsd

!

MIPS machines running the MIPS operating system in BSD mode. These configurations are obsoleted in GCC 3.1. !

It's possible that some old versions of the system lack the functions memcpy, memmove, memcmp, and memset. If your system lacks these, you must remove or undo the definition of TARGET_MEM_FUNCTIONS in mips-bsd.h. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. *************** Both of these options are automatically *** 1352,1382 **** If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

!

mips-dec-*

!

These configurations are obsoleted in GCC 3.1. !

MIPS-based DECstations can support three different personalities: Ultrix, DEC OSF/1, and OSF/rose. (Alpha-based DECstation products have a configuration name beginning with alpha*-dec.) To configure GCC for these platforms use the following configurations: !

mips-dec-ultrix !
Ultrix configuration. !
mips-dec-osf1 !
DEC's version of OSF/1. !
mips-dec-osfrose !
Open Software Foundation reference port of OSF/1 which uses the OSF/rose object file format instead of ECOFF. Normally, you would not select this configuration.
!

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. --- 1354,1384 ---- If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

!

mips-dec-*

!

These configurations are obsoleted in GCC 3.1. !

MIPS-based DECstations can support three different personalities: Ultrix, DEC OSF/1, and OSF/rose. (Alpha-based DECstation products have a configuration name beginning with alpha*-dec.) To configure GCC for these platforms use the following configurations: !

mips-dec-ultrix !
Ultrix configuration. !
mips-dec-osf1 !
DEC's version of OSF/1. !
mips-dec-osfrose !
Open Software Foundation reference port of OSF/1 which uses the OSF/rose object file format instead of ECOFF. Normally, you would not select this configuration.
!

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. *************** Both of these options are automatically *** 1385,1397 **** If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

!

mips-mips-riscos*

!

These configurations are obsoleted in GCC 3.1. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. --- 1387,1399 ---- If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

!

mips-mips-riscos*

!

These configurations are obsoleted in GCC 3.1. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. *************** Both of these options are automatically *** 1400,1474 **** If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

MIPS computers running RISC-OS can support four different personalities: default, BSD 4.3, System V.3, and System V.4 (older versions of RISC-OS don't support V.4). To configure GCC for these platforms use the following configurations: !

!
mips-mips-riscosrev !
Default configuration for RISC-OS, revision rev. !
mips-mips-riscosrevbsd !
BSD 4.3 configuration for RISC-OS, revision rev. !
mips-mips-riscosrevsysv4 !
System V.4 configuration for RISC-OS, revision rev. !
!
mips-mips-riscosrevsysv !
System V.3 configuration for RISC-OS, revision rev.
!

The revision rev mentioned above is the revision of RISC-OS to use. You must reconfigure GCC when going from a RISC-OS revision 4 to RISC-OS revision 5. This has the effect of avoiding a linker bug. !

!

mips-sgi-irix4

!

This configuration is obsoleted in GCC 3.1. !

In order to compile GCC on an SGI running IRIX 4, the "c.hdr.lib" option must be installed from the CD-ROM supplied from Silicon Graphics. This is found on the 2nd CD in release 4.0.1. !

On IRIX version 4.0.5F, and perhaps on some other versions as well, there is an assembler bug that reorders instructions incorrectly. To work around it, specify the target configuration mips-sgi-irix4loser. This configuration inhibits assembler optimization. !

In a compiler configured with target mips-sgi-irix4, you can turn off assembler optimization by using the -noasmopt option. This compiler option passes the option -O0 to the assembler, to inhibit reordering. !

The -noasmopt option can be useful for testing whether a problem is due to erroneous assembler reordering. Even if a problem does not go away with -noasmopt, it may still be due to assembler reordering--perhaps GCC itself was miscompiled as a result. !

You may get the following warning on IRIX 4 platforms, it can be safely ignored. ! 

  warning: foo.o does not have gp tables for all its sections.
!
!
!

mips-sgi-irix5

!

This configuration has considerable problems, which will be fixed in a future release. !

In order to compile GCC on an SGI running IRIX 5, the "compiler_dev.hdr" subsystem must be installed from the IDO CD-ROM supplied by Silicon Graphics. It is also available for download from http://www.sgi.com/developers/devtools/apis/ido.html. !

make compare may fail on version 5 of IRIX unless you add -save-temps to CFLAGS. On these systems, the name of the assembler input file is stored in the object file, and that makes comparison fail if it differs between the stage1 and --- 1402,1476 ---- If you override the CC make variable and use the MIPS compilers, you may need to add -Wf,-XNg1500 -Olimit 3000. !

MIPS computers running RISC-OS can support four different personalities: default, BSD 4.3, System V.3, and System V.4 (older versions of RISC-OS don't support V.4). To configure GCC for these platforms use the following configurations: !

!
mips-mips-riscosrev !
Default configuration for RISC-OS, revision rev. !
mips-mips-riscosrevbsd !
BSD 4.3 configuration for RISC-OS, revision rev. !
mips-mips-riscosrevsysv4 !
System V.4 configuration for RISC-OS, revision rev. !
!
mips-mips-riscosrevsysv !
System V.3 configuration for RISC-OS, revision rev.
!

The revision rev mentioned above is the revision of RISC-OS to use. You must reconfigure GCC when going from a RISC-OS revision 4 to RISC-OS revision 5. This has the effect of avoiding a linker bug. !

!

mips-sgi-irix4

!

This configuration is obsoleted in GCC 3.1. !

In order to compile GCC on an SGI running IRIX 4, the "c.hdr.lib" option must be installed from the CD-ROM supplied from Silicon Graphics. This is found on the 2nd CD in release 4.0.1. !

On IRIX version 4.0.5F, and perhaps on some other versions as well, there is an assembler bug that reorders instructions incorrectly. To work around it, specify the target configuration mips-sgi-irix4loser. This configuration inhibits assembler optimization. !

In a compiler configured with target mips-sgi-irix4, you can turn off assembler optimization by using the -noasmopt option. This compiler option passes the option -O0 to the assembler, to inhibit reordering. !

The -noasmopt option can be useful for testing whether a problem is due to erroneous assembler reordering. Even if a problem does not go away with -noasmopt, it may still be due to assembler reordering--perhaps GCC itself was miscompiled as a result. !

You may get the following warning on IRIX 4 platforms, it can be safely ignored. ! 

       warning: foo.o does not have gp tables for all its sections.
!
!
!

mips-sgi-irix5

!

This configuration has considerable problems, which will be fixed in a future release. !

In order to compile GCC on an SGI running IRIX 5, the "compiler_dev.hdr" subsystem must be installed from the IDO CD-ROM supplied by Silicon Graphics. It is also available for download from http://www.sgi.com/developers/devtools/apis/ido.html. !

make compare may fail on version 5 of IRIX unless you add -save-temps to CFLAGS. On these systems, the name of the assembler input file is stored in the object file, and that makes comparison fail if it differs between the stage1 and *************** unless the comparisons fail without that *** 1479,1490 **** -save-temps, you will have to manually delete the .i and .s files after each series of compilations. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. !

To enable debugging under IRIX 5, you must use GNU as 2.11.2 or later, and use the --with-gnu-as configure option when configuring GCC. GNU as is distributed as part of the binutils package. --- 1481,1492 ---- -save-temps, you will have to manually delete the .i and .s files after each series of compilations. !

If you use the MIPS C compiler to bootstrap, it may be necessary to increase its table size for switch statements with the -Wf,-XNg1500 option. If you use the -O2 optimization option, you also need to use -Olimit 3000. !

To enable debugging under IRIX 5, you must use GNU as 2.11.2 or later, and use the --with-gnu-as configure option when configuring GCC. GNU as is distributed as part of the binutils package. *************** When using release 2.11.2, you need to a *** 1492,1498 **** http://sources.redhat.com/ml/binutils/2001-07/msg00352.html which will be included in the next release of binutils. !

When building GCC, the build process loops rebuilding cc1 over and over again. This happens on mips-sgi-irix5.2, and possibly other platforms. It has been reported that this is a known bug in the make shipped with IRIX 5.2. We recommend you use GNU --- 1494,1500 ---- http://sources.redhat.com/ml/binutils/2001-07/msg00352.html which will be included in the next release of binutils. !

When building GCC, the build process loops rebuilding cc1 over and over again. This happens on mips-sgi-irix5.2, and possibly other platforms. It has been reported that this is a known bug in the make shipped with IRIX 5.2. We recommend you use GNU *************** other platforms. It has been reported t *** 1500,1532 **** however, you may have success with smake on IRIX 5.2 if you do not have GNU make available. !

!

mips-sgi-irix6

!

If you are using IRIX cc as your bootstrap compiler, you must ensure that the N32 ABI is in use. To test this, compile a simple C file with cc and then run file on the resulting object file. The output should look like: ! 

test.o: ELF N32 MSB ...
!
!

If you see: ! 

test.o: ELF 32-bit MSB ...
!
!

or ! 

test.o: ELF 64-bit MSB ...
!
!

then your version of cc uses the O32 or N64 ABI by default. You should set the environment variable CC to cc -n32 before configuring GCC. !

If you want the resulting gcc to run on old 32-bit systems with the MIPS R4400 CPU, you need to ensure that only code for the mips3 instruction set architecture (ISA) is generated. While GCC 3.x does this correctly, both GCC 2.95 and SGI's MIPSpro cc may change --- 1502,1534 ---- however, you may have success with smake on IRIX 5.2 if you do not have GNU make available. !

!

mips-sgi-irix6

!

If you are using IRIX cc as your bootstrap compiler, you must ensure that the N32 ABI is in use. To test this, compile a simple C file with cc and then run file on the resulting object file. The output should look like: ! 

     test.o: ELF N32 MSB ...
!
!

If you see: ! 

     test.o: ELF 32-bit MSB ...
!
!

or ! 

     test.o: ELF 64-bit MSB ...
!
!

then your version of cc uses the O32 or N64 ABI by default. You should set the environment variable CC to cc -n32 before configuring GCC. !

If you want the resulting gcc to run on old 32-bit systems with the MIPS R4400 CPU, you need to ensure that only code for the mips3 instruction set architecture (ISA) is generated. While GCC 3.x does this correctly, both GCC 2.95 and SGI's MIPSpro cc may change *************** the ISA depending on the machine where G *** 1534,1560 **** as the bootstrap compiler may result in mips4 code, which won't run at all on mips3-only systems. For the test program above, you should see: ! 

test.o: ELF N32 MSB mips-3 ...
!
!

If you get: ! 

test.o: ELF N32 MSB mips-4 ...
!
!

instead, you should set the environment variable CC to cc -n32 -mips3 or gcc -mips3 respectively before configuring GCC. !

GCC on IRIX 6 is usually built to support both the N32 and N64 ABIs. If you build GCC on a system that doesn't have the N64 libraries installed, you need to configure with --disable-multilib so GCC doesn't try to use them. Look for /usr/lib64/libc.so.1 to see if you have the 64-bit libraries installed. !

You must not use GNU as (which isn't built anyway as of binutils 2.11.2) on IRIX 6 platforms; doing so will only cause problems. !

GCC does not currently support generating O32 ABI binaries in the mips-sgi-irix6 configurations. It is possible to create a GCC with O32 ABI only support by configuring it for the mips-sgi-irix5 target and using a patched GNU as 2.11.2 as documented in the --- 1536,1562 ---- as the bootstrap compiler may result in mips4 code, which won't run at all on mips3-only systems. For the test program above, you should see: ! 

     test.o: ELF N32 MSB mips-3 ...
!
!

If you get: ! 

     test.o: ELF N32 MSB mips-4 ...
!
!

instead, you should set the environment variable CC to cc -n32 -mips3 or gcc -mips3 respectively before configuring GCC. !

GCC on IRIX 6 is usually built to support both the N32 and N64 ABIs. If you build GCC on a system that doesn't have the N64 libraries installed, you need to configure with --disable-multilib so GCC doesn't try to use them. Look for /usr/lib64/libc.so.1 to see if you have the 64-bit libraries installed. !

You must not use GNU as (which isn't built anyway as of binutils 2.11.2) on IRIX 6 platforms; doing so will only cause problems. !

GCC does not currently support generating O32 ABI binaries in the mips-sgi-irix6 configurations. It is possible to create a GCC with O32 ABI only support by configuring it for the mips-sgi-irix5 target and using a patched GNU as 2.11.2 as documented in the *************** native assembler requires patches to GCC *** 1563,1569 **** future release. It is expected that O32 ABI support will be available again in a future release. !

The --enable-threads option doesn't currently work, a patch is in preparation for a future release. The --enable-libgcj option is disabled by default: IRIX 6 uses a very low default limit (20480) for the command line length. Although libtool contains a --- 1565,1571 ---- future release. It is expected that O32 ABI support will be available again in a future release. !

The --enable-threads option doesn't currently work, a patch is in preparation for a future release. The --enable-libgcj option is disabled by default: IRIX 6 uses a very low default limit (20480) for the command line length. Although libtool contains a *************** to build despite this, running into an i *** 1573,1579 **** its maximum of 262144 bytes. If you have root access, you can use the systune command to do this. !

GCC does not correctly pass/return structures which are smaller than 16 bytes and which are not 8 bytes. The problem is very involved and difficult to fix. It affects a number of other targets also, but IRIX 6 is affected the most, because it is a 64-bit target, and 4 byte --- 1575,1581 ---- its maximum of 262144 bytes. If you have root access, you can use the systune command to do this. !

GCC does not correctly pass/return structures which are smaller than 16 bytes and which are not 8 bytes. The problem is very involved and difficult to fix. It affects a number of other targets also, but IRIX 6 is affected the most, because it is a 64-bit target, and 4 byte *************** at the wrong end, e.g. a 4 byte structur *** 1582,1588 **** of the register when it should be loaded into the upper 4 bytes of the register. !

GCC is consistent with itself, but not consistent with the SGI C compiler (and the SGI supplied runtime libraries), so the only failures that can happen are when there are library functions that take/return such structures. There are very few such library functions. Currently this --- 1584,1590 ---- of the register when it should be loaded into the upper 4 bytes of the register. !

GCC is consistent with itself, but not consistent with the SGI C compiler (and the SGI supplied runtime libraries), so the only failures that can happen are when there are library functions that take/return such structures. There are very few such library functions. Currently this *************** is known to affect inet_ntoainet_netof, inet_makeaddr, and semctl. Until the bug is fixed, GCC contains workarounds for the known affected functions. !

See http://freeware.sgi.com/ for more information about using GCC on IRIX platforms. !

!

mips-sony-sysv

!

Sony MIPS NEWS. This configuration is obsoleted in GCC 3.1. !

This works in NEWSOS 5.0.1, but not in 5.0.2 (which uses ELF instead of COFF). In particular, the linker does not like the code generated by GCC when shared libraries are linked in. !

!

ns32k-encore

!

This configuration is obsoleted in GCC 3.1. !

Encore ns32000 system. Encore systems are supported only under BSD. !

!

ns32k-*-genix

!

National Semiconductor ns32000 system. This configuration is obsoleted in GCC 3.1. !

Genix has bugs in alloca and malloc; you must get the compiled versions of these from GNU Emacs. !

!

ns32k-sequent

!

This configuration is obsoleted in GCC 3.1. !

Go to the Berkeley universe before compiling. !

!

ns32k-utek

!

UTEK ns32000 system ("merlin"). This configuration is obsoleted in GCC 3.1. !

The C compiler that comes with this system cannot compile GCC; contact tektronix!reed!mason to get binaries of GCC for bootstrapping. !

!

powerpc-*-*

!

You can specify a default version for the -mcpu=cpu_type ! switch by using the configure option --with-cpu-cpu_type. !

!

powerpc-*-darwin*

!

PowerPC running Darwin (Mac OS X kernel). !

GCC 3.0 does not support Darwin, but 3.1 and later releases will work. !

Pre-installed versions of Mac OS X may not include any developer tools, meaning that you will not be able to build GCC from source. Tool binaries are available at http://www.opensource.apple.com/projects/darwin (free registration required). !

Versions of the assembler prior to "cctools-364" cannot handle the 4-argument form of rlwinm and related mask-using instructions. Darwin 1.3 (Mac OS X 10.0) uses cctools-353 for instance. To get cctools-364, check out cctools with tag Apple-364, build it, and install the assembler as usr/bin/as. See http://www.opensource.apple.com/tools/cvs/docs.html for details. !

Also, the default stack limit of 512K is too small, and a bootstrap will typically fail when self-compiling expr.c. Set the stack to 800K or more, for instance by doing limit stack 800. It's also convenient to use the GNU preprocessor instead of Apple's during the --- 1592,1675 ---- inet_netof, inet_makeaddr, and semctl. Until the bug is fixed, GCC contains workarounds for the known affected functions. !

See http://freeware.sgi.com/ for more information about using GCC on IRIX platforms. !

!

mips-sony-sysv

!

Sony MIPS NEWS. This configuration is obsoleted in GCC 3.1. !

This works in NEWSOS 5.0.1, but not in 5.0.2 (which uses ELF instead of COFF). In particular, the linker does not like the code generated by GCC when shared libraries are linked in. !

!

ns32k-encore

!

This configuration is obsoleted in GCC 3.1. !

Encore ns32000 system. Encore systems are supported only under BSD. !

!

ns32k-*-genix

!

National Semiconductor ns32000 system. This configuration is obsoleted in GCC 3.1. !

Genix has bugs in alloca and malloc; you must get the compiled versions of these from GNU Emacs. !

!

ns32k-sequent

!

This configuration is obsoleted in GCC 3.1. !

Go to the Berkeley universe before compiling. !

!

ns32k-utek

!

UTEK ns32000 system ("merlin"). This configuration is obsoleted in GCC 3.1. !

The C compiler that comes with this system cannot compile GCC; contact tektronix!reed!mason to get binaries of GCC for bootstrapping. !

!

powerpc-*-*

!

You can specify a default version for the -mcpu=cpu_type ! switch by using the configure option --with-cpu-cpu_type. !

!

powerpc-*-darwin*

!

PowerPC running Darwin (Mac OS X kernel). !

GCC 3.0 does not support Darwin, but 3.1 and later releases will work. !

Pre-installed versions of Mac OS X may not include any developer tools, meaning that you will not be able to build GCC from source. Tool binaries are available at http://www.opensource.apple.com/projects/darwin (free registration required). !

Versions of the assembler prior to "cctools-364" cannot handle the 4-argument form of rlwinm and related mask-using instructions. Darwin 1.3 (Mac OS X 10.0) uses cctools-353 for instance. To get cctools-364, check out cctools with tag Apple-364, build it, and install the assembler as usr/bin/as. See http://www.opensource.apple.com/tools/cvs/docs.html for details. !

Also, the default stack limit of 512K is too small, and a bootstrap will typically fail when self-compiling expr.c. Set the stack to 800K or more, for instance by doing limit stack 800. It's also convenient to use the GNU preprocessor instead of Apple's during the *************** first stage of bootstrapping; this is au *** 1675,1845 **** bootstrap, but to do it from the toplevel objdir you will need to say make CC='cc -no-cpp-precomp' bootstrap. !

Note that the version of GCC shipped by Apple typically includes a number of extensions not available in a standard GCC release. These extensions are generally specific to Mac programming. !

!

powerpc-*-elf, powerpc-*-sysv4

!

PowerPC system in big endian mode, running System V.4. !

!

powerpc-*-linux-gnu*

!

You will need binutils 2.13.90.0.10 or newer for a working GCC. !

!

powerpc-*-netbsd*

!

PowerPC system in big endian mode running NetBSD. To build the documentation you will need Texinfo version 4.1 (NetBSD 1.5.1 included Texinfo version 3.12). !

!

powerpc-*-eabiaix

!

Embedded PowerPC system in big endian mode with -mcall-aix selected as the default. !

!

powerpc-*-eabisim

!

Embedded PowerPC system in big endian mode for use in running under the PSIM simulator. !

!

powerpc-*-eabi

!

Embedded PowerPC system in big endian mode. !

!

powerpcle-*-elf, powerpcle-*-sysv4

!

PowerPC system in little endian mode, running System V.4. !

!

powerpcle-*-eabisim

!

Embedded PowerPC system in little endian mode for use in running under the PSIM simulator. !

!

powerpcle-*-eabi

!

Embedded PowerPC system in little endian mode. !

!

powerpcle-*-winnt, powerpcle-*-pe

!

PowerPC system in little endian mode running Windows NT. !

!

romp-*-aos, romp-*-mach

!

These configurations are obsoleted in GCC 3.1. !

We recommend you compile GCC with an earlier version of itself; if you compile GCC with hc, the Metaware compiler, it will work, but you will get mismatches between the stage 2 and stage 3 compilers in various files. These errors are minor differences in some floating-point constants and can be safely ignored; the stage 3 compiler is correct. !

!

s390-*-linux*

!

S/390 system running Linux for S/390. !

!

s390x-*-linux*

!

zSeries system (64-bit) running Linux for zSeries. !

!

*-*-solaris2*

!

Sun does not ship a C compiler with Solaris 2. To bootstrap and install GCC you first have to install a pre-built compiler, see our binaries page for details. !

The Solaris 2 /bin/sh will often fail to configure libstdc++-v3, boehm-gc or libjava. If you encounter this problem, set CONFIG_SHELL to /bin/ksh in your environment before running configure. !

Solaris 2 comes with a number of optional OS packages. Some of these packages are needed to use GCC fully, namely SUNWarc, SUNWbtool, SUNWesu, SUNWhea, SUNWlibm, SUNWsprot, and SUNWtoo. If you did not install all optional packages when installing Solaris 2, you will need to verify that the packages that GCC needs are installed. !

To check whether an optional package is installed, use the pkginfo command. To add an optional package, use the pkgadd command. For further details, see the Solaris 2 documentation. !

Trying to use the linker and other tools in /usr/ucb to install GCC has been observed to cause trouble. For example, the linker may hang indefinitely. The fix is to remove /usr/ucb from your PATH. !

All releases of GNU binutils prior to 2.11.2 have known bugs on this platform. We recommend the use of GNU binutils 2.11.2 or the vendor tools (Sun as, Sun ld). !

Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or newer: g++ will complain that types are missing. These headers assume that omitting the type means int; this assumption worked for C89 but is wrong for C++, and is now wrong for C99 also. !

g++ accepts such (invalid) constructs with the option -fpermissive; it will assume that any missing type is int (as defined by C89). !

There are patches for Solaris 2.6 (105633-56 or newer for SPARC, 106248-42 or newer for Intel), Solaris 7 (108376-21 or newer for SPARC, 108377-20 for Intel), and Solaris 8 (108652-24 or newer for SPARC, 108653-22 for Intel) that fix this bug. !

!

sparc-sun-solaris2*

!

When GCC is configured to use binutils 2.11.2 or later the binaries produced are smaller than the ones produced using Sun's native tools; this difference is quite significant for binaries containing debugging information. !

Sun as 4.x is broken in that it cannot cope with long symbol names. A typical error message might look similar to the following: ! 

/usr/ccs/bin/as: "/var/tmp/ccMsw135.s", line 11041: error:
!   can't compute value of an expression involving an external symbol.
!
!

This is Sun bug 4237974. This is fixed with patch 108908-02 for Solaris 2.6 and has been fixed in later (5.x) versions of the assembler, starting with Solaris 7. !

Starting with Solaris 7, the operating system is capable of executing 64-bit SPARC V9 binaries. GCC 3.1 and later properly supports this; the -m64 option enables 64-bit code generation. However, if all you want is code tuned for the UltraSPARC CPU, you --- 1677,1847 ---- bootstrap, but to do it from the toplevel objdir you will need to say make CC='cc -no-cpp-precomp' bootstrap. !

Note that the version of GCC shipped by Apple typically includes a number of extensions not available in a standard GCC release. These extensions are generally specific to Mac programming. !

!

powerpc-*-elf, powerpc-*-sysv4

!

PowerPC system in big endian mode, running System V.4. !

!

powerpc-*-linux-gnu*

!

You will need binutils 2.13.90.0.10 or newer for a working GCC. !

!

powerpc-*-netbsd*

!

PowerPC system in big endian mode running NetBSD. To build the documentation you will need Texinfo version 4.1 (NetBSD 1.5.1 included Texinfo version 3.12). !

!

powerpc-*-eabiaix

!

Embedded PowerPC system in big endian mode with -mcall-aix selected as the default. !

!

powerpc-*-eabisim

!

Embedded PowerPC system in big endian mode for use in running under the PSIM simulator. !

!

powerpc-*-eabi

!

Embedded PowerPC system in big endian mode. !

!

powerpcle-*-elf, powerpcle-*-sysv4

!

PowerPC system in little endian mode, running System V.4. !

!

powerpcle-*-eabisim

!

Embedded PowerPC system in little endian mode for use in running under the PSIM simulator. !

!

powerpcle-*-eabi

!

Embedded PowerPC system in little endian mode. !

!

powerpcle-*-winnt, powerpcle-*-pe

!

PowerPC system in little endian mode running Windows NT. !

!

romp-*-aos, romp-*-mach

!

These configurations are obsoleted in GCC 3.1. !

We recommend you compile GCC with an earlier version of itself; if you compile GCC with hc, the Metaware compiler, it will work, but you will get mismatches between the stage 2 and stage 3 compilers in various files. These errors are minor differences in some floating-point constants and can be safely ignored; the stage 3 compiler is correct. !

!

s390-*-linux*

!

S/390 system running Linux for S/390. !

!

s390x-*-linux*

!

zSeries system (64-bit) running Linux for zSeries. !

!

*-*-solaris2*

!

Sun does not ship a C compiler with Solaris 2. To bootstrap and install GCC you first have to install a pre-built compiler, see our binaries page for details. !

The Solaris 2 /bin/sh will often fail to configure libstdc++-v3, boehm-gc or libjava. If you encounter this problem, set CONFIG_SHELL to /bin/ksh in your environment before running configure. !

Solaris 2 comes with a number of optional OS packages. Some of these packages are needed to use GCC fully, namely SUNWarc, SUNWbtool, SUNWesu, SUNWhea, SUNWlibm, SUNWsprot, and SUNWtoo. If you did not install all optional packages when installing Solaris 2, you will need to verify that the packages that GCC needs are installed. !

To check whether an optional package is installed, use the pkginfo command. To add an optional package, use the pkgadd command. For further details, see the Solaris 2 documentation. !

Trying to use the linker and other tools in /usr/ucb to install GCC has been observed to cause trouble. For example, the linker may hang indefinitely. The fix is to remove /usr/ucb from your PATH. !

All releases of GNU binutils prior to 2.11.2 have known bugs on this platform. We recommend the use of GNU binutils 2.11.2 or the vendor tools (Sun as, Sun ld). !

Sun bug 4296832 turns up when compiling X11 headers with GCC 2.95 or newer: g++ will complain that types are missing. These headers assume that omitting the type means int; this assumption worked for C89 but is wrong for C++, and is now wrong for C99 also. !

g++ accepts such (invalid) constructs with the option -fpermissive; it will assume that any missing type is int (as defined by C89). !

There are patches for Solaris 2.6 (105633-56 or newer for SPARC, 106248-42 or newer for Intel), Solaris 7 (108376-21 or newer for SPARC, 108377-20 for Intel), and Solaris 8 (108652-24 or newer for SPARC, 108653-22 for Intel) that fix this bug. !

!

sparc-sun-solaris2*

!

When GCC is configured to use binutils 2.11.2 or later the binaries produced are smaller than the ones produced using Sun's native tools; this difference is quite significant for binaries containing debugging information. !

Sun as 4.x is broken in that it cannot cope with long symbol names. A typical error message might look similar to the following: ! 

     /usr/ccs/bin/as: "/var/tmp/ccMsw135.s", line 11041: error:
!        can't compute value of an expression involving an external symbol.
!
!

This is Sun bug 4237974. This is fixed with patch 108908-02 for Solaris 2.6 and has been fixed in later (5.x) versions of the assembler, starting with Solaris 7. !

Starting with Solaris 7, the operating system is capable of executing 64-bit SPARC V9 binaries. GCC 3.1 and later properly supports this; the -m64 option enables 64-bit code generation. However, if all you want is code tuned for the UltraSPARC CPU, you *************** should try the -mtune=ultrasparcWhen configuring on a Solaris 7 or later system that is running a kernel that supports only 32-bit binaries, one must configure with --disable-multilib, since we will not be able to build the 64-bit target libraries. !

!

sparc-sun-solaris2.7

!

Sun patch 107058-01 (1999-01-13) for Solaris 7/SPARC triggers a bug in the dynamic linker. This problem (Sun bug 4210064) affects GCC 2.8 and later, including all EGCS releases. Sun formerly recommended 107058-01 for all Solaris 7 users, but around 1999-09-01 it started to recommend it only for people who use Sun's compilers. !

Here are some workarounds to this problem: !

  • Do not install Sun patch 107058-01 until after Sun releases a complete patch for bug 4210064. This is the simplest course to take, unless you must also use Sun's C compiler. Unfortunately 107058-01 is preinstalled on some new Solaris 7-based hosts, so you may have to back it out. !
  • Copy the original, unpatched Solaris 7 /usr/ccs/bin/as into /usr/local/lib/gcc-lib/sparc-sun-solaris2.7/3.1/as, adjusting the latter name to fit your local conventions and software version numbers. !
  • Install Sun patch 106950-03 (1999-05-25) or later. Nobody with both 107058-01 and 106950-03 installed has reported the bug with GCC and Sun's dynamic linker. This last course of action is riskiest, for two reasons. First, you must install 106950 on all hosts that --- 1849,1884 ---- code that, unlike full 64-bit code, can still run on non-UltraSPARC machines. !

    When configuring on a Solaris 7 or later system that is running a kernel that supports only 32-bit binaries, one must configure with --disable-multilib, since we will not be able to build the 64-bit target libraries. !

    !

    sparc-sun-solaris2.7

    !

    Sun patch 107058-01 (1999-01-13) for Solaris 7/SPARC triggers a bug in the dynamic linker. This problem (Sun bug 4210064) affects GCC 2.8 and later, including all EGCS releases. Sun formerly recommended 107058-01 for all Solaris 7 users, but around 1999-09-01 it started to recommend it only for people who use Sun's compilers. !

    Here are some workarounds to this problem: !

    • Do not install Sun patch 107058-01 until after Sun releases a complete patch for bug 4210064. This is the simplest course to take, unless you must also use Sun's C compiler. Unfortunately 107058-01 is preinstalled on some new Solaris 7-based hosts, so you may have to back it out. !
    • Copy the original, unpatched Solaris 7 /usr/ccs/bin/as into /usr/local/lib/gcc-lib/sparc-sun-solaris2.7/3.1/as, adjusting the latter name to fit your local conventions and software version numbers. !
    • Install Sun patch 106950-03 (1999-05-25) or later. Nobody with both 107058-01 and 106950-03 installed has reported the bug with GCC and Sun's dynamic linker. This last course of action is riskiest, for two reasons. First, you must install 106950 on all hosts that *************** the bug. The current (as of 2001-09-24) *** 1888,2079 **** the Solaris 7 Recommended Patch Cluster.
    !

    !

    sparc-sun-sunos4*

    !

    A bug in the SunOS 4 linker will cause it to crash when linking -fPIC compiled objects (and will therefore not allow you to build shared libraries). !

    To fix this problem you can either use the most recent version of binutils or get the latest SunOS 4 linker patch (patch ID 100170-10) from Sun's patch site. !

    Sometimes on a Sun 4 you may observe a crash in the program genflags or genoutput while building GCC. This is said to be due to a bug in sh. You can probably get around it by running genflags or genoutput manually and then retrying the make. !

    !

    sparc-unknown-linux-gnulibc1

    !

    It has been reported that you might need binutils 2.8.1.0.23 for this platform, too. !

    !

    sparc-*-linux*

    !

    GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4 or newer on this platform. All earlier binutils and glibc releases mishandled unaligned relocations on sparc-*-* targets. !

    !

    sparc64-*-*

    !

    GCC version 2.95 is not able to compile code correctly for sparc64 targets. Users of the Linux kernel, at least, can use the sparc32 program to start up a new shell invocation with an environment that causes configure to recognize (via uname -a) the system as sparc-*-* instead. !

    !

    sparcv9-*-solaris2*

    !

    The following compiler flags must be specified in the configure step in order to bootstrap this target with the Sun compiler: ! 

       % CC="cc -xildoff -xarch=v9" srcdir/configure [options] [target]
!
    !

    -xildoff turns off the incremental linker, and -xarch=v9 specifies the v9 architecture to the Sun linker and assembler. !

    !

    *-*-sysv*

    !

    On System V release 3, you may get this error message while linking: ! 

    ld fatal: failed to write symbol name something
!  in strings table for file whatever
!
    !

    This probably indicates that the disk is full or your ulimit won't allow the file to be as large as it needs to be. !

    This problem can also result because the kernel parameter MAXUMEM is too small. If so, you must regenerate the kernel and make the value much larger. The default value is reported to be 1024; a value of 32768 is said to work. Smaller values may also work. !

    On System V, if you get an error like this, ! 

    /usr/local/lib/bison.simple: In function `yyparse':
! /usr/local/lib/bison.simple:625: virtual memory exhausted
!

    that too indicates a problem with disk space, ulimit, or MAXUMEM. !

    On a System V release 4 system, make sure /usr/bin precedes /usr/ucb in PATH. The cc command in /usr/ucb uses libraries which have bugs. !

    !

    vax-dec-ultrix

    !

    Don't try compiling with VAX C (vcc). It produces incorrect code in some cases (for example, when alloca is used). !

    !

    we32k-*-*

    !

    These computers are also known as the 3b2, 3b5, 3b20 and other similar names. (However, the 3b1 is actually a 68000.) These configurations are obsoleted in GCC 3.1. !

    Don't use -g when compiling with the system's compiler. The system's linker seems to be unable to handle such a large program with debugging information. !

    The system's compiler runs out of capacity when compiling stmt.c in GCC. You can work around this by building cpp in GCC first, then use that instead of the system's preprocessor with the system's C compiler to compile stmt.c. Here is how: ! 

    mv /lib/cpp /lib/cpp.att
! cp cpp /lib/cpp.gnu
! echo '/lib/cpp.gnu -traditional ${1+"$@"}' > /lib/cpp
! chmod +x /lib/cpp
!
    !

    The system's compiler produces bad code for some of the GCC optimization files. So you must build the stage 2 compiler without optimization. Then build a stage 3 compiler with optimization. That executable should work. Here are the necessary commands: ! 

    make LANGUAGES=c CC=stage1/xgcc CFLAGS="-Bstage1/ -g"
! make stage2
! make CC=stage2/xgcc CFLAGS="-Bstage2/ -g -O"
!
    !

    You may need to raise the ULIMIT setting to build a C++ compiler, as the file cc1plus is larger than one megabyte. !

    !

    xtensa-*-elf

    !

    This target is intended for embedded Xtensa systems using the newlib C library. It uses ELF but does not support shared objects. Designed-defined instructions specified via the Tensilica Instruction Extension (TIE) language are only supported through inline assembly. !

    The Xtensa configuration information must be specified prior to building GCC. The gcc/config/xtensa/xtensa-config.h header file contains the configuration information. If you created your own Xtensa configuration with the Xtensa Processor Generator, the downloaded files include a customized copy of this header file, which you can use to replace the default header file. !

    !

    xtensa-*-linux*

    !

    This target is for Xtensa systems running GNU/Linux. It supports ELF shared objects and the GNU C library (glibc). It also generates position-independent code (PIC) regardless of whether the -fpic or -fPIC options are used. In other respects, this target is the same as the xtensa-*-elf target. !

    !

    Microsoft Windows (32-bit)

    !

    A port of GCC 2.95.x is included with the Cygwin environment. !

    Current (as of early 2001) snapshots of GCC will build under Cygwin without modification. !

    !

    OS/2

    !

    GCC does not currently support OS/2. However, Andrew Zabolotny has been working on a generic OS/2 port with pgcc. The current code can be found at http://www.goof.com/pcg/os2/. !

    An older copy of GCC 2.8.1 is included with the EMX tools available at ftp://ftp.leo.org/pub/comp/os/os2/leo/devtools/emx+gcc/. !

    !

    Older systems

    !

    GCC contains support files for many older (1980s and early 1990s) Unix variants. For the most part, support for these systems has not been deliberately removed, but it has not been maintained for several years and may suffer from bitrot. Support from some systems --- 1890,2081 ---- the Solaris 7 Recommended Patch Cluster.

!

!

sparc-sun-sunos4*

!

A bug in the SunOS 4 linker will cause it to crash when linking -fPIC compiled objects (and will therefore not allow you to build shared libraries). !

To fix this problem you can either use the most recent version of binutils or get the latest SunOS 4 linker patch (patch ID 100170-10) from Sun's patch site. !

Sometimes on a Sun 4 you may observe a crash in the program genflags or genoutput while building GCC. This is said to be due to a bug in sh. You can probably get around it by running genflags or genoutput manually and then retrying the make. !

!

sparc-unknown-linux-gnulibc1

!

It has been reported that you might need binutils 2.8.1.0.23 for this platform, too. !

!

sparc-*-linux*

!

GCC versions 3.0 and higher require binutils 2.11.2 and glibc 2.2.4 or newer on this platform. All earlier binutils and glibc releases mishandled unaligned relocations on sparc-*-* targets. !

!

sparc64-*-*

!

GCC version 2.95 is not able to compile code correctly for sparc64 targets. Users of the Linux kernel, at least, can use the sparc32 program to start up a new shell invocation with an environment that causes configure to recognize (via uname -a) the system as sparc-*-* instead. !

!

sparcv9-*-solaris2*

!

The following compiler flags must be specified in the configure step in order to bootstrap this target with the Sun compiler: ! 

        % CC="cc -xildoff -xarch=v9" srcdir/configure [options] [target]
!
!

-xildoff turns off the incremental linker, and -xarch=v9 specifies the v9 architecture to the Sun linker and assembler. !

!

*-*-sysv*

!

On System V release 3, you may get this error message while linking: ! 

     ld fatal: failed to write symbol name something
!       in strings table for file whatever
!
!

This probably indicates that the disk is full or your ulimit won't allow the file to be as large as it needs to be. !

This problem can also result because the kernel parameter MAXUMEM is too small. If so, you must regenerate the kernel and make the value much larger. The default value is reported to be 1024; a value of 32768 is said to work. Smaller values may also work. !

On System V, if you get an error like this, ! 

     /usr/local/lib/bison.simple: In function `yyparse':
!      /usr/local/lib/bison.simple:625: virtual memory exhausted
!

that too indicates a problem with disk space, ulimit, or MAXUMEM. !

On a System V release 4 system, make sure /usr/bin precedes /usr/ucb in PATH. The cc command in /usr/ucb uses libraries which have bugs. !

!

vax-dec-ultrix

!

Don't try compiling with VAX C (vcc). It produces incorrect code in some cases (for example, when alloca is used). !

!

we32k-*-*

!

These computers are also known as the 3b2, 3b5, 3b20 and other similar names. (However, the 3b1 is actually a 68000.) These configurations are obsoleted in GCC 3.1. !

Don't use -g when compiling with the system's compiler. The system's linker seems to be unable to handle such a large program with debugging information. !

The system's compiler runs out of capacity when compiling stmt.c in GCC. You can work around this by building cpp in GCC first, then use that instead of the system's preprocessor with the system's C compiler to compile stmt.c. Here is how: ! 

     mv /lib/cpp /lib/cpp.att
!      cp cpp /lib/cpp.gnu
!      echo '/lib/cpp.gnu -traditional ${1+"$@"}' > /lib/cpp
!      chmod +x /lib/cpp
!
!

The system's compiler produces bad code for some of the GCC optimization files. So you must build the stage 2 compiler without optimization. Then build a stage 3 compiler with optimization. That executable should work. Here are the necessary commands: ! 

     make LANGUAGES=c CC=stage1/xgcc CFLAGS="-Bstage1/ -g"
!      make stage2
!      make CC=stage2/xgcc CFLAGS="-Bstage2/ -g -O"
!
!

You may need to raise the ULIMIT setting to build a C++ compiler, as the file cc1plus is larger than one megabyte. !

!

xtensa-*-elf

!

This target is intended for embedded Xtensa systems using the newlib C library. It uses ELF but does not support shared objects. Designed-defined instructions specified via the Tensilica Instruction Extension (TIE) language are only supported through inline assembly. !

The Xtensa configuration information must be specified prior to building GCC. The gcc/config/xtensa/xtensa-config.h header file contains the configuration information. If you created your own Xtensa configuration with the Xtensa Processor Generator, the downloaded files include a customized copy of this header file, which you can use to replace the default header file. !

!

xtensa-*-linux*

!

This target is for Xtensa systems running GNU/Linux. It supports ELF shared objects and the GNU C library (glibc). It also generates position-independent code (PIC) regardless of whether the -fpic or -fPIC options are used. In other respects, this target is the same as the xtensa-*-elf target. !

!

Microsoft Windows (32-bit)

!

A port of GCC 2.95.x is included with the Cygwin environment. !

Current (as of early 2001) snapshots of GCC will build under Cygwin without modification. !

!

OS/2

!

GCC does not currently support OS/2. However, Andrew Zabolotny has been working on a generic OS/2 port with pgcc. The current code can be found at http://www.goof.com/pcg/os2/. !

An older copy of GCC 2.8.1 is included with the EMX tools available at ftp://ftp.leo.org/pub/comp/os/os2/leo/devtools/emx+gcc/. !

!

Older systems

!

GCC contains support files for many older (1980s and early 1990s) Unix variants. For the most part, support for these systems has not been deliberately removed, but it has not been maintained for several years and may suffer from bitrot. Support from some systems *************** has been removed from GCC 3: fx80, ns32- *** 2081,2094 **** gmicro, spur; most of these targets had not been updated since GCC version 1. !

We are planning to remove support for more older systems, starting in GCC 3.1. Each release will have a list of "obsoleted" systems. Support for these systems is still present in that release, but configure will fail unless the --enable-obsolete option is given. Unless a maintainer steps forward, support for these systems will be removed from the next release of GCC. !

Support for older systems as targets for cross-compilation is less problematic than support for them as hosts for GCC; if an enthusiast wishes to make such a target work again (including resurrecting any of the targets that never worked with GCC 2, starting from the last --- 2083,2096 ---- gmicro, spur; most of these targets had not been updated since GCC version 1. !

We are planning to remove support for more older systems, starting in GCC 3.1. Each release will have a list of "obsoleted" systems. Support for these systems is still present in that release, but configure will fail unless the --enable-obsolete option is given. Unless a maintainer steps forward, support for these systems will be removed from the next release of GCC. !

Support for older systems as targets for cross-compilation is less problematic than support for them as hosts for GCC; if an enthusiast wishes to make such a target work again (including resurrecting any of the targets that never worked with GCC 2, starting from the last *************** CVS version before they were removed), p *** 2097,2103 **** would be likely to be accepted, since they should not affect the support for more modern targets. !

Support for old systems as hosts for GCC can cause problems if the workarounds for compiler, library and operating system bugs affect the cleanliness or maintainability of the rest of GCC. In some cases, to bring GCC up on such a system, if still possible with current GCC, may --- 2099,2105 ---- would be likely to be accepted, since they should not affect the support for more modern targets. !

Support for old systems as hosts for GCC can cause problems if the workarounds for compiler, library and operating system bugs affect the cleanliness or maintainability of the rest of GCC. In some cases, to bring GCC up on such a system, if still possible with current GCC, may *************** the old-releases directory *** 2109,2135 **** be avoided using fixincludes, but bugs or deficiencies in libraries and the operating system may still cause problems. !

For some systems, old versions of GNU binutils may also be useful, and are available from pub/binutils/old-releases on sources.redhat.com mirror sites. !

Some of the information on specific systems above relates to such older systems, but much of the information about GCC on such systems (which may no longer be applicable to current GCC) is to be found in the GCC texinfo manual. !

!

all ELF targets (SVR4, Solaris 2, etc.)

!

C++ support is significantly better on ELF targets if you use the GNU linker; duplicate copies of inlines, vtables and template instantiations will be discarded automatically. !

Return to the GCC Installation page ! --- 2111,2137 ---- be avoided using fixincludes, but bugs or deficiencies in libraries and the operating system may still cause problems. !

For some systems, old versions of GNU binutils may also be useful, and are available from pub/binutils/old-releases on sources.redhat.com mirror sites. !

Some of the information on specific systems above relates to such older systems, but much of the information about GCC on such systems (which may no longer be applicable to current GCC) is to be found in the GCC texinfo manual. !

!

all ELF targets (SVR4, Solaris 2, etc.)

!

C++ support is significantly better on ELF targets if you use the GNU linker; duplicate copies of inlines, vtables and template instantiations will be discarded automatically. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/INSTALL/test.html gcc-3.2.3/INSTALL/test.html *** gcc-3.2.2/INSTALL/test.html Wed Feb 5 03:09:30 2003 --- gcc-3.2.3/INSTALL/test.html Tue Apr 22 06:56:34 2003 *************** *** 1,12 **** ! Installing GCC: Testing ! ! ! ! ! !

B

efore you install GCC, we encourage you to run the testsuites and to compare your results with results from a similar configuration that have been submitted to the gcc-testresults mailing list. --- 1,14 ---- ! ! Installing GCC: Testing ! ! ! ! ! !

Installing GCC: Testing

! Before you install GCC, we encourage you to run the testsuites and to compare your results with results from a similar configuration that have been submitted to the gcc-testresults mailing list. *************** This step is optional and may require yo *** 14,109 **** but it can give you confidence in your new GCC installation or point out problems before you install and start using your new GCC. !

First, you must have downloaded the testsuites. These are part of the full distribution, but if you downloaded the "core" compiler plus any front ends, you must download the testsuites separately. !

Second, you must have the testing tools installed. This includes a current version of DejaGnu; dejagnu 1.3 is not sufficient. It also includes Tcl and Expect; the DejaGnu site has links to these. !

Now you may need specific preparations: !

    !
  • The following environment variables may need to be set appropriately, as in the following example (which assumes that DejaGnu has been installed under /usr/local): ! 
         TCL_LIBRARY = /usr/local/share/tcl8.0
!      DEJAGNULIBS = /usr/local/share/dejagnu
!
    !

    On systems such as Cygwin, these paths are required to be actual paths, not mounts or links; presumably this is due to some lack of portability in the DejaGnu code. !

    If the directories where runtest and expect were installed are in the PATH, it should not be necessary to set these environment variables. !

!

Finally, you can run the testsuite (which may take a long time): ! 

     cd objdir; make -k check
!
!

The testing process will try to test as many components in the GCC distribution as possible, including the C, C++, Objective-C and Fortran compilers as well as the C++ and Java runtime libraries. !

While running the testsuite, DejaGnu might emit messages resembling WARNING: Couldn't find the global config file. or WARNING: Couldn't find tool init file. These messages are harmless and do not affect the validity of the tests. !

How can I run the test suite on selected tests?

!

As a first possibility to cut down the number of tests that are run it is possible to use make check-gcc or make check-g++ in the gcc subdirectory of the object directory. To further cut down the tests the following is possible: ! 

    make check-gcc RUNTESTFLAGS="execute.exp other-options"
!
!

This will run all gcc execute tests in the testsuite. ! 

    make check-g++ RUNTESTFLAGS="old-deja.exp=9805* other-options"
!
!

This will run the g++ "old-deja" tests in the testsuite where the filename matches 9805*. !

The *.exp files are located in the testsuite directories of the GCC source, the most important ones being compile.exp, execute.exp, dg.exp and old-deja.exp. To get a list of the possible *.exp files, pipe the output of make check into a file and look at the ! Running ... .exp lines. !

To run only the tests for a library, run make check from the the library's testsuite in a subdirectory of the object directory: libstdc++-v3/testsuite or libcgj/testsuite. !

Additional testing for Java Class Libraries

!

The Mauve Project provides a suite of tests for the Java Class Libraries. This suite can be run as part of libgcj testing by specifying the location of the Mauve tree when invoking make, as in make MAUVEDIR=~/mauve check. !

How to interpret test results

!

After the testsuite has run you'll find various *.sum and *.log files in the testsuite subdirectories. The *.log files contain a detailed log of the compiler invocations and the corresponding results, the *.sum files summarize the results. These summaries list all the tests that have been run with a corresponding status code: !

!

It is normal for some tests to report unexpected failures. At the current time our testing harness does not allow fine grained control over whether or not a test is expected to fail. We expect to fix this problem in future releases. !

Submitting test results

!

If you want to report the results to the GCC project, use the contrib/test_summary shell script. Start it in the objdir with ! 

         srcdir/contrib/test_summary -p your_commentary.txt \
!              -m gcc-testresults@gcc.gnu.org |sh
!
!

This script uses the Mail program to send the results, so make sure it is in your PATH. The file your_commentary.txt is prepended to the testsuite summary and should contain any special remarks you have on your results or your build environment. Please *************** behave on different platforms and compar *** 139,147 **** few failing testcases are possible even on released versions and you should look here first if you think your results are unreasonable. !

Return to the GCC Installation page ! --- 141,149 ---- few failing testcases are possible even on released versions and you should look here first if you think your results are unreasonable. !

Return to the GCC Installation page ! diff -Nrc3pad gcc-3.2.2/boehm-gc/ChangeLog gcc-3.2.3/boehm-gc/ChangeLog *** gcc-3.2.2/boehm-gc/ChangeLog Wed Feb 5 03:02:17 2003 --- gcc-3.2.3/boehm-gc/ChangeLog Tue Apr 22 06:14:05 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/bugs.html gcc-3.2.3/bugs.html *** gcc-3.2.2/bugs.html Wed Feb 5 03:09:23 2003 --- gcc-3.2.3/bugs.html Tue Apr 22 06:56:23 2003 *************** *** 8,14 ****

GCC Bugs

The latest version of this document is always available at ! http://www.gnu.org/software/gcc/bugs.html.

--- 8,14 ----

GCC Bugs

The latest version of this document is always available at ! http://gcc.gnu.org/bugs.html.

*************** *** 24,30 ****
  • Detailed bug reporting instructions when using a precompiled header
    • -
  • Managing Bugs (GNATS and the test-suite)
  • Frequently Reported Bugs in GCC
    • General
      • --- 24,29 ---- *************** use it.

      *** 275,306 ****

      Please don't send us the actual precompiled header. It is likely to be very large and we can't use it to reproduce the problem.

      - -

      Managing Bugs (GNATS and the test-suite)

      - -

      This section contains information mostly intended for GCC - contributors.

      - -

      If you find a bug, but you are not fixing it (yet):

      -
        -
      1. Create a (minimal) test-case.
        2. -
      2. Add the test-case to our test-suite, marking it as XFAIL unless - the bug is a regression.
        3. -
      3. Add a bug report referencing the test-case to GNATS.
        4. -
      - -

      If you fix a bug for which there is already a GNATS entry:

      -
        -
      1. Remove the XFAIL on the test-case.
        2. -
      2. Close the bug report in GNATS.
        3. -
      - -

      If you find a bug, and you are fixing it right then:

      -
        -
      1. Create a (minimal) test-case.
        2. -
      2. Add the test-case to our test-suite, marking it as PASS.
        3. -
      3. Check in your fixes.
        4. -
      --- 274,279 ---- diff -Nrc3pad gcc-3.2.2/config/ChangeLog gcc-3.2.3/config/ChangeLog *** gcc-3.2.2/config/ChangeLog Wed Feb 5 03:02:08 2003 --- gcc-3.2.3/config/ChangeLog Tue Apr 22 06:14:11 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/config/mpw/ChangeLog gcc-3.2.3/config/mpw/ChangeLog *** gcc-3.2.2/config/mpw/ChangeLog Wed Feb 5 03:02:05 2003 --- gcc-3.2.3/config/mpw/ChangeLog Tue Apr 22 06:14:08 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/config-ml.in gcc-3.2.3/config-ml.in *** gcc-3.2.2/config-ml.in Wed Jun 13 02:12:07 2001 --- gcc-3.2.3/config-ml.in Wed Feb 12 17:44:49 2003 *************** multi-do: *** 553,558 **** --- 553,559 ---- LIBCFLAGS="$(LIBCFLAGS) $${flags}" \ LIBCXXFLAGS="$(LIBCXXFLAGS) $${flags}" \ LDFLAGS="$(LDFLAGS) $${flags}" \ + DESTDIR="$(DESTDIR)" \ $(DO)); then \ true; \ else \ diff -Nrc3pad gcc-3.2.2/contrib/ChangeLog gcc-3.2.3/contrib/ChangeLog *** gcc-3.2.2/contrib/ChangeLog Wed Feb 5 03:01:37 2003 --- gcc-3.2.3/contrib/ChangeLog Tue Apr 22 06:14:14 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/contrib/regression/ChangeLog gcc-3.2.3/contrib/regression/ChangeLog *** gcc-3.2.2/contrib/regression/ChangeLog Wed Feb 5 03:01:34 2003 --- gcc-3.2.3/contrib/regression/ChangeLog Tue Apr 22 06:14:17 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/faq.html gcc-3.2.3/faq.html *** gcc-3.2.2/faq.html Wed Feb 5 03:09:29 2003 --- gcc-3.2.3/faq.html Tue Apr 22 06:56:29 2003 *************** *** 9,20 ****

      GCC Frequently Asked Questions

      The latest version of this document is always available at ! http://www.gnu.org/software/gcc/faq.html.

      This FAQ tries to answer specific questions concerning GCC. For general information regarding C, C++, resp. Fortran please check the comp.lang.c FAQ, ! comp.std.c++ FAQ, and the Fortran Information page.

      --- 9,20 ----

      GCC Frequently Asked Questions

      The latest version of this document is always available at ! http://gcc.gnu.org/faq.html.

      This FAQ tries to answer specific questions concerning GCC. For general information regarding C, C++, resp. Fortran please check the comp.lang.c FAQ, ! comp.std.c++ FAQ, and the Fortran Information page.

      *************** than we've had before.

      *** 159,168 **** past few months. The paper which started all of this introduced two terms: A cathedral development model versus a bazaar development model. The paper is written by Eric S. Raymond, it is ! called ``The ! Cathedral and the Bazaar''. The paper is a useful starting point ! for discussions.
    • --- 159,166 ---- past few months. The paper which started all of this introduced two terms: A cathedral development model versus a bazaar development model. The paper is written by Eric S. Raymond, it is ! called ``The Cathedral and the Bazaar''. ! The paper is a useful starting point for discussions.
    diff -Nrc3pad gcc-3.2.2/fastjar/ChangeLog gcc-3.2.3/fastjar/ChangeLog *** gcc-3.2.2/fastjar/ChangeLog Wed Feb 5 03:01:55 2003 --- gcc-3.2.3/fastjar/ChangeLog Tue Apr 22 06:14:21 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/ChangeLog gcc-3.2.3/gcc/ChangeLog *** gcc-3.2.2/gcc/ChangeLog Wed Feb 5 03:01:09 2003 --- gcc-3.2.3/gcc/ChangeLog Tue Apr 22 06:14:38 2003 *************** *** 1,3 **** --- 1,622 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-04-16 John David Anglin + + PR/10271 + * pa-protos.h (function_arg): Remove last argument. + * pa.c (function_arg): Likewise. Use CUMULATIVE_ARGS struct instead. + * pa.h (struct hppa_args): Add member incoming. + (INIT_CUMULATIVE_ARGS, INIT_CUMULATIVE_INCOMING_ARGS): Initialize + member incoming. + (FUNCTION_ARG): Revise call to function_arg. + (FUNCTION_INCOMING_ARG): Delete. + + 2003-04-15 Jason Merrill + + PR middle-end/10336, c++/10401 + * jump.c (never_reached_warning): Also stop looking if we reach the + beginning of the function. + + 2003-04-14 Hans-Peter Nilsson + + PR target/10377 + * config/cris/cris.md ("*mov_sideqi", "*mov_sidehi") + ("*mov_sidesi", "*mov_sideqi_mem", "*mov_sidehi_mem") + ("*mov_sidesi_mem", "*clear_sidesi", "*clear_sidehi") + ("*clear_sideqi", "*ext_sideqihi", "*ext_sideqisi") + ("*ext_sidehisi", "*op_sideqi", "*op_sidehi", "*op_sidesi") + ("*op_swap_sideqi", "*op_swap_sidehi", "*op_swap_sidesi") + ("*extopqihi_side", "*extopqisi_side", "*extophisi_side") + ("*extopqihi_swap_side", "*extopqisi_swap_side") + ("*extophisi_swap_side", 8th, 9th, 10th, 11th, 14th peepholes): + When next to constraint R, replace constraint i with n. + + 2003-04-10 Bob Wilson + + * config/xtensa/xtensa.h (MAX_INT_TYPE_SIZE, IMPLICIT_FIX_EXPR, + EASY_DIV_EXPR): Delete poisoned macro definitions. + + 2003-04-09 Richard Henderson + + PR opt/10352 + Tue Jul 23 21:49:24 2002 J"orn Rennecke + * simplify-rtx.c (simplify_subreg): When converting to a non-int + mode, try to convert to an integer mode of matching size first. + + 2003-04-09 Alan Modra + + * config/rs6000/rs6000.c (rs6000_emit_prologue): Use correct mode to + set frame pointer. + + 2003-04-03 Jason Merrill + + PR c/10175 + * jump.c (never_reached_warning): Look backwards for a line note. + + 2003-04-02 Richard Henderson + + * dwarf2out.c (output_call_frame_info): Ignore fde->nothrow as an + optimization when flag_exceptions not enabled. + + 2003-03-30 Kaveh R. Ghazi + + PR other/6955 + * collect2.c (collect_wait): Use WCOREDUMP and fix output message. + * system.h (WCOREDUMP, WCOREFLG): Define if necessary. + + 2003-03-29 Arpad Beszedes + + PR middle-end/9967 + * builtins.c (expand_builtin_fputs): When optimizing for size, + don't transform fputs into fwrite. + + 2003-03-29 Albert Chin-A-Young + DJ Delorie , + Bruce Korb + + * fixinc/inclhack.def (solaris_mutex_init_1): New; Fix + buggy Solaris mutex/cond initializers. + (solaris_mutex_init): Rename to solaris_mutex_init_2. + * fixinc/fixincl.x: Regenerate. + * fixinc/tests/base/pthread.h: Update. + + 2003-03-29 Nathanael Nerode + + * fixinc/fixinc.interix: Remove completely dead code + + 2003-03-29 Ulrich Weigand + + PR target/7784 + * reload.c (maybe_memory_address_p): New function. + (find_reloads_address): Use it instead of memory_address_p. + + 2003-03-29 Alan Modra + + * config/rs6000/rs6000.h (FUNCTION_VALUE_REGNO_P): Respect + TARGET_HARD_FLOAT. Reformat. + (FUNCTION_ARG_REGNO_P): Likewise, and remove unneeded casts. + + 2003-03-29 Glen Nakamura + + PR c/8224 + * fold-const.c (extract_muldiv_1): Don't pass through type conversions + when signedness changes for division or modulus. + + 2003-03-29 Alan Modra + + * reload1.c (reload_as_needed): Allow a USE in asm reloads. + + 2003-03-28 Olivier Hainque + + PR ada/9953 + * ada/Makefile.in (gnatlib configuration for HPUX): Split + the general section for HPUX into specific sections for + HPUX 10 and HPUX 11. + + 2003-03-28 Eric Botcazou + + PR target/10067 + * config/sparc/sparc.md (jump pattern): Correct order + when issuing the annuling marker. + + 2003-03-28 Eric Botcazou + + PR c/8281 + * config/sparc/sparc.md (movdi_insn_sp32_v9): Remove 'f-f' alternative. + (movdi reg/reg split): Match only on sparc32, and v9 when int regs. + + 2003-03-28 Eric Botcazou + Richard Henderson + + PR target/10114 and PR target/10084 + * dwarf2out.c (mem_loc_descriptor): Handle LO_SUM. + + 2003-03-27 Janis Johnson + + PR sw-bug/10234 + * system.h (GCCBUGURL): Reference GCC web site. + + 2003-03-26 Richard Henderson + + * cfgrtl.c (try_redirect_by_replacing_jump): Disable removing + tablejumps with no optimization. + + 2003-03-27 Rainer Orth + + * config/mips/iris6.h (CPLUSPLUS_CPP_SPEC): Define __c99. + + * fixinc/inclhack.def (irix___restrict): Don't change __restrict + for C++ on IRIX 6.5.1[89]. + * fixinc/tests/base/internal/sgimacros.h: New file. + + * fixinc/inclhack.def (irix_wcsftime): Use XPG5 variant for C99. + * fixinc/fixincl.x: Regenerate. + * fixinc/tests/base/internal/wchar_core.h: New file. + + 2003-03-26 Eric Botcazou + + PR target/7784 + * reload.c (find_reloads_address): Handle + (PLUS (PLUS (REG) (REG)) (CONST_INT)) form for + all base registers. + + 2003-03-25 Jason Merrill + + PR optimization/10171 + * unroll.c (unroll_loop): Don't delete the jump at the end unless + we also delete a jump at the beginning. + + 2003-03-25 Gerald Pfeifer + + * doc/passes.texi (Passes): Properly document that we do not + perform jump2 any longer; remove command-line option -dJ. + + 2003-03-25 Eric Botcazou + + PR optimization/8746 + * config/i386/i386.md (and promoting splitters): Disable HImode to + SImode promoting when the sign bit matters and is not preserved. + Disable promoting when optimizing for size. + + 2003-03-23 Eric Botcazou + + PR optimization/9414 + * config/sparc/sparc.md (widening peepholes): Use + widen_memory_access instead of change_address. + + 2003-03-23 Daniel Jacobowitz + + Fix PR target/9797. + * stmt.c (expand_decl_init): Call push_temp_slots () and + pop_temp_slots (). + + 2003-03-23 Richard Henderson + + * cfgcleanup.c (try_optimize_cfg): Allow merging of tablejumps + before flow2. + * cfgrtl.c (try_redirect_by_replacing_jump): Similarly. + + 2003-03-23 Richard Henderson + + PR opt/10116 + * ifcvt.c (find_if_block): Disallow tablejump insns outgoing + from then_bb or else_bb after flow2. + + 2003-03-22 John David Anglin + + * pa.c (output_cbranch, output_bb, output_bvb): Output nop for + conditional branch to the following instruction. + + 2003-03-21 Volker Reichelt + + PR doc-bug/9813 + * doc/extend.texi: Move misplaced paragraph about underscores in + variables in macros. + + 2003-03-21 Eric Botcazou + Richard Henderson + + PR optimization/8366 + * config/sparc/sparc.h: (SYMBOLIC_CONST): New macro. + (GO_IF_LEGITIMATE_ADDRESS): Use it. Reject the form + PIC+SYMBOLIC_CONST in other modes than Pmode. + (GO_IF_MODE_DEPENDENT_ADDRESS): Use it. Mark + the form PIC+SYMBOLIC_CONST as mode dependent. + + 2003-03-20 Richard Henderson + + * fold-const.c (extract_muldiv_1): Revert changing order of + operands in case MULT_EXPR of 2003-02-16 patch. + + 2003-03-19 Eric Botcazou + + PR optimization/8746 + Backport from mainline: + + Thu Jun 6 23:14:46 CEST 2002 Jan Hubicka + + * i386.md (and promoting splitters): Disable QI to SImode promoting + when doing so changes immediate to be 32bit. + + 2003-03-19 Jakub Jelinek + + * stmt.c (expand_start_case): Call emit_queue (). + + 2003-03-19 Jakub Jelinek + + * ifcvt.c (dead_or_predicable): Fail if there are any references + to tablejump in merge_bb other than the final JUMP_INSN. + + 2003-03-19 Alan Modra + + PR target/10073 + * combine.c (force_to_mode ): Use gen_int_mode. + + 2003-03-17 Dave Love + Rainer Orth + + * config/alpha/osf.h (CPP_PREDEFINES): Define __digital__, + __arch64__ to match Compaq cc. + + 2003-03-17 Andreas Schwab + + PR target/7248 + * config/m68k/m68k.md (iordi3): Fix setting low half to -1. From + martin@blom.org. + + 2003-03-16 Richard Henderson + + * config/i386/i386.md (movstrictqi, movstrictqi_1): Check + optimize_size as well. + + 2003-03-16 Falk Hueffner + + PR target/9164 + * tree.c (get_narrower): For extensions with unchanged bit number, + return the unsignedness of the outer mode. + + 2003-03-14 Jakub Jelinek + + * config/rs6000/rs6000.c (rs6000_emit_load_toc_table): Don't call + rs6000_maybe_dead if !fromprolog. + + 2003-03-14 Eric Botcazou + + PR optimization/8396 + * tree-inline.c (initialize_inlined_parameters): Make sure the value + of read-only constant arguments is passed with the right type. + + 2003-03-14 Andreas Jaeger + + * config/i386/linux64.h (CPP_SPEC): Define __LP64__ and _LP64 for + 64-bit. + + 2003-03-12 Richard Henderson + + PR opt/8178 + * config/i386/i386.md (ffssi2): Tighten op1 predicate to + the requirements of the output insns. + + 2003-03-12 Andrew Lewycky + + PR c++/7050 + * expr.c (store_expr): Don't attempt to store void-typed trees, + just evaluate them for side effects. + + 2003-03-12 Bob Wilson + + Backport from mainline: + 2003-03-12 Bob Wilson + + * config/xtensa/xtensa.md (adddi3): Don't clobber source operand used + to detect carry. + (subdi3): Reorder emitted instructions. + + 2003-03-12 Eric Botcazou + + PR c/9928 + * c-decl.c (duplicate_decls): Discard the initializer of the new decl + only if it is a VAR_DECL. + + 2003-03-12 Eric Botcazou + + PR optimization/9888 + * config/i386/i386.md (jcc_1): Fix range. + (jcc_2): Likewise. + (jump): LIkewise. + (doloop_end_internal): Likewise. + + 2003-03-12 Eric Botcazou + + PR optimization/9888 + Backport patch from mainline: + + Tue Nov 19 23:50:56 CET 2002 Jan Hubicka + + * i386.md (length_immediate): Do not refer to insn address. + (jcc*, jmp patterns): Compute length explicitly. + (doloop_end_internal pattern): Unconditionally set the type to "ibr". + + 2003-03-12 Eric Botcazou + + PR optimization/9888 + * config/i386/i386.md (movsi_1): Remove special alternatives + for %eax register. + (movhi_1): Likewise. + * config/i386/i386.c (memory_address_length): Do not use + short displacement when there is no base. + (ix86_attr_length_address_default): Handle LEA instructions. + + 2003-03-09 Eric Botcazou + + PR optimization/9888 + Backport patch from mainline: + + 2002-07-03 Eric Botcazou + Jeff Law + + * i386.md (length_immediate attribute): Fix typo. + (length_address attribute): Likewise. + (modrm attribute): Set it to 0 for immediate call instructions. + (jcc_1 pattern): Set modrm attribute to 0. + (jcc_2 pattern ): Likewise. + (jump pattern): Likewise. + (doloop_end_internal pattern): Explicitly set length. + (leave pattern): Fix typo. + (leave_rex64 pattern): Likewise. + + 2003-03-08 Eric Botcazou + + PR middle-end/7796 + * unroll.c (calculate_giv_inc): Handle constants being + loaded with LSHIFTRT. + + 2003-03-07 Eric Botcazou + + PR optimization/8726 + Backport patch from mainline: + + 2003-01-08 Dale Johannesen + + * function.c (assign_parms): Don't set pretend_args_size if + REG_PARM_STACK_SPACE. + + 2003-03-06 Reinhard Jessich + + PR 9954/other + * config/i386/linux.h (MD_FALLBACK_FRAME_STATE_FOR): Since this uses + it should be wrapped in an inhibit_libc conditional + like the same code in config/i386/linux64.h. + + 2003-03-05 Eric Botcazou + + PR c/9799 + * c-typeck.c (push_init_level): Add sanity check. + + 2003-02-28 Bob Wilson + + Backport following patch: + + 2003-02-28 Bob Wilson + * config.gcc (xtensa-*-linux*): Add t-slibgcc-elf-ver to tmake_file. + + 2003-02-28 Joel Sherrill + + PR 9638/other + * config/i386/i386.c (DEFAULT_PCC_STRUCT_RETURN): Ensure the + this constant defaults to 1. + + 2003-02-27 Alan Modra + + * config/rs6000/rs6000.md: Add TI constant splitter. + + 2003-02-26 Jan Hubicka + + PR target/8343 + * m68k.md (umulsidi, mulsidi expanders): Use register operand. + + 2003-02-26 David Billinghurst + + * fixinc/fixincl.x: Regenerate + + 2003-02-25 Richard Henderson + + * config/i386/i386.c (function_arg): Pass variable sized + structures correctly on the stack. + + 2003-02-25 Franz Sirl + + PR target/9732 + * config/rs6000/rs6000.c (first_reg_to_save): Handle + PIC_OFFSET_TABLE_REGNUM for -fPIC too. + (rs6000_emit_prologue): Likewise. + (rs6000_emit_epilogue): Likewise. + * config/rs6000/rs6000.h (CONDITIONAL_REGISTER_USAGE): Make + PIC_OFFSET_TABLE_REGNUM a fixed register for -fPIC. + + 2003-02-25 Matthias Klose + + 2003-02-07 Richard Henderson + PR 9226 + * gcse.c (local_cprop_find_used_regs): New. + (local_cprop_pass): Use it. + + 2003-02-25 Matthias Klose + + * config.gcc (m68k-*-linux*): Add crtbeginT.o to extra_parts. + + 2003-02-24 Rainer Orth + + * config/alpha/osf.h (CPP_SUBTARGET_SPEC): Rename + __EXTERN_PREFIX to __PRAGMA_EXTERN_PREFIX. + * doc/extend.texi (Tru64 Pragmas): Reflect this. + + * fixinc/inclhack.def (alpha___extern_prefix): Indicate #pragma + extern_prefix support for Tru64 UNIX V5 . + * fixinc/fixincl.x: Regenerate. + * fixinc/tests/base/sys/stat.h [ALPHA___EXTERN_PREFIX_CHECK]: New + testcase. + Fixes PR c/5059, c/6126, other/9671. + + 2003-02-24 David Billinghurst + + Fixes PR libgcj/9652. + Backport patch from mainline: + 2003-02-12 Rainer Orth + + * fixinc/inclhack.def (irix_socklen_t): Fix broken IRIX 6.5.1[78] + socklen_t definition. + * fixinc/fixincl.x: Regenerate. + * fixinc/tests/base/sys/socket.h: New file. + + 2003-02-23 Hans-Peter Nilsson + + * regmove.c (optimize_reg_copy_1): Do not replace a hard register + in an asm. + + 2003-02-22 Steven Bosscher + + PR other/3782 + * toplev.c (process_options): If flag_detailed_statistics is set, + then set time_report as well. + + PR c/8828 + * jump.c (never_reached_warning): Don't fall through BARRRIER + insns. Update comments to reflect what the function really does. + + 2003-02-21 Richard Henderson + + 2003-01-06 Richard Henderson + * config/alpha/alpha.md (movdi_er_high_g): Allow all symbols. + + 2003-02-21 Glen Nakamura + + PR optimization/8613 + * builtins.c (expand_builtin): Emit postincrements before expanding + builtin functions. + + 2003-02-20 Randolph Chung + Eric Botcazou + + PR optimization/9768 + Backport patch from mainline: + + 2002-03-21 DJ Delorie + + * bb-reorder.c (make_reorder_chain_1): Protect against + when redundant edges are omitted. + * predict.c (dump_prediction): Likewise. + + 2003-02-20 BAN Nobuhiro + + PR c/9678 + * config/i386/i386.h (CPP_CPUCOMMON_SPEC): Fix typo. + + 2003-02-18 Jakub Jelinek + + * real.c (asctoeg): Handle denormals in hexadecimal notation. + + 2003-02-16 Arend Bayer + Richard Henderson + + PR c/8068 + * fold-const.c (extract_muldiv_1): Rename from extract_muldiv; + rearrange mult arguments for less recursion. + (extract_muldiv): New. Prevent runaway recursion. + + 2003-02-14 Falk Hueffner + + PR optimization/7702 + * reload1.c (reload_cse_simplify_set): Honor + CLASS_CANNOT_CHANGE_MODE_P. + + 2003-02-13 John David Anglin + + * inclhack.def (hpux_long_double): Tighten select and add bypass + regexp. + * fixincl.x: Rebuilt. + + 2003-02-13 Josef Zlomek + + * cfgcleanup.c (outgoing_edges_match): When there is single outgoing + edge and block ends with a jump insn it must be simple jump. + + 2003-02-12 John David Anglin + + PR9275 and PR8694 + * inclhack.def (hpux_long_double, hpux10_ctype_declarations1, + hpux10_ctype_declarations2, hpux_ctype_macros): New hacks. + * fixincl.x: Rebuilt. + * tests/base/stdlib.h: Update. + * tests/base/ctype.h: New file. + + 2003-02-12 Kaveh R. Ghazi + + * mips.h (FP_INC): Define. + + Backport fix for PR6362: + 2002-10-01 Richard Sandiford + + * config/mips/mips-protos.h (mips_emit_fcc_reload): Declare. + * config/mips/mips.h (PREDICATE_CODES): Add fcc_register_operand. + * config/mips/mips.c (fcc_register_operand): New function. + (mips_emit_fcc_reload): New function, extracted from reload_incc. + * cnfig/mips/mips.md (reload_incc): Change destination prediate + to fcc_register_operand. Remove misleading source constraint. + Use mips_emit_fcc_reload. + (reload_outcc): Duplicate reload_incc. + + 2003-02-11 Bob Wilson + + Backport following patch: + + 2003-02-11 Bob Wilson + + * config/xtensa/xtensa.md (set_frame_ptr): Change rtl to set reg a7. + * config/xtensa/xtensa.c (xtensa_reorg): Search for UNSPECV_SET_FP + as a SET pattern. + + 2003-02-10 Eric Botcazou + Christian Ehrhardt + + PR c/7741 + * c-decl.c (duplicate_decls): Discard the initializer of the + new decl when the types are conflicting. + + 2003-02-01 Daniel Jacobowitz + + * dwarf2out.c (gen_type_die): Check for typedefs before calling + for TYPE_MAIN_VARIANT. + + 2003-02-07 John David Anglin + + * pa.c (output_millicode_call): Use $PIC_pcrel$0 for long PIC + millicode calls when !TARGET_SOM and TARGET_GAS is true. + * pa.md (jump): Likewise. + + 2003-02-06 Eric Botcazou + Richard Henderson + + PR c/9530 + * config/i386/i386.h (FUNCTION_OK_FOR_SIBCALL): Forbid sibcalls + from functions that return a float to functions that don't. + + 2003-02-03 Bob Wilson + + * config/xtensa/xtensa.c (order_regs_for_local_alloc): Order the + coprocessor registers before floating-point registers. + * config/xtensa/xtensa.h (REG_ALLOC_ORDER): Adjust register numbers + to account for a previously removed register. + (SPEC_REG_FIRST, SPEC_REG_LAST, SPEC_REG_NUM, COUNT_REGISTER_REGNUM): + Delete unused macros. + + 2003-02-05 Gabriel Dos Reis + + * doc/include/gcc-common.texi: Bump version. + * version.c(version_string): Update. + 2003-02-05 Release Manager * GCC 3.2.2 Released. *************** *** 31,73 **** 2002-09-16 Richard Henderson ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Adjust SIZE ! as well as OFFSET for BITPOS. 2002-09-08 Jan Hubicka ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Fix array_ref ! handling. 2002-07-29 Richard Henderson ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Rename from ! set_mem_attributes and add BITPOS argument. Subtract it from ! OFFSET when same is adjusted. ! (set_mem_attributes): New wrapper function. ! * expr.c (expand_assignment): Use set_mem_attributes_minus_bitpos; ! remove offset adjustment hack. ! * expr.h (set_mem_attributes_minus_bitpos): Declare. 2002-07-25 Richard Henderson ! * emit-rtl.c (set_mem_attributes): Fix size and alignment thinkos ! in ARRAY_REF of DECL_P case. 2002-07-21 Richard Henderson ! * emit-rtl.c (set_mem_attributes): Preserve indirection of PARM_DECL ! when flag_argument_noalias == 2. ! * alias.c (nonoverlapping_memrefs_p): Handle that. ! * print-rtl.c (print_mem_expr): Likewise. 2002-06-03 Dan Nicolaescu ! * alias.c (nonoverlapping_memrefs_p): Fix off by one error. 2003-02-03 Steve Ellcey ! * config/pa/pa64-hpux.h (INIT_ENVIRONMENT): New. 2003-02-01 Jakub Jelinek --- 650,692 ---- 2002-09-16 Richard Henderson ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Adjust SIZE ! as well as OFFSET for BITPOS. 2002-09-08 Jan Hubicka ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Fix array_ref ! handling. 2002-07-29 Richard Henderson ! * emit-rtl.c (set_mem_attributes_minus_bitpos): Rename from ! set_mem_attributes and add BITPOS argument. Subtract it from ! OFFSET when same is adjusted. ! (set_mem_attributes): New wrapper function. ! * expr.c (expand_assignment): Use set_mem_attributes_minus_bitpos; ! remove offset adjustment hack. ! * expr.h (set_mem_attributes_minus_bitpos): Declare. 2002-07-25 Richard Henderson ! * emit-rtl.c (set_mem_attributes): Fix size and alignment thinkos ! in ARRAY_REF of DECL_P case. 2002-07-21 Richard Henderson ! * emit-rtl.c (set_mem_attributes): Preserve indirection of PARM_DECL ! when flag_argument_noalias == 2. ! * alias.c (nonoverlapping_memrefs_p): Handle that. ! * print-rtl.c (print_mem_expr): Likewise. 2002-06-03 Dan Nicolaescu ! * alias.c (nonoverlapping_memrefs_p): Fix off by one error. 2003-02-03 Steve Ellcey ! * config/pa/pa64-hpux.h (INIT_ENVIRONMENT): New. 2003-02-01 Jakub Jelinek *************** *** 89,101 **** * config/m68k/m68k.md (tablejump+2): Don't sign extend an address register. ! * config/m68k/apollo68.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/coff.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/linux.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/m68kelf.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/mot3300.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/netbsd-elf.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/pbb.h (ASM_RETURN_CASE_JUMP): Likewise. 2003-01-30 Ralf Corsepius --- 708,720 ---- * config/m68k/m68k.md (tablejump+2): Don't sign extend an address register. ! * config/m68k/apollo68.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/coff.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/linux.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/m68kelf.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/mot3300.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/netbsd-elf.h (ASM_RETURN_CASE_JUMP): Likewise. ! * config/m68k/pbb.h (ASM_RETURN_CASE_JUMP): Likewise. 2003-01-30 Ralf Corsepius *************** *** 182,189 **** 2003-01-27 Richard Earnshaw ! * function.c (purge_addressof_1): After pushing anaddressed register ! onto the stack, simplify the result. 2003-01-25 Eric Botcazou --- 801,808 ---- 2003-01-27 Richard Earnshaw ! * function.c (purge_addressof_1): After pushing anaddressed register ! onto the stack, simplify the result. 2003-01-25 Eric Botcazou *************** *** 200,206 **** of *both* the file name and the fix name. 2003-01-25 Eric Botcazou ! Christian Ehrhardt PR optimization/9279 --- 819,825 ---- of *both* the file name and the fix name. 2003-01-25 Eric Botcazou ! Christian Ehrhardt PR optimization/9279 *************** *** 327,333 **** binary compatibility. 2003-01-07 Benjamin Kosnik ! Sunil Davasam PR libstdc++/9076 * unwind-dw2.c (execute_cfa_program): DW_CFA_undefined, --- 946,952 ---- binary compatibility. 2003-01-07 Benjamin Kosnik ! Sunil Davasam PR libstdc++/9076 * unwind-dw2.c (execute_cfa_program): DW_CFA_undefined, *************** Sat Nov 16 02:54:29 CET 2002 Jan Hubick *** 647,658 **** 2002-11-04 Aldy Hernandez ! Backport patch to fix PR c/8451. ! 2002-04-25 Richard Henderson ! * expmed.c (extract_bit_field): Fall through to generic code rather ! than aborting on subreg special case. 2002-11-01 Mark Mitchell --- 1266,1277 ---- 2002-11-04 Aldy Hernandez ! Backport patch to fix PR c/8451. ! 2002-04-25 Richard Henderson ! * expmed.c (extract_bit_field): Fall through to generic code rather ! than aborting on subreg special case. 2002-11-01 Mark Mitchell diff -Nrc3pad gcc-3.2.2/gcc/NEWS gcc-3.2.3/gcc/NEWS *** gcc-3.2.2/gcc/NEWS Wed Feb 5 03:09:41 2003 --- gcc-3.2.3/gcc/NEWS Tue Apr 22 06:56:45 2003 *************** see ONEWS. *** 7,55 **** ====================================================================== http://gcc.gnu.org/gcc-3.2/index.html ! GCC 3.2 ! November 19, 2002 The [1]GNU project and the GCC developers are pleased to announce the ! release of GCC 3.2.1. ! The links below still apply to GCC 3.2.1. ! August 14, 2002 ! The [2]GNU project and the GCC developers are pleased to announce the ! release of GCC 3.2. GCC used to stand for the GNU C Compiler, but since the compiler supports several other languages aside from C, it now stands for the GNU Compiler Collection. ! A list of [3]successful builds is updated as new information becomes available. The GCC developers would like to thank the numerous people that have ! contributed [4]new features, improvements, bug fixes, and other ! changes as well as test results to GCC. This [5]amazing group of ! volunteers is what makes GCC successful. ! For additional information about GCC please refer to the [6]GCC ! project web site or contact the [7]GCC development mailing list. ! To obtain GCC please use [8]our mirror sites, one of the [9]GNU mirror ! sites, or [10]our CVS server. ! _________________________________________________________________ _________________________________________________________________ ! Please send FSF & GNU inquiries & questions to [11]gnu@gnu.org. There ! are also [12]other ways to contact the FSF. ! These pages are maintained by [13]The GCC team. Please send comments on these web pages and GCC to our public ! mailing list at [14]gcc@gnu.org or [15]gcc@gcc.gnu.org, send other ! questions to [16]gnu@gnu.org. Copyright (C) Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. --- 7,72 ---- ====================================================================== http://gcc.gnu.org/gcc-3.2/index.html ! GCC 3.2 Release Series ! February 5, 2003 The [1]GNU project and the GCC developers are pleased to announce the ! release of GCC 3.2.2. ! The purpose of the GCC 3.2 release series is to provide a stable ! platform for OS distributors to use building their next releases. A ! primary objective was to stabilize the C++ ABI; we believe that the ! interface to the compiler and the C++ standard library are now ! relatively stable. ! Be aware that C++ code compiled by GCC 3.2.x will (in general) not ! interoperate with code compiled by GCC 3.1.1 or earlier. ! Please refer to our [2]detailed list of news, caveats, and bug-fixes ! for further information. ! ! Release History ! ! GCC 3.2.2 ! February 5, 2003 ([3]changes) ! ! GCC 3.2.1 ! November 19, 2002 ([4]changes) ! ! GCC 3.2 ! August 14, 2002 ([5]changes) ! ! References and Acknowledgements GCC used to stand for the GNU C Compiler, but since the compiler supports several other languages aside from C, it now stands for the GNU Compiler Collection. ! A list of [6]successful builds is updated as new information becomes available. The GCC developers would like to thank the numerous people that have ! contributed new features, improvements, bug fixes, and other changes ! as well as test results to GCC. This [7]amazing group of volunteers is ! what makes GCC successful. ! For additional information about GCC please refer to the [8]GCC ! project web site or contact the [9]GCC development mailing list. ! To obtain GCC please use [10]our mirror sites, one of the [11]GNU ! mirror sites, or [12]our CVS server. _________________________________________________________________ ! Please send FSF & GNU inquiries & questions to [13]gnu@gnu.org. There ! are also [14]other ways to contact the FSF. ! These pages are maintained by [15]The GCC team. Please send comments on these web pages and GCC to our public ! mailing list at [16]gcc@gnu.org or [17]gcc@gcc.gnu.org, send other ! questions to [18]gnu@gnu.org. Copyright (C) Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. *************** http://gcc.gnu.org/gcc-3.2/index.html *** 57,142 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-18 [17]Valid XHTML 1.0 References 1. http://www.gnu.org/ ! 2. http://www.gnu.org/ ! 3. http://gcc.gnu.org/gcc-3.2/buildstat.html ! 4. http://gcc.gnu.org/gcc-3.2/changes.html ! 5. http://gcc.gnu.org/onlinedocs/gcc/Contributors.html ! 6. http://gcc.gnu.org/index.html ! 7. mailto:gcc@gcc.gnu.org ! 8. http://gcc.gnu.org/mirrors.html ! 9. http://www.gnu.org/order/ftp.html ! 10. http://gcc.gnu.org/cvs.html ! 11. mailto:gnu@gnu.org ! 12. http://www.gnu.org/home.html#ContactInfo ! 13. http://gcc.gnu.org/about.html ! 14. mailto:gcc@gnu.org ! 15. mailto:gcc@gcc.gnu.org ! 16. mailto:gnu@gnu.org ! 17. http://validator.w3.org/check/referer ====================================================================== http://gcc.gnu.org/gcc-3.2/changes.html ! GCC 3.2 Release Series -- Changes, New Features, and Fixes ! ! The purpose of this release series is to provide a stable platform for ! OS distributors to use building their next releases. A primary ! objective was to stabilize the C++ ABI; we believe that the interface ! to the compiler and the C++ standard library are now stable. ! ! Be aware that C++ code compiled by GCC 3.2.x will not interoperate ! with code compiled by GCC 3.1.1 or earlier. ! ! Frontend Enhancements ! ! * C/C++/Objective-C ! + The method of constructing the list of directories to be ! searched for header files has been revised. If a directory ! named by a -I option is a standard system include directory, ! the option is ignored to ensure that the default search order ! for system directories and the special treatment of system ! header files are not defeated. ! + The C and Objective-C compilers no longer accept the "Naming ! Types" extension (typedef foo = bar); it was already ! unavailable in C++. Code which uses it will need to be ! changed to use the "typeof" extension instead: typedef ! typeof(bar) foo. (We have removed this extension without a ! period of deprecation because it has caused the compiler to ! crash since version 3.0 and no one noticed until very ! recently. Thus we conclude it is not in widespread use.) ! * C++ ! + There are now no known differences between the C++ ABI ! implemented in GCC and the multi-vendor standard. We believe ! that the ABI for the C++ standard library is now stable and ! will not change in future versions of the compiler. However, ! hard experience has taught us to be cautious; it is possible ! that more problems will be found. It is our intention to make ! changes to the ABI only if they are necessary for correct ! compilation of C++, as opposed to conformance to the ABI ! documents. ! + For details on how to build an ABI compliant compiler for ! GNU/Linux systems, check the [1]common C++ ABI page. ! ! New Targets and Target Specific Improvements ! * IA-32 ! + Fixed a number of bugs in SSE and MMX intrinsics. ! + Fixed common compiler crashes with SSE instruction set ! enabled (implied by -march=pentium3, pentium4, athlon-xp) ! + __m128 and __m128i is not 128bit aligned when used in ! structures. ! * x86-64 ! + A bug whereby the compiler could generate bad code for bzero ! has been fixed. ! + ABI fixes (implying ABI incompatibilities with previous ! version in some corner cases) ! + Fixed prefetch code generation ! Caveats * The C++ compiler does not correctly zero-initialize pointers-to-data members. You must explicitly initialize them. For --- 74,111 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [19]Valid XHTML 1.0 References 1. http://www.gnu.org/ ! 2. http://gcc.gnu.org/gcc-3.2/changes.html ! 3. http://gcc.gnu.org/gcc-3.2/changes.html#3.2.2 ! 4. http://gcc.gnu.org/gcc-3.2/changes.html#3.2.1 ! 5. http://gcc.gnu.org/gcc-3.2/changes.html#3.2 ! 6. http://gcc.gnu.org/gcc-3.2/buildstat.html ! 7. http://gcc.gnu.org/onlinedocs/gcc/Contributors.html ! 8. http://gcc.gnu.org/index.html ! 9. mailto:gcc@gcc.gnu.org ! 10. http://gcc.gnu.org/mirrors.html ! 11. http://www.gnu.org/order/ftp.html ! 12. http://gcc.gnu.org/cvs.html ! 13. mailto:gnu@gnu.org ! 14. http://www.gnu.org/home.html#ContactInfo ! 15. http://gcc.gnu.org/about.html ! 16. mailto:gcc@gnu.org ! 17. mailto:gcc@gcc.gnu.org ! 18. mailto:gnu@gnu.org ! 19. http://validator.w3.org/check/referer ====================================================================== http://gcc.gnu.org/gcc-3.2/changes.html ! GCC 3.2 Release Series ! Changes, New Features, and Fixes ! Caveats and New Features ! Caveats * The C++ compiler does not correctly zero-initialize pointers-to-data members. You must explicitly initialize them. For *************** Caveats *** 145,163 **** fixed in GCC 3.2 without inducing unacceptable risks. It will be fixed in GCC 3.3. * This GCC release is based on the GCC 3.1 sourcebase, and thus has ! all the [2]changes in the GCC 3.1 series. In addition, GCC 3.2 has a number of C++ ABI fixes which make its C++ compiler generate binary code which is incompatible with the C++ compilers found in earlier GCC releases, including GCC 3.1 and GCC 3.1.1. ! GCC 3.2.2 ! Miscellaneous Improvements ! * As of 3.2.2, the Makefile suite supports redirection of make ! install by means of the DESTDIR variable. ! GCC 3.2.1 3.2.1 adds a new warning, -Wabi. This option warns when GNU C++ generates code that is known not to be binary-compatible with the --- 114,321 ---- fixed in GCC 3.2 without inducing unacceptable risks. It will be fixed in GCC 3.3. * This GCC release is based on the GCC 3.1 sourcebase, and thus has ! all the [1]changes in the GCC 3.1 series. In addition, GCC 3.2 has a number of C++ ABI fixes which make its C++ compiler generate binary code which is incompatible with the C++ compilers found in earlier GCC releases, including GCC 3.1 and GCC 3.1.1. ! Frontend Enhancements ! C/C++/Objective-C ! * The method of constructing the list of directories to be searched ! for header files has been revised. If a directory named by a -I ! option is a standard system include directory, the option is ! ignored to ensure that the default search order for system ! directories and the special treatment of system header files are ! not defeated. ! * The C and Objective-C compilers no longer accept the "Naming ! Types" extension (typedef foo = bar); it was already unavailable ! in C++. Code which uses it will need to be changed to use the ! "typeof" extension instead: typedef typeof(bar) foo. (We have ! removed this extension without a period of deprecation because it ! has caused the compiler to crash since version 3.0 and no one ! noticed until very recently. Thus we conclude it is not in ! widespread use.) ! C++ ! ! * There are now no known differences between the C++ ABI implemented ! in GCC and the multi-vendor standard. We believe that the ABI for ! the C++ standard library is now stable and will not change in ! future versions of the compiler. However, hard experience has ! taught us to be cautious; it is possible that more problems will ! be found. It is our intention to make changes to the ABI only if ! they are necessary for correct compilation of C++, as opposed to ! conformance to the ABI documents. ! * For details on how to build an ABI compliant compiler for ! GNU/Linux systems, check the [2]common C++ ABI page. ! ! New Targets and Target Specific Improvements ! ! IA-32 ! ! * Fixed a number of bugs in SSE and MMX intrinsics. ! * Fixed common compiler crashes with SSE instruction set enabled ! (implied by -march=pentium3, pentium4, athlon-xp) ! * __m128 and __m128i is not 128bit aligned when used in structures. ! ! x86-64 ! ! * A bug whereby the compiler could generate bad code for bzero has ! been fixed. ! * ABI fixes (implying ABI incompatibilities with previous version in ! some corner cases) ! * Fixed prefetch code generation ! _________________________________________________________________ ! ! GCC 3.2.2 ! ! Beginning with 3.2.2, GCC's Makefile suite supports redirection of ! make install by means of the DESTDIR variable. Parts of the GCC tree ! have featured that support long before, but now it is available even ! from the top level. ! ! Other than that, GCC 3.2.2 is a bug fix release only; there are no new ! features that were not present in GCC 3.2.1. ! ! Bug Fixes ! ! On the following i386-based systems GCC 3.2.1 broke the C ABI wrt. ! functions returning structures: Cygwin, FreeBSD (GCC 3.2.1 as shipped ! with FreeBSD 5.0 does not have this problem), Interix, a.out-based ! Linux and NetBSD, OpenBSD, and Darwin. GCC 3.2.2 reverts this ABI ! change, and thus restores ABI-compatibility with previous releases ! (except GCC 3.2.1) on these platforms. ! ! This section lists the problem reports (PRs) from GCC's bug tracking ! system (GNATS) that are known to be fixed in the 3.2.2 release. This ! list might not be complete (that is, it is possible that some PRs that ! have been fixed are not listed here). ! ! The sorting is slightly different from the GNATS categories, and some ! of the titles have been changed to make them more clear. ! ! Internal Compiler Errors (multi-platform) ! ! * [3]5919: (c++) ICE when passing variable array to template ! function ! * [4]7129: (c++) ICE with min/max assignment operators (?=) ! * [5]7507: ICE with -O2 when address of called function is a ! complicated expression ! * [6]7622: ICE with nested inline functions if function's address is ! taken ! * [7]7681: (fortran) ICE in compensate_edge, in reg-stack.c (also PR ! [8]9258) ! * [9]8031: (c++) ICE in code comparing typeids and casting from ! virtual base ! * [10]8275: ICE in simplify_subreg ! * [11]8332: (c++) builtin strlen/template interaction causes ICE ! * [12]8372: (c++) ICE on explicit call of destructor ! * [13]8439: (c, not c++) empty struct causes ICE ! * [14]8442: (c++) ICE with nested template classes ! * [15]8518: ICE when compiling mplayer ("extern inline" issue) ! * [16]8615: (c++) ICE with out-of-range character constant template ! argument ! * [17]8663: (c++) ICE in cp_expr_size, at cp-lang.c:307 ! * [18]8799: (c++) ICE: error reporting routines re-entered ! * [19]9328: (c++) ICE with typeof(X) for overloaded X ! * [20]9465: (preprocessor) cpp -traditional ICE on null bytes ! ! C++ (compiler and library) bugs ! ! * [21]47: scoping in nested classes is broken ! * [22]6745: problems with iostream rdbuf() member function ! * [23]8214: conversion from const char* const to char* sometimes ! accepted illegally ! * [24]8493: builtin strlen and overload resolution (same bug as ! [25]8332) ! * [26]8503: strange behaviour of function types ! * [27]8727: compiler confused by inheritance from an anonymous ! struct ! * [28]7445: poor performance of std::locale::classic() in ! multi-threaded applications ! * [29]8230: mishandling of overflow in vector::resize ! * [30]8399: sync_with_stdio(false) breaks unformatted input ! * [31]8662: illegal access of private member of unnamed class is ! accepted ! * [32]8707: "make distclean" fails in libstdc++-v3 directory ! * [33]8708: __USE_MALLOC doesn't work ! * [34]8790: Use of non-thread-safe strtok in src/localename.cc ! * [35]8887: Bug in date formats with --enable-clocale=generic ! * [36]9076: Call Frame Instructions are not handled correctly during ! unwind operation ! * [37]9151: std::setprecision limited to 16 digits when outputting a ! double to a stream ! * [38]9168: codecvt overwrites output buffers ! * [39]9269: libstdc++ headers: explicit specialization of function ! must precede its first use ! * [40]9322: return value of basic_streambuf<>::getloc affected by ! locale::global ! * [41]9433: segfault in runtime support for dynamic_cast ! ! C and optimizer bugs ! ! * [42]8032: GCC incorrectly initializes static structs that have ! flexible arrays ! * [43]8639: simple arithmetic expression broken ! * [44]8794: optimization improperly eliminates certain expressions ! * [45]8832: traditional "asm volatile" code is illegally optimized ! * [46]8988: loop optimizer bug: with -O2, code is generated that ! segfaults (found on i386, bug present for all platforms) ! * [47]9492: structure copy clobbers subsequent stores to structure ! ! Objective-C bugs ! ! * [48]9267: Objective-C parser won't build with newer bison versions ! (e.g. 1.875) ! ! Ada bugs ! ! * [49]8344: Ada build problem due to conflict between gcc/final.o, ! gcc/ada/final.o ! ! Preprocessor bugs ! ! * [50]8524: _Pragma within macros is improperly expanded ! * [51]8880: __WCHAR_TYPE__ macro incorrectly set to "long int" with ! -fshort-wchar ! ! ARM-specific ! ! * [52]9090: arm ICE with >= -O2; regression from gcc-2.95 ! ! x86-specific (Intel/AMD) ! ! * [53]8588: ICE in extract_insn, at recog.c:NNNN (shift instruction) ! * [54]8599: loop unroll bug with -march=k6-3 ! * [55]9506: ABI breakage in structure return (affects BSD and ! Cygwin, but not GNU/Linux) ! ! FreeBSD 5.0 specific ! ! * [56]9484: GCC 3.2.1 Bootstrap failure on FreeBSD 5.0 ! ! RTEMS-specific ! ! * [57]9292: hppa1.1-rtems configurery problems ! * [58]9293: [m68k-elf/rtems] config/m68k/t-crtstuff bug ! * [59]9295: [mips-rtems] config/mips/rtems.h init/fini issue ! * [60]9296: gthr-rtems regression ! * [61]9316: powerpc-rtems: extending multilibs ! ! HP-PA specific ! ! * [62]9493: ICE with -O2 when building a simple function ! ! Documentation ! ! * [63]7341: hyperlink to gcov in GCC documentation doesn't work ! * [64]8947: Please add a warning about "-malign-double" in docs ! * [65]7448, [66]8882: typo cleanups ! _________________________________________________________________ ! ! GCC 3.2.1 3.2.1 adds a new warning, -Wabi. This option warns when GNU C++ generates code that is known not to be binary-compatible with the *************** Miscellaneous Improvements *** 173,347 **** the new warning there are no new features that were not present in GCC 3.2. ! In addition, the previous fix for [3]PR 7445 (poor performance of std::locale::classic() in multi-threaded applications) was reverted ("unfixed"), because the "fix" was not thread-safe. ! Bug Fixes ! This document lists the problem reports (PRs) from GCC's bug tracking ! system ([4]GNATS) that are known to be fixed in the 3.2.1 release. This list might not be complete (that is, it is possible that some PRs that have been fixed are not listed here). As you can see, the number of bug fixes is quite large, so it is strongly recommended that users of earlier gcc 3.x releases upgrade to GCC 3.2.1. - * Internal Compiler Errors (multi-platform) - + [5]2521: (c++) ICE in build_ptrmemfunc, in cp/typeck.c - + [6]5661: (c++) ICE instantiating template on array of unknown - size (bad code) - + [7]6419: (c++) ICE in make_decl_rtl for "longest" attribute - on 64-bit platforms - + [8]6994: (c++) ICE in find_function_data - + [9]7150: preprocessor: GCC -dM -E gives an ICE - + [10]7160: ICE when optimizing branches without a return value - + [11]7228: (c++) ICE when using member template and template - function - + [12]7266: (c++) ICE with -pedantic on missing typename - + [13]7353: ICE from use of "Naming Types" extension, see above - + [14]7411: ICE in instantiate_virtual_regs_1, in function.c - + [15]7478: (c++) ICE on static_cast inside template - + [16]7526: preprocessor core dump when _Pragma implies #pragma - dependency - + [17]7721: (c++) ICE on simple (but incorrect) template - ([18]7803 is a duplicate) - + [19]7754: (c++) ICE on union with template parameter - + [20]7788: (c++) redeclaring a definition as an incomplete - class causes ICE - + [21]8031: (c++) ICE in comptypes, in cp/typeck.c - + [22]8055: preprocessor dies with SIG11 when building FreeBSD - kernel - + [23]8067: (c++) ICE due to mishandling of __FUNCTION__ and - related variables - + [24]8134: (c++) ICE in force_store_init_value on legal code - + [25]8149: (c++) ICE on incomplete type - + [26]8160: (c++) ICE in build_modify_expr, in cp/typeck.c: - array initialization - * C++ (compiler and library) bugs - + [27]5607: No pointer adjustment in covariant return types - + [28]6579: Infinite loop with statement expressions in member - initialization - + [29]6803: Default copy constructor bug in GCC 3.1 - + [30]7176: g++ confused by friend and static member with same - name - + [31]7188: Segfault with template class and recursive - (incorrect) initializer list - + [32]7306: Regression: GCC 3.x fails to compile code with - virtual inheritance if a method has a variable number of - arguments - + [33]7461: ctype::classic_table() returns offset array - on Cygwin - + [34]7524: f(const float arg[3]) fails - + [35]7584: Erroneous ambiguous base error on using declaration - + [36]7676: Member template overloading problem - + [37]7679: infinite loop when a right parenthesis is missing - + [38]7811: default locale not taken from environment - + [39]7961: compare( char *) implemented incorrectly in - basic_string<> - + [40]8071: basic_ostream::operator<<(streambuf*) loops forever - if streambuf::underflow() leaves gptr() NULL (dups: [41]8127, - [42]6745) - + [43]8096: deque::at() throws std::range_error instead of - std::out_of_range - + [44]8127: cout << cin.rdbuf() infinite loop - + [45]8218: Excessively large memory consumed for classes with - large array members - + [46]8287: GCC 3.2: Destructor called for non-constructed - local object - + [47]8347: empty vector range used in string construction - causes core dump - + [48]8348: fail() flag is set in istringstream when eof() flag - is set - + [49]8391: regression: infinite loop in - cp/decl2.c(finish_file) - * C and optimizer bugs - + [50]6627: -fno-align-functions doesn't seem to disable - function alignment - + [51]6631: life_analysis misoptimizes code to initialize - fields of a structure - + [52]7102: unsigned char division results in floating - exception - + [53]7120: Run once loop should *always* be unrolled - (pessimization) - + [54]7209: Bug involving array referencing and ?: operator - + [55]7515: invalid inlining of global function with -O3 - + [56]7814: incorrect scheduling for glibc-2.2.92 strcpy test - + [57]8467: bug in sibling call optimization - * Preprocessor bugs - + [58]4890: incorrect line markers from the traditional - preprocessor - + [59]7357: -M option omits system headers files (making it the - same as -MM) - + [60]7358: Changes to Sun's make Dependencies - + [61]7602: C++ header files found in CPLUS_INCLUDE_PATH - treated as C headers - + [62]7862: Interrupting GCC -MD removes .d file but not .o - + [63]8190: Failed compilation deletes -MD dependency file - + [64]8524: _Pragma within macro is improperly expanded - * x86 specific (Intel/AMD) - + [65]5351: (i686-only) function pass-by-value structure copy - corrupts stack ([66]7591 is a duplicate) - + [67]6845, [68]7034, [69]7124, [70]7174: ICE's with - -march=pentium3/pentium2/athlon (these are all the same - underlying bug, in MMX register use) - + [71]7134, [72]7375, [73]7390: ICE with -march=athlon (maybe - same as above?) - + [74]6890: xmmintrin.h, _MM_TRANSPOSE4_PS is broken - + [75]6981: wrong code in 64-bit manipulation on x86 - + [76]7242: GCC -mcpu=pentium[23] doesn't define - __tune_pentiumpro__ macro - + [77]7396: ix86: cmpgt_ss, cmpge_ss, cmpngt_ss, and cmpnge_ss - SSE intrinsics are broken - + [78]7630: GCC 3.2 breaks on Mozilla 1.0's JS sources with - -march=pentium4 - + [79]7693: Typo in i386 mmintrin.h header - + [80]7723: ICE - Pentium3 sse - GCC 3.2 - + [81]7951: ICE on -march=pentium4 -O2 -mfpmath=sse - + [82]8146: (i686 only) gcc 3.2 miscompiles gcc 2.95.3 - * PowerPC specific - + [83]5967: GCC bug when profiling nested functions on powerpc - + [84]6984: wrong code generated with -O2, -O3, -Os for - do-while loop on PowerPC - + [85]7114: PowerPC: ICE building strcoll.op from glibc-2.2.5 - + [86]7130: miscompiled code for GCC-3.1 in powerpc linux with - -funroll-all-loops - + [87]7133: PowerPC ICE: unrecognizable insn - + [88]7380: ICE in extract_insn, at recog.c:2148 - + [89]8252: ICE on Altivec code with optimization turned on - + [90]8451: Altivec ICE in GCC 3.2 - * HP/PA specific - + [91]7250: __ashrdi3 returns wrong value on 32 bit hppa - * SPARC specific - + [92]6668: when using --disable-multilib, libgcc_s.so is - installed in the wrong place on sparc-solaris - + [93]7151: ICE when compiling for UltraSPARC - + [94]7335: SPARC: ICE in verify_wide_reg (flow.c:557) with - long double and -O1 - + [95]7842: [REGRESSION] SPARC code gen bug - * ARM specific - + [96]7856: [arm] invalid offset in constant pool reference - + [97]7967: optimization produces wrong code (ARM) - * Alpha specific - + [98]7374: __builtin_fabsl broken on alpha - * IBM s390 specific - + [99]7370: ICE in fixup_var_refs_1 on s390x - + [100]7409: loop optimization bug on s390x-linux-gnu - + [101]8232: s390x: ICE when using bcmp with int length - argument - * SCO specific - + [102]7623: SCO OpenServer build fails with machmode.def: - undefined symbol: BITS_PER_UNIT - * m68k/Coldfire specific - + [103]8314: crtbegin, crtend need to be multilib'ed for this - platform - * Documentation - + [104]761: Document some undocumented options - + [105]5610: Fix documentation about invoking SSE instructions - (-mfpmath=sse) - + [106]7484: List -Wmissing-declarations as C-only option - + [107]7531: -mcmodel not documented for x86-64 - + [108]8120: Update documentation of bad use of ## ! GCC 3.2 3.2 is a small bug fix release, but there is a change to the application binary interface (ABI), hence the change to the second --- 331,529 ---- the new warning there are no new features that were not present in GCC 3.2. ! In addition, the previous fix for [67]PR 7445 (poor performance of std::locale::classic() in multi-threaded applications) was reverted ("unfixed"), because the "fix" was not thread-safe. ! Bug Fixes ! This section lists the problem reports (PRs) from GCC's bug tracking ! system ([68]GNATS) that are known to be fixed in the 3.2.1 release. This list might not be complete (that is, it is possible that some PRs that have been fixed are not listed here). As you can see, the number of bug fixes is quite large, so it is strongly recommended that users of earlier gcc 3.x releases upgrade to GCC 3.2.1. ! Internal Compiler Errors (multi-platform) ! ! * [69]2521: (c++) ICE in build_ptrmemfunc, in cp/typeck.c ! * [70]5661: (c++) ICE instantiating template on array of unknown ! size (bad code) ! * [71]6419: (c++) ICE in make_decl_rtl for "longest" attribute on ! 64-bit platforms ! * [72]6994: (c++) ICE in find_function_data ! * [73]7150: preprocessor: GCC -dM -E gives an ICE ! * [74]7160: ICE when optimizing branches without a return value ! * [75]7228: (c++) ICE when using member template and template ! function ! * [76]7266: (c++) ICE with -pedantic on missing typename ! * [77]7353: ICE from use of "Naming Types" extension, see above ! * [78]7411: ICE in instantiate_virtual_regs_1, in function.c ! * [79]7478: (c++) ICE on static_cast inside template ! * [80]7526: preprocessor core dump when _Pragma implies #pragma ! dependency ! * [81]7721: (c++) ICE on simple (but incorrect) template ([82]7803 ! is a duplicate) ! * [83]7754: (c++) ICE on union with template parameter ! * [84]7788: (c++) redeclaring a definition as an incomplete class ! causes ICE ! * [85]8031: (c++) ICE in comptypes, in cp/typeck.c ! * [86]8055: preprocessor dies with SIG11 when building FreeBSD ! kernel ! * [87]8067: (c++) ICE due to mishandling of __FUNCTION__ and related ! variables ! * [88]8134: (c++) ICE in force_store_init_value on legal code ! * [89]8149: (c++) ICE on incomplete type ! * [90]8160: (c++) ICE in build_modify_expr, in cp/typeck.c: array ! initialization ! ! C++ (compiler and library) bugs ! ! * [91]5607: No pointer adjustment in covariant return types ! * [92]6579: Infinite loop with statement expressions in member ! initialization ! * [93]6803: Default copy constructor bug in GCC 3.1 ! * [94]7176: g++ confused by friend and static member with same name ! * [95]7188: Segfault with template class and recursive (incorrect) ! initializer list ! * [96]7306: Regression: GCC 3.x fails to compile code with virtual ! inheritance if a method has a variable number of arguments ! * [97]7461: ctype::classic_table() returns offset array on ! Cygwin ! * [98]7524: f(const float arg[3]) fails ! * [99]7584: Erroneous ambiguous base error on using declaration ! * [100]7676: Member template overloading problem ! * [101]7679: infinite loop when a right parenthesis is missing ! * [102]7811: default locale not taken from environment ! * [103]7961: compare( char *) implemented incorrectly in ! basic_string<> ! * [104]8071: basic_ostream::operator<<(streambuf*) loops forever if ! streambuf::underflow() leaves gptr() NULL (dups: [105]8127, ! [106]6745) ! * [107]8096: deque::at() throws std::range_error instead of ! std::out_of_range ! * [108]8127: cout << cin.rdbuf() infinite loop ! * [109]8218: Excessively large memory consumed for classes with ! large array members ! * [110]8287: GCC 3.2: Destructor called for non-constructed local ! object ! * [111]8347: empty vector range used in string construction causes ! core dump ! * [112]8348: fail() flag is set in istringstream when eof() flag is ! set ! * [113]8391: regression: infinite loop in cp/decl2.c(finish_file) ! ! C and optimizer bugs ! ! * [114]6627: -fno-align-functions doesn't seem to disable function ! alignment ! * [115]6631: life_analysis misoptimizes code to initialize fields of ! a structure ! * [116]7102: unsigned char division results in floating exception ! * [117]7120: Run once loop should *always* be unrolled ! (pessimization) ! * [118]7209: Bug involving array referencing and ?: operator ! * [119]7515: invalid inlining of global function with -O3 ! * [120]7814: incorrect scheduling for glibc-2.2.92 strcpy test ! * [121]8467: bug in sibling call optimization ! ! Preprocessor bugs ! ! * [122]4890: incorrect line markers from the traditional ! preprocessor ! * [123]7357: -M option omits system headers files (making it the ! same as -MM) ! * [124]7358: Changes to Sun's make Dependencies ! * [125]7602: C++ header files found in CPLUS_INCLUDE_PATH treated as ! C headers ! * [126]7862: Interrupting GCC -MD removes .d file but not .o ! * [127]8190: Failed compilation deletes -MD dependency file ! * [128]8524: _Pragma within macro is improperly expanded ! ! x86 specific (Intel/AMD) ! ! * [129]5351: (i686-only) function pass-by-value structure copy ! corrupts stack ([130]7591 is a duplicate) ! * [131]6845, [132]7034, [133]7124, [134]7174: ICE's with ! -march=pentium3/pentium2/athlon (these are all the same underlying ! bug, in MMX register use) ! * [135]7134, [136]7375, [137]7390: ICE with -march=athlon (maybe ! same as above?) ! * [138]6890: xmmintrin.h, _MM_TRANSPOSE4_PS is broken ! * [139]6981: wrong code in 64-bit manipulation on x86 ! * [140]7242: GCC -mcpu=pentium[23] doesn't define ! __tune_pentiumpro__ macro ! * [141]7396: ix86: cmpgt_ss, cmpge_ss, cmpngt_ss, and cmpnge_ss SSE ! intrinsics are broken ! * [142]7630: GCC 3.2 breaks on Mozilla 1.0's JS sources with ! -march=pentium4 ! * [143]7693: Typo in i386 mmintrin.h header ! * [144]7723: ICE - Pentium3 sse - GCC 3.2 ! * [145]7951: ICE on -march=pentium4 -O2 -mfpmath=sse ! * [146]8146: (i686 only) gcc 3.2 miscompiles gcc 2.95.3 ! ! PowerPC specific ! ! * [147]5967: GCC bug when profiling nested functions on powerpc ! * [148]6984: wrong code generated with -O2, -O3, -Os for do-while ! loop on PowerPC ! * [149]7114: PowerPC: ICE building strcoll.op from glibc-2.2.5 ! * [150]7130: miscompiled code for GCC-3.1 in powerpc linux with ! -funroll-all-loops ! * [151]7133: PowerPC ICE: unrecognizable insn ! * [152]7380: ICE in extract_insn, at recog.c:2148 ! * [153]8252: ICE on Altivec code with optimization turned on ! * [154]8451: Altivec ICE in GCC 3.2 ! ! HP/PA specific ! ! * [155]7250: __ashrdi3 returns wrong value on 32 bit hppa ! ! SPARC specific ! ! * [156]6668: when using --disable-multilib, libgcc_s.so is installed ! in the wrong place on sparc-solaris ! * [157]7151: ICE when compiling for UltraSPARC ! * [158]7335: SPARC: ICE in verify_wide_reg (flow.c:557) with long ! double and -O1 ! * [159]7842: [REGRESSION] SPARC code gen bug ! ! ARM specific ! ! * [160]7856: [arm] invalid offset in constant pool reference ! * [161]7967: optimization produces wrong code (ARM) ! ! Alpha specific ! ! * [162]7374: __builtin_fabsl broken on alpha ! ! IBM s390 specific ! ! * [163]7370: ICE in fixup_var_refs_1 on s390x ! * [164]7409: loop optimization bug on s390x-linux-gnu ! * [165]8232: s390x: ICE when using bcmp with int length argument ! ! SCO specific ! ! * [166]7623: SCO OpenServer build fails with machmode.def: undefined ! symbol: BITS_PER_UNIT ! ! m68k/Coldfire specific ! ! * [167]8314: crtbegin, crtend need to be multilib'ed for this ! platform ! ! Documentation ! ! * [168]761: Document some undocumented options ! * [169]5610: Fix documentation about invoking SSE instructions ! (-mfpmath=sse) ! * [170]7484: List -Wmissing-declarations as C-only option ! * [171]7531: -mcmodel not documented for x86-64 ! * [172]8120: Update documentation of bad use of ## ! _________________________________________________________________ ! ! GCC 3.2 3.2 is a small bug fix release, but there is a change to the application binary interface (ABI), hence the change to the second *************** Bug Fixes *** 351,389 **** in the C++ ABI, with the intention of providing a stable interface going forward. Accordingly, 3.2 is only a small change to 3.1.1. ! Bug Fixes ! * C++ ! + [109]7320: g++ 3.2 relocation problem ! + [110]7470: vtable: virtual function pointers not in ! declaration order ! * libstdc++ ! + [111]6410: Trouble with non-ASCII monetary symbols and ! wchar_t ! + [112]6503, [113]6642, [114]7186: Problems with comparing or ! subtracting various types of const and non-const iterators ! + [115]7216: ambiguity with basic_iostream::traits_type ! + [116]7220: problem with basic_istream::ignore(0,delimiter) ! + [117]7222: locale::operator==() doesn't work on ! std::locale("") ! + [118]7286: placement operator delete issue ! + [119]7442: cxxabi.h does not match the C++ ABI ! + [120]7445: poor performance of std::locale::classic() in ! multi-threaded applications ! * x86-64 specific ! + [121]7291: off-by-one in generated inline bzero code for ! x86-64 _________________________________________________________________ ! Please send FSF & GNU inquiries & questions to [122]gnu@gnu.org. There ! are also [123]other ways to contact the FSF. ! These pages are maintained by [124]The GCC team. Please send comments on these web pages and GCC to our public ! mailing list at [125]gcc@gnu.org or [126]gcc@gcc.gnu.org, send other ! questions to [127]gnu@gnu.org. Copyright (C) Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. --- 533,573 ---- in the C++ ABI, with the intention of providing a stable interface going forward. Accordingly, 3.2 is only a small change to 3.1.1. ! Bug Fixes ! C++ ! ! * [173]7320: g++ 3.2 relocation problem ! * [174]7470: vtable: virtual function pointers not in declaration ! order ! ! libstdc++ ! ! * [175]6410: Trouble with non-ASCII monetary symbols and wchar_t ! * [176]6503, [177]6642, [178]7186: Problems with comparing or ! subtracting various types of const and non-const iterators ! * [179]7216: ambiguity with basic_iostream::traits_type ! * [180]7220: problem with basic_istream::ignore(0,delimiter) ! * [181]7222: locale::operator==() doesn't work on std::locale("") ! * [182]7286: placement operator delete issue ! * [183]7442: cxxabi.h does not match the C++ ABI ! * [184]7445: poor performance of std::locale::classic() in ! multi-threaded applications ! ! x86-64 specific ! ! * [185]7291: off-by-one in generated inline bzero code for x86-64 _________________________________________________________________ ! Please send FSF & GNU inquiries & questions to [186]gnu@gnu.org. There ! are also [187]other ways to contact the FSF. ! These pages are maintained by [188]The GCC team. Please send comments on these web pages and GCC to our public ! mailing list at [189]gcc@gnu.org or [190]gcc@gcc.gnu.org, send other ! questions to [191]gnu@gnu.org. Copyright (C) Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. *************** Bug Fixes *** 391,528 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-01-28 [128]Valid XHTML 1.0 References ! 1. http://gcc.gnu.org/gcc-3.2/c++-abi.html ! 2. http://gcc.gnu.org/gcc-3.1/changes.html ! 3. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7445 ! 4. http://gcc.gnu.org/cgi-bin/gnatsweb.pl ! 5. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=2521 ! 6. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5661 ! 7. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6419 ! 8. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6994 ! 9. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7150 ! 10. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7160 ! 11. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7228 ! 12. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7266 ! 13. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7353 ! 14. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7411 ! 15. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7478 ! 16. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7526 ! 17. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7721 ! 18. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7803 ! 19. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7754 ! 20. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7788 ! 21. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8031 ! 22. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8055 ! 23. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8067 ! 24. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8134 ! 25. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8149 ! 26. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8160 ! 27. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5607 ! 28. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6579 ! 29. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6803 ! 30. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7176 ! 31. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7188 ! 32. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7306 ! 33. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7461 ! 34. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7524 ! 35. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7584 ! 36. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7676 ! 37. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7679 ! 38. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7811 ! 39. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7961 ! 40. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8071 ! 41. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8127 ! 42. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6745 ! 43. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8096 ! 44. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8127 ! 45. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8218 ! 46. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8287 ! 47. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8347 ! 48. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8348 ! 49. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8391 ! 50. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6627 ! 51. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6631 ! 52. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7102 ! 53. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7120 ! 54. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7209 ! 55. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7515 ! 56. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7814 ! 57. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8467 ! 58. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=4890 ! 59. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7357 ! 60. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7358 ! 61. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7602 ! 62. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7862 ! 63. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8190 ! 64. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8524 ! 65. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5351 ! 66. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7591 ! 67. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6845 ! 68. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7034 ! 69. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7124 ! 70. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7174 ! 71. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7134 ! 72. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7375 ! 73. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7390 ! 74. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6890 ! 75. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6981 ! 76. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7242 ! 77. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7396 ! 78. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7630 ! 79. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7693 ! 80. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7723 ! 81. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7951 ! 82. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8146 ! 83. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5967 ! 84. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6984 ! 85. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7114 ! 86. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7130 ! 87. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7133 ! 88. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7380 ! 89. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8252 ! 90. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8451 ! 91. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7250 ! 92. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6668 ! 93. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7151 ! 94. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7335 ! 95. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7842 ! 96. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7856 ! 97. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7967 ! 98. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7374 ! 99. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7370 ! 100. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7409 ! 101. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8232 ! 102. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7623 ! 103. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8314 ! 104. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=761 ! 105. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5610 ! 106. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7484 ! 107. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7531 ! 108. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8120 ! 109. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7320 ! 110. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7470 ! 111. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6410 ! 112. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6503 ! 113. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6642 ! 114. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7186 ! 115. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7216 ! 116. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7220 ! 117. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7222 ! 118. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7286 ! 119. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7442 ! 120. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7445 ! 121. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7291 ! 122. mailto:gnu@gnu.org ! 123. http://www.gnu.org/home.html#ContactInfo ! 124. http://gcc.gnu.org/about.html ! 125. mailto:gcc@gnu.org ! 126. mailto:gcc@gcc.gnu.org ! 127. mailto:gnu@gnu.org ! 128. http://validator.w3.org/check/referer ====================================================================== http://gcc.gnu.org/gcc-3.1/index.html --- 575,776 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-03-21 [192]Valid XHTML 1.0 References ! 1. http://gcc.gnu.org/gcc-3.1/changes.html ! 2. http://gcc.gnu.org/gcc-3.2/c++-abi.html ! 3. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5919 ! 4. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7129 ! 5. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7507 ! 6. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7622 ! 7. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7681 ! 8. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9528 ! 9. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8031 ! 10. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8275 ! 11. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8332 ! 12. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8372 ! 13. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8439 ! 14. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8442 ! 15. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8518 ! 16. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8615 ! 17. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8663 ! 18. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8799 ! 19. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9328 ! 20. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9465 ! 21. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=47 ! 22. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6745 ! 23. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8214 ! 24. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8493 ! 25. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8332 ! 26. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8503 ! 27. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8727 ! 28. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7445 ! 29. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8230 ! 30. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8399 ! 31. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8662 ! 32. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8707 ! 33. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8708 ! 34. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8790 ! 35. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8887 ! 36. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9076 ! 37. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9151 ! 38. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9168 ! 39. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9269 ! 40. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9322 ! 41. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9433 ! 42. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8032 ! 43. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8639 ! 44. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8794 ! 45. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8832 ! 46. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8988 ! 47. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9492 ! 48. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9267 ! 49. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8344 ! 50. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8524 ! 51. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8880 ! 52. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9090 ! 53. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8588 ! 54. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8599 ! 55. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9506 ! 56. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9484 ! 57. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9292 ! 58. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9293 ! 59. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9295 ! 60. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9296 ! 61. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9316 ! 62. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=9493 ! 63. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7341 ! 64. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8947 ! 65. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7448 ! 66. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8882 ! 67. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7445 ! 68. http://gcc.gnu.org/cgi-bin/gnatsweb.pl ! 69. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=2521 ! 70. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5661 ! 71. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6419 ! 72. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6994 ! 73. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7150 ! 74. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7160 ! 75. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7228 ! 76. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7266 ! 77. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7353 ! 78. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7411 ! 79. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7478 ! 80. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7526 ! 81. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7721 ! 82. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7803 ! 83. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7754 ! 84. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7788 ! 85. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8031 ! 86. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8055 ! 87. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8067 ! 88. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8134 ! 89. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8149 ! 90. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8160 ! 91. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5607 ! 92. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6579 ! 93. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6803 ! 94. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7176 ! 95. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7188 ! 96. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7306 ! 97. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7461 ! 98. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7524 ! 99. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7584 ! 100. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7676 ! 101. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7679 ! 102. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7811 ! 103. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7961 ! 104. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8071 ! 105. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8127 ! 106. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6745 ! 107. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8096 ! 108. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8127 ! 109. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8218 ! 110. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8287 ! 111. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8347 ! 112. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8348 ! 113. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8391 ! 114. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6627 ! 115. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6631 ! 116. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7102 ! 117. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7120 ! 118. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7209 ! 119. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7515 ! 120. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7814 ! 121. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8467 ! 122. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=4890 ! 123. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7357 ! 124. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7358 ! 125. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7602 ! 126. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7862 ! 127. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8190 ! 128. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8524 ! 129. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5351 ! 130. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7591 ! 131. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6845 ! 132. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7034 ! 133. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7124 ! 134. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7174 ! 135. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7134 ! 136. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7375 ! 137. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7390 ! 138. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6890 ! 139. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6981 ! 140. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7242 ! 141. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7396 ! 142. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7630 ! 143. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7693 ! 144. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7723 ! 145. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7951 ! 146. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8146 ! 147. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5967 ! 148. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6984 ! 149. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7114 ! 150. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7130 ! 151. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7133 ! 152. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7380 ! 153. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8252 ! 154. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8451 ! 155. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7250 ! 156. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6668 ! 157. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7151 ! 158. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7335 ! 159. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7842 ! 160. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7856 ! 161. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7967 ! 162. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7374 ! 163. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7370 ! 164. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7409 ! 165. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8232 ! 166. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7623 ! 167. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8314 ! 168. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=761 ! 169. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=5610 ! 170. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7484 ! 171. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7531 ! 172. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=8120 ! 173. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7320 ! 174. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7470 ! 175. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6410 ! 176. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6503 ! 177. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=6642 ! 178. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7186 ! 179. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7216 ! 180. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7220 ! 181. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7222 ! 182. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7286 ! 183. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7442 ! 184. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7445 ! 185. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&pr=7291 ! 186. mailto:gnu@gnu.org ! 187. http://www.gnu.org/home.html#ContactInfo ! 188. http://gcc.gnu.org/about.html ! 189. mailto:gcc@gnu.org ! 190. mailto:gcc@gcc.gnu.org ! 191. mailto:gnu@gnu.org ! 192. http://validator.w3.org/check/referer ====================================================================== http://gcc.gnu.org/gcc-3.1/index.html *************** http://gcc.gnu.org/gcc-3.1/index.html *** 576,582 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [17]Valid XHTML 1.0 References --- 824,830 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [17]Valid XHTML 1.0 References *************** References *** 600,606 **** ====================================================================== http://gcc.gnu.org/gcc-3.1/changes.html ! GCC 3.1 Release Series -- Changes, New Features, and Fixes Additional changes in GCC 3.1.1 --- 848,855 ---- ====================================================================== http://gcc.gnu.org/gcc-3.1/changes.html ! GCC 3.1 Release Series ! Changes, New Features, and Fixes Additional changes in GCC 3.1.1 *************** Documentation improvements *** 939,945 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-01-28 [25]Valid XHTML 1.0 References --- 1188,1194 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-03-21 [25]Valid XHTML 1.0 References *************** Previous 3.0.x Releases *** 1028,1034 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [17]Valid XHTML 1.0 References --- 1277,1283 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [17]Valid XHTML 1.0 References *************** Other significant improvements *** 1229,1235 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-01-04 [20]Valid XHTML 1.0 References --- 1478,1484 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [20]Valid XHTML 1.0 References *************** http://gcc.gnu.org/gcc-3.0/caveats.html *** 1308,1314 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [10]Valid XHTML 1.0 References --- 1557,1563 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [10]Valid XHTML 1.0 References *************** http://gcc.gnu.org/gcc-2.95/index.html *** 1387,1393 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [19]Valid XHTML 1.0 References --- 1636,1642 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [19]Valid XHTML 1.0 References *************** Additional Changes in GCC 2.95.3 *** 1662,1668 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-12-30 [23]Valid XHTML 1.0 References --- 1911,1917 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [23]Valid XHTML 1.0 References *************** http://gcc.gnu.org/gcc-2.95/caveats.html *** 1751,1757 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-12-30 [8]Valid XHTML 1.0 References --- 2000,2006 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [8]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.1/index.html *** 1978,1984 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-01-04 [17]Valid XHTML 1.0 References --- 2227,2233 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [17]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.1/features.htm *** 2053,2067 **** + Alpha port has been tuned for the EV6 processor and has an optimized expansion of memcpy/bzero. The Alpha port now uses the Haifa scheduler. ! + RS6000/PowerPC: EGCS 1.1 includes support for the Power64 ! architecture and aix4.3 support. The RS6000/PowerPC port now ! uses the Haifa scheduler. + x86: Alignment of static store data and jump targets is per Intel recommendations now. Various improvements throughout ! the x86 port to improve performance on Pentium processors. ! Conditional move support has been fixed and enabled for PPro ! processors. The x86 port also better supports 64bit ! operations now. + MIPS has improved multiply/multiply-add support and now includes mips16 ISA support. + M68k has many micro-optimizations and Coldfire fixes. --- 2302,2319 ---- + Alpha port has been tuned for the EV6 processor and has an optimized expansion of memcpy/bzero. The Alpha port now uses the Haifa scheduler. ! + RS6000/PowerPC: support for the Power64 architecture and AIX ! 4.3. The RS6000/PowerPC port now uses the Haifa scheduler. + x86: Alignment of static store data and jump targets is per Intel recommendations now. Various improvements throughout ! the x86 port to improve performance on Pentium processors ! (including improved epilogue sequences for Pentium chips and ! backend improvements which should help register allocation on ! all x86 variants. Conditional move support has been fixed and ! enabled for PPro processors. The x86 port also better ! supports 64bit operations now. Unixware 7, a System V Release ! 5 target, is now supported and SCO OpenServer targets can ! support GAS. + MIPS has improved multiply/multiply-add support and now includes mips16 ISA support. + M68k has many micro-optimizations and Coldfire fixes. *************** http://gcc.gnu.org/egcs-1.1/features.htm *** 2085,2091 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [12]Valid XHTML 1.0 References --- 2337,2343 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-03-29 [12]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.1/caveats.html *** 2146,2152 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-12-30 [7]Valid XHTML 1.0 References --- 2398,2404 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [7]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/egcs-1.0.3.h *** 2250,2256 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [12]Valid XHTML 1.0 References --- 2502,2508 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [12]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/egcs-1.0.2.h *** 2390,2396 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-01-04 [12]Valid XHTML 1.0 References --- 2642,2648 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [12]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/egcs-1.0.1.h *** 2530,2536 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [12]Valid XHTML 1.0 References --- 2782,2788 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [12]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/egcs-1.0.htm *** 2627,2633 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [12]Valid XHTML 1.0 References --- 2879,2885 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [12]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/features.htm *** 2701,2707 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-11-11 [9]Valid XHTML 1.0 References --- 2953,2959 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [9]Valid XHTML 1.0 References *************** http://gcc.gnu.org/egcs-1.0/caveats.html *** 2761,2767 **** Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2002-12-30 [7]Valid XHTML 1.0 References --- 3013,3019 ---- Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. ! Last modified 2003-02-21 [7]Valid XHTML 1.0 References diff -Nrc3pad gcc-3.2.2/gcc/ada/ChangeLog gcc-3.2.3/gcc/ada/ChangeLog *** gcc-3.2.2/gcc/ada/ChangeLog Wed Feb 5 03:00:25 2003 --- gcc-3.2.3/gcc/ada/ChangeLog Tue Apr 22 06:14:27 2003 *************** *** 1,3 **** --- 1,15 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-03-31 Geert Bosch + + * link.c : Fix misspelled "const" keyword + + 2003-02-05 Gabriel Dos Reis + + * gnatvsn.ads: Bump version. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/ada/Make-lang.in gcc-3.2.3/gcc/ada/Make-lang.in *** gcc-3.2.2/gcc/ada/Make-lang.in Wed Jan 29 17:34:08 2003 --- gcc-3.2.3/gcc/ada/Make-lang.in Fri Feb 14 17:51:45 2003 *************** cross-gnattools: force *** 153,159 **** gnatbl$(exeext) gnatchop$(exeext) gnatcmd$(exeext) \ gnatkr$(exeext) gnatlink$(exeext) \ gnatls$(exeext) gnatmake$(exeext) \ ! gnatprep$(exeext) \ gnatxref$(exeext) gnatfind$(exeext) $(EXTRA_GNATTOOLS) # use target-gcc --- 153,159 ---- gnatbl$(exeext) gnatchop$(exeext) gnatcmd$(exeext) \ gnatkr$(exeext) gnatlink$(exeext) \ gnatls$(exeext) gnatmake$(exeext) \ ! gnatprep$(exeext) gnatpsta$(exeext) gnatpsys$(exeext) \ gnatxref$(exeext) gnatfind$(exeext) $(EXTRA_GNATTOOLS) # use target-gcc diff -Nrc3pad gcc-3.2.2/gcc/ada/Makefile.in gcc-3.2.3/gcc/ada/Makefile.in *** gcc-3.2.2/gcc/ada/Makefile.in Wed Jan 29 17:34:08 2003 --- gcc-3.2.3/gcc/ada/Makefile.in Fri Mar 28 10:38:19 2003 *************** s-taskin.o: s-taskin.adb s-taskin.ads *** 1279,1285 **** $(ADAC) -c $(ALL_ADAFLAGS) $(FORCE_DEBUG_ADAFLAGS) $(ADA_INCLUDES) $< endif ! ifeq ($(strip $(filter-out hppa% hp hpux%,$(targ))),) LIBGNAT_TARGET_PAIRS = \ a-intnam.ads<4hintnam.ads \ s-inmaop.adb<7sinmaop.adb \ --- 1279,1303 ---- $(ADAC) -c $(ALL_ADAFLAGS) $(FORCE_DEBUG_ADAFLAGS) $(ADA_INCLUDES) $< endif ! ifeq ($(strip $(filter-out hppa% hp hpux10%,$(targ))),) ! LIBGNAT_TARGET_PAIRS = \ ! a-excpol.adb<4wexcpol.adb \ ! a-intnam.ads<4hintnam.ads \ ! s-inmaop.adb<7sinmaop.adb \ ! s-interr.adb<5ginterr.adb \ ! s-intman.adb<7sintman.adb \ ! s-osinte.adb<5hosinte.adb \ ! s-osinte.ads<5hosinte.ads \ ! s-parame.ads<5hparame.ads \ ! s-osprim.adb<7sosprim.adb \ ! s-taprop.adb<5htaprop.adb \ ! s-taspri.ads<5htaspri.ads \ ! s-tpopsp.adb<7stpopsp.adb \ ! g-soccon.ads<3hsoccon.ads \ ! system.ads<5hsystem.ads ! endif ! ! ifeq ($(strip $(filter-out hppa% hp hpux11%,$(targ))),) LIBGNAT_TARGET_PAIRS = \ a-intnam.ads<4hintnam.ads \ s-inmaop.adb<7sinmaop.adb \ *************** gnatlib: ../stamp-gnatlib1 ../stamp-gnat *** 2181,2187 **** # ../xgcc -B../ -dD -E ../tconfig.h $(INCLUDES) > rts/tconfig.h $(MAKE) -C rts CC="../../xgcc -B../../" \ INCLUDES="$(INCLUDES_FOR_SUBDIR) -I./../.." \ ! CFLAGS="$(GNATLIBCFLAGS) $(LIBGCC2_CFLAGS) -DIN_RTS" \ ADA_CFLAGS="$(GNATLIBCFLAGS)" \ srcdir=$(fsrcdir) \ -f ../Makefile $(LIBGNAT_OBJS) --- 2199,2205 ---- # ../xgcc -B../ -dD -E ../tconfig.h $(INCLUDES) > rts/tconfig.h $(MAKE) -C rts CC="../../xgcc -B../../" \ INCLUDES="$(INCLUDES_FOR_SUBDIR) -I./../.." \ ! CFLAGS="$(GNATLIBCFLAGS) $(TARGET_LIBGCC2_CFLAGS) -DIN_RTS" \ ADA_CFLAGS="$(GNATLIBCFLAGS)" \ srcdir=$(fsrcdir) \ -f ../Makefile $(LIBGNAT_OBJS) *************** ravenppclib: *** 2279,2292 **** gnatlib-shared-default: $(MAKE) $(FLAGS_TO_PASS) \ GNATLIBFLAGS="$(GNATLIBFLAGS)" \ ! GNATLIBCFLAGS="$(GNATLIBCFLAGS) $(LIBGCC2_CFLAGS)" \ THREAD_KIND="$(THREAD_KIND)" \ gnatlib $(RM) rts/libgnat$(soext) rts/libgnarl$(soext) ! cd rts; ../../xgcc -B../../ -shared $(LIBGCC2_CFLAGS) \ -o libgnat-$(LIBRARY_VERSION)$(soext) $(SO_OPTS)libgnat-$(LIBRARY_VERSION)$(soext) \ $(GNATRTL_NONTASKING_OBJS) $(LIBGNAT_OBJS) $(MISCLIB) -lm ! cd rts; ../../xgcc -B../../ -shared $(LIBGCC2_CFLAGS) \ -o libgnarl-$(LIBRARY_VERSION)$(soext) $(SO_OPTS)libgnarl-$(LIBRARY_VERSION)$(soext) \ $(GNATRTL_TASKING_OBJS) $(THREADSLIB) cd rts; $(LN) libgnat-$(LIBRARY_VERSION)$(soext) libgnat$(soext) --- 2297,2310 ---- gnatlib-shared-default: $(MAKE) $(FLAGS_TO_PASS) \ GNATLIBFLAGS="$(GNATLIBFLAGS)" \ ! GNATLIBCFLAGS="$(GNATLIBCFLAGS) $(TARGET_LIBGCC2_CFLAGS)" \ THREAD_KIND="$(THREAD_KIND)" \ gnatlib $(RM) rts/libgnat$(soext) rts/libgnarl$(soext) ! cd rts; ../../xgcc -B../../ -shared $(TARGET_LIBGCC2_CFLAGS) \ -o libgnat-$(LIBRARY_VERSION)$(soext) $(SO_OPTS)libgnat-$(LIBRARY_VERSION)$(soext) \ $(GNATRTL_NONTASKING_OBJS) $(LIBGNAT_OBJS) $(MISCLIB) -lm ! cd rts; ../../xgcc -B../../ -shared $(TARGET_LIBGCC2_CFLAGS) \ -o libgnarl-$(LIBRARY_VERSION)$(soext) $(SO_OPTS)libgnarl-$(LIBRARY_VERSION)$(soext) \ $(GNATRTL_TASKING_OBJS) $(THREADSLIB) cd rts; $(LN) libgnat-$(LIBRARY_VERSION)$(soext) libgnat$(soext) diff -Nrc3pad gcc-3.2.2/gcc/ada/gnatvsn.ads gcc-3.2.3/gcc/ada/gnatvsn.ads *** gcc-3.2.2/gcc/ada/gnatvsn.ads Wed Feb 5 03:02:29 2003 --- gcc-3.2.3/gcc/ada/gnatvsn.ads Tue Apr 22 06:16:06 2003 *************** *** 6,14 **** -- -- -- S p e c -- -- -- ! -- $Revision: 1.2.12.65.2.198 $ -- -- ! -- Copyright (C) 1992-2002 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- --- 6,14 ---- -- -- -- S p e c -- -- -- ! -- $Revision: 1.2.12.65.2.276 $ -- -- ! -- Copyright (C) 1992-2003 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- *************** *** 38,44 **** package Gnatvsn is ! Gnat_Version_String : constant String := "3.2.2 20030205 (release)"; -- Version output when GNAT (compiler), or its related tools, including -- GNATBIND, GNATCHOP, GNATFIND, GNATLINK, GNATMAKE, GNATXREF, are run -- (with appropriate verbose option switch set). --- 38,44 ---- package Gnatvsn is ! Gnat_Version_String : constant String := "3.2.3 20030422 (release)"; -- Version output when GNAT (compiler), or its related tools, including -- GNATBIND, GNATCHOP, GNATFIND, GNATLINK, GNATMAKE, GNATXREF, are run -- (with appropriate verbose option switch set). diff -Nrc3pad gcc-3.2.2/gcc/ada/link.c gcc-3.2.3/gcc/ada/link.c *** gcc-3.2.2/gcc/ada/link.c Sat May 4 03:28:18 2002 --- gcc-3.2.3/gcc/ada/link.c Mon Mar 31 21:07:56 2003 *************** *** 4,10 **** * * * L I N K * * * ! * $Revision: 1.1.16.1 $ * * * C Implementation File * * * --- 4,10 ---- * * * L I N K * * * ! * $Revision: 1.1.16.1.4.1 $ * * * C Implementation File * * * *************** const char *object_library_extension = " *** 133,139 **** const char *object_file_option = "-Wl,-f,"; const char *run_path_option = ""; int link_max = 15000; ! cnonst unsigned char objlist_file_supported = 1; char shared_libgnat_default = STATIC; unsigned char using_gnu_linker = 0; const char *object_library_extension = ".a"; --- 133,139 ---- const char *object_file_option = "-Wl,-f,"; const char *run_path_option = ""; int link_max = 15000; ! const unsigned char objlist_file_supported = 1; char shared_libgnat_default = STATIC; unsigned char using_gnu_linker = 0; const char *object_library_extension = ".a"; diff -Nrc3pad gcc-3.2.2/gcc/bb-reorder.c gcc-3.2.3/gcc/bb-reorder.c *** gcc-3.2.2/gcc/bb-reorder.c Mon Jul 15 16:19:38 2002 --- gcc-3.2.3/gcc/bb-reorder.c Thu Feb 20 20:10:57 2003 *************** make_reorder_chain_1 (bb, prev) *** 205,211 **** e_taken = e; } ! next = (taken ? e_taken : e_fall)->dest; } /* In the absence of a prediction, disturb things as little as possible --- 205,211 ---- e_taken = e; } ! next = ((taken && e_taken) ? e_taken : e_fall)->dest; } /* In the absence of a prediction, disturb things as little as possible diff -Nrc3pad gcc-3.2.2/gcc/builtins.c gcc-3.2.3/gcc/builtins.c *** gcc-3.2.2/gcc/builtins.c Sun Dec 1 18:19:08 2002 --- gcc-3.2.3/gcc/builtins.c Sun Mar 30 04:42:16 2003 *************** expand_builtin_fputs (arglist, ignore, u *** 3385,3392 **** /* FALLTHROUGH */ case 1: /* length is greater than 1, call fwrite. */ { ! tree string_arg = TREE_VALUE (arglist); /* New argument list transforming fputs(string, stream) to fwrite(string, 1, len, stream). */ arglist = build_tree_list (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist))); --- 3385,3396 ---- /* FALLTHROUGH */ case 1: /* length is greater than 1, call fwrite. */ { ! tree string_arg; + /* If optimizing for size keep fputs. */ + if (optimize_size) + return 0; + string_arg = TREE_VALUE (arglist); /* New argument list transforming fputs(string, stream) to fwrite(string, 1, len, stream). */ arglist = build_tree_list (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist))); *************** expand_builtin (exp, target, subtarget, *** 3599,3604 **** --- 3603,3611 ---- tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0); tree arglist = TREE_OPERAND (exp, 1); enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); + + /* Perform postincrements before expanding builtin functions.  */ + emit_queue (); if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) return (*targetm.expand_builtin) (exp, target, subtarget, mode, ignore); diff -Nrc3pad gcc-3.2.2/gcc/c-decl.c gcc-3.2.3/gcc/c-decl.c *** gcc-3.2.2/gcc/c-decl.c Sat Nov 23 08:20:02 2002 --- gcc-3.2.3/gcc/c-decl.c Wed Mar 12 10:04:51 2003 *************** duplicate_decls (newdecl, olddecl, diffe *** 1665,1670 **** --- 1665,1677 ---- } } error_with_decl (olddecl, "previous declaration of `%s'"); + + /* This is safer because the initializer might contain references + to variables that were declared between olddecl and newdecl. This + will make the initializer invalid for olddecl in case it gets + assigned to olddecl below. */ + if (TREE_CODE (newdecl) == VAR_DECL) + DECL_INITIAL (newdecl) = 0; } else { diff -Nrc3pad gcc-3.2.2/gcc/c-parse.c gcc-3.2.3/gcc/c-parse.c *** gcc-3.2.2/gcc/c-parse.c Wed Feb 5 03:10:41 2003 --- gcc-3.2.3/gcc/c-parse.c Tue Apr 22 07:00:33 2003 *************** *** 1,75 **** ! /* A Bison parser, made from c-parse.y ! by GNU bison 1.33. */ ! #define YYBISON 1 /* Identify Bison output. */ ! # define IDENTIFIER 257 ! # define TYPENAME 258 ! # define SCSPEC 259 ! # define TYPESPEC 260 ! # define TYPE_QUAL 261 ! # define CONSTANT 262 ! # define STRING 263 ! # define ELLIPSIS 264 ! # define SIZEOF 265 ! # define ENUM 266 ! # define STRUCT 267 ! # define UNION 268 ! # define IF 269 ! # define ELSE 270 ! # define WHILE 271 ! # define DO 272 ! # define FOR 273 ! # define SWITCH 274 ! # define CASE 275 ! # define DEFAULT 276 ! # define BREAK 277 ! # define CONTINUE 278 ! # define RETURN 279 ! # define GOTO 280 ! # define ASM_KEYWORD 281 ! # define TYPEOF 282 ! # define ALIGNOF 283 ! # define ATTRIBUTE 284 ! # define EXTENSION 285 ! # define LABEL 286 ! # define REALPART 287 ! # define IMAGPART 288 ! # define VA_ARG 289 ! # define CHOOSE_EXPR 290 ! # define TYPES_COMPATIBLE_P 291 ! # define PTR_VALUE 292 ! # define PTR_BASE 293 ! # define PTR_EXTENT 294 ! # define STRING_FUNC_NAME 295 ! # define VAR_FUNC_NAME 296 ! # define ASSIGN 297 ! # define OROR 298 ! # define ANDAND 299 ! # define EQCOMPARE 300 ! # define ARITHCOMPARE 301 ! # define LSHIFT 302 ! # define RSHIFT 303 ! # define UNARY 304 ! # define PLUSPLUS 305 ! # define MINUSMINUS 306 ! # define HYPERUNARY 307 ! # define POINTSAT 308 ! # define INTERFACE 309 ! # define IMPLEMENTATION 310 ! # define END 311 ! # define SELECTOR 312 ! # define DEFS 313 ! # define ENCODE 314 ! # define CLASSNAME 315 ! # define PUBLIC 316 ! # define PRIVATE 317 ! # define PROTECTED 318 ! # define PROTOCOL 319 ! # define OBJECTNAME 320 ! # define CLASS 321 ! # define ALIAS 322 #line 34 "c-parse.y" #include "config.h" --- 1,197 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 ! ! /* Skeleton name. */ ! #define YYSKELETON_NAME "yacc.c" ! ! /* Pure parsers. */ ! #define YYPURE 0 ! ! /* Using locations. */ ! #define YYLSP_NEEDED 0 ! ! ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! IDENTIFIER = 258, ! TYPENAME = 259, ! SCSPEC = 260, ! TYPESPEC = 261, ! TYPE_QUAL = 262, ! CONSTANT = 263, ! STRING = 264, ! ELLIPSIS = 265, ! SIZEOF = 266, ! ENUM = 267, ! STRUCT = 268, ! UNION = 269, ! IF = 270, ! ELSE = 271, ! WHILE = 272, ! DO = 273, ! FOR = 274, ! SWITCH = 275, ! CASE = 276, ! DEFAULT = 277, ! BREAK = 278, ! CONTINUE = 279, ! RETURN = 280, ! GOTO = 281, ! ASM_KEYWORD = 282, ! TYPEOF = 283, ! ALIGNOF = 284, ! ATTRIBUTE = 285, ! EXTENSION = 286, ! LABEL = 287, ! REALPART = 288, ! IMAGPART = 289, ! VA_ARG = 290, ! CHOOSE_EXPR = 291, ! TYPES_COMPATIBLE_P = 292, ! PTR_VALUE = 293, ! PTR_BASE = 294, ! PTR_EXTENT = 295, ! STRING_FUNC_NAME = 296, ! VAR_FUNC_NAME = 297, ! ASSIGN = 298, ! OROR = 299, ! ANDAND = 300, ! EQCOMPARE = 301, ! ARITHCOMPARE = 302, ! RSHIFT = 303, ! LSHIFT = 304, ! MINUSMINUS = 305, ! PLUSPLUS = 306, ! UNARY = 307, ! HYPERUNARY = 308, ! POINTSAT = 309, ! INTERFACE = 310, ! IMPLEMENTATION = 311, ! END = 312, ! SELECTOR = 313, ! DEFS = 314, ! ENCODE = 315, ! CLASSNAME = 316, ! PUBLIC = 317, ! PRIVATE = 318, ! PROTECTED = 319, ! PROTOCOL = 320, ! OBJECTNAME = 321, ! CLASS = 322, ! ALIAS = 323 ! }; ! #endif ! #define IDENTIFIER 258 ! #define TYPENAME 259 ! #define SCSPEC 260 ! #define TYPESPEC 261 ! #define TYPE_QUAL 262 ! #define CONSTANT 263 ! #define STRING 264 ! #define ELLIPSIS 265 ! #define SIZEOF 266 ! #define ENUM 267 ! #define STRUCT 268 ! #define UNION 269 ! #define IF 270 ! #define ELSE 271 ! #define WHILE 272 ! #define DO 273 ! #define FOR 274 ! #define SWITCH 275 ! #define CASE 276 ! #define DEFAULT 277 ! #define BREAK 278 ! #define CONTINUE 279 ! #define RETURN 280 ! #define GOTO 281 ! #define ASM_KEYWORD 282 ! #define TYPEOF 283 ! #define ALIGNOF 284 ! #define ATTRIBUTE 285 ! #define EXTENSION 286 ! #define LABEL 287 ! #define REALPART 288 ! #define IMAGPART 289 ! #define VA_ARG 290 ! #define CHOOSE_EXPR 291 ! #define TYPES_COMPATIBLE_P 292 ! #define PTR_VALUE 293 ! #define PTR_BASE 294 ! #define PTR_EXTENT 295 ! #define STRING_FUNC_NAME 296 ! #define VAR_FUNC_NAME 297 ! #define ASSIGN 298 ! #define OROR 299 ! #define ANDAND 300 ! #define EQCOMPARE 301 ! #define ARITHCOMPARE 302 ! #define RSHIFT 303 ! #define LSHIFT 304 ! #define MINUSMINUS 305 ! #define PLUSPLUS 306 ! #define UNARY 307 ! #define HYPERUNARY 308 ! #define POINTSAT 309 ! #define INTERFACE 310 ! #define IMPLEMENTATION 311 ! #define END 312 ! #define SELECTOR 313 ! #define DEFS 314 ! #define ENCODE 315 ! #define CLASSNAME 316 ! #define PUBLIC 317 ! #define PRIVATE 318 ! #define PROTECTED 319 ! #define PROTOCOL 320 ! #define OBJECTNAME 321 ! #define CLASS 322 ! #define ALIAS 323 + + + + /* Copy the first part of user declarations. */ #line 34 "c-parse.y" #include "config.h" *************** *** 101,112 **** /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 #line 67 "c-parse.y" ! #ifndef YYSTYPE ! typedef union {long itype; tree ttype; enum tree_code code; ! const char *filename; int lineno; } yystype; ! # define YYSTYPE yystype #endif #line 200 "c-parse.y" /* Number of statements (loosely speaking) and compound statements --- 223,256 ---- /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 + + /* Enabling traces. */ + #ifndef YYDEBUG + # define YYDEBUG 0 + #endif + + /* Enabling verbose error messages. */ + #ifdef YYERROR_VERBOSE + # undef YYERROR_VERBOSE + # define YYERROR_VERBOSE 1 + #else + # define YYERROR_VERBOSE 0 + #endif + + #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) #line 67 "c-parse.y" ! typedef union YYSTYPE {long itype; tree ttype; enum tree_code code; ! const char *filename; int lineno; } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 245 "c-p10602.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif + + + + /* Copy the second part of user declarations. */ #line 200 "c-parse.y" /* Number of statements (loosely speaking) and compound statements *************** c_parse_init () *** 191,222 **** ggc_add_tree_root (&all_prefix_attributes, 1); } ! #ifndef YYDEBUG ! # define YYDEBUG 0 #endif ! #define YYFINAL 901 ! #define YYFLAG -32768 ! #define YYNTBASE 91 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 322 ? yytranslate[x] : 290) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 87, 2, 2, 2, 60, 51, 2, ! 67, 83, 58, 56, 88, 57, 66, 59, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 46, 84, ! 2, 44, 2, 45, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 68, 2, 90, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 89, 49, 85, 86, 2, 2, 2, --- 335,473 ---- ggc_add_tree_root (&all_prefix_attributes, 1); } ! ! ! /* Line 214 of yacc.c. */ ! #line 341 "c-p10602.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! #endif + #if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; + #else + typedef short yysigned_char; + #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 4 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 3173 ! /* YYNTOKENS -- Number of terminals. */ ! #define YYNTOKENS 91 ! /* YYNNTS -- Number of nonterminals. */ ! #define YYNNTS 200 ! /* YYNRULES -- Number of rules. */ ! #define YYNRULES 561 ! /* YYNRULES -- Number of states. */ ! #define YYNSTATES 901 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 323 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 87, 2, 2, 2, 60, 51, 2, ! 66, 83, 58, 56, 88, 57, 65, 59, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 46, 84, ! 2, 43, 2, 45, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 67, 2, 90, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 89, 49, 85, 86, 2, 2, 2, *************** static const char yytranslate[] = *** 232,590 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, ! 36, 37, 38, 39, 40, 41, 42, 43, 47, 48, ! 52, 53, 54, 55, 61, 62, 63, 64, 65, 69, ! 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 1, 3, 4, 7, 8, 12, 14, 16, ! 22, 25, 29, 34, 39, 42, 45, 48, 50, 51, ! 52, 62, 67, 68, 69, 79, 84, 85, 86, 95, ! 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, ! 119, 120, 122, 124, 128, 130, 133, 136, 139, 142, ! 145, 150, 153, 158, 161, 164, 166, 168, 170, 172, ! 177, 179, 183, 187, 191, 195, 199, 203, 207, 211, ! 215, 219, 223, 227, 228, 233, 234, 239, 240, 241, ! 249, 250, 256, 260, 264, 266, 268, 270, 272, 273, ! 281, 285, 289, 293, 297, 302, 309, 318, 325, 330, ! 334, 338, 341, 344, 346, 349, 350, 352, 355, 359, ! 361, 363, 366, 369, 374, 379, 382, 385, 389, 390, ! 392, 397, 402, 406, 410, 413, 416, 418, 421, 424, ! 427, 430, 433, 435, 438, 440, 443, 446, 449, 452, ! 455, 458, 460, 463, 466, 469, 472, 475, 478, 481, ! 484, 487, 490, 493, 496, 499, 502, 505, 508, 510, 513, 516, 519, 522, 525, 528, 531, 534, 537, 540, 543, 546, 549, 552, 555, 558, 561, 564, 567, 570, 573, 576, 579, 582, 585, 588, 591, 594, 597, 600, 603, 606, 609, 612, 615, 618, 621, 624, 627, 630, ! 633, 636, 639, 642, 644, 646, 648, 650, 652, 654, ! 656, 658, 660, 662, 664, 666, 668, 670, 672, 674, ! 676, 678, 680, 682, 684, 686, 688, 690, 692, 694, ! 696, 698, 700, 702, 704, 706, 708, 710, 712, 714, ! 716, 718, 720, 722, 724, 726, 728, 730, 732, 734, ! 736, 738, 740, 742, 744, 746, 748, 750, 752, 754, ! 755, 757, 759, 761, 763, 765, 767, 769, 771, 776, ! 781, 783, 788, 790, 795, 796, 801, 802, 809, 813, ! 814, 821, 825, 826, 828, 830, 833, 840, 842, 846, ! 847, 849, 854, 861, 866, 868, 870, 872, 874, 876, ! 877, 882, 884, 885, 888, 890, 894, 898, 901, 902, ! 907, 909, 910, 915, 917, 919, 921, 924, 927, 933, ! 937, 938, 939, 947, 948, 949, 957, 959, 961, 966, ! 970, 973, 977, 979, 981, 983, 987, 990, 992, 996, ! 999, 1003, 1007, 1012, 1016, 1021, 1025, 1028, 1030, 1032, ! 1035, 1037, 1040, 1042, 1045, 1046, 1054, 1060, 1061, 1069, ! 1075, 1076, 1085, 1086, 1094, 1097, 1100, 1103, 1104, 1106, ! 1107, 1109, 1111, 1114, 1115, 1119, 1122, 1126, 1131, 1135, ! 1137, 1139, 1142, 1144, 1149, 1151, 1156, 1161, 1168, 1174, ! 1179, 1186, 1192, 1194, 1198, 1200, 1202, 1206, 1207, 1211, ! 1212, 1214, 1215, 1217, 1220, 1222, 1224, 1226, 1230, 1233, ! 1237, 1242, 1246, 1249, 1252, 1254, 1258, 1263, 1266, 1270, ! 1274, 1279, 1284, 1290, 1296, 1298, 1300, 1302, 1304, 1306, ! 1309, 1312, 1315, 1318, 1320, 1323, 1326, 1329, 1331, 1334, ! 1337, 1340, 1343, 1345, 1348, 1350, 1352, 1354, 1356, 1359, ! 1360, 1361, 1362, 1363, 1364, 1366, 1368, 1371, 1375, 1377, ! 1380, 1382, 1384, 1390, 1392, 1394, 1397, 1400, 1403, 1406, ! 1407, 1413, 1414, 1419, 1420, 1421, 1423, 1426, 1430, 1434, ! 1438, 1439, 1444, 1446, 1450, 1451, 1452, 1460, 1466, 1469, ! 1470, 1471, 1472, 1473, 1486, 1487, 1494, 1497, 1499, 1501, ! 1504, 1508, 1511, 1514, 1517, 1521, 1528, 1537, 1548, 1561, ! 1565, 1570, 1572, 1576, 1582, 1585, 1591, 1592, 1594, 1595, ! 1597, 1598, 1600, 1602, 1606, 1611, 1619, 1621, 1625, 1626, ! 1630, 1633, 1634, 1635, 1642, 1645, 1646, 1648, 1650, 1654, ! 1656, 1660, 1665, 1670, 1674, 1679, 1683, 1688, 1693, 1697, ! 1702, 1706, 1708, 1709, 1713, 1715, 1718, 1720, 1724, 1726, ! 1730 }; static const short yyrhs[] = { ! -1, 92, 0, 0, 93, 95, 0, 0, 92, 94, ! 95, 0, 97, 0, 96, 0, 27, 67, 106, 83, ! 84, 0, 289, 95, 0, 128, 162, 84, 0, 148, ! 128, 162, 84, 0, 147, 128, 161, 84, 0, 154, ! 84, 0, 1, 84, 0, 1, 85, 0, 84, 0, ! 0, 0, 147, 128, 190, 98, 123, 99, 250, 251, ! 239, 0, 147, 128, 190, 1, 0, 0, 0, 148, ! 128, 195, 100, 123, 101, 250, 251, 239, 0, 148, ! 128, 195, 1, 0, 0, 0, 128, 195, 102, 123, ! 103, 250, 251, 239, 0, 128, 195, 1, 0, 3, ! 0, 4, 0, 51, 0, 57, 0, 56, 0, 62, ! 0, 63, 0, 86, 0, 87, 0, 108, 0, 0, ! 108, 0, 114, 0, 108, 88, 114, 0, 120, 0, ! 58, 113, 0, 289, 113, 0, 105, 113, 0, 48, ! 104, 0, 110, 109, 0, 110, 67, 216, 83, 0, ! 111, 109, 0, 111, 67, 216, 83, 0, 33, 113, ! 0, 34, 113, 0, 11, 0, 29, 0, 28, 0, ! 109, 0, 67, 216, 83, 113, 0, 113, 0, 114, ! 56, 114, 0, 114, 57, 114, 0, 114, 58, 114, ! 0, 114, 59, 114, 0, 114, 60, 114, 0, 114, ! 54, 114, 0, 114, 55, 114, 0, 114, 53, 114, ! 0, 114, 52, 114, 0, 114, 51, 114, 0, 114, ! 49, 114, 0, 114, 50, 114, 0, 0, 114, 48, ! 115, 114, 0, 0, 114, 47, 116, 114, 0, 0, ! 0, 114, 45, 117, 106, 46, 118, 114, 0, 0, ! 114, 45, 119, 46, 114, 0, 114, 44, 114, 0, ! 114, 43, 114, 0, 3, 0, 8, 0, 122, 0, ! 42, 0, 0, 67, 216, 83, 89, 121, 176, 85, ! 0, 67, 106, 83, 0, 67, 1, 83, 0, 243, ! 241, 83, 0, 243, 1, 83, 0, 120, 67, 107, ! 83, 0, 35, 67, 114, 88, 216, 83, 0, 36, ! 67, 114, 88, 114, 88, 114, 83, 0, 37, 67, ! 216, 88, 216, 83, 0, 120, 68, 106, 90, 0, ! 120, 66, 104, 0, 120, 65, 104, 0, 120, 62, ! 0, 120, 63, 0, 9, 0, 122, 9, 0, 0, ! 125, 0, 125, 10, 0, 250, 251, 126, 0, 124, ! 0, 231, 0, 125, 124, 0, 124, 231, 0, 149, ! 128, 161, 84, 0, 150, 128, 162, 84, 0, 149, ! 84, 0, 150, 84, 0, 250, 251, 130, 0, 0, ! 168, 0, 147, 128, 161, 84, 0, 148, 128, 162, ! 84, 0, 147, 128, 184, 0, 148, 128, 187, 0, ! 154, 84, 0, 289, 130, 0, 7, 0, 131, 7, ! 0, 132, 7, 0, 131, 169, 0, 133, 7, 0, ! 134, 7, 0, 169, 0, 133, 169, 0, 156, 0, ! 135, 7, 0, 136, 7, 0, 135, 158, 0, 136, ! 158, 0, 131, 156, 0, 132, 156, 0, 157, 0, ! 135, 169, 0, 135, 159, 0, 136, 159, 0, 131, ! 157, 0, 132, 157, 0, 137, 7, 0, 138, 7, ! 0, 137, 158, 0, 138, 158, 0, 133, 156, 0, ! 134, 156, 0, 137, 169, 0, 137, 159, 0, 138, ! 159, 0, 133, 157, 0, 134, 157, 0, 5, 0, ! 139, 7, 0, 140, 7, 0, 131, 5, 0, 132, ! 5, 0, 139, 5, 0, 140, 5, 0, 139, 169, ! 0, 141, 7, 0, 142, 7, 0, 133, 5, 0, ! 134, 5, 0, 141, 5, 0, 142, 5, 0, 141, ! 169, 0, 143, 7, 0, 144, 7, 0, 143, 158, ! 0, 144, 158, 0, 139, 156, 0, 140, 156, 0, ! 135, 5, 0, 136, 5, 0, 143, 5, 0, 144, ! 5, 0, 143, 169, 0, 143, 159, 0, 144, 159, ! 0, 139, 157, 0, 140, 157, 0, 145, 7, 0, ! 146, 7, 0, 145, 158, 0, 146, 158, 0, 141, ! 156, 0, 142, 156, 0, 137, 5, 0, 138, 5, ! 0, 145, 5, 0, 146, 5, 0, 145, 169, 0, ! 145, 159, 0, 146, 159, 0, 141, 157, 0, 142, ! 157, 0, 135, 0, 136, 0, 137, 0, 138, 0, ! 143, 0, 144, 0, 145, 0, 146, 0, 131, 0, ! 132, 0, 133, 0, 134, 0, 139, 0, 140, 0, ! 141, 0, 142, 0, 135, 0, 136, 0, 143, 0, ! 144, 0, 131, 0, 132, 0, 139, 0, 140, 0, ! 135, 0, 136, 0, 137, 0, 138, 0, 131, 0, ! 132, 0, 133, 0, 134, 0, 135, 0, 136, 0, ! 137, 0, 138, 0, 131, 0, 132, 0, 133, 0, ! 134, 0, 131, 0, 132, 0, 133, 0, 134, 0, ! 135, 0, 136, 0, 137, 0, 138, 0, 139, 0, ! 140, 0, 141, 0, 142, 0, 143, 0, 144, 0, ! 145, 0, 146, 0, 0, 152, 0, 158, 0, 160, ! 0, 159, 0, 6, 0, 204, 0, 199, 0, 4, ! 0, 112, 67, 106, 83, 0, 112, 67, 216, 83, ! 0, 164, 0, 161, 88, 129, 164, 0, 166, 0, ! 162, 88, 129, 166, 0, 0, 27, 67, 122, 83, ! 0, 0, 190, 163, 168, 44, 165, 174, 0, 190, ! 163, 168, 0, 0, 195, 163, 168, 44, 167, 174, ! 0, 195, 163, 168, 0, 0, 169, 0, 170, 0, ! 169, 170, 0, 30, 67, 67, 171, 83, 83, 0, ! 172, 0, 171, 88, 172, 0, 0, 173, 0, 173, ! 67, 3, 83, 0, 173, 67, 3, 88, 108, 83, ! 0, 173, 67, 107, 83, 0, 104, 0, 5, 0, ! 6, 0, 7, 0, 114, 0, 0, 89, 175, 176, ! 85, 0, 1, 0, 0, 177, 205, 0, 178, 0, ! 177, 88, 178, 0, 182, 44, 180, 0, 183, 180, ! 0, 0, 104, 46, 179, 180, 0, 180, 0, 0, ! 89, 181, 176, 85, 0, 114, 0, 1, 0, 183, ! 0, 182, 183, 0, 66, 104, 0, 68, 114, 10, ! 114, 90, 0, 68, 114, 90, 0, 0, 0, 190, ! 185, 123, 186, 250, 251, 244, 0, 0, 0, 195, ! 188, 123, 189, 250, 251, 244, 0, 191, 0, 195, ! 0, 67, 168, 191, 83, 0, 191, 67, 284, 0, ! 191, 224, 0, 58, 155, 191, 0, 4, 0, 193, ! 0, 194, 0, 193, 67, 284, 0, 193, 224, 0, ! 4, 0, 194, 67, 284, 0, 194, 224, 0, 58, ! 155, 193, 0, 58, 155, 194, 0, 67, 168, 194, ! 83, 0, 195, 67, 284, 0, 67, 168, 195, 83, ! 0, 58, 155, 195, 0, 195, 224, 0, 3, 0, ! 13, 0, 13, 169, 0, 14, 0, 14, 169, 0, ! 12, 0, 12, 169, 0, 0, 196, 104, 89, 200, ! 207, 85, 168, 0, 196, 89, 207, 85, 168, 0, ! 0, 197, 104, 89, 201, 207, 85, 168, 0, 197, ! 89, 207, 85, 168, 0, 0, 198, 104, 89, 202, ! 214, 206, 85, 168, 0, 0, 198, 89, 203, 214, ! 206, 85, 168, 0, 196, 104, 0, 197, 104, 0, ! 198, 104, 0, 0, 88, 0, 0, 88, 0, 208, ! 0, 208, 209, 0, 0, 208, 209, 84, 0, 208, ! 84, 0, 151, 128, 210, 0, 151, 128, 250, 251, ! 0, 152, 128, 211, 0, 152, 0, 1, 0, 289, ! 209, 0, 212, 0, 210, 88, 129, 212, 0, 213, ! 0, 211, 88, 129, 213, 0, 250, 251, 190, 168, ! 0, 250, 251, 190, 46, 114, 168, 0, 250, 251, ! 46, 114, 168, 0, 250, 251, 195, 168, 0, 250, ! 251, 195, 46, 114, 168, 0, 250, 251, 46, 114, ! 168, 0, 215, 0, 214, 88, 215, 0, 1, 0, ! 104, 0, 104, 44, 114, 0, 0, 153, 217, 218, ! 0, 0, 220, 0, 0, 220, 0, 221, 169, 0, ! 222, 0, 221, 0, 223, 0, 58, 155, 221, 0, ! 58, 155, 0, 58, 155, 222, 0, 67, 168, 220, ! 83, 0, 223, 67, 274, 0, 223, 224, 0, 67, ! 274, 0, 224, 0, 68, 106, 90, 0, 68, 153, ! 106, 90, 0, 68, 90, 0, 68, 153, 90, 0, ! 68, 58, 90, 0, 68, 153, 58, 90, 0, 68, ! 5, 106, 90, 0, 68, 5, 153, 106, 90, 0, ! 68, 153, 5, 106, 90, 0, 226, 0, 227, 0, ! 228, 0, 229, 0, 254, 0, 226, 254, 0, 227, ! 254, 0, 228, 254, 0, 229, 254, 0, 127, 0, ! 226, 127, 0, 227, 127, 0, 229, 127, 0, 255, ! 0, 226, 255, 0, 227, 255, 0, 228, 255, 0, ! 229, 255, 0, 231, 0, 230, 231, 0, 226, 0, ! 227, 0, 228, 0, 229, 0, 1, 84, 0, 0, ! 0, 0, 0, 0, 237, 0, 238, 0, 237, 238, ! 0, 32, 288, 84, 0, 244, 0, 1, 244, 0, ! 89, 0, 85, 0, 232, 236, 242, 85, 233, 0, ! 225, 0, 1, 0, 67, 89, 0, 240, 241, 0, ! 246, 253, 0, 246, 1, 0, 0, 15, 247, 67, ! 106, 83, 0, 0, 18, 249, 253, 17, 0, 0, ! 0, 254, 0, 255, 252, 0, 234, 252, 235, 0, ! 250, 251, 266, 0, 250, 251, 267, 0, 0, 245, ! 16, 257, 253, 0, 245, 0, 245, 16, 1, 0, ! 0, 0, 17, 258, 67, 106, 83, 259, 253, 0, ! 248, 67, 106, 83, 84, 0, 248, 1, 0, 0, ! 0, 0, 0, 19, 260, 67, 265, 261, 269, 84, ! 262, 269, 83, 263, 253, 0, 0, 20, 67, 106, ! 83, 264, 253, 0, 269, 84, 0, 130, 0, 244, ! 0, 106, 84, 0, 234, 256, 235, 0, 23, 84, ! 0, 24, 84, 0, 25, 84, 0, 25, 106, 84, ! 0, 27, 268, 67, 106, 83, 84, 0, 27, 268, ! 67, 106, 46, 270, 83, 84, 0, 27, 268, 67, ! 106, 46, 270, 46, 270, 83, 84, 0, 27, 268, ! 67, 106, 46, 270, 46, 270, 46, 273, 83, 84, ! 0, 26, 104, 84, 0, 26, 58, 106, 84, 0, ! 84, 0, 21, 114, 46, 0, 21, 114, 10, 114, ! 46, 0, 22, 46, 0, 104, 250, 251, 46, 168, ! 0, 0, 7, 0, 0, 106, 0, 0, 271, 0, ! 272, 0, 271, 88, 272, 0, 9, 67, 106, 83, ! 0, 68, 104, 90, 9, 67, 106, 83, 0, 122, ! 0, 273, 88, 122, 0, 0, 168, 275, 276, 0, ! 279, 83, 0, 0, 0, 280, 84, 277, 168, 278, ! 276, 0, 1, 83, 0, 0, 10, 0, 280, 0, ! 280, 88, 10, 0, 282, 0, 280, 88, 281, 0, ! 147, 128, 192, 168, 0, 147, 128, 195, 168, 0, ! 147, 128, 219, 0, 148, 128, 195, 168, 0, 148, ! 128, 219, 0, 149, 283, 192, 168, 0, 149, 283, ! 195, 168, 0, 149, 283, 219, 0, 150, 283, 195, ! 168, 0, 150, 283, 219, 0, 128, 0, 0, 168, ! 285, 286, 0, 276, 0, 287, 83, 0, 3, 0, ! 287, 88, 3, 0, 104, 0, 288, 88, 104, 0, ! 31, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 286, 291, 306, 306, 308, 308, 311, 313, 314, ! 322, 326, 334, 336, 338, 340, 341, 342, 347, 347, ! 347, 360, 362, 362, 362, 374, 376, 376, 376, 388, ! 392, 394, 397, 399, 401, 406, 408, 410, 412, 416, ! 420, 423, 426, 429, 433, 435, 438, 441, 445, 462, ! 468, 471, 474, 477, 479, 483, 487, 491, 495, 497, ! 501, 503, 505, 507, 509, 511, 513, 515, 517, 519, ! 521, 523, 525, 527, 527, 533, 533, 539, 539, 539, ! 548, 548, 558, 565, 575, 582, 583, 585, 587, 587, ! 600, 605, 607, 623, 630, 632, 635, 645, 655, 657, ! 661, 667, 669, 674, 676, 693, 695, 696, 706, 711, ! 713, 714, 715, 722, 725, 727, 730, 738, 747, 757, ! 762, 765, 767, 769, 771, 773, 829, 833, 836, 841, ! 847, 851, 856, 860, 865, 869, 872, 875, 878, 881, ! 884, 889, 893, 896, 899, 902, 905, 910, 914, 917, ! 920, 923, 926, 931, 935, 938, 941, 944, 949, 953, ! 956, 959, 965, 971, 977, 985, 991, 995, 998, 1004, ! 1010, 1016, 1024, 1030, 1034, 1037, 1040, 1043, 1046, 1049, ! 1055, 1061, 1067, 1075, 1079, 1082, 1085, 1088, 1093, 1097, ! 1100, 1103, 1106, 1109, 1112, 1118, 1124, 1130, 1138, 1142, ! 1145, 1148, 1151, 1157, 1159, 1160, 1161, 1162, 1163, 1164, ! 1165, 1168, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1179, ! 1181, 1182, 1183, 1186, 1188, 1189, 1190, 1193, 1195, 1196, ! 1197, 1200, 1202, 1203, 1204, 1207, 1209, 1210, 1211, 1212, ! 1213, 1214, 1215, 1218, 1220, 1221, 1222, 1223, 1224, 1225, ! 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1238, ! 1241, 1266, 1268, 1271, 1275, 1278, 1281, 1285, 1290, 1292, ! 1298, 1300, 1303, 1305, 1308, 1311, 1317, 1317, 1326, 1333, ! 1333, 1342, 1349, 1352, 1356, 1359, 1363, 1368, 1371, 1375, ! 1378, 1380, 1382, 1384, 1391, 1393, 1394, 1395, 1400, 1402, ! 1402, 1406, 1411, 1415, 1418, 1420, 1425, 1429, 1432, 1432, ! 1438, 1441, 1441, 1446, 1448, 1451, 1453, 1456, 1462, 1466, ! 1470, 1470, 1470, 1500, 1500, 1500, 1533, 1535, 1540, 1543, ! 1548, 1550, 1552, 1559, 1561, 1564, 1570, 1572, 1575, 1581, ! 1583, 1585, 1587, 1594, 1600, 1602, 1604, 1606, 1609, 1612, ! 1616, 1619, 1623, 1626, 1636, 1636, 1643, 1647, 1647, 1651, ! 1655, 1655, 1660, 1660, 1667, 1670, 1672, 1680, 1682, 1685, ! 1687, 1692, 1695, 1700, 1702, 1704, 1709, 1713, 1723, 1726, ! 1731, 1733, 1738, 1740, 1744, 1746, 1750, 1754, 1758, 1763, ! 1767, 1771, 1781, 1783, 1788, 1793, 1796, 1800, 1800, 1808, ! 1811, 1814, 1819, 1823, 1829, 1831, 1834, 1836, 1840, 1843, ! 1847, 1850, 1852, 1854, 1856, 1862, 1865, 1867, 1869, 1871, ! 1873, 1875, 1879, 1883, 1895, 1897, 1898, 1902, 1905, 1907, ! 1908, 1909, 1910, 1913, 1915, 1918, 1919, 1922, 1924, 1925, ! 1926, 1927, 1930, 1932, 1935, 1937, 1938, 1939, 1942, 1945, ! 1952, 1957, 1973, 1988, 1990, 1995, 1997, 2000, 2014, 2017, ! 2020, 2024, 2026, 2033, 2035, 2038, 2056, 2063, 2069, 2072, ! 2072, 2094, 2094, 2114, 2120, 2126, 2128, 2132, 2138, 2152, ! 2161, 2161, 2170, 2182, 2192, 2192, 2192, 2202, 2205, 2207, ! 2207, 2207, 2207, 2207, 2221, 2221, 2228, 2231, 2236, 2239, ! 2242, 2246, 2249, 2252, 2255, 2258, 2262, 2266, 2271, 2275, ! 2287, 2293, 2301, 2304, 2307, 2310, 2325, 2329, 2333, 2336, ! 2341, 2343, 2346, 2348, 2352, 2355, 2359, 2362, 2371, 2371, ! 2382, 2384, 2384, 2384, 2397, 2403, 2405, 2415, 2417, 2421, ! 2424, 2430, 2436, 2441, 2444, 2450, 2457, 2463, 2468, 2471, ! 2477, 2482, 2491, 2491, 2502, 2504, 2521, 2524, 2529, 2532, ! 2536 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "IDENTIFIER", "TYPENAME", "SCSPEC", "TYPESPEC", "TYPE_QUAL", "CONSTANT", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "STRUCT", "UNION", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", "RETURN", "GOTO", "ASM_KEYWORD", "TYPEOF", "ALIGNOF", "ATTRIBUTE", "EXTENSION", "LABEL", "REALPART", "IMAGPART", "VA_ARG", "CHOOSE_EXPR", "TYPES_COMPATIBLE_P", "PTR_VALUE", ! "PTR_BASE", "PTR_EXTENT", "STRING_FUNC_NAME", "VAR_FUNC_NAME", "ASSIGN", ! "'='", "'?'", "':'", "OROR", "ANDAND", "'|'", "'^'", "'&'", "EQCOMPARE", ! "ARITHCOMPARE", "LSHIFT", "RSHIFT", "'+'", "'-'", "'*'", "'/'", "'%'", ! "UNARY", "PLUSPLUS", "MINUSMINUS", "HYPERUNARY", "POINTSAT", "'.'", ! "'('", "'['", "INTERFACE", "IMPLEMENTATION", "END", "SELECTOR", "DEFS", ! "ENCODE", "CLASSNAME", "PUBLIC", "PRIVATE", "PROTECTED", "PROTOCOL", ! "OBJECTNAME", "CLASS", "ALIAS", "')'", "';'", "'}'", "'~'", "'!'", ! "','", "'{'", "']'", "program", "extdefs", "@1", "@2", "extdef", ! "datadef", "fndef", "@3", "@4", "@5", "@6", "@7", "@8", "identifier", ! "unop", "expr", "exprlist", "nonnull_exprlist", "unary_expr", "sizeof", ! "alignof", "typeof", "cast_expr", "expr_no_commas", "@9", "@10", "@11", ! "@12", "@13", "primary", "@14", "string", "old_style_parm_decls", ! "lineno_datadecl", "datadecls", "datadecl", "lineno_decl", "setspecs", ! "maybe_resetattrs", "decl", "declspecs_nosc_nots_nosa_noea", ! "declspecs_nosc_nots_nosa_ea", "declspecs_nosc_nots_sa_noea", ! "declspecs_nosc_nots_sa_ea", "declspecs_nosc_ts_nosa_noea", ! "declspecs_nosc_ts_nosa_ea", "declspecs_nosc_ts_sa_noea", ! "declspecs_nosc_ts_sa_ea", "declspecs_sc_nots_nosa_noea", ! "declspecs_sc_nots_nosa_ea", "declspecs_sc_nots_sa_noea", ! "declspecs_sc_nots_sa_ea", "declspecs_sc_ts_nosa_noea", ! "declspecs_sc_ts_nosa_ea", "declspecs_sc_ts_sa_noea", ! "declspecs_sc_ts_sa_ea", "declspecs_ts", "declspecs_nots", ! "declspecs_ts_nosa", "declspecs_nots_nosa", "declspecs_nosc_ts", ! "declspecs_nosc_nots", "declspecs_nosc", "declspecs", ! "maybe_type_quals_attrs", "typespec_nonattr", "typespec_attr", ! "typespec_reserved_nonattr", "typespec_reserved_attr", "typespec_nonreserved_nonattr", "initdecls", "notype_initdecls", "maybeasm", "initdcl", "@15", "notype_initdcl", "@16", "maybe_attribute", "attributes", "attribute", "attribute_list", --- 483,841 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, 38, 39, 40, 41, 42, 44, 47, ! 48, 52, 53, 54, 55, 61, 62, 63, 64, 68, ! 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, ! 79, 80, 81, 82 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned short yyprhs[] = { ! 0, 0, 3, 4, 6, 7, 10, 11, 15, 17, ! 19, 25, 28, 32, 37, 42, 45, 48, 51, 53, ! 54, 55, 65, 70, 71, 72, 82, 87, 88, 89, ! 98, 102, 104, 106, 108, 110, 112, 114, 116, 118, ! 120, 122, 123, 125, 127, 131, 133, 136, 139, 142, ! 145, 148, 153, 156, 161, 164, 167, 169, 171, 173, ! 175, 180, 182, 186, 190, 194, 198, 202, 206, 210, ! 214, 218, 222, 226, 230, 231, 236, 237, 242, 243, ! 244, 252, 253, 259, 263, 267, 269, 271, 273, 275, ! 276, 284, 288, 292, 296, 300, 305, 312, 321, 328, ! 333, 337, 341, 344, 347, 349, 352, 353, 355, 358, ! 362, 364, 366, 369, 372, 377, 382, 385, 388, 392, ! 393, 395, 400, 405, 409, 413, 416, 419, 421, 424, ! 427, 430, 433, 436, 438, 441, 443, 446, 449, 452, ! 455, 458, 461, 463, 466, 469, 472, 475, 478, 481, ! 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 513, 516, 519, 522, 525, 528, 531, 534, 537, 540, 543, 546, 549, 552, 555, 558, 561, 564, 567, 570, 573, 576, 579, 582, 585, 588, 591, 594, 597, 600, 603, 606, 609, 612, 615, 618, 621, 624, 627, 630, ! 633, 636, 639, 642, 645, 647, 649, 651, 653, 655, ! 657, 659, 661, 663, 665, 667, 669, 671, 673, 675, ! 677, 679, 681, 683, 685, 687, 689, 691, 693, 695, ! 697, 699, 701, 703, 705, 707, 709, 711, 713, 715, ! 717, 719, 721, 723, 725, 727, 729, 731, 733, 735, ! 737, 739, 741, 743, 745, 747, 749, 751, 753, 755, ! 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, ! 779, 784, 786, 791, 793, 798, 799, 804, 805, 812, ! 816, 817, 824, 828, 829, 831, 833, 836, 843, 845, ! 849, 850, 852, 857, 864, 869, 871, 873, 875, 877, ! 879, 880, 885, 887, 888, 891, 893, 897, 901, 904, ! 905, 910, 912, 913, 918, 920, 922, 924, 927, 930, ! 936, 940, 941, 942, 950, 951, 952, 960, 962, 964, ! 969, 973, 976, 980, 982, 984, 986, 990, 993, 995, ! 999, 1002, 1006, 1010, 1015, 1019, 1024, 1028, 1031, 1033, ! 1035, 1038, 1040, 1043, 1045, 1048, 1049, 1057, 1063, 1064, ! 1072, 1078, 1079, 1088, 1089, 1097, 1100, 1103, 1106, 1107, ! 1109, 1110, 1112, 1114, 1117, 1118, 1122, 1125, 1129, 1134, ! 1138, 1140, 1142, 1145, 1147, 1152, 1154, 1159, 1164, 1171, ! 1177, 1182, 1189, 1195, 1197, 1201, 1203, 1205, 1209, 1210, ! 1214, 1215, 1217, 1218, 1220, 1223, 1225, 1227, 1229, 1233, ! 1236, 1240, 1245, 1249, 1252, 1255, 1257, 1261, 1266, 1269, ! 1273, 1277, 1282, 1287, 1293, 1299, 1301, 1303, 1305, 1307, ! 1309, 1312, 1315, 1318, 1321, 1323, 1326, 1329, 1332, 1334, ! 1337, 1340, 1343, 1346, 1348, 1351, 1353, 1355, 1357, 1359, ! 1362, 1363, 1364, 1365, 1366, 1367, 1369, 1371, 1374, 1378, ! 1380, 1383, 1385, 1387, 1393, 1395, 1397, 1400, 1403, 1406, ! 1409, 1410, 1416, 1417, 1422, 1423, 1424, 1426, 1429, 1433, ! 1437, 1441, 1442, 1447, 1449, 1453, 1454, 1455, 1463, 1469, ! 1472, 1473, 1474, 1475, 1476, 1489, 1490, 1497, 1500, 1502, ! 1504, 1507, 1511, 1514, 1517, 1520, 1524, 1531, 1540, 1551, ! 1564, 1568, 1573, 1575, 1579, 1585, 1588, 1594, 1595, 1597, ! 1598, 1600, 1601, 1603, 1605, 1609, 1614, 1622, 1624, 1628, ! 1629, 1633, 1636, 1637, 1638, 1645, 1648, 1649, 1651, 1653, ! 1657, 1659, 1663, 1668, 1673, 1677, 1682, 1686, 1691, 1696, ! 1700, 1705, 1709, 1711, 1712, 1716, 1718, 1721, 1723, 1727, ! 1729, 1733 }; + + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const short yyrhs[] = { ! 92, 0, -1, -1, 93, -1, -1, 94, 96, -1, ! -1, 93, 95, 96, -1, 98, -1, 97, -1, 27, ! 66, 107, 83, 84, -1, 290, 96, -1, 129, 163, ! 84, -1, 149, 129, 163, 84, -1, 148, 129, 162, ! 84, -1, 155, 84, -1, 1, 84, -1, 1, 85, ! -1, 84, -1, -1, -1, 148, 129, 191, 99, 124, ! 100, 251, 252, 240, -1, 148, 129, 191, 1, -1, ! -1, -1, 149, 129, 196, 101, 124, 102, 251, 252, ! 240, -1, 149, 129, 196, 1, -1, -1, -1, 129, ! 196, 103, 124, 104, 251, 252, 240, -1, 129, 196, ! 1, -1, 3, -1, 4, -1, 51, -1, 57, -1, ! 56, -1, 62, -1, 61, -1, 86, -1, 87, -1, ! 109, -1, -1, 109, -1, 115, -1, 109, 88, 115, ! -1, 121, -1, 58, 114, -1, 290, 114, -1, 106, ! 114, -1, 48, 105, -1, 111, 110, -1, 111, 66, ! 217, 83, -1, 112, 110, -1, 112, 66, 217, 83, ! -1, 33, 114, -1, 34, 114, -1, 11, -1, 29, ! -1, 28, -1, 110, -1, 66, 217, 83, 114, -1, ! 114, -1, 115, 56, 115, -1, 115, 57, 115, -1, ! 115, 58, 115, -1, 115, 59, 115, -1, 115, 60, ! 115, -1, 115, 55, 115, -1, 115, 54, 115, -1, ! 115, 53, 115, -1, 115, 52, 115, -1, 115, 51, ! 115, -1, 115, 49, 115, -1, 115, 50, 115, -1, ! -1, 115, 48, 116, 115, -1, -1, 115, 47, 117, ! 115, -1, -1, -1, 115, 45, 118, 107, 46, 119, ! 115, -1, -1, 115, 45, 120, 46, 115, -1, 115, ! 43, 115, -1, 115, 44, 115, -1, 3, -1, 8, ! -1, 123, -1, 42, -1, -1, 66, 217, 83, 89, ! 122, 177, 85, -1, 66, 107, 83, -1, 66, 1, ! 83, -1, 244, 242, 83, -1, 244, 1, 83, -1, ! 121, 66, 108, 83, -1, 35, 66, 115, 88, 217, ! 83, -1, 36, 66, 115, 88, 115, 88, 115, 83, ! -1, 37, 66, 217, 88, 217, 83, -1, 121, 67, ! 107, 90, -1, 121, 65, 105, -1, 121, 68, 105, ! -1, 121, 62, -1, 121, 61, -1, 9, -1, 123, ! 9, -1, -1, 126, -1, 126, 10, -1, 251, 252, ! 127, -1, 125, -1, 232, -1, 126, 125, -1, 125, ! 232, -1, 150, 129, 162, 84, -1, 151, 129, 163, ! 84, -1, 150, 84, -1, 151, 84, -1, 251, 252, ! 131, -1, -1, 169, -1, 148, 129, 162, 84, -1, ! 149, 129, 163, 84, -1, 148, 129, 185, -1, 149, ! 129, 188, -1, 155, 84, -1, 290, 131, -1, 7, ! -1, 132, 7, -1, 133, 7, -1, 132, 170, -1, ! 134, 7, -1, 135, 7, -1, 170, -1, 134, 170, ! -1, 157, -1, 136, 7, -1, 137, 7, -1, 136, ! 159, -1, 137, 159, -1, 132, 157, -1, 133, 157, ! -1, 158, -1, 136, 170, -1, 136, 160, -1, 137, ! 160, -1, 132, 158, -1, 133, 158, -1, 138, 7, ! -1, 139, 7, -1, 138, 159, -1, 139, 159, -1, ! 134, 157, -1, 135, 157, -1, 138, 170, -1, 138, ! 160, -1, 139, 160, -1, 134, 158, -1, 135, 158, ! -1, 5, -1, 140, 7, -1, 141, 7, -1, 132, ! 5, -1, 133, 5, -1, 140, 5, -1, 141, 5, ! -1, 140, 170, -1, 142, 7, -1, 143, 7, -1, ! 134, 5, -1, 135, 5, -1, 142, 5, -1, 143, ! 5, -1, 142, 170, -1, 144, 7, -1, 145, 7, ! -1, 144, 159, -1, 145, 159, -1, 140, 157, -1, ! 141, 157, -1, 136, 5, -1, 137, 5, -1, 144, ! 5, -1, 145, 5, -1, 144, 170, -1, 144, 160, ! -1, 145, 160, -1, 140, 158, -1, 141, 158, -1, ! 146, 7, -1, 147, 7, -1, 146, 159, -1, 147, ! 159, -1, 142, 157, -1, 143, 157, -1, 138, 5, ! -1, 139, 5, -1, 146, 5, -1, 147, 5, -1, ! 146, 170, -1, 146, 160, -1, 147, 160, -1, 142, ! 158, -1, 143, 158, -1, 136, -1, 137, -1, 138, ! -1, 139, -1, 144, -1, 145, -1, 146, -1, 147, ! -1, 132, -1, 133, -1, 134, -1, 135, -1, 140, ! -1, 141, -1, 142, -1, 143, -1, 136, -1, 137, ! -1, 144, -1, 145, -1, 132, -1, 133, -1, 140, ! -1, 141, -1, 136, -1, 137, -1, 138, -1, 139, ! -1, 132, -1, 133, -1, 134, -1, 135, -1, 136, ! -1, 137, -1, 138, -1, 139, -1, 132, -1, 133, ! -1, 134, -1, 135, -1, 132, -1, 133, -1, 134, ! -1, 135, -1, 136, -1, 137, -1, 138, -1, 139, ! -1, 140, -1, 141, -1, 142, -1, 143, -1, 144, ! -1, 145, -1, 146, -1, 147, -1, -1, 153, -1, ! 159, -1, 161, -1, 160, -1, 6, -1, 205, -1, ! 200, -1, 4, -1, 113, 66, 107, 83, -1, 113, ! 66, 217, 83, -1, 165, -1, 162, 88, 130, 165, ! -1, 167, -1, 163, 88, 130, 167, -1, -1, 27, ! 66, 123, 83, -1, -1, 191, 164, 169, 43, 166, ! 175, -1, 191, 164, 169, -1, -1, 196, 164, 169, ! 43, 168, 175, -1, 196, 164, 169, -1, -1, 170, ! -1, 171, -1, 170, 171, -1, 30, 66, 66, 172, ! 83, 83, -1, 173, -1, 172, 88, 173, -1, -1, ! 174, -1, 174, 66, 3, 83, -1, 174, 66, 3, ! 88, 109, 83, -1, 174, 66, 108, 83, -1, 105, ! -1, 5, -1, 6, -1, 7, -1, 115, -1, -1, ! 89, 176, 177, 85, -1, 1, -1, -1, 178, 206, ! -1, 179, -1, 178, 88, 179, -1, 183, 43, 181, ! -1, 184, 181, -1, -1, 105, 46, 180, 181, -1, ! 181, -1, -1, 89, 182, 177, 85, -1, 115, -1, ! 1, -1, 184, -1, 183, 184, -1, 65, 105, -1, ! 67, 115, 10, 115, 90, -1, 67, 115, 90, -1, ! -1, -1, 191, 186, 124, 187, 251, 252, 245, -1, ! -1, -1, 196, 189, 124, 190, 251, 252, 245, -1, ! 192, -1, 196, -1, 66, 169, 192, 83, -1, 192, ! 66, 285, -1, 192, 225, -1, 58, 156, 192, -1, ! 4, -1, 194, -1, 195, -1, 194, 66, 285, -1, ! 194, 225, -1, 4, -1, 195, 66, 285, -1, 195, ! 225, -1, 58, 156, 194, -1, 58, 156, 195, -1, ! 66, 169, 195, 83, -1, 196, 66, 285, -1, 66, ! 169, 196, 83, -1, 58, 156, 196, -1, 196, 225, ! -1, 3, -1, 13, -1, 13, 170, -1, 14, -1, ! 14, 170, -1, 12, -1, 12, 170, -1, -1, 197, ! 105, 89, 201, 208, 85, 169, -1, 197, 89, 208, ! 85, 169, -1, -1, 198, 105, 89, 202, 208, 85, ! 169, -1, 198, 89, 208, 85, 169, -1, -1, 199, ! 105, 89, 203, 215, 207, 85, 169, -1, -1, 199, ! 89, 204, 215, 207, 85, 169, -1, 197, 105, -1, ! 198, 105, -1, 199, 105, -1, -1, 88, -1, -1, ! 88, -1, 209, -1, 209, 210, -1, -1, 209, 210, ! 84, -1, 209, 84, -1, 152, 129, 211, -1, 152, ! 129, 251, 252, -1, 153, 129, 212, -1, 153, -1, ! 1, -1, 290, 210, -1, 213, -1, 211, 88, 130, ! 213, -1, 214, -1, 212, 88, 130, 214, -1, 251, ! 252, 191, 169, -1, 251, 252, 191, 46, 115, 169, ! -1, 251, 252, 46, 115, 169, -1, 251, 252, 196, ! 169, -1, 251, 252, 196, 46, 115, 169, -1, 251, ! 252, 46, 115, 169, -1, 216, -1, 215, 88, 216, ! -1, 1, -1, 105, -1, 105, 43, 115, -1, -1, ! 154, 218, 219, -1, -1, 221, -1, -1, 221, -1, ! 222, 170, -1, 223, -1, 222, -1, 224, -1, 58, ! 156, 222, -1, 58, 156, -1, 58, 156, 223, -1, ! 66, 169, 221, 83, -1, 224, 66, 275, -1, 224, ! 225, -1, 66, 275, -1, 225, -1, 67, 107, 90, ! -1, 67, 154, 107, 90, -1, 67, 90, -1, 67, ! 154, 90, -1, 67, 58, 90, -1, 67, 154, 58, ! 90, -1, 67, 5, 107, 90, -1, 67, 5, 154, ! 107, 90, -1, 67, 154, 5, 107, 90, -1, 227, ! -1, 228, -1, 229, -1, 230, -1, 255, -1, 227, ! 255, -1, 228, 255, -1, 229, 255, -1, 230, 255, ! -1, 128, -1, 227, 128, -1, 228, 128, -1, 230, ! 128, -1, 256, -1, 227, 256, -1, 228, 256, -1, ! 229, 256, -1, 230, 256, -1, 232, -1, 231, 232, ! -1, 227, -1, 228, -1, 229, -1, 230, -1, 1, ! 84, -1, -1, -1, -1, -1, -1, 238, -1, 239, ! -1, 238, 239, -1, 32, 289, 84, -1, 245, -1, ! 1, 245, -1, 89, -1, 85, -1, 233, 237, 243, ! 85, 234, -1, 226, -1, 1, -1, 66, 89, -1, ! 241, 242, -1, 247, 254, -1, 247, 1, -1, -1, ! 15, 248, 66, 107, 83, -1, -1, 18, 250, 254, ! 17, -1, -1, -1, 255, -1, 256, 253, -1, 235, ! 253, 236, -1, 251, 252, 267, -1, 251, 252, 268, ! -1, -1, 246, 16, 258, 254, -1, 246, -1, 246, ! 16, 1, -1, -1, -1, 17, 259, 66, 107, 83, ! 260, 254, -1, 249, 66, 107, 83, 84, -1, 249, ! 1, -1, -1, -1, -1, -1, 19, 261, 66, 266, ! 262, 270, 84, 263, 270, 83, 264, 254, -1, -1, ! 20, 66, 107, 83, 265, 254, -1, 270, 84, -1, ! 131, -1, 245, -1, 107, 84, -1, 235, 257, 236, ! -1, 23, 84, -1, 24, 84, -1, 25, 84, -1, ! 25, 107, 84, -1, 27, 269, 66, 107, 83, 84, ! -1, 27, 269, 66, 107, 46, 271, 83, 84, -1, ! 27, 269, 66, 107, 46, 271, 46, 271, 83, 84, ! -1, 27, 269, 66, 107, 46, 271, 46, 271, 46, ! 274, 83, 84, -1, 26, 105, 84, -1, 26, 58, ! 107, 84, -1, 84, -1, 21, 115, 46, -1, 21, ! 115, 10, 115, 46, -1, 22, 46, -1, 105, 251, ! 252, 46, 169, -1, -1, 7, -1, -1, 107, -1, ! -1, 272, -1, 273, -1, 272, 88, 273, -1, 9, ! 66, 107, 83, -1, 67, 105, 90, 9, 66, 107, ! 83, -1, 123, -1, 274, 88, 123, -1, -1, 169, ! 276, 277, -1, 280, 83, -1, -1, -1, 281, 84, ! 278, 169, 279, 277, -1, 1, 83, -1, -1, 10, ! -1, 281, -1, 281, 88, 10, -1, 283, -1, 281, ! 88, 282, -1, 148, 129, 193, 169, -1, 148, 129, ! 196, 169, -1, 148, 129, 220, -1, 149, 129, 196, ! 169, -1, 149, 129, 220, -1, 150, 284, 193, 169, ! -1, 150, 284, 196, 169, -1, 150, 284, 220, -1, ! 151, 284, 196, 169, -1, 151, 284, 220, -1, 129, ! -1, -1, 169, 286, 287, -1, 277, -1, 288, 83, ! -1, 3, -1, 288, 88, 3, -1, 105, -1, 289, ! 88, 105, -1, 31, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned short yyrline[] = { ! 0, 287, 287, 291, 307, 307, 308, 308, 312, 313, ! 314, 322, 327, 334, 336, 338, 340, 341, 342, 349, ! 354, 348, 360, 363, 368, 362, 374, 377, 382, 376, ! 388, 393, 394, 397, 399, 401, 406, 408, 410, 412, ! 416, 422, 423, 427, 429, 434, 435, 438, 441, 445, ! 462, 468, 471, 474, 477, 479, 484, 488, 492, 496, ! 497, 502, 503, 505, 507, 509, 511, 513, 515, 517, ! 519, 521, 523, 525, 528, 527, 534, 533, 540, 543, ! 539, 549, 548, 558, 565, 576, 582, 583, 585, 588, ! 587, 600, 605, 607, 623, 630, 632, 635, 645, 655, ! 657, 661, 667, 669, 675, 676, 693, 695, 696, 707, ! 712, 713, 714, 715, 723, 725, 727, 730, 739, 748, ! 758, 763, 765, 767, 769, 771, 773, 830, 833, 836, ! 842, 848, 851, 857, 860, 866, 869, 872, 875, 878, ! 881, 884, 890, 893, 896, 899, 902, 905, 911, 914, ! 917, 920, 923, 926, 932, 935, 938, 941, 944, 950, ! 953, 956, 959, 965, 971, 977, 986, 992, 995, 998, ! 1004, 1010, 1016, 1025, 1031, 1034, 1037, 1040, 1043, 1046, ! 1049, 1055, 1061, 1067, 1076, 1079, 1082, 1085, 1088, 1094, ! 1097, 1100, 1103, 1106, 1109, 1112, 1118, 1124, 1130, 1139, ! 1142, 1145, 1148, 1151, 1158, 1159, 1160, 1161, 1162, 1163, ! 1164, 1165, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, ! 1180, 1181, 1182, 1183, 1187, 1188, 1189, 1190, 1194, 1195, ! 1196, 1197, 1201, 1202, 1203, 1204, 1208, 1209, 1210, 1211, ! 1212, 1213, 1214, 1215, 1219, 1220, 1221, 1222, 1223, 1224, ! 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, ! 1240, 1241, 1267, 1268, 1272, 1276, 1278, 1282, 1286, 1290, ! 1292, 1299, 1300, 1304, 1305, 1310, 1311, 1319, 1318, 1326, ! 1335, 1334, 1342, 1351, 1352, 1357, 1359, 1364, 1369, 1371, ! 1377, 1378, 1380, 1382, 1384, 1392, 1393, 1394, 1395, 1401, ! 1403, 1402, 1406, 1413, 1415, 1419, 1420, 1426, 1429, 1433, ! 1432, 1438, 1443, 1442, 1446, 1448, 1452, 1453, 1457, 1462, ! 1466, 1472, 1484, 1471, 1502, 1514, 1501, 1534, 1535, 1541, ! 1543, 1548, 1550, 1552, 1560, 1561, 1565, 1570, 1572, 1576, ! 1581, 1583, 1585, 1587, 1595, 1600, 1602, 1604, 1606, 1610, ! 1612, 1617, 1619, 1624, 1626, 1638, 1637, 1643, 1648, 1647, ! 1651, 1656, 1655, 1661, 1660, 1668, 1670, 1672, 1680, 1682, ! 1685, 1687, 1693, 1695, 1701, 1702, 1704, 1710, 1713, 1723, ! 1726, 1731, 1733, 1739, 1740, 1745, 1746, 1751, 1754, 1758, ! 1764, 1767, 1771, 1782, 1783, 1788, 1794, 1796, 1802, 1801, ! 1810, 1811, 1816, 1819, 1823, 1830, 1831, 1835, 1836, 1841, ! 1843, 1848, 1850, 1852, 1854, 1856, 1863, 1865, 1867, 1869, ! 1871, 1873, 1875, 1879, 1883, 1896, 1897, 1898, 1902, 1906, ! 1907, 1908, 1909, 1910, 1914, 1915, 1918, 1919, 1923, 1924, ! 1925, 1926, 1927, 1931, 1932, 1936, 1937, 1938, 1939, 1942, ! 1946, 1953, 1958, 1974, 1988, 1990, 1996, 1997, 2001, 2015, ! 2017, 2020, 2024, 2026, 2034, 2035, 2039, 2056, 2064, 2069, ! 2082, 2081, 2096, 2095, 2115, 2121, 2127, 2128, 2133, 2139, ! 2153, 2163, 2162, 2170, 2182, 2193, 2196, 2192, 2202, 2205, ! 2208, 2212, 2215, 2218, 2207, 2222, 2221, 2229, 2231, 2237, ! 2239, 2242, 2246, 2249, 2252, 2255, 2258, 2262, 2266, 2271, ! 2275, 2287, 2293, 2301, 2304, 2307, 2310, 2327, 2329, 2335, ! 2336, 2342, 2343, 2347, 2348, 2353, 2355, 2360, 2362, 2373, ! 2372, 2383, 2385, 2393, 2384, 2397, 2404, 2405, 2415, 2417, ! 2422, 2424, 2431, 2436, 2441, 2444, 2450, 2458, 2463, 2468, ! 2471, 2477, 2483, 2493, 2492, 2503, 2504, 2522, 2524, 2530, ! 2532, 2537 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "IDENTIFIER", "TYPENAME", "SCSPEC", "TYPESPEC", "TYPE_QUAL", "CONSTANT", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "STRUCT", "UNION", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", "RETURN", "GOTO", "ASM_KEYWORD", "TYPEOF", "ALIGNOF", "ATTRIBUTE", "EXTENSION", "LABEL", "REALPART", "IMAGPART", "VA_ARG", "CHOOSE_EXPR", "TYPES_COMPATIBLE_P", "PTR_VALUE", ! "PTR_BASE", "PTR_EXTENT", "STRING_FUNC_NAME", "VAR_FUNC_NAME", "'='", ! "ASSIGN", "'?'", "':'", "OROR", "ANDAND", "'|'", "'^'", "'&'", ! "EQCOMPARE", "ARITHCOMPARE", "RSHIFT", "LSHIFT", "'+'", "'-'", "'*'", ! "'/'", "'%'", "MINUSMINUS", "PLUSPLUS", "UNARY", "HYPERUNARY", "'.'", ! "'('", "'['", "POINTSAT", "INTERFACE", "IMPLEMENTATION", "END", ! "SELECTOR", "DEFS", "ENCODE", "CLASSNAME", "PUBLIC", "PRIVATE", ! "PROTECTED", "PROTOCOL", "OBJECTNAME", "CLASS", "ALIAS", "')'", "';'", ! "'}'", "'~'", "'!'", "','", "'{'", "']'", "$accept", "program", ! "extdefs", "@1", "@2", "extdef", "datadef", "fndef", "@3", "@4", "@5", ! "@6", "@7", "@8", "identifier", "unop", "expr", "exprlist", ! "nonnull_exprlist", "unary_expr", "sizeof", "alignof", "typeof", ! "cast_expr", "expr_no_commas", "@9", "@10", "@11", "@12", "@13", ! "primary", "@14", "string", "old_style_parm_decls", "lineno_datadecl", ! "datadecls", "datadecl", "lineno_decl", "setspecs", "maybe_resetattrs", ! "decl", "declspecs_nosc_nots_nosa_noea", "declspecs_nosc_nots_nosa_ea", ! "declspecs_nosc_nots_sa_noea", "declspecs_nosc_nots_sa_ea", ! "declspecs_nosc_ts_nosa_noea", "declspecs_nosc_ts_nosa_ea", ! "declspecs_nosc_ts_sa_noea", "declspecs_nosc_ts_sa_ea", ! "declspecs_sc_nots_nosa_noea", "declspecs_sc_nots_nosa_ea", ! "declspecs_sc_nots_sa_noea", "declspecs_sc_nots_sa_ea", ! "declspecs_sc_ts_nosa_noea", "declspecs_sc_ts_nosa_ea", ! "declspecs_sc_ts_sa_noea", "declspecs_sc_ts_sa_ea", "declspecs_ts", ! "declspecs_nots", "declspecs_ts_nosa", "declspecs_nots_nosa", ! "declspecs_nosc_ts", "declspecs_nosc_nots", "declspecs_nosc", ! "declspecs", "maybe_type_quals_attrs", "typespec_nonattr", ! "typespec_attr", "typespec_reserved_nonattr", "typespec_reserved_attr", "typespec_nonreserved_nonattr", "initdecls", "notype_initdecls", "maybeasm", "initdcl", "@15", "notype_initdcl", "@16", "maybe_attribute", "attributes", "attribute", "attribute_list", *************** static const char *const yytname[] = *** 621,1770 **** }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 91, 91, 93, 92, 94, 92, 95, 95, 95, ! 95, 96, 96, 96, 96, 96, 96, 96, 98, 99, ! 97, 97, 100, 101, 97, 97, 102, 103, 97, 97, ! 104, 104, 105, 105, 105, 105, 105, 105, 105, 106, ! 107, 107, 108, 108, 109, 109, 109, 109, 109, 109, ! 109, 109, 109, 109, 109, 110, 111, 112, 113, 113, ! 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, ! 114, 114, 114, 115, 114, 116, 114, 117, 118, 114, ! 119, 114, 114, 114, 120, 120, 120, 120, 121, 120, ! 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, ! 120, 120, 120, 122, 122, 123, 123, 123, 124, 125, ! 125, 125, 125, 126, 126, 126, 126, 127, 128, 129, ! 130, 130, 130, 130, 130, 130, 131, 131, 131, 132, ! 133, 133, 134, 134, 135, 135, 135, 135, 135, 135, ! 135, 136, 136, 136, 136, 136, 136, 137, 137, 137, ! 137, 137, 137, 138, 138, 138, 138, 138, 139, 139, ! 139, 139, 139, 139, 139, 140, 141, 141, 141, 141, ! 141, 141, 142, 143, 143, 143, 143, 143, 143, 143, ! 143, 143, 143, 144, 144, 144, 144, 144, 145, 145, ! 145, 145, 145, 145, 145, 145, 145, 145, 146, 146, ! 146, 146, 146, 147, 147, 147, 147, 147, 147, 147, ! 147, 148, 148, 148, 148, 148, 148, 148, 148, 149, ! 149, 149, 149, 150, 150, 150, 150, 151, 151, 151, ! 151, 152, 152, 152, 152, 153, 153, 153, 153, 153, ! 153, 153, 153, 154, 154, 154, 154, 154, 154, 154, ! 154, 154, 154, 154, 154, 154, 154, 154, 154, 155, ! 155, 156, 156, 157, 158, 158, 159, 160, 160, 160, ! 161, 161, 162, 162, 163, 163, 165, 164, 164, 167, ! 166, 166, 168, 168, 169, 169, 170, 171, 171, 172, ! 172, 172, 172, 172, 173, 173, 173, 173, 174, 175, ! 174, 174, 176, 176, 177, 177, 178, 178, 179, 178, ! 178, 181, 180, 180, 180, 182, 182, 183, 183, 183, ! 185, 186, 184, 188, 189, 187, 190, 190, 191, 191, ! 191, 191, 191, 192, 192, 193, 193, 193, 194, 194, ! 194, 194, 194, 195, 195, 195, 195, 195, 196, 196, ! 197, 197, 198, 198, 200, 199, 199, 201, 199, 199, ! 202, 199, 203, 199, 204, 204, 204, 205, 205, 206, ! 206, 207, 207, 208, 208, 208, 209, 209, 209, 209, ! 209, 209, 210, 210, 211, 211, 212, 212, 212, 213, ! 213, 213, 214, 214, 214, 215, 215, 217, 216, 218, ! 218, 219, 219, 219, 220, 220, 221, 221, 222, 222, ! 223, 223, 223, 223, 223, 224, 224, 224, 224, 224, ! 224, 224, 224, 224, 225, 225, 225, 225, 226, 226, ! 226, 226, 226, 227, 227, 227, 227, 228, 228, 228, ! 228, 228, 229, 229, 230, 230, 230, 230, 231, 232, ! 233, 234, 235, 236, 236, 237, 237, 238, 239, 239, ! 240, 241, 241, 242, 242, 243, 244, 245, 245, 247, ! 246, 249, 248, 250, 251, 252, 252, 253, 254, 255, ! 257, 256, 256, 256, 258, 259, 256, 256, 256, 260, ! 261, 262, 263, 256, 264, 256, 265, 265, 266, 266, ! 266, 266, 266, 266, 266, 266, 266, 266, 266, 266, ! 266, 266, 267, 267, 267, 267, 268, 268, 269, 269, ! 270, 270, 271, 271, 272, 272, 273, 273, 275, 274, ! 276, 277, 278, 276, 276, 279, 279, 279, 279, 280, ! 280, 281, 281, 281, 281, 281, 282, 282, 282, 282, ! 282, 283, 285, 284, 286, 286, 287, 287, 288, 288, ! 289 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 0, 1, 0, 2, 0, 3, 1, 1, 5, ! 2, 3, 4, 4, 2, 2, 2, 1, 0, 0, ! 9, 4, 0, 0, 9, 4, 0, 0, 8, 3, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 0, 1, 1, 3, 1, 2, 2, 2, 2, 2, ! 4, 2, 4, 2, 2, 1, 1, 1, 1, 4, ! 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 0, 4, 0, 4, 0, 0, 7, ! 0, 5, 3, 3, 1, 1, 1, 1, 0, 7, ! 3, 3, 3, 3, 4, 6, 8, 6, 4, 3, ! 3, 2, 2, 1, 2, 0, 1, 2, 3, 1, ! 1, 2, 2, 4, 4, 2, 2, 3, 0, 1, ! 4, 4, 3, 3, 2, 2, 1, 2, 2, 2, ! 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, ! 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, ! 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, ! 1, 4, 1, 4, 0, 4, 0, 6, 3, 0, ! 6, 3, 0, 1, 1, 2, 6, 1, 3, 0, ! 1, 4, 6, 4, 1, 1, 1, 1, 1, 0, ! 4, 1, 0, 2, 1, 3, 3, 2, 0, 4, ! 1, 0, 4, 1, 1, 1, 2, 2, 5, 3, ! 0, 0, 7, 0, 0, 7, 1, 1, 4, 3, ! 2, 3, 1, 1, 1, 3, 2, 1, 3, 2, ! 3, 3, 4, 3, 4, 3, 2, 1, 1, 2, ! 1, 2, 1, 2, 0, 7, 5, 0, 7, 5, ! 0, 8, 0, 7, 2, 2, 2, 0, 1, 0, ! 1, 1, 2, 0, 3, 2, 3, 4, 3, 1, ! 1, 2, 1, 4, 1, 4, 4, 6, 5, 4, ! 6, 5, 1, 3, 1, 1, 3, 0, 3, 0, ! 1, 0, 1, 2, 1, 1, 1, 3, 2, 3, ! 4, 3, 2, 2, 1, 3, 4, 2, 3, 3, ! 4, 4, 5, 5, 1, 1, 1, 1, 1, 2, ! 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, ! 2, 2, 1, 2, 1, 1, 1, 1, 2, 0, ! 0, 0, 0, 0, 1, 1, 2, 3, 1, 2, ! 1, 1, 5, 1, 1, 2, 2, 2, 2, 0, ! 5, 0, 4, 0, 0, 1, 2, 3, 3, 3, ! 0, 4, 1, 3, 0, 0, 7, 5, 2, 0, ! 0, 0, 0, 12, 0, 6, 2, 1, 1, 2, ! 3, 2, 2, 2, 3, 6, 8, 10, 12, 3, ! 4, 1, 3, 5, 2, 5, 0, 1, 0, 1, ! 0, 1, 1, 3, 4, 7, 1, 3, 0, 3, ! 2, 0, 0, 6, 2, 0, 1, 1, 3, 1, ! 3, 4, 4, 3, 4, 3, 4, 4, 3, 4, ! 3, 1, 0, 3, 1, 2, 1, 3, 1, 3, ! 1 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 3, 5, 0, 0, 0, 267, 158, 264, 126, 352, ! 348, 350, 0, 57, 0, 560, 17, 4, 8, 7, ! 0, 0, 211, 212, 213, 214, 203, 204, 205, 206, ! 215, 216, 217, 218, 207, 208, 209, 210, 118, 118, ! 0, 134, 141, 261, 263, 262, 132, 284, 0, 0, ! 0, 266, 265, 0, 6, 15, 16, 353, 349, 351, ! 0, 0, 0, 347, 259, 282, 0, 272, 0, 161, ! 127, 139, 145, 129, 162, 128, 140, 146, 168, 130, ! 151, 156, 133, 169, 131, 152, 157, 179, 135, 137, ! 143, 142, 180, 136, 138, 144, 194, 147, 149, 154, ! 153, 195, 148, 150, 155, 163, 159, 177, 186, 165, ! 164, 160, 178, 187, 170, 166, 192, 201, 172, 171, ! 167, 193, 202, 181, 173, 175, 184, 183, 182, 174, ! 176, 185, 196, 188, 190, 199, 198, 197, 189, 191, ! 200, 0, 0, 14, 285, 30, 31, 373, 364, 373, ! 365, 362, 366, 10, 84, 85, 103, 55, 56, 0, ! 0, 0, 0, 0, 87, 0, 32, 34, 33, 0, ! 35, 36, 0, 37, 38, 0, 0, 39, 58, 0, ! 0, 60, 42, 44, 86, 0, 0, 289, 0, 239, ! 240, 241, 242, 235, 236, 237, 238, 397, 0, 231, ! 232, 233, 234, 260, 0, 0, 283, 11, 282, 29, ! 0, 282, 0, 0, 282, 346, 332, 259, 282, 0, ! 270, 0, 326, 327, 0, 0, 0, 0, 354, 0, ! 357, 0, 360, 53, 54, 0, 0, 0, 48, 45, ! 0, 465, 0, 0, 47, 0, 0, 0, 49, 0, ! 51, 0, 0, 77, 75, 73, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 101, 102, ! 0, 0, 40, 0, 104, 0, 461, 453, 0, 46, ! 295, 296, 297, 294, 0, 287, 290, 268, 399, 269, ! 345, 0, 0, 119, 0, 552, 343, 0, 0, 417, ! 0, 0, 0, 27, 0, 473, 110, 474, 281, 0, ! 0, 13, 282, 21, 0, 282, 282, 330, 12, 25, ! 0, 282, 380, 375, 231, 232, 233, 234, 227, 228, ! 229, 230, 118, 118, 372, 0, 373, 282, 373, 394, ! 395, 369, 392, 0, 0, 0, 0, 91, 90, 0, ! 9, 43, 0, 0, 83, 82, 0, 0, 0, 0, ! 71, 72, 70, 69, 68, 66, 67, 61, 62, 63, ! 64, 65, 100, 99, 0, 41, 0, 93, 0, 0, ! 454, 455, 92, 0, 289, 40, 259, 282, 398, 400, ! 405, 404, 406, 414, 344, 273, 274, 0, 0, 0, ! 0, 419, 415, 0, 0, 418, 0, 448, 473, 112, ! 107, 111, 0, 279, 331, 0, 0, 19, 278, 329, ! 23, 356, 473, 473, 374, 381, 0, 359, 0, 0, ! 370, 0, 369, 0, 0, 0, 88, 59, 50, 52, ! 0, 0, 76, 74, 94, 98, 558, 0, 464, 433, ! 463, 473, 473, 473, 473, 0, 442, 0, 474, 428, ! 437, 456, 286, 288, 84, 0, 408, 528, 413, 282, ! 412, 275, 0, 556, 536, 223, 224, 219, 220, 225, ! 226, 221, 222, 118, 118, 554, 0, 537, 539, 553, ! 0, 421, 0, 0, 420, 416, 474, 108, 118, 118, ! 0, 328, 271, 274, 473, 276, 473, 376, 382, 474, ! 378, 384, 474, 282, 282, 396, 393, 282, 0, 0, ! 0, 0, 0, 78, 81, 457, 0, 434, 429, 438, ! 435, 430, 439, 474, 431, 440, 436, 432, 441, 443, ! 450, 451, 291, 0, 293, 407, 409, 0, 0, 528, ! 411, 534, 551, 401, 401, 530, 531, 0, 555, 0, ! 422, 423, 0, 115, 0, 116, 0, 301, 299, 298, ! 280, 474, 0, 474, 282, 377, 282, 0, 355, 358, ! 363, 282, 95, 0, 97, 314, 84, 0, 0, 311, ! 0, 313, 0, 367, 304, 310, 0, 0, 0, 559, ! 451, 462, 267, 0, 0, 0, 0, 0, 0, 516, ! 511, 460, 473, 0, 117, 118, 118, 0, 0, 449, ! 498, 478, 479, 0, 0, 410, 529, 337, 259, 282, ! 282, 333, 334, 282, 548, 402, 405, 259, 282, 282, ! 550, 282, 538, 211, 212, 213, 214, 203, 204, 205, ! 206, 215, 216, 217, 218, 207, 208, 209, 210, 118, ! 118, 540, 557, 0, 28, 458, 0, 0, 0, 0, ! 277, 0, 473, 0, 282, 473, 0, 282, 361, 0, ! 317, 0, 0, 308, 89, 0, 303, 0, 316, 307, ! 79, 0, 514, 501, 502, 503, 0, 0, 0, 517, ! 0, 474, 499, 0, 0, 124, 469, 484, 471, 489, ! 0, 482, 0, 0, 452, 466, 125, 292, 408, 528, ! 546, 282, 336, 282, 339, 547, 403, 408, 528, 549, ! 532, 401, 401, 459, 113, 114, 0, 20, 24, 383, ! 474, 282, 0, 386, 385, 282, 0, 389, 96, 0, ! 319, 0, 0, 305, 306, 0, 512, 504, 0, 509, ! 0, 0, 0, 122, 320, 0, 123, 323, 0, 0, ! 451, 0, 0, 0, 468, 473, 467, 488, 0, 500, ! 340, 341, 0, 335, 338, 0, 282, 282, 543, 282, ! 545, 300, 0, 388, 282, 391, 282, 0, 312, 309, ! 0, 510, 0, 282, 120, 0, 121, 0, 0, 0, ! 0, 518, 0, 483, 451, 452, 475, 473, 0, 342, ! 533, 541, 542, 544, 387, 390, 318, 513, 520, 0, ! 515, 321, 324, 0, 0, 472, 519, 497, 490, 0, ! 494, 481, 477, 476, 0, 0, 0, 0, 521, 522, ! 505, 473, 473, 470, 485, 518, 496, 451, 487, 0, ! 0, 520, 0, 0, 474, 474, 451, 0, 495, 0, ! 0, 0, 506, 523, 0, 0, 486, 491, 524, 0, ! 0, 0, 322, 325, 518, 0, 526, 0, 507, 0, ! 0, 0, 0, 492, 525, 508, 527, 451, 493, 0, ! 0, 0 }; static const short yydefgoto[] = { ! 899, 1, 2, 3, 17, 18, 19, 314, 504, 320, ! 506, 213, 408, 590, 175, 242, 374, 177, 178, 179, ! 180, 20, 181, 182, 359, 358, 356, 598, 357, 183, ! 522, 184, 303, 304, 305, 497, 449, 21, 292, 614, ! 189, 190, 191, 192, 193, 194, 195, 196, 30, 31, ! 32, 33, 34, 35, 36, 37, 38, 39, 483, 484, ! 332, 203, 197, 40, 204, 41, 42, 43, 44, 45, ! 219, 66, 214, 220, 572, 67, 500, 293, 206, 47, ! 284, 285, 286, 570, 668, 592, 593, 594, 752, 595, ! 682, 596, 597, 763, 805, 851, 766, 807, 852, 503, ! 222, 630, 631, 632, 223, 48, 49, 50, 51, 336, ! 338, 343, 231, 52, 686, 431, 226, 227, 334, 507, ! 510, 508, 511, 341, 342, 198, 288, 388, 634, 635, ! 390, 391, 392, 215, 450, 451, 452, 453, 454, 455, ! 306, 277, 601, 775, 779, 379, 380, 381, 664, 619, ! 278, 457, 185, 665, 711, 712, 768, 713, 770, 307, ! 412, 815, 776, 816, 817, 714, 814, 769, 866, 771, ! 855, 884, 897, 857, 838, 621, 622, 700, 839, 847, ! 848, 849, 887, 468, 548, 485, 641, 785, 486, 487, ! 661, 488, 553, 296, 398, 489, 490, 447, 186 }; static const short yypact[] = { ! 57, 92, 986, 986, 379,-32768,-32768,-32768,-32768, 109, ! 109, 109, 105,-32768, 123,-32768,-32768,-32768,-32768,-32768, ! 165, 316, 509, 1138, 1295, 1166, 311, 1055, 833, 1206, ! 1326, 1453, 1379, 1540, 1605, 1298, 1625, 1591,-32768,-32768, ! 63,-32768,-32768,-32768,-32768,-32768, 109,-32768, 71, 80, ! 125,-32768,-32768, 986,-32768,-32768,-32768, 109, 109, 109, ! 2684, 176, 2602,-32768, 129, 109, 203,-32768, 896,-32768, ! -32768,-32768,-32768, 109,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768, 109,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 109,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 109,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 109, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 109,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768, 109,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 109,-32768,-32768,-32768, ! -32768, 206, 316,-32768,-32768,-32768,-32768,-32768, 42,-32768, ! 162,-32768, 189,-32768,-32768,-32768,-32768,-32768,-32768, 2684, ! 2684, 230, 238, 246,-32768, 483,-32768,-32768,-32768, 2684, ! -32768,-32768, 1797,-32768,-32768, 2684, 254, 270,-32768, 2725, ! 2766,-32768, 3099, 1053, 355, 1471, 2684, 908, 284, 2385, ! 3084, 2553, 3095, 690, 485, 732, 605,-32768, 295, 242, ! 373, 279, 409,-32768, 316, 316, 109,-32768, 109,-32768, ! 323, 109, 2131, 461, 109,-32768,-32768, 129, 109, 293, ! -32768, 1080, 504, 513, 304, 1045, 349, 489,-32768, 358, ! -32768, 542,-32768,-32768,-32768, 2684, 2684, 3026,-32768,-32768, ! 363,-32768, 369, 371,-32768, 387, 2684, 1797,-32768, 1797, ! -32768, 2684, 2684, 464,-32768,-32768, 2684, 2684, 2684, 2684, ! 2684, 2684, 2684, 2684, 2684, 2684, 2684, 2684,-32768,-32768, ! 483, 483, 2684, 2684,-32768, 405,-32768, 486, 424,-32768, ! -32768,-32768,-32768,-32768, 201,-32768, 457,-32768, 390,-32768, ! 513, 186, 316,-32768, 529,-32768,-32768, 2602, 2234,-32768, ! 466, 2172, 478,-32768, 356, 114,-32768,-32768, 532, 206, ! 206,-32768, 109,-32768, 461, 109, 109,-32768,-32768,-32768, ! 461, 109,-32768,-32768, 2385, 3084, 2553, 3095, 690, 485, ! 732, 605,-32768, 499, 502, 1413,-32768, 109,-32768,-32768, ! 546, 506,-32768, 542, 2872, 2890, 508,-32768,-32768, 2475, ! -32768, 3099, 517, 525, 3099, 3099, 2684, 568, 2684, 2684, ! 2437, 3062, 1208, 2564, 983, 879, 879, 288, 288,-32768, ! -32768,-32768,-32768,-32768, 555, 270, 551,-32768, 483, 1558, ! 486,-32768,-32768, 562, 908, 2807, 129, 109,-32768,-32768, ! -32768,-32768, 535,-32768,-32768,-32768, 99, 33, 1230, 557, ! 2684,-32768,-32768, 2684, 2275,-32768, 559,-32768,-32768,-32768, ! -32768,-32768, 2454,-32768, 504, 192, 206,-32768, 581,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 566,-32768, 570, 2684, ! 483, 572, 506, 3026, 2684, 3026,-32768,-32768, 564, 564, ! 616, 2684, 3128, 2197,-32768,-32768,-32768, 314, 478,-32768, ! -32768, 94, 98, 112, 132, 662,-32768, 580,-32768,-32768, ! -32768,-32768,-32768,-32768, 326, 585, 390, 390,-32768, 109, ! -32768,-32768, 588,-32768,-32768, 1709, 3030, 1194, 864, 1875, ! 3055, 1712, 989,-32768,-32768,-32768, 591, 338,-32768,-32768, ! 327,-32768, 586, 590,-32768,-32768,-32768,-32768, 598, 601, ! 1313,-32768,-32768, 659,-32768,-32768,-32768, 602,-32768,-32768, ! 603,-32768,-32768, 109, 109, 3099,-32768, 109, 604, 615, ! 2914, 627, 1862,-32768, 3115,-32768, 483,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 2345,-32768, 2684,-32768,-32768,-32768, 628, 753,-32768, ! -32768,-32768,-32768, 383, 178,-32768,-32768, 945,-32768, 696, ! -32768,-32768, 69,-32768, 206,-32768, 316,-32768,-32768, 3099, ! -32768,-32768, 1313,-32768, 109, 253, 109, 362,-32768,-32768, ! -32768, 109,-32768, 2684,-32768,-32768, 671, 483, 2684,-32768, ! 684, 3099, 646, 644,-32768,-32768, 167, 1998, 2684,-32768, ! 2414,-32768, 687, 2684, 694, 652, 657, 2643, 141, 735, ! -32768,-32768,-32768, 663,-32768,-32768,-32768, 666, 704, 658, ! -32768,-32768,-32768, 2540, 352,-32768,-32768,-32768, 129, 109, ! 109, 538, 553, 158,-32768,-32768, 109, 129, 109, 158, ! -32768, 109,-32768, 1709, 3030, 2076, 3059, 1194, 864, 1772, ! 1536, 1875, 3055, 2144, 3072, 1712, 989, 1837, 1678,-32768, ! -32768,-32768,-32768, 672,-32768,-32768, 416, 421, 1862, 69, ! -32768, 69,-32768, 2684, 88,-32768, 2684, 329,-32768, 2932, ! -32768, 1228, 1862,-32768,-32768, 1930,-32768, 2066,-32768,-32768, ! 3115, 2852,-32768,-32768,-32768,-32768, 668, 2684, 680,-32768, ! 702,-32768,-32768, 206, 316,-32768,-32768,-32768,-32768,-32768, ! 705, 755, 1645, 118,-32768,-32768,-32768,-32768, 383, 336, ! -32768, 109,-32768, 109,-32768,-32768, 109, 178, 178,-32768, ! -32768, 383, 178,-32768,-32768,-32768, 693,-32768,-32768,-32768, ! -32768, 2969, 2684,-32768,-32768, 2969, 2684,-32768,-32768, 2684, ! -32768, 695, 2066,-32768,-32768, 2684,-32768,-32768, 703,-32768, ! 2684, 742, 469,-32768, 268, 475,-32768, 548, 722, 724, ! -32768, 726, 2684, 1732,-32768,-32768,-32768,-32768, 2684,-32768, ! 538, 553, 393,-32768,-32768, 753, 109, 158,-32768, 158, ! -32768,-32768, 253,-32768, 2969,-32768, 2969, 2828,-32768,-32768, ! 3081,-32768, 52, 109,-32768, 461,-32768, 461, 2684, 2684, ! 777, 2540, 713,-32768,-32768,-32768,-32768,-32768, 714,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 121, 720, ! -32768,-32768,-32768, 715, 723,-32768,-32768,-32768,-32768, 729, ! -32768,-32768,-32768,-32768, 731, 740, 483, 97, 728,-32768, ! -32768,-32768,-32768,-32768,-32768, 2684,-32768,-32768,-32768, 2684, ! 730, 121, 738, 121,-32768,-32768,-32768, 739,-32768, 749, ! 824, 155,-32768,-32768, 672, 672,-32768,-32768,-32768, 767, ! 529, 751,-32768,-32768, 2684, 2684, 355, 389,-32768, 759, ! 760, 764, 529,-32768,-32768,-32768, 355,-32768,-32768, 844, ! 851,-32768 }; static const short yypgoto[] = { ! -32768,-32768,-32768,-32768, 87,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 101,-32768, -60, 468, -253, 443,-32768, ! -32768,-32768, -82, 769,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, -293, -299, 549,-32768,-32768, 78, 68, -282, -572, ! 7, 41, 38, 44, 1, 20, 47, 50, -364, -336, ! 299, 302, -330, -326, 303, 305, -496, -461, 454, 456, ! -32768, -161, -127, -503, -200, 503, 683, 748, 774,-32768, ! -532, -135, -210, 470,-32768, 589,-32768, 96, 3, 64, ! -32768, 500,-32768, 315,-32768, -420,-32768, 204,-32768, -533, ! -32768,-32768, 292,-32768,-32768,-32768,-32768,-32768,-32768, -133, ! 319, 160, 180, -85, 202,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768, 472, -94,-32768, 583,-32768, ! -32768, 233, 232, 573, 492, -84,-32768,-32768, -526, -272, ! -397, -442,-32768, 465,-32768,-32768,-32768,-32768,-32768,-32768, ! -268,-32768,-32768, -452, 104,-32768,-32768, 545, -343,-32768, ! 308,-32768,-32768, -521,-32768,-32768,-32768,-32768,-32768, 442, ! -395, 111, -689, -172, -150,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -743, 84, ! -32768, 90,-32768, 487,-32768, -522,-32768,-32768,-32768,-32768, ! -32768,-32768, 476, -298,-32768,-32768,-32768,-32768, 56 }; ! ! #define YYLAST 3188 ! ! static const short yytable[] = { ! 176, 397, 188, 26, 26, 46, 46, 224, 221, 22, ! 22, 315, 57, 58, 59, 417, 389, 309, 419, 375, ! 620, 420, 27, 27, 546, 73, 626, 82, 640, 91, ! 416, 100, 666, 109, 479, 118, 409, 127, 617, 136, ! 24, 24, 274, 23, 23, 615, 25, 25, 479, 28, ! 28, 716, 29, 29, 26, 229, 46, -1, 53, 53, ! 22, 659, 480, 541, 689, 46, 333, 46, 481, 545, ! 663, 199, 482, 27, 145, 146, 480, 233, 234, 620, ! 616, 810, 481, 145, 146, 301, 482, 239, 243, 618, ! 54, 24, -2, 244, 23, -444, 660, 25, 828, -445, ! 28, 562, 201, 29, 279, 200, 141, 142, 202, 53, ! 144, 456, 867, -446, 575, -106, 471, 577, 14, 777, ! 617, 144, 144, 144, 410, 841, 210, 615, 145, 146, ! 845, 228, 375, -447, 742, 829, 8, 144, 600, 14, ! 153, 889, 733, 861, 145, 146, 144, 143, 618, 148, ! 150, 152, 300, 346, 754, 144, 636, 636, 611, 14, ! 147, 205, 616, 352, 144, 353, 211, 212, 868, 149, ! 400, 762, 60, 144, 333, 46, 669, 876, 671, -424, ! 862, 63, 144, -425, 479, 778, 466, 539, 14, 846, ! 61, 144, 73, 651, 82, 547, 91, -426, 100, 697, ! 144, 880, 73, -106, 82, 788, 790, 459, 898, 63, ! 216, 687, 480, 376, 151, 46, 239, -427, 481, 799, ! 46, 652, 482, 68, 199, 211, 212, 655, 328, 460, ! 46, 656, 62, 587, 324, 588, 637, 399, 881, 837, ! 46, 406, 426, 187, 428, 638, 212, 329, 736, 70, ! 46, 230, 46, 211, 212, 201, 63, 216, 200, 316, ! 212, 202, 751, 820, 217, 326, 238, 437, 325, 394, ! 144, 327, 14, 218, 330, 501, 546, 331, 232, 528, ! 531, 534, 537, 335, 383, 546, 79, 207, 283, 384, ! 624, 208, 672, 315, 675, 210, 440, 235, -274, 673, ! 46, 529, 532, 535, 538, 236, 761, 295, 617, 14, ! 308, 217, -274, 237, 310, 615, 87, 7, 88, 63, ! 218, 545, 239, 9, 10, 11, 737, 73, 738, 82, ! 545, 91, 340, 100, 636, 636, 328, 245, 46, 63, ! 492, 14, 324, 493, 225, 792, 265, 266, 267, 519, ! 616, 521, -274, 882, 883, 329, -274, 302, 246, 14, ! -109, -109, -109, -109, 274, 63, -109, 287, -109, -109, ! -109, 372, 373, 326, 64, 746, 325, 311, 289, 327, ! 75, 312, 330, 65, -109, 331, 63, 627, 318, 46, ! 294, 335, 208, 199, 628, -247, 211, 212, 525, 477, ! 422, 423, 526, 629, 212, 475, 290, 291, 676, 542, ! 558, 418, 295, 477, 543, 559, 84, 421, 478, 475, ! 64, 479, 556, 783, 201, 784, 557, 200, 718, 65, ! 202, 667, 478, 427, 321, 717, 46, 727, 46, 476, ! 246, 628, 674, 337, 340, -109, 347, 547, 386, 480, ! 629, 212, 348, 476, 349, 481, 547, 387, 212, 482, ! 723, 212, 302, 55, 56, -473, -473, -473, -473, 874, ! 875, 350, 891, -473, -473, -473, 819, 892, 73, 446, ! 91, 613, 109, 467, 127, 283, 145, 146, 377, -473, ! 322, 7, 93, 5, 396, 7, 8, 9, 10, 11, ! 734, 9, 10, 11, 312, 735, 831, 382, 832, 208, ! -80, 290, 291, 5, 69, 7, 70, 13, 378, 14, ! 15, 9, 10, 11, 385, 71, 76, 80, 85, 527, ! 530, 340, 536, 107, 112, 116, 121, 13, 156, 14, ! 613, 279, 26, 339, 46, 145, 146, 696, 22, 477, ! -105, 552, 552, 804, 315, 475, 402, 312, 647, 806, ! 46, 27, 407, 208, 643, 549, 564, 566, 478, 765, ! 764, 316, 212, 323, -371, 210, 413, 648, -274, 24, ! 211, 212, 23, -379, -379, 25, 424, 886, 28, 476, ! 429, 29, -274, -243, 430, 645, 435, 623, 644, 896, ! 438, 646, 469, 212, 649, 721, 212, 650, 439, 578, ! 579, 7, 102, 580, 441, 211, 212, 9, 10, 11, ! 723, 212, 248, 250, 26, 505, 46, 599, 414, 415, ! 22, 46, -274, 781, 782, 199, -274, 758, 444, 726, ! 46, 445, 612, 27, 199, 462, 73, 491, 82, 495, ! 91, 513, 100, 436, 109, 514, 118, 517, 127, 674, ! 136, 24, 523, 302, 23, 540, 201, 25, 544, 200, ! 28, 551, 202, 29, 555, 201, 560, 678, 200, 623, ! 561, 202, 563, 703, 704, 565, 210, 317, 680, 581, ! 574, 576, 71, 76, 80, 85, 7, 88, 582, 662, ! 802, 612, 9, 10, 11, 72, 77, 81, 86, 698, ! 584, 625, 812, 108, 113, 117, 122, -30, 818, 706, ! 14, 707, 708, 709, 710, 719, 720, 731, 732, 725, ! 683, 684, 685, -31, 728, 729, 693, 730, 7, 97, ! 692, 694, 699, 276, 9, 10, 11, 702, 833, 834, ! 705, 836, 757, 393, 472, 633, 639, 5, 6, 7, ! 8, 611, 14, 474, 759, 9, 10, 11, 396, 760, ! 743, 773, 772, 747, 89, 94, 98, 103, 791, 677, ! 798, 13, 125, 130, 134, 139, 477, 801, 803, 808, ! 144, 809, 475, 811, 835, 836, 840, 844, 853, 869, ! 90, 95, 99, 104, 850, 478, 854, 859, 126, 131, ! 135, 140, 26, 856, 46, 858, 863, 295, 22, 295, ! 870, 458, 872, 877, 836, 890, 476, 71, 76, 80, ! 85, 27, 878, 879, 885, 888, -535, 793, 96, 7, ! 97, 795, 893, 894, 900, 9, 10, 11, 895, 24, ! 496, 901, 23, 465, 411, 25, 653, 470, 28, 654, ! 657, 29, 658, 14, 509, 512, 498, 623, 499, 92, ! 7, 93, 72, 77, 81, 86, 9, 10, 11, 317, ! 317, 395, 821, 822, 463, 823, 502, 670, 688, 753, ! 824, 786, 825, 458, 458, 533, 458, 209, 780, 830, ! -26, -26, -26, -26, 518, 739, 767, 744, -26, -26, ! -26, 145, 146, 280, 281, 282, 432, -249, 425, 842, ! 290, 291, 516, 210, -26, 461, -274, 715, 843, 290, ! 291, 393, 393, 787, 789, 263, 264, 265, 266, 267, ! -274, 89, 94, 98, 103, 871, 571, 860, 573, 5, ! 6, 7, 8, 873, 0, 642, 550, 9, 10, 11, ! 554, 0, 0, 211, 212, 0, 0, 90, 95, 99, ! 104, 0, 0, 13, 0, 14, 0, 0, 71, 76, ! -274, 0, 107, 112, -274, -26, 0, 4, 0, -118, ! 5, 6, 7, 8, 128, 7, 129, 0, 9, 10, ! 11, 9, 10, 11, 344, 345, 0, 72, 77, 81, ! 86, 0, 0, 12, 13, 351, 14, 15, 393, 393, ! 354, 355, 0, 0, 0, 360, 361, 362, 363, 364, ! 365, 366, 367, 368, 369, 370, 371, 261, 262, 263, ! 264, 265, 266, 267, -118, 0, 319, 0, 0, -22, ! -22, -22, -22, -118, 701, 0, 0, -22, -22, -22, ! 92, 7, 93, 0, 0, 0, 0, 9, 10, 11, ! 16, 0, 210, -22, 0, -274, 89, 94, 98, 103, ! 0, 313, 0, 0, -18, -18, -18, -18, 0, -274, ! 0, 0, -18, -18, -18, 0, 722, 724, 0, 0, ! 0, 0, 90, 95, 99, 104, 0, 210, -18, 0, ! -274, 0, 211, 212, 740, 268, 269, 512, 270, 271, ! 272, 273, 0, 0, -274, 0, 0, 442, 443, -274, ! 0, 0, 0, -274, -22, 0, 0, 0, 0, -248, ! 0, 0, 5, 74, 7, 75, 71, 76, 80, 85, ! 9, 10, 11, 0, 107, 112, 116, 121, 72, 77, ! 0, 0, 108, 113, -274, 0, 13, 0, -274, -18, ! 5, 83, 7, 84, 0, 0, 0, 0, 9, 10, ! 11, 0, 0, 393, 393, 0, 0, 0, 0, 0, ! 0, 0, 393, 393, 13, 0, 393, 393, 515, 87, ! 7, 88, 0, 520, 0, 0, 9, 10, 11, 0, ! 524, 101, 7, 102, 0, 0, 0, 533, 9, 10, ! 11, 0, -244, 0, 14, 89, 94, 0, 0, 125, ! 130, 472, 0, 473, 5, 6, 7, 8, 749, 0, ! 474, 0, 9, 10, 11, 722, 724, 724, 0, 0, ! -246, 90, 95, 0, 0, 126, 131, 0, 13, 533, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 569, ! 0, 251, 252, 253, 0, 254, 255, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 0, ! -250, 591, 0, 864, 865, 0, 0, 0, 0, 5, ! 78, 7, 79, 128, 7, 129, 0, 9, 10, 11, ! 9, 10, 11, -535, 567, 0, 154, 0, 750, 0, ! 0, 155, 156, 13, 157, 14, 72, 77, 81, 86, ! 5, 105, 7, 106, 108, 113, 117, 122, 9, 10, ! 11, 569, 158, 0, 15, 0, 159, 160, 161, 162, ! 163, 0, 679, 0, 13, 164, 14, 681, 0, 0, ! 0, 165, 0, 0, 166, 0, 591, 690, 0, 167, ! 168, 169, 691, 0, 0, 170, 171, 0, 0, -245, ! 172, 0, -256, 5, 114, 7, 115, 0, 0, 0, ! 0, 9, 10, 11, 0, 89, 94, 98, 103, 173, ! 174, 0, 568, 125, 130, 134, 139, 13, 0, 14, ! -251, 0, 0, 0, 322, 0, 0, 5, 0, 7, ! 8, 90, 95, 99, 104, 9, 10, 11, 0, 126, ! 131, 135, 140, 0, 0, 0, 0, 591, 0, 0, ! 0, 13, 741, 14, 15, 745, 0, 0, 0, 0, ! 0, 591, 0, 0, 591, 0, 591, 5, 110, 7, ! 111, 0, 0, -253, 0, 9, 10, 11, 0, 0, ! 0, 0, 275, 0, -449, -449, -449, -449, -449, -449, ! -449, 13, -449, -449, -449, -449, -449, 0, -449, -449, ! -449, -449, -449, -449, -449, -449, -449, -449, -449, -449, ! -449, -449, -449, -449, -449, -449, -449, -449, -449, 0, ! 0, 794, 0, -449, 0, 796, 0, 0, 797, -449, ! 0, 591, -449, 0, 800, 0, 0, -449, -449, -449, ! 0, 0, 0, -449, -449, 0, 0, -252, -449, 0, ! 0, 101, 7, 102, 5, 119, 7, 120, 9, 10, ! 11, 0, 9, 10, 11, -449, 276, -449, -449, 448, ! -449, -473, -473, -473, -473, -473, -473, -473, 13, -473, ! -473, -473, -473, -473, 0, -473, -473, -473, -473, -473, ! -473, -473, -473, -473, -473, -473, -473, -473, -473, -473, ! 0, -473, -473, -473, -473, -473, 137, 7, 138, 0, ! -473, 0, 0, 9, 10, 11, -473, 0, 0, -473, ! 123, 7, 124, 0, -473, -473, -473, 9, 10, 11, ! -473, -473, 0, 0, -254, -473, 0, 0, 0, 0, ! 132, 7, 133, 0, 0, 14, 0, 9, 10, 11, ! 0, 0, -473, 0, -473, -473, 774, -473, -451, -451, ! 0, 0, 0, -451, -451, 14, -451, 0, 0, 0, ! -451, 0, -451, -451, -451, -451, -451, -451, -451, -451, ! -451, -451, -451, 0, -451, -258, -451, 0, -451, -451, ! -451, -451, -451, 137, 7, 138, 0, -451, 0, -255, ! 9, 10, 11, -451, 0, 0, -451, 0, 0, 0, ! 0, -451, -451, -451, 0, 0, 0, -451, -451, -257, ! 0, 0, -451, 5, 69, 7, 70, 123, 7, 124, ! 0, 9, 10, 11, 9, 10, 11, 0, 0, -451, ! 0, -451, -451, 813, -451, -480, -480, 13, 0, 14, ! -480, -480, 14, -480, 0, 0, 0, -480, 0, -480, ! -480, -480, -480, -480, -480, -480, -480, -480, -480, -480, ! 0, -480, 0, -480, 0, -480, -480, -480, -480, -480, ! 0, 0, 0, 0, -480, 0, 0, 96, 7, 97, ! -480, 0, 0, -480, 9, 10, 11, 0, -480, -480, ! -480, 0, 0, 0, -480, -480, 0, 0, 240, -480, ! 154, 5, 14, 7, 8, 155, 156, 0, 157, 9, ! 10, 11, 0, 0, 0, 0, -480, 0, -480, -480, ! 0, -480, 0, 0, 0, 13, 158, 14, 15, 0, ! 159, 160, 161, 162, 163, 0, 0, 0, 0, 164, ! 0, 0, 132, 7, 133, 165, 0, 0, 166, 9, ! 10, 11, 0, 167, 168, 169, 0, 0, 0, 170, ! 171, 0, 0, 585, 172, 586, 146, 14, 0, 0, ! 155, 156, 0, 157, 0, 0, 0, 0, 0, 5, ! 105, 7, 106, 173, 174, 0, 241, 9, 10, 11, ! 0, 158, 0, 15, 0, 159, 160, 161, 162, 163, ! 0, 0, 0, 13, 164, 14, 0, 0, 0, 0, ! 165, 0, 0, 166, 0, 0, 0, 0, 167, 168, ! 169, 0, 0, 0, 170, 171, 0, 0, 587, 172, ! 588, 585, 0, 586, 146, 0, 0, 0, 155, 156, ! 0, 157, 0, 0, 0, 0, 0, -302, 173, 174, ! 0, 589, 0, 0, 0, 0, 0, 0, 0, 158, ! 0, 15, 0, 159, 160, 161, 162, 163, 0, 0, ! 0, 0, 164, 0, 0, 0, 0, 0, 165, 0, ! 0, 166, 0, 0, 0, 0, 167, 168, 169, 0, ! 0, 0, 170, 171, 0, 0, 587, 172, 588, 585, ! 0, 154, 0, 0, 0, 0, 155, 156, 0, 157, ! 0, 0, 0, 0, 0, -368, 173, 174, 0, 589, ! 0, 0, 0, 0, 0, 0, 0, 158, 0, 15, ! 0, 159, 160, 161, 162, 163, 0, 0, 0, 0, ! 164, 0, -315, 0, 0, 0, 165, 0, 0, 166, ! 0, 0, 0, 0, 167, 168, 169, 0, 0, 0, ! 170, 171, 0, 0, -315, 172, -315, 585, 0, 154, ! 0, 0, 0, 0, 155, 156, 0, 157, 0, 0, ! 5, 78, 7, 79, 173, 174, 0, 589, 9, 10, ! 11, 0, 0, 0, 0, 158, 0, 15, 0, 159, ! 160, 161, 162, 163, 13, 0, 14, 0, 164, 0, ! 0, 0, 0, 0, 165, 0, 0, 166, 0, 0, ! 0, 0, 167, 168, 169, 0, 0, 0, 170, 171, ! 0, 0, 0, 172, 154, 5, 297, 7, 8, 155, ! 156, 0, 157, 9, 10, 11, 0, 0, 5, 114, ! 7, 115, 173, 174, 0, 589, 9, 10, 11, 13, ! 158, 14, 15, 0, 159, 160, 161, 162, 163, 0, ! 0, 0, 13, 164, 14, 154, 0, 403, 0, 165, ! 155, 156, 166, 157, 0, 0, 0, 167, 168, 298, ! 0, 0, 0, 170, 171, 0, 0, 0, 172, 0, ! 0, 158, 0, 15, 0, 159, 160, 161, 162, 163, ! 0, 0, 0, 0, 164, 0, 0, 173, 174, 0, ! 165, 299, 0, 166, 0, 0, 0, 0, 167, 168, ! 404, 0, 0, 0, 170, 171, 0, 154, 0, 172, ! 0, 0, 155, 156, 0, 157, 256, 257, 258, 259, ! 260, 261, 262, 263, 264, 265, 266, 267, 173, 174, ! 0, 0, 405, 158, 0, 15, 0, 159, 160, 161, ! 162, 163, 0, 0, 0, 0, 164, 0, 154, 0, ! 0, 0, 165, 155, 156, 166, 157, 0, 0, 0, ! 167, 168, 169, 0, 0, 0, 170, 171, 0, 0, ! 0, 172, 0, 0, 158, 0, 15, 0, 159, 160, ! 161, 162, 163, 0, 0, 0, 0, 164, 0, 0, ! 173, 174, 0, 165, 401, 0, 166, 0, 0, 0, ! 0, 167, 168, 169, 0, 0, 0, 170, 171, 0, ! 0, 0, 172, 0, 0, 0, 0, 0, 586, 602, ! 6, 7, 8, 155, 156, 0, 157, 9, 10, 11, ! 0, 173, 174, 0, 0, 494, 603, 604, 605, 606, ! 607, 608, 609, 13, 158, 14, 15, 0, 159, 160, ! 161, 162, 163, 0, 0, 0, 0, 164, 0, 5, ! 0, 7, 70, 165, 0, 0, 166, 9, 10, 11, ! 0, 167, 168, 169, 0, 0, 0, 170, 171, 0, ! 0, 0, 172, 13, 0, 14, 0, 586, 146, 0, ! 0, 0, 155, 156, 0, 157, 0, 0, 0, 610, ! 0, 173, 174, 0, 611, 603, 604, 605, 606, 607, ! 608, 609, 0, 158, 0, 15, 0, 159, 160, 161, ! 162, 163, 0, 0, 0, 0, 164, 0, 5, 6, ! 7, 8, 165, 0, 0, 166, 9, 10, 11, 0, ! 167, 168, 169, 0, 0, 0, 170, 171, 154, 0, ! 0, 172, 13, 155, 156, 0, 157, 257, 258, 259, ! 260, 261, 262, 263, 264, 265, 266, 267, 610, 0, ! 173, 174, 0, 611, 158, 0, 15, 0, 159, 160, ! 161, 162, 163, 0, 0, 0, 0, 164, 0, 0, ! 0, 0, 0, 165, 0, 0, 166, 0, 0, 0, ! 0, 167, 168, 169, 0, 0, 0, 170, 171, 0, ! 0, 0, 172, 154, 5, 6, 7, 8, 155, 156, ! 0, 157, 9, 10, 11, 0, 0, 5, 0, 7, ! 79, 173, 174, 0, 436, 9, 10, 11, 13, 158, ! 14, 15, 0, 159, 160, 161, 162, 163, 0, 0, ! 0, 13, 164, 14, 0, 0, 0, 0, 165, 0, ! 0, 166, 0, 0, 0, 0, 167, 168, 169, 0, ! 0, 0, 170, 171, 0, 154, 5, 172, 7, 8, ! 155, 156, 0, 157, 9, 10, 11, 260, 261, 262, ! 263, 264, 265, 266, 267, 0, 173, 174, 0, 0, ! 13, 158, 14, 15, 0, 159, 160, 161, 162, 163, ! 0, 0, 0, 0, 164, 0, 154, 0, 0, 0, ! 165, 155, 156, 166, 157, 0, 0, 0, 167, 168, ! 169, 0, 0, 0, 170, 171, 0, 0, 0, 172, ! 0, 0, 158, 0, 15, 0, 159, 160, 161, 162, ! 163, 0, 0, 0, 0, 164, 0, 154, 173, 174, ! 0, 165, 155, 156, 166, 157, 0, 0, 0, 167, ! 168, 169, 0, 0, 0, 170, 171, 0, 0, 0, ! 172, 0, 0, 158, 0, 15, 0, 159, 160, 161, ! 162, 163, 0, 0, 0, 0, 164, 695, 154, 173, ! 174, 0, 165, 155, 156, 166, 157, 0, 0, 0, ! 167, 168, 169, 0, 0, 0, 170, 171, 0, 0, ! 0, 172, 0, 0, 158, 0, 15, 0, 159, 160, ! 161, 162, 163, 0, 0, 0, 0, 164, 0, 154, ! 173, 174, 0, 165, 155, 156, 166, 157, 0, 0, ! 0, 167, 168, 169, 0, 0, 0, 170, 171, 0, ! 0, 0, 247, 0, 0, 158, 0, 15, 0, 159, ! 160, 161, 162, 163, 0, 0, 0, 0, 164, 0, ! 464, 173, 174, 0, 165, 155, 156, 166, 157, 0, ! 0, 0, 167, 168, 169, 0, 0, 0, 170, 171, ! 0, 0, 0, 249, 0, 0, 158, 0, 15, 0, ! 159, 160, 161, 162, 163, 0, 0, 0, 0, 164, ! 0, 0, 173, 174, 0, 165, 0, 0, 166, 0, ! 0, 0, 755, 167, 168, 169, 0, 0, 0, 170, ! 171, 251, 252, 253, 172, 254, 255, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 0, ! 0, 0, 0, 173, 174, 251, 252, 253, 756, 254, ! 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 0, 0, 251, 252, 253, 826, 254, ! 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 251, 252, 253, 0, 254, 255, 256, ! 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, ! 267, 0, 0, 0, 0, 0, 0, 251, 252, 253, ! 433, 254, 255, 256, 257, 258, 259, 260, 261, 262, ! 263, 264, 265, 266, 267, 251, 252, 253, 434, 254, ! 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 0, 0, 0, 0, 0, 0, 14, ! 0, 0, 583, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 251, 252, 253, 748, 254, 255, 256, 257, ! 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, ! 5, 0, 7, 8, 5, 74, 7, 75, 9, 10, ! 11, 0, 9, 10, 11, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 13, 0, 14, 0, 13, 5, ! 110, 7, 111, 5, 83, 7, 84, 9, 10, 11, ! 0, 9, 10, 11, 0, 0, 5, 119, 7, 120, ! 0, 0, 0, 13, 9, 10, 11, 13, 5, 0, ! 7, 75, 0, 0, 0, 0, 9, 10, 11, 5, ! 13, 7, 84, 0, 0, 0, 0, 9, 10, 11, ! 0, 0, 13, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 13, 251, 252, 253, 827, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, ! 266, 267, 251, 252, 253, 0, 254, 255, 256, 257, ! 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, ! 253, 0, 254, 255, 256, 257, 258, 259, 260, 261, ! 262, 263, 264, 265, 266, 267, 255, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267 }; static const short yycheck[] = { ! 60, 294, 62, 2, 3, 2, 3, 142, 141, 2, ! 3, 221, 9, 10, 11, 314, 288, 217, 316, 272, ! 541, 320, 2, 3, 466, 22, 548, 24, 554, 26, ! 312, 28, 564, 30, 398, 32, 304, 34, 541, 36, ! 2, 3, 9, 2, 3, 541, 2, 3, 412, 2, ! 3, 623, 2, 3, 53, 149, 53, 0, 2, 3, ! 53, 557, 398, 458, 597, 62, 227, 64, 398, 466, ! 1, 64, 398, 53, 3, 4, 412, 159, 160, 600, ! 541, 770, 412, 3, 4, 212, 412, 169, 172, 541, ! 3, 53, 0, 175, 53, 1, 557, 53, 46, 1, ! 53, 496, 64, 53, 186, 64, 38, 39, 64, 53, ! 46, 379, 855, 1, 509, 1, 83, 512, 30, 1, ! 623, 57, 58, 59, 10, 814, 27, 623, 3, 4, ! 9, 89, 385, 1, 46, 83, 7, 73, 533, 30, ! 53, 884, 663, 46, 3, 4, 82, 84, 600, 48, ! 49, 50, 212, 237, 687, 91, 553, 554, 89, 30, ! 89, 65, 623, 247, 100, 249, 67, 68, 857, 89, ! 297, 703, 67, 109, 335, 172, 571, 866, 573, 85, ! 83, 3, 118, 85, 548, 67, 386, 455, 30, 68, ! 67, 127, 189, 557, 191, 467, 193, 85, 195, 58, ! 136, 46, 199, 89, 201, 731, 732, 379, 897, 3, ! 4, 44, 548, 273, 89, 212, 298, 85, 548, 752, ! 217, 557, 548, 21, 217, 67, 68, 557, 227, 379, ! 227, 557, 67, 66, 227, 68, 58, 297, 83, 811, ! 237, 301, 336, 67, 338, 67, 68, 227, 668, 7, ! 247, 89, 249, 67, 68, 217, 3, 4, 217, 67, ! 68, 217, 682, 785, 58, 227, 165, 349, 227, 83, ! 206, 227, 30, 67, 227, 83, 718, 227, 89, 451, ! 452, 453, 454, 227, 83, 727, 7, 84, 187, 88, ! 543, 88, 574, 503, 576, 27, 356, 67, 30, 46, ! 297, 451, 452, 453, 454, 67, 701, 211, 811, 30, ! 214, 58, 44, 67, 218, 811, 5, 6, 7, 3, ! 67, 718, 404, 12, 13, 14, 669, 324, 671, 326, ! 727, 328, 231, 330, 731, 732, 335, 83, 335, 3, ! 400, 30, 335, 403, 142, 740, 58, 59, 60, 433, ! 811, 435, 84, 874, 875, 335, 88, 1, 88, 30, ! 4, 5, 6, 7, 9, 3, 10, 83, 12, 13, ! 14, 270, 271, 335, 58, 46, 335, 84, 83, 335, ! 7, 88, 335, 67, 28, 335, 3, 4, 84, 386, ! 67, 335, 88, 386, 58, 84, 67, 68, 84, 398, ! 332, 333, 88, 67, 68, 398, 204, 205, 46, 83, ! 83, 315, 316, 412, 88, 88, 7, 321, 398, 412, ! 58, 785, 84, 721, 386, 723, 88, 386, 628, 67, ! 386, 566, 412, 337, 85, 83, 433, 637, 435, 398, ! 88, 58, 575, 85, 343, 89, 83, 719, 58, 785, ! 67, 68, 83, 412, 83, 785, 728, 67, 68, 785, ! 67, 68, 1, 84, 85, 4, 5, 6, 7, 864, ! 865, 84, 83, 12, 13, 14, 83, 88, 475, 378, ! 477, 541, 479, 387, 481, 384, 3, 4, 83, 28, ! 1, 6, 7, 4, 292, 6, 7, 12, 13, 14, ! 84, 12, 13, 14, 88, 84, 805, 83, 807, 88, ! 46, 309, 310, 4, 5, 6, 7, 28, 32, 30, ! 31, 12, 13, 14, 67, 22, 23, 24, 25, 451, ! 452, 430, 454, 30, 31, 32, 33, 28, 9, 30, ! 600, 623, 541, 1, 541, 3, 4, 607, 541, 548, ! 89, 483, 484, 84, 764, 548, 90, 88, 557, 84, ! 557, 541, 84, 88, 557, 469, 498, 499, 548, 704, ! 703, 67, 68, 84, 85, 27, 44, 557, 30, 541, ! 67, 68, 541, 84, 85, 541, 84, 880, 541, 548, ! 44, 541, 44, 84, 88, 557, 88, 541, 557, 892, ! 83, 557, 67, 68, 557, 67, 68, 557, 83, 513, ! 514, 6, 7, 517, 46, 67, 68, 12, 13, 14, ! 67, 68, 179, 180, 623, 44, 623, 526, 309, 310, ! 623, 628, 84, 718, 719, 628, 88, 697, 83, 636, ! 637, 90, 541, 623, 637, 83, 643, 90, 645, 90, ! 647, 85, 649, 89, 651, 85, 653, 85, 655, 792, ! 657, 623, 46, 1, 623, 85, 628, 623, 83, 628, ! 623, 83, 628, 623, 83, 637, 90, 581, 637, 623, ! 90, 637, 84, 615, 616, 84, 27, 222, 587, 85, ! 88, 88, 189, 190, 191, 192, 6, 7, 83, 3, ! 760, 600, 12, 13, 14, 22, 23, 24, 25, 608, ! 83, 83, 772, 30, 31, 32, 33, 46, 778, 15, ! 30, 17, 18, 19, 20, 629, 630, 659, 660, 633, ! 46, 85, 88, 46, 638, 639, 84, 641, 6, 7, ! 46, 84, 7, 85, 12, 13, 14, 84, 808, 809, ! 84, 811, 84, 288, 1, 553, 554, 4, 5, 6, ! 7, 89, 30, 10, 84, 12, 13, 14, 566, 67, ! 674, 16, 67, 677, 26, 27, 28, 29, 85, 577, ! 85, 28, 34, 35, 36, 37, 785, 84, 46, 67, ! 726, 67, 785, 67, 17, 855, 83, 83, 83, 859, ! 26, 27, 28, 29, 84, 785, 83, 67, 34, 35, ! 36, 37, 811, 84, 811, 84, 88, 721, 811, 723, ! 90, 379, 84, 84, 884, 885, 785, 324, 325, 326, ! 327, 811, 83, 9, 67, 84, 83, 741, 5, 6, ! 7, 745, 83, 83, 0, 12, 13, 14, 84, 811, ! 408, 0, 811, 385, 305, 811, 557, 392, 811, 557, ! 557, 811, 557, 30, 422, 423, 412, 811, 412, 5, ! 6, 7, 189, 190, 191, 192, 12, 13, 14, 414, ! 415, 292, 786, 787, 384, 789, 416, 572, 596, 685, ! 794, 731, 796, 451, 452, 453, 454, 1, 718, 803, ! 4, 5, 6, 7, 432, 672, 704, 675, 12, 13, ! 14, 3, 4, 5, 6, 7, 343, 84, 335, 815, ! 718, 719, 430, 27, 28, 380, 30, 619, 817, 727, ! 728, 466, 467, 731, 732, 56, 57, 58, 59, 60, ! 44, 193, 194, 195, 196, 861, 504, 846, 506, 4, ! 5, 6, 7, 863, -1, 10, 469, 12, 13, 14, ! 484, -1, -1, 67, 68, -1, -1, 193, 194, 195, ! 196, -1, -1, 28, -1, 30, -1, -1, 475, 476, ! 84, -1, 479, 480, 88, 89, -1, 1, -1, 3, ! 4, 5, 6, 7, 5, 6, 7, -1, 12, 13, ! 14, 12, 13, 14, 235, 236, -1, 324, 325, 326, ! 327, -1, -1, 27, 28, 246, 30, 31, 553, 554, ! 251, 252, -1, -1, -1, 256, 257, 258, 259, 260, ! 261, 262, 263, 264, 265, 266, 267, 54, 55, 56, ! 57, 58, 59, 60, 58, -1, 1, -1, -1, 4, ! 5, 6, 7, 67, 612, -1, -1, 12, 13, 14, ! 5, 6, 7, -1, -1, -1, -1, 12, 13, 14, ! 84, -1, 27, 28, -1, 30, 328, 329, 330, 331, ! -1, 1, -1, -1, 4, 5, 6, 7, -1, 44, ! -1, -1, 12, 13, 14, -1, 631, 632, -1, -1, ! -1, -1, 328, 329, 330, 331, -1, 27, 28, -1, ! 30, -1, 67, 68, 672, 62, 63, 675, 65, 66, ! 67, 68, -1, -1, 44, -1, -1, 358, 359, 84, ! -1, -1, -1, 88, 89, -1, -1, -1, -1, 84, ! -1, -1, 4, 5, 6, 7, 643, 644, 645, 646, ! 12, 13, 14, -1, 651, 652, 653, 654, 475, 476, ! -1, -1, 479, 480, 84, -1, 28, -1, 88, 89, ! 4, 5, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, -1, 718, 719, -1, -1, -1, -1, -1, ! -1, -1, 727, 728, 28, -1, 731, 732, 429, 5, ! 6, 7, -1, 434, -1, -1, 12, 13, 14, -1, ! 441, 5, 6, 7, -1, -1, -1, 775, 12, 13, ! 14, -1, 84, -1, 30, 477, 478, -1, -1, 481, ! 482, 1, -1, 3, 4, 5, 6, 7, 10, -1, ! 10, -1, 12, 13, 14, 780, 781, 782, -1, -1, ! 84, 477, 478, -1, -1, 481, 482, -1, 28, 817, ! 52, 53, 54, 55, 56, 57, 58, 59, 60, 500, ! -1, 43, 44, 45, -1, 47, 48, 49, 50, 51, ! 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, ! 84, 522, -1, 851, 852, -1, -1, -1, -1, 4, ! 5, 6, 7, 5, 6, 7, -1, 12, 13, 14, ! 12, 13, 14, 83, 1, -1, 3, -1, 90, -1, ! -1, 8, 9, 28, 11, 30, 643, 644, 645, 646, ! 4, 5, 6, 7, 651, 652, 653, 654, 12, 13, ! 14, 572, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, -1, 583, -1, 28, 42, 30, 588, -1, -1, ! -1, 48, -1, -1, 51, -1, 597, 598, -1, 56, ! 57, 58, 603, -1, -1, 62, 63, -1, -1, 84, ! 67, -1, 84, 4, 5, 6, 7, -1, -1, -1, ! -1, 12, 13, 14, -1, 647, 648, 649, 650, 86, ! 87, -1, 89, 655, 656, 657, 658, 28, -1, 30, ! 84, -1, -1, -1, 1, -1, -1, 4, -1, 6, ! 7, 647, 648, 649, 650, 12, 13, 14, -1, 655, ! 656, 657, 658, -1, -1, -1, -1, 668, -1, -1, ! -1, 28, 673, 30, 31, 676, -1, -1, -1, -1, ! -1, 682, -1, -1, 685, -1, 687, 4, 5, 6, ! 7, -1, -1, 84, -1, 12, 13, 14, -1, -1, ! -1, -1, 1, -1, 3, 4, 5, 6, 7, 8, ! 9, 28, 11, 12, 13, 14, 15, -1, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, 30, 31, 32, 33, 34, 35, 36, 37, -1, ! -1, 742, -1, 42, -1, 746, -1, -1, 749, 48, ! -1, 752, 51, -1, 755, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, 84, 67, -1, ! -1, 5, 6, 7, 4, 5, 6, 7, 12, 13, ! 14, -1, 12, 13, 14, 84, 85, 86, 87, 1, ! 89, 3, 4, 5, 6, 7, 8, 9, 28, 11, ! 12, 13, 14, 15, -1, 17, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, ! -1, 33, 34, 35, 36, 37, 5, 6, 7, -1, ! 42, -1, -1, 12, 13, 14, 48, -1, -1, 51, ! 5, 6, 7, -1, 56, 57, 58, 12, 13, 14, ! 62, 63, -1, -1, 84, 67, -1, -1, -1, -1, ! 5, 6, 7, -1, -1, 30, -1, 12, 13, 14, ! -1, -1, 84, -1, 86, 87, 1, 89, 3, 4, ! -1, -1, -1, 8, 9, 30, 11, -1, -1, -1, ! 15, -1, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, -1, 29, 84, 31, -1, 33, 34, ! 35, 36, 37, 5, 6, 7, -1, 42, -1, 84, ! 12, 13, 14, 48, -1, -1, 51, -1, -1, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, 84, ! -1, -1, 67, 4, 5, 6, 7, 5, 6, 7, ! -1, 12, 13, 14, 12, 13, 14, -1, -1, 84, ! -1, 86, 87, 1, 89, 3, 4, 28, -1, 30, ! 8, 9, 30, 11, -1, -1, -1, 15, -1, 17, ! 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, -1, 5, 6, 7, ! 48, -1, -1, 51, 12, 13, 14, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, 1, 67, ! 3, 4, 30, 6, 7, 8, 9, -1, 11, 12, ! 13, 14, -1, -1, -1, -1, 84, -1, 86, 87, ! -1, 89, -1, -1, -1, 28, 29, 30, 31, -1, ! 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, -1, 5, 6, 7, 48, -1, -1, 51, 12, ! 13, 14, -1, 56, 57, 58, -1, -1, -1, 62, ! 63, -1, -1, 1, 67, 3, 4, 30, -1, -1, ! 8, 9, -1, 11, -1, -1, -1, -1, -1, 4, ! 5, 6, 7, 86, 87, -1, 89, 12, 13, 14, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, 28, 42, 30, -1, -1, -1, -1, ! 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, 66, 67, ! 68, 1, -1, 3, 4, -1, -1, -1, 8, 9, ! -1, 11, -1, -1, -1, -1, -1, 85, 86, 87, ! -1, 89, -1, -1, -1, -1, -1, -1, -1, 29, ! -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, ! -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, -1, 66, 67, 68, 1, ! -1, 3, -1, -1, -1, -1, 8, 9, -1, 11, ! -1, -1, -1, -1, -1, 85, 86, 87, -1, 89, ! -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, 44, -1, -1, -1, 48, -1, -1, 51, ! -1, -1, -1, -1, 56, 57, 58, -1, -1, -1, ! 62, 63, -1, -1, 66, 67, 68, 1, -1, 3, ! -1, -1, -1, -1, 8, 9, -1, 11, -1, -1, ! 4, 5, 6, 7, 86, 87, -1, 89, 12, 13, ! 14, -1, -1, -1, -1, 29, -1, 31, -1, 33, ! 34, 35, 36, 37, 28, -1, 30, -1, 42, -1, ! -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, ! -1, -1, 56, 57, 58, -1, -1, -1, 62, 63, ! -1, -1, -1, 67, 3, 4, 5, 6, 7, 8, ! 9, -1, 11, 12, 13, 14, -1, -1, 4, 5, ! 6, 7, 86, 87, -1, 89, 12, 13, 14, 28, ! 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, ! -1, -1, 28, 42, 30, 3, -1, 5, -1, 48, ! 8, 9, 51, 11, -1, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, -1, 67, -1, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, -1, 86, 87, -1, ! 48, 90, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, 3, -1, 67, ! -1, -1, 8, 9, -1, 11, 49, 50, 51, 52, ! 53, 54, 55, 56, 57, 58, 59, 60, 86, 87, ! -1, -1, 90, 29, -1, 31, -1, 33, 34, 35, ! 36, 37, -1, -1, -1, -1, 42, -1, 3, -1, ! -1, -1, 48, 8, 9, 51, 11, -1, -1, -1, ! 56, 57, 58, -1, -1, -1, 62, 63, -1, -1, ! -1, 67, -1, -1, 29, -1, 31, -1, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, ! 86, 87, -1, 48, 90, -1, 51, -1, -1, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, -1, -1, -1, -1, -1, 3, 4, ! 5, 6, 7, 8, 9, -1, 11, 12, 13, 14, ! -1, 86, 87, -1, -1, 90, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, -1, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, -1, 4, ! -1, 6, 7, 48, -1, -1, 51, 12, 13, 14, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, 28, -1, 30, -1, 3, 4, -1, ! -1, -1, 8, 9, -1, 11, -1, -1, -1, 84, ! -1, 86, 87, -1, 89, 21, 22, 23, 24, 25, ! 26, 27, -1, 29, -1, 31, -1, 33, 34, 35, ! 36, 37, -1, -1, -1, -1, 42, -1, 4, 5, ! 6, 7, 48, -1, -1, 51, 12, 13, 14, -1, ! 56, 57, 58, -1, -1, -1, 62, 63, 3, -1, ! -1, 67, 28, 8, 9, -1, 11, 50, 51, 52, ! 53, 54, 55, 56, 57, 58, 59, 60, 84, -1, ! 86, 87, -1, 89, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, 3, 4, 5, 6, 7, 8, 9, ! -1, 11, 12, 13, 14, -1, -1, 4, -1, 6, ! 7, 86, 87, -1, 89, 12, 13, 14, 28, 29, ! 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, ! -1, 28, 42, 30, -1, -1, -1, -1, 48, -1, ! -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, 3, 4, 67, 6, 7, ! 8, 9, -1, 11, 12, 13, 14, 53, 54, 55, ! 56, 57, 58, 59, 60, -1, 86, 87, -1, -1, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, 3, -1, -1, -1, ! 48, 8, 9, 51, 11, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, -1, 67, ! -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, -1, -1, -1, -1, 42, -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, -1, -1, 56, ! 57, 58, -1, -1, -1, 62, 63, -1, -1, -1, ! 67, -1, -1, 29, -1, 31, -1, 33, 34, 35, ! 36, 37, -1, -1, -1, -1, 42, 84, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, -1, -1, ! 56, 57, 58, -1, -1, -1, 62, 63, -1, -1, ! -1, 67, -1, -1, 29, -1, 31, -1, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, ! -1, -1, 56, 57, 58, -1, -1, -1, 62, 63, ! -1, -1, -1, 67, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, -1, 86, 87, -1, 48, -1, -1, 51, -1, ! -1, -1, 10, 56, 57, 58, -1, -1, -1, 62, ! 63, 43, 44, 45, 67, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, ! -1, -1, -1, 86, 87, 43, 44, 45, 46, 47, ! 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, -1, -1, 43, 44, 45, 90, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, -1, -1, -1, 43, 44, 45, 88, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 43, 44, 45, 88, 47, ! 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, -1, -1, -1, -1, -1, -1, 30, ! -1, -1, 88, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 43, 44, 45, 83, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! 4, -1, 6, 7, 4, 5, 6, 7, 12, 13, 14, -1, 12, 13, 14, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 28, -1, 30, -1, 28, 4, ! 5, 6, 7, 4, 5, 6, 7, 12, 13, 14, ! -1, 12, 13, 14, -1, -1, 4, 5, 6, 7, ! -1, -1, -1, 28, 12, 13, 14, 28, 4, -1, ! 6, 7, -1, -1, -1, -1, 12, 13, 14, 4, ! 28, 6, 7, -1, -1, -1, -1, 12, 13, 14, ! -1, -1, 28, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, 28, 43, 44, 45, 46, 47, 48, ! 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, ! 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! 45, -1, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, 48, 49, 50, 51, ! 52, 53, 54, 55, 56, 57, 58, 59, 60 }; - /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ - #line 3 "/usr/share/bison/bison.simple" - - /* Skeleton output parser for bison, - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software - Foundation, Inc. - - This program 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 2, or (at your option) - any later version. - - This program 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 this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - - /* As a special exception, when this file is copied by Bison into a - Bison output file, you may use that output file without restriction. - This special exception was added by the Free Software Foundation - in version 1.24 of Bison. */ - - /* This is the parser code that is written into each bison parser when - the %semantic_parser declaration is not specified in the grammar. - It was written by Richard Stallman by simplifying the hairy parser - used when %semantic_parser is specified. */ - - /* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - - #ifdef __cplusplus - # define YYSTD(x) std::x - #else - # define YYSTD(x) x - #endif ! #ifndef YYPARSE_RETURN_TYPE ! #define YYPARSE_RETURN_TYPE int ! #endif ! ! #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 872,2011 ---- }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, ! 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 61, 298, 63, 58, 299, 300, 124, ! 94, 38, 301, 302, 303, 304, 43, 45, 42, 47, ! 37, 305, 306, 307, 308, 46, 40, 91, 309, 310, ! 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, ! 321, 322, 323, 41, 59, 125, 126, 33, 44, 123, ! 93 }; + # endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned short yyr1[] = { ! 0, 91, 92, 92, 94, 93, 95, 93, 96, 96, ! 96, 96, 97, 97, 97, 97, 97, 97, 97, 99, ! 100, 98, 98, 101, 102, 98, 98, 103, 104, 98, ! 98, 105, 105, 106, 106, 106, 106, 106, 106, 106, ! 107, 108, 108, 109, 109, 110, 110, 110, 110, 110, ! 110, 110, 110, 110, 110, 110, 111, 112, 113, 114, ! 114, 115, 115, 115, 115, 115, 115, 115, 115, 115, ! 115, 115, 115, 115, 116, 115, 117, 115, 118, 119, ! 115, 120, 115, 115, 115, 121, 121, 121, 121, 122, ! 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, ! 121, 121, 121, 121, 123, 123, 124, 124, 124, 125, ! 126, 126, 126, 126, 127, 127, 127, 127, 128, 129, ! 130, 131, 131, 131, 131, 131, 131, 132, 132, 132, ! 133, 134, 134, 135, 135, 136, 136, 136, 136, 136, ! 136, 136, 137, 137, 137, 137, 137, 137, 138, 138, ! 138, 138, 138, 138, 139, 139, 139, 139, 139, 140, ! 140, 140, 140, 140, 140, 140, 141, 142, 142, 142, ! 142, 142, 142, 143, 144, 144, 144, 144, 144, 144, ! 144, 144, 144, 144, 145, 145, 145, 145, 145, 146, ! 146, 146, 146, 146, 146, 146, 146, 146, 146, 147, ! 147, 147, 147, 147, 148, 148, 148, 148, 148, 148, ! 148, 148, 149, 149, 149, 149, 149, 149, 149, 149, ! 150, 150, 150, 150, 151, 151, 151, 151, 152, 152, ! 152, 152, 153, 153, 153, 153, 154, 154, 154, 154, ! 154, 154, 154, 154, 155, 155, 155, 155, 155, 155, ! 155, 155, 155, 155, 155, 155, 155, 155, 155, 155, ! 156, 156, 157, 157, 158, 159, 159, 160, 161, 161, ! 161, 162, 162, 163, 163, 164, 164, 166, 165, 165, ! 168, 167, 167, 169, 169, 170, 170, 171, 172, 172, ! 173, 173, 173, 173, 173, 174, 174, 174, 174, 175, ! 176, 175, 175, 177, 177, 178, 178, 179, 179, 180, ! 179, 179, 182, 181, 181, 181, 183, 183, 184, 184, ! 184, 186, 187, 185, 189, 190, 188, 191, 191, 192, ! 192, 192, 192, 192, 193, 193, 194, 194, 194, 195, ! 195, 195, 195, 195, 196, 196, 196, 196, 196, 197, ! 197, 198, 198, 199, 199, 201, 200, 200, 202, 200, ! 200, 203, 200, 204, 200, 205, 205, 205, 206, 206, ! 207, 207, 208, 208, 209, 209, 209, 210, 210, 210, ! 210, 210, 210, 211, 211, 212, 212, 213, 213, 213, ! 214, 214, 214, 215, 215, 215, 216, 216, 218, 217, ! 219, 219, 220, 220, 220, 221, 221, 222, 222, 223, ! 223, 224, 224, 224, 224, 224, 225, 225, 225, 225, ! 225, 225, 225, 225, 225, 226, 226, 226, 226, 227, ! 227, 227, 227, 227, 228, 228, 228, 228, 229, 229, ! 229, 229, 229, 230, 230, 231, 231, 231, 231, 232, ! 233, 234, 235, 236, 237, 237, 238, 238, 239, 240, ! 240, 241, 242, 242, 243, 243, 244, 245, 246, 246, ! 248, 247, 250, 249, 251, 252, 253, 253, 254, 255, ! 256, 258, 257, 257, 257, 259, 260, 257, 257, 257, ! 261, 262, 263, 264, 257, 265, 257, 266, 266, 267, ! 267, 267, 267, 267, 267, 267, 267, 267, 267, 267, ! 267, 267, 267, 268, 268, 268, 268, 269, 269, 270, ! 270, 271, 271, 272, 272, 273, 273, 274, 274, 276, ! 275, 277, 278, 279, 277, 277, 280, 280, 280, 280, ! 281, 281, 282, 282, 282, 282, 282, 283, 283, 283, ! 283, 283, 284, 286, 285, 287, 287, 288, 288, 289, ! 289, 290 ! }; ! ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = ! { ! 0, 2, 0, 1, 0, 2, 0, 3, 1, 1, ! 5, 2, 3, 4, 4, 2, 2, 2, 1, 0, ! 0, 9, 4, 0, 0, 9, 4, 0, 0, 8, ! 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 0, 1, 1, 3, 1, 2, 2, 2, 2, ! 2, 4, 2, 4, 2, 2, 1, 1, 1, 1, ! 4, 1, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 0, 4, 0, 4, 0, 0, ! 7, 0, 5, 3, 3, 1, 1, 1, 1, 0, ! 7, 3, 3, 3, 3, 4, 6, 8, 6, 4, ! 3, 3, 2, 2, 1, 2, 0, 1, 2, 3, ! 1, 1, 2, 2, 4, 4, 2, 2, 3, 0, ! 1, 4, 4, 3, 3, 2, 2, 1, 2, 2, ! 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, ! 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 0, 1, 1, 1, 1, 1, 1, 1, 1, 4, ! 4, 1, 4, 1, 4, 0, 4, 0, 6, 3, ! 0, 6, 3, 0, 1, 1, 2, 6, 1, 3, ! 0, 1, 4, 6, 4, 1, 1, 1, 1, 1, ! 0, 4, 1, 0, 2, 1, 3, 3, 2, 0, ! 4, 1, 0, 4, 1, 1, 1, 2, 2, 5, ! 3, 0, 0, 7, 0, 0, 7, 1, 1, 4, ! 3, 2, 3, 1, 1, 1, 3, 2, 1, 3, ! 2, 3, 3, 4, 3, 4, 3, 2, 1, 1, ! 2, 1, 2, 1, 2, 0, 7, 5, 0, 7, ! 5, 0, 8, 0, 7, 2, 2, 2, 0, 1, ! 0, 1, 1, 2, 0, 3, 2, 3, 4, 3, ! 1, 1, 2, 1, 4, 1, 4, 4, 6, 5, ! 4, 6, 5, 1, 3, 1, 1, 3, 0, 3, ! 0, 1, 0, 1, 2, 1, 1, 1, 3, 2, ! 3, 4, 3, 2, 2, 1, 3, 4, 2, 3, ! 3, 4, 4, 5, 5, 1, 1, 1, 1, 1, ! 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, ! 2, 2, 2, 1, 2, 1, 1, 1, 1, 2, ! 0, 0, 0, 0, 0, 1, 1, 2, 3, 1, ! 2, 1, 1, 5, 1, 1, 2, 2, 2, 2, ! 0, 5, 0, 4, 0, 0, 1, 2, 3, 3, ! 3, 0, 4, 1, 3, 0, 0, 7, 5, 2, ! 0, 0, 0, 0, 12, 0, 6, 2, 1, 1, ! 2, 3, 2, 2, 2, 3, 6, 8, 10, 12, ! 3, 4, 1, 3, 5, 2, 5, 0, 1, 0, ! 1, 0, 1, 1, 3, 4, 7, 1, 3, 0, ! 3, 2, 0, 0, 6, 2, 0, 1, 1, 3, ! 1, 3, 4, 4, 3, 4, 3, 4, 4, 3, ! 4, 3, 1, 0, 3, 1, 2, 1, 3, 1, ! 3, 1 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned short yydefact[] = { ! 4, 0, 6, 0, 1, 0, 0, 268, 159, 265, ! 127, 353, 349, 351, 0, 58, 0, 561, 18, 5, ! 9, 8, 0, 0, 212, 213, 214, 215, 204, 205, ! 206, 207, 216, 217, 218, 219, 208, 209, 210, 211, ! 119, 119, 0, 135, 142, 262, 264, 263, 133, 285, ! 0, 0, 0, 267, 266, 0, 7, 16, 17, 354, ! 350, 352, 0, 0, 0, 348, 260, 283, 0, 273, ! 0, 162, 128, 140, 146, 130, 163, 129, 141, 147, ! 169, 131, 152, 157, 134, 170, 132, 153, 158, 180, ! 136, 138, 144, 143, 181, 137, 139, 145, 195, 148, ! 150, 155, 154, 196, 149, 151, 156, 164, 160, 178, ! 187, 166, 165, 161, 179, 188, 171, 167, 193, 202, ! 173, 172, 168, 194, 203, 182, 174, 176, 185, 184, ! 183, 175, 177, 186, 197, 189, 191, 200, 199, 198, ! 190, 192, 201, 0, 0, 15, 286, 31, 32, 374, ! 365, 374, 366, 363, 367, 11, 85, 86, 104, 56, ! 57, 0, 0, 0, 0, 0, 88, 0, 33, 35, ! 34, 0, 37, 36, 0, 38, 39, 0, 0, 40, ! 59, 0, 0, 61, 43, 45, 87, 0, 0, 290, ! 0, 240, 241, 242, 243, 236, 237, 238, 239, 398, ! 0, 232, 233, 234, 235, 261, 0, 0, 284, 12, ! 283, 30, 0, 283, 0, 0, 283, 347, 333, 260, ! 283, 0, 271, 0, 327, 328, 0, 0, 0, 0, ! 355, 0, 358, 0, 361, 54, 55, 0, 0, 0, ! 49, 46, 0, 466, 0, 0, 48, 0, 0, 0, ! 50, 0, 52, 0, 0, 78, 76, 74, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 103, 102, 0, 41, 0, 0, 105, 0, 462, 454, ! 0, 47, 296, 297, 298, 295, 0, 288, 291, 269, ! 400, 270, 346, 0, 0, 120, 0, 553, 344, 0, ! 0, 418, 0, 0, 0, 28, 0, 474, 111, 475, ! 282, 0, 0, 14, 283, 22, 0, 283, 283, 331, ! 13, 26, 0, 283, 381, 376, 232, 233, 234, 235, ! 228, 229, 230, 231, 119, 119, 373, 0, 374, 283, ! 374, 395, 396, 370, 393, 0, 0, 0, 0, 92, ! 91, 0, 10, 44, 0, 0, 83, 84, 0, 0, ! 0, 0, 72, 73, 71, 70, 69, 68, 67, 62, ! 63, 64, 65, 66, 100, 0, 42, 0, 101, 94, ! 0, 0, 455, 456, 93, 0, 290, 41, 260, 283, ! 399, 401, 406, 405, 407, 415, 345, 274, 275, 0, ! 0, 0, 0, 420, 416, 0, 0, 419, 0, 449, ! 474, 113, 108, 112, 0, 280, 332, 0, 0, 20, ! 279, 330, 24, 357, 474, 474, 375, 382, 0, 360, ! 0, 0, 371, 0, 370, 0, 0, 0, 89, 60, ! 51, 53, 0, 0, 77, 75, 95, 99, 559, 0, ! 465, 434, 464, 474, 474, 474, 474, 0, 443, 0, ! 475, 429, 438, 457, 287, 289, 85, 0, 409, 529, ! 414, 283, 413, 276, 0, 557, 537, 224, 225, 220, ! 221, 226, 227, 222, 223, 119, 119, 555, 0, 538, ! 540, 554, 0, 422, 0, 0, 421, 417, 475, 109, ! 119, 119, 0, 329, 272, 275, 474, 277, 474, 377, ! 383, 475, 379, 385, 475, 283, 283, 397, 394, 283, ! 0, 0, 0, 0, 0, 79, 82, 458, 0, 435, ! 430, 439, 436, 431, 440, 475, 432, 441, 437, 433, ! 442, 444, 451, 452, 292, 0, 294, 408, 410, 0, ! 0, 529, 412, 535, 552, 402, 402, 531, 532, 0, ! 556, 0, 423, 424, 0, 116, 0, 117, 0, 302, ! 300, 299, 281, 475, 0, 475, 283, 378, 283, 0, ! 356, 359, 364, 283, 96, 0, 98, 315, 85, 0, ! 0, 312, 0, 314, 0, 368, 305, 311, 0, 0, ! 0, 560, 452, 463, 268, 0, 0, 0, 0, 0, ! 0, 517, 512, 461, 474, 0, 118, 119, 119, 0, ! 0, 450, 499, 479, 480, 0, 0, 411, 530, 338, ! 260, 283, 283, 334, 335, 283, 549, 403, 406, 260, ! 283, 283, 551, 283, 539, 212, 213, 214, 215, 204, ! 205, 206, 207, 216, 217, 218, 219, 208, 209, 210, ! 211, 119, 119, 541, 558, 0, 29, 459, 0, 0, ! 0, 0, 278, 0, 474, 0, 283, 474, 0, 283, ! 362, 0, 318, 0, 0, 309, 90, 0, 304, 0, ! 317, 308, 80, 0, 515, 502, 503, 504, 0, 0, ! 0, 518, 0, 475, 500, 0, 0, 125, 470, 485, ! 472, 490, 0, 483, 0, 0, 453, 467, 126, 293, ! 409, 529, 547, 283, 337, 283, 340, 548, 404, 409, ! 529, 550, 533, 402, 402, 460, 114, 115, 0, 21, ! 25, 384, 475, 283, 0, 387, 386, 283, 0, 390, ! 97, 0, 320, 0, 0, 306, 307, 0, 513, 505, ! 0, 510, 0, 0, 0, 123, 321, 0, 124, 324, ! 0, 0, 452, 0, 0, 0, 469, 474, 468, 489, ! 0, 501, 341, 342, 0, 336, 339, 0, 283, 283, ! 544, 283, 546, 301, 0, 389, 283, 392, 283, 0, ! 313, 310, 0, 511, 0, 283, 121, 0, 122, 0, ! 0, 0, 0, 519, 0, 484, 452, 453, 476, 474, ! 0, 343, 534, 542, 543, 545, 388, 391, 319, 514, ! 521, 0, 516, 322, 325, 0, 0, 473, 520, 498, ! 491, 0, 495, 482, 478, 477, 0, 0, 0, 0, ! 522, 523, 506, 474, 474, 471, 486, 519, 497, 452, ! 488, 0, 0, 521, 0, 0, 475, 475, 452, 0, ! 496, 0, 0, 0, 507, 524, 0, 0, 487, 492, ! 525, 0, 0, 0, 323, 326, 519, 0, 527, 0, ! 508, 0, 0, 0, 0, 493, 526, 509, 528, 452, ! 494 }; + /* YYDEFGOTO[NTERM-NUM]. */ static const short yydefgoto[] = { ! -1, 1, 2, 3, 5, 19, 20, 21, 316, 506, ! 322, 508, 215, 410, 592, 177, 244, 375, 179, 180, ! 181, 182, 22, 183, 184, 361, 360, 358, 600, 359, ! 185, 524, 186, 305, 306, 307, 499, 451, 23, 294, ! 616, 191, 192, 193, 194, 195, 196, 197, 198, 32, ! 33, 34, 35, 36, 37, 38, 39, 40, 41, 485, ! 486, 334, 205, 199, 42, 206, 43, 44, 45, 46, ! 47, 221, 68, 216, 222, 574, 69, 502, 295, 208, ! 49, 286, 287, 288, 572, 670, 594, 595, 596, 754, ! 597, 684, 598, 599, 765, 807, 853, 768, 809, 854, ! 505, 224, 632, 633, 634, 225, 50, 51, 52, 53, ! 338, 340, 345, 233, 54, 688, 433, 228, 229, 336, ! 509, 512, 510, 513, 343, 344, 200, 290, 390, 636, ! 637, 392, 393, 394, 217, 452, 453, 454, 455, 456, ! 457, 308, 279, 603, 777, 781, 381, 382, 383, 666, ! 621, 280, 459, 187, 667, 713, 714, 770, 715, 772, ! 309, 414, 817, 778, 818, 819, 716, 816, 771, 868, ! 773, 857, 886, 899, 859, 840, 623, 624, 702, 841, ! 849, 850, 851, 889, 470, 550, 487, 643, 787, 488, ! 489, 663, 490, 555, 298, 400, 491, 492, 449, 188 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -713 static const short yypact[] = { ! 159, 169, 177, 961, -713, 961, 441, -713, -713, -713, ! -713, 196, 196, 196, 166, -713, 192, -713, -713, -713, ! -713, -713, 213, 345, 300, 515, 1115, 1018, 458, 408, ! 796, 488, 1236, 1269, 1240, 1454, 1309, 751, 1501, 885, ! -713, -713, 208, -713, -713, -713, -713, -713, 196, -713, ! 127, 133, 150, -713, -713, 961, -713, -713, -713, 196, ! 196, 196, 2755, 229, 2673, -713, 120, 196, 163, -713, ! 1167, -713, -713, -713, -713, 196, -713, -713, -713, -713, ! -713, -713, -713, -713, 196, -713, -713, -713, -713, -713, ! -713, -713, -713, 196, -713, -713, -713, -713, -713, -713, ! -713, -713, 196, -713, -713, -713, -713, -713, -713, -713, ! -713, 196, -713, -713, -713, -713, -713, -713, -713, -713, ! 196, -713, -713, -713, -713, -713, -713, -713, -713, 196, ! -713, -713, -713, -713, -713, -713, -713, -713, 196, -713, ! -713, -713, -713, 501, 345, -713, -713, -713, -713, -713, ! 245, -713, 248, -713, 255, -713, -713, -713, -713, -713, ! -713, 2755, 2755, 330, 343, 357, -713, 534, -713, -713, ! -713, 2755, -713, -713, 1774, -713, -713, 2755, 275, 342, ! -713, 2796, 2837, -713, 3084, 755, 424, 1536, 2755, 615, ! 359, 1022, 784, 1163, 3080, 1077, 719, 1743, 1102, -713, ! 367, 258, 460, 287, 469, -713, 345, 345, 196, -713, ! 196, -713, 413, 196, 2206, 358, 196, -713, -713, 120, ! 196, 238, -713, 447, 499, 502, 289, 2141, 421, 930, ! -713, 425, -713, 482, -713, -713, -713, 2755, 2755, 3049, ! -713, -713, 430, -713, 451, 456, -713, 446, 2755, 1774, ! -713, 1774, -713, 2755, 2755, 462, -713, -713, 2755, 2755, ! 2755, 2755, 2755, 2755, 2755, 2755, 2755, 2755, 2755, 2755, ! -713, -713, 534, 2755, 2755, 534, -713, 463, -713, 542, ! 496, -713, -713, -713, -713, -713, 122, -713, 524, -713, ! 224, -713, 502, 351, 345, -713, 586, -713, -713, 2673, ! 2307, -713, 508, 2247, 518, -713, 111, 79, -713, -713, ! 568, 501, 501, -713, 196, -713, 358, 196, 196, -713, ! -713, -713, 358, 196, -713, -713, 1022, 784, 1163, 3080, ! 1077, 719, 1743, 1102, -713, 493, 550, 2169, -713, 196, ! -713, -713, 595, 555, -713, 482, 2942, 2960, 557, -713, ! -713, 2548, -713, 3084, 564, 570, 3084, 3084, 2755, 605, ! 2755, 2755, 2510, 1799, 1464, 2635, 783, 997, 997, 308, ! 308, -713, -713, -713, -713, 574, 342, 569, -713, -713, ! 534, 1391, 542, -713, -713, 578, 615, 2878, 120, 196, ! -713, -713, -713, -713, 516, -713, -713, -713, 179, 89, ! 1211, 585, 2755, -713, -713, 2755, 2348, -713, 601, -713, ! -713, -713, -713, -713, 1373, -713, 499, 432, 501, -713, ! 650, -713, -713, -713, -713, -713, -713, -713, 614, -713, ! 616, 2755, 534, 620, 555, 3049, 2755, 3049, -713, -713, ! 630, 630, 677, 2755, 3113, 2064, -713, -713, -713, 292, ! 518, -713, -713, 78, 93, 96, 118, 737, -713, 659, ! -713, -713, -713, -713, -713, -713, 155, 667, 224, 224, ! -713, 196, -713, -713, 679, -713, -713, 2050, 1458, 690, ! 772, 2317, 2079, 740, 1299, -713, -713, -713, 683, 310, ! -713, -713, 189, -713, 652, 681, -713, -713, -713, -713, ! 696, 699, 2039, -713, -713, 760, -713, -713, -713, 705, ! -713, -713, 706, -713, -713, 196, 196, 3084, -713, 196, ! 682, 717, 2984, 721, 1838, -713, 3100, -713, 534, -713, ! -713, -713, -713, -713, -713, -713, -713, -713, -713, -713, ! -713, -713, -713, 2418, -713, 2755, -713, -713, -713, 722, ! 855, -713, -713, -713, -713, 321, 283, -713, -713, 1336, ! -713, 803, -713, -713, 73, -713, 501, -713, 345, -713, ! -713, 3084, -713, -713, 2039, -713, 196, 547, 196, 366, ! -713, -713, -713, 196, -713, 2755, -713, -713, 761, 534, ! 2755, -713, 767, 3084, 734, 739, -713, -713, 211, 1972, ! 2755, -713, 2487, -713, 786, 2755, 798, 745, 746, 2714, ! 265, 842, -713, -713, -713, 768, -713, -713, -713, 769, ! 986, 770, -713, -713, -713, 2612, 215, -713, -713, -713, ! 120, 196, 196, 598, 644, 218, -713, -713, 196, 120, ! 196, 218, -713, 196, -713, 2050, 1458, 2458, 2527, 690, ! 772, 1063, 1569, 2317, 2079, 3045, 3076, 740, 1299, 1377, ! 1656, -713, -713, -713, -713, 774, -713, -713, 313, 320, ! 1838, 73, -713, 73, -713, 2755, 130, -713, 2755, 457, ! -713, 1556, -713, 1440, 1838, -713, -713, 1905, -713, 2101, ! -713, -713, 3100, 2923, -713, -713, -713, -713, 780, 2755, ! 782, -713, 804, -713, -713, 501, 345, -713, -713, -713, ! -713, -713, 806, 861, 1623, 107, -713, -713, -713, -713, ! 321, 333, -713, 196, -713, 196, -713, -713, 196, 283, ! 283, -713, -713, 321, 283, -713, -713, -713, 793, -713, ! -713, -713, -713, 1643, 2755, -713, -713, 1643, 2755, -713, ! -713, 2755, -713, 794, 2101, -713, -713, 2755, -713, -713, ! 797, -713, 2755, 836, 322, -713, 606, 355, -713, 655, ! 820, 821, -713, 823, 2755, 1710, -713, -713, -713, -713, ! 2755, -713, 598, 644, 466, -713, -713, 855, 196, 218, ! -713, 218, -713, -713, 547, -713, 1643, -713, 1643, 2898, ! -713, -713, 3066, -713, 60, 196, -713, 358, -713, 358, ! 2755, 2755, 878, 2612, 817, -713, -713, -713, -713, -713, ! 818, -713, -713, -713, -713, -713, -713, -713, -713, -713, ! 140, 819, -713, -713, -713, 833, 834, -713, -713, -713, ! -713, 835, -713, -713, -713, -713, 838, 852, 534, 63, ! 814, -713, -713, -713, -713, -713, -713, 2755, -713, -713, ! -713, 2755, 837, 140, 839, 140, -713, -713, -713, 844, ! -713, 843, 924, 112, -713, -713, 774, 774, -713, -713, ! -713, 873, 586, 875, -713, -713, 2755, 2755, 424, 233, ! -713, 874, 880, 886, 586, -713, -713, -713, 424, -713, ! -713 }; + /* YYPGOTO[NTERM-NUM]. */ static const short yypgoto[] = { ! -713, -713, -713, -713, -713, 102, -713, -713, -713, -713, ! -713, -713, -713, -713, 82, -713, -62, 584, -252, 548, ! -713, -713, -713, -107, 687, -713, -713, -713, -713, -713, ! -713, -713, -270, -300, 665, -713, -713, 100, 11, -295, ! -580, 2, 5, 37, 38, 41, 44, -2, 45, -380, ! -342, 418, 420, -341, -331, 426, 427, -481, -458, 573, ! 576, -713, -153, -109, -511, -202, 582, 654, 678, 876, ! -713, -476, -133, -208, 566, -713, 700, -713, 253, 1, ! 27, -713, 607, -713, 428, -713, -529, -713, 325, -713, ! -563, -713, -713, 397, -713, -713, -713, -713, -713, -713, ! -120, 423, 264, 293, 40, 7, -713, -713, -713, -713, ! -713, -713, -713, -713, -713, -713, 583, -85, -713, 670, ! -713, -713, 344, 339, 675, 589, -52, -713, -713, -474, ! -281, -373, -440, -713, 365, -713, -713, -713, -713, -713, ! -713, -215, -713, -713, -401, 216, -713, -713, 658, -182, ! -713, 416, -713, -713, -525, -713, -713, -713, -713, -713, ! 657, -350, 220, -688, -192, -145, -713, -713, -713, -713, ! -713, -713, -713, -713, -713, -713, -713, -713, -713, -712, ! 180, -713, 197, -713, 590, -713, -512, -713, -713, -713, ! -713, -713, -713, 579, -294, -713, -713, -713, -713, 58 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -537 static const short yytable[] = { ! 178, 30, 190, 30, 48, 24, 48, 24, 25, 391, ! 25, 226, 59, 60, 61, 317, 419, 311, 622, 418, ! 481, 376, 422, 223, 421, 75, 399, 84, 548, 93, ! 70, 102, 619, 111, 481, 120, 691, 129, 628, 138, ! 26, 27, 26, 27, 28, 718, 28, 29, 31, 29, ! 31, 143, 144, 30, 235, 236, 48, 24, 482, 483, ! 25, 55, 617, 55, 241, 48, 231, 48, 201, 484, ! 246, 202, 482, 483, 665, 146, 335, 622, 661, -445, ! -107, 281, 642, 484, 812, 618, 146, 146, 146, 412, ! 668, 411, 26, 27, -446, 547, 28, -447, 276, 29, ! 31, 662, 146, 203, 204, 303, 830, 56, 779, 863, ! 543, 146, 304, 55, 619, -110, -110, -110, -110, -448, ! 146, -110, 245, -110, -110, -110, 756, 10, 843, 146, ! 147, 148, 150, 152, 154, 376, 147, 148, 146, -110, ! 735, 738, 620, 831, 617, 869, 864, 146, 564, 847, ! 16, 227, 302, 147, 148, 753, 146, 155, 882, -2, ! 16, 577, 613, -425, 579, 146, 458, 618, -107, 4, ! 481, 870, 473, 780, 891, 48, 744, -3, -426, 653, ! 878, -427, 638, 638, 335, 602, 468, 348, 549, 461, ! 402, 801, 75, 241, 84, 883, 93, 354, 102, 355, ! -110, 620, 75, -428, 84, 385, 212, 848, 482, 483, ! 386, 900, 377, 292, 293, 48, 149, 654, 657, 484, ! 48, 201, 151, 671, 202, 673, 16, 332, 658, 764, ! 48, 326, 62, 839, 327, 146, 462, 401, 544, 153, ! 48, 408, 541, 545, 439, 213, 214, 209, 16, 240, ! 48, 210, 48, 428, 689, 430, 203, 204, 63, 790, ! 792, 530, 533, 536, 539, 72, 328, 329, 147, 148, ! 330, 285, 560, 331, 333, 822, 589, 561, 590, 64, ! 548, 674, 388, 677, 213, 214, 65, 337, 16, 548, ! 389, 214, 145, 626, 81, 189, 442, 317, 719, 241, ! 48, 398, 619, 248, 7, 71, 9, 72, 531, 534, ! 537, 540, 11, 12, 13, 342, 893, 16, 292, 293, ! 207, 894, 313, 699, 65, 629, 314, 75, 15, 84, ! 16, 93, 617, 102, 230, 332, 65, 232, 48, 326, ! 494, 639, 327, 495, 234, 424, 425, 547, 65, 640, ! 214, 884, 885, 763, 374, 618, 547, 378, 247, 304, ! 638, 638, -474, -474, -474, -474, 267, 268, 269, 65, ! -474, -474, -474, 320, 328, 329, 527, 210, 330, 630, ! 528, 331, 333, 521, -244, 523, -474, 631, 214, 48, ! 201, 630, 794, 202, 558, 337, 237, 736, 559, 631, ! 214, 314, 477, 66, 737, 478, 806, 481, 210, 238, ! 314, 67, 678, 94, 9, 95, 477, 213, 214, 478, ! 11, 12, 13, 239, 66, 203, 204, 342, 720, 785, ! 248, 786, 67, 276, 396, 669, 48, 729, 48, 808, ! 549, 479, 289, 210, 480, 482, 483, -106, 315, 549, ! 291, -19, -19, -19, -19, 479, 484, 676, 480, -19, ! -19, -19, 448, 89, 9, 90, 297, 77, 285, 310, ! 11, 12, 13, 312, 212, -19, 86, -275, 75, 296, ! 93, 615, 111, 341, 129, 147, 148, 16, 16, 739, ! -275, 740, -249, 103, 9, 104, 554, 554, 318, 214, ! 11, 12, 13, 748, 65, 218, 323, 833, -81, 834, ! 339, 566, 568, 349, 342, 503, 876, 877, 281, 7, ! 76, 9, 77, 213, 214, 57, 58, 11, 12, 13, ! 352, -275, 725, 214, 350, -275, -19, 147, 148, 351, ! 615, 30, -248, 15, 48, 24, 379, 698, 25, 821, ! 65, 218, 477, 529, 532, 478, 538, 651, 317, 219, ! 48, 645, 635, 641, 646, 318, 214, 220, 213, 214, ! 420, 297, -251, 767, 380, 398, 423, -380, -380, 384, ! 26, 27, 471, 214, 28, 766, 679, 29, 31, 319, ! 387, 479, 429, 675, 480, 158, 647, 648, 404, -245, ! 649, 625, 409, 650, 652, 219, 73, 78, 82, 87, ! 601, 415, 888, 220, 109, 114, 118, 123, 147, 148, ! 282, 283, 284, 30, 898, 614, 48, 24, 705, 706, ! 25, 48, 201, 212, 426, 202, -275, 760, 431, 728, ! 48, 201, 469, 432, 202, 437, 75, 440, 84, -275, ! 93, 443, 102, 441, 111, 395, 120, 446, 129, 447, ! 138, 464, 26, 27, 723, 214, 28, 203, 204, 29, ! 31, 682, 733, 734, 676, 493, 203, 204, 74, 79, ! 83, 88, 212, 625, 614, -275, 110, 115, 119, 124, ! -275, 497, 700, 507, -275, 89, 9, 90, -275, 515, ! 804, 516, 11, 12, 13, 519, 91, 96, 100, 105, ! 725, 214, 814, 769, 127, 132, 136, 141, 820, 438, ! 16, 213, 214, 525, 551, 9, 95, 292, 293, 250, ! 252, 11, 12, 13, 416, 417, 292, 293, 304, -275, ! 789, 791, 562, -275, 542, 125, 9, 126, 835, 836, ! 546, 838, 11, 12, 13, 146, 130, 9, 131, 472, ! 783, 784, 553, 11, 12, 13, 557, 583, 580, 581, ! 16, 563, 582, 73, 78, 82, 87, 94, 9, 95, ! 565, 319, 319, 567, 11, 12, 13, 212, 7, 477, ! 9, 77, 478, 576, 578, 838, 11, 12, 13, 871, ! 584, 98, 9, 99, 586, 627, 664, -31, 11, 12, ! 13, 30, 15, 685, 48, 24, 270, 271, 25, 686, ! 272, 273, 274, 275, 838, 892, 16, 687, 479, 695, ! 696, 480, -32, 395, 395, -257, 680, 263, 264, 265, ! 266, 267, 268, 269, 694, 74, 79, 83, 88, 701, ! 26, 27, 704, 707, 28, 278, 474, 29, 31, 7, ! 8, 9, 10, 613, 759, 476, 761, 11, 12, 13, ! 762, 625, 774, 91, 96, 100, 105, 775, 793, 800, ! -250, 803, 805, 15, 721, 722, 810, 811, 727, 813, ! 139, 9, 140, 730, 731, 837, 732, 11, 12, 13, ! 842, 846, 865, 852, 92, 97, 101, 106, 73, 78, ! 82, 87, 128, 133, 137, 142, 855, 856, 861, 858, ! 395, 395, 860, 874, 346, 347, 880, 872, 879, 745, ! 862, 324, 749, 881, 7, 353, 9, 10, -536, 887, ! 356, 357, 11, 12, 13, 362, 363, 364, 365, 366, ! 367, 368, 369, 370, 371, 372, 373, 895, 15, 890, ! 16, 17, 6, 896, -119, 7, 8, 9, 10, -259, ! 897, 467, 413, 11, 12, 13, 297, 655, 297, 656, ! 74, 79, 83, 88, 504, 659, 660, 500, 14, 15, ! 501, 16, 17, 465, 397, 690, 795, 788, 724, 726, ! 797, 708, 672, 709, 710, 711, 712, 427, 91, 96, ! 100, 105, 755, 782, 325, -372, 746, 520, 741, -119, ! 434, 518, 7, 85, 9, 86, 7, -119, 9, 72, ! 11, 12, 13, 844, 11, 12, 13, 717, 460, 845, ! 463, 823, 824, 873, 825, 18, 15, 444, 445, 826, ! 15, 827, 16, 265, 266, 267, 268, 269, 832, 73, ! 78, 552, 875, 109, 114, 556, 0, 498, 98, 9, ! 99, 92, 97, 101, 106, 11, 12, 13, 0, 0, ! 0, 511, 514, 9, 90, 395, 395, 0, 0, 11, ! 12, 13, 0, 16, 395, 395, 0, 0, 395, 395, ! 0, 0, -247, 0, 0, 0, 0, 16, 9, 104, ! 460, 460, 535, 460, 11, 12, 13, 0, 517, 7, ! 80, 9, 81, 522, 0, 0, 0, 11, 12, 13, ! 526, 74, 79, 0, 0, 110, 115, 0, 0, 0, ! 0, 0, 0, 15, 0, 16, 0, 724, 726, 726, ! 0, 0, 0, 0, 0, 0, 0, 91, 96, 0, ! 0, 127, 132, 573, 0, 575, 0, 7, 211, 9, ! 81, -27, -27, -27, -27, 11, 12, 13, 0, -27, ! -27, -27, 0, 0, 0, 0, 0, 0, 0, 571, ! 0, 15, 0, 16, 212, -27, 0, -275, 0, -246, ! 0, 0, 0, 0, 0, 0, 92, 97, 101, 106, ! -275, 593, 474, 0, 475, 7, 8, 9, 10, 0, ! 0, 476, 0, 11, 12, 13, 0, 73, 78, 82, ! 87, 0, 0, 213, 214, 109, 114, 118, 123, 15, ! 7, 107, 9, 108, 7, 116, 9, 117, 11, 12, ! 13, -275, 11, 12, 13, -275, -27, 0, 0, 0, ! 0, 571, 0, 0, 15, 0, 16, 0, 15, 0, ! 16, 703, 681, 7, 112, 9, 113, 683, 0, 0, ! 0, 11, 12, 13, 0, 0, 593, 692, 0, 0, ! 0, 0, 693, 0, -536, 0, 0, 15, 0, 74, ! 79, 83, 88, 0, 130, 9, 131, 110, 115, 119, ! 124, 11, 12, 13, 125, 9, 126, 0, 0, 0, ! -252, 11, 12, 13, -254, 0, 0, 91, 96, 100, ! 105, 742, 0, 0, 514, 127, 132, 136, 141, 16, ! 7, 8, 9, 10, 0, 0, 644, 0, 11, 12, ! 13, 0, 0, -253, 0, 92, 97, 593, 0, 128, ! 133, 0, 743, 0, 15, 747, 16, 0, 0, 0, ! 0, 593, 0, 0, 593, 0, 593, 7, 8, 9, ! 10, 0, 134, 9, 135, 11, 12, 13, 0, 11, ! 12, 13, 450, -256, -474, -474, -474, -474, -474, -474, ! -474, 15, -474, -474, -474, -474, -474, 16, -474, -474, ! -474, -474, -474, -474, -474, -474, -474, -474, -474, -474, ! -474, -474, -474, 0, -474, -474, -474, -474, -474, 0, ! 0, 796, 0, -474, 535, 798, 0, 0, 799, -474, ! 0, 593, -474, 0, 802, 0, 0, -474, -474, -474, ! 751, 0, -474, -474, 0, 0, 0, -474, 7, 121, ! 9, 122, 7, 76, 9, 77, 11, 12, 13, 0, ! 11, 12, 13, 0, 0, -474, 535, -474, -474, 0, ! -474, 0, 15, 253, 254, 255, 15, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, ! 269, 0, 0, 0, 0, 0, 134, 9, 135, 0, ! 866, 867, 0, 11, 12, 13, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 92, 97, 101, 106, 0, ! 752, 16, 0, 128, 133, 137, 142, 277, -255, -450, ! -450, -450, -450, -450, -450, -450, 0, -450, -450, -450, ! -450, -450, 0, -450, -450, -450, -450, -450, -450, -450, ! -450, -450, -450, -450, -450, -450, -450, -450, -450, -450, ! -450, -450, -450, -450, 103, 9, 104, 0, -450, 0, ! 0, 11, 12, 13, -450, -258, 0, -450, 0, 0, ! 0, 0, -450, -450, -450, 0, 0, -450, -450, 253, ! 254, 255, -450, 256, 257, 258, 259, 260, 261, 262, ! 263, 264, 265, 266, 267, 268, 269, 0, 0, 0, ! -450, 278, -450, -450, 776, -450, -452, -452, 0, 0, ! 0, -452, -452, 0, -452, 0, 0, 0, -452, 750, ! -452, -452, -452, -452, -452, -452, -452, -452, -452, -452, ! -452, 0, -452, 0, -452, 0, -452, -452, -452, -452, ! -452, 139, 9, 140, 0, -452, 0, 0, 11, 12, ! 13, -452, 0, 16, -452, 0, 0, 0, 0, -452, ! -452, -452, 0, 0, -452, -452, 253, 254, 255, -452, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, ! 266, 267, 268, 269, 0, 0, 0, -452, 0, -452, ! -452, 815, -452, -481, -481, 0, 0, 0, -481, -481, ! 0, -481, 0, 0, 0, -481, 0, -481, -481, -481, ! -481, -481, -481, -481, -481, -481, -481, -481, 0, -481, ! 0, -481, 0, -481, -481, -481, -481, -481, 0, 9, ! 99, 0, -481, 0, 0, 11, 12, 13, -481, 0, ! 0, -481, 0, 0, 0, 0, -481, -481, -481, 0, ! 0, -481, -481, 16, 0, 242, -481, 156, 7, 0, ! 9, 10, 157, 158, 0, 159, 11, 12, 13, 0, ! 0, 0, 0, 0, -481, 0, -481, -481, 0, -481, ! 0, 0, 15, 160, 16, 17, 0, 161, 162, 163, ! 164, 165, 0, 0, 0, 0, 166, 0, 0, 0, ! 0, 0, 167, 0, 0, 168, 0, 0, 0, 0, ! 169, 170, 171, 0, 0, 172, 173, 0, 0, 587, ! 174, 588, 148, 0, 0, 0, 157, 158, 0, 159, ! 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, ! 175, 176, 0, 243, 0, 0, 0, 160, 0, 17, ! 0, 161, 162, 163, 164, 165, 0, 0, 0, 0, ! 166, 0, 0, 0, 0, 0, 167, 0, 0, 168, ! 0, 0, 0, 0, 169, 170, 171, 0, 0, 172, ! 173, 0, 0, 589, 174, 590, 587, 0, 588, 148, ! 0, 0, 0, 157, 158, 0, 159, 0, 0, 0, ! 0, 0, 0, -303, 175, 176, 0, 591, 0, 0, ! 0, 0, 0, 0, 160, 0, 17, 0, 161, 162, ! 163, 164, 165, 0, 0, 0, 0, 166, 0, 0, ! 0, 0, 0, 167, 0, 0, 168, 0, 0, 0, ! 0, 169, 170, 171, 0, 0, 172, 173, 0, 0, ! 589, 174, 590, 587, 0, 156, 0, 0, 0, 0, ! 157, 158, 0, 159, 0, 0, 0, 0, 0, 0, ! -369, 175, 176, 0, 591, 0, 0, 0, 0, 0, ! 0, 160, 0, 17, 0, 161, 162, 163, 164, 165, ! 0, 0, 0, 0, 166, -316, 0, 0, 0, 0, ! 167, 0, 0, 168, 0, 0, 0, 0, 169, 170, ! 171, 0, 0, 172, 173, 0, 0, -316, 174, -316, ! 569, 0, 156, 0, 0, 0, 0, 157, 158, 0, ! 159, 0, 0, 0, 7, 71, 9, 72, 175, 176, ! 0, 591, 11, 12, 13, 0, 0, 0, 160, 0, ! 17, 0, 161, 162, 163, 164, 165, 0, 15, 0, ! 16, 166, 0, 7, 112, 9, 113, 167, 0, 0, ! 168, 11, 12, 13, 0, 169, 170, 171, 0, 0, ! 172, 173, 587, 0, 156, 174, 0, 15, 0, 157, ! 158, 0, 159, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 175, 176, 0, 570, 0, ! 160, 0, 17, 0, 161, 162, 163, 164, 165, 0, ! 0, 0, 321, 166, 0, -23, -23, -23, -23, 167, ! 0, 0, 168, -23, -23, -23, 0, 169, 170, 171, ! 0, 0, 172, 173, 0, 0, 0, 174, 212, -23, ! 324, -275, 0, 7, 0, 9, 10, 0, 0, 0, ! 0, 11, 12, 13, -275, 0, 0, 175, 176, 0, ! 591, 0, 0, 0, 0, 0, 0, 15, 0, 16, ! 17, 0, 0, 0, 0, 0, 0, 213, 214, 156, ! 7, 299, 9, 10, 157, 158, 0, 159, 11, 12, ! 13, 0, 0, 0, 0, -275, 0, 0, 0, -275, ! -23, 0, 0, 0, 15, 160, 16, 17, 0, 161, ! 162, 163, 164, 165, 0, 0, 0, 0, 166, 0, ! 156, 0, 405, 0, 167, 157, 158, 168, 159, 0, ! 0, 0, 169, 170, 300, 0, 0, 172, 173, 0, ! 0, 0, 174, 0, 0, 0, 160, 0, 17, 0, ! 161, 162, 163, 164, 165, 0, 0, 0, 0, 166, ! 0, 0, 175, 176, 0, 167, 301, 0, 168, 0, ! 0, 0, 0, 169, 170, 406, 0, 0, 172, 173, ! 156, 0, 0, 174, 0, 157, 158, 0, 159, 0, ! 0, 7, 107, 9, 108, 0, 0, 0, 0, 11, ! 12, 13, 0, 175, 176, 0, 160, 407, 17, 0, ! 161, 162, 163, 164, 165, 15, 0, 16, 0, 166, ! 0, 156, 0, 0, 0, 167, 157, 158, 168, 159, ! 0, 0, 0, 169, 170, 171, 0, 0, 172, 173, ! 0, 0, 0, 174, 0, 0, 0, 160, 0, 17, ! 0, 161, 162, 163, 164, 165, 0, 0, 0, 0, ! 166, 0, 0, 175, 176, 0, 167, 403, 0, 168, ! 0, 0, 0, 0, 169, 170, 171, 0, 0, 172, ! 173, 0, 0, 0, 174, 0, 0, 0, 0, 0, ! 0, 588, 604, 8, 9, 10, 157, 158, 0, 159, ! 11, 12, 13, 0, 175, 176, 0, 0, 496, 605, ! 606, 607, 608, 609, 610, 611, 15, 160, 16, 17, ! 0, 161, 162, 163, 164, 165, 0, 0, 0, 0, ! 166, 0, 7, 80, 9, 81, 167, 0, 0, 168, ! 11, 12, 13, 0, 169, 170, 171, 0, 0, 172, ! 173, 0, 0, 0, 174, 0, 15, 0, 16, 0, ! 588, 148, 0, 0, 0, 157, 158, 0, 159, 0, ! 0, 0, 612, 0, 175, 176, 0, 613, 605, 606, ! 607, 608, 609, 610, 611, 0, 160, 0, 17, 0, ! 161, 162, 163, 164, 165, 0, 0, 0, 0, 166, ! 0, 7, 85, 9, 86, 167, 0, 0, 168, 11, ! 12, 13, 0, 169, 170, 171, 0, 0, 172, 173, ! 0, 156, 0, 174, 0, 15, 157, 158, 0, 159, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, ! 269, 612, 0, 175, 176, 0, 613, 160, 0, 17, ! 0, 161, 162, 163, 164, 165, 0, 0, 0, 0, ! 166, 0, 0, 0, 0, 0, 167, 0, 0, 168, ! 0, 0, 0, 0, 169, 170, 171, 0, 0, 172, ! 173, 0, 0, 0, 174, 156, 7, 8, 9, 10, ! 157, 158, 0, 159, 11, 12, 13, 0, 0, 0, ! 0, 0, 0, 0, 175, 176, 0, 438, 0, 0, ! 15, 160, 16, 17, 0, 161, 162, 163, 164, 165, ! 0, 0, 0, 0, 166, 0, 0, 0, 0, 0, ! 167, 0, 0, 168, 0, 0, 0, 0, 169, 170, ! 171, 0, 0, 172, 173, 0, 156, 7, 174, 9, ! 10, 157, 158, 0, 159, 11, 12, 13, 262, 263, ! 264, 265, 266, 267, 268, 269, 0, 0, 175, 176, ! 0, 15, 160, 16, 17, 0, 161, 162, 163, 164, ! 165, 0, 0, 0, 0, 166, 0, 156, 0, 0, ! 0, 167, 157, 158, 168, 159, 0, 0, 0, 169, ! 170, 171, 0, 0, 172, 173, 0, 0, 0, 174, ! 0, 0, 0, 160, 0, 17, 0, 161, 162, 163, ! 164, 165, 0, 0, 0, 0, 166, 0, 156, 175, ! 176, 0, 167, 157, 158, 168, 159, 0, 0, 0, ! 169, 170, 171, 0, 0, 172, 173, 0, 0, 0, ! 174, 0, 0, 0, 160, 0, 17, 0, 161, 162, ! 163, 164, 165, 0, 0, 0, 0, 166, 697, 156, ! 175, 176, 0, 167, 157, 158, 168, 159, 0, 0, ! 0, 169, 170, 171, 0, 0, 172, 173, 0, 0, ! 0, 174, 0, 0, 0, 160, 0, 17, 0, 161, ! 162, 163, 164, 165, 0, 0, 0, 0, 166, 0, ! 156, 175, 176, 0, 167, 157, 158, 168, 159, 0, ! 0, 0, 169, 170, 171, 0, 0, 172, 173, 0, ! 0, 0, 249, 0, 0, 0, 160, 0, 17, 0, ! 161, 162, 163, 164, 165, 0, 0, 0, 0, 166, ! 0, 466, 175, 176, 0, 167, 157, 158, 168, 159, ! 0, 0, 0, 169, 170, 171, 0, 0, 172, 173, ! 0, 0, 0, 251, 0, 0, 0, 160, 0, 17, ! 0, 161, 162, 163, 164, 165, 0, 0, 0, 0, ! 166, 0, 0, 175, 176, 0, 167, 0, 0, 168, ! 0, 0, 0, 757, 169, 170, 171, 0, 0, 172, ! 173, 253, 254, 255, 174, 256, 257, 258, 259, 260, ! 261, 262, 263, 264, 265, 266, 267, 268, 269, 0, ! 0, 0, 0, 0, 175, 176, 253, 254, 255, 758, ! 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, ! 266, 267, 268, 269, 0, 253, 254, 255, 828, 256, ! 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, ! 267, 268, 269, 253, 254, 255, 0, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, ! 269, 0, 0, 0, 0, 0, 0, 253, 254, 255, ! 435, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 0, 0, 0, 436, 7, ! 116, 9, 117, 7, 0, 9, 10, 11, 12, 13, ! 0, 11, 12, 13, 0, 0, 0, 0, 0, 0, ! 0, 0, 585, 15, 0, 16, 0, 15, 0, 16, ! 7, 121, 9, 122, 7, 0, 9, 86, 11, 12, ! 13, 0, 11, 12, 13, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 15, 0, 0, 0, 15, 253, ! 254, 255, 829, 256, 257, 258, 259, 260, 261, 262, ! 263, 264, 265, 266, 267, 268, 269, 253, 254, 255, ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 255, 0, 256, 257, 258, ! 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, ! 269, 257, 258, 259, 260, 261, 262, 263, 264, 265, ! 266, 267, 268, 269 }; static const short yycheck[] = { ! 62, 3, 64, 5, 3, 3, 5, 5, 3, 290, ! 5, 144, 11, 12, 13, 223, 316, 219, 543, 314, ! 400, 273, 322, 143, 318, 24, 296, 26, 468, 28, ! 23, 30, 543, 32, 414, 34, 599, 36, 550, 38, ! 3, 3, 5, 5, 3, 625, 5, 3, 3, 5, ! 5, 40, 41, 55, 161, 162, 55, 55, 400, 400, ! 55, 3, 543, 5, 171, 64, 151, 66, 66, 400, ! 177, 66, 414, 414, 1, 48, 229, 602, 559, 1, ! 1, 188, 556, 414, 772, 543, 59, 60, 61, 10, ! 566, 306, 55, 55, 1, 468, 55, 1, 9, 55, ! 55, 559, 75, 66, 66, 214, 46, 5, 1, 46, ! 460, 84, 1, 55, 625, 4, 5, 6, 7, 1, ! 93, 10, 174, 12, 13, 14, 689, 7, 816, 102, ! 3, 4, 50, 51, 52, 387, 3, 4, 111, 28, ! 665, 670, 543, 83, 625, 857, 83, 120, 498, 9, ! 30, 144, 214, 3, 4, 684, 129, 55, 46, 0, ! 30, 511, 89, 85, 514, 138, 381, 625, 89, 0, ! 550, 859, 83, 66, 886, 174, 46, 0, 85, 559, ! 868, 85, 555, 556, 337, 535, 388, 239, 469, 381, ! 299, 754, 191, 300, 193, 83, 195, 249, 197, 251, ! 89, 602, 201, 85, 203, 83, 27, 67, 550, 550, ! 88, 899, 274, 206, 207, 214, 89, 559, 559, 550, ! 219, 219, 89, 573, 219, 575, 30, 229, 559, 705, ! 229, 229, 66, 813, 229, 208, 381, 299, 83, 89, ! 239, 303, 457, 88, 351, 66, 67, 84, 30, 167, ! 249, 88, 251, 338, 43, 340, 219, 219, 66, 733, ! 734, 453, 454, 455, 456, 7, 229, 229, 3, 4, ! 229, 189, 83, 229, 229, 787, 65, 88, 67, 66, ! 720, 576, 58, 578, 66, 67, 3, 229, 30, 729, ! 66, 67, 84, 545, 7, 66, 358, 505, 83, 406, ! 299, 294, 813, 88, 4, 5, 6, 7, 453, 454, ! 455, 456, 12, 13, 14, 233, 83, 30, 311, 312, ! 67, 88, 84, 58, 3, 4, 88, 326, 28, 328, ! 30, 330, 813, 332, 89, 337, 3, 89, 337, 337, ! 402, 58, 337, 405, 89, 334, 335, 720, 3, 66, ! 67, 876, 877, 703, 272, 813, 729, 275, 83, 1, ! 733, 734, 4, 5, 6, 7, 58, 59, 60, 3, ! 12, 13, 14, 84, 337, 337, 84, 88, 337, 58, ! 88, 337, 337, 435, 84, 437, 28, 66, 67, 388, ! 388, 58, 742, 388, 84, 337, 66, 84, 88, 66, ! 67, 88, 400, 58, 84, 400, 84, 787, 88, 66, ! 88, 66, 46, 5, 6, 7, 414, 66, 67, 414, ! 12, 13, 14, 66, 58, 388, 388, 345, 630, 723, ! 88, 725, 66, 9, 83, 568, 435, 639, 437, 84, ! 721, 400, 83, 88, 400, 787, 787, 89, 1, 730, ! 83, 4, 5, 6, 7, 414, 787, 577, 414, 12, ! 13, 14, 380, 5, 6, 7, 213, 7, 386, 216, ! 12, 13, 14, 220, 27, 28, 7, 30, 477, 66, ! 479, 543, 481, 1, 483, 3, 4, 30, 30, 671, ! 43, 673, 84, 5, 6, 7, 485, 486, 66, 67, ! 12, 13, 14, 46, 3, 4, 85, 807, 46, 809, ! 85, 500, 501, 83, 432, 83, 866, 867, 625, 4, ! 5, 6, 7, 66, 67, 84, 85, 12, 13, 14, ! 84, 84, 66, 67, 83, 88, 89, 3, 4, 83, ! 602, 543, 84, 28, 543, 543, 83, 609, 543, 83, ! 3, 4, 550, 453, 454, 550, 456, 559, 766, 58, ! 559, 559, 555, 556, 559, 66, 67, 66, 66, 67, ! 317, 318, 84, 706, 32, 568, 323, 84, 85, 83, ! 543, 543, 66, 67, 543, 705, 579, 543, 543, 224, ! 66, 550, 339, 46, 550, 9, 559, 559, 90, 84, ! 559, 543, 84, 559, 559, 58, 24, 25, 26, 27, ! 528, 43, 882, 66, 32, 33, 34, 35, 3, 4, ! 5, 6, 7, 625, 894, 543, 625, 625, 617, 618, ! 625, 630, 630, 27, 84, 630, 30, 699, 43, 638, ! 639, 639, 389, 88, 639, 88, 645, 83, 647, 43, ! 649, 46, 651, 83, 653, 290, 655, 83, 657, 90, ! 659, 83, 625, 625, 66, 67, 625, 630, 630, 625, ! 625, 589, 661, 662, 794, 90, 639, 639, 24, 25, ! 26, 27, 27, 625, 602, 30, 32, 33, 34, 35, ! 84, 90, 610, 43, 88, 5, 6, 7, 43, 85, ! 762, 85, 12, 13, 14, 85, 28, 29, 30, 31, ! 66, 67, 774, 706, 36, 37, 38, 39, 780, 89, ! 30, 66, 67, 46, 471, 6, 7, 720, 721, 181, ! 182, 12, 13, 14, 311, 312, 729, 730, 1, 84, ! 733, 734, 90, 88, 85, 5, 6, 7, 810, 811, ! 83, 813, 12, 13, 14, 728, 5, 6, 7, 394, ! 720, 721, 83, 12, 13, 14, 83, 85, 515, 516, ! 30, 90, 519, 191, 192, 193, 194, 5, 6, 7, ! 84, 416, 417, 84, 12, 13, 14, 27, 4, 787, ! 6, 7, 787, 88, 88, 857, 12, 13, 14, 861, ! 83, 5, 6, 7, 83, 83, 3, 46, 12, 13, ! 14, 813, 28, 46, 813, 813, 61, 62, 813, 85, ! 65, 66, 67, 68, 886, 887, 30, 88, 787, 84, ! 84, 787, 46, 468, 469, 84, 583, 54, 55, 56, ! 57, 58, 59, 60, 46, 191, 192, 193, 194, 7, ! 813, 813, 84, 84, 813, 85, 1, 813, 813, 4, ! 5, 6, 7, 89, 84, 10, 84, 12, 13, 14, ! 66, 813, 66, 195, 196, 197, 198, 16, 85, 85, ! 84, 84, 46, 28, 631, 632, 66, 66, 635, 66, ! 5, 6, 7, 640, 641, 17, 643, 12, 13, 14, ! 83, 83, 88, 84, 28, 29, 30, 31, 326, 327, ! 328, 329, 36, 37, 38, 39, 83, 83, 66, 84, ! 555, 556, 84, 84, 237, 238, 83, 90, 84, 676, ! 848, 1, 679, 9, 4, 248, 6, 7, 83, 66, ! 253, 254, 12, 13, 14, 258, 259, 260, 261, 262, ! 263, 264, 265, 266, 267, 268, 269, 83, 28, 84, ! 30, 31, 1, 83, 3, 4, 5, 6, 7, 84, ! 84, 387, 307, 12, 13, 14, 723, 559, 725, 559, ! 326, 327, 328, 329, 418, 559, 559, 414, 27, 28, ! 414, 30, 31, 386, 294, 598, 743, 733, 633, 634, ! 747, 15, 574, 17, 18, 19, 20, 337, 330, 331, ! 332, 333, 687, 720, 84, 85, 677, 434, 674, 58, ! 345, 432, 4, 5, 6, 7, 4, 66, 6, 7, ! 12, 13, 14, 817, 12, 13, 14, 621, 381, 819, ! 382, 788, 789, 863, 791, 84, 28, 360, 361, 796, ! 28, 798, 30, 56, 57, 58, 59, 60, 805, 477, ! 478, 471, 865, 481, 482, 486, -1, 410, 5, 6, ! 7, 195, 196, 197, 198, 12, 13, 14, -1, -1, ! -1, 424, 425, 6, 7, 720, 721, -1, -1, 12, ! 13, 14, -1, 30, 729, 730, -1, -1, 733, 734, ! -1, -1, 84, -1, -1, -1, -1, 30, 6, 7, ! 453, 454, 455, 456, 12, 13, 14, -1, 431, 4, ! 5, 6, 7, 436, -1, -1, -1, 12, 13, 14, ! 443, 477, 478, -1, -1, 481, 482, -1, -1, -1, ! -1, -1, -1, 28, -1, 30, -1, 782, 783, 784, ! -1, -1, -1, -1, -1, -1, -1, 479, 480, -1, ! -1, 483, 484, 506, -1, 508, -1, 4, 1, 6, ! 7, 4, 5, 6, 7, 12, 13, 14, -1, 12, ! 13, 14, -1, -1, -1, -1, -1, -1, -1, 502, ! -1, 28, -1, 30, 27, 28, -1, 30, -1, 84, ! -1, -1, -1, -1, -1, -1, 330, 331, 332, 333, ! 43, 524, 1, -1, 3, 4, 5, 6, 7, -1, ! -1, 10, -1, 12, 13, 14, -1, 645, 646, 647, ! 648, -1, -1, 66, 67, 653, 654, 655, 656, 28, ! 4, 5, 6, 7, 4, 5, 6, 7, 12, 13, ! 14, 84, 12, 13, 14, 88, 89, -1, -1, -1, ! -1, 574, -1, -1, 28, -1, 30, -1, 28, -1, ! 30, 614, 585, 4, 5, 6, 7, 590, -1, -1, ! -1, 12, 13, 14, -1, -1, 599, 600, -1, -1, ! -1, -1, 605, -1, 83, -1, -1, 28, -1, 645, ! 646, 647, 648, -1, 5, 6, 7, 653, 654, 655, ! 656, 12, 13, 14, 5, 6, 7, -1, -1, -1, ! 84, 12, 13, 14, 84, -1, -1, 649, 650, 651, ! 652, 674, -1, -1, 677, 657, 658, 659, 660, 30, ! 4, 5, 6, 7, -1, -1, 10, -1, 12, 13, ! 14, -1, -1, 84, -1, 479, 480, 670, -1, 483, ! 484, -1, 675, -1, 28, 678, 30, -1, -1, -1, ! -1, 684, -1, -1, 687, -1, 689, 4, 5, 6, ! 7, -1, 5, 6, 7, 12, 13, 14, -1, 12, ! 13, 14, 1, 84, 3, 4, 5, 6, 7, 8, ! 9, 28, 11, 12, 13, 14, 15, 30, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, ! -1, 744, -1, 42, 777, 748, -1, -1, 751, 48, ! -1, 754, 51, -1, 757, -1, -1, 56, 57, 58, ! 10, -1, 61, 62, -1, -1, -1, 66, 4, 5, ! 6, 7, 4, 5, 6, 7, 12, 13, 14, -1, ! 12, 13, 14, -1, -1, 84, 819, 86, 87, -1, ! 89, -1, 28, 43, 44, 45, 28, 47, 48, 49, ! 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, -1, -1, -1, -1, -1, 5, 6, 7, -1, ! 853, 854, -1, 12, 13, 14, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 649, 650, 651, 652, -1, ! 90, 30, -1, 657, 658, 659, 660, 1, 84, 3, ! 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, ! 14, 15, -1, 17, 18, 19, 20, 21, 22, 23, ! 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, ! 34, 35, 36, 37, 5, 6, 7, -1, 42, -1, ! -1, 12, 13, 14, 48, 84, -1, 51, -1, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, 43, ! 44, 45, 66, 47, 48, 49, 50, 51, 52, 53, ! 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, ! 84, 85, 86, 87, 1, 89, 3, 4, -1, -1, ! -1, 8, 9, -1, 11, -1, -1, -1, 15, 83, ! 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, ! 27, -1, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, 5, 6, 7, -1, 42, -1, -1, 12, 13, ! 14, 48, -1, 30, 51, -1, -1, -1, -1, 56, ! 57, 58, -1, -1, 61, 62, 43, 44, 45, 66, ! 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, ! 57, 58, 59, 60, -1, -1, -1, 84, -1, 86, ! 87, 1, 89, 3, 4, -1, -1, -1, 8, 9, ! -1, 11, -1, -1, -1, 15, -1, 17, 18, 19, ! 20, 21, 22, 23, 24, 25, 26, 27, -1, 29, ! -1, 31, -1, 33, 34, 35, 36, 37, -1, 6, ! 7, -1, 42, -1, -1, 12, 13, 14, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, 61, 62, 30, -1, 1, 66, 3, 4, -1, ! 6, 7, 8, 9, -1, 11, 12, 13, 14, -1, ! -1, -1, -1, -1, 84, -1, 86, 87, -1, 89, ! -1, -1, 28, 29, 30, 31, -1, 33, 34, 35, ! 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, ! -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, ! 56, 57, 58, -1, -1, 61, 62, -1, -1, 1, ! 66, 3, 4, -1, -1, -1, 8, 9, -1, 11, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! 86, 87, -1, 89, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, ! -1, -1, -1, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, 65, 66, 67, 1, -1, 3, 4, ! -1, -1, -1, 8, 9, -1, 11, -1, -1, -1, ! -1, -1, -1, 85, 86, 87, -1, 89, -1, -1, ! -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, ! -1, 56, 57, 58, -1, -1, 61, 62, -1, -1, ! 65, 66, 67, 1, -1, 3, -1, -1, -1, -1, ! 8, 9, -1, 11, -1, -1, -1, -1, -1, -1, ! 85, 86, 87, -1, 89, -1, -1, -1, -1, -1, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, 43, -1, -1, -1, -1, ! 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, 61, 62, -1, -1, 65, 66, 67, ! 1, -1, 3, -1, -1, -1, -1, 8, 9, -1, ! 11, -1, -1, -1, 4, 5, 6, 7, 86, 87, ! -1, 89, 12, 13, 14, -1, -1, -1, 29, -1, ! 31, -1, 33, 34, 35, 36, 37, -1, 28, -1, ! 30, 42, -1, 4, 5, 6, 7, 48, -1, -1, ! 51, 12, 13, 14, -1, 56, 57, 58, -1, -1, ! 61, 62, 1, -1, 3, 66, -1, 28, -1, 8, ! 9, -1, 11, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 86, 87, -1, 89, -1, ! 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, ! -1, -1, 1, 42, -1, 4, 5, 6, 7, 48, ! -1, -1, 51, 12, 13, 14, -1, 56, 57, 58, ! -1, -1, 61, 62, -1, -1, -1, 66, 27, 28, ! 1, 30, -1, 4, -1, 6, 7, -1, -1, -1, ! -1, 12, 13, 14, 43, -1, -1, 86, 87, -1, ! 89, -1, -1, -1, -1, -1, -1, 28, -1, 30, ! 31, -1, -1, -1, -1, -1, -1, 66, 67, 3, ! 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, ! 14, -1, -1, -1, -1, 84, -1, -1, -1, 88, ! 89, -1, -1, -1, 28, 29, 30, 31, -1, 33, ! 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, ! 3, -1, 5, -1, 48, 8, 9, 51, 11, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, -1, ! -1, -1, 66, -1, -1, -1, 29, -1, 31, -1, ! 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, -1, 86, 87, -1, 48, 90, -1, 51, -1, ! -1, -1, -1, 56, 57, 58, -1, -1, 61, 62, ! 3, -1, -1, 66, -1, 8, 9, -1, 11, -1, ! -1, 4, 5, 6, 7, -1, -1, -1, -1, 12, ! 13, 14, -1, 86, 87, -1, 29, 90, 31, -1, ! 33, 34, 35, 36, 37, 28, -1, 30, -1, 42, ! -1, 3, -1, -1, -1, 48, 8, 9, 51, 11, ! -1, -1, -1, 56, 57, 58, -1, -1, 61, 62, ! -1, -1, -1, 66, -1, -1, -1, 29, -1, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, 86, 87, -1, 48, 90, -1, 51, ! -1, -1, -1, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, -1, 66, -1, -1, -1, -1, -1, ! -1, 3, 4, 5, 6, 7, 8, 9, -1, 11, ! 12, 13, 14, -1, 86, 87, -1, -1, 90, 21, ! 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, 4, 5, 6, 7, 48, -1, -1, 51, ! 12, 13, 14, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, -1, 66, -1, 28, -1, 30, -1, ! 3, 4, -1, -1, -1, 8, 9, -1, 11, -1, ! -1, -1, 84, -1, 86, 87, -1, 89, 21, 22, ! 23, 24, 25, 26, 27, -1, 29, -1, 31, -1, ! 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, 4, 5, 6, 7, 48, -1, -1, 51, 12, ! 13, 14, -1, 56, 57, 58, -1, -1, 61, 62, ! -1, 3, -1, 66, -1, 28, 8, 9, -1, 11, ! 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, 84, -1, 86, 87, -1, 89, 29, -1, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, ! -1, -1, -1, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, -1, 66, 3, 4, 5, 6, 7, ! 8, 9, -1, 11, 12, 13, 14, -1, -1, -1, ! -1, -1, -1, -1, 86, 87, -1, 89, -1, -1, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, ! 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, 61, 62, -1, 3, 4, 66, 6, ! 7, 8, 9, -1, 11, 12, 13, 14, 53, 54, ! 55, 56, 57, 58, 59, 60, -1, -1, 86, 87, ! -1, 28, 29, 30, 31, -1, 33, 34, 35, 36, ! 37, -1, -1, -1, -1, 42, -1, 3, -1, -1, -1, 48, 8, 9, 51, 11, -1, -1, -1, 56, ! 57, 58, -1, -1, 61, 62, -1, -1, -1, 66, ! -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, ! 36, 37, -1, -1, -1, -1, 42, -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, -1, -1, ! 56, 57, 58, -1, -1, 61, 62, -1, -1, -1, ! 66, -1, -1, -1, 29, -1, 31, -1, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, 84, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, -1, ! -1, 56, 57, 58, -1, -1, 61, 62, -1, -1, ! -1, 66, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, -1, ! -1, -1, 66, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, 3, 86, 87, -1, 48, 8, 9, 51, 11, ! -1, -1, -1, 56, 57, 58, -1, -1, 61, 62, ! -1, -1, -1, 66, -1, -1, -1, 29, -1, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, 86, 87, -1, 48, -1, -1, 51, ! -1, -1, -1, 10, 56, 57, 58, -1, -1, 61, ! 62, 43, 44, 45, 66, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, ! -1, -1, -1, -1, 86, 87, 43, 44, 45, 46, ! 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, ! 57, 58, 59, 60, -1, 43, 44, 45, 90, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, -1, -1, -1, 43, 44, 45, 88, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, -1, -1, -1, 88, 4, ! 5, 6, 7, 4, -1, 6, 7, 12, 13, 14, ! -1, 12, 13, 14, -1, -1, -1, -1, -1, -1, ! -1, -1, 88, 28, -1, 30, -1, 28, -1, 30, ! 4, 5, 6, 7, 4, -1, 6, 7, 12, 13, 14, -1, 12, 13, 14, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 28, -1, -1, -1, 28, 43, ! 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, ! 54, 55, 56, 57, 58, 59, 60, 43, 44, 45, ! -1, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 45, -1, 47, 48, 49, ! 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, 48, 49, 50, 51, 52, 53, 54, 55, 56, ! 57, 58, 59, 60 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned short yystos[] = { ! 0, 92, 93, 94, 0, 95, 1, 4, 5, 6, ! 7, 12, 13, 14, 27, 28, 30, 31, 84, 96, ! 97, 98, 113, 129, 132, 133, 134, 135, 136, 137, ! 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, ! 148, 149, 155, 157, 158, 159, 160, 161, 170, 171, ! 197, 198, 199, 200, 205, 290, 96, 84, 85, 170, ! 170, 170, 66, 66, 66, 3, 58, 66, 163, 167, ! 196, 5, 7, 157, 158, 170, 5, 7, 157, 158, ! 5, 7, 157, 158, 170, 5, 7, 157, 158, 5, ! 7, 159, 160, 170, 5, 7, 159, 160, 5, 7, ! 159, 160, 170, 5, 7, 159, 160, 5, 7, 157, ! 158, 170, 5, 7, 157, 158, 5, 7, 157, 158, ! 170, 5, 7, 157, 158, 5, 7, 159, 160, 170, ! 5, 7, 159, 160, 5, 7, 159, 160, 170, 5, ! 7, 159, 160, 129, 129, 84, 171, 3, 4, 89, ! 105, 89, 105, 89, 105, 96, 3, 8, 9, 11, ! 29, 33, 34, 35, 36, 37, 42, 48, 51, 56, ! 57, 58, 61, 62, 66, 86, 87, 106, 107, 109, ! 110, 111, 112, 114, 115, 121, 123, 244, 290, 66, ! 107, 132, 133, 134, 135, 136, 137, 138, 139, 154, ! 217, 132, 133, 134, 135, 153, 156, 169, 170, 84, ! 88, 1, 27, 66, 67, 103, 164, 225, 4, 58, ! 66, 162, 165, 191, 192, 196, 163, 196, 208, 209, ! 89, 208, 89, 204, 89, 114, 114, 66, 66, 66, ! 105, 114, 1, 89, 107, 217, 114, 83, 88, 66, ! 110, 66, 110, 43, 44, 45, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! 61, 62, 65, 66, 67, 68, 9, 1, 85, 233, ! 242, 114, 5, 6, 7, 105, 172, 173, 174, 83, ! 218, 83, 196, 196, 130, 169, 66, 169, 285, 5, ! 58, 90, 107, 154, 1, 124, 125, 126, 232, 251, ! 169, 156, 169, 84, 88, 1, 99, 164, 66, 225, ! 84, 1, 101, 85, 1, 84, 132, 133, 134, 135, ! 136, 137, 138, 139, 152, 153, 210, 290, 201, 85, ! 202, 1, 105, 215, 216, 203, 115, 115, 217, 83, ! 83, 83, 84, 115, 217, 217, 115, 115, 118, 120, ! 117, 116, 115, 115, 115, 115, 115, 115, 115, 115, ! 115, 115, 115, 115, 105, 108, 109, 107, 105, 83, ! 32, 237, 238, 239, 83, 83, 88, 66, 58, 66, ! 219, 221, 222, 223, 224, 225, 83, 167, 196, 123, ! 286, 107, 154, 90, 90, 5, 58, 90, 107, 84, ! 104, 232, 10, 125, 252, 43, 192, 192, 130, 124, ! 169, 285, 124, 169, 129, 129, 84, 210, 208, 169, ! 208, 43, 88, 207, 215, 88, 88, 88, 89, 114, ! 83, 83, 107, 46, 115, 115, 83, 90, 105, 289, ! 1, 128, 226, 227, 228, 229, 230, 231, 232, 243, ! 251, 255, 256, 239, 83, 173, 3, 108, 156, 169, ! 275, 66, 225, 83, 1, 3, 10, 132, 133, 136, ! 137, 140, 141, 144, 145, 150, 151, 277, 280, 281, ! 283, 287, 288, 90, 107, 107, 90, 90, 251, 127, ! 150, 151, 168, 83, 165, 191, 100, 43, 102, 211, ! 213, 251, 212, 214, 251, 85, 85, 115, 216, 85, ! 207, 217, 115, 217, 122, 46, 115, 84, 88, 128, ! 255, 256, 128, 255, 256, 251, 255, 256, 128, 255, ! 256, 232, 85, 252, 83, 88, 83, 222, 223, 221, ! 276, 169, 275, 83, 129, 284, 284, 83, 84, 88, ! 83, 88, 90, 90, 252, 84, 129, 84, 129, 1, ! 89, 115, 175, 251, 166, 251, 88, 252, 88, 252, ! 169, 169, 169, 85, 83, 88, 83, 1, 3, 65, ! 67, 89, 105, 115, 177, 178, 179, 181, 183, 184, ! 119, 105, 252, 234, 4, 21, 22, 23, 24, 25, ! 26, 27, 84, 89, 105, 107, 131, 148, 149, 155, ! 235, 241, 245, 267, 268, 290, 109, 83, 277, 4, ! 58, 66, 193, 194, 195, 196, 220, 221, 222, 58, ! 66, 196, 220, 278, 10, 132, 133, 134, 135, 136, ! 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, ! 147, 148, 149, 282, 3, 1, 240, 245, 162, 163, ! 176, 252, 175, 252, 130, 46, 191, 130, 46, 196, ! 169, 115, 105, 115, 182, 46, 85, 88, 206, 43, ! 184, 181, 115, 115, 46, 84, 84, 84, 107, 58, ! 105, 7, 269, 251, 84, 129, 129, 84, 15, 17, ! 18, 19, 20, 246, 247, 249, 257, 242, 131, 83, ! 156, 169, 169, 66, 225, 66, 225, 169, 170, 156, ! 169, 169, 169, 129, 129, 245, 84, 84, 177, 240, ! 240, 213, 251, 115, 46, 169, 214, 115, 46, 169, ! 83, 10, 90, 177, 180, 179, 181, 10, 46, 84, ! 107, 84, 66, 252, 162, 185, 191, 163, 188, 196, ! 248, 259, 250, 261, 66, 16, 1, 235, 254, 1, ! 66, 236, 194, 195, 195, 285, 285, 279, 193, 196, ! 220, 196, 220, 85, 252, 169, 115, 169, 115, 115, ! 85, 181, 115, 84, 107, 46, 84, 186, 84, 189, ! 66, 66, 254, 66, 107, 1, 258, 253, 255, 256, ! 107, 83, 277, 169, 169, 169, 169, 169, 90, 46, ! 46, 83, 169, 124, 124, 107, 107, 17, 107, 131, ! 266, 270, 83, 254, 236, 253, 83, 9, 67, 271, ! 272, 273, 84, 187, 190, 83, 83, 262, 84, 265, ! 84, 66, 105, 46, 83, 88, 251, 251, 260, 270, ! 254, 107, 90, 271, 84, 273, 252, 252, 254, 84, ! 83, 9, 46, 83, 245, 245, 263, 66, 123, 274, ! 84, 270, 107, 83, 88, 83, 83, 84, 123, 264, ! 254 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 1772,1785 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 2013,2021 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 1788,1816 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 2024,2057 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 1818,1869 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 2059,2089 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (YYLEX_PARAM) ! #else ! # define YYLEX yylex () ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 1871,1885 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 2091,2183 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 1899,1933 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ ! /* This is the most reliable way to avoid incompatibilities ! in available built-in functions on various systems. */ ! static void ! # if defined (__STDC__) || defined (__cplusplus) ! yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) ! # else ! yymemcpy (yyto, yyfrom, yycount) ! char *yyto; ! const char *yyfrom; ! YYSIZE_T yycount; ! # endif ! { ! register const char *yyf = yyfrom; ! register char *yyt = yyto; ! register YYSIZE_T yyi = yycount; ! ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 2197,2206 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 1977,2062 **** } # endif # endif ! #endif - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif - /* YY_DECL_VARIABLES -- depending whether we use a pure parser, - variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ int yynerrs; - #if YYLSP_NEEDED - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES \ - \ - /* Location data for the lookahead symbol. */ \ - YYLTYPE yylloc; - #else - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES - #endif ! /* If nonreentrant, generate the variables here. */ ! #if !YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 2250,2383 ---- } # endif # endif ! ! #endif /* !YYERROR_VERBOSE */ ! + #if YYDEBUG + /*--------------------------------. + | Print this symbol on YYOUTPUT. | + `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); ! # endif ! } ! else ! YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); ! switch (yytype) ! { ! default: ! break; ! } ! YYFPRINTF (yyoutput, ")"); ! } ! ! #endif /* ! YYDEBUG */ ! /*-----------------------------------------------. ! | Release the memory associated to this symbol. | ! `-----------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yydestruct (int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yydestruct (yytype, yyvaluep) ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! switch (yytype) ! { ! ! default: ! break; ! } ! } ! ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); # else ! int yyparse (); # endif + #else /* ! YYPARSE_PARAM */ + #if defined (__STDC__) || defined (__cplusplus) + int yyparse (void); + #else + int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ int yynerrs; ! /*----------. ! | yyparse. | ! `----------*/ ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! #endif ! #endif { ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 2066,2072 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 2387,2393 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 2076,2106 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 2397,2415 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 2117,2125 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 2426,2432 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 2134,2140 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 2441,2447 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 2147,2179 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 2454,2482 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 2182,2208 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 2485,2508 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 2210,2216 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 2510,2515 ---- *************** yybackup: *** 2223,2310 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 2522,2576 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 2335,2780 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { ! int yyi; ! ! YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", ! yyn, yyrline[yyn]); ! ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) ! YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); ! YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); ! } ! #endif ! ! switch (yyn) { ! ! case 1: #line 287 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids an empty source file"); finish_file (); ! ; ! break;} ! case 2: #line 292 "c-parse.y" ! { /* In case there were missing closebraces, get us back to the global binding level. */ while (! global_bindings_p ()) poplevel (0, 0, 0); finish_fname_decls (); finish_file (); ! ; ! break;} ! case 3: #line 307 "c-parse.y" ! {yyval.ttype = NULL_TREE; ; ! break;} ! case 5: #line 308 "c-parse.y" ! {yyval.ttype = NULL_TREE; ggc_collect(); ; ! break;} ! case 9: #line 315 "c-parse.y" ! { STRIP_NOPS (yyvsp[-2].ttype); if ((TREE_CODE (yyvsp[-2].ttype) == ADDR_EXPR && TREE_CODE (TREE_OPERAND (yyvsp[-2].ttype, 0)) == STRING_CST) || TREE_CODE (yyvsp[-2].ttype) == STRING_CST) assemble_asm (yyvsp[-2].ttype); else ! error ("argument of `asm' is not a constant string"); ; ! break;} ! case 10: #line 323 "c-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 11: #line 328 "c-parse.y" ! { if (pedantic) error ("ISO C forbids data definition with no type or storage class"); else if (!flag_traditional) warning ("data definition has no type or storage class"); ! POP_DECLSPEC_STACK; ; ! break;} ! case 12: #line 335 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 13: #line 337 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 14: #line 339 "c-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ; ! break;} ! case 17: #line 343 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C does not allow extra `;' outside of a function"); ; ! break;} ! case 18: #line 349 "c-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 19: #line 354 "c-parse.y" ! { store_parm_decls (); ; ! break;} ! case 20: #line 356 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 21: #line 361 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 22: #line 363 "c-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 23: #line 368 "c-parse.y" ! { store_parm_decls (); ; ! break;} ! case 24: #line 370 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 25: #line 375 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 26: #line 377 "c-parse.y" ! { if (! start_function (NULL_TREE, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 27: #line 382 "c-parse.y" ! { store_parm_decls (); ; ! break;} ! case 28: #line 384 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 29: #line 389 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 32: #line 398 "c-parse.y" ! { yyval.code = ADDR_EXPR; ; ! break;} ! case 33: #line 400 "c-parse.y" ! { yyval.code = NEGATE_EXPR; ; ! break;} ! case 34: #line 402 "c-parse.y" ! { yyval.code = CONVERT_EXPR; if (warn_traditional && !in_system_header) warning ("traditional C rejects the unary plus operator"); ! ; ! break;} ! case 35: #line 407 "c-parse.y" ! { yyval.code = PREINCREMENT_EXPR; ; ! break;} ! case 36: #line 409 "c-parse.y" ! { yyval.code = PREDECREMENT_EXPR; ; ! break;} ! case 37: #line 411 "c-parse.y" ! { yyval.code = BIT_NOT_EXPR; ; ! break;} ! case 38: #line 413 "c-parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ; ! break;} ! case 39: #line 417 "c-parse.y" ! { yyval.ttype = build_compound_expr (yyvsp[0].ttype); ; ! break;} ! case 40: #line 422 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 42: #line 428 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 43: #line 430 "c-parse.y" ! { chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 45: #line 436 "c-parse.y" ! { yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ; ! break;} ! case 46: #line 439 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 47: #line 442 "c-parse.y" ! { yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ! overflow_warning (yyval.ttype); ; ! break;} ! case 48: #line 446 "c-parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ; ! break;} ! case 49: #line 463 "c-parse.y" ! { skip_evaluation--; if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF && DECL_C_BIT_FIELD (TREE_OPERAND (yyvsp[0].ttype, 1))) error ("`sizeof' applied to a bit-field"); ! yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ; ! break;} ! case 50: #line 469 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 51: #line 472 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof_expr (yyvsp[0].ttype); ; ! break;} ! case 52: #line 475 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 53: #line 478 "c-parse.y" ! { yyval.ttype = build_unary_op (REALPART_EXPR, yyvsp[0].ttype, 0); ; ! break;} ! case 54: #line 480 "c-parse.y" ! { yyval.ttype = build_unary_op (IMAGPART_EXPR, yyvsp[0].ttype, 0); ; ! break;} ! case 55: #line 484 "c-parse.y" ! { skip_evaluation++; ; ! break;} ! case 56: #line 488 "c-parse.y" ! { skip_evaluation++; ; ! break;} ! case 57: #line 492 "c-parse.y" ! { skip_evaluation++; ; ! break;} ! case 59: #line 498 "c-parse.y" ! { yyval.ttype = c_cast_expr (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 61: #line 504 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 62: #line 506 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 63: #line 508 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 64: #line 510 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 65: #line 512 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 66: #line 514 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 67: #line 516 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 68: #line 518 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 69: #line 520 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 70: #line 522 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 71: #line 524 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 72: #line 526 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 73: #line 528 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ; ! break;} ! case 74: #line 531 "c-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_false_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 75: #line 534 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ; ! break;} ! case 76: #line 537 "c-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_true_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 77: #line 540 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ; ! break;} ! case 78: #line 543 "c-parse.y" ! { skip_evaluation += ((yyvsp[-4].ttype == boolean_true_node) ! - (yyvsp[-4].ttype == boolean_false_node)); ; ! break;} ! case 79: #line 546 "c-parse.y" ! { skip_evaluation -= yyvsp[-6].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 80: #line 549 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids omitting the middle term of a ?: expression"); /* Make sure first operand is calculated only once. */ yyvsp[0].ttype = save_expr (yyvsp[-1].ttype); yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[0].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ; ! break;} ! case 81: #line 556 "c-parse.y" ! { skip_evaluation -= yyvsp[-4].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 82: #line 559 "c-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ! ; ! break;} ! case 83: #line 566 "c-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); /* This inhibits warnings in truthvalue_conversion. */ class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, ERROR_MARK); ! ; ! break;} ! case 84: #line 577 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = build_external_ref (yyvsp[0].ttype, yychar == '('); ! ; ! break;} ! case 86: #line 584 "c-parse.y" ! { yyval.ttype = combine_strings (yyvsp[0].ttype); ; ! break;} ! case 87: #line 586 "c-parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); ; ! break;} ! case 88: #line 588 "c-parse.y" ! { start_init (NULL_TREE, NULL, 0); yyvsp[-2].ttype = groktypename (yyvsp[-2].ttype); ! really_start_incremental_init (yyvsp[-2].ttype); ; ! break;} ! case 89: #line 592 "c-parse.y" ! { tree constructor = pop_init_level (0); tree type = yyvsp[-5].ttype; finish_init (); if (pedantic && ! flag_isoc99) pedwarn ("ISO C89 forbids compound literals"); yyval.ttype = build_compound_literal (type, constructor); ! ; ! break;} ! case 90: #line 601 "c-parse.y" ! { char class = TREE_CODE_CLASS (TREE_CODE (yyvsp[-1].ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyvsp[-1].ttype, ERROR_MARK); ! yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 91: #line 606 "c-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 92: #line 608 "c-parse.y" ! { tree saved_last_tree; if (pedantic) pedwarn ("ISO C forbids braced-groups within expressions"); --- 2601,3102 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) { ! case 2: #line 287 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids an empty source file"); finish_file (); ! ;} ! break; ! ! case 3: #line 292 "c-parse.y" ! { /* In case there were missing closebraces, get us back to the global binding level. */ while (! global_bindings_p ()) poplevel (0, 0, 0); finish_fname_decls (); finish_file (); ! ;} ! break; ! ! case 4: #line 307 "c-parse.y" ! {yyval.ttype = NULL_TREE; ;} ! break; ! ! case 6: #line 308 "c-parse.y" ! {yyval.ttype = NULL_TREE; ggc_collect(); ;} ! break; ! ! case 10: #line 315 "c-parse.y" ! { STRIP_NOPS (yyvsp[-2].ttype); if ((TREE_CODE (yyvsp[-2].ttype) == ADDR_EXPR && TREE_CODE (TREE_OPERAND (yyvsp[-2].ttype, 0)) == STRING_CST) || TREE_CODE (yyvsp[-2].ttype) == STRING_CST) assemble_asm (yyvsp[-2].ttype); else ! error ("argument of `asm' is not a constant string"); ;} ! break; ! ! case 11: #line 323 "c-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 12: #line 328 "c-parse.y" ! { if (pedantic) error ("ISO C forbids data definition with no type or storage class"); else if (!flag_traditional) warning ("data definition has no type or storage class"); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 13: #line 335 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 14: #line 337 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 15: #line 339 "c-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ;} ! break; ! ! case 18: #line 343 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C does not allow extra `;' outside of a function"); ;} ! break; ! ! case 19: #line 349 "c-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 20: #line 354 "c-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 21: #line 356 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 22: #line 361 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 23: #line 363 "c-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 24: #line 368 "c-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 25: #line 370 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 26: #line 375 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 27: #line 377 "c-parse.y" ! { if (! start_function (NULL_TREE, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 28: #line 382 "c-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 29: #line 384 "c-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 30: #line 389 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 33: #line 398 "c-parse.y" ! { yyval.code = ADDR_EXPR; ;} ! break; ! ! case 34: #line 400 "c-parse.y" ! { yyval.code = NEGATE_EXPR; ;} ! break; ! ! case 35: #line 402 "c-parse.y" ! { yyval.code = CONVERT_EXPR; if (warn_traditional && !in_system_header) warning ("traditional C rejects the unary plus operator"); ! ;} ! break; ! ! case 36: #line 407 "c-parse.y" ! { yyval.code = PREINCREMENT_EXPR; ;} ! break; ! ! case 37: #line 409 "c-parse.y" ! { yyval.code = PREDECREMENT_EXPR; ;} ! break; ! ! case 38: #line 411 "c-parse.y" ! { yyval.code = BIT_NOT_EXPR; ;} ! break; ! ! case 39: #line 413 "c-parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ;} ! break; ! ! case 40: #line 417 "c-parse.y" ! { yyval.ttype = build_compound_expr (yyvsp[0].ttype); ;} ! break; ! ! case 41: #line 422 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 43: #line 428 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 44: #line 430 "c-parse.y" ! { chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 46: #line 436 "c-parse.y" ! { yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ;} ! break; ! ! case 47: #line 439 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 48: #line 442 "c-parse.y" ! { yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ! overflow_warning (yyval.ttype); ;} ! break; ! ! case 49: #line 446 "c-parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ;} ! break; ! ! case 50: #line 463 "c-parse.y" ! { skip_evaluation--; if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF && DECL_C_BIT_FIELD (TREE_OPERAND (yyvsp[0].ttype, 1))) error ("`sizeof' applied to a bit-field"); ! yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ;} ! break; ! ! case 51: #line 469 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 52: #line 472 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof_expr (yyvsp[0].ttype); ;} ! break; ! ! case 53: #line 475 "c-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 54: #line 478 "c-parse.y" ! { yyval.ttype = build_unary_op (REALPART_EXPR, yyvsp[0].ttype, 0); ;} ! break; ! ! case 55: #line 480 "c-parse.y" ! { yyval.ttype = build_unary_op (IMAGPART_EXPR, yyvsp[0].ttype, 0); ;} ! break; ! ! case 56: #line 484 "c-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 57: #line 488 "c-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 58: #line 492 "c-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 60: #line 498 "c-parse.y" ! { yyval.ttype = c_cast_expr (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 62: #line 504 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 63: #line 506 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 64: #line 508 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 65: #line 510 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 66: #line 512 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 67: #line 514 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 68: #line 516 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 69: #line 518 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 70: #line 520 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 71: #line 522 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 72: #line 524 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 73: #line 526 "c-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 74: #line 528 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ;} ! break; ! ! case 75: #line 531 "c-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_false_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 76: #line 534 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ;} ! break; ! ! case 77: #line 537 "c-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_true_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 78: #line 540 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ;} ! break; ! ! case 79: #line 543 "c-parse.y" ! { skip_evaluation += ((yyvsp[-4].ttype == boolean_true_node) ! - (yyvsp[-4].ttype == boolean_false_node)); ;} ! break; ! ! case 80: #line 546 "c-parse.y" ! { skip_evaluation -= yyvsp[-6].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 81: #line 549 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids omitting the middle term of a ?: expression"); /* Make sure first operand is calculated only once. */ yyvsp[0].ttype = save_expr (yyvsp[-1].ttype); yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[0].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ;} ! break; ! ! case 82: #line 556 "c-parse.y" ! { skip_evaluation -= yyvsp[-4].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 83: #line 559 "c-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ! ;} ! break; ! ! case 84: #line 566 "c-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); /* This inhibits warnings in truthvalue_conversion. */ class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, ERROR_MARK); ! ;} ! break; ! ! case 85: #line 577 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = build_external_ref (yyvsp[0].ttype, yychar == '('); ! ;} ! break; ! ! case 87: #line 584 "c-parse.y" ! { yyval.ttype = combine_strings (yyvsp[0].ttype); ;} ! break; ! ! case 88: #line 586 "c-parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); ;} ! break; ! ! case 89: #line 588 "c-parse.y" ! { start_init (NULL_TREE, NULL, 0); yyvsp[-2].ttype = groktypename (yyvsp[-2].ttype); ! really_start_incremental_init (yyvsp[-2].ttype); ;} ! break; ! ! case 90: #line 592 "c-parse.y" ! { tree constructor = pop_init_level (0); tree type = yyvsp[-5].ttype; finish_init (); if (pedantic && ! flag_isoc99) pedwarn ("ISO C89 forbids compound literals"); yyval.ttype = build_compound_literal (type, constructor); ! ;} ! break; ! ! case 91: #line 601 "c-parse.y" ! { char class = TREE_CODE_CLASS (TREE_CODE (yyvsp[-1].ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyvsp[-1].ttype, ERROR_MARK); ! yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 92: #line 606 "c-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 93: #line 608 "c-parse.y" ! { tree saved_last_tree; if (pedantic) pedwarn ("ISO C forbids braced-groups within expressions"); *************** case 92: *** 2788,2815 **** last_expr_type = void_type_node; yyval.ttype = build1 (STMT_EXPR, last_expr_type, yyvsp[-2].ttype); TREE_SIDE_EFFECTS (yyval.ttype) = 1; ! ; ! break;} ! case 93: #line 624 "c-parse.y" ! { pop_label_level (); last_tree = COMPOUND_BODY (yyvsp[-2].ttype); TREE_CHAIN (last_tree) = NULL_TREE; yyval.ttype = error_mark_node; ! ; ! break;} ! case 94: #line 631 "c-parse.y" ! { yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 95: #line 633 "c-parse.y" ! { yyval.ttype = build_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 96: #line 636 "c-parse.y" ! { tree c; c = fold (yyvsp[-5].ttype); --- 3110,3141 ---- last_expr_type = void_type_node; yyval.ttype = build1 (STMT_EXPR, last_expr_type, yyvsp[-2].ttype); TREE_SIDE_EFFECTS (yyval.ttype) = 1; ! ;} ! break; ! ! case 94: #line 624 "c-parse.y" ! { pop_label_level (); last_tree = COMPOUND_BODY (yyvsp[-2].ttype); TREE_CHAIN (last_tree) = NULL_TREE; yyval.ttype = error_mark_node; ! ;} ! break; ! ! case 95: #line 631 "c-parse.y" ! { yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 96: #line 633 "c-parse.y" ! { yyval.ttype = build_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 97: #line 636 "c-parse.y" ! { tree c; c = fold (yyvsp[-5].ttype); *************** case 96: *** 2817,2827 **** if (TREE_CODE (c) != INTEGER_CST) error ("first argument to __builtin_choose_expr not a constant"); yyval.ttype = integer_zerop (c) ? yyvsp[-1].ttype : yyvsp[-3].ttype; ! ; ! break;} ! case 97: #line 646 "c-parse.y" ! { tree e1, e2; e1 = TYPE_MAIN_VARIANT (groktypename (yyvsp[-3].ttype)); --- 3143,3154 ---- if (TREE_CODE (c) != INTEGER_CST) error ("first argument to __builtin_choose_expr not a constant"); yyval.ttype = integer_zerop (c) ? yyvsp[-1].ttype : yyvsp[-3].ttype; ! ;} ! break; ! ! case 98: #line 646 "c-parse.y" ! { tree e1, e2; e1 = TYPE_MAIN_VARIANT (groktypename (yyvsp[-3].ttype)); *************** case 97: *** 2829,2865 **** yyval.ttype = comptypes (e1, e2) ? build_int_2 (1, 0) : build_int_2 (0, 0); ! ; ! break;} ! case 98: #line 656 "c-parse.y" ! { yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 99: #line 658 "c-parse.y" ! { yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 100: #line 662 "c-parse.y" ! { tree expr = build_indirect_ref (yyvsp[-2].ttype, "->"); yyval.ttype = build_component_ref (expr, yyvsp[0].ttype); ! ; ! break;} ! case 101: #line 668 "c-parse.y" ! { yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ; ! break;} ! case 102: #line 670 "c-parse.y" ! { yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ; ! break;} ! case 104: #line 677 "c-parse.y" ! { static int last_lineno = 0; static const char *last_input_filename = 0; yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); --- 3156,3198 ---- yyval.ttype = comptypes (e1, e2) ? build_int_2 (1, 0) : build_int_2 (0, 0); ! ;} ! break; ! ! case 99: #line 656 "c-parse.y" ! { yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 100: #line 658 "c-parse.y" ! { yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 101: #line 662 "c-parse.y" ! { tree expr = build_indirect_ref (yyvsp[-2].ttype, "->"); yyval.ttype = build_component_ref (expr, yyvsp[0].ttype); ! ;} ! break; ! ! case 102: #line 668 "c-parse.y" ! { yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 103: #line 670 "c-parse.y" ! { yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 105: #line 677 "c-parse.y" ! { static int last_lineno = 0; static const char *last_input_filename = 0; yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); *************** case 104: *** 2871,3563 **** last_lineno = lineno; last_input_filename = input_filename; } ! ; ! break;} ! case 107: #line 698 "c-parse.y" ! { c_mark_varargs (); if (pedantic) ! pedwarn ("ISO C does not permit use of `varargs.h'"); ; ! break;} ! case 108: #line 708 "c-parse.y" ! { ; ! break;} ! case 113: #line 724 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 114: #line 726 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 115: #line 728 "c-parse.y" ! { shadow_tag_warned (yyvsp[-1].ttype, 1); ! pedwarn ("empty declaration"); ; ! break;} ! case 116: #line 731 "c-parse.y" ! { pedwarn ("empty declaration"); ; ! break;} ! case 117: #line 740 "c-parse.y" ! { ; ! break;} ! case 118: #line 748 "c-parse.y" ! { pending_xref_error (); PUSH_DECLSPEC_STACK; split_specs_attrs (yyvsp[0].ttype, ¤t_declspecs, &prefix_attributes); ! all_prefix_attributes = prefix_attributes; ; ! break;} ! case 119: #line 759 "c-parse.y" ! { all_prefix_attributes = chainon (yyvsp[0].ttype, prefix_attributes); ; ! break;} ! case 120: #line 764 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 121: #line 766 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 122: #line 768 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 123: #line 770 "c-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 124: #line 772 "c-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ; ! break;} ! case 125: #line 774 "c-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 126: #line 831 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 127: #line 834 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 128: #line 837 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 129: #line 843 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 130: #line 849 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 131: #line 852 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 132: #line 858 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ; ! break;} ! case 133: #line 861 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 134: #line 867 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 135: #line 870 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 136: #line 873 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 137: #line 876 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 138: #line 879 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 139: #line 882 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 140: #line 885 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 141: #line 891 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 142: #line 894 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 143: #line 897 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 144: #line 900 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 145: #line 903 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 146: #line 906 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 147: #line 912 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 148: #line 915 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 149: #line 918 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 150: #line 921 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 151: #line 924 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 152: #line 927 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 153: #line 933 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 154: #line 936 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 155: #line 939 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 156: #line 942 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 157: #line 945 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 158: #line 951 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ; ! break;} ! case 159: #line 954 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 160: #line 957 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 161: #line 960 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 162: #line 966 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 163: #line 972 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 164: #line 978 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 165: #line 987 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 166: #line 993 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 167: #line 996 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 168: #line 999 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 169: #line 1005 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 170: #line 1011 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 171: #line 1017 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 172: #line 1026 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 173: #line 1032 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 174: #line 1035 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 175: #line 1038 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 176: #line 1041 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 177: #line 1044 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 178: #line 1047 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 179: #line 1050 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 180: #line 1056 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 181: #line 1062 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 182: #line 1068 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 183: #line 1077 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 184: #line 1080 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 185: #line 1083 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 186: #line 1086 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 187: #line 1089 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 188: #line 1095 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 189: #line 1098 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 190: #line 1101 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 191: #line 1104 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 192: #line 1107 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 193: #line 1110 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 194: #line 1113 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 195: #line 1119 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 196: #line 1125 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 197: #line 1131 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 198: #line 1140 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 199: #line 1143 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 200: #line 1146 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 201: #line 1149 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 202: #line 1152 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 259: #line 1240 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 260: #line 1242 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 264: #line 1277 "c-parse.y" ! { OBJC_NEED_RAW_IDENTIFIER (1); ; ! break;} ! case 267: #line 1287 "c-parse.y" ! { /* For a typedef name, record the meaning, not the name. In case of `foo foo, bar;'. */ ! yyval.ttype = lookup_name (yyvsp[0].ttype); ; ! break;} ! case 268: #line 1291 "c-parse.y" ! { skip_evaluation--; yyval.ttype = TREE_TYPE (yyvsp[-1].ttype); ; ! break;} ! case 269: #line 1293 "c-parse.y" ! { skip_evaluation--; yyval.ttype = groktypename (yyvsp[-1].ttype); ; ! break;} ! case 274: #line 1310 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 275: #line 1312 "c-parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ! ; ! break;} ! case 276: #line 1319 "c-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ; ! break;} ! case 277: #line 1324 "c-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 278: #line 1327 "c-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ! ; ! break;} ! case 279: #line 1335 "c-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ; ! break;} ! case 280: #line 1340 "c-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 281: #line 1343 "c-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); ! finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 282: #line 1351 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 283: #line 1353 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 284: #line 1358 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 285: #line 1360 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 286: #line 1365 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ; ! break;} ! case 287: #line 1370 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 288: #line 1372 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 289: #line 1377 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 290: #line 1379 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 291: #line 1381 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ; ! break;} ! case 292: #line 1383 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ; ! break;} ! case 293: #line 1385 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 299: #line 1403 "c-parse.y" ! { really_start_incremental_init (NULL_TREE); ; ! break;} ! case 300: #line 1405 "c-parse.y" ! { yyval.ttype = pop_init_level (0); ; ! break;} ! case 301: #line 1407 "c-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 302: #line 1413 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids empty initializer braces"); ; ! break;} ! case 306: #line 1427 "c-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("ISO C89 forbids specifying subobject to initialize"); ; ! break;} ! case 307: #line 1430 "c-parse.y" ! { if (pedantic) ! pedwarn ("obsolete use of designated initializer without `='"); ; ! break;} ! case 308: #line 1433 "c-parse.y" ! { set_init_label (yyvsp[-1].ttype); if (pedantic) ! pedwarn ("obsolete use of designated initializer with `:'"); ; ! break;} ! case 309: #line 1437 "c-parse.y" ! {; ! break;} ! case 311: #line 1443 "c-parse.y" ! { push_init_level (0); ; ! break;} ! case 312: #line 1445 "c-parse.y" ! { process_init_element (pop_init_level (0)); ; ! break;} ! case 313: #line 1447 "c-parse.y" ! { process_init_element (yyvsp[0].ttype); ; ! break;} ! case 317: #line 1458 "c-parse.y" ! { set_init_label (yyvsp[0].ttype); ; ! break;} ! case 318: #line 1463 "c-parse.y" ! { set_init_index (yyvsp[-3].ttype, yyvsp[-1].ttype); if (pedantic) ! pedwarn ("ISO C forbids specifying range of elements to initialize"); ; ! break;} ! case 319: #line 1467 "c-parse.y" ! { set_init_index (yyvsp[-1].ttype, NULL_TREE); ; ! break;} ! case 320: #line 1472 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); --- 3204,4029 ---- last_lineno = lineno; last_input_filename = input_filename; } ! ;} ! break; ! ! case 108: #line 698 "c-parse.y" ! { c_mark_varargs (); if (pedantic) ! pedwarn ("ISO C does not permit use of `varargs.h'"); ;} ! break; ! ! case 109: #line 708 "c-parse.y" ! { ;} ! break; ! ! case 114: #line 724 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 115: #line 726 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 116: #line 728 "c-parse.y" ! { shadow_tag_warned (yyvsp[-1].ttype, 1); ! pedwarn ("empty declaration"); ;} ! break; ! ! case 117: #line 731 "c-parse.y" ! { pedwarn ("empty declaration"); ;} ! break; ! ! case 118: #line 740 "c-parse.y" ! { ;} ! break; ! ! case 119: #line 748 "c-parse.y" ! { pending_xref_error (); PUSH_DECLSPEC_STACK; split_specs_attrs (yyvsp[0].ttype, ¤t_declspecs, &prefix_attributes); ! all_prefix_attributes = prefix_attributes; ;} ! break; ! ! case 120: #line 759 "c-parse.y" ! { all_prefix_attributes = chainon (yyvsp[0].ttype, prefix_attributes); ;} ! break; ! ! case 121: #line 764 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 122: #line 766 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 123: #line 768 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 124: #line 770 "c-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 125: #line 772 "c-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ;} ! break; ! ! case 126: #line 774 "c-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 127: #line 831 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 128: #line 834 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 129: #line 837 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 130: #line 843 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 131: #line 849 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 132: #line 852 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 133: #line 858 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ;} ! break; ! ! case 134: #line 861 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 135: #line 867 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 136: #line 870 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 137: #line 873 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 138: #line 876 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 139: #line 879 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 140: #line 882 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 141: #line 885 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 142: #line 891 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 143: #line 894 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 144: #line 897 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 145: #line 900 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 146: #line 903 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 147: #line 906 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 148: #line 912 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 149: #line 915 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 150: #line 918 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 151: #line 921 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 152: #line 924 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 153: #line 927 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 154: #line 933 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 155: #line 936 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 156: #line 939 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 157: #line 942 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 158: #line 945 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 159: #line 951 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ;} ! break; ! ! case 160: #line 954 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 161: #line 957 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 162: #line 960 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 163: #line 966 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 164: #line 972 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 165: #line 978 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 166: #line 987 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 167: #line 993 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 168: #line 996 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 169: #line 999 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 170: #line 1005 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 171: #line 1011 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 172: #line 1017 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 173: #line 1026 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 174: #line 1032 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 175: #line 1035 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 176: #line 1038 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 177: #line 1041 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 178: #line 1044 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 179: #line 1047 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 180: #line 1050 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 181: #line 1056 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 182: #line 1062 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 183: #line 1068 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 184: #line 1077 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 185: #line 1080 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 186: #line 1083 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 187: #line 1086 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 188: #line 1089 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 189: #line 1095 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 190: #line 1098 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 191: #line 1101 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 192: #line 1104 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 193: #line 1107 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 194: #line 1110 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 195: #line 1113 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 196: #line 1119 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 197: #line 1125 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 198: #line 1131 "c-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 199: #line 1140 "c-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 200: #line 1143 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 201: #line 1146 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 202: #line 1149 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 203: #line 1152 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 260: #line 1240 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 261: #line 1242 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 265: #line 1277 "c-parse.y" ! { OBJC_NEED_RAW_IDENTIFIER (1); ;} ! break; ! ! case 268: #line 1287 "c-parse.y" ! { /* For a typedef name, record the meaning, not the name. In case of `foo foo, bar;'. */ ! yyval.ttype = lookup_name (yyvsp[0].ttype); ;} ! break; ! ! case 269: #line 1291 "c-parse.y" ! { skip_evaluation--; yyval.ttype = TREE_TYPE (yyvsp[-1].ttype); ;} ! break; ! ! case 270: #line 1293 "c-parse.y" ! { skip_evaluation--; yyval.ttype = groktypename (yyvsp[-1].ttype); ;} ! break; ! ! case 275: #line 1310 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 276: #line 1312 "c-parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ! ;} ! break; ! ! case 277: #line 1319 "c-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ;} ! break; ! ! case 278: #line 1324 "c-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 279: #line 1327 "c-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ! ;} ! break; ! ! case 280: #line 1335 "c-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ;} ! break; ! ! case 281: #line 1340 "c-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 282: #line 1343 "c-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); ! finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 283: #line 1351 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 284: #line 1353 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 285: #line 1358 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 286: #line 1360 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 287: #line 1365 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ;} ! break; ! ! case 288: #line 1370 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 289: #line 1372 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 290: #line 1377 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 291: #line 1379 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 292: #line 1381 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ;} ! break; ! ! case 293: #line 1383 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ;} ! break; ! ! case 294: #line 1385 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 300: #line 1403 "c-parse.y" ! { really_start_incremental_init (NULL_TREE); ;} ! break; ! ! case 301: #line 1405 "c-parse.y" ! { yyval.ttype = pop_init_level (0); ;} ! break; ! ! case 302: #line 1407 "c-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 303: #line 1413 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids empty initializer braces"); ;} ! break; ! ! case 307: #line 1427 "c-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("ISO C89 forbids specifying subobject to initialize"); ;} ! break; ! ! case 308: #line 1430 "c-parse.y" ! { if (pedantic) ! pedwarn ("obsolete use of designated initializer without `='"); ;} ! break; ! ! case 309: #line 1433 "c-parse.y" ! { set_init_label (yyvsp[-1].ttype); if (pedantic) ! pedwarn ("obsolete use of designated initializer with `:'"); ;} ! break; ! ! case 310: #line 1437 "c-parse.y" ! {;} ! break; ! ! case 312: #line 1443 "c-parse.y" ! { push_init_level (0); ;} ! break; ! ! case 313: #line 1445 "c-parse.y" ! { process_init_element (pop_init_level (0)); ;} ! break; ! ! case 314: #line 1447 "c-parse.y" ! { process_init_element (yyvsp[0].ttype); ;} ! break; ! ! case 318: #line 1458 "c-parse.y" ! { set_init_label (yyvsp[0].ttype); ;} ! break; ! ! case 319: #line 1463 "c-parse.y" ! { set_init_index (yyvsp[-3].ttype, yyvsp[-1].ttype); if (pedantic) ! pedwarn ("ISO C forbids specifying range of elements to initialize"); ;} ! break; ! ! case 320: #line 1467 "c-parse.y" ! { set_init_index (yyvsp[-1].ttype, NULL_TREE); ;} ! break; ! ! case 321: #line 1472 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); *************** case 320: *** 3567,3590 **** pop_function_context (); YYERROR1; } ! ; ! break;} ! case 321: #line 1484 "c-parse.y" ! { store_parm_decls (); ; ! break;} ! case 322: #line 1492 "c-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ; ! break;} ! case 323: #line 1502 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); --- 4033,4059 ---- pop_function_context (); YYERROR1; } ! ;} ! break; ! ! case 322: #line 1484 "c-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 323: #line 1492 "c-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ;} ! break; ! ! case 324: #line 1502 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); *************** case 323: *** 3594,3797 **** pop_function_context (); YYERROR1; } ! ; ! break;} ! case 324: #line 1514 "c-parse.y" ! { store_parm_decls (); ; ! break;} ! case 325: #line 1522 "c-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ; ! break;} ! case 328: #line 1542 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 329: #line 1544 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 330: #line 1549 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 331: #line 1551 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 335: #line 1566 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 336: #line 1571 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 338: #line 1577 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 339: #line 1582 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 340: #line 1584 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 341: #line 1586 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 342: #line 1588 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 343: #line 1596 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 344: #line 1601 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 345: #line 1603 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 346: #line 1605 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 348: #line 1611 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 349: #line 1613 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 350: #line 1618 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 351: #line 1620 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 352: #line 1625 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 353: #line 1627 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 354: #line 1638 "c-parse.y" ! { yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype); /* Start scope of tag before parsing components. */ ! ; ! break;} ! case 355: #line 1642 "c-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 356: #line 1644 "c-parse.y" ! { yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ; ! break;} ! case 357: #line 1648 "c-parse.y" ! { yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ; ! break;} ! case 358: #line 1650 "c-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 359: #line 1652 "c-parse.y" ! { yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ; ! break;} ! case 360: #line 1656 "c-parse.y" ! { yyval.ttype = start_enum (yyvsp[-1].ttype); ; ! break;} ! case 361: #line 1658 "c-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-7].ttype, yyvsp[0].ttype)); ; ! break;} ! case 362: #line 1661 "c-parse.y" ! { yyval.ttype = start_enum (NULL_TREE); ; ! break;} ! case 363: #line 1663 "c-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 364: #line 1669 "c-parse.y" ! { yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ; ! break;} ! case 365: #line 1671 "c-parse.y" ! { yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ; ! break;} ! case 366: #line 1673 "c-parse.y" ! { yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); /* In ISO C, enumerated types can be referred to only if already defined. */ if (pedantic && !COMPLETE_TYPE_P (yyval.ttype)) ! pedwarn ("ISO C forbids forward references to `enum' types"); ; ! break;} ! case 370: #line 1688 "c-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("comma at end of enumerator list"); ; ! break;} ! case 371: #line 1694 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 372: #line 1696 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! pedwarn ("no semicolon at end of struct or union"); ; ! break;} ! case 373: #line 1701 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 374: #line 1703 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 375: #line 1705 "c-parse.y" ! { if (pedantic) ! pedwarn ("extra semicolon in struct or union specified"); ; ! break;} ! case 376: #line 1711 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 377: #line 1714 "c-parse.y" ! { /* Support for unnamed structs or unions as members of structs or unions (which is [a] useful and [b] supports MS P-SDK). */ --- 4063,4310 ---- pop_function_context (); YYERROR1; } ! ;} ! break; ! ! case 325: #line 1514 "c-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 326: #line 1522 "c-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ;} ! break; ! ! case 329: #line 1542 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 330: #line 1544 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 331: #line 1549 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 332: #line 1551 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 336: #line 1566 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 337: #line 1571 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 339: #line 1577 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 340: #line 1582 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 341: #line 1584 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 342: #line 1586 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 343: #line 1588 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 344: #line 1596 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 345: #line 1601 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 346: #line 1603 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 347: #line 1605 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 349: #line 1611 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 350: #line 1613 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 351: #line 1618 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 352: #line 1620 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 353: #line 1625 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 354: #line 1627 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 355: #line 1638 "c-parse.y" ! { yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype); /* Start scope of tag before parsing components. */ ! ;} ! break; ! ! case 356: #line 1642 "c-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 357: #line 1644 "c-parse.y" ! { yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ;} ! break; ! ! case 358: #line 1648 "c-parse.y" ! { yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ;} ! break; ! ! case 359: #line 1650 "c-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 360: #line 1652 "c-parse.y" ! { yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ;} ! break; ! ! case 361: #line 1656 "c-parse.y" ! { yyval.ttype = start_enum (yyvsp[-1].ttype); ;} ! break; ! ! case 362: #line 1658 "c-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-7].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 363: #line 1661 "c-parse.y" ! { yyval.ttype = start_enum (NULL_TREE); ;} ! break; ! ! case 364: #line 1663 "c-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 365: #line 1669 "c-parse.y" ! { yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ;} ! break; ! ! case 366: #line 1671 "c-parse.y" ! { yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ;} ! break; ! ! case 367: #line 1673 "c-parse.y" ! { yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); /* In ISO C, enumerated types can be referred to only if already defined. */ if (pedantic && !COMPLETE_TYPE_P (yyval.ttype)) ! pedwarn ("ISO C forbids forward references to `enum' types"); ;} ! break; ! ! case 371: #line 1688 "c-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("comma at end of enumerator list"); ;} ! break; ! ! case 372: #line 1694 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 373: #line 1696 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! pedwarn ("no semicolon at end of struct or union"); ;} ! break; ! ! case 374: #line 1701 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 375: #line 1703 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 376: #line 1705 "c-parse.y" ! { if (pedantic) ! pedwarn ("extra semicolon in struct or union specified"); ;} ! break; ! ! case 377: #line 1711 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 378: #line 1714 "c-parse.y" ! { /* Support for unnamed structs or unions as members of structs or unions (which is [a] useful and [b] supports MS P-SDK). */ *************** case 377: *** 3799,4014 **** pedwarn ("ISO C doesn't support unnamed structs/unions"); yyval.ttype = grokfield(yyvsp[-1].filename, yyvsp[0].lineno, NULL, current_declspecs, NULL_TREE); ! POP_DECLSPEC_STACK; ; ! break;} ! case 378: #line 1724 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 379: #line 1727 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids member declarations with no members"); shadow_tag(yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 380: #line 1732 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 381: #line 1734 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 383: #line 1741 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 385: #line 1747 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 386: #line 1752 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 387: #line 1756 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 388: #line 1759 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 389: #line 1765 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 390: #line 1769 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 391: #line 1772 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 393: #line 1784 "c-parse.y" ! { if (yyvsp[-2].ttype == error_mark_node) yyval.ttype = yyvsp[-2].ttype; else ! yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ; ! break;} ! case 394: #line 1789 "c-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 395: #line 1795 "c-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 396: #line 1797 "c-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 397: #line 1802 "c-parse.y" ! { pending_xref_error (); ! yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 398: #line 1805 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 399: #line 1810 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 401: #line 1816 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, NULL_TREE), ! all_prefix_attributes); ; ! break;} ! case 402: #line 1820 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[0].ttype), ! all_prefix_attributes); ; ! break;} ! case 403: #line 1824 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ; ! break;} ! case 407: #line 1837 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 408: #line 1842 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 409: #line 1844 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 410: #line 1849 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 411: #line 1851 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 412: #line 1853 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 1); ; ! break;} ! case 413: #line 1855 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 414: #line 1857 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, NULL_TREE, 1); ; ! break;} ! case 415: #line 1864 "c-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 0, 0); ; ! break;} ! case 416: #line 1866 "c-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 0, 0); ; ! break;} ! case 417: #line 1868 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 0); ; ! break;} ! case 418: #line 1870 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-1].ttype, 0, 0); ; ! break;} ! case 419: #line 1872 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 1); ; ! break;} ! case 420: #line 1874 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-2].ttype, 0, 1); ; ! break;} ! case 421: #line 1876 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 1, 0); ; ! break;} ! case 422: #line 1880 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-3].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 1, 0); ; ! break;} ! case 423: #line 1884 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-3].ttype, 1, 0); ; ! break;} ! case 426: #line 1899 "c-parse.y" ! { pedwarn ("deprecated use of label at end of compound statement"); ! ; ! break;} ! case 434: #line 1916 "c-parse.y" ! { if (pedantic && !flag_isoc99) ! pedwarn ("ISO C89 forbids mixed declarations and code"); ; ! break;} ! case 449: #line 1946 "c-parse.y" ! { pushlevel (0); clear_last_expr (); add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0); ! ; ! break;} ! case 450: #line 1953 "c-parse.y" ! { yyval.ttype = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); ; ! break;} ! case 451: #line 1958 "c-parse.y" ! { if (flag_isoc99) { yyval.ttype = c_begin_compound_stmt (); pushlevel (0); --- 4312,4571 ---- pedwarn ("ISO C doesn't support unnamed structs/unions"); yyval.ttype = grokfield(yyvsp[-1].filename, yyvsp[0].lineno, NULL, current_declspecs, NULL_TREE); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 379: #line 1724 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 380: #line 1727 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids member declarations with no members"); shadow_tag(yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 381: #line 1732 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 382: #line 1734 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 384: #line 1741 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 386: #line 1747 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 387: #line 1752 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 388: #line 1756 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 389: #line 1759 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 390: #line 1765 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 391: #line 1769 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 392: #line 1772 "c-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 394: #line 1784 "c-parse.y" ! { if (yyvsp[-2].ttype == error_mark_node) yyval.ttype = yyvsp[-2].ttype; else ! yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 395: #line 1789 "c-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 396: #line 1795 "c-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 397: #line 1797 "c-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 398: #line 1802 "c-parse.y" ! { pending_xref_error (); ! yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 399: #line 1805 "c-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 400: #line 1810 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 402: #line 1816 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, NULL_TREE), ! all_prefix_attributes); ;} ! break; ! ! case 403: #line 1820 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[0].ttype), ! all_prefix_attributes); ;} ! break; ! ! case 404: #line 1824 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ;} ! break; ! ! case 408: #line 1837 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 409: #line 1842 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 410: #line 1844 "c-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 411: #line 1849 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 412: #line 1851 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 413: #line 1853 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 1); ;} ! break; ! ! case 414: #line 1855 "c-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 415: #line 1857 "c-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, NULL_TREE, 1); ;} ! break; ! ! case 416: #line 1864 "c-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 0, 0); ;} ! break; ! ! case 417: #line 1866 "c-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 0, 0); ;} ! break; ! ! case 418: #line 1868 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 0); ;} ! break; ! ! case 419: #line 1870 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-1].ttype, 0, 0); ;} ! break; ! ! case 420: #line 1872 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 1); ;} ! break; ! ! case 421: #line 1874 "c-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-2].ttype, 0, 1); ;} ! break; ! ! case 422: #line 1876 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 1, 0); ;} ! break; ! ! case 423: #line 1880 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-3].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 1, 0); ;} ! break; ! ! case 424: #line 1884 "c-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-3].ttype, 1, 0); ;} ! break; ! ! case 427: #line 1899 "c-parse.y" ! { pedwarn ("deprecated use of label at end of compound statement"); ! ;} ! break; ! ! case 435: #line 1916 "c-parse.y" ! { if (pedantic && !flag_isoc99) ! pedwarn ("ISO C89 forbids mixed declarations and code"); ;} ! break; ! ! case 450: #line 1946 "c-parse.y" ! { pushlevel (0); clear_last_expr (); add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0); ! ;} ! break; ! ! case 451: #line 1953 "c-parse.y" ! { yyval.ttype = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); ;} ! break; ! ! case 452: #line 1958 "c-parse.y" ! { if (flag_isoc99) { yyval.ttype = c_begin_compound_stmt (); pushlevel (0); *************** case 451: *** 4017,4027 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 452: #line 1974 "c-parse.y" ! { if (flag_isoc99) { tree scope_stmt = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); yyval.ttype = poplevel (kept_level_p (), 0, 0); --- 4574,4585 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 453: #line 1974 "c-parse.y" ! { if (flag_isoc99) { tree scope_stmt = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); yyval.ttype = poplevel (kept_level_p (), 0, 0); *************** case 452: *** 4030,4076 **** = yyval.ttype; } else ! yyval.ttype = NULL_TREE; ; ! break;} ! case 454: #line 1991 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids label declarations"); ; ! break;} ! case 457: #line 2002 "c-parse.y" ! { tree link; for (link = yyvsp[-1].ttype; link; link = TREE_CHAIN (link)) { tree label = shadow_label (TREE_VALUE (link)); C_DECLARED_LABEL_FLAG (label) = 1; add_decl_stmt (label); } ! ; ! break;} ! case 458: #line 2016 "c-parse.y" ! {; ! break;} ! case 460: #line 2020 "c-parse.y" ! { compstmt_count++; ! yyval.ttype = c_begin_compound_stmt (); ; ! break;} ! case 461: #line 2025 "c-parse.y" ! { yyval.ttype = convert (void_type_node, integer_zero_node); ; ! break;} ! case 462: #line 2027 "c-parse.y" ! { yyval.ttype = poplevel (kept_level_p (), 1, 0); SCOPE_STMT_BLOCK (TREE_PURPOSE (yyvsp[0].ttype)) = SCOPE_STMT_BLOCK (TREE_VALUE (yyvsp[0].ttype)) ! = yyval.ttype; ; ! break;} ! case 465: #line 2040 "c-parse.y" ! { if (current_function_decl == 0) { error ("braced-group within expression allowed only inside a function"); YYERROR; --- 4588,4641 ---- = yyval.ttype; } else ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 455: #line 1991 "c-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids label declarations"); ;} ! break; ! ! case 458: #line 2002 "c-parse.y" ! { tree link; for (link = yyvsp[-1].ttype; link; link = TREE_CHAIN (link)) { tree label = shadow_label (TREE_VALUE (link)); C_DECLARED_LABEL_FLAG (label) = 1; add_decl_stmt (label); } ! ;} ! break; ! ! case 459: #line 2016 "c-parse.y" ! {;} ! break; ! ! case 461: #line 2020 "c-parse.y" ! { compstmt_count++; ! yyval.ttype = c_begin_compound_stmt (); ;} ! break; ! ! case 462: #line 2025 "c-parse.y" ! { yyval.ttype = convert (void_type_node, integer_zero_node); ;} ! break; ! ! case 463: #line 2027 "c-parse.y" ! { yyval.ttype = poplevel (kept_level_p (), 1, 0); SCOPE_STMT_BLOCK (TREE_PURPOSE (yyvsp[0].ttype)) = SCOPE_STMT_BLOCK (TREE_VALUE (yyvsp[0].ttype)) ! = yyval.ttype; ;} ! break; ! ! case 466: #line 2040 "c-parse.y" ! { if (current_function_decl == 0) { error ("braced-group within expression allowed only inside a function"); YYERROR; *************** case 465: *** 4083,4115 **** push_label_level (); compstmt_count++; yyval.ttype = add_stmt (build_stmt (COMPOUND_STMT, last_tree)); ! ; ! break;} ! case 466: #line 2057 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, COMPOUND_BODY (yyvsp[-1].ttype)); last_expr_type = NULL_TREE; ! yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 467: #line 2065 "c-parse.y" ! { c_finish_then (); ; ! break;} ! case 469: #line 2082 "c-parse.y" ! { yyval.ttype = c_begin_if_stmt (); ; ! break;} ! case 470: #line 2084 "c-parse.y" ! { c_expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), compstmt_count,yyvsp[-3].ttype); yyval.itype = stmt_count; if_stmt_file = yyvsp[-7].filename; ! if_stmt_line = yyvsp[-6].lineno; ; ! break;} ! case 471: #line 2096 "c-parse.y" ! { stmt_count++; compstmt_count++; yyval.ttype = add_stmt (build_stmt (DO_STMT, NULL_TREE, --- 4648,4685 ---- push_label_level (); compstmt_count++; yyval.ttype = add_stmt (build_stmt (COMPOUND_STMT, last_tree)); ! ;} ! break; ! ! case 467: #line 2057 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, COMPOUND_BODY (yyvsp[-1].ttype)); last_expr_type = NULL_TREE; ! yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 468: #line 2065 "c-parse.y" ! { c_finish_then (); ;} ! break; ! ! case 470: #line 2082 "c-parse.y" ! { yyval.ttype = c_begin_if_stmt (); ;} ! break; ! ! case 471: #line 2084 "c-parse.y" ! { c_expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), compstmt_count,yyvsp[-3].ttype); yyval.itype = stmt_count; if_stmt_file = yyvsp[-7].filename; ! if_stmt_line = yyvsp[-6].lineno; ;} ! break; ! ! case 472: #line 2096 "c-parse.y" ! { stmt_count++; compstmt_count++; yyval.ttype = add_stmt (build_stmt (DO_STMT, NULL_TREE, *************** case 471: *** 4118,4150 **** parsing the complete do-statement, set the condition now. Otherwise, we can get crashes at RTL-generation time. */ ! DO_COND (yyval.ttype) = error_mark_node; ; ! break;} ! case 472: #line 2107 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ! RECHAIN_STMTS (yyval.ttype, DO_BODY (yyval.ttype)); ; ! break;} ! case 473: #line 2115 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.filename = input_filename; ; ! break;} ! case 474: #line 2121 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.lineno = lineno; ; ! break;} ! case 477: #line 2134 "c-parse.y" ! { if (flag_isoc99) ! RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ; ! break;} ! case 478: #line 2140 "c-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; /* ??? We currently have no way of recording --- 4688,4725 ---- parsing the complete do-statement, set the condition now. Otherwise, we can get crashes at RTL-generation time. */ ! DO_COND (yyval.ttype) = error_mark_node; ;} ! break; ! ! case 473: #line 2107 "c-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ! RECHAIN_STMTS (yyval.ttype, DO_BODY (yyval.ttype)); ;} ! break; ! ! case 474: #line 2115 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.filename = input_filename; ;} ! break; ! ! case 475: #line 2121 "c-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.lineno = lineno; ;} ! break; ! ! case 478: #line 2134 "c-parse.y" ! { if (flag_isoc99) ! RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ;} ! break; ! ! case 479: #line 2140 "c-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; /* ??? We currently have no way of recording *************** case 478: *** 4153,4318 **** but I suspect that problems will occur when doing inlining at the tree level. */ } ! ; ! break;} ! case 479: #line 2154 "c-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; } ! ; ! break;} ! case 480: #line 2163 "c-parse.y" ! { c_expand_start_else (); ! yyvsp[-1].itype = stmt_count; ; ! break;} ! case 481: #line 2166 "c-parse.y" ! { c_finish_else (); c_expand_end_cond (); if (extra_warnings && stmt_count == yyvsp[-3].itype) ! warning ("empty body in an else-statement"); ; ! break;} ! case 482: #line 2171 "c-parse.y" ! { c_expand_end_cond (); /* This warning is here instead of in simple_if, because we do not want a warning if an empty if is followed by an else statement. Increment stmt_count so we don't give a second error if this is a nested `if'. */ if (extra_warnings && stmt_count++ == yyvsp[0].itype) warning_with_file_and_line (if_stmt_file, if_stmt_line, ! "empty body in an if-statement"); ; ! break;} ! case 483: #line 2183 "c-parse.y" ! { c_expand_end_cond (); ; ! break;} ! case 484: #line 2193 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_begin_while_stmt (); ; ! break;} ! case 485: #line 2196 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (yyvsp[-1].ttype); c_finish_while_stmt_cond (truthvalue_conversion (yyvsp[-1].ttype), yyvsp[-3].ttype); ! yyval.ttype = add_stmt (yyvsp[-3].ttype); ; ! break;} ! case 486: #line 2201 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, WHILE_BODY (yyvsp[-1].ttype)); ; ! break;} ! case 487: #line 2204 "c-parse.y" ! { DO_COND (yyvsp[-4].ttype) = truthvalue_conversion (yyvsp[-2].ttype); ; ! break;} ! case 488: #line 2206 "c-parse.y" ! { ; ! break;} ! case 489: #line 2208 "c-parse.y" ! { yyval.ttype = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE); ! add_stmt (yyval.ttype); ; ! break;} ! case 490: #line 2212 "c-parse.y" ! { stmt_count++; ! RECHAIN_STMTS (yyvsp[-2].ttype, FOR_INIT_STMT (yyvsp[-2].ttype)); ; ! break;} ! case 491: #line 2215 "c-parse.y" ! { if (yyvsp[-1].ttype) ! FOR_COND (yyvsp[-5].ttype) = truthvalue_conversion (yyvsp[-1].ttype); ; ! break;} ! case 492: #line 2218 "c-parse.y" ! { FOR_EXPR (yyvsp[-8].ttype) = yyvsp[-1].ttype; ; ! break;} ! case 493: #line 2220 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-10].ttype, FOR_BODY (yyvsp[-10].ttype)); ; ! break;} ! case 494: #line 2222 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_start_case (yyvsp[-1].ttype); ; ! break;} ! case 495: #line 2225 "c-parse.y" ! { c_finish_case (); ; ! break;} ! case 496: #line 2230 "c-parse.y" ! { add_stmt (build_stmt (EXPR_STMT, yyvsp[-1].ttype)); ; ! break;} ! case 497: #line 2232 "c-parse.y" ! { check_for_loop_decls (); ; ! break;} ! case 498: #line 2238 "c-parse.y" ! { stmt_count++; yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 499: #line 2240 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_expr_stmt (yyvsp[-1].ttype); ; ! break;} ! case 500: #line 2243 "c-parse.y" ! { if (flag_isoc99) RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 501: #line 2247 "c-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_break_stmt ()); ; ! break;} ! case 502: #line 2250 "c-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_continue_stmt ()); ; ! break;} ! case 503: #line 2253 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (NULL_TREE); ; ! break;} ! case 504: #line 2256 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (yyvsp[-1].ttype); ; ! break;} ! case 505: #line 2259 "c-parse.y" ! { stmt_count++; ! yyval.ttype = simple_asm_stmt (yyvsp[-2].ttype); ; ! break;} ! case 506: #line 2263 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ; ! break;} ! case 507: #line 2268 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 508: #line 2273 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ; ! break;} ! case 509: #line 2276 "c-parse.y" ! { tree decl; stmt_count++; decl = lookup_label (yyvsp[-1].ttype); if (decl != 0) --- 4728,4924 ---- but I suspect that problems will occur when doing inlining at the tree level. */ } ! ;} ! break; ! ! case 480: #line 2154 "c-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; } ! ;} ! break; ! ! case 481: #line 2163 "c-parse.y" ! { c_expand_start_else (); ! yyvsp[-1].itype = stmt_count; ;} ! break; ! ! case 482: #line 2166 "c-parse.y" ! { c_finish_else (); c_expand_end_cond (); if (extra_warnings && stmt_count == yyvsp[-3].itype) ! warning ("empty body in an else-statement"); ;} ! break; ! ! case 483: #line 2171 "c-parse.y" ! { c_expand_end_cond (); /* This warning is here instead of in simple_if, because we do not want a warning if an empty if is followed by an else statement. Increment stmt_count so we don't give a second error if this is a nested `if'. */ if (extra_warnings && stmt_count++ == yyvsp[0].itype) warning_with_file_and_line (if_stmt_file, if_stmt_line, ! "empty body in an if-statement"); ;} ! break; ! ! case 484: #line 2183 "c-parse.y" ! { c_expand_end_cond (); ;} ! break; ! ! case 485: #line 2193 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_begin_while_stmt (); ;} ! break; ! ! case 486: #line 2196 "c-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (yyvsp[-1].ttype); c_finish_while_stmt_cond (truthvalue_conversion (yyvsp[-1].ttype), yyvsp[-3].ttype); ! yyval.ttype = add_stmt (yyvsp[-3].ttype); ;} ! break; ! ! case 487: #line 2201 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, WHILE_BODY (yyvsp[-1].ttype)); ;} ! break; ! ! case 488: #line 2204 "c-parse.y" ! { DO_COND (yyvsp[-4].ttype) = truthvalue_conversion (yyvsp[-2].ttype); ;} ! break; ! ! case 489: #line 2206 "c-parse.y" ! { ;} ! break; ! ! case 490: #line 2208 "c-parse.y" ! { yyval.ttype = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE); ! add_stmt (yyval.ttype); ;} ! break; ! ! case 491: #line 2212 "c-parse.y" ! { stmt_count++; ! RECHAIN_STMTS (yyvsp[-2].ttype, FOR_INIT_STMT (yyvsp[-2].ttype)); ;} ! break; ! ! case 492: #line 2215 "c-parse.y" ! { if (yyvsp[-1].ttype) ! FOR_COND (yyvsp[-5].ttype) = truthvalue_conversion (yyvsp[-1].ttype); ;} ! break; ! ! case 493: #line 2218 "c-parse.y" ! { FOR_EXPR (yyvsp[-8].ttype) = yyvsp[-1].ttype; ;} ! break; ! ! case 494: #line 2220 "c-parse.y" ! { RECHAIN_STMTS (yyvsp[-10].ttype, FOR_BODY (yyvsp[-10].ttype)); ;} ! break; ! ! case 495: #line 2222 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_start_case (yyvsp[-1].ttype); ;} ! break; ! ! case 496: #line 2225 "c-parse.y" ! { c_finish_case (); ;} ! break; ! ! case 497: #line 2230 "c-parse.y" ! { add_stmt (build_stmt (EXPR_STMT, yyvsp[-1].ttype)); ;} ! break; ! ! case 498: #line 2232 "c-parse.y" ! { check_for_loop_decls (); ;} ! break; ! ! case 499: #line 2238 "c-parse.y" ! { stmt_count++; yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 500: #line 2240 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_expr_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 501: #line 2243 "c-parse.y" ! { if (flag_isoc99) RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 502: #line 2247 "c-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_break_stmt ()); ;} ! break; ! ! case 503: #line 2250 "c-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_continue_stmt ()); ;} ! break; ! ! case 504: #line 2253 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (NULL_TREE); ;} ! break; ! ! case 505: #line 2256 "c-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (yyvsp[-1].ttype); ;} ! break; ! ! case 506: #line 2259 "c-parse.y" ! { stmt_count++; ! yyval.ttype = simple_asm_stmt (yyvsp[-2].ttype); ;} ! break; ! ! case 507: #line 2263 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 508: #line 2268 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 509: #line 2273 "c-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 510: #line 2276 "c-parse.y" ! { tree decl; stmt_count++; decl = lookup_label (yyvsp[-1].ttype); if (decl != 0) *************** case 509: *** 4322,4359 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 510: #line 2288 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids `goto *expr;'"); stmt_count++; yyvsp[-1].ttype = convert (ptr_type_node, yyvsp[-1].ttype); ! yyval.ttype = add_stmt (build_stmt (GOTO_STMT, yyvsp[-1].ttype)); ; ! break;} ! case 511: #line 2294 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 512: #line 2302 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-1].ttype, NULL_TREE); ; ! break;} ! case 513: #line 2305 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 514: #line 2308 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (NULL_TREE, NULL_TREE); ; ! break;} ! case 515: #line 2311 "c-parse.y" ! { tree label = define_label (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-4].ttype); stmt_count++; if (label) { --- 4928,4971 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 511: #line 2288 "c-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids `goto *expr;'"); stmt_count++; yyvsp[-1].ttype = convert (ptr_type_node, yyvsp[-1].ttype); ! yyval.ttype = add_stmt (build_stmt (GOTO_STMT, yyvsp[-1].ttype)); ;} ! break; ! ! case 512: #line 2294 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 513: #line 2302 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-1].ttype, NULL_TREE); ;} ! break; ! ! case 514: #line 2305 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 515: #line 2308 "c-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (NULL_TREE, NULL_TREE); ;} ! break; ! ! case 516: #line 2311 "c-parse.y" ! { tree label = define_label (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-4].ttype); stmt_count++; if (label) { *************** case 515: *** 4362,4448 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 516: #line 2327 "c-parse.y" ! { emit_line_note (input_filename, lineno); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 517: #line 2330 "c-parse.y" ! { emit_line_note (input_filename, lineno); ; ! break;} ! case 518: #line 2335 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 520: #line 2342 "c-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 523: #line 2349 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 524: #line 2354 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 525: #line 2356 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 526: #line 2361 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE); ; ! break;} ! case 527: #line 2363 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ; ! break;} ! case 528: #line 2373 "c-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (0); ; ! break;} ! case 529: #line 2377 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ; ! break;} ! case 531: #line 2385 "c-parse.y" ! { tree parm; if (pedantic) pedwarn ("ISO C forbids forward parameter declarations"); /* Mark the forward decls as such. */ for (parm = getdecls (); parm; parm = TREE_CHAIN (parm)) TREE_ASM_WRITTEN (parm) = 1; ! clear_parm_order (); ; ! break;} ! case 532: #line 2393 "c-parse.y" ! { /* Dummy action so attributes are in known place ! on parser stack. */ ; ! break;} ! case 533: #line 2396 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 534: #line 2398 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ; ! break;} ! case 535: #line 2404 "c-parse.y" ! { yyval.ttype = get_parm_info (0); ; ! break;} ! case 536: #line 2406 "c-parse.y" ! { yyval.ttype = get_parm_info (0); /* Gcc used to allow this as an extension. However, it does not work for all targets, and thus has been disabled. Also, since func (...) and func () are indistinguishable, --- 4974,5077 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 517: #line 2327 "c-parse.y" ! { emit_line_note (input_filename, lineno); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 518: #line 2330 "c-parse.y" ! { emit_line_note (input_filename, lineno); ;} ! break; ! ! case 519: #line 2335 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 521: #line 2342 "c-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 524: #line 2349 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 525: #line 2354 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 526: #line 2356 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 527: #line 2361 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE); ;} ! break; ! ! case 528: #line 2363 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ;} ! break; ! ! case 529: #line 2373 "c-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (0); ;} ! break; ! ! case 530: #line 2377 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ;} ! break; ! ! case 532: #line 2385 "c-parse.y" ! { tree parm; if (pedantic) pedwarn ("ISO C forbids forward parameter declarations"); /* Mark the forward decls as such. */ for (parm = getdecls (); parm; parm = TREE_CHAIN (parm)) TREE_ASM_WRITTEN (parm) = 1; ! clear_parm_order (); ;} ! break; ! ! case 533: #line 2393 "c-parse.y" ! { /* Dummy action so attributes are in known place ! on parser stack. */ ;} ! break; ! ! case 534: #line 2396 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 535: #line 2398 "c-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 536: #line 2404 "c-parse.y" ! { yyval.ttype = get_parm_info (0); ;} ! break; ! ! case 537: #line 2406 "c-parse.y" ! { yyval.ttype = get_parm_info (0); /* Gcc used to allow this as an extension. However, it does not work for all targets, and thus has been disabled. Also, since func (...) and func () are indistinguishable, *************** case 536: *** 4450,4555 **** tries to verify that BUILT_IN_NEXT_ARG is being used correctly. */ error ("ISO C requires a named argument before `...'"); ! ; ! break;} ! case 537: #line 2416 "c-parse.y" ! { yyval.ttype = get_parm_info (1); ; ! break;} ! case 538: #line 2418 "c-parse.y" ! { yyval.ttype = get_parm_info (0); ; ! break;} ! case 539: #line 2423 "c-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 540: #line 2425 "c-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 541: #line 2432 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 542: #line 2437 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 543: #line 2442 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 544: #line 2445 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 545: #line 2451 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 546: #line 2459 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 547: #line 2464 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 548: #line 2469 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 549: #line 2472 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 550: #line 2478 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 551: #line 2484 "c-parse.y" ! { prefix_attributes = chainon (prefix_attributes, yyvsp[-3].ttype); ! all_prefix_attributes = prefix_attributes; ; ! break;} ! case 552: #line 2493 "c-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (1); ; ! break;} ! case 553: #line 2497 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ; ! break;} ! case 555: #line 2505 "c-parse.y" ! { tree t; for (t = yyvsp[-1].ttype; t; t = TREE_CHAIN (t)) if (TREE_VALUE (t) == NULL_TREE) error ("`...' in old-style identifier list"); --- 5079,5202 ---- tries to verify that BUILT_IN_NEXT_ARG is being used correctly. */ error ("ISO C requires a named argument before `...'"); ! ;} ! break; ! ! case 538: #line 2416 "c-parse.y" ! { yyval.ttype = get_parm_info (1); ;} ! break; ! ! case 539: #line 2418 "c-parse.y" ! { yyval.ttype = get_parm_info (0); ;} ! break; ! ! case 540: #line 2423 "c-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 541: #line 2425 "c-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 542: #line 2432 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 543: #line 2437 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 544: #line 2442 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 545: #line 2445 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 546: #line 2451 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 547: #line 2459 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 548: #line 2464 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 549: #line 2469 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 550: #line 2472 "c-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 551: #line 2478 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 552: #line 2484 "c-parse.y" ! { prefix_attributes = chainon (prefix_attributes, yyvsp[-3].ttype); ! all_prefix_attributes = prefix_attributes; ;} ! break; ! ! case 553: #line 2493 "c-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (1); ;} ! break; ! ! case 554: #line 2497 "c-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ;} ! break; ! ! case 556: #line 2505 "c-parse.y" ! { tree t; for (t = yyvsp[-1].ttype; t; t = TREE_CHAIN (t)) if (TREE_VALUE (t) == NULL_TREE) error ("`...' in old-style identifier list"); *************** case 555: *** 4561,4617 **** || TREE_PURPOSE (yyval.ttype) == 0 || TREE_CODE (TREE_PURPOSE (yyval.ttype)) != PARM_DECL)) YYERROR1; ! ; ! break;} ! case 556: #line 2523 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 557: #line 2525 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 558: #line 2531 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 559: #line 2533 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 560: #line 2538 "c-parse.y" ! { yyval.ttype = SAVE_WARN_FLAGS(); pedantic = 0; warn_pointer_arith = 0; ! warn_traditional = 0; ; ! break;} ! } - #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 5208,5258 ---- || TREE_PURPOSE (yyval.ttype) == 0 || TREE_CODE (TREE_PURPOSE (yyval.ttype)) != PARM_DECL)) YYERROR1; ! ;} ! break; ! ! case 557: #line 2523 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 558: #line 2525 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 559: #line 2531 "c-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 560: #line 2533 "c-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 561: #line 2538 "c-parse.y" ! { yyval.ttype = SAVE_WARN_FLAGS(); pedantic = 0; warn_pointer_arith = 0; ! warn_traditional = 0; ;} ! break; + } + + /* Line 991 of yacc.c. */ + #line 5246 "c-p10602.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 560: *** 4619,4629 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 5260,5270 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 4636,4648 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 5277,5289 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 4651,4665 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 5292,5306 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 4667,4673 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 5308,5314 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 4679,4780 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 5320,5411 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 4782,4790 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 5413,5419 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 4804,4816 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 5433,5447 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 4819,4824 **** --- 5450,5457 ---- #endif return yyresult; } + + #line 2544 "c-parse.y" *************** make_pointer_declarator (type_quals_attr *** 5369,5371 **** --- 6002,6006 ---- itarget = tree_cons (attrs, target, NULL_TREE); return build1 (INDIRECT_REF, quals, itarget); } + + diff -Nrc3pad gcc-3.2.2/gcc/c-typeck.c gcc-3.2.3/gcc/c-typeck.c *** gcc-3.2.2/gcc/c-typeck.c Thu Jan 9 13:18:41 2003 --- gcc-3.2.3/gcc/c-typeck.c Wed Mar 5 09:00:37 2003 *************** push_init_level (implicit) *** 5292,5297 **** --- 5292,5298 ---- && constructor_fields == 0) process_init_element (pop_init_level (1)); else if (TREE_CODE (constructor_type) == ARRAY_TYPE + && constructor_max_index && tree_int_cst_lt (constructor_max_index, constructor_index)) process_init_element (pop_init_level (1)); else diff -Nrc3pad gcc-3.2.2/gcc/cfgcleanup.c gcc-3.2.3/gcc/cfgcleanup.c *** gcc-3.2.2/gcc/cfgcleanup.c Mon Feb 3 18:01:32 2003 --- gcc-3.2.3/gcc/cfgcleanup.c Sun Mar 23 20:41:22 2003 *************** outgoing_edges_match (mode, bb1, bb2) *** 1078,1086 **** /* If BB1 has only one successor, we may be looking at either an unconditional jump, or a fake edge to exit. */ if (bb1->succ && !bb1->succ->succ_next ! && !(bb1->succ->flags & (EDGE_COMPLEX | EDGE_FAKE))) return (bb2->succ && !bb2->succ->succ_next ! && (bb2->succ->flags & (EDGE_COMPLEX | EDGE_FAKE)) == 0); /* Match conditional jumps - this may get tricky when fallthru and branch edges are crossed. */ --- 1078,1088 ---- /* If BB1 has only one successor, we may be looking at either an unconditional jump, or a fake edge to exit. */ if (bb1->succ && !bb1->succ->succ_next ! && (bb1->succ->flags & (EDGE_COMPLEX | EDGE_FAKE)) == 0 ! && (GET_CODE (bb1->end) != JUMP_INSN || simplejump_p (bb1->end))) return (bb2->succ && !bb2->succ->succ_next ! && (bb2->succ->flags & (EDGE_COMPLEX | EDGE_FAKE)) == 0 ! && (GET_CODE (bb2->end) != JUMP_INSN || simplejump_p (bb2->end))); /* Match conditional jumps - this may get tricky when fallthru and branch edges are crossed. */ *************** try_optimize_cfg (mode) *** 1638,1645 **** /* If the jump insn has side effects, we can't kill the edge. */ && (GET_CODE (b->end) != JUMP_INSN ! || (onlyjump_p (b->end) ! && !tablejump_p (b->end))) && merge_blocks (s, b, c, mode)) changed_here = true; --- 1640,1648 ---- /* If the jump insn has side effects, we can't kill the edge. */ && (GET_CODE (b->end) != JUMP_INSN ! || (flow2_completed ! ? simplejump_p (b->end) ! : onlyjump_p (b->end))) && merge_blocks (s, b, c, mode)) changed_here = true; diff -Nrc3pad gcc-3.2.2/gcc/cfgrtl.c gcc-3.2.3/gcc/cfgrtl.c *** gcc-3.2.2/gcc/cfgrtl.c Mon Nov 11 03:35:59 2002 --- gcc-3.2.3/gcc/cfgrtl.c Thu Mar 27 22:25:48 2003 *************** try_redirect_by_replacing_jump (e, targe *** 665,671 **** edge tmp; rtx set; int fallthru = 0; - rtx table; /* Verify that all targets will be TARGET. */ for (tmp = src->succ; tmp; tmp = tmp->succ_next) --- 665,670 ---- *************** try_redirect_by_replacing_jump (e, targe *** 675,685 **** if (tmp || !onlyjump_p (insn)) return false; ! if (reload_completed && JUMP_LABEL (insn) ! && (table = NEXT_INSN (JUMP_LABEL (insn))) != NULL_RTX ! && GET_CODE (table) == JUMP_INSN ! && (GET_CODE (PATTERN (table)) == ADDR_VEC ! || GET_CODE (PATTERN (table)) == ADDR_DIFF_VEC)) return false; /* Avoid removing branch with side effects. */ --- 674,680 ---- if (tmp || !onlyjump_p (insn)) return false; ! if ((!optimize || flow2_completed) && tablejump_p (insn)) return false; /* Avoid removing branch with side effects. */ diff -Nrc3pad gcc-3.2.2/gcc/collect2.c gcc-3.2.3/gcc/collect2.c *** gcc-3.2.2/gcc/collect2.c Fri Aug 16 18:03:06 2002 --- gcc-3.2.3/gcc/collect2.c Mon Mar 31 01:14:02 2003 *************** collect_wait (prog) *** 1522,1528 **** int sig = WTERMSIG (status); error ("%s terminated with signal %d [%s]%s", prog, sig, strsignal(sig), ! status & 0200 ? "" : ", core dumped"); collect_exit (FATAL_EXIT_CODE); } --- 1522,1528 ---- int sig = WTERMSIG (status); error ("%s terminated with signal %d [%s]%s", prog, sig, strsignal(sig), ! WCOREDUMP(status) ? ", core dumped" : ""); collect_exit (FATAL_EXIT_CODE); } diff -Nrc3pad gcc-3.2.2/gcc/combine.c gcc-3.2.3/gcc/combine.c *** gcc-3.2.2/gcc/combine.c Mon Jan 27 17:25:14 2003 --- gcc-3.2.3/gcc/combine.c Wed Mar 19 01:36:16 2003 *************** *** 1,6 **** /* Optimize by combining instructions for GNU compiler. Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. --- 1,6 ---- /* Optimize by combining instructions for GNU compiler. Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. This file is part of GCC. *************** force_to_mode (x, mode, mask, reg, just_ *** 7125,7131 **** < GET_MODE_BITSIZE (GET_MODE (x))) && INTVAL (XEXP (XEXP (x, 0), 1)) < HOST_BITS_PER_WIDE_INT) { ! temp = GEN_INT (mask << INTVAL (XEXP (XEXP (x, 0), 1))); temp = gen_binary (XOR, GET_MODE (x), XEXP (XEXP (x, 0), 0), temp); x = gen_binary (LSHIFTRT, GET_MODE (x), temp, XEXP (XEXP (x, 0), 1)); --- 7125,7132 ---- < GET_MODE_BITSIZE (GET_MODE (x))) && INTVAL (XEXP (XEXP (x, 0), 1)) < HOST_BITS_PER_WIDE_INT) { ! temp = gen_int_mode (mask << INTVAL (XEXP (XEXP (x, 0), 1)), ! GET_MODE (x)); temp = gen_binary (XOR, GET_MODE (x), XEXP (XEXP (x, 0), 0), temp); x = gen_binary (LSHIFTRT, GET_MODE (x), temp, XEXP (XEXP (x, 0), 1)); diff -Nrc3pad gcc-3.2.2/gcc/config/alpha/alpha.md gcc-3.2.3/gcc/config/alpha/alpha.md *** gcc-3.2.2/gcc/config/alpha/alpha.md Sun Sep 8 05:30:19 2002 --- gcc-3.2.3/gcc/config/alpha/alpha.md Sat Feb 22 01:58:21 2003 *************** *** 1,6 **** ;; Machine description for DEC Alpha for GNU C compiler ;; Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! ;; 2000, 2001 Free Software Foundation, Inc. ;; Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) ;; ;; This file is part of GNU CC. --- 1,6 ---- ;; Machine description for DEC Alpha for GNU C compiler ;; Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! ;; 2000, 2001, 2003 Free Software Foundation, Inc. ;; Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) ;; ;; This file is part of GNU CC. *************** fadd,fmul,fcpys,fdiv,fsqrt,misc,mvi,ftoi *** 5523,5532 **** [(match_dup 0)] "operands[0] = split_small_symbolic_operand (operands[0]);") (define_insn "movdi_er_high_g" [(set (match_operand:DI 0 "register_operand" "=r") (unspec:DI [(match_operand:DI 1 "register_operand" "r") ! (match_operand:DI 2 "global_symbolic_operand" "") (match_operand 3 "const_int_operand" "")] UNSPEC_LITERAL))] "TARGET_EXPLICIT_RELOCS" --- 5523,5534 ---- [(match_dup 0)] "operands[0] = split_small_symbolic_operand (operands[0]);") + ;; Accepts any symbolic, not just global, since function calls that + ;; don't go via bsr still use !literal in hopes of linker relaxation. (define_insn "movdi_er_high_g" [(set (match_operand:DI 0 "register_operand" "=r") (unspec:DI [(match_operand:DI 1 "register_operand" "r") ! (match_operand:DI 2 "symbolic_operand" "") (match_operand 3 "const_int_operand" "")] UNSPEC_LITERAL))] "TARGET_EXPLICIT_RELOCS" diff -Nrc3pad gcc-3.2.2/gcc/config/alpha/osf.h gcc-3.2.3/gcc/config/alpha/osf.h *** gcc-3.2.2/gcc/config/alpha/osf.h Fri Apr 12 22:16:56 2002 --- gcc-3.2.3/gcc/config/alpha/osf.h Mon Mar 17 14:52:14 2003 *************** *** 1,5 **** /* Definitions of target machine for GNU compiler, for DEC Alpha on OSF/1. ! Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2001 Free Software Foundation, Inc. Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) --- 1,5 ---- /* Definitions of target machine for GNU compiler, for DEC Alpha on OSF/1. ! Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2001, 2002, 2003 Free Software Foundation, Inc. Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) *************** Boston, MA 02111-1307, USA. */ *** 33,39 **** /* Names to predefine in the preprocessor for this target machine. */ #define CPP_PREDEFINES "\ ! -Dunix -D__osf__ -D_LONGLONG -DSYSTYPE_BSD \ -D_SYSTYPE_BSD -Asystem=unix -Asystem=xpg4" /* Tru64 UNIX V5 requires additional definitions for 16 byte long double --- 33,39 ---- /* Names to predefine in the preprocessor for this target machine. */ #define CPP_PREDEFINES "\ ! -Dunix -D__osf__ -D__digital__ -D__arch64__ -D_LONGLONG -DSYSTYPE_BSD \ -D_SYSTYPE_BSD -Asystem=unix -Asystem=xpg4" /* Tru64 UNIX V5 requires additional definitions for 16 byte long double *************** Boston, MA 02111-1307, USA. */ *** 48,54 **** #undef CPP_SUBTARGET_SPEC #define CPP_SUBTARGET_SPEC \ "%{pthread|threads:-D_REENTRANT} %{threads:-D_PTHREAD_USE_D4} %(cpp_xfloat) \ ! -D__EXTERN_PREFIX" /* Under OSF4, -p and -pg require -lprof1, and -lprof1 requires -lpdf. */ --- 48,54 ---- #undef CPP_SUBTARGET_SPEC #define CPP_SUBTARGET_SPEC \ "%{pthread|threads:-D_REENTRANT} %{threads:-D_PTHREAD_USE_D4} %(cpp_xfloat) \ ! -D__PRAGMA_EXTERN_PREFIX" /* Under OSF4, -p and -pg require -lprof1, and -lprof1 requires -lpdf. */ diff -Nrc3pad gcc-3.2.2/gcc/config/cris/cris.md gcc-3.2.3/gcc/config/cris/cris.md *** gcc-3.2.2/gcc/config/cris/cris.md Mon Jun 17 22:06:34 2002 --- gcc-3.2.3/gcc/config/cris/cris.md Mon Apr 14 21:16:12 2003 *************** *** 1,5 **** ;; GCC machine description for CRIS cpu cores. ! ;; Copyright (C) 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc. ;; Contributed by Axis Communications. ;; This file is part of GCC. --- 1,5 ---- ;; GCC machine description for CRIS cpu cores. ! ;; Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. ;; Contributed by Axis Communications. ;; This file is part of GCC. *************** *** 496,502 **** [(set (match_operand:QI 0 "register_operand" "=r,r,r") (mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 496,502 ---- [(set (match_operand:QI 0 "register_operand" "=r,r,r") (mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 519,525 **** [(set (match_operand:HI 0 "register_operand" "=r,r,r") (mem:HI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 519,525 ---- [(set (match_operand:HI 0 "register_operand" "=r,r,r") (mem:HI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 542,548 **** [(set (match_operand:SI 0 "register_operand" "=r,r,r") (mem:SI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 542,548 ---- [(set (match_operand:SI 0 "register_operand" "=r,r,r") (mem:SI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 671,677 **** (define_insn "*mov_sideqi_mem" [(set (mem:QI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r>Ri,r,>Ri"))) (match_operand:QI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) --- 671,677 ---- (define_insn "*mov_sideqi_mem" [(set (mem:QI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r>Rn,r,>Rn"))) (match_operand:QI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) *************** *** 696,702 **** (define_insn "*mov_sidehi_mem" [(set (mem:HI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r>Ri,r,>Ri"))) (match_operand:HI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) --- 696,702 ---- (define_insn "*mov_sidehi_mem" [(set (mem:HI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r>Rn,r,>Rn"))) (match_operand:HI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) *************** *** 721,727 **** (define_insn "*mov_sidesi_mem" [(set (mem:SI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r>Ri,r,>Ri"))) (match_operand:SI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) --- 721,727 ---- (define_insn "*mov_sidesi_mem" [(set (mem:SI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r>Rn,r,>Rn"))) (match_operand:SI 2 "register_operand" "r,r,r,r")) (set (match_operand:SI 3 "register_operand" "=*0,!*2,r,r") (plus:SI (match_dup 0) *************** *** 786,792 **** (define_insn "*clear_sidesi" [(set (mem:SI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r,>Ri"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) --- 786,792 ---- (define_insn "*clear_sidesi" [(set (mem:SI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r,>Rn"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) *************** *** 826,832 **** (define_insn "*clear_sidehi" [(set (mem:HI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r,>Ri"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) --- 826,832 ---- (define_insn "*clear_sidehi" [(set (mem:HI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r,>Rn"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) *************** *** 866,872 **** (define_insn "*clear_sideqi" [(set (mem:QI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Ri,r,>Ri"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) --- 866,872 ---- (define_insn "*clear_sideqi" [(set (mem:QI (plus:SI (match_operand:SI 0 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 1 "cris_bdap_operand" "r>Rn,r,>Rn"))) (const_int 0)) (set (match_operand:SI 2 "register_operand" "=*0,r,r") (plus:SI (match_dup 0) *************** *** 1127,1133 **** 4 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 1127,1133 ---- 4 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 1152,1158 **** 4 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 1152,1158 ---- 4 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 1177,1183 **** 4 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] --- 1177,1183 ---- 4 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 1 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 2 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 3 "register_operand" "=*1,r,r") (plus:SI (match_dup 1) (match_dup 2)))] *************** *** 1473,1479 **** [(match_operand:QI 1 "register_operand" "0,0,0") (mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] --- 1473,1479 ---- [(match_operand:QI 1 "register_operand" "0,0,0") (mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] *************** *** 1499,1505 **** [(match_operand:HI 1 "register_operand" "0,0,0") (mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] --- 1499,1505 ---- [(match_operand:HI 1 "register_operand" "0,0,0") (mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] *************** *** 1525,1531 **** [(match_operand:SI 1 "register_operand" "0,0,0") (mem:SI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] --- 1525,1531 ---- [(match_operand:SI 1 "register_operand" "0,0,0") (mem:SI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) (match_dup 3)))] *************** *** 1624,1630 **** 5 "cris_commutative_orth_op" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri"))) (match_operand:QI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 1624,1630 ---- 5 "cris_commutative_orth_op" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn"))) (match_operand:QI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 1650,1656 **** 5 "cris_commutative_orth_op" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri"))) (match_operand:HI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 1650,1656 ---- 5 "cris_commutative_orth_op" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn"))) (match_operand:HI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 1676,1682 **** 5 "cris_commutative_orth_op" [(mem:SI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri"))) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 1676,1682 ---- 5 "cris_commutative_orth_op" [(mem:SI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn"))) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 1965,1971 **** 6 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 1965,1971 ---- 6 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 1995,2001 **** 6 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 1995,2001 ---- 6 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 2026,2032 **** 6 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 2026,2032 ---- 6 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn") ))])])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 2135,2141 **** 5 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))]) (match_operand:HI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 2135,2141 ---- 5 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))]) (match_operand:HI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 2164,2170 **** 5 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))]) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 2164,2170 ---- 5 "cris_extend_operator" [(mem:QI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))]) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 2193,2199 **** 5 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Ri,r,>Ri")))]) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) --- 2193,2199 ---- 5 "cris_extend_operator" [(mem:HI (plus:SI (match_operand:SI 2 "cris_bdap_operand" "%r,r,r") ! (match_operand:SI 3 "cris_bdap_operand" "r>Rn,r,>Rn")))]) (match_operand:SI 1 "register_operand" "0,0,0")])) (set (match_operand:SI 4 "register_operand" "=*2,r,r") (plus:SI (match_dup 2) *************** *** 4854,4863 **** (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Ri,r,>Ri")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Ri,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Ri,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (mem (match_dup 0)))] "(rtx_equal_p (operands[2], operands[0]) --- 4854,4863 ---- (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Rn,r,>Rn")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Rn,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Rn,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (mem (match_dup 0)))] "(rtx_equal_p (operands[2], operands[0]) *************** *** 4882,4891 **** (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Ri,r,>Ri")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Ri,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Ri,r,0,0"))) (set (mem (match_dup 0)) (match_operand 4 "register_operand" "=r,r,r,r"))] "(rtx_equal_p (operands[2], operands[0]) --- 4882,4891 ---- (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Rn,r,>Rn")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Rn,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Rn,r,0,0"))) (set (mem (match_dup 0)) (match_operand 4 "register_operand" "=r,r,r,r"))] "(rtx_equal_p (operands[2], operands[0]) *************** *** 4912,4921 **** (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Ri,r,>Ri")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Ri,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Ri,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (match_operator 5 "cris_orthogonal_operator" [(match_dup 3) --- 4912,4921 ---- (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Rn,r,>Rn")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Rn,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Rn,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (match_operator 5 "cris_orthogonal_operator" [(match_dup 3) *************** *** 4942,4951 **** (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Ri,r,>Ri")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Ri,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Ri,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (match_operator 5 "cris_commutative_orth_op" [(mem (match_dup 0)) --- 4942,4951 ---- (define_peephole [(set (match_operand:SI 0 "register_operand" "=r,r,r,r") ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,>Rn,r,>Rn")) (set (match_dup 0) ! (plus:SI (match_operand:SI 2 "cris_bdap_biap_operand" "0,0,r>Rn,r") ! (match_operand:SI 3 "cris_bdap_biap_operand" "r>Rn,r,0,0"))) (set (match_operand 4 "register_operand" "=r,r,r,r") (match_operator 5 "cris_commutative_orth_op" [(mem (match_dup 0)) *************** *** 5014,5021 **** (define_peephole [(set (match_operand 0 "register_operand" "=r,r,r,r") (mem (plus:SI ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,r>Ri,r,r>Ri") ! (match_operand:SI 2 "cris_bdap_biap_operand" "r>Ri,r,r>Ri,r")))) (set (match_dup 0) (match_operator 5 "cris_commutative_orth_op" [(match_operand 3 "register_operand" "0,0,r,r") --- 5014,5021 ---- (define_peephole [(set (match_operand 0 "register_operand" "=r,r,r,r") (mem (plus:SI ! (match_operand:SI 1 "cris_bdap_biap_operand" "r,r>Rn,r,r>Rn") ! (match_operand:SI 2 "cris_bdap_biap_operand" "r>Rn,r,r>Rn,r")))) (set (match_dup 0) (match_operator 5 "cris_commutative_orth_op" [(match_operand 3 "register_operand" "0,0,r,r") diff -Nrc3pad gcc-3.2.2/gcc/config/i386/i386.c gcc-3.2.3/gcc/config/i386/i386.c *** gcc-3.2.2/gcc/config/i386/i386.c Fri Jan 31 22:06:28 2003 --- gcc-3.2.3/gcc/config/i386/i386.c Wed Mar 12 09:04:01 2003 *************** static enum x86_64_reg_class merge_class *** 822,827 **** --- 822,833 ---- struct gcc_target targetm = TARGET_INITIALIZER; + /* The svr4 ABI for the i386 says that records and unions are returned + in memory. */ + #ifndef DEFAULT_PCC_STRUCT_RETURN + #define DEFAULT_PCC_STRUCT_RETURN 1 + #endif + /* Sometimes certain combinations of command options do not make sense on a particular target machine. You can define a macro `OVERRIDE_OPTIONS' to take account of this. This macro, if *************** function_arg (cum, mode, type, named) *** 2232,2237 **** --- 2238,2246 ---- break; case BLKmode: + if (bytes < 0) + break; + /* FALLTHRU */ case DImode: case SImode: case HImode: *************** memory_address_length (addr) *** 9930,9936 **** if (disp) { if (GET_CODE (disp) == CONST_INT ! && CONST_OK_FOR_LETTER_P (INTVAL (disp), 'K')) len = 1; else len = 4; --- 9939,9946 ---- if (disp) { if (GET_CODE (disp) == CONST_INT ! && CONST_OK_FOR_LETTER_P (INTVAL (disp), 'K') ! && base) len = 1; else len = 4; *************** ix86_attr_length_address_default (insn) *** 9993,9998 **** --- 10003,10028 ---- rtx insn; { int i; + + if (get_attr_type (insn) == TYPE_LEA) + { + rtx set = PATTERN (insn); + if (GET_CODE (set) == SET) + ; + else if (GET_CODE (set) == PARALLEL + && GET_CODE (XVECEXP (set, 0, 0)) == SET) + set = XVECEXP (set, 0, 0); + else + { + #ifdef ENABLE_CHECKING + abort (); + #endif + return 0; + } + + return memory_address_length (SET_SRC (set)); + } + extract_insn_cached (insn); for (i = recog_data.n_operands - 1; i >= 0; --i) if (GET_CODE (recog_data.operand[i]) == MEM) diff -Nrc3pad gcc-3.2.2/gcc/config/i386/i386.h gcc-3.2.3/gcc/config/i386/i386.h *** gcc-3.2.2/gcc/config/i386/i386.h Tue Dec 10 00:40:11 2002 --- gcc-3.2.3/gcc/config/i386/i386.h Thu Feb 20 20:04:02 2003 *************** extern int ix86_arch; *** 587,593 **** %{march=pentiumpro|march=i686|march=pentium2|march=pentium3:-D__i686 -D__i686__ \ -D__pentiumpro -D__pentiumpro__ \ %{!mcpu*:-D__tune_i686__ -D__tune_pentiumpro__ }}\ ! %{march=march=pentium2|march=pentium3: -D__pentium2 -D__pentium2__\ %{!mcpu*:-D__tune_pentium2__ }}\ %{march=pentium3: -D__pentium3 -D__pentium3__\ %{!mcpu*:-D__tune_pentium3__ }}\ --- 587,593 ---- %{march=pentiumpro|march=i686|march=pentium2|march=pentium3:-D__i686 -D__i686__ \ -D__pentiumpro -D__pentiumpro__ \ %{!mcpu*:-D__tune_i686__ -D__tune_pentiumpro__ }}\ ! %{march=pentium2|march=pentium3: -D__pentium2 -D__pentium2__\ %{!mcpu*:-D__tune_pentium2__ }}\ %{march=pentium3: -D__pentium3 -D__pentium3__\ %{!mcpu*:-D__tune_pentium3__ }}\ *************** typedef struct ix86_args { *** 1723,1737 **** /* If PIC, we cannot make sibling calls to global functions because the PLT requires %ebx live. ! If we are returning floats on the register stack, we cannot make ! sibling calls to functions that return floats. (The stack adjust ! instruction will wind up after the sibcall jump, and not be executed.) */ #define FUNCTION_OK_FOR_SIBCALL(DECL) \ ((DECL) \ && (! flag_pic || ! TREE_PUBLIC (DECL)) \ && (! TARGET_FLOAT_RETURNS_IN_80387 \ ! || ! FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (TREE_TYPE (DECL)))) \ ! || FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (TREE_TYPE (cfun->decl)))))) /* Perform any needed actions needed for a function that is receiving a variable number of arguments. --- 1723,1739 ---- /* If PIC, we cannot make sibling calls to global functions because the PLT requires %ebx live. ! If we are returning floats on the 80387 register stack, we cannot ! make a sibcall from a function that doesn't return a float to a ! function that does or, conversely, from a function that does return ! a float to a function that doesn't; the necessary stack adjustment ! would not be executed. */ #define FUNCTION_OK_FOR_SIBCALL(DECL) \ ((DECL) \ && (! flag_pic || ! TREE_PUBLIC (DECL)) \ && (! TARGET_FLOAT_RETURNS_IN_80387 \ ! || (FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (TREE_TYPE (DECL)))) \ ! == FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (TREE_TYPE (cfun->decl))))))) /* Perform any needed actions needed for a function that is receiving a variable number of arguments. diff -Nrc3pad gcc-3.2.2/gcc/config/i386/i386.md gcc-3.2.3/gcc/config/i386/i386.md *** gcc-3.2.2/gcc/config/i386/i386.md Thu Oct 24 17:11:54 2002 --- gcc-3.2.3/gcc/config/i386/i386.md Tue Mar 25 10:42:12 2003 *************** *** 131,137 **** ;; The (bounding maximum) length of an instruction immediate. (define_attr "length_immediate" "" ! (cond [(eq_attr "type" "incdec,setcc,icmov,ibr,str,cld,lea,other,multi,idiv,sse,mmx") (const_int 0) (eq_attr "i387" "1") (const_int 0) --- 131,137 ---- ;; The (bounding maximum) length of an instruction immediate. (define_attr "length_immediate" "" ! (cond [(eq_attr "type" "incdec,setcc,icmov,str,cld,lea,other,multi,idiv,sse,mmx") (const_int 0) (eq_attr "i387" "1") (const_int 0) *************** *** 147,159 **** (if_then_else (match_operand 1 "constant_call_address_operand" "") (const_int 4) (const_int 0)) (eq_attr "type" "ibr") ! (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -128)) ! (lt (minus (match_dup 0) (pc)) ! (const_int 124))) ! (const_int 1) ! (const_int 4)) ] (symbol_ref "/* Update immediate_length and other attributes! */ abort(),1"))) --- 147,156 ---- (if_then_else (match_operand 1 "constant_call_address_operand" "") (const_int 4) (const_int 0)) + ;; We don't know the size before shorten_branches. Expect + ;; the instruction to fit for better scheduling. (eq_attr "type" "ibr") ! (const_int 1) ] (symbol_ref "/* Update immediate_length and other attributes! */ abort(),1"))) *************** *** 162,168 **** (cond [(eq_attr "type" "str,cld,other,multi,fxch") (const_int 0) (and (eq_attr "type" "call") ! (match_operand 1 "constant_call_address_operand" "")) (const_int 0) (and (eq_attr "type" "callv") (match_operand 1 "constant_call_address_operand" "")) --- 159,165 ---- (cond [(eq_attr "type" "str,cld,other,multi,fxch") (const_int 0) (and (eq_attr "type" "call") ! (match_operand 0 "constant_call_address_operand" "")) (const_int 0) (and (eq_attr "type" "callv") (match_operand 1 "constant_call_address_operand" "")) *************** *** 205,210 **** --- 202,213 ---- (and (match_operand 0 "register_operand" "") (match_operand 1 "immediate_operand" ""))) (const_int 0) + (and (eq_attr "type" "call") + (match_operand 0 "constant_call_address_operand" "")) + (const_int 0) + (and (eq_attr "type" "callv") + (match_operand 1 "constant_call_address_operand" "")) + (const_int 0) ] (const_int 1))) *************** *** 1733,1746 **** (set_attr "mode" "SI") (set_attr "length_immediate" "1")]) - ; The first alternative is used only to compute proper length of instruction. - ; Reload's algorithm does not take into account the cost of spill instructions - ; needed to free register in given class, so avoid it from choosing the first - ; alternative when eax is not available. - (define_insn "*movsi_1" ! [(set (match_operand:SI 0 "nonimmediate_operand" "=*?a,r,*?a,m,!*y,!rm,!*y,!*Y,!rm,!*Y") ! (match_operand:SI 1 "general_operand" "im,rinm,rinm,rin,rm,*y,*y,rm,*Y,*Y"))] "GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM" { switch (get_attr_type (insn)) --- 1736,1744 ---- (set_attr "mode" "SI") (set_attr "length_immediate" "1")]) (define_insn "*movsi_1" ! [(set (match_operand:SI 0 "nonimmediate_operand" "=r,m,!*y,!rm,!*y,!*Y,!rm,!*Y") ! (match_operand:SI 1 "general_operand" "rinm,rin,rm,*y,*y,rm,*Y,*Y"))] "GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM" { switch (get_attr_type (insn)) *************** *** 1765,1781 **** } } [(set (attr "type") ! (cond [(eq_attr "alternative" "4,5,6") (const_string "mmx") ! (eq_attr "alternative" "7,8,9") (const_string "sse") (and (ne (symbol_ref "flag_pic") (const_int 0)) (match_operand:SI 1 "symbolic_operand" "")) (const_string "lea") ] (const_string "imov"))) ! (set_attr "modrm" "0,*,0,*,*,*,*,*,*,*") ! (set_attr "mode" "SI,SI,SI,SI,SI,SI,DI,TI,SI,SI")]) ;; Stores and loads of ax to arbitary constant address. ;; We fake an second form of instruction to force reload to load address --- 1763,1778 ---- } } [(set (attr "type") ! (cond [(eq_attr "alternative" "2,3,4") (const_string "mmx") ! (eq_attr "alternative" "5,6,7") (const_string "sse") (and (ne (symbol_ref "flag_pic") (const_int 0)) (match_operand:SI 1 "symbolic_operand" "")) (const_string "lea") ] (const_string "imov"))) ! (set_attr "mode" "SI,SI,SI,SI,DI,TI,SI,SI")]) ;; Stores and loads of ax to arbitary constant address. ;; We fake an second form of instruction to force reload to load address *************** *** 1848,1861 **** [(set_attr "type" "push") (set_attr "mode" "QI")]) - ; The first alternative is used only to compute proper length of instruction. - ; Reload's algorithm does not take into account the cost of spill instructions - ; needed to free register in given class, so avoid it from choosing the first - ; alternative when eax is not available. - (define_insn "*movhi_1" ! [(set (match_operand:HI 0 "nonimmediate_operand" "=*?a,r,r,*?a,r,m") ! (match_operand:HI 1 "general_operand" "i,r,rn,rm,rm,rn"))] "GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM" { switch (get_attr_type (insn)) --- 1845,1853 ---- [(set_attr "type" "push") (set_attr "mode" "QI")]) (define_insn "*movhi_1" ! [(set (match_operand:HI 0 "nonimmediate_operand" "=r,r,r,m") ! (match_operand:HI 1 "general_operand" "r,rn,rm,rn"))] "GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM" { switch (get_attr_type (insn)) *************** *** 1872,1907 **** } } [(set (attr "type") ! (cond [(and (eq_attr "alternative" "0,1") (ior (eq (symbol_ref "TARGET_PARTIAL_REG_STALL") (const_int 0)) (eq (symbol_ref "TARGET_HIMODE_MATH") (const_int 0)))) (const_string "imov") ! (and (eq_attr "alternative" "2,3,4") (match_operand:HI 1 "aligned_operand" "")) (const_string "imov") (and (ne (symbol_ref "TARGET_MOVX") (const_int 0)) ! (eq_attr "alternative" "0,1,3,4")) (const_string "imovx") ] (const_string "imov"))) (set (attr "mode") (cond [(eq_attr "type" "imovx") (const_string "SI") ! (and (eq_attr "alternative" "2,3,4") (match_operand:HI 1 "aligned_operand" "")) (const_string "SI") ! (and (eq_attr "alternative" "0,1") (ior (eq (symbol_ref "TARGET_PARTIAL_REG_STALL") (const_int 0)) (eq (symbol_ref "TARGET_HIMODE_MATH") (const_int 0)))) (const_string "SI") ] ! (const_string "HI"))) ! (set_attr "modrm" "0,*,*,0,*,*")]) ;; Stores and loads of ax to arbitary constant address. ;; We fake an second form of instruction to force reload to load address --- 1864,1898 ---- } } [(set (attr "type") ! (cond [(and (eq_attr "alternative" "0") (ior (eq (symbol_ref "TARGET_PARTIAL_REG_STALL") (const_int 0)) (eq (symbol_ref "TARGET_HIMODE_MATH") (const_int 0)))) (const_string "imov") ! (and (eq_attr "alternative" "1,2") (match_operand:HI 1 "aligned_operand" "")) (const_string "imov") (and (ne (symbol_ref "TARGET_MOVX") (const_int 0)) ! (eq_attr "alternative" "0,2")) (const_string "imovx") ] (const_string "imov"))) (set (attr "mode") (cond [(eq_attr "type" "imovx") (const_string "SI") ! (and (eq_attr "alternative" "1,2") (match_operand:HI 1 "aligned_operand" "")) (const_string "SI") ! (and (eq_attr "alternative" "0") (ior (eq (symbol_ref "TARGET_PARTIAL_REG_STALL") (const_int 0)) (eq (symbol_ref "TARGET_HIMODE_MATH") (const_int 0)))) (const_string "SI") ] ! (const_string "HI")))]) ;; Stores and loads of ax to arbitary constant address. ;; We fake an second form of instruction to force reload to load address *************** *** 2122,2128 **** (define_expand "movstrictqi" [(set (strict_low_part (match_operand:QI 0 "nonimmediate_operand" "")) (match_operand:QI 1 "general_operand" ""))] ! "! TARGET_PARTIAL_REG_STALL" { /* Don't generate memory->memory moves, go through a register. */ if (GET_CODE (operands[0]) == MEM && GET_CODE (operands[1]) == MEM) --- 2113,2119 ---- (define_expand "movstrictqi" [(set (strict_low_part (match_operand:QI 0 "nonimmediate_operand" "")) (match_operand:QI 1 "general_operand" ""))] ! "! TARGET_PARTIAL_REG_STALL || optimize_size" { /* Don't generate memory->memory moves, go through a register. */ if (GET_CODE (operands[0]) == MEM && GET_CODE (operands[1]) == MEM) *************** *** 2132,2138 **** (define_insn "*movstrictqi_1" [(set (strict_low_part (match_operand:QI 0 "nonimmediate_operand" "+qm,q")) (match_operand:QI 1 "general_operand" "*qn,m"))] ! "! TARGET_PARTIAL_REG_STALL && (GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM)" "mov{b}\t{%1, %0|%0, %1}" [(set_attr "type" "imov") --- 2123,2129 ---- (define_insn "*movstrictqi_1" [(set (strict_low_part (match_operand:QI 0 "nonimmediate_operand" "+qm,q")) (match_operand:QI 1 "general_operand" "*qn,m"))] ! "(! TARGET_PARTIAL_REG_STALL || optimize_size) && (GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM)" "mov{b}\t{%1, %0|%0, %1}" [(set_attr "type" "imov") *************** *** 12961,12973 **** "" "%+j%C1\t%l0" [(set_attr "type" "ibr") ! (set (attr "prefix_0f") (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -128)) (lt (minus (match_dup 0) (pc)) ! (const_int 124))) ! (const_int 0) ! (const_int 1)))]) (define_insn "*jcc_2" [(set (pc) --- 12952,12965 ---- "" "%+j%C1\t%l0" [(set_attr "type" "ibr") ! (set_attr "modrm" "0") ! (set (attr "length") (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -126)) (lt (minus (match_dup 0) (pc)) ! (const_int 128))) ! (const_int 2) ! (const_int 6)))]) (define_insn "*jcc_2" [(set (pc) *************** *** 12978,12990 **** "" "%+j%c1\t%l0" [(set_attr "type" "ibr") ! (set (attr "prefix_0f") (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -128)) (lt (minus (match_dup 0) (pc)) ! (const_int 124))) ! (const_int 0) ! (const_int 1)))]) ;; In general it is not safe to assume too much about CCmode registers, ;; so simplify-rtx stops when it sees a second one. Under certain --- 12970,12983 ---- "" "%+j%c1\t%l0" [(set_attr "type" "ibr") ! (set_attr "modrm" "0") ! (set (attr "length") (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -126)) (lt (minus (match_dup 0) (pc)) ! (const_int 128))) ! (const_int 2) ! (const_int 6)))]) ;; In general it is not safe to assume too much about CCmode registers, ;; so simplify-rtx stops when it sees a second one. Under certain *************** *** 13244,13250 **** (label_ref (match_operand 0 "" "")))] "" "jmp\t%l0" ! [(set_attr "type" "ibr")]) (define_expand "indirect_jump" [(set (pc) (match_operand 0 "nonimmediate_operand" "rm"))] --- 13237,13251 ---- (label_ref (match_operand 0 "" "")))] "" "jmp\t%l0" ! [(set_attr "type" "ibr") ! (set (attr "length") ! (if_then_else (and (ge (minus (match_dup 0) (pc)) ! (const_int -126)) ! (lt (minus (match_dup 0) (pc)) ! (const_int 128))) ! (const_int 2) ! (const_int 5))) ! (set_attr "modrm" "0")]) (define_expand "indirect_jump" [(set (pc) (match_operand 0 "nonimmediate_operand" "rm"))] *************** *** 13357,13370 **** return "dec{l}\t%1\;%+jne\t%l0"; } [(set_attr "ppro_uops" "many") ! (set (attr "type") (if_then_else (and (eq_attr "alternative" "0") (and (ge (minus (match_dup 0) (pc)) ! (const_int -128)) (lt (minus (match_dup 0) (pc)) ! (const_int 124)))) ! (const_string "ibr") ! (const_string "multi")))]) (define_split [(set (pc) --- 13358,13374 ---- return "dec{l}\t%1\;%+jne\t%l0"; } [(set_attr "ppro_uops" "many") ! (set (attr "length") (if_then_else (and (eq_attr "alternative" "0") (and (ge (minus (match_dup 0) (pc)) ! (const_int -126)) (lt (minus (match_dup 0) (pc)) ! (const_int 128)))) ! (const_int 2) ! (const_int 16))) ! ;; We don't know the type before shorten branches. Optimistically expect ! ;; the loop instruction to match. ! (set (attr "type") (const_string "ibr"))]) (define_split [(set (pc) *************** *** 13879,13885 **** [(set_attr "length_immediate" "0") (set_attr "length" "1") (set_attr "modrm" "0") - (set_attr "modrm" "0") (set_attr "athlon_decode" "vector") (set_attr "ppro_uops" "few")]) --- 13883,13888 ---- *************** *** 13892,13904 **** [(set_attr "length_immediate" "0") (set_attr "length" "1") (set_attr "modrm" "0") - (set_attr "modrm" "0") (set_attr "athlon_decode" "vector") (set_attr "ppro_uops" "few")]) (define_expand "ffssi2" [(set (match_operand:SI 0 "nonimmediate_operand" "") ! (ffs:SI (match_operand:SI 1 "general_operand" "")))] "" { rtx out = gen_reg_rtx (SImode), tmp = gen_reg_rtx (SImode); --- 13895,13906 ---- [(set_attr "length_immediate" "0") (set_attr "length" "1") (set_attr "modrm" "0") (set_attr "athlon_decode" "vector") (set_attr "ppro_uops" "few")]) (define_expand "ffssi2" [(set (match_operand:SI 0 "nonimmediate_operand" "") ! (ffs:SI (match_operand:SI 1 "nonimmediate_operand" "")))] "" { rtx out = gen_reg_rtx (SImode), tmp = gen_reg_rtx (SImode); *************** *** 16862,16867 **** --- 16864,16873 ---- operands[2] = gen_lowpart (SImode, operands[2]); PUT_MODE (operands[3], SImode);") + ; Promote the QImode tests, as i386 has encoding of the AND + ; instruction with 32-bit sign-extended immediate and thus the + ; instruction size is unchanged, except in the %eax case for + ; which it is increased by one byte, hence the ! optimize_size. (define_split [(set (reg 17) (compare (and (match_operand 1 "aligned_operand" "") *************** *** 16870,16879 **** (set (match_operand 0 "register_operand" "") (and (match_dup 1) (match_dup 2)))] "! TARGET_PARTIAL_REG_STALL && reload_completed ! && ix86_match_ccmode (insn, CCNOmode) && (GET_MODE (operands[0]) == HImode ! || (GET_MODE (operands[0]) == QImode ! && (TARGET_PROMOTE_QImode || optimize_size)))" [(parallel [(set (reg:CCNO 17) (compare:CCNO (and:SI (match_dup 1) (match_dup 2)) (const_int 0))) --- 16876,16886 ---- (set (match_operand 0 "register_operand" "") (and (match_dup 1) (match_dup 2)))] "! TARGET_PARTIAL_REG_STALL && reload_completed ! /* Ensure that the operand will remain sign-extended immediate. */ ! && ix86_match_ccmode (insn, INTVAL (operands[2]) >= 0 ? CCNOmode : CCZmode) ! && ! optimize_size && (GET_MODE (operands[0]) == HImode ! || (GET_MODE (operands[0]) == QImode && TARGET_PROMOTE_QImode))" [(parallel [(set (reg:CCNO 17) (compare:CCNO (and:SI (match_dup 1) (match_dup 2)) (const_int 0))) *************** *** 16886,16901 **** operands[0] = gen_lowpart (SImode, operands[0]); operands[1] = gen_lowpart (SImode, operands[1]);") (define_split [(set (reg 17) ! (compare (and (match_operand 0 "aligned_operand" "") ! (match_operand 1 "const_int_operand" "")) (const_int 0)))] "! TARGET_PARTIAL_REG_STALL && reload_completed ! && ix86_match_ccmode (insn, CCNOmode) ! && (GET_MODE (operands[0]) == HImode ! || (GET_MODE (operands[0]) == QImode ! && (TARGET_PROMOTE_QImode || optimize_size)))" [(set (reg:CCNO 17) (compare:CCNO (and:SI (match_dup 0) (match_dup 1)) (const_int 0)))] --- 16893,16911 ---- operands[0] = gen_lowpart (SImode, operands[0]); operands[1] = gen_lowpart (SImode, operands[1]);") + ; Don't promote the QImode tests, as i386 doesn't have encoding of + ; the TEST instruction with 32-bit sign-extended immediate and thus + ; the instruction size would at least double, which is not what we + ; want even with ! optimize_size. (define_split [(set (reg 17) ! (compare (and (match_operand:HI 0 "aligned_operand" "") ! (match_operand:HI 1 "const_int_operand" "")) (const_int 0)))] "! TARGET_PARTIAL_REG_STALL && reload_completed ! /* Ensure that the operand will remain sign-extended immediate. */ ! && ix86_match_ccmode (insn, INTVAL (operands[1]) >= 0 ? CCNOmode : CCZmode) ! && ! optimize_size" [(set (reg:CCNO 17) (compare:CCNO (and:SI (match_dup 0) (match_dup 1)) (const_int 0)))] diff -Nrc3pad gcc-3.2.2/gcc/config/i386/linux.h gcc-3.2.3/gcc/config/i386/linux.h *** gcc-3.2.2/gcc/config/i386/linux.h Mon Apr 15 20:27:27 2002 --- gcc-3.2.3/gcc/config/i386/linux.h Thu Mar 6 20:19:22 2003 *************** Boston, MA 02111-1307, USA. */ *** 218,225 **** #endif /* Do code reading to identify a signal frame, and set the frame ! state data appropriately. See unwind-dw2.c for the structs. */ #ifdef IN_LIBGCC2 #include #include --- 218,227 ---- #endif /* Do code reading to identify a signal frame, and set the frame ! state data appropriately. See unwind-dw2.c for the structs. ! Don't use this at all if inhibit_libc is used. */ + #ifndef inhibit_libc #ifdef IN_LIBGCC2 #include #include *************** Boston, MA 02111-1307, USA. */ *** 278,280 **** --- 280,283 ---- (FS)->retaddr_column = 8; \ goto SUCCESS; \ } while (0) + #endif /* ifndef inhibit_libc */ diff -Nrc3pad gcc-3.2.2/gcc/config/i386/linux64.h gcc-3.2.3/gcc/config/i386/linux64.h *** gcc-3.2.2/gcc/config/i386/linux64.h Sun Oct 27 09:24:50 2002 --- gcc-3.2.3/gcc/config/i386/linux64.h Fri Mar 14 12:18:24 2003 *************** Boston, MA 02111-1307, USA. */ *** 28,34 **** #define CPP_PREDEFINES "-D__ELF__ -Dunix -D__gnu_linux__ -Dlinux -Asystem(posix)" #undef CPP_SPEC ! #define CPP_SPEC "%(cpp_cpu) %{fPIC:-D__PIC__ -D__pic__} %{fpic:-D__PIC__ -D__pic__} %{posix:-D_POSIX_SOURCE} %{pthread:-D_REENTRANT} %{!m32:-D__LONG_MAX__=9223372036854775807L}" /* The svr4 ABI for the i386 says that records and unions are returned in memory. In the 64bit compilation we will turn this flag off in --- 28,35 ---- #define CPP_PREDEFINES "-D__ELF__ -Dunix -D__gnu_linux__ -Dlinux -Asystem(posix)" #undef CPP_SPEC ! #define CPP_SPEC "%(cpp_cpu) %{fPIC:-D__PIC__ -D__pic__} %{fpic:-D__PIC__ -D__pic__} %{posix:-D_POSIX_SOURCE} %{pthread:-D_REENTRANT} \ ! %{!m32:-D__LONG_MAX__=9223372036854775807L -D__LP64__ -D_LP64}" /* The svr4 ABI for the i386 says that records and unions are returned in memory. In the 64bit compilation we will turn this flag off in diff -Nrc3pad gcc-3.2.2/gcc/config/m68k/m68k.md gcc-3.2.3/gcc/config/m68k/m68k.md *** gcc-3.2.2/gcc/config/m68k/m68k.md Thu Jan 30 16:57:24 2003 --- gcc-3.2.3/gcc/config/m68k/m68k.md Mon Mar 17 10:22:00 2003 *************** *** 1,5 **** ;;- Machine description for GNU compiler, Motorola 68000 Version ! ;; Copyright (C) 1987, 1988, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2001, 2002 ;; Free Software Foundation, Inc. ;; This file is part of GNU CC. --- 1,5 ---- ;;- Machine description for GNU compiler, Motorola 68000 Version ! ;; Copyright (C) 1987, 1988, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2001, 2002, 2003 ;; Free Software Foundation, Inc. ;; This file is part of GNU CC. *************** *** 3092,3098 **** [(parallel [(set (subreg:SI (match_operand:DI 0 "register_operand" "") 4) (mult:SI (match_operand:SI 1 "register_operand" "") ! (match_operand:SI 2 "nonimmediate_operand" ""))) (set (subreg:SI (match_dup 0) 0) (truncate:SI (lshiftrt:DI (mult:DI (zero_extend:DI (match_dup 1)) (zero_extend:DI (match_dup 2))) --- 3092,3098 ---- [(parallel [(set (subreg:SI (match_operand:DI 0 "register_operand" "") 4) (mult:SI (match_operand:SI 1 "register_operand" "") ! (match_operand:SI 2 "register_operand" ""))) (set (subreg:SI (match_dup 0) 0) (truncate:SI (lshiftrt:DI (mult:DI (zero_extend:DI (match_dup 1)) (zero_extend:DI (match_dup 2))) *************** *** 3131,3137 **** [(parallel [(set (subreg:SI (match_operand:DI 0 "register_operand" "") 4) (mult:SI (match_operand:SI 1 "register_operand" "") ! (match_operand:SI 2 "nonimmediate_operand" ""))) (set (subreg:SI (match_dup 0) 0) (truncate:SI (lshiftrt:DI (mult:DI (sign_extend:DI (match_dup 1)) (sign_extend:DI (match_dup 2))) --- 3131,3137 ---- [(parallel [(set (subreg:SI (match_operand:DI 0 "register_operand" "") 4) (mult:SI (match_operand:SI 1 "register_operand" "") ! (match_operand:SI 2 "register_operand" ""))) (set (subreg:SI (match_dup 0) 0) (truncate:SI (lshiftrt:DI (mult:DI (sign_extend:DI (match_dup 1)) (sign_extend:DI (match_dup 2))) *************** *** 3832,3838 **** case -1 : /* FIXME : a scratch register would be welcome here if operand[0] is not a register */ ! output_asm_insn (\"move%.l %#-1,%R0\", operands); break; default : { --- 3832,3838 ---- case -1 : /* FIXME : a scratch register would be welcome here if operand[0] is not a register */ ! output_asm_insn (\"move%.l %#-1,%0\", operands); break; default : { diff -Nrc3pad gcc-3.2.2/gcc/config/mips/iris6.h gcc-3.2.3/gcc/config/mips/iris6.h *** gcc-3.2.2/gcc/config/mips/iris6.h Sun May 19 15:21:35 2002 --- gcc-3.2.3/gcc/config/mips/iris6.h Thu Mar 27 20:08:13 2003 *************** *** 1,5 **** /* Definitions of target machine for GNU compiler. Iris version 6. ! Copyright (C) 1994, 1995, 1996, 1997, 1998, 2000, 2001 Free Software Foundation, Inc. This file is part of GNU CC. --- 1,6 ---- /* Definitions of target machine for GNU compiler. Iris version 6. ! Copyright (C) 1994, 1995, 1996, 1997, 1998, 2000, 2001, 2002, 2003 ! Free Software Foundation, Inc. This file is part of GNU CC. *************** Boston, MA 02111-1307, USA. */ *** 129,139 **** prior to 6.5. They normally get defined in SUBTARGET_CPP_SPEC if !ansi, for g++ we want them regardless. We don't need this on irix6.5 itself, but it shouldn't hurt other than the namespace ! pollution. */ #undef CPLUSPLUS_CPP_SPEC #define CPLUSPLUS_CPP_SPEC "\ -D__LANGUAGE_C_PLUS_PLUS -D_LANGUAGE_C_PLUS_PLUS \ ! %{ansi:-D__EXTENSIONS__ -D_SGI_SOURCE} %(cpp) \ " /* Irix 6 uses DWARF-2. */ --- 130,141 ---- prior to 6.5. They normally get defined in SUBTARGET_CPP_SPEC if !ansi, for g++ we want them regardless. We don't need this on irix6.5 itself, but it shouldn't hurt other than the namespace ! pollution. libstdc++ v3 needs many ISO C99 features provided ! in IRIX 6.5.18, but protected by the __c99 macro. */ #undef CPLUSPLUS_CPP_SPEC #define CPLUSPLUS_CPP_SPEC "\ -D__LANGUAGE_C_PLUS_PLUS -D_LANGUAGE_C_PLUS_PLUS \ ! %{ansi:-D__EXTENSIONS__ -D_SGI_SOURCE} -D__c99 %(cpp) \ " /* Irix 6 uses DWARF-2. */ diff -Nrc3pad gcc-3.2.2/gcc/config/mips/mips-protos.h gcc-3.2.3/gcc/config/mips/mips-protos.h *** gcc-3.2.2/gcc/config/mips/mips-protos.h Sun Mar 24 08:13:16 2002 --- gcc-3.2.3/gcc/config/mips/mips-protos.h Wed Feb 12 15:25:45 2003 *************** extern void init_cumulative_args PARAMS *** 80,85 **** --- 80,86 ---- tree, rtx)); extern void gen_conditional_move PARAMS ((rtx *)); extern void mips_gen_conditional_trap PARAMS ((rtx *)); + extern void mips_emit_fcc_reload PARAMS ((rtx, rtx, rtx)); extern void machine_dependent_reorg PARAMS ((rtx)); extern int mips_address_cost PARAMS ((rtx)); extern void mips_count_memory_refs PARAMS ((rtx, int)); diff -Nrc3pad gcc-3.2.2/gcc/config/mips/mips.c gcc-3.2.3/gcc/config/mips/mips.c *** gcc-3.2.2/gcc/config/mips/mips.c Fri Jul 26 23:23:02 2002 --- gcc-3.2.3/gcc/config/mips/mips.c Wed Feb 12 15:25:49 2003 *************** mips_gen_conditional_trap (operands) *** 3267,3272 **** --- 3267,3317 ---- gen_rtx (cmp_code, GET_MODE (operands[0]), op0, op1), operands[1])); } + + /* Return true if operand OP is a condition code register. + Only for use during or after reload. */ + + int + fcc_register_operand (op, mode) + rtx op; + enum machine_mode mode; + { + return ((mode == VOIDmode || mode == GET_MODE (op)) + && (reload_in_progress || reload_completed) + && (GET_CODE (op) == REG || GET_CODE (op) == SUBREG) + && ST_REG_P (true_regnum (op))); + } + + /* Emit code to move general operand SRC into condition-code + register DEST. SCRATCH is a scratch TFmode float register. + The sequence is: + + FP1 = SRC + FP2 = 0.0f + DEST = FP2 < FP1 + + where FP1 and FP2 are single-precision float registers + taken from SCRATCH. */ + + void + mips_emit_fcc_reload (dest, src, scratch) + rtx dest, src, scratch; + { + rtx fp1, fp2; + + /* Change the source to SFmode. */ + if (GET_CODE (src) == MEM) + src = adjust_address (src, SFmode, 0); + else if (GET_CODE (src) == REG || GET_CODE (src) == SUBREG) + src = gen_rtx_REG (SFmode, true_regnum (src)); + + fp1 = gen_rtx_REG (SFmode, REGNO (scratch)); + fp2 = gen_rtx_REG (SFmode, REGNO (scratch) + FP_INC); + + emit_move_insn (copy_rtx (fp1), src); + emit_move_insn (copy_rtx (fp2), CONST0_RTX (SFmode)); + emit_insn (gen_slt_sf (dest, fp2, fp1)); + } /* Write a loop to move a constant number of bytes. Generate load/stores as follows: diff -Nrc3pad gcc-3.2.2/gcc/config/mips/mips.h gcc-3.2.3/gcc/config/mips/mips.h *** gcc-3.2.2/gcc/config/mips/mips.h Fri Apr 26 21:32:14 2002 --- gcc-3.2.3/gcc/config/mips/mips.h Wed Feb 12 15:25:48 2003 *************** do { \ *** 1582,1587 **** --- 1582,1591 ---- /* For MIPS, width of a floating point register. */ #define UNITS_PER_FPREG (TARGET_FLOAT64 ? 8 : 4) + /* If register $f0 holds a floating-point value, $f(0 + FP_INC) is + the next available register. */ + #define FP_INC (TARGET_FLOAT64 || TARGET_SINGLE_FLOAT ? 1 : 2) + /* A C expression for the size in bits of the type `int' on the target machine. If you don't define this, the default is one word. */ *************** while (0) *** 4001,4006 **** --- 4005,4011 ---- {"se_nonimmediate_operand", { SUBREG, REG, MEM, SIGN_EXTEND }}, \ {"consttable_operand", { LABEL_REF, SYMBOL_REF, CONST_INT, \ CONST_DOUBLE, CONST }}, \ + {"fcc_register_operand", { REG, SUBREG }}, \ {"extend_operator", { SIGN_EXTEND, ZERO_EXTEND }}, \ {"highpart_shift_operator", { ASHIFTRT, LSHIFTRT, ROTATERT, ROTATE }}, diff -Nrc3pad gcc-3.2.2/gcc/config/mips/mips.md gcc-3.2.3/gcc/config/mips/mips.md *** gcc-3.2.2/gcc/config/mips/mips.md Mon Nov 11 05:57:14 2002 --- gcc-3.2.3/gcc/config/mips/mips.md Wed Feb 12 15:25:50 2003 *************** move\\t%0,%z4\\n\\ *** 5786,5862 **** (set_attr "mode" "SI") (set_attr "length" "8,4,4,8,4,8,4,4,4,4,8,4,8")]) ! ;; Reload condition code registers. These need scratch registers. ! (define_expand "reload_incc" ! [(set (match_operand:CC 0 "register_operand" "=z") ! (match_operand:CC 1 "general_operand" "z")) (clobber (match_operand:TF 2 "register_operand" "=&f"))] "ISA_HAS_8CC && TARGET_HARD_FLOAT" " { ! rtx source; ! rtx fp1, fp2; ! int regno; ! ! /* This is called when are copying some value into a condition code ! register. Operand 0 is the condition code register. Operand 1 ! is the source. Operand 2 is a scratch register; we use TFmode ! because we actually need two floating point registers. */ ! if (! ST_REG_P (true_regnum (operands[0])) ! || ! FP_REG_P (true_regnum (operands[2]))) ! abort (); ! ! /* We need to get the source in SFmode so that the insn is ! recognized. */ ! if (GET_CODE (operands[1]) == MEM) ! source = adjust_address (operands[1], SFmode, 0); ! else if (GET_CODE (operands[1]) == REG || GET_CODE (operands[1]) == SUBREG) ! source = gen_rtx_REG (SFmode, true_regnum (operands[1])); ! else ! source = operands[1]; ! ! /* FP1 and FP2 are the two halves of the TFmode scratch operand. They ! will be single registers in 64-bit mode and register pairs in 32-bit ! mode. SOURCE is loaded into FP1 and zero is loaded into FP2. */ ! regno = REGNO (operands[2]); ! fp1 = gen_rtx_REG (SFmode, regno); ! fp2 = gen_rtx_REG (SFmode, regno + HARD_REGNO_NREGS (regno, DFmode)); ! ! emit_insn (gen_move_insn (fp1, source)); ! emit_insn (gen_move_insn (fp2, gen_rtx_REG (SFmode, 0))); ! emit_insn (gen_rtx_SET (VOIDmode, operands[0], ! gen_rtx_LT (CCmode, fp2, fp1))); ! DONE; }") (define_expand "reload_outcc" ! [(set (match_operand:CC 0 "general_operand" "=z") ! (match_operand:CC 1 "register_operand" "z")) ! (clobber (match_operand:CC 2 "register_operand" "=&d"))] "ISA_HAS_8CC && TARGET_HARD_FLOAT" " { ! /* This is called when we are copying a condition code register out ! to save it somewhere. Operand 0 should be the location we are ! going to save it to. Operand 1 should be the condition code ! register. Operand 2 should be a scratch general purpose register ! created for us by reload. The mips_secondary_reload_class ! function should have told reload that we don't need a scratch ! register if the destination is a general purpose register anyhow. */ ! if (ST_REG_P (true_regnum (operands[0])) ! || GP_REG_P (true_regnum (operands[0])) ! || ! ST_REG_P (true_regnum (operands[1])) ! || ! GP_REG_P (true_regnum (operands[2]))) ! abort (); ! ! /* All we have to do is copy the value from the condition code to ! the data register, which movcc can handle, and then store the ! value into the real final destination. */ ! emit_insn (gen_move_insn (operands[2], operands[1])); ! emit_insn (gen_move_insn (operands[0], operands[2])); ! DONE; }") --- 5786,5824 ---- (set_attr "mode" "SI") (set_attr "length" "8,4,4,8,4,8,4,4,4,4,8,4,8")]) ! ;; Reload condition code registers. reload_incc and reload_outcc ! ;; both handle moves from arbitrary operands into condition code ! ;; registers. reload_incc handles the more common case in which ! ;; a source operand is constrained to be in a condition-code ! ;; register, but has not been allocated to one. ! ;; ! ;; Sometimes, such as in movcc, we have a CCmode destination whose ! ;; constraints do not include 'z'. reload_outcc handles the case ! ;; when such an operand is allocated to a condition-code register. ! ;; ! ;; Note that reloads from a condition code register to some ! ;; other location can be done using ordinary moves. Moving ! ;; into a GPR takes a single movcc, moving elsewhere takes ! ;; two. We can leave these cases to the generic reload code. (define_expand "reload_incc" ! [(set (match_operand:CC 0 "fcc_register_operand" "=z") ! (match_operand:CC 1 "general_operand" "")) (clobber (match_operand:TF 2 "register_operand" "=&f"))] "ISA_HAS_8CC && TARGET_HARD_FLOAT" " { ! mips_emit_fcc_reload (operands[0], operands[1], operands[2]); DONE; }") (define_expand "reload_outcc" ! [(set (match_operand:CC 0 "fcc_register_operand" "=z") ! (match_operand:CC 1 "register_operand" "")) ! (clobber (match_operand:TF 2 "register_operand" "=&f"))] "ISA_HAS_8CC && TARGET_HARD_FLOAT" " { ! mips_emit_fcc_reload (operands[0], operands[1], operands[2]); DONE; }") diff -Nrc3pad gcc-3.2.2/gcc/config/pa/pa-protos.h gcc-3.2.3/gcc/config/pa/pa-protos.h *** gcc-3.2.2/gcc/config/pa/pa-protos.h Thu Jul 11 18:22:02 2002 --- gcc-3.2.3/gcc/config/pa/pa-protos.h Wed Apr 16 23:00:20 2003 *************** extern int cmpib_comparison_operator PAR *** 157,163 **** extern int reloc_needed PARAMS ((tree)); #ifdef RTX_CODE extern rtx function_arg PARAMS ((CUMULATIVE_ARGS *, enum machine_mode, ! tree, int, int)); #endif extern int function_arg_partial_nregs PARAMS ((CUMULATIVE_ARGS *, enum machine_mode, --- 157,163 ---- extern int reloc_needed PARAMS ((tree)); #ifdef RTX_CODE extern rtx function_arg PARAMS ((CUMULATIVE_ARGS *, enum machine_mode, ! tree, int)); #endif extern int function_arg_partial_nregs PARAMS ((CUMULATIVE_ARGS *, enum machine_mode, diff -Nrc3pad gcc-3.2.2/gcc/config/pa/pa.c gcc-3.2.3/gcc/config/pa/pa.c *** gcc-3.2.2/gcc/config/pa/pa.c Sat Feb 1 04:50:32 2003 --- gcc-3.2.3/gcc/config/pa/pa.c Wed Apr 16 23:00:23 2003 *************** output_cbranch (operands, nullify, lengt *** 5159,5171 **** static char buf[100]; int useskip = 0; ! /* A conditional branch to the following instruction (eg the delay slot) is ! asking for a disaster. This can happen when not optimizing. ! In such cases it is safe to emit nothing. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return ""; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ --- 5159,5176 ---- static char buf[100]; int useskip = 0; ! /* A conditional branch to the following instruction (eg the delay slot) ! is asking for a disaster. This can happen when not optimizing and ! when jump optimization fails. ! While it is usually safe to emit nothing, this can fail if the preceding ! instruction is a nullified branch with an empty delay slot and the ! same branch target as this branch. We could check for this but ! jump optimization should eliminate these jumps. It is always ! safe to emit a nop. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return "nop"; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ *************** output_bb (operands, nullify, length, ne *** 5369,5375 **** jump. But be prepared just in case. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return ""; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ --- 5374,5380 ---- jump. But be prepared just in case. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return "nop"; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ *************** output_bvb (operands, nullify, length, n *** 5517,5523 **** jump. But be prepared just in case. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return ""; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ --- 5522,5528 ---- jump. But be prepared just in case. */ if (next_active_insn (JUMP_LABEL (insn)) == next_active_insn (insn)) ! return "nop"; /* If this is a long branch with its delay slot unfilled, set `nullify' as it can nullify the delay slot and save a nop. */ *************** output_millicode_call (insn, call_dest) *** 5926,5935 **** output_asm_insn ("{bl|b,l} .+8,%%r1", xoperands); /* Add %r1 to the offset of our target from the next insn. */ ! output_asm_insn ("addil L%%%0-%1,%%r1", xoperands); ! ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "L", ! CODE_LABEL_NUMBER (xoperands[1])); ! output_asm_insn ("ldo R%%%0-%1(%%r1),%%r1", xoperands); /* Get the return address into %r31. */ output_asm_insn ("blr 0,%3", xoperands); --- 5931,5949 ---- output_asm_insn ("{bl|b,l} .+8,%%r1", xoperands); /* Add %r1 to the offset of our target from the next insn. */ ! if (TARGET_SOM || !TARGET_GAS) ! { ! output_asm_insn ("addil L%%%0-%1,%%r1", xoperands); ! ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "L", ! CODE_LABEL_NUMBER (xoperands[1])); ! output_asm_insn ("ldo R%%%0-%1(%%r1),%%r1", xoperands); ! } ! else ! { ! output_asm_insn ("addil L'%0-$PIC_pcrel$0+8,%%r1", xoperands); ! output_asm_insn ("ldo R'%0-$PIC_pcrel$0+12(%%r1),%%r1", ! xoperands); ! } /* Get the return address into %r31. */ output_asm_insn ("blr 0,%3", xoperands); *************** insn_refs_are_delayed (insn) *** 7192,7203 **** ??? We might want to restructure this so that it looks more like other ports. */ rtx ! function_arg (cum, mode, type, named, incoming) CUMULATIVE_ARGS *cum; enum machine_mode mode; tree type; int named ATTRIBUTE_UNUSED; - int incoming; { int max_arg_words = (TARGET_64BIT ? 8 : 4); int fpr_reg_base; --- 7206,7216 ---- ??? We might want to restructure this so that it looks more like other ports. */ rtx ! function_arg (cum, mode, type, named) CUMULATIVE_ARGS *cum; enum machine_mode mode; tree type; int named ATTRIBUTE_UNUSED; { int max_arg_words = (TARGET_64BIT ? 8 : 4); int fpr_reg_base; *************** function_arg (cum, mode, type, named, in *** 7331,7337 **** if (((TARGET_PORTABLE_RUNTIME || TARGET_64BIT || TARGET_ELF32) /* If we are doing soft-float with portable runtime, then there is no need to worry about FP regs. */ ! && ! TARGET_SOFT_FLOAT /* The parameter must be some kind of float, else we can just pass it in integer registers. */ && FLOAT_MODE_P (mode) --- 7344,7350 ---- if (((TARGET_PORTABLE_RUNTIME || TARGET_64BIT || TARGET_ELF32) /* If we are doing soft-float with portable runtime, then there is no need to worry about FP regs. */ ! && !TARGET_SOFT_FLOAT /* The parameter must be some kind of float, else we can just pass it in integer registers. */ && FLOAT_MODE_P (mode) *************** function_arg (cum, mode, type, named, in *** 7340,7353 **** /* libcalls do not need to pass items in both FP and general registers. */ && type != NULL_TREE ! /* All this hair applies to outgoing args only. */ ! && ! incoming) /* Also pass outgoing floating arguments in both registers in indirect calls with the 32 bit ABI and the HP assembler since there is no way to the specify argument locations in static functions. */ ! || (! TARGET_64BIT ! && ! TARGET_GAS ! && ! incoming && cum->indirect && FLOAT_MODE_P (mode))) { --- 7353,7367 ---- /* libcalls do not need to pass items in both FP and general registers. */ && type != NULL_TREE ! /* All this hair applies to "outgoing" args only. This includes ! sibcall arguments setup with FUNCTION_INCOMING_ARG. */ ! && !cum->incoming) /* Also pass outgoing floating arguments in both registers in indirect calls with the 32 bit ABI and the HP assembler since there is no way to the specify argument locations in static functions. */ ! || (!TARGET_64BIT ! && !TARGET_GAS ! && !cum->incoming && cum->indirect && FLOAT_MODE_P (mode))) { diff -Nrc3pad gcc-3.2.2/gcc/config/pa/pa.h gcc-3.2.3/gcc/config/pa/pa.h *** gcc-3.2.2/gcc/config/pa/pa.h Sat Dec 28 23:27:08 2002 --- gcc-3.2.3/gcc/config/pa/pa.h Wed Apr 16 23:00:25 2003 *************** extern struct rtx_def *hppa_pic_save_rtx *** 715,726 **** and about the args processed so far, enough to enable macros such as FUNCTION_ARG to determine where the next arg should go. ! On the HP-PA, this is a single integer, which is a number of words of arguments scanned so far (including the invisible argument, ! if any, which holds the structure-value-address). ! Thus 4 or more means all following args should go on the stack. */ ! struct hppa_args {int words, nargs_prototype, indirect; }; #define CUMULATIVE_ARGS struct hppa_args --- 715,735 ---- and about the args processed so far, enough to enable macros such as FUNCTION_ARG to determine where the next arg should go. ! On the HP-PA, the WORDS field holds the number of words of arguments scanned so far (including the invisible argument, ! if any, which holds the structure-value-address). Thus, 4 or ! more means all following args should go on the stack. ! ! The INCOMING field tracks whether this is an "incoming" or ! "outgoing" argument. ! ! The INDIRECT field indicates whether this is is an indirect ! call or not. ! ! The NARGS_PROTOTYPE field indicates that an argument does not ! have a prototype when it less than or equal to 0. */ ! struct hppa_args {int words, nargs_prototype, incoming, indirect; }; #define CUMULATIVE_ARGS struct hppa_args *************** struct hppa_args {int words, nargs_proto *** 730,735 **** --- 739,745 ---- #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \ (CUM).words = 0, \ + (CUM).incoming = 0, \ (CUM).indirect = INDIRECT, \ (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \ ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \ *************** struct hppa_args {int words, nargs_proto *** 744,749 **** --- 754,760 ---- #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \ (CUM).words = 0, \ + (CUM).incoming = 1, \ (CUM).indirect = 0, \ (CUM).nargs_prototype = 1000 *************** struct hppa_args {int words, nargs_proto *** 817,826 **** tempted to try and simply it, but I worry about breaking something. */ #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \ ! function_arg (&CUM, MODE, TYPE, NAMED, 0) ! ! #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \ ! function_arg (&CUM, MODE, TYPE, NAMED, 1) /* For an arg passed partly in registers and partly in memory, this is the number of registers used. --- 828,834 ---- tempted to try and simply it, but I worry about breaking something. */ #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \ ! function_arg (&CUM, MODE, TYPE, NAMED) /* For an arg passed partly in registers and partly in memory, this is the number of registers used. diff -Nrc3pad gcc-3.2.2/gcc/config/pa/pa.md gcc-3.2.3/gcc/config/pa/pa.md *** gcc-3.2.2/gcc/config/pa/pa.md Fri Jan 24 15:51:23 2003 --- gcc-3.2.3/gcc/config/pa/pa.md Fri Feb 7 22:59:30 2003 *************** *** 5681,5692 **** xoperands[0] = operands[0]; xoperands[1] = gen_label_rtx (); ! output_asm_insn (\"{bl|b,l} .+8,%%r1\\n\\taddil L'%l0-%l1,%%r1\", ! xoperands); ! ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, \"L\", ! CODE_LABEL_NUMBER (xoperands[1])); ! output_asm_insn (\"ldo R'%l0-%l1(%%r1),%%r1\\n\\tbv %%r0(%%r1)\", ! xoperands); } else output_asm_insn (\"ldil L'%l0,%%r1\\n\\tbe R'%l0(%%sr4,%%r1)\", operands);; --- 5681,5701 ---- xoperands[0] = operands[0]; xoperands[1] = gen_label_rtx (); ! if (TARGET_SOM || !TARGET_GAS) ! { ! output_asm_insn (\"{bl|b,l} .+8,%%r1\\n\\taddil L'%l0-%l1,%%r1\", ! xoperands); ! ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, \"L\", ! CODE_LABEL_NUMBER (xoperands[1])); ! output_asm_insn (\"ldo R'%l0-%l1(%%r1),%%r1\\n\\tbv %%r0(%%r1)\", ! xoperands); ! } ! else ! { ! output_asm_insn (\"{bl|b,l} .+8,%%r1\", xoperands); ! output_asm_insn (\"addil L'%l0-$PIC_pcrel$0+4,%%r1\", xoperands); ! output_asm_insn (\"ldo R'%l0-$PIC_pcrel$0+8(%%r1),%%r1\", xoperands); ! } } else output_asm_insn (\"ldil L'%l0,%%r1\\n\\tbe R'%l0(%%sr4,%%r1)\", operands);; diff -Nrc3pad gcc-3.2.2/gcc/config/rs6000/rs6000.c gcc-3.2.3/gcc/config/rs6000/rs6000.c *** gcc-3.2.2/gcc/config/rs6000/rs6000.c Thu Jan 23 22:19:42 2003 --- gcc-3.2.3/gcc/config/rs6000/rs6000.c Tue Apr 8 22:03:23 2003 *************** first_reg_to_save () *** 7409,7415 **** if (regs_ever_live[first_reg] && (! call_used_regs[first_reg] || (first_reg == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic == 1) || (DEFAULT_ABI == ABI_DARWIN && flag_pic))))) break; --- 7409,7415 ---- if (regs_ever_live[first_reg] && (! call_used_regs[first_reg] || (first_reg == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic != 0) || (DEFAULT_ABI == ABI_DARWIN && flag_pic))))) break; *************** void *** 8053,8059 **** rs6000_emit_load_toc_table (fromprolog) int fromprolog; { ! rtx dest; dest = gen_rtx_REG (Pmode, RS6000_PIC_OFFSET_TABLE_REGNUM); if (TARGET_ELF && DEFAULT_ABI == ABI_V4 && flag_pic == 1) --- 8053,8059 ---- rs6000_emit_load_toc_table (fromprolog) int fromprolog; { ! rtx dest, insn; dest = gen_rtx_REG (Pmode, RS6000_PIC_OFFSET_TABLE_REGNUM); if (TARGET_ELF && DEFAULT_ABI == ABI_V4 && flag_pic == 1) *************** rs6000_emit_load_toc_table (fromprolog) *** 8061,8068 **** rtx temp = (fromprolog ? gen_rtx_REG (Pmode, LINK_REGISTER_REGNUM) : gen_reg_rtx (Pmode)); ! rs6000_maybe_dead (emit_insn (gen_load_toc_v4_pic_si (temp))); ! rs6000_maybe_dead (emit_move_insn (dest, temp)); } else if (TARGET_ELF && DEFAULT_ABI != ABI_AIX && flag_pic == 2) { --- 8061,8072 ---- rtx temp = (fromprolog ? gen_rtx_REG (Pmode, LINK_REGISTER_REGNUM) : gen_reg_rtx (Pmode)); ! insn = emit_insn (gen_load_toc_v4_pic_si (temp)); ! if (fromprolog) ! rs6000_maybe_dead (insn); ! insn = emit_move_insn (dest, temp); ! if (fromprolog) ! rs6000_maybe_dead (insn); } else if (TARGET_ELF && DEFAULT_ABI != ABI_AIX && flag_pic == 2) { *************** rs6000_emit_load_toc_table (fromprolog) *** 8109,8122 **** ASM_GENERATE_INTERNAL_LABEL (buf, "LCG", reload_toc_labelno++); symF = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)); ! rs6000_maybe_dead (emit_insn (gen_load_toc_v4_PIC_1b (tempLR, ! symF, ! tocsym))); ! rs6000_maybe_dead (emit_move_insn (dest, tempLR)); ! rs6000_maybe_dead (emit_move_insn (temp0, ! gen_rtx_MEM (Pmode, dest))); } ! rs6000_maybe_dead (emit_insn (gen_addsi3 (dest, temp0, dest))); } else if (TARGET_ELF && !TARGET_AIX && flag_pic == 0 && TARGET_MINIMAL_TOC) { --- 8113,8125 ---- ASM_GENERATE_INTERNAL_LABEL (buf, "LCG", reload_toc_labelno++); symF = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)); ! emit_insn (gen_load_toc_v4_PIC_1b (tempLR, symF, tocsym)); ! emit_move_insn (dest, tempLR); ! emit_move_insn (temp0, gen_rtx_MEM (Pmode, dest)); } ! insn = emit_insn (gen_addsi3 (dest, temp0, dest)); ! if (fromprolog) ! rs6000_maybe_dead (insn); } else if (TARGET_ELF && !TARGET_AIX && flag_pic == 0 && TARGET_MINIMAL_TOC) { *************** rs6000_emit_load_toc_table (fromprolog) *** 8126,8140 **** ASM_GENERATE_INTERNAL_LABEL (buf, "LCTOC", 1); realsym = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)); ! rs6000_maybe_dead (emit_insn (gen_elf_high (dest, realsym))); ! rs6000_maybe_dead (emit_insn (gen_elf_low (dest, dest, realsym))); } else if (DEFAULT_ABI == ABI_AIX) { if (TARGET_32BIT) ! rs6000_maybe_dead (emit_insn (gen_load_toc_aix_si (dest))); else ! rs6000_maybe_dead (emit_insn (gen_load_toc_aix_di (dest))); } else abort (); --- 8129,8149 ---- ASM_GENERATE_INTERNAL_LABEL (buf, "LCTOC", 1); realsym = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)); ! insn = emit_insn (gen_elf_high (dest, realsym)); ! if (fromprolog) ! rs6000_maybe_dead (insn); ! insn = emit_insn (gen_elf_low (dest, dest, realsym)); ! if (fromprolog) ! rs6000_maybe_dead (insn); } else if (DEFAULT_ABI == ABI_AIX) { if (TARGET_32BIT) ! insn = emit_insn (gen_load_toc_aix_si (dest)); else ! insn = emit_insn (gen_load_toc_aix_di (dest)); ! if (fromprolog) ! rs6000_maybe_dead (insn); } else abort (); *************** rs6000_emit_prologue () *** 8793,8799 **** if ((regs_ever_live[info->first_gp_reg_save+i] && ! call_used_regs[info->first_gp_reg_save+i]) || (i+info->first_gp_reg_save == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic == 1) || (DEFAULT_ABI == ABI_DARWIN && flag_pic)))) { rtx addr, reg, mem; --- 8802,8808 ---- if ((regs_ever_live[info->first_gp_reg_save+i] && ! call_used_regs[info->first_gp_reg_save+i]) || (i+info->first_gp_reg_save == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic != 0) || (DEFAULT_ABI == ABI_DARWIN && flag_pic)))) { rtx addr, reg, mem; *************** rs6000_emit_prologue () *** 8889,8895 **** /* Set frame pointer, if needed. */ if (frame_pointer_needed) { ! insn = emit_move_insn (gen_rtx_REG (reg_mode, FRAME_POINTER_REGNUM), sp_reg_rtx); RTX_FRAME_RELATED_P (insn) = 1; } --- 8898,8904 ---- /* Set frame pointer, if needed. */ if (frame_pointer_needed) { ! insn = emit_move_insn (gen_rtx_REG (Pmode, FRAME_POINTER_REGNUM), sp_reg_rtx); RTX_FRAME_RELATED_P (insn) = 1; } *************** rs6000_emit_epilogue (sibcall) *** 9179,9185 **** if ((regs_ever_live[info->first_gp_reg_save+i] && ! call_used_regs[info->first_gp_reg_save+i]) || (i+info->first_gp_reg_save == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic == 1) || (DEFAULT_ABI == ABI_DARWIN && flag_pic)))) { rtx addr = gen_rtx_PLUS (Pmode, frame_reg_rtx, --- 9188,9194 ---- if ((regs_ever_live[info->first_gp_reg_save+i] && ! call_used_regs[info->first_gp_reg_save+i]) || (i+info->first_gp_reg_save == RS6000_PIC_OFFSET_TABLE_REGNUM ! && ((DEFAULT_ABI == ABI_V4 && flag_pic != 0) || (DEFAULT_ABI == ABI_DARWIN && flag_pic)))) { rtx addr = gen_rtx_PLUS (Pmode, frame_reg_rtx, diff -Nrc3pad gcc-3.2.2/gcc/config/rs6000/rs6000.h gcc-3.2.3/gcc/config/rs6000/rs6000.h *** gcc-3.2.2/gcc/config/rs6000/rs6000.h Thu Aug 8 17:52:40 2002 --- gcc-3.2.3/gcc/config/rs6000/rs6000.h Sat Mar 29 12:39:20 2003 *************** *** 1,6 **** /* Definitions of target machine for GNU compiler, for IBM RS/6000. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! 2000, 2001, 2002 Free Software Foundation, Inc. Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) This file is part of GNU CC. --- 1,6 ---- /* Definitions of target machine for GNU compiler, for IBM RS/6000. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, ! 2000, 2001, 2002, 2003 Free Software Foundation, Inc. Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu) This file is part of GNU CC. *************** extern int rs6000_altivec_abi; *** 962,967 **** --- 962,971 ---- = call_really_used_regs[i] = 1; \ if (DEFAULT_ABI == ABI_V4 \ && PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM \ + && flag_pic == 2) \ + fixed_regs[RS6000_PIC_OFFSET_TABLE_REGNUM] = 1; \ + if (DEFAULT_ABI == ABI_V4 \ + && PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM \ && flag_pic == 1) \ fixed_regs[RS6000_PIC_OFFSET_TABLE_REGNUM] \ = call_used_regs[RS6000_PIC_OFFSET_TABLE_REGNUM] \ *************** typedef struct rs6000_stack { *** 1539,1558 **** as seen by the caller. On RS/6000, this is r3, fp1, and v2 (for AltiVec). */ ! #define FUNCTION_VALUE_REGNO_P(N) ((N) == GP_ARG_RETURN \ ! || ((N) == FP_ARG_RETURN) \ ! || (TARGET_ALTIVEC && \ ! (N) == ALTIVEC_ARG_RETURN)) /* 1 if N is a possible register number for function argument passing. On RS/6000, these are r3-r10 and fp1-fp13. On AltiVec, v2 - v13 are used for passing vectors. */ #define FUNCTION_ARG_REGNO_P(N) \ ! (((unsigned)((N) - GP_ARG_MIN_REG) < (unsigned)(GP_ARG_NUM_REG)) \ ! || (TARGET_ALTIVEC && \ ! (unsigned)((N) - ALTIVEC_ARG_MIN_REG) < (unsigned)(ALTIVEC_ARG_NUM_REG)) \ ! || ((unsigned)((N) - FP_ARG_MIN_REG) < (unsigned)(FP_ARG_NUM_REG))) ! /* A C structure for machine-specific, per-function data. This is added to the cfun structure. */ --- 1543,1562 ---- as seen by the caller. On RS/6000, this is r3, fp1, and v2 (for AltiVec). */ ! #define FUNCTION_VALUE_REGNO_P(N) \ ! ((N) == GP_ARG_RETURN \ ! || ((N) == FP_ARG_RETURN && TARGET_HARD_FLOAT) \ ! || ((N) == ALTIVEC_ARG_RETURN && TARGET_ALTIVEC)) /* 1 if N is a possible register number for function argument passing. On RS/6000, these are r3-r10 and fp1-fp13. On AltiVec, v2 - v13 are used for passing vectors. */ #define FUNCTION_ARG_REGNO_P(N) \ ! ((unsigned) (N) - GP_ARG_MIN_REG < GP_ARG_NUM_REG \ ! || ((unsigned) (N) - ALTIVEC_ARG_MIN_REG < ALTIVEC_ARG_NUM_REG \ ! && TARGET_ALTIVEC) \ ! || ((unsigned) (N) - FP_ARG_MIN_REG < FP_ARG_NUM_REG \ ! && TARGET_HARD_FLOAT)) /* A C structure for machine-specific, per-function data. This is added to the cfun structure. */ diff -Nrc3pad gcc-3.2.2/gcc/config/rs6000/rs6000.md gcc-3.2.3/gcc/config/rs6000/rs6000.md *** gcc-3.2.2/gcc/config/rs6000/rs6000.md Tue Nov 26 15:59:58 2002 --- gcc-3.2.3/gcc/config/rs6000/rs6000.md Thu Feb 27 02:08:01 2003 *************** *** 8439,8444 **** --- 8439,8470 ---- operands[5] = GEN_INT (CONST_DOUBLE_LOW (operands[1])); }") + (define_split + [(set (match_operand:TI 0 "gpc_reg_operand" "") + (match_operand:TI 1 "const_double_operand" ""))] + "TARGET_POWERPC64" + [(set (match_dup 2) (match_dup 4)) + (set (match_dup 3) (match_dup 5))] + " + { + operands[2] = operand_subword_force (operands[0], WORDS_BIG_ENDIAN == 0, + TImode); + operands[3] = operand_subword_force (operands[0], WORDS_BIG_ENDIAN != 0, + TImode); + if (GET_CODE (operands[1]) == CONST_DOUBLE) + { + operands[4] = GEN_INT (CONST_DOUBLE_HIGH (operands[1])); + operands[5] = GEN_INT (CONST_DOUBLE_LOW (operands[1])); + } + else if (GET_CODE (operands[1]) == CONST_INT) + { + operands[4] = GEN_INT (- (INTVAL (operands[1]) < 0)); + operands[5] = operands[1]; + } + else + FAIL; + }") + (define_insn "*movdi_internal64" [(set (match_operand:DI 0 "nonimmediate_operand" "=r,r,m,r,r,r,r,f,f,m,r,*h,*h") (match_operand:DI 1 "input_operand" "r,m,r,I,L,nF,R,f,m,f,*h,r,0"))] diff -Nrc3pad gcc-3.2.2/gcc/config/sparc/sparc.h gcc-3.2.3/gcc/config/sparc/sparc.h *** gcc-3.2.2/gcc/config/sparc/sparc.h Mon Jun 24 16:50:44 2002 --- gcc-3.2.3/gcc/config/sparc/sparc.h Fri Mar 21 10:20:50 2003 *************** do { \ *** 2203,2208 **** --- 2203,2210 ---- If you change this, execute "rm explow.o recog.o reload.o". */ + #define SYMBOLIC_CONST(X) symbolic_operand (X, VOIDmode) + #define RTX_OK_FOR_BASE_P(X) \ ((GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \ || (GET_CODE (X) == SUBREG \ *************** do { \ *** 2236,2241 **** --- 2238,2245 ---- && GET_CODE (op1) != REG \ && GET_CODE (op1) != LO_SUM \ && GET_CODE (op1) != MEM \ + && (! SYMBOLIC_CONST (op1) \ + || MODE == Pmode) \ && (GET_CODE (op1) != CONST_INT \ || SMALL_INT (op1))) \ goto ADDR; \ *************** do { \ *** 2323,2328 **** --- 2327,2360 ---- else if (GET_CODE (X) == CONST_INT && SMALL_INT (X)) \ goto ADDR; \ } + + /* Go to LABEL if ADDR (a legitimate address expression) + has an effect that depends on the machine mode it is used for. + + In PIC mode, + + (mem:HI [%l7+a]) + + is not equivalent to + + (mem:QI [%l7+a]) (mem:QI [%l7+a+1]) + + because [%l7+a+1] is interpreted as the address of (a+1). */ + + #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR, LABEL) \ + { \ + if (flag_pic == 1) \ + { \ + if (GET_CODE (ADDR) == PLUS) \ + { \ + rtx op0 = XEXP (ADDR, 0); \ + rtx op1 = XEXP (ADDR, 1); \ + if (op0 == pic_offset_table_rtx \ + && SYMBOLIC_CONST (op1)) \ + goto LABEL; \ + } \ + } \ + } /* Try machine-dependent ways of modifying an illegitimate address to be legitimate. If we find one, return the new, valid address. *************** do { *** 2400,2411 **** } \ /* ??? 64-bit reloads. */ \ } while (0) - - /* Go to LABEL if ADDR (a legitimate address expression) - has an effect that depends on the machine mode it is used for. - On the SPARC this is never true. */ - - #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) /* If we are referencing a function make the SYMBOL_REF special. In the Embedded Medium/Anywhere code model, %g4 points to the data segment --- 2432,2437 ---- diff -Nrc3pad gcc-3.2.2/gcc/config/sparc/sparc.md gcc-3.2.3/gcc/config/sparc/sparc.md *** gcc-3.2.2/gcc/config/sparc/sparc.md Wed Oct 2 03:47:05 2002 --- gcc-3.2.3/gcc/config/sparc/sparc.md Fri Mar 28 09:24:08 2003 *************** *** 2531,2539 **** (define_insn "*movdi_insn_sp32_v9" [(set (match_operand:DI 0 "nonimmediate_operand" ! "=T,o,T,U,o,r,r,r,?T,?f,?f,?o,?f,?e,?e,?W") (match_operand:DI 1 "input_operand" ! " J,J,U,T,r,o,i,r, f, T, o, f, f, e, W, e"))] "! TARGET_ARCH64 && TARGET_V9 && (GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM)" "@ --- 2531,2539 ---- (define_insn "*movdi_insn_sp32_v9" [(set (match_operand:DI 0 "nonimmediate_operand" ! "=T,o,T,U,o,r,r,r,?T,?f,?f,?o,?e,?e,?W") (match_operand:DI 1 "input_operand" ! " J,J,U,T,r,o,i,r, f, T, o, f, e, W, e"))] "! TARGET_ARCH64 && TARGET_V9 && (GET_CODE (operands[0]) != MEM || GET_CODE (operands[1]) != MEM)" "@ *************** *** 2549,2561 **** ldd\\t%1, %0 # # - # fmovd\\t%1, %0 ldd\\t%1, %0 std\\t%1, %0" ! [(set_attr "type" "store,store,store,load,*,*,*,*,fpstore,fpload,*,*,*,fpmove,fpload,fpstore") ! (set_attr "length" "*,2,*,*,2,2,2,2,*,*,2,2,2,*,*,*") ! (set_attr "fptype" "*,*,*,*,*,*,*,*,*,*,*,*,*,double,*,*")]) (define_insn "*movdi_insn_sp32" [(set (match_operand:DI 0 "nonimmediate_operand" --- 2549,2560 ---- ldd\\t%1, %0 # # fmovd\\t%1, %0 ldd\\t%1, %0 std\\t%1, %0" ! [(set_attr "type" "store,store,store,load,*,*,*,*,fpstore,fpload,*,*,fpmove,fpload,fpstore") ! (set_attr "length" "*,2,*,*,2,2,2,2,*,*,2,2,*,*,*") ! (set_attr "fptype" "*,*,*,*,*,*,*,*,*,*,*,*,double,*,*")]) (define_insn "*movdi_insn_sp32" [(set (match_operand:DI 0 "nonimmediate_operand" *************** *** 2899,2905 **** (define_split [(set (match_operand:DI 0 "register_operand" "") (match_operand:DI 1 "register_operand" ""))] ! "! TARGET_ARCH64 && reload_completed" [(clobber (const_int 0))] " { --- 2898,2911 ---- (define_split [(set (match_operand:DI 0 "register_operand" "") (match_operand:DI 1 "register_operand" ""))] ! "reload_completed ! && (! TARGET_V9 ! || (! TARGET_ARCH64 ! && ((GET_CODE (operands[0]) == REG ! && REGNO (operands[0]) < 32) ! || (GET_CODE (operands[0]) == SUBREG ! && GET_CODE (SUBREG_REG (operands[0])) == REG ! && REGNO (SUBREG_REG (operands[0])) < 32))))" [(clobber (const_int 0))] " { *************** *** 7951,7957 **** == INSN_ADDRESSES (INSN_UID (insn)))) return \"b\\t%l0%#\"; else ! return TARGET_V9 ? \"ba,pt%*\\t%%xcc, %l0%(\" : \"b%*\\t%l0%(\"; }" [(set_attr "type" "uncond_branch")]) --- 7957,7963 ---- == INSN_ADDRESSES (INSN_UID (insn)))) return \"b\\t%l0%#\"; else ! return TARGET_V9 ? \"ba%*,pt\\t%%xcc, %l0%(\" : \"b%*\\t%l0%(\"; }" [(set_attr "type" "uncond_branch")]) *************** *** 8669,8675 **** && mems_ok_for_ldd_peep (operands[0], operands[1], NULL_RTX)" [(set (match_dup 0) (const_int 0))] ! "operands[0] = change_address (operands[0], DImode, NULL);") (define_peephole2 [(set (match_operand:SI 0 "memory_operand" "") --- 8675,8681 ---- && mems_ok_for_ldd_peep (operands[0], operands[1], NULL_RTX)" [(set (match_dup 0) (const_int 0))] ! "operands[0] = widen_memory_access (operands[0], DImode, 0);") (define_peephole2 [(set (match_operand:SI 0 "memory_operand" "") *************** *** 8680,8686 **** && mems_ok_for_ldd_peep (operands[1], operands[0], NULL_RTX)" [(set (match_dup 1) (const_int 0))] ! "operands[1] = change_address (operands[1], DImode, NULL);") (define_peephole2 [(set (match_operand:SI 0 "register_operand" "") --- 8686,8692 ---- && mems_ok_for_ldd_peep (operands[1], operands[0], NULL_RTX)" [(set (match_dup 1) (const_int 0))] ! "operands[1] = widen_memory_access (operands[1], DImode, 0);") (define_peephole2 [(set (match_operand:SI 0 "register_operand" "") *************** *** 8691,8697 **** && mems_ok_for_ldd_peep (operands[1], operands[3], operands[0])" [(set (match_dup 0) (match_dup 1))] ! "operands[1] = change_address (operands[1], DImode, NULL); operands[0] = gen_rtx_REG (DImode, REGNO (operands[0]));") (define_peephole2 --- 8697,8703 ---- && mems_ok_for_ldd_peep (operands[1], operands[3], operands[0])" [(set (match_dup 0) (match_dup 1))] ! "operands[1] = widen_memory_access (operands[1], DImode, 0); operands[0] = gen_rtx_REG (DImode, REGNO (operands[0]));") (define_peephole2 *************** *** 8703,8709 **** && mems_ok_for_ldd_peep (operands[0], operands[2], NULL_RTX)" [(set (match_dup 0) (match_dup 1))] ! "operands[0] = change_address (operands[0], DImode, NULL); operands[1] = gen_rtx_REG (DImode, REGNO (operands[1]));") (define_peephole2 --- 8709,8715 ---- && mems_ok_for_ldd_peep (operands[0], operands[2], NULL_RTX)" [(set (match_dup 0) (match_dup 1))] ! "operands[0] = widen_memory_access (operands[0], DImode, 0); operands[1] = gen_rtx_REG (DImode, REGNO (operands[1]));") (define_peephole2 *************** *** 8715,8721 **** && mems_ok_for_ldd_peep (operands[1], operands[3], operands[0])" [(set (match_dup 0) (match_dup 1))] ! "operands[1] = change_address (operands[1], DFmode, NULL); operands[0] = gen_rtx_REG (DFmode, REGNO (operands[0]));") (define_peephole2 --- 8721,8727 ---- && mems_ok_for_ldd_peep (operands[1], operands[3], operands[0])" [(set (match_dup 0) (match_dup 1))] ! "operands[1] = widen_memory_access (operands[1], DFmode, 0); operands[0] = gen_rtx_REG (DFmode, REGNO (operands[0]));") (define_peephole2 *************** *** 8727,8733 **** && mems_ok_for_ldd_peep (operands[0], operands[2], NULL_RTX)" [(set (match_dup 0) (match_dup 1))] ! "operands[0] = change_address (operands[0], DFmode, NULL); operands[1] = gen_rtx_REG (DFmode, REGNO (operands[1]));") (define_peephole2 --- 8733,8739 ---- && mems_ok_for_ldd_peep (operands[0], operands[2], NULL_RTX)" [(set (match_dup 0) (match_dup 1))] ! "operands[0] = widen_memory_access (operands[0], DFmode, 0); operands[1] = gen_rtx_REG (DFmode, REGNO (operands[1]));") (define_peephole2 *************** *** 8739,8745 **** && mems_ok_for_ldd_peep (operands[3], operands[1], operands[0])" [(set (match_dup 2) (match_dup 3))] ! "operands[3] = change_address (operands[3], DImode, NULL); operands[2] = gen_rtx_REG (DImode, REGNO (operands[2]));") (define_peephole2 --- 8745,8751 ---- && mems_ok_for_ldd_peep (operands[3], operands[1], operands[0])" [(set (match_dup 2) (match_dup 3))] ! "operands[3] = widen_memory_access (operands[3], DImode, 0); operands[2] = gen_rtx_REG (DImode, REGNO (operands[2]));") (define_peephole2 *************** *** 8751,8757 **** && mems_ok_for_ldd_peep (operands[2], operands[0], NULL_RTX)" [(set (match_dup 2) (match_dup 3))] ! "operands[2] = change_address (operands[2], DImode, NULL); operands[3] = gen_rtx_REG (DImode, REGNO (operands[3])); ") --- 8757,8763 ---- && mems_ok_for_ldd_peep (operands[2], operands[0], NULL_RTX)" [(set (match_dup 2) (match_dup 3))] ! "operands[2] = widen_memory_access (operands[2], DImode, 0); operands[3] = gen_rtx_REG (DImode, REGNO (operands[3])); ") *************** *** 8764,8770 **** && mems_ok_for_ldd_peep (operands[3], operands[1], operands[0])" [(set (match_dup 2) (match_dup 3))] ! "operands[3] = change_address (operands[3], DFmode, NULL); operands[2] = gen_rtx_REG (DFmode, REGNO (operands[2]));") (define_peephole2 --- 8770,8776 ---- && mems_ok_for_ldd_peep (operands[3], operands[1], operands[0])" [(set (match_dup 2) (match_dup 3))] ! "operands[3] = widen_memory_access (operands[3], DFmode, 0); operands[2] = gen_rtx_REG (DFmode, REGNO (operands[2]));") (define_peephole2 *************** *** 8776,8782 **** && mems_ok_for_ldd_peep (operands[2], operands[0], NULL_RTX)" [(set (match_dup 2) (match_dup 3))] ! "operands[2] = change_address (operands[2], DFmode, NULL); operands[3] = gen_rtx_REG (DFmode, REGNO (operands[3]));") ;; Optimize the case of following a reg-reg move with a test --- 8782,8788 ---- && mems_ok_for_ldd_peep (operands[2], operands[0], NULL_RTX)" [(set (match_dup 2) (match_dup 3))] ! "operands[2] = widen_memory_access (operands[2], DFmode, 0); operands[3] = gen_rtx_REG (DFmode, REGNO (operands[3]));") ;; Optimize the case of following a reg-reg move with a test diff -Nrc3pad gcc-3.2.2/gcc/config/xtensa/xtensa.c gcc-3.2.3/gcc/config/xtensa/xtensa.c *** gcc-3.2.2/gcc/config/xtensa/xtensa.c Mon Dec 2 21:30:12 2002 --- gcc-3.2.3/gcc/config/xtensa/xtensa.c Tue Feb 11 22:18:53 2003 *************** xtensa_reorg (first) *** 2245,2252 **** continue; pat = PATTERN (insn); ! if (GET_CODE (pat) == UNSPEC_VOLATILE ! && (XINT (pat, 1) == UNSPECV_SET_FP)) { set_frame_ptr_insn = insn; break; --- 2245,2253 ---- continue; pat = PATTERN (insn); ! if (GET_CODE (pat) == SET ! && GET_CODE (SET_SRC (pat)) == UNSPEC_VOLATILE ! && (XINT (SET_SRC (pat), 1) == UNSPECV_SET_FP)) { set_frame_ptr_insn = insn; break; *************** order_regs_for_local_alloc () *** 2729,2734 **** --- 2730,2739 ---- for (i = 0; i < num_arg_regs; i++) reg_alloc_order[nxt++] = GP_ARG_FIRST + i; + /* list the coprocessor registers in order */ + for (i = 0; i < BR_REG_NUM; i++) + reg_alloc_order[nxt++] = BR_REG_FIRST + i; + /* list the FP registers in order for now */ for (i = 0; i < 16; i++) reg_alloc_order[nxt++] = FP_REG_FIRST + i; *************** order_regs_for_local_alloc () *** 2738,2747 **** reg_alloc_order[nxt++] = 1; /* a1 = stack pointer */ reg_alloc_order[nxt++] = 16; /* pseudo frame pointer */ reg_alloc_order[nxt++] = 17; /* pseudo arg pointer */ - - /* list the coprocessor registers in order */ - for (i = 0; i < BR_REG_NUM; i++) - reg_alloc_order[nxt++] = BR_REG_FIRST + i; reg_alloc_order[nxt++] = ACC_REG_FIRST; /* MAC16 accumulator */ } --- 2743,2748 ---- diff -Nrc3pad gcc-3.2.2/gcc/config/xtensa/xtensa.h gcc-3.2.3/gcc/config/xtensa/xtensa.h *** gcc-3.2.2/gcc/config/xtensa/xtensa.h Mon Dec 2 21:30:11 2002 --- gcc-3.2.3/gcc/config/xtensa/xtensa.h Mon Apr 14 15:31:30 2003 *************** extern unsigned xtensa_current_frame_siz *** 251,257 **** /* Size in bits of various types on the target machine. */ #define INT_TYPE_SIZE 32 - #define MAX_INT_TYPE_SIZE 32 #define SHORT_TYPE_SIZE 16 #define LONG_TYPE_SIZE 32 #define MAX_LONG_TYPE_SIZE 32 --- 251,256 ---- *************** extern unsigned xtensa_current_frame_siz *** 360,366 **** 0 - 15 AR[0] - AR[15] 16 FRAME_POINTER (fake = initial sp) 17 ARG_POINTER (fake = initial sp + framesize) - 18 LOOP_COUNT (loop count special register) 18 BR[0] for floating-point CC 19 - 34 FR[0] - FR[15] 35 MAC16 accumulator */ --- 359,364 ---- *************** extern unsigned xtensa_current_frame_siz *** 409,418 **** have been exhausted. */ #define REG_ALLOC_ORDER \ ! { 8, 9, 10, 11, 12, 13, 14, 15, 7, 6, 5, 4, 3, 2, 19, \ ! 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, \ 0, 1, 16, 17, \ ! 36, \ } #define ORDER_REGS_FOR_LOCAL_ALLOC order_regs_for_local_alloc () --- 407,417 ---- have been exhausted. */ #define REG_ALLOC_ORDER \ ! { 8, 9, 10, 11, 12, 13, 14, 15, 7, 6, 5, 4, 3, 2, \ ! 18, \ ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, \ 0, 1, 16, 17, \ ! 35, \ } #define ORDER_REGS_FOR_LOCAL_ALLOC order_regs_for_local_alloc () *************** extern int leaf_function; *** 439,449 **** #define GP_REG_LAST 17 #define GP_REG_NUM (GP_REG_LAST - GP_REG_FIRST + 1) - /* Special registers */ - #define SPEC_REG_FIRST 18 - #define SPEC_REG_LAST 18 - #define SPEC_REG_NUM (SPEC_REG_LAST - SPEC_REG_FIRST + 1) - /* Coprocessor registers */ #define BR_REG_FIRST 18 #define BR_REG_LAST 18 --- 438,443 ---- *************** extern char xtensa_hard_regno_mode_ok[][ *** 488,496 **** == (GET_MODE_CLASS (MODE2) == MODE_FLOAT || \ GET_MODE_CLASS (MODE2) == MODE_COMPLEX_FLOAT)) - /* Register to use for LCOUNT special register. */ - #define COUNT_REGISTER_REGNUM (SPEC_REG_FIRST + 0) - /* Register to use for pushing function arguments. */ #define STACK_POINTER_REGNUM (GP_REG_FIRST + 1) --- 482,487 ---- *************** typedef struct xtensa_args { *** 1271,1282 **** to contain offsets from the address of the table. Do not define this if the table should contain absolute addresses. */ /* #define CASE_VECTOR_PC_RELATIVE */ - - /* Specify the tree operation to be used to convert reals to integers. */ - #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR - - /* This is the kind of divide that is easiest to do in the general case. */ - #define EASY_DIV_EXPR TRUNC_DIV_EXPR /* Define this as 1 if 'char' should by default be signed; else as 0. */ #define DEFAULT_SIGNED_CHAR 0 --- 1262,1267 ---- diff -Nrc3pad gcc-3.2.2/gcc/config/xtensa/xtensa.md gcc-3.2.3/gcc/config/xtensa/xtensa.md *** gcc-3.2.2/gcc/config/xtensa/xtensa.md Fri Nov 22 19:27:42 2002 --- gcc-3.2.3/gcc/config/xtensa/xtensa.md Wed Mar 12 21:11:40 2003 *************** *** 97,102 **** --- 97,103 ---- "" " { + rtx srclo; rtx dstlo = gen_lowpart (SImode, operands[0]); rtx src1lo = gen_lowpart (SImode, operands[1]); rtx src2lo = gen_lowpart (SImode, operands[2]); *************** *** 105,113 **** rtx src1hi = gen_highpart (SImode, operands[1]); rtx src2hi = gen_highpart (SImode, operands[2]); emit_insn (gen_addsi3 (dstlo, src1lo, src2lo)); emit_insn (gen_addsi3 (dsthi, src1hi, src2hi)); ! emit_insn (gen_adddi_carry (dsthi, dstlo, src2lo)); DONE; }") --- 106,126 ---- rtx src1hi = gen_highpart (SImode, operands[1]); rtx src2hi = gen_highpart (SImode, operands[2]); + /* Either source can be used for overflow checking, as long as it's + not clobbered by the first addition. */ + if (!rtx_equal_p (dstlo, src1lo)) + srclo = src1lo; + else if (!rtx_equal_p (dstlo, src2lo)) + srclo = src2lo; + else + { + srclo = gen_reg_rtx (SImode); + emit_move_insn (srclo, src1lo); + } + emit_insn (gen_addsi3 (dstlo, src1lo, src2lo)); emit_insn (gen_addsi3 (dsthi, src1hi, src2hi)); ! emit_insn (gen_adddi_carry (dsthi, dstlo, srclo)); DONE; }") *************** *** 209,217 **** rtx src1hi = gen_highpart (SImode, operands[1]); rtx src2hi = gen_highpart (SImode, operands[2]); - emit_insn (gen_subsi3 (dstlo, src1lo, src2lo)); emit_insn (gen_subsi3 (dsthi, src1hi, src2hi)); emit_insn (gen_subdi_carry (dsthi, src1lo, src2lo)); DONE; }") --- 222,230 ---- rtx src1hi = gen_highpart (SImode, operands[1]); rtx src2hi = gen_highpart (SImode, operands[2]); emit_insn (gen_subsi3 (dsthi, src1hi, src2hi)); emit_insn (gen_subdi_carry (dsthi, src1lo, src2lo)); + emit_insn (gen_subsi3 (dstlo, src1lo, src2lo)); DONE; }") *************** *** 2392,2398 **** ;; to set up the frame pointer. (define_insn "set_frame_ptr" ! [(unspec_volatile [(const_int 0)] UNSPECV_SET_FP)] "" "* { --- 2405,2411 ---- ;; to set up the frame pointer. (define_insn "set_frame_ptr" ! [(set (reg:SI A7_REG) (unspec_volatile [(const_int 0)] UNSPECV_SET_FP))] "" "* { *************** *** 2406,2412 **** ;; Post-reload splitter to remove fp assignment when it's not needed. (define_split ! [(unspec_volatile [(const_int 0)] UNSPECV_SET_FP)] "reload_completed && !frame_pointer_needed" [(unspec [(const_int 0)] UNSPEC_NOP)] "") --- 2419,2425 ---- ;; Post-reload splitter to remove fp assignment when it's not needed. (define_split ! [(set (reg:SI A7_REG) (unspec_volatile [(const_int 0)] UNSPECV_SET_FP))] "reload_completed && !frame_pointer_needed" [(unspec [(const_int 0)] UNSPEC_NOP)] "") diff -Nrc3pad gcc-3.2.2/gcc/config.gcc gcc-3.2.3/gcc/config.gcc *** gcc-3.2.2/gcc/config.gcc Thu Jan 30 14:03:42 2003 --- gcc-3.2.3/gcc/config.gcc Fri Feb 28 18:38:19 2003 *************** m68k-*-linux*) # Motorola m68k's runnin *** 2090,2096 **** # aka the GNU/Linux C library 6. tm_file=m68k/linux.h tmake_file="t-slibgcc-elf-ver t-linux m68k/t-linux" ! extra_parts="crtbegin.o crtbeginS.o crtend.o crtendS.o" float_format=m68k gnu_ld=yes ;; --- 2090,2096 ---- # aka the GNU/Linux C library 6. tm_file=m68k/linux.h tmake_file="t-slibgcc-elf-ver t-linux m68k/t-linux" ! extra_parts="crtbegin.o crtbeginS.o crtbeginT.o crtend.o crtendS.o" float_format=m68k gnu_ld=yes ;; *************** xtensa-*-elf*) *** 3429,3435 **** ;; xtensa-*-linux*) tm_file="${tm_file} dbxelf.h elfos.h svr4.h linux.h xtensa/linux.h" ! tmake_file="t-linux xtensa/t-xtensa" extra_parts="crtbegin.o crtbeginS.o crtbeginT.o crtend.o crtendS.o" gas=yes gnu_ld=yes ;; --- 3429,3435 ---- ;; xtensa-*-linux*) tm_file="${tm_file} dbxelf.h elfos.h svr4.h linux.h xtensa/linux.h" ! tmake_file="t-slibgcc-elf-ver t-linux xtensa/t-xtensa" extra_parts="crtbegin.o crtbeginS.o crtbeginT.o crtend.o crtendS.o" gas=yes gnu_ld=yes ;; diff -Nrc3pad gcc-3.2.2/gcc/cp/ChangeLog gcc-3.2.3/gcc/cp/ChangeLog *** gcc-3.2.2/gcc/cp/ChangeLog Wed Feb 5 03:00:17 2003 --- gcc-3.2.3/gcc/cp/ChangeLog Tue Apr 22 06:14:55 2003 *************** *** 1,3 **** --- 1,88 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-04-15 Jason Merrill + + * decl2.c (mark_used): Don't instantiate anything if + skip_evaluation. + + 2003-03-24 Jakub Jelinek + + * Backport from mainline: + 2002-05-13 Jason Merrill + + * class.c (build_vtbl_ref_1): Use fixed_type_or_null. + (fixed_type_or_null): See through reference vars. + (build_base_path): Vtable contents are constant. + + 2003-03-19 Jason Merrill + + PR c++/8316, c++/9315, c++/10136 + * call.c (joust): Improve wording. + + 2003-03-17 Jason Merrill + + * decl.c (finish_function): Don't skip a block. + + PR c++/9993 + * decl.c (finish_function): Only allow the NRVO to use variables + declared at function scope. + + 2003-03-16 Kriang Lerdsuwanakij + + PR c++/6440 + * pt.c (maybe_process_partial_specialization): Handle + member class template when enclosing class template is + explicit specialized. + (most_general_template): Stop looking when DECL is already + specialized. + + 2003-03-13 Jason Merrill + + PR c++/9420 + * search.c (lookup_conversions): Call complete_type here. + * call.c (implicit_conversion): Not here. + + 2003-03-12 Andrew Lewycky + + PR c++/7050 + * expr.c (cxx_expand_expr): Return const0_rtx for throw + expressions. + + 2003-03-10 Jason Merrill + + PR c++/9798 + * decl.c (push_using_directive): Push before recursing. + + 2003-02-24 Kriang Lerdsuwanakij + + PR c++/9602 + * typeck2.c (abstract_virtuals_error): Don't check when we + are processing a template. + + 2003-02-23 Kriang Lerdsuwanakij + + PR c++/7982 + * decl.c (warn_about_implicit_typename_lookup): Handle TYPEOF_TYPE. + + 2003-02-19 Kriang Lerdsuwanakij + + PR c++/9459 + * error.c (dump_type_prefix): Handle TYPEOF_TYPE. + (dump_type_suffix): Likewise. + + 2003-02-10 Jason Merrill + + * call.c (call_builtin_trap): New fn. + (convert_arg_to_ellipsis): Use it. Downgrade error to warning. + (build_call): Don't set current_function_returns_abnormally outside + a function. + + PR c++/8674 + * call.c (build_over_call): Check specifically for TARGET_EXPR + when eliding. + 2003-02-05 Release Manager * GCC 3.2.2 Released. *************** *** 116,129 **** decl_constant_value on the operand. 2002-11-19 Release Manager - - * GCC 3.2.1 Released. - - 2002-11-19 Release Manager - - * GCC 3.2.1 Released. - - 2002-11-18 Release Manager * GCC 3.2.1 Released. --- 201,206 ---- diff -Nrc3pad gcc-3.2.2/gcc/cp/call.c gcc-3.2.3/gcc/cp/call.c *** gcc-3.2.2/gcc/cp/call.c Fri Aug 23 12:00:40 2002 --- gcc-3.2.3/gcc/cp/call.c Wed Mar 19 18:18:05 2003 *************** static tree convert_class_to_reference P *** 102,107 **** --- 102,108 ---- static tree direct_reference_binding PARAMS ((tree, tree)); static int promoted_arithmetic_type_p PARAMS ((tree)); static tree conditional_conversion PARAMS ((tree, tree)); + static tree call_builtin_trap PARAMS ((void)); tree build_vfield_ref (datum, type) *************** build_call (function, parms) *** 408,414 **** nothrow = ((decl && TREE_NOTHROW (decl)) || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function)))); ! if (decl && TREE_THIS_VOLATILE (decl)) current_function_returns_abnormally = 1; if (decl && TREE_DEPRECATED (decl)) --- 409,415 ---- nothrow = ((decl && TREE_NOTHROW (decl)) || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function)))); ! if (decl && TREE_THIS_VOLATILE (decl) && cfun) current_function_returns_abnormally = 1; if (decl && TREE_DEPRECATED (decl)) *************** implicit_conversion (to, from, expr, fla *** 1265,1275 **** || expr == error_mark_node) return NULL_TREE; - /* Make sure both the FROM and TO types are complete so that - user-defined conversions are available. */ - complete_type (from); - complete_type (to); - if (TREE_CODE (to) == REFERENCE_TYPE) conv = reference_binding (to, from, expr, flags); else --- 1266,1271 ---- *************** convert_like_real (convs, expr, fn, argn *** 4001,4006 **** --- 3997,4018 ---- LOOKUP_NORMAL|LOOKUP_NO_CONVERSION); } + /* Build a call to __builtin_trap which can be used in an expression. */ + + static tree + call_builtin_trap () + { + tree fn = get_identifier ("__builtin_trap"); + if (IDENTIFIER_GLOBAL_VALUE (fn)) + fn = IDENTIFIER_GLOBAL_VALUE (fn); + else + abort (); + + fn = build_call (fn, NULL_TREE); + fn = build (COMPOUND_EXPR, integer_type_node, fn, integer_zero_node); + return fn; + } + /* ARG is being passed to a varargs function. Perform any conversions required. Array/function to pointer decay must have already happened. Return the converted value. */ *************** convert_arg_to_ellipsis (arg) *** 4025,4033 **** /* Undefined behaviour [expr.call] 5.2.2/7. We used to just warn here and do a bitwise copy, but now cp_expr_size will abort if we try to do that. */ ! error ("cannot pass objects of non-POD type `%#T' through `...'", ! TREE_TYPE (arg)); ! arg = error_mark_node; } return arg; --- 4037,4046 ---- /* Undefined behaviour [expr.call] 5.2.2/7. We used to just warn here and do a bitwise copy, but now cp_expr_size will abort if we try to do that. */ ! warning ("cannot pass objects of non-POD type `%#T' through `...'; \ ! call will abort at runtime", ! TREE_TYPE (arg)); ! arg = call_builtin_trap (); } return arg; *************** build_over_call (cand, args, flags) *** 4296,4307 **** temp or an INIT_EXPR otherwise. */ if (integer_zerop (TREE_VALUE (args))) { ! if (! real_lvalue_p (arg)) return arg; else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn))) return build_target_expr_with_type (arg, DECL_CONTEXT (fn)); } ! else if ((!real_lvalue_p (arg) || TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn))) /* Empty classes have padding which can be hidden inside an (empty) base of the class. This must not --- 4309,4320 ---- temp or an INIT_EXPR otherwise. */ if (integer_zerop (TREE_VALUE (args))) { ! if (TREE_CODE (arg) == TARGET_EXPR) return arg; else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn))) return build_target_expr_with_type (arg, DECL_CONTEXT (fn)); } ! else if ((TREE_CODE (arg) == TARGET_EXPR || TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn))) /* Empty classes have padding which can be hidden inside an (empty) base of the class. This must not *************** tweak: *** 5488,5498 **** if (winner) { if (warn) ! { ! pedwarn ("choosing `%D' over `%D'", w->fn, l->fn); ! pedwarn ( ! " because worst conversion for the former is better than worst conversion for the latter"); ! } else add_warning (w, l); return winner; --- 5501,5509 ---- if (winner) { if (warn) ! pedwarn ("ISO C++ says that `%D' and `%D' are ambiguous \ ! even though the worst conversion for the former is better than the worst \ ! conversion for the latter", w->fn, l->fn); else add_warning (w, l); return winner; diff -Nrc3pad gcc-3.2.2/gcc/cp/class.c gcc-3.2.3/gcc/cp/class.c *** gcc-3.2.2/gcc/cp/class.c Fri Oct 25 15:20:28 2002 --- gcc-3.2.3/gcc/cp/class.c Mon Mar 24 11:33:46 2003 *************** build_base_path (code, expr, binfo, nonn *** 315,321 **** build_pointer_type (ptrdiff_type_node), v_offset); v_offset = build_indirect_ref (v_offset, NULL); ! offset = cp_convert (ptrdiff_type_node, size_diffop (offset, BINFO_OFFSET (v_binfo))); --- 315,322 ---- build_pointer_type (ptrdiff_type_node), v_offset); v_offset = build_indirect_ref (v_offset, NULL); ! TREE_CONSTANT (v_offset) = 1; ! offset = cp_convert (ptrdiff_type_node, size_diffop (offset, BINFO_OFFSET (v_binfo))); *************** static tree *** 400,474 **** build_vtbl_ref_1 (instance, idx) tree instance, idx; { ! tree vtbl, aref; ! tree basetype = TREE_TYPE (instance); if (TREE_CODE (basetype) == REFERENCE_TYPE) basetype = TREE_TYPE (basetype); ! if (instance == current_class_ref) ! vtbl = build_vfield_ref (instance, basetype); ! else { ! if (optimize) ! { ! /* Try to figure out what a reference refers to, and ! access its virtual function table directly. */ ! tree ref = NULL_TREE; ! ! if (TREE_CODE (instance) == INDIRECT_REF ! && TREE_CODE (TREE_TYPE (TREE_OPERAND (instance, 0))) == REFERENCE_TYPE) ! ref = TREE_OPERAND (instance, 0); ! else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE) ! ref = instance; ! ! if (ref && TREE_CODE (ref) == VAR_DECL ! && DECL_INITIAL (ref)) ! { ! tree init = DECL_INITIAL (ref); ! ! while (TREE_CODE (init) == NOP_EXPR ! || TREE_CODE (init) == NON_LVALUE_EXPR) ! init = TREE_OPERAND (init, 0); ! if (TREE_CODE (init) == ADDR_EXPR) ! { ! init = TREE_OPERAND (init, 0); ! if (IS_AGGR_TYPE (TREE_TYPE (init)) ! && (TREE_CODE (init) == PARM_DECL ! || TREE_CODE (init) == VAR_DECL)) ! instance = init; ! } ! } ! } ! if (IS_AGGR_TYPE (TREE_TYPE (instance)) ! && (TREE_CODE (instance) == RESULT_DECL ! || TREE_CODE (instance) == PARM_DECL ! || TREE_CODE (instance) == VAR_DECL)) ! { ! vtbl = TYPE_BINFO_VTABLE (basetype); ! /* Knowing the dynamic type of INSTANCE we can easily obtain ! the correct vtable entry. We resolve this back to be in ! terms of the primary vtable. */ ! if (TREE_CODE (vtbl) == PLUS_EXPR) ! { ! idx = fold (build (PLUS_EXPR, ! TREE_TYPE (idx), ! idx, ! build (EXACT_DIV_EXPR, ! TREE_TYPE (idx), ! TREE_OPERAND (vtbl, 1), ! TYPE_SIZE_UNIT (vtable_entry_type)))); ! vtbl = get_vtbl_decl_for_binfo (TYPE_BINFO (basetype)); ! } ! } ! else ! vtbl = build_vfield_ref (instance, basetype); } assemble_external (vtbl); aref = build_array_ref (vtbl, idx); return aref; } --- 401,436 ---- build_vtbl_ref_1 (instance, idx) tree instance, idx; { ! tree aref; ! tree vtbl = NULL_TREE; ! ! /* Try to figure out what a reference refers to, and ! access its virtual function table directly. */ ! ! int cdtorp = 0; ! tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp); + tree basetype = TREE_TYPE (instance); if (TREE_CODE (basetype) == REFERENCE_TYPE) basetype = TREE_TYPE (basetype); ! if (fixed_type && !cdtorp) { ! tree binfo = lookup_base (fixed_type, basetype, ! ba_ignore|ba_quiet, NULL); ! if (binfo) ! vtbl = BINFO_VTABLE (binfo); ! } ! if (!vtbl) ! { ! vtbl = build_vfield_ref (instance, basetype); } assemble_external (vtbl); aref = build_array_ref (vtbl, idx); + TREE_CONSTANT (aref) = 1; return aref; } *************** fixed_type_or_null (instance, nonnull, c *** 5370,5376 **** return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp); if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) /* Propagate nonnull. */ ! fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp); return NULL_TREE; case NOP_EXPR: --- 5332,5338 ---- return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp); if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) /* Propagate nonnull. */ ! return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull, cdtorp); return NULL_TREE; case NOP_EXPR: *************** fixed_type_or_null (instance, nonnull, c *** 5397,5402 **** --- 5359,5365 ---- /* fall through... */ case TARGET_EXPR: case PARM_DECL: + case RESULT_DECL: if (IS_AGGR_TYPE (TREE_TYPE (instance))) { if (nonnull) *************** fixed_type_or_null (instance, nonnull, c *** 5423,5428 **** --- 5386,5396 ---- /* Reference variables should be references to objects. */ if (nonnull) *nonnull = 1; + + if (TREE_CODE (instance) == VAR_DECL + && DECL_INITIAL (instance)) + return fixed_type_or_null (DECL_INITIAL (instance), + nonnull, cdtorp); } return NULL_TREE; diff -Nrc3pad gcc-3.2.2/gcc/cp/decl.c gcc-3.2.3/gcc/cp/decl.c *** gcc-3.2.2/gcc/cp/decl.c Tue Jan 21 19:00:27 2003 --- gcc-3.2.3/gcc/cp/decl.c Mon Mar 17 23:16:55 2003 *************** push_using_directive (used) *** 4539,4552 **** if (purpose_member (used, ud) != NULL_TREE) return NULL_TREE; - /* Recursively add all namespaces used. */ - for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter)) - push_using_directive (TREE_PURPOSE (iter)); - ancestor = namespace_ancestor (current_decl_namespace (), used); ud = current_binding_level->using_directives; ud = tree_cons (used, ancestor, ud); current_binding_level->using_directives = ud; return ud; } --- 4539,4553 ---- if (purpose_member (used, ud) != NULL_TREE) return NULL_TREE; ancestor = namespace_ancestor (current_decl_namespace (), used); ud = current_binding_level->using_directives; ud = tree_cons (used, ancestor, ud); current_binding_level->using_directives = ud; + + /* Recursively add all namespaces used. */ + for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter)) + push_using_directive (TREE_PURPOSE (iter)); + return ud; } *************** warn_about_implicit_typename_lookup (typ *** 6006,6011 **** --- 6007,6013 ---- tree name = DECL_NAME (typename); if (! (TREE_CODE (binding) == TEMPLATE_DECL + && CLASS_TYPE_P (subtype) && CLASSTYPE_TEMPLATE_INFO (subtype) && CLASSTYPE_TI_TEMPLATE (subtype) == binding) && ! (TREE_CODE (binding) == TYPE_DECL *************** finish_function (flags) *** 14307,14317 **** if (current_function_return_value) { tree r = current_function_return_value; ! /* This is only worth doing for fns that return in memory--and ! simpler, since we don't have to worry about promoted modes. */ if (r != error_mark_node ! && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)))) { DECL_ALIGN (r) = DECL_ALIGN (DECL_RESULT (fndecl)); walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl), nullify_returns_r, r); --- 14309,14328 ---- if (current_function_return_value) { tree r = current_function_return_value; ! tree outer; ! if (r != error_mark_node ! /* This is only worth doing for fns that return in memory--and ! simpler, since we don't have to worry about promoted modes. */ ! && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))) ! /* Only allow this for variables declared in the outer scope of ! the function so we know that their lifetime always ends with a ! return; see g++.dg/opt/nrv6.C. We could be more flexible if ! we were to do this optimization in tree-ssa. */ ! && (outer = BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl)), ! chain_member (r, BLOCK_VARS (outer)))) { + DECL_ALIGN (r) = DECL_ALIGN (DECL_RESULT (fndecl)); walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl), nullify_returns_r, r); diff -Nrc3pad gcc-3.2.2/gcc/cp/decl2.c gcc-3.2.3/gcc/cp/decl2.c *** gcc-3.2.2/gcc/cp/decl2.c Wed Dec 18 14:58:28 2002 --- gcc-3.2.3/gcc/cp/decl2.c Tue Apr 15 16:26:44 2003 *************** mark_used (decl) *** 5195,5204 **** tree decl; { TREE_USED (decl) = 1; ! if (processing_template_decl) return; ! if (!skip_evaluation) ! assemble_external (decl); /* Is it a synthesized method that needs to be synthesized? */ if (TREE_CODE (decl) == FUNCTION_DECL --- 5195,5204 ---- tree decl; { TREE_USED (decl) = 1; ! if (processing_template_decl || skip_evaluation) return; ! ! assemble_external (decl); /* Is it a synthesized method that needs to be synthesized? */ if (TREE_CODE (decl) == FUNCTION_DECL diff -Nrc3pad gcc-3.2.2/gcc/cp/error.c gcc-3.2.3/gcc/cp/error.c *** gcc-3.2.2/gcc/cp/error.c Thu Jan 23 00:30:23 2003 --- gcc-3.2.3/gcc/cp/error.c Wed Feb 19 15:28:26 2003 *************** dump_type_prefix (t, flags) *** 692,697 **** --- 692,698 ---- case TYPENAME_TYPE: case COMPLEX_TYPE: case VECTOR_TYPE: + case TYPEOF_TYPE: dump_type (t, flags); padding = before; break; *************** dump_type_suffix (t, flags) *** 788,793 **** --- 789,795 ---- case TYPENAME_TYPE: case COMPLEX_TYPE: case VECTOR_TYPE: + case TYPEOF_TYPE: break; default: diff -Nrc3pad gcc-3.2.2/gcc/cp/expr.c gcc-3.2.3/gcc/cp/expr.c *** gcc-3.2.2/gcc/cp/expr.c Wed Jan 23 14:25:56 2002 --- gcc-3.2.3/gcc/cp/expr.c Wed Mar 12 22:59:37 2003 *************** cplus_expand_expr (exp, target, tmode, m *** 111,117 **** case THROW_EXPR: expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0); ! return NULL; case MUST_NOT_THROW_EXPR: expand_eh_region_start (); --- 111,117 ---- case THROW_EXPR: expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0); ! return const0_rtx; case MUST_NOT_THROW_EXPR: expand_eh_region_start (); diff -Nrc3pad gcc-3.2.2/gcc/cp/parse.c gcc-3.2.3/gcc/cp/parse.c *** gcc-3.2.2/gcc/cp/parse.c Wed Feb 5 03:19:13 2003 --- gcc-3.2.3/gcc/cp/parse.c Tue Apr 22 08:12:08 2003 *************** *** 1,96 **** ! /* A Bison parser, made from parse.y ! by GNU bison 1.33. */ - #define YYBISON 1 /* Identify Bison output. */ - # define IDENTIFIER 257 - # define tTYPENAME 258 - # define SELFNAME 259 - # define PFUNCNAME 260 - # define SCSPEC 261 - # define TYPESPEC 262 - # define CV_QUALIFIER 263 - # define CONSTANT 264 - # define VAR_FUNC_NAME 265 - # define STRING 266 - # define ELLIPSIS 267 - # define SIZEOF 268 - # define ENUM 269 - # define IF 270 - # define ELSE 271 - # define WHILE 272 - # define DO 273 - # define FOR 274 - # define SWITCH 275 - # define CASE 276 - # define DEFAULT 277 - # define BREAK 278 - # define CONTINUE 279 - # define RETURN_KEYWORD 280 - # define GOTO 281 - # define ASM_KEYWORD 282 - # define TYPEOF 283 - # define ALIGNOF 284 - # define SIGOF 285 - # define ATTRIBUTE 286 - # define EXTENSION 287 - # define LABEL 288 - # define REALPART 289 - # define IMAGPART 290 - # define VA_ARG 291 - # define AGGR 292 - # define VISSPEC 293 - # define DELETE 294 - # define NEW 295 - # define THIS 296 - # define OPERATOR 297 - # define CXX_TRUE 298 - # define CXX_FALSE 299 - # define NAMESPACE 300 - # define TYPENAME_KEYWORD 301 - # define USING 302 - # define LEFT_RIGHT 303 - # define TEMPLATE 304 - # define TYPEID 305 - # define DYNAMIC_CAST 306 - # define STATIC_CAST 307 - # define REINTERPRET_CAST 308 - # define CONST_CAST 309 - # define SCOPE 310 - # define EXPORT 311 - # define EMPTY 312 - # define PTYPENAME 313 - # define NSNAME 314 - # define THROW 315 - # define ASSIGN 316 - # define OROR 317 - # define ANDAND 318 - # define MIN_MAX 319 - # define EQCOMPARE 320 - # define ARITHCOMPARE 321 - # define LSHIFT 322 - # define RSHIFT 323 - # define POINTSAT_STAR 324 - # define DOT_STAR 325 - # define UNARY 326 - # define PLUSPLUS 327 - # define MINUSMINUS 328 - # define HYPERUNARY 329 - # define POINTSAT 330 - # define TRY 331 - # define CATCH 332 - # define EXTERN_LANG_STRING 333 - # define ALL 334 - # define PRE_PARSED_CLASS_DECL 335 - # define DEFARG 336 - # define DEFARG_MARKER 337 - # define PRE_PARSED_FUNCTION_DECL 338 - # define TYPENAME_DEFN 339 - # define IDENTIFIER_DEFN 340 - # define PTYPENAME_DEFN 341 - # define END_OF_LINE 342 - # define END_OF_SAVED_INPUT 343 #line 30 "parse.y" /* Cause the `yydebug' variable to be defined. */ --- 1,239 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 ! ! /* Skeleton name. */ ! #define YYSKELETON_NAME "yacc.c" ! ! /* Pure parsers. */ ! #define YYPURE 0 ! ! /* Using locations. */ ! #define YYLSP_NEEDED 0 ! ! ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! IDENTIFIER = 258, ! tTYPENAME = 259, ! SELFNAME = 260, ! PFUNCNAME = 261, ! SCSPEC = 262, ! TYPESPEC = 263, ! CV_QUALIFIER = 264, ! CONSTANT = 265, ! VAR_FUNC_NAME = 266, ! STRING = 267, ! ELLIPSIS = 268, ! SIZEOF = 269, ! ENUM = 270, ! IF = 271, ! ELSE = 272, ! WHILE = 273, ! DO = 274, ! FOR = 275, ! SWITCH = 276, ! CASE = 277, ! DEFAULT = 278, ! BREAK = 279, ! CONTINUE = 280, ! RETURN_KEYWORD = 281, ! GOTO = 282, ! ASM_KEYWORD = 283, ! TYPEOF = 284, ! ALIGNOF = 285, ! SIGOF = 286, ! ATTRIBUTE = 287, ! EXTENSION = 288, ! LABEL = 289, ! REALPART = 290, ! IMAGPART = 291, ! VA_ARG = 292, ! AGGR = 293, ! VISSPEC = 294, ! DELETE = 295, ! NEW = 296, ! THIS = 297, ! OPERATOR = 298, ! CXX_TRUE = 299, ! CXX_FALSE = 300, ! NAMESPACE = 301, ! TYPENAME_KEYWORD = 302, ! USING = 303, ! LEFT_RIGHT = 304, ! TEMPLATE = 305, ! TYPEID = 306, ! DYNAMIC_CAST = 307, ! STATIC_CAST = 308, ! REINTERPRET_CAST = 309, ! CONST_CAST = 310, ! SCOPE = 311, ! EXPORT = 312, ! EMPTY = 313, ! NSNAME = 314, ! PTYPENAME = 315, ! THROW = 316, ! ASSIGN = 317, ! OROR = 318, ! ANDAND = 319, ! MIN_MAX = 320, ! EQCOMPARE = 321, ! ARITHCOMPARE = 322, ! RSHIFT = 323, ! LSHIFT = 324, ! DOT_STAR = 325, ! POINTSAT_STAR = 326, ! MINUSMINUS = 327, ! PLUSPLUS = 328, ! UNARY = 329, ! HYPERUNARY = 330, ! POINTSAT = 331, ! CATCH = 332, ! TRY = 333, ! EXTERN_LANG_STRING = 334, ! ALL = 335, ! PRE_PARSED_CLASS_DECL = 336, ! DEFARG = 337, ! DEFARG_MARKER = 338, ! PRE_PARSED_FUNCTION_DECL = 339, ! TYPENAME_DEFN = 340, ! IDENTIFIER_DEFN = 341, ! PTYPENAME_DEFN = 342, ! END_OF_LINE = 343, ! END_OF_SAVED_INPUT = 344 ! }; ! #endif ! #define IDENTIFIER 258 ! #define tTYPENAME 259 ! #define SELFNAME 260 ! #define PFUNCNAME 261 ! #define SCSPEC 262 ! #define TYPESPEC 263 ! #define CV_QUALIFIER 264 ! #define CONSTANT 265 ! #define VAR_FUNC_NAME 266 ! #define STRING 267 ! #define ELLIPSIS 268 ! #define SIZEOF 269 ! #define ENUM 270 ! #define IF 271 ! #define ELSE 272 ! #define WHILE 273 ! #define DO 274 ! #define FOR 275 ! #define SWITCH 276 ! #define CASE 277 ! #define DEFAULT 278 ! #define BREAK 279 ! #define CONTINUE 280 ! #define RETURN_KEYWORD 281 ! #define GOTO 282 ! #define ASM_KEYWORD 283 ! #define TYPEOF 284 ! #define ALIGNOF 285 ! #define SIGOF 286 ! #define ATTRIBUTE 287 ! #define EXTENSION 288 ! #define LABEL 289 ! #define REALPART 290 ! #define IMAGPART 291 ! #define VA_ARG 292 ! #define AGGR 293 ! #define VISSPEC 294 ! #define DELETE 295 ! #define NEW 296 ! #define THIS 297 ! #define OPERATOR 298 ! #define CXX_TRUE 299 ! #define CXX_FALSE 300 ! #define NAMESPACE 301 ! #define TYPENAME_KEYWORD 302 ! #define USING 303 ! #define LEFT_RIGHT 304 ! #define TEMPLATE 305 ! #define TYPEID 306 ! #define DYNAMIC_CAST 307 ! #define STATIC_CAST 308 ! #define REINTERPRET_CAST 309 ! #define CONST_CAST 310 ! #define SCOPE 311 ! #define EXPORT 312 ! #define EMPTY 313 ! #define NSNAME 314 ! #define PTYPENAME 315 ! #define THROW 316 ! #define ASSIGN 317 ! #define OROR 318 ! #define ANDAND 319 ! #define MIN_MAX 320 ! #define EQCOMPARE 321 ! #define ARITHCOMPARE 322 ! #define RSHIFT 323 ! #define LSHIFT 324 ! #define DOT_STAR 325 ! #define POINTSAT_STAR 326 ! #define MINUSMINUS 327 ! #define PLUSPLUS 328 ! #define UNARY 329 ! #define HYPERUNARY 330 ! #define POINTSAT 331 ! #define CATCH 332 ! #define TRY 333 ! #define EXTERN_LANG_STRING 334 ! #define ALL 335 ! #define PRE_PARSED_CLASS_DECL 336 ! #define DEFARG 337 ! #define DEFARG_MARKER 338 ! #define PRE_PARSED_FUNCTION_DECL 339 ! #define TYPENAME_DEFN 340 ! #define IDENTIFIER_DEFN 341 ! #define PTYPENAME_DEFN 342 ! #define END_OF_LINE 343 ! #define END_OF_SAVED_INPUT 344 ! + /* Copy the first part of user declarations. */ #line 30 "parse.y" /* Cause the `yydebug' variable to be defined. */ *************** cp_parse_init () *** 299,350 **** /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 #line 240 "parse.y" ! #ifndef YYSTYPE ! typedef union { long itype; tree ttype; char *strtype; enum tree_code code; flagged_type_tree ftype; struct unparsed_text *pi; ! } yystype; ! # define YYSTYPE yystype #endif #line 447 "parse.y" /* Tell yyparse how to print a token's value, if yydebug is set. */ #define YYPRINT(FILE,YYCHAR,YYLVAL) yyprint(FILE,YYCHAR,YYLVAL) extern void yyprint PARAMS ((FILE *, int, YYSTYPE)); ! #ifndef YYDEBUG ! # define YYDEBUG 0 #endif ! #define YYFINAL 1833 ! #define YYFLAG -32768 ! #define YYNTBASE 114 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 343 ? yytranslate[x] : 407) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 112, 2, 2, 2, 85, 73, 2, ! 95, 110, 83, 81, 62, 82, 94, 84, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 65, 63, ! 77, 67, 78, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 96, 2, 113, 72, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 61, 71, 111, 91, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, --- 442,622 ---- /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 + + /* Enabling traces. */ + #ifndef YYDEBUG + # define YYDEBUG 0 + #endif + + /* Enabling verbose error messages. */ + #ifdef YYERROR_VERBOSE + # undef YYERROR_VERBOSE + # define YYERROR_VERBOSE 1 + #else + # define YYERROR_VERBOSE 0 + #endif + + #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) #line 240 "parse.y" ! typedef union YYSTYPE { long itype; tree ttype; char *strtype; enum tree_code code; flagged_type_tree ftype; struct unparsed_text *pi; ! } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 470 "p2092.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif + + + + /* Copy the second part of user declarations. */ #line 447 "parse.y" /* Tell yyparse how to print a token's value, if yydebug is set. */ #define YYPRINT(FILE,YYCHAR,YYLVAL) yyprint(FILE,YYCHAR,YYLVAL) extern void yyprint PARAMS ((FILE *, int, YYSTYPE)); ! ! ! /* Line 214 of yacc.c. */ ! #line 487 "p2092.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! #endif + #if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; + #else + typedef short yysigned_char; + #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 4 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 13495 ! /* YYNTOKENS -- Number of terminals. */ ! #define YYNTOKENS 114 ! /* YYNNTS -- Number of nonterminals. */ ! #define YYNNTS 294 ! /* YYNRULES -- Number of rules. */ ! #define YYNRULES 931 ! /* YYNRULES -- Number of states. */ ! #define YYNSTATES 1833 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 344 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 112, 2, 2, 2, 85, 73, 2, ! 94, 110, 83, 81, 62, 82, 93, 84, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 65, 63, ! 76, 66, 77, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 95, 2, 113, 72, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 61, 71, 111, 88, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, *************** static const char yytranslate[] = *** 357,895 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, ! 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, ! 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 64, 66, 69, 70, 74, ! 75, 76, 79, 80, 86, 87, 88, 89, 90, 92, ! 93, 97, 98, 99, 100, 101, 102, 103, 104, 105, ! 106, 107, 108, 109 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 1, 3, 4, 7, 10, 12, 13, 14, ! 15, 17, 19, 20, 23, 26, 28, 29, 33, 35, ! 41, 46, 52, 57, 58, 65, 66, 72, 74, 77, ! 79, 82, 83, 90, 93, 97, 101, 105, 109, 114, ! 115, 121, 124, 128, 130, 132, 135, 138, 140, 143, ! 144, 150, 154, 156, 158, 160, 164, 166, 167, 170, ! 173, 177, 179, 183, 185, 189, 191, 195, 198, 201, ! 204, 206, 208, 214, 219, 222, 225, 229, 233, 236, ! 239, 243, 247, 250, 253, 256, 259, 262, 265, 267, ! 269, 271, 273, 274, 276, 279, 280, 282, 283, 290, ! 294, 298, 302, 303, 312, 318, 319, 329, 336, 337, ! 346, 352, 353, 363, 370, 373, 376, 378, 381, 383, ! 390, 399, 404, 411, 418, 423, 426, 428, 431, 434, ! 436, 439, 441, 444, 447, 452, 455, 458, 459, 460, ! 462, 466, 469, 473, 475, 480, 483, 488, 491, 496, ! 499, 501, 503, 505, 507, 509, 511, 513, 515, 517, ! 519, 521, 523, 524, 531, 532, 539, 540, 546, 547, ! 553, 554, 562, 563, 571, 572, 579, 580, 587, 588, ! 589, 595, 601, 603, 605, 611, 617, 618, 620, 622, ! 623, 625, 627, 631, 633, 635, 638, 640, 644, 646, ! 648, 650, 652, 654, 656, 658, 660, 664, 666, 670, ! 671, 673, 675, 676, 684, 686, 688, 692, 697, 701, ! 705, 709, 713, 717, 719, 721, 723, 726, 729, 732, ! 735, 738, 741, 744, 749, 752, 757, 760, 764, 768, ! 773, 778, 784, 790, 797, 800, 805, 811, 814, 817, ! 821, 825, 829, 831, 835, 838, 842, 847, 849, 852, ! 858, 860, 864, 868, 872, 876, 880, 884, 888, 892, ! 896, 900, 904, 908, 912, 916, 920, 924, 928, 932, ! 936, 942, 946, 950, 952, 955, 957, 961, 965, 969, ! 973, 977, 981, 985, 989, 993, 997, 1001, 1005, 1009, ! 1013, 1017, 1021, 1025, 1029, 1035, 1039, 1043, 1045, 1048, ! 1052, 1056, 1058, 1060, 1062, 1064, 1066, 1067, 1073, 1079, ! 1085, 1091, 1097, 1099, 1101, 1103, 1105, 1108, 1110, 1113, ! 1116, 1120, 1125, 1130, 1132, 1134, 1136, 1140, 1142, 1144, ! 1146, 1148, 1150, 1154, 1158, 1162, 1163, 1168, 1173, 1176, ! 1181, 1184, 1191, 1196, 1199, 1202, 1204, 1209, 1211, 1219, ! 1227, 1235, 1243, 1248, 1253, 1256, 1259, 1262, 1264, 1269, ! 1272, 1275, 1281, 1285, 1288, 1291, 1297, 1301, 1307, 1311, ! 1316, 1323, 1326, 1328, 1331, 1333, 1336, 1338, 1340, 1342, ! 1345, 1346, 1349, 1352, 1356, 1360, 1364, 1367, 1370, 1373, ! 1375, 1377, 1379, 1382, 1385, 1388, 1391, 1393, 1395, 1397, ! 1399, 1402, 1405, 1409, 1413, 1417, 1422, 1424, 1427, 1430, ! 1432, 1434, 1437, 1440, 1443, 1445, 1448, 1451, 1455, 1457, ! 1460, 1463, 1465, 1467, 1469, 1471, 1473, 1475, 1477, 1482, ! 1487, 1492, 1497, 1499, 1501, 1503, 1505, 1509, 1511, 1515, ! 1517, 1521, 1522, 1527, 1528, 1535, 1539, 1540, 1545, 1547, ! 1551, 1555, 1556, 1561, 1565, 1566, 1568, 1570, 1573, 1580, ! 1582, 1586, 1587, 1589, 1594, 1601, 1606, 1608, 1610, 1612, ! 1614, 1616, 1620, 1621, 1624, 1626, 1629, 1633, 1638, 1640, ! 1642, 1646, 1651, 1655, 1661, 1665, 1669, 1673, 1674, 1678, ! 1682, 1686, 1687, 1690, 1693, 1694, 1701, 1702, 1708, 1711, ! 1714, 1717, 1718, 1719, 1720, 1732, 1734, 1735, 1737, 1738, ! 1740, 1742, 1745, 1748, 1751, 1754, 1757, 1760, 1764, 1769, ! 1773, 1776, 1780, 1785, 1787, 1790, 1792, 1795, 1798, 1801, ! 1804, 1808, 1812, 1815, 1816, 1819, 1823, 1825, 1830, 1832, ! 1836, 1838, 1840, 1843, 1846, 1850, 1854, 1855, 1857, 1861, ! 1864, 1867, 1869, 1872, 1875, 1878, 1881, 1884, 1887, 1890, ! 1892, 1895, 1898, 1902, 1904, 1907, 1910, 1915, 1920, 1923, ! 1925, 1931, 1936, 1938, 1939, 1941, 1945, 1946, 1948, 1952, ! 1954, 1956, 1958, 1960, 1965, 1970, 1975, 1980, 1985, 1989, ! 1994, 1999, 2004, 2009, 2013, 2016, 2018, 2020, 2024, 2026, ! 2030, 2033, 2035, 2042, 2043, 2046, 2048, 2051, 2053, 2056, ! 2060, 2064, 2066, 2070, 2072, 2075, 2079, 2083, 2086, 2089, ! 2093, 2095, 2100, 2105, 2109, 2113, 2116, 2118, 2120, 2123, ! 2125, 2127, 2130, 2133, 2135, 2138, 2142, 2146, 2149, 2152, ! 2156, 2158, 2162, 2166, 2169, 2172, 2176, 2178, 2183, 2187, ! 2192, 2196, 2198, 2201, 2204, 2207, 2210, 2213, 2216, 2219, ! 2221, 2224, 2229, 2234, 2237, 2239, 2241, 2243, 2245, 2248, ! 2253, 2257, 2261, 2264, 2267, 2270, 2273, 2275, 2278, 2281, ! 2284, 2287, 2291, 2293, 2296, 2300, 2305, 2308, 2311, 2314, ! 2317, 2320, 2323, 2328, 2331, 2333, 2336, 2339, 2343, 2345, ! 2349, 2352, 2356, 2359, 2362, 2366, 2368, 2372, 2377, 2379, ! 2382, 2386, 2389, 2392, 2394, 2398, 2401, 2404, 2406, 2409, ! 2413, 2415, 2419, 2426, 2431, 2436, 2440, 2446, 2450, 2454, ! 2458, 2461, 2463, 2465, 2468, 2471, 2474, 2475, 2477, 2479, ! 2482, 2486, 2487, 2492, 2494, 2495, 2496, 2502, 2504, 2505, ! 2509, 2511, 2514, 2516, 2519, 2520, 2525, 2527, 2528, 2529, ! 2535, 2536, 2537, 2545, 2546, 2547, 2548, 2549, 2562, 2563, ! 2564, 2572, 2573, 2579, 2580, 2588, 2589, 2594, 2597, 2600, ! 2603, 2607, 2614, 2623, 2634, 2643, 2656, 2667, 2678, 2683, ! 2687, 2690, 2693, 2695, 2697, 2699, 2701, 2703, 2704, 2705, ! 2711, 2712, 2713, 2719, 2721, 2724, 2725, 2726, 2727, 2733, ! 2735, 2737, 2741, 2745, 2748, 2751, 2754, 2757, 2760, 2762, ! 2765, 2766, 2768, 2769, 2771, 2773, 2774, 2776, 2778, 2782, ! 2787, 2795, 2797, 2801, 2802, 2804, 2806, 2808, 2811, 2814, ! 2817, 2819, 2822, 2825, 2826, 2830, 2832, 2834, 2836, 2839, ! 2842, 2845, 2850, 2853, 2856, 2859, 2862, 2865, 2868, 2870, ! 2873, 2875, 2878, 2880, 2882, 2883, 2884, 2886, 2892, 2896, ! 2897, 2901, 2902, 2903, 2908, 2911, 2913, 2915, 2917, 2921, ! 2922, 2926, 2930, 2934, 2936, 2937, 2941, 2945, 2949, 2953, ! 2957, 2961, 2965, 2969, 2973, 2977, 2981, 2985, 2989, 2993, ! 2997, 3001, 3005, 3009, 3013, 3017, 3021, 3025, 3029, 3034, ! 3038, 3042, 3046, 3050, 3055, 3059, 3063, 3069, 3075, 3080, ! 3084 }; static const short yyrhs[] = { ! -1, 115, 0, 0, 116, 122, 0, 115, 122, 0, ! 115, 0, 0, 0, 0, 33, 0, 28, 0, 0, ! 123, 124, 0, 155, 152, 0, 149, 0, 0, 57, ! 125, 146, 0, 146, 0, 121, 95, 223, 110, 63, ! 0, 136, 61, 117, 111, 0, 136, 118, 155, 119, ! 152, 0, 136, 118, 149, 119, 0, 0, 46, 170, ! 61, 126, 117, 111, 0, 0, 46, 61, 127, 117, ! 111, 0, 128, 0, 130, 63, 0, 132, 0, 120, ! 124, 0, 0, 46, 170, 67, 129, 135, 63, 0, ! 48, 315, 0, 48, 329, 315, 0, 48, 329, 213, ! 0, 48, 134, 170, 0, 48, 329, 170, 0, 48, ! 329, 134, 170, 0, 0, 48, 46, 133, 135, 63, ! 0, 60, 56, 0, 134, 60, 56, 0, 213, 0, ! 315, 0, 329, 315, 0, 329, 213, 0, 99, 0, ! 136, 99, 0, 0, 50, 77, 138, 141, 78, 0, ! 50, 77, 78, 0, 137, 0, 139, 0, 145, 0, ! 141, 62, 145, 0, 170, 0, 0, 275, 142, 0, ! 47, 142, 0, 137, 275, 142, 0, 143, 0, 143, ! 67, 229, 0, 393, 0, 393, 67, 208, 0, 144, ! 0, 144, 67, 191, 0, 140, 147, 0, 140, 1, ! 0, 155, 152, 0, 148, 0, 146, 0, 136, 118, ! 155, 119, 152, 0, 136, 118, 148, 119, 0, 120, ! 147, 0, 243, 63, 0, 233, 242, 63, 0, 230, ! 241, 63, 0, 267, 63, 0, 243, 63, 0, 233, ! 242, 63, 0, 230, 241, 63, 0, 233, 63, 0, ! 173, 63, 0, 230, 63, 0, 1, 63, 0, 1, ! 111, 0, 1, 109, 0, 63, 0, 396, 0, 224, ! 0, 166, 0, 0, 165, 0, 165, 63, 0, 0, ! 109, 0, 0, 167, 150, 406, 61, 154, 199, 0, ! 161, 151, 153, 0, 161, 151, 364, 0, 161, 151, ! 1, 0, 0, 320, 5, 95, 157, 384, 110, 302, ! 399, 0, 320, 5, 49, 302, 399, 0, 0, 329, ! 320, 5, 95, 158, 384, 110, 302, 399, 0, 329, ! 320, 5, 49, 302, 399, 0, 0, 320, 186, 95, ! 159, 384, 110, 302, 399, 0, 320, 186, 49, 302, ! 399, 0, 0, 329, 320, 186, 95, 160, 384, 110, ! 302, 399, 0, 329, 320, 186, 49, 302, 399, 0, ! 230, 227, 0, 233, 312, 0, 312, 0, 233, 156, ! 0, 156, 0, 5, 95, 384, 110, 302, 399, 0, ! 95, 5, 110, 95, 384, 110, 302, 399, 0, 5, ! 49, 302, 399, 0, 95, 5, 110, 49, 302, 399, ! 0, 186, 95, 384, 110, 302, 399, 0, 186, 49, ! 302, 399, 0, 233, 162, 0, 162, 0, 230, 227, ! 0, 233, 312, 0, 312, 0, 233, 156, 0, 156, ! 0, 26, 3, 0, 164, 260, 0, 164, 95, 201, ! 110, 0, 164, 49, 0, 65, 168, 0, 0, 0, ! 169, 0, 168, 62, 169, 0, 168, 1, 0, 95, ! 201, 110, 0, 49, 0, 171, 95, 201, 110, 0, ! 171, 49, 0, 308, 95, 201, 110, 0, 308, 49, ! 0, 322, 95, 201, 110, 0, 322, 49, 0, 1, ! 0, 3, 0, 4, 0, 5, 0, 59, 0, 60, ! 0, 3, 0, 59, 0, 60, 0, 106, 0, 105, ! 0, 107, 0, 0, 50, 182, 239, 63, 174, 183, ! 0, 0, 50, 182, 230, 227, 175, 183, 0, 0, ! 50, 182, 312, 176, 183, 0, 0, 50, 182, 156, ! 177, 183, 0, 0, 7, 50, 182, 239, 63, 178, ! 183, 0, 0, 7, 50, 182, 230, 227, 179, 183, ! 0, 0, 7, 50, 182, 312, 180, 183, 0, 0, ! 7, 50, 182, 156, 181, 183, 0, 0, 0, 59, ! 77, 189, 188, 187, 0, 4, 77, 189, 188, 187, ! 0, 186, 0, 184, 0, 170, 77, 189, 78, 187, ! 0, 5, 77, 189, 188, 187, 0, 0, 78, 0, ! 80, 0, 0, 190, 0, 191, 0, 190, 62, 191, ! 0, 229, 0, 59, 0, 329, 59, 0, 208, 0, ! 320, 50, 170, 0, 82, 0, 81, 0, 89, 0, ! 90, 0, 112, 0, 200, 0, 207, 0, 49, 0, ! 95, 193, 110, 0, 49, 0, 95, 197, 110, 0, ! 0, 197, 0, 1, 0, 0, 374, 227, 244, 253, ! 67, 198, 261, 0, 193, 0, 111, 0, 337, 335, ! 111, 0, 337, 335, 1, 111, 0, 337, 1, 111, ! 0, 207, 62, 207, 0, 207, 62, 1, 0, 200, ! 62, 207, 0, 200, 62, 1, 0, 207, 0, 200, ! 0, 218, 0, 120, 206, 0, 83, 206, 0, 73, ! 206, 0, 91, 206, 0, 192, 206, 0, 70, 170, ! 0, 236, 202, 0, 236, 95, 229, 110, 0, 237, ! 202, 0, 237, 95, 229, 110, 0, 220, 301, 0, ! 220, 301, 204, 0, 220, 203, 301, 0, 220, 203, ! 301, 204, 0, 220, 95, 229, 110, 0, 220, 95, ! 229, 110, 204, 0, 220, 203, 95, 229, 110, 0, ! 220, 203, 95, 229, 110, 204, 0, 221, 206, 0, ! 221, 96, 113, 206, 0, 221, 96, 193, 113, 206, ! 0, 35, 206, 0, 36, 206, 0, 95, 201, 110, ! 0, 61, 201, 111, 0, 95, 201, 110, 0, 49, ! 0, 95, 239, 110, 0, 67, 261, 0, 95, 229, ! 110, 0, 205, 95, 229, 110, 0, 202, 0, 205, ! 202, 0, 205, 61, 262, 273, 111, 0, 206, 0, ! 207, 86, 207, 0, 207, 87, 207, 0, 207, 81, ! 207, 0, 207, 82, 207, 0, 207, 83, 207, 0, ! 207, 84, 207, 0, 207, 85, 207, 0, 207, 79, ! 207, 0, 207, 80, 207, 0, 207, 76, 207, 0, ! 207, 77, 207, 0, 207, 78, 207, 0, 207, 75, ! 207, 0, 207, 74, 207, 0, 207, 73, 207, 0, ! 207, 71, 207, 0, 207, 72, 207, 0, 207, 70, ! 207, 0, 207, 69, 207, 0, 207, 68, 379, 65, ! 207, 0, 207, 67, 207, 0, 207, 66, 207, 0, ! 64, 0, 64, 207, 0, 206, 0, 208, 86, 208, ! 0, 208, 87, 208, 0, 208, 81, 208, 0, 208, ! 82, 208, 0, 208, 83, 208, 0, 208, 84, 208, ! 0, 208, 85, 208, 0, 208, 79, 208, 0, 208, ! 80, 208, 0, 208, 76, 208, 0, 208, 77, 208, ! 0, 208, 75, 208, 0, 208, 74, 208, 0, 208, ! 73, 208, 0, 208, 71, 208, 0, 208, 72, 208, ! 0, 208, 70, 208, 0, 208, 69, 208, 0, 208, ! 68, 379, 65, 208, 0, 208, 67, 208, 0, 208, ! 66, 208, 0, 64, 0, 64, 208, 0, 91, 394, ! 170, 0, 91, 394, 184, 0, 211, 0, 405, 0, ! 3, 0, 59, 0, 60, 0, 0, 6, 77, 210, ! 189, 188, 0, 405, 77, 210, 189, 188, 0, 50, ! 170, 77, 189, 188, 0, 50, 6, 77, 189, 188, ! 0, 50, 405, 77, 189, 188, 0, 209, 0, 4, ! 0, 5, 0, 215, 0, 254, 215, 0, 209, 0, ! 83, 214, 0, 73, 214, 0, 95, 214, 110, 0, ! 3, 77, 189, 188, 0, 60, 77, 190, 188, 0, ! 314, 0, 209, 0, 216, 0, 95, 214, 110, 0, ! 209, 0, 10, 0, 222, 0, 223, 0, 11, 0, ! 95, 193, 110, 0, 95, 214, 110, 0, 95, 1, ! 110, 0, 0, 95, 219, 340, 110, 0, 209, 95, ! 201, 110, 0, 209, 49, 0, 218, 95, 201, 110, ! 0, 218, 49, 0, 37, 95, 207, 62, 229, 110, ! 0, 218, 96, 193, 113, 0, 218, 89, 0, 218, ! 90, 0, 42, 0, 9, 95, 201, 110, 0, 318, ! 0, 52, 77, 229, 78, 95, 193, 110, 0, 53, ! 77, 229, 78, 95, 193, 110, 0, 54, 77, 229, ! 78, 95, 193, 110, 0, 55, 77, 229, 78, 95, ! 193, 110, 0, 51, 95, 193, 110, 0, 51, 95, ! 229, 110, 0, 329, 3, 0, 329, 211, 0, 329, ! 405, 0, 317, 0, 317, 95, 201, 110, 0, 317, ! 49, 0, 225, 212, 0, 225, 212, 95, 201, 110, ! 0, 225, 212, 49, 0, 225, 213, 0, 225, 317, ! 0, 225, 213, 95, 201, 110, 0, 225, 213, 49, ! 0, 225, 317, 95, 201, 110, 0, 225, 317, 49, ! 0, 225, 91, 8, 49, 0, 225, 8, 56, 91, ! 8, 49, 0, 225, 1, 0, 41, 0, 329, 41, ! 0, 40, 0, 329, 221, 0, 44, 0, 45, 0, ! 12, 0, 223, 12, 0, 0, 218, 94, 0, 218, ! 93, 0, 239, 241, 63, 0, 230, 241, 63, 0, ! 233, 242, 63, 0, 230, 63, 0, 233, 63, 0, ! 120, 226, 0, 306, 0, 312, 0, 49, 0, 228, ! 49, 0, 234, 333, 0, 303, 333, 0, 239, 333, ! 0, 234, 0, 303, 0, 234, 0, 231, 0, 233, ! 239, 0, 239, 232, 0, 239, 235, 232, 0, 233, ! 239, 232, 0, 233, 239, 235, 0, 233, 239, 235, ! 232, 0, 7, 0, 232, 240, 0, 232, 7, 0, ! 303, 0, 7, 0, 233, 9, 0, 233, 7, 0, ! 233, 254, 0, 239, 0, 303, 239, 0, 239, 235, ! 0, 303, 239, 235, 0, 240, 0, 235, 240, 0, ! 235, 254, 0, 254, 0, 14, 0, 30, 0, 29, ! 0, 267, 0, 8, 0, 309, 0, 238, 95, 193, ! 110, 0, 238, 95, 229, 110, 0, 31, 95, 193, ! 110, 0, 31, 95, 229, 110, 0, 8, 0, 9, ! 0, 267, 0, 249, 0, 241, 62, 245, 0, 250, ! 0, 242, 62, 245, 0, 251, 0, 243, 62, 245, ! 0, 0, 121, 95, 223, 110, 0, 0, 227, 244, ! 253, 67, 246, 261, 0, 227, 244, 253, 0, 0, ! 253, 67, 248, 261, 0, 253, 0, 227, 244, 247, ! 0, 312, 244, 247, 0, 0, 312, 244, 252, 247, ! 0, 156, 244, 253, 0, 0, 254, 0, 255, 0, ! 254, 255, 0, 32, 95, 95, 256, 110, 110, 0, ! 257, 0, 256, 62, 257, 0, 0, 258, 0, 258, ! 95, 3, 110, 0, 258, 95, 3, 62, 201, 110, ! 0, 258, 95, 201, 110, 0, 170, 0, 7, 0, ! 8, 0, 9, 0, 170, 0, 259, 62, 170, 0, ! 0, 67, 261, 0, 207, 0, 61, 111, 0, 61, ! 262, 111, 0, 61, 262, 62, 111, 0, 1, 0, ! 261, 0, 262, 62, 261, 0, 96, 207, 113, 261, ! 0, 170, 65, 261, 0, 262, 62, 170, 65, 261, ! 0, 104, 151, 153, 0, 104, 151, 364, 0, 104, ! 151, 1, 0, 0, 264, 263, 152, 0, 103, 207, ! 109, 0, 103, 1, 109, 0, 0, 266, 265, 0, ! 266, 1, 0, 0, 15, 170, 61, 268, 298, 111, ! 0, 0, 15, 61, 269, 298, 111, 0, 15, 170, ! 0, 15, 327, 0, 47, 322, 0, 0, 0, 0, ! 279, 280, 61, 270, 285, 111, 253, 271, 266, 272, ! 264, 0, 278, 0, 0, 62, 0, 0, 62, 0, ! 38, 0, 275, 7, 0, 275, 8, 0, 275, 9, ! 0, 275, 38, 0, 275, 254, 0, 275, 170, 0, ! 275, 320, 170, 0, 275, 329, 320, 170, 0, 275, ! 329, 170, 0, 275, 185, 0, 275, 320, 185, 0, ! 275, 329, 320, 185, 0, 276, 0, 275, 172, 0, ! 277, 0, 276, 61, 0, 276, 65, 0, 277, 61, ! 0, 277, 65, 0, 275, 172, 61, 0, 275, 172, ! 65, 0, 275, 61, 0, 0, 65, 394, 0, 65, ! 394, 281, 0, 282, 0, 281, 62, 394, 282, 0, ! 283, 0, 284, 394, 283, 0, 322, 0, 308, 0, ! 39, 394, 0, 7, 394, 0, 284, 39, 394, 0, ! 284, 7, 394, 0, 0, 287, 0, 285, 286, 287, ! 0, 285, 286, 0, 39, 65, 0, 288, 0, 287, ! 288, 0, 289, 63, 0, 289, 111, 0, 163, 65, ! 0, 163, 97, 0, 163, 26, 0, 163, 61, 0, ! 63, 0, 120, 288, 0, 140, 288, 0, 140, 230, ! 63, 0, 396, 0, 230, 290, 0, 233, 291, 0, ! 312, 244, 253, 260, 0, 156, 244, 253, 260, 0, ! 65, 207, 0, 1, 0, 233, 162, 244, 253, 260, ! 0, 162, 244, 253, 260, 0, 130, 0, 0, 292, ! 0, 290, 62, 293, 0, 0, 295, 0, 291, 62, ! 297, 0, 294, 0, 295, 0, 296, 0, 297, 0, ! 306, 244, 253, 260, 0, 4, 65, 207, 253, 0, ! 312, 244, 253, 260, 0, 156, 244, 253, 260, 0, ! 3, 65, 207, 253, 0, 65, 207, 253, 0, 306, ! 244, 253, 260, 0, 4, 65, 207, 253, 0, 312, ! 244, 253, 260, 0, 3, 65, 207, 253, 0, 65, ! 207, 253, 0, 299, 274, 0, 274, 0, 300, 0, ! 299, 62, 300, 0, 170, 0, 170, 67, 207, 0, ! 374, 330, 0, 374, 0, 95, 229, 110, 96, 193, ! 113, 0, 0, 302, 9, 0, 9, 0, 303, 9, ! 0, 254, 0, 303, 254, 0, 95, 201, 110, 0, ! 95, 384, 110, 0, 49, 0, 95, 1, 110, 0, ! 306, 0, 254, 306, 0, 83, 303, 305, 0, 73, ! 303, 305, 0, 83, 305, 0, 73, 305, 0, 328, ! 302, 305, 0, 307, 0, 307, 304, 302, 399, 0, ! 307, 96, 193, 113, 0, 307, 96, 113, 0, 95, ! 305, 110, 0, 320, 319, 0, 319, 0, 319, 0, ! 329, 319, 0, 308, 0, 310, 0, 329, 310, 0, ! 320, 319, 0, 312, 0, 254, 312, 0, 83, 303, ! 311, 0, 73, 303, 311, 0, 83, 311, 0, 73, ! 311, 0, 328, 302, 311, 0, 217, 0, 83, 303, ! 311, 0, 73, 303, 311, 0, 83, 313, 0, 73, ! 313, 0, 328, 302, 311, 0, 314, 0, 217, 304, ! 302, 399, 0, 95, 313, 110, 0, 217, 96, 193, ! 113, 0, 217, 96, 113, 0, 316, 0, 329, 316, ! 0, 329, 209, 0, 320, 216, 0, 320, 213, 0, ! 320, 212, 0, 320, 209, 0, 320, 212, 0, 316, ! 0, 329, 316, 0, 239, 95, 201, 110, 0, 239, ! 95, 214, 110, 0, 239, 228, 0, 4, 0, 5, ! 0, 184, 0, 321, 0, 320, 321, 0, 320, 50, ! 326, 56, 0, 320, 3, 56, 0, 320, 59, 56, ! 0, 4, 56, 0, 5, 56, 0, 60, 56, 0, ! 184, 56, 0, 323, 0, 329, 323, 0, 324, 170, ! 0, 324, 184, 0, 324, 326, 0, 324, 50, 326, ! 0, 325, 0, 324, 325, 0, 324, 326, 56, 0, ! 324, 50, 326, 56, 0, 4, 56, 0, 5, 56, ! 0, 184, 56, 0, 59, 56, 0, 3, 56, 0, ! 60, 56, 0, 170, 77, 189, 188, 0, 329, 319, ! 0, 310, 0, 329, 310, 0, 320, 83, 0, 329, ! 320, 83, 0, 56, 0, 83, 302, 330, 0, 83, ! 302, 0, 73, 302, 330, 0, 73, 302, 0, 328, ! 302, 0, 328, 302, 330, 0, 331, 0, 96, 193, ! 113, 0, 331, 96, 193, 113, 0, 333, 0, 254, ! 333, 0, 83, 303, 332, 0, 83, 332, 0, 83, ! 303, 0, 83, 0, 73, 303, 332, 0, 73, 332, ! 0, 73, 303, 0, 73, 0, 328, 302, 0, 328, ! 302, 332, 0, 334, 0, 95, 332, 110, 0, 334, ! 95, 384, 110, 302, 399, 0, 334, 49, 302, 399, ! 0, 334, 96, 193, 113, 0, 334, 96, 113, 0, ! 95, 385, 110, 302, 399, 0, 205, 302, 399, 0, ! 228, 302, 399, 0, 96, 193, 113, 0, 96, 113, ! 0, 348, 0, 336, 0, 335, 348, 0, 335, 336, ! 0, 1, 63, 0, 0, 338, 0, 339, 0, 338, ! 339, 0, 34, 259, 63, 0, 0, 406, 61, 341, ! 199, 0, 340, 0, 0, 0, 16, 344, 195, 345, ! 346, 0, 342, 0, 0, 347, 406, 349, 0, 342, ! 0, 406, 349, 0, 226, 0, 193, 63, 0, 0, ! 343, 17, 350, 346, 0, 343, 0, 0, 0, 18, ! 351, 195, 352, 346, 0, 0, 0, 19, 353, 346, ! 18, 354, 194, 63, 0, 0, 0, 0, 0, 20, ! 355, 95, 377, 356, 196, 63, 357, 379, 110, 358, ! 346, 0, 0, 0, 21, 359, 95, 197, 110, 360, ! 346, 0, 0, 22, 207, 65, 361, 348, 0, 0, ! 22, 207, 13, 207, 65, 362, 348, 0, 0, 23, ! 65, 363, 348, 0, 24, 63, 0, 25, 63, 0, ! 26, 63, 0, 26, 193, 63, 0, 121, 378, 95, ! 223, 110, 63, 0, 121, 378, 95, 223, 65, 380, ! 110, 63, 0, 121, 378, 95, 223, 65, 380, 65, ! 380, 110, 63, 0, 121, 378, 95, 223, 56, 380, ! 110, 63, 0, 121, 378, 95, 223, 65, 380, 65, ! 380, 65, 383, 110, 63, 0, 121, 378, 95, 223, ! 56, 380, 65, 383, 110, 63, 0, 121, 378, 95, ! 223, 65, 380, 56, 383, 110, 63, 0, 27, 83, ! 193, 63, 0, 27, 170, 63, 0, 376, 348, 0, ! 376, 111, 0, 63, 0, 367, 0, 132, 0, 131, ! 0, 128, 0, 0, 0, 97, 365, 153, 366, 370, ! 0, 0, 0, 97, 368, 342, 369, 370, 0, 371, ! 0, 370, 371, 0, 0, 0, 0, 98, 372, 375, ! 373, 342, 0, 234, 0, 303, 0, 95, 13, 110, ! 0, 95, 393, 110, 0, 3, 65, 0, 59, 65, ! 0, 4, 65, 0, 5, 65, 0, 379, 63, 0, ! 226, 0, 61, 199, 0, 0, 9, 0, 0, 193, ! 0, 1, 0, 0, 381, 0, 382, 0, 381, 62, ! 382, 0, 12, 95, 193, 110, 0, 96, 170, 113, ! 12, 95, 193, 110, 0, 223, 0, 383, 62, 223, ! 0, 0, 385, 0, 229, 0, 389, 0, 390, 13, ! 0, 389, 13, 0, 229, 13, 0, 13, 0, 389, ! 65, 0, 229, 65, 0, 0, 67, 387, 388, 0, ! 102, 0, 261, 0, 391, 0, 393, 386, 0, 390, ! 392, 0, 390, 395, 0, 390, 395, 67, 261, 0, ! 389, 62, 0, 229, 62, 0, 231, 227, 0, 234, ! 227, 0, 239, 227, 0, 231, 333, 0, 231, 0, ! 233, 312, 0, 393, 0, 393, 386, 0, 391, 0, ! 229, 0, 0, 0, 312, 0, 3, 397, 3, 398, ! 63, 0, 77, 189, 188, 0, 0, 95, 201, 110, ! 0, 0, 0, 64, 95, 401, 110, 0, 64, 49, ! 0, 229, 0, 1, 0, 400, 0, 401, 62, 400, ! 0, 0, 83, 302, 402, 0, 73, 302, 402, 0, ! 328, 302, 402, 0, 43, 0, 0, 403, 83, 404, ! 0, 403, 84, 404, 0, 403, 85, 404, 0, 403, ! 81, 404, 0, 403, 82, 404, 0, 403, 73, 404, ! 0, 403, 71, 404, 0, 403, 72, 404, 0, 403, ! 91, 404, 0, 403, 62, 404, 0, 403, 76, 404, ! 0, 403, 77, 404, 0, 403, 78, 404, 0, 403, ! 75, 404, 0, 403, 66, 404, 0, 403, 67, 404, ! 0, 403, 79, 404, 0, 403, 80, 404, 0, 403, ! 89, 404, 0, 403, 90, 404, 0, 403, 70, 404, ! 0, 403, 69, 404, 0, 403, 112, 404, 0, 403, ! 68, 65, 404, 0, 403, 74, 404, 0, 403, 93, ! 404, 0, 403, 86, 404, 0, 403, 49, 404, 0, ! 403, 96, 113, 404, 0, 403, 41, 404, 0, 403, ! 40, 404, 0, 403, 41, 96, 113, 404, 0, 403, ! 40, 96, 113, 404, 0, 403, 374, 402, 404, 0, ! 403, 1, 404, 0, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 454, 457, 465, 465, 469, 473, 475, 478, 483, ! 487, 493, 497, 497, 505, 508, 511, 511, 515, 517, ! 520, 522, 524, 526, 526, 530, 530, 534, 535, 537, ! 538, 542, 542, 554, 557, 559, 563, 566, 568, 572, ! 572, 587, 594, 603, 605, 606, 608, 612, 615, 621, ! 621, 628, 634, 636, 639, 642, 646, 649, 653, 656, ! 660, 665, 675, 677, 679, 681, 683, 697, 700, 704, ! 707, 709, 711, 714, 717, 721, 723, 725, 727, 737, ! 739, 741, 743, 745, 746, 753, 754, 755, 757, 758, ! 761, 763, 766, 768, 769, 772, 774, 780, 780, 791, ! 794, 796, 800, 800, 805, 809, 809, 813, 817, 817, ! 821, 825, 825, 829, 835, 840, 843, 846, 849, 857, ! 860, 863, 865, 867, 869, 875, 884, 887, 889, 891, ! 894, 896, 901, 908, 911, 913, 917, 929, 936, 942, ! 947, 958, 961, 968, 976, 978, 981, 983, 986, 988, ! 991, 995, 997, 998, 999, 1000, 1003, 1005, 1006, 1009, ! 1011, 1012, 1015, 1015, 1020, 1020, 1024, 1024, 1027, 1027, ! 1030, 1030, 1035, 1035, 1041, 1041, 1045, 1045, 1051, 1055, ! 1063, 1067, 1070, 1073, 1075, 1080, 1086, 1096, 1098, 1106, ! 1109, 1112, 1115, 1119, 1122, 1128, 1134, 1135, 1147, 1150, ! 1152, 1154, 1156, 1160, 1163, 1166, 1171, 1175, 1180, 1184, ! 1187, 1188, 1192, 1192, 1215, 1218, 1220, 1221, 1222, 1225, ! 1229, 1232, 1234, 1238, 1241, 1244, 1248, 1251, 1253, 1255, ! 1257, 1260, 1262, 1265, 1269, 1272, 1279, 1282, 1285, 1288, ! 1291, 1296, 1299, 1302, 1306, 1308, 1312, 1316, 1318, 1322, ! 1325, 1330, 1333, 1335, 1345, 1359, 1364, 1370, 1372, 1374, ! 1387, 1390, 1392, 1394, 1396, 1398, 1400, 1402, 1404, 1406, ! 1408, 1410, 1412, 1414, 1416, 1418, 1420, 1422, 1424, 1426, ! 1428, 1430, 1434, 1436, 1438, 1442, 1445, 1447, 1449, 1451, ! 1453, 1455, 1457, 1459, 1461, 1463, 1465, 1467, 1469, 1471, ! 1473, 1475, 1477, 1479, 1481, 1483, 1487, 1489, 1491, 1495, ! 1498, 1500, 1501, 1502, 1503, 1504, 1507, 1520, 1523, 1527, ! 1530, 1532, 1537, 1539, 1540, 1543, 1545, 1553, 1555, 1557, ! 1559, 1563, 1566, 1570, 1574, 1575, 1576, 1580, 1588, 1589, ! 1590, 1600, 1606, 1608, 1611, 1613, 1613, 1629, 1631, 1633, ! 1635, 1637, 1640, 1642, 1644, 1647, 1649, 1660, 1661, 1665, ! 1669, 1673, 1677, 1679, 1683, 1685, 1687, 1695, 1697, 1699, ! 1701, 1705, 1707, 1709, 1711, 1716, 1718, 1720, 1722, 1725, ! 1727, 1729, 1773, 1776, 1780, 1783, 1787, 1790, 1795, 1797, ! 1801, 1809, 1812, 1819, 1825, 1829, 1831, 1836, 1838, 1845, ! 1847, 1851, 1855, 1861, 1865, 1868, 1872, 1875, 1885, 1888, ! 1892, 1896, 1899, 1902, 1905, 1908, 1914, 1920, 1922, 1943, ! 1946, 1951, 1956, 1964, 1974, 1978, 1981, 1984, 1989, 1992, ! 1994, 1996, 2000, 2004, 2008, 2016, 2019, 2021, 2023, 2027, ! 2031, 2046, 2065, 2068, 2070, 2073, 2075, 2079, 2081, 2085, ! 2087, 2091, 2094, 2098, 2098, 2104, 2117, 2117, 2125, 2131, ! 2136, 2141, 2141, 2150, 2157, 2160, 2164, 2167, 2171, 2176, ! 2179, 2183, 2186, 2188, 2190, 2192, 2199, 2201, 2202, 2203, ! 2207, 2210, 2214, 2217, 2224, 2226, 2229, 2232, 2235, 2241, ! 2244, 2247, 2249, 2251, 2255, 2261, 2266, 2272, 2274, 2279, ! 2282, 2286, 2288, 2290, 2294, 2294, 2304, 2304, 2313, 2316, ! 2319, 2325, 2325, 2325, 2325, 2371, 2379, 2381, 2384, 2386, ! 2391, 2393, 2395, 2397, 2399, 2401, 2405, 2411, 2416, 2421, ! 2428, 2434, 2439, 2446, 2453, 2459, 2466, 2474, 2481, 2492, ! 2503, 2511, 2519, 2530, 2533, 2536, 2540, 2542, 2546, 2549, ! 2553, 2557, 2561, 2563, 2567, 2578, 2592, 2593, 2594, 2595, ! 2598, 2607, 2614, 2622, 2624, 2629, 2631, 2633, 2635, 2637, ! 2639, 2642, 2652, 2657, 2661, 2686, 2692, 2694, 2696, 2698, ! 2709, 2714, 2716, 2722, 2725, 2732, 2742, 2745, 2752, 2762, ! 2764, 2767, 2769, 2772, 2776, 2781, 2785, 2788, 2791, 2796, ! 2799, 2803, 2806, 2808, 2812, 2814, 2821, 2823, 2826, 2829, ! 2834, 2838, 2843, 2853, 2856, 2860, 2864, 2867, 2870, 2879, ! 2882, 2884, 2886, 2892, 2894, 2903, 2906, 2908, 2910, 2912, ! 2916, 2919, 2922, 2924, 2926, 2928, 2932, 2935, 2946, 2956, ! 2958, 2959, 2963, 2971, 2973, 2981, 2984, 2986, 2988, 2990, ! 2994, 2997, 3000, 3002, 3004, 3006, 3010, 3013, 3016, 3018, ! 3020, 3022, 3024, 3026, 3030, 3037, 3041, 3046, 3050, 3055, ! 3057, 3061, 3064, 3066, 3070, 3072, 3073, 3076, 3078, 3080, ! 3084, 3087, 3094, 3105, 3111, 3117, 3121, 3123, 3127, 3141, ! 3143, 3145, 3149, 3157, 3170, 3173, 3180, 3193, 3199, 3201, ! 3202, 3203, 3211, 3216, 3225, 3226, 3230, 3233, 3239, 3245, ! 3248, 3250, 3252, 3254, 3258, 3262, 3266, 3269, 3273, 3275, ! 3284, 3287, 3289, 3291, 3293, 3295, 3297, 3299, 3301, 3305, ! 3309, 3313, 3317, 3319, 3321, 3323, 3325, 3327, 3329, 3331, ! 3333, 3341, 3343, 3344, 3345, 3348, 3354, 3356, 3361, 3363, ! 3366, 3377, 3377, 3385, 3390, 3390, 3390, 3401, 3403, 3403, ! 3411, 3413, 3417, 3421, 3423, 3423, 3431, 3434, 3434, 3434, ! 3444, 3444, 3444, 3454, 3454, 3454, 3454, 3454, 3465, 3465, ! 3465, 3472, 3472, 3476, 3476, 3480, 3480, 3484, 3486, 3488, ! 3490, 3492, 3497, 3500, 3503, 3506, 3509, 3512, 3515, 3521, ! 3523, 3525, 3529, 3532, 3534, 3536, 3539, 3543, 3543, 3543, ! 3552, 3552, 3552, 3561, 3563, 3564, 3575, 3575, 3575, 3584, ! 3586, 3589, 3606, 3614, 3617, 3619, 3621, 3625, 3628, 3629, ! 3637, 3640, 3643, 3646, 3647, 3653, 3656, 3659, 3661, 3665, ! 3668, 3672, 3675, 3685, 3690, 3691, 3698, 3701, 3704, 3706, ! 3709, 3711, 3721, 3735, 3735, 3742, 3744, 3748, 3752, 3755, ! 3758, 3760, 3764, 3766, 3773, 3779, 3782, 3786, 3789, 3792, ! 3797, 3801, 3806, 3808, 3811, 3816, 3822, 3838, 3846, 3849, ! 3852, 3855, 3858, 3861, 3863, 3867, 3873, 3877, 3880, 3884, ! 3887, 3889, 3891, 3897, 3910, 3918, 3921, 3923, 3925, 3927, ! 3929, 3931, 3933, 3935, 3937, 3939, 3941, 3943, 3945, 3947, ! 3949, 3951, 3953, 3955, 3957, 3959, 3961, 3963, 3965, 3967, ! 3969, 3971, 3973, 3975, 3977, 3979, 3981, 3983, 3985, 3987, ! 3994 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "IDENTIFIER", "tTYPENAME", "SELFNAME", "PFUNCNAME", "SCSPEC", "TYPESPEC", "CV_QUALIFIER", "CONSTANT", "VAR_FUNC_NAME", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", --- 629,1167 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, ! 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, 64, 67, 69, 70, ! 74, 75, 78, 79, 80, 86, 87, 89, 90, 91, ! 92, 96, 97, 98, 99, 100, 101, 102, 103, 104, ! 105, 106, 107, 108, 109 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned short yyprhs[] = { ! 0, 0, 3, 4, 6, 7, 10, 13, 15, 16, ! 17, 18, 20, 22, 23, 26, 29, 31, 32, 36, ! 38, 44, 49, 55, 60, 61, 68, 69, 75, 77, ! 80, 82, 85, 86, 93, 96, 100, 104, 108, 112, ! 117, 118, 124, 127, 131, 133, 135, 138, 141, 143, ! 146, 147, 153, 157, 159, 161, 163, 167, 169, 170, ! 173, 176, 180, 182, 186, 188, 192, 194, 198, 201, ! 204, 207, 209, 211, 217, 222, 225, 228, 232, 236, ! 239, 242, 246, 250, 253, 256, 259, 262, 265, 268, ! 270, 272, 274, 276, 277, 279, 282, 283, 285, 286, ! 293, 297, 301, 305, 306, 315, 321, 322, 332, 339, ! 340, 349, 355, 356, 366, 373, 376, 379, 381, 384, ! 386, 393, 402, 407, 414, 421, 426, 429, 431, 434, ! 437, 439, 442, 444, 447, 450, 455, 458, 461, 462, ! 463, 465, 469, 472, 476, 478, 483, 486, 491, 494, ! 499, 502, 504, 506, 508, 510, 512, 514, 516, 518, ! 520, 522, 524, 526, 527, 534, 535, 542, 543, 549, ! 550, 556, 557, 565, 566, 574, 575, 582, 583, 590, ! 591, 592, 598, 604, 606, 608, 614, 620, 621, 623, ! 625, 626, 628, 630, 634, 636, 638, 641, 643, 647, ! 649, 651, 653, 655, 657, 659, 661, 663, 667, 669, ! 673, 674, 676, 678, 679, 687, 689, 691, 695, 700, ! 704, 708, 712, 716, 720, 722, 724, 726, 729, 732, ! 735, 738, 741, 744, 747, 752, 755, 760, 763, 767, ! 771, 776, 781, 787, 793, 800, 803, 808, 814, 817, ! 820, 824, 828, 832, 834, 838, 841, 845, 850, 852, ! 855, 861, 863, 867, 871, 875, 879, 883, 887, 891, ! 895, 899, 903, 907, 911, 915, 919, 923, 927, 931, ! 935, 939, 945, 949, 953, 955, 958, 960, 964, 968, ! 972, 976, 980, 984, 988, 992, 996, 1000, 1004, 1008, ! 1012, 1016, 1020, 1024, 1028, 1032, 1038, 1042, 1046, 1048, ! 1051, 1055, 1059, 1061, 1063, 1065, 1067, 1069, 1070, 1076, ! 1082, 1088, 1094, 1100, 1102, 1104, 1106, 1108, 1111, 1113, ! 1116, 1119, 1123, 1128, 1133, 1135, 1137, 1139, 1143, 1145, ! 1147, 1149, 1151, 1153, 1157, 1161, 1165, 1166, 1171, 1176, ! 1179, 1184, 1187, 1194, 1199, 1202, 1205, 1207, 1212, 1214, ! 1222, 1230, 1238, 1246, 1251, 1256, 1259, 1262, 1265, 1267, ! 1272, 1275, 1278, 1284, 1288, 1291, 1294, 1300, 1304, 1310, ! 1314, 1319, 1326, 1329, 1331, 1334, 1336, 1339, 1341, 1343, ! 1345, 1348, 1349, 1352, 1355, 1359, 1363, 1367, 1370, 1373, ! 1376, 1378, 1380, 1382, 1385, 1388, 1391, 1394, 1396, 1398, ! 1400, 1402, 1405, 1408, 1412, 1416, 1420, 1425, 1427, 1430, ! 1433, 1435, 1437, 1440, 1443, 1446, 1448, 1451, 1454, 1458, ! 1460, 1463, 1466, 1468, 1470, 1472, 1474, 1476, 1478, 1480, ! 1485, 1490, 1495, 1500, 1502, 1504, 1506, 1508, 1512, 1514, ! 1518, 1520, 1524, 1525, 1530, 1531, 1538, 1542, 1543, 1548, ! 1550, 1554, 1558, 1559, 1564, 1568, 1569, 1571, 1573, 1576, ! 1583, 1585, 1589, 1590, 1592, 1597, 1604, 1609, 1611, 1613, ! 1615, 1617, 1619, 1623, 1624, 1627, 1629, 1632, 1636, 1641, ! 1643, 1645, 1649, 1654, 1658, 1664, 1668, 1672, 1676, 1677, ! 1681, 1685, 1689, 1690, 1693, 1696, 1697, 1704, 1705, 1711, ! 1714, 1717, 1720, 1721, 1722, 1723, 1735, 1737, 1738, 1740, ! 1741, 1743, 1745, 1748, 1751, 1754, 1757, 1760, 1763, 1767, ! 1772, 1776, 1779, 1783, 1788, 1790, 1793, 1795, 1798, 1801, ! 1804, 1807, 1811, 1815, 1818, 1819, 1822, 1826, 1828, 1833, ! 1835, 1839, 1841, 1843, 1846, 1849, 1853, 1857, 1858, 1860, ! 1864, 1867, 1870, 1872, 1875, 1878, 1881, 1884, 1887, 1890, ! 1893, 1895, 1898, 1901, 1905, 1907, 1910, 1913, 1918, 1923, ! 1926, 1928, 1934, 1939, 1941, 1942, 1944, 1948, 1949, 1951, ! 1955, 1957, 1959, 1961, 1963, 1968, 1973, 1978, 1983, 1988, ! 1992, 1997, 2002, 2007, 2012, 2016, 2019, 2021, 2023, 2027, ! 2029, 2033, 2036, 2038, 2045, 2046, 2049, 2051, 2054, 2056, ! 2059, 2063, 2067, 2069, 2073, 2075, 2078, 2082, 2086, 2089, ! 2092, 2096, 2098, 2103, 2108, 2112, 2116, 2119, 2121, 2123, ! 2126, 2128, 2130, 2133, 2136, 2138, 2141, 2145, 2149, 2152, ! 2155, 2159, 2161, 2165, 2169, 2172, 2175, 2179, 2181, 2186, ! 2190, 2195, 2199, 2201, 2204, 2207, 2210, 2213, 2216, 2219, ! 2222, 2224, 2227, 2232, 2237, 2240, 2242, 2244, 2246, 2248, ! 2251, 2256, 2260, 2264, 2267, 2270, 2273, 2276, 2278, 2281, ! 2284, 2287, 2290, 2294, 2296, 2299, 2303, 2308, 2311, 2314, ! 2317, 2320, 2323, 2326, 2331, 2334, 2336, 2339, 2342, 2346, ! 2348, 2352, 2355, 2359, 2362, 2365, 2369, 2371, 2375, 2380, ! 2382, 2385, 2389, 2392, 2395, 2397, 2401, 2404, 2407, 2409, ! 2412, 2416, 2418, 2422, 2429, 2434, 2439, 2443, 2449, 2453, ! 2457, 2461, 2464, 2466, 2468, 2471, 2474, 2477, 2478, 2480, ! 2482, 2485, 2489, 2490, 2495, 2497, 2498, 2499, 2505, 2507, ! 2508, 2512, 2514, 2517, 2519, 2522, 2523, 2528, 2530, 2531, ! 2532, 2538, 2539, 2540, 2548, 2549, 2550, 2551, 2552, 2565, ! 2566, 2567, 2575, 2576, 2582, 2583, 2591, 2592, 2597, 2600, ! 2603, 2606, 2610, 2617, 2626, 2637, 2646, 2659, 2670, 2681, ! 2686, 2690, 2693, 2696, 2698, 2700, 2702, 2704, 2706, 2707, ! 2708, 2714, 2715, 2716, 2722, 2724, 2727, 2728, 2729, 2730, ! 2736, 2738, 2740, 2744, 2748, 2751, 2754, 2757, 2760, 2763, ! 2765, 2768, 2769, 2771, 2772, 2774, 2776, 2777, 2779, 2781, ! 2785, 2790, 2798, 2800, 2804, 2805, 2807, 2809, 2811, 2814, ! 2817, 2820, 2822, 2825, 2828, 2829, 2833, 2835, 2837, 2839, ! 2842, 2845, 2848, 2853, 2856, 2859, 2862, 2865, 2868, 2871, ! 2873, 2876, 2878, 2881, 2883, 2885, 2886, 2887, 2889, 2895, ! 2899, 2900, 2904, 2905, 2906, 2911, 2914, 2916, 2918, 2920, ! 2924, 2925, 2929, 2933, 2937, 2939, 2940, 2944, 2948, 2952, ! 2956, 2960, 2964, 2968, 2972, 2976, 2980, 2984, 2988, 2992, ! 2996, 3000, 3004, 3008, 3012, 3016, 3020, 3024, 3028, 3032, ! 3037, 3041, 3045, 3049, 3053, 3058, 3062, 3066, 3072, 3078, ! 3083, 3087 }; + + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const short yyrhs[] = { ! 115, 0, -1, -1, 116, -1, -1, 117, 123, -1, ! 116, 123, -1, 116, -1, -1, -1, -1, 33, -1, ! 28, -1, -1, 124, 125, -1, 156, 153, -1, 150, ! -1, -1, 57, 126, 147, -1, 147, -1, 122, 94, ! 224, 110, 63, -1, 137, 61, 118, 111, -1, 137, ! 119, 156, 120, 153, -1, 137, 119, 150, 120, -1, ! -1, 46, 171, 61, 127, 118, 111, -1, -1, 46, ! 61, 128, 118, 111, -1, 129, -1, 131, 63, -1, ! 133, -1, 121, 125, -1, -1, 46, 171, 66, 130, ! 136, 63, -1, 48, 316, -1, 48, 330, 316, -1, ! 48, 330, 214, -1, 48, 135, 171, -1, 48, 330, ! 171, -1, 48, 330, 135, 171, -1, -1, 48, 46, ! 134, 136, 63, -1, 59, 56, -1, 135, 59, 56, ! -1, 214, -1, 316, -1, 330, 316, -1, 330, 214, ! -1, 99, -1, 137, 99, -1, -1, 50, 76, 139, ! 142, 77, -1, 50, 76, 77, -1, 138, -1, 140, ! -1, 146, -1, 142, 62, 146, -1, 171, -1, -1, ! 276, 143, -1, 47, 143, -1, 138, 276, 143, -1, ! 144, -1, 144, 66, 230, -1, 394, -1, 394, 66, ! 209, -1, 145, -1, 145, 66, 192, -1, 141, 148, ! -1, 141, 1, -1, 156, 153, -1, 149, -1, 147, ! -1, 137, 119, 156, 120, 153, -1, 137, 119, 149, ! 120, -1, 121, 148, -1, 244, 63, -1, 234, 243, ! 63, -1, 231, 242, 63, -1, 268, 63, -1, 244, ! 63, -1, 234, 243, 63, -1, 231, 242, 63, -1, ! 234, 63, -1, 174, 63, -1, 231, 63, -1, 1, ! 63, -1, 1, 111, -1, 1, 109, -1, 63, -1, ! 397, -1, 225, -1, 167, -1, -1, 166, -1, 166, ! 63, -1, -1, 109, -1, -1, 168, 151, 407, 61, ! 155, 200, -1, 162, 152, 154, -1, 162, 152, 365, ! -1, 162, 152, 1, -1, -1, 321, 5, 94, 158, ! 385, 110, 303, 400, -1, 321, 5, 49, 303, 400, ! -1, -1, 330, 321, 5, 94, 159, 385, 110, 303, ! 400, -1, 330, 321, 5, 49, 303, 400, -1, -1, ! 321, 187, 94, 160, 385, 110, 303, 400, -1, 321, ! 187, 49, 303, 400, -1, -1, 330, 321, 187, 94, ! 161, 385, 110, 303, 400, -1, 330, 321, 187, 49, ! 303, 400, -1, 231, 228, -1, 234, 313, -1, 313, ! -1, 234, 157, -1, 157, -1, 5, 94, 385, 110, ! 303, 400, -1, 94, 5, 110, 94, 385, 110, 303, ! 400, -1, 5, 49, 303, 400, -1, 94, 5, 110, ! 49, 303, 400, -1, 187, 94, 385, 110, 303, 400, ! -1, 187, 49, 303, 400, -1, 234, 163, -1, 163, ! -1, 231, 228, -1, 234, 313, -1, 313, -1, 234, ! 157, -1, 157, -1, 26, 3, -1, 165, 261, -1, ! 165, 94, 202, 110, -1, 165, 49, -1, 65, 169, ! -1, -1, -1, 170, -1, 169, 62, 170, -1, 169, ! 1, -1, 94, 202, 110, -1, 49, -1, 172, 94, ! 202, 110, -1, 172, 49, -1, 309, 94, 202, 110, ! -1, 309, 49, -1, 323, 94, 202, 110, -1, 323, ! 49, -1, 1, -1, 3, -1, 4, -1, 5, -1, ! 60, -1, 59, -1, 3, -1, 60, -1, 59, -1, ! 106, -1, 105, -1, 107, -1, -1, 50, 183, 240, ! 63, 175, 184, -1, -1, 50, 183, 231, 228, 176, ! 184, -1, -1, 50, 183, 313, 177, 184, -1, -1, ! 50, 183, 157, 178, 184, -1, -1, 7, 50, 183, ! 240, 63, 179, 184, -1, -1, 7, 50, 183, 231, ! 228, 180, 184, -1, -1, 7, 50, 183, 313, 181, ! 184, -1, -1, 7, 50, 183, 157, 182, 184, -1, ! -1, -1, 60, 76, 190, 189, 188, -1, 4, 76, ! 190, 189, 188, -1, 187, -1, 185, -1, 171, 76, ! 190, 77, 188, -1, 5, 76, 190, 189, 188, -1, ! -1, 77, -1, 79, -1, -1, 191, -1, 192, -1, ! 191, 62, 192, -1, 230, -1, 60, -1, 330, 60, ! -1, 209, -1, 321, 50, 171, -1, 82, -1, 81, ! -1, 90, -1, 89, -1, 112, -1, 201, -1, 208, ! -1, 49, -1, 94, 194, 110, -1, 49, -1, 94, ! 198, 110, -1, -1, 198, -1, 1, -1, -1, 375, ! 228, 245, 254, 66, 199, 262, -1, 194, -1, 111, ! -1, 338, 336, 111, -1, 338, 336, 1, 111, -1, ! 338, 1, 111, -1, 208, 62, 208, -1, 208, 62, ! 1, -1, 201, 62, 208, -1, 201, 62, 1, -1, ! 208, -1, 201, -1, 219, -1, 121, 207, -1, 83, ! 207, -1, 73, 207, -1, 88, 207, -1, 193, 207, ! -1, 70, 171, -1, 237, 203, -1, 237, 94, 230, ! 110, -1, 238, 203, -1, 238, 94, 230, 110, -1, ! 221, 302, -1, 221, 302, 205, -1, 221, 204, 302, ! -1, 221, 204, 302, 205, -1, 221, 94, 230, 110, ! -1, 221, 94, 230, 110, 205, -1, 221, 204, 94, ! 230, 110, -1, 221, 204, 94, 230, 110, 205, -1, ! 222, 207, -1, 222, 95, 113, 207, -1, 222, 95, ! 194, 113, 207, -1, 35, 207, -1, 36, 207, -1, ! 94, 202, 110, -1, 61, 202, 111, -1, 94, 202, ! 110, -1, 49, -1, 94, 240, 110, -1, 66, 262, ! -1, 94, 230, 110, -1, 206, 94, 230, 110, -1, ! 203, -1, 206, 203, -1, 206, 61, 263, 274, 111, ! -1, 207, -1, 208, 87, 208, -1, 208, 86, 208, ! -1, 208, 81, 208, -1, 208, 82, 208, -1, 208, ! 83, 208, -1, 208, 84, 208, -1, 208, 85, 208, ! -1, 208, 80, 208, -1, 208, 79, 208, -1, 208, ! 78, 208, -1, 208, 76, 208, -1, 208, 77, 208, ! -1, 208, 75, 208, -1, 208, 74, 208, -1, 208, ! 73, 208, -1, 208, 71, 208, -1, 208, 72, 208, ! -1, 208, 70, 208, -1, 208, 69, 208, -1, 208, ! 68, 380, 65, 208, -1, 208, 66, 208, -1, 208, ! 67, 208, -1, 64, -1, 64, 208, -1, 207, -1, ! 209, 87, 209, -1, 209, 86, 209, -1, 209, 81, ! 209, -1, 209, 82, 209, -1, 209, 83, 209, -1, ! 209, 84, 209, -1, 209, 85, 209, -1, 209, 80, ! 209, -1, 209, 79, 209, -1, 209, 78, 209, -1, ! 209, 76, 209, -1, 209, 75, 209, -1, 209, 74, ! 209, -1, 209, 73, 209, -1, 209, 71, 209, -1, ! 209, 72, 209, -1, 209, 70, 209, -1, 209, 69, ! 209, -1, 209, 68, 380, 65, 209, -1, 209, 66, ! 209, -1, 209, 67, 209, -1, 64, -1, 64, 209, ! -1, 88, 395, 171, -1, 88, 395, 185, -1, 212, ! -1, 406, -1, 3, -1, 60, -1, 59, -1, -1, ! 6, 76, 211, 190, 189, -1, 406, 76, 211, 190, ! 189, -1, 50, 171, 76, 190, 189, -1, 50, 6, ! 76, 190, 189, -1, 50, 406, 76, 190, 189, -1, ! 210, -1, 4, -1, 5, -1, 216, -1, 255, 216, ! -1, 210, -1, 83, 215, -1, 73, 215, -1, 94, ! 215, 110, -1, 3, 76, 190, 189, -1, 59, 76, ! 191, 189, -1, 315, -1, 210, -1, 217, -1, 94, ! 215, 110, -1, 210, -1, 10, -1, 223, -1, 224, ! -1, 11, -1, 94, 194, 110, -1, 94, 215, 110, ! -1, 94, 1, 110, -1, -1, 94, 220, 341, 110, ! -1, 210, 94, 202, 110, -1, 210, 49, -1, 219, ! 94, 202, 110, -1, 219, 49, -1, 37, 94, 208, ! 62, 230, 110, -1, 219, 95, 194, 113, -1, 219, ! 90, -1, 219, 89, -1, 42, -1, 9, 94, 202, ! 110, -1, 319, -1, 52, 76, 230, 77, 94, 194, ! 110, -1, 53, 76, 230, 77, 94, 194, 110, -1, ! 54, 76, 230, 77, 94, 194, 110, -1, 55, 76, ! 230, 77, 94, 194, 110, -1, 51, 94, 194, 110, ! -1, 51, 94, 230, 110, -1, 330, 3, -1, 330, ! 212, -1, 330, 406, -1, 318, -1, 318, 94, 202, ! 110, -1, 318, 49, -1, 226, 213, -1, 226, 213, ! 94, 202, 110, -1, 226, 213, 49, -1, 226, 214, ! -1, 226, 318, -1, 226, 214, 94, 202, 110, -1, ! 226, 214, 49, -1, 226, 318, 94, 202, 110, -1, ! 226, 318, 49, -1, 226, 88, 8, 49, -1, 226, ! 8, 56, 88, 8, 49, -1, 226, 1, -1, 41, ! -1, 330, 41, -1, 40, -1, 330, 222, -1, 44, ! -1, 45, -1, 12, -1, 224, 12, -1, -1, 219, ! 93, -1, 219, 96, -1, 240, 242, 63, -1, 231, ! 242, 63, -1, 234, 243, 63, -1, 231, 63, -1, ! 234, 63, -1, 121, 227, -1, 307, -1, 313, -1, ! 49, -1, 229, 49, -1, 235, 334, -1, 304, 334, ! -1, 240, 334, -1, 235, -1, 304, -1, 235, -1, ! 232, -1, 234, 240, -1, 240, 233, -1, 240, 236, ! 233, -1, 234, 240, 233, -1, 234, 240, 236, -1, ! 234, 240, 236, 233, -1, 7, -1, 233, 241, -1, ! 233, 7, -1, 304, -1, 7, -1, 234, 9, -1, ! 234, 7, -1, 234, 255, -1, 240, -1, 304, 240, ! -1, 240, 236, -1, 304, 240, 236, -1, 241, -1, ! 236, 241, -1, 236, 255, -1, 255, -1, 14, -1, ! 30, -1, 29, -1, 268, -1, 8, -1, 310, -1, ! 239, 94, 194, 110, -1, 239, 94, 230, 110, -1, ! 31, 94, 194, 110, -1, 31, 94, 230, 110, -1, ! 8, -1, 9, -1, 268, -1, 250, -1, 242, 62, ! 246, -1, 251, -1, 243, 62, 246, -1, 252, -1, ! 244, 62, 246, -1, -1, 122, 94, 224, 110, -1, ! -1, 228, 245, 254, 66, 247, 262, -1, 228, 245, ! 254, -1, -1, 254, 66, 249, 262, -1, 254, -1, ! 228, 245, 248, -1, 313, 245, 248, -1, -1, 313, ! 245, 253, 248, -1, 157, 245, 254, -1, -1, 255, ! -1, 256, -1, 255, 256, -1, 32, 94, 94, 257, ! 110, 110, -1, 258, -1, 257, 62, 258, -1, -1, ! 259, -1, 259, 94, 3, 110, -1, 259, 94, 3, ! 62, 202, 110, -1, 259, 94, 202, 110, -1, 171, ! -1, 7, -1, 8, -1, 9, -1, 171, -1, 260, ! 62, 171, -1, -1, 66, 262, -1, 208, -1, 61, ! 111, -1, 61, 263, 111, -1, 61, 263, 62, 111, ! -1, 1, -1, 262, -1, 263, 62, 262, -1, 95, ! 208, 113, 262, -1, 171, 65, 262, -1, 263, 62, ! 171, 65, 262, -1, 104, 152, 154, -1, 104, 152, ! 365, -1, 104, 152, 1, -1, -1, 265, 264, 153, ! -1, 103, 208, 109, -1, 103, 1, 109, -1, -1, ! 267, 266, -1, 267, 1, -1, -1, 15, 171, 61, ! 269, 299, 111, -1, -1, 15, 61, 270, 299, 111, ! -1, 15, 171, -1, 15, 328, -1, 47, 323, -1, ! -1, -1, -1, 280, 281, 61, 271, 286, 111, 254, ! 272, 267, 273, 265, -1, 279, -1, -1, 62, -1, ! -1, 62, -1, 38, -1, 276, 7, -1, 276, 8, ! -1, 276, 9, -1, 276, 38, -1, 276, 255, -1, ! 276, 171, -1, 276, 321, 171, -1, 276, 330, 321, ! 171, -1, 276, 330, 171, -1, 276, 186, -1, 276, ! 321, 186, -1, 276, 330, 321, 186, -1, 277, -1, ! 276, 173, -1, 278, -1, 277, 61, -1, 277, 65, ! -1, 278, 61, -1, 278, 65, -1, 276, 173, 61, ! -1, 276, 173, 65, -1, 276, 61, -1, -1, 65, ! 395, -1, 65, 395, 282, -1, 283, -1, 282, 62, ! 395, 283, -1, 284, -1, 285, 395, 284, -1, 323, ! -1, 309, -1, 39, 395, -1, 7, 395, -1, 285, ! 39, 395, -1, 285, 7, 395, -1, -1, 288, -1, ! 286, 287, 288, -1, 286, 287, -1, 39, 65, -1, ! 289, -1, 288, 289, -1, 290, 63, -1, 290, 111, ! -1, 164, 65, -1, 164, 98, -1, 164, 26, -1, ! 164, 61, -1, 63, -1, 121, 289, -1, 141, 289, ! -1, 141, 231, 63, -1, 397, -1, 231, 291, -1, ! 234, 292, -1, 313, 245, 254, 261, -1, 157, 245, ! 254, 261, -1, 65, 208, -1, 1, -1, 234, 163, ! 245, 254, 261, -1, 163, 245, 254, 261, -1, 131, ! -1, -1, 293, -1, 291, 62, 294, -1, -1, 296, ! -1, 292, 62, 298, -1, 295, -1, 296, -1, 297, ! -1, 298, -1, 307, 245, 254, 261, -1, 4, 65, ! 208, 254, -1, 313, 245, 254, 261, -1, 157, 245, ! 254, 261, -1, 3, 65, 208, 254, -1, 65, 208, ! 254, -1, 307, 245, 254, 261, -1, 4, 65, 208, ! 254, -1, 313, 245, 254, 261, -1, 3, 65, 208, ! 254, -1, 65, 208, 254, -1, 300, 275, -1, 275, ! -1, 301, -1, 300, 62, 301, -1, 171, -1, 171, ! 66, 208, -1, 375, 331, -1, 375, -1, 94, 230, ! 110, 95, 194, 113, -1, -1, 303, 9, -1, 9, ! -1, 304, 9, -1, 255, -1, 304, 255, -1, 94, ! 202, 110, -1, 94, 385, 110, -1, 49, -1, 94, ! 1, 110, -1, 307, -1, 255, 307, -1, 83, 304, ! 306, -1, 73, 304, 306, -1, 83, 306, -1, 73, ! 306, -1, 329, 303, 306, -1, 308, -1, 308, 305, ! 303, 400, -1, 308, 95, 194, 113, -1, 308, 95, ! 113, -1, 94, 306, 110, -1, 321, 320, -1, 320, ! -1, 320, -1, 330, 320, -1, 309, -1, 311, -1, ! 330, 311, -1, 321, 320, -1, 313, -1, 255, 313, ! -1, 83, 304, 312, -1, 73, 304, 312, -1, 83, ! 312, -1, 73, 312, -1, 329, 303, 312, -1, 218, ! -1, 83, 304, 312, -1, 73, 304, 312, -1, 83, ! 314, -1, 73, 314, -1, 329, 303, 312, -1, 315, ! -1, 218, 305, 303, 400, -1, 94, 314, 110, -1, ! 218, 95, 194, 113, -1, 218, 95, 113, -1, 317, ! -1, 330, 317, -1, 330, 210, -1, 321, 217, -1, ! 321, 214, -1, 321, 213, -1, 321, 210, -1, 321, ! 213, -1, 317, -1, 330, 317, -1, 240, 94, 202, ! 110, -1, 240, 94, 215, 110, -1, 240, 229, -1, ! 4, -1, 5, -1, 185, -1, 322, -1, 321, 322, ! -1, 321, 50, 327, 56, -1, 321, 3, 56, -1, ! 321, 60, 56, -1, 4, 56, -1, 5, 56, -1, ! 59, 56, -1, 185, 56, -1, 324, -1, 330, 324, ! -1, 325, 171, -1, 325, 185, -1, 325, 327, -1, ! 325, 50, 327, -1, 326, -1, 325, 326, -1, 325, ! 327, 56, -1, 325, 50, 327, 56, -1, 4, 56, ! -1, 5, 56, -1, 185, 56, -1, 60, 56, -1, ! 3, 56, -1, 59, 56, -1, 171, 76, 190, 189, ! -1, 330, 320, -1, 311, -1, 330, 311, -1, 321, ! 83, -1, 330, 321, 83, -1, 56, -1, 83, 303, ! 331, -1, 83, 303, -1, 73, 303, 331, -1, 73, ! 303, -1, 329, 303, -1, 329, 303, 331, -1, 332, ! -1, 95, 194, 113, -1, 332, 95, 194, 113, -1, ! 334, -1, 255, 334, -1, 83, 304, 333, -1, 83, ! 333, -1, 83, 304, -1, 83, -1, 73, 304, 333, ! -1, 73, 333, -1, 73, 304, -1, 73, -1, 329, ! 303, -1, 329, 303, 333, -1, 335, -1, 94, 333, ! 110, -1, 335, 94, 385, 110, 303, 400, -1, 335, ! 49, 303, 400, -1, 335, 95, 194, 113, -1, 335, ! 95, 113, -1, 94, 386, 110, 303, 400, -1, 206, ! 303, 400, -1, 229, 303, 400, -1, 95, 194, 113, ! -1, 95, 113, -1, 349, -1, 337, -1, 336, 349, ! -1, 336, 337, -1, 1, 63, -1, -1, 339, -1, ! 340, -1, 339, 340, -1, 34, 260, 63, -1, -1, ! 407, 61, 342, 200, -1, 341, -1, -1, -1, 16, ! 345, 196, 346, 347, -1, 343, -1, -1, 348, 407, ! 350, -1, 343, -1, 407, 350, -1, 227, -1, 194, ! 63, -1, -1, 344, 17, 351, 347, -1, 344, -1, ! -1, -1, 18, 352, 196, 353, 347, -1, -1, -1, ! 19, 354, 347, 18, 355, 195, 63, -1, -1, -1, ! -1, -1, 20, 356, 94, 378, 357, 197, 63, 358, ! 380, 110, 359, 347, -1, -1, -1, 21, 360, 94, ! 198, 110, 361, 347, -1, -1, 22, 208, 65, 362, ! 349, -1, -1, 22, 208, 13, 208, 65, 363, 349, ! -1, -1, 23, 65, 364, 349, -1, 24, 63, -1, ! 25, 63, -1, 26, 63, -1, 26, 194, 63, -1, ! 122, 379, 94, 224, 110, 63, -1, 122, 379, 94, ! 224, 65, 381, 110, 63, -1, 122, 379, 94, 224, ! 65, 381, 65, 381, 110, 63, -1, 122, 379, 94, ! 224, 56, 381, 110, 63, -1, 122, 379, 94, 224, ! 65, 381, 65, 381, 65, 384, 110, 63, -1, 122, ! 379, 94, 224, 56, 381, 65, 384, 110, 63, -1, ! 122, 379, 94, 224, 65, 381, 56, 384, 110, 63, ! -1, 27, 83, 194, 63, -1, 27, 171, 63, -1, ! 377, 349, -1, 377, 111, -1, 63, -1, 368, -1, ! 133, -1, 132, -1, 129, -1, -1, -1, 98, 366, ! 154, 367, 371, -1, -1, -1, 98, 369, 343, 370, ! 371, -1, 372, -1, 371, 372, -1, -1, -1, -1, ! 97, 373, 376, 374, 343, -1, 235, -1, 304, -1, ! 94, 13, 110, -1, 94, 394, 110, -1, 3, 65, ! -1, 60, 65, -1, 4, 65, -1, 5, 65, -1, ! 380, 63, -1, 227, -1, 61, 200, -1, -1, 9, ! -1, -1, 194, -1, 1, -1, -1, 382, -1, 383, ! -1, 382, 62, 383, -1, 12, 94, 194, 110, -1, ! 95, 171, 113, 12, 94, 194, 110, -1, 224, -1, ! 384, 62, 224, -1, -1, 386, -1, 230, -1, 390, ! -1, 391, 13, -1, 390, 13, -1, 230, 13, -1, ! 13, -1, 390, 65, -1, 230, 65, -1, -1, 66, ! 388, 389, -1, 102, -1, 262, -1, 392, -1, 394, ! 387, -1, 391, 393, -1, 391, 396, -1, 391, 396, ! 66, 262, -1, 390, 62, -1, 230, 62, -1, 232, ! 228, -1, 235, 228, -1, 240, 228, -1, 232, 334, ! -1, 232, -1, 234, 313, -1, 394, -1, 394, 387, ! -1, 392, -1, 230, -1, -1, -1, 313, -1, 3, ! 398, 3, 399, 63, -1, 76, 190, 189, -1, -1, ! 94, 202, 110, -1, -1, -1, 64, 94, 402, 110, ! -1, 64, 49, -1, 230, -1, 1, -1, 401, -1, ! 402, 62, 401, -1, -1, 83, 303, 403, -1, 73, ! 303, 403, -1, 329, 303, 403, -1, 43, -1, -1, ! 404, 83, 405, -1, 404, 84, 405, -1, 404, 85, ! 405, -1, 404, 81, 405, -1, 404, 82, 405, -1, ! 404, 73, 405, -1, 404, 71, 405, -1, 404, 72, ! 405, -1, 404, 88, 405, -1, 404, 62, 405, -1, ! 404, 78, 405, -1, 404, 76, 405, -1, 404, 77, ! 405, -1, 404, 75, 405, -1, 404, 67, 405, -1, ! 404, 66, 405, -1, 404, 80, 405, -1, 404, 79, ! 405, -1, 404, 90, 405, -1, 404, 89, 405, -1, ! 404, 70, 405, -1, 404, 69, 405, -1, 404, 112, ! 405, -1, 404, 68, 65, 405, -1, 404, 74, 405, ! -1, 404, 96, 405, -1, 404, 87, 405, -1, 404, ! 49, 405, -1, 404, 95, 113, 405, -1, 404, 41, ! 405, -1, 404, 40, 405, -1, 404, 41, 95, 113, ! 405, -1, 404, 40, 95, 113, 405, -1, 404, 375, ! 403, 405, -1, 404, 1, 405, -1, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned short yyrline[] = { ! 0, 456, 456, 457, 466, 466, 469, 474, 475, 479, ! 484, 488, 494, 498, 498, 506, 508, 512, 511, 515, ! 517, 520, 522, 524, 527, 526, 531, 530, 534, 535, ! 537, 538, 544, 543, 555, 557, 559, 564, 566, 568, ! 574, 573, 588, 594, 604, 605, 606, 608, 613, 615, ! 623, 622, 629, 635, 636, 640, 642, 647, 650, 654, ! 656, 661, 673, 675, 677, 679, 681, 683, 698, 700, ! 705, 707, 709, 711, 714, 717, 722, 723, 725, 727, ! 738, 739, 741, 743, 745, 746, 753, 754, 755, 757, ! 758, 762, 763, 766, 768, 769, 772, 774, 782, 781, ! 792, 794, 796, 802, 801, 805, 810, 809, 813, 818, ! 817, 821, 826, 825, 829, 836, 840, 843, 846, 849, ! 858, 860, 863, 865, 867, 869, 876, 884, 887, 889, ! 891, 894, 896, 902, 909, 911, 913, 918, 931, 938, ! 942, 947, 958, 962, 968, 976, 978, 981, 983, 986, ! 988, 991, 996, 997, 998, 999, 1000, 1004, 1005, 1006, ! 1010, 1011, 1012, 1017, 1016, 1021, 1020, 1025, 1024, 1028, ! 1027, 1031, 1030, 1037, 1035, 1042, 1041, 1046, 1045, 1052, ! 1056, 1064, 1067, 1070, 1074, 1075, 1081, 1087, 1097, 1098, ! 1108, 1109, 1113, 1115, 1120, 1122, 1128, 1134, 1135, 1148, ! 1150, 1152, 1154, 1156, 1161, 1163, 1167, 1171, 1176, 1180, ! 1186, 1187, 1188, 1194, 1193, 1215, 1219, 1220, 1221, 1222, ! 1226, 1229, 1232, 1234, 1239, 1241, 1245, 1248, 1251, 1253, ! 1255, 1257, 1260, 1262, 1265, 1269, 1272, 1279, 1282, 1285, ! 1288, 1291, 1296, 1299, 1302, 1306, 1308, 1312, 1316, 1318, ! 1323, 1325, 1331, 1333, 1335, 1345, 1360, 1364, 1371, 1372, ! 1374, 1388, 1390, 1392, 1394, 1396, 1398, 1400, 1402, 1404, ! 1406, 1408, 1410, 1412, 1414, 1416, 1418, 1420, 1422, 1424, ! 1426, 1428, 1430, 1434, 1436, 1438, 1443, 1445, 1447, 1449, ! 1451, 1453, 1455, 1457, 1459, 1461, 1463, 1465, 1467, 1469, ! 1471, 1473, 1475, 1477, 1479, 1481, 1483, 1487, 1489, 1491, ! 1496, 1498, 1500, 1501, 1502, 1503, 1504, 1508, 1521, 1523, ! 1528, 1530, 1532, 1538, 1539, 1540, 1544, 1545, 1554, 1555, ! 1557, 1559, 1564, 1566, 1571, 1574, 1575, 1576, 1581, 1588, ! 1589, 1590, 1600, 1606, 1608, 1611, 1614, 1613, 1629, 1631, ! 1633, 1635, 1637, 1640, 1642, 1644, 1647, 1649, 1660, 1661, ! 1665, 1669, 1673, 1677, 1679, 1683, 1685, 1687, 1695, 1697, ! 1699, 1701, 1705, 1707, 1709, 1711, 1716, 1718, 1720, 1722, ! 1725, 1727, 1729, 1774, 1776, 1781, 1783, 1788, 1790, 1796, ! 1797, 1803, 1810, 1812, 1820, 1825, 1829, 1831, 1836, 1838, ! 1846, 1847, 1852, 1855, 1862, 1865, 1868, 1872, 1875, 1886, ! 1888, 1893, 1896, 1899, 1902, 1905, 1908, 1915, 1920, 1922, ! 1944, 1946, 1951, 1956, 1964, 1975, 1978, 1981, 1984, 1990, ! 1992, 1994, 1996, 2001, 2005, 2009, 2017, 2019, 2021, 2023, ! 2027, 2031, 2046, 2066, 2068, 2070, 2074, 2075, 2080, 2081, ! 2086, 2087, 2093, 2094, 2100, 2099, 2104, 2119, 2118, 2125, ! 2132, 2137, 2143, 2142, 2150, 2159, 2160, 2165, 2167, 2172, ! 2177, 2179, 2185, 2186, 2188, 2190, 2192, 2200, 2201, 2202, ! 2203, 2208, 2210, 2215, 2217, 2225, 2226, 2229, 2232, 2235, ! 2242, 2244, 2247, 2249, 2251, 2256, 2261, 2266, 2272, 2274, ! 2280, 2282, 2287, 2288, 2290, 2296, 2295, 2305, 2304, 2313, ! 2316, 2319, 2326, 2343, 2361, 2325, 2371, 2379, 2381, 2384, ! 2386, 2392, 2393, 2395, 2397, 2399, 2401, 2406, 2411, 2416, ! 2421, 2429, 2434, 2439, 2447, 2453, 2459, 2467, 2474, 2481, ! 2492, 2503, 2511, 2519, 2532, 2533, 2536, 2541, 2542, 2547, ! 2549, 2554, 2557, 2562, 2563, 2567, 2578, 2592, 2593, 2594, ! 2595, 2599, 2608, 2614, 2623, 2624, 2629, 2631, 2633, 2635, ! 2637, 2639, 2642, 2652, 2657, 2665, 2686, 2692, 2694, 2696, ! 2698, 2709, 2714, 2716, 2724, 2725, 2732, 2744, 2745, 2752, ! 2763, 2764, 2768, 2769, 2773, 2776, 2782, 2785, 2788, 2791, ! 2797, 2799, 2804, 2806, 2808, 2813, 2814, 2822, 2823, 2827, ! 2829, 2835, 2838, 2843, 2854, 2856, 2861, 2864, 2867, 2870, ! 2880, 2882, 2884, 2886, 2893, 2894, 2904, 2906, 2908, 2910, ! 2912, 2916, 2920, 2922, 2924, 2926, 2928, 2932, 2936, 2946, ! 2957, 2958, 2959, 2964, 2972, 2973, 2982, 2984, 2986, 2988, ! 2990, 2994, 2998, 3000, 3002, 3004, 3006, 3010, 3014, 3016, ! 3018, 3020, 3022, 3024, 3026, 3030, 3038, 3041, 3047, 3050, ! 3056, 3057, 3062, 3064, 3066, 3071, 3072, 3073, 3077, 3078, ! 3080, 3084, 3087, 3095, 3105, 3111, 3117, 3122, 3123, 3128, ! 3141, 3143, 3145, 3150, 3157, 3170, 3173, 3181, 3193, 3199, ! 3201, 3202, 3203, 3212, 3217, 3225, 3226, 3231, 3233, 3240, ! 3246, 3248, 3250, 3252, 3254, 3258, 3262, 3267, 3269, 3274, ! 3275, 3285, 3287, 3289, 3291, 3293, 3295, 3297, 3299, 3301, ! 3305, 3309, 3314, 3317, 3319, 3321, 3323, 3325, 3327, 3329, ! 3331, 3333, 3342, 3343, 3344, 3345, 3349, 3354, 3356, 3362, ! 3363, 3367, 3379, 3378, 3386, 3392, 3395, 3391, 3402, 3404, ! 3404, 3412, 3413, 3418, 3421, 3424, 3423, 3431, 3435, 3440, ! 3434, 3445, 3447, 3444, 3455, 3457, 3459, 3461, 3454, 3466, ! 3468, 3465, 3473, 3472, 3477, 3476, 3481, 3480, 3484, 3486, ! 3488, 3490, 3492, 3497, 3500, 3503, 3506, 3509, 3512, 3515, ! 3521, 3523, 3525, 3529, 3532, 3534, 3536, 3539, 3545, 3547, ! 3544, 3554, 3556, 3553, 3562, 3563, 3565, 3577, 3579, 3576, ! 3585, 3586, 3590, 3606, 3615, 3617, 3619, 3621, 3626, 3628, ! 3629, 3639, 3640, 3645, 3646, 3647, 3655, 3656, 3660, 3661, ! 3666, 3668, 3673, 3675, 3687, 3690, 3691, 3699, 3701, 3704, ! 3706, 3709, 3711, 3721, 3737, 3736, 3743, 3744, 3749, 3752, ! 3755, 3758, 3760, 3765, 3766, 3776, 3779, 3782, 3786, 3789, ! 3792, 3798, 3801, 3807, 3808, 3812, 3817, 3822, 3839, 3847, ! 3849, 3853, 3855, 3859, 3861, 3863, 3868, 3873, 3878, 3880, ! 3885, 3887, 3889, 3891, 3898, 3911, 3919, 3921, 3923, 3925, ! 3927, 3929, 3931, 3933, 3935, 3937, 3939, 3941, 3943, 3945, ! 3947, 3949, 3951, 3953, 3955, 3957, 3959, 3961, 3963, 3965, ! 3967, 3969, 3971, 3973, 3975, 3977, 3979, 3981, 3983, 3985, ! 3987, 3995 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "IDENTIFIER", "tTYPENAME", "SELFNAME", "PFUNCNAME", "SCSPEC", "TYPESPEC", "CV_QUALIFIER", "CONSTANT", "VAR_FUNC_NAME", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", *************** static const char *const yytname[] = *** 898,916 **** "AGGR", "VISSPEC", "DELETE", "NEW", "THIS", "OPERATOR", "CXX_TRUE", "CXX_FALSE", "NAMESPACE", "TYPENAME_KEYWORD", "USING", "LEFT_RIGHT", "TEMPLATE", "TYPEID", "DYNAMIC_CAST", "STATIC_CAST", "REINTERPRET_CAST", ! "CONST_CAST", "SCOPE", "EXPORT", "EMPTY", "PTYPENAME", "NSNAME", "'{'", ! "','", "';'", "THROW", "':'", "ASSIGN", "'='", "'?'", "OROR", "ANDAND", ! "'|'", "'^'", "'&'", "MIN_MAX", "EQCOMPARE", "ARITHCOMPARE", "'<'", ! "'>'", "LSHIFT", "RSHIFT", "'+'", "'-'", "'*'", "'/'", "'%'", ! "POINTSAT_STAR", "DOT_STAR", "UNARY", "PLUSPLUS", "MINUSMINUS", "'~'", ! "HYPERUNARY", "POINTSAT", "'.'", "'('", "'['", "TRY", "CATCH", "EXTERN_LANG_STRING", "ALL", "PRE_PARSED_CLASS_DECL", "DEFARG", "DEFARG_MARKER", "PRE_PARSED_FUNCTION_DECL", "TYPENAME_DEFN", "IDENTIFIER_DEFN", "PTYPENAME_DEFN", "END_OF_LINE", ! "END_OF_SAVED_INPUT", "')'", "'}'", "'!'", "']'", "program", "extdefs", ! "@1", "extdefs_opt", ".hush_warning", ".warning_ok", "extension", ! "asm_keyword", "lang_extdef", "@2", "extdef", "@3", "@4", "@5", ! "namespace_alias", "@6", "using_decl", "namespace_using_decl", "using_directive", "@7", "namespace_qualifier", "any_id", "extern_lang_string", "template_parm_header", "@8", "template_spec_header", "template_header", "template_parm_list", --- 1170,1188 ---- "AGGR", "VISSPEC", "DELETE", "NEW", "THIS", "OPERATOR", "CXX_TRUE", "CXX_FALSE", "NAMESPACE", "TYPENAME_KEYWORD", "USING", "LEFT_RIGHT", "TEMPLATE", "TYPEID", "DYNAMIC_CAST", "STATIC_CAST", "REINTERPRET_CAST", ! "CONST_CAST", "SCOPE", "EXPORT", "EMPTY", "NSNAME", "PTYPENAME", "'{'", ! "','", "';'", "THROW", "':'", "'='", "ASSIGN", "'?'", "OROR", "ANDAND", ! "'|'", "'^'", "'&'", "MIN_MAX", "EQCOMPARE", "'<'", "'>'", ! "ARITHCOMPARE", "RSHIFT", "LSHIFT", "'+'", "'-'", "'*'", "'/'", "'%'", ! "DOT_STAR", "POINTSAT_STAR", "'~'", "MINUSMINUS", "PLUSPLUS", "UNARY", ! "HYPERUNARY", "'.'", "'('", "'['", "POINTSAT", "CATCH", "TRY", "EXTERN_LANG_STRING", "ALL", "PRE_PARSED_CLASS_DECL", "DEFARG", "DEFARG_MARKER", "PRE_PARSED_FUNCTION_DECL", "TYPENAME_DEFN", "IDENTIFIER_DEFN", "PTYPENAME_DEFN", "END_OF_LINE", ! "END_OF_SAVED_INPUT", "')'", "'}'", "'!'", "']'", "$accept", "program", ! "extdefs", "@1", "extdefs_opt", ".hush_warning", ".warning_ok", ! "extension", "asm_keyword", "lang_extdef", "@2", "extdef", "@3", "@4", ! "@5", "namespace_alias", "@6", "using_decl", "namespace_using_decl", "using_directive", "@7", "namespace_qualifier", "any_id", "extern_lang_string", "template_parm_header", "@8", "template_spec_header", "template_header", "template_parm_list", *************** static const char *const yytname[] = *** 985,4120 **** }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 114, 114, 116, 115, 115, 117, 117, 118, 119, ! 120, 121, 123, 122, 124, 124, 125, 124, 124, 124, ! 124, 124, 124, 126, 124, 127, 124, 124, 124, 124, ! 124, 129, 128, 130, 130, 130, 131, 131, 131, 133, ! 132, 134, 134, 135, 135, 135, 135, 136, 136, 138, ! 137, 139, 140, 140, 141, 141, 142, 142, 143, 143, ! 144, 145, 145, 145, 145, 145, 145, 146, 146, 147, ! 147, 147, 147, 147, 147, 148, 148, 148, 148, 149, ! 149, 149, 149, 149, 149, 149, 149, 149, 149, 149, ! 150, 150, 151, 151, 151, 152, 152, 154, 153, 155, ! 155, 155, 157, 156, 156, 158, 156, 156, 159, 156, ! 156, 160, 156, 156, 161, 161, 161, 161, 161, 162, ! 162, 162, 162, 162, 162, 163, 163, 163, 163, 163, ! 163, 163, 164, 165, 165, 165, 166, 167, 168, 168, ! 168, 168, 169, 169, 169, 169, 169, 169, 169, 169, ! 169, 170, 170, 170, 170, 170, 171, 171, 171, 172, ! 172, 172, 174, 173, 175, 173, 176, 173, 177, 173, ! 178, 173, 179, 173, 180, 173, 181, 173, 182, 183, ! 184, 184, 184, 185, 185, 186, 187, 188, 188, 189, ! 189, 190, 190, 191, 191, 191, 191, 191, 192, 192, ! 192, 192, 192, 193, 193, 194, 194, 195, 195, 196, ! 196, 196, 198, 197, 197, 199, 199, 199, 199, 200, ! 200, 200, 200, 201, 201, 202, 202, 202, 202, 202, ! 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, ! 202, 202, 202, 202, 202, 202, 202, 202, 202, 203, ! 203, 204, 204, 204, 204, 205, 205, 206, 206, 206, ! 207, 207, 207, 207, 207, 207, 207, 207, 207, 207, ! 207, 207, 207, 207, 207, 207, 207, 207, 207, 207, ! 207, 207, 207, 207, 207, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, ! 208, 208, 208, 208, 208, 208, 208, 208, 208, 209, ! 209, 209, 209, 209, 209, 209, 210, 211, 211, 212, ! 212, 212, 213, 213, 213, 214, 214, 215, 215, 215, ! 215, 216, 216, 217, 217, 217, 217, 218, 218, 218, ! 218, 218, 218, 218, 218, 219, 218, 218, 218, 218, ! 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, ! 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, ! 218, 218, 218, 218, 218, 218, 218, 218, 218, 218, ! 218, 218, 220, 220, 221, 221, 222, 222, 223, 223, ! 224, 225, 225, 226, 226, 226, 226, 226, 226, 227, ! 227, 228, 228, 229, 229, 229, 229, 229, 230, 230, ! 231, 231, 231, 231, 231, 231, 232, 232, 232, 233, ! 233, 233, 233, 233, 234, 234, 234, 234, 235, 235, ! 235, 235, 236, 237, 238, 239, 239, 239, 239, 239, ! 239, 239, 240, 240, 240, 241, 241, 242, 242, 243, ! 243, 244, 244, 246, 245, 245, 248, 247, 247, 249, ! 250, 252, 251, 251, 253, 253, 254, 254, 255, 256, ! 256, 257, 257, 257, 257, 257, 258, 258, 258, 258, ! 259, 259, 260, 260, 261, 261, 261, 261, 261, 262, ! 262, 262, 262, 262, 263, 263, 263, 264, 264, 265, ! 265, 266, 266, 266, 268, 267, 269, 267, 267, 267, ! 267, 270, 271, 272, 267, 267, 273, 273, 274, 274, ! 275, 275, 275, 275, 275, 275, 276, 276, 276, 276, ! 277, 277, 277, 278, 278, 278, 279, 279, 279, 279, ! 279, 279, 279, 280, 280, 280, 281, 281, 282, 282, ! 283, 283, 284, 284, 284, 284, 285, 285, 285, 285, ! 286, 287, 287, 288, 288, 288, 288, 288, 288, 288, ! 288, 288, 288, 288, 289, 289, 289, 289, 289, 289, ! 289, 289, 289, 290, 290, 290, 291, 291, 291, 292, ! 292, 293, 293, 294, 294, 295, 295, 295, 295, 296, ! 296, 297, 297, 297, 298, 298, 299, 299, 300, 300, ! 301, 301, 301, 302, 302, 303, 303, 303, 303, 304, ! 304, 304, 304, 305, 305, 306, 306, 306, 306, 306, ! 306, 307, 307, 307, 307, 307, 307, 308, 308, 309, ! 309, 309, 310, 311, 311, 312, 312, 312, 312, 312, ! 312, 313, 313, 313, 313, 313, 313, 314, 314, 314, ! 314, 314, 314, 314, 314, 315, 315, 316, 316, 317, ! 317, 318, 318, 318, 319, 319, 319, 320, 320, 320, ! 320, 320, 321, 321, 321, 321, 322, 322, 323, 323, ! 323, 323, 324, 324, 324, 324, 325, 325, 325, 325, ! 325, 325, 326, 327, 327, 327, 328, 328, 329, 330, ! 330, 330, 330, 330, 330, 330, 331, 331, 332, 332, ! 333, 333, 333, 333, 333, 333, 333, 333, 333, 333, 333, 334, 334, 334, 334, 334, 334, 334, 334, 334, ! 334, 335, 335, 335, 335, 336, 337, 337, 338, 338, ! 339, 341, 340, 342, 344, 345, 343, 346, 347, 346, ! 348, 348, 349, 349, 350, 349, 349, 351, 352, 349, ! 353, 354, 349, 355, 356, 357, 358, 349, 359, 360, ! 349, 361, 349, 362, 349, 363, 349, 349, 349, 349, ! 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, ! 349, 349, 349, 349, 349, 349, 349, 365, 366, 364, ! 368, 369, 367, 370, 370, 370, 372, 373, 371, 374, ! 374, 375, 375, 376, 376, 376, 376, 377, 377, 377, ! 378, 378, 379, 379, 379, 380, 380, 381, 381, 382, ! 382, 383, 383, 384, 384, 384, 385, 385, 385, 385, ! 385, 385, 385, 387, 386, 388, 388, 389, 389, 389, ! 389, 389, 390, 390, 391, 391, 391, 391, 391, 391, ! 392, 392, 393, 393, 394, 395, 395, 396, 397, 397, ! 398, 398, 399, 399, 399, 400, 400, 401, 401, 402, ! 402, 402, 402, 403, 404, 405, 405, 405, 405, 405, ! 405, 405, 405, 405, 405, 405, 405, 405, 405, 405, ! 405, 405, 405, 405, 405, 405, 405, 405, 405, 405, ! 405, 405, 405, 405, 405, 405, 405, 405, 405, 405, ! 406 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 0, 1, 0, 2, 2, 1, 0, 0, 0, ! 1, 1, 0, 2, 2, 1, 0, 3, 1, 5, ! 4, 5, 4, 0, 6, 0, 5, 1, 2, 1, ! 2, 0, 6, 2, 3, 3, 3, 3, 4, 0, ! 5, 2, 3, 1, 1, 2, 2, 1, 2, 0, ! 5, 3, 1, 1, 1, 3, 1, 0, 2, 2, ! 3, 1, 3, 1, 3, 1, 3, 2, 2, 2, ! 1, 1, 5, 4, 2, 2, 3, 3, 2, 2, ! 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, ! 1, 1, 0, 1, 2, 0, 1, 0, 6, 3, ! 3, 3, 0, 8, 5, 0, 9, 6, 0, 8, ! 5, 0, 9, 6, 2, 2, 1, 2, 1, 6, ! 8, 4, 6, 6, 4, 2, 1, 2, 2, 1, ! 2, 1, 2, 2, 4, 2, 2, 0, 0, 1, ! 3, 2, 3, 1, 4, 2, 4, 2, 4, 2, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 0, 6, 0, 6, 0, 5, 0, 5, ! 0, 7, 0, 7, 0, 6, 0, 6, 0, 0, ! 5, 5, 1, 1, 5, 5, 0, 1, 1, 0, ! 1, 1, 3, 1, 1, 2, 1, 3, 1, 1, ! 1, 1, 1, 1, 1, 1, 3, 1, 3, 0, ! 1, 1, 0, 7, 1, 1, 3, 4, 3, 3, ! 3, 3, 3, 1, 1, 1, 2, 2, 2, 2, ! 2, 2, 2, 4, 2, 4, 2, 3, 3, 4, ! 4, 5, 5, 6, 2, 4, 5, 2, 2, 3, ! 3, 3, 1, 3, 2, 3, 4, 1, 2, 5, ! 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 5, 3, 3, 1, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 5, 3, 3, 1, 2, 3, ! 3, 1, 1, 1, 1, 1, 0, 5, 5, 5, ! 5, 5, 1, 1, 1, 1, 2, 1, 2, 2, ! 3, 4, 4, 1, 1, 1, 3, 1, 1, 1, ! 1, 1, 3, 3, 3, 0, 4, 4, 2, 4, ! 2, 6, 4, 2, 2, 1, 4, 1, 7, 7, ! 7, 7, 4, 4, 2, 2, 2, 1, 4, 2, ! 2, 5, 3, 2, 2, 5, 3, 5, 3, 4, ! 6, 2, 1, 2, 1, 2, 1, 1, 1, 2, ! 0, 2, 2, 3, 3, 3, 2, 2, 2, 1, ! 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, ! 2, 2, 3, 3, 3, 4, 1, 2, 2, 1, ! 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, ! 2, 1, 1, 1, 1, 1, 1, 1, 4, 4, ! 4, 4, 1, 1, 1, 1, 3, 1, 3, 1, ! 3, 0, 4, 0, 6, 3, 0, 4, 1, 3, ! 3, 0, 4, 3, 0, 1, 1, 2, 6, 1, ! 3, 0, 1, 4, 6, 4, 1, 1, 1, 1, ! 1, 3, 0, 2, 1, 2, 3, 4, 1, 1, ! 3, 4, 3, 5, 3, 3, 3, 0, 3, 3, ! 3, 0, 2, 2, 0, 6, 0, 5, 2, 2, ! 2, 0, 0, 0, 11, 1, 0, 1, 0, 1, ! 1, 2, 2, 2, 2, 2, 2, 3, 4, 3, ! 2, 3, 4, 1, 2, 1, 2, 2, 2, 2, ! 3, 3, 2, 0, 2, 3, 1, 4, 1, 3, ! 1, 1, 2, 2, 3, 3, 0, 1, 3, 2, ! 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, ! 2, 2, 3, 1, 2, 2, 4, 4, 2, 1, ! 5, 4, 1, 0, 1, 3, 0, 1, 3, 1, ! 1, 1, 1, 4, 4, 4, 4, 4, 3, 4, ! 4, 4, 4, 3, 2, 1, 1, 3, 1, 3, ! 2, 1, 6, 0, 2, 1, 2, 1, 2, 3, ! 3, 1, 3, 1, 2, 3, 3, 2, 2, 3, ! 1, 4, 4, 3, 3, 2, 1, 1, 2, 1, ! 1, 2, 2, 1, 2, 3, 3, 2, 2, 3, ! 1, 3, 3, 2, 2, 3, 1, 4, 3, 4, ! 3, 1, 2, 2, 2, 2, 2, 2, 2, 1, ! 2, 4, 4, 2, 1, 1, 1, 1, 2, 4, ! 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, ! 2, 3, 1, 2, 3, 4, 2, 2, 2, 2, ! 2, 2, 4, 2, 1, 2, 2, 3, 1, 3, ! 2, 3, 2, 2, 3, 1, 3, 4, 1, 2, ! 3, 2, 2, 1, 3, 2, 2, 1, 2, 3, ! 1, 3, 6, 4, 4, 3, 5, 3, 3, 3, ! 2, 1, 1, 2, 2, 2, 0, 1, 1, 2, ! 3, 0, 4, 1, 0, 0, 5, 1, 0, 3, ! 1, 2, 1, 2, 0, 4, 1, 0, 0, 5, ! 0, 0, 7, 0, 0, 0, 0, 12, 0, 0, ! 7, 0, 5, 0, 7, 0, 4, 2, 2, 2, ! 3, 6, 8, 10, 8, 12, 10, 10, 4, 3, ! 2, 2, 1, 1, 1, 1, 1, 0, 0, 5, ! 0, 0, 5, 1, 2, 0, 0, 0, 5, 1, ! 1, 3, 3, 2, 2, 2, 2, 2, 1, 2, ! 0, 1, 0, 1, 1, 0, 1, 1, 3, 4, ! 7, 1, 3, 0, 1, 1, 1, 2, 2, 2, ! 1, 2, 2, 0, 3, 1, 1, 1, 2, 2, ! 2, 4, 2, 2, 2, 2, 2, 2, 1, 2, ! 1, 2, 1, 1, 0, 0, 1, 5, 3, 0, ! 3, 0, 0, 4, 2, 1, 1, 1, 3, 0, ! 3, 3, 3, 1, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, ! 3, 3, 3, 4, 3, 3, 5, 5, 4, 3, ! 0 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 3, 12, 12, 5, 0, 4, 0, 313, 674, 675, ! 0, 420, 436, 615, 0, 11, 434, 0, 0, 10, ! 520, 893, 0, 0, 0, 178, 708, 16, 314, 315, ! 88, 0, 0, 874, 0, 47, 0, 0, 13, 27, ! 0, 29, 8, 52, 53, 0, 18, 15, 95, 118, ! 92, 0, 676, 182, 334, 311, 335, 650, 0, 409, ! 0, 408, 0, 424, 0, 449, 617, 466, 435, 0, ! 533, 535, 515, 543, 419, 639, 437, 640, 116, 333, ! 661, 637, 0, 677, 613, 0, 89, 0, 312, 85, ! 87, 86, 189, 0, 682, 189, 683, 189, 316, 178, ! 151, 152, 153, 154, 155, 506, 508, 0, 704, 0, ! 509, 0, 0, 0, 152, 153, 154, 155, 25, 0, ! 0, 0, 0, 0, 0, 0, 510, 686, 0, 692, ! 0, 0, 0, 39, 0, 0, 33, 0, 0, 49, ! 0, 0, 189, 684, 0, 313, 617, 0, 648, 643, ! 0, 0, 0, 647, 0, 0, 0, 0, 334, 0, ! 325, 0, 0, 0, 333, 613, 30, 0, 28, 3, ! 48, 0, 68, 420, 0, 0, 8, 71, 67, 70, ! 95, 0, 0, 0, 435, 96, 14, 0, 464, 0, ! 0, 482, 93, 83, 685, 621, 0, 0, 613, 84, ! 0, 0, 0, 114, 0, 445, 399, 630, 400, 636, ! 0, 613, 422, 421, 82, 117, 410, 0, 447, 423, ! 115, 0, 416, 442, 443, 411, 426, 428, 431, 444, ! 0, 79, 467, 521, 522, 523, 524, 542, 160, 159, ! 161, 526, 534, 183, 530, 525, 0, 0, 536, 537, ! 538, 539, 874, 0, 616, 425, 618, 0, 461, 313, ! 675, 0, 314, 706, 182, 667, 668, 664, 642, 678, ! 0, 313, 315, 663, 641, 662, 638, 0, 894, 894, ! 894, 894, 894, 894, 894, 0, 894, 894, 894, 894, ! 894, 894, 894, 894, 894, 894, 894, 894, 894, 894, ! 894, 894, 894, 894, 894, 894, 894, 894, 0, 894, ! 819, 424, 820, 889, 316, 615, 338, 341, 388, 432, ! 433, 0, 0, 0, 384, 382, 355, 386, 387, 0, ! 0, 0, 0, 0, 314, 307, 0, 0, 199, 198, ! 0, 200, 201, 0, 0, 202, 0, 0, 190, 191, ! 0, 257, 0, 285, 196, 337, 225, 0, 0, 339, ! 340, 0, 193, 406, 0, 0, 424, 407, 669, 367, ! 357, 0, 0, 881, 0, 0, 189, 0, 518, 504, ! 0, 0, 0, 705, 703, 283, 0, 203, 260, 204, ! 0, 0, 0, 471, 3, 23, 31, 700, 696, 697, ! 699, 701, 698, 151, 152, 153, 0, 154, 155, 688, ! 689, 693, 690, 687, 0, 313, 323, 324, 322, 666, ! 665, 35, 34, 51, 0, 168, 0, 0, 424, 166, ! 17, 0, 0, 189, 644, 618, 646, 0, 645, 152, ! 153, 309, 310, 329, 617, 0, 654, 328, 0, 653, ! 0, 336, 314, 315, 0, 0, 0, 327, 326, 658, ! 0, 0, 12, 0, 178, 9, 9, 74, 0, 69, ! 0, 0, 75, 78, 0, 463, 465, 132, 101, 807, ! 99, 390, 100, 135, 0, 0, 133, 94, 0, 850, ! 224, 0, 223, 845, 868, 0, 406, 424, 407, 0, ! 844, 846, 875, 857, 0, 0, 660, 0, 0, 882, ! 617, 0, 628, 623, 0, 627, 0, 0, 0, 0, ! 0, 613, 464, 0, 81, 0, 613, 635, 0, 413, ! 414, 0, 80, 464, 0, 0, 418, 417, 412, 429, ! 430, 451, 450, 189, 540, 541, 151, 154, 527, 531, ! 529, 0, 544, 511, 427, 464, 680, 613, 102, 0, ! 0, 0, 0, 681, 613, 108, 614, 0, 649, 675, ! 707, 182, 929, 0, 925, 0, 924, 922, 904, 909, ! 910, 894, 916, 915, 901, 902, 900, 919, 908, 905, ! 906, 907, 911, 912, 898, 899, 895, 896, 897, 921, ! 913, 914, 903, 920, 894, 917, 426, 613, 613, 0, ! 613, 0, 894, 189, 0, 247, 248, 0, 0, 0, ! 0, 0, 0, 308, 231, 228, 227, 229, 0, 0, ! 0, 0, 0, 337, 0, 930, 0, 226, 187, 188, ! 331, 0, 230, 0, 0, 258, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 348, 0, 350, ! 353, 354, 392, 391, 0, 0, 0, 0, 0, 236, ! 611, 0, 244, 389, 381, 0, 0, 874, 370, 373, ! 374, 0, 0, 401, 727, 723, 0, 0, 613, 613, ! 613, 403, 730, 0, 232, 0, 234, 0, 673, 405, ! 0, 0, 404, 369, 0, 0, 364, 383, 195, 365, ! 385, 670, 0, 366, 0, 0, 186, 186, 0, 176, ! 0, 424, 174, 519, 608, 605, 0, 518, 606, 518, ! 0, 284, 440, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 441, 477, 478, ! 479, 476, 0, 469, 472, 0, 3, 0, 691, 189, ! 694, 0, 43, 44, 0, 57, 0, 0, 0, 61, ! 65, 54, 873, 424, 57, 872, 63, 179, 164, 162, ! 179, 186, 332, 0, 652, 651, 336, 0, 655, 0, ! 20, 22, 95, 9, 9, 77, 76, 0, 137, 0, ! 930, 91, 90, 488, 0, 484, 483, 0, 622, 619, ! 849, 863, 852, 727, 723, 0, 864, 613, 867, 869, ! 0, 0, 865, 0, 866, 620, 848, 862, 851, 847, ! 876, 859, 870, 860, 853, 858, 659, 0, 673, 0, ! 657, 624, 618, 626, 625, 617, 0, 0, 0, 0, ! 0, 0, 613, 634, 0, 459, 458, 446, 633, 0, ! 882, 0, 629, 415, 448, 460, 438, 439, 464, 0, ! 528, 532, 674, 675, 874, 874, 676, 545, 546, 548, ! 874, 551, 550, 0, 0, 462, 882, 843, 189, 189, ! 679, 189, 882, 843, 613, 105, 613, 111, 894, 894, ! 918, 923, 889, 889, 889, 0, 928, 0, 0, 0, ! 0, 0, 0, 424, 0, 0, 0, 344, 0, 342, ! 343, 0, 0, 255, 192, 313, 674, 675, 314, 315, ! 0, 0, 489, 516, 0, 306, 305, 834, 833, 0, ! 303, 302, 300, 301, 299, 298, 297, 295, 296, 293, ! 294, 288, 289, 290, 291, 292, 286, 287, 0, 0, ! 0, 0, 0, 0, 0, 238, 252, 0, 0, 237, ! 613, 613, 0, 613, 610, 715, 0, 0, 0, 0, ! 0, 372, 0, 376, 0, 378, 0, 617, 726, 725, ! 718, 722, 721, 873, 0, 0, 740, 0, 0, 882, ! 402, 882, 728, 613, 843, 0, 0, 0, 727, 723, ! 0, 0, 613, 0, 617, 0, 0, 0, 0, 197, ! 0, 877, 181, 185, 317, 179, 172, 170, 179, 0, ! 507, 519, 604, 0, 222, 221, 220, 219, 282, 281, ! 0, 279, 278, 276, 277, 275, 274, 273, 270, 271, ! 272, 268, 269, 263, 264, 265, 266, 267, 261, 262, ! 471, 0, 0, 26, 0, 0, 695, 0, 40, 46, ! 45, 59, 56, 49, 57, 0, 50, 0, 0, 58, ! 526, 0, 169, 179, 179, 167, 180, 331, 330, 19, ! 21, 73, 95, 452, 808, 150, 156, 143, 157, 158, ! 0, 0, 139, 0, 0, 0, 0, 485, 0, 134, ! 617, 726, 722, 727, 723, 0, 617, 637, 0, 613, ! 728, 0, 727, 723, 0, 337, 0, 669, 0, 871, ! 0, 0, 884, 0, 0, 0, 0, 456, 632, 631, ! 455, 186, 553, 552, 874, 874, 874, 0, 579, 675, ! 0, 569, 0, 0, 0, 582, 0, 131, 126, 0, ! 182, 583, 586, 0, 0, 561, 0, 129, 573, 104, ! 0, 0, 0, 0, 110, 0, 882, 843, 882, 843, ! 927, 926, 891, 890, 892, 318, 356, 0, 362, 363, ! 0, 0, 0, 0, 343, 346, 751, 0, 0, 0, ! 0, 256, 0, 347, 349, 352, 250, 249, 240, 0, ! 239, 254, 0, 0, 712, 710, 0, 713, 0, 245, ! 0, 0, 189, 379, 0, 0, 0, 719, 618, 724, ! 720, 731, 613, 739, 737, 738, 0, 729, 882, 0, ! 735, 0, 233, 235, 671, 672, 727, 723, 0, 368, ! 880, 177, 179, 179, 175, 609, 607, 505, 0, 470, ! 468, 313, 0, 24, 32, 702, 60, 55, 62, 66, ! 64, 165, 163, 72, 815, 0, 141, 0, 145, 0, ! 147, 0, 149, 0, 97, 0, 486, 618, 726, 722, ! 727, 723, 0, 613, 642, 728, 0, 0, 672, 364, ! 365, 670, 366, 861, 855, 856, 854, 886, 885, 887, ! 0, 0, 0, 0, 618, 0, 0, 453, 184, 0, ! 555, 554, 549, 613, 843, 578, 0, 570, 583, 571, ! 464, 464, 567, 568, 565, 566, 613, 843, 313, 674, ! 0, 451, 127, 574, 584, 589, 590, 451, 451, 0, ! 0, 451, 125, 575, 587, 451, 0, 464, 0, 562, ! 563, 564, 464, 613, 320, 319, 321, 613, 107, 0, ! 113, 0, 0, 0, 0, 0, 0, 746, 0, 492, ! 0, 490, 259, 304, 0, 241, 242, 251, 253, 711, ! 709, 716, 714, 0, 246, 0, 0, 371, 375, 377, ! 882, 733, 613, 734, 173, 171, 280, 0, 473, 475, ! 816, 809, 813, 142, 140, 0, 0, 0, 746, 487, ! 726, 722, 0, 728, 343, 0, 883, 617, 457, 0, ! 547, 882, 0, 0, 572, 482, 482, 882, 0, 0, ! 0, 464, 464, 0, 464, 464, 0, 464, 0, 560, ! 512, 0, 482, 882, 882, 613, 613, 351, 0, 0, ! 0, 0, 0, 215, 752, 0, 747, 748, 491, 0, ! 0, 243, 717, 380, 319, 736, 882, 0, 0, 814, ! 144, 146, 148, 98, 727, 723, 0, 618, 0, 888, ! 454, 121, 613, 613, 843, 577, 581, 124, 613, 464, ! 464, 598, 482, 313, 674, 0, 585, 591, 592, 451, ! 451, 482, 482, 0, 482, 588, 501, 576, 103, 109, ! 882, 882, 358, 359, 360, 361, 480, 0, 0, 0, ! 742, 753, 760, 741, 0, 749, 493, 612, 732, 474, ! 0, 817, 617, 882, 882, 0, 882, 597, 594, 596, ! 0, 0, 464, 464, 464, 593, 595, 580, 0, 106, ! 112, 0, 750, 745, 218, 0, 216, 744, 743, 313, ! 674, 675, 754, 767, 770, 773, 778, 0, 0, 0, ! 0, 0, 0, 0, 0, 314, 802, 810, 0, 830, ! 806, 805, 804, 0, 762, 0, 0, 424, 766, 761, ! 803, 930, 0, 0, 930, 119, 122, 613, 123, 464, ! 464, 603, 482, 482, 503, 0, 502, 497, 481, 217, ! 823, 825, 826, 0, 0, 758, 0, 0, 0, 785, ! 787, 788, 789, 0, 0, 0, 0, 0, 0, 0, ! 824, 930, 398, 831, 0, 763, 396, 451, 0, 397, ! 0, 451, 0, 0, 764, 801, 800, 821, 822, 818, ! 882, 602, 600, 599, 601, 0, 0, 514, 207, 0, ! 755, 768, 757, 0, 930, 0, 0, 0, 781, 930, ! 790, 0, 799, 41, 155, 36, 155, 0, 37, 811, ! 0, 394, 395, 0, 0, 0, 393, 758, 120, 500, ! 499, 92, 95, 214, 0, 424, 0, 758, 758, 771, ! 0, 746, 828, 774, 0, 0, 0, 930, 786, 798, ! 42, 38, 815, 0, 765, 0, 498, 208, 451, 756, ! 769, 0, 759, 829, 0, 827, 779, 783, 782, 812, ! 835, 835, 0, 496, 494, 495, 464, 205, 0, 0, ! 211, 0, 210, 758, 930, 0, 0, 0, 836, 837, ! 0, 791, 0, 0, 772, 775, 780, 784, 0, 0, ! 0, 0, 0, 0, 835, 0, 212, 206, 0, 0, ! 0, 841, 0, 794, 838, 0, 0, 792, 0, 0, ! 839, 0, 0, 0, 0, 0, 0, 213, 776, 0, ! 842, 796, 797, 0, 793, 758, 0, 0, 777, 840, ! 795, 0, 0, 0 }; static const short yydefgoto[] = { ! 1831, 462, 2, 463, 171, 811, 346, 187, 3, 4, ! 38, 141, 776, 394, 39, 777, 1175, 1611, 41, 414, ! 1658, 781, 42, 43, 424, 44, 1176, 788, 1091, 789, ! 790, 791, 46, 178, 179, 47, 820, 190, 186, 480, ! 1438, 48, 49, 907, 1197, 913, 1199, 50, 1178, 1179, ! 191, 192, 821, 481, 1121, 1122, 734, 1123, 242, 51, ! 1104, 1103, 800, 797, 1273, 1272, 1048, 1045, 140, 1102, ! 52, 244, 53, 1042, 640, 347, 348, 349, 350, 632, ! 1769, 1690, 1771, 1724, 1808, 1484, 387, 1031, 351, 678, ! 989, 352, 388, 389, 354, 355, 376, 55, 266, 782, ! 443, 160, 56, 57, 356, 635, 357, 358, 359, 360, ! 822, 361, 1614, 541, 699, 362, 1181, 494, 225, 495, ! 363, 226, 364, 365, 62, 508, 227, 204, 217, 64, ! 522, 542, 1449, 875, 1336, 205, 218, 65, 555, 876, ! 66, 67, 772, 773, 774, 1547, 486, 952, 953, 1722, ! 1687, 1636, 1578, 68, 739, 378, 904, 1536, 1637, 1220, ! 735, 69, 70, 71, 72, 73, 253, 897, 898, 899, ! 900, 1183, 1378, 1184, 1185, 1186, 1363, 1373, 1364, 1526, ! 1365, 1366, 1527, 1528, 736, 737, 738, 679, 1019, 367, ! 198, 520, 513, 207, 75, 76, 77, 148, 149, 163, ! 79, 136, 368, 369, 370, 81, 391, 83, 902, 127, ! 128, 129, 561, 110, 84, 392, 994, 995, 1014, 1010, ! 702, 1549, 1550, 1485, 1486, 1487, 1551, 1397, 1552, 1618, ! 1643, 1727, 1693, 1694, 1553, 1619, 1717, 1644, 1728, 1645, ! 1751, 1646, 1754, 1798, 1825, 1647, 1773, 1737, 1774, 1699, ! 482, 818, 1294, 1620, 1661, 1742, 1431, 1432, 1498, 1624, ! 1726, 1561, 1621, 1733, 1664, 959, 1777, 1778, 1779, 1802, ! 499, 1015, 855, 1151, 1326, 501, 502, 503, 851, 504, ! 154, 853, 1188, 93, 725, 860, 1329, 1330, 612, 87, ! 572, 88, 942 }; static const short yypact[] = { ! 166, 189,-32768,-32768, 2909,-32768, 58, 121, 405, 440, ! 60, 158,-32768,-32768, 1066,-32768,-32768, 107, 228,-32768, ! -32768,-32768, 1235, 1578, 1102, 254,-32768,-32768, 281, 504, ! -32768, 1072, 1072,-32768, 2487,-32768, 2909, 304,-32768,-32768, ! 351,-32768, 152,-32768,-32768, 4624,-32768,-32768, 315, 911, ! 401, 371, 442,-32768,-32768,-32768,-32768, 529, 2462,-32768, ! 7370,-32768, 409, 3123, 867,-32768, 477,-32768,-32768, 996, ! 577, 724,-32768, 458, 7869,-32768,-32768,-32768, 830,-32768, ! -32768,-32768, 826,-32768,-32768, 2245,-32768, 6505, 449,-32768, ! -32768,-32768, 11743, 533,-32768, 11743,-32768, 11743,-32768,-32768, ! -32768, 405, 440, 281, 495,-32768, 505, 442,-32768, 1885, ! -32768, 331, 11836, 464,-32768,-32768,-32768,-32768,-32768, 94, ! 535, 508, 572, 617, 545, 553,-32768,-32768, 1913,-32768, ! 1588, 405, 440,-32768, 281, 495,-32768, 1376, 3330, 563, ! 13256, 565, 11743,-32768, 11743, 645, 7187, 2200,-32768,-32768, ! 1396, 3508, 2200,-32768, 1697, 5083, 5083, 2487, 607, 618, ! -32768, 529, 327, 620, 632,-32768,-32768, 742,-32768, 649, ! -32768, 6188,-32768,-32768, 254, 5248, 663,-32768,-32768,-32768, ! 315, 1800, 13317, 878, 707,-32768,-32768, 689, 477, 783, ! 162, 407, 729,-32768,-32768,-32768, 9182, 10694,-32768,-32768, ! 6052, 6052, 7434, 830, 893,-32768,-32768, 629,-32768,-32768, ! 1596,-32768,-32768,-32768,-32768,-32768, 3123, 918,-32768, 477, ! 830, 11836,-32768,-32768,-32768, 1297, 3123,-32768, 477,-32768, ! 1800,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 722, 877, 442,-32768, 477, 2005, 1719,-32768,-32768, ! -32768,-32768,-32768, 748,-32768, 2045, 477, 331,-32768, 740, ! 443, 1315, 745,-32768, 196,-32768,-32768,-32768,-32768,-32768, ! 6289,-32768, 495,-32768,-32768,-32768,-32768, 2473,-32768, 730, ! 737,-32768,-32768,-32768,-32768, 785,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 705,-32768, ! -32768, 2045, 7869, 342,-32768, 757,-32768,-32768,-32768,-32768, ! -32768, 12953, 12953, 762,-32768,-32768,-32768,-32768,-32768, 765, ! 806, 822, 824, 836, 1108, 12301, 1833, 12953,-32768,-32768, ! 12953,-32768,-32768, 12953, 9480,-32768, 12953, 364, 865,-32768, ! 12953,-32768, 12394,-32768, 8489, 288, 1023, 3814, 12487,-32768, ! 907, 485,-32768, 991, 13046, 13139, 5389, 5285,-32768, 435, ! -32768, 1469, 2101, 869, 364, 364, 11743, 13256, 973,-32768, ! 904, 1833, 745,-32768,-32768, 12581, 855, 906,-32768, 13413, ! 874, 1819, 2400, 1613, 649,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 535, 508, 572, 1833, 617, 545, 909, ! 553,-32768, 933,-32768, 3467, 904, 405, 440,-32768,-32768, ! -32768,-32768,-32768,-32768, 5180,-32768, 1800, 7547, 857,-32768, ! -32768, 364, 588, 11743,-32768, 7187,-32768, 3944,-32768, 948, ! 953,-32768,-32768,-32768, 327, 2200,-32768,-32768, 2200,-32768, ! 929,-32768,-32768,-32768, 327, 327, 327,-32768,-32768,-32768, ! 6289, 86, 931, 935,-32768,-32768,-32768,-32768, 13256,-32768, ! 930, 975,-32768,-32768, 742,-32768, 477,-32768,-32768,-32768, ! -32768, 979,-32768,-32768, 10136, 12581,-32768,-32768, 939,-32768, ! 906, 943, 13413, 383, 2035, 13317, 2035, 2020, 6996, 949, ! -32768, 253, 2838, 1006, 1012, 757,-32768, 950, 498, 74, ! 7877, 6382,-32768,-32768, 6382,-32768, 6600, 6600, 7434, 8192, ! 955,-32768, 477, 1800,-32768, 10787,-32768,-32768, 6649, 1297, ! 3123, 1800,-32768, 477, 978, 983,-32768,-32768, 1297,-32768, ! 477, 1070,-32768, 11743,-32768,-32768, 904, 745, 722,-32768, ! -32768, 2005, 1677,-32768, 2045, 477,-32768,-32768,-32768, 1018, ! 1031, 1058, 1047,-32768,-32768,-32768,-32768, 7187,-32768, 1005, ! -32768, 564,-32768, 1024,-32768, 1029,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 2045,-32768,-32768, 685, ! -32768, 640,-32768, 11743, 12581,-32768,-32768, 12581, 11836, 8172, ! 8172, 8172, 8172, 8489,-32768,-32768,-32768,-32768, 1034, 12674, ! 12674, 9480, 1054, 192, 1077,-32768, 1082,-32768,-32768,-32768, ! 1150, 11743,-32768, 9573, 9480,-32768, 12301, 12301, 10229, 12301, ! 12301, 12301, 12301, 12301, 12301, 12301, 12301, 12301, 12301, 12301, ! 12301, 12301, 12301, 12301, 12301, 12301, 12301,-32768, 12581,-32768, ! -32768,-32768,-32768,-32768, 12581, 12581, 12581, 11836, 3924, 597, ! 815, 10880,-32768,-32768,-32768, 1101, 1315, 1169, 567, 603, ! 687, 2587, 640,-32768, 2359, 2359, 3337, 10973, 1085, 1133, ! -32768,-32768, 741, 9480,-32768, 9480,-32768, 11367, 1236,-32768, ! 876, 331,-32768,-32768, 12581, 1315,-32768,-32768, 281,-32768, ! -32768,-32768, 393, 449, 12581, 1132,-32768,-32768, 364,-32768, ! 1800, 2987,-32768,-32768, 1130,-32768, 1098, 1149,-32768, 973, ! 909, 13484,-32768, 10415, 10508, 12581, 12581, 10229, 12581, 12581, ! 12581, 12581, 12581, 12581, 12581, 12581, 12581, 12581, 12581, 12581, ! 12581, 12581, 12581, 12581, 12581, 12581, 12581,-32768,-32768,-32768, ! -32768,-32768, 129,-32768, 1118, 1115, 649, 3467, 1173, 11743, ! -32768, 1168,-32768,-32768, 3330, 1704, 1155, 1196, 613, 1170, ! 1177,-32768,-32768, 4050, 996,-32768, 1179,-32768,-32768,-32768, ! -32768,-32768,-32768, 364,-32768,-32768, 1126, 1138,-32768, 1184, ! -32768,-32768, 315,-32768,-32768,-32768,-32768, 90,-32768, 528, ! -32768,-32768,-32768,-32768, 9368, 13484,-32768, 1140,-32768,-32768, ! -32768,-32768,-32768, 1898, 1898, 4226,-32768,-32768,-32768,-32768, ! 1596, 2245,-32768, 11461,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768, 1012, 1192,-32768,-32768,-32768, 11929, 1133, 692, ! -32768,-32768, 7877,-32768,-32768, 8192, 6382, 6382, 6823, 6823, ! 8192, 876,-32768,-32768, 6649,-32768, 1193,-32768,-32768, 1151, ! 74, 7877,-32768, 1297,-32768,-32768,-32768,-32768, 477, 1188, ! 722,-32768, 508, 572,-32768,-32768, 553, 1189,-32768,-32768, ! 137,-32768,-32768, 2177, 6742,-32768, 74, 6934, 11743, 11743, ! -32768, 11743, 74, 6934,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768, 1425, 1425, 1425, 1008,-32768, 364, 1159, 13439, ! 1160, 1161, 1194, 5788, 1197, 1201, 1204,-32768, 1164,-32768, ! -32768, 1174, 1222,-32768,-32768, 1221, 363, 469, 392, 866, ! 12581, 1223,-32768, 1225, 1187, 8489, 8489,-32768,-32768, 1234, ! 13312, 8944, 7399, 5868, 5598, 5991, 4656, 3360, 3360, 2388, ! 2388, 1732, 1732, 998, 998, 998,-32768,-32768, 1200, 1203, ! 1202, 1191, 1212, 1214, 8172, 597,-32768, 10136, 12581,-32768, ! -32768,-32768, 12581,-32768,-32768, 1229, 12953, 1213, 1245, 1262, ! 1296,-32768, 12581,-32768, 12581,-32768, 12581, 2708, 2624,-32768, ! -32768, 2624,-32768, 139, 1240, 1243,-32768, 1242, 8172, 74, ! -32768, 74, 3264,-32768, 6934, 11066, 1247, 1249, 11555, 11555, ! 8848, 1251, 12394, 1255, 2119, 4340, 2400, 1304, 1256, 1031, ! 1263,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 12581, ! -32768, 1833,-32768, 1261,-32768, 13484,-32768, 13484, 13484, 13484, ! 1313, 7561, 5576, 8216, 7900, 5890, 4525, 5728, 3691, 3691, ! 3691, 2502, 2502, 1761, 1761, 1049, 1049, 1049,-32768,-32768, ! 1613, 1273, 12767,-32768, 1278, 1321,-32768, 364,-32768,-32768, ! -32768,-32768,-32768,-32768, 1737, 5180,-32768, 8172, 11743,-32768, ! 1112, 12301,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768, 315,-32768,-32768,-32768, 535,-32768, 617, 545, ! 12581, 202,-32768, 699, 702, 709, 1329,-32768, 111,-32768, ! 4503, 2134, 2134, 3038, 3038, 4226, 4977, 83, 1596,-32768, ! 3179, 4413, 11649, 11649, 9072, 224, 1284, 356, 3050,-32768, ! 10136, 9669,-32768, 6619, 2666, 2666, 3164,-32768,-32768,-32768, ! 1331,-32768,-32768,-32768,-32768,-32768,-32768, 2093,-32768, 1043, ! 1217,-32768, 12581, 8459, 8037,-32768, 8037, 216, 216, 514, ! 772, 5485, 7528, 79, 7166,-32768, 227, 216,-32768,-32768, ! 1286, 364, 364, 364,-32768, 1294, 74, 6934, 74, 6934, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768, 8172,-32768,-32768, ! 1310, 1312, 1316, 1320, 1126,-32768,-32768, 13347, 10136, 9764, ! 1299,-32768, 12301,-32768,-32768,-32768,-32768,-32768, 616, 1298, ! -32768,-32768, 1308, 229, 601, 601, 1307, 601, 12581,-32768, ! 12953, 1416, 11743,-32768, 1317, 1335, 1338,-32768, 2708,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 2708,-32768, 74, 1341, ! -32768, 1339,-32768,-32768,-32768,-32768, 4406, 4406, 4903,-32768, ! -32768,-32768,-32768,-32768,-32768, 13484,-32768,-32768, 12581,-32768, ! -32768, 230, 1343,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 8489,-32768,-32768,-32768, 1356, 1348,-32768, 459,-32768, 12581, ! -32768, 12581,-32768, 12581,-32768, 9857,-32768, 4503, 2134, 2134, ! 4725, 4725, 6322,-32768, 457, 3179, 4503, 1350, 537, 559, ! 749, 751, 311,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 232, 3445, 3445, 1893, 1893, 1893, 10136,-32768,-32768, 1677, ! -32768,-32768,-32768,-32768, 6934, 13484, 240,-32768, 3821,-32768, ! 477, 477,-32768,-32768,-32768,-32768,-32768, 6934, 497, 602, ! 12581, 1070,-32768, 1399,-32768,-32768,-32768, 451, 542, 826, ! 3508, 566, 216, 1401,-32768, 746, 1404, 477, 8341,-32768, ! -32768,-32768, 477,-32768,-32768, 1420,-32768,-32768,-32768, 1367, ! -32768, 1370, 1372, 12581, 12581, 12581, 12581, 75, 10136,-32768, ! 1418,-32768,-32768, 8489, 12581,-32768, 616,-32768,-32768,-32768, ! -32768,-32768,-32768, 1373,-32768, 1440, 364,-32768,-32768,-32768, ! 74,-32768,-32768,-32768,-32768,-32768, 13484, 12581,-32768,-32768, ! -32768, 1356,-32768,-32768,-32768, 1380, 1383, 1385, 75,-32768, ! 3645, 3645, 876, 3660, 753, 6619,-32768, 1893,-32768, 10136, ! -32768, 74, 1386, 775,-32768, 1430, 1430, 74, 1390, 12581, ! 12581, 7042, 477, 6894, 477, 477, 4759, 477, 8334,-32768, ! -32768, 8949, 1430, 74, 74,-32768,-32768,-32768, 1392, 1393, ! 1394, 1397, 1833,-32768,-32768, 8738, 1482,-32768,-32768, 10136, ! 1405,-32768,-32768,-32768,-32768,-32768, 74, 1407, 1427,-32768, ! -32768,-32768,-32768,-32768, 4188, 4188, 3528, 4298, 4298,-32768, ! -32768,-32768,-32768,-32768, 6934,-32768,-32768,-32768,-32768, 7042, ! 7042,-32768, 1430, 549, 902, 12581,-32768,-32768,-32768, 1070, ! 1070, 1430, 1430, 1005, 1430,-32768,-32768,-32768,-32768,-32768, ! 74, 74,-32768,-32768,-32768,-32768,-32768, 1067, 246, 8604, ! -32768,-32768,-32768,-32768, 11177,-32768,-32768,-32768,-32768,-32768, ! 7298,-32768, 4298, 74, 74, 1410, 74,-32768,-32768,-32768, ! 12581, 12581, 7042, 477, 477,-32768,-32768,-32768, 7710,-32768, ! -32768, 1833,-32768,-32768,-32768, 251,-32768,-32768,-32768, 1458, ! 905, 954,-32768,-32768,-32768,-32768,-32768, 12581, 1467, 1470, ! 1475, 12022, 295, 1833, 701, 655,-32768,-32768, 12115, 1531, ! -32768,-32768,-32768, 1480,-32768, 4123, 13210, 5661, 1528,-32768, ! -32768, 1435, 1437, 1439,-32768,-32768,-32768,-32768,-32768, 7042, ! 7042,-32768, 1430, 1430,-32768, 10601,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 778, 778, 1489, 1462, 1466, 4801,-32768, ! -32768,-32768,-32768, 1499, 12581, 1500, 1501, 1510, 2271, 2295, ! -32768,-32768,-32768,-32768, 1474,-32768,-32768, 1070, 1084,-32768, ! 1137, 1070, 12208, 1145,-32768,-32768,-32768,-32768,-32768,-32768, ! 74,-32768,-32768,-32768,-32768, 1463, 13369, 1471,-32768, 11836, ! -32768,-32768,-32768, 1556,-32768, 9275, 11836, 12581,-32768,-32768, ! -32768, 1513,-32768,-32768, 1523,-32768, 1510, 2271,-32768,-32768, ! 742,-32768,-32768, 12860, 12860, 9950,-32768, 1489,-32768,-32768, ! -32768, 401, 315,-32768, 1484, 718, 1800, 1489, 1489,-32768, ! 11272, 75,-32768,-32768, 1521, 1486, 13462,-32768,-32768,-32768, ! -32768,-32768, 1356, 175,-32768, 163,-32768,-32768, 1070,-32768, ! -32768, 828,-32768,-32768, 10043,-32768,-32768,-32768,-32768, 1356, ! 64, 64, 1527,-32768,-32768,-32768, 477,-32768, 12581, 1540, ! -32768, 1541,-32768, 1489,-32768, 1511, 1833, 161, 1543,-32768, ! 100,-32768, 1544, 1502,-32768,-32768,-32768,-32768, 12581, 1497, ! 742, 1551, 64, 742, 64, 1560,-32768,-32768, 10322, 1516, ! 1615, 907, 267,-32768,-32768, 349, 239,-32768, 10136, 1519, ! -32768, 1535, 742, 1569, 1573, 742, 1577,-32768,-32768, 12581, ! 907,-32768,-32768, 368,-32768, 1489, 1532, 1580,-32768,-32768, ! -32768, 1649, 1658,-32768 }; static const short yypgoto[] = { ! -32768, 1661,-32768, -330, 1487, -401, 44, -3, 1662,-32768, ! 1632,-32768,-32768,-32768, -1477,-32768, 280,-32768, -1476,-32768, ! 11, 894, 37, -387,-32768,-32768, 97,-32768, -725,-32768, ! -32768, 579, 36, 1508, 1207, 1515,-32768, -31, -178, -808, ! -32768, -21, 186,-32768,-32768,-32768,-32768,-32768, 510,-32768, ! -32768,-32768,-32768,-32768,-32768, 399, -14,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 1598, -759, ! 7802, -180, 28, -681, -247, -70, 1555, -603,-32768, 131, ! -32768, 62,-32768, -1574,-32768, -1370, 39, 1266, -322,-32768, ! -935, 7005, 5257, 6906, 1950, 4998, 1391, -343, -66, -81, ! 834, -134, -76, 119,-32768,-32768,-32768, -340,-32768, -162, ! -32768,-32768, -1524, 61, -349, 4916, 54, 17, -101, 43, ! 59, -204,-32768,-32768,-32768, -1, -165, -168, -166, 0, ! -38, -266,-32768, -397,-32768,-32768,-32768,-32768,-32768, 555, ! 1354, 3136,-32768, 633,-32768,-32768, -1325, -480, 891,-32768, ! -32768,-32768,-32768, 42,-32768,-32768,-32768,-32768,-32768,-32768, ! 980, -390,-32768,-32768,-32768,-32768,-32768,-32768, 379, 552, ! -32768,-32768,-32768, 347, -1068,-32768,-32768,-32768,-32768,-32768, ! -32768, 544,-32768, 260, 992,-32768, 679, 1056, 2999, 81, ! 1536, 2626, 1770,-32768, -516,-32768, 12, 1899, 3865, -136, ! 298, -63, 5586, 1374,-32768, 6554, 2282, 1962, -16, -108, ! -32768, 1622, -58,-32768, 6007, 3657, -69,-32768, 3173, 524, ! -32768,-32768, 203,-32768,-32768, 272, 1124,-32768, -1252,-32768, ! -32768,-32768, -1512,-32768, -1449, 31,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 20,-32768,-32768,-32768,-32768,-32768, 24, -1364,-32768,-32768, ! -56,-32768,-32768,-32768,-32768, -738, -1420,-32768, -24, -1376, ! -762, -173, 919,-32768,-32768,-32768,-32768, -410,-32768, -409, ! -213,-32768, 99,-32768,-32768, 2380, 338,-32768, 92,-32768, ! 5700, -243, -766 }; ! ! #define YYLAST 13571 ! ! static const short yytable[] = { ! 106, 37, 469, 63, 826, 461, 267, 126, 119, 1060, ! 1114, 188, 530, 470, 795, 796, 471, 708, 562, 446, ! 449, 59, 413, 500, 180, 374, 108, 375, 458, 719, ! 645, 313, 720, 37, 794, 63, 901, 787, 944, 552, ! 258, 1105, 704, 706, 63, 183, 1043, 60, 36, 719, ! 1230, 554, 720, 59, 1126, 241, 420, 421, 58, 216, ! 537, 539, 59, 61, 775, 812, 549, 1499, 1503, 1099, ! 412, 419, 431, 255, 267, 422, 1775, 1610, 1612, 60, ! 36, 177, 176, 566, 1662, 74, 311, 184, 182, 175, ! 58, 366, 795, 852, 366, 61, 366, 274, 683, 181, ! 1588, 45, 683, 86, 61, 229, 1347, 606, 1349, 1482, ! 264, 366, 147, 152, 409, 529, 1379, 74, 1376, 203, ! 1106, 89, 1735, 383, -879, 538, 74, 726, 727, 723, ! 1515, 1516, -636, 45, 267, 86, 885, 98, 859, 428, ! 441, 366, 45, 366, 1165, 1190, 310, 1537, 708, 723, ! 466, 1195, 830, 161, 180, 395, 1793, 59, 905, 858, ! 1776, 396, 606, 478, 1763, 1794, -1, 90, 312, 91, ! 63, 1732, 1676, 1305, 63, 183, 1166, 430, -636, -636, ! 1772, 216, 533, 427, 801, 802, 1483, 683, 59, -2, ! 1377, 1080, 59, -636, 426, 497, 809, 1569, 92, 61, ! 1113, 831, 112, 1296, 832, 1744, 1575, 1576, 99, 1577, ! 1795, 177, 176, 169, 60, 1749, 1750, 184, 182, 175, ! 366, 74, 1306, -137, -137, 58, 1790, -137, -137, 181, ! 61, 1760, 548, 550, 61, 490, 445, 448, 45, 1081, ! 1761, 667, 203, 386, 15, 564, 215, 560, -451, 943, ! 1738, 170, 74, 1610, 1612, 496, 74, 877, 229, 479, ! 479, 1786, 1259, -136, 1297, 884, 846, 229, 229, 274, ! 86, 1791, 45, -334, 161, 161, 161, 498, 693, -451, ! 689, 511, 514, -451, 40, 1762, 1271, 668, 1758, 1274, ! 1380, 565, 1427, 1405, 1445, 688, 96, 229, 100, 114, ! 115, 680, -327, 1124, 1815, 571, 728, 1683, 1684, 1583, ! 458, 255, 817, 1828, 1583, 847, 40, 97, 848, -334, ! -334, 161, 624, 113, 857, 1787, 425, -451, 507, 1812, ! 271, 139, 164, 10, -327, 8, 9, 667, 1381, 1408, ! 1428, 1780, 1446, 366, 1291, 1292, 131, 132, 778, 1816, ! 1453, 783, 534, 229, 116, 117, 311, 1584, 142, 18, ! -312, 1753, 1639, 803, 537, 539, 255, 740, 215, 1286, ! 21, 891, 1679, 537, 1806, 366, 731, 1813, 1654, 771, ! 446, 449, 720, 668, 274, 458, 452, 453, 314, 539, ! 134, 135, 740, 1692, 59, 1499, 830, 1094, 26, 167, ! 454, 134, 135, 1379, 274, -661, -312, -312, 229, 1709, ! 455, 1812, 1111, 1112, 168, 607, 310, 1805, 33, 94, ! 427, -312, 456, 793, 185, 608, 216, 189, -152, 883, ! 1812, 730, 366, 324, 193, 1389, 61, 1391, 312, 1823, ! 95, 539, 638, 562, 639, 831, 1084, 814, 832, 26, ! -873, -661, -661, 164, 164, 164, 483, -154, 74, 1814, ! 1115, 94, 1116, 892, 893, 1692, -661, 63, 183, 142, ! 229, 1491, 562, 889, 484, 1692, 1692, -399, 1827, 15, ! 1338, 1044, 95, 496, 713, 59, 684, 798, 271, 416, ! 417, 10, 557, 685, 216, 1289, 96, 255, 194, 96, ! 164, 793, 485, 888, 221, 498, -635, 1231, 1117, 18, ! 184, 182, -399, 1424, 1425, 26, -399, 97, 1118, 1119, ! 97, 1692, 181, 252, 490, 96, 314, 61, 21, 1115, ! 714, 1116, 892, 893, -153, 686, 373, 890, 558, 229, ! 1352, 26, 366, 927, 28, 272, 97, 693, -399, 74, ! -336, 143, -635, -635, 1120, 836, 1107, 842, 844, 393, ! 143, 496, 1459, 729, 398, -336, 379, -635, -400, -336, ! 15, 229, 229, 1692, 433, 1353, 687, 1117, 195, 1354, ! 229, 144, 1452, 498, 26, 95, -336, 1118, 1119, -138, ! -138, 397, -130, 857, 15, 1458, 229, 866, 867, -336, ! -336, 401, -336, -400, -336, 131, 132, -400, -313, 402, ! 566, 1355, 366, 916, 1570, 174, 1001, 366, 933, 933, ! 933, 933, 680, 1120, 196, 197, 433, -130, 399, 951, ! 366, -130, -336, -336, 1110, 161, 161, 161, 248, -400, ! 366, 423, 249, 366, 131, 132, 986, -336, 229, 97, ! 641, 901, 1003, 490, -313, -313, 879, 26, 94, 917, ! 134, 135, 1002, -130, 987, 986, 638, 1460, 639, -313, ! 1323, 1325, 999, 400, 990, 1095, 366, 311, 195, 95, ! 1205, 1162, 1163, 987, 991, 795, 796, 1167, 380, 131, ! 132, 1096, 988, 719, 142, 793, 720, 992, 1004, 134, ! 135, 1039, 366, 1089, 366, 794, 497, 490, 787, 1087, ! 645, 988, 1404, 490, 783, 490, 490, -327, 537, 1554, ! 1660, 1090, 433, 274, 196, 525, 223, 224, 451, 606, ! 459, 458, 142, 14, 500, 381, 1005, 310, 1399, 1401, ! 500, 1152, -656, 475, 382, 135, 490, 133, 1298, 930, ! 18, 1300, 1565, 490, 318, 496, 20, 26, 1302, 312, ! -7, 1657, 170, 490, 267, 23, 496, 693, 263, 126, ! 473, 1092, -128, 229, 15, 1008, 1011, 498, 366, 958, ! 1100, 1124, 1006, 1554, 474, 250, 477, 1153, 498, 251, ! 1023, 1046, 487, 723, 1299, 413, 556, 1301, -311, 543, ! -662, 563, -336, 1125, 1303, 1320, 980, -128, 720, 553, ! 951, -128, 997, 857, 164, 164, 164, 433, 604, 131, ! 132, 1356, 142, 901, 1513, 1401, 573, 1688, 1017, 259, ! 8, 260, 10, 575, 793, 229, 1024, 1025, 1191, 1192, ! 1285, 1193, 497, -128, -311, -311, -662, -662, -336, -336, ! 581, 500, 614, 274, 844, 1554, 1448, 617, 15, -311, ! 618, -662, -451, -330, 222, 223, 224, 1357, 159, 21, ! 1514, 26, 14, 1689, 134, 135, 261, 1767, 958, 380, ! 8, 9, 490, 619, 858, 262, 29, 701, 990, 18, ! 709, 712, -451, -451, 496, 20, 490, -451, 991, 620, ! 458, 621, 496, 63, 23, 1322, 793, 366, 366, 263, ! 366, 992, 793, 622, 1131, 1132, 498, 33, 1488, 683, ! 799, 59, 143, 1768, 498, 229, 381, 641, 1730, 230, ! 231, -155, 1180, 1554, 1293, 382, 135, 1764, 544, 15, ! 230, 472, 545, -451, 1384, 1385, 1386, 1182, 1174, 1154, ! 1155, 1339, 1340, 1341, 161, 523, 524, 1734, 94, 263, ! 556, 94, 161, 61, 724, 742, 496, 1571, 743, 1510, ! 1641, 1554, 496, -451, -451, 229, 100, 114, 115, 95, ! 531, 532, 95, 933, 767, 74, 779, 1233, 498, 780, ! 447, 450, 523, 815, 498, 131, 132, 446, 449, 100, ! 101, 102, 458, 233, 234, 235, 446, 449, 1554, 1556, ! 96, 380, 131, 132, 1202, 1203, 1204, 933, 838, 1642, ! 701, 709, 712, 793, 500, 95, 500, 490, 18, 497, ! 97, 97, 116, 117, 236, 733, 159, 531, 816, 806, ! 693, 490, -6, 490, 819, 490, 810, 26, 274, 828, ! 134, 135, 26, 829, 914, 103, 104, 237, 381, 845, ! 1809, 96, 267, 856, 694, 873, 771, 382, 135, 100, ! 101, 102, 669, -872, 695, 145, 131, 132, 10, 854, ! 1092, 13, 97, 496, 665, 666, 696, 697, 886, 496, ! 1177, 570, 1343, 887, 793, 908, 933, 366, 15, 96, ! 915, 238, 239, 240, 18, 498, 131, 132, 909, 1008, ! 1011, 498, 670, 671, 910, 21, 672, 673, 674, 675, ! 97, 490, 26, 1236, 911, 103, 104, 105, 26, 1581, ! 1582, 28, 29, 164, 793, 765, 766, 918, 1344, 1350, ! 1351, 164, 919, 497, 937, 31, 523, 1711, 133, 1382, ! 795, 1623, 933, -878, 496, 32, 1261, 998, 26, 490, ! 274, 134, 135, 33, 939, 1409, 1410, 34, 1412, 1494, ! -194, 500, 1416, 63, -56, 63, 498, 1000, 634, -56, ! 1018, 216, 1020, 63, 500, 142, -194, 940, -194, 543, ! -56, 59, 943, 59, 496, 1041, 793, 1049, 793, 531, ! 1712, 59, 1180, 496, 1180, 1400, 933, 523, 1716, 1050, ! 1180, 1051, 1180, 1082, 1308, 1309, 498, 1182, 1174, 1182, ! 1174, 131, 132, 1308, 1309, 498, 1083, 1182, 1174, 1086, ! 1348, 1088, 1093, 61, 20, 61, -330, 1097, 100, 114, ! 115, 366, 1362, 61, 1098, -613, 1101, 1109, 1108, -613, ! 1129, 1164, 161, 161, 161, 74, 496, 74, 496, 1150, ! 1157, 161, 161, 161, 1158, 74, 1161, 793, 858, 1206, ! 1208, 1209, 1210, 26, 1214, 1211, 134, 135, 498, 1212, ! 498, 1125, 1213, 1216, 1215, 1020, -151, 1219, 1218, 447, ! 807, 1400, 161, 267, 116, 117, 118, 1221, -613, 1222, ! -613, -613, 1226, -613, 536, 223, 224, 380, 8, 9, ! 1223, 793, 14, 1224, -613, 1225, -613, 709, 100, 114, ! 115, 559, 1227, 1462, 1228, 1238, 1240, 496, 1817, 1464, ! 1465, -613, -613, 1462, 1467, 20, 1241, 1465, 490, 1242, ! 490, 500, 490, 793, 23, 1243, -613, 1008, 1011, 498, ! 1251, 447, 450, 1252, 381, 1253, 793, 1262, 21, 1263, ! 1177, 1264, 1177, 382, 135, 1265, 1269, 1361, 1371, 1413, ! 1177, 496, 1277, 1270, 116, 117, 858, 63, 1278, 415, ! 416, 417, 10, 1280, 1284, 146, 146, 570, 162, 1283, ! 1304, 1440, 1441, 498, 1318, 59, 1383, 264, 1337, 259, ! 131, 132, 10, 496, 1387, 1393, 1180, 1394, 1406, 1362, ! 1402, 1395, 1154, 1155, 219, 1396, 496, 228, 1407, 21, ! 1411, 1182, 1174, 245, 1415, 498, 261, 1417, 256, 131, ! 132, 164, 164, 164, 566, 262, 272, 61, 498, 21, ! 164, 164, 164, 1160, 933, 1418, 261, 1668, 1419, 1673, ! 1670, 1422, 1423, 1429, 1430, 262, 29, 709, 1433, 74, ! 1444, 1463, 491, 1468, 447, 938, 490, 33, 1546, 1469, ! 63, 164, 415, 8, 9, 10, -702, 1475, 634, 263, ! 1476, 26, 1477, 1489, 134, 135, 1492, 33, 59, 1493, ! 1500, 1573, 1574, 1501, 571, 1502, 1512, 484, 607, 1180, ! 1518, 435, 1542, 1543, 1544, 793, 435, 1545, 608, 444, ! 444, 162, 21, 793, 1182, 1174, 1482, 1559, 1557, 715, ! 1627, 606, 1560, 1640, 1478, 1479, 1480, 1481, 262, 272, ! 61, 1247, 1649, 1650, 1361, 1490, 219, 634, 1651, 634, ! 1663, 1033, 476, 1665, 1746, 1674, 1675, 1677, 1743, 1678, ! -930, 1609, 74, 1617, 510, 510, 519, 1695, 1247, 793, ! 33, 1696, 1700, 1702, 1177, 496, 1703, 1638, 396, 1710, ! 228, 59, 1719, 496, 1729, 1721, 1739, 446, 449, 1740, ! 540, 120, 121, 122, 1755, 1440, 1441, 498, 1655, 1656, ! 1781, 120, 121, 122, 1747, 498, 1756, 1616, 1608, 259, ! 8, 9, 10, 1784, 1785, 1792, 1788, 1617, 1615, 228, ! 1800, 1796, 1797, 61, 1803, 216, 100, 114, 115, 496, ! 768, 769, 770, 1807, 567, 59, 1810, 1811, 1801, 1818, ! 1819, 1801, 1821, 533, 26, 74, 1822, 123, 124, 21, ! 1824, 498, 1829, 1830, 1705, 1708, 261, 123, 124, 1832, ! 1820, 1616, 1608, 1801, 1247, 262, 29, 1177, 1833, 229, ! 1247, 1, 1615, 468, 5, 228, 256, 61, 166, 159, ! 1707, 1085, 116, 117, 1287, 813, 1667, 1146, 1667, 263, ! 120, 892, 893, 467, 894, 1613, 465, 33, 1725, 74, ! 1745, 1033, 1372, 1741, 1617, 1725, 1434, 377, 444, 432, ! 100, 439, 440, 447, 807, 613, 1691, 403, 404, 405, ! 1766, 490, 59, 1279, 366, 1128, 895, 1052, 1450, 1342, ! 228, 256, 100, 101, 102, 1471, 1374, 1609, 1535, 1617, ! 1276, 1053, 1653, 26, 985, 690, 123, 124, 1616, 1608, ! 100, 114, 115, 526, 233, 234, 235, 59, 310, 1615, ! 411, 827, 1587, 1725, 61, 310, 103, 117, 1555, 941, ! 26, 1752, 1789, 407, 408, 1765, 1759, 229, 1804, 18, ! 312, 1149, 1247, 1616, 1608, 236, 74, 312, 103, 104, ! 1247, 219, 228, 1509, 1615, 1701, 0, 1748, 0, 61, ! 0, 161, 0, 0, 866, 867, 116, 117, 0, 435, ! 0, 0, 435, 145, 8, 9, 10, 0, 162, 162, ! 162, 74, 0, 310, 567, 662, 663, 664, 665, 666, ! 1723, 0, 415, 8, 9, 10, 958, 1723, 206, 0, ! 0, 1247, 161, 161, 161, 312, 100, 114, 115, 0, ! 1247, 0, 0, 21, 762, 763, 764, 765, 766, 219, ! 0, 228, 256, 0, 0, 0, 26, 0, 0, 28, ! 29, 1613, 21, 447, 938, 862, 0, 0, 862, 261, ! 865, 865, 519, 200, 0, 0, 476, 0, 262, 272, ! 928, 0, 881, 201, 540, 1723, 0, 476, 380, 8, ! 9, 33, 116, 117, 0, 202, 0, 8, 9, 1783, ! 0, 145, 8, 9, 10, 1455, 1456, 13, 540, 476, ! 33, 0, 0, 0, 0, 0, 403, 404, 405, 1799, ! 0, 0, 0, 0, 0, 18, 0, 0, 0, 958, ! 18, 153, 1470, 0, 978, 381, 0, 1472, 0, 0, ! 979, 21, 981, 982, 382, 135, 0, 693, 0, 26, ! 1826, 206, 134, 135, 26, 0, 0, 28, 29, 0, ! 540, 0, 0, 406, 0, 0, 1331, 0, 447, 450, ! 164, 833, 407, 408, 0, 0, 1332, 447, 1317, 0, ! 1038, 834, 0, 162, 162, 444, 0, 0, 1333, 33, ! 1040, 0, 0, 835, 697, 0, 0, 0, 444, 0, ! 206, 0, 0, 0, 0, 0, 0, 159, 546, 101, ! 102, 164, 164, 164, 0, 0, 1521, 1522, 0, 1531, ! 1532, 0, 1534, 145, 8, 9, 10, 222, 223, 224, ! 0, 1247, 1247, 0, 0, 14, 0, 0, 145, 8, ! 9, 10, 0, 0, 269, 0, 436, 0, 1007, 1007, ! 1007, 438, 18, 223, 224, 381, 0, 444, 20, 444, ! 14, 1034, 0, 21, 547, 104, 0, 23, 0, 693, ! 0, 269, 0, 0, 1567, 1568, 26, 18, 21, 28, ! 29, 0, 0, 20, 693, 228, 1247, 0, 0, 0, ! 0, 26, 23, 833, 28, 29, 120, 892, 893, 269, ! 153, 447, 807, 834, 716, 8, 9, 10, 833, 0, ! 0, 33, 269, 0, 0, 843, 697, 0, 834, 0, ! 0, 0, 271, 131, 132, 10, 33, 1631, 1632, 1633, ! 835, 697, 0, 0, 0, 0, 0, 145, 8, 9, ! 10, 324, 717, 254, 21, 447, 807, 228, 245, 26, ! 0, 18, 123, 124, 0, 0, 0, 26, 0, 0, ! 718, 135, 21, 0, 0, 0, 18, 0, 693, 568, ! 0, 0, 269, 0, 0, 26, 0, 21, 28, 272, ! 120, 892, 893, 693, 1681, 1682, 0, 1130, 1130, 1136, ! 26, 0, 1266, 28, 29, 0, 206, 1136, 0, 0, ! 0, 0, 1267, 145, 131, 132, 10, 833, 269, 254, ! 33, 162, 0, 0, 1268, 697, 0, 834, 0, 0, ! 862, 862, 865, 865, 519, 33, 0, 0, 881, 835, ! 697, 0, 18, 0, 0, 0, 123, 124, 0, 269, ! 0, 0, 476, 21, 0, 0, 0, 0, 271, 8, ! 9, 10, 0, 0, 1232, 0, 26, 0, 0, 28, ! 29, 0, 0, 0, 206, 0, 206, 206, 1244, 0, ! 1245, 0, 1246, 31, 100, 114, 115, 0, 0, 0, ! 861, 0, 0, 32, 0, 623, 82, 228, 21, 861, ! 0, 33, 0, 206, 0, 34, 109, 0, 100, 114, ! 115, 206, 0, 0, 28, 272, 137, 0, 0, 0, ! 0, 0, 0, 150, 150, 0, 150, 0, 82, 0, ! 0, 1782, 0, 0, 0, 0, 0, 82, 0, 0, ! 116, 1704, 0, 269, 0, 0, 33, 0, 0, 0, ! 210, 0, 82, 0, 804, 0, 0, 805, 1282, 0, ! 0, 246, 0, 269, 116, 1706, 109, 0, 0, 808, ! 0, 0, 1248, 131, 132, 1248, 0, 277, 13, 109, ! 0, 0, 0, 0, 371, 0, 1256, 371, 0, 371, ! 0, 0, 1034, 1034, 1034, 0, 1295, 0, 0, 0, ! 0, 18, 0, 109, 0, 0, 0, 0, 0, 269, ! 0, 0, 0, 716, 8, 9, 10, 0, 693, 0, ! 436, 0, 0, 438, 0, 26, 0, 0, 134, 135, ! 137, 0, 82, 0, 371, 0, 371, 568, 150, 150, ! 0, 0, 694, 437, 150, 0, 0, 150, 150, 150, ! 324, 717, 695, 21, 0, 0, 0, 0, 245, 0, ! 0, 0, 0, 82, 696, 697, 26, 82, 0, 134, ! 135, 0, 0, 210, 82, 145, 8, 9, 10, 660, ! 661, 662, 663, 664, 665, 666, 415, 8, 569, 10, ! 0, 0, 210, 210, 210, 1307, 1307, 1136, 1136, 1136, ! 145, 131, 132, 10, 1316, 0, 1136, 1136, 1136, 0, ! 206, 0, 0, 0, 0, 21, 1146, 0, 1334, 1334, ! 1335, 0, 210, 269, 0, 0, 21, 0, 26, 18, ! 0, 28, 29, 261, 0, 199, 0, 162, 0, 551, ! 21, 0, 262, 272, 0, 200, 219, 0, 0, 109, ! 0, 0, 0, 26, 0, 201, 28, 29, 447, 1317, ! 0, 0, 150, 33, 0, 0, 570, 202, 0, 0, ! 155, 0, 0, 206, 33, 1435, 0, 1436, 0, 1437, ! 156, 269, 0, 0, 0, 0, 0, 0, 33, 0, ! 0, 0, 157, 760, 761, 762, 763, 764, 765, 766, ! 415, 131, 132, 10, 109, 609, 955, 956, 0, 960, ! 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, ! 971, 972, 973, 974, 975, 976, 977, 0, 0, 0, ! 1034, 1034, 1034, 0, 0, 0, 0, 0, 131, 132, ! 21, 0, 861, 254, 0, 861, 0, 261, 0, 109, ! 0, 0, 0, 691, 0, 609, 262, 272, 609, 710, ! 0, 861, 0, 269, 0, 0, 18, 0, 371, 82, ! 0, 0, 1307, 1307, 1136, 1136, 1136, 0, 0, 1316, ! 8, 9, 269, 693, 0, 254, 0, 0, 33, 0, ! 26, 0, 0, 134, 135, 1447, 1447, 1335, 0, 0, ! 0, 0, 0, 1497, 0, 0, 137, 694, 18, 0, ! 0, 0, 0, 0, 476, 476, 109, 695, 210, 109, ! 0, 0, 131, 132, 0, 371, 0, 150, 0, 696, ! 697, 0, 26, 0, 0, 134, 135, 150, 0, 0, ! 150, 476, 0, 153, 0, 0, 476, 0, 0, 1331, ! 18, 0, 150, 0, 0, 0, 0, 0, 0, 1332, ! 82, 0, 0, 0, 0, 0, 0, 693, 0, 0, ! 0, 1333, 0, 0, 26, 804, 805, 134, 135, 0, ! 0, 0, 0, 808, 0, 0, 210, 840, 210, 210, ! 710, 694, 0, 0, 840, 0, 0, 0, 0, 0, ! 0, 695, 210, 210, 1507, 1507, 210, 1508, 210, 210, ! 210, 871, 269, 696, 697, 210, 0, 0, 0, 0, ! 210, 0, 0, 210, 0, 476, 476, 0, 476, 476, ! 0, 476, 0, 0, 0, 371, 512, 515, 0, 0, ! 0, 0, 0, 269, 0, 0, 0, 0, 0, 0, ! 0, 145, 8, 9, 10, 173, 12, 13, 0, 150, ! 0, 849, 0, 14, 0, 0, 0, 0, 1562, 1562, ! 1562, 0, 0, 0, 0, 0, 0, 16, 0, 17, ! 18, 0, 0, 476, 476, 0, 20, 0, 0, 0, ! 0, 21, 0, 0, 0, 23, 0, 269, 0, 0, ! 0, 0, 0, 925, 26, 371, 0, 28, 29, 0, ! 861, 109, 109, 109, 109, 0, 861, 0, 0, 0, ! 6, 31, 7, 8, 9, 10, 11, 12, 13, 0, ! 0, 32, 0, 371, 14, 0, 476, 476, 476, 33, ! 0, 0, 0, 34, 0, 0, 0, 15, 16, 0, ! 17, 18, 19, 0, 0, 0, 0, 20, 0, 0, ! 0, 1367, 21, 0, 0, 22, 23, 24, 0, 25, ! 109, 0, 609, 0, 0, 26, 27, 0, 28, 29, ! 219, 228, 30, 0, 691, 0, 609, 609, 710, 0, ! 0, 0, 31, 476, 476, 0, 0, 0, 0, 1035, ! 0, 0, 32, 1037, 222, 223, 224, 269, 0, 269, ! 33, 0, 14, 0, 34, 0, 0, 0, 35, 0, ! 0, 0, 210, 0, 0, 0, 0, 0, 0, 18, ! 0, 0, 0, 0, 0, 20, 519, 0, 0, 0, ! 436, 438, 0, 0, 23, 0, 0, 0, 0, 568, ! 0, 145, 8, 9, 10, 0, 0, 13, 0, 0, ! 1047, 1290, 0, 1319, 8, 9, 10, 0, 0, 137, ! 0, 371, 0, 0, 0, 0, 137, 865, 865, 865, ! 18, 0, 0, 0, 0, 210, 246, 861, 0, 228, ! 0, 21, 0, 270, 0, 0, 861, 693, 0, 0, ! 324, 717, 0, 21, 26, 0, 0, 28, 29, 0, ! 269, 0, 0, 269, 861, 861, 26, 0, 0, 28, ! 272, 1133, 0, 0, 0, 210, 210, 1138, 1367, 0, ! 476, 1134, 0, 1141, 0, 1138, 0, 0, 0, 33, ! 222, 223, 224, 1135, 697, 0, 0, 863, 14, 0, ! 864, 33, 512, 515, 210, 0, 0, 871, 210, 210, ! 871, 871, 871, 0, 882, 18, 210, 0, 0, 0, ! 0, 20, 0, 210, 460, 0, 0, 0, 8, 9, ! 23, 0, 1403, 566, 0, 0, 0, 0, 0, 0, ! 0, 0, 145, 8, 9, 10, 82, 0, 566, 109, ! 371, 371, 0, 371, 0, 109, 18, 509, 0, 0, ! 0, 0, 232, 0, 609, 609, 609, 804, 805, 0, ! 528, 18, 0, 0, 808, 609, 0, 861, 0, 0, ! 26, 0, 21, 134, 135, 0, 0, 0, 693, 0, ! 0, 0, 0, 1529, 0, 26, 0, 1331, 28, 29, ! 0, 0, 0, 0, 0, 0, 0, 1332, 0, 0, ! 0, 0, 833, 0, 0, 0, 0, 0, 0, 1333, ! 1159, 0, 834, 0, 0, 0, 109, 0, 131, 132, ! 33, 0, 0, 566, 835, 697, 0, 861, 861, 0, ! 0, 0, 232, 0, 0, 0, 1189, 0, 0, 609, ! 609, 0, 1194, 609, 0, 0, 18, 0, 232, 0, ! 109, 0, 0, 0, 609, 0, 109, 0, 0, 0, ! 1035, 1035, 1035, 693, 0, 0, 609, 0, 1141, 0, ! 26, 0, 0, 134, 135, 0, 0, 0, 0, 0, ! 0, 269, 861, 271, 416, 417, 10, 694, 0, 0, ! 0, 8, 9, 0, 173, 12, 13, 695, 0, 0, ! 489, 0, 14, 0, 0, 232, 0, 0, 0, 696, ! 697, 0, 0, 0, 232, 0, 16, 0, 17, 18, ! 0, 0, 0, 21, 0, 20, 0, 109, 0, 109, ! 371, 232, 0, 0, 23, 206, 693, 206, 0, 28, ! 272, 0, 232, 26, 0, 0, 134, 135, 0, 1254, ! 0, 1255, 0, 0, 269, 0, 0, 0, 0, 0, ! 694, 0, 210, 210, 210, 210, 210, 1138, 871, 0, ! 695, 33, 210, 0, 1138, 1138, 1138, 0, 269, 0, ! 1141, 0, 696, 697, 0, 109, 871, 871, 871, 658, ! 659, 660, 661, 662, 663, 664, 665, 666, 0, 8, ! 9, 0, 137, 0, 13, 150, 82, 0, 82, 512, ! 515, 0, 0, 1369, 82, 0, 82, 0, 0, 0, ! 271, 416, 417, 10, 0, 0, 0, 18, 0, 109, ! 0, 109, 0, 0, 0, 0, 0, 0, 0, 109, ! 0, 0, 863, 864, 512, 515, 206, 0, 0, 0, ! 882, 26, 0, 0, 134, 135, 0, 0, 0, 0, ! 21, 271, 131, 132, 10, 0, 609, 609, 1331, 609, ! 874, 0, 0, 26, 371, 880, 28, 272, 1332, 0, ! 609, 0, 8, 9, 0, 173, 12, 13, 609, 0, ! 1333, 489, 0, 14, 0, 0, 0, 0, 609, 609, ! 710, 21, 0, 0, 0, 0, 906, 16, 33, 17, ! 18, 0, 0, 912, 0, 0, 20, 28, 272, 0, ! 0, 232, 0, 0, 0, 23, 1388, 693, 1390, 0, ! 232, 0, 0, 0, 26, 0, 0, 134, 135, 210, ! 210, 210, 871, 871, 1442, 0, 0, 210, 210, 33, ! 0, 1504, 0, 0, 0, 0, 922, 923, 0, 924, ! 0, 1505, 232, 871, 871, 871, 871, 871, 0, 0, ! 0, 0, 0, 1506, 697, 0, 109, 0, 0, 0, ! 1369, 0, 0, 0, 0, 0, 0, 0, 1421, 109, ! 0, 0, 0, 0, 0, 0, 232, 0, 0, 8, ! 9, 0, 1466, 0, 254, 232, 0, 0, 0, 0, ! 82, 85, 0, 0, 8, 9, 0, 0, 0, 566, ! 0, 111, 0, 0, 0, 0, 232, 18, 0, 0, ! 130, 138, 0, 0, 0, 0, 0, 0, 151, 151, ! 0, 151, 18, 85, 693, 0, 0, 0, 1021, 1022, ! 0, 26, 85, 232, 134, 135, 0, 1021, 0, 693, ! 0, 0, 0, 0, 0, 151, 26, 85, 1504, 134, ! 135, 0, 871, 871, 0, 871, 247, 109, 1505, 871, ! 0, 257, 0, 1504, 0, 0, 0, 0, 0, 0, ! 1506, 697, 0, 1505, 257, 210, 0, 0, 0, 372, ! 150, 0, 372, 82, 372, 1506, 697, 863, 864, 512, ! 515, 0, 0, 0, 0, 0, 882, 0, 512, 515, ! 758, 759, 760, 761, 762, 763, 764, 765, 766, 0, ! 863, 864, 882, 0, 0, 0, 871, 871, 1442, 871, ! 871, 0, 0, 0, 0, 0, 109, 85, 0, 372, ! 1495, 372, 0, 151, 151, 0, 0, 0, 0, 151, ! 0, 0, 151, 151, 151, 0, 0, 0, 8, 9, ! 0, 0, 12, 13, 1358, 1359, 9, 10, 85, 14, ! 0, 1511, 85, 0, 0, 0, 1140, 1517, 151, 85, ! 0, 0, 109, 16, 871, 17, 18, 0, 0, 0, ! 0, 0, 20, 1538, 1539, 0, 0, 151, 151, 151, ! 0, 23, 0, 0, 21, 0, 0, 1009, 1012, 78, ! 26, 1156, 0, 134, 135, 676, 1558, 26, 0, 0, ! 28, 29, 0, 0, 1454, 0, 1360, 151, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 210, 840, 210, ! 0, 78, 0, 0, 201, 0, 0, 0, 0, 677, ! 78, 0, 33, 1196, 0, 1198, 202, 0, 0, 0, ! 1579, 1580, 0, 208, 0, 220, 0, 151, 8, 9, ! 0, 0, 12, 13, 863, 864, 512, 515, 0, 14, ! 0, 882, 0, 1625, 1626, 0, 1628, 415, 131, 132, ! 10, 0, 0, 16, 1138, 17, 18, 512, 515, 0, ! 0, 0, 20, 0, 0, 0, 0, 0, 0, 257, ! 611, 23, 0, 0, 0, 0, 0, 0, 0, 0, ! 26, 0, 0, 134, 135, 0, 0, 21, 0, 1234, ! 1235, 0, 1237, 0, 261, 1138, 1138, 1138, 232, 0, ! 0, 232, 0, 262, 272, 429, 1009, 1012, 210, 0, ! 0, 434, 0, 0, 257, 0, 0, 232, 692, 984, ! 611, 0, 1258, 611, 711, 0, 0, 570, 0, 722, ! 0, 0, 0, 372, 85, 33, 78, 0, 0, 0, ! 78, 0, 0, 0, 0, 0, 208, 220, 0, 722, ! 0, 0, 0, 145, 8, 9, 10, 222, 223, 224, ! 1718, 0, 0, 0, 0, 14, 863, 864, 0, 882, ! 0, 784, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 257, 18, 151, 257, 0, 0, 0, 20, 0, ! 372, 0, 151, 21, 0, 208, 0, 23, 0, 693, ! 0, 0, 151, 0, 0, 151, 26, 0, 0, 28, ! 29, 0, 0, 0, 0, 0, 0, 151, 0, 0, ! 0, 0, 0, 833, 0, 85, 145, 8, 9, 10, ! 512, 515, 0, 834, 0, 0, 0, 0, 1315, 0, ! 0, 33, 0, 232, 0, 835, 697, 0, 0, 0, ! 0, 151, 841, 151, 151, 711, 0, 0, 0, 841, ! 0, 0, 0, 0, 0, 0, 21, 151, 151, 0, ! 232, 151, 0, 151, 151, 151, 611, 0, 0, 26, ! 151, 1249, 28, 29, 1250, 151, 1666, 0, 151, 0, ! 0, 0, 8, 9, 0, 1257, 200, 13, 0, 0, ! 372, 1009, 1012, 0, 0, 0, 201, 0, 0, 903, ! 0, 0, 0, 0, 33, 0, 0, 0, 202, 0, ! 18, 0, 0, 0, 151, 0, 0, 0, 0, 145, ! 8, 9, 10, 173, 12, 13, 0, 693, 0, 489, ! 0, 14, 732, 0, 26, 0, 0, 134, 135, 0, ! 0, 1420, 0, 0, 0, 16, 0, 17, 18, 0, ! 0, 1504, 0, 0, 20, 0, 232, 0, 0, 21, ! 372, 1505, 232, 23, 0, 693, 257, 257, 257, 257, ! 0, 0, 26, 1506, 697, 28, 29, 0, 0, 0, ! 0, 208, 0, 0, 0, 0, 0, 0, 372, 1133, ! 434, 0, 8, 9, 1249, 1250, 1009, 1012, 0, 1134, ! 0, 0, 1443, 1257, 0, 1009, 1012, 33, 0, 0, ! 0, 1135, 697, 0, 0, 0, 0, 0, 0, 0, ! 18, 0, 0, 78, 0, 257, 0, 611, 0, 512, ! 515, 0, 1451, 415, 8, 9, 10, 693, 0, 0, ! 0, 611, 611, 711, 26, 1457, 0, 134, 135, 208, ! 839, 208, 208, 0, 1036, 0, 0, 850, 0, 0, ! 0, 1504, 0, 0, 0, 434, 0, 0, 0, 722, ! 0, 1505, 1473, 21, 232, 0, 1474, 151, 208, 0, ! 261, 0, 232, 1506, 697, 0, 208, 0, 0, 262, ! 272, 0, 0, 0, 0, 0, 0, 0, 0, 271, ! 131, 132, 10, 0, 0, 13, 415, 8, 9, 10, ! 0, 1496, 0, 263, 0, 0, 0, 0, 0, 0, ! 0, 33, 434, 0, 784, 0, 372, 0, 18, 1009, ! 1012, 0, 130, 232, 0, 0, 0, 0, 0, 21, ! 151, 247, 232, 0, 0, 693, 21, 0, 0, 0, ! 0, 0, 26, 261, 0, 28, 272, 0, 0, 0, ! 232, 232, 262, 272, 1540, 1541, 903, 0, 0, 1266, ! 0, 1249, 1250, 1009, 1012, 0, 0, 0, 1257, 1267, ! 151, 151, 841, 0, 0, 0, 570, 33, 0, 0, ! 1148, 1268, 697, 0, 33, 0, 145, 8, 9, 10, ! 0, 1563, 1564, 0, 0, 0, 0, 1566, 0, 151, ! 0, 0, 611, 151, 151, 611, 611, 611, 0, 0, ! 0, 151, 0, 0, 0, 18, 0, 0, 151, 0, ! 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, ! 0, 0, 693, 0, 0, 0, 0, 0, 0, 26, ! 0, 85, 28, 29, 257, 372, 372, 0, 372, 0, ! 257, 0, 0, 0, 0, 0, 833, 0, 0, 611, ! 611, 611, 0, 232, 0, 0, 834, 0, 0, 0, ! 611, 0, 0, 0, 33, 208, 0, 0, 835, 697, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, ! 764, 765, 766, 1249, 1250, 0, 1257, 0, 0, 0, ! 0, 0, 0, 0, 0, 172, 1680, 145, 8, 9, ! 10, 173, 12, 13, 0, 0, 0, 0, 0, 14, ! 0, 257, 0, 232, 232, 0, 0, 0, 0, 0, ! 0, 0, 0, 16, 0, 17, 18, 19, 208, 0, ! 0, 0, 20, 0, 611, 611, 0, 21, 611, 0, ! 0, 23, 0, 0, 174, 257, 0, 1009, 1012, 611, ! 26, 257, 0, 28, 29, 1036, 1036, 1036, 0, 0, ! 0, 611, 0, 722, 0, 0, 0, 31, 232, 0, ! 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, ! 0, 0, 0, 0, 0, 33, 0, 0, 0, 34, ! 0, 0, 0, 35, 0, 0, 0, 434, 271, 8, ! 9, 10, 656, 657, 13, 658, 659, 660, 661, 662, ! 663, 664, 665, 666, 0, 0, 434, 0, 0, 0, ! 0, 0, 257, 0, 257, 372, 0, 18, 0, 0, ! 0, 0, 415, 131, 1533, 10, 0, 0, 21, 1187, ! 0, 0, 0, 0, 693, 0, 0, 0, 0, 0, ! 0, 26, 0, 0, 28, 272, 0, 151, 151, 151, ! 151, 151, 841, 611, 0, 0, 0, 151, 1310, 1148, ! 1148, 1148, 21, 0, 0, 722, 0, 0, 1311, 261, ! 257, 611, 611, 611, 1697, 0, 33, 0, 262, 272, ! 1312, 697, 0, 0, 903, 0, 0, 138, 0, 0, ! 151, 85, 0, 85, 0, 0, 0, 0, 1370, 85, ! 0, 85, 570, 0, 0, 0, 0, 0, 0, 0, ! 33, 0, 0, 0, 257, 0, 257, 0, 0, 0, ! 0, 0, 0, 0, 257, 0, 1698, 745, 746, 747, ! 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, ! 758, 759, 760, 761, 762, 763, 764, 765, 766, 0, ! 0, 611, 611, 0, 611, 0, 0, 0, 0, 372, ! 0, 0, 0, 0, 0, 611, 271, 8, 9, 10, ! 173, 12, 13, 611, 0, 0, 489, 0, 14, 0, ! 0, 0, 0, 611, 611, 711, 0, 0, 0, 0, ! 0, 0, 16, 0, 17, 18, 0, 0, 0, 0, ! 0, 20, 0, 0, 0, 0, 21, 0, 0, 0, ! 23, 0, 693, 0, 903, 0, 0, 0, 0, 26, ! 0, 0, 28, 272, 151, 151, 151, 611, 611, 711, ! 0, 0, 151, 151, 0, 0, 1266, 0, 0, 0, ! 271, 8, 9, 10, 0, 0, 1267, 0, 611, 611, ! 611, 611, 611, 0, 33, 434, 903, 0, 1268, 697, ! 0, 257, 54, 0, 0, 1370, 0, 0, 0, 18, ! 0, 0, 0, 0, 257, 0, 0, 0, 0, 0, ! 21, 0, 0, 0, 0, 0, 693, 0, 390, 54, ! 54, 0, 158, 26, 54, 85, 28, 272, 0, 1187, ! 0, 1187, 0, 54, 0, 0, 1368, 1375, 0, 1187, ! 1310, 0, 0, 0, 0, 0, 54, 0, 54, 0, ! 1311, 0, 0, 0, 0, 0, 0, 0, 33, 0, ! 0, 0, 1312, 697, 0, 0, 0, 0, 0, 0, ! 265, 0, 0, 273, 0, 0, 145, 131, 132, 10, ! 0, 0, 13, 0, 0, 0, 0, 611, 611, 0, ! 611, 0, 257, 0, 611, 0, 0, 0, 0, 0, ! 0, 0, 493, 0, 0, 18, 0, 0, 0, 0, ! 151, 0, 0, 0, 0, 151, 21, 0, 85, 0, ! 0, 0, 0, 0, 0, 418, 418, 535, 54, 26, ! 0, 0, 28, 29, 54, 54, 0, 0, 265, 273, ! 54, 0, 0, 158, 158, 158, 155, 0, 0, 0, ! 457, 611, 611, 711, 611, 611, 156, 0, 0, 54, ! 0, 257, 434, 54, 33, 0, 0, 0, 157, 54, ! 54, 434, 0, 0, 8, 9, 0, 173, 12, 13, ! 0, 0, 0, 0, 0, 14, 0, 0, 54, 54, ! 158, 0, 0, 0, 0, 0, 0, 0, 265, 16, ! 0, 17, 18, 1368, 0, 0, 0, 257, 20, 611, ! 0, 0, 0, 0, 0, 0, 0, 785, 54, 0, ! 786, 0, 0, 0, 0, 0, 26, 0, 0, 134, ! 135, 0, 0, 1187, 0, 0, 0, 0, 0, 0, ! 0, 145, 8, 9, 10, 173, 12, 13, 0, 0, ! 636, 1659, 0, 14, 0, 0, 0, 0, 54, 0, ! 0, 0, 151, 841, 151, 265, 0, 16, 0, 17, ! 18, 19, 0, 0, 0, 0, 20, 0, 0, 8, ! 9, 21, 0, 12, 254, 23, 0, 0, 174, 0, ! 14, 0, 0, 0, 26, 0, 0, 28, 29, 0, ! 0, 0, 0, 0, 16, 0, 17, 18, 0, 0, ! 0, 31, 0, 20, 0, 0, 0, 0, 1530, 1148, ! 0, 32, 23, 1530, 693, 0, 1187, 0, 0, 33, ! 792, 26, 633, 34, 134, 135, 0, 35, 0, 353, ! 0, 0, 353, 0, 353, 0, 0, 0, 694, 418, ! 0, 0, 0, 0, 0, 0, 0, 0, 695, 265, ! 1148, 1148, 1148, 0, 0, 54, 0, 0, 0, 0, ! 696, 697, 0, 151, 0, 0, 0, 0, 0, 265, ! 0, 0, 0, 131, 132, 0, 0, 223, 224, 353, ! 0, 353, 0, 0, 14, 0, 0, 0, 0, 0, ! 0, 0, 418, 0, 0, 0, 0, 0, 792, 0, ! 0, 18, 0, 0, 54, 0, 0, 20, 0, 0, ! 0, 0, 0, 54, 0, 265, 23, 0, 693, 0, ! 0, 0, 457, 54, 0, 26, 54, 0, 134, 135, ! 0, 0, 457, 457, 457, 0, 0, 0, 54, 0, ! 0, 0, 694, 0, 0, 0, 54, 0, 0, 0, ! 0, 0, 695, 0, 0, 0, 0, 0, 0, 0, ! 208, 1671, 208, 0, 707, 697, 0, 0, 1358, 1359, ! 9, 10, 54, 54, 54, 54, 0, 0, 0, 0, ! 54, 0, 0, 0, 0, 0, 0, 0, 54, 54, ! 0, 0, 54, 0, 158, 158, 158, 457, 0, 0, ! 0, 54, 0, 0, 0, 0, 54, 0, 21, 54, ! 0, 0, 0, 0, 931, 932, 934, 935, 936, 0, ! 0, 26, 0, 0, 28, 29, 0, 636, 0, 0, ! 1360, 0, 0, 0, 0, 0, 0, 0, 200, 0, ! 954, 0, 0, 0, 0, 54, 0, 0, 201, 0, ! 0, 0, 0, 0, 0, 0, 33, 0, 615, 616, ! 202, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 80, 208, 353, 983, 625, 0, 0, 626, 0, 0, ! 627, 0, 0, 637, 0, 0, 0, 642, 0, 0, ! 0, 0, 1013, 0, 0, 682, 0, 80, 80, 1026, ! 80, 1027, 80, 1013, 0, 0, 0, 633, 633, 633, ! 0, 80, 0, 353, 0, 0, 0, 0, 0, 0, ! 0, 0, 633, 0, 80, 0, 80, 750, 751, 752, ! 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, ! 763, 764, 765, 766, 145, 8, 9, 10, 222, 223, ! 224, 275, 654, 655, 656, 657, 14, 658, 659, 660, ! 661, 662, 663, 664, 665, 666, 0, 0, 0, 265, ! 353, 0, 0, 18, 0, 0, 0, 0, 0, 20, ! 0, 633, 0, 633, 21, 633, 0, 0, 23, 0, ! 693, 0, 0, 0, 0, 0, 0, 26, 0, 0, ! 28, 29, 0, 0, 0, 0, 80, 0, 54, 0, ! 0, 0, 80, 80, 200, 0, 0, 275, 80, 0, ! 0, 80, 80, 80, 201, 0, 0, 0, 0, 0, ! 0, 1013, 33, 0, 0, 0, 1672, 80, 0, 1013, ! 0, 80, 0, 0, 0, 0, 0, 80, 80, 0, ! 0, 0, 0, 0, 0, 418, 0, 0, 0, 0, ! 0, 0, 418, 0, 0, 0, 80, 80, 80, 0, ! 0, 54, 131, 132, 0, 0, 223, 224, 0, 0, ! 353, 0, 0, 14, 755, 756, 757, 758, 759, 760, ! 761, 762, 763, 764, 765, 766, 80, 0, 0, 0, ! 18, 0, 0, 493, 0, 0, 20, 0, 0, 493, ! 0, 54, 54, 158, 0, 23, 0, 693, 265, 273, ! 0, 1145, 0, 0, 26, 0, 0, 134, 135, 0, ! 0, 0, 0, 0, 0, 633, 80, 0, 0, 0, ! 54, 694, 0, 457, 54, 54, 457, 457, 457, 0, ! 353, 695, 54, 0, 0, 0, 0, 0, 0, 54, ! 0, 0, 0, 696, 697, 0, 625, 626, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 353, 0, ! 1229, 0, 54, 353, 353, 0, 353, 353, 353, 353, ! 353, 353, 353, 353, 353, 353, 353, 353, 353, 353, ! 353, 353, 353, 353, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 954, 0, 0, 0, 0, 0, ! 493, 653, 654, 655, 656, 657, 1013, 658, 659, 660, ! 661, 662, 663, 664, 665, 666, 0, 0, 721, 0, ! 0, 0, 0, 80, 753, 754, 755, 756, 757, 758, ! 759, 760, 761, 762, 763, 764, 765, 766, 721, 574, ! 576, 577, 578, 579, 580, 0, 582, 583, 584, 585, ! 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, ! 596, 597, 598, 599, 600, 601, 602, 603, 0, 605, ! 0, 792, 80, 1288, 0, 0, 0, 0, 0, 0, ! 0, 80, 0, 0, 0, 0, 633, 633, 633, 0, ! 0, 80, 457, 265, 80, 0, 353, 0, 0, 0, ! 0, 165, 0, 0, 0, 0, 80, 0, 0, 0, ! 0, 1013, 0, 0, 80, 145, 8, 9, 10, 0, ! 1013, 13, 0, 0, 0, 211, 655, 656, 657, 1328, ! 658, 659, 660, 661, 662, 663, 664, 665, 666, 0, ! 80, 80, 80, 80, 18, 0, 0, 0, 80, 0, ! 0, 0, 0, 0, 0, 21, 80, 80, 0, 0, ! 80, 0, 80, 80, 80, 0, 0, 0, 26, 80, ! 0, 28, 29, 493, 80, 493, 0, 80, 0, 0, ! 0, 0, 0, 1392, 0, 200, 0, 0, 54, 54, ! 54, 158, 158, 158, 457, 201, 265, 0, 54, 265, ! 1145, 1145, 1145, 33, 0, 0, 273, 202, 0, 0, ! 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, ! 0, 0, 165, 165, 165, 353, 353, 0, 353, 0, ! 0, 158, 54, 0, 54, 0, 0, 0, 0, 54, ! 54, 0, 54, 0, 1013, 0, 0, 0, 211, 6, ! 0, 7, 8, 9, 10, 11, 12, 13, 0, 0, ! 0, 0, 0, 14, 0, 0, 0, 211, 211, 521, ! 0, 0, 0, 0, 0, 0, 0, 16, 0, 17, ! 18, 0, 0, 0, 0, 0, 20, 0, 1013, 0, ! 0, 21, 0, 0, 0, 23, 0, 211, 464, 0, ! 0, 0, 0, 0, 26, 0, 0, 28, 29, 0, ! 0, 30, 0, 1239, 0, 0, 0, 0, 0, 0, ! 493, 31, 0, 0, 457, 457, 457, 0, 0, 0, ! 0, 32, 0, 493, 0, 0, 0, 0, 721, 33, ! 0, 920, 0, 34, 0, 625, 626, 0, 0, 0, ! 0, 0, 145, 131, 132, 10, 0, 0, 566, 0, ! 0, 0, 0, 0, 921, 54, 54, 54, 457, 457, ! 457, 0, 926, 54, 54, 0, 80, 0, 0, 0, ! 610, 18, 0, 0, 0, 271, 8, 9, 10, 173, ! 12, 13, 21, 0, 0, 489, 0, 14, 0, 0, ! 0, 0, 0, 0, 0, 26, 54, 0, 28, 29, ! 0, 16, 0, 17, 18, 353, 0, 0, 353, 0, ! 20, 1328, 31, 0, 0, 21, 0, 265, 273, 23, ! 700, 693, 32, 700, 700, 0, 54, 0, 26, 80, ! 33, 28, 272, 0, 34, 145, 8, 9, 10, 0, ! 0, 254, 0, 0, 0, 1310, 0, 0, 0, 625, ! 626, 0, 0, 0, 0, 1311, 0, 0, 0, 0, ! 0, 0, 0, 33, 18, 0, 0, 1312, 697, 80, ! 80, 80, 1013, 0, 0, 21, 0, 275, 0, 1147, ! 493, 0, 0, 211, 0, 0, 0, 0, 26, 0, ! 0, 28, 29, 0, 0, 0, 0, 0, 80, 0, ! 0, 0, 80, 80, 0, 200, 0, 0, 0, 0, ! 80, 54, 0, 0, 265, 201, 54, 80, 0, 54, ! 0, 0, 0, 33, 0, 0, 792, 202, 0, 353, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 80, 0, 0, 0, 0, 0, 0, 1414, 0, 353, ! 0, 837, 0, 837, 837, 700, 278, 0, 0, 8, ! 9, 0, 0, 12, 13, 0, 0, 211, 211, 0, ! 14, 211, 0, 521, 521, 521, 872, 0, 0, 0, ! 211, 0, 0, 0, 16, 211, 17, 18, 211, 0, ! 0, 0, 0, 20, 0, 279, 280, 0, 0, 0, ! 0, 0, 23, 0, 281, 0, 0, 0, 0, 0, ! 0, 26, 0, 0, 134, 135, 0, 282, 0, 0, ! 0, 283, 284, 285, 286, 287, 288, 289, 290, 291, ! 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, ! 302, 303, 0, 0, 304, 305, 306, 0, 307, 0, ! 0, 308, 0, 145, 8, 9, 10, 0, 0, 13, ! 0, 0, 209, 54, 54, 54, 0, 309, 1200, 1201, ! 1327, 0, 721, 8, 9, 0, 0, 12, 13, 0, ! 0, 636, 18, 0, 14, 0, 268, 0, 0, 276, ! 0, 0, 0, 21, 0, 0, 0, 0, 16, 0, ! 17, 18, 145, 8, 9, 10, 26, 20, 566, 28, ! 29, 0, 0, 268, 0, 384, 23, 0, 0, 0, ! 1145, 0, 0, 516, 0, 26, 0, 0, 134, 135, ! 0, 18, 0, 517, 0, 0, 0, 993, 0, 0, ! 0, 33, 21, 0, 0, 518, 0, 0, 0, 0, ! 0, 700, 700, 700, 0, 26, 0, 0, 28, 29, ! 0, 1145, 1145, 1145, 700, 0, 80, 80, 80, 80, ! 80, 80, 200, 0, 54, 0, 80, 0, 1147, 1147, ! 1147, 0, 201, 0, 1321, 209, 0, 211, 0, 0, ! 33, 0, 0, 1168, 202, 7, 8, 1169, 10, 173, ! 12, 13, 0, 0, 209, 209, 209, 14, 0, 80, ! 80, 0, 80, 0, 527, 0, 0, 80, 80, 0, ! 80, 16, 0, 17, 18, 19, 0, 0, 0, 0, ! 20, -556, 0, 0, 209, 21, 0, 0, 0, 23, ! 1170, 0, 174, 0, 0, 0, 0, 0, 26, 0, ! 837, 28, 29, 0, 0, 1171, 0, 1172, 0, 0, ! 0, 276, 0, 0, 0, 31, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 32, 271, 8, 9, 10, ! 0, 268, 13, 33, 0, 0, 0, 1173, 0, 0, ! 837, 837, 1139, 0, 0, 0, 0, 0, 0, 0, ! 1139, 0, 0, -556, 0, 18, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 637, 21, 0, 0, 211, ! 0, 0, 872, 211, 211, 872, 872, 872, 0, 26, ! 0, 211, 28, 272, 0, 0, 0, 0, 211, 0, ! 0, 0, 0, 80, 80, 80, 868, 1523, 1524, 9, ! 10, 80, 80, 0, 0, 0, 869, 0, 0, 0, ! 0, 0, 0, 0, 33, 0, 0, 0, 870, 0, ! 0, 0, 0, 0, 0, 268, 276, 0, 0, 610, ! 610, 610, 0, 0, 80, 0, 0, 21, 8, 9, ! 700, 173, 12, 13, 0, 268, 276, 489, 0, 14, ! 26, 0, 0, 28, 29, 0, 275, 0, 0, 1525, ! 0, 0, 0, 16, 80, 17, 18, 200, 0, 0, ! 625, 626, 20, 0, 0, 0, 0, 201, 0, 0, ! 209, 23, 0, 0, 0, 33, 0, 0, 0, 202, ! 26, 0, 0, 134, 135, 0, 0, 0, 0, -419, ! 8, 9, -419, -419, 12, 254, 0, 0, 0, 0, ! 0, 14, 0, 0, 700, 700, 0, 0, 700, 0, ! 0, 0, 0, 0, 0, 16, 0, 17, 18, 700, ! 0, 0, 0, 0, 20, 700, 700, 700, 0, -419, ! 0, 700, 0, 23, 0, 693, 0, 0, 209, 80, ! 209, 209, 26, 0, 80, 134, 135, 80, 0, 0, ! 0, 0, 0, 0, 209, 209, 0, 0, 209, 694, ! 209, 209, 209, 209, 18, 0, 0, 209, 0, 695, ! 0, 0, 209, 0, 0, 209, 0, -419, 0, 0, ! 0, 696, 697, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 492, 0, 0, 0, 0, 0, 745, 746, ! 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, ! 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, ! 0, 0, 0, 0, 0, 0, 0, 837, 837, 837, ! 1139, 1139, 1139, 1313, 0, 0, 0, 837, 0, 1139, ! 1139, 1139, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 872, 872, 872, 0, 0, 0, 1168, 0, 7, ! 8, 1169, 10, 173, 12, 13, 0, 0, 0, 0, ! 165, 14, 0, 0, 0, 0, 0, 0, 211, 0, ! 145, 131, 132, 10, 0, 16, 0, 17, 18, 19, ! 0, 80, 80, 80, 20, -557, 0, 0, 0, 21, ! 0, 0, 0, 23, 1170, 0, 174, 0, 0, 18, ! 0, 0, 26, 0, 0, 28, 29, 0, 0, 1171, ! 21, 1172, 0, 0, 0, 0, 0, 0, 0, 31, ! 0, 993, 993, 26, 993, 0, 28, 29, 0, 32, ! 0, 0, 0, 0, 0, 700, 0, 33, 1147, 0, ! 31, 1173, 0, 700, 268, 276, 0, 0, 0, 0, ! 32, 0, 0, 700, 700, 700, 0, -557, 33, 0, ! 0, 0, 34, 0, 209, 0, 0, 0, 0, 0, ! 0, 741, 0, 0, 0, 0, 0, 0, 0, 1147, ! 1147, 1147, 8, 9, 0, 173, 12, 13, 0, 0, ! 0, 1622, 80, 14, 837, 837, 837, 1313, 1313, 1313, ! 0, 0, 837, 837, 0, 0, 0, 16, 0, 17, ! 18, 0, 0, 0, 0, 0, 20, 0, 872, 872, ! 872, 872, 872, 0, 0, 23, 0, 209, 0, 0, ! 0, 0, 0, 0, 26, 211, 0, 134, 135, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 698, 0, ! 0, 698, 698, 145, 8, 9, 10, 212, 12, 213, ! 0, 0, 0, 0, 0, 14, 0, 209, 209, 1137, ! 825, 492, 0, 0, 268, 276, 0, 1137, 0, 16, ! 0, 17, 18, 0, 0, 0, 0, 0, 20, 0, ! 0, 0, 0, 21, 0, 0, 209, 23, 0, 209, ! 209, 209, 209, 209, 209, 527, 26, 0, 209, 28, ! 29, 0, 0, 214, 0, 209, 0, 145, 8, 9, ! 10, 0, 0, 31, 0, 0, 0, 1313, 1313, 0, ! 1313, 0, 0, 32, 872, 0, 0, 276, 0, 0, ! 0, 33, 0, 0, 0, 34, 18, 0, 0, 0, ! 211, 652, 653, 654, 655, 656, 657, 21, 658, 659, ! 660, 661, 662, 663, 664, 665, 666, 0, 0, 0, ! 26, 0, 0, 28, 29, 0, 0, 0, 0, 698, ! 0, 698, 698, 698, 0, 0, 0, 516, 0, 0, ! 0, 1313, 1313, 1313, 1313, 1313, 0, 517, 0, 0, ! 492, 0, 0, 929, 0, 33, 0, 0, 0, 518, ! 0, 1358, 8, 1169, 10, 212, 12, 213, 0, 0, ! 0, 0, 0, 14, 0, 0, 0, 0, 0, 825, ! 0, 8, 9, 0, 212, 12, 213, 16, 0, 17, ! 18, 0, 14, 0, 0, 0, 20, 0, 0, 1313, ! 0, 21, 0, 0, 492, 23, 16, 0, 17, 18, ! 492, 0, 492, 492, 26, 20, 0, 28, 29, 268, ! 276, 268, 0, 1360, 23, 0, 0, 0, 0, 0, ! 0, 31, 0, 26, 0, 0, 134, 135, 0, 0, ! 0, 32, 0, 492, 0, 0, 0, 0, 0, 33, ! 492, 0, 211, 1173, 211, 0, 0, 0, 0, 0, ! 492, 749, 750, 751, 752, 753, 754, 755, 756, 757, ! 758, 759, 760, 761, 762, 763, 764, 765, 766, 1055, ! 1057, 1058, 1059, 0, 1061, 1062, 1063, 1064, 1065, 1066, ! 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, ! 1077, 1078, 1079, 0, 0, 0, 0, 0, 0, 521, ! 0, 0, 0, 0, 209, 209, 209, 209, 209, 1137, ! 209, 0, 1314, 0, 209, 268, 1137, 1137, 1137, 698, ! 698, 698, 276, 0, 0, 0, 0, 0, 209, 209, ! 209, 1634, 1032, -513, -513, -513, -513, -513, -513, -513, ! 521, 521, 521, -513, 0, -513, 0, 0, 0, 0, ! 825, 0, 0, 211, 0, 209, -513, 0, -513, 0, ! 0, 0, -513, 0, 0, 0, 0, 0, -513, 492, ! 0, 0, 0, -513, 0, 0, 0, -513, 0, -513, ! 0, 0, 0, 492, 0, 0, -513, 0, 0, -513, ! -513, -513, -513, -513, 0, -513, -513, -513, -513, -513, ! -513, -513, -513, -513, -513, -513, -513, -513, -513, -513, ! -513, -513, -513, -513, -513, -513, -513, -513, 698, -513, ! -513, -513, 0, -513, -513, -513, -513, -513, 0, 0, ! 0, 0, 0, 1635, -513, 0, 107, 0, 0, -513, ! -513, -513, 0, -513, 0, 125, 107, 0, 0, 0, ! 0, 0, 0, 107, 107, 0, 107, 0, 698, 698, ! 698, 0, 0, 0, 0, 0, 0, 0, 1032, 0, ! 0, 0, 0, 0, 0, 0, 1217, 0, 0, 0, ! 0, 209, 209, 209, 209, 209, 1137, 0, 0, 209, ! 209, 243, 0, 8, 9, 0, 0, 12, 254, 0, ! 145, 8, 9, 10, 14, 209, 209, 209, 209, 209, ! 0, 0, 0, 825, 492, 0, 0, 0, 16, 0, ! 17, 18, 209, 0, 0, 0, 0, 20, 492, 18, ! 492, 0, 492, 0, 0, 0, 23, 0, 0, 0, ! 21, 0, 0, 527, 0, 26, 0, 0, 134, 135, ! 410, 0, 125, 26, 0, 0, 28, 29, 698, 107, ! 107, 0, 0, 0, 0, 0, 0, 0, 107, 107, ! 200, 0, 107, 107, 107, 1275, 442, 107, 107, 107, ! 201, 0, 0, 0, 0, 0, 0, 0, 33, 0, ! 0, 0, 202, 752, 753, 754, 755, 756, 757, 758, ! 759, 760, 761, 762, 763, 764, 765, 766, 492, 0, ! 0, 0, 0, 0, 209, 209, 1314, 209, 0, 0, ! 0, 209, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 698, 698, 0, 0, 698, 209, 0, 0, ! 0, 0, 0, 0, 0, 0, 492, 698, 0, 0, ! 0, 0, 0, 1032, 1032, 1032, 0, 0, 1168, 698, ! 7, 8, 1169, 10, 173, 12, 13, 0, 243, 107, ! 0, 0, 14, 0, 0, 0, 825, 825, 209, 209, ! 1137, 209, 209, 0, 0, 0, 16, 0, 17, 18, ! 19, 0, 107, 0, 0, 20, 0, 0, 1345, 0, ! 21, 0, 0, 0, 23, 1170, 0, 174, 0, 0, ! 0, 0, 0, 26, 0, 0, 28, 29, 0, 0, ! 1171, 0, 1172, 0, 0, 0, 0, 0, 0, 0, ! 31, 0, 0, 0, 0, 107, 209, 0, 0, 0, ! 32, 0, 0, 0, 825, 825, 0, 0, 33, 0, ! 0, 0, 1173, 0, 0, 698, 698, 698, 698, 698, ! 698, 698, 0, 0, 0, 698, 0, 1032, 1032, 1032, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 107, 0, 107, 0, 0, 107, 209, - 0, 209, 0, 0, 0, 0, 8, 9, 0, 0, - 12, 13, 0, 0, 1426, 0, 0, 14, 0, 0, - 0, 0, 0, 0, 0, 271, 8, 9, 10, 0, - 0, 16, 0, 17, 18, 492, 0, 492, 0, 492, - 20, 825, 0, 0, 0, 0, 107, 0, 0, 23, - 0, 0, 0, 0, 18, 0, 1137, 0, 26, 0, - 0, 134, 135, 0, 0, 21, 0, 107, 0, 107, - 0, 0, 825, 0, 0, 0, 0, 107, 26, 0, - 107, 28, 272, 698, 0, 0, 0, 0, 0, 0, - 0, 698, 107, 0, 0, 868, 1461, 1137, 1137, 1137, - 0, 698, 698, 698, 0, 869, 0, 0, 0, 0, - 209, 0, 0, 33, 0, 0, 0, 870, 751, 752, - 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, - 763, 764, 765, 766, 825, 0, 0, 0, 0, 0, - 0, 0, 698, 698, 698, 698, 698, 698, 0, 0, - 698, 698, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 492, 0, 0, 0, 1523, 131, 132, - 10, 0, 1168, 0, 7, 8, 1169, 10, 173, 12, - 13, 0, 0, 243, 896, 825, 14, 0, 0, 0, - 0, 0, 0, 0, 0, 1519, 1520, 0, 0, 107, - 16, 0, 17, 18, 19, 0, 0, 21, 0, 20, - -559, 0, 0, 0, 21, 0, 0, 0, 23, 1170, - 26, 174, 0, 28, 29, 825, 0, 26, 0, 1525, - 28, 29, 0, 0, 1171, 0, 1172, 31, 0, 0, - 0, 107, 0, 107, 31, 0, 0, 32, 0, 0, - 0, 0, 0, 0, 32, 33, 0, 0, 0, 34, - 0, 1572, 33, 0, 0, 0, 1173, 0, 0, 0, - 0, 0, 0, 0, 0, 698, 698, 0, 698, 0, - 0, 0, -559, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 145, 131, 1346, 10, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 1629, 1630, 0, 0, - 0, 0, 107, 0, 0, 0, 0, 0, 0, 0, - 0, 18, 0, 107, 107, 0, 107, 107, 0, 0, - 0, 0, 21, 1648, 0, 0, 0, 0, 0, 698, - 698, 698, 698, 698, 0, 26, 0, 0, 28, 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 155, 0, 0, 0, 0, 0, 0, 0, ! 0, 1686, 156, 0, 0, 0, 0, 0, 0, 0, ! 33, 0, 0, 0, 157, 646, 647, 648, 649, 650, ! 651, 652, 653, 654, 655, 656, 657, 698, 658, 659, ! 660, 661, 662, 663, 664, 665, 666, 0, 492, 107, ! 0, 0, 0, 0, 0, 0, 107, 125, 0, 0, ! 0, 0, 0, 0, 0, 0, 243, 0, 0, 0, ! 0, 0, 0, 1736, 0, 1585, 0, -930, -930, -930, ! -930, -930, -930, -930, -930, -930, -930, 0, -930, -930, ! -930, 896, -930, -930, -930, -930, -930, -930, -930, -930, ! -930, -930, -930, -930, -930, -930, -930, -930, 0, -930, ! -930, -930, -930, 0, -930, -930, -930, -930, -930, -930, ! -930, -930, -930, 0, 0, -930, -930, -930, -930, -930, ! -930, 0, 0, -930, -930, -930, 0, -930, -930, 0, ! 0, 0, 0, 0, -930, 0, 0, -930, 0, 0, ! 0, 0, 0, 0, 0, -930, -930, -930, 0, 0, ! 0, 0, 0, -930, -930, -930, 0, 0, 0, -930, ! 0, -930, 0, 0, 0, 896, 0, 0, 0, 0, ! 0, 0, 0, 0, 825, 1586, -930, 0, 0, 0, ! 0, 0, 0, 0, 107, 107, 107, 107, 0, 0, ! 0, 0, 0, 0, 0, 107, 0, 0, 0, 1548, ! 0, -930, -930, -930, -930, -930, -930, -930, -930, -930, ! -930, 0, -930, -930, -930, 0, -930, -930, -930, -930, ! -930, -930, -930, -930, -930, -930, -930, -930, -930, -930, ! -930, -930, 0, -930, -930, -930, -930, 0, -930, -930, ! -930, -930, -930, -930, -930, -930, -930, 0, 0, -930, ! -930, -930, -930, -930, -930, 0, 0, -930, -930, -930, ! 0, -930, -930, 0, 0, 0, 0, 0, -930, 107, ! 107, -930, 0, 107, 0, 0, 0, 0, 0, -930, ! -930, -930, 0, 0, 107, 0, 0, -930, -930, -930, ! 0, 0, 0, -930, 0, -930, 107, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 628, ! -930, 271, 8, 9, 10, 173, 12, 315, 316, 317, ! 318, 489, 319, 14, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 16, 320, 17, ! 18, 19, 0, 321, 322, 323, 20, 0, 324, 325, ! 326, 21, 327, 328, 0, 23, 0, 693, 0, 329, ! 330, 331, 332, 333, 26, 0, 0, 28, 272, -345, ! 0, 0, 385, 0, 0, 0, 0, 0, 336, 0, ! 0, 1028, 0, 0, 0, 0, 0, 0, 0, 338, ! 339, 1029, 0, 0, 0, 0, 0, 341, 342, 343, ! 0, 0, 0, 1030, 697, 0, 0, 0, 0, 0, ! 1168, 0, 7, 8, 1169, 10, 173, 12, 13, 0, ! 345, 0, 0, 0, 14, 0, 0, 0, 0, 896, ! 0, 0, 107, 0, 0, 107, 0, 0, 16, 0, ! 17, 18, 19, 0, 0, 0, 0, 20, -558, 0, ! 0, 0, 21, 0, 0, 0, 23, 1170, 0, 174, ! 0, 0, 0, 0, 0, 26, 0, 0, 28, 29, ! 0, 0, 1171, 0, 1172, 651, 652, 653, 654, 655, ! 656, 657, 31, 658, 659, 660, 661, 662, 663, 664, ! 665, 666, 32, 0, 0, 0, 107, 107, 0, 107, ! 33, 0, 0, 0, 1173, 0, 0, 0, 0, 0, ! 107, 0, 0, 0, 0, 0, 0, 0, 107, 0, ! -558, 0, 0, 0, 0, 0, 0, 0, 107, 107, ! 0, 0, 0, 628, 0, 145, 8, 9, 10, 173, ! 12, 315, 316, 317, 318, 489, 319, 14, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 896, ! 0, 16, 320, 17, 18, 19, 0, 321, 322, 323, ! 20, 0, 324, 325, 326, 21, 327, 328, 0, 23, ! 0, 693, 0, 329, 330, 331, 332, 333, 26, 0, ! 0, 28, 29, -345, 0, 0, 385, 0, 0, 0, ! 0, 896, 336, 0, 0, 1142, 0, 0, 0, 0, ! 0, 0, 0, 338, 339, 1143, 0, 0, 0, 0, ! 0, 341, 342, 343, 0, 0, 0, 1144, 697, 0, ! 0, 0, 107, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 488, 345, 271, 8, 9, 10, 173, ! 12, 315, 316, 317, 318, 489, 319, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 16, 320, 17, 18, 19, 0, 321, 322, 323, ! 20, 0, 324, 325, 326, 21, 327, 328, 0, 23, ! 0, 0, 0, 329, 330, 331, 332, 333, 26, 0, ! 0, 28, 272, 0, 0, 0, 385, 0, 0, 0, ! 0, 0, 336, 0, 0, 337, 0, 0, 0, 0, ! 0, 0, 0, 338, 339, 340, 0, 0, 107, 0, ! 107, 341, 342, 343, 0, 0, 957, 344, 271, 8, ! 9, 10, 173, 12, 315, 316, 317, 318, 0, 319, ! 14, 0, -843, 0, 345, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 16, 320, 17, 18, 19, 0, ! 321, 322, 323, 20, 0, 324, 325, 326, 21, 327, ! 328, 0, 23, 0, 0, 0, 329, 330, 331, 332, ! 333, 26, 0, 0, 28, 272, 1731, 0, -832, 385, ! 0, 0, 0, 0, 0, 336, 0, 0, 337, 0, ! 0, 0, 0, 0, 0, 0, 338, 339, 340, 0, ! 0, 0, 0, 0, 341, 342, 343, 0, 0, 823, ! 344, 945, 946, 947, 10, 0, 12, 505, 316, 317, ! 318, 0, 319, 14, 0, 0, 0, 345, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 16, 320, 17, ! 0, 19, 0, 321, 322, 323, 20, 0, 324, 325, ! 326, 21, 327, 328, 0, 23, 0, 0, 0, 329, ! 330, 331, 332, 333, 26, 0, 0, 948, 949, 824, ! 0, 0, 385, 0, 0, 0, 0, 0, 336, 0, ! 0, 337, 0, 0, 0, 0, 0, 0, 0, 338, ! 339, 340, 0, 0, 0, 0, 0, 341, 342, 343, ! 0, 0, 0, 344, 950, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 1127, ! 345, 628, 0, 271, 8, 9, 10, 0, 12, 315, ! 316, 317, 318, 0, 319, 14, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, ! 320, 17, 18, 19, 0, 321, 322, 323, 20, 0, ! 324, 325, 326, 21, 327, 328, 0, 23, 0, 0, ! 0, 329, 330, 331, 332, 333, 26, 0, 0, 28, ! 272, -345, 0, 0, 385, 0, 0, 0, 0, 0, ! 336, 0, 0, 629, 0, 0, 0, 0, 0, 0, ! 0, 338, 339, 630, 0, 0, 0, 0, 0, 341, ! 342, 343, 0, 0, 823, 631, 945, 946, 947, 10, ! 0, 12, 505, 316, 317, 318, 0, 319, 14, 0, ! 0, 0, 345, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 16, 320, 17, 0, 19, 0, 321, 322, ! 323, 20, 0, 324, 325, 326, 21, 327, 328, 0, ! 23, 0, 0, 0, 329, 330, 331, 332, 333, 26, ! 0, 0, 948, 949, 824, 0, 0, 385, 0, 0, ! 0, 0, 0, 336, 0, 0, 337, 0, 0, 0, ! 0, 0, 0, 0, 338, 339, 340, 0, 0, 0, ! 0, 0, 341, 342, 343, 0, 0, 0, 344, 950, ! 823, 0, 271, 8, 9, 10, 0, 12, 505, 316, ! 317, 318, 0, 319, 14, 345, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 16, 320, ! 17, 0, 19, 0, 321, 322, 323, 20, 0, 324, ! 325, 326, 21, 327, 328, 0, 23, 0, 0, 0, ! 329, 330, 331, 332, 333, 26, 0, 0, 28, 272, ! 824, 0, 0, 385, 0, 0, 0, 0, 0, 336, ! 0, 0, 337, 0, 0, 0, 0, 0, 0, 0, ! 338, 339, 340, 0, 0, 0, 0, 0, 341, 342, ! 343, 0, 0, 0, 344, 823, 0, 945, 946, 947, ! 10, 1324, 12, 505, 316, 317, 318, 0, 319, 14, ! 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 16, 320, 17, 0, 19, 0, 321, ! 322, 323, 20, 0, 324, 325, 326, 21, 327, 328, ! 0, 23, 0, 0, 0, 329, 330, 331, 332, 333, ! 26, 0, 0, 948, 949, 824, 0, 0, 385, 0, ! 0, 0, 0, 0, 336, 0, 0, 337, 0, 0, ! 0, 0, 0, 0, 0, 338, 339, 340, 0, 0, ! 0, 0, 0, 341, 342, 343, 0, 0, 823, 344, ! 945, 946, 947, 10, 0, 12, 505, 316, 317, 318, ! 0, 319, 14, 0, 0, -517, 345, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 16, 320, 17, 0, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 0, 23, 0, 0, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 948, 949, 824, 0, ! 0, 385, 0, 0, 0, 0, 0, 336, 0, 0, ! 337, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 340, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 628, 344, 145, 8, 9, 10, 0, 12, 315, ! 316, 317, 318, 0, 319, 14, 0, 0, 1439, 345, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, ! 320, 17, 18, 19, 0, 321, 322, 323, 20, 0, ! 324, 325, 326, 21, 327, 328, 0, 23, 0, 0, ! 0, 329, 330, 331, 332, 333, 26, 0, 0, 28, ! 29, -345, 0, 0, 385, 0, 0, 0, 0, 0, ! 336, 0, 0, 1713, 0, 0, 0, 0, 0, 0, ! 0, 338, 339, 1714, 0, 0, 0, 0, 0, 341, ! 342, 343, 0, 0, 1770, 1715, 271, 8, 9, 10, ! 0, 12, 315, 316, 317, 318, 0, 319, 14, 0, ! 0, 0, 345, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 16, 320, 17, 18, 19, 0, 321, 322, ! 323, 20, 0, 324, 325, 326, 21, 327, 328, 0, ! 23, 0, 0, 0, 329, 330, 331, 332, 333, 26, ! 0, 0, 28, 272, 0, 0, -209, 385, 0, 0, ! 0, 0, 0, 336, 0, 0, 337, 0, 0, 0, ! 0, 0, 0, 0, 338, 339, 340, 0, 0, 0, ! 0, 0, 341, 342, 343, 0, 0, 823, 344, 271, ! 8, 9, 10, 0, 12, 505, 316, 317, 318, 0, ! 319, 14, 0, 0, 0, 345, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 16, 320, 17, 0, 19, ! 0, 321, 322, 323, 20, 0, 324, 325, 326, 21, ! 327, 328, 0, 23, 0, 0, 0, 329, 330, 331, ! 332, 333, 26, 0, 0, 28, 272, 824, 0, 0, ! 385, 0, 0, 0, 0, 0, 336, 0, 0, 337, ! 0, 0, 0, 0, 0, 0, 0, 338, 339, 340, ! 0, 0, 0, 0, 0, 341, 342, 343, 0, 0, ! 957, 344, 271, 8, 9, 10, 0, 12, 505, 316, ! 317, 318, 0, 319, 14, 0, 0, 0, 345, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 16, 320, ! 17, 0, 19, 0, 321, 322, 323, 20, 0, 324, ! 325, 326, 21, 327, 328, 0, 23, 0, 0, 0, ! 329, 330, 331, 332, 333, 26, 0, 0, 28, 272, ! 0, 0, 0, 385, -832, 0, 0, 0, 0, 336, ! 0, 0, 337, 0, 0, 0, 0, 0, 0, 0, ! 338, 339, 340, 0, 0, 0, 0, 0, 341, 342, ! 343, 0, 0, 957, 344, 271, 8, 9, 10, 0, ! 12, 505, 316, 317, 318, 0, 319, 14, 0, 0, ! 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 16, 320, 17, 0, 19, 0, 321, 322, 323, ! 20, 0, 324, 325, 326, 21, 327, 328, 0, 23, ! 0, 0, 0, 329, 330, 331, 332, 333, 26, 0, ! 0, 28, 272, 0, 0, 0, 385, 0, 0, 0, ! 0, 0, 336, 0, 0, 337, 0, 0, 0, 0, ! 0, 0, 0, 338, 339, 340, 0, 0, 0, 0, ! 0, 341, 342, 343, 0, 0, 1054, 344, 271, 8, ! 9, 10, 0, 12, 505, 316, 317, 318, 0, 319, ! 14, 0, -832, 0, 345, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 16, 320, 17, 0, 19, 0, ! 321, 322, 323, 20, 0, 324, 325, 326, 21, 327, ! 328, 0, 23, 0, 0, 0, 329, 330, 331, 332, ! 333, 26, 0, 0, 28, 272, 0, 0, 0, 385, ! 0, 0, 0, 0, 0, 336, 0, 0, 337, 0, ! 0, 0, 0, 0, 0, 0, 338, 339, 340, 0, ! 0, 0, 0, 0, 341, 342, 343, 0, 0, 1056, ! 344, 271, 8, 9, 10, 0, 12, 505, 316, 317, ! 318, 0, 319, 14, 0, 0, 0, 345, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 16, 320, 17, ! 0, 19, 0, 321, 322, 323, 20, 0, 324, 325, ! 326, 21, 327, 328, 0, 23, 0, 0, 0, 329, ! 330, 331, 332, 333, 26, 0, 0, 28, 272, 0, ! 0, 0, 385, 0, 0, 0, 0, 0, 336, 0, ! 0, 337, 0, 0, 0, 0, 0, 0, 0, 338, ! 339, 340, 0, 0, 0, 0, 0, 341, 342, 343, ! 0, 0, 1685, 344, 271, 8, 9, 10, 0, 12, ! 505, 316, 317, 318, 0, 319, 14, 0, 0, 0, ! 345, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 16, 320, 17, 0, 19, 0, 321, 322, 323, 20, ! 0, 324, 325, 326, 21, 327, 328, 0, 23, 0, ! 0, 0, 329, 330, 331, 332, 333, 26, 0, 0, ! 28, 272, 0, 0, 0, 385, 0, 0, 0, 0, ! 0, 336, 0, 0, 337, 0, 0, 0, 0, 0, ! 0, 0, 338, 339, 340, 0, 0, 0, 0, 0, ! 341, 342, 343, 0, 0, 0, 344, 271, 8, 9, ! 10, 0, 12, 505, 316, 317, 318, 0, 319, 14, ! 0, 0, 0, 345, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 16, 320, 17, 0, 19, 0, 321, ! 322, 323, 20, 0, 324, 325, 326, 21, 327, 328, ! 0, 23, 0, 0, 0, 329, 330, 331, 332, 333, ! 26, 0, 0, 28, 272, 0, 0, 0, 385, 0, ! 0, 0, 0, 0, 336, 0, 0, 337, 0, 0, ! 0, 0, 0, 0, 0, 338, 339, 340, 0, 0, ! 0, 0, 0, 341, 342, 343, 0, 0, 0, 344, ! 271, 8, 9, 10, 0, 12, 505, 316, 317, 318, ! 0, 319, 14, 0, 0, 0, 345, 506, 0, 0, ! 0, 0, 0, 0, 0, 0, 16, 320, 17, 0, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 0, 23, 0, 0, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 28, 272, 0, 0, ! 0, 385, 0, 0, 0, 0, 0, 336, 0, 0, ! 337, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 340, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 0, 344, 271, 8, 9, 10, 0, 12, 505, ! 316, 317, 318, 0, 319, 14, 0, 0, 0, 345, ! 878, 0, 0, 0, 0, 0, 0, 0, 0, 16, ! 320, 17, 0, 19, 0, 321, 322, 323, 20, 0, ! 324, 325, 326, 21, 327, 328, 0, 23, 0, 0, ! 0, 329, 330, 331, 332, 333, 26, 0, 0, 28, ! 272, 0, 0, 0, 385, 0, 0, 0, 0, 0, ! 336, 0, 0, 337, 0, 0, 0, 0, 0, 0, ! 0, 338, 339, 340, 0, 0, 0, 0, 0, 341, ! 342, 343, 0, 0, 0, 344, 271, 8, 9, 10, ! 0, 12, 505, 316, 317, 318, 0, 319, 14, 0, ! 0, 0, 345, 996, 0, 0, 0, 0, 0, 0, ! 0, 0, 16, 320, 17, 0, 19, 0, 321, 322, ! 323, 20, 0, 324, 325, 326, 21, 327, 328, 0, ! 23, 0, 0, 0, 329, 330, 331, 332, 333, 26, ! 0, 0, 28, 272, 0, 0, 0, 385, 0, 0, ! 0, 0, 0, 336, 0, 0, 337, 0, 0, 0, ! 0, 0, 0, 0, 338, 339, 340, 0, 0, 0, ! 0, 0, 341, 342, 343, 0, 0, 0, 344, 271, ! 8, 9, 10, 0, 12, 505, 316, 317, 318, 0, ! 319, 14, 0, 0, 0, 345, 1016, 0, 0, 0, ! 0, 0, 0, 0, 0, 16, 320, 17, 0, 19, ! 0, 321, 322, 323, 20, 0, 324, 325, 326, 21, ! 327, 328, 0, 23, 0, 0, 0, 329, 330, 331, ! 332, 333, 26, 0, 0, 28, 272, 0, 0, 0, ! 385, 0, 0, 0, 0, 0, 336, 0, 0, 337, ! 0, 0, 0, 0, 0, 0, 0, 338, 339, 340, ! 0, 0, 0, 0, 0, 341, 342, 343, 0, 0, ! 0, 344, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 345, 1260, ! 1589, 1590, 1591, 10, 173, 12, 315, 316, 317, 318, ! 0, 319, 14, 1592, 0, 1593, 1594, 1595, 1596, 1597, ! 1598, 1599, 1600, 1601, 1602, 15, 16, 320, 17, 18, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 1603, 23, 1604, 0, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 1605, 272, 1216, 0, ! 1606, 385, 0, 0, 0, 0, 0, 336, 0, 0, ! 337, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 340, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 0, 344, 0, 1607, 1589, 1590, 1591, 10, 173, ! 12, 315, 316, 317, 318, 0, 319, 14, 1592, 345, ! 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, ! 15, 16, 320, 17, 18, 19, 0, 321, 322, 323, ! 20, 0, 324, 325, 326, 21, 327, 328, 1603, 23, ! 1604, 0, 0, 329, 330, 331, 332, 333, 26, 0, ! 0, 1605, 272, 0, 0, 1606, 385, 0, 0, 0, ! 0, 0, 336, 0, 0, 337, 0, 0, 0, 0, ! 0, 0, 0, 338, 339, 340, 0, 0, 0, 0, ! 0, 341, 342, 343, 0, 0, 0, 344, 0, 1607, ! 271, 8, 9, 10, 173, 12, 315, 316, 317, 318, ! 489, 319, 14, 0, 345, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 16, 320, 17, 18, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 0, 23, 0, 693, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 28, 272, 0, 0, ! 0, 385, 0, 0, 0, 0, 0, 336, 0, 0, ! 1028, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 1029, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 0, 1030, 697, 145, 8, 9, 10, 173, 12, ! 315, 316, 317, 318, 489, 319, 14, 0, 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 16, 320, 17, 18, 19, 0, 321, 322, 323, 20, ! 0, 324, 325, 326, 21, 327, 328, 0, 23, 0, ! 693, 0, 329, 330, 331, 332, 333, 26, 0, 0, ! 28, 29, 0, 0, 0, 385, 0, 0, 0, 0, ! 0, 336, 0, 0, 1142, 0, 0, 0, 0, 0, ! 0, 0, 338, 339, 1143, 0, 0, 0, 0, 0, ! 341, 342, 343, 0, 0, 0, 1144, 697, 271, 8, ! 9, 10, 0, 12, 315, 316, 317, 318, 0, 319, ! 14, 0, 0, 345, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 16, 320, 17, 18, 19, 0, ! 321, 322, 323, 20, 0, 324, 325, 326, 21, 327, ! 328, 0, 23, 0, 693, 0, 329, 330, 331, 332, ! 333, 26, 0, 0, 28, 272, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 336, 0, 0, 1028, 0, ! 0, 0, 0, 0, 0, 0, 338, 339, 1029, 0, ! 0, 0, 0, 0, 341, 342, 343, 0, 0, 0, ! 1030, 697, 145, 8, 9, 10, 0, 12, 315, 316, ! 317, 318, 0, 319, 14, 0, 0, 345, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 16, 320, ! 17, 18, 19, 0, 321, 322, 323, 20, 0, 324, ! 325, 326, 21, 327, 328, 0, 23, 0, 693, 0, ! 329, 330, 331, 332, 333, 26, 0, 0, 28, 29, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 336, ! 0, 0, 1142, 0, 0, 0, 0, 0, 0, 0, ! 338, 339, 1143, 0, 0, 0, 0, 0, 341, 342, ! 343, 0, 0, 0, 1144, 697, 271, 8, 9, 10, ! 0, 12, 315, 316, 317, 318, 0, 319, 14, 0, ! 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 16, 320, 17, 18, 19, 0, 321, 322, ! 323, 20, 0, 324, 325, 326, 21, 327, 328, 0, ! 23, 0, 0, 0, 329, 330, 331, 332, 333, 26, ! 0, 0, 334, 272, 0, 0, 0, 335, 0, 0, ! 0, 0, 0, 336, 0, 0, 337, 0, 0, 0, ! 0, 0, 0, 0, 338, 339, 340, 0, 0, 0, ! 0, 0, 341, 342, 343, 0, 0, 0, 344, 271, ! 8, 9, 10, 0, 12, 315, 316, 317, 318, 0, ! 319, 14, 0, 0, 0, 345, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 16, 320, 17, 18, 19, ! 0, 321, 322, 323, 20, 0, 324, 325, 326, 21, ! 327, 328, 0, 23, 0, 0, 0, 329, 330, 331, ! 332, 333, 26, 0, 0, 28, 272, 0, 0, 0, ! 385, 0, 0, 0, 0, 0, 336, 0, 0, 337, ! 0, 0, 0, 0, 0, 0, 0, 338, 339, 340, ! 0, 0, 0, 0, 0, 341, 342, 343, 0, 0, ! 0, 344, 271, 8, 9, 10, 0, 12, 505, 316, ! 317, 318, 0, 319, 14, 0, 0, 0, 345, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 16, 320, ! 17, 18, 19, 0, 321, 322, 323, 20, 0, 324, ! 325, 326, 21, 327, 328, 0, 23, 0, 0, 0, ! 329, 330, 331, 332, 333, 26, 0, 0, 28, 272, ! 0, 0, 0, 385, 0, 0, 0, 0, 0, 336, ! 0, 0, 629, 0, 0, 0, 0, 0, 0, 0, ! 338, 339, 630, 0, 0, 0, 0, 0, 341, 342, ! 343, 0, 0, 0, 631, 271, 8, 9, 10, 0, ! 12, 505, 316, 317, 318, 0, 319, 14, 0, 0, ! 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 16, 320, 17, 0, 19, 0, 321, 322, 323, ! 20, 0, 324, 325, 326, 21, 327, 328, 0, 23, ! 0, 0, 0, 329, 330, 331, 332, 333, 26, 0, ! 0, 28, 272, 0, 0, 1652, 385, 0, 0, 0, ! 0, 0, 336, 0, 0, 337, 0, 0, 0, 0, ! 0, 0, 0, 338, 339, 340, 0, 0, 0, 0, ! 0, 341, 342, 343, 0, 0, 0, 344, 271, 8, ! 9, 10, 173, 12, 315, 316, 317, 318, 0, 319, ! 14, 0, 0, 0, 345, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 16, 320, 17, 18, 19, 0, ! 321, 322, 323, 20, 0, 324, 325, 326, 21, 327, ! 328, 0, 23, 0, 0, 0, 329, 330, 331, 332, ! 333, 26, 0, 0, 28, 272, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 336, 0, 0, 337, 0, ! 0, 0, 0, 0, 0, 0, 338, 339, 340, 0, ! 0, 0, 0, 0, 341, 342, 343, 0, 0, 0, ! 344, 145, 8, 9, 10, 0, 12, 505, 316, 317, ! 318, 0, 319, 14, 0, 0, 0, 345, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 16, 320, 17, ! 18, 19, 0, 321, 322, 323, 20, 0, 324, 325, ! 326, 21, 327, 328, 0, 23, 0, 0, 0, 329, ! 330, 331, 332, 333, 26, 0, 0, 28, 29, 0, ! 0, 0, 385, 0, 0, 0, 0, 0, 336, 0, ! 0, 1713, 0, 0, 0, 0, 0, 0, 0, 338, ! 339, 1714, 0, 0, 0, 0, 0, 341, 342, 343, ! 0, 0, 0, 1715, 271, 8, 9, 10, 0, 12, ! 505, 316, 317, 318, 0, 319, 14, 0, 0, 0, ! 345, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 16, 320, 17, 0, 19, 0, 321, 322, 323, 20, ! 0, 324, 325, 326, 21, 327, 328, 0, 23, 0, ! 0, 0, 329, 330, 331, 332, 333, 26, 0, 0, ! 28, 272, 0, 0, 0, 335, 0, 0, 0, 0, ! 0, 336, 0, 0, 337, 0, 0, 0, 0, 0, ! 0, 0, 338, 339, 340, 0, 0, 0, 0, 0, ! 341, 342, 343, 0, 0, 0, 344, 271, 8, 9, ! 10, 0, 12, 505, 316, 317, 318, 0, 319, 14, ! 0, 0, 0, 345, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 16, 320, 17, 0, 19, 0, 321, ! 322, 323, 20, 0, 324, 325, 326, 21, 327, 328, ! 0, 23, 0, 0, 0, 329, 330, 331, 332, 333, ! 26, 0, 0, 28, 272, 643, 0, 0, 0, 0, ! 0, 0, 0, 0, 336, 0, 0, 337, 0, 0, ! 0, 0, 0, 0, 0, 338, 339, 340, 0, 0, ! 0, 0, 0, 341, 342, 343, 0, 0, 0, 644, ! 271, 8, 9, 10, 0, 12, 505, 316, 317, 318, ! 0, 319, 14, 0, 0, 0, 345, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 16, 320, 17, 0, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 0, 23, 0, 0, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 28, 272, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 336, 0, 0, ! 337, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 340, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 0, 344, 681, 271, 8, 9, 10, 0, 12, ! 505, 316, 317, 318, 0, 319, 14, 0, 0, 345, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 16, 320, 17, 0, 19, 0, 321, 322, 323, 20, ! 0, 324, 325, 326, 21, 327, 328, 0, 23, 0, ! 0, 0, 329, 330, 331, 332, 333, 26, 0, 0, ! 28, 272, 0, 0, 0, 385, 0, 0, 0, 0, ! 0, 336, 0, 0, 337, 0, 0, 0, 0, 0, ! 0, 0, 338, 339, 340, 0, 0, 0, 0, 0, ! 341, 342, 343, 0, 0, 0, 344, 271, 8, 9, ! 10, 0, 12, 505, 316, 317, 318, 0, 319, 14, ! 0, 0, 0, 345, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 16, 320, 17, 18, 19, 0, 321, ! 322, 323, 20, 0, 324, 325, 326, 21, 327, 328, ! 0, 23, 0, 0, 0, 329, 330, 331, 332, 333, ! 26, 0, 0, 28, 272, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 336, 0, 0, 629, 0, 0, ! 0, 0, 0, 0, 0, 338, 339, 630, 0, 0, ! 0, 0, 0, 341, 342, 343, 0, 0, 0, 631, ! 1281, 8, 9, 10, 0, 12, 505, 316, 317, 318, ! 0, 319, 14, 0, 0, 0, 345, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 16, 320, 17, 0, ! 19, 0, 321, 322, 323, 20, 0, 324, 325, 326, ! 21, 327, 328, 0, 23, 0, 0, 0, 329, 330, ! 331, 332, 333, 26, 0, 0, 28, 272, 0, 0, ! 0, 385, 0, 0, 0, 0, 0, 336, 0, 0, ! 337, 0, 0, 0, 0, 0, 0, 0, 338, 339, ! 340, 0, 0, 0, 0, 0, 341, 342, 343, 0, ! 0, 0, 344, 145, 8, 9, 10, 0, 12, 315, ! 316, 317, 318, 0, 319, 14, 0, 0, 0, 345, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, ! 320, 17, 18, 19, 0, 321, 322, 323, 20, 0, ! 324, 325, 326, 21, 327, 328, 0, 23, 0, 0, ! 0, 329, 330, 331, 332, 333, 26, 0, 0, 28, ! 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 336, 0, 0, 1713, 0, 0, 0, 0, 0, 0, ! 0, 338, 339, 1714, 0, 0, 0, 0, 0, 341, ! 342, 343, 0, 0, 0, 1715, 271, 8, 9, 10, ! 0, 12, 505, 316, 317, 318, 0, 319, 14, 0, ! 0, 0, 345, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 16, 320, 17, 0, 19, 0, 321, 322, ! 323, 20, 0, 324, 325, 326, 21, 327, 328, 0, ! 23, 0, 0, 0, 329, 330, 331, 332, 333, 26, ! 0, 0, 28, 272, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 336, 0, 0, 337, 0, 0, 0, ! 0, 0, 0, 0, 338, 339, 340, 0, 0, 0, ! 0, 0, 341, 342, 343, 0, 0, 0, 344, 271, ! 8, 9, 10, 0, 12, 505, 316, 317, 318, 0, ! 319, 14, 0, 0, 0, 345, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 16, 320, 17, 0, 19, ! 0, 321, 322, 323, 20, 0, 324, 325, 326, 21, ! 327, 328, 0, 23, 0, 0, 0, 329, 330, 331, ! 332, 333, 26, 0, 0, 28, 272, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 336, 0, 0, 337, ! 0, 0, 0, 0, 0, 0, 0, 338, 339, 340, ! 0, 0, 0, 0, 0, 341, 342, 343, 0, 0, ! 0, 703, 271, 8, 9, 10, 0, 12, 505, 316, ! 317, 318, 0, 319, 14, 0, 0, 0, 345, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 16, 320, ! 17, 0, 19, 0, 321, 322, 323, 20, 0, 324, ! 325, 326, 21, 327, 328, 0, 23, 0, 0, 0, ! 329, 330, 331, 332, 333, 26, 0, 0, 28, 272, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 336, ! 0, 0, 337, 145, 8, 9, 10, 212, 12, 213, ! 338, 339, 340, 0, 0, 14, 0, 0, 341, 342, ! 343, 0, 0, 0, 705, 0, 0, 0, 0, 16, ! 0, 17, 18, 0, 0, 0, 0, 0, 20, 0, ! 0, 345, 0, 21, 0, 0, 0, 23, 0, 145, ! 8, 9, 10, 173, 12, 13, 26, 0, 0, 28, ! 29, 14, 0, 1669, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 31, 0, 16, 0, 17, 18, 0, ! 0, 0, 0, 32, 20, 0, 0, 0, 0, 21, ! 0, 33, 0, 23, 0, 34, 0, 0, 0, 0, ! 0, 0, 26, 0, 0, 28, 29, 0, 0, 0, ! 145, 8, 9, 10, 212, 12, 213, 0, 0, 31, ! 0, 0, 14, 0, 0, 0, 0, 0, 0, 32, ! 0, 0, 0, 0, 0, 0, 16, 33, 17, 18, ! 0, 34, 0, 0, 0, 20, 0, 0, 0, 0, ! 21, 0, 0, 0, 23, 0, 0, 0, 0, 0, ! 0, 0, 0, 26, 0, 0, 28, 29, 0, 0, ! 0, 0, 650, 651, 652, 653, 654, 655, 656, 657, ! 31, 658, 659, 660, 661, 662, 663, 664, 665, 666, ! 32, 0, 0, 0, 0, 0, 0, 0, 33, 0, ! 0, 0, 34, 745, 746, 747, 748, 749, 750, 751, ! 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, ! 762, 763, 764, 765, 766, 745, 746, 747, 748, 749, ! 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, ! 760, 761, 762, 763, 764, 765, 766, 0, 0, 0, ! 1398, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 744, 0, 0, 1720, 745, ! 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, ! 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, ! 766, 1207, 0, 0, 0, 745, 746, 747, 748, 749, ! 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, ! 760, 761, 762, 763, 764, 765, 766, 1757, 745, 746, ! 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, ! 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, ! 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, ! 765, 766 }; static const short yycheck[] = { ! 14, 4, 180, 4, 484, 167, 82, 23, 22, 747, ! 818, 49, 216, 181, 424, 424, 182, 366, 261, 155, ! 156, 4, 130, 196, 45, 95, 14, 97, 162, 372, ! 352, 87, 372, 36, 424, 36, 552, 424, 641, 252, ! 78, 800, 364, 365, 45, 45, 727, 4, 4, 392, ! 985, 255, 392, 36, 820, 69, 137, 138, 4, 60, ! 225, 226, 45, 4, 394, 466, 246, 1431, 1438, 794, ! 128, 137, 142, 74, 150, 138, 12, 1554, 1554, 36, ! 36, 45, 45, 9, 1608, 4, 87, 45, 45, 45, ! 36, 92, 502, 502, 95, 36, 97, 85, 12, 45, ! 1549, 4, 12, 4, 45, 63, 1174, 311, 1176, 34, ! 82, 112, 31, 32, 128, 216, 1184, 36, 39, 58, ! 801, 63, 1696, 111, 3, 226, 45, 374, 375, 372, ! 1455, 1456, 49, 36, 210, 36, 533, 77, 64, 140, ! 154, 142, 45, 144, 7, 907, 87, 1472, 497, 392, ! 171, 913, 13, 34, 175, 61, 56, 140, 555, 508, ! 96, 67, 366, 1, 1, 65, 0, 109, 87, 111, ! 171, 1695, 1621, 62, 175, 175, 39, 141, 95, 96, ! 1754, 182, 220, 140, 431, 432, 111, 12, 171, 0, ! 111, 62, 175, 110, 140, 196, 110, 1522, 77, 140, ! 110, 62, 95, 1, 65, 1717, 1531, 1532, 50, 1534, ! 110, 175, 175, 61, 171, 1727, 1728, 175, 175, 175, ! 221, 140, 111, 61, 61, 171, 65, 65, 65, 175, ! 171, 56, 246, 247, 175, 196, 155, 156, 141, 110, ! 65, 49, 181, 112, 28, 49, 60, 261, 32, 110, ! 1699, 99, 171, 1730, 1730, 196, 175, 523, 216, 97, ! 97, 1773, 1024, 61, 62, 531, 13, 225, 226, 257, ! 171, 110, 175, 49, 155, 156, 157, 196, 49, 63, ! 361, 200, 201, 67, 4, 110, 1045, 95, 1737, 1048, ! 63, 95, 62, 1228, 62, 361, 56, 255, 3, 4, ! 5, 357, 110, 819, 65, 277, 376, 1632, 1633, 63, ! 444, 312, 474, 1825, 63, 62, 36, 77, 65, 95, ! 96, 202, 336, 95, 95, 1774, 140, 111, 197, 62, ! 3, 77, 34, 6, 110, 4, 5, 49, 111, 110, ! 110, 1761, 110, 344, 1103, 1104, 4, 5, 406, 110, ! 110, 414, 221, 311, 59, 60, 357, 111, 77, 32, ! 49, 1731, 111, 433, 529, 530, 367, 381, 182, 1094, ! 43, 551, 1624, 538, 1794, 376, 377, 110, 83, 393, ! 516, 517, 722, 95, 372, 519, 59, 60, 77, 554, ! 59, 60, 406, 1645, 377, 1759, 13, 787, 56, 95, ! 73, 59, 60, 1471, 392, 49, 95, 96, 366, 1661, ! 83, 62, 813, 814, 63, 73, 357, 1793, 91, 56, ! 377, 110, 95, 424, 109, 83, 427, 26, 65, 530, ! 62, 377, 433, 40, 63, 1197, 377, 1199, 357, 1815, ! 77, 606, 78, 686, 80, 62, 776, 468, 65, 56, ! 67, 95, 96, 155, 156, 157, 49, 65, 377, 110, ! 1, 56, 3, 4, 5, 1717, 110, 468, 468, 77, ! 428, 1406, 715, 543, 67, 1727, 1728, 26, 110, 28, ! 1161, 728, 77, 424, 49, 468, 1, 426, 3, 4, ! 5, 6, 49, 8, 495, 1098, 56, 498, 56, 56, ! 202, 502, 95, 541, 95, 424, 49, 987, 49, 32, ! 468, 468, 61, 1272, 1273, 56, 65, 77, 59, 60, ! 77, 1773, 468, 65, 485, 56, 77, 468, 43, 1, ! 95, 3, 4, 5, 65, 50, 3, 551, 95, 497, ! 26, 56, 543, 613, 59, 60, 77, 49, 97, 468, ! 13, 56, 95, 96, 95, 494, 803, 496, 497, 95, ! 56, 502, 65, 377, 56, 28, 61, 110, 26, 32, ! 28, 529, 530, 1825, 77, 61, 91, 49, 49, 65, ! 538, 77, 1344, 502, 56, 77, 49, 59, 60, 61, ! 62, 56, 26, 95, 28, 1357, 554, 516, 517, 62, ! 63, 56, 65, 61, 67, 4, 5, 65, 49, 56, ! 9, 97, 613, 49, 65, 50, 49, 618, 619, 620, ! 621, 622, 678, 95, 95, 96, 77, 61, 56, 643, ! 631, 65, 95, 96, 812, 516, 517, 518, 61, 97, ! 641, 78, 65, 644, 4, 5, 49, 110, 606, 77, ! 62, 1167, 49, 614, 95, 96, 525, 56, 56, 95, ! 59, 60, 95, 97, 67, 49, 78, 65, 80, 110, ! 1150, 1151, 686, 56, 73, 62, 677, 678, 49, 77, ! 927, 894, 895, 67, 83, 1095, 1095, 900, 3, 4, ! 5, 78, 95, 1036, 77, 696, 1036, 96, 95, 59, ! 60, 715, 703, 784, 705, 1095, 707, 668, 1095, 779, ! 1032, 95, 96, 674, 777, 676, 677, 110, 883, 1485, ! 65, 784, 77, 711, 95, 96, 8, 9, 110, 933, ! 110, 865, 77, 15, 907, 50, 49, 678, 1218, 1219, ! 913, 49, 110, 188, 59, 60, 707, 46, 49, 618, ! 32, 49, 1514, 714, 12, 696, 38, 56, 49, 678, ! 111, 60, 99, 724, 840, 47, 707, 49, 83, 785, ! 63, 785, 26, 731, 28, 694, 695, 696, 779, 648, ! 794, 1297, 95, 1549, 95, 61, 3, 95, 707, 65, ! 49, 730, 63, 1036, 95, 903, 56, 95, 49, 77, ! 49, 56, 49, 819, 95, 1148, 675, 61, 1148, 61, ! 824, 65, 681, 95, 516, 517, 518, 77, 113, 4, ! 5, 49, 77, 1339, 49, 1305, 96, 49, 697, 3, ! 4, 5, 6, 96, 835, 793, 95, 96, 908, 909, ! 1087, 911, 843, 97, 95, 96, 95, 96, 95, 96, ! 65, 1024, 95, 841, 793, 1621, 1336, 95, 28, 110, ! 95, 110, 32, 110, 7, 8, 9, 95, 34, 43, ! 95, 56, 15, 95, 59, 60, 50, 49, 747, 3, ! 4, 5, 843, 77, 1233, 59, 60, 363, 73, 32, ! 366, 367, 62, 63, 835, 38, 857, 67, 83, 77, ! 1034, 77, 843, 904, 47, 1148, 907, 908, 909, 83, ! 911, 96, 913, 77, 833, 834, 835, 91, 1398, 12, ! 63, 904, 56, 95, 843, 883, 50, 62, 1694, 62, ! 63, 65, 904, 1699, 1112, 59, 60, 1745, 61, 28, ! 62, 63, 65, 32, 1191, 1192, 1193, 904, 904, 868, ! 869, 1164, 1165, 1166, 835, 62, 63, 1695, 56, 83, ! 56, 56, 843, 904, 95, 110, 907, 65, 62, 1449, ! 65, 1737, 913, 62, 63, 933, 3, 4, 5, 77, ! 62, 63, 77, 984, 110, 904, 77, 988, 907, 56, ! 156, 157, 62, 63, 913, 4, 5, 1133, 1134, 3, ! 4, 5, 1136, 7, 8, 9, 1142, 1143, 1774, 1489, ! 56, 3, 4, 5, 922, 923, 924, 1018, 494, 65, ! 496, 497, 498, 1024, 1197, 77, 1199, 988, 32, 1030, ! 77, 77, 59, 60, 38, 62, 202, 62, 63, 110, ! 49, 1002, 111, 1004, 65, 1006, 111, 56, 1036, 110, ! 59, 60, 56, 110, 49, 59, 60, 61, 50, 110, ! 1798, 56, 1138, 113, 73, 110, 1080, 59, 60, 3, ! 4, 5, 49, 67, 83, 3, 4, 5, 6, 67, ! 1094, 9, 77, 1024, 86, 87, 95, 96, 110, 1030, ! 904, 83, 49, 110, 1095, 77, 1097, 1098, 28, 56, ! 95, 105, 106, 107, 32, 1024, 4, 5, 77, 1028, ! 1029, 1030, 89, 90, 56, 43, 93, 94, 95, 96, ! 77, 1082, 56, 992, 77, 59, 60, 61, 56, 62, ! 63, 59, 60, 835, 1135, 86, 87, 113, 95, 1177, ! 1178, 843, 113, 1144, 110, 73, 62, 63, 46, 1187, ! 1560, 1560, 1153, 3, 1095, 83, 1025, 56, 56, 1120, ! 1148, 59, 60, 91, 110, 1234, 1235, 95, 1237, 1416, ! 62, 1344, 1242, 1174, 62, 1176, 1095, 8, 344, 67, ! 95, 1182, 49, 1184, 1357, 77, 78, 110, 80, 77, ! 78, 1174, 110, 1176, 1135, 63, 1197, 67, 1199, 62, ! 63, 1184, 1174, 1144, 1176, 1219, 1207, 62, 63, 111, ! 1182, 62, 1184, 95, 1133, 1134, 1135, 1174, 1174, 1176, ! 1176, 4, 5, 1142, 1143, 1144, 111, 1184, 1184, 56, ! 1176, 63, 77, 1174, 38, 1176, 110, 67, 3, 4, ! 5, 1242, 1181, 1184, 67, 9, 67, 63, 110, 13, ! 110, 62, 1133, 1134, 1135, 1174, 1197, 1176, 1199, 67, ! 67, 1142, 1143, 1144, 113, 1184, 78, 1268, 1617, 110, ! 110, 110, 78, 56, 110, 78, 59, 60, 1197, 78, ! 1199, 1297, 78, 61, 110, 49, 65, 62, 65, 455, ! 456, 1305, 1173, 1369, 59, 60, 61, 110, 62, 65, ! 64, 65, 111, 67, 7, 8, 9, 3, 4, 5, ! 110, 1312, 15, 110, 78, 113, 80, 793, 3, 4, ! 5, 6, 110, 1361, 110, 96, 113, 1268, 1808, 1367, ! 1368, 95, 96, 1371, 1372, 38, 91, 1375, 1299, 77, ! 1301, 1514, 1303, 1344, 47, 49, 110, 1266, 1267, 1268, ! 110, 517, 518, 110, 50, 113, 1357, 110, 43, 110, ! 1174, 110, 1176, 59, 60, 110, 110, 1181, 1182, 1238, ! 1184, 1312, 111, 110, 59, 60, 1725, 1378, 65, 3, ! 4, 5, 6, 110, 63, 31, 32, 83, 34, 111, ! 61, 1310, 1311, 1312, 110, 1378, 110, 1369, 67, 3, ! 4, 5, 6, 1344, 110, 95, 1378, 95, 110, 1348, ! 111, 95, 1331, 1332, 60, 95, 1357, 63, 110, 43, ! 113, 1378, 1378, 69, 8, 1344, 50, 110, 74, 4, ! 5, 1133, 1134, 1135, 9, 59, 60, 1378, 1357, 43, ! 1142, 1143, 1144, 888, 1445, 110, 50, 1615, 110, 1617, ! 1616, 110, 113, 110, 98, 59, 60, 933, 110, 1378, ! 110, 62, 196, 62, 630, 631, 1427, 91, 1482, 65, ! 1471, 1173, 3, 4, 5, 6, 56, 110, 644, 83, ! 110, 56, 110, 65, 59, 60, 113, 91, 1471, 49, ! 110, 1529, 1530, 110, 1466, 110, 110, 67, 73, 1471, ! 110, 147, 110, 110, 110, 1506, 152, 110, 83, 155, ! 156, 157, 43, 1514, 1471, 1471, 34, 110, 113, 50, ! 110, 1725, 95, 65, 1393, 1394, 1395, 1396, 59, 60, ! 1471, 1007, 65, 63, 1348, 1404, 182, 703, 63, 705, ! 9, 707, 188, 63, 1722, 17, 111, 110, 1710, 110, ! 61, 1554, 1471, 1554, 200, 201, 202, 95, 1034, 1560, ! 91, 95, 63, 63, 1378, 1506, 56, 1581, 67, 95, ! 216, 1554, 109, 1514, 18, 104, 63, 1713, 1714, 56, ! 226, 3, 4, 5, 63, 1504, 1505, 1506, 1602, 1603, ! 63, 3, 4, 5, 110, 1514, 110, 1554, 1554, 3, ! 4, 5, 6, 63, 63, 62, 95, 1608, 1554, 255, ! 113, 67, 110, 1554, 63, 1616, 3, 4, 5, 1560, ! 7, 8, 9, 63, 270, 1608, 110, 12, 1790, 110, ! 95, 1793, 63, 1671, 56, 1554, 63, 59, 60, 43, ! 63, 1560, 110, 63, 1658, 1659, 50, 59, 60, 0, ! 1812, 1608, 1608, 1815, 1130, 59, 60, 1471, 0, 1617, ! 1136, 0, 1608, 176, 2, 311, 312, 1608, 36, 835, ! 1659, 777, 59, 60, 1095, 468, 1615, 843, 1617, 83, ! 3, 4, 5, 175, 7, 1554, 171, 91, 1689, 1608, ! 1721, 857, 1182, 1707, 1695, 1696, 1297, 99, 344, 144, ! 3, 4, 5, 869, 870, 314, 1644, 3, 4, 5, ! 1748, 1672, 1695, 1080, 1715, 824, 39, 737, 1339, 1167, ! 366, 367, 3, 4, 5, 1378, 1182, 1730, 1468, 1730, ! 1051, 739, 1601, 56, 678, 361, 59, 60, 1695, 1695, ! 3, 4, 5, 207, 7, 8, 9, 1730, 1689, 1695, ! 128, 485, 1549, 1754, 1695, 1696, 59, 60, 1486, 635, ! 56, 1730, 1776, 59, 60, 1745, 1742, 1725, 1792, 32, ! 1689, 852, 1248, 1730, 1730, 38, 1695, 1696, 59, 60, ! 1256, 427, 428, 1445, 1730, 1654, -1, 1726, -1, 1730, ! -1, 1672, -1, -1, 1713, 1714, 59, 60, -1, 445, ! -1, -1, 448, 3, 4, 5, 6, -1, 454, 455, ! 456, 1730, -1, 1754, 460, 83, 84, 85, 86, 87, ! 1689, -1, 3, 4, 5, 6, 1695, 1696, 58, -1, ! -1, 1307, 1713, 1714, 1715, 1754, 3, 4, 5, -1, ! 1316, -1, -1, 43, 83, 84, 85, 86, 87, 495, ! -1, 497, 498, -1, -1, -1, 56, -1, -1, 59, ! 60, 1730, 43, 1029, 1030, 511, -1, -1, 514, 50, ! 516, 517, 518, 73, -1, -1, 522, -1, 59, 60, ! 614, -1, 528, 83, 530, 1754, -1, 533, 3, 4, ! 5, 91, 59, 60, -1, 95, -1, 4, 5, 1768, ! -1, 3, 4, 5, 6, 1350, 1351, 9, 554, 555, ! 91, -1, -1, -1, -1, -1, 3, 4, 5, 1788, ! -1, -1, -1, -1, -1, 32, -1, -1, -1, 1798, ! 32, 32, 1377, -1, 668, 50, -1, 1382, -1, -1, ! 674, 43, 676, 677, 59, 60, -1, 49, -1, 56, ! 1819, 181, 59, 60, 56, -1, -1, 59, 60, -1, ! 606, -1, -1, 50, -1, -1, 73, -1, 1134, 1135, ! 1672, 73, 59, 60, -1, -1, 83, 1143, 1144, -1, ! 714, 83, -1, 629, 630, 631, -1, -1, 95, 91, ! 724, -1, -1, 95, 96, -1, -1, -1, 644, -1, ! 230, -1, -1, -1, -1, -1, -1, 1173, 3, 4, ! 5, 1713, 1714, 1715, -1, -1, 1461, 1462, -1, 1464, ! 1465, -1, 1467, 3, 4, 5, 6, 7, 8, 9, ! -1, 1507, 1508, -1, -1, 15, -1, -1, 3, 4, ! 5, 6, -1, -1, 82, -1, 147, -1, 694, 695, ! 696, 152, 32, 8, 9, 50, -1, 703, 38, 705, ! 15, 707, -1, 43, 59, 60, -1, 47, -1, 49, ! -1, 109, -1, -1, 1519, 1520, 56, 32, 43, 59, ! 60, -1, -1, 38, 49, 731, 1562, -1, -1, -1, ! -1, 56, 47, 73, 59, 60, 3, 4, 5, 137, ! 201, 1267, 1268, 83, 3, 4, 5, 6, 73, -1, ! -1, 91, 150, -1, -1, 95, 96, -1, 83, -1, ! -1, -1, 3, 4, 5, 6, 91, 1572, 1573, 1574, ! 95, 96, -1, -1, -1, -1, -1, 3, 4, 5, ! 6, 40, 41, 9, 43, 1311, 1312, 793, 794, 56, ! -1, 32, 59, 60, -1, -1, -1, 56, -1, -1, ! 59, 60, 43, -1, -1, -1, 32, -1, 49, 270, ! -1, -1, 210, -1, -1, 56, -1, 43, 59, 60, ! 3, 4, 5, 49, 1629, 1630, -1, 833, 834, 835, ! 56, -1, 73, 59, 60, -1, 426, 843, -1, -1, ! -1, -1, 83, 3, 4, 5, 6, 73, 246, 9, ! 91, 857, -1, -1, 95, 96, -1, 83, -1, -1, ! 866, 867, 868, 869, 870, 91, -1, -1, 874, 95, ! 96, -1, 32, -1, -1, -1, 59, 60, -1, 277, ! -1, -1, 888, 43, -1, -1, -1, -1, 3, 4, ! 5, 6, -1, -1, 988, -1, 56, -1, -1, 59, ! 60, -1, -1, -1, 494, -1, 496, 497, 1002, -1, ! 1004, -1, 1006, 73, 3, 4, 5, -1, -1, -1, ! 510, -1, -1, 83, -1, 335, 4, 933, 43, 519, ! -1, 91, -1, 523, -1, 95, 14, -1, 3, 4, ! 5, 531, -1, -1, 59, 60, 24, -1, -1, -1, ! -1, -1, -1, 31, 32, -1, 34, -1, 36, -1, ! -1, 1766, -1, -1, -1, -1, -1, 45, -1, -1, ! 59, 60, -1, 371, -1, -1, 91, -1, -1, -1, ! 58, -1, 60, -1, 445, -1, -1, 448, 1082, -1, ! -1, 69, -1, 391, 59, 60, 74, -1, -1, 460, ! -1, -1, 1008, 4, 5, 1011, -1, 85, 9, 87, ! -1, -1, -1, -1, 92, -1, 1022, 95, -1, 97, ! -1, -1, 1028, 1029, 1030, -1, 1120, -1, -1, -1, ! -1, 32, -1, 111, -1, -1, -1, -1, -1, 437, ! -1, -1, -1, 3, 4, 5, 6, -1, 49, -1, ! 511, -1, -1, 514, -1, 56, -1, -1, 59, 60, ! 138, -1, 140, -1, 142, -1, 144, 528, 146, 147, ! -1, -1, 73, 151, 152, -1, -1, 155, 156, 157, ! 40, 41, 83, 43, -1, -1, -1, -1, 1094, -1, ! -1, -1, -1, 171, 95, 96, 56, 175, -1, 59, ! 60, -1, -1, 181, 182, 3, 4, 5, 6, 81, ! 82, 83, 84, 85, 86, 87, 3, 4, 5, 6, ! -1, -1, 200, 201, 202, 1131, 1132, 1133, 1134, 1135, ! 3, 4, 5, 6, 1140, -1, 1142, 1143, 1144, -1, ! 730, -1, -1, -1, -1, 43, 1672, -1, 1154, 1155, ! 1156, -1, 230, 551, -1, -1, 43, -1, 56, 32, ! -1, 59, 60, 50, -1, 63, -1, 1173, -1, 247, ! 43, -1, 59, 60, -1, 73, 1182, -1, -1, 257, ! -1, -1, -1, 56, -1, 83, 59, 60, 1714, 1715, ! -1, -1, 270, 91, -1, -1, 83, 95, -1, -1, ! 73, -1, -1, 793, 91, 1299, -1, 1301, -1, 1303, ! 83, 609, -1, -1, -1, -1, -1, -1, 91, -1, ! -1, -1, 95, 81, 82, 83, 84, 85, 86, 87, ! 3, 4, 5, 6, 312, 313, 646, 647, -1, 649, ! 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, ! 660, 661, 662, 663, 664, 665, 666, -1, -1, -1, ! 1266, 1267, 1268, -1, -1, -1, -1, -1, 4, 5, ! 43, -1, 862, 9, -1, 865, -1, 50, -1, 357, ! -1, -1, -1, 361, -1, 363, 59, 60, 366, 367, ! -1, 881, -1, 691, -1, -1, 32, -1, 376, 377, ! -1, -1, 1308, 1309, 1310, 1311, 1312, -1, -1, 1315, ! 4, 5, 710, 49, -1, 9, -1, -1, 91, -1, ! 56, -1, -1, 59, 60, 1331, 1332, 1333, -1, -1, ! -1, -1, -1, 1427, -1, -1, 414, 73, 32, -1, ! -1, -1, -1, -1, 1350, 1351, 424, 83, 426, 427, ! -1, -1, 4, 5, -1, 433, -1, 435, -1, 95, ! 96, -1, 56, -1, -1, 59, 60, 445, -1, -1, ! 448, 1377, -1, 834, -1, -1, 1382, -1, -1, 73, ! 32, -1, 460, -1, -1, -1, -1, -1, -1, 83, ! 468, -1, -1, -1, -1, -1, -1, 49, -1, -1, ! -1, 95, -1, -1, 56, 866, 867, 59, 60, -1, ! -1, -1, -1, 874, -1, -1, 494, 495, 496, 497, ! 498, 73, -1, -1, 502, -1, -1, -1, -1, -1, ! -1, 83, 510, 511, 1440, 1441, 514, 1443, 516, 517, ! 518, 519, 840, 95, 96, 523, -1, -1, -1, -1, ! 528, -1, -1, 531, -1, 1461, 1462, -1, 1464, 1465, ! -1, 1467, -1, -1, -1, 543, 200, 201, -1, -1, ! -1, -1, -1, 871, -1, -1, -1, -1, -1, -1, ! -1, 3, 4, 5, 6, 7, 8, 9, -1, 567, ! -1, 13, -1, 15, -1, -1, -1, -1, 1504, 1505, ! 1506, -1, -1, -1, -1, -1, -1, 29, -1, 31, ! 32, -1, -1, 1519, 1520, -1, 38, -1, -1, -1, ! -1, 43, -1, -1, -1, 47, -1, 925, -1, -1, ! -1, -1, -1, 611, 56, 613, -1, 59, 60, -1, ! 1130, 619, 620, 621, 622, -1, 1136, -1, -1, -1, ! 1, 73, 3, 4, 5, 6, 7, 8, 9, -1, ! -1, 83, -1, 641, 15, -1, 1572, 1573, 1574, 91, ! -1, -1, -1, 95, -1, -1, -1, 28, 29, -1, ! 31, 32, 33, -1, -1, -1, -1, 38, -1, -1, ! -1, 1181, 43, -1, -1, 46, 47, 48, -1, 50, ! 678, -1, 680, -1, -1, 56, 57, -1, 59, 60, ! 1616, 1617, 63, -1, 692, -1, 694, 695, 696, -1, ! -1, -1, 73, 1629, 1630, -1, -1, -1, -1, 707, ! -1, -1, 83, 711, 7, 8, 9, 1035, -1, 1037, ! 91, -1, 15, -1, 95, -1, -1, -1, 99, -1, ! -1, -1, 730, -1, -1, -1, -1, -1, -1, 32, ! -1, -1, -1, -1, -1, 38, 1672, -1, -1, -1, ! 1131, 1132, -1, -1, 47, -1, -1, -1, -1, 1140, ! -1, 3, 4, 5, 6, -1, -1, 9, -1, -1, ! 63, 1101, -1, 3, 4, 5, 6, -1, -1, 777, ! -1, 779, -1, -1, -1, -1, 784, 1713, 1714, 1715, ! 32, -1, -1, -1, -1, 793, 794, 1307, -1, 1725, ! -1, 43, -1, 84, -1, -1, 1316, 49, -1, -1, ! 40, 41, -1, 43, 56, -1, -1, 59, 60, -1, ! 1138, -1, -1, 1141, 1334, 1335, 56, -1, -1, 59, ! 60, 73, -1, -1, -1, 833, 834, 835, 1348, -1, ! 1766, 83, -1, 841, -1, 843, -1, -1, -1, 91, ! 7, 8, 9, 95, 96, -1, -1, 511, 15, -1, ! 514, 91, 516, 517, 862, -1, -1, 865, 866, 867, ! 868, 869, 870, -1, 528, 32, 874, -1, -1, -1, ! -1, 38, -1, 881, 165, -1, -1, -1, 4, 5, ! 47, -1, 1222, 9, -1, -1, -1, -1, -1, -1, ! -1, -1, 3, 4, 5, 6, 904, -1, 9, 907, ! 908, 909, -1, 911, -1, 913, 32, 198, -1, -1, ! -1, -1, 66, -1, 922, 923, 924, 1308, 1309, -1, ! 211, 32, -1, -1, 1315, 933, -1, 1447, -1, -1, ! 56, -1, 43, 59, 60, -1, -1, -1, 49, -1, ! -1, -1, -1, 1463, -1, 56, -1, 73, 59, 60, ! -1, -1, -1, -1, -1, -1, -1, 83, -1, -1, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, 95, ! 880, -1, 83, -1, -1, -1, 984, -1, 4, 5, ! 91, -1, -1, 9, 95, 96, -1, 1507, 1508, -1, ! -1, -1, 146, -1, -1, -1, 906, -1, -1, 1007, ! 1008, -1, 912, 1011, -1, -1, 32, -1, 162, -1, ! 1018, -1, -1, -1, 1022, -1, 1024, -1, -1, -1, ! 1028, 1029, 1030, 49, -1, -1, 1034, -1, 1036, -1, ! 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, ! -1, 1369, 1562, 3, 4, 5, 6, 73, -1, -1, ! -1, 4, 5, -1, 7, 8, 9, 83, -1, -1, ! 13, -1, 15, -1, -1, 219, -1, -1, -1, 95, ! 96, -1, -1, -1, 228, -1, 29, -1, 31, 32, ! -1, -1, -1, 43, -1, 38, -1, 1095, -1, 1097, ! 1098, 245, -1, -1, 47, 1615, 49, 1617, -1, 59, ! 60, -1, 256, 56, -1, -1, 59, 60, -1, 1019, ! -1, 1021, -1, -1, 1442, -1, -1, -1, -1, -1, ! 73, -1, 1130, 1131, 1132, 1133, 1134, 1135, 1136, -1, ! 83, 91, 1140, -1, 1142, 1143, 1144, -1, 1466, -1, ! 1148, -1, 95, 96, -1, 1153, 1154, 1155, 1156, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, -1, 4, ! 5, -1, 1170, -1, 9, 1173, 1174, -1, 1176, 833, ! 834, -1, -1, 1181, 1182, -1, 1184, -1, -1, -1, ! 3, 4, 5, 6, -1, -1, -1, 32, -1, 1197, ! -1, 1199, -1, -1, -1, -1, -1, -1, -1, 1207, ! -1, -1, 866, 867, 868, 869, 1726, -1, -1, -1, ! 874, 56, -1, -1, 59, 60, -1, -1, -1, -1, ! 43, 3, 4, 5, 6, -1, 1234, 1235, 73, 1237, ! 521, -1, -1, 56, 1242, 526, 59, 60, 83, -1, ! 1248, -1, 4, 5, -1, 7, 8, 9, 1256, -1, ! 95, 13, -1, 15, -1, -1, -1, -1, 1266, 1267, ! 1268, 43, -1, -1, -1, -1, 557, 29, 91, 31, ! 32, -1, -1, 564, -1, -1, 38, 59, 60, -1, ! -1, 435, -1, -1, -1, 47, 1196, 49, 1198, -1, ! 444, -1, -1, -1, 56, -1, -1, 59, 60, 1307, ! 1308, 1309, 1310, 1311, 1312, -1, -1, 1315, 1316, 91, ! -1, 73, -1, -1, -1, -1, 607, 608, -1, 610, ! -1, 83, 476, 1331, 1332, 1333, 1334, 1335, -1, -1, ! -1, -1, -1, 95, 96, -1, 1344, -1, -1, -1, ! 1348, -1, -1, -1, -1, -1, -1, -1, 1258, 1357, ! -1, -1, -1, -1, -1, -1, 510, -1, -1, 4, ! 5, -1, 1370, -1, 9, 519, -1, -1, -1, -1, ! 1378, 4, -1, -1, 4, 5, -1, -1, -1, 9, ! -1, 14, -1, -1, -1, -1, 540, 32, -1, -1, ! 23, 24, -1, -1, -1, -1, -1, -1, 31, 32, ! -1, 34, 32, 36, 49, -1, -1, -1, 699, 700, ! -1, 56, 45, 567, 59, 60, -1, 708, -1, 49, ! -1, -1, -1, -1, -1, 58, 56, 60, 73, 59, ! 60, -1, 1440, 1441, -1, 1443, 69, 1445, 83, 1447, ! -1, 74, -1, 73, -1, -1, -1, -1, -1, -1, ! 95, 96, -1, 83, 87, 1463, -1, -1, -1, 92, ! 1468, -1, 95, 1471, 97, 95, 96, 1131, 1132, 1133, ! 1134, -1, -1, -1, -1, -1, 1140, -1, 1142, 1143, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! 1154, 1155, 1156, -1, -1, -1, 1504, 1505, 1506, 1507, ! 1508, -1, -1, -1, -1, -1, 1514, 140, -1, 142, ! 1420, 144, -1, 146, 147, -1, -1, -1, -1, 152, ! -1, -1, 155, 156, 157, -1, -1, -1, 4, 5, ! -1, -1, 8, 9, 3, 4, 5, 6, 171, 15, ! -1, 1451, 175, -1, -1, -1, 837, 1457, 181, 182, ! -1, -1, 1560, 29, 1562, 31, 32, -1, -1, -1, ! -1, -1, 38, 1473, 1474, -1, -1, 200, 201, 202, ! -1, 47, -1, -1, 43, -1, -1, 694, 695, 4, ! 56, 872, -1, 59, 60, 61, 1496, 56, -1, -1, ! 59, 60, -1, -1, 63, -1, 65, 230, -1, -1, ! -1, -1, -1, -1, 73, -1, -1, 1615, 1616, 1617, ! -1, 36, -1, -1, 83, -1, -1, -1, -1, 95, ! 45, -1, 91, 914, -1, 916, 95, -1, -1, -1, ! 1540, 1541, -1, 58, -1, 60, -1, 270, 4, 5, ! -1, -1, 8, 9, 1308, 1309, 1310, 1311, -1, 15, ! -1, 1315, -1, 1563, 1564, -1, 1566, 3, 4, 5, ! 6, -1, -1, 29, 1672, 31, 32, 1331, 1332, -1, ! -1, -1, 38, -1, -1, -1, -1, -1, -1, 312, ! 313, 47, -1, -1, -1, -1, -1, -1, -1, -1, ! 56, -1, -1, 59, 60, -1, -1, 43, -1, 990, ! 991, -1, 993, -1, 50, 1713, 1714, 1715, 862, -1, ! -1, 865, -1, 59, 60, 140, 833, 834, 1726, -1, ! -1, 146, -1, -1, 357, -1, -1, 881, 361, 95, ! 363, -1, 1023, 366, 367, -1, -1, 83, -1, 372, ! -1, -1, -1, 376, 377, 91, 171, -1, -1, -1, ! 175, -1, -1, -1, -1, -1, 181, 182, -1, 392, -1, -1, -1, 3, 4, 5, 6, 7, 8, 9, ! 1680, -1, -1, -1, -1, 15, 1440, 1441, -1, 1443, ! -1, 414, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 424, 32, 426, 427, -1, -1, -1, 38, -1, ! 433, -1, 435, 43, -1, 230, -1, 47, -1, 49, ! -1, -1, 445, -1, -1, 448, 56, -1, -1, 59, ! 60, -1, -1, -1, -1, -1, -1, 460, -1, -1, ! -1, -1, -1, 73, -1, 468, 3, 4, 5, 6, ! 1504, 1505, -1, 83, -1, -1, -1, -1, 1139, -1, ! -1, 91, -1, 1007, -1, 95, 96, -1, -1, -1, ! -1, 494, 495, 496, 497, 498, -1, -1, -1, 502, ! -1, -1, -1, -1, -1, -1, 43, 510, 511, -1, ! 1034, 514, -1, 516, 517, 518, 519, -1, -1, 56, ! 523, 1008, 59, 60, 1011, 528, 63, -1, 531, -1, ! -1, -1, 4, 5, -1, 1022, 73, 9, -1, -1, ! 543, 1028, 1029, -1, -1, -1, 83, -1, -1, 552, ! -1, -1, -1, -1, 91, -1, -1, -1, 95, -1, ! 32, -1, -1, -1, 567, -1, -1, -1, -1, 3, ! 4, 5, 6, 7, 8, 9, -1, 49, -1, 13, ! -1, 15, 377, -1, 56, -1, -1, 59, 60, -1, ! -1, 1252, -1, -1, -1, 29, -1, 31, 32, -1, ! -1, 73, -1, -1, 38, -1, 1130, -1, -1, 43, ! 613, 83, 1136, 47, -1, 49, 619, 620, 621, 622, ! -1, -1, 56, 95, 96, 59, 60, -1, -1, -1, ! -1, 426, -1, -1, -1, -1, -1, -1, 641, 73, ! 435, -1, 4, 5, 1131, 1132, 1133, 1134, -1, 83, ! -1, -1, 1313, 1140, -1, 1142, 1143, 91, -1, -1, ! -1, 95, 96, -1, -1, -1, -1, -1, -1, -1, ! 32, -1, -1, 468, -1, 678, -1, 680, -1, 1713, ! 1714, -1, 1343, 3, 4, 5, 6, 49, -1, -1, ! -1, 694, 695, 696, 56, 1356, -1, 59, 60, 494, ! 495, 496, 497, -1, 707, -1, -1, 502, -1, -1, ! -1, 73, -1, -1, -1, 510, -1, -1, -1, 722, ! -1, 83, 1383, 43, 1248, -1, 1387, 730, 523, -1, ! 50, -1, 1256, 95, 96, -1, 531, -1, -1, 59, ! 60, -1, -1, -1, -1, -1, -1, -1, -1, 3, ! 4, 5, 6, -1, -1, 9, 3, 4, 5, 6, ! -1, 1422, -1, 83, -1, -1, -1, -1, -1, -1, ! -1, 91, 567, -1, 777, -1, 779, -1, 32, 1266, ! 1267, -1, 785, 1307, -1, -1, -1, -1, -1, 43, ! 793, 794, 1316, -1, -1, 49, 43, -1, -1, -1, ! -1, -1, 56, 50, -1, 59, 60, -1, -1, -1, ! 1334, 1335, 59, 60, 1475, 1476, 819, -1, -1, 73, ! -1, 1308, 1309, 1310, 1311, -1, -1, -1, 1315, 83, ! 833, 834, 835, -1, -1, -1, 83, 91, -1, -1, ! 843, 95, 96, -1, 91, -1, 3, 4, 5, 6, ! -1, 1512, 1513, -1, -1, -1, -1, 1518, -1, 862, ! -1, -1, 865, 866, 867, 868, 869, 870, -1, -1, ! -1, 874, -1, -1, -1, 32, -1, -1, 881, -1, ! -1, -1, -1, -1, -1, -1, 43, -1, -1, -1, ! -1, -1, 49, -1, -1, -1, -1, -1, -1, 56, ! -1, 904, 59, 60, 907, 908, 909, -1, 911, -1, ! 913, -1, -1, -1, -1, -1, 73, -1, -1, 922, ! 923, 924, -1, 1447, -1, -1, 83, -1, -1, -1, ! 933, -1, -1, -1, 91, 730, -1, -1, 95, 96, ! 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, ! 85, 86, 87, 1440, 1441, -1, 1443, -1, -1, -1, ! -1, -1, -1, -1, -1, 1, 1627, 3, 4, 5, ! 6, 7, 8, 9, -1, -1, -1, -1, -1, 15, ! -1, 984, -1, 1507, 1508, -1, -1, -1, -1, -1, ! -1, -1, -1, 29, -1, 31, 32, 33, 793, -1, ! -1, -1, 38, -1, 1007, 1008, -1, 43, 1011, -1, ! -1, 47, -1, -1, 50, 1018, -1, 1504, 1505, 1022, ! 56, 1024, -1, 59, 60, 1028, 1029, 1030, -1, -1, ! -1, 1034, -1, 1036, -1, -1, -1, 73, 1562, -1, ! -1, -1, -1, -1, -1, -1, -1, 83, -1, -1, ! -1, -1, -1, -1, -1, 91, -1, -1, -1, 95, ! -1, -1, -1, 99, -1, -1, -1, 862, 3, 4, ! 5, 6, 76, 77, 9, 79, 80, 81, 82, 83, ! 84, 85, 86, 87, -1, -1, 881, -1, -1, -1, ! -1, -1, 1095, -1, 1097, 1098, -1, 32, -1, -1, ! -1, -1, 3, 4, 5, 6, -1, -1, 43, 904, ! -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, ! -1, 56, -1, -1, 59, 60, -1, 1130, 1131, 1132, ! 1133, 1134, 1135, 1136, -1, -1, -1, 1140, 73, 1142, ! 1143, 1144, 43, -1, -1, 1148, -1, -1, 83, 50, ! 1153, 1154, 1155, 1156, 13, -1, 91, -1, 59, 60, ! 95, 96, -1, -1, 1167, -1, -1, 1170, -1, -1, ! 1173, 1174, -1, 1176, -1, -1, -1, -1, 1181, 1182, ! -1, 1184, 83, -1, -1, -1, -1, -1, -1, -1, ! 91, -1, -1, -1, 1197, -1, 1199, -1, -1, -1, ! -1, -1, -1, -1, 1207, -1, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! -1, 1234, 1235, -1, 1237, -1, -1, -1, -1, 1242, ! -1, -1, -1, -1, -1, 1248, 3, 4, 5, 6, ! 7, 8, 9, 1256, -1, -1, 13, -1, 15, -1, ! -1, -1, -1, 1266, 1267, 1268, -1, -1, -1, -1, ! -1, -1, 29, -1, 31, 32, -1, -1, -1, -1, ! -1, 38, -1, -1, -1, -1, 43, -1, -1, -1, ! 47, -1, 49, -1, 1297, -1, -1, -1, -1, 56, ! -1, -1, 59, 60, 1307, 1308, 1309, 1310, 1311, 1312, ! -1, -1, 1315, 1316, -1, -1, 73, -1, -1, -1, ! 3, 4, 5, 6, -1, -1, 83, -1, 1331, 1332, ! 1333, 1334, 1335, -1, 91, 1130, 1339, -1, 95, 96, ! -1, 1344, 4, -1, -1, 1348, -1, -1, -1, 32, ! -1, -1, -1, -1, 1357, -1, -1, -1, -1, -1, ! 43, -1, -1, -1, -1, -1, 49, -1, 112, 31, ! 32, -1, 34, 56, 36, 1378, 59, 60, -1, 1174, ! -1, 1176, -1, 45, -1, -1, 1181, 1182, -1, 1184, ! 73, -1, -1, -1, -1, -1, 58, -1, 60, -1, ! 83, -1, -1, -1, -1, -1, -1, -1, 91, -1, ! -1, -1, 95, 96, -1, -1, -1, -1, -1, -1, ! 82, -1, -1, 85, -1, -1, 3, 4, 5, 6, ! -1, -1, 9, -1, -1, -1, -1, 1440, 1441, -1, ! 1443, -1, 1445, -1, 1447, -1, -1, -1, -1, -1, ! -1, -1, 196, -1, -1, 32, -1, -1, -1, -1, ! 1463, -1, -1, -1, -1, 1468, 43, -1, 1471, -1, ! -1, -1, -1, -1, -1, 137, 138, 221, 140, 56, ! -1, -1, 59, 60, 146, 147, -1, -1, 150, 151, ! 152, -1, -1, 155, 156, 157, 73, -1, -1, -1, ! 162, 1504, 1505, 1506, 1507, 1508, 83, -1, -1, 171, ! -1, 1514, 1307, 175, 91, -1, -1, -1, 95, 181, ! 182, 1316, -1, -1, 4, 5, -1, 7, 8, 9, ! -1, -1, -1, -1, -1, 15, -1, -1, 200, 201, ! 202, -1, -1, -1, -1, -1, -1, -1, 210, 29, ! -1, 31, 32, 1348, -1, -1, -1, 1560, 38, 1562, ! -1, -1, -1, -1, -1, -1, -1, 47, 230, -1, ! 50, -1, -1, -1, -1, -1, 56, -1, -1, 59, ! 60, -1, -1, 1378, -1, -1, -1, -1, -1, -1, -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, ! 344, 1604, -1, 15, -1, -1, -1, -1, 270, -1, ! -1, -1, 1615, 1616, 1617, 277, -1, 29, -1, 31, ! 32, 33, -1, -1, -1, -1, 38, -1, -1, 4, ! 5, 43, -1, 8, 9, 47, -1, -1, 50, -1, ! 15, -1, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, 29, -1, 31, 32, -1, -1, ! -1, 73, -1, 38, -1, -1, -1, -1, 1463, 1672, ! -1, 83, 47, 1468, 49, -1, 1471, -1, -1, 91, ! 424, 56, 344, 95, 59, 60, -1, 99, -1, 92, ! -1, -1, 95, -1, 97, -1, -1, -1, 73, 361, ! -1, -1, -1, -1, -1, -1, -1, -1, 83, 371, ! 1713, 1714, 1715, -1, -1, 377, -1, -1, -1, -1, ! 95, 96, -1, 1726, -1, -1, -1, -1, -1, 391, ! -1, -1, -1, 4, 5, -1, -1, 8, 9, 142, ! -1, 144, -1, -1, 15, -1, -1, -1, -1, -1, ! -1, -1, 414, -1, -1, -1, -1, -1, 502, -1, ! -1, 32, -1, -1, 426, -1, -1, 38, -1, -1, ! -1, -1, -1, 435, -1, 437, 47, -1, 49, -1, ! -1, -1, 444, 445, -1, 56, 448, -1, 59, 60, ! -1, -1, 454, 455, 456, -1, -1, -1, 460, -1, ! -1, -1, 73, -1, -1, -1, 468, -1, -1, -1, ! -1, -1, 83, -1, -1, -1, -1, -1, -1, -1, ! 1615, 1616, 1617, -1, 95, 96, -1, -1, 3, 4, ! 5, 6, 494, 495, 496, 497, -1, -1, -1, -1, ! 502, -1, -1, -1, -1, -1, -1, -1, 510, 511, ! -1, -1, 514, -1, 516, 517, 518, 519, -1, -1, ! -1, 523, -1, -1, -1, -1, 528, -1, 43, 531, ! -1, -1, -1, -1, 618, 619, 620, 621, 622, -1, ! -1, 56, -1, -1, 59, 60, -1, 631, -1, -1, 65, -1, -1, -1, -1, -1, -1, -1, 73, -1, ! 644, -1, -1, -1, -1, 567, -1, -1, 83, -1, ! -1, -1, -1, -1, -1, -1, 91, -1, 321, 322, ! 95, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 4, 1726, 335, 677, 337, -1, -1, 340, -1, -1, ! 343, -1, -1, 346, -1, -1, -1, 350, -1, -1, ! -1, -1, 696, -1, -1, 358, -1, 31, 32, 703, ! 34, 705, 36, 707, -1, -1, -1, 629, 630, 631, ! -1, 45, -1, 376, -1, -1, -1, -1, -1, -1, ! -1, -1, 644, -1, 58, -1, 60, 71, 72, 73, ! 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, ! 84, 85, 86, 87, 3, 4, 5, 6, 7, 8, ! 9, 85, 74, 75, 76, 77, 15, 79, 80, 81, ! 82, 83, 84, 85, 86, 87, -1, -1, -1, 691, ! 433, -1, -1, 32, -1, -1, -1, -1, -1, 38, ! -1, 703, -1, 705, 43, 707, -1, -1, 47, -1, ! 49, -1, -1, -1, -1, -1, -1, 56, -1, -1, ! 59, 60, -1, -1, -1, -1, 140, -1, 730, -1, ! -1, -1, 146, 147, 73, -1, -1, 151, 152, -1, ! -1, 155, 156, 157, 83, -1, -1, -1, -1, -1, ! -1, 835, 91, -1, -1, -1, 95, 171, -1, 843, ! -1, 175, -1, -1, -1, -1, -1, 181, 182, -1, ! -1, -1, -1, -1, -1, 777, -1, -1, -1, -1, ! -1, -1, 784, -1, -1, -1, 200, 201, 202, -1, ! -1, 793, 4, 5, -1, -1, 8, 9, -1, -1, ! 543, -1, -1, 15, 76, 77, 78, 79, 80, 81, ! 82, 83, 84, 85, 86, 87, 230, -1, -1, -1, ! 32, -1, -1, 907, -1, -1, 38, -1, -1, 913, ! -1, 833, 834, 835, -1, 47, -1, 49, 840, 841, ! -1, 843, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, -1, 857, 270, -1, -1, -1, ! 862, 73, -1, 865, 866, 867, 868, 869, 870, -1, ! 613, 83, 874, -1, -1, -1, -1, -1, -1, 881, ! -1, -1, -1, 95, 96, -1, 629, 630, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 641, -1, ! 984, -1, 904, 646, 647, -1, 649, 650, 651, 652, ! 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, ! 663, 664, 665, 666, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 1018, -1, -1, -1, -1, -1, ! 1024, 73, 74, 75, 76, 77, 1030, 79, 80, 81, ! 82, 83, 84, 85, 86, 87, -1, -1, 372, -1, ! -1, -1, -1, 377, 74, 75, 76, 77, 78, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, 392, 279, ! 280, 281, 282, 283, 284, -1, 286, 287, 288, 289, ! 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, ! 300, 301, 302, 303, 304, 305, 306, 307, -1, 309, ! -1, 1095, 426, 1097, -1, -1, -1, -1, -1, -1, ! -1, 435, -1, -1, -1, -1, 1028, 1029, 1030, -1, ! -1, 445, 1034, 1035, 448, -1, 779, -1, -1, -1, ! -1, 34, -1, -1, -1, -1, 460, -1, -1, -1, ! -1, 1135, -1, -1, 468, 3, 4, 5, 6, -1, ! 1144, 9, -1, -1, -1, 58, 75, 76, 77, 1153, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! 494, 495, 496, 497, 32, -1, -1, -1, 502, -1, ! -1, -1, -1, -1, -1, 43, 510, 511, -1, -1, ! 514, -1, 516, 517, 518, -1, -1, -1, 56, 523, ! -1, 59, 60, 1197, 528, 1199, -1, 531, -1, -1, ! -1, -1, -1, 1207, -1, 73, -1, -1, 1130, 1131, ! 1132, 1133, 1134, 1135, 1136, 83, 1138, -1, 1140, 1141, ! 1142, 1143, 1144, 91, -1, -1, 1148, 95, -1, -1, ! -1, -1, -1, 567, -1, -1, -1, -1, -1, -1, ! -1, -1, 155, 156, 157, 908, 909, -1, 911, -1, ! -1, 1173, 1174, -1, 1176, -1, -1, -1, -1, 1181, ! 1182, -1, 1184, -1, 1268, -1, -1, -1, 181, 1, ! -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, ! -1, -1, -1, 15, -1, -1, -1, 200, 201, 202, ! -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, ! 32, -1, -1, -1, -1, -1, 38, -1, 1312, -1, ! -1, 43, -1, -1, -1, 47, -1, 230, 50, -1, ! -1, -1, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, 63, -1, 996, -1, -1, -1, -1, -1, -1, ! 1344, 73, -1, -1, 1266, 1267, 1268, -1, -1, -1, ! -1, 83, -1, 1357, -1, -1, -1, -1, 692, 91, ! -1, 581, -1, 95, -1, 1028, 1029, -1, -1, -1, ! -1, -1, 3, 4, 5, 6, -1, -1, 9, -1, ! -1, -1, -1, -1, 604, 1307, 1308, 1309, 1310, 1311, ! 1312, -1, 612, 1315, 1316, -1, 730, -1, -1, -1, ! 313, 32, -1, -1, -1, 3, 4, 5, 6, 7, ! 8, 9, 43, -1, -1, 13, -1, 15, -1, -1, ! -1, -1, -1, -1, -1, 56, 1348, -1, 59, 60, ! -1, 29, -1, 31, 32, 1098, -1, -1, 1101, -1, ! 38, 1445, 73, -1, -1, 43, -1, 1369, 1370, 47, ! 363, 49, 83, 366, 367, -1, 1378, -1, 56, 793, ! 91, 59, 60, -1, 95, 3, 4, 5, 6, -1, ! -1, 9, -1, -1, -1, 73, -1, -1, -1, 1142, ! 1143, -1, -1, -1, -1, 83, -1, -1, -1, -1, ! -1, -1, -1, 91, 32, -1, -1, 95, 96, 833, ! 834, 835, 1506, -1, -1, 43, -1, 841, -1, 843, ! 1514, -1, -1, 426, -1, -1, -1, -1, 56, -1, ! -1, 59, 60, -1, -1, -1, -1, -1, 862, -1, ! -1, -1, 866, 867, -1, 73, -1, -1, -1, -1, ! 874, 1463, -1, -1, 1466, 83, 1468, 881, -1, 1471, ! -1, -1, -1, 91, -1, -1, 1560, 95, -1, 1222, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 904, -1, -1, -1, -1, -1, -1, 1240, -1, 1242, ! -1, 494, -1, 496, 497, 498, 1, -1, -1, 4, ! 5, -1, -1, 8, 9, -1, -1, 510, 511, -1, ! 15, 514, -1, 516, 517, 518, 519, -1, -1, -1, ! 523, -1, -1, -1, 29, 528, 31, 32, 531, -1, ! -1, -1, -1, 38, -1, 40, 41, -1, -1, -1, ! -1, -1, 47, -1, 49, -1, -1, -1, -1, -1, ! -1, 56, -1, -1, 59, 60, -1, 62, -1, -1, ! -1, 66, 67, 68, 69, 70, 71, 72, 73, 74, ! 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, ! 85, 86, -1, -1, 89, 90, 91, -1, 93, -1, ! -1, 96, -1, 3, 4, 5, 6, -1, -1, 9, ! -1, -1, 58, 1615, 1616, 1617, -1, 112, 918, 919, ! 1, -1, 1036, 4, 5, -1, -1, 8, 9, -1, ! -1, 1715, 32, -1, 15, -1, 82, -1, -1, 85, ! -1, -1, -1, 43, -1, -1, -1, -1, 29, -1, ! 31, 32, 3, 4, 5, 6, 56, 38, 9, 59, ! 60, -1, -1, 109, -1, 111, 47, -1, -1, -1, ! 1672, -1, -1, 73, -1, 56, -1, -1, 59, 60, ! -1, 32, -1, 83, -1, -1, -1, 680, -1, -1, ! -1, 91, 43, -1, -1, 95, -1, -1, -1, -1, ! -1, 694, 695, 696, -1, 56, -1, -1, 59, 60, ! -1, 1713, 1714, 1715, 707, -1, 1130, 1131, 1132, 1133, ! 1134, 1135, 73, -1, 1726, -1, 1140, -1, 1142, 1143, ! 1144, -1, 83, -1, 1148, 181, -1, 730, -1, -1, ! 91, -1, -1, 1, 95, 3, 4, 5, 6, 7, ! 8, 9, -1, -1, 200, 201, 202, 15, -1, 1173, ! 1174, -1, 1176, -1, 210, -1, -1, 1181, 1182, -1, ! 1184, 29, -1, 31, 32, 33, -1, -1, -1, -1, ! 38, 39, -1, -1, 230, 43, -1, -1, -1, 47, ! 48, -1, 50, -1, -1, -1, -1, -1, 56, -1, ! 793, 59, 60, -1, -1, 63, -1, 65, -1, -1, ! -1, 257, -1, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 83, 3, 4, 5, 6, ! -1, 277, 9, 91, -1, -1, -1, 95, -1, -1, ! 833, 834, 835, -1, -1, -1, -1, -1, -1, -1, ! 843, -1, -1, 111, -1, 32, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 1608, 43, -1, -1, 862, ! -1, -1, 865, 866, 867, 868, 869, 870, -1, 56, ! -1, 874, 59, 60, -1, -1, -1, -1, 881, -1, ! -1, -1, -1, 1307, 1308, 1309, 73, 3, 4, 5, ! 6, 1315, 1316, -1, -1, -1, 83, -1, -1, -1, ! -1, -1, -1, -1, 91, -1, -1, -1, 95, -1, ! -1, -1, -1, -1, -1, 371, 372, -1, -1, 922, ! 923, 924, -1, -1, 1348, -1, -1, 43, 4, 5, ! 933, 7, 8, 9, -1, 391, 392, 13, -1, 15, ! 56, -1, -1, 59, 60, -1, 1370, -1, -1, 65, ! -1, -1, -1, 29, 1378, 31, 32, 73, -1, -1, ! 1713, 1714, 38, -1, -1, -1, -1, 83, -1, -1, ! 426, 47, -1, -1, -1, 91, -1, -1, -1, 95, ! 56, -1, -1, 59, 60, -1, -1, -1, -1, 3, ! 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, ! -1, 15, -1, -1, 1007, 1008, -1, -1, 1011, -1, ! -1, -1, -1, -1, -1, 29, -1, 31, 32, 1022, ! -1, -1, -1, -1, 38, 1028, 1029, 1030, -1, 43, ! -1, 1034, -1, 47, -1, 49, -1, -1, 494, 1463, ! 496, 497, 56, -1, 1468, 59, 60, 1471, -1, -1, ! -1, -1, -1, -1, 510, 511, -1, -1, 514, 73, ! 516, 517, 518, 519, 32, -1, -1, 523, -1, 83, ! -1, -1, 528, -1, -1, 531, -1, 91, -1, -1, ! -1, 95, 96, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 196, -1, -1, -1, -1, -1, 66, 67, ! 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, ! -1, -1, -1, -1, -1, -1, -1, 1130, 1131, 1132, ! 1133, 1134, 1135, 1136, -1, -1, -1, 1140, -1, 1142, ! 1143, 1144, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 1154, 1155, 1156, -1, -1, -1, 1, -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, ! 1173, 15, -1, -1, -1, -1, -1, -1, 1181, -1, ! 3, 4, 5, 6, -1, 29, -1, 31, 32, 33, ! -1, 1615, 1616, 1617, 38, 39, -1, -1, -1, 43, ! -1, -1, -1, 47, 48, -1, 50, -1, -1, 32, ! -1, -1, 56, -1, -1, 59, 60, -1, -1, 63, ! 43, 65, -1, -1, -1, -1, -1, -1, -1, 73, ! -1, 1234, 1235, 56, 1237, -1, 59, 60, -1, 83, ! -1, -1, -1, -1, -1, 1248, -1, 91, 1672, -1, ! 73, 95, -1, 1256, 710, 711, -1, -1, -1, -1, ! 83, -1, -1, 1266, 1267, 1268, -1, 111, 91, -1, ! -1, -1, 95, -1, 730, -1, -1, -1, -1, -1, ! -1, 385, -1, -1, -1, -1, -1, -1, -1, 1713, ! 1714, 1715, 4, 5, -1, 7, 8, 9, -1, -1, ! -1, 13, 1726, 15, 1307, 1308, 1309, 1310, 1311, 1312, ! -1, -1, 1315, 1316, -1, -1, -1, 29, -1, 31, ! 32, -1, -1, -1, -1, -1, 38, -1, 1331, 1332, ! 1333, 1334, 1335, -1, -1, 47, -1, 793, -1, -1, ! -1, -1, -1, -1, 56, 1348, -1, 59, 60, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 363, -1, ! -1, 366, 367, 3, 4, 5, 6, 7, 8, 9, ! -1, -1, -1, -1, -1, 15, -1, 833, 834, 835, ! 484, 485, -1, -1, 840, 841, -1, 843, -1, 29, ! -1, 31, 32, -1, -1, -1, -1, -1, 38, -1, ! -1, -1, -1, 43, -1, -1, 862, 47, -1, 865, ! 866, 867, 868, 869, 870, 871, 56, -1, 874, 59, ! 60, -1, -1, 63, -1, 881, -1, 3, 4, 5, ! 6, -1, -1, 73, -1, -1, -1, 1440, 1441, -1, ! 1443, -1, -1, 83, 1447, -1, -1, 903, -1, -1, ! -1, 91, -1, -1, -1, 95, 32, -1, -1, -1, ! 1463, 72, 73, 74, 75, 76, 77, 43, 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, -1, -1, ! 56, -1, -1, 59, 60, -1, -1, -1, -1, 494, ! -1, 496, 497, 498, -1, -1, -1, 73, -1, -1, ! -1, 1504, 1505, 1506, 1507, 1508, -1, 83, -1, -1, ! 614, -1, -1, 617, -1, 91, -1, -1, -1, 95, -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, ! -1, -1, -1, 15, -1, -1, -1, -1, -1, 643, ! -1, 4, 5, -1, 7, 8, 9, 29, -1, 31, ! 32, -1, 15, -1, -1, -1, 38, -1, -1, 1562, ! -1, 43, -1, -1, 668, 47, 29, -1, 31, 32, ! 674, -1, 676, 677, 56, 38, -1, 59, 60, 1035, ! 1036, 1037, -1, 65, 47, -1, -1, -1, -1, -1, ! -1, 73, -1, 56, -1, -1, 59, 60, -1, -1, ! -1, 83, -1, 707, -1, -1, -1, -1, -1, 91, ! 714, -1, 1615, 95, 1617, -1, -1, -1, -1, -1, ! 724, 70, 71, 72, 73, 74, 75, 76, 77, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, 743, ! 744, 745, 746, -1, 748, 749, 750, 751, 752, 753, ! 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, ! 764, 765, 766, -1, -1, -1, -1, -1, -1, 1672, ! -1, -1, -1, -1, 1130, 1131, 1132, 1133, 1134, 1135, ! 1136, -1, 1138, -1, 1140, 1141, 1142, 1143, 1144, 694, ! 695, 696, 1148, -1, -1, -1, -1, -1, 1154, 1155, ! 1156, 1, 707, 3, 4, 5, 6, 7, 8, 9, ! 1713, 1714, 1715, 13, -1, 15, -1, -1, -1, -1, ! 824, -1, -1, 1726, -1, 1181, 26, -1, 28, -1, ! -1, -1, 32, -1, -1, -1, -1, -1, 38, 843, -1, -1, -1, 43, -1, -1, -1, 47, -1, 49, ! -1, -1, -1, 857, -1, -1, 56, -1, -1, 59, 60, 61, 62, 63, -1, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, 793, 89, ! 90, 91, -1, 93, 94, 95, 96, 97, -1, -1, ! -1, -1, -1, 103, 104, -1, 14, -1, -1, 109, ! 110, 111, -1, 113, -1, 23, 24, -1, -1, -1, ! -1, -1, -1, 31, 32, -1, 34, -1, 833, 834, ! 835, -1, -1, -1, -1, -1, -1, -1, 843, -1, ! -1, -1, -1, -1, -1, -1, 950, -1, -1, -1, ! -1, 1307, 1308, 1309, 1310, 1311, 1312, -1, -1, 1315, ! 1316, 69, -1, 4, 5, -1, -1, 8, 9, -1, ! 3, 4, 5, 6, 15, 1331, 1332, 1333, 1334, 1335, ! -1, -1, -1, 987, 988, -1, -1, -1, 29, -1, ! 31, 32, 1348, -1, -1, -1, -1, 38, 1002, 32, ! 1004, -1, 1006, -1, -1, -1, 47, -1, -1, -1, ! 43, -1, -1, 1369, -1, 56, -1, -1, 59, 60, ! 128, -1, 130, 56, -1, -1, 59, 60, 933, 137, ! 138, -1, -1, -1, -1, -1, -1, -1, 146, 147, ! 73, -1, 150, 151, 152, 1049, 154, 155, 156, 157, ! 83, -1, -1, -1, -1, -1, -1, -1, 91, -1, ! -1, -1, 95, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, 1082, -1, ! -1, -1, -1, -1, 1440, 1441, 1442, 1443, -1, -1, ! -1, 1447, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 1007, 1008, -1, -1, 1011, 1463, -1, -1, ! -1, -1, -1, -1, -1, -1, 1120, 1022, -1, -1, ! -1, -1, -1, 1028, 1029, 1030, -1, -1, 1, 1034, ! 3, 4, 5, 6, 7, 8, 9, -1, 246, 247, ! -1, -1, 15, -1, -1, -1, 1150, 1151, 1504, 1505, ! 1506, 1507, 1508, -1, -1, -1, 29, -1, 31, 32, ! 33, -1, 270, -1, -1, 38, -1, -1, 1172, -1, ! 43, -1, -1, -1, 47, 48, -1, 50, -1, -1, ! -1, -1, -1, 56, -1, -1, 59, 60, -1, -1, ! 63, -1, 65, -1, -1, -1, -1, -1, -1, -1, ! 73, -1, -1, -1, -1, 313, 1562, -1, -1, -1, ! 83, -1, -1, -1, 1218, 1219, -1, -1, 91, -1, ! -1, -1, 95, -1, -1, 1130, 1131, 1132, 1133, 1134, ! 1135, 1136, -1, -1, -1, 1140, -1, 1142, 1143, 1144, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 361, -1, 363, -1, -1, 366, 1615, ! -1, 1617, -1, -1, -1, -1, 4, 5, -1, -1, ! 8, 9, -1, -1, 1278, -1, -1, 15, -1, -1, ! -1, -1, -1, -1, -1, 3, 4, 5, 6, -1, ! -1, 29, -1, 31, 32, 1299, -1, 1301, -1, 1303, ! 38, 1305, -1, -1, -1, -1, 414, -1, -1, 47, ! -1, -1, -1, -1, 32, -1, 1672, -1, 56, -1, ! -1, 59, 60, -1, -1, 43, -1, 435, -1, 437, ! -1, -1, 1336, -1, -1, -1, -1, 445, 56, -1, ! 448, 59, 60, 1248, -1, -1, -1, -1, -1, -1, ! -1, 1256, 460, -1, -1, 73, 1360, 1713, 1714, 1715, ! -1, 1266, 1267, 1268, -1, 83, -1, -1, -1, -1, ! 1726, -1, -1, 91, -1, -1, -1, 95, 72, 73, ! 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, ! 84, 85, 86, 87, 1398, -1, -1, -1, -1, -1, ! -1, -1, 1307, 1308, 1309, 1310, 1311, 1312, -1, -1, ! 1315, 1316, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 1427, -1, -1, -1, 3, 4, 5, ! 6, -1, 1, -1, 3, 4, 5, 6, 7, 8, ! 9, -1, -1, 551, 552, 1449, 15, -1, -1, -1, ! -1, -1, -1, -1, -1, 1459, 1460, -1, -1, 567, ! 29, -1, 31, 32, 33, -1, -1, 43, -1, 38, ! 39, -1, -1, -1, 43, -1, -1, -1, 47, 48, ! 56, 50, -1, 59, 60, 1489, -1, 56, -1, 65, ! 59, 60, -1, -1, 63, -1, 65, 73, -1, -1, ! -1, 609, -1, 611, 73, -1, -1, 83, -1, -1, ! -1, -1, -1, -1, 83, 91, -1, -1, -1, 95, ! -1, 1525, 91, -1, -1, -1, 95, -1, -1, -1, ! -1, -1, -1, -1, -1, 1440, 1441, -1, 1443, -1, ! -1, -1, 111, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 3, 4, 5, 6, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 1570, 1571, -1, -1, ! -1, -1, 680, -1, -1, -1, -1, -1, -1, -1, ! -1, 32, -1, 691, 692, -1, 694, 695, -1, -1, ! -1, -1, 43, 1597, -1, -1, -1, -1, -1, 1504, ! 1505, 1506, 1507, 1508, -1, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! -1, 1635, 83, -1, -1, -1, -1, -1, -1, -1, ! 91, -1, -1, -1, 95, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 77, 1562, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, -1, 1672, 777, ! -1, -1, -1, -1, -1, -1, 784, 785, -1, -1, ! -1, -1, -1, -1, -1, -1, 794, -1, -1, -1, ! -1, -1, -1, 1697, -1, 1, -1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, -1, 14, 15, ! 16, 819, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, ! 46, 47, 48, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, 61, -1, 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, -1, 89, 90, 91, -1, -1, -1, 95, ! -1, 97, -1, -1, -1, 903, -1, -1, -1, -1, ! -1, -1, -1, -1, 1808, 111, 112, -1, -1, -1, ! -1, -1, -1, -1, 922, 923, 924, 925, -1, -1, ! -1, -1, -1, -1, -1, 933, -1, -1, -1, 1, ! -1, 3, 4, 5, 6, 7, 8, 9, 10, 11, ! 12, -1, 14, 15, 16, -1, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, ! 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, 46, 47, 48, -1, -1, 51, ! 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, ! -1, 63, 64, -1, -1, -1, -1, -1, 70, 1007, ! 1008, 73, -1, 1011, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, 1022, -1, -1, 89, 90, 91, ! -1, -1, -1, 95, -1, 97, 1034, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, ! 112, 3, 4, 5, 6, 7, 8, 9, 10, 11, ! 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, ! 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, 49, -1, 51, ! 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, ! -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, -1, 89, 90, 91, ! -1, -1, -1, 95, 96, -1, -1, -1, -1, -1, ! 1, -1, 3, 4, 5, 6, 7, 8, 9, -1, ! 112, -1, -1, -1, 15, -1, -1, -1, -1, 1167, ! -1, -1, 1170, -1, -1, 1173, -1, -1, 29, -1, ! 31, 32, 33, -1, -1, -1, -1, 38, 39, -1, ! -1, -1, 43, -1, -1, -1, 47, 48, -1, 50, ! -1, -1, -1, -1, -1, 56, -1, -1, 59, 60, ! -1, -1, 63, -1, 65, 71, 72, 73, 74, 75, ! 76, 77, 73, 79, 80, 81, 82, 83, 84, 85, ! 86, 87, 83, -1, -1, -1, 1234, 1235, -1, 1237, ! 91, -1, -1, -1, 95, -1, -1, -1, -1, -1, ! 1248, -1, -1, -1, -1, -1, -1, -1, 1256, -1, ! 111, -1, -1, -1, -1, -1, -1, -1, 1266, 1267, ! -1, -1, -1, 1, -1, 3, 4, 5, 6, 7, ! 8, 9, 10, 11, 12, 13, 14, 15, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 1297, ! -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, 49, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, ! -1, 1339, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! -1, 89, 90, 91, -1, -1, -1, 95, 96, -1, ! -1, -1, 1370, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 1, 112, 3, 4, 5, 6, 7, ! 8, 9, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, ! -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, 1466, -1, ! 1468, 89, 90, 91, -1, -1, 1, 95, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, -1, 14, ! 15, -1, 110, -1, 112, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, ! 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, 61, -1, 63, 64, ! -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, ! -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, -1, 89, 90, 91, -1, -1, 1, ! 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, -1, 89, 90, 91, ! -1, -1, -1, 95, 96, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 111, ! 112, 1, -1, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, -1, 89, ! 90, 91, -1, -1, 1, 95, 3, 4, 5, 6, ! -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, -1, 89, 90, 91, -1, -1, -1, 95, 96, ! 1, -1, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, 112, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, ! 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, ! 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, ! 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, -1, 89, 90, ! 91, -1, -1, -1, 95, 1, -1, 3, 4, 5, ! 6, 102, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, -1, 89, 90, 91, -1, -1, 1, 95, ! 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, ! -1, 14, 15, -1, -1, 111, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, ! -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, 1, 95, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, 111, 112, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, ! 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, ! -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, ! 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, ! 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, -1, 89, ! 90, 91, -1, -1, 1, 95, 3, 4, 5, 6, ! -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, ! -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, 63, 64, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, -1, 89, 90, 91, -1, -1, 1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, -1, 89, 90, 91, -1, -1, ! 1, 95, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, ! 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, ! 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, ! -1, -1, -1, 64, 65, -1, -1, -1, -1, 70, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, -1, 89, 90, ! 91, -1, -1, 1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, ! -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! -1, 89, 90, 91, -1, -1, 1, 95, 3, 4, ! 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, ! 15, -1, 110, -1, 112, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, ! 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, ! -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, ! -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, -1, 89, 90, 91, -1, -1, 1, ! 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, -1, 89, 90, 91, ! -1, -1, 1, 95, 3, 4, 5, 6, -1, 8, ! 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, ! 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, ! -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, ! -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, -1, ! 89, 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, -1, 89, 90, 91, -1, -1, -1, 95, ! 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, ! -1, 14, 15, -1, -1, -1, 112, 113, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, ! -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, ! 113, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, ! 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, ! -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, ! 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, ! 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, -1, 89, ! 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, ! -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, ! -1, -1, 112, 113, -1, -1, -1, -1, -1, -1, ! -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, -1, 89, 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, 112, 113, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, -1, 89, 90, 91, -1, -1, ! -1, 95, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 112, 113, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, 14, 15, 16, -1, 18, 19, 20, 21, 22, --- 1257,4412 ---- }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, ! 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, ! 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, ! 315, 123, 44, 59, 316, 58, 61, 317, 63, 318, ! 319, 124, 94, 38, 320, 321, 60, 62, 322, 323, ! 324, 43, 45, 42, 47, 37, 325, 326, 126, 327, ! 328, 329, 330, 46, 40, 91, 331, 332, 333, 334, ! 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, ! 41, 125, 33, 93 ! }; ! # endif ! ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned short yyr1[] = ! { ! 0, 114, 115, 115, 117, 116, 116, 118, 118, 119, ! 120, 121, 122, 124, 123, 125, 125, 126, 125, 125, ! 125, 125, 125, 125, 127, 125, 128, 125, 125, 125, ! 125, 125, 130, 129, 131, 131, 131, 132, 132, 132, ! 134, 133, 135, 135, 136, 136, 136, 136, 137, 137, ! 139, 138, 140, 141, 141, 142, 142, 143, 143, 144, ! 144, 145, 146, 146, 146, 146, 146, 146, 147, 147, ! 148, 148, 148, 148, 148, 148, 149, 149, 149, 149, ! 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, ! 150, 151, 151, 152, 152, 152, 153, 153, 155, 154, ! 156, 156, 156, 158, 157, 157, 159, 157, 157, 160, ! 157, 157, 161, 157, 157, 162, 162, 162, 162, 162, ! 163, 163, 163, 163, 163, 163, 164, 164, 164, 164, ! 164, 164, 164, 165, 166, 166, 166, 167, 168, 169, ! 169, 169, 169, 170, 170, 170, 170, 170, 170, 170, ! 170, 170, 171, 171, 171, 171, 171, 172, 172, 172, ! 173, 173, 173, 175, 174, 176, 174, 177, 174, 178, ! 174, 179, 174, 180, 174, 181, 174, 182, 174, 183, ! 184, 185, 185, 185, 186, 186, 187, 188, 189, 189, ! 190, 190, 191, 191, 192, 192, 192, 192, 192, 193, ! 193, 193, 193, 193, 194, 194, 195, 195, 196, 196, ! 197, 197, 197, 199, 198, 198, 200, 200, 200, 200, ! 201, 201, 201, 201, 202, 202, 203, 203, 203, 203, ! 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, ! 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, ! 204, 204, 205, 205, 205, 205, 206, 206, 207, 207, ! 207, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, ! 208, 208, 208, 208, 208, 208, 209, 209, 209, 209, ! 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, ! 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, ! 210, 210, 210, 210, 210, 210, 210, 211, 212, 212, ! 213, 213, 213, 214, 214, 214, 215, 215, 216, 216, ! 216, 216, 217, 217, 218, 218, 218, 218, 219, 219, ! 219, 219, 219, 219, 219, 219, 220, 219, 219, 219, ! 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, ! 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, ! 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, ! 219, 219, 219, 221, 221, 222, 222, 223, 223, 224, ! 224, 225, 226, 226, 227, 227, 227, 227, 227, 227, ! 228, 228, 229, 229, 230, 230, 230, 230, 230, 231, ! 231, 232, 232, 232, 232, 232, 232, 233, 233, 233, ! 234, 234, 234, 234, 234, 235, 235, 235, 235, 236, ! 236, 236, 236, 237, 238, 239, 240, 240, 240, 240, ! 240, 240, 240, 241, 241, 241, 242, 242, 243, 243, ! 244, 244, 245, 245, 247, 246, 246, 249, 248, 248, ! 250, 251, 253, 252, 252, 254, 254, 255, 255, 256, ! 257, 257, 258, 258, 258, 258, 258, 259, 259, 259, ! 259, 260, 260, 261, 261, 262, 262, 262, 262, 262, ! 263, 263, 263, 263, 263, 264, 264, 264, 265, 265, ! 266, 266, 267, 267, 267, 269, 268, 270, 268, 268, ! 268, 268, 271, 272, 273, 268, 268, 274, 274, 275, ! 275, 276, 276, 276, 276, 276, 276, 277, 277, 277, ! 277, 278, 278, 278, 279, 279, 279, 280, 280, 280, ! 280, 280, 280, 280, 281, 281, 281, 282, 282, 283, ! 283, 284, 284, 285, 285, 285, 285, 286, 286, 286, ! 286, 287, 288, 288, 289, 289, 289, 289, 289, 289, ! 289, 289, 289, 289, 289, 290, 290, 290, 290, 290, ! 290, 290, 290, 290, 291, 291, 291, 292, 292, 292, ! 293, 293, 294, 294, 295, 295, 296, 296, 296, 296, ! 297, 297, 298, 298, 298, 299, 299, 300, 300, 301, ! 301, 302, 302, 302, 303, 303, 304, 304, 304, 304, ! 305, 305, 305, 305, 306, 306, 307, 307, 307, 307, ! 307, 307, 308, 308, 308, 308, 308, 308, 309, 309, ! 310, 310, 310, 311, 312, 312, 313, 313, 313, 313, ! 313, 313, 314, 314, 314, 314, 314, 314, 315, 315, ! 315, 315, 315, 315, 315, 315, 316, 316, 317, 317, ! 318, 318, 319, 319, 319, 320, 320, 320, 321, 321, ! 321, 321, 321, 322, 322, 322, 322, 323, 323, 324, ! 324, 324, 324, 325, 325, 325, 325, 326, 326, 326, ! 326, 326, 326, 327, 328, 328, 328, 329, 329, 330, ! 331, 331, 331, 331, 331, 331, 331, 332, 332, 333, 333, 334, 334, 334, 334, 334, 334, 334, 334, 334, ! 334, 334, 335, 335, 335, 335, 335, 335, 335, 335, ! 335, 335, 336, 336, 336, 336, 337, 338, 338, 339, ! 339, 340, 342, 341, 343, 345, 346, 344, 347, 348, ! 347, 349, 349, 350, 350, 351, 350, 350, 352, 353, ! 350, 354, 355, 350, 356, 357, 358, 359, 350, 360, ! 361, 350, 362, 350, 363, 350, 364, 350, 350, 350, ! 350, 350, 350, 350, 350, 350, 350, 350, 350, 350, ! 350, 350, 350, 350, 350, 350, 350, 350, 366, 367, ! 365, 369, 370, 368, 371, 371, 371, 373, 374, 372, ! 375, 375, 376, 376, 377, 377, 377, 377, 378, 378, ! 378, 379, 379, 380, 380, 380, 381, 381, 382, 382, ! 383, 383, 384, 384, 385, 385, 385, 386, 386, 386, ! 386, 386, 386, 386, 388, 387, 389, 389, 390, 390, ! 390, 390, 390, 391, 391, 392, 392, 392, 392, 392, ! 392, 393, 393, 394, 394, 395, 396, 396, 397, 398, ! 398, 399, 399, 400, 400, 400, 401, 401, 402, 402, ! 403, 403, 403, 403, 404, 405, 406, 406, 406, 406, ! 406, 406, 406, 406, 406, 406, 406, 406, 406, 406, ! 406, 406, 406, 406, 406, 406, 406, 406, 406, 406, ! 406, 406, 406, 406, 406, 406, 406, 406, 406, 406, ! 406, 407 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = { ! 0, 2, 0, 1, 0, 2, 2, 1, 0, 0, ! 0, 1, 1, 0, 2, 2, 1, 0, 3, 1, ! 5, 4, 5, 4, 0, 6, 0, 5, 1, 2, ! 1, 2, 0, 6, 2, 3, 3, 3, 3, 4, ! 0, 5, 2, 3, 1, 1, 2, 2, 1, 2, ! 0, 5, 3, 1, 1, 1, 3, 1, 0, 2, ! 2, 3, 1, 3, 1, 3, 1, 3, 2, 2, ! 2, 1, 1, 5, 4, 2, 2, 3, 3, 2, ! 2, 3, 3, 2, 2, 2, 2, 2, 2, 1, ! 1, 1, 1, 0, 1, 2, 0, 1, 0, 6, ! 3, 3, 3, 0, 8, 5, 0, 9, 6, 0, ! 8, 5, 0, 9, 6, 2, 2, 1, 2, 1, ! 6, 8, 4, 6, 6, 4, 2, 1, 2, 2, ! 1, 2, 1, 2, 2, 4, 2, 2, 0, 0, ! 1, 3, 2, 3, 1, 4, 2, 4, 2, 4, ! 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 0, 6, 0, 6, 0, 5, 0, ! 5, 0, 7, 0, 7, 0, 6, 0, 6, 0, ! 0, 5, 5, 1, 1, 5, 5, 0, 1, 1, ! 0, 1, 1, 3, 1, 1, 2, 1, 3, 1, ! 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, ! 0, 1, 1, 0, 7, 1, 1, 3, 4, 3, ! 3, 3, 3, 3, 1, 1, 1, 2, 2, 2, ! 2, 2, 2, 2, 4, 2, 4, 2, 3, 3, ! 4, 4, 5, 5, 6, 2, 4, 5, 2, 2, ! 3, 3, 3, 1, 3, 2, 3, 4, 1, 2, ! 5, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 5, 3, 3, 1, 2, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 5, 3, 3, 1, 2, ! 3, 3, 1, 1, 1, 1, 1, 0, 5, 5, ! 5, 5, 5, 1, 1, 1, 1, 2, 1, 2, ! 2, 3, 4, 4, 1, 1, 1, 3, 1, 1, ! 1, 1, 1, 3, 3, 3, 0, 4, 4, 2, ! 4, 2, 6, 4, 2, 2, 1, 4, 1, 7, ! 7, 7, 7, 4, 4, 2, 2, 2, 1, 4, ! 2, 2, 5, 3, 2, 2, 5, 3, 5, 3, ! 4, 6, 2, 1, 2, 1, 2, 1, 1, 1, ! 2, 0, 2, 2, 3, 3, 3, 2, 2, 2, ! 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, ! 1, 2, 2, 3, 3, 3, 4, 1, 2, 2, ! 1, 1, 2, 2, 2, 1, 2, 2, 3, 1, ! 2, 2, 1, 1, 1, 1, 1, 1, 1, 4, ! 4, 4, 4, 1, 1, 1, 1, 3, 1, 3, ! 1, 3, 0, 4, 0, 6, 3, 0, 4, 1, ! 3, 3, 0, 4, 3, 0, 1, 1, 2, 6, ! 1, 3, 0, 1, 4, 6, 4, 1, 1, 1, ! 1, 1, 3, 0, 2, 1, 2, 3, 4, 1, ! 1, 3, 4, 3, 5, 3, 3, 3, 0, 3, ! 3, 3, 0, 2, 2, 0, 6, 0, 5, 2, ! 2, 2, 0, 0, 0, 11, 1, 0, 1, 0, ! 1, 1, 2, 2, 2, 2, 2, 2, 3, 4, ! 3, 2, 3, 4, 1, 2, 1, 2, 2, 2, ! 2, 3, 3, 2, 0, 2, 3, 1, 4, 1, ! 3, 1, 1, 2, 2, 3, 3, 0, 1, 3, ! 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, ! 1, 2, 2, 3, 1, 2, 2, 4, 4, 2, ! 1, 5, 4, 1, 0, 1, 3, 0, 1, 3, ! 1, 1, 1, 1, 4, 4, 4, 4, 4, 3, ! 4, 4, 4, 4, 3, 2, 1, 1, 3, 1, ! 3, 2, 1, 6, 0, 2, 1, 2, 1, 2, ! 3, 3, 1, 3, 1, 2, 3, 3, 2, 2, ! 3, 1, 4, 4, 3, 3, 2, 1, 1, 2, ! 1, 1, 2, 2, 1, 2, 3, 3, 2, 2, ! 3, 1, 3, 3, 2, 2, 3, 1, 4, 3, ! 4, 3, 1, 2, 2, 2, 2, 2, 2, 2, ! 1, 2, 4, 4, 2, 1, 1, 1, 1, 2, ! 4, 3, 3, 2, 2, 2, 2, 1, 2, 2, ! 2, 2, 3, 1, 2, 3, 4, 2, 2, 2, ! 2, 2, 2, 4, 2, 1, 2, 2, 3, 1, ! 3, 2, 3, 2, 2, 3, 1, 3, 4, 1, ! 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, ! 3, 1, 3, 6, 4, 4, 3, 5, 3, 3, ! 3, 2, 1, 1, 2, 2, 2, 0, 1, 1, ! 2, 3, 0, 4, 1, 0, 0, 5, 1, 0, ! 3, 1, 2, 1, 2, 0, 4, 1, 0, 0, ! 5, 0, 0, 7, 0, 0, 0, 0, 12, 0, ! 0, 7, 0, 5, 0, 7, 0, 4, 2, 2, ! 2, 3, 6, 8, 10, 8, 12, 10, 10, 4, ! 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, ! 5, 0, 0, 5, 1, 2, 0, 0, 0, 5, ! 1, 1, 3, 3, 2, 2, 2, 2, 2, 1, ! 2, 0, 1, 0, 1, 1, 0, 1, 1, 3, ! 4, 7, 1, 3, 0, 1, 1, 1, 2, 2, ! 2, 1, 2, 2, 0, 3, 1, 1, 1, 2, ! 2, 2, 4, 2, 2, 2, 2, 2, 2, 1, ! 2, 1, 2, 1, 1, 0, 0, 1, 5, 3, ! 0, 3, 0, 0, 4, 2, 1, 1, 1, 3, ! 0, 3, 3, 3, 1, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, ! 3, 3, 3, 3, 4, 3, 3, 5, 5, 4, ! 3, 0 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned short yydefact[] = { ! 4, 0, 13, 13, 1, 6, 0, 5, 0, 314, ! 675, 676, 0, 421, 437, 616, 0, 12, 435, 0, ! 0, 11, 521, 894, 0, 0, 0, 179, 709, 17, ! 316, 315, 89, 0, 0, 875, 0, 48, 0, 0, ! 14, 28, 0, 30, 9, 53, 54, 0, 19, 16, ! 96, 119, 93, 0, 677, 183, 335, 312, 336, 651, ! 0, 410, 0, 409, 0, 425, 0, 450, 618, 467, ! 436, 0, 534, 536, 516, 544, 420, 640, 438, 641, ! 117, 334, 662, 638, 0, 678, 614, 0, 90, 0, ! 313, 86, 88, 87, 190, 0, 683, 190, 684, 190, ! 317, 179, 152, 153, 154, 156, 155, 507, 509, 0, ! 705, 0, 510, 0, 0, 0, 153, 154, 156, 155, ! 26, 0, 0, 0, 0, 0, 0, 0, 511, 687, ! 0, 693, 0, 0, 0, 40, 0, 0, 34, 0, ! 0, 50, 0, 0, 685, 0, 190, 314, 618, 0, ! 649, 644, 0, 0, 0, 648, 0, 0, 0, 0, ! 335, 0, 326, 0, 0, 0, 334, 614, 31, 0, ! 29, 4, 49, 0, 69, 421, 0, 0, 9, 72, ! 68, 71, 96, 0, 0, 0, 436, 97, 15, 0, ! 465, 0, 0, 483, 94, 84, 686, 622, 0, 0, ! 614, 85, 0, 0, 0, 115, 0, 446, 400, 631, ! 401, 637, 0, 614, 423, 422, 83, 118, 411, 0, ! 448, 424, 116, 0, 417, 443, 444, 412, 427, 429, ! 432, 445, 0, 80, 468, 522, 523, 524, 525, 543, ! 161, 160, 162, 527, 535, 184, 531, 526, 0, 0, ! 537, 538, 539, 540, 875, 0, 617, 426, 619, 0, ! 462, 314, 676, 0, 315, 707, 183, 668, 669, 665, ! 643, 679, 0, 314, 316, 664, 642, 663, 639, 0, ! 895, 895, 895, 895, 895, 895, 895, 0, 895, 895, ! 895, 895, 895, 895, 895, 895, 895, 895, 895, 895, ! 895, 895, 895, 895, 895, 895, 895, 895, 895, 0, ! 895, 895, 820, 425, 821, 890, 317, 616, 339, 342, ! 389, 433, 434, 0, 0, 0, 385, 383, 356, 387, ! 388, 0, 0, 0, 0, 0, 315, 308, 0, 0, ! 200, 199, 0, 0, 202, 201, 0, 203, 0, 0, ! 191, 192, 0, 258, 0, 286, 197, 338, 226, 0, ! 0, 340, 341, 0, 194, 407, 0, 0, 425, 408, ! 670, 368, 358, 0, 0, 882, 0, 0, 190, 0, ! 519, 505, 0, 0, 0, 706, 704, 284, 0, 204, ! 261, 205, 0, 0, 0, 472, 4, 24, 32, 701, ! 697, 698, 702, 700, 699, 152, 153, 154, 0, 156, ! 155, 689, 690, 694, 691, 688, 0, 314, 324, 325, ! 323, 667, 666, 36, 35, 52, 0, 169, 0, 0, ! 425, 167, 18, 0, 0, 190, 645, 619, 647, 0, ! 646, 153, 154, 310, 311, 330, 618, 0, 655, 329, ! 0, 654, 0, 337, 316, 315, 0, 0, 0, 328, ! 327, 659, 0, 0, 13, 0, 179, 10, 10, 75, ! 0, 70, 0, 0, 76, 79, 0, 464, 466, 133, ! 102, 808, 100, 391, 101, 136, 0, 0, 134, 95, ! 0, 851, 225, 0, 224, 846, 869, 0, 407, 425, ! 408, 0, 845, 847, 876, 858, 0, 0, 661, 0, ! 0, 883, 618, 0, 629, 624, 0, 628, 0, 0, ! 0, 0, 0, 614, 465, 0, 82, 0, 614, 636, ! 0, 414, 415, 0, 81, 465, 0, 0, 419, 418, ! 413, 430, 431, 452, 451, 190, 541, 542, 152, 155, ! 528, 532, 530, 0, 545, 512, 428, 465, 681, 614, ! 103, 0, 0, 0, 0, 682, 614, 109, 615, 0, ! 650, 676, 708, 183, 930, 0, 926, 0, 925, 923, ! 905, 911, 910, 895, 917, 916, 902, 903, 901, 920, ! 909, 907, 908, 906, 913, 912, 899, 900, 896, 897, ! 898, 922, 904, 915, 914, 895, 921, 918, 427, 614, ! 614, 0, 614, 0, 895, 190, 0, 248, 249, 0, ! 0, 0, 0, 0, 0, 309, 232, 229, 228, 230, ! 0, 0, 0, 0, 0, 338, 0, 931, 0, 227, ! 188, 189, 332, 0, 231, 0, 0, 259, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 349, ! 0, 351, 355, 354, 392, 0, 0, 393, 0, 0, ! 0, 237, 612, 0, 245, 390, 382, 0, 0, 875, ! 371, 374, 375, 0, 0, 402, 728, 724, 0, 0, ! 614, 614, 614, 404, 731, 0, 233, 0, 235, 0, ! 674, 406, 0, 0, 405, 370, 0, 0, 365, 384, ! 196, 366, 386, 671, 0, 367, 0, 0, 187, 187, ! 0, 177, 0, 425, 175, 520, 609, 606, 0, 519, ! 607, 519, 0, 285, 441, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 442, ! 478, 479, 480, 477, 0, 470, 473, 0, 4, 0, ! 692, 190, 695, 0, 44, 45, 0, 58, 0, 0, ! 0, 62, 66, 55, 874, 425, 58, 873, 64, 180, ! 165, 163, 180, 333, 187, 0, 653, 652, 337, 0, ! 656, 0, 21, 23, 96, 10, 10, 78, 77, 0, ! 138, 0, 931, 92, 91, 489, 0, 485, 484, 0, ! 623, 620, 850, 864, 853, 728, 724, 0, 865, 614, ! 868, 870, 0, 0, 866, 0, 867, 621, 849, 863, ! 852, 848, 877, 860, 871, 861, 854, 859, 660, 0, ! 674, 0, 658, 625, 619, 627, 626, 618, 0, 0, ! 0, 0, 0, 0, 614, 635, 0, 460, 459, 447, ! 634, 0, 883, 0, 630, 416, 449, 461, 439, 440, ! 465, 0, 529, 533, 675, 676, 875, 875, 677, 546, ! 547, 549, 875, 552, 551, 0, 0, 463, 883, 844, ! 190, 190, 680, 190, 883, 844, 614, 106, 614, 112, ! 895, 895, 919, 924, 890, 890, 890, 0, 929, 0, ! 0, 0, 0, 0, 0, 425, 0, 0, 0, 345, ! 0, 343, 344, 0, 0, 256, 193, 314, 675, 676, ! 316, 315, 0, 0, 490, 517, 0, 306, 307, 835, ! 834, 0, 304, 303, 301, 302, 300, 299, 298, 297, ! 296, 295, 294, 289, 290, 291, 292, 293, 288, 287, ! 0, 0, 0, 0, 0, 0, 0, 239, 253, 0, ! 0, 238, 614, 614, 0, 614, 611, 716, 0, 0, ! 0, 0, 0, 373, 0, 377, 0, 379, 0, 618, ! 727, 726, 719, 723, 722, 874, 0, 0, 741, 0, ! 0, 883, 403, 883, 729, 614, 844, 0, 0, 0, ! 728, 724, 0, 0, 614, 0, 618, 0, 0, 0, ! 0, 198, 0, 878, 182, 186, 318, 180, 173, 171, ! 180, 0, 508, 520, 605, 0, 223, 222, 221, 220, ! 282, 283, 0, 280, 279, 277, 278, 276, 275, 274, ! 272, 273, 271, 270, 269, 264, 265, 266, 267, 268, ! 263, 262, 472, 0, 0, 27, 0, 0, 696, 0, ! 41, 47, 46, 60, 57, 50, 58, 0, 51, 0, ! 0, 59, 527, 0, 170, 180, 180, 168, 181, 332, ! 331, 20, 22, 74, 96, 453, 809, 151, 157, 144, ! 159, 158, 0, 0, 140, 0, 0, 0, 0, 486, ! 0, 135, 618, 727, 723, 728, 724, 0, 618, 638, ! 0, 614, 729, 0, 728, 724, 0, 338, 0, 670, ! 0, 872, 0, 0, 885, 0, 0, 0, 0, 457, ! 633, 632, 456, 187, 554, 553, 875, 875, 875, 0, ! 580, 676, 0, 570, 0, 0, 0, 583, 0, 132, ! 127, 0, 183, 584, 587, 0, 0, 562, 0, 130, ! 574, 105, 0, 0, 0, 0, 111, 0, 883, 844, ! 883, 844, 928, 927, 892, 891, 893, 319, 357, 0, ! 363, 364, 0, 0, 0, 0, 344, 347, 752, 0, ! 0, 0, 0, 257, 0, 348, 350, 353, 251, 250, ! 241, 0, 240, 255, 0, 0, 713, 711, 0, 714, ! 0, 246, 0, 0, 190, 380, 0, 0, 0, 720, ! 619, 725, 721, 732, 614, 740, 738, 739, 0, 730, ! 883, 0, 736, 0, 234, 236, 672, 673, 728, 724, ! 0, 369, 881, 178, 180, 180, 176, 610, 608, 506, ! 0, 471, 469, 314, 0, 25, 33, 703, 61, 56, ! 63, 67, 65, 166, 164, 73, 816, 0, 142, 0, ! 146, 0, 148, 0, 150, 0, 98, 0, 487, 619, ! 727, 723, 728, 724, 0, 614, 643, 729, 0, 0, ! 673, 365, 366, 671, 367, 862, 856, 857, 855, 887, ! 886, 888, 0, 0, 0, 0, 619, 0, 0, 454, ! 185, 0, 556, 555, 550, 614, 844, 579, 0, 571, ! 584, 572, 465, 465, 568, 569, 566, 567, 614, 844, ! 314, 675, 0, 452, 128, 575, 585, 590, 591, 452, ! 452, 0, 0, 452, 126, 576, 588, 452, 0, 465, ! 0, 563, 564, 565, 465, 614, 321, 320, 322, 614, ! 108, 0, 114, 0, 0, 0, 0, 0, 0, 747, ! 0, 493, 0, 491, 260, 305, 0, 242, 243, 252, ! 254, 712, 710, 717, 715, 0, 247, 0, 0, 372, ! 376, 378, 883, 734, 614, 735, 174, 172, 281, 0, ! 474, 476, 817, 810, 814, 143, 141, 0, 0, 0, ! 747, 488, 727, 723, 0, 729, 344, 0, 884, 618, ! 458, 0, 548, 883, 0, 0, 573, 483, 483, 883, ! 0, 0, 0, 465, 465, 0, 465, 465, 0, 465, ! 0, 561, 513, 0, 483, 883, 883, 614, 614, 352, ! 0, 0, 0, 0, 0, 216, 753, 0, 748, 749, ! 492, 0, 0, 244, 718, 381, 320, 737, 883, 0, ! 0, 815, 145, 147, 149, 99, 728, 724, 0, 619, ! 0, 889, 455, 122, 614, 614, 844, 578, 582, 125, ! 614, 465, 465, 599, 483, 314, 675, 0, 586, 592, ! 593, 452, 452, 483, 483, 0, 483, 589, 502, 577, ! 104, 110, 883, 883, 359, 360, 361, 362, 481, 0, ! 0, 0, 743, 754, 761, 742, 0, 750, 494, 613, ! 733, 475, 0, 818, 618, 883, 883, 0, 883, 598, ! 595, 597, 0, 0, 465, 465, 465, 594, 596, 581, ! 0, 107, 113, 0, 751, 746, 219, 0, 217, 745, ! 744, 314, 675, 676, 755, 768, 771, 774, 779, 0, ! 0, 0, 0, 0, 0, 0, 0, 315, 803, 811, ! 0, 831, 807, 806, 805, 0, 763, 0, 0, 425, ! 767, 762, 804, 931, 0, 0, 931, 120, 123, 614, ! 124, 465, 465, 604, 483, 483, 504, 0, 503, 498, ! 482, 218, 824, 826, 827, 0, 0, 759, 0, 0, ! 0, 786, 788, 789, 790, 0, 0, 0, 0, 0, ! 0, 0, 825, 931, 399, 832, 0, 764, 397, 452, ! 0, 398, 0, 452, 0, 0, 765, 802, 801, 822, ! 823, 819, 883, 603, 601, 600, 602, 0, 0, 515, ! 208, 0, 756, 769, 758, 0, 931, 0, 0, 0, ! 782, 931, 791, 0, 800, 42, 156, 37, 156, 0, ! 38, 812, 0, 395, 396, 0, 0, 0, 394, 759, ! 121, 501, 500, 93, 96, 215, 0, 425, 0, 759, ! 759, 772, 0, 747, 829, 775, 0, 0, 0, 931, ! 787, 799, 43, 39, 816, 0, 766, 0, 499, 209, ! 452, 757, 770, 0, 760, 830, 0, 828, 780, 784, ! 783, 813, 836, 836, 0, 497, 495, 496, 465, 206, ! 0, 0, 212, 0, 211, 759, 931, 0, 0, 0, ! 837, 838, 0, 792, 0, 0, 773, 776, 781, 785, ! 0, 0, 0, 0, 0, 0, 836, 0, 213, 207, ! 0, 0, 0, 842, 0, 795, 839, 0, 0, 793, ! 0, 0, 840, 0, 0, 0, 0, 0, 0, 214, ! 777, 0, 843, 797, 798, 0, 794, 759, 0, 0, ! 778, 841, 796 }; + /* YYDEFGOTO[NTERM-NUM]. */ static const short yydefgoto[] = { ! -1, 1, 464, 3, 465, 173, 813, 348, 189, 5, ! 6, 40, 143, 778, 396, 41, 779, 1177, 1613, 43, ! 416, 1660, 783, 44, 45, 426, 46, 1178, 790, 1093, ! 791, 792, 793, 48, 180, 181, 49, 822, 192, 188, ! 482, 1440, 50, 51, 909, 1199, 915, 1201, 52, 1180, ! 1181, 193, 194, 823, 483, 1123, 1124, 736, 1125, 244, ! 53, 1106, 1105, 802, 799, 1275, 1274, 1050, 1047, 142, ! 1104, 54, 246, 55, 1044, 642, 349, 350, 351, 352, ! 634, 1771, 1692, 1773, 1726, 1810, 1486, 389, 1033, 353, ! 680, 991, 354, 390, 391, 356, 357, 378, 57, 268, ! 784, 445, 162, 58, 59, 358, 637, 359, 360, 361, ! 362, 824, 363, 1616, 543, 701, 364, 1183, 496, 227, ! 497, 365, 228, 366, 367, 64, 510, 229, 206, 219, ! 66, 524, 544, 1451, 877, 1338, 207, 220, 67, 557, ! 878, 68, 69, 774, 775, 776, 1549, 488, 954, 955, ! 1724, 1689, 1638, 1580, 70, 741, 380, 906, 1538, 1639, ! 1222, 737, 71, 72, 73, 74, 75, 255, 899, 900, ! 901, 902, 1185, 1380, 1186, 1187, 1188, 1365, 1375, 1366, ! 1528, 1367, 1368, 1529, 1530, 738, 739, 740, 681, 1021, ! 369, 200, 522, 515, 209, 77, 78, 79, 150, 151, ! 165, 81, 138, 370, 371, 372, 83, 393, 85, 904, ! 129, 130, 131, 563, 112, 86, 394, 996, 997, 1016, ! 1012, 704, 1551, 1552, 1487, 1488, 1489, 1553, 1399, 1554, ! 1620, 1645, 1729, 1695, 1696, 1555, 1621, 1719, 1646, 1730, ! 1647, 1753, 1648, 1756, 1800, 1827, 1649, 1775, 1739, 1776, ! 1701, 484, 820, 1296, 1622, 1663, 1744, 1433, 1434, 1500, ! 1626, 1728, 1563, 1623, 1735, 1666, 961, 1779, 1780, 1781, ! 1804, 501, 1017, 857, 1153, 1328, 503, 504, 505, 853, ! 506, 156, 855, 1190, 95, 727, 862, 1331, 1332, 614, ! 89, 574, 90, 944 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -1660 static const short yypact[] = { ! 137, 166, 193, -1660, -1660, -1660, 7189, -1660, 326, 126, ! 71, 248, 140, 174, -1660, -1660, 1737, -1660, -1660, 50, ! 163, -1660, -1660, -1660, 1235, 1558, 456, 222, -1660, -1660, ! 251, 224, -1660, 2573, 2573, -1660, 3176, -1660, 7189, 212, ! -1660, -1660, 256, -1660, 259, -1660, -1660, 3236, -1660, -1660, ! 238, 1085, 334, 314, 327, -1660, -1660, -1660, -1660, 479, ! 2942, -1660, 5058, -1660, 319, 2218, 604, -1660, 395, -1660, ! -1660, 1397, 700, 725, -1660, 369, 4966, -1660, -1660, -1660, ! 1304, -1660, -1660, -1660, 1457, -1660, -1660, 778, -1660, 10624, ! 368, -1660, -1660, -1660, 11764, 449, -1660, 11764, -1660, 11764, ! -1660, -1660, -1660, 71, 248, 469, 224, -1660, 410, 327, ! -1660, 1028, -1660, 922, 11856, 383, -1660, -1660, -1660, -1660, ! -1660, 614, 482, 480, 506, 488, 622, 494, -1660, -1660, ! 1855, -1660, 1697, 71, 248, -1660, 469, 224, -1660, 1266, ! 1069, 507, 13262, 526, -1660, 11764, 11764, 608, 4307, 4160, ! -1660, -1660, 3083, 1596, 4160, -1660, 1704, 4422, 4422, 3176, ! 495, 569, -1660, 479, 331, 611, 623, -1660, -1660, 696, ! -1660, 637, -1660, 6912, -1660, -1660, 222, 4645, 663, -1660, ! -1660, -1660, 238, 5357, 13308, 817, 673, -1660, -1660, 680, ! 395, 767, 124, 460, 731, -1660, -1660, -1660, 9165, 10718, ! -1660, -1660, 5388, 5388, 5171, 1304, 890, -1660, -1660, 499, ! -1660, -1660, 3496, -1660, -1660, -1660, -1660, -1660, 2218, 905, ! -1660, 395, 1304, 11856, -1660, -1660, -1660, 1372, 2218, -1660, ! 395, -1660, 5357, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, 733, 870, 327, -1660, 395, 1876, 1741, ! -1660, -1660, -1660, -1660, -1660, 757, -1660, 1924, 395, 922, ! -1660, 674, 519, 826, 676, -1660, 195, -1660, -1660, -1660, ! -1660, -1660, 7289, -1660, 469, -1660, -1660, -1660, -1660, 3523, ! -1660, 738, 760, -1660, -1660, -1660, -1660, 761, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, 745, ! -1660, -1660, -1660, 1924, 4966, 1851, -1660, 758, -1660, -1660, ! -1660, -1660, -1660, 12961, 12961, 766, -1660, -1660, -1660, -1660, ! -1660, 768, 791, 794, 866, 885, 1123, 12316, 2005, 12961, ! -1660, -1660, 12961, 12961, -1660, -1660, 9444, -1660, 12961, 444, ! 811, -1660, 12961, -1660, 12408, -1660, 6269, 202, 1387, 3984, ! 12500, -1660, 881, 3335, -1660, 2396, 13053, 13145, 6239, 5788, ! -1660, 246, -1660, 1469, 2729, 825, 444, 444, 11764, 13262, ! 975, -1660, 921, 2005, 676, -1660, -1660, 12593, 876, 942, ! -1660, 13337, 898, 2034, 2829, 1490, 637, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, 482, 480, 506, 2005, 488, ! 622, 908, 494, -1660, 956, -1660, 603, 921, 71, 248, ! -1660, -1660, -1660, -1660, -1660, -1660, 6427, -1660, 5357, 5178, ! 2263, -1660, -1660, 980, 444, 11764, -1660, 4307, -1660, 3604, ! -1660, 952, 954, -1660, -1660, -1660, 331, 4160, -1660, -1660, ! 4160, -1660, 928, -1660, -1660, -1660, 331, 331, 331, -1660, ! -1660, -1660, 7289, 91, 929, 943, -1660, -1660, -1660, -1660, ! 13262, -1660, 948, 988, -1660, -1660, 696, -1660, 395, -1660, ! -1660, -1660, -1660, 979, -1660, -1660, 10094, 12593, -1660, -1660, ! 951, -1660, 942, 955, 13337, 337, 1587, 13308, 1587, 3864, ! 8178, 957, -1660, 147, 7749, 1005, 1016, 758, -1660, 982, ! 551, 123, 5717, 7402, -1660, -1660, 7402, -1660, 7824, 7824, ! 5171, 6412, 994, -1660, 395, 5357, -1660, 10810, -1660, -1660, ! 8254, 1372, 2218, 5357, -1660, 395, 997, 1004, -1660, -1660, ! 1372, -1660, 395, 1070, -1660, 11764, -1660, -1660, 921, 676, ! 733, -1660, -1660, 1876, 1712, -1660, 1924, 395, -1660, -1660, ! -1660, 1044, 1046, 1071, 1054, -1660, -1660, -1660, -1660, 4307, ! -1660, 575, -1660, 595, -1660, 1023, -1660, 1056, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, 1924, -1660, ! -1660, 739, -1660, 936, -1660, 11764, 12593, -1660, -1660, 12593, ! 11856, 7097, 7097, 7097, 7097, 6269, -1660, -1660, -1660, -1660, ! 1057, 12685, 12685, 9444, 1062, 215, 1072, -1660, 1082, -1660, ! -1660, -1660, 1135, 11764, -1660, 9536, 9444, -1660, 12316, 12316, ! 10186, 12316, 12316, 12316, 12316, 12316, 12316, 12316, 12316, 12316, ! 12316, 12316, 12316, 12316, 12316, 12316, 12316, 12316, 12316, -1660, ! 12593, -1660, -1660, -1660, -1660, 12593, 12593, -1660, 12593, 11856, ! 3169, 660, 458, 10902, -1660, -1660, -1660, 1124, 826, 1181, ! 616, 624, 702, 3767, 936, -1660, 555, 555, 3505, 10994, ! 1101, 1161, -1660, -1660, 633, 9444, -1660, 9444, -1660, 11392, ! 810, -1660, 1010, 922, -1660, -1660, 12593, 826, -1660, -1660, ! 224, -1660, -1660, -1660, 586, 368, 12593, 1163, -1660, -1660, ! 444, -1660, 5357, 2904, -1660, -1660, 1165, -1660, 1118, 1170, ! -1660, 975, 908, 13408, -1660, 10370, 10462, 12593, 12593, 10186, ! 12593, 12593, 12593, 12593, 12593, 12593, 12593, 12593, 12593, 12593, ! 12593, 12593, 12593, 12593, 12593, 12593, 12593, 12593, 12593, -1660, ! -1660, -1660, -1660, -1660, 66, -1660, 1140, 1126, 637, 603, ! 1180, 11764, -1660, 1184, -1660, -1660, 1069, 1578, 1168, 1210, ! 316, 1183, 1193, -1660, -1660, 4050, 1397, -1660, 1194, -1660, ! -1660, -1660, -1660, -1660, -1660, 444, -1660, -1660, 1154, 1156, ! -1660, 1211, -1660, -1660, 238, -1660, -1660, -1660, -1660, 94, ! -1660, 529, -1660, -1660, -1660, -1660, 9349, 13408, -1660, 1166, ! -1660, -1660, -1660, -1660, -1660, 2121, 2121, 5913, -1660, -1660, ! -1660, -1660, 3496, 778, -1660, 11485, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, 1016, 1213, -1660, -1660, -1660, 11948, ! 1161, 707, -1660, -1660, 5717, -1660, -1660, 6412, 7402, 7402, ! 8285, 8285, 6412, 1010, -1660, -1660, 8254, -1660, 1215, -1660, ! -1660, 1173, 123, 5717, -1660, 1372, -1660, -1660, -1660, -1660, ! 395, 1221, 733, -1660, 480, 506, -1660, -1660, 494, 1225, ! -1660, -1660, 435, -1660, -1660, 2188, 3845, -1660, 123, 6851, ! 11764, 11764, -1660, 11764, 123, 6851, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, 1756, 1756, 1756, 1300, -1660, 444, ! 1178, 13363, 1189, 1192, 1229, 7051, 1233, 1236, 1238, -1660, ! 1202, -1660, -1660, 1212, 1259, -1660, -1660, 1256, 867, 895, ! 521, 150, 12593, 1274, -1660, 1269, 1234, 6269, 6269, -1660, ! -1660, 1280, 7901, 8079, 5502, 7091, 7924, 5323, 4968, 2757, ! 2757, 2176, 2176, 1078, 1078, 843, 843, 843, -1660, -1660, ! 1245, 1247, 1248, 1252, 1262, 1265, 7097, 660, -1660, 10094, ! 12593, -1660, -1660, -1660, 12593, -1660, -1660, 1251, 12961, 1271, ! 1270, 1302, 1333, -1660, 12593, -1660, 12593, -1660, 12593, 1818, ! 2158, -1660, -1660, 2158, -1660, 138, 1279, 1284, -1660, 1277, ! 7097, 123, -1660, 123, 2329, -1660, 6851, 11086, 1286, 1288, ! 11578, 11578, 8933, 1289, 12408, 1297, 2040, 3733, 2829, 1314, ! 1298, 1046, 1301, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, 12593, -1660, 2005, -1660, 1307, -1660, 13408, -1660, 13408, ! 13408, 13408, 1350, 7451, 7877, 4699, 3682, 7589, 8341, 4766, ! 3411, 3411, 3411, 2589, 2589, 1650, 1650, 1038, 1038, 1038, ! -1660, -1660, 1490, 1310, 12777, -1660, 1313, 1363, -1660, 444, ! -1660, -1660, -1660, -1660, -1660, -1660, 2858, 6427, -1660, 7097, ! 11764, -1660, 1145, 12316, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, 238, -1660, -1660, -1660, 482, -1660, ! 488, 622, 12593, 144, -1660, 709, 719, 787, 1366, -1660, ! 58, -1660, 2595, 2234, 2234, 2276, 2276, 5913, 2849, 221, ! 3496, -1660, 2472, 4192, 11671, 11671, 9053, 223, 1320, 312, ! 933, -1660, 10094, 9631, -1660, 4947, 1059, 1059, 1893, -1660, ! -1660, -1660, 1373, -1660, -1660, -1660, -1660, -1660, -1660, 2100, ! -1660, 751, 960, -1660, 12593, 7020, 6742, -1660, 6742, 260, ! 260, 421, 804, 3384, 8429, 85, 5285, -1660, 160, 260, ! -1660, -1660, 1324, 444, 444, 444, -1660, 1336, 123, 6851, ! 123, 6851, -1660, -1660, -1660, -1660, -1660, -1660, -1660, 7097, ! -1660, -1660, 1354, 1357, 1358, 1360, 1154, -1660, -1660, 8679, ! 10094, 9726, 1356, -1660, 12316, -1660, -1660, -1660, -1660, -1660, ! 797, 1359, -1660, -1660, 1374, 241, 788, 788, 1376, 788, ! 12593, -1660, 12961, 1477, 11764, -1660, 1377, 1380, 1386, -1660, ! 1818, -1660, -1660, -1660, -1660, -1660, -1660, -1660, 1818, -1660, ! 123, 1398, -1660, 1405, -1660, -1660, -1660, -1660, 2960, 2960, ! 7567, -1660, -1660, -1660, -1660, -1660, -1660, 13408, -1660, -1660, ! 12593, -1660, -1660, 204, 1410, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, 6269, -1660, -1660, -1660, 1389, 1412, -1660, 598, ! -1660, 12593, -1660, 12593, -1660, 12593, -1660, 9818, -1660, 2595, ! 2234, 2234, 3041, 3041, 8034, -1660, 335, 2472, 2595, 1413, ! 990, 457, 471, 625, 254, -1660, -1660, -1660, -1660, -1660, ! -1660, -1660, 308, 2082, 2082, 1241, 1241, 1241, 10094, -1660, ! -1660, 1712, -1660, -1660, -1660, -1660, 6851, 13408, 184, -1660, ! 1043, -1660, 395, 395, -1660, -1660, -1660, -1660, -1660, 6851, ! 576, 1025, 12593, 1070, -1660, 1470, -1660, -1660, -1660, 415, ! 431, 1457, 1596, 599, 260, 1471, -1660, 759, 1466, 395, ! 5652, -1660, -1660, -1660, 395, -1660, -1660, 1478, -1660, -1660, ! -1660, 1428, -1660, 1433, 1436, 12593, 12593, 12593, 12593, 87, ! 10094, -1660, 1482, -1660, -1660, 6269, 12593, -1660, 797, -1660, ! -1660, -1660, -1660, -1660, -1660, 1445, -1660, 1511, 444, -1660, ! -1660, -1660, 123, -1660, -1660, -1660, -1660, -1660, 13408, 12593, ! -1660, -1660, -1660, 1389, -1660, -1660, -1660, 1454, 1456, 1458, ! 87, -1660, 2348, 2348, 1010, 2514, 755, 4947, -1660, 1241, ! -1660, 10094, -1660, 123, 1459, 815, -1660, 1508, 1508, 123, ! 1465, 12593, 12593, 8653, 395, 5485, 395, 395, 4326, 395, ! 6033, -1660, -1660, 6186, 1508, 123, 123, -1660, -1660, -1660, ! 1474, 1484, 1486, 1493, 2005, -1660, -1660, 8606, 1542, -1660, ! -1660, 10094, 1492, -1660, -1660, -1660, -1660, -1660, 123, 1496, ! 1485, -1660, -1660, -1660, -1660, -1660, 2688, 2688, 4287, 1899, ! 1899, -1660, -1660, -1660, -1660, -1660, 6851, -1660, -1660, -1660, ! -1660, 8653, 8653, -1660, 1508, 618, 1079, 12593, -1660, -1660, ! -1660, 1070, 1070, 1508, 1508, 575, 1508, -1660, -1660, -1660, ! -1660, -1660, 123, 123, -1660, -1660, -1660, -1660, -1660, 1083, ! 310, 6536, -1660, -1660, -1660, -1660, 11197, -1660, -1660, -1660, ! -1660, -1660, 7322, -1660, 1899, 123, 123, 1500, 123, -1660, ! -1660, -1660, 12593, 12593, 8653, 395, 395, -1660, -1660, -1660, ! 8780, -1660, -1660, 2005, -1660, -1660, -1660, 370, -1660, -1660, ! -1660, 1546, 1114, 1121, -1660, -1660, -1660, -1660, -1660, 12593, ! 1547, 1553, 1557, 12040, 406, 2005, 701, 852, -1660, -1660, ! 12132, 1612, -1660, -1660, -1660, 1559, -1660, 6598, 13216, 5592, ! 1606, -1660, -1660, 1515, 1517, 1519, -1660, -1660, -1660, -1660, ! -1660, 8653, 8653, -1660, 1508, 1508, -1660, 10554, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, 828, 828, 1571, 1548, 1554, ! 4801, -1660, -1660, -1660, -1660, 1577, 12593, 1586, 1591, 1602, ! 2195, 2295, -1660, -1660, -1660, -1660, 1567, -1660, -1660, 1070, ! 1125, -1660, 1146, 1070, 12224, 1150, -1660, -1660, -1660, -1660, ! -1660, -1660, 123, -1660, -1660, -1660, -1660, 1555, 8840, 1564, ! -1660, 11856, -1660, -1660, -1660, 1645, -1660, 9257, 11856, 12593, ! -1660, -1660, -1660, 1608, -1660, -1660, 1616, -1660, 1602, 2195, ! -1660, -1660, 696, -1660, -1660, 12869, 12869, 9910, -1660, 1571, ! -1660, -1660, -1660, 334, 238, -1660, 1563, 441, 5357, 1571, ! 1571, -1660, 11296, 87, -1660, -1660, 1611, 1570, 13386, -1660, ! -1660, -1660, -1660, -1660, 1389, 121, -1660, 189, -1660, -1660, ! 1070, -1660, -1660, 850, -1660, -1660, 10002, -1660, -1660, -1660, ! -1660, 1389, 89, 89, 1620, -1660, -1660, -1660, 395, -1660, ! 12593, 1623, -1660, 1624, -1660, 1571, -1660, 1598, 2005, 836, ! 1628, -1660, 359, -1660, 1630, 1589, -1660, -1660, -1660, -1660, ! 12593, 1584, 696, 1643, 89, 696, 89, 1655, -1660, -1660, ! 10278, 1603, 1710, 881, 433, -1660, -1660, 436, 846, -1660, ! 10094, 1614, -1660, 1631, 696, 1663, 1665, 696, 1667, -1660, ! -1660, 12593, 881, -1660, -1660, 437, -1660, 1571, 1633, 1668, ! -1660, -1660, -1660 }; + /* YYPGOTO[NTERM-NUM]. */ static const short yypgoto[] = { ! -1660, -1660, 1750, -1660, -332, 1574, -418, 42, -5, 1755, ! -1660, 1721, -1660, -1660, -1660, -1454, -1660, 502, -1660, -1446, ! -1660, 105, 996, 69, -383, -1660, -1660, 116, -1660, -728, ! -1660, -1660, 672, 68, 1601, 1309, 1607, -1660, 63, -180, ! -802, -1660, 2, 99, -1660, -1660, -1660, -1660, -1660, 606, ! -1660, -1660, -1660, -1660, -1660, -1660, 489, -16, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, 1691, ! -705, 7781, -181, -18, -695, 874, -70, 1659, -607, -1660, ! 129, -1660, 159, -1660, -1543, -1660, -1371, 37, 1167, -329, ! -1660, -957, 7269, 4278, 6794, 1368, 4996, 1491, -348, -64, ! -83, 832, -136, -78, 117, -1660, -1660, -1660, -342, -1660, ! -164, -1660, -1660, -1487, 59, -351, 4914, 52, 15, -146, ! 41, 57, -206, -1660, -1660, -1660, -3, -144, -174, -171, ! 14, -40, -360, -1660, -405, -1660, -1660, -1660, -1660, -1660, ! 478, 1352, 3134, -1660, 724, -1660, -1660, -1195, -482, 991, ! -1660, -1660, -1660, -1660, 40, -1660, -1660, -1660, -1660, -1660, ! -1660, 1080, -384, -1660, -1660, -1660, -1660, -1660, -1660, 477, ! 652, -1660, -1660, -1660, 445, -1078, -1660, -1660, -1660, -1660, ! -1660, -1660, 640, -1660, 358, 1095, -1660, 795, 1160, 4547, ! 79, 1632, 3105, 2092, -1660, -530, -1660, 54, 1689, 2935, ! -138, 296, -62, 5584, 1481, -1660, 6552, 2280, 2635, -15, ! -110, -1660, 1717, -49, -1660, 6005, 3655, -160, -1660, 3453, ! 1621, -1660, -1660, 302, -1660, -1660, 366, 1232, -1660, -1491, ! -1660, -1660, -1660, -1522, -1660, -1474, 134, -1660, -1660, -1660, ! -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, -1660, ! -1660, 128, -1660, -1660, -1660, -1660, -1660, 142, -1392, -1660, ! -1660, -58, -1660, -1660, -1660, -1660, -742, -1632, -1660, 95, ! -1659, -855, -175, 1019, -1660, -1660, -1660, -1660, -412, -1660, ! -411, -209, -1660, 112, -1660, -1660, -843, 443, -1660, 75, ! -1660, 6101, -125, -806 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -932 static const short yytable[] = { ! 108, 39, 471, 65, 828, 463, 269, 1062, 121, 472, ! 128, 190, 532, 473, 797, 798, 1128, 710, 1116, 448, ! 451, 61, 415, 502, 903, 647, 721, 376, 460, 377, ! 1232, 315, 722, 39, 1045, 65, 946, 706, 708, 1161, ! 260, 1501, 796, 789, 65, 554, 721, 62, 38, 182, ! 814, 556, 722, 61, 1192, 243, 422, 423, 60, 218, ! 1197, 185, 61, 63, 777, 1191, 266, 551, 1101, 1505, ! 110, 1196, 531, 257, 269, 421, 434, 1590, 424, 62, ! 38, 414, 540, 539, 541, 76, 313, 186, 184, 177, ! 60, 368, 797, 854, 368, 63, 368, 1107, 1349, 183, ! 1351, 1777, 1612, 685, 63, 231, 685, 608, 1381, 1108, ! 1614, 368, 149, 154, 411, 179, 178, 76, 88, 205, ! 1307, 1484, 47, 1664, 1378, 480, 76, 96, 1082, -880, ! 887, 1782, 568, 685, 269, 1681, 1807, -2, 564, 430, ! 443, 276, 368, 368, 114, 1298, 312, 97, 710, 1678, ! 88, 832, 907, 163, 47, 1737, 1694, 61, 1825, 860, ! 848, 217, 608, 47, 1808, 879, 4, 385, 314, 1308, ! 65, 1261, 1711, 886, 65, 468, 1083, 1762, 1256, 182, ! 1257, 218, 535, 429, 1778, -138, 1763, 861, 61, -138, ! 1765, 185, 61, -3, 428, 499, 1379, 1746, 1485, 63, ! 833, 811, 94, 834, 1115, -137, 1299, 1751, 1752, 849, ! 1734, 432, 850, 1774, 62, -155, 100, 186, 184, 177, ! 368, 76, 481, 1382, 101, 60, 146, 1740, 1694, 183, ! 63, 1764, 550, 552, 63, 492, 447, 450, 1694, 1694, ! 98, 427, 205, 388, 566, 179, 178, 562, 945, 725, ! -138, 669, 76, 1788, -138, 498, 76, 115, 231, 47, ! 99, 573, 1517, 1518, 669, 1760, 1429, 231, 231, 725, ! -637, 1383, -335, 1407, 163, 163, 163, 500, 1612, 1539, ! 691, 513, 516, 217, 1694, 88, 1614, 481, 17, 567, ! 695, 1126, -452, 47, 1455, 715, 670, 231, 141, 690, ! 146, 682, 1789, -313, 98, 1830, 169, 144, 730, 670, ! 460, 257, 819, 276, 1430, -637, -637, -335, -335, 170, ! 171, 163, 626, -452, 99, -328, -452, 145, 509, 1571, ! 316, -637, 166, -328, 273, 859, 1694, 12, 1577, 1578, ! 716, 1579, 1273, 368, 1391, 1276, 1393, 187, -313, -313, ! 832, 1410, 536, 231, 785, 1390, 313, 1392, 172, 780, ! 191, -662, 1755, 20, -313, 805, 257, 742, 1288, 1501, ! 1447, -452, 893, 1585, 23, 368, 733, 195, 1097, 773, ! 448, 451, 722, 196, -636, 460, 885, 539, 541, 91, ! 454, 455, 742, 1098, 61, 1381, 539, 1113, 1114, 833, ! 1293, 1294, 834, -874, 456, 1096, -662, -662, 231, 102, ! 116, 117, 541, 223, 457, 1795, 312, 1423, 1448, 35, ! 429, 1586, -662, 795, 1796, 458, 218, 20, 276, -636, ! -636, 732, 368, 1585, 254, 92, 63, 93, 314, 1685, ! 1686, -400, 1167, 17, 316, -636, 1086, 1354, 276, 225, ! 226, 1493, 375, 166, 166, 166, 16, -401, 76, 17, ! 133, 134, 133, 134, 541, 118, 119, 65, 1340, 1797, ! 231, 381, 816, 20, 1168, 891, -400, 395, 731, 22, ! -400, 1641, 1355, 498, 185, 61, 1356, 800, 25, 1656, ! 695, 1454, -401, 1291, 218, 1814, -401, 257, 1814, 1814, ! 166, 795, 135, 890, 1460, 500, -314, 1233, 42, 485, ! 186, 184, 28, -400, 28, 136, 137, 136, 137, 1357, ! -312, 640, 183, 641, 492, 144, 486, 63, 197, -401, ! 1117, 992, 1118, 894, 895, 859, 400, 892, 399, 231, ! 42, 993, 368, 1815, 402, 929, 1816, 1829, 197, 76, ! 404, -314, -314, 994, 487, 838, 97, 844, 846, 133, ! 134, 498, 401, 564, 15, -312, -312, -314, 559, 1426, ! 1427, 231, 231, 198, 199, 98, 176, 144, 1119, 1497, ! 231, -312, 99, 500, 425, 28, -156, 20, 1120, 1121, ! -139, -139, 564, 198, 527, 99, 231, 868, 869, 1117, ! 695, 1118, 894, 895, 695, -328, 273, 418, 419, 12, ! 1513, 28, 368, 560, 136, 137, 1519, 368, 935, 935, ! 935, 935, 682, 1122, 916, -131, 326, 17, 696, 953, ! 368, 98, 1540, 1541, 1112, 163, 163, 163, 697, 903, ! 368, 1461, 28, 368, 918, 859, 23, 1119, 231, 698, ! 699, 99, 435, 492, 28, 1560, 881, 1120, 1121, 28, ! -131, 1567, 274, 31, -131, 1003, 232, 233, 477, 917, ! 1325, 1327, 1001, 1005, -663, 397, 368, 313, 403, 453, ! 398, 1556, 1025, 1572, 435, 797, 798, 1164, 1165, 919, ! 721, 35, 1122, 1169, 435, 795, 722, -131, 146, 1581, ! 1582, 1041, 368, 1091, 368, 647, 499, 492, 320, 988, ! 1004, 1089, 492, 796, 789, 492, 492, 785, 1006, -663, ! -663, 461, 1627, 1628, 1092, 1630, 989, 1026, 1027, 608, ! 558, 460, 565, -657, 502, -663, 475, 312, 1401, 1403, ! 502, 539, 382, 133, 134, 1556, 492, 135, -8, 932, ! 435, 1007, 146, 492, 990, 498, 1154, 28, 1300, 314, ! 1659, 250, 172, 492, 269, 251, 498, 276, 1302, 1126, ! 479, 1094, 128, 231, 476, 1010, 1013, 500, 368, 960, ! 1102, 273, 10, 11, 12, -129, 252, 17, 500, 383, ! 253, 1048, 133, 134, 489, 415, 1008, 568, 136, 384, ! 1345, 1155, 1322, 1301, -337, 982, 1127, 98, 722, 545, ! 953, 903, 999, 1303, 166, 166, 166, 1556, 555, -614, ! -129, 23, 265, -614, -129, 1403, 583, 99, 1019, 102, ! 116, 117, 561, 575, 795, 231, 1304, 274, 31, 1720, ! 1193, 1194, 499, 1195, 28, 1346, 988, 136, 137, -337, ! -337, 502, 616, 1358, 846, 577, 1450, -129, 605, 1022, ! 619, 992, 620, 989, 1515, -331, 35, 621, 161, 23, ! 622, 993, -614, 643, -614, -614, -614, 1690, 960, 232, ! 474, 1305, 492, 994, 860, 118, 119, -614, 1182, -614, ! 1732, 990, 1406, 685, 498, 1556, 492, 276, 1359, 1769, ! 460, 1792, 498, 65, -614, -614, 795, 368, 368, 1516, ! 368, 1817, 795, 725, 1133, 1134, 500, 1662, 1490, 726, ! -614, 61, 1691, 96, 500, 231, 10, 11, 146, 667, ! 668, 546, -153, 1556, 1295, 547, 1321, 10, 11, 12, ! 133, 134, 623, 97, 1770, 1766, 1793, 1184, 1176, 1156, ! 1157, 98, 525, 526, 163, 1736, 1818, 1341, 1342, 1343, ! -154, 624, 163, 63, 133, 134, 498, 533, 534, 1512, ! 1556, 99, 498, 326, 719, 231, 23, 558, 102, 116, ! 117, 136, 137, 935, 781, 76, 744, 1235, 500, 28, ! 449, 452, 274, 31, 500, 136, 137, 448, 451, 1204, ! 1205, 1206, 460, -337, 745, 1179, 448, 451, 769, 1558, ! 525, 817, 782, 382, 10, 11, 28, 935, -337, 136, ! 137, 35, -337, 795, 502, 1324, 502, 492, 97, 499, ! 99, 382, 10, 11, 118, 119, 161, 735, 808, -337, ! -7, 492, 643, 492, 821, 492, 1360, 1361, 11, 12, ! 533, 818, -337, -337, 812, -337, -337, 640, 1811, 641, ! 383, 830, 269, 10, 11, 831, 773, 847, 256, 136, ! 384, -873, 273, 418, 419, 12, 1411, 1412, 383, 1414, ! 1094, 96, 856, 498, -337, -337, 23, 136, 384, 498, ! 1462, 20, 276, 265, 795, 858, 935, 368, 17, 28, ! -337, 97, 30, 31, 875, 500, 1456, 888, 1362, 1010, ! 1013, 500, 23, 17, 889, 28, 202, -452, 136, 137, ! 910, 492, 911, 1238, 767, 768, 203, 912, 274, 31, ! 913, 35, 1333, 166, 795, 96, 920, 204, -879, 1352, ! 1353, 166, 1334, 499, 1573, 1583, 1584, -452, -452, 1384, ! 797, 1625, 935, 1335, 498, 97, 1263, 35, 1182, 492, ! 1182, 664, 665, 666, 667, 668, 1182, 939, 1182, 921, ! 96, 502, 941, 65, 1418, 65, 500, 98, 636, 1643, ! 1000, 218, 942, 65, 502, -195, 1644, 525, 1713, 1002, ! 97, 61, 945, 61, 498, 1020, 795, 99, 795, 146, ! -195, 61, -195, 498, 276, 1402, 935, -57, 533, 1714, ! 1022, -57, 525, 1718, 1310, 1311, 500, 1184, 1176, 1184, ! 1176, 545, -57, 1310, 1311, 500, 1043, 1184, 1176, 1052, ! 1350, 1051, 1053, 63, 1084, 63, 1088, 1085, 102, 116, ! 117, 368, 1364, 63, 1095, 10, 11, 1090, 22, 1099, ! 728, 729, 163, 163, 163, 76, 498, 76, 498, 1100, ! 1103, 163, 163, 163, -331, 76, 1110, 795, 860, 417, ! 418, 419, 12, 20, 1111, 1179, 1131, 1179, 500, 1152, ! 500, 1159, 1363, 1373, 1127, 1179, 1160, 1166, 1208, 449, ! 809, 1402, 163, 269, 118, 119, 120, 28, 1163, 1210, ! 136, 137, 1211, 382, 133, 134, 1212, 803, 804, 23, ! 1213, 795, 1216, 1214, 1333, 1215, 263, 382, 10, 11, ! 1218, -152, 1217, 1464, 1334, 274, 264, 498, 1819, 1466, ! 1467, 1221, 17, 1464, 1469, 1335, -452, 1467, 492, 1220, ! 492, 502, 492, 795, 1223, 1224, 1240, 1010, 1013, 500, ! 383, 449, 452, 266, 35, 1225, 795, 1226, 1243, 136, ! 384, 1227, 1182, 1228, 383, 493, -452, -452, 1162, 1415, ! -452, 498, 1229, 136, 384, 1230, 860, 65, 1244, 538, ! 225, 226, 1245, 572, 1242, 148, 148, 16, 164, 1253, ! 1255, 1442, 1443, 500, 1254, 61, 1264, 572, 1265, 1266, ! 102, 103, 104, 498, 235, 236, 237, 1267, 1271, 1364, ! 22, 1272, 1156, 1157, 221, 1280, 498, 230, 1279, 25, ! 1282, 1184, 1176, 247, 1285, 500, 1286, 1306, 258, 20, ! 1320, 166, 166, 166, 1385, 238, 671, 63, 500, 1339, ! 166, 166, 166, 1670, 935, 1675, 1389, 1672, 1395, 1363, ! 573, 1396, 1397, 28, 1398, 1182, 105, 106, 239, 76, ! 261, 10, 262, 12, 449, 940, 492, 1404, 1548, 1408, ! 65, 166, 417, 10, 11, 12, 672, 673, 636, 1179, ! 674, 675, 676, 677, 1409, 1417, 1432, 1419, 61, 1413, ! 1420, 1575, 1576, 102, 116, 117, 1421, 770, 771, 772, ! 23, 437, 240, 241, 242, 795, 437, 263, 1424, 446, ! 446, 164, 23, 795, 1184, 1176, 30, 264, 1425, 717, ! 1431, 608, 1435, 1446, 1480, 1481, 1482, 1483, 274, 264, ! 63, 1471, 1465, 1470, -703, 1492, 221, 636, 1477, 636, ! 265, 1035, 478, 1478, 1748, 35, 1479, 1491, 1745, 118, ! 119, 1611, 76, 1619, 512, 512, 521, 35, 1494, 795, ! 1495, 122, 123, 124, 1502, 498, 1503, 1640, 1504, 1514, ! 230, 61, 1179, 498, 486, 1520, 1484, 448, 451, 1562, ! 542, 405, 406, 407, 1544, 1442, 1443, 500, 1657, 1658, ! 147, 10, 11, 12, 1545, 500, 1546, 1618, 1610, 273, ! 133, 134, 12, 1547, 1046, 1559, 1561, 1619, 1617, 230, ! 1629, 1642, 1651, 63, 28, 218, 1652, 125, 126, 498, ! 1653, 1665, 1667, 1676, 569, 61, 1677, 1679, 1803, 1680, ! 23, 1803, -931, 535, 28, 76, 695, 409, 410, 23, ! 1702, 500, 1697, 28, 1707, 1710, 30, 31, 1698, 1704, ! 1822, 1618, 1610, 1803, 829, 274, 31, 398, 1705, 231, ! 835, 1712, 1617, 1731, 1721, 230, 258, 63, 1723, 161, ! 836, 1741, 1742, 1749, 1757, 35, 1669, 1148, 1669, 1109, ! 1758, 837, 699, 1783, 35, 1615, 1786, 1787, 1727, 76, ! 1794, 1035, 1790, 1743, 1619, 1727, 1798, 1802, 446, 1799, ! 122, 123, 124, 449, 809, 625, 1805, 102, 441, 442, ! 1768, 492, 61, 1812, 368, 122, 894, 895, 1809, 896, ! 230, 258, 1813, 155, 1820, 1821, 1823, 1611, 1824, 1619, ! 1826, 1832, 1655, 764, 765, 766, 767, 768, 1618, 1610, ! 102, 103, 104, 1831, 102, 103, 104, 61, 312, 1617, ! 2, 897, 470, 1727, 63, 312, 125, 126, 7, 168, ! 133, 134, 1791, 118, 106, 568, 1709, 231, 28, 1289, ! 314, 125, 126, 1618, 1610, 1087, 76, 314, 469, 815, ! 467, 221, 230, 930, 1617, 1703, 1747, 1750, 1436, 63, ! 1374, 163, 379, 28, 868, 869, 105, 106, 107, 437, ! 105, 106, 437, 1207, 433, 1693, 1281, 615, 164, 164, ! 164, 76, 28, 312, 569, 136, 137, 1130, 1452, 1054, ! 1725, 1344, 133, 134, 1376, 1473, 960, 1725, 1537, 609, ! 1457, 1458, 163, 163, 163, 314, 1055, 980, 438, 610, ! 987, 528, 981, 440, 692, 983, 984, 413, 1278, 221, ! 20, 230, 258, 1589, 1557, 133, 134, 1472, 405, 406, ! 407, 1615, 1474, 449, 940, 864, 1754, 695, 864, 943, ! 867, 867, 521, 1151, 28, 1767, 478, 136, 137, 548, ! 103, 104, 883, 1040, 542, 1725, 1761, 478, 0, 1806, ! 1511, 696, 155, 1042, 0, 0, 0, 10, 11, 1785, ! 0, 697, 568, 10, 11, 408, 0, 28, 542, 478, ! 136, 137, 698, 699, 409, 410, 0, 0, 0, 1801, ! 0, 0, 0, 0, 609, 20, 383, 0, 0, 960, ! 0, 20, 225, 226, 610, 105, 549, 0, 0, 16, ! 0, 1523, 1524, 0, 1533, 1534, 0, 1536, 695, 28, ! 1828, 0, 136, 137, 0, 28, 20, 0, 136, 137, ! 542, 570, 22, 1287, 0, 0, 1333, 0, 449, 452, ! 166, 25, 1506, 0, 0, 0, 1334, 449, 1319, 0, ! 0, 0, 1507, 164, 164, 446, 703, 1335, 0, 711, ! 714, 0, 0, 1508, 699, 0, 0, 0, 446, 1569, ! 1570, 0, 0, 0, 0, 0, 0, 161, 102, 116, ! 117, 166, 166, 166, 0, 0, 957, 958, 0, 962, ! 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, ! 973, 974, 975, 976, 977, 978, 979, 417, 10, 11, ! 12, 0, 0, 273, 133, 134, 12, 0, 1009, 1009, ! 1009, 0, 1633, 1634, 1635, 0, 0, 446, 0, 446, ! 0, 1036, 0, 0, 118, 119, 0, 1386, 1387, 1388, ! 0, 0, 20, 0, 0, 0, 0, 23, 0, 0, ! 0, 0, 0, 23, 263, 230, 10, 11, 0, 695, ! 0, 15, 0, 274, 264, 0, 28, 0, 0, 274, ! 31, 449, 809, 122, 894, 895, 0, 0, 0, 1683, ! 1684, 0, 0, 1268, 20, 0, 0, 840, 0, 703, ! 711, 714, 35, 1269, 147, 10, 11, 12, 35, 0, ! 15, 0, 0, 0, 1270, 699, 806, 0, 28, 807, ! 0, 136, 137, 0, 0, 449, 809, 230, 247, 0, ! 0, 810, 208, 20, 0, 1333, 28, 1234, 0, 125, ! 126, 0, 133, 134, 23, 1334, 0, 256, 0, 0, ! 695, 1246, 0, 1247, 0, 1248, 1335, 28, 0, 0, ! 30, 31, 0, 0, 0, 0, 0, 1132, 1132, 1138, ! 20, 122, 894, 895, 835, 0, 0, 1138, 102, 116, ! 117, 0, 438, 0, 836, 440, 0, 695, 0, 35, ! 0, 164, 0, 0, 28, 837, 699, 136, 137, 570, ! 864, 864, 867, 867, 521, 224, 225, 226, 883, 0, ! 0, 696, 0, 16, 0, 0, 0, 147, 10, 11, ! 12, 697, 478, 256, 0, 0, 1784, 125, 126, 0, ! 20, 1284, 698, 699, 1706, 119, 22, 662, 663, 664, ! 665, 666, 667, 668, 0, 25, 20, 0, 0, 0, ! 224, 225, 226, 0, 0, 208, 0, 23, 16, 147, ! 10, 11, 12, 695, 0, 15, 84, 230, 0, 1297, ! 28, 0, 1496, 30, 31, 20, 111, 0, 102, 116, ! 117, 22, 0, 0, 0, 0, 139, 835, 20, 0, ! 25, 0, 0, 152, 152, 0, 152, 836, 84, 23, ! 0, 0, 35, 0, 208, 695, 801, 84, 837, 699, ! 0, 0, 28, 133, 134, 30, 31, 0, 568, 0, ! 212, 0, 84, 0, 0, 0, 0, 0, 0, 1135, ! 0, 248, 10, 11, 1708, 119, 111, 256, 0, 1136, ! 0, 20, 1250, 0, 35, 1250, 0, 279, 0, 111, ! 1137, 699, 0, 0, 373, 0, 1258, 373, 695, 373, ! 20, 0, 1036, 1036, 1036, 28, 0, 0, 136, 137, ! 0, 0, 0, 111, 0, 0, 0, 695, 0, 0, ! 133, 134, 696, 0, 28, 0, 0, 136, 137, 0, ! 0, 0, 697, 0, 0, 0, 711, 0, 0, 0, ! 139, 1506, 84, 698, 699, 373, 373, 0, 152, 152, ! 0, 1507, 0, 439, 152, 0, 0, 152, 152, 152, ! 0, 0, 1508, 699, 0, 695, 0, 0, 247, 0, ! 0, 0, 28, 84, 0, 136, 137, 84, 0, 0, ! 0, 0, 0, 212, 84, 0, 0, 0, 1437, 696, ! 1438, 1292, 1439, 0, 0, 147, 10, 11, 12, 697, ! 0, 568, 212, 212, 212, 1309, 1309, 1138, 1138, 1138, ! 698, 699, 0, 0, 1318, 0, 1138, 1138, 1138, 0, ! 0, 0, 0, 0, 20, 0, 1148, 0, 1336, 1336, ! 1337, 0, 212, 0, 0, 23, 0, 0, 10, 11, ! 208, 695, 0, 568, 0, 155, 0, 164, 28, 553, ! 0, 30, 31, 0, 0, 0, 221, 0, 0, 111, ! 0, 0, 0, 0, 0, 835, 20, 0, 449, 1319, ! 0, 0, 152, 0, 0, 836, 711, 806, 807, 0, ! 35, 0, 0, 695, 0, 810, 837, 699, 0, 0, ! 28, 0, 0, 136, 137, 0, 147, 133, 134, 12, ! 0, 0, 15, 0, 0, 0, 0, 1506, 208, 0, ! 208, 208, 1405, 0, 111, 611, 1499, 1507, 147, 10, ! 11, 12, 0, 0, 863, 20, 0, 0, 1508, 699, ! 0, 0, 0, 863, 0, 0, 23, 208, 0, 0, ! 1036, 1036, 1036, 0, 0, 208, 0, 20, 0, 28, ! 1249, 0, 30, 31, 0, 0, 0, 0, 23, 111, ! 0, 0, 0, 693, 695, 611, 33, 0, 611, 712, ! 0, 28, 0, 0, 30, 31, 34, 1249, 373, 84, ! 0, 35, 1309, 1309, 1138, 1138, 1138, 36, 835, 1318, ! 762, 763, 764, 765, 766, 767, 768, 0, 836, 0, ! 0, 0, 0, 35, 0, 1449, 1449, 1337, 0, 837, ! 699, 0, 10, 11, 0, 0, 139, 15, 0, 0, ! 0, 0, 0, 0, 478, 478, 111, 0, 212, 111, ! 0, 0, 0, 0, 0, 373, 0, 152, 0, 271, ! 20, 0, 0, 0, 0, 0, 0, 152, 0, 0, ! 152, 478, 718, 10, 11, 12, 478, 695, 0, 0, ! 0, 0, 152, 0, 28, 0, 271, 136, 137, 0, ! 84, 0, 0, 1249, 0, 0, 0, 0, 0, 1249, ! 0, 1506, 0, 0, 0, 0, 0, 0, 0, 326, ! 719, 1507, 23, 0, 271, 0, 212, 842, 212, 212, ! 712, 0, 1508, 699, 842, 28, 0, 271, 136, 720, ! 0, 0, 212, 212, 1509, 1509, 212, 1510, 212, 212, ! 212, 873, 0, 0, 0, 212, 0, 0, 0, 0, ! 212, 0, 0, 212, 0, 478, 478, 0, 478, 478, ! 0, 478, 438, 440, 208, 373, 0, 0, 0, 0, ! 0, 570, 718, 10, 11, 12, 660, 661, 662, 663, ! 664, 665, 666, 667, 668, 0, 0, 271, 0, 152, ! 0, 0, 273, 10, 11, 12, 0, 0, 1564, 1564, ! 1564, 102, 116, 117, 0, 235, 236, 237, 0, 326, ! 719, 1249, 23, 478, 478, 0, 0, 0, 0, 1249, ! 0, 20, 0, 271, 0, 28, 0, 208, 136, 137, ! 20, 0, 23, 927, 0, 373, 238, 0, 695, 0, ! 0, 111, 111, 111, 111, 28, 0, 0, 274, 31, ! 0, 224, 225, 226, 271, 0, 0, 118, 119, 16, ! 0, 0, 1312, 373, 0, 0, 478, 478, 478, 0, ! 1249, 0, 1313, 0, 0, 0, 20, 35, 0, 1249, ! 0, 80, 22, 1314, 699, 147, 10, 11, 12, 0, ! 0, 25, 0, 0, 0, 0, 863, 0, 0, 863, ! 111, 0, 611, 273, 133, 134, 12, 1049, 0, 15, ! 221, 230, 0, 80, 693, 863, 611, 611, 712, 0, ! 0, 0, 80, 478, 478, 23, 0, 0, 0, 1037, ! 0, 0, 20, 1039, 0, 210, 0, 222, 28, 806, ! 807, 30, 31, 23, 0, 201, 810, 0, 271, 695, ! 0, 0, 212, 0, 0, 202, 28, 0, 0, 274, ! 31, 0, 0, 0, 0, 203, 521, 0, 271, 0, ! 35, 0, 0, 1268, 0, 0, 204, 0, 0, 0, ! 0, 0, 0, 1269, 273, 10, 11, 12, 35, 0, ! 15, 0, 0, 0, 1270, 699, 0, 0, 0, 139, ! 0, 373, 0, 0, 0, 0, 139, 867, 867, 867, ! 0, 0, 0, 20, 271, 212, 248, 431, 0, 230, ! 0, 0, 0, 436, 23, 0, 261, 133, 134, 12, ! 695, 0, 0, 0, 0, 0, 0, 28, 0, 0, ! 274, 31, 0, 0, 0, 0, 0, 0, 80, 0, ! 0, 0, 80, 0, 1312, 212, 212, 1140, 210, 222, ! 478, 0, 0, 1143, 1313, 1140, 23, 0, 0, 35, ! 1249, 1249, 0, 263, 0, 1314, 699, 0, 0, 0, ! 0, 0, 30, 264, 212, 0, 0, 873, 212, 212, ! 873, 873, 873, 0, 0, 0, 212, 0, 0, 0, ! 0, 0, 0, 212, 0, 0, 265, 210, 0, 0, ! 0, 35, 0, 10, 11, 0, 0, 14, 15, 147, ! 133, 134, 12, 0, 16, 1249, 84, 0, 271, 111, ! 373, 373, 0, 373, 0, 111, 0, 0, 18, 0, ! 19, 20, 234, 0, 611, 611, 611, 22, 20, 0, ! 0, 0, 0, 0, 0, 611, 25, 0, 0, 23, ! 0, 0, 0, 0, 863, 28, 0, 0, 136, 137, ! 863, 0, 28, 0, 0, 30, 31, 174, 0, 147, ! 10, 11, 12, 175, 14, 15, 271, 0, 0, 157, ! 0, 16, 0, 0, 0, 0, 0, 0, 0, 158, ! 0, 0, 0, 986, 35, 18, 111, 19, 20, 21, ! 159, 0, 0, 0, 22, 1369, 0, 0, 0, 23, ! 0, 0, 234, 25, 0, 0, 176, 0, 0, 611, ! 611, 0, 28, 611, 0, 30, 31, 0, 234, 0, ! 111, 0, 0, 0, 611, 0, 111, 514, 517, 33, ! 1037, 1037, 1037, 0, 734, 0, 611, 0, 1143, 34, ! 0, 0, 0, 0, 35, 0, 0, 0, 271, 0, ! 36, 0, 0, 0, 0, 37, 686, 0, 273, 418, ! 419, 12, 0, 687, 0, 0, 0, 271, 0, 0, ! 0, 0, 0, 0, 0, 234, 0, 0, 0, 0, ! 0, 0, 0, 210, 234, 0, 0, 0, 0, 0, ! 0, 0, 436, 0, 0, 0, 0, 111, 23, 111, ! 373, 234, 0, 0, 0, 688, 0, 1360, 1361, 11, ! 12, 28, 234, 0, 274, 31, 0, 0, 0, 0, ! 0, 863, 0, 0, 0, 80, 0, 0, 0, 0, ! 863, 0, 212, 212, 212, 212, 212, 1140, 873, 0, ! 0, 0, 212, 689, 1140, 1140, 1140, 23, 863, 863, ! 1143, 210, 841, 210, 210, 111, 873, 873, 873, 852, ! 28, 0, 1369, 30, 31, 0, 0, 436, 0, 1362, ! 0, 0, 139, 0, 0, 152, 84, 202, 84, 0, ! 210, 0, 0, 1371, 84, 0, 84, 203, 210, 0, ! 0, 0, 35, 0, 0, 0, 0, 271, 204, 111, ! 0, 111, 0, 0, 0, 0, 0, 0, 0, 111, ! 760, 761, 762, 763, 764, 765, 766, 767, 768, 261, ! 10, 11, 12, 0, 436, 0, 0, 0, 271, 10, ! 11, 0, 175, 14, 15, 0, 611, 611, 491, 611, ! 16, 0, 0, 0, 373, 0, 417, 10, 571, 12, ! 611, 0, 0, 0, 18, 0, 19, 20, 611, 23, ! 0, 863, 0, 22, 0, 0, 263, 0, 611, 611, ! 712, 0, 25, 0, 695, 30, 264, 1531, 0, 0, ! 0, 28, 271, 0, 136, 137, 23, 0, 0, 0, ! 0, 234, 0, 263, 0, 0, 0, 0, 696, 265, ! 234, 0, 274, 264, 35, 0, 0, 0, 697, 212, ! 212, 212, 873, 873, 1444, 0, 0, 212, 212, 698, ! 699, 863, 863, 0, 0, 0, 572, 417, 133, 134, ! 12, 35, 234, 873, 873, 873, 873, 873, 865, 0, ! 0, 866, 0, 514, 517, 0, 111, 0, 0, 0, ! 1371, 0, 0, 0, 0, 884, 0, 0, 0, 111, ! 0, 0, 0, 0, 0, 0, 234, 23, 0, 0, ! 0, 0, 1468, 0, 263, 234, 863, 0, 0, 0, ! 84, 87, 0, 274, 264, 0, 0, 210, 0, 0, ! 0, 113, 271, 0, 271, 0, 234, 0, 0, 0, ! 132, 140, 0, 0, 0, 0, 0, 572, 153, 153, ! 0, 153, 35, 87, 0, 0, 0, 0, 0, 0, ! 0, 0, 87, 234, 0, 0, 0, 0, 0, 208, ! 0, 208, 0, 0, 0, 153, 0, 87, 0, 0, ! 0, 0, 873, 873, 0, 873, 249, 111, 0, 873, ! 210, 259, 0, 0, 0, 0, 417, 10, 11, 12, ! 0, 0, 0, 0, 259, 212, 0, 0, 0, 374, ! 152, 0, 374, 84, 374, 754, 755, 756, 757, 758, ! 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, ! 417, 133, 134, 12, 0, 271, 23, 0, 271, 0, ! 0, 0, 0, 263, 0, 0, 873, 873, 1444, 873, ! 873, 0, 274, 264, 0, 0, 111, 87, 0, 436, ! 374, 374, 0, 153, 153, 0, 0, 0, 0, 153, ! 23, 0, 153, 153, 153, 0, 265, 263, 436, 0, ! 208, 35, 0, 0, 0, 0, 274, 264, 87, 0, ! 0, 0, 87, 0, 0, 0, 0, 0, 153, 87, ! 0, 1189, 111, 0, 873, 0, 1170, 0, 9, 10, ! 1171, 12, 175, 14, 15, 35, 0, 153, 153, 153, ! 16, 0, 0, 0, 0, 0, 0, 147, 10, 11, ! 12, 224, 225, 226, 18, 0, 19, 20, 21, 16, ! 0, 0, 0, 22, -557, 0, 0, 153, 23, 0, ! 0, 0, 25, 1172, 0, 176, 20, 212, 842, 212, ! 0, 28, 22, 0, 30, 31, 0, 23, 1173, 0, ! 1174, 25, 0, 695, 0, 0, 0, 0, 33, 0, ! 28, 0, 0, 30, 31, 0, 0, 153, 34, 0, ! 0, 0, 0, 35, 0, 0, 0, 835, 0, 1175, ! 514, 517, 0, 0, 0, 0, 0, 836, 0, 0, ! 0, 0, 35, 0, 1140, 0, -557, 0, 845, 699, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 259, ! 613, 0, 0, 865, 866, 514, 517, 0, 0, 0, ! 0, 884, 0, 0, 0, 0, 0, 0, 10, 11, ! 0, 0, 14, 15, 0, 1140, 1140, 1140, 234, 16, ! 0, 234, 0, 0, 0, 0, 271, 0, 212, 0, ! 0, 0, 0, 18, 259, 19, 20, 234, 694, 0, ! 613, 0, 22, 613, 713, 0, 0, 0, 0, 724, ! 0, 25, 0, 374, 87, 0, 0, 0, 0, 0, ! 28, 0, 0, 136, 137, 678, 0, 0, 0, 724, ! 0, 0, 0, 147, 10, 11, 12, 224, 225, 226, ! 0, 0, 0, 0, 0, 16, 0, 436, 0, 0, ! 0, 786, 0, 0, 0, 0, 0, 0, 679, 271, ! 0, 259, 20, 153, 259, 0, 0, 0, 22, 0, ! 374, 0, 153, 23, 0, 0, 0, 25, 0, 695, ! 0, 0, 153, 271, 0, 153, 28, 0, 0, 30, ! 31, 1189, 0, 1189, 0, 0, 0, 153, 1370, 1377, ! 0, 1189, 0, 835, 0, 87, 0, 0, 0, 0, ! 0, 0, 0, 836, 0, 0, 0, 0, 35, 0, ! 0, 0, 0, 234, 837, 699, 0, 0, 0, 1011, ! 1014, 153, 843, 153, 153, 713, 0, 0, 0, 843, ! 0, 0, 0, 147, 133, 134, 12, 153, 153, 256, ! 234, 153, 0, 153, 153, 153, 613, 0, 0, 0, ! 153, 0, 0, 0, 0, 153, 0, 0, 153, 0, ! 0, 0, 20, 0, 0, 417, 10, 11, 12, 0, ! 374, 0, 0, 23, 0, 0, 0, 0, 0, 905, ! 0, 0, 0, 0, 0, 0, 28, 0, 0, 30, ! 31, 0, 0, 0, 153, 0, 0, 0, 0, 0, ! 0, 0, 0, 33, 0, 23, 0, 0, 865, 866, ! 514, 517, 263, 34, 436, 0, 0, 884, 35, 514, ! 517, 274, 264, 436, 36, 0, 0, 0, 0, 0, ! 0, 865, 866, 884, 0, 0, 234, 0, 0, 0, ! 374, 0, 234, 0, 0, 572, 259, 259, 259, 259, ! 35, 0, 0, 0, 0, 1370, 0, 0, 1011, 1014, ! 0, 10, 11, 0, 175, 14, 15, 0, 374, 0, ! 491, 0, 16, 0, 0, 0, 0, 0, 0, 0, ! 147, 133, 134, 12, 0, 1189, 18, 0, 19, 20, ! 0, 0, 0, 0, 0, 22, 0, 0, 0, 417, ! 133, 1535, 12, 0, 25, 259, 695, 613, 0, 20, ! 0, 0, 0, 28, 0, 0, 136, 137, 0, 0, ! 23, 613, 613, 713, 0, 0, 0, 0, 0, 0, ! 1506, 0, 0, 28, 1038, 0, 30, 31, 0, 23, ! 1507, 0, 355, 0, 0, 355, 263, 355, 0, 724, ! 33, 1508, 699, 0, 234, 274, 264, 153, 0, 0, ! 34, 0, 234, 0, 0, 35, 0, 0, 0, 0, ! 1532, 36, 0, 0, 0, 1532, 0, 0, 1189, 572, ! 0, 0, 0, 0, 35, 865, 866, 514, 517, 0, ! 0, 0, 884, 355, 355, 147, 133, 134, 12, 0, ! 0, 15, 0, 0, 786, 0, 374, 0, 514, 517, ! 0, 0, 132, 234, 0, 0, 0, 0, 0, 0, ! 153, 249, 234, 0, 20, 0, 0, 0, 0, 0, ! 0, 0, 0, 1251, 0, 23, 1252, 0, 0, 0, ! 234, 234, 0, 0, 0, 0, 905, 1259, 28, 0, ! 0, 30, 31, 1011, 1014, 0, 0, 0, 0, 0, ! 153, 153, 843, 0, 0, 157, 0, 0, 0, 0, ! 1150, 0, 0, 0, 0, 158, 0, 0, 0, 0, ! 35, 0, 0, 0, 0, 0, 159, 0, 0, 153, ! 0, 0, 613, 153, 153, 613, 613, 613, 0, 0, ! 0, 153, 0, 0, 0, 0, 0, 0, 153, 0, ! 0, 0, 0, 0, 0, 0, 0, 865, 866, 0, ! 884, 0, 210, 1673, 210, 0, 0, 0, 0, 0, ! 0, 87, 0, 0, 259, 374, 374, 0, 374, 0, ! 259, 0, 0, 0, 0, 0, 0, 0, 0, 613, ! 613, 613, 0, 234, 0, 0, 1251, 1252, 1011, 1014, ! 613, 0, 0, 0, 0, 1259, 0, 1011, 1014, 0, ! 0, 617, 618, 0, 0, 0, 0, 0, 0, 0, ! 0, 514, 517, 0, 0, 355, 0, 627, 0, 0, ! 628, 629, 0, 0, 0, 0, 639, 0, 0, 0, ! 644, 0, 0, 272, 0, 0, 0, 0, 684, 0, ! 0, 259, 0, 234, 234, 0, 0, 0, 147, 10, ! 11, 12, 175, 14, 15, 0, 355, 0, 0, 0, ! 16, 0, 0, 210, 613, 613, 0, 0, 613, 0, ! 0, 0, 0, 0, 18, 259, 19, 20, 21, 613, ! 0, 259, 0, 22, 0, 1038, 1038, 1038, 23, 0, ! 0, 613, 25, 724, 0, 176, 0, 0, 234, 0, ! 0, 28, 0, 0, 30, 31, 0, 0, 0, 0, ! 0, 0, 0, 355, 462, 0, 0, 0, 33, 0, ! 0, 1011, 1014, 0, 0, 0, 0, 0, 34, 0, ! 0, 0, 0, 35, 0, 0, 0, 0, 0, 36, ! 0, 0, 0, 0, 37, 0, 0, 511, 0, 0, ! 0, 0, 259, 0, 259, 374, 0, 0, 0, 0, ! 530, 0, 0, 1251, 1252, 1011, 1014, 0, 0, 0, ! 1259, 753, 754, 755, 756, 757, 758, 759, 760, 761, ! 762, 763, 764, 765, 766, 767, 768, 153, 153, 153, ! 153, 153, 843, 613, 0, 0, 0, 153, 0, 1150, ! 1150, 1150, 0, 0, 0, 724, 0, 0, 0, 0, ! 259, 613, 613, 613, 1699, 0, 0, 0, 0, 0, ! 514, 517, 0, 355, 905, 0, 0, 140, 0, 0, ! 153, 87, 0, 87, 0, 0, 0, 0, 1372, 87, ! 0, 87, 757, 758, 759, 760, 761, 762, 763, 764, ! 765, 766, 767, 768, 259, 0, 259, 0, 0, 0, ! 0, 0, 0, 0, 259, 0, 1700, 747, 748, 749, ! 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, ! 760, 761, 762, 763, 764, 765, 766, 767, 768, 0, ! 0, 613, 613, 355, 613, 1251, 1252, 0, 1259, 374, ! 0, 0, 0, 0, 0, 613, 0, 0, 0, 627, ! 628, 0, 0, 613, 0, 0, 0, 0, 0, 0, ! 0, 355, 0, 613, 613, 713, 355, 355, 0, 355, ! 355, 355, 355, 355, 355, 355, 355, 355, 355, 355, ! 355, 355, 355, 355, 355, 355, 355, 0, 1329, 0, ! 0, 10, 11, 0, 905, 14, 15, 0, 0, 1011, ! 1014, 0, 16, 0, 153, 153, 153, 613, 613, 713, ! 10, 11, 153, 153, 14, 256, 18, 0, 19, 20, ! 0, 16, 0, 0, 0, 22, 0, 0, 613, 613, ! 613, 613, 613, 0, 25, 18, 905, 19, 20, 0, ! 0, 259, 56, 28, 22, 1372, 136, 137, 0, 0, ! 0, 0, 0, 25, 259, 0, 0, 0, 0, 0, ! 0, 0, 28, 0, 0, 136, 137, 0, 392, 56, ! 56, 0, 160, 0, 56, 87, 0, 0, 0, 0, ! 0, 0, 0, 56, 658, 0, 659, 660, 661, 662, ! 663, 664, 665, 666, 667, 668, 56, 0, 56, 355, ! 0, 147, 10, 11, 12, 214, 14, 215, 0, 0, ! 876, 0, 0, 16, 0, 882, 0, 0, 0, 0, ! 267, 0, 0, 275, 0, 0, 0, 18, 0, 19, ! 20, 0, 0, 0, 0, 0, 22, 613, 613, 0, ! 613, 23, 259, 0, 613, 25, 908, 0, 0, 0, ! 0, 0, 495, 914, 28, 0, 0, 30, 31, 0, ! 153, 216, 0, 0, 0, 153, 0, 0, 87, 0, ! 0, 33, 0, 0, 0, 420, 420, 537, 56, 0, ! 0, 34, 0, 0, 56, 56, 35, 0, 267, 275, ! 56, 0, 36, 160, 160, 160, 924, 925, 0, 926, ! 459, 613, 613, 713, 613, 613, 0, 0, 0, 56, ! 0, 259, 0, 56, 147, 10, 11, 12, 0, 56, ! 56, 0, 10, 11, 0, 214, 14, 215, 355, 355, ! 0, 355, 0, 16, 0, 0, 0, 0, 56, 56, ! 160, 0, 0, 20, 0, 0, 0, 18, 267, 19, ! 20, 0, 0, 0, 23, 0, 22, 259, 0, 613, ! 0, 0, 0, 0, 0, 25, 0, 28, 56, 0, ! 30, 31, 0, 0, 28, 0, 0, 136, 137, 0, ! 0, 0, 0, 0, 518, 0, 0, 0, 1023, 1024, ! 0, 0, 0, 0, 519, 0, 0, 1023, 0, 35, ! 638, 1661, 0, 0, 0, 520, 0, 0, 56, 0, ! 0, 0, 153, 843, 153, 267, 1241, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 1170, 0, 9, 10, ! 1171, 12, 175, 14, 15, 0, 0, 0, 0, 0, ! 16, 0, 0, 0, 0, 0, 0, 0, 627, 628, ! 0, 0, 0, 0, 18, 0, 19, 20, 21, 0, ! 0, 0, 0, 22, -558, 0, 0, 0, 23, 1150, ! 0, 0, 25, 1172, 0, 176, 0, 0, 0, 0, ! 794, 28, 635, 0, 30, 31, 0, 0, 1173, 0, ! 1174, 0, 0, 0, 0, 0, 0, 0, 33, 420, ! 147, 10, 11, 12, 0, 0, 0, 0, 34, 267, ! 1150, 1150, 1150, 35, 0, 56, 0, 0, 355, 1175, ! 0, 355, 0, 153, 0, 0, 1142, 0, 0, 267, ! 0, 147, 10, 11, 12, 0, -558, 15, 657, 658, ! 23, 659, 660, 661, 662, 663, 664, 665, 666, 667, ! 668, 0, 420, 28, 0, 0, 30, 31, 794, 0, ! 20, 1158, 627, 628, 56, 0, 0, 0, 0, 0, ! 202, 23, 0, 56, 0, 267, 0, 0, 0, 0, ! 203, 0, 459, 56, 28, 35, 56, 30, 31, 0, ! 0, 204, 459, 459, 459, 0, 0, 0, 56, 0, ! 0, 202, 0, 1198, 0, 1200, 56, 0, 0, 0, ! 0, 203, 0, 0, 0, 0, 35, 0, 0, 0, ! 0, 0, 204, 0, 0, 0, 0, 0, 1525, 1526, ! 11, 12, 56, 56, 56, 56, 0, 0, 0, 0, ! 56, 0, 355, 0, 0, 0, 0, 0, 56, 56, ! 0, 0, 56, 0, 160, 160, 160, 459, 0, 0, ! 1416, 56, 355, 0, 0, 0, 56, 0, 23, 56, ! 0, 0, 0, 0, 933, 934, 936, 937, 938, 1236, ! 1237, 28, 1239, 0, 30, 31, 0, 638, 0, 0, ! 1527, 0, 0, 0, 0, 0, 0, 0, 202, 0, ! 956, 0, 0, 0, 0, 56, 0, 0, 203, 0, ! 0, 0, 1260, 35, 654, 655, 656, 657, 658, 204, ! 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, ! 82, 0, 0, 985, 0, 147, 10, 11, 12, 224, ! 225, 226, 0, 0, 0, 0, 0, 16, 0, 0, ! 0, 0, 1015, 0, 0, 0, 0, 82, 82, 1028, ! 82, 1029, 82, 1015, 20, 0, 0, 635, 635, 635, ! 22, 82, 0, 0, 0, 23, 0, 0, 0, 25, ! 0, 695, 635, 0, 82, 0, 82, 0, 28, 0, ! 0, 30, 31, 1170, 0, 9, 10, 1171, 12, 175, ! 14, 15, 0, 0, 0, 202, 0, 16, 0, 0, ! 0, 277, 0, 0, 0, 203, 0, 0, 0, 0, ! 35, 18, 0, 19, 20, 21, 1674, 0, 1317, 267, ! 22, -560, 0, 0, 0, 23, 0, 0, 0, 25, ! 1172, 635, 176, 635, 0, 635, 0, 0, 28, 0, ! 0, 30, 31, 0, 0, 1173, 0, 1174, 0, 0, ! 147, 10, 11, 12, 0, 33, 82, 0, 56, 0, ! 0, 0, 82, 82, 0, 34, 0, 277, 82, 0, ! 35, 82, 82, 82, 0, 0, 1175, 0, 0, 20, ! 0, 1015, 0, 0, 0, 0, 0, 82, 0, 1015, ! 23, 82, 0, -560, 0, 0, 0, 82, 82, 0, ! 0, 0, 0, 28, 0, 420, 30, 31, 0, 0, ! 0, 0, 420, 0, 0, 0, 82, 82, 82, 0, ! 202, 56, 10, 11, 0, 0, 14, 256, 0, 0, ! 203, 1422, 0, 16, 0, 35, 0, 0, 0, 0, ! 0, 204, 0, 0, 0, 0, 82, 18, 0, 19, ! 20, 0, 0, 495, 0, 0, 22, 0, 0, 495, ! 0, 56, 56, 160, 0, 25, 0, 695, 267, 275, ! 0, 1147, 0, 0, 28, 0, 0, 136, 137, 0, ! 0, 0, 0, 0, 0, 635, 82, 0, 0, 0, ! 56, 696, 1445, 459, 56, 56, 459, 459, 459, 0, ! 0, 697, 56, 0, 0, 0, 0, 0, 0, 56, ! 0, 0, 698, 699, 0, 0, 0, 0, 639, 0, ! 0, 0, 1453, 0, 0, 0, 0, 0, 0, 0, ! 1231, 0, 56, 0, 0, 1459, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 147, 10, 11, 12, ! 175, 14, 15, 0, 0, 0, 491, 0, 16, 0, ! 0, 0, 1475, 0, 956, 0, 1476, 0, 0, 0, ! 495, 0, 18, 0, 19, 20, 1015, 0, 0, 0, ! 0, 22, 0, 0, 0, 0, 23, 0, 723, 0, ! 25, 0, 695, 82, 0, 0, 0, 0, 0, 28, ! 0, 1498, 30, 31, 0, 0, 0, 0, 723, 0, ! 0, 0, 0, 0, 0, 0, 1135, 0, 0, 0, ! 0, 0, 0, 627, 628, 0, 1136, 0, 0, 0, ! 0, 35, 0, 0, 0, 0, 0, 1137, 699, 0, ! 0, 794, 82, 1290, 0, 0, 0, 0, 0, 0, ! 0, 82, 0, 0, 1542, 1543, 635, 635, 635, 0, ! 0, 82, 459, 267, 82, 0, 1525, 133, 134, 12, ! 0, 167, 0, 0, 0, 0, 82, 0, 0, 0, ! 0, 1015, 0, 0, 82, 0, 0, 0, 0, 0, ! 1015, 1565, 1566, 0, 0, 213, 0, 1568, 0, 1330, ! 0, 0, 0, 0, 0, 0, 23, 0, 0, 0, ! 82, 82, 82, 82, 0, 0, 0, 0, 82, 28, ! 0, 0, 30, 31, 0, 0, 82, 82, 1527, 0, ! 82, 0, 82, 82, 82, 0, 33, 0, 0, 82, ! 0, 0, 0, 495, 82, 495, 34, 82, 0, 0, ! 0, 35, 0, 1394, 0, 0, 0, 36, 56, 56, ! 56, 160, 160, 160, 459, 0, 267, 0, 56, 267, ! 1147, 1147, 1147, 0, 0, 0, 275, 0, 0, 0, ! 0, 0, 0, 82, 0, 0, 0, 0, 0, 0, ! 0, 0, 167, 167, 167, 0, 0, 0, 0, 0, ! 0, 160, 56, 0, 56, 0, 1682, 0, 0, 56, ! 56, 0, 56, 0, 1015, 0, 0, 1170, 213, 9, ! 10, 1171, 12, 175, 14, 15, 0, 0, 0, 0, ! 0, 16, 0, 0, 0, 0, 0, 213, 213, 523, ! 0, 0, 0, 0, 0, 18, 0, 19, 20, 21, ! 0, 0, 0, 0, 22, -559, 0, 0, 1015, 23, ! 0, 0, 0, 25, 1172, 0, 176, 213, 0, 0, ! 0, 0, 28, 133, 134, 30, 31, 225, 226, 1173, ! 0, 1174, 0, 0, 16, 0, 0, 0, 0, 33, ! 495, 0, 0, 0, 459, 459, 459, 0, 0, 34, ! 0, 20, 0, 495, 35, 0, 0, 22, 723, 0, ! 1175, 0, 0, 0, 0, 0, 25, 0, 695, 0, ! 0, 0, 0, 0, 0, 28, 0, -559, 136, 137, ! 0, 0, 0, 0, 0, 56, 56, 56, 459, 459, ! 459, 0, 696, 56, 56, 0, 82, 0, 0, 0, ! 612, 0, 697, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 709, 699, 648, 649, 650, 651, 652, ! 653, 654, 655, 656, 657, 658, 56, 659, 660, 661, ! 662, 663, 664, 665, 666, 667, 668, 0, 0, 0, ! 0, 1330, 0, 0, 0, 0, 0, 267, 275, 0, ! 702, 0, 0, 702, 702, 0, 56, 0, 0, 82, ! 0, 0, 576, 578, 579, 580, 581, 582, 0, 584, ! 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, ! 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, ! 0, 606, 607, 0, 0, 273, 10, 11, 12, 82, ! 82, 82, 1015, 0, 0, 0, 0, 277, 0, 1149, ! 495, 10, 11, 213, 175, 14, 15, 0, 0, 0, ! 0, 0, 16, 0, 20, 0, 0, 0, 82, 0, ! 0, 0, 82, 82, 0, 23, 18, 0, 19, 20, ! 82, 56, 0, 0, 267, 22, 56, 82, 28, 56, ! 0, 274, 31, 0, 787, 0, 794, 788, 0, 0, ! 0, 0, 0, 28, 0, 870, 136, 137, 0, 0, ! 82, 0, 0, 0, 0, 871, 0, 0, 0, 0, ! 35, 839, 0, 839, 839, 702, 872, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 213, 213, 0, ! 0, 213, 0, 523, 523, 523, 874, 0, 0, 0, ! 213, 0, 0, 0, 0, 213, 0, 1587, 213, -931, ! -931, -931, -931, -931, -931, -931, -931, -931, -931, 0, ! -931, -931, -931, 0, -931, -931, -931, -931, -931, -931, ! -931, -931, -931, -931, -931, -931, -931, -931, -931, -931, ! 0, -931, -931, -931, -931, 0, -931, -931, -931, -931, ! -931, -931, -931, -931, -931, 0, 0, -931, -931, -931, ! -931, -931, -931, 0, 0, -931, -931, -931, 0, -931, ! -931, 147, 10, 11, 12, 0, -931, 0, 0, -931, ! 0, 0, 211, 56, 56, 56, 0, -931, -931, -931, ! 0, 0, 723, 0, -931, -931, -931, 0, 0, 0, ! -931, 638, 0, 0, -931, 0, 270, 0, 0, 278, ! 0, 23, 0, 0, 0, 0, 0, 1588, -931, 0, ! 0, 0, 0, 0, 28, 0, 0, 30, 31, 0, ! 0, 1668, 0, 270, 0, 386, 0, 0, 0, 0, ! 1147, 202, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 203, 0, 0, 922, 0, 35, 995, 0, 0, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 702, 702, 702, 0, 0, 923, 0, 0, 0, ! 0, 1147, 1147, 1147, 702, 928, 82, 82, 82, 82, ! 82, 82, 0, 0, 56, 0, 82, 0, 1149, 1149, ! 1149, 0, 0, 0, 1323, 211, 0, 213, 0, 0, ! 0, 0, 0, 1170, 0, 9, 10, 1171, 12, 175, ! 14, 15, 0, 0, 211, 211, 211, 16, 0, 82, ! 82, 0, 82, 0, 529, 0, 0, 82, 82, 0, ! 82, 18, 0, 19, 20, 21, 0, 0, 0, 0, ! 22, 0, 0, 0, 211, 23, 0, 0, 0, 25, ! 1172, 0, 176, 0, 0, 0, 0, 0, 28, 0, ! 839, 30, 31, 0, 0, 1173, 0, 1174, 0, 0, ! 0, 278, 0, 0, 0, 33, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 34, 0, 0, 0, 0, ! 35, 270, 0, 0, 0, 0, 1175, 0, 0, 0, ! 839, 839, 1141, 0, 0, 0, 0, 0, 0, 0, ! 1141, 0, 0, 0, 0, 10, 11, 0, 175, 14, ! 15, 0, 0, 0, 491, 0, 16, 0, 0, 213, ! 0, 0, 874, 213, 213, 874, 874, 874, 0, 0, ! 18, 213, 19, 20, 0, 0, 0, 0, 213, 22, ! 0, 0, 0, 82, 82, 82, 0, 0, 25, 0, ! 0, 82, 82, 0, 0, 0, 0, 28, 0, 0, ! 136, 137, 0, 8, 0, 9, 10, 11, 12, 13, ! 14, 15, 0, 0, 0, 270, 278, 16, 0, 612, ! 612, 612, 0, 0, 82, 0, 0, 0, 0, 0, ! 702, 18, 0, 19, 20, 270, 278, 0, 0, 0, ! 22, 0, 0, 0, 0, 23, 277, 0, 0, 25, ! 0, 0, 466, 0, 82, 0, 0, 0, 28, 0, ! 0, 30, 31, 0, 0, 32, 0, 0, 0, 0, ! 211, 0, 0, 0, 0, 33, 0, 0, 0, 0, ! 0, 0, 494, 0, 0, 34, 0, 0, 0, 0, ! 35, 0, 0, 0, 0, 0, 36, 0, 0, 0, ! 0, 0, 0, 0, 702, 702, 0, 0, 702, 0, ! 0, 1202, 1203, 147, 133, 1348, 12, 0, 0, 702, ! 0, 0, 0, 0, 0, 702, 702, 702, 0, 0, ! 0, 702, 0, 0, 0, 0, 0, 0, 211, 82, ! 211, 211, 20, 0, 82, 133, 134, 82, 0, 225, ! 226, 0, 0, 23, 211, 211, 16, 0, 211, 0, ! 211, 211, 211, 211, 0, 0, 28, 211, 0, 30, ! 31, 0, 211, 20, 0, 211, 0, 0, 0, 22, ! 0, 0, 0, 157, 0, 0, 0, 0, 25, 0, ! 695, 10, 11, 158, 0, 14, 15, 28, 35, 0, ! 136, 137, 16, 0, 159, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 696, 0, 18, 0, 19, 20, ! 0, 0, 0, 0, 697, 22, 0, 839, 839, 839, ! 1141, 1141, 1141, 1315, 25, 698, 699, 839, 0, 1141, ! 1141, 1141, 0, 28, 0, 0, 136, 137, 0, 0, ! 0, 874, 874, 874, 655, 656, 657, 658, 0, 659, ! 660, 661, 662, 663, 664, 665, 666, 667, 668, 0, ! 167, 743, 0, 0, 0, 0, 0, 0, 213, 0, ! 8, 0, 9, 10, 11, 12, 13, 14, 15, 0, ! 0, 82, 82, 82, 16, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 17, 18, 0, ! 19, 20, 21, 0, 0, 0, 0, 22, 0, 0, ! 0, 0, 23, 0, 0, 24, 25, 26, 0, 27, ! 0, 995, 995, 0, 995, 28, 29, 0, 30, 31, ! 0, 0, 32, 0, 0, 702, 0, 0, 1149, 0, ! 0, 0, 33, 702, 270, 278, 0, 0, 0, 0, ! 0, 0, 34, 702, 702, 702, 0, 35, 0, 0, ! 827, 494, 0, 36, 211, 0, 0, 0, 37, 0, ! 0, 0, 147, 133, 134, 12, 0, 0, 568, 1149, ! 1149, 1149, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 82, 0, 839, 839, 839, 1315, 1315, 1315, ! 0, 20, 839, 839, 0, 0, 10, 11, 0, 175, ! 14, 15, 23, 0, 0, 1624, 0, 16, 874, 874, ! 874, 874, 874, 0, 0, 28, 0, 211, 30, 31, ! 0, 18, 0, 19, 20, 213, 0, 0, 0, 0, ! 22, 0, 33, 0, 0, 0, 0, 0, 0, 25, ! 0, 0, 34, 0, 0, 0, 0, 35, 28, 0, ! 0, 136, 137, 36, 0, 0, 0, 211, 211, 1139, ! 0, 0, 0, 0, 270, 278, 0, 1139, 0, 0, ! 0, 0, 0, 0, 0, 147, 10, 11, 12, 0, ! 494, 256, 0, 931, 0, 0, 211, 0, 0, 211, ! 211, 211, 211, 211, 211, 529, 0, 0, 211, 0, ! 0, 0, 0, 0, 20, 211, 0, 0, 0, 827, ! 0, 0, 0, 0, 0, 23, 0, 1315, 1315, 0, ! 1315, 0, 0, 0, 874, 0, 0, 278, 28, 0, ! 0, 30, 31, 0, 494, 0, 0, 0, 0, 494, ! 213, 0, 494, 494, 0, 202, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 203, 0, 0, 0, 0, ! 35, 0, 0, 0, 0, 0, 204, 0, 0, 0, ! 0, 0, 0, 494, 0, 0, 0, 0, 0, 0, ! 494, 1315, 1315, 1315, 1315, 1315, 0, 0, 0, 0, ! 494, 751, 752, 753, 754, 755, 756, 757, 758, 759, ! 760, 761, 762, 763, 764, 765, 766, 767, 768, 1057, ! 1059, 1060, 1061, 0, 1063, 1064, 1065, 1066, 1067, 1068, ! 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, ! 1079, 1080, 1081, 0, 0, 0, 0, 0, 0, 1315, ! 273, 10, 11, 12, 175, 14, 15, 0, 0, 0, ! 491, 0, 16, 0, 0, 0, 0, 0, 0, 270, ! 278, 270, 0, 0, 0, 0, 18, 0, 19, 20, ! 0, 0, 0, 0, 0, 22, 0, 0, 0, 0, ! 23, 0, 0, 0, 25, 0, 695, 0, 0, 0, ! 827, 0, 213, 28, 213, 0, 274, 31, 0, 0, ! 0, 0, 0, 0, 700, 0, 0, 700, 700, 494, ! 1268, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 1269, 0, 0, 494, 0, 35, 0, 0, 0, 0, ! 0, 1270, 699, 755, 756, 757, 758, 759, 760, 761, ! 762, 763, 764, 765, 766, 767, 768, 0, 0, 523, ! 0, 0, 0, 0, 211, 211, 211, 211, 211, 1139, ! 211, 0, 1316, 0, 211, 270, 1139, 1139, 1139, 0, ! 0, 0, 278, 0, 0, 0, 0, 0, 211, 211, ! 211, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 523, 523, 523, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 213, 0, 211, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 1219, 0, 0, 0, ! 0, 0, 147, 10, 11, 12, 175, 14, 15, 0, ! 0, 0, 851, 0, 16, 700, 0, 700, 700, 700, ! 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, ! 19, 20, 0, 827, 494, 0, 0, 22, 0, 0, ! 0, 0, 23, 0, 0, 0, 25, 109, 494, 0, ! 494, 0, 494, 0, 0, 28, 127, 109, 30, 31, ! 0, 0, 0, 0, 109, 109, 0, 109, 0, 0, ! 0, 0, 33, 0, 0, 0, 0, 147, 10, 11, ! 12, 0, 34, 15, 0, 0, 0, 35, 0, 0, ! 0, 0, 0, 36, 0, 1277, 0, 0, 0, 0, ! 0, 0, 245, 0, 0, 0, 20, 0, 0, 0, ! 0, 211, 211, 211, 211, 211, 1139, 23, 0, 211, ! 211, 0, 0, 0, 0, 0, 0, 0, 494, 0, ! 28, 0, 0, 30, 31, 211, 211, 211, 211, 211, ! 0, 0, 0, 0, 0, 0, 0, 518, 0, 0, ! 0, 0, 211, 0, 0, 0, 0, 519, 0, 0, ! 0, 412, 35, 127, 0, 0, 494, 0, 520, 0, ! 109, 109, 0, 529, 0, 0, 0, 0, 0, 109, ! 109, 0, 0, 109, 109, 109, 0, 444, 109, 109, ! 109, 0, 0, 0, 0, 0, 827, 827, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, ! 764, 765, 766, 767, 768, 700, 700, 700, 1347, 0, ! 0, 652, 653, 654, 655, 656, 657, 658, 1034, 659, ! 660, 661, 662, 663, 664, 665, 666, 667, 668, 0, ! 0, 0, 0, 0, 211, 211, 1316, 211, 656, 657, ! 658, 211, 659, 660, 661, 662, 663, 664, 665, 666, ! 667, 668, 0, 0, 827, 827, 0, 211, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 245, ! 109, 0, 0, 0, 0, 0, 0, 273, 10, 11, ! 12, 175, 14, 15, 0, 0, 0, 491, 0, 16, ! 0, 0, 0, 109, 0, 0, 0, 0, 211, 211, ! 1139, 211, 211, 18, 700, 19, 20, 0, 0, 0, ! 0, 0, 22, 0, 1428, 0, 0, 23, 0, 0, ! 0, 25, 0, 695, 0, 0, 0, 0, 0, 0, ! 28, 0, 0, 274, 31, 494, 109, 494, 0, 494, ! 0, 827, 0, 0, 700, 700, 700, 1312, 0, 0, ! 0, 0, 0, 0, 1034, 0, 211, 1313, 0, 0, ! 0, 0, 35, 0, 0, 0, 0, 0, 1314, 699, ! 0, 0, 827, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 109, 0, 109, 0, 0, 109, ! 653, 654, 655, 656, 657, 658, 1463, 659, 660, 661, ! 662, 663, 664, 665, 666, 667, 668, 0, 0, 211, ! 0, 211, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, -420, 10, 11, -420, -420, 14, 256, 0, 0, ! 0, 0, 0, 16, 827, 0, 0, 109, 0, 0, ! 0, 0, 0, 0, 700, 0, 0, 18, 0, 19, ! 20, 0, 0, 0, 0, 0, 22, 0, 109, 0, ! 109, -420, 0, 494, 0, 25, 1139, 695, 109, 0, ! 0, 109, 0, 0, 28, 0, 0, 136, 137, 0, ! 0, 0, 0, 109, 0, 827, 0, 0, 0, 0, ! 0, 696, 0, 0, 0, 1521, 1522, 147, 10, 11, ! 12, 697, 0, 568, 0, 0, -420, 1139, 1139, 1139, ! 0, 0, 698, 699, 0, 0, 0, 0, 700, 700, ! 211, 0, 700, 0, 0, 827, 20, 0, 273, 10, ! 11, 12, 0, 700, 15, 0, 0, 23, 0, 1034, ! 1034, 1034, 0, 0, 0, 700, 0, 0, 0, 0, ! 28, 0, 0, 30, 31, 0, 0, 20, 0, 0, ! 0, 1574, 0, 0, 0, 0, 0, 202, 23, 0, ! 0, 0, 0, 0, 245, 898, 0, 203, 0, 0, ! 0, 28, 35, 0, 274, 31, 0, 0, 204, 0, ! 109, 0, 0, 0, 0, 0, 0, 0, 870, 0, ! 0, 0, 0, 0, 0, 0, 1631, 1632, 871, 0, ! 0, 0, 0, 35, 0, 0, 0, 0, 0, 872, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 109, 1650, 109, 0, 0, 0, 0, 0, ! 0, 700, 700, 700, 700, 700, 700, 700, 0, 0, ! 0, 700, 0, 1034, 1034, 1034, 756, 757, 758, 759, ! 760, 761, 762, 763, 764, 765, 766, 767, 768, 0, ! 0, 1688, 1360, 10, 1171, 12, 214, 14, 215, 0, ! 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, ! 19, 20, 0, 109, 0, 0, 0, 22, 494, 0, ! 0, 0, 23, 0, 109, 109, 25, 109, 109, 0, ! 0, 0, 0, 0, 0, 28, 0, 0, 30, 31, ! 0, 0, 0, 1738, 1362, 0, 0, 0, 0, 0, ! 0, 0, 33, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 34, 0, 0, 0, 0, 35, 0, 700, ! 0, 0, 0, 1175, 0, 0, 0, 700, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 700, 700, 700, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 109, 0, 0, 0, 0, 0, 0, 109, 127, 0, ! 0, 0, 0, 0, 0, 0, 0, 245, 700, 700, ! 700, 700, 700, 700, 0, 0, 700, 700, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 898, 0, 827, 0, 0, 1550, 0, -931, ! -931, -931, -931, -931, -931, -931, -931, -931, -931, 0, ! -931, -931, -931, 0, -931, -931, -931, -931, -931, -931, ! -931, -931, -931, -931, -931, -931, -931, -931, -931, -931, ! 0, -931, -931, -931, -931, 0, -931, -931, -931, -931, ! -931, -931, -931, -931, -931, 0, 0, -931, -931, -931, ! -931, -931, -931, 0, 0, -931, -931, -931, 0, -931, ! -931, 0, 0, 0, 0, 0, -931, 0, 0, -931, ! 0, 0, 0, 0, 0, 20, 898, -931, -931, -931, ! 0, 0, 0, 0, -931, -931, -931, 0, 0, 0, ! -931, 0, 0, 0, -931, 109, 109, 109, 109, 0, ! 0, 700, 700, 0, 700, 0, 109, 0, -931, 747, ! 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, ! 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, ! 768, 0, 0, 0, 0, 747, 748, 749, 750, 751, ! 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, ! 762, 763, 764, 765, 766, 767, 768, 0, 0, 0, ! 0, 0, 0, 0, 0, 700, 700, 700, 700, 700, ! 0, 1636, 0, -514, -514, -514, -514, -514, -514, -514, ! 109, 109, 1400, -514, 109, -514, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 109, -514, 0, -514, 0, ! 0, 0, -514, 0, 0, 0, 0, 109, -514, 0, ! 0, 0, 0, -514, 0, 0, 0, -514, 0, -514, ! 0, 0, 0, 700, 0, 0, -514, 0, 0, -514, ! -514, -514, -514, -514, 0, -514, -514, -514, -514, -514, ! -514, -514, -514, -514, -514, -514, -514, -514, -514, -514, ! -514, -514, -514, -514, -514, -514, -514, -514, -514, -514, ! -514, 0, 0, -514, -514, -514, -514, 0, -514, 0, ! 0, 0, 0, 1637, -514, 0, 0, 0, 0, -514, ! -514, -514, 0, -514, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 747, 748, 749, 750, ! 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, ! 761, 762, 763, 764, 765, 766, 767, 768, 0, 0, ! 0, 0, 0, 0, 630, 0, 273, 10, 11, 12, ! 175, 14, 317, 318, 319, 320, 491, 321, 16, 1722, ! 898, 0, 0, 109, 0, 0, 109, 0, 0, 0, ! 0, 0, 18, 322, 19, 20, 21, 0, 323, 324, ! 325, 22, 0, 326, 327, 328, 23, 329, 330, 0, ! 25, 0, 695, 0, 331, 332, 333, 334, 335, 28, ! 0, 0, 274, 31, -346, 0, 0, 387, 0, 0, ! 0, 0, 0, 338, 0, 0, 1030, 0, 0, 0, ! 0, 0, 0, 0, 340, 341, 1031, 109, 109, 0, ! 109, 343, 344, 345, 0, 0, 0, 1032, 699, 0, ! 0, 109, 0, 0, 0, 0, 0, 0, 0, 109, ! 0, 0, 0, 0, 0, 347, 0, 0, 0, 109, ! 109, 0, 0, 0, 630, 0, 147, 10, 11, 12, ! 175, 14, 317, 318, 319, 320, 491, 321, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 898, 0, 18, 322, 19, 20, 21, 0, 323, 324, ! 325, 22, 0, 326, 327, 328, 23, 329, 330, 0, ! 25, 0, 695, 0, 331, 332, 333, 334, 335, 28, ! 0, 0, 30, 31, -346, 0, 0, 387, 0, 0, ! 0, 0, 898, 338, 0, 0, 1144, 0, 0, 0, ! 0, 0, 0, 0, 340, 341, 1145, 0, 0, 0, ! 0, 343, 344, 345, 0, 0, 0, 1146, 699, 0, ! 0, 0, 0, 109, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 347, 490, 0, 273, 10, ! 11, 12, 175, 14, 317, 318, 319, 320, 491, 321, ! 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 18, 322, 19, 20, 21, 0, ! 323, 324, 325, 22, 0, 326, 327, 328, 23, 329, ! 330, 0, 25, 0, 0, 0, 331, 332, 333, 334, ! 335, 28, 0, 0, 274, 31, 0, 0, 0, 387, ! 0, 0, 0, 0, 0, 338, 0, 0, 339, 0, ! 0, 0, 0, 0, 0, 0, 340, 341, 342, 109, ! 0, 109, 0, 343, 344, 345, 0, 0, 959, 346, ! 273, 10, 11, 12, 175, 14, 317, 318, 319, 320, ! 0, 321, 16, 0, 0, -844, 0, 347, 0, 0, ! 0, 0, 0, 0, 0, 0, 18, 322, 19, 20, ! 21, 0, 323, 324, 325, 22, 0, 326, 327, 328, ! 23, 329, 330, 0, 25, 0, 0, 0, 331, 332, ! 333, 334, 335, 28, 0, 0, 274, 31, 1733, 0, ! -833, 387, 0, 0, 0, 0, 0, 338, 0, 0, ! 339, 0, 0, 0, 0, 0, 0, 0, 340, 341, ! 342, 0, 0, 0, 0, 343, 344, 345, 0, 0, ! 825, 346, 947, 948, 949, 12, 0, 14, 507, 318, ! 319, 320, 0, 321, 16, 0, 0, 0, 0, 347, ! 0, 0, 0, 0, 0, 0, 0, 0, 18, 322, ! 19, 0, 21, 0, 323, 324, 325, 22, 0, 326, ! 327, 328, 23, 329, 330, 0, 25, 0, 0, 0, ! 331, 332, 333, 334, 335, 28, 0, 0, 950, 951, ! 826, 0, 0, 387, 0, 0, 0, 0, 0, 338, ! 0, 0, 339, 0, 0, 0, 0, 0, 0, 0, ! 340, 341, 342, 0, 0, 0, 0, 343, 344, 345, ! 0, 0, 0, 346, 952, 630, 0, 273, 10, 11, ! 12, 0, 14, 317, 318, 319, 320, 0, 321, 16, ! 1129, 347, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 20, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 274, 31, -346, 0, 0, 387, 0, ! 0, 0, 0, 0, 338, 0, 0, 631, 0, 0, ! 0, 0, 0, 0, 0, 340, 341, 632, 0, 0, ! 0, 0, 343, 344, 345, 0, 0, 825, 633, 947, ! 948, 949, 12, 0, 14, 507, 318, 319, 320, 0, ! 321, 16, 0, 0, 0, 0, 347, 0, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 0, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 950, 951, 826, 0, 0, ! 387, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 0, ! 346, 952, 825, 0, 273, 10, 11, 12, 0, 14, ! 507, 318, 319, 320, 0, 321, 16, 0, 347, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 18, 322, 19, 0, 21, 0, 323, 324, 325, 22, ! 0, 326, 327, 328, 23, 329, 330, 0, 25, 0, ! 0, 0, 331, 332, 333, 334, 335, 28, 0, 0, ! 274, 31, 826, 0, 0, 387, 0, 0, 0, 0, ! 0, 338, 0, 0, 339, 0, 0, 0, 0, 0, ! 0, 0, 340, 341, 342, 0, 0, 0, 0, 343, ! 344, 345, 0, 0, 0, 346, 0, 825, 0, 947, ! 948, 949, 12, 1326, 14, 507, 318, 319, 320, 0, ! 321, 16, 0, 347, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 0, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 950, 951, 826, 0, 0, ! 387, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 825, ! 346, 947, 948, 949, 12, 0, 14, 507, 318, 319, ! 320, 0, 321, 16, 0, 0, 0, -518, 347, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 0, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 0, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 950, 951, 826, ! 0, 0, 387, 0, 0, 0, 0, 0, 338, 0, ! 0, 339, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 342, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 630, 346, 147, 10, 11, 12, 0, 14, 317, ! 318, 319, 320, 0, 321, 16, 0, 0, 0, 1441, ! 347, 0, 0, 0, 0, 0, 0, 0, 0, 18, ! 322, 19, 20, 21, 0, 323, 324, 325, 22, 0, ! 326, 327, 328, 23, 329, 330, 0, 25, 0, 0, ! 0, 331, 332, 333, 334, 335, 28, 0, 0, 30, ! 31, -346, 0, 0, 387, 0, 0, 0, 0, 0, ! 338, 0, 0, 1715, 0, 0, 0, 0, 0, 0, ! 0, 340, 341, 1716, 0, 0, 0, 0, 343, 344, ! 345, 0, 0, 1772, 1717, 273, 10, 11, 12, 0, ! 14, 317, 318, 319, 320, 0, 321, 16, 0, 0, ! 0, 0, 347, 0, 0, 0, 0, 0, 0, 0, ! 0, 18, 322, 19, 20, 21, 0, 323, 324, 325, ! 22, 0, 326, 327, 328, 23, 329, 330, 0, 25, ! 0, 0, 0, 331, 332, 333, 334, 335, 28, 0, ! 0, 274, 31, 0, 0, -210, 387, 0, 0, 0, ! 0, 0, 338, 0, 0, 339, 0, 0, 0, 0, ! 0, 0, 0, 340, 341, 342, 0, 0, 0, 0, ! 343, 344, 345, 0, 0, 825, 346, 273, 10, 11, ! 12, 0, 14, 507, 318, 319, 320, 0, 321, 16, ! 0, 0, 0, 0, 347, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 0, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 274, 31, 826, 0, 0, 387, 0, ! 0, 0, 0, 0, 338, 0, 0, 339, 0, 0, ! 0, 0, 0, 0, 0, 340, 341, 342, 0, 0, ! 0, 0, 343, 344, 345, 0, 0, 959, 346, 273, ! 10, 11, 12, 0, 14, 507, 318, 319, 320, 0, ! 321, 16, 0, 0, 0, 0, 347, 0, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 0, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 274, 31, 0, 0, 0, ! 387, -833, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 959, ! 346, 273, 10, 11, 12, 0, 14, 507, 318, 319, ! 320, 0, 321, 16, 0, 0, 0, 0, 347, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 0, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 0, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 274, 31, 0, ! 0, 0, 387, 0, 0, 0, 0, 0, 338, 0, ! 0, 339, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 342, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 1056, 346, 273, 10, 11, 12, 0, 14, 507, ! 318, 319, 320, 0, 321, 16, 0, 0, -833, 0, ! 347, 0, 0, 0, 0, 0, 0, 0, 0, 18, ! 322, 19, 0, 21, 0, 323, 324, 325, 22, 0, ! 326, 327, 328, 23, 329, 330, 0, 25, 0, 0, ! 0, 331, 332, 333, 334, 335, 28, 0, 0, 274, ! 31, 0, 0, 0, 387, 0, 0, 0, 0, 0, ! 338, 0, 0, 339, 0, 0, 0, 0, 0, 0, ! 0, 340, 341, 342, 0, 0, 0, 0, 343, 344, ! 345, 0, 0, 1058, 346, 273, 10, 11, 12, 0, ! 14, 507, 318, 319, 320, 0, 321, 16, 0, 0, ! 0, 0, 347, 0, 0, 0, 0, 0, 0, 0, ! 0, 18, 322, 19, 0, 21, 0, 323, 324, 325, ! 22, 0, 326, 327, 328, 23, 329, 330, 0, 25, ! 0, 0, 0, 331, 332, 333, 334, 335, 28, 0, ! 0, 274, 31, 0, 0, 0, 387, 0, 0, 0, ! 0, 0, 338, 0, 0, 339, 0, 0, 0, 0, ! 0, 0, 0, 340, 341, 342, 0, 0, 0, 0, ! 343, 344, 345, 0, 0, 1687, 346, 273, 10, 11, ! 12, 0, 14, 507, 318, 319, 320, 0, 321, 16, ! 0, 0, 0, 0, 347, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 0, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 274, 31, 0, 0, 0, 387, 0, ! 0, 0, 0, 0, 338, 280, 0, 339, 10, 11, ! 0, 0, 14, 15, 0, 340, 341, 342, 0, 16, ! 0, 0, 343, 344, 345, 0, 0, 0, 346, 0, ! 0, 0, 0, 18, 0, 19, 20, 0, 0, 0, ! 0, 0, 22, 0, 281, 282, 347, 0, 0, 0, ! 0, 25, 0, 283, 0, 0, 0, 0, 0, 0, ! 28, 0, 0, 136, 137, 0, 284, 0, 0, 0, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, ! 0, 305, 306, 307, 308, 0, 0, 0, 0, 309, ! 310, 273, 10, 11, 12, 0, 14, 507, 318, 319, ! 320, 0, 321, 16, 0, 0, 311, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 0, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 0, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 274, 31, 0, ! 0, 0, 387, 0, 0, 0, 0, 0, 338, 0, ! 0, 339, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 342, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 0, 346, 273, 10, 11, 12, 0, 14, 507, ! 318, 319, 320, 0, 321, 16, 0, 0, 0, 0, ! 347, 508, 0, 0, 0, 0, 0, 0, 0, 18, ! 322, 19, 0, 21, 0, 323, 324, 325, 22, 0, ! 326, 327, 328, 23, 329, 330, 0, 25, 0, 0, ! 0, 331, 332, 333, 334, 335, 28, 0, 0, 274, ! 31, 0, 0, 0, 387, 0, 0, 0, 0, 0, ! 338, 0, 0, 339, 0, 0, 0, 0, 0, 0, ! 0, 340, 341, 342, 0, 0, 0, 0, 343, 344, ! 345, 0, 0, 0, 346, 273, 10, 11, 12, 0, ! 14, 507, 318, 319, 320, 0, 321, 16, 0, 0, ! 0, 0, 347, 880, 0, 0, 0, 0, 0, 0, ! 0, 18, 322, 19, 0, 21, 0, 323, 324, 325, ! 22, 0, 326, 327, 328, 23, 329, 330, 0, 25, ! 0, 0, 0, 331, 332, 333, 334, 335, 28, 0, ! 0, 274, 31, 0, 0, 0, 387, 0, 0, 0, ! 0, 0, 338, 0, 0, 339, 0, 0, 0, 0, ! 0, 0, 0, 340, 341, 342, 0, 0, 0, 0, ! 343, 344, 345, 0, 0, 0, 346, 273, 10, 11, ! 12, 0, 14, 507, 318, 319, 320, 0, 321, 16, ! 0, 0, 0, 0, 347, 998, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 0, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 274, 31, 0, 0, 0, 387, 0, ! 0, 0, 0, 0, 338, 0, 0, 339, 0, 0, ! 0, 0, 0, 0, 0, 340, 341, 342, 0, 0, ! 0, 0, 343, 344, 345, 0, 0, 0, 346, 273, ! 10, 11, 12, 0, 14, 507, 318, 319, 320, 0, ! 321, 16, 0, 0, 0, 0, 347, 1018, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 0, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 274, 31, 0, 0, 0, ! 387, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 0, ! 346, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 347, 1262, ! 1591, 1592, 1593, 12, 175, 14, 317, 318, 319, 320, ! 0, 321, 16, 1594, 0, 1595, 1596, 1597, 1598, 1599, ! 1600, 1601, 1602, 1603, 1604, 17, 18, 322, 19, 20, ! 21, 0, 323, 324, 325, 22, 0, 326, 327, 328, ! 23, 329, 330, 1605, 25, 1606, 0, 0, 331, 332, ! 333, 334, 335, 28, 0, 0, 274, 1607, 1218, 0, ! 1608, 387, 0, 0, 0, 0, 0, 338, 0, 0, ! 339, 0, 0, 0, 0, 0, 0, 0, 340, 341, ! 342, 0, 0, 0, 0, 343, 344, 345, 0, 0, ! 0, 346, 0, 0, 0, 1609, 0, 0, 0, 1591, ! 1592, 1593, 12, 175, 14, 317, 318, 319, 320, 347, ! 321, 16, 1594, 0, 1595, 1596, 1597, 1598, 1599, 1600, ! 1601, 1602, 1603, 1604, 17, 18, 322, 19, 20, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 1605, 25, 1606, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 274, 1607, 0, 0, 1608, ! 387, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 0, ! 346, 0, 0, 0, 1609, 273, 10, 11, 12, 175, ! 14, 317, 318, 319, 320, 491, 321, 16, 347, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 18, 322, 19, 20, 21, 0, 323, 324, 325, ! 22, 0, 326, 327, 328, 23, 329, 330, 0, 25, ! 0, 695, 0, 331, 332, 333, 334, 335, 28, 0, ! 0, 274, 31, 0, 0, 0, 387, 0, 0, 0, ! 0, 0, 338, 0, 0, 1030, 0, 0, 0, 0, ! 0, 0, 0, 340, 341, 1031, 0, 0, 0, 0, ! 343, 344, 345, 0, 0, 0, 1032, 699, 147, 10, ! 11, 12, 175, 14, 317, 318, 319, 320, 491, 321, ! 16, 0, 0, 0, 347, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 18, 322, 19, 20, 21, 0, ! 323, 324, 325, 22, 0, 326, 327, 328, 23, 329, ! 330, 0, 25, 0, 695, 0, 331, 332, 333, 334, ! 335, 28, 0, 0, 30, 31, 0, 0, 0, 387, ! 0, 0, 0, 0, 0, 338, 0, 0, 1144, 0, ! 0, 0, 0, 0, 0, 0, 340, 341, 1145, 0, ! 0, 0, 0, 343, 344, 345, 0, 0, 0, 1146, ! 699, 273, 10, 11, 12, 0, 14, 317, 318, 319, ! 320, 0, 321, 16, 0, 0, 0, 347, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 20, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 695, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 274, 31, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 338, 0, ! 0, 1030, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 1031, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 0, 1032, 699, 147, 10, 11, 12, 0, 14, ! 317, 318, 319, 320, 0, 321, 16, 0, 0, 0, ! 347, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 18, 322, 19, 20, 21, 0, 323, 324, 325, 22, ! 0, 326, 327, 328, 23, 329, 330, 0, 25, 0, ! 695, 0, 331, 332, 333, 334, 335, 28, 0, 0, ! 30, 31, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 338, 0, 0, 1144, 0, 0, 0, 0, 0, ! 0, 0, 340, 341, 1145, 0, 0, 0, 0, 343, ! 344, 345, 0, 0, 0, 1146, 699, 273, 10, 11, ! 12, 0, 14, 317, 318, 319, 320, 0, 321, 16, ! 0, 0, 0, 347, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 20, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 274, 336, 0, 0, 0, 337, 0, ! 0, 0, 0, 0, 338, 0, 0, 339, 0, 0, ! 0, 0, 0, 0, 0, 340, 341, 342, 0, 0, ! 0, 0, 343, 344, 345, 0, 0, 0, 346, 273, ! 10, 11, 12, 0, 14, 317, 318, 319, 320, 0, ! 321, 16, 0, 0, 0, 0, 347, 0, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 20, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 274, 31, 0, 0, 0, ! 387, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 0, ! 346, 273, 10, 11, 12, 0, 14, 507, 318, 319, ! 320, 0, 321, 16, 0, 0, 0, 0, 347, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 20, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 0, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 274, 31, 0, ! 0, 0, 387, 0, 0, 0, 0, 0, 338, 0, ! 0, 631, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 632, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 0, 633, 273, 10, 11, 12, 0, 14, 507, ! 318, 319, 320, 0, 321, 16, 0, 0, 0, 0, ! 347, 0, 0, 0, 0, 0, 0, 0, 0, 18, ! 322, 19, 0, 21, 0, 323, 324, 325, 22, 0, ! 326, 327, 328, 23, 329, 330, 0, 25, 0, 0, ! 0, 331, 332, 333, 334, 335, 28, 0, 0, 274, ! 31, 0, 0, 1654, 387, 0, 0, 0, 0, 0, ! 338, 0, 0, 339, 0, 0, 0, 0, 0, 0, ! 0, 340, 341, 342, 0, 0, 0, 0, 343, 344, ! 345, 0, 0, 0, 346, 273, 10, 11, 12, 175, ! 14, 317, 318, 319, 320, 0, 321, 16, 0, 0, ! 0, 0, 347, 0, 0, 0, 0, 0, 0, 0, ! 0, 18, 322, 19, 20, 21, 0, 323, 324, 325, ! 22, 0, 326, 327, 328, 23, 329, 330, 0, 25, ! 0, 0, 0, 331, 332, 333, 334, 335, 28, 0, ! 0, 274, 31, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 338, 0, 0, 339, 0, 0, 0, 0, ! 0, 0, 0, 340, 341, 342, 0, 0, 0, 0, ! 343, 344, 345, 0, 0, 0, 346, 147, 10, 11, ! 12, 0, 14, 507, 318, 319, 320, 0, 321, 16, ! 0, 0, 0, 0, 347, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 322, 19, 20, 21, 0, 323, ! 324, 325, 22, 0, 326, 327, 328, 23, 329, 330, ! 0, 25, 0, 0, 0, 331, 332, 333, 334, 335, ! 28, 0, 0, 30, 31, 0, 0, 0, 387, 0, ! 0, 0, 0, 0, 338, 0, 0, 1715, 0, 0, ! 0, 0, 0, 0, 0, 340, 341, 1716, 0, 0, ! 0, 0, 343, 344, 345, 0, 0, 0, 1717, 273, ! 10, 11, 12, 0, 14, 507, 318, 319, 320, 0, ! 321, 16, 0, 0, 0, 0, 347, 0, 0, 0, ! 0, 0, 0, 0, 0, 18, 322, 19, 0, 21, ! 0, 323, 324, 325, 22, 0, 326, 327, 328, 23, ! 329, 330, 0, 25, 0, 0, 0, 331, 332, 333, ! 334, 335, 28, 0, 0, 274, 31, 0, 0, 0, ! 337, 0, 0, 0, 0, 0, 338, 0, 0, 339, ! 0, 0, 0, 0, 0, 0, 0, 340, 341, 342, ! 0, 0, 0, 0, 343, 344, 345, 0, 0, 0, ! 346, 273, 10, 11, 12, 0, 14, 507, 318, 319, ! 320, 0, 321, 16, 0, 0, 0, 0, 347, 0, ! 0, 0, 0, 0, 0, 0, 0, 18, 322, 19, ! 0, 21, 0, 323, 324, 325, 22, 0, 326, 327, ! 328, 23, 329, 330, 0, 25, 0, 0, 0, 331, ! 332, 333, 334, 335, 28, 0, 0, 274, 31, 645, ! 0, 0, 0, 0, 0, 0, 0, 0, 338, 0, ! 0, 339, 0, 0, 0, 0, 0, 0, 0, 340, ! 341, 342, 0, 0, 0, 0, 343, 344, 345, 0, ! 0, 0, 646, 273, 10, 11, 12, 0, 14, 507, ! 318, 319, 320, 0, 321, 16, 0, 0, 0, 0, ! 347, 0, 0, 0, 0, 0, 0, 0, 0, 18, ! 322, 19, 0, 21, 0, 323, 324, 325, 22, 0, ! 326, 327, 328, 23, 329, 330, 0, 25, 0, 0, ! 0, 331, 332, 333, 334, 335, 28, 0, 0, 274, ! 31, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 338, 0, 0, 339, 0, 0, 0, 0, 0, 0, ! 0, 340, 341, 342, 0, 0, 0, 0, 343, 344, ! 345, 0, 0, 0, 346, 683, 273, 10, 11, 12, ! 0, 14, 507, 318, 319, 320, 0, 321, 16, 0, ! 0, 0, 347, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 18, 322, 19, 0, 21, 0, 323, 324, ! 325, 22, 0, 326, 327, 328, 23, 329, 330, 0, ! 25, 0, 0, 0, 331, 332, 333, 334, 335, 28, ! 0, 0, 274, 31, 0, 0, 0, 387, 0, 0, ! 0, 0, 0, 338, 0, 0, 339, 0, 0, 0, ! 0, 0, 0, 0, 340, 341, 342, 0, 0, 0, ! 0, 343, 344, 345, 0, 0, 0, 346, 273, 10, ! 11, 12, 0, 14, 507, 318, 319, 320, 0, 321, ! 16, 0, 0, 0, 0, 347, 0, 0, 0, 0, ! 0, 0, 0, 0, 18, 322, 19, 20, 21, 0, ! 323, 324, 325, 22, 0, 326, 327, 328, 23, 329, ! 330, 0, 25, 0, 0, 0, 331, 332, 333, 334, ! 335, 28, 0, 0, 274, 31, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 338, 0, 0, 631, 0, ! 0, 0, 0, 0, 0, 0, 340, 341, 632, 0, ! 0, 0, 0, 343, 344, 345, 0, 0, 0, 633, ! 1283, 10, 11, 12, 0, 14, 507, 318, 319, 320, ! 0, 321, 16, 0, 0, 0, 0, 347, 0, 0, ! 0, 0, 0, 0, 0, 0, 18, 322, 19, 0, ! 21, 0, 323, 324, 325, 22, 0, 326, 327, 328, ! 23, 329, 330, 0, 25, 0, 0, 0, 331, 332, ! 333, 334, 335, 28, 0, 0, 274, 31, 0, 0, ! 0, 387, 0, 0, 0, 0, 0, 338, 0, 0, ! 339, 0, 0, 0, 0, 0, 0, 0, 340, 341, ! 342, 0, 0, 0, 0, 343, 344, 345, 0, 0, ! 0, 346, 147, 10, 11, 12, 0, 14, 317, 318, ! 319, 320, 0, 321, 16, 0, 0, 0, 0, 347, ! 0, 0, 0, 0, 0, 0, 0, 0, 18, 322, ! 19, 20, 21, 0, 323, 324, 325, 22, 0, 326, ! 327, 328, 23, 329, 330, 0, 25, 0, 0, 0, ! 331, 332, 333, 334, 335, 28, 0, 0, 30, 31, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 338, ! 0, 0, 1715, 0, 0, 0, 0, 0, 0, 0, ! 340, 341, 1716, 0, 0, 0, 0, 343, 344, 345, ! 0, 0, 0, 1717, 273, 10, 11, 12, 0, 14, ! 507, 318, 319, 320, 0, 321, 16, 0, 0, 0, ! 0, 347, 0, 0, 0, 0, 0, 0, 0, 0, ! 18, 322, 19, 0, 21, 0, 323, 324, 325, 22, ! 0, 326, 327, 328, 23, 329, 330, 0, 25, 0, ! 0, 0, 331, 332, 333, 334, 335, 28, 0, 0, ! 274, 31, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 338, 0, 0, 339, 0, 0, 0, 0, 0, ! 0, 0, 340, 341, 342, 0, 0, 0, 0, 343, ! 344, 345, 0, 0, 0, 346, 273, 10, 11, 12, ! 0, 14, 507, 318, 319, 320, 0, 321, 16, 0, ! 0, 0, 0, 347, 0, 0, 0, 0, 0, 0, ! 0, 0, 18, 322, 19, 0, 21, 0, 323, 324, ! 325, 22, 0, 326, 327, 328, 23, 329, 330, 0, ! 25, 0, 0, 0, 331, 332, 333, 334, 335, 28, ! 0, 0, 274, 31, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 338, 0, 0, 339, 0, 0, 0, ! 0, 0, 0, 0, 340, 341, 342, 0, 0, 0, ! 0, 343, 344, 345, 0, 0, 0, 705, 273, 10, ! 11, 12, 0, 14, 507, 318, 319, 320, 0, 321, ! 16, 0, 0, 0, 0, 347, 0, 0, 0, 0, ! 0, 0, 0, 0, 18, 322, 19, 0, 21, 0, ! 323, 324, 325, 22, 0, 326, 327, 328, 23, 329, ! 330, 0, 25, 0, 0, 0, 331, 332, 333, 334, ! 335, 28, 0, 0, 274, 31, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 338, 0, 0, 339, 147, ! 10, 11, 12, 214, 14, 215, 340, 341, 342, 0, ! 0, 16, 0, 343, 344, 345, 0, 0, 0, 707, ! 0, 0, 0, 0, 0, 18, 0, 19, 20, 0, ! 0, 0, 0, 0, 22, 0, 0, 347, 0, 23, ! 0, 0, 0, 25, 0, 147, 10, 11, 12, 175, ! 14, 15, 28, 0, 0, 30, 31, 16, 0, 1671, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, ! 0, 18, 0, 19, 20, 0, 0, 0, 0, 34, ! 22, 0, 0, 0, 35, 23, 0, 0, 0, 25, ! 36, 147, 10, 11, 12, 214, 14, 215, 28, 0, ! 0, 30, 31, 16, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 33, 0, 18, 0, 19, ! 20, 0, 0, 0, 0, 34, 22, 0, 0, 0, ! 35, 23, 0, 0, 0, 25, 36, 0, 0, 0, ! 0, 0, 0, 0, 28, 0, 0, 30, 31, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 33, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 34, 0, 0, 0, 0, 35, 0, 0, 746, ! 0, 0, 36, 747, 748, 749, 750, 751, 752, 753, ! 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, ! 764, 765, 766, 767, 768, 1209, 0, 0, 0, 747, ! 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, ! 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, ! 768, 1759, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, ! 765, 766, 767, 768, 747, 748, 749, 750, 751, 752, ! 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, ! 763, 764, 765, 766, 767, 768 }; static const short yycheck[] = { ! 16, 6, 182, 6, 486, 169, 84, 749, 24, 183, ! 25, 51, 218, 184, 426, 426, 822, 368, 820, 157, ! 158, 6, 132, 198, 554, 354, 374, 97, 164, 99, ! 987, 89, 374, 38, 729, 38, 643, 366, 367, 882, ! 80, 1433, 426, 426, 47, 254, 394, 6, 6, 47, ! 468, 257, 394, 38, 909, 71, 139, 140, 6, 62, ! 915, 47, 47, 6, 396, 908, 84, 248, 796, 1440, ! 16, 914, 218, 76, 152, 139, 146, 1551, 140, 38, ! 38, 130, 228, 227, 228, 6, 89, 47, 47, 47, ! 38, 94, 504, 504, 97, 38, 99, 802, 1176, 47, ! 1178, 12, 1556, 12, 47, 65, 12, 313, 1186, 804, ! 1556, 114, 33, 34, 130, 47, 47, 38, 6, 60, ! 62, 34, 6, 1610, 39, 1, 47, 56, 62, 3, ! 535, 1763, 9, 12, 212, 1626, 1795, 0, 263, 142, ! 156, 87, 145, 146, 94, 1, 89, 76, 499, 1623, ! 38, 13, 557, 36, 38, 1698, 1647, 142, 1817, 510, ! 13, 62, 368, 47, 1796, 525, 0, 113, 89, 111, ! 173, 1026, 1663, 533, 177, 173, 110, 56, 1021, 177, ! 1023, 184, 222, 142, 95, 61, 65, 64, 173, 65, ! 1, 177, 177, 0, 142, 198, 111, 1719, 111, 142, ! 62, 110, 76, 65, 110, 61, 62, 1729, 1730, 62, ! 1697, 143, 65, 1756, 173, 65, 76, 177, 177, 177, ! 223, 142, 98, 63, 50, 173, 76, 1701, 1719, 177, ! 173, 110, 248, 249, 177, 198, 157, 158, 1729, 1730, ! 56, 142, 183, 114, 49, 177, 177, 263, 110, 374, ! 61, 49, 173, 1775, 65, 198, 177, 94, 218, 143, ! 76, 279, 1457, 1458, 49, 1739, 62, 227, 228, 394, ! 49, 111, 49, 1230, 157, 158, 159, 198, 1732, 1474, ! 363, 202, 203, 184, 1775, 173, 1732, 98, 28, 94, ! 49, 821, 32, 177, 110, 49, 94, 257, 76, 363, ! 76, 359, 1776, 49, 56, 1827, 94, 56, 378, 94, ! 446, 314, 476, 259, 110, 94, 95, 94, 95, 63, ! 61, 204, 338, 63, 76, 110, 66, 76, 199, 1524, ! 76, 110, 36, 110, 3, 94, 1827, 6, 1533, 1534, ! 94, 1536, 1047, 346, 1199, 1050, 1201, 109, 94, 95, ! 13, 110, 223, 313, 416, 1198, 359, 1200, 99, 408, ! 26, 49, 1733, 32, 110, 435, 369, 383, 1096, 1761, ! 62, 111, 553, 63, 43, 378, 379, 63, 62, 395, ! 518, 519, 724, 56, 49, 521, 532, 531, 532, 63, ! 59, 60, 408, 77, 379, 1473, 540, 815, 816, 62, ! 1105, 1106, 65, 66, 73, 789, 94, 95, 368, 3, ! 4, 5, 556, 94, 83, 56, 359, 1260, 110, 88, ! 379, 111, 110, 426, 65, 94, 429, 32, 374, 94, ! 95, 379, 435, 63, 65, 109, 379, 111, 359, 1634, ! 1635, 26, 7, 28, 76, 110, 778, 26, 394, 8, ! 9, 1408, 3, 157, 158, 159, 15, 26, 379, 28, ! 4, 5, 4, 5, 608, 59, 60, 470, 1163, 110, ! 430, 61, 470, 32, 39, 545, 61, 94, 379, 38, ! 65, 111, 61, 426, 470, 470, 65, 428, 47, 83, ! 49, 1346, 61, 1100, 497, 62, 65, 500, 62, 62, ! 204, 504, 46, 543, 1359, 426, 49, 989, 6, 49, ! 470, 470, 56, 98, 56, 59, 60, 59, 60, 98, ! 49, 77, 470, 79, 487, 56, 66, 470, 49, 98, ! 1, 73, 3, 4, 5, 94, 56, 553, 56, 499, ! 38, 83, 545, 110, 56, 615, 110, 110, 49, 470, ! 56, 94, 95, 95, 94, 496, 76, 498, 499, 4, ! 5, 504, 56, 688, 9, 94, 95, 110, 49, 1274, ! 1275, 531, 532, 94, 95, 56, 50, 56, 49, 1422, ! 540, 110, 76, 504, 77, 56, 65, 32, 59, 60, ! 61, 62, 717, 94, 95, 76, 556, 518, 519, 1, ! 49, 3, 4, 5, 49, 110, 3, 4, 5, 6, ! 1453, 56, 615, 94, 59, 60, 1459, 620, 621, 622, ! 623, 624, 680, 94, 49, 26, 40, 28, 73, 645, ! 633, 56, 1475, 1476, 814, 518, 519, 520, 83, 1169, ! 643, 65, 56, 646, 49, 94, 43, 49, 608, 94, ! 95, 76, 76, 616, 56, 1498, 527, 59, 60, 56, ! 61, 1516, 59, 60, 65, 49, 62, 63, 190, 94, ! 1152, 1153, 688, 49, 49, 61, 679, 680, 56, 110, ! 66, 1487, 49, 65, 76, 1097, 1097, 896, 897, 94, ! 1038, 88, 94, 902, 76, 698, 1038, 98, 76, 1542, ! 1543, 717, 705, 786, 707, 1034, 709, 670, 12, 49, ! 94, 781, 675, 1097, 1097, 678, 679, 779, 94, 94, ! 95, 110, 1565, 1566, 786, 1568, 66, 94, 95, 935, ! 56, 867, 56, 110, 909, 110, 63, 680, 1220, 1221, ! 915, 885, 3, 4, 5, 1551, 709, 46, 111, 620, ! 76, 49, 76, 716, 94, 698, 49, 56, 49, 680, ! 59, 61, 99, 726, 842, 65, 709, 713, 49, 1299, ! 3, 787, 787, 733, 94, 696, 697, 698, 781, 650, ! 796, 3, 4, 5, 6, 26, 61, 28, 709, 50, ! 65, 732, 4, 5, 63, 905, 94, 9, 59, 60, ! 49, 94, 1150, 94, 49, 676, 821, 56, 1150, 76, ! 826, 1341, 683, 94, 518, 519, 520, 1623, 61, 9, ! 61, 43, 83, 13, 65, 1307, 65, 76, 699, 3, ! 4, 5, 6, 95, 837, 795, 49, 59, 60, 1682, ! 910, 911, 845, 913, 56, 94, 49, 59, 60, 94, ! 95, 1026, 94, 49, 795, 95, 1338, 98, 113, 49, ! 94, 73, 94, 66, 49, 110, 88, 76, 36, 43, ! 76, 83, 62, 62, 64, 65, 66, 49, 749, 62, ! 63, 94, 845, 95, 1235, 59, 60, 77, 906, 79, ! 1696, 94, 95, 12, 837, 1701, 859, 843, 94, 49, ! 1036, 65, 845, 906, 94, 95, 909, 910, 911, 94, ! 913, 65, 915, 1038, 835, 836, 837, 65, 1400, 94, ! 110, 906, 94, 56, 845, 885, 4, 5, 76, 86, ! 87, 61, 65, 1739, 1114, 65, 3, 4, 5, 6, ! 4, 5, 76, 76, 94, 1747, 110, 906, 906, 870, ! 871, 56, 62, 63, 837, 1697, 110, 1166, 1167, 1168, ! 65, 76, 845, 906, 4, 5, 909, 62, 63, 1451, ! 1776, 76, 915, 40, 41, 935, 43, 56, 3, 4, ! 5, 59, 60, 986, 76, 906, 110, 990, 909, 56, ! 158, 159, 59, 60, 915, 59, 60, 1135, 1136, 924, ! 925, 926, 1138, 13, 62, 906, 1144, 1145, 110, 1491, ! 62, 63, 56, 3, 4, 5, 56, 1020, 28, 59, ! 60, 88, 32, 1026, 1199, 1150, 1201, 990, 76, 1032, ! 76, 3, 4, 5, 59, 60, 204, 62, 110, 49, ! 111, 1004, 62, 1006, 65, 1008, 3, 4, 5, 6, ! 62, 63, 62, 63, 111, 65, 66, 77, 1800, 79, ! 50, 110, 1140, 4, 5, 110, 1082, 110, 9, 59, ! 60, 66, 3, 4, 5, 6, 1236, 1237, 50, 1239, ! 1096, 56, 66, 1026, 94, 95, 43, 59, 60, 1032, ! 65, 32, 1038, 83, 1097, 113, 1099, 1100, 28, 56, ! 110, 76, 59, 60, 110, 1026, 63, 110, 65, 1030, ! 1031, 1032, 43, 28, 110, 56, 73, 32, 59, 60, ! 76, 1084, 76, 994, 86, 87, 83, 56, 59, 60, ! 76, 88, 73, 837, 1137, 56, 113, 94, 3, 1179, ! 1180, 845, 83, 1146, 65, 62, 63, 62, 63, 1189, ! 1562, 1562, 1155, 94, 1097, 76, 1027, 88, 1176, 1122, ! 1178, 83, 84, 85, 86, 87, 1184, 110, 1186, 113, ! 56, 1346, 110, 1176, 1244, 1178, 1097, 56, 346, 65, ! 56, 1184, 110, 1186, 1359, 62, 65, 62, 63, 8, ! 76, 1176, 110, 1178, 1137, 94, 1199, 76, 1201, 76, ! 77, 1186, 79, 1146, 1150, 1221, 1209, 62, 62, 63, ! 49, 66, 62, 63, 1135, 1136, 1137, 1176, 1176, 1178, ! 1178, 76, 77, 1144, 1145, 1146, 63, 1186, 1186, 111, ! 1178, 66, 62, 1176, 94, 1178, 56, 111, 3, 4, ! 5, 1244, 1183, 1186, 76, 4, 5, 63, 38, 66, ! 376, 377, 1135, 1136, 1137, 1176, 1199, 1178, 1201, 66, ! 66, 1144, 1145, 1146, 110, 1186, 110, 1270, 1619, 3, ! 4, 5, 6, 32, 63, 1176, 110, 1178, 1199, 66, ! 1201, 66, 1183, 1184, 1299, 1186, 113, 62, 110, 457, ! 458, 1307, 1175, 1371, 59, 60, 61, 56, 77, 110, ! 59, 60, 110, 3, 4, 5, 77, 433, 434, 43, ! 77, 1314, 110, 77, 73, 77, 50, 3, 4, 5, ! 61, 65, 110, 1363, 83, 59, 60, 1270, 1810, 1369, ! 1370, 62, 28, 1373, 1374, 94, 32, 1377, 1301, 65, ! 1303, 1516, 1305, 1346, 110, 65, 95, 1268, 1269, 1270, ! 50, 519, 520, 1371, 88, 110, 1359, 110, 88, 59, ! 60, 113, 1380, 111, 50, 198, 62, 63, 890, 1240, ! 66, 1314, 110, 59, 60, 110, 1727, 1380, 76, 7, ! 8, 9, 49, 83, 113, 33, 34, 15, 36, 110, ! 113, 1312, 1313, 1314, 110, 1380, 110, 83, 110, 110, ! 3, 4, 5, 1346, 7, 8, 9, 110, 110, 1350, ! 38, 110, 1333, 1334, 62, 65, 1359, 65, 111, 47, ! 110, 1380, 1380, 71, 111, 1346, 63, 61, 76, 32, ! 110, 1135, 1136, 1137, 110, 38, 49, 1380, 1359, 66, ! 1144, 1145, 1146, 1617, 1447, 1619, 110, 1618, 94, 1350, ! 1468, 94, 94, 56, 94, 1473, 59, 60, 61, 1380, ! 3, 4, 5, 6, 632, 633, 1429, 111, 1484, 110, ! 1473, 1175, 3, 4, 5, 6, 89, 90, 646, 1380, ! 93, 94, 95, 96, 110, 8, 97, 110, 1473, 113, ! 110, 1531, 1532, 3, 4, 5, 110, 7, 8, 9, ! 43, 149, 105, 106, 107, 1508, 154, 50, 110, 157, ! 158, 159, 43, 1516, 1473, 1473, 59, 60, 113, 50, ! 110, 1727, 110, 110, 1395, 1396, 1397, 1398, 59, 60, ! 1473, 65, 62, 62, 56, 1406, 184, 705, 110, 707, ! 83, 709, 190, 110, 1724, 88, 110, 65, 1712, 59, ! 60, 1556, 1473, 1556, 202, 203, 204, 88, 113, 1562, ! 49, 3, 4, 5, 110, 1508, 110, 1583, 110, 110, ! 218, 1556, 1473, 1516, 66, 110, 34, 1715, 1716, 94, ! 228, 3, 4, 5, 110, 1506, 1507, 1508, 1604, 1605, ! 3, 4, 5, 6, 110, 1516, 110, 1556, 1556, 3, ! 4, 5, 6, 110, 730, 113, 110, 1610, 1556, 257, ! 110, 65, 65, 1556, 56, 1618, 63, 59, 60, 1562, ! 63, 9, 63, 17, 272, 1610, 111, 110, 1792, 110, ! 43, 1795, 61, 1673, 56, 1556, 49, 59, 60, 43, ! 63, 1562, 94, 56, 1660, 1661, 59, 60, 94, 63, ! 1814, 1610, 1610, 1817, 487, 59, 60, 66, 56, 1619, ! 73, 94, 1610, 18, 109, 313, 314, 1610, 104, 837, ! 83, 63, 56, 110, 63, 88, 1617, 845, 1619, 805, ! 110, 94, 95, 63, 88, 1556, 63, 63, 1691, 1610, ! 62, 859, 94, 1709, 1697, 1698, 66, 113, 346, 110, ! 3, 4, 5, 871, 872, 337, 63, 3, 4, 5, ! 1750, 1674, 1697, 110, 1717, 3, 4, 5, 63, 7, ! 368, 369, 12, 34, 110, 94, 63, 1732, 63, 1732, ! 63, 63, 1603, 83, 84, 85, 86, 87, 1697, 1697, ! 3, 4, 5, 110, 3, 4, 5, 1732, 1691, 1697, ! 0, 39, 178, 1756, 1697, 1698, 59, 60, 3, 38, ! 4, 5, 1778, 59, 60, 9, 1661, 1727, 56, 1097, ! 1691, 59, 60, 1732, 1732, 779, 1697, 1698, 177, 470, ! 173, 429, 430, 616, 1732, 1656, 1723, 1728, 1299, 1732, ! 1184, 1674, 101, 56, 1715, 1716, 59, 60, 61, 447, ! 59, 60, 450, 929, 145, 1646, 1082, 316, 456, 457, ! 458, 1732, 56, 1756, 462, 59, 60, 826, 1341, 739, ! 1691, 1169, 4, 5, 1184, 1380, 1697, 1698, 1470, 73, ! 1352, 1353, 1715, 1716, 1717, 1756, 741, 670, 149, 83, ! 680, 209, 675, 154, 363, 678, 679, 130, 1053, 497, ! 32, 499, 500, 1551, 1488, 4, 5, 1379, 3, 4, ! 5, 1732, 1384, 1031, 1032, 513, 1732, 49, 516, 637, ! 518, 519, 520, 854, 56, 1747, 524, 59, 60, 3, ! 4, 5, 530, 716, 532, 1756, 1744, 535, -1, 1794, ! 1447, 73, 203, 726, -1, -1, -1, 4, 5, 1770, ! -1, 83, 9, 4, 5, 50, -1, 56, 556, 557, ! 59, 60, 94, 95, 59, 60, -1, -1, -1, 1790, ! -1, -1, -1, -1, 73, 32, 50, -1, -1, 1800, ! -1, 32, 8, 9, 83, 59, 60, -1, -1, 15, ! -1, 1463, 1464, -1, 1466, 1467, -1, 1469, 49, 56, ! 1821, -1, 59, 60, -1, 56, 32, -1, 59, 60, ! 608, 272, 38, 1089, -1, -1, 73, -1, 1136, 1137, ! 1674, 47, 73, -1, -1, -1, 83, 1145, 1146, -1, ! -1, -1, 83, 631, 632, 633, 365, 94, -1, 368, ! 369, -1, -1, 94, 95, -1, -1, -1, 646, 1521, ! 1522, -1, -1, -1, -1, -1, -1, 1175, 3, 4, ! 5, 1715, 1716, 1717, -1, -1, 648, 649, -1, 651, ! 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, ! 662, 663, 664, 665, 666, 667, 668, 3, 4, 5, ! 6, -1, -1, 3, 4, 5, 6, -1, 696, 697, ! 698, -1, 1574, 1575, 1576, -1, -1, 705, -1, 707, ! -1, 709, -1, -1, 59, 60, -1, 1193, 1194, 1195, ! -1, -1, 32, -1, -1, -1, -1, 43, -1, -1, ! -1, -1, -1, 43, 50, 733, 4, 5, -1, 49, ! -1, 9, -1, 59, 60, -1, 56, -1, -1, 59, ! 60, 1269, 1270, 3, 4, 5, -1, -1, -1, 1631, ! 1632, -1, -1, 73, 32, -1, -1, 496, -1, 498, ! 499, 500, 88, 83, 3, 4, 5, 6, 88, -1, ! 9, -1, -1, -1, 94, 95, 447, -1, 56, 450, ! -1, 59, 60, -1, -1, 1313, 1314, 795, 796, -1, ! -1, 462, 60, 32, -1, 73, 56, 990, -1, 59, ! 60, -1, 4, 5, 43, 83, -1, 9, -1, -1, ! 49, 1004, -1, 1006, -1, 1008, 94, 56, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, 835, 836, 837, ! 32, 3, 4, 5, 73, -1, -1, 845, 3, 4, ! 5, -1, 513, -1, 83, 516, -1, 49, -1, 88, ! -1, 859, -1, -1, 56, 94, 95, 59, 60, 530, ! 868, 869, 870, 871, 872, 7, 8, 9, 876, -1, ! -1, 73, -1, 15, -1, -1, -1, 3, 4, 5, ! 6, 83, 890, 9, -1, -1, 1768, 59, 60, -1, ! 32, 1084, 94, 95, 59, 60, 38, 81, 82, 83, ! 84, 85, 86, 87, -1, 47, 32, -1, -1, -1, ! 7, 8, 9, -1, -1, 183, -1, 43, 15, 3, ! 4, 5, 6, 49, -1, 9, 6, 935, -1, 1122, ! 56, -1, 1418, 59, 60, 32, 16, -1, 3, 4, ! 5, 38, -1, -1, -1, -1, 26, 73, 32, -1, ! 47, -1, -1, 33, 34, -1, 36, 83, 38, 43, ! -1, -1, 88, -1, 232, 49, 63, 47, 94, 95, ! -1, -1, 56, 4, 5, 59, 60, -1, 9, -1, ! 60, -1, 62, -1, -1, -1, -1, -1, -1, 73, ! -1, 71, 4, 5, 59, 60, 76, 9, -1, 83, ! -1, 32, 1010, -1, 88, 1013, -1, 87, -1, 89, ! 94, 95, -1, -1, 94, -1, 1024, 97, 49, 99, ! 32, -1, 1030, 1031, 1032, 56, -1, -1, 59, 60, ! -1, -1, -1, 113, -1, -1, -1, 49, -1, -1, ! 4, 5, 73, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, 83, -1, -1, -1, 795, -1, -1, -1, ! 140, 73, 142, 94, 95, 145, 146, -1, 148, 149, ! -1, 83, -1, 153, 154, -1, -1, 157, 158, 159, ! -1, -1, 94, 95, -1, 49, -1, -1, 1096, -1, ! -1, -1, 56, 173, -1, 59, 60, 177, -1, -1, ! -1, -1, -1, 183, 184, -1, -1, -1, 1301, 73, ! 1303, 1103, 1305, -1, -1, 3, 4, 5, 6, 83, ! -1, 9, 202, 203, 204, 1133, 1134, 1135, 1136, 1137, ! 94, 95, -1, -1, 1142, -1, 1144, 1145, 1146, -1, ! -1, -1, -1, -1, 32, -1, 1674, -1, 1156, 1157, ! 1158, -1, 232, -1, -1, 43, -1, -1, 4, 5, ! 428, 49, -1, 9, -1, 836, -1, 1175, 56, 249, ! -1, 59, 60, -1, -1, -1, 1184, -1, -1, 259, ! -1, -1, -1, -1, -1, 73, 32, -1, 1716, 1717, ! -1, -1, 272, -1, -1, 83, 935, 868, 869, -1, ! 88, -1, -1, 49, -1, 876, 94, 95, -1, -1, ! 56, -1, -1, 59, 60, -1, 3, 4, 5, 6, ! -1, -1, 9, -1, -1, -1, -1, 73, 496, -1, ! 498, 499, 1224, -1, 314, 315, 1429, 83, 3, 4, ! 5, 6, -1, -1, 512, 32, -1, -1, 94, 95, ! -1, -1, -1, 521, -1, -1, 43, 525, -1, -1, ! 1268, 1269, 1270, -1, -1, 533, -1, 32, -1, 56, ! 1009, -1, 59, 60, -1, -1, -1, -1, 43, 359, ! -1, -1, -1, 363, 49, 365, 73, -1, 368, 369, ! -1, 56, -1, -1, 59, 60, 83, 1036, 378, 379, ! -1, 88, 1310, 1311, 1312, 1313, 1314, 94, 73, 1317, ! 81, 82, 83, 84, 85, 86, 87, -1, 83, -1, ! -1, -1, -1, 88, -1, 1333, 1334, 1335, -1, 94, ! 95, -1, 4, 5, -1, -1, 416, 9, -1, -1, ! -1, -1, -1, -1, 1352, 1353, 426, -1, 428, 429, ! -1, -1, -1, -1, -1, 435, -1, 437, -1, 84, ! 32, -1, -1, -1, -1, -1, -1, 447, -1, -1, ! 450, 1379, 3, 4, 5, 6, 1384, 49, -1, -1, ! -1, -1, 462, -1, 56, -1, 111, 59, 60, -1, ! 470, -1, -1, 1132, -1, -1, -1, -1, -1, 1138, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, 40, ! 41, 83, 43, -1, 139, -1, 496, 497, 498, 499, ! 500, -1, 94, 95, 504, 56, -1, 152, 59, 60, ! -1, -1, 512, 513, 1442, 1443, 516, 1445, 518, 519, ! 520, 521, -1, -1, -1, 525, -1, -1, -1, -1, ! 530, -1, -1, 533, -1, 1463, 1464, -1, 1466, 1467, ! -1, 1469, 1133, 1134, 732, 545, -1, -1, -1, -1, ! -1, 1142, 3, 4, 5, 6, 79, 80, 81, 82, ! 83, 84, 85, 86, 87, -1, -1, 212, -1, 569, ! -1, -1, 3, 4, 5, 6, -1, -1, 1506, 1507, ! 1508, 3, 4, 5, -1, 7, 8, 9, -1, 40, ! 41, 1250, 43, 1521, 1522, -1, -1, -1, -1, 1258, ! -1, 32, -1, 248, -1, 56, -1, 795, 59, 60, ! 32, -1, 43, 613, -1, 615, 38, -1, 49, -1, ! -1, 621, 622, 623, 624, 56, -1, -1, 59, 60, ! -1, 7, 8, 9, 279, -1, -1, 59, 60, 15, ! -1, -1, 73, 643, -1, -1, 1574, 1575, 1576, -1, ! 1309, -1, 83, -1, -1, -1, 32, 88, -1, 1318, ! -1, 6, 38, 94, 95, 3, 4, 5, 6, -1, ! -1, 47, -1, -1, -1, -1, 864, -1, -1, 867, ! 680, -1, 682, 3, 4, 5, 6, 63, -1, 9, ! 1618, 1619, -1, 38, 694, 883, 696, 697, 698, -1, ! -1, -1, 47, 1631, 1632, 43, -1, -1, -1, 709, ! -1, -1, 32, 713, -1, 60, -1, 62, 56, 1310, ! 1311, 59, 60, 43, -1, 63, 1317, -1, 373, 49, ! -1, -1, 732, -1, -1, 73, 56, -1, -1, 59, ! 60, -1, -1, -1, -1, 83, 1674, -1, 393, -1, ! 88, -1, -1, 73, -1, -1, 94, -1, -1, -1, ! -1, -1, -1, 83, 3, 4, 5, 6, 88, -1, ! 9, -1, -1, -1, 94, 95, -1, -1, -1, 779, ! -1, 781, -1, -1, -1, -1, 786, 1715, 1716, 1717, ! -1, -1, -1, 32, 439, 795, 796, 142, -1, 1727, ! -1, -1, -1, 148, 43, -1, 3, 4, 5, 6, ! 49, -1, -1, -1, -1, -1, -1, 56, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, -1, 173, -1, ! -1, -1, 177, -1, 73, 835, 836, 837, 183, 184, ! 1768, -1, -1, 843, 83, 845, 43, -1, -1, 88, ! 1509, 1510, -1, 50, -1, 94, 95, -1, -1, -1, ! -1, -1, 59, 60, 864, -1, -1, 867, 868, 869, ! 870, 871, 872, -1, -1, -1, 876, -1, -1, -1, ! -1, -1, -1, 883, -1, -1, 83, 232, -1, -1, ! -1, 88, -1, 4, 5, -1, -1, 8, 9, 3, ! 4, 5, 6, -1, 15, 1564, 906, -1, 553, 909, ! 910, 911, -1, 913, -1, 915, -1, -1, 29, -1, ! 31, 32, 68, -1, 924, 925, 926, 38, 32, -1, ! -1, -1, -1, -1, -1, 935, 47, -1, -1, 43, ! -1, -1, -1, -1, 1132, 56, -1, -1, 59, 60, ! 1138, -1, 56, -1, -1, 59, 60, 1, -1, 3, ! 4, 5, 6, 7, 8, 9, 611, -1, -1, 73, ! -1, 15, -1, -1, -1, -1, -1, -1, -1, 83, ! -1, -1, -1, 94, 88, 29, 986, 31, 32, 33, ! 94, -1, -1, -1, 38, 1183, -1, -1, -1, 43, ! -1, -1, 148, 47, -1, -1, 50, -1, -1, 1009, ! 1010, -1, 56, 1013, -1, 59, 60, -1, 164, -1, ! 1020, -1, -1, -1, 1024, -1, 1026, 202, 203, 73, ! 1030, 1031, 1032, -1, 379, -1, 1036, -1, 1038, 83, ! -1, -1, -1, -1, 88, -1, -1, -1, 693, -1, ! 94, -1, -1, -1, -1, 99, 1, -1, 3, 4, ! 5, 6, -1, 8, -1, -1, -1, 712, -1, -1, ! -1, -1, -1, -1, -1, 221, -1, -1, -1, -1, ! -1, -1, -1, 428, 230, -1, -1, -1, -1, -1, ! -1, -1, 437, -1, -1, -1, -1, 1097, 43, 1099, ! 1100, 247, -1, -1, -1, 50, -1, 3, 4, 5, ! 6, 56, 258, -1, 59, 60, -1, -1, -1, -1, ! -1, 1309, -1, -1, -1, 470, -1, -1, -1, -1, ! 1318, -1, 1132, 1133, 1134, 1135, 1136, 1137, 1138, -1, ! -1, -1, 1142, 88, 1144, 1145, 1146, 43, 1336, 1337, ! 1150, 496, 497, 498, 499, 1155, 1156, 1157, 1158, 504, ! 56, -1, 1350, 59, 60, -1, -1, 512, -1, 65, ! -1, -1, 1172, -1, -1, 1175, 1176, 73, 1178, -1, ! 525, -1, -1, 1183, 1184, -1, 1186, 83, 533, -1, ! -1, -1, 88, -1, -1, -1, -1, 842, 94, 1199, ! -1, 1201, -1, -1, -1, -1, -1, -1, -1, 1209, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, 3, ! 4, 5, 6, -1, 569, -1, -1, -1, 873, 4, ! 5, -1, 7, 8, 9, -1, 1236, 1237, 13, 1239, ! 15, -1, -1, -1, 1244, -1, 3, 4, 5, 6, ! 1250, -1, -1, -1, 29, -1, 31, 32, 1258, 43, ! -1, 1449, -1, 38, -1, -1, 50, -1, 1268, 1269, ! 1270, -1, 47, -1, 49, 59, 60, 1465, -1, -1, ! -1, 56, 927, -1, 59, 60, 43, -1, -1, -1, ! -1, 437, -1, 50, -1, -1, -1, -1, 73, 83, ! 446, -1, 59, 60, 88, -1, -1, -1, 83, 1309, ! 1310, 1311, 1312, 1313, 1314, -1, -1, 1317, 1318, 94, ! 95, 1509, 1510, -1, -1, -1, 83, 3, 4, 5, ! 6, 88, 478, 1333, 1334, 1335, 1336, 1337, 513, -1, ! -1, 516, -1, 518, 519, -1, 1346, -1, -1, -1, ! 1350, -1, -1, -1, -1, 530, -1, -1, -1, 1359, ! -1, -1, -1, -1, -1, -1, 512, 43, -1, -1, ! -1, -1, 1372, -1, 50, 521, 1564, -1, -1, -1, ! 1380, 6, -1, 59, 60, -1, -1, 732, -1, -1, ! -1, 16, 1037, -1, 1039, -1, 542, -1, -1, -1, ! 25, 26, -1, -1, -1, -1, -1, 83, 33, 34, ! -1, 36, 88, 38, -1, -1, -1, -1, -1, -1, ! -1, -1, 47, 569, -1, -1, -1, -1, -1, 1617, ! -1, 1619, -1, -1, -1, 60, -1, 62, -1, -1, ! -1, -1, 1442, 1443, -1, 1445, 71, 1447, -1, 1449, ! 795, 76, -1, -1, -1, -1, 3, 4, 5, 6, ! -1, -1, -1, -1, 89, 1465, -1, -1, -1, 94, ! 1470, -1, 97, 1473, 99, 73, 74, 75, 76, 77, ! 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, ! 3, 4, 5, 6, -1, 1140, 43, -1, 1143, -1, ! -1, -1, -1, 50, -1, -1, 1506, 1507, 1508, 1509, ! 1510, -1, 59, 60, -1, -1, 1516, 142, -1, 864, ! 145, 146, -1, 148, 149, -1, -1, -1, -1, 154, ! 43, -1, 157, 158, 159, -1, 83, 50, 883, -1, ! 1728, 88, -1, -1, -1, -1, 59, 60, 173, -1, ! -1, -1, 177, -1, -1, -1, -1, -1, 183, 184, ! -1, 906, 1562, -1, 1564, -1, 1, -1, 3, 4, ! 5, 6, 7, 8, 9, 88, -1, 202, 203, 204, ! 15, -1, -1, -1, -1, -1, -1, 3, 4, 5, ! 6, 7, 8, 9, 29, -1, 31, 32, 33, 15, ! -1, -1, -1, 38, 39, -1, -1, 232, 43, -1, ! -1, -1, 47, 48, -1, 50, 32, 1617, 1618, 1619, ! -1, 56, 38, -1, 59, 60, -1, 43, 63, -1, ! 65, 47, -1, 49, -1, -1, -1, -1, 73, -1, ! 56, -1, -1, 59, 60, -1, -1, 272, 83, -1, ! -1, -1, -1, 88, -1, -1, -1, 73, -1, 94, ! 835, 836, -1, -1, -1, -1, -1, 83, -1, -1, ! -1, -1, 88, -1, 1674, -1, 111, -1, 94, 95, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 314, ! 315, -1, -1, 868, 869, 870, 871, -1, -1, -1, ! -1, 876, -1, -1, -1, -1, -1, -1, 4, 5, ! -1, -1, 8, 9, -1, 1715, 1716, 1717, 864, 15, ! -1, 867, -1, -1, -1, -1, 1371, -1, 1728, -1, ! -1, -1, -1, 29, 359, 31, 32, 883, 363, -1, ! 365, -1, 38, 368, 369, -1, -1, -1, -1, 374, ! -1, 47, -1, 378, 379, -1, -1, -1, -1, -1, ! 56, -1, -1, 59, 60, 61, -1, -1, -1, 394, -1, -1, -1, 3, 4, 5, 6, 7, 8, 9, ! -1, -1, -1, -1, -1, 15, -1, 1132, -1, -1, ! -1, 416, -1, -1, -1, -1, -1, -1, 94, 1444, ! -1, 426, 32, 428, 429, -1, -1, -1, 38, -1, ! 435, -1, 437, 43, -1, -1, -1, 47, -1, 49, ! -1, -1, 447, 1468, -1, 450, 56, -1, -1, 59, ! 60, 1176, -1, 1178, -1, -1, -1, 462, 1183, 1184, ! -1, 1186, -1, 73, -1, 470, -1, -1, -1, -1, ! -1, -1, -1, 83, -1, -1, -1, -1, 88, -1, ! -1, -1, -1, 1009, 94, 95, -1, -1, -1, 696, ! 697, 496, 497, 498, 499, 500, -1, -1, -1, 504, ! -1, -1, -1, 3, 4, 5, 6, 512, 513, 9, ! 1036, 516, -1, 518, 519, 520, 521, -1, -1, -1, ! 525, -1, -1, -1, -1, 530, -1, -1, 533, -1, ! -1, -1, 32, -1, -1, 3, 4, 5, 6, -1, ! 545, -1, -1, 43, -1, -1, -1, -1, -1, 554, ! -1, -1, -1, -1, -1, -1, 56, -1, -1, 59, ! 60, -1, -1, -1, 569, -1, -1, -1, -1, -1, ! -1, -1, -1, 73, -1, 43, -1, -1, 1133, 1134, ! 1135, 1136, 50, 83, 1309, -1, -1, 1142, 88, 1144, ! 1145, 59, 60, 1318, 94, -1, -1, -1, -1, -1, ! -1, 1156, 1157, 1158, -1, -1, 1132, -1, -1, -1, ! 615, -1, 1138, -1, -1, 83, 621, 622, 623, 624, ! 88, -1, -1, -1, -1, 1350, -1, -1, 835, 836, ! -1, 4, 5, -1, 7, 8, 9, -1, 643, -1, ! 13, -1, 15, -1, -1, -1, -1, -1, -1, -1, ! 3, 4, 5, 6, -1, 1380, 29, -1, 31, 32, ! -1, -1, -1, -1, -1, 38, -1, -1, -1, 3, ! 4, 5, 6, -1, 47, 680, 49, 682, -1, 32, ! -1, -1, -1, 56, -1, -1, 59, 60, -1, -1, ! 43, 696, 697, 698, -1, -1, -1, -1, -1, -1, ! 73, -1, -1, 56, 709, -1, 59, 60, -1, 43, ! 83, -1, 94, -1, -1, 97, 50, 99, -1, 724, ! 73, 94, 95, -1, 1250, 59, 60, 732, -1, -1, ! 83, -1, 1258, -1, -1, 88, -1, -1, -1, -1, ! 1465, 94, -1, -1, -1, 1470, -1, -1, 1473, 83, ! -1, -1, -1, -1, 88, 1310, 1311, 1312, 1313, -1, ! -1, -1, 1317, 145, 146, 3, 4, 5, 6, -1, ! -1, 9, -1, -1, 779, -1, 781, -1, 1333, 1334, ! -1, -1, 787, 1309, -1, -1, -1, -1, -1, -1, ! 795, 796, 1318, -1, 32, -1, -1, -1, -1, -1, ! -1, -1, -1, 1010, -1, 43, 1013, -1, -1, -1, ! 1336, 1337, -1, -1, -1, -1, 821, 1024, 56, -1, ! -1, 59, 60, 1030, 1031, -1, -1, -1, -1, -1, ! 835, 836, 837, -1, -1, 73, -1, -1, -1, -1, ! 845, -1, -1, -1, -1, 83, -1, -1, -1, -1, ! 88, -1, -1, -1, -1, -1, 94, -1, -1, 864, ! -1, -1, 867, 868, 869, 870, 871, 872, -1, -1, ! -1, 876, -1, -1, -1, -1, -1, -1, 883, -1, ! -1, -1, -1, -1, -1, -1, -1, 1442, 1443, -1, ! 1445, -1, 1617, 1618, 1619, -1, -1, -1, -1, -1, ! -1, 906, -1, -1, 909, 910, 911, -1, 913, -1, ! 915, -1, -1, -1, -1, -1, -1, -1, -1, 924, ! 925, 926, -1, 1449, -1, -1, 1133, 1134, 1135, 1136, ! 935, -1, -1, -1, -1, 1142, -1, 1144, 1145, -1, ! -1, 323, 324, -1, -1, -1, -1, -1, -1, -1, ! -1, 1506, 1507, -1, -1, 337, -1, 339, -1, -1, ! 342, 343, -1, -1, -1, -1, 348, -1, -1, -1, ! 352, -1, -1, 86, -1, -1, -1, -1, 360, -1, ! -1, 986, -1, 1509, 1510, -1, -1, -1, 3, 4, ! 5, 6, 7, 8, 9, -1, 378, -1, -1, -1, ! 15, -1, -1, 1728, 1009, 1010, -1, -1, 1013, -1, ! -1, -1, -1, -1, 29, 1020, 31, 32, 33, 1024, ! -1, 1026, -1, 38, -1, 1030, 1031, 1032, 43, -1, ! -1, 1036, 47, 1038, -1, 50, -1, -1, 1564, -1, ! -1, 56, -1, -1, 59, 60, -1, -1, -1, -1, ! -1, -1, -1, 435, 167, -1, -1, -1, 73, -1, ! -1, 1268, 1269, -1, -1, -1, -1, -1, 83, -1, ! -1, -1, -1, 88, -1, -1, -1, -1, -1, 94, ! -1, -1, -1, -1, 99, -1, -1, 200, -1, -1, ! -1, -1, 1097, -1, 1099, 1100, -1, -1, -1, -1, ! 213, -1, -1, 1310, 1311, 1312, 1313, -1, -1, -1, ! 1317, 72, 73, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, 1132, 1133, 1134, ! 1135, 1136, 1137, 1138, -1, -1, -1, 1142, -1, 1144, ! 1145, 1146, -1, -1, -1, 1150, -1, -1, -1, -1, ! 1155, 1156, 1157, 1158, 13, -1, -1, -1, -1, -1, ! 1715, 1716, -1, 545, 1169, -1, -1, 1172, -1, -1, ! 1175, 1176, -1, 1178, -1, -1, -1, -1, 1183, 1184, ! -1, 1186, 76, 77, 78, 79, 80, 81, 82, 83, ! 84, 85, 86, 87, 1199, -1, 1201, -1, -1, -1, ! -1, -1, -1, -1, 1209, -1, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! -1, 1236, 1237, 615, 1239, 1442, 1443, -1, 1445, 1244, ! -1, -1, -1, -1, -1, 1250, -1, -1, -1, 631, ! 632, -1, -1, 1258, -1, -1, -1, -1, -1, -1, ! -1, 643, -1, 1268, 1269, 1270, 648, 649, -1, 651, ! 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, ! 662, 663, 664, 665, 666, 667, 668, -1, 1, -1, ! -1, 4, 5, -1, 1299, 8, 9, -1, -1, 1506, ! 1507, -1, 15, -1, 1309, 1310, 1311, 1312, 1313, 1314, ! 4, 5, 1317, 1318, 8, 9, 29, -1, 31, 32, ! -1, 15, -1, -1, -1, 38, -1, -1, 1333, 1334, ! 1335, 1336, 1337, -1, 47, 29, 1341, 31, 32, -1, ! -1, 1346, 6, 56, 38, 1350, 59, 60, -1, -1, ! -1, -1, -1, 47, 1359, -1, -1, -1, -1, -1, ! -1, -1, 56, -1, -1, 59, 60, -1, 114, 33, ! 34, -1, 36, -1, 38, 1380, -1, -1, -1, -1, ! -1, -1, -1, 47, 76, -1, 78, 79, 80, 81, ! 82, 83, 84, 85, 86, 87, 60, -1, 62, 781, -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, ! 523, -1, -1, 15, -1, 528, -1, -1, -1, -1, ! 84, -1, -1, 87, -1, -1, -1, 29, -1, 31, ! 32, -1, -1, -1, -1, -1, 38, 1442, 1443, -1, ! 1445, 43, 1447, -1, 1449, 47, 559, -1, -1, -1, ! -1, -1, 198, 566, 56, -1, -1, 59, 60, -1, ! 1465, 63, -1, -1, -1, 1470, -1, -1, 1473, -1, ! -1, 73, -1, -1, -1, 139, 140, 223, 142, -1, ! -1, 83, -1, -1, 148, 149, 88, -1, 152, 153, ! 154, -1, 94, 157, 158, 159, 609, 610, -1, 612, ! 164, 1506, 1507, 1508, 1509, 1510, -1, -1, -1, 173, ! -1, 1516, -1, 177, 3, 4, 5, 6, -1, 183, ! 184, -1, 4, 5, -1, 7, 8, 9, 910, 911, ! -1, 913, -1, 15, -1, -1, -1, -1, 202, 203, ! 204, -1, -1, 32, -1, -1, -1, 29, 212, 31, ! 32, -1, -1, -1, 43, -1, 38, 1562, -1, 1564, ! -1, -1, -1, -1, -1, 47, -1, 56, 232, -1, ! 59, 60, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, 73, -1, -1, -1, 701, 702, ! -1, -1, -1, -1, 83, -1, -1, 710, -1, 88, ! 346, 1606, -1, -1, -1, 94, -1, -1, 272, -1, ! -1, -1, 1617, 1618, 1619, 279, 998, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 1, -1, 3, 4, ! 5, 6, 7, 8, 9, -1, -1, -1, -1, -1, ! 15, -1, -1, -1, -1, -1, -1, -1, 1030, 1031, ! -1, -1, -1, -1, 29, -1, 31, 32, 33, -1, ! -1, -1, -1, 38, 39, -1, -1, -1, 43, 1674, ! -1, -1, 47, 48, -1, 50, -1, -1, -1, -1, ! 426, 56, 346, -1, 59, 60, -1, -1, 63, -1, ! 65, -1, -1, -1, -1, -1, -1, -1, 73, 363, ! 3, 4, 5, 6, -1, -1, -1, -1, 83, 373, ! 1715, 1716, 1717, 88, -1, 379, -1, -1, 1100, 94, ! -1, 1103, -1, 1728, -1, -1, 839, -1, -1, 393, ! -1, 3, 4, 5, 6, -1, 111, 9, 75, 76, ! 43, 78, 79, 80, 81, 82, 83, 84, 85, 86, ! 87, -1, 416, 56, -1, -1, 59, 60, 504, -1, ! 32, 874, 1144, 1145, 428, -1, -1, -1, -1, -1, ! 73, 43, -1, 437, -1, 439, -1, -1, -1, -1, ! 83, -1, 446, 447, 56, 88, 450, 59, 60, -1, ! -1, 94, 456, 457, 458, -1, -1, -1, 462, -1, ! -1, 73, -1, 916, -1, 918, 470, -1, -1, -1, ! -1, 83, -1, -1, -1, -1, 88, -1, -1, -1, ! -1, -1, 94, -1, -1, -1, -1, -1, 3, 4, ! 5, 6, 496, 497, 498, 499, -1, -1, -1, -1, ! 504, -1, 1224, -1, -1, -1, -1, -1, 512, 513, ! -1, -1, 516, -1, 518, 519, 520, 521, -1, -1, ! 1242, 525, 1244, -1, -1, -1, 530, -1, 43, 533, ! -1, -1, -1, -1, 620, 621, 622, 623, 624, 992, ! 993, 56, 995, -1, 59, 60, -1, 633, -1, -1, 65, -1, -1, -1, -1, -1, -1, -1, 73, -1, ! 646, -1, -1, -1, -1, 569, -1, -1, 83, -1, ! -1, -1, 1025, 88, 72, 73, 74, 75, 76, 94, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, ! 6, -1, -1, 679, -1, 3, 4, 5, 6, 7, ! 8, 9, -1, -1, -1, -1, -1, 15, -1, -1, ! -1, -1, 698, -1, -1, -1, -1, 33, 34, 705, ! 36, 707, 38, 709, 32, -1, -1, 631, 632, 633, ! 38, 47, -1, -1, -1, 43, -1, -1, -1, 47, ! -1, 49, 646, -1, 60, -1, 62, -1, 56, -1, ! -1, 59, 60, 1, -1, 3, 4, 5, 6, 7, ! 8, 9, -1, -1, -1, 73, -1, 15, -1, -1, ! -1, 87, -1, -1, -1, 83, -1, -1, -1, -1, ! 88, 29, -1, 31, 32, 33, 94, -1, 1141, 693, ! 38, 39, -1, -1, -1, 43, -1, -1, -1, 47, ! 48, 705, 50, 707, -1, 709, -1, -1, 56, -1, ! -1, 59, 60, -1, -1, 63, -1, 65, -1, -1, ! 3, 4, 5, 6, -1, 73, 142, -1, 732, -1, ! -1, -1, 148, 149, -1, 83, -1, 153, 154, -1, ! 88, 157, 158, 159, -1, -1, 94, -1, -1, 32, ! -1, 837, -1, -1, -1, -1, -1, 173, -1, 845, ! 43, 177, -1, 111, -1, -1, -1, 183, 184, -1, ! -1, -1, -1, 56, -1, 779, 59, 60, -1, -1, ! -1, -1, 786, -1, -1, -1, 202, 203, 204, -1, ! 73, 795, 4, 5, -1, -1, 8, 9, -1, -1, ! 83, 1254, -1, 15, -1, 88, -1, -1, -1, -1, ! -1, 94, -1, -1, -1, -1, 232, 29, -1, 31, ! 32, -1, -1, 909, -1, -1, 38, -1, -1, 915, ! -1, 835, 836, 837, -1, 47, -1, 49, 842, 843, ! -1, 845, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, -1, 859, 272, -1, -1, -1, ! 864, 73, 1315, 867, 868, 869, 870, 871, 872, -1, ! -1, 83, 876, -1, -1, -1, -1, -1, -1, 883, ! -1, -1, 94, 95, -1, -1, -1, -1, 1610, -1, ! -1, -1, 1345, -1, -1, -1, -1, -1, -1, -1, ! 986, -1, 906, -1, -1, 1358, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 3, 4, 5, 6, ! 7, 8, 9, -1, -1, -1, 13, -1, 15, -1, ! -1, -1, 1385, -1, 1020, -1, 1389, -1, -1, -1, ! 1026, -1, 29, -1, 31, 32, 1032, -1, -1, -1, ! -1, 38, -1, -1, -1, -1, 43, -1, 374, -1, ! 47, -1, 49, 379, -1, -1, -1, -1, -1, 56, ! -1, 1424, 59, 60, -1, -1, -1, -1, 394, -1, ! -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, 1715, 1716, -1, 83, -1, -1, -1, ! -1, 88, -1, -1, -1, -1, -1, 94, 95, -1, ! -1, 1097, 428, 1099, -1, -1, -1, -1, -1, -1, ! -1, 437, -1, -1, 1477, 1478, 1030, 1031, 1032, -1, ! -1, 447, 1036, 1037, 450, -1, 3, 4, 5, 6, ! -1, 36, -1, -1, -1, -1, 462, -1, -1, -1, ! -1, 1137, -1, -1, 470, -1, -1, -1, -1, -1, ! 1146, 1514, 1515, -1, -1, 60, -1, 1520, -1, 1155, ! -1, -1, -1, -1, -1, -1, 43, -1, -1, -1, ! 496, 497, 498, 499, -1, -1, -1, -1, 504, 56, ! -1, -1, 59, 60, -1, -1, 512, 513, 65, -1, ! 516, -1, 518, 519, 520, -1, 73, -1, -1, 525, ! -1, -1, -1, 1199, 530, 1201, 83, 533, -1, -1, ! -1, 88, -1, 1209, -1, -1, -1, 94, 1132, 1133, ! 1134, 1135, 1136, 1137, 1138, -1, 1140, -1, 1142, 1143, ! 1144, 1145, 1146, -1, -1, -1, 1150, -1, -1, -1, ! -1, -1, -1, 569, -1, -1, -1, -1, -1, -1, ! -1, -1, 157, 158, 159, -1, -1, -1, -1, -1, ! -1, 1175, 1176, -1, 1178, -1, 1629, -1, -1, 1183, ! 1184, -1, 1186, -1, 1270, -1, -1, 1, 183, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, ! -1, 15, -1, -1, -1, -1, -1, 202, 203, 204, ! -1, -1, -1, -1, -1, 29, -1, 31, 32, 33, ! -1, -1, -1, -1, 38, 39, -1, -1, 1314, 43, ! -1, -1, -1, 47, 48, -1, 50, 232, -1, -1, ! -1, -1, 56, 4, 5, 59, 60, 8, 9, 63, ! -1, 65, -1, -1, 15, -1, -1, -1, -1, 73, ! 1346, -1, -1, -1, 1268, 1269, 1270, -1, -1, 83, ! -1, 32, -1, 1359, 88, -1, -1, 38, 694, -1, ! 94, -1, -1, -1, -1, -1, 47, -1, 49, -1, ! -1, -1, -1, -1, -1, 56, -1, 111, 59, 60, ! -1, -1, -1, -1, -1, 1309, 1310, 1311, 1312, 1313, ! 1314, -1, 73, 1317, 1318, -1, 732, -1, -1, -1, ! 315, -1, 83, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 94, 95, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 1350, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, -1, -1, ! -1, 1447, -1, -1, -1, -1, -1, 1371, 1372, -1, ! 365, -1, -1, 368, 369, -1, 1380, -1, -1, 795, ! -1, -1, 281, 282, 283, 284, 285, 286, -1, 288, ! 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, ! 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, ! -1, 310, 311, -1, -1, 3, 4, 5, 6, 835, ! 836, 837, 1508, -1, -1, -1, -1, 843, -1, 845, ! 1516, 4, 5, 428, 7, 8, 9, -1, -1, -1, ! -1, -1, 15, -1, 32, -1, -1, -1, 864, -1, ! -1, -1, 868, 869, -1, 43, 29, -1, 31, 32, ! 876, 1465, -1, -1, 1468, 38, 1470, 883, 56, 1473, ! -1, 59, 60, -1, 47, -1, 1562, 50, -1, -1, ! -1, -1, -1, 56, -1, 73, 59, 60, -1, -1, ! 906, -1, -1, -1, -1, 83, -1, -1, -1, -1, ! 88, 496, -1, 498, 499, 500, 94, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, 512, 513, -1, ! -1, 516, -1, 518, 519, 520, 521, -1, -1, -1, ! 525, -1, -1, -1, -1, 530, -1, 1, 533, 3, ! 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, ! 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, ! 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, 46, 47, 48, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, 61, -1, 63, ! 64, 3, 4, 5, 6, -1, 70, -1, -1, 73, ! -1, -1, 60, 1617, 1618, 1619, -1, 81, 82, 83, ! -1, -1, 1038, -1, 88, 89, 90, -1, -1, -1, ! 94, 1717, -1, -1, 98, -1, 84, -1, -1, 87, ! -1, 43, -1, -1, -1, -1, -1, 111, 112, -1, ! -1, -1, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, 63, -1, 111, -1, 113, -1, -1, -1, -1, ! 1674, 73, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 83, -1, -1, 583, -1, 88, 682, -1, -1, ! -1, -1, 94, -1, -1, -1, -1, -1, -1, -1, ! -1, 696, 697, 698, -1, -1, 605, -1, -1, -1, ! -1, 1715, 1716, 1717, 709, 614, 1132, 1133, 1134, 1135, ! 1136, 1137, -1, -1, 1728, -1, 1142, -1, 1144, 1145, ! 1146, -1, -1, -1, 1150, 183, -1, 732, -1, -1, ! -1, -1, -1, 1, -1, 3, 4, 5, 6, 7, ! 8, 9, -1, -1, 202, 203, 204, 15, -1, 1175, ! 1176, -1, 1178, -1, 212, -1, -1, 1183, 1184, -1, ! 1186, 29, -1, 31, 32, 33, -1, -1, -1, -1, ! 38, -1, -1, -1, 232, 43, -1, -1, -1, 47, ! 48, -1, 50, -1, -1, -1, -1, -1, 56, -1, ! 795, 59, 60, -1, -1, 63, -1, 65, -1, -1, ! -1, 259, -1, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 83, -1, -1, -1, -1, ! 88, 279, -1, -1, -1, -1, 94, -1, -1, -1, ! 835, 836, 837, -1, -1, -1, -1, -1, -1, -1, ! 845, -1, -1, -1, -1, 4, 5, -1, 7, 8, ! 9, -1, -1, -1, 13, -1, 15, -1, -1, 864, ! -1, -1, 867, 868, 869, 870, 871, 872, -1, -1, ! 29, 876, 31, 32, -1, -1, -1, -1, 883, 38, ! -1, -1, -1, 1309, 1310, 1311, -1, -1, 47, -1, ! -1, 1317, 1318, -1, -1, -1, -1, 56, -1, -1, ! 59, 60, -1, 1, -1, 3, 4, 5, 6, 7, ! 8, 9, -1, -1, -1, 373, 374, 15, -1, 924, ! 925, 926, -1, -1, 1350, -1, -1, -1, -1, -1, ! 935, 29, -1, 31, 32, 393, 394, -1, -1, -1, ! 38, -1, -1, -1, -1, 43, 1372, -1, -1, 47, ! -1, -1, 50, -1, 1380, -1, -1, -1, 56, -1, ! -1, 59, 60, -1, -1, 63, -1, -1, -1, -1, ! 428, -1, -1, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, 198, -1, -1, 83, -1, -1, -1, -1, ! 88, -1, -1, -1, -1, -1, 94, -1, -1, -1, ! -1, -1, -1, -1, 1009, 1010, -1, -1, 1013, -1, ! -1, 920, 921, 3, 4, 5, 6, -1, -1, 1024, ! -1, -1, -1, -1, -1, 1030, 1031, 1032, -1, -1, ! -1, 1036, -1, -1, -1, -1, -1, -1, 496, 1465, ! 498, 499, 32, -1, 1470, 4, 5, 1473, -1, 8, ! 9, -1, -1, 43, 512, 513, 15, -1, 516, -1, ! 518, 519, 520, 521, -1, -1, 56, 525, -1, 59, ! 60, -1, 530, 32, -1, 533, -1, -1, -1, 38, ! -1, -1, -1, 73, -1, -1, -1, -1, 47, -1, ! 49, 4, 5, 83, -1, 8, 9, 56, 88, -1, ! 59, 60, 15, -1, 94, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 73, -1, 29, -1, 31, 32, ! -1, -1, -1, -1, 83, 38, -1, 1132, 1133, 1134, ! 1135, 1136, 1137, 1138, 47, 94, 95, 1142, -1, 1144, ! 1145, 1146, -1, 56, -1, -1, 59, 60, -1, -1, ! -1, 1156, 1157, 1158, 73, 74, 75, 76, -1, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! 1175, 387, -1, -1, -1, -1, -1, -1, 1183, -1, ! 1, -1, 3, 4, 5, 6, 7, 8, 9, -1, ! -1, 1617, 1618, 1619, 15, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, 28, 29, -1, ! 31, 32, 33, -1, -1, -1, -1, 38, -1, -1, ! -1, -1, 43, -1, -1, 46, 47, 48, -1, 50, ! -1, 1236, 1237, -1, 1239, 56, 57, -1, 59, 60, ! -1, -1, 63, -1, -1, 1250, -1, -1, 1674, -1, ! -1, -1, 73, 1258, 712, 713, -1, -1, -1, -1, ! -1, -1, 83, 1268, 1269, 1270, -1, 88, -1, -1, ! 486, 487, -1, 94, 732, -1, -1, -1, 99, -1, ! -1, -1, 3, 4, 5, 6, -1, -1, 9, 1715, ! 1716, 1717, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 1728, -1, 1309, 1310, 1311, 1312, 1313, 1314, ! -1, 32, 1317, 1318, -1, -1, 4, 5, -1, 7, ! 8, 9, 43, -1, -1, 13, -1, 15, 1333, 1334, ! 1335, 1336, 1337, -1, -1, 56, -1, 795, 59, 60, ! -1, 29, -1, 31, 32, 1350, -1, -1, -1, -1, ! 38, -1, 73, -1, -1, -1, -1, -1, -1, 47, ! -1, -1, 83, -1, -1, -1, -1, 88, 56, -1, ! -1, 59, 60, 94, -1, -1, -1, 835, 836, 837, ! -1, -1, -1, -1, 842, 843, -1, 845, -1, -1, ! -1, -1, -1, -1, -1, 3, 4, 5, 6, -1, ! 616, 9, -1, 619, -1, -1, 864, -1, -1, 867, ! 868, 869, 870, 871, 872, 873, -1, -1, 876, -1, ! -1, -1, -1, -1, 32, 883, -1, -1, -1, 645, ! -1, -1, -1, -1, -1, 43, -1, 1442, 1443, -1, ! 1445, -1, -1, -1, 1449, -1, -1, 905, 56, -1, ! -1, 59, 60, -1, 670, -1, -1, -1, -1, 675, ! 1465, -1, 678, 679, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 83, -1, -1, -1, -1, ! 88, -1, -1, -1, -1, -1, 94, -1, -1, -1, ! -1, -1, -1, 709, -1, -1, -1, -1, -1, -1, ! 716, 1506, 1507, 1508, 1509, 1510, -1, -1, -1, -1, ! 726, 70, 71, 72, 73, 74, 75, 76, 77, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, 745, ! 746, 747, 748, -1, 750, 751, 752, 753, 754, 755, ! 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, ! 766, 767, 768, -1, -1, -1, -1, -1, -1, 1564, ! 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, ! 13, -1, 15, -1, -1, -1, -1, -1, -1, 1037, ! 1038, 1039, -1, -1, -1, -1, 29, -1, 31, 32, ! -1, -1, -1, -1, -1, 38, -1, -1, -1, -1, ! 43, -1, -1, -1, 47, -1, 49, -1, -1, -1, ! 826, -1, 1617, 56, 1619, -1, 59, 60, -1, -1, ! -1, -1, -1, -1, 365, -1, -1, 368, 369, 845, ! 73, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 83, -1, -1, 859, -1, 88, -1, -1, -1, -1, ! -1, 94, 95, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, -1, -1, 1674, ! -1, -1, -1, -1, 1132, 1133, 1134, 1135, 1136, 1137, ! 1138, -1, 1140, -1, 1142, 1143, 1144, 1145, 1146, -1, ! -1, -1, 1150, -1, -1, -1, -1, -1, 1156, 1157, ! 1158, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 1715, 1716, 1717, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 1728, -1, 1183, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 952, -1, -1, -1, ! -1, -1, 3, 4, 5, 6, 7, 8, 9, -1, ! -1, -1, 13, -1, 15, 496, -1, 498, 499, 500, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, ! 31, 32, -1, 989, 990, -1, -1, 38, -1, -1, ! -1, -1, 43, -1, -1, -1, 47, 16, 1004, -1, ! 1006, -1, 1008, -1, -1, 56, 25, 26, 59, 60, ! -1, -1, -1, -1, 33, 34, -1, 36, -1, -1, ! -1, -1, 73, -1, -1, -1, -1, 3, 4, 5, ! 6, -1, 83, 9, -1, -1, -1, 88, -1, -1, ! -1, -1, -1, 94, -1, 1051, -1, -1, -1, -1, ! -1, -1, 71, -1, -1, -1, 32, -1, -1, -1, ! -1, 1309, 1310, 1311, 1312, 1313, 1314, 43, -1, 1317, ! 1318, -1, -1, -1, -1, -1, -1, -1, 1084, -1, ! 56, -1, -1, 59, 60, 1333, 1334, 1335, 1336, 1337, ! -1, -1, -1, -1, -1, -1, -1, 73, -1, -1, ! -1, -1, 1350, -1, -1, -1, -1, 83, -1, -1, ! -1, 130, 88, 132, -1, -1, 1122, -1, 94, -1, ! 139, 140, -1, 1371, -1, -1, -1, -1, -1, 148, ! 149, -1, -1, 152, 153, 154, -1, 156, 157, 158, ! 159, -1, -1, -1, -1, -1, 1152, 1153, 71, 72, ! 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ! 83, 84, 85, 86, 87, 696, 697, 698, 1174, -1, ! -1, 70, 71, 72, 73, 74, 75, 76, 709, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! -1, -1, -1, -1, 1442, 1443, 1444, 1445, 74, 75, ! 76, 1449, 78, 79, 80, 81, 82, 83, 84, 85, ! 86, 87, -1, -1, 1220, 1221, -1, 1465, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 248, ! 249, -1, -1, -1, -1, -1, -1, 3, 4, 5, ! 6, 7, 8, 9, -1, -1, -1, 13, -1, 15, ! -1, -1, -1, 272, -1, -1, -1, -1, 1506, 1507, ! 1508, 1509, 1510, 29, 795, 31, 32, -1, -1, -1, ! -1, -1, 38, -1, 1280, -1, -1, 43, -1, -1, ! -1, 47, -1, 49, -1, -1, -1, -1, -1, -1, ! 56, -1, -1, 59, 60, 1301, 315, 1303, -1, 1305, ! -1, 1307, -1, -1, 835, 836, 837, 73, -1, -1, ! -1, -1, -1, -1, 845, -1, 1564, 83, -1, -1, ! -1, -1, 88, -1, -1, -1, -1, -1, 94, 95, ! -1, -1, 1338, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 363, -1, 365, -1, -1, 368, ! 71, 72, 73, 74, 75, 76, 1362, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, -1, -1, 1617, ! -1, 1619, -1, -1, -1, -1, -1, -1, -1, -1, -1, 3, 4, 5, 6, 7, 8, 9, -1, -1, ! -1, -1, -1, 15, 1400, -1, -1, 416, -1, -1, ! -1, -1, -1, -1, 935, -1, -1, 29, -1, 31, ! 32, -1, -1, -1, -1, -1, 38, -1, 437, -1, ! 439, 43, -1, 1429, -1, 47, 1674, 49, 447, -1, ! -1, 450, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, 462, -1, 1451, -1, -1, -1, -1, ! -1, 73, -1, -1, -1, 1461, 1462, 3, 4, 5, ! 6, 83, -1, 9, -1, -1, 88, 1715, 1716, 1717, ! -1, -1, 94, 95, -1, -1, -1, -1, 1009, 1010, ! 1728, -1, 1013, -1, -1, 1491, 32, -1, 3, 4, ! 5, 6, -1, 1024, 9, -1, -1, 43, -1, 1030, ! 1031, 1032, -1, -1, -1, 1036, -1, -1, -1, -1, ! 56, -1, -1, 59, 60, -1, -1, 32, -1, -1, ! -1, 1527, -1, -1, -1, -1, -1, 73, 43, -1, ! -1, -1, -1, -1, 553, 554, -1, 83, -1, -1, ! -1, 56, 88, -1, 59, 60, -1, -1, 94, -1, ! 569, -1, -1, -1, -1, -1, -1, -1, 73, -1, ! -1, -1, -1, -1, -1, -1, 1572, 1573, 83, -1, ! -1, -1, -1, 88, -1, -1, -1, -1, -1, 94, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 611, 1599, 613, -1, -1, -1, -1, -1, ! -1, 1132, 1133, 1134, 1135, 1136, 1137, 1138, -1, -1, ! -1, 1142, -1, 1144, 1145, 1146, 75, 76, 77, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, -1, ! -1, 1637, 3, 4, 5, 6, 7, 8, 9, -1, ! -1, -1, -1, -1, 15, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, ! 31, 32, -1, 682, -1, -1, -1, 38, 1674, -1, ! -1, -1, 43, -1, 693, 694, 47, 696, 697, -1, ! -1, -1, -1, -1, -1, 56, -1, -1, 59, 60, ! -1, -1, -1, 1699, 65, -1, -1, -1, -1, -1, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 83, -1, -1, -1, -1, 88, -1, 1250, ! -1, -1, -1, 94, -1, -1, -1, 1258, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, 1268, 1269, 1270, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 779, -1, -1, -1, -1, -1, -1, 786, 787, -1, ! -1, -1, -1, -1, -1, -1, -1, 796, 1309, 1310, ! 1311, 1312, 1313, 1314, -1, -1, 1317, 1318, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 821, -1, 1810, -1, -1, 1, -1, 3, ! 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, ! 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, ! 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, 46, 47, 48, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, 61, -1, 63, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, 32, 905, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, -1, -1, -1, 98, 924, 925, 926, 927, -1, ! -1, 1442, 1443, -1, 1445, -1, 935, -1, 112, 66, ! 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, ! 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, ! 87, -1, -1, -1, -1, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, -1, -1, -1, ! -1, -1, -1, -1, -1, 1506, 1507, 1508, 1509, 1510, ! -1, 1, -1, 3, 4, 5, 6, 7, 8, 9, ! 1009, 1010, 113, 13, 1013, 15, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 1024, 26, -1, 28, -1, ! -1, -1, 32, -1, -1, -1, -1, 1036, 38, -1, -1, -1, -1, 43, -1, -1, -1, 47, -1, 49, ! -1, -1, -1, 1564, -1, -1, 56, -1, -1, 59, 60, 61, 62, 63, -1, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, ! 90, -1, -1, 93, 94, 95, 96, -1, 98, -1, ! -1, -1, -1, 103, 104, -1, -1, -1, -1, 109, ! 110, 111, -1, 113, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 66, 67, 68, 69, ! 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82, 83, 84, 85, 86, 87, -1, -1, ! -1, -1, -1, -1, 1, -1, 3, 4, 5, 6, ! 7, 8, 9, 10, 11, 12, 13, 14, 15, 109, ! 1169, -1, -1, 1172, -1, -1, 1175, -1, -1, -1, ! -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, 49, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, 1236, 1237, -1, ! 1239, 88, 89, 90, -1, -1, -1, 94, 95, -1, ! -1, 1250, -1, -1, -1, -1, -1, -1, -1, 1258, ! -1, -1, -1, -1, -1, 112, -1, -1, -1, 1268, ! 1269, -1, -1, -1, 1, -1, 3, 4, 5, 6, ! 7, 8, 9, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, + 1299, -1, 29, 30, 31, 32, 33, -1, 35, 36, + 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, + 47, -1, 49, -1, 51, 52, 53, 54, 55, 56, + -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, + -1, -1, 1341, 70, -1, -1, 73, -1, -1, -1, + -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, + -1, 88, 89, 90, -1, -1, -1, 94, 95, -1, + -1, -1, -1, 1372, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, 112, 1, -1, 3, 4, + 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, + 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, + -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, + 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, + 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, + 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, + -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, + -1, -1, -1, -1, -1, -1, 81, 82, 83, 1468, + -1, 1470, -1, 88, 89, 90, -1, -1, 1, 94, + 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, + -1, 14, 15, -1, -1, 110, -1, 112, -1, -1, + -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, + 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, + 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, + 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, + 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, + 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, + 83, -1, -1, -1, -1, 88, 89, 90, -1, -1, + 1, 94, 3, 4, 5, 6, -1, 8, 9, 10, + 11, 12, -1, 14, 15, -1, -1, -1, -1, 112, + -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, + 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, + 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, + 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, + 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, 88, 89, 90, ! -1, -1, -1, 94, 95, 1, -1, 3, 4, 5, ! 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! 111, 112, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, ! -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, 88, 89, 90, -1, -1, 1, 94, 3, ! 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, 95, 1, -1, 3, 4, 5, 6, -1, 8, ! 9, 10, 11, 12, -1, 14, 15, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, ! -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, ! -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, 88, ! 89, 90, -1, -1, -1, 94, -1, 1, -1, 3, ! 4, 5, 6, 102, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, 112, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, 1, ! 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, 111, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, 1, 94, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, 111, ! 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, 88, 89, ! 90, -1, -1, 1, 94, 3, 4, 5, 6, -1, ! 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, 63, 64, -1, -1, -1, ! -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! 88, 89, 90, -1, -1, 1, 94, 3, 4, 5, ! 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, 88, 89, 90, -1, -1, 1, 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, ! 64, 65, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, 1, ! 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, -1, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, ! -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, ! 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, ! -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, 1, 94, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, 110, -1, ! 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, ! 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, ! -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, ! 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, ! 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, 88, 89, ! 90, -1, -1, 1, 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, ! -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! 88, 89, 90, -1, -1, 1, 94, 3, 4, 5, ! 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, ! -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, ! 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, ! -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, ! -1, -1, -1, -1, 70, 1, -1, 73, 4, 5, ! -1, -1, 8, 9, -1, 81, 82, 83, -1, 15, ! -1, -1, 88, 89, 90, -1, -1, -1, 94, -1, ! -1, -1, -1, 29, -1, 31, 32, -1, -1, -1, ! -1, -1, 38, -1, 40, 41, 112, -1, -1, -1, ! -1, 47, -1, 49, -1, -1, -1, -1, -1, -1, ! 56, -1, -1, 59, 60, -1, 62, -1, -1, -1, ! 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, ! 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, ! -1, 87, 88, 89, 90, -1, -1, -1, -1, 95, ! 96, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, -1, ! 112, 113, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, ! 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, ! -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, ! 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, ! 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, 88, 89, ! 90, -1, -1, -1, 94, 3, 4, 5, 6, -1, ! 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, ! -1, -1, 112, 113, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, ! -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! 88, 89, 90, -1, -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, -1, 112, 113, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, 88, 89, 90, -1, -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, -1, 112, 113, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 112, 113, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, 14, 15, 16, -1, 18, 19, 20, 21, 22, *************** static const short yycheck[] = *** 4124,4492 **** 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, -1, 95, -1, 97, 3, 4, 5, 6, 7, ! 8, 9, 10, 11, 12, -1, 14, 15, 16, 112, ! 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, ! 28, 29, 30, 31, 32, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, 46, 47, ! 48, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, 63, 64, -1, -1, -1, ! -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! -1, 89, 90, 91, -1, -1, -1, 95, -1, 97, ! 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, ! 13, 14, 15, -1, 112, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, 49, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, ! -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, -1, 95, 96, 3, 4, 5, 6, 7, 8, ! 9, 10, 11, 12, 13, 14, 15, -1, -1, 112, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, ! -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! 49, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, ! -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, -1, ! 89, 90, 91, -1, -1, -1, 95, 96, 3, 4, ! 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, ! 15, -1, -1, 112, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, ! 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, 49, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, ! -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, -1, 89, 90, 91, -1, -1, -1, ! 95, 96, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, -1, -1, 112, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, ! 41, 42, 43, 44, 45, -1, 47, -1, 49, -1, ! 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, -1, 89, 90, ! 91, -1, -1, -1, 95, 96, 3, 4, 5, 6, ! -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, ! -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, -1, 89, 90, 91, -1, -1, -1, 95, 3, ! 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, -1, 89, 90, 91, -1, -1, ! -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, ! 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, ! 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, ! -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, -1, 89, 90, ! 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, ! 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, ! -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! -1, 89, 90, 91, -1, -1, -1, 95, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, -1, 89, 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, ! -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, -1, 89, 90, 91, ! -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, -1, ! 89, 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, -1, 89, 90, 91, -1, -1, -1, 95, ! 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, ! -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, -1, 95, 96, 3, 4, 5, 6, -1, 8, ! 9, 10, 11, 12, -1, 14, 15, -1, -1, 112, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, ! -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, ! -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, -1, ! 89, 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, -1, 89, 90, 91, -1, -1, -1, 95, ! 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, ! -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, ! -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, -1, 89, 90, 91, -1, ! -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, -1, 89, ! 90, 91, -1, -1, -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, -1, 89, 90, 91, -1, -1, -1, 95, 3, ! 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, -1, 89, 90, 91, -1, -1, ! -1, 95, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, ! -1, -1, 73, 3, 4, 5, 6, 7, 8, 9, ! 81, 82, 83, -1, -1, 15, -1, -1, 89, 90, ! 91, -1, -1, -1, 95, -1, -1, -1, -1, 29, ! -1, 31, 32, -1, -1, -1, -1, -1, 38, -1, ! -1, 112, -1, 43, -1, -1, -1, 47, -1, 3, ! 4, 5, 6, 7, 8, 9, 56, -1, -1, 59, ! 60, 15, -1, 63, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 73, -1, 29, -1, 31, 32, -1, ! -1, -1, -1, 83, 38, -1, -1, -1, -1, 43, ! -1, 91, -1, 47, -1, 95, -1, -1, -1, -1, ! -1, -1, 56, -1, -1, 59, 60, -1, -1, -1, ! 3, 4, 5, 6, 7, 8, 9, -1, -1, 73, ! -1, -1, 15, -1, -1, -1, -1, -1, -1, 83, ! -1, -1, -1, -1, -1, -1, 29, 91, 31, 32, ! -1, 95, -1, -1, -1, 38, -1, -1, -1, -1, ! 43, -1, -1, -1, 47, -1, -1, -1, -1, -1, ! -1, -1, -1, 56, -1, -1, 59, 60, -1, -1, ! -1, -1, 70, 71, 72, 73, 74, 75, 76, 77, ! 73, 79, 80, 81, 82, 83, 84, 85, 86, 87, ! 83, -1, -1, -1, -1, -1, -1, -1, 91, -1, ! -1, -1, 95, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ! 83, 84, 85, 86, 87, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, -1, -1, -1, ! 113, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 62, -1, -1, 109, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, ! 87, 62, -1, -1, -1, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 86, 87, 65, 66, 67, ! 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, ! 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, ! 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, ! 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, ! 86, 87 }; - /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ - #line 3 "/usr/share/bison/bison.simple" - - /* Skeleton output parser for bison, - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software - Foundation, Inc. - - This program 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 2, or (at your option) - any later version. - - This program 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 this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* This is the parser code that is written into each bison parser when ! the %semantic_parser declaration is not specified in the grammar. ! It was written by Richard Stallman by simplifying the hairy parser ! used when %semantic_parser is specified. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! #ifdef __cplusplus ! # define YYSTD(x) std::x ! #else ! # define YYSTD(x) x ! #endif ! ! #ifndef YYPARSE_RETURN_TYPE ! #define YYPARSE_RETURN_TYPE int ! #endif ! ! #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 4416,4835 ---- 53, 54, 55, 56, -1, -1, 59, 60, 61, -1, 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, 88, 89, 90, -1, -1, ! -1, 94, -1, -1, -1, 98, -1, -1, -1, 3, ! 4, 5, 6, 7, 8, 9, 10, 11, 12, 112, ! 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, ! 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, 46, 47, 48, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, 63, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, -1, -1, -1, 98, 3, 4, 5, 6, 7, ! 8, 9, 10, 11, 12, 13, 14, 15, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, 49, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! 88, 89, 90, -1, -1, -1, 94, 95, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, 49, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, 88, 89, 90, -1, -1, -1, 94, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, 49, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, -1, 94, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! 49, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, 88, ! 89, 90, -1, -1, -1, 94, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, 88, 89, 90, -1, -1, -1, 94, 3, ! 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, -1, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, ! 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, ! 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, ! -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, -1, ! 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, ! 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, ! -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, ! 60, -1, -1, 63, 64, -1, -1, -1, -1, -1, ! 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, 88, 89, ! 90, -1, -1, -1, 94, 3, 4, 5, 6, 7, ! 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, ! -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, ! -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, ! 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, ! -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, ! -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, ! -1, -1, -1, 81, 82, 83, -1, -1, -1, -1, ! 88, 89, 90, -1, -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, ! -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, ! 56, -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, ! -1, -1, 88, 89, 90, -1, -1, -1, 94, 3, ! 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, ! 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, ! -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, ! -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, ! 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, ! 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, ! 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, ! -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, ! -1, -1, -1, -1, 88, 89, 90, -1, -1, -1, ! 94, 3, 4, 5, 6, -1, 8, 9, 10, 11, ! 12, -1, 14, 15, -1, -1, -1, -1, 112, -1, ! -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, ! -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, ! 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, ! 52, 53, 54, 55, 56, -1, -1, 59, 60, 61, ! -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, ! 82, 83, -1, -1, -1, -1, 88, 89, 90, -1, ! -1, -1, 94, 3, 4, 5, 6, -1, 8, 9, ! 10, 11, 12, -1, 14, 15, -1, -1, -1, -1, ! 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, ! 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, ! -1, 81, 82, 83, -1, -1, -1, -1, 88, 89, ! 90, -1, -1, -1, 94, 95, 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, 88, 89, 90, -1, -1, -1, 94, 3, 4, ! 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, ! 15, -1, -1, -1, -1, 112, -1, -1, -1, -1, ! -1, -1, -1, -1, 29, 30, 31, 32, 33, -1, ! 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 70, -1, -1, 73, -1, ! -1, -1, -1, -1, -1, -1, 81, 82, 83, -1, ! -1, -1, -1, 88, 89, 90, -1, -1, -1, 94, ! 3, 4, 5, 6, -1, 8, 9, 10, 11, 12, ! -1, 14, 15, -1, -1, -1, -1, 112, -1, -1, ! -1, -1, -1, -1, -1, -1, 29, 30, 31, -1, ! 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, ! 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, ! 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, ! -1, 64, -1, -1, -1, -1, -1, 70, -1, -1, ! 73, -1, -1, -1, -1, -1, -1, -1, 81, 82, ! 83, -1, -1, -1, -1, 88, 89, 90, -1, -1, ! -1, 94, 3, 4, 5, 6, -1, 8, 9, 10, ! 11, 12, -1, 14, 15, -1, -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, 29, 30, ! 31, 32, 33, -1, 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, -1, 70, ! -1, -1, 73, -1, -1, -1, -1, -1, -1, -1, ! 81, 82, 83, -1, -1, -1, -1, 88, 89, 90, ! -1, -1, -1, 94, 3, 4, 5, 6, -1, 8, ! 9, 10, 11, 12, -1, 14, 15, -1, -1, -1, ! -1, 112, -1, -1, -1, -1, -1, -1, -1, -1, ! 29, 30, 31, -1, 33, -1, 35, 36, 37, 38, ! -1, 40, 41, 42, 43, 44, 45, -1, 47, -1, ! -1, -1, 51, 52, 53, 54, 55, 56, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 70, -1, -1, 73, -1, -1, -1, -1, -1, ! -1, -1, 81, 82, 83, -1, -1, -1, -1, 88, ! 89, 90, -1, -1, -1, 94, 3, 4, 5, 6, ! -1, 8, 9, 10, 11, 12, -1, 14, 15, -1, ! -1, -1, -1, 112, -1, -1, -1, -1, -1, -1, ! -1, -1, 29, 30, 31, -1, 33, -1, 35, 36, ! 37, 38, -1, 40, 41, 42, 43, 44, 45, -1, ! 47, -1, -1, -1, 51, 52, 53, 54, 55, 56, ! -1, -1, 59, 60, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 70, -1, -1, 73, -1, -1, -1, ! -1, -1, -1, -1, 81, 82, 83, -1, -1, -1, ! -1, 88, 89, 90, -1, -1, -1, 94, 3, 4, ! 5, 6, -1, 8, 9, 10, 11, 12, -1, 14, ! 15, -1, -1, -1, -1, 112, -1, -1, -1, -1, ! -1, -1, -1, -1, 29, 30, 31, -1, 33, -1, ! 35, 36, 37, 38, -1, 40, 41, 42, 43, 44, ! 45, -1, 47, -1, -1, -1, 51, 52, 53, 54, ! 55, 56, -1, -1, 59, 60, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 70, -1, -1, 73, 3, ! 4, 5, 6, 7, 8, 9, 81, 82, 83, -1, ! -1, 15, -1, 88, 89, 90, -1, -1, -1, 94, ! -1, -1, -1, -1, -1, 29, -1, 31, 32, -1, ! -1, -1, -1, -1, 38, -1, -1, 112, -1, 43, ! -1, -1, -1, 47, -1, 3, 4, 5, 6, 7, ! 8, 9, 56, -1, -1, 59, 60, 15, -1, 63, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 73, ! -1, 29, -1, 31, 32, -1, -1, -1, -1, 83, ! 38, -1, -1, -1, 88, 43, -1, -1, -1, 47, ! 94, 3, 4, 5, 6, 7, 8, 9, 56, -1, ! -1, 59, 60, 15, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 73, -1, 29, -1, 31, ! 32, -1, -1, -1, -1, 83, 38, -1, -1, -1, ! 88, 43, -1, -1, -1, 47, 94, -1, -1, -1, ! -1, -1, -1, -1, 56, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 73, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 83, -1, -1, -1, -1, 88, -1, -1, 62, ! -1, -1, 94, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, ! 83, 84, 85, 86, 87, 62, -1, -1, -1, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, ! 87, 65, 66, 67, 68, 69, 70, 71, 72, 73, ! 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, ! 84, 85, 86, 87, 66, 67, 68, 69, 70, 71, ! 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, ! 82, 83, 84, 85, 86, 87 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned short yystos[] = { ! 0, 115, 116, 117, 0, 123, 124, 123, 1, 3, ! 4, 5, 6, 7, 8, 9, 15, 28, 29, 31, ! 32, 33, 38, 43, 46, 47, 48, 50, 56, 57, ! 59, 60, 63, 73, 83, 88, 94, 99, 121, 122, ! 125, 129, 131, 133, 137, 138, 140, 141, 147, 150, ! 156, 157, 162, 174, 185, 187, 210, 212, 217, 218, ! 231, 232, 234, 235, 239, 240, 244, 252, 255, 256, ! 268, 276, 277, 278, 279, 280, 304, 309, 310, 311, ! 313, 315, 317, 320, 321, 322, 329, 330, 397, 404, ! 406, 63, 109, 111, 76, 398, 56, 76, 56, 76, ! 76, 50, 3, 4, 5, 59, 60, 61, 171, 185, ! 311, 321, 328, 330, 94, 94, 4, 5, 59, 60, ! 61, 171, 3, 4, 5, 59, 60, 185, 323, 324, ! 325, 326, 330, 4, 5, 46, 59, 60, 316, 321, ! 330, 76, 183, 126, 56, 76, 76, 3, 255, 304, ! 312, 313, 321, 330, 304, 312, 395, 73, 83, 94, ! 210, 215, 216, 218, 255, 314, 315, 329, 125, 94, ! 63, 61, 99, 119, 1, 7, 50, 121, 137, 147, ! 148, 149, 156, 231, 234, 244, 268, 109, 153, 122, ! 245, 26, 152, 165, 166, 63, 56, 49, 94, 95, ! 305, 63, 73, 83, 94, 228, 242, 250, 307, 308, ! 313, 320, 321, 329, 7, 9, 63, 157, 240, 243, ! 251, 255, 313, 94, 7, 8, 9, 233, 236, 241, ! 255, 268, 62, 63, 256, 7, 8, 9, 38, 61, ! 105, 106, 107, 171, 173, 185, 186, 255, 321, 330, ! 61, 65, 61, 65, 65, 281, 9, 240, 255, 330, ! 245, 3, 5, 50, 60, 83, 187, 210, 213, 217, ! 320, 322, 303, 3, 59, 210, 311, 317, 320, 321, ! 1, 40, 41, 49, 62, 66, 67, 68, 69, 70, ! 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, ! 81, 82, 83, 84, 85, 87, 88, 89, 90, 95, ! 96, 112, 235, 240, 304, 375, 76, 9, 10, 11, ! 12, 14, 30, 35, 36, 37, 40, 41, 42, 44, ! 45, 51, 52, 53, 54, 55, 60, 64, 70, 73, ! 81, 82, 83, 88, 89, 90, 94, 112, 121, 190, ! 191, 192, 193, 203, 206, 207, 209, 210, 219, 221, ! 222, 223, 224, 226, 230, 235, 237, 238, 240, 304, ! 317, 318, 319, 321, 330, 3, 190, 190, 211, 183, ! 270, 61, 3, 50, 60, 311, 320, 64, 194, 201, ! 207, 208, 230, 321, 330, 94, 128, 61, 66, 56, ! 56, 56, 56, 56, 56, 3, 4, 5, 50, 59, ! 60, 171, 185, 326, 327, 324, 134, 3, 4, 5, ! 210, 213, 214, 214, 316, 77, 139, 157, 231, 234, ! 240, 313, 147, 191, 190, 76, 313, 255, 312, 321, ! 312, 4, 5, 171, 185, 215, 255, 304, 314, 215, ! 304, 314, 215, 110, 59, 60, 73, 83, 94, 210, ! 216, 110, 303, 224, 116, 118, 50, 150, 156, 148, ! 119, 153, 242, 243, 63, 63, 94, 254, 255, 3, ! 1, 98, 154, 168, 365, 49, 66, 94, 261, 63, ! 1, 13, 201, 202, 208, 230, 232, 234, 235, 240, ! 304, 385, 386, 390, 391, 392, 394, 9, 113, 194, ! 240, 303, 255, 304, 306, 307, 304, 306, 73, 83, ! 94, 255, 306, 329, 245, 62, 63, 95, 305, 320, ! 303, 233, 236, 62, 63, 245, 194, 230, 7, 241, ! 233, 241, 255, 228, 246, 76, 61, 65, 3, 60, ! 171, 186, 171, 321, 395, 61, 236, 253, 56, 49, ! 94, 6, 171, 327, 406, 56, 49, 94, 9, 255, ! 312, 5, 83, 187, 405, 95, 405, 95, 405, 405, ! 405, 405, 405, 65, 405, 405, 405, 405, 405, 405, ! 405, 405, 405, 405, 405, 405, 405, 405, 405, 405, ! 405, 405, 405, 405, 405, 113, 405, 405, 236, 73, ! 83, 321, 329, 330, 403, 211, 94, 207, 207, 94, ! 94, 76, 76, 76, 76, 209, 171, 207, 207, 207, ! 1, 73, 83, 94, 194, 210, 215, 220, 230, 207, ! 77, 79, 189, 62, 207, 61, 94, 203, 66, 67, ! 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, 49, ! 94, 49, 89, 90, 93, 94, 95, 96, 61, 94, ! 204, 302, 375, 95, 207, 12, 1, 8, 50, 88, ! 213, 214, 318, 321, 330, 49, 73, 83, 94, 95, ! 206, 229, 329, 334, 335, 94, 203, 94, 203, 94, ! 229, 334, 321, 330, 334, 49, 94, 50, 3, 41, ! 60, 212, 222, 317, 330, 406, 94, 399, 189, 189, ! 190, 157, 231, 240, 313, 62, 171, 275, 299, 300, ! 301, 269, 171, 208, 110, 62, 62, 66, 67, 68, ! 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, ! 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, ! 7, 8, 9, 171, 257, 258, 259, 118, 127, 130, ! 327, 76, 56, 136, 214, 316, 330, 47, 50, 138, ! 142, 144, 145, 146, 230, 240, 276, 392, 394, 178, ! 228, 63, 177, 189, 189, 190, 312, 312, 110, 215, ! 312, 110, 111, 120, 120, 149, 156, 63, 63, 224, ! 366, 65, 151, 167, 225, 1, 61, 208, 262, 202, ! 110, 110, 13, 62, 65, 73, 83, 94, 228, 329, ! 334, 313, 321, 330, 228, 94, 228, 110, 13, 62, ! 65, 13, 313, 393, 394, 396, 66, 387, 113, 94, ! 229, 64, 400, 307, 255, 306, 306, 255, 304, 304, ! 73, 83, 94, 321, 329, 110, 303, 248, 254, 246, ! 113, 194, 303, 255, 306, 233, 246, 248, 110, 110, ! 245, 190, 171, 186, 4, 5, 7, 39, 185, 282, ! 283, 284, 285, 309, 323, 330, 271, 248, 303, 158, ! 76, 76, 56, 76, 303, 160, 49, 94, 49, 94, ! 113, 113, 405, 405, 303, 303, 303, 321, 405, 190, ! 202, 208, 194, 230, 230, 240, 230, 230, 230, 110, ! 215, 110, 110, 341, 407, 110, 192, 3, 4, 5, ! 59, 60, 95, 171, 262, 263, 230, 209, 209, 1, ! 194, 380, 209, 209, 209, 209, 209, 209, 209, 209, ! 209, 209, 209, 209, 209, 209, 209, 209, 209, 209, ! 202, 202, 194, 202, 202, 230, 94, 302, 49, 66, ! 94, 205, 73, 83, 95, 329, 331, 332, 113, 194, ! 56, 171, 8, 49, 94, 49, 94, 49, 94, 255, ! 304, 333, 334, 304, 333, 230, 333, 386, 113, 194, ! 94, 303, 49, 303, 303, 49, 94, 95, 230, 230, ! 73, 83, 94, 202, 206, 215, 255, 321, 330, 321, ! 202, 171, 202, 63, 188, 188, 189, 182, 228, 63, ! 181, 66, 111, 62, 275, 299, 1, 208, 1, 208, ! 208, 208, 380, 208, 208, 208, 208, 208, 208, 208, ! 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, ! 208, 208, 62, 110, 94, 111, 118, 136, 56, 190, ! 63, 214, 316, 143, 171, 76, 276, 62, 77, 66, ! 66, 143, 171, 66, 184, 176, 175, 184, 188, 189, ! 110, 63, 153, 120, 120, 110, 154, 1, 3, 49, ! 59, 60, 94, 169, 170, 172, 309, 323, 407, 111, ! 263, 110, 255, 304, 304, 73, 83, 94, 255, 320, ! 321, 329, 303, 321, 73, 83, 94, 210, 215, 317, ! 330, 387, 66, 388, 49, 94, 304, 304, 303, 66, ! 113, 400, 254, 77, 395, 395, 62, 7, 39, 395, ! 1, 5, 48, 63, 65, 94, 121, 131, 141, 157, ! 163, 164, 187, 231, 234, 286, 288, 289, 290, 313, ! 397, 400, 385, 190, 190, 190, 400, 385, 303, 159, ! 303, 161, 405, 405, 403, 403, 403, 189, 110, 62, ! 110, 110, 77, 77, 77, 77, 110, 110, 61, 208, ! 65, 62, 274, 110, 65, 110, 110, 113, 111, 110, ! 110, 230, 205, 262, 202, 240, 303, 303, 194, 303, ! 95, 207, 113, 88, 76, 49, 202, 202, 202, 334, ! 255, 333, 333, 110, 110, 113, 400, 400, 255, 333, ! 303, 385, 113, 194, 110, 110, 110, 110, 73, 83, ! 94, 110, 110, 184, 180, 179, 184, 208, 301, 111, ! 65, 258, 110, 3, 202, 111, 63, 189, 143, 146, ! 230, 192, 209, 184, 184, 153, 367, 202, 1, 62, ! 49, 94, 49, 94, 49, 94, 61, 62, 111, 255, ! 304, 304, 73, 83, 94, 329, 320, 303, 255, 215, ! 110, 3, 212, 317, 406, 262, 102, 262, 389, 1, ! 230, 401, 402, 73, 83, 94, 255, 255, 249, 66, ! 188, 395, 395, 395, 284, 49, 94, 208, 5, 289, ! 231, 289, 245, 245, 26, 61, 65, 98, 49, 94, ! 3, 4, 65, 157, 228, 291, 293, 295, 296, 307, ! 313, 321, 330, 157, 163, 292, 296, 313, 39, 111, ! 287, 289, 63, 111, 245, 110, 189, 189, 189, 110, ! 400, 385, 400, 385, 230, 94, 94, 94, 94, 342, ! 113, 262, 171, 262, 111, 209, 95, 205, 110, 110, ! 110, 331, 331, 113, 331, 194, 207, 8, 190, 110, ! 110, 110, 303, 400, 110, 113, 184, 184, 208, 62, ! 110, 110, 97, 371, 372, 110, 170, 202, 202, 202, ! 155, 111, 304, 304, 321, 303, 110, 62, 110, 255, ! 262, 247, 283, 303, 385, 110, 63, 254, 254, 303, ! 385, 65, 65, 208, 245, 62, 245, 245, 321, 245, ! 62, 65, 254, 288, 254, 303, 303, 110, 110, 110, ! 194, 194, 194, 194, 34, 111, 200, 338, 339, 340, ! 262, 65, 194, 205, 113, 49, 189, 400, 303, 202, ! 373, 372, 110, 110, 110, 200, 73, 83, 94, 255, ! 255, 401, 262, 400, 110, 49, 94, 261, 261, 400, ! 110, 208, 208, 254, 254, 3, 4, 65, 294, 297, ! 298, 307, 313, 254, 254, 5, 254, 298, 272, 261, ! 400, 400, 303, 303, 110, 110, 110, 110, 171, 260, ! 1, 336, 337, 341, 343, 349, 407, 340, 262, 113, ! 400, 110, 94, 376, 255, 303, 303, 385, 303, 254, ! 254, 261, 65, 65, 208, 245, 245, 261, 261, 261, ! 267, 400, 400, 62, 63, 63, 111, 1, 111, 337, ! 349, 3, 4, 5, 16, 18, 19, 20, 21, 22, ! 23, 24, 25, 26, 27, 46, 48, 60, 63, 98, ! 121, 122, 129, 132, 133, 194, 227, 231, 234, 240, ! 344, 350, 368, 377, 13, 394, 374, 400, 400, 110, ! 400, 208, 208, 254, 254, 254, 1, 103, 266, 273, ! 171, 111, 65, 65, 65, 345, 352, 354, 356, 360, ! 208, 65, 63, 63, 63, 194, 83, 171, 171, 59, ! 135, 330, 65, 369, 227, 9, 379, 63, 63, 228, ! 242, 63, 243, 313, 94, 242, 17, 111, 349, 110, ! 110, 343, 303, 254, 254, 261, 261, 1, 208, 265, ! 49, 94, 196, 196, 343, 347, 348, 94, 94, 13, ! 65, 364, 63, 194, 63, 56, 59, 171, 59, 135, ! 171, 343, 94, 63, 63, 73, 83, 94, 63, 351, ! 400, 109, 109, 104, 264, 194, 198, 240, 375, 346, ! 353, 18, 407, 61, 227, 378, 380, 198, 208, 362, ! 349, 63, 56, 171, 370, 224, 347, 152, 153, 110, ! 228, 347, 347, 355, 350, 200, 357, 63, 110, 65, ! 349, 371, 56, 65, 110, 1, 154, 365, 245, 49, ! 94, 195, 1, 197, 198, 361, 363, 12, 95, 381, ! 382, 383, 381, 63, 254, 194, 63, 63, 347, 349, ! 94, 171, 65, 110, 62, 56, 65, 110, 66, 110, ! 358, 194, 113, 224, 384, 63, 383, 384, 381, 63, ! 199, 380, 110, 12, 62, 110, 110, 65, 110, 262, ! 110, 94, 224, 63, 63, 384, 63, 359, 194, 110, ! 347, 110, 63 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 4494,4507 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 4837,4845 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 4510,4538 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 4848,4881 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 4540,4591 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 4883,4913 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (YYLEX_PARAM) ! #else ! # define YYLEX yylex () ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 4593,4607 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 4915,5007 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 4621,4655 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ - - /* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ - static void - # if defined (__STDC__) || defined (__cplusplus) - yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) - # else - yymemcpy (yyto, yyfrom, yycount) - char *yyto; - const char *yyfrom; - YYSIZE_T yycount; - # endif - { - register const char *yyf = yyfrom; - register char *yyt = yyto; - register YYSIZE_T yyi = yycount; ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 5021,5030 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 4699,4784 **** } # endif # endif ! #endif - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif - /* YY_DECL_VARIABLES -- depending whether we use a pure parser, - variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ int yynerrs; - #if YYLSP_NEEDED - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES \ - \ - /* Location data for the lookahead symbol. */ \ - YYLTYPE yylloc; - #else - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES - #endif ! /* If nonreentrant, generate the variables here. */ ! #if !YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 5074,5207 ---- } # endif # endif ! ! #endif /* !YYERROR_VERBOSE */ ! + #if YYDEBUG + /*--------------------------------. + | Print this symbol on YYOUTPUT. | + `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); ! # endif ! } ! else ! YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); ! switch (yytype) ! { ! default: ! break; ! } ! YYFPRINTF (yyoutput, ")"); ! } ! ! #endif /* ! YYDEBUG */ ! /*-----------------------------------------------. ! | Release the memory associated to this symbol. | ! `-----------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yydestruct (int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yydestruct (yytype, yyvaluep) ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! switch (yytype) ! { ! ! default: ! break; ! } ! } ! ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); # else ! int yyparse (); # endif + #else /* ! YYPARSE_PARAM */ + #if defined (__STDC__) || defined (__cplusplus) + int yyparse (void); + #else + int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ int yynerrs; ! /*----------. ! | yyparse. | ! `----------*/ ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! #endif ! #endif { ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 4788,4794 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 5211,5217 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 4798,4828 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 5221,5239 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 4839,4847 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 5250,5256 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 4856,4862 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 5265,5271 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 4869,4901 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 5278,5306 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 4904,4930 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 5309,5332 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 4932,4938 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 5334,5339 ---- *************** yybackup: *** 4945,5032 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 5346,5400 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 5057,5245 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { ! int yyi; ! ! YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", ! yyn, yyrline[yyn]); ! ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) ! YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); ! YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); ! } ! #endif ! ! switch (yyn) { ! ! case 1: #line 456 "parse.y" ! { finish_translation_unit (); ; ! break;} ! case 2: #line 458 "parse.y" ! { finish_translation_unit (); ; ! break;} ! case 3: #line 466 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 4: #line 468 "parse.y" ! { yyval.ttype = NULL_TREE; ggc_collect (); ; ! break;} ! case 5: #line 470 "parse.y" ! { yyval.ttype = NULL_TREE; ggc_collect (); ; ! break;} ! case 8: #line 479 "parse.y" ! { have_extern_spec = 1; used_extern_spec = 0; ! yyval.ttype = NULL_TREE; ; ! break;} ! case 9: #line 484 "parse.y" ! { have_extern_spec = 0; ; ! break;} ! case 10: #line 489 "parse.y" ! { yyval.itype = pedantic; ! pedantic = 0; ; ! break;} ! case 12: #line 498 "parse.y" ! { if (pending_lang_change) do_pending_lang_change(); ! type_lookups = NULL_TREE; ; ! break;} ! case 13: #line 501 "parse.y" ! { if (! toplevel_bindings_p ()) ! pop_everything (); ; ! break;} ! case 14: #line 507 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 15: #line 509 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 16: #line 512 "parse.y" ! { warning ("keyword `export' not implemented, and will be ignored"); ; ! break;} ! case 17: #line 514 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 18: #line 516 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 19: #line 518 "parse.y" ! { if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype); ! assemble_asm (yyvsp[-2].ttype); ; ! break;} ! case 20: #line 521 "parse.y" ! { pop_lang_context (); ; ! break;} ! case 21: #line 523 "parse.y" ! { do_pending_inlines (); pop_lang_context (); ; ! break;} ! case 22: #line 525 "parse.y" ! { do_pending_inlines (); pop_lang_context (); ; ! break;} ! case 23: #line 527 "parse.y" ! { push_namespace (yyvsp[-1].ttype); ; ! break;} ! case 24: #line 529 "parse.y" ! { pop_namespace (); ; ! break;} ! case 25: #line 531 "parse.y" ! { push_namespace (NULL_TREE); ; ! break;} ! case 26: #line 533 "parse.y" ! { pop_namespace (); ; ! break;} ! case 28: #line 536 "parse.y" ! { do_toplevel_using_decl (yyvsp[-1].ttype); ; ! break;} ! case 30: #line 539 "parse.y" ! { pedantic = yyvsp[-1].itype; ; ! break;} ! case 31: #line 544 "parse.y" ! { begin_only_namespace_names (); ; ! break;} ! case 32: #line 546 "parse.y" ! { end_only_namespace_names (); if (lastiddecl) yyvsp[-1].ttype = lastiddecl; do_namespace_alias (yyvsp[-4].ttype, yyvsp[-1].ttype); ! ; ! break;} ! case 33: #line 556 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 34: #line 558 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 35: #line 560 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 36: #line 565 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 37: #line 567 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, global_namespace, yyvsp[0].ttype); ; ! break;} ! case 38: #line 569 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 39: #line 574 "parse.y" ! { begin_only_namespace_names (); ; ! break;} ! case 40: #line 576 "parse.y" ! { end_only_namespace_names (); /* If no declaration was found, the using-directive is invalid. Since that was not reported, we need the --- 5425,5625 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) { ! case 2: #line 456 "parse.y" ! { finish_translation_unit (); ;} ! break; ! ! case 3: #line 458 "parse.y" ! { finish_translation_unit (); ;} ! break; ! ! case 4: #line 466 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 5: #line 468 "parse.y" ! { yyval.ttype = NULL_TREE; ggc_collect (); ;} ! break; ! ! case 6: #line 470 "parse.y" ! { yyval.ttype = NULL_TREE; ggc_collect (); ;} ! break; ! ! case 9: #line 479 "parse.y" ! { have_extern_spec = 1; used_extern_spec = 0; ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 10: #line 484 "parse.y" ! { have_extern_spec = 0; ;} ! break; ! ! case 11: #line 489 "parse.y" ! { yyval.itype = pedantic; ! pedantic = 0; ;} ! break; ! ! case 13: #line 498 "parse.y" ! { if (pending_lang_change) do_pending_lang_change(); ! type_lookups = NULL_TREE; ;} ! break; ! ! case 14: #line 501 "parse.y" ! { if (! toplevel_bindings_p ()) ! pop_everything (); ;} ! break; ! ! case 15: #line 507 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 16: #line 509 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 17: #line 512 "parse.y" ! { warning ("keyword `export' not implemented, and will be ignored"); ;} ! break; ! ! case 18: #line 514 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 19: #line 516 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 20: #line 518 "parse.y" ! { if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype); ! assemble_asm (yyvsp[-2].ttype); ;} ! break; ! ! case 21: #line 521 "parse.y" ! { pop_lang_context (); ;} ! break; ! ! case 22: #line 523 "parse.y" ! { do_pending_inlines (); pop_lang_context (); ;} ! break; ! ! case 23: #line 525 "parse.y" ! { do_pending_inlines (); pop_lang_context (); ;} ! break; ! ! case 24: #line 527 "parse.y" ! { push_namespace (yyvsp[-1].ttype); ;} ! break; ! ! case 25: #line 529 "parse.y" ! { pop_namespace (); ;} ! break; ! ! case 26: #line 531 "parse.y" ! { push_namespace (NULL_TREE); ;} ! break; ! ! case 27: #line 533 "parse.y" ! { pop_namespace (); ;} ! break; ! ! case 29: #line 536 "parse.y" ! { do_toplevel_using_decl (yyvsp[-1].ttype); ;} ! break; ! ! case 31: #line 539 "parse.y" ! { pedantic = yyvsp[-1].itype; ;} ! break; ! ! case 32: #line 544 "parse.y" ! { begin_only_namespace_names (); ;} ! break; ! ! case 33: #line 546 "parse.y" ! { end_only_namespace_names (); if (lastiddecl) yyvsp[-1].ttype = lastiddecl; do_namespace_alias (yyvsp[-4].ttype, yyvsp[-1].ttype); ! ;} ! break; ! ! case 34: #line 556 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 35: #line 558 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 36: #line 560 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 37: #line 565 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 38: #line 567 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, global_namespace, yyvsp[0].ttype); ;} ! break; ! ! case 39: #line 569 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 40: #line 574 "parse.y" ! { begin_only_namespace_names (); ;} ! break; ! ! case 41: #line 576 "parse.y" ! { end_only_namespace_names (); /* If no declaration was found, the using-directive is invalid. Since that was not reported, we need the *************** case 40: *** 5247,5353 **** if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE && lastiddecl) yyvsp[-1].ttype = lastiddecl; do_using_directive (yyvsp[-1].ttype); ! ; ! break;} ! case 41: #line 589 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ; ! break;} ! case 42: #line 595 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ; ! break;} ! case 45: #line 607 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 46: #line 609 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 47: #line 614 "parse.y" ! { push_lang_context (yyvsp[0].ttype); ; ! break;} ! case 48: #line 616 "parse.y" ! { if (current_lang_name != yyvsp[0].ttype) error ("use of linkage spec `%D' is different from previous spec `%D'", yyvsp[0].ttype, current_lang_name); ! pop_lang_context (); push_lang_context (yyvsp[0].ttype); ; ! break;} ! case 49: #line 623 "parse.y" ! { begin_template_parm_list (); ; ! break;} ! case 50: #line 625 "parse.y" ! { yyval.ttype = end_template_parm_list (yyvsp[-1].ttype); ; ! break;} ! case 51: #line 630 "parse.y" ! { begin_specialization(); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 54: #line 641 "parse.y" ! { yyval.ttype = process_template_parm (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 55: #line 643 "parse.y" ! { yyval.ttype = process_template_parm (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 56: #line 648 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 57: #line 650 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 58: #line 655 "parse.y" ! { yyval.ttype = finish_template_type_parm (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 59: #line 657 "parse.y" ! { yyval.ttype = finish_template_type_parm (class_type_node, yyvsp[0].ttype); ; ! break;} ! case 60: #line 662 "parse.y" ! { yyval.ttype = finish_template_template_parm (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 61: #line 674 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 62: #line 676 "parse.y" ! { yyval.ttype = build_tree_list (groktypename (yyvsp[0].ftype.t), yyvsp[-2].ttype); ; ! break;} ! case 63: #line 678 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ; ! break;} ! case 64: #line 680 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-2].ftype.t); ; ! break;} ! case 65: #line 682 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 66: #line 684 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) != TEMPLATE_DECL && TREE_CODE (yyvsp[0].ttype) != TEMPLATE_TEMPLATE_PARM && TREE_CODE (yyvsp[0].ttype) != TYPE_DECL --- 5627,5755 ---- if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE && lastiddecl) yyvsp[-1].ttype = lastiddecl; do_using_directive (yyvsp[-1].ttype); ! ;} ! break; ! ! case 42: #line 589 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ;} ! break; ! ! case 43: #line 595 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ;} ! break; ! ! case 46: #line 607 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 47: #line 609 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 48: #line 614 "parse.y" ! { push_lang_context (yyvsp[0].ttype); ;} ! break; ! ! case 49: #line 616 "parse.y" ! { if (current_lang_name != yyvsp[0].ttype) error ("use of linkage spec `%D' is different from previous spec `%D'", yyvsp[0].ttype, current_lang_name); ! pop_lang_context (); push_lang_context (yyvsp[0].ttype); ;} ! break; ! ! case 50: #line 623 "parse.y" ! { begin_template_parm_list (); ;} ! break; ! ! case 51: #line 625 "parse.y" ! { yyval.ttype = end_template_parm_list (yyvsp[-1].ttype); ;} ! break; ! ! case 52: #line 630 "parse.y" ! { begin_specialization(); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 55: #line 641 "parse.y" ! { yyval.ttype = process_template_parm (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 56: #line 643 "parse.y" ! { yyval.ttype = process_template_parm (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 57: #line 648 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 58: #line 650 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 59: #line 655 "parse.y" ! { yyval.ttype = finish_template_type_parm (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 60: #line 657 "parse.y" ! { yyval.ttype = finish_template_type_parm (class_type_node, yyvsp[0].ttype); ;} ! break; ! ! case 61: #line 662 "parse.y" ! { yyval.ttype = finish_template_template_parm (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 62: #line 674 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 63: #line 676 "parse.y" ! { yyval.ttype = build_tree_list (groktypename (yyvsp[0].ftype.t), yyvsp[-2].ttype); ;} ! break; ! ! case 64: #line 678 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ;} ! break; ! ! case 65: #line 680 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-2].ftype.t); ;} ! break; ! ! case 66: #line 682 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 67: #line 684 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) != TEMPLATE_DECL && TREE_CODE (yyvsp[0].ttype) != TEMPLATE_TEMPLATE_PARM && TREE_CODE (yyvsp[0].ttype) != TYPE_DECL *************** case 66: *** 5357,5660 **** yyvsp[0].ttype = error_mark_node; } yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-2].ttype); ! ; ! break;} ! case 67: #line 699 "parse.y" ! { finish_template_decl (yyvsp[-1].ttype); ; ! break;} ! case 68: #line 701 "parse.y" ! { finish_template_decl (yyvsp[-1].ttype); ; ! break;} ! case 69: #line 706 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 70: #line 708 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 71: #line 710 "parse.y" ! { do_pending_inlines (); ; ! break;} ! case 72: #line 712 "parse.y" ! { do_pending_inlines (); ! pop_lang_context (); ; ! break;} ! case 73: #line 715 "parse.y" ! { do_pending_inlines (); ! pop_lang_context (); ; ! break;} ! case 74: #line 718 "parse.y" ! { pedantic = yyvsp[-1].itype; ; ! break;} ! case 76: #line 724 "parse.y" ! {; ! break;} ! case 77: #line 726 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ; ! break;} ! case 78: #line 728 "parse.y" ! { if (yyvsp[-1].ftype.t != error_mark_node) { maybe_process_partial_specialization (yyvsp[-1].ftype.t); note_got_semicolon (yyvsp[-1].ftype.t); } ! ; ! break;} ! case 80: #line 740 "parse.y" ! {; ! break;} ! case 81: #line 742 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ; ! break;} ! case 82: #line 744 "parse.y" ! { pedwarn ("empty declaration"); ; ! break;} ! case 84: #line 747 "parse.y" ! { tree t, attrs; split_specs_attrs (yyvsp[-1].ftype.t, &t, &attrs); shadow_tag (t); note_list_got_semicolon (yyvsp[-1].ftype.t); ! ; ! break;} ! case 87: #line 756 "parse.y" ! { end_input (); ; ! break;} ! case 97: #line 782 "parse.y" ! { yyval.ttype = begin_compound_stmt (/*has_no_scope=*/1); ; ! break;} ! case 98: #line 784 "parse.y" ! { STMT_LINENO (yyvsp[-1].ttype) = yyvsp[-3].itype; finish_compound_stmt (/*has_no_scope=*/1, yyvsp[-1].ttype); finish_function_body (yyvsp[-5].ttype); ! ; ! break;} ! case 99: #line 793 "parse.y" ! { expand_body (finish_function (0)); ; ! break;} ! case 100: #line 795 "parse.y" ! { expand_body (finish_function (0)); ; ! break;} ! case 101: #line 797 "parse.y" ! { ; ! break;} ! case 102: #line 802 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 103: #line 804 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 104: #line 806 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 105: #line 810 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 106: #line 812 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 107: #line 814 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 108: #line 818 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 109: #line 820 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 110: #line 822 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 111: #line 826 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 112: #line 828 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 113: #line 830 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 114: #line 837 "parse.y" ! { check_for_new_type ("return type", yyvsp[-1].ftype); if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ; ! break;} ! case 115: #line 841 "parse.y" ! { if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ; ! break;} ! case 116: #line 844 "parse.y" ! { if (!begin_function_definition (NULL_TREE, yyvsp[0].ttype)) ! YYERROR1; ; ! break;} ! case 117: #line 847 "parse.y" ! { if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ; ! break;} ! case 118: #line 850 "parse.y" ! { if (!begin_function_definition (NULL_TREE, yyvsp[0].ttype)) ! YYERROR1; ; ! break;} ! case 119: #line 859 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-5].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 120: #line 862 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 121: #line 864 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-3].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 122: #line 866 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 123: #line 868 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-5].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 124: #line 870 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-3].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 125: #line 877 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); rest_of_mdef: if (! yyval.ttype) YYERROR1; if (yychar == YYEMPTY) yychar = YYLEX; ! snarf_method (yyval.ttype); ; ! break;} ! case 126: #line 885 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ; ! break;} ! case 127: #line 888 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;; ! break;} ! case 128: #line 890 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;; ! break;} ! case 129: #line 892 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ; ! break;} ! case 130: #line 895 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;; ! break;} ! case 131: #line 897 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ; ! break;} ! case 132: #line 903 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 133: #line 910 "parse.y" ! { finish_named_return_value (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 134: #line 912 "parse.y" ! { finish_named_return_value (yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 135: #line 914 "parse.y" ! { finish_named_return_value (yyval.ttype, NULL_TREE); ; ! break;} ! case 136: #line 919 "parse.y" ! { if (! DECL_CONSTRUCTOR_P (current_function_decl)) error ("only constructors take base initializers"); else if (yyvsp[0].ftype.new_type_flag == 0) error ("no base or member initializers given following ':'"); finish_mem_initializers (yyvsp[0].ftype.t); ! ; ! break;} ! case 137: #line 931 "parse.y" ! { yyval.ttype = begin_function_body (); ! ; ! break;} ! case 138: #line 938 "parse.y" ! { yyval.ftype.new_type_flag = 0; yyval.ftype.t = NULL_TREE; ! ; ! break;} ! case 139: #line 943 "parse.y" ! { yyval.ftype.new_type_flag = 1; yyval.ftype.t = yyvsp[0].ttype; ! ; ! break;} ! case 140: #line 948 "parse.y" ! { if (yyvsp[0].ttype) { yyval.ftype.new_type_flag = 1; --- 5759,6122 ---- yyvsp[0].ttype = error_mark_node; } yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-2].ttype); ! ;} ! break; ! ! case 68: #line 699 "parse.y" ! { finish_template_decl (yyvsp[-1].ttype); ;} ! break; ! ! case 69: #line 701 "parse.y" ! { finish_template_decl (yyvsp[-1].ttype); ;} ! break; ! ! case 70: #line 706 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 71: #line 708 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 72: #line 710 "parse.y" ! { do_pending_inlines (); ;} ! break; ! ! case 73: #line 712 "parse.y" ! { do_pending_inlines (); ! pop_lang_context (); ;} ! break; ! ! case 74: #line 715 "parse.y" ! { do_pending_inlines (); ! pop_lang_context (); ;} ! break; ! ! case 75: #line 718 "parse.y" ! { pedantic = yyvsp[-1].itype; ;} ! break; ! ! case 77: #line 724 "parse.y" ! {;} ! break; ! ! case 78: #line 726 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ;} ! break; ! ! case 79: #line 728 "parse.y" ! { if (yyvsp[-1].ftype.t != error_mark_node) { maybe_process_partial_specialization (yyvsp[-1].ftype.t); note_got_semicolon (yyvsp[-1].ftype.t); } ! ;} ! break; ! ! case 81: #line 740 "parse.y" ! {;} ! break; ! ! case 82: #line 742 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ;} ! break; ! ! case 83: #line 744 "parse.y" ! { pedwarn ("empty declaration"); ;} ! break; ! ! case 85: #line 747 "parse.y" ! { tree t, attrs; split_specs_attrs (yyvsp[-1].ftype.t, &t, &attrs); shadow_tag (t); note_list_got_semicolon (yyvsp[-1].ftype.t); ! ;} ! break; ! ! case 88: #line 756 "parse.y" ! { end_input (); ;} ! break; ! ! case 98: #line 782 "parse.y" ! { yyval.ttype = begin_compound_stmt (/*has_no_scope=*/1); ;} ! break; ! ! case 99: #line 784 "parse.y" ! { STMT_LINENO (yyvsp[-1].ttype) = yyvsp[-3].itype; finish_compound_stmt (/*has_no_scope=*/1, yyvsp[-1].ttype); finish_function_body (yyvsp[-5].ttype); ! ;} ! break; ! ! case 100: #line 793 "parse.y" ! { expand_body (finish_function (0)); ;} ! break; ! ! case 101: #line 795 "parse.y" ! { expand_body (finish_function (0)); ;} ! break; ! ! case 102: #line 797 "parse.y" ! { ;} ! break; ! ! case 103: #line 802 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 104: #line 804 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 105: #line 806 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 106: #line 810 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 107: #line 812 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 108: #line 814 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 109: #line 818 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 110: #line 820 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 111: #line 822 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 112: #line 826 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 113: #line 828 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 114: #line 830 "parse.y" ! { yyval.ttype = begin_constructor_declarator (yyvsp[-4].ttype, yyvsp[-3].ttype); yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 115: #line 837 "parse.y" ! { check_for_new_type ("return type", yyvsp[-1].ftype); if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ;} ! break; ! ! case 116: #line 841 "parse.y" ! { if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ;} ! break; ! ! case 117: #line 844 "parse.y" ! { if (!begin_function_definition (NULL_TREE, yyvsp[0].ttype)) ! YYERROR1; ;} ! break; ! ! case 118: #line 847 "parse.y" ! { if (!begin_function_definition (yyvsp[-1].ftype.t, yyvsp[0].ttype)) ! YYERROR1; ;} ! break; ! ! case 119: #line 850 "parse.y" ! { if (!begin_function_definition (NULL_TREE, yyvsp[0].ttype)) ! YYERROR1; ;} ! break; ! ! case 120: #line 859 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-5].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 121: #line 862 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 122: #line 864 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-3].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 123: #line 866 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-4].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 124: #line 868 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-5].ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 125: #line 870 "parse.y" ! { yyval.ttype = make_call_declarator (yyvsp[-3].ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 126: #line 877 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); rest_of_mdef: if (! yyval.ttype) YYERROR1; if (yychar == YYEMPTY) yychar = YYLEX; ! snarf_method (yyval.ttype); ;} ! break; ! ! case 127: #line 885 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ;} ! break; ! ! case 128: #line 888 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;;} ! break; ! ! case 129: #line 890 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;;} ! break; ! ! case 130: #line 892 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ;} ! break; ! ! case 131: #line 895 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, yyvsp[-1].ftype.t, yyvsp[-1].ftype.lookups); goto rest_of_mdef;;} ! break; ! ! case 132: #line 897 "parse.y" ! { yyval.ttype = parse_method (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! goto rest_of_mdef; ;} ! break; ! ! case 133: #line 903 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 134: #line 910 "parse.y" ! { finish_named_return_value (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 135: #line 912 "parse.y" ! { finish_named_return_value (yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 136: #line 914 "parse.y" ! { finish_named_return_value (yyval.ttype, NULL_TREE); ;} ! break; ! ! case 137: #line 919 "parse.y" ! { if (! DECL_CONSTRUCTOR_P (current_function_decl)) error ("only constructors take base initializers"); else if (yyvsp[0].ftype.new_type_flag == 0) error ("no base or member initializers given following ':'"); finish_mem_initializers (yyvsp[0].ftype.t); ! ;} ! break; ! ! case 138: #line 931 "parse.y" ! { yyval.ttype = begin_function_body (); ! ;} ! break; ! ! case 139: #line 938 "parse.y" ! { yyval.ftype.new_type_flag = 0; yyval.ftype.t = NULL_TREE; ! ;} ! break; ! ! case 140: #line 943 "parse.y" ! { yyval.ftype.new_type_flag = 1; yyval.ftype.t = yyvsp[0].ttype; ! ;} ! break; ! ! case 141: #line 948 "parse.y" ! { if (yyvsp[0].ttype) { yyval.ftype.new_type_flag = 1; *************** case 140: *** 5663,5848 **** } else yyval.ftype = yyvsp[-2].ftype; ! ; ! break;} ! case 142: #line 963 "parse.y" ! { if (current_class_name) pedwarn ("anachronistic old style base class initializer"); yyval.ttype = expand_member_init (current_class_ref, NULL_TREE, yyvsp[-1].ttype); ! ; ! break;} ! case 143: #line 969 "parse.y" ! { if (current_class_name) pedwarn ("anachronistic old style base class initializer"); yyval.ttype = expand_member_init (current_class_ref, NULL_TREE, void_type_node); ! ; ! break;} ! case 144: #line 977 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 145: #line 979 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ; ! break;} ! case 146: #line 982 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 147: #line 984 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ; ! break;} ! case 148: #line 987 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 149: #line 989 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ; ! break;} ! case 150: #line 992 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 162: #line 1017 "parse.y" ! { do_type_instantiation (yyvsp[-1].ftype.t, NULL_TREE, 1); ! yyungetc (';', 1); ; ! break;} ! case 164: #line 1021 "parse.y" ! { tree specs = strip_attrs (yyvsp[-1].ftype.t); ! do_decl_instantiation (specs, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 166: #line 1025 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 168: #line 1028 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 170: #line 1031 "parse.y" ! { do_type_instantiation (yyvsp[-1].ftype.t, yyvsp[-4].ttype, 1); ! yyungetc (';', 1); ; ! break;} ! case 171: #line 1034 "parse.y" ! {; ! break;} ! case 172: #line 1037 "parse.y" ! { tree specs = strip_attrs (yyvsp[-1].ftype.t); ! do_decl_instantiation (specs, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 173: #line 1040 "parse.y" ! {; ! break;} ! case 174: #line 1042 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, yyvsp[-3].ttype); ; ! break;} ! case 175: #line 1044 "parse.y" ! {; ! break;} ! case 176: #line 1046 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, yyvsp[-3].ttype); ; ! break;} ! case 177: #line 1048 "parse.y" ! {; ! break;} ! case 178: #line 1052 "parse.y" ! { begin_explicit_instantiation(); ; ! break;} ! case 179: #line 1056 "parse.y" ! { end_explicit_instantiation(); ; ! break;} ! case 180: #line 1066 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 181: #line 1069 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 184: #line 1077 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 185: #line 1083 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 186: #line 1087 "parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = finish_template_type (yyvsp[-3].ttype, yyvsp[-1].ttype, yychar == SCOPE); ! ; ! break;} ! case 188: #line 1099 "parse.y" ! { /* Handle `Class>' without space in the `>>' */ pedwarn ("`>>' should be `> >' in template class name"); yyungetc ('>', 1); ! ; ! break;} ! case 189: #line 1108 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 191: #line 1114 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ; ! break;} ! case 192: #line 1116 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 193: #line 1121 "parse.y" ! { yyval.ttype = groktypename (yyvsp[0].ftype.t); ; ! break;} ! case 194: #line 1123 "parse.y" ! { yyval.ttype = lastiddecl; if (DECL_TEMPLATE_TEMPLATE_PARM_P (yyval.ttype)) yyval.ttype = TREE_TYPE (yyval.ttype); ! ; ! break;} ! case 195: #line 1129 "parse.y" ! { yyval.ttype = lastiddecl; if (DECL_TEMPLATE_TEMPLATE_PARM_P (yyval.ttype)) yyval.ttype = TREE_TYPE (yyval.ttype); ! ; ! break;} ! case 197: #line 1136 "parse.y" ! { if (!processing_template_decl) { error ("use of template qualifier outside template"); --- 6125,6346 ---- } else yyval.ftype = yyvsp[-2].ftype; ! ;} ! break; ! ! case 143: #line 963 "parse.y" ! { if (current_class_name) pedwarn ("anachronistic old style base class initializer"); yyval.ttype = expand_member_init (current_class_ref, NULL_TREE, yyvsp[-1].ttype); ! ;} ! break; ! ! case 144: #line 969 "parse.y" ! { if (current_class_name) pedwarn ("anachronistic old style base class initializer"); yyval.ttype = expand_member_init (current_class_ref, NULL_TREE, void_type_node); ! ;} ! break; ! ! case 145: #line 977 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 146: #line 979 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ;} ! break; ! ! case 147: #line 982 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 148: #line 984 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ;} ! break; ! ! case 149: #line 987 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 150: #line 989 "parse.y" ! { yyval.ttype = expand_member_init (current_class_ref, yyvsp[-1].ttype, ! void_type_node); ;} ! break; ! ! case 151: #line 992 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 163: #line 1017 "parse.y" ! { do_type_instantiation (yyvsp[-1].ftype.t, NULL_TREE, 1); ! yyungetc (';', 1); ;} ! break; ! ! case 165: #line 1021 "parse.y" ! { tree specs = strip_attrs (yyvsp[-1].ftype.t); ! do_decl_instantiation (specs, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 167: #line 1025 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 169: #line 1028 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 171: #line 1031 "parse.y" ! { do_type_instantiation (yyvsp[-1].ftype.t, yyvsp[-4].ttype, 1); ! yyungetc (';', 1); ;} ! break; ! ! case 172: #line 1034 "parse.y" ! {;} ! break; ! ! case 173: #line 1037 "parse.y" ! { tree specs = strip_attrs (yyvsp[-1].ftype.t); ! do_decl_instantiation (specs, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 174: #line 1040 "parse.y" ! {;} ! break; ! ! case 175: #line 1042 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, yyvsp[-3].ttype); ;} ! break; ! ! case 176: #line 1044 "parse.y" ! {;} ! break; ! ! case 177: #line 1046 "parse.y" ! { do_decl_instantiation (NULL_TREE, yyvsp[0].ttype, yyvsp[-3].ttype); ;} ! break; ! ! case 178: #line 1048 "parse.y" ! {;} ! break; ! ! case 179: #line 1052 "parse.y" ! { begin_explicit_instantiation(); ;} ! break; ! ! case 180: #line 1056 "parse.y" ! { end_explicit_instantiation(); ;} ! break; ! ! case 181: #line 1066 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 182: #line 1069 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 185: #line 1077 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 186: #line 1083 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 187: #line 1087 "parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = finish_template_type (yyvsp[-3].ttype, yyvsp[-1].ttype, yychar == SCOPE); ! ;} ! break; ! ! case 189: #line 1099 "parse.y" ! { /* Handle `Class>' without space in the `>>' */ pedwarn ("`>>' should be `> >' in template class name"); yyungetc ('>', 1); ! ;} ! break; ! ! case 190: #line 1108 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 192: #line 1114 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ;} ! break; ! ! case 193: #line 1116 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 194: #line 1121 "parse.y" ! { yyval.ttype = groktypename (yyvsp[0].ftype.t); ;} ! break; ! ! case 195: #line 1123 "parse.y" ! { yyval.ttype = lastiddecl; if (DECL_TEMPLATE_TEMPLATE_PARM_P (yyval.ttype)) yyval.ttype = TREE_TYPE (yyval.ttype); ! ;} ! break; ! ! case 196: #line 1129 "parse.y" ! { yyval.ttype = lastiddecl; if (DECL_TEMPLATE_TEMPLATE_PARM_P (yyval.ttype)) yyval.ttype = TREE_TYPE (yyval.ttype); ! ;} ! break; ! ! case 198: #line 1136 "parse.y" ! { if (!processing_template_decl) { error ("use of template qualifier outside template"); *************** case 197: *** 5850,5912 **** } else yyval.ttype = make_unbound_class_template (yyvsp[-2].ttype, yyvsp[0].ttype, 1); ! ; ! break;} ! case 198: #line 1149 "parse.y" ! { yyval.code = NEGATE_EXPR; ; ! break;} ! case 199: #line 1151 "parse.y" ! { yyval.code = CONVERT_EXPR; ; ! break;} ! case 200: #line 1153 "parse.y" ! { yyval.code = PREINCREMENT_EXPR; ; ! break;} ! case 201: #line 1155 "parse.y" ! { yyval.code = PREDECREMENT_EXPR; ; ! break;} ! case 202: #line 1157 "parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ; ! break;} ! case 203: #line 1162 "parse.y" ! { yyval.ttype = build_x_compound_expr (yyval.ttype); ; ! break;} ! case 205: #line 1168 "parse.y" ! { error ("ISO C++ forbids an empty condition for `%s'", cond_stmt_keyword); ! yyval.ttype = integer_zero_node; ; ! break;} ! case 206: #line 1172 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 207: #line 1177 "parse.y" ! { error ("ISO C++ forbids an empty condition for `%s'", cond_stmt_keyword); ! yyval.ttype = integer_zero_node; ; ! break;} ! case 208: #line 1181 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 209: #line 1186 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 211: #line 1189 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 212: #line 1194 "parse.y" ! { { tree d; for (d = getdecls (); d; d = TREE_CHAIN (d)) if (TREE_CODE (d) == TYPE_DECL) { --- 6348,6423 ---- } else yyval.ttype = make_unbound_class_template (yyvsp[-2].ttype, yyvsp[0].ttype, 1); ! ;} ! break; ! ! case 199: #line 1149 "parse.y" ! { yyval.code = NEGATE_EXPR; ;} ! break; ! ! case 200: #line 1151 "parse.y" ! { yyval.code = CONVERT_EXPR; ;} ! break; ! ! case 201: #line 1153 "parse.y" ! { yyval.code = PREINCREMENT_EXPR; ;} ! break; ! ! case 202: #line 1155 "parse.y" ! { yyval.code = PREDECREMENT_EXPR; ;} ! break; ! ! case 203: #line 1157 "parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ;} ! break; ! ! case 204: #line 1162 "parse.y" ! { yyval.ttype = build_x_compound_expr (yyval.ttype); ;} ! break; ! ! case 206: #line 1168 "parse.y" ! { error ("ISO C++ forbids an empty condition for `%s'", cond_stmt_keyword); ! yyval.ttype = integer_zero_node; ;} ! break; ! ! case 207: #line 1172 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 208: #line 1177 "parse.y" ! { error ("ISO C++ forbids an empty condition for `%s'", cond_stmt_keyword); ! yyval.ttype = integer_zero_node; ;} ! break; ! ! case 209: #line 1181 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 210: #line 1186 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 212: #line 1189 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 213: #line 1194 "parse.y" ! { { tree d; for (d = getdecls (); d; d = TREE_CHAIN (d)) if (TREE_CODE (d) == TYPE_DECL) { *************** case 212: *** 5919,6100 **** } current_declspecs = yyvsp[-4].ftype.t; yyval.ttype = parse_decl (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ! ; ! break;} ! case 213: #line 1209 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); yyval.ttype = convert_from_reference (yyvsp[-1].ttype); if (TREE_CODE (TREE_TYPE (yyval.ttype)) == ARRAY_TYPE) error ("definition of array `%#D' in condition", yyval.ttype); ! ; ! break;} ! case 219: #line 1227 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyval.ttype, ! build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 220: #line 1230 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyval.ttype, ! build_tree_list (NULL_TREE, error_mark_node)); ; ! break;} ! case 221: #line 1233 "parse.y" ! { chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 222: #line 1235 "parse.y" ! { chainon (yyval.ttype, build_tree_list (NULL_TREE, error_mark_node)); ; ! break;} ! case 223: #line 1240 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ; ! break;} ! case 225: #line 1246 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 226: #line 1249 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! pedantic = yyvsp[-1].itype; ; ! break;} ! case 227: #line 1252 "parse.y" ! { yyval.ttype = build_x_indirect_ref (yyvsp[0].ttype, "unary *"); ; ! break;} ! case 228: #line 1254 "parse.y" ! { yyval.ttype = build_x_unary_op (ADDR_EXPR, yyvsp[0].ttype); ; ! break;} ! case 229: #line 1256 "parse.y" ! { yyval.ttype = build_x_unary_op (BIT_NOT_EXPR, yyvsp[0].ttype); ; ! break;} ! case 230: #line 1258 "parse.y" ! { yyval.ttype = finish_unary_op_expr (yyvsp[-1].code, yyvsp[0].ttype); ; ! break;} ! case 231: #line 1261 "parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ; ! break;} ! case 232: #line 1263 "parse.y" ! { yyval.ttype = finish_sizeof (yyvsp[0].ttype); ! skip_evaluation--; ; ! break;} ! case 233: #line 1266 "parse.y" ! { yyval.ttype = finish_sizeof (groktypename (yyvsp[-1].ftype.t)); check_for_new_type ("sizeof", yyvsp[-1].ftype); ! skip_evaluation--; ; ! break;} ! case 234: #line 1270 "parse.y" ! { yyval.ttype = finish_alignof (yyvsp[0].ttype); ! skip_evaluation--; ; ! break;} ! case 235: #line 1273 "parse.y" ! { yyval.ttype = finish_alignof (groktypename (yyvsp[-1].ftype.t)); check_for_new_type ("alignof", yyvsp[-1].ftype); ! skip_evaluation--; ; ! break;} ! case 236: #line 1280 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, yyvsp[0].ftype.t, NULL_TREE, yyvsp[-1].itype); ! check_for_new_type ("new", yyvsp[0].ftype); ; ! break;} ! case 237: #line 1283 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype, yyvsp[-2].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ; ! break;} ! case 238: #line 1286 "parse.y" ! { yyval.ttype = build_new (yyvsp[-1].ttype, yyvsp[0].ftype.t, NULL_TREE, yyvsp[-2].itype); ! check_for_new_type ("new", yyvsp[0].ftype); ; ! break;} ! case 239: #line 1289 "parse.y" ! { yyval.ttype = build_new (yyvsp[-2].ttype, yyvsp[-1].ftype.t, yyvsp[0].ttype, yyvsp[-3].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ; ! break;} ! case 240: #line 1293 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, groktypename(yyvsp[-1].ftype.t), NULL_TREE, yyvsp[-3].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ; ! break;} ! case 241: #line 1297 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, groktypename(yyvsp[-2].ftype.t), yyvsp[0].ttype, yyvsp[-4].itype); ! check_for_new_type ("new", yyvsp[-2].ftype); ; ! break;} ! case 242: #line 1300 "parse.y" ! { yyval.ttype = build_new (yyvsp[-3].ttype, groktypename(yyvsp[-1].ftype.t), NULL_TREE, yyvsp[-4].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ; ! break;} ! case 243: #line 1303 "parse.y" ! { yyval.ttype = build_new (yyvsp[-4].ttype, groktypename(yyvsp[-2].ftype.t), yyvsp[0].ttype, yyvsp[-5].itype); ! check_for_new_type ("new", yyvsp[-2].ftype); ; ! break;} ! case 244: #line 1307 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, NULL_TREE, 0, yyvsp[-1].itype); ; ! break;} ! case 245: #line 1309 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, NULL_TREE, 1, yyvsp[-3].itype); if (yychar == YYEMPTY) ! yychar = YYLEX; ; ! break;} ! case 246: #line 1313 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, yyvsp[-2].ttype, 2, yyvsp[-4].itype); if (yychar == YYEMPTY) ! yychar = YYLEX; ; ! break;} ! case 247: #line 1317 "parse.y" ! { yyval.ttype = build_x_unary_op (REALPART_EXPR, yyvsp[0].ttype); ; ! break;} ! case 248: #line 1319 "parse.y" ! { yyval.ttype = build_x_unary_op (IMAGPART_EXPR, yyvsp[0].ttype); ; ! break;} ! case 249: #line 1324 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 250: #line 1326 "parse.y" ! { pedwarn ("old style placement syntax, use () instead"); ! yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 251: #line 1332 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 252: #line 1334 "parse.y" ! { yyval.ttype = void_zero_node; ; ! break;} ! case 253: #line 1336 "parse.y" ! { error ("`%T' is not a valid expression", yyvsp[-1].ftype.t); yyval.ttype = error_mark_node; ! ; ! break;} ! case 254: #line 1346 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids initialization of new expression with `='"); cp_deprecated ("new initializer lists extension"); --- 6430,6647 ---- } current_declspecs = yyvsp[-4].ftype.t; yyval.ttype = parse_decl (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ! ;} ! break; ! ! case 214: #line 1209 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); yyval.ttype = convert_from_reference (yyvsp[-1].ttype); if (TREE_CODE (TREE_TYPE (yyval.ttype)) == ARRAY_TYPE) error ("definition of array `%#D' in condition", yyval.ttype); ! ;} ! break; ! ! case 220: #line 1227 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyval.ttype, ! build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 221: #line 1230 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyval.ttype, ! build_tree_list (NULL_TREE, error_mark_node)); ;} ! break; ! ! case 222: #line 1233 "parse.y" ! { chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 223: #line 1235 "parse.y" ! { chainon (yyval.ttype, build_tree_list (NULL_TREE, error_mark_node)); ;} ! break; ! ! case 224: #line 1240 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ;} ! break; ! ! case 226: #line 1246 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 227: #line 1249 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! pedantic = yyvsp[-1].itype; ;} ! break; ! ! case 228: #line 1252 "parse.y" ! { yyval.ttype = build_x_indirect_ref (yyvsp[0].ttype, "unary *"); ;} ! break; ! ! case 229: #line 1254 "parse.y" ! { yyval.ttype = build_x_unary_op (ADDR_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 230: #line 1256 "parse.y" ! { yyval.ttype = build_x_unary_op (BIT_NOT_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 231: #line 1258 "parse.y" ! { yyval.ttype = finish_unary_op_expr (yyvsp[-1].code, yyvsp[0].ttype); ;} ! break; ! ! case 232: #line 1261 "parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ;} ! break; ! ! case 233: #line 1263 "parse.y" ! { yyval.ttype = finish_sizeof (yyvsp[0].ttype); ! skip_evaluation--; ;} ! break; ! ! case 234: #line 1266 "parse.y" ! { yyval.ttype = finish_sizeof (groktypename (yyvsp[-1].ftype.t)); check_for_new_type ("sizeof", yyvsp[-1].ftype); ! skip_evaluation--; ;} ! break; ! ! case 235: #line 1270 "parse.y" ! { yyval.ttype = finish_alignof (yyvsp[0].ttype); ! skip_evaluation--; ;} ! break; ! ! case 236: #line 1273 "parse.y" ! { yyval.ttype = finish_alignof (groktypename (yyvsp[-1].ftype.t)); check_for_new_type ("alignof", yyvsp[-1].ftype); ! skip_evaluation--; ;} ! break; ! ! case 237: #line 1280 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, yyvsp[0].ftype.t, NULL_TREE, yyvsp[-1].itype); ! check_for_new_type ("new", yyvsp[0].ftype); ;} ! break; ! ! case 238: #line 1283 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype, yyvsp[-2].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ;} ! break; ! ! case 239: #line 1286 "parse.y" ! { yyval.ttype = build_new (yyvsp[-1].ttype, yyvsp[0].ftype.t, NULL_TREE, yyvsp[-2].itype); ! check_for_new_type ("new", yyvsp[0].ftype); ;} ! break; ! ! case 240: #line 1289 "parse.y" ! { yyval.ttype = build_new (yyvsp[-2].ttype, yyvsp[-1].ftype.t, yyvsp[0].ttype, yyvsp[-3].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ;} ! break; ! ! case 241: #line 1293 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, groktypename(yyvsp[-1].ftype.t), NULL_TREE, yyvsp[-3].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ;} ! break; ! ! case 242: #line 1297 "parse.y" ! { yyval.ttype = build_new (NULL_TREE, groktypename(yyvsp[-2].ftype.t), yyvsp[0].ttype, yyvsp[-4].itype); ! check_for_new_type ("new", yyvsp[-2].ftype); ;} ! break; ! ! case 243: #line 1300 "parse.y" ! { yyval.ttype = build_new (yyvsp[-3].ttype, groktypename(yyvsp[-1].ftype.t), NULL_TREE, yyvsp[-4].itype); ! check_for_new_type ("new", yyvsp[-1].ftype); ;} ! break; ! ! case 244: #line 1303 "parse.y" ! { yyval.ttype = build_new (yyvsp[-4].ttype, groktypename(yyvsp[-2].ftype.t), yyvsp[0].ttype, yyvsp[-5].itype); ! check_for_new_type ("new", yyvsp[-2].ftype); ;} ! break; ! ! case 245: #line 1307 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, NULL_TREE, 0, yyvsp[-1].itype); ;} ! break; ! ! case 246: #line 1309 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, NULL_TREE, 1, yyvsp[-3].itype); if (yychar == YYEMPTY) ! yychar = YYLEX; ;} ! break; ! ! case 247: #line 1313 "parse.y" ! { yyval.ttype = delete_sanity (yyvsp[0].ttype, yyvsp[-2].ttype, 2, yyvsp[-4].itype); if (yychar == YYEMPTY) ! yychar = YYLEX; ;} ! break; ! ! case 248: #line 1317 "parse.y" ! { yyval.ttype = build_x_unary_op (REALPART_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 249: #line 1319 "parse.y" ! { yyval.ttype = build_x_unary_op (IMAGPART_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 250: #line 1324 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 251: #line 1326 "parse.y" ! { pedwarn ("old style placement syntax, use () instead"); ! yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 252: #line 1332 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 253: #line 1334 "parse.y" ! { yyval.ttype = void_zero_node; ;} ! break; ! ! case 254: #line 1336 "parse.y" ! { error ("`%T' is not a valid expression", yyvsp[-1].ftype.t); yyval.ttype = error_mark_node; ! ;} ! break; ! ! case 255: #line 1346 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids initialization of new expression with `='"); cp_deprecated ("new initializer lists extension"); *************** case 254: *** 6103,6129 **** yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 255: #line 1361 "parse.y" ! { yyvsp[-1].ftype.t = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), 0); yyval.ttype = make_call_declarator (NULL_TREE, yyvsp[-1].ftype.t, NULL_TREE, NULL_TREE); ! check_for_new_type ("cast", yyvsp[-1].ftype); ; ! break;} ! case 256: #line 1365 "parse.y" ! { yyvsp[-1].ftype.t = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), 0); yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-1].ftype.t, NULL_TREE, NULL_TREE); ! check_for_new_type ("cast", yyvsp[-1].ftype); ; ! break;} ! case 258: #line 1373 "parse.y" ! { yyval.ttype = reparse_absdcl_as_casts (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 259: #line 1375 "parse.y" ! { tree init = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); if (pedantic) --- 6650,6680 ---- yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 256: #line 1361 "parse.y" ! { yyvsp[-1].ftype.t = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), 0); yyval.ttype = make_call_declarator (NULL_TREE, yyvsp[-1].ftype.t, NULL_TREE, NULL_TREE); ! check_for_new_type ("cast", yyvsp[-1].ftype); ;} ! break; ! ! case 257: #line 1365 "parse.y" ! { yyvsp[-1].ftype.t = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), 0); yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-1].ftype.t, NULL_TREE, NULL_TREE); ! check_for_new_type ("cast", yyvsp[-1].ftype); ;} ! break; ! ! case 259: #line 1373 "parse.y" ! { yyval.ttype = reparse_absdcl_as_casts (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 260: #line 1375 "parse.y" ! { tree init = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); if (pedantic) *************** case 259: *** 6132,6342 **** TREE_HAS_CONSTRUCTOR (init) = 1; yyval.ttype = reparse_absdcl_as_casts (yyval.ttype, init); ! ; ! break;} ! case 261: #line 1391 "parse.y" ! { yyval.ttype = build_x_binary_op (MEMBER_REF, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 262: #line 1393 "parse.y" ! { yyval.ttype = build_m_component_ref (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 263: #line 1395 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 264: #line 1397 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 265: #line 1399 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 266: #line 1401 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 267: #line 1403 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 268: #line 1405 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 269: #line 1407 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 270: #line 1409 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 271: #line 1411 "parse.y" ! { yyval.ttype = build_x_binary_op (LT_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 272: #line 1413 "parse.y" ! { yyval.ttype = build_x_binary_op (GT_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 273: #line 1415 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 274: #line 1417 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 275: #line 1419 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 276: #line 1421 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 277: #line 1423 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 278: #line 1425 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ANDIF_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 279: #line 1427 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ORIF_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 280: #line 1429 "parse.y" ! { yyval.ttype = build_x_conditional_expr (yyval.ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 281: #line 1431 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, NOP_EXPR, yyvsp[0].ttype); if (yyval.ttype != error_mark_node) ! C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ; ! break;} ! case 282: #line 1435 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, yyvsp[-1].code, yyvsp[0].ttype); ; ! break;} ! case 283: #line 1437 "parse.y" ! { yyval.ttype = build_throw (NULL_TREE); ; ! break;} ! case 284: #line 1439 "parse.y" ! { yyval.ttype = build_throw (yyvsp[0].ttype); ; ! break;} ! case 286: #line 1446 "parse.y" ! { yyval.ttype = build_x_binary_op (MEMBER_REF, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 287: #line 1448 "parse.y" ! { yyval.ttype = build_m_component_ref (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 288: #line 1450 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 289: #line 1452 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 290: #line 1454 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 291: #line 1456 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 292: #line 1458 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 293: #line 1460 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 294: #line 1462 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 295: #line 1464 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 296: #line 1466 "parse.y" ! { yyval.ttype = build_x_binary_op (LT_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 297: #line 1468 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 298: #line 1470 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 299: #line 1472 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 300: #line 1474 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 301: #line 1476 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 302: #line 1478 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ANDIF_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 303: #line 1480 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ORIF_EXPR, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 304: #line 1482 "parse.y" ! { yyval.ttype = build_x_conditional_expr (yyval.ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 305: #line 1484 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, NOP_EXPR, yyvsp[0].ttype); if (yyval.ttype != error_mark_node) ! C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ; ! break;} ! case 306: #line 1488 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, yyvsp[-1].code, yyvsp[0].ttype); ; ! break;} ! case 307: #line 1490 "parse.y" ! { yyval.ttype = build_throw (NULL_TREE); ; ! break;} ! case 308: #line 1492 "parse.y" ! { yyval.ttype = build_throw (yyvsp[0].ttype); ; ! break;} ! case 309: #line 1497 "parse.y" ! { yyval.ttype = build_nt (BIT_NOT_EXPR, yyvsp[0].ttype); ; ! break;} ! case 310: #line 1499 "parse.y" ! { yyval.ttype = build_nt (BIT_NOT_EXPR, yyvsp[0].ttype); ; ! break;} ! case 316: #line 1508 "parse.y" ! { /* If lastiddecl is a TREE_LIST, it's a baselink, which means that we're in an expression like S::f, so don't do_identifier; we only do that for unqualified --- 6683,6943 ---- TREE_HAS_CONSTRUCTOR (init) = 1; yyval.ttype = reparse_absdcl_as_casts (yyval.ttype, init); ! ;} ! break; ! ! case 262: #line 1391 "parse.y" ! { yyval.ttype = build_x_binary_op (MEMBER_REF, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 263: #line 1393 "parse.y" ! { yyval.ttype = build_m_component_ref (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 264: #line 1395 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 265: #line 1397 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 266: #line 1399 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 267: #line 1401 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 268: #line 1403 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 269: #line 1405 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 270: #line 1407 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 271: #line 1409 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 272: #line 1411 "parse.y" ! { yyval.ttype = build_x_binary_op (LT_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 273: #line 1413 "parse.y" ! { yyval.ttype = build_x_binary_op (GT_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 274: #line 1415 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 275: #line 1417 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 276: #line 1419 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 277: #line 1421 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 278: #line 1423 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 279: #line 1425 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ANDIF_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 280: #line 1427 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ORIF_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 281: #line 1429 "parse.y" ! { yyval.ttype = build_x_conditional_expr (yyval.ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 282: #line 1431 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, NOP_EXPR, yyvsp[0].ttype); if (yyval.ttype != error_mark_node) ! C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ;} ! break; ! ! case 283: #line 1435 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, yyvsp[-1].code, yyvsp[0].ttype); ;} ! break; ! ! case 284: #line 1437 "parse.y" ! { yyval.ttype = build_throw (NULL_TREE); ;} ! break; ! ! case 285: #line 1439 "parse.y" ! { yyval.ttype = build_throw (yyvsp[0].ttype); ;} ! break; ! ! case 287: #line 1446 "parse.y" ! { yyval.ttype = build_x_binary_op (MEMBER_REF, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 288: #line 1448 "parse.y" ! { yyval.ttype = build_m_component_ref (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 289: #line 1450 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 290: #line 1452 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 291: #line 1454 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 292: #line 1456 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 293: #line 1458 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 294: #line 1460 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 295: #line 1462 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 296: #line 1464 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 297: #line 1466 "parse.y" ! { yyval.ttype = build_x_binary_op (LT_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 298: #line 1468 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 299: #line 1470 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 300: #line 1472 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 301: #line 1474 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 302: #line 1476 "parse.y" ! { yyval.ttype = build_x_binary_op (yyvsp[-1].code, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 303: #line 1478 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ANDIF_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 304: #line 1480 "parse.y" ! { yyval.ttype = build_x_binary_op (TRUTH_ORIF_EXPR, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 305: #line 1482 "parse.y" ! { yyval.ttype = build_x_conditional_expr (yyval.ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 306: #line 1484 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, NOP_EXPR, yyvsp[0].ttype); if (yyval.ttype != error_mark_node) ! C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ;} ! break; ! ! case 307: #line 1488 "parse.y" ! { yyval.ttype = build_x_modify_expr (yyval.ttype, yyvsp[-1].code, yyvsp[0].ttype); ;} ! break; ! ! case 308: #line 1490 "parse.y" ! { yyval.ttype = build_throw (NULL_TREE); ;} ! break; ! ! case 309: #line 1492 "parse.y" ! { yyval.ttype = build_throw (yyvsp[0].ttype); ;} ! break; ! ! case 310: #line 1497 "parse.y" ! { yyval.ttype = build_nt (BIT_NOT_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 311: #line 1499 "parse.y" ! { yyval.ttype = build_nt (BIT_NOT_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 317: #line 1508 "parse.y" ! { /* If lastiddecl is a TREE_LIST, it's a baselink, which means that we're in an expression like S::f, so don't do_identifier; we only do that for unqualified *************** case 316: *** 6345,6416 **** yyval.ttype = do_identifier (yyvsp[-1].ttype, 3, NULL_TREE); else yyval.ttype = yyvsp[-1].ttype; ! ; ! break;} ! case 317: #line 1522 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 318: #line 1524 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 319: #line 1529 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 320: #line 1531 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 321: #line 1534 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 326: #line 1546 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 328: #line 1556 "parse.y" ! { yyval.ttype = build_nt (INDIRECT_REF, yyvsp[0].ttype); ; ! break;} ! case 329: #line 1558 "parse.y" ! { yyval.ttype = build_nt (ADDR_EXPR, yyvsp[0].ttype); ; ! break;} ! case 330: #line 1560 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 331: #line 1565 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 332: #line 1567 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 336: #line 1577 "parse.y" ! { yyval.ttype = finish_decl_parsing (yyvsp[-1].ttype); ; ! break;} ! case 337: #line 1582 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == BIT_NOT_EXPR) yyval.ttype = build_x_unary_op (BIT_NOT_EXPR, TREE_OPERAND (yyvsp[0].ttype, 0)); else yyval.ttype = finish_id_expr (yyvsp[0].ttype); ! ; ! break;} ! case 340: #line 1591 "parse.y" ! { yyval.ttype = combine_strings (yyval.ttype); /* combine_strings doesn't set up TYPE_MAIN_VARIANT of a const array the way we want, so fix it. */ --- 6946,7031 ---- yyval.ttype = do_identifier (yyvsp[-1].ttype, 3, NULL_TREE); else yyval.ttype = yyvsp[-1].ttype; ! ;} ! break; ! ! case 318: #line 1522 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 319: #line 1524 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 320: #line 1529 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 321: #line 1531 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 322: #line 1534 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 327: #line 1546 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 329: #line 1556 "parse.y" ! { yyval.ttype = build_nt (INDIRECT_REF, yyvsp[0].ttype); ;} ! break; ! ! case 330: #line 1558 "parse.y" ! { yyval.ttype = build_nt (ADDR_EXPR, yyvsp[0].ttype); ;} ! break; ! ! case 331: #line 1560 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 332: #line 1565 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 333: #line 1567 "parse.y" ! { yyval.ttype = lookup_template_function (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 337: #line 1577 "parse.y" ! { yyval.ttype = finish_decl_parsing (yyvsp[-1].ttype); ;} ! break; ! ! case 338: #line 1582 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == BIT_NOT_EXPR) yyval.ttype = build_x_unary_op (BIT_NOT_EXPR, TREE_OPERAND (yyvsp[0].ttype, 0)); else yyval.ttype = finish_id_expr (yyvsp[0].ttype); ! ;} ! break; ! ! case 341: #line 1591 "parse.y" ! { yyval.ttype = combine_strings (yyval.ttype); /* combine_strings doesn't set up TYPE_MAIN_VARIANT of a const array the way we want, so fix it. */ *************** case 340: *** 6418,6449 **** TREE_TYPE (yyval.ttype) = build_cplus_array_type (TREE_TYPE (TREE_TYPE (yyval.ttype)), TYPE_DOMAIN (TREE_TYPE (yyval.ttype))); ! ; ! break;} ! case 341: #line 1601 "parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); if (processing_template_decl) yyval.ttype = build_min_nt (LOOKUP_EXPR, DECL_NAME (yyval.ttype)); ! ; ! break;} ! case 342: #line 1607 "parse.y" ! { yyval.ttype = finish_parenthesized_expr (yyvsp[-1].ttype); ; ! break;} ! case 343: #line 1609 "parse.y" ! { yyvsp[-1].ttype = reparse_decl_as_expr (NULL_TREE, yyvsp[-1].ttype); ! yyval.ttype = finish_parenthesized_expr (yyvsp[-1].ttype); ; ! break;} ! case 344: #line 1612 "parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 345: #line 1614 "parse.y" ! { tree scope = current_scope (); if (!scope || TREE_CODE (scope) != FUNCTION_DECL) { error ("braced-group within expression allowed only inside a function"); --- 7033,7069 ---- TREE_TYPE (yyval.ttype) = build_cplus_array_type (TREE_TYPE (TREE_TYPE (yyval.ttype)), TYPE_DOMAIN (TREE_TYPE (yyval.ttype))); ! ;} ! break; ! ! case 342: #line 1601 "parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); if (processing_template_decl) yyval.ttype = build_min_nt (LOOKUP_EXPR, DECL_NAME (yyval.ttype)); ! ;} ! break; ! ! case 343: #line 1607 "parse.y" ! { yyval.ttype = finish_parenthesized_expr (yyvsp[-1].ttype); ;} ! break; ! ! case 344: #line 1609 "parse.y" ! { yyvsp[-1].ttype = reparse_decl_as_expr (NULL_TREE, yyvsp[-1].ttype); ! yyval.ttype = finish_parenthesized_expr (yyvsp[-1].ttype); ;} ! break; ! ! case 345: #line 1612 "parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 346: #line 1614 "parse.y" ! { tree scope = current_scope (); if (!scope || TREE_CODE (scope) != FUNCTION_DECL) { error ("braced-group within expression allowed only inside a function"); *************** case 345: *** 6452,6503 **** if (pedantic) pedwarn ("ISO C++ forbids braced-groups within expressions"); yyval.ttype = begin_stmt_expr (); ! ; ! break;} ! case 346: #line 1625 "parse.y" ! { yyval.ttype = finish_stmt_expr (yyvsp[-2].ttype); ; ! break;} ! case 347: #line 1630 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ; ! break;} ! case 348: #line 1632 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-1].ttype, NULL_TREE, 1); ; ! break;} ! case 349: #line 1634 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 350: #line 1636 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-1].ttype, NULL_TREE, 0); ; ! break;} ! case 351: #line 1638 "parse.y" ! { yyval.ttype = build_x_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ftype.t)); ! check_for_new_type ("__builtin_va_arg", yyvsp[-1].ftype); ; ! break;} ! case 352: #line 1641 "parse.y" ! { yyval.ttype = grok_array_decl (yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 353: #line 1643 "parse.y" ! { yyval.ttype = finish_increment_expr (yyvsp[-1].ttype, POSTINCREMENT_EXPR); ; ! break;} ! case 354: #line 1645 "parse.y" ! { yyval.ttype = finish_increment_expr (yyvsp[-1].ttype, POSTDECREMENT_EXPR); ; ! break;} ! case 355: #line 1648 "parse.y" ! { yyval.ttype = finish_this_expr (); ; ! break;} ! case 356: #line 1650 "parse.y" ! { /* This is a C cast in C++'s `functional' notation using the "implicit int" extension so that: `const (3)' is equivalent to `const int (3)'. */ --- 7072,7134 ---- if (pedantic) pedwarn ("ISO C++ forbids braced-groups within expressions"); yyval.ttype = begin_stmt_expr (); ! ;} ! break; ! ! case 347: #line 1625 "parse.y" ! { yyval.ttype = finish_stmt_expr (yyvsp[-2].ttype); ;} ! break; ! ! case 348: #line 1630 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ;} ! break; ! ! case 349: #line 1632 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-1].ttype, NULL_TREE, 1); ;} ! break; ! ! case 350: #line 1634 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 351: #line 1636 "parse.y" ! { yyval.ttype = finish_call_expr (yyvsp[-1].ttype, NULL_TREE, 0); ;} ! break; ! ! case 352: #line 1638 "parse.y" ! { yyval.ttype = build_x_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ftype.t)); ! check_for_new_type ("__builtin_va_arg", yyvsp[-1].ftype); ;} ! break; ! ! case 353: #line 1641 "parse.y" ! { yyval.ttype = grok_array_decl (yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 354: #line 1643 "parse.y" ! { yyval.ttype = finish_increment_expr (yyvsp[-1].ttype, POSTINCREMENT_EXPR); ;} ! break; ! ! case 355: #line 1645 "parse.y" ! { yyval.ttype = finish_increment_expr (yyvsp[-1].ttype, POSTDECREMENT_EXPR); ;} ! break; ! ! case 356: #line 1648 "parse.y" ! { yyval.ttype = finish_this_expr (); ;} ! break; ! ! case 357: #line 1650 "parse.y" ! { /* This is a C cast in C++'s `functional' notation using the "implicit int" extension so that: `const (3)' is equivalent to `const int (3)'. */ *************** case 356: *** 6506,6910 **** type = hash_tree_cons (NULL_TREE, yyvsp[-3].ttype, NULL_TREE); type = groktypename (build_tree_list (type, NULL_TREE)); yyval.ttype = build_functional_cast (type, yyvsp[-1].ttype); ! ; ! break;} ! case 358: #line 1662 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("dynamic_cast", yyvsp[-4].ftype); ! yyval.ttype = build_dynamic_cast (type, yyvsp[-1].ttype); ; ! break;} ! case 359: #line 1666 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("static_cast", yyvsp[-4].ftype); ! yyval.ttype = build_static_cast (type, yyvsp[-1].ttype); ; ! break;} ! case 360: #line 1670 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("reinterpret_cast", yyvsp[-4].ftype); ! yyval.ttype = build_reinterpret_cast (type, yyvsp[-1].ttype); ; ! break;} ! case 361: #line 1674 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("const_cast", yyvsp[-4].ftype); ! yyval.ttype = build_const_cast (type, yyvsp[-1].ttype); ; ! break;} ! case 362: #line 1678 "parse.y" ! { yyval.ttype = build_typeid (yyvsp[-1].ttype); ; ! break;} ! case 363: #line 1680 "parse.y" ! { tree type = groktypename (yyvsp[-1].ftype.t); check_for_new_type ("typeid", yyvsp[-1].ftype); ! yyval.ttype = get_typeid (type); ; ! break;} ! case 364: #line 1684 "parse.y" ! { yyval.ttype = do_scoped_id (yyvsp[0].ttype, 1); ; ! break;} ! case 365: #line 1686 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 366: #line 1688 "parse.y" ! { got_scope = NULL_TREE; if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = do_scoped_id (yyvsp[0].ttype, 1); else yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 367: #line 1696 "parse.y" ! { yyval.ttype = build_offset_ref (OP0 (yyval.ttype), OP1 (yyval.ttype)); ; ! break;} ! case 368: #line 1698 "parse.y" ! { yyval.ttype = finish_qualified_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 369: #line 1700 "parse.y" ! { yyval.ttype = finish_qualified_call_expr (yyvsp[-1].ttype, NULL_TREE); ; ! break;} ! case 370: #line 1702 "parse.y" ! { yyval.ttype = build_x_component_ref (yyval.ttype, yyvsp[0].ttype, NULL_TREE, 1); ! ; ! break;} ! case 371: #line 1706 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ; ! break;} ! case 372: #line 1708 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 373: #line 1710 "parse.y" ! { yyval.ttype = build_x_component_ref (yyval.ttype, yyvsp[0].ttype, NULL_TREE, 1); ; ! break;} ! case 374: #line 1712 "parse.y" ! { if (processing_template_decl) yyval.ttype = build_min_nt (COMPONENT_REF, yyvsp[-1].ttype, yyvsp[0].ttype); else ! yyval.ttype = build_object_ref (yyval.ttype, OP0 (yyvsp[0].ttype), OP1 (yyvsp[0].ttype)); ; ! break;} ! case 375: #line 1717 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ; ! break;} ! case 376: #line 1719 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 377: #line 1721 "parse.y" ! { yyval.ttype = finish_qualified_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ; ! break;} ! case 378: #line 1723 "parse.y" ! { yyval.ttype = finish_qualified_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 379: #line 1726 "parse.y" ! { yyval.ttype = finish_pseudo_destructor_call_expr (yyvsp[-3].ttype, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 380: #line 1728 "parse.y" ! { yyval.ttype = finish_pseudo_destructor_call_expr (yyvsp[-5].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ; ! break;} ! case 381: #line 1730 "parse.y" ! { yyval.ttype = error_mark_node; ! ; ! break;} ! case 382: #line 1775 "parse.y" ! { yyval.itype = 0; ; ! break;} ! case 383: #line 1777 "parse.y" ! { got_scope = NULL_TREE; yyval.itype = 1; ; ! break;} ! case 384: #line 1782 "parse.y" ! { yyval.itype = 0; ; ! break;} ! case 385: #line 1784 "parse.y" ! { got_scope = NULL_TREE; yyval.itype = 1; ; ! break;} ! case 386: #line 1789 "parse.y" ! { yyval.ttype = boolean_true_node; ; ! break;} ! case 387: #line 1791 "parse.y" ! { yyval.ttype = boolean_false_node; ; ! break;} ! case 389: #line 1798 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 390: #line 1803 "parse.y" ! { if (DECL_CONSTRUCTOR_P (current_function_decl)) finish_mem_initializers (NULL_TREE); ! ; ! break;} ! case 391: #line 1811 "parse.y" ! { got_object = TREE_TYPE (yyval.ttype); ; ! break;} ! case 392: #line 1813 "parse.y" ! { yyval.ttype = build_x_arrow (yyval.ttype); got_object = TREE_TYPE (yyval.ttype); ! ; ! break;} ! case 393: #line 1821 "parse.y" ! { if (yyvsp[-2].ftype.t && IS_AGGR_TYPE_CODE (TREE_CODE (yyvsp[-2].ftype.t))) note_got_semicolon (yyvsp[-2].ftype.t); ! ; ! break;} ! case 394: #line 1826 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ! ; ! break;} ! case 395: #line 1830 "parse.y" ! {; ! break;} ! case 396: #line 1832 "parse.y" ! { shadow_tag (yyvsp[-1].ftype.t); note_list_got_semicolon (yyvsp[-1].ftype.t); ! ; ! break;} ! case 397: #line 1837 "parse.y" ! { warning ("empty declaration"); ; ! break;} ! case 398: #line 1839 "parse.y" ! { pedantic = yyvsp[-1].itype; ; ! break;} ! case 401: #line 1853 "parse.y" ! { yyval.ttype = make_call_declarator (NULL_TREE, empty_parms (), ! NULL_TREE, NULL_TREE); ; ! break;} ! case 402: #line 1856 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), NULL_TREE, ! NULL_TREE); ; ! break;} ! case 403: #line 1863 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 404: #line 1866 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 405: #line 1869 "parse.y" ! { yyval.ftype.t = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 406: #line 1873 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 407: #line 1876 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 408: #line 1887 "parse.y" ! { yyval.ftype.lookups = type_lookups; ; ! break;} ! case 409: #line 1889 "parse.y" ! { yyval.ftype.lookups = type_lookups; ; ! break;} ! case 410: #line 1894 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 411: #line 1897 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 412: #line 1900 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-2].ftype.t, chainon (yyvsp[-1].ttype, yyvsp[0].ttype)); ! yyval.ftype.new_type_flag = yyvsp[-2].ftype.new_type_flag; ; ! break;} ! case 413: #line 1903 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 414: #line 1906 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 415: #line 1909 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-2].ftype.t, chainon (yyvsp[-1].ttype, chainon (yyvsp[0].ttype, yyvsp[-3].ftype.t))); ! yyval.ftype.new_type_flag = yyvsp[-2].ftype.new_type_flag; ; ! break;} ! case 416: #line 1916 "parse.y" ! { if (extra_warnings) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyval.ttype)); ! yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ; ! break;} ! case 417: #line 1921 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyval.ttype); ; ! break;} ! case 418: #line 1923 "parse.y" ! { if (extra_warnings) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); ! yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ; ! break;} ! case 419: #line 1945 "parse.y" ! { yyval.ftype.lookups = NULL_TREE; TREE_STATIC (yyval.ftype.t) = 1; ; ! break;} ! case 420: #line 1947 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! ; ! break;} ! case 421: #line 1952 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); TREE_STATIC (yyval.ftype.t) = 1; ! ; ! break;} ! case 422: #line 1957 "parse.y" ! { if (extra_warnings && TREE_STATIC (yyval.ftype.t)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); TREE_STATIC (yyval.ftype.t) = TREE_STATIC (yyvsp[-1].ftype.t); ! ; ! break;} ! case 423: #line 1965 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ftype.t); ; ! break;} ! case 424: #line 1976 "parse.y" ! { yyval.ftype.t = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 425: #line 1979 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 426: #line 1982 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 427: #line 1985 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 428: #line 1991 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ; ! break;} ! case 429: #line 1993 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ttype); ; ! break;} ! case 430: #line 1995 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 431: #line 1997 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ; ! break;} ! case 432: #line 2001 "parse.y" ! { skip_evaluation++; ; ! break;} ! case 433: #line 2005 "parse.y" ! { skip_evaluation++; ; ! break;} ! case 434: #line 2009 "parse.y" ! { skip_evaluation++; ; ! break;} ! case 435: #line 2018 "parse.y" ! { yyval.ftype.lookups = NULL_TREE; ; ! break;} ! case 436: #line 2020 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ; ! break;} ! case 437: #line 2022 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ; ! break;} ! case 438: #line 2024 "parse.y" ! { yyval.ftype.t = finish_typeof (yyvsp[-1].ttype); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! skip_evaluation--; ; ! break;} ! case 439: #line 2028 "parse.y" ! { yyval.ftype.t = groktypename (yyvsp[-1].ftype.t); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! skip_evaluation--; ; ! break;} ! case 440: #line 2032 "parse.y" ! { tree type = TREE_TYPE (yyvsp[-1].ttype); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; if (IS_AGGR_TYPE (type)) --- 7137,7621 ---- type = hash_tree_cons (NULL_TREE, yyvsp[-3].ttype, NULL_TREE); type = groktypename (build_tree_list (type, NULL_TREE)); yyval.ttype = build_functional_cast (type, yyvsp[-1].ttype); ! ;} ! break; ! ! case 359: #line 1662 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("dynamic_cast", yyvsp[-4].ftype); ! yyval.ttype = build_dynamic_cast (type, yyvsp[-1].ttype); ;} ! break; ! ! case 360: #line 1666 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("static_cast", yyvsp[-4].ftype); ! yyval.ttype = build_static_cast (type, yyvsp[-1].ttype); ;} ! break; ! ! case 361: #line 1670 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("reinterpret_cast", yyvsp[-4].ftype); ! yyval.ttype = build_reinterpret_cast (type, yyvsp[-1].ttype); ;} ! break; ! ! case 362: #line 1674 "parse.y" ! { tree type = groktypename (yyvsp[-4].ftype.t); check_for_new_type ("const_cast", yyvsp[-4].ftype); ! yyval.ttype = build_const_cast (type, yyvsp[-1].ttype); ;} ! break; ! ! case 363: #line 1678 "parse.y" ! { yyval.ttype = build_typeid (yyvsp[-1].ttype); ;} ! break; ! ! case 364: #line 1680 "parse.y" ! { tree type = groktypename (yyvsp[-1].ftype.t); check_for_new_type ("typeid", yyvsp[-1].ftype); ! yyval.ttype = get_typeid (type); ;} ! break; ! ! case 365: #line 1684 "parse.y" ! { yyval.ttype = do_scoped_id (yyvsp[0].ttype, 1); ;} ! break; ! ! case 366: #line 1686 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 367: #line 1688 "parse.y" ! { got_scope = NULL_TREE; if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = do_scoped_id (yyvsp[0].ttype, 1); else yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 368: #line 1696 "parse.y" ! { yyval.ttype = build_offset_ref (OP0 (yyval.ttype), OP1 (yyval.ttype)); ;} ! break; ! ! case 369: #line 1698 "parse.y" ! { yyval.ttype = finish_qualified_call_expr (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 370: #line 1700 "parse.y" ! { yyval.ttype = finish_qualified_call_expr (yyvsp[-1].ttype, NULL_TREE); ;} ! break; ! ! case 371: #line 1702 "parse.y" ! { yyval.ttype = build_x_component_ref (yyval.ttype, yyvsp[0].ttype, NULL_TREE, 1); ! ;} ! break; ! ! case 372: #line 1706 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 373: #line 1708 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 374: #line 1710 "parse.y" ! { yyval.ttype = build_x_component_ref (yyval.ttype, yyvsp[0].ttype, NULL_TREE, 1); ;} ! break; ! ! case 375: #line 1712 "parse.y" ! { if (processing_template_decl) yyval.ttype = build_min_nt (COMPONENT_REF, yyvsp[-1].ttype, yyvsp[0].ttype); else ! yyval.ttype = build_object_ref (yyval.ttype, OP0 (yyvsp[0].ttype), OP1 (yyvsp[0].ttype)); ;} ! break; ! ! case 376: #line 1717 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 377: #line 1719 "parse.y" ! { yyval.ttype = finish_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 378: #line 1721 "parse.y" ! { yyval.ttype = finish_qualified_object_call_expr (yyvsp[-3].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 379: #line 1723 "parse.y" ! { yyval.ttype = finish_qualified_object_call_expr (yyvsp[-1].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 380: #line 1726 "parse.y" ! { yyval.ttype = finish_pseudo_destructor_call_expr (yyvsp[-3].ttype, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 381: #line 1728 "parse.y" ! { yyval.ttype = finish_pseudo_destructor_call_expr (yyvsp[-5].ttype, yyvsp[-4].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 382: #line 1730 "parse.y" ! { yyval.ttype = error_mark_node; ! ;} ! break; ! ! case 383: #line 1775 "parse.y" ! { yyval.itype = 0; ;} ! break; ! ! case 384: #line 1777 "parse.y" ! { got_scope = NULL_TREE; yyval.itype = 1; ;} ! break; ! ! case 385: #line 1782 "parse.y" ! { yyval.itype = 0; ;} ! break; ! ! case 386: #line 1784 "parse.y" ! { got_scope = NULL_TREE; yyval.itype = 1; ;} ! break; ! ! case 387: #line 1789 "parse.y" ! { yyval.ttype = boolean_true_node; ;} ! break; ! ! case 388: #line 1791 "parse.y" ! { yyval.ttype = boolean_false_node; ;} ! break; ! ! case 390: #line 1798 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 391: #line 1803 "parse.y" ! { if (DECL_CONSTRUCTOR_P (current_function_decl)) finish_mem_initializers (NULL_TREE); ! ;} ! break; ! ! case 392: #line 1811 "parse.y" ! { got_object = TREE_TYPE (yyval.ttype); ;} ! break; ! ! case 393: #line 1813 "parse.y" ! { yyval.ttype = build_x_arrow (yyval.ttype); got_object = TREE_TYPE (yyval.ttype); ! ;} ! break; ! ! case 394: #line 1821 "parse.y" ! { if (yyvsp[-2].ftype.t && IS_AGGR_TYPE_CODE (TREE_CODE (yyvsp[-2].ftype.t))) note_got_semicolon (yyvsp[-2].ftype.t); ! ;} ! break; ! ! case 395: #line 1826 "parse.y" ! { note_list_got_semicolon (yyvsp[-2].ftype.t); ! ;} ! break; ! ! case 396: #line 1830 "parse.y" ! {;} ! break; ! ! case 397: #line 1832 "parse.y" ! { shadow_tag (yyvsp[-1].ftype.t); note_list_got_semicolon (yyvsp[-1].ftype.t); ! ;} ! break; ! ! case 398: #line 1837 "parse.y" ! { warning ("empty declaration"); ;} ! break; ! ! case 399: #line 1839 "parse.y" ! { pedantic = yyvsp[-1].itype; ;} ! break; ! ! case 402: #line 1853 "parse.y" ! { yyval.ttype = make_call_declarator (NULL_TREE, empty_parms (), ! NULL_TREE, NULL_TREE); ;} ! break; ! ! case 403: #line 1856 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), NULL_TREE, ! NULL_TREE); ;} ! break; ! ! case 404: #line 1863 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 405: #line 1866 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 406: #line 1869 "parse.y" ! { yyval.ftype.t = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 407: #line 1873 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 408: #line 1876 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 409: #line 1887 "parse.y" ! { yyval.ftype.lookups = type_lookups; ;} ! break; ! ! case 410: #line 1889 "parse.y" ! { yyval.ftype.lookups = type_lookups; ;} ! break; ! ! case 411: #line 1894 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 412: #line 1897 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 413: #line 1900 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-2].ftype.t, chainon (yyvsp[-1].ttype, yyvsp[0].ttype)); ! yyval.ftype.new_type_flag = yyvsp[-2].ftype.new_type_flag; ;} ! break; ! ! case 414: #line 1903 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 415: #line 1906 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 416: #line 1909 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-2].ftype.t, chainon (yyvsp[-1].ttype, chainon (yyvsp[0].ttype, yyvsp[-3].ftype.t))); ! yyval.ftype.new_type_flag = yyvsp[-2].ftype.new_type_flag; ;} ! break; ! ! case 417: #line 1916 "parse.y" ! { if (extra_warnings) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyval.ttype)); ! yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ;} ! break; ! ! case 418: #line 1921 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyval.ttype); ;} ! break; ! ! case 419: #line 1923 "parse.y" ! { if (extra_warnings) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); ! yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ;} ! break; ! ! case 420: #line 1945 "parse.y" ! { yyval.ftype.lookups = NULL_TREE; TREE_STATIC (yyval.ftype.t) = 1; ;} ! break; ! ! case 421: #line 1947 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! ;} ! break; ! ! case 422: #line 1952 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); TREE_STATIC (yyval.ftype.t) = 1; ! ;} ! break; ! ! case 423: #line 1957 "parse.y" ! { if (extra_warnings && TREE_STATIC (yyval.ftype.t)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); TREE_STATIC (yyval.ftype.t) = TREE_STATIC (yyvsp[-1].ftype.t); ! ;} ! break; ! ! case 424: #line 1965 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ftype.t); ;} ! break; ! ! case 425: #line 1976 "parse.y" ! { yyval.ftype.t = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 426: #line 1979 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 427: #line 1982 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 428: #line 1985 "parse.y" ! { yyval.ftype.t = tree_cons (NULL_TREE, yyvsp[-1].ftype.t, chainon (yyvsp[0].ttype, yyvsp[-2].ftype.t)); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 429: #line 1991 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ;} ! break; ! ! case 430: #line 1993 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ftype.t, yyvsp[-1].ttype); ;} ! break; ! ! case 431: #line 1995 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 432: #line 1997 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 433: #line 2001 "parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 434: #line 2005 "parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 435: #line 2009 "parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 436: #line 2018 "parse.y" ! { yyval.ftype.lookups = NULL_TREE; ;} ! break; ! ! case 437: #line 2020 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ;} ! break; ! ! case 438: #line 2022 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ;} ! break; ! ! case 439: #line 2024 "parse.y" ! { yyval.ftype.t = finish_typeof (yyvsp[-1].ttype); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! skip_evaluation--; ;} ! break; ! ! case 440: #line 2028 "parse.y" ! { yyval.ftype.t = groktypename (yyvsp[-1].ftype.t); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; ! skip_evaluation--; ;} ! break; ! ! case 441: #line 2032 "parse.y" ! { tree type = TREE_TYPE (yyvsp[-1].ttype); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; if (IS_AGGR_TYPE (type)) *************** case 440: *** 6917,6927 **** error ("`sigof' applied to non-aggregate expression"); yyval.ftype.t = error_mark_node; } ! ; ! break;} ! case 441: #line 2047 "parse.y" ! { tree type = groktypename (yyvsp[-1].ftype.t); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; if (IS_AGGR_TYPE (type)) --- 7628,7639 ---- error ("`sigof' applied to non-aggregate expression"); yyval.ftype.t = error_mark_node; } ! ;} ! break; ! ! case 442: #line 2047 "parse.y" ! { tree type = groktypename (yyvsp[-1].ftype.t); yyval.ftype.new_type_flag = 0; yyval.ftype.lookups = NULL_TREE; if (IS_AGGR_TYPE (type)) *************** case 441: *** 6934,7209 **** error("`sigof' applied to non-aggregate type"); yyval.ftype.t = error_mark_node; } ! ; ! break;} ! case 442: #line 2067 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ; ! break;} ! case 443: #line 2069 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ; ! break;} ! case 446: #line 2076 "parse.y" ! { check_multiple_declarators (); ; ! break;} ! case 448: #line 2082 "parse.y" ! { check_multiple_declarators (); ; ! break;} ! case 450: #line 2088 "parse.y" ! { check_multiple_declarators (); ; ! break;} ! case 451: #line 2093 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 452: #line 2095 "parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 453: #line 2100 "parse.y" ! { yyval.ttype = parse_decl (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ; ! break;} ! case 454: #line 2103 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 455: #line 2105 "parse.y" ! { yyval.ttype = parse_decl (yyvsp[-2].ttype, yyvsp[0].ttype, 0); parse_end_decl (yyval.ttype, NULL_TREE, yyvsp[-1].ttype); ! ; ! break;} ! case 456: #line 2119 "parse.y" ! { yyval.ttype = parse_decl0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, ! yyvsp[-4].ftype.lookups, yyvsp[-1].ttype, 1); ; ! break;} ! case 457: #line 2124 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 458: #line 2126 "parse.y" ! { tree d = parse_decl0 (yyvsp[-2].ttype, yyvsp[-3].ftype.t, yyvsp[-3].ftype.lookups, yyvsp[0].ttype, 0); ! parse_end_decl (d, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 459: #line 2133 "parse.y" ! {; ! break;} ! case 460: #line 2138 "parse.y" ! {; ! break;} ! case 461: #line 2143 "parse.y" ! { /* Set things up as initdcl0_innards expects. */ yyval.ttype = yyvsp[0].ttype; yyvsp[0].ttype = yyvsp[-1].ttype; yyvsp[-1].ftype.t = NULL_TREE; ! yyvsp[-1].ftype.lookups = NULL_TREE; ; ! break;} ! case 462: #line 2149 "parse.y" ! {; ! break;} ! case 463: #line 2151 "parse.y" ! { tree d = parse_decl0 (yyvsp[-2].ttype, NULL_TREE, NULL_TREE, yyvsp[0].ttype, 0); ! parse_end_decl (d, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 464: #line 2159 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 465: #line 2161 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 466: #line 2166 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 467: #line 2168 "parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 468: #line 2173 "parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ; ! break;} ! case 469: #line 2178 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 470: #line 2180 "parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 471: #line 2185 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 472: #line 2187 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 473: #line 2189 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ; ! break;} ! case 474: #line 2191 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ; ! break;} ! case 475: #line 2193 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 480: #line 2209 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 481: #line 2211 "parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 482: #line 2216 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 483: #line 2218 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 485: #line 2227 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, NULL_TREE); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ; ! break;} ! case 486: #line 2230 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-1].ttype)); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ; ! break;} ! case 487: #line 2233 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ; ! break;} ! case 488: #line 2236 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 489: #line 2243 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ; ! break;} ! case 490: #line 2245 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ; ! break;} ! case 491: #line 2248 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 492: #line 2250 "parse.y" ! { yyval.ttype = build_tree_list (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 493: #line 2252 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[-2].ttype, yyvsp[0].ttype, yyval.ttype); ; ! break;} ! case 494: #line 2257 "parse.y" ! { expand_body (finish_function (2)); process_next_inline (yyvsp[-2].pi); ! ; ! break;} ! case 495: #line 2262 "parse.y" ! { expand_body (finish_function (2)); process_next_inline (yyvsp[-2].pi); ! ; ! break;} ! case 496: #line 2267 "parse.y" ! { finish_function (2); ! process_next_inline (yyvsp[-2].pi); ; ! break;} ! case 499: #line 2281 "parse.y" ! { replace_defarg (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 500: #line 2283 "parse.y" ! { replace_defarg (yyvsp[-2].ttype, error_mark_node); ; ! break;} ! case 502: #line 2289 "parse.y" ! { do_pending_defargs (); ; ! break;} ! case 503: #line 2291 "parse.y" ! { do_pending_defargs (); ; ! break;} ! case 504: #line 2296 "parse.y" ! { yyval.ttype = current_enum_type; ! current_enum_type = start_enum (yyvsp[-1].ttype); ; ! break;} ! case 505: #line 2299 "parse.y" ! { yyval.ftype.t = current_enum_type; finish_enum (current_enum_type); yyval.ftype.new_type_flag = 1; current_enum_type = yyvsp[-2].ttype; ! check_for_missing_semicolon (yyval.ftype.t); ; ! break;} ! case 506: #line 2305 "parse.y" ! { yyval.ttype = current_enum_type; ! current_enum_type = start_enum (make_anon_name ()); ; ! break;} ! case 507: #line 2308 "parse.y" ! { yyval.ftype.t = current_enum_type; finish_enum (current_enum_type); yyval.ftype.new_type_flag = 1; current_enum_type = yyvsp[-2].ttype; ! check_for_missing_semicolon (yyval.ftype.t); ; ! break;} ! case 508: #line 2314 "parse.y" ! { yyval.ftype.t = xref_tag (enum_type_node, yyvsp[0].ttype, 1); ! yyval.ftype.new_type_flag = 0; ; ! break;} ! case 509: #line 2317 "parse.y" ! { yyval.ftype.t = xref_tag (enum_type_node, yyvsp[0].ttype, 1); ! yyval.ftype.new_type_flag = 0; ; ! break;} ! case 510: #line 2320 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; if (!processing_template_decl) ! pedwarn ("using `typename' outside of template"); ; ! break;} ! case 511: #line 2326 "parse.y" ! { if (yyvsp[-1].ttype && yyvsp[-2].ftype.t != error_mark_node) { tree type = TREE_TYPE (yyvsp[-2].ftype.t); --- 7646,7979 ---- error("`sigof' applied to non-aggregate type"); yyval.ftype.t = error_mark_node; } ! ;} ! break; ! ! case 443: #line 2067 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 444: #line 2069 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 447: #line 2076 "parse.y" ! { check_multiple_declarators (); ;} ! break; ! ! case 449: #line 2082 "parse.y" ! { check_multiple_declarators (); ;} ! break; ! ! case 451: #line 2088 "parse.y" ! { check_multiple_declarators (); ;} ! break; ! ! case 452: #line 2093 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 453: #line 2095 "parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 454: #line 2100 "parse.y" ! { yyval.ttype = parse_decl (yyvsp[-3].ttype, yyvsp[-1].ttype, 1); ;} ! break; ! ! case 455: #line 2103 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 456: #line 2105 "parse.y" ! { yyval.ttype = parse_decl (yyvsp[-2].ttype, yyvsp[0].ttype, 0); parse_end_decl (yyval.ttype, NULL_TREE, yyvsp[-1].ttype); ! ;} ! break; ! ! case 457: #line 2119 "parse.y" ! { yyval.ttype = parse_decl0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, ! yyvsp[-4].ftype.lookups, yyvsp[-1].ttype, 1); ;} ! break; ! ! case 458: #line 2124 "parse.y" ! { parse_end_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 459: #line 2126 "parse.y" ! { tree d = parse_decl0 (yyvsp[-2].ttype, yyvsp[-3].ftype.t, yyvsp[-3].ftype.lookups, yyvsp[0].ttype, 0); ! parse_end_decl (d, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 460: #line 2133 "parse.y" ! {;} ! break; ! ! case 461: #line 2138 "parse.y" ! {;} ! break; ! ! case 462: #line 2143 "parse.y" ! { /* Set things up as initdcl0_innards expects. */ yyval.ttype = yyvsp[0].ttype; yyvsp[0].ttype = yyvsp[-1].ttype; yyvsp[-1].ftype.t = NULL_TREE; ! yyvsp[-1].ftype.lookups = NULL_TREE; ;} ! break; ! ! case 463: #line 2149 "parse.y" ! {;} ! break; ! ! case 464: #line 2151 "parse.y" ! { tree d = parse_decl0 (yyvsp[-2].ttype, NULL_TREE, NULL_TREE, yyvsp[0].ttype, 0); ! parse_end_decl (d, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 465: #line 2159 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 466: #line 2161 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 467: #line 2166 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 468: #line 2168 "parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 469: #line 2173 "parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ;} ! break; ! ! case 470: #line 2178 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 471: #line 2180 "parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 472: #line 2185 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 473: #line 2187 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 474: #line 2189 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ;} ! break; ! ! case 475: #line 2191 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ;} ! break; ! ! case 476: #line 2193 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 481: #line 2209 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 482: #line 2211 "parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 483: #line 2216 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 484: #line 2218 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 486: #line 2227 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, NULL_TREE); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ;} ! break; ! ! case 487: #line 2230 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-1].ttype)); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ;} ! break; ! ! case 488: #line 2233 "parse.y" ! { yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); ! TREE_HAS_CONSTRUCTOR (yyval.ttype) = 1; ;} ! break; ! ! case 489: #line 2236 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 490: #line 2243 "parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyval.ttype); ;} ! break; ! ! case 491: #line 2245 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ;} ! break; ! ! case 492: #line 2248 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 493: #line 2250 "parse.y" ! { yyval.ttype = build_tree_list (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 494: #line 2252 "parse.y" ! { yyval.ttype = tree_cons (yyvsp[-2].ttype, yyvsp[0].ttype, yyval.ttype); ;} ! break; ! ! case 495: #line 2257 "parse.y" ! { expand_body (finish_function (2)); process_next_inline (yyvsp[-2].pi); ! ;} ! break; ! ! case 496: #line 2262 "parse.y" ! { expand_body (finish_function (2)); process_next_inline (yyvsp[-2].pi); ! ;} ! break; ! ! case 497: #line 2267 "parse.y" ! { finish_function (2); ! process_next_inline (yyvsp[-2].pi); ;} ! break; ! ! case 500: #line 2281 "parse.y" ! { replace_defarg (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 501: #line 2283 "parse.y" ! { replace_defarg (yyvsp[-2].ttype, error_mark_node); ;} ! break; ! ! case 503: #line 2289 "parse.y" ! { do_pending_defargs (); ;} ! break; ! ! case 504: #line 2291 "parse.y" ! { do_pending_defargs (); ;} ! break; ! ! case 505: #line 2296 "parse.y" ! { yyval.ttype = current_enum_type; ! current_enum_type = start_enum (yyvsp[-1].ttype); ;} ! break; ! ! case 506: #line 2299 "parse.y" ! { yyval.ftype.t = current_enum_type; finish_enum (current_enum_type); yyval.ftype.new_type_flag = 1; current_enum_type = yyvsp[-2].ttype; ! check_for_missing_semicolon (yyval.ftype.t); ;} ! break; ! ! case 507: #line 2305 "parse.y" ! { yyval.ttype = current_enum_type; ! current_enum_type = start_enum (make_anon_name ()); ;} ! break; ! ! case 508: #line 2308 "parse.y" ! { yyval.ftype.t = current_enum_type; finish_enum (current_enum_type); yyval.ftype.new_type_flag = 1; current_enum_type = yyvsp[-2].ttype; ! check_for_missing_semicolon (yyval.ftype.t); ;} ! break; ! ! case 509: #line 2314 "parse.y" ! { yyval.ftype.t = xref_tag (enum_type_node, yyvsp[0].ttype, 1); ! yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 510: #line 2317 "parse.y" ! { yyval.ftype.t = xref_tag (enum_type_node, yyvsp[0].ttype, 1); ! yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 511: #line 2320 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; if (!processing_template_decl) ! pedwarn ("using `typename' outside of template"); ;} ! break; ! ! case 512: #line 2326 "parse.y" ! { if (yyvsp[-1].ttype && yyvsp[-2].ftype.t != error_mark_node) { tree type = TREE_TYPE (yyvsp[-2].ftype.t); *************** case 511: *** 7218,7228 **** } yyvsp[-2].ftype.t = begin_class_definition (TREE_TYPE (yyvsp[-2].ftype.t)); check_class_key (current_aggr, yyvsp[-2].ftype.t); ! current_aggr = NULL_TREE; ; ! break;} ! case 512: #line 2343 "parse.y" ! { int semi; tree t; --- 7988,7999 ---- } yyvsp[-2].ftype.t = begin_class_definition (TREE_TYPE (yyvsp[-2].ftype.t)); check_class_key (current_aggr, yyvsp[-2].ftype.t); ! current_aggr = NULL_TREE; ;} ! break; ! ! case 513: #line 2343 "parse.y" ! { int semi; tree t; *************** case 512: *** 7238,7386 **** ? union_type_node : CLASSTYPE_DECLARED_CLASS (t) ? class_type_node : record_type_node; ! ; ! break;} ! case 513: #line 2361 "parse.y" ! { done_pending_defargs (); begin_inline_definitions (); ! ; ! break;} ! case 514: #line 2366 "parse.y" ! { finish_inline_definitions (); yyval.ftype.t = yyvsp[-3].ttype; yyval.ftype.new_type_flag = 1; ! ; ! break;} ! case 515: #line 2372 "parse.y" ! { yyval.ftype.t = TREE_TYPE (yyvsp[0].ftype.t); yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; check_class_key (current_aggr, yyval.ftype.t); ! ; ! break;} ! case 519: #line 2387 "parse.y" ! { if (pedantic && !in_system_header) ! pedwarn ("comma at end of enumerator list"); ; ! break;} ! case 521: #line 2394 "parse.y" ! { error ("storage class specifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ; ! break;} ! case 522: #line 2396 "parse.y" ! { error ("type specifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ; ! break;} ! case 523: #line 2398 "parse.y" ! { error ("type qualifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ; ! break;} ! case 524: #line 2400 "parse.y" ! { error ("no body nor ';' separates two class, struct or union declarations"); ; ! break;} ! case 525: #line 2402 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 526: #line 2407 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ! ; ! break;} ! case 527: #line 2412 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 528: #line 2417 "parse.y" ! { current_aggr = yyvsp[-3].ttype; yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 529: #line 2422 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = build_tree_list (global_namespace, yyvsp[0].ttype); ! ; ! break;} ! case 530: #line 2430 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 531: #line 2435 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 532: #line 2440 "parse.y" ! { current_aggr = yyvsp[-3].ttype; yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 533: #line 2448 "parse.y" ! { yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[0].ttype), TREE_VALUE (yyvsp[0].ttype), 0, &yyval.ftype.new_type_flag); ! ; ! break;} ! case 534: #line 2454 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ftype.t = TYPE_MAIN_DECL (xref_tag (current_aggr, yyvsp[0].ttype, 0)); yyval.ftype.new_type_flag = 1; ! ; ! break;} ! case 535: #line 2460 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ! ; ! break;} ! case 536: #line 2468 "parse.y" ! { yyungetc ('{', 1); yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[-1].ttype), TREE_VALUE (yyvsp[-1].ttype), 1, &yyval.ftype.new_type_flag); ! ; ! break;} ! case 537: #line 2475 "parse.y" ! { yyungetc (':', 1); yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[-1].ttype), TREE_VALUE (yyvsp[-1].ttype), 1, &yyval.ftype.new_type_flag); ! ; ! break;} ! case 538: #line 2482 "parse.y" ! { yyungetc ('{', 1); yyval.ftype.t = yyvsp[-1].ttype; yyval.ftype.new_type_flag = 0; --- 8009,8179 ---- ? union_type_node : CLASSTYPE_DECLARED_CLASS (t) ? class_type_node : record_type_node; ! ;} ! break; ! ! case 514: #line 2361 "parse.y" ! { done_pending_defargs (); begin_inline_definitions (); ! ;} ! break; ! ! case 515: #line 2366 "parse.y" ! { finish_inline_definitions (); yyval.ftype.t = yyvsp[-3].ttype; yyval.ftype.new_type_flag = 1; ! ;} ! break; ! ! case 516: #line 2372 "parse.y" ! { yyval.ftype.t = TREE_TYPE (yyvsp[0].ftype.t); yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; check_class_key (current_aggr, yyval.ftype.t); ! ;} ! break; ! ! case 520: #line 2387 "parse.y" ! { if (pedantic && !in_system_header) ! pedwarn ("comma at end of enumerator list"); ;} ! break; ! ! case 522: #line 2394 "parse.y" ! { error ("storage class specifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ;} ! break; ! ! case 523: #line 2396 "parse.y" ! { error ("type specifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ;} ! break; ! ! case 524: #line 2398 "parse.y" ! { error ("type qualifier `%s' not allowed after struct or class", IDENTIFIER_POINTER (yyvsp[0].ttype)); ;} ! break; ! ! case 525: #line 2400 "parse.y" ! { error ("no body nor ';' separates two class, struct or union declarations"); ;} ! break; ! ! case 526: #line 2402 "parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 527: #line 2407 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ! ;} ! break; ! ! case 528: #line 2412 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 529: #line 2417 "parse.y" ! { current_aggr = yyvsp[-3].ttype; yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 530: #line 2422 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = build_tree_list (global_namespace, yyvsp[0].ttype); ! ;} ! break; ! ! case 531: #line 2430 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 532: #line 2435 "parse.y" ! { current_aggr = yyvsp[-2].ttype; yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 533: #line 2440 "parse.y" ! { current_aggr = yyvsp[-3].ttype; yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 534: #line 2448 "parse.y" ! { yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[0].ttype), TREE_VALUE (yyvsp[0].ttype), 0, &yyval.ftype.new_type_flag); ! ;} ! break; ! ! case 535: #line 2454 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ftype.t = TYPE_MAIN_DECL (xref_tag (current_aggr, yyvsp[0].ttype, 0)); yyval.ftype.new_type_flag = 1; ! ;} ! break; ! ! case 536: #line 2460 "parse.y" ! { yyval.ftype.t = yyvsp[0].ttype; yyval.ftype.new_type_flag = 0; ! ;} ! break; ! ! case 537: #line 2468 "parse.y" ! { yyungetc ('{', 1); yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[-1].ttype), TREE_VALUE (yyvsp[-1].ttype), 1, &yyval.ftype.new_type_flag); ! ;} ! break; ! ! case 538: #line 2475 "parse.y" ! { yyungetc (':', 1); yyval.ftype.t = handle_class_head (current_aggr, TREE_PURPOSE (yyvsp[-1].ttype), TREE_VALUE (yyvsp[-1].ttype), 1, &yyval.ftype.new_type_flag); ! ;} ! break; ! ! case 539: #line 2482 "parse.y" ! { yyungetc ('{', 1); yyval.ftype.t = yyvsp[-1].ttype; yyval.ftype.new_type_flag = 0; *************** case 538: *** 7389,7399 **** class-key. */ CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyvsp[-1].ttype)) = (current_aggr == class_type_node); ! ; ! break;} ! case 539: #line 2493 "parse.y" ! { yyungetc (':', 1); yyval.ftype.t = yyvsp[-1].ttype; yyval.ftype.new_type_flag = 0; --- 8182,8193 ---- class-key. */ CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyvsp[-1].ttype)) = (current_aggr == class_type_node); ! ;} ! break; ! ! case 540: #line 2493 "parse.y" ! { yyungetc (':', 1); yyval.ftype.t = yyvsp[-1].ttype; yyval.ftype.new_type_flag = 0; *************** case 539: *** 7402,7483 **** class-key. */ CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyvsp[-1].ttype)) = (current_aggr == class_type_node); ! ; ! break;} ! case 540: #line 2504 "parse.y" ! { yyungetc ('{', 1); current_aggr = yyvsp[-2].ttype; yyval.ftype.t = handle_class_head (current_aggr, NULL_TREE, yyvsp[-1].ttype, 1, &yyval.ftype.new_type_flag); ! ; ! break;} ! case 541: #line 2512 "parse.y" ! { yyungetc (':', 1); current_aggr = yyvsp[-2].ttype; yyval.ftype.t = handle_class_head (current_aggr, NULL_TREE, yyvsp[-1].ttype, 1, &yyval.ftype.new_type_flag); ! ; ! break;} ! case 542: #line 2520 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ftype.t = TYPE_MAIN_DECL (xref_tag (yyvsp[-1].ttype, make_anon_name (), 0)); yyval.ftype.new_type_flag = 0; CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyval.ftype.t)) = yyvsp[-1].ttype == class_type_node; yyungetc ('{', 1); ! ; ! break;} ! case 543: #line 2532 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 544: #line 2534 "parse.y" ! { error ("no bases given following `:'"); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 545: #line 2537 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 547: #line 2543 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 548: #line 2548 "parse.y" ! { yyval.ttype = finish_base_specifier (access_default_node, yyvsp[0].ttype); ; ! break;} ! case 549: #line 2550 "parse.y" ! { yyval.ttype = finish_base_specifier (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 550: #line 2555 "parse.y" ! { if (!TYPE_P (yyval.ttype)) ! yyval.ttype = error_mark_node; ; ! break;} ! case 551: #line 2558 "parse.y" ! { yyval.ttype = TREE_TYPE (yyval.ttype); ; ! break;} ! case 553: #line 2564 "parse.y" ! { if (yyvsp[-1].ttype != ridpointers[(int)RID_VIRTUAL]) error ("`%D' access", yyvsp[-1].ttype); ! yyval.ttype = access_default_virtual_node; ; ! break;} ! case 554: #line 2568 "parse.y" ! { if (yyvsp[-2].ttype != access_default_virtual_node) error ("multiple access specifiers"); else if (yyvsp[-1].ttype == access_public_node) --- 8196,8290 ---- class-key. */ CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyvsp[-1].ttype)) = (current_aggr == class_type_node); ! ;} ! break; ! ! case 541: #line 2504 "parse.y" ! { yyungetc ('{', 1); current_aggr = yyvsp[-2].ttype; yyval.ftype.t = handle_class_head (current_aggr, NULL_TREE, yyvsp[-1].ttype, 1, &yyval.ftype.new_type_flag); ! ;} ! break; ! ! case 542: #line 2512 "parse.y" ! { yyungetc (':', 1); current_aggr = yyvsp[-2].ttype; yyval.ftype.t = handle_class_head (current_aggr, NULL_TREE, yyvsp[-1].ttype, 1, &yyval.ftype.new_type_flag); ! ;} ! break; ! ! case 543: #line 2520 "parse.y" ! { current_aggr = yyvsp[-1].ttype; yyval.ftype.t = TYPE_MAIN_DECL (xref_tag (yyvsp[-1].ttype, make_anon_name (), 0)); yyval.ftype.new_type_flag = 0; CLASSTYPE_DECLARED_CLASS (TREE_TYPE (yyval.ftype.t)) = yyvsp[-1].ttype == class_type_node; yyungetc ('{', 1); ! ;} ! break; ! ! case 544: #line 2532 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 545: #line 2534 "parse.y" ! { error ("no bases given following `:'"); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 546: #line 2537 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 548: #line 2543 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 549: #line 2548 "parse.y" ! { yyval.ttype = finish_base_specifier (access_default_node, yyvsp[0].ttype); ;} ! break; ! ! case 550: #line 2550 "parse.y" ! { yyval.ttype = finish_base_specifier (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 551: #line 2555 "parse.y" ! { if (!TYPE_P (yyval.ttype)) ! yyval.ttype = error_mark_node; ;} ! break; ! ! case 552: #line 2558 "parse.y" ! { yyval.ttype = TREE_TYPE (yyval.ttype); ;} ! break; ! ! case 554: #line 2564 "parse.y" ! { if (yyvsp[-1].ttype != ridpointers[(int)RID_VIRTUAL]) error ("`%D' access", yyvsp[-1].ttype); ! yyval.ttype = access_default_virtual_node; ;} ! break; ! ! case 555: #line 2568 "parse.y" ! { if (yyvsp[-2].ttype != access_default_virtual_node) error ("multiple access specifiers"); else if (yyvsp[-1].ttype == access_public_node) *************** case 554: *** 7486,7496 **** yyval.ttype = access_protected_virtual_node; else /* $2 == access_private_node */ yyval.ttype = access_private_virtual_node; ! ; ! break;} ! case 555: #line 2579 "parse.y" ! { if (yyvsp[-1].ttype != ridpointers[(int)RID_VIRTUAL]) error ("`%D' access", yyvsp[-1].ttype); else if (yyval.ttype == access_public_node) yyval.ttype = access_public_virtual_node; --- 8293,8304 ---- yyval.ttype = access_protected_virtual_node; else /* $2 == access_private_node */ yyval.ttype = access_private_virtual_node; ! ;} ! break; ! ! case 556: #line 2579 "parse.y" ! { if (yyvsp[-1].ttype != ridpointers[(int)RID_VIRTUAL]) error ("`%D' access", yyvsp[-1].ttype); else if (yyval.ttype == access_public_node) yyval.ttype = access_public_virtual_node; *************** case 555: *** 7500,7562 **** yyval.ttype = access_private_virtual_node; else error ("multiple `virtual' specifiers"); ! ; ! break;} ! case 560: #line 2600 "parse.y" ! { current_access_specifier = yyvsp[-1].ttype; ! ; ! break;} ! case 561: #line 2609 "parse.y" ! { finish_member_declaration (yyvsp[0].ttype); current_aggr = NULL_TREE; reset_type_access_control (); ! ; ! break;} ! case 562: #line 2615 "parse.y" ! { finish_member_declaration (yyvsp[0].ttype); current_aggr = NULL_TREE; reset_type_access_control (); ! ; ! break;} ! case 564: #line 2625 "parse.y" ! { error ("missing ';' before right brace"); ! yyungetc ('}', 0); ; ! break;} ! case 565: #line 2630 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ; ! break;} ! case 566: #line 2632 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ; ! break;} ! case 567: #line 2634 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ; ! break;} ! case 568: #line 2636 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ; ! break;} ! case 569: #line 2638 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 570: #line 2640 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! pedantic = yyvsp[-1].itype; ; ! break;} ! case 571: #line 2643 "parse.y" ! { if (yyvsp[0].ttype) yyval.ttype = finish_member_template_decl (yyvsp[0].ttype); else --- 8308,8381 ---- yyval.ttype = access_private_virtual_node; else error ("multiple `virtual' specifiers"); ! ;} ! break; ! ! case 561: #line 2600 "parse.y" ! { current_access_specifier = yyvsp[-1].ttype; ! ;} ! break; ! ! case 562: #line 2609 "parse.y" ! { finish_member_declaration (yyvsp[0].ttype); current_aggr = NULL_TREE; reset_type_access_control (); ! ;} ! break; ! ! case 563: #line 2615 "parse.y" ! { finish_member_declaration (yyvsp[0].ttype); current_aggr = NULL_TREE; reset_type_access_control (); ! ;} ! break; ! ! case 565: #line 2625 "parse.y" ! { error ("missing ';' before right brace"); ! yyungetc ('}', 0); ;} ! break; ! ! case 566: #line 2630 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ;} ! break; ! ! case 567: #line 2632 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ;} ! break; ! ! case 568: #line 2634 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ;} ! break; ! ! case 569: #line 2636 "parse.y" ! { yyval.ttype = finish_method (yyval.ttype); ;} ! break; ! ! case 570: #line 2638 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 571: #line 2640 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! pedantic = yyvsp[-1].itype; ;} ! break; ! ! case 572: #line 2643 "parse.y" ! { if (yyvsp[0].ttype) yyval.ttype = finish_member_template_decl (yyvsp[0].ttype); else *************** case 571: *** 7564,7585 **** yyval.ttype = NULL_TREE; finish_template_decl (yyvsp[-1].ttype); ! ; ! break;} ! case 572: #line 2653 "parse.y" ! { yyval.ttype = finish_member_class_template (yyvsp[-1].ftype.t); finish_template_decl (yyvsp[-2].ttype); ! ; ! break;} ! case 573: #line 2658 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 574: #line 2666 "parse.y" ! { /* Most of the productions for component_decl only allow the creation of one new member, so we call finish_member_declaration in component_decl_list. --- 8383,8407 ---- yyval.ttype = NULL_TREE; finish_template_decl (yyvsp[-1].ttype); ! ;} ! break; ! ! case 573: #line 2653 "parse.y" ! { yyval.ttype = finish_member_class_template (yyvsp[-1].ftype.t); finish_template_decl (yyvsp[-2].ttype); ! ;} ! break; ! ! case 574: #line 2658 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 575: #line 2666 "parse.y" ! { /* Most of the productions for component_decl only allow the creation of one new member, so we call finish_member_declaration in component_decl_list. *************** case 574: *** 7598,7867 **** if (!yyvsp[0].itype) grok_x_components (yyvsp[-1].ftype.t); yyval.ttype = NULL_TREE; ! ; ! break;} ! case 575: #line 2687 "parse.y" ! { if (!yyvsp[0].itype) grok_x_components (yyvsp[-1].ftype.t); yyval.ttype = NULL_TREE; ! ; ! break;} ! case 576: #line 2693 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 577: #line 2695 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 578: #line 2697 "parse.y" ! { yyval.ttype = grokbitfield (NULL_TREE, NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 579: #line 2699 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 580: #line 2710 "parse.y" ! { tree specs, attrs; split_specs_attrs (yyvsp[-4].ftype.t, &specs, &attrs); yyval.ttype = grokfield (yyvsp[-3].ttype, specs, yyvsp[0].ttype, yyvsp[-2].ttype, ! chainon (yyvsp[-1].ttype, attrs)); ; ! break;} ! case 581: #line 2715 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 582: #line 2717 "parse.y" ! { yyval.ttype = do_class_using_decl (yyvsp[0].ttype); ; ! break;} ! case 583: #line 2724 "parse.y" ! { yyval.itype = 0; ; ! break;} ! case 584: #line 2726 "parse.y" ! { if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 1; ! ; ! break;} ! case 585: #line 2733 "parse.y" ! { check_multiple_declarators (); if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 2; ! ; ! break;} ! case 586: #line 2744 "parse.y" ! { yyval.itype = 0; ; ! break;} ! case 587: #line 2746 "parse.y" ! { if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 1; ! ; ! break;} ! case 588: #line 2753 "parse.y" ! { check_multiple_declarators (); if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 2; ! ; ! break;} ! case 593: #line 2774 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 594: #line 2777 "parse.y" ! { yyval.ttype = parse_bitfield0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 595: #line 2783 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 596: #line 2786 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 597: #line 2789 "parse.y" ! { yyval.ttype = parse_bitfield0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 598: #line 2792 "parse.y" ! { yyval.ttype = parse_bitfield0 (NULL_TREE, yyvsp[-3].ftype.t, ! yyvsp[-3].ftype.lookups, yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 599: #line 2798 "parse.y" ! { yyval.ttype = parse_field (yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 600: #line 2800 "parse.y" ! { yyval.ttype = parse_bitfield (yyvsp[-3].ttype, yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 601: #line 2805 "parse.y" ! { yyval.ttype = parse_field (yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 602: #line 2807 "parse.y" ! { yyval.ttype = parse_bitfield (yyvsp[-3].ttype, yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 603: #line 2809 "parse.y" ! { yyval.ttype = parse_bitfield (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 608: #line 2828 "parse.y" ! { build_enumerator (yyvsp[0].ttype, NULL_TREE, current_enum_type); ; ! break;} ! case 609: #line 2830 "parse.y" ! { build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype, current_enum_type); ; ! break;} ! case 610: #line 2836 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 611: #line 2839 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 612: #line 2844 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids array dimensions with parenthesized type in new"); yyval.ftype.t = build_nt (ARRAY_REF, TREE_VALUE (yyvsp[-4].ftype.t), yyvsp[-1].ttype); yyval.ftype.t = build_tree_list (TREE_PURPOSE (yyvsp[-4].ftype.t), yyval.ftype.t); yyval.ftype.new_type_flag = yyvsp[-4].ftype.new_type_flag; ! ; ! break;} ! case 613: #line 2855 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 614: #line 2857 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ; ! break;} ! case 615: #line 2862 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! yyval.ftype.new_type_flag = 0; ; ! break;} ! case 616: #line 2865 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 617: #line 2868 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! yyval.ftype.new_type_flag = 0; ; ! break;} ! case 618: #line 2871 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 619: #line 2881 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 620: #line 2883 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 621: #line 2885 "parse.y" ! { yyval.ttype = empty_parms (); ; ! break;} ! case 622: #line 2887 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 624: #line 2895 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 625: #line 2905 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 626: #line 2907 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 627: #line 2909 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 628: #line 2911 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 629: #line 2913 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 631: #line 2921 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-2].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 632: #line 2923 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 633: #line 2925 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ; ! break;} ! case 634: #line 2927 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 635: #line 2929 "parse.y" ! { push_nested_class (yyvsp[-1].ttype, 3); yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ! TREE_COMPLEXITY (yyval.ttype) = current_class_depth; ; ! break;} ! case 637: #line 2937 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) { yyval.ttype = lookup_name (yyvsp[0].ttype, 1); --- 8420,8741 ---- if (!yyvsp[0].itype) grok_x_components (yyvsp[-1].ftype.t); yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 576: #line 2687 "parse.y" ! { if (!yyvsp[0].itype) grok_x_components (yyvsp[-1].ftype.t); yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 577: #line 2693 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 578: #line 2695 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 579: #line 2697 "parse.y" ! { yyval.ttype = grokbitfield (NULL_TREE, NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 580: #line 2699 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 581: #line 2710 "parse.y" ! { tree specs, attrs; split_specs_attrs (yyvsp[-4].ftype.t, &specs, &attrs); yyval.ttype = grokfield (yyvsp[-3].ttype, specs, yyvsp[0].ttype, yyvsp[-2].ttype, ! chainon (yyvsp[-1].ttype, attrs)); ;} ! break; ! ! case 582: #line 2715 "parse.y" ! { yyval.ttype = grokfield (yyval.ttype, NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 583: #line 2717 "parse.y" ! { yyval.ttype = do_class_using_decl (yyvsp[0].ttype); ;} ! break; ! ! case 584: #line 2724 "parse.y" ! { yyval.itype = 0; ;} ! break; ! ! case 585: #line 2726 "parse.y" ! { if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 1; ! ;} ! break; ! ! case 586: #line 2733 "parse.y" ! { check_multiple_declarators (); if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 2; ! ;} ! break; ! ! case 587: #line 2744 "parse.y" ! { yyval.itype = 0; ;} ! break; ! ! case 588: #line 2746 "parse.y" ! { if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 1; ! ;} ! break; ! ! case 589: #line 2753 "parse.y" ! { check_multiple_declarators (); if (PROCESSING_REAL_TEMPLATE_DECL_P ()) yyvsp[0].ttype = finish_member_template_decl (yyvsp[0].ttype); finish_member_declaration (yyvsp[0].ttype); yyval.itype = 2; ! ;} ! break; ! ! case 594: #line 2774 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 595: #line 2777 "parse.y" ! { yyval.ttype = parse_bitfield0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 596: #line 2783 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 597: #line 2786 "parse.y" ! { yyval.ttype = parse_field0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 598: #line 2789 "parse.y" ! { yyval.ttype = parse_bitfield0 (yyvsp[-3].ttype, yyvsp[-4].ftype.t, yyvsp[-4].ftype.lookups, ! yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 599: #line 2792 "parse.y" ! { yyval.ttype = parse_bitfield0 (NULL_TREE, yyvsp[-3].ftype.t, ! yyvsp[-3].ftype.lookups, yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 600: #line 2798 "parse.y" ! { yyval.ttype = parse_field (yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 601: #line 2800 "parse.y" ! { yyval.ttype = parse_bitfield (yyvsp[-3].ttype, yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 602: #line 2805 "parse.y" ! { yyval.ttype = parse_field (yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 603: #line 2807 "parse.y" ! { yyval.ttype = parse_bitfield (yyvsp[-3].ttype, yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 604: #line 2809 "parse.y" ! { yyval.ttype = parse_bitfield (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 609: #line 2828 "parse.y" ! { build_enumerator (yyvsp[0].ttype, NULL_TREE, current_enum_type); ;} ! break; ! ! case 610: #line 2830 "parse.y" ! { build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype, current_enum_type); ;} ! break; ! ! case 611: #line 2836 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 612: #line 2839 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 613: #line 2844 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids array dimensions with parenthesized type in new"); yyval.ftype.t = build_nt (ARRAY_REF, TREE_VALUE (yyvsp[-4].ftype.t), yyvsp[-1].ttype); yyval.ftype.t = build_tree_list (TREE_PURPOSE (yyvsp[-4].ftype.t), yyval.ftype.t); yyval.ftype.new_type_flag = yyvsp[-4].ftype.new_type_flag; ! ;} ! break; ! ! case 614: #line 2855 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 615: #line 2857 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyval.ttype); ;} ! break; ! ! case 616: #line 2862 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 617: #line 2865 "parse.y" ! { yyval.ftype.t = hash_tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 618: #line 2868 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 619: #line 2871 "parse.y" ! { yyval.ftype.t = hash_tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 620: #line 2881 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 621: #line 2883 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 622: #line 2885 "parse.y" ! { yyval.ttype = empty_parms (); ;} ! break; ! ! case 623: #line 2887 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 625: #line 2895 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 626: #line 2905 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 627: #line 2907 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 628: #line 2909 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 629: #line 2911 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 630: #line 2913 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 632: #line 2921 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-2].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 633: #line 2923 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 634: #line 2925 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ;} ! break; ! ! case 635: #line 2927 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 636: #line 2929 "parse.y" ! { push_nested_class (yyvsp[-1].ttype, 3); yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ! TREE_COMPLEXITY (yyval.ttype) = current_class_depth; ;} ! break; ! ! case 638: #line 2937 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) { yyval.ttype = lookup_name (yyvsp[0].ttype, 1); *************** case 637: *** 7869,8041 **** } else yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 638: #line 2947 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; got_scope = NULL_TREE; ! ; ! break;} ! case 641: #line 2960 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 642: #line 2965 "parse.y" ! { yyval.ttype = get_type_decl (yyvsp[0].ttype); ; ! break;} ! case 644: #line 2974 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 645: #line 2983 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 646: #line 2985 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 647: #line 2987 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 648: #line 2989 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 649: #line 2991 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 651: #line 2999 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 652: #line 3001 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 653: #line 3003 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 654: #line 3005 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 655: #line 3007 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 657: #line 3015 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-2].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 658: #line 3017 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 659: #line 3019 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 660: #line 3021 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ; ! break;} ! case 661: #line 3023 "parse.y" ! { enter_scope_of (yyvsp[0].ttype); ; ! break;} ! case 662: #line 3025 "parse.y" ! { enter_scope_of (yyvsp[0].ttype); yyval.ttype = yyvsp[0].ttype;; ! break;} ! case 663: #line 3027 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, global_namespace, yyvsp[0].ttype); enter_scope_of (yyval.ttype); ! ; ! break;} ! case 664: #line 3031 "parse.y" ! { got_scope = NULL_TREE; yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); enter_scope_of (yyval.ttype); ! ; ! break;} ! case 665: #line 3039 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 666: #line 3042 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 667: #line 3048 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 668: #line 3051 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 670: #line 3058 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 671: #line 3063 "parse.y" ! { yyval.ttype = build_functional_cast (yyvsp[-3].ftype.t, yyvsp[-1].ttype); ; ! break;} ! case 672: #line 3065 "parse.y" ! { yyval.ttype = reparse_decl_as_expr (yyvsp[-3].ftype.t, yyvsp[-1].ttype); ; ! break;} ! case 673: #line 3067 "parse.y" ! { yyval.ttype = reparse_absdcl_as_expr (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 678: #line 3079 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 679: #line 3081 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-3].ttype, yyvsp[-1].ttype, tf_error); ; ! break;} ! case 680: #line 3085 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ; ! break;} ! case 681: #line 3088 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ; ! break;} ! case 682: #line 3096 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE) { yyval.ttype = lastiddecl; --- 8743,8950 ---- } else yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 639: #line 2947 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; got_scope = NULL_TREE; ! ;} ! break; ! ! case 642: #line 2960 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 643: #line 2965 "parse.y" ! { yyval.ttype = get_type_decl (yyvsp[0].ttype); ;} ! break; ! ! case 645: #line 2974 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 646: #line 2983 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 647: #line 2985 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 648: #line 2987 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 649: #line 2989 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 650: #line 2991 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 652: #line 2999 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 653: #line 3001 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 654: #line 3003 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 655: #line 3005 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 656: #line 3007 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 658: #line 3015 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-2].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 659: #line 3017 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 660: #line 3019 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 661: #line 3021 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ;} ! break; ! ! case 662: #line 3023 "parse.y" ! { enter_scope_of (yyvsp[0].ttype); ;} ! break; ! ! case 663: #line 3025 "parse.y" ! { enter_scope_of (yyvsp[0].ttype); yyval.ttype = yyvsp[0].ttype;;} ! break; ! ! case 664: #line 3027 "parse.y" ! { yyval.ttype = build_nt (SCOPE_REF, global_namespace, yyvsp[0].ttype); enter_scope_of (yyval.ttype); ! ;} ! break; ! ! case 665: #line 3031 "parse.y" ! { got_scope = NULL_TREE; yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); enter_scope_of (yyval.ttype); ! ;} ! break; ! ! case 666: #line 3039 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 667: #line 3042 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 668: #line 3048 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 669: #line 3051 "parse.y" ! { got_scope = NULL_TREE; ! yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 671: #line 3058 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 672: #line 3063 "parse.y" ! { yyval.ttype = build_functional_cast (yyvsp[-3].ftype.t, yyvsp[-1].ttype); ;} ! break; ! ! case 673: #line 3065 "parse.y" ! { yyval.ttype = reparse_decl_as_expr (yyvsp[-3].ftype.t, yyvsp[-1].ttype); ;} ! break; ! ! case 674: #line 3067 "parse.y" ! { yyval.ttype = reparse_absdcl_as_expr (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 679: #line 3079 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 680: #line 3081 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-3].ttype, yyvsp[-1].ttype, tf_error); ;} ! break; ! ! case 681: #line 3085 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ;} ! break; ! ! case 682: #line 3088 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ;} ! break; ! ! case 683: #line 3096 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE) { yyval.ttype = lastiddecl; *************** case 682: *** 8043,8077 **** } got_scope = yyval.ttype = complete_type (TYPE_MAIN_VARIANT (TREE_TYPE (yyval.ttype))); ! ; ! break;} ! case 683: #line 3106 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype = TREE_TYPE (yyval.ttype); ! ; ! break;} ! case 684: #line 3112 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ; ! break;} ! case 685: #line 3118 "parse.y" ! { got_scope = yyval.ttype = complete_type (TREE_TYPE (yyvsp[-1].ttype)); ; ! break;} ! case 687: #line 3124 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 688: #line 3129 "parse.y" ! { if (TYPE_P (yyvsp[-1].ttype)) yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); else if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) --- 8952,8991 ---- } got_scope = yyval.ttype = complete_type (TYPE_MAIN_VARIANT (TREE_TYPE (yyval.ttype))); ! ;} ! break; ! ! case 684: #line 3106 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype = TREE_TYPE (yyval.ttype); ! ;} ! break; ! ! case 685: #line 3112 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ;} ! break; ! ! case 686: #line 3118 "parse.y" ! { got_scope = yyval.ttype = complete_type (TREE_TYPE (yyvsp[-1].ttype)); ;} ! break; ! ! case 688: #line 3124 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 689: #line 3129 "parse.y" ! { if (TYPE_P (yyvsp[-1].ttype)) yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); else if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) *************** case 688: *** 8082,8113 **** if (TREE_CODE (yyval.ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyval.ttype); } ! ; ! break;} ! case 689: #line 3142 "parse.y" ! { yyval.ttype = TREE_TYPE (yyvsp[0].ttype); ; ! break;} ! case 690: #line 3144 "parse.y" ! { yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); ; ! break;} ! case 691: #line 3146 "parse.y" ! { yyval.ttype = make_typename_type (yyvsp[-2].ttype, yyvsp[0].ttype, tf_error); ; ! break;} ! case 692: #line 3151 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) error ("`%T' is not a class or namespace", yyvsp[0].ttype); else if (TREE_CODE (yyvsp[0].ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyvsp[0].ttype); ! ; ! break;} ! case 693: #line 3158 "parse.y" ! { if (TYPE_P (yyvsp[-1].ttype)) yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); else if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) --- 8996,9032 ---- if (TREE_CODE (yyval.ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyval.ttype); } ! ;} ! break; ! ! case 690: #line 3142 "parse.y" ! { yyval.ttype = TREE_TYPE (yyvsp[0].ttype); ;} ! break; ! ! case 691: #line 3144 "parse.y" ! { yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); ;} ! break; ! ! case 692: #line 3146 "parse.y" ! { yyval.ttype = make_typename_type (yyvsp[-2].ttype, yyvsp[0].ttype, tf_error); ;} ! break; ! ! case 693: #line 3151 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) error ("`%T' is not a class or namespace", yyvsp[0].ttype); else if (TREE_CODE (yyvsp[0].ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyvsp[0].ttype); ! ;} ! break; ! ! case 694: #line 3158 "parse.y" ! { if (TYPE_P (yyvsp[-1].ttype)) yyval.ttype = make_typename_type (yyvsp[-1].ttype, yyvsp[0].ttype, tf_error); else if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) *************** case 693: *** 8118,8138 **** if (TREE_CODE (yyval.ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyval.ttype); } ! ; ! break;} ! case 694: #line 3171 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ; ! break;} ! case 695: #line 3174 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-3].ttype, yyvsp[-1].ttype, tf_error); ; ! break;} ! case 696: #line 3182 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) != TYPE_DECL) yyval.ttype = lastiddecl; --- 9037,9060 ---- if (TREE_CODE (yyval.ttype) == TYPE_DECL) yyval.ttype = TREE_TYPE (yyval.ttype); } ! ;} ! break; ! ! case 695: #line 3171 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-2].ttype, yyvsp[-1].ttype, tf_error); ;} ! break; ! ! case 696: #line 3174 "parse.y" ! { got_scope = yyval.ttype ! = make_typename_type (yyvsp[-3].ttype, yyvsp[-1].ttype, tf_error); ;} ! break; ! ! case 697: #line 3182 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) != TYPE_DECL) yyval.ttype = lastiddecl; *************** case 696: *** 8142,8745 **** if (yyval.ttype == error_mark_node) error ("`%T' is not a class or namespace", yyvsp[-1].ttype); ! ; ! break;} ! case 697: #line 3194 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) != TYPE_DECL) yyval.ttype = lastiddecl; got_scope = complete_type (TREE_TYPE (yyval.ttype)); ! ; ! break;} ! case 698: #line 3200 "parse.y" ! { got_scope = yyval.ttype = complete_type (TREE_TYPE (yyval.ttype)); ; ! break;} ! case 701: #line 3204 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ; ! break;} ! case 702: #line 3213 "parse.y" ! { yyval.ttype = build_min_nt (TEMPLATE_ID_EXPR, yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 703: #line 3218 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; got_scope = NULL_TREE; ! ; ! break;} ! case 705: #line 3227 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 706: #line 3232 "parse.y" ! { got_scope = NULL_TREE; ; ! break;} ! case 707: #line 3234 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; got_scope = NULL_TREE; ; ! break;} ! case 708: #line 3241 "parse.y" ! { got_scope = void_type_node; ; ! break;} ! case 709: #line 3247 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 710: #line 3249 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 711: #line 3251 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 712: #line 3253 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 713: #line 3255 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, arg); ! ; ! break;} ! case 714: #line 3259 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 716: #line 3268 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 717: #line 3270 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 719: #line 3276 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 720: #line 3286 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 721: #line 3288 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 722: #line 3290 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ftype.t, NULL_TREE); ; ! break;} ! case 723: #line 3292 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, NULL_TREE); ; ! break;} ! case 724: #line 3294 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 725: #line 3296 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 726: #line 3298 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[0].ftype.t, NULL_TREE); ; ! break;} ! case 727: #line 3300 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, NULL_TREE); ; ! break;} ! case 728: #line 3302 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, arg); ! ; ! break;} ! case 729: #line 3306 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 731: #line 3315 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 732: #line 3318 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 733: #line 3320 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 734: #line 3322 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ; ! break;} ! case 735: #line 3324 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ; ! break;} ! case 736: #line 3326 "parse.y" ! { yyval.ttype = make_call_declarator (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 737: #line 3328 "parse.y" ! { set_quals_and_spec (yyval.ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 738: #line 3330 "parse.y" ! { set_quals_and_spec (yyval.ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 739: #line 3332 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 740: #line 3334 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, NULL_TREE); ; ! break;} ! case 747: #line 3357 "parse.y" ! { if (pedantic) ! pedwarn ("ISO C++ forbids label declarations"); ; ! break;} ! case 750: #line 3368 "parse.y" ! { while (yyvsp[-1].ttype) { finish_label_decl (TREE_VALUE (yyvsp[-1].ttype)); yyvsp[-1].ttype = TREE_CHAIN (yyvsp[-1].ttype); } ! ; ! break;} ! case 751: #line 3379 "parse.y" ! { yyval.ttype = begin_compound_stmt (0); ; ! break;} ! case 752: #line 3381 "parse.y" ! { STMT_LINENO (yyvsp[-1].ttype) = yyvsp[-3].itype; ! finish_compound_stmt (0, yyvsp[-1].ttype); ; ! break;} ! case 753: #line 3387 "parse.y" ! { last_expr_type = NULL_TREE; ; ! break;} ! case 754: #line 3392 "parse.y" ! { yyval.ttype = begin_if_stmt (); ! cond_stmt_keyword = "if"; ; ! break;} ! case 755: #line 3395 "parse.y" ! { finish_if_stmt_cond (yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 756: #line 3397 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; ! finish_then_clause (yyvsp[-3].ttype); ; ! break;} ! case 758: #line 3404 "parse.y" ! { yyval.ttype = begin_compound_stmt (0); ; ! break;} ! case 759: #line 3406 "parse.y" ! { STMT_LINENO (yyvsp[-2].ttype) = yyvsp[-1].itype; if (yyvsp[0].ttype) STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].itype; ! finish_compound_stmt (0, yyvsp[-2].ttype); ; ! break;} ! case 761: #line 3414 "parse.y" ! { if (yyvsp[0].ttype) STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].itype; ; ! break;} ! case 762: #line 3419 "parse.y" ! { finish_stmt (); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 763: #line 3422 "parse.y" ! { yyval.ttype = finish_expr_stmt (yyvsp[-1].ttype); ; ! break;} ! case 764: #line 3424 "parse.y" ! { begin_else_clause (); ; ! break;} ! case 765: #line 3426 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; finish_else_clause (yyvsp[-3].ttype); finish_if_stmt (); ! ; ! break;} ! case 766: #line 3432 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! finish_if_stmt (); ; ! break;} ! case 767: #line 3435 "parse.y" ! { yyval.ttype = begin_while_stmt (); cond_stmt_keyword = "while"; ! ; ! break;} ! case 768: #line 3440 "parse.y" ! { finish_while_stmt_cond (yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 769: #line 3442 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; ! finish_while_stmt (yyvsp[-3].ttype); ; ! break;} ! case 770: #line 3445 "parse.y" ! { yyval.ttype = begin_do_stmt (); ; ! break;} ! case 771: #line 3447 "parse.y" ! { finish_do_body (yyvsp[-2].ttype); cond_stmt_keyword = "do"; ! ; ! break;} ! case 772: #line 3452 "parse.y" ! { yyval.ttype = yyvsp[-5].ttype; ! finish_do_stmt (yyvsp[-1].ttype, yyvsp[-5].ttype); ; ! break;} ! case 773: #line 3455 "parse.y" ! { yyval.ttype = begin_for_stmt (); ; ! break;} ! case 774: #line 3457 "parse.y" ! { finish_for_init_stmt (yyvsp[-2].ttype); ; ! break;} ! case 775: #line 3459 "parse.y" ! { finish_for_cond (yyvsp[-1].ttype, yyvsp[-5].ttype); ; ! break;} ! case 776: #line 3461 "parse.y" ! { finish_for_expr (yyvsp[-1].ttype, yyvsp[-8].ttype); ; ! break;} ! case 777: #line 3463 "parse.y" ! { yyval.ttype = yyvsp[-10].ttype; ! finish_for_stmt (yyvsp[-10].ttype); ; ! break;} ! case 778: #line 3466 "parse.y" ! { yyval.ttype = begin_switch_stmt (); ; ! break;} ! case 779: #line 3468 "parse.y" ! { finish_switch_cond (yyvsp[-1].ttype, yyvsp[-3].ttype); ; ! break;} ! case 780: #line 3470 "parse.y" ! { yyval.ttype = yyvsp[-5].ttype; ! finish_switch_stmt (yyvsp[-5].ttype); ; ! break;} ! case 781: #line 3473 "parse.y" ! { yyval.ttype = finish_case_label (yyvsp[-1].ttype, NULL_TREE); ; ! break;} ! case 782: #line 3475 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 783: #line 3477 "parse.y" ! { yyval.ttype = finish_case_label (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 784: #line 3479 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 785: #line 3481 "parse.y" ! { yyval.ttype = finish_case_label (NULL_TREE, NULL_TREE); ; ! break;} ! case 786: #line 3483 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 787: #line 3485 "parse.y" ! { yyval.ttype = finish_break_stmt (); ; ! break;} ! case 788: #line 3487 "parse.y" ! { yyval.ttype = finish_continue_stmt (); ; ! break;} ! case 789: #line 3489 "parse.y" ! { yyval.ttype = finish_return_stmt (NULL_TREE); ; ! break;} ! case 790: #line 3491 "parse.y" ! { yyval.ttype = finish_return_stmt (yyvsp[-1].ttype); ; ! break;} ! case 791: #line 3493 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE, NULL_TREE); ! ASM_INPUT_P (yyval.ttype) = 1; ; ! break;} ! case 792: #line 3498 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ; ! break;} ! case 793: #line 3502 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 794: #line 3504 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, NULL_TREE, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 795: #line 3508 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ; ! break;} ! case 796: #line 3511 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, NULL_TREE, yyvsp[-4].ttype, yyvsp[-2].ttype); ; ! break;} ! case 797: #line 3514 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, NULL_TREE, yyvsp[-2].ttype); ; ! break;} ! case 798: #line 3516 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids computed gotos"); yyval.ttype = finish_goto_stmt (yyvsp[-1].ttype); ! ; ! break;} ! case 799: #line 3522 "parse.y" ! { yyval.ttype = finish_goto_stmt (yyvsp[-1].ttype); ; ! break;} ! case 800: #line 3524 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 801: #line 3526 "parse.y" ! { error ("label must be followed by statement"); yyungetc ('}', 0); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 802: #line 3530 "parse.y" ! { finish_stmt (); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 803: #line 3533 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 804: #line 3535 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 805: #line 3537 "parse.y" ! { do_local_using_decl (yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 806: #line 3540 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 807: #line 3545 "parse.y" ! { yyval.ttype = begin_function_try_block (); ; ! break;} ! case 808: #line 3547 "parse.y" ! { finish_function_try_block (yyvsp[-1].ttype); ; ! break;} ! case 809: #line 3549 "parse.y" ! { finish_function_handler_sequence (yyvsp[-3].ttype); ; ! break;} ! case 810: #line 3554 "parse.y" ! { yyval.ttype = begin_try_block (); ; ! break;} ! case 811: #line 3556 "parse.y" ! { finish_try_block (yyvsp[-1].ttype); ; ! break;} ! case 812: #line 3558 "parse.y" ! { finish_handler_sequence (yyvsp[-3].ttype); ; ! break;} ! case 815: #line 3565 "parse.y" ! { /* Generate a fake handler block to avoid later aborts. */ tree fake_handler = begin_handler (); finish_handler_parms (NULL_TREE, fake_handler); finish_handler (fake_handler); yyval.ttype = fake_handler; error ("must have at least one catch per try block"); ! ; ! break;} ! case 816: #line 3577 "parse.y" ! { yyval.ttype = begin_handler (); ; ! break;} ! case 817: #line 3579 "parse.y" ! { finish_handler_parms (yyvsp[0].ttype, yyvsp[-1].ttype); ; ! break;} ! case 818: #line 3581 "parse.y" ! { finish_handler (yyvsp[-3].ttype); ; ! break;} ! case 821: #line 3591 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 822: #line 3607 "parse.y" ! { check_for_new_type ("inside exception declarations", yyvsp[-1].ftype); yyval.ttype = start_handler_parms (TREE_PURPOSE (yyvsp[-1].ftype.t), TREE_VALUE (yyvsp[-1].ftype.t)); ! ; ! break;} ! case 823: #line 3616 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ; ! break;} ! case 824: #line 3618 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ; ! break;} ! case 825: #line 3620 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ; ! break;} ! case 826: #line 3622 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ; ! break;} ! case 827: #line 3627 "parse.y" ! { finish_expr_stmt (yyvsp[-1].ttype); ; ! break;} ! case 829: #line 3630 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids compound statements inside for initializations"); ! ; ! break;} ! case 830: #line 3639 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 832: #line 3645 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 834: #line 3648 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 835: #line 3655 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 838: #line 3662 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ; ! break;} ! case 839: #line 3667 "parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 840: #line 3669 "parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 841: #line 3674 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE);; ! break;} ! case 842: #line 3676 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ; ! break;} ! case 843: #line 3687 "parse.y" ! { yyval.ttype = empty_parms(); ! ; ! break;} ! case 845: #line 3692 "parse.y" ! { yyval.ttype = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[0].ftype.t), 0); ! check_for_new_type ("inside parameter list", yyvsp[0].ftype); ; ! break;} ! case 846: #line 3700 "parse.y" ! { yyval.ttype = finish_parmlist (yyval.ttype, 0); ; ! break;} ! case 847: #line 3702 "parse.y" ! { yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 1); ; ! break;} ! case 848: #line 3705 "parse.y" ! { yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 1); ; ! break;} ! case 849: #line 3707 "parse.y" ! { yyval.ttype = finish_parmlist (build_tree_list (NULL_TREE, ! yyvsp[-1].ftype.t), 1); ; ! break;} ! case 850: #line 3710 "parse.y" ! { yyval.ttype = finish_parmlist (NULL_TREE, 1); ; ! break;} ! case 851: #line 3712 "parse.y" ! { /* This helps us recover from really nasty parse errors, for example, a missing right parenthesis. */ --- 9064,9796 ---- if (yyval.ttype == error_mark_node) error ("`%T' is not a class or namespace", yyvsp[-1].ttype); ! ;} ! break; ! ! case 698: #line 3194 "parse.y" ! { if (TREE_CODE (yyvsp[-1].ttype) != TYPE_DECL) yyval.ttype = lastiddecl; got_scope = complete_type (TREE_TYPE (yyval.ttype)); ! ;} ! break; ! ! case 699: #line 3200 "parse.y" ! { got_scope = yyval.ttype = complete_type (TREE_TYPE (yyval.ttype)); ;} ! break; ! ! case 702: #line 3204 "parse.y" ! { if (TREE_CODE (yyval.ttype) == IDENTIFIER_NODE) yyval.ttype = lastiddecl; got_scope = yyval.ttype; ! ;} ! break; ! ! case 703: #line 3213 "parse.y" ! { yyval.ttype = build_min_nt (TEMPLATE_ID_EXPR, yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 704: #line 3218 "parse.y" ! { if (TREE_CODE (yyvsp[0].ttype) == IDENTIFIER_NODE) yyval.ttype = IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype); else yyval.ttype = yyvsp[0].ttype; got_scope = NULL_TREE; ! ;} ! break; ! ! case 706: #line 3227 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 707: #line 3232 "parse.y" ! { got_scope = NULL_TREE; ;} ! break; ! ! case 708: #line 3234 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; got_scope = NULL_TREE; ;} ! break; ! ! case 709: #line 3241 "parse.y" ! { got_scope = void_type_node; ;} ! break; ! ! case 710: #line 3247 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 711: #line 3249 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 712: #line 3251 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 713: #line 3253 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 714: #line 3255 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, arg); ! ;} ! break; ! ! case 715: #line 3259 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 717: #line 3268 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 718: #line 3270 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 720: #line 3276 "parse.y" ! { /* Provide support for '(' attributes '*' declarator ')' etc */ yyval.ttype = tree_cons (yyvsp[-1].ttype, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 721: #line 3286 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 722: #line 3288 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 723: #line 3290 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ftype.t, NULL_TREE); ;} ! break; ! ! case 724: #line 3292 "parse.y" ! { yyval.ttype = make_pointer_declarator (NULL_TREE, NULL_TREE); ;} ! break; ! ! case 725: #line 3294 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 726: #line 3296 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 727: #line 3298 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[0].ftype.t, NULL_TREE); ;} ! break; ! ! case 728: #line 3300 "parse.y" ! { yyval.ttype = make_reference_declarator (NULL_TREE, NULL_TREE); ;} ! break; ! ! case 729: #line 3302 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-1].ttype, arg); ! ;} ! break; ! ! case 730: #line 3306 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 732: #line 3315 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 733: #line 3318 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 734: #line 3320 "parse.y" ! { yyval.ttype = make_call_declarator (yyval.ttype, empty_parms (), yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 735: #line 3322 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 736: #line 3324 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, yyval.ttype, NULL_TREE); ;} ! break; ! ! case 737: #line 3326 "parse.y" ! { yyval.ttype = make_call_declarator (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 738: #line 3328 "parse.y" ! { set_quals_and_spec (yyval.ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 739: #line 3330 "parse.y" ! { set_quals_and_spec (yyval.ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 740: #line 3332 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 741: #line 3334 "parse.y" ! { yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 748: #line 3357 "parse.y" ! { if (pedantic) ! pedwarn ("ISO C++ forbids label declarations"); ;} ! break; ! ! case 751: #line 3368 "parse.y" ! { while (yyvsp[-1].ttype) { finish_label_decl (TREE_VALUE (yyvsp[-1].ttype)); yyvsp[-1].ttype = TREE_CHAIN (yyvsp[-1].ttype); } ! ;} ! break; ! ! case 752: #line 3379 "parse.y" ! { yyval.ttype = begin_compound_stmt (0); ;} ! break; ! ! case 753: #line 3381 "parse.y" ! { STMT_LINENO (yyvsp[-1].ttype) = yyvsp[-3].itype; ! finish_compound_stmt (0, yyvsp[-1].ttype); ;} ! break; ! ! case 754: #line 3387 "parse.y" ! { last_expr_type = NULL_TREE; ;} ! break; ! ! case 755: #line 3392 "parse.y" ! { yyval.ttype = begin_if_stmt (); ! cond_stmt_keyword = "if"; ;} ! break; ! ! case 756: #line 3395 "parse.y" ! { finish_if_stmt_cond (yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 757: #line 3397 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; ! finish_then_clause (yyvsp[-3].ttype); ;} ! break; ! ! case 759: #line 3404 "parse.y" ! { yyval.ttype = begin_compound_stmt (0); ;} ! break; ! ! case 760: #line 3406 "parse.y" ! { STMT_LINENO (yyvsp[-2].ttype) = yyvsp[-1].itype; if (yyvsp[0].ttype) STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].itype; ! finish_compound_stmt (0, yyvsp[-2].ttype); ;} ! break; ! ! case 762: #line 3414 "parse.y" ! { if (yyvsp[0].ttype) STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].itype; ;} ! break; ! ! case 763: #line 3419 "parse.y" ! { finish_stmt (); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 764: #line 3422 "parse.y" ! { yyval.ttype = finish_expr_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 765: #line 3424 "parse.y" ! { begin_else_clause (); ;} ! break; ! ! case 766: #line 3426 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; finish_else_clause (yyvsp[-3].ttype); finish_if_stmt (); ! ;} ! break; ! ! case 767: #line 3432 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! finish_if_stmt (); ;} ! break; ! ! case 768: #line 3435 "parse.y" ! { yyval.ttype = begin_while_stmt (); cond_stmt_keyword = "while"; ! ;} ! break; ! ! case 769: #line 3440 "parse.y" ! { finish_while_stmt_cond (yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 770: #line 3442 "parse.y" ! { yyval.ttype = yyvsp[-3].ttype; ! finish_while_stmt (yyvsp[-3].ttype); ;} ! break; ! ! case 771: #line 3445 "parse.y" ! { yyval.ttype = begin_do_stmt (); ;} ! break; ! ! case 772: #line 3447 "parse.y" ! { finish_do_body (yyvsp[-2].ttype); cond_stmt_keyword = "do"; ! ;} ! break; ! ! case 773: #line 3452 "parse.y" ! { yyval.ttype = yyvsp[-5].ttype; ! finish_do_stmt (yyvsp[-1].ttype, yyvsp[-5].ttype); ;} ! break; ! ! case 774: #line 3455 "parse.y" ! { yyval.ttype = begin_for_stmt (); ;} ! break; ! ! case 775: #line 3457 "parse.y" ! { finish_for_init_stmt (yyvsp[-2].ttype); ;} ! break; ! ! case 776: #line 3459 "parse.y" ! { finish_for_cond (yyvsp[-1].ttype, yyvsp[-5].ttype); ;} ! break; ! ! case 777: #line 3461 "parse.y" ! { finish_for_expr (yyvsp[-1].ttype, yyvsp[-8].ttype); ;} ! break; ! ! case 778: #line 3463 "parse.y" ! { yyval.ttype = yyvsp[-10].ttype; ! finish_for_stmt (yyvsp[-10].ttype); ;} ! break; ! ! case 779: #line 3466 "parse.y" ! { yyval.ttype = begin_switch_stmt (); ;} ! break; ! ! case 780: #line 3468 "parse.y" ! { finish_switch_cond (yyvsp[-1].ttype, yyvsp[-3].ttype); ;} ! break; ! ! case 781: #line 3470 "parse.y" ! { yyval.ttype = yyvsp[-5].ttype; ! finish_switch_stmt (yyvsp[-5].ttype); ;} ! break; ! ! case 782: #line 3473 "parse.y" ! { yyval.ttype = finish_case_label (yyvsp[-1].ttype, NULL_TREE); ;} ! break; ! ! case 783: #line 3475 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 784: #line 3477 "parse.y" ! { yyval.ttype = finish_case_label (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 785: #line 3479 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 786: #line 3481 "parse.y" ! { yyval.ttype = finish_case_label (NULL_TREE, NULL_TREE); ;} ! break; ! ! case 787: #line 3483 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 788: #line 3485 "parse.y" ! { yyval.ttype = finish_break_stmt (); ;} ! break; ! ! case 789: #line 3487 "parse.y" ! { yyval.ttype = finish_continue_stmt (); ;} ! break; ! ! case 790: #line 3489 "parse.y" ! { yyval.ttype = finish_return_stmt (NULL_TREE); ;} ! break; ! ! case 791: #line 3491 "parse.y" ! { yyval.ttype = finish_return_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 792: #line 3493 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE, NULL_TREE); ! ASM_INPUT_P (yyval.ttype) = 1; ;} ! break; ! ! case 793: #line 3498 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 794: #line 3502 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 795: #line 3504 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, NULL_TREE, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 796: #line 3508 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 797: #line 3511 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, NULL_TREE, yyvsp[-4].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 798: #line 3514 "parse.y" ! { yyval.ttype = finish_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, NULL_TREE, yyvsp[-2].ttype); ;} ! break; ! ! case 799: #line 3516 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids computed gotos"); yyval.ttype = finish_goto_stmt (yyvsp[-1].ttype); ! ;} ! break; ! ! case 800: #line 3522 "parse.y" ! { yyval.ttype = finish_goto_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 801: #line 3524 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 802: #line 3526 "parse.y" ! { error ("label must be followed by statement"); yyungetc ('}', 0); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 803: #line 3530 "parse.y" ! { finish_stmt (); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 804: #line 3533 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 805: #line 3535 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 806: #line 3537 "parse.y" ! { do_local_using_decl (yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 807: #line 3540 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 808: #line 3545 "parse.y" ! { yyval.ttype = begin_function_try_block (); ;} ! break; ! ! case 809: #line 3547 "parse.y" ! { finish_function_try_block (yyvsp[-1].ttype); ;} ! break; ! ! case 810: #line 3549 "parse.y" ! { finish_function_handler_sequence (yyvsp[-3].ttype); ;} ! break; ! ! case 811: #line 3554 "parse.y" ! { yyval.ttype = begin_try_block (); ;} ! break; ! ! case 812: #line 3556 "parse.y" ! { finish_try_block (yyvsp[-1].ttype); ;} ! break; ! ! case 813: #line 3558 "parse.y" ! { finish_handler_sequence (yyvsp[-3].ttype); ;} ! break; ! ! case 816: #line 3565 "parse.y" ! { /* Generate a fake handler block to avoid later aborts. */ tree fake_handler = begin_handler (); finish_handler_parms (NULL_TREE, fake_handler); finish_handler (fake_handler); yyval.ttype = fake_handler; error ("must have at least one catch per try block"); ! ;} ! break; ! ! case 817: #line 3577 "parse.y" ! { yyval.ttype = begin_handler (); ;} ! break; ! ! case 818: #line 3579 "parse.y" ! { finish_handler_parms (yyvsp[0].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 819: #line 3581 "parse.y" ! { finish_handler (yyvsp[-3].ttype); ;} ! break; ! ! case 822: #line 3591 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 823: #line 3607 "parse.y" ! { check_for_new_type ("inside exception declarations", yyvsp[-1].ftype); yyval.ttype = start_handler_parms (TREE_PURPOSE (yyvsp[-1].ftype.t), TREE_VALUE (yyvsp[-1].ftype.t)); ! ;} ! break; ! ! case 824: #line 3616 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 825: #line 3618 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 826: #line 3620 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 827: #line 3622 "parse.y" ! { finish_label_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 828: #line 3627 "parse.y" ! { finish_expr_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 830: #line 3630 "parse.y" ! { if (pedantic) pedwarn ("ISO C++ forbids compound statements inside for initializations"); ! ;} ! break; ! ! case 831: #line 3639 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 833: #line 3645 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 835: #line 3648 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 836: #line 3655 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 839: #line 3662 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, yyvsp[0].ttype); ;} ! break; ! ! case 840: #line 3667 "parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 841: #line 3669 "parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 842: #line 3674 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE);;} ! break; ! ! case 843: #line 3676 "parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ;} ! break; ! ! case 844: #line 3687 "parse.y" ! { yyval.ttype = empty_parms(); ! ;} ! break; ! ! case 846: #line 3692 "parse.y" ! { yyval.ttype = finish_parmlist (build_tree_list (NULL_TREE, yyvsp[0].ftype.t), 0); ! check_for_new_type ("inside parameter list", yyvsp[0].ftype); ;} ! break; ! ! case 847: #line 3700 "parse.y" ! { yyval.ttype = finish_parmlist (yyval.ttype, 0); ;} ! break; ! ! case 848: #line 3702 "parse.y" ! { yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 1); ;} ! break; ! ! case 849: #line 3705 "parse.y" ! { yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 1); ;} ! break; ! ! case 850: #line 3707 "parse.y" ! { yyval.ttype = finish_parmlist (build_tree_list (NULL_TREE, ! yyvsp[-1].ftype.t), 1); ;} ! break; ! ! case 851: #line 3710 "parse.y" ! { yyval.ttype = finish_parmlist (NULL_TREE, 1); ;} ! break; ! ! case 852: #line 3712 "parse.y" ! { /* This helps us recover from really nasty parse errors, for example, a missing right parenthesis. */ *************** case 851: *** 8747,8757 **** yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 0); yyungetc (':', 0); yychar = ')'; ! ; ! break;} ! case 852: #line 3722 "parse.y" ! { /* This helps us recover from really nasty parse errors, for example, a missing right parenthesis. */ --- 9798,9809 ---- yyval.ttype = finish_parmlist (yyvsp[-1].ttype, 0); yyungetc (':', 0); yychar = ')'; ! ;} ! break; ! ! case 853: #line 3722 "parse.y" ! { /* This helps us recover from really nasty parse errors, for example, a missing right parenthesis. */ *************** case 852: *** 8760,8858 **** yyvsp[-1].ftype.t), 0); yyungetc (':', 0); yychar = ')'; ! ; ! break;} ! case 853: #line 3737 "parse.y" ! { maybe_snarf_defarg (); ; ! break;} ! case 854: #line 3739 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 857: #line 3750 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[0].ftype); ! yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ; ! break;} ! case 858: #line 3753 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[-1].ftype); ! yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ftype.t); ; ! break;} ! case 859: #line 3756 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[0].ftype); ! yyval.ttype = chainon (yyval.ttype, yyvsp[0].ftype.t); ; ! break;} ! case 860: #line 3759 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 861: #line 3761 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (yyvsp[0].ttype, yyvsp[-2].ttype)); ; ! break;} ! case 863: #line 3767 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[-1].ftype); ! yyval.ttype = build_tree_list (NULL_TREE, yyvsp[-1].ftype.t); ; ! break;} ! case 864: #line 3777 "parse.y" ! { yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ! yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ; ! break;} ! case 865: #line 3780 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 866: #line 3783 "parse.y" ! { yyval.ftype.t = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 867: #line 3787 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 868: #line 3790 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 869: #line 3793 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = 0; ; ! break;} ! case 870: #line 3799 "parse.y" ! { yyval.ftype.t = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ; ! break;} ! case 871: #line 3802 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ; ! break;} ! case 874: #line 3813 "parse.y" ! { see_typename (); ; ! break;} ! case 875: #line 3818 "parse.y" ! { error ("type specifier omitted for parameter"); yyval.ttype = build_tree_list (integer_type_node, NULL_TREE); ! ; ! break;} ! case 876: #line 3823 "parse.y" ! { if (TREE_CODE (yyval.ttype) == SCOPE_REF) { if (TREE_CODE (TREE_OPERAND (yyval.ttype, 0)) == TEMPLATE_TYPE_PARM --- 9812,9929 ---- yyvsp[-1].ftype.t), 0); yyungetc (':', 0); yychar = ')'; ! ;} ! break; ! ! case 854: #line 3737 "parse.y" ! { maybe_snarf_defarg (); ;} ! break; ! ! case 855: #line 3739 "parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 858: #line 3750 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[0].ftype); ! yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ;} ! break; ! ! case 859: #line 3753 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[-1].ftype); ! yyval.ttype = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ftype.t); ;} ! break; ! ! case 860: #line 3756 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[0].ftype); ! yyval.ttype = chainon (yyval.ttype, yyvsp[0].ftype.t); ;} ! break; ! ! case 861: #line 3759 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 862: #line 3761 "parse.y" ! { yyval.ttype = chainon (yyval.ttype, build_tree_list (yyvsp[0].ttype, yyvsp[-2].ttype)); ;} ! break; ! ! case 864: #line 3767 "parse.y" ! { check_for_new_type ("in a parameter list", yyvsp[-1].ftype); ! yyval.ttype = build_tree_list (NULL_TREE, yyvsp[-1].ftype.t); ;} ! break; ! ! case 865: #line 3777 "parse.y" ! { yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ! yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ;} ! break; ! ! case 866: #line 3780 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 867: #line 3783 "parse.y" ! { yyval.ftype.t = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-1].ftype.t), yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 868: #line 3787 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 869: #line 3790 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ftype.t, NULL_TREE); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 870: #line 3793 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[-1].ftype.t, yyvsp[0].ttype); ! yyval.ftype.new_type_flag = 0; ;} ! break; ! ! case 871: #line 3799 "parse.y" ! { yyval.ftype.t = build_tree_list (NULL_TREE, yyvsp[0].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[0].ftype.new_type_flag; ;} ! break; ! ! case 872: #line 3802 "parse.y" ! { yyval.ftype.t = build_tree_list (yyvsp[0].ttype, yyvsp[-1].ftype.t); ! yyval.ftype.new_type_flag = yyvsp[-1].ftype.new_type_flag; ;} ! break; ! ! case 875: #line 3813 "parse.y" ! { see_typename (); ;} ! break; ! ! case 876: #line 3818 "parse.y" ! { error ("type specifier omitted for parameter"); yyval.ttype = build_tree_list (integer_type_node, NULL_TREE); ! ;} ! break; ! ! case 877: #line 3823 "parse.y" ! { if (TREE_CODE (yyval.ttype) == SCOPE_REF) { if (TREE_CODE (TREE_OPERAND (yyval.ttype, 0)) == TEMPLATE_TYPE_PARM *************** case 876: *** 8864,8938 **** else error ("type specifier omitted for parameter `%E'", yyval.ttype); yyval.ttype = build_tree_list (integer_type_node, yyval.ttype); ! ; ! break;} ! case 877: #line 3840 "parse.y" ! { error("'%D' is used as a type, but is not defined as a type.", yyvsp[-4].ttype); yyvsp[-2].ttype = error_mark_node; ! ; ! break;} ! case 878: #line 3848 "parse.y" ! { ; ! break;} ! case 880: #line 3854 "parse.y" ! { ; ! break;} ! case 882: #line 3860 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 883: #line 3862 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 884: #line 3864 "parse.y" ! { yyval.ttype = empty_except_spec; ; ! break;} ! case 885: #line 3869 "parse.y" ! { check_for_new_type ("exception specifier", yyvsp[0].ftype); yyval.ttype = groktypename (yyvsp[0].ftype.t); ! ; ! break;} ! case 886: #line 3874 "parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 887: #line 3879 "parse.y" ! { yyval.ttype = add_exception_specifier (NULL_TREE, yyvsp[0].ttype, 1); ; ! break;} ! case 888: #line 3881 "parse.y" ! { yyval.ttype = add_exception_specifier (yyvsp[-2].ttype, yyvsp[0].ttype, 1); ; ! break;} ! case 889: #line 3886 "parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 890: #line 3888 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 891: #line 3890 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 892: #line 3892 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ; ! break;} ! case 893: #line 3899 "parse.y" ! { saved_scopes = tree_cons (got_scope, got_object, saved_scopes); TREE_LANG_FLAG_0 (saved_scopes) = looking_for_typename; /* We look for conversion-type-id's in both the class and current --- 9935,10024 ---- else error ("type specifier omitted for parameter `%E'", yyval.ttype); yyval.ttype = build_tree_list (integer_type_node, yyval.ttype); ! ;} ! break; ! ! case 878: #line 3840 "parse.y" ! { error("'%D' is used as a type, but is not defined as a type.", yyvsp[-4].ttype); yyvsp[-2].ttype = error_mark_node; ! ;} ! break; ! ! case 879: #line 3848 "parse.y" ! { ;} ! break; ! ! case 881: #line 3854 "parse.y" ! { ;} ! break; ! ! case 883: #line 3860 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 884: #line 3862 "parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 885: #line 3864 "parse.y" ! { yyval.ttype = empty_except_spec; ;} ! break; ! ! case 886: #line 3869 "parse.y" ! { check_for_new_type ("exception specifier", yyvsp[0].ftype); yyval.ttype = groktypename (yyvsp[0].ftype.t); ! ;} ! break; ! ! case 887: #line 3874 "parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 888: #line 3879 "parse.y" ! { yyval.ttype = add_exception_specifier (NULL_TREE, yyvsp[0].ttype, 1); ;} ! break; ! ! case 889: #line 3881 "parse.y" ! { yyval.ttype = add_exception_specifier (yyvsp[-2].ttype, yyvsp[0].ttype, 1); ;} ! break; ! ! case 890: #line 3886 "parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 891: #line 3888 "parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 892: #line 3890 "parse.y" ! { yyval.ttype = make_reference_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 893: #line 3892 "parse.y" ! { tree arg = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); yyval.ttype = build_nt (SCOPE_REF, yyvsp[-2].ttype, arg); ! ;} ! break; ! ! case 894: #line 3899 "parse.y" ! { saved_scopes = tree_cons (got_scope, got_object, saved_scopes); TREE_LANG_FLAG_0 (saved_scopes) = looking_for_typename; /* We look for conversion-type-id's in both the class and current *************** case 893: *** 8940,9127 **** looking_for_typename = 1; got_object = got_scope; got_scope = NULL_TREE; ! ; ! break;} ! case 894: #line 3911 "parse.y" ! { got_scope = TREE_PURPOSE (saved_scopes); got_object = TREE_VALUE (saved_scopes); looking_for_typename = TREE_LANG_FLAG_0 (saved_scopes); saved_scopes = TREE_CHAIN (saved_scopes); ! ; ! break;} ! case 895: #line 3920 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MULT_EXPR)); ; ! break;} ! case 896: #line 3922 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUNC_DIV_EXPR)); ; ! break;} ! case 897: #line 3924 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUNC_MOD_EXPR)); ; ! break;} ! case 898: #line 3926 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (PLUS_EXPR)); ; ! break;} ! case 899: #line 3928 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MINUS_EXPR)); ; ! break;} ! case 900: #line 3930 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_AND_EXPR)); ; ! break;} ! case 901: #line 3932 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_IOR_EXPR)); ; ! break;} ! case 902: #line 3934 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_XOR_EXPR)); ; ! break;} ! case 903: #line 3936 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_NOT_EXPR)); ; ! break;} ! case 904: #line 3938 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COMPOUND_EXPR)); ; ! break;} ! case 905: #line 3940 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ; ! break;} ! case 906: #line 3942 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (LT_EXPR)); ; ! break;} ! case 907: #line 3944 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (GT_EXPR)); ; ! break;} ! case 908: #line 3946 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ; ! break;} ! case 909: #line 3948 "parse.y" ! { yyval.ttype = frob_opname (ansi_assopname (yyvsp[-1].code)); ; ! break;} ! case 910: #line 3950 "parse.y" ! { yyval.ttype = frob_opname (ansi_assopname (NOP_EXPR)); ; ! break;} ! case 911: #line 3952 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ; ! break;} ! case 912: #line 3954 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ; ! break;} ! case 913: #line 3956 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (POSTINCREMENT_EXPR)); ; ! break;} ! case 914: #line 3958 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (PREDECREMENT_EXPR)); ; ! break;} ! case 915: #line 3960 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_ANDIF_EXPR)); ; ! break;} ! case 916: #line 3962 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_ORIF_EXPR)); ; ! break;} ! case 917: #line 3964 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_NOT_EXPR)); ; ! break;} ! case 918: #line 3966 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COND_EXPR)); ; ! break;} ! case 919: #line 3968 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ; ! break;} ! case 920: #line 3970 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COMPONENT_REF)); ; ! break;} ! case 921: #line 3972 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MEMBER_REF)); ; ! break;} ! case 922: #line 3974 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (CALL_EXPR)); ; ! break;} ! case 923: #line 3976 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (ARRAY_REF)); ; ! break;} ! case 924: #line 3978 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (NEW_EXPR)); ; ! break;} ! case 925: #line 3980 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (DELETE_EXPR)); ; ! break;} ! case 926: #line 3982 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (VEC_NEW_EXPR)); ; ! break;} ! case 927: #line 3984 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (VEC_DELETE_EXPR)); ; ! break;} ! case 928: #line 3986 "parse.y" ! { yyval.ttype = frob_opname (grokoptypename (yyvsp[-2].ftype.t, yyvsp[-1].ttype)); ; ! break;} ! case 929: #line 3988 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (ERROR_MARK)); ; ! break;} ! case 930: #line 3995 "parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.itype = lineno; ; ! break;} ! } - #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 10026,10239 ---- looking_for_typename = 1; got_object = got_scope; got_scope = NULL_TREE; ! ;} ! break; ! ! case 895: #line 3911 "parse.y" ! { got_scope = TREE_PURPOSE (saved_scopes); got_object = TREE_VALUE (saved_scopes); looking_for_typename = TREE_LANG_FLAG_0 (saved_scopes); saved_scopes = TREE_CHAIN (saved_scopes); ! ;} ! break; ! ! case 896: #line 3920 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MULT_EXPR)); ;} ! break; ! ! case 897: #line 3922 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUNC_DIV_EXPR)); ;} ! break; ! ! case 898: #line 3924 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUNC_MOD_EXPR)); ;} ! break; ! ! case 899: #line 3926 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (PLUS_EXPR)); ;} ! break; ! ! case 900: #line 3928 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MINUS_EXPR)); ;} ! break; ! ! case 901: #line 3930 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_AND_EXPR)); ;} ! break; ! ! case 902: #line 3932 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_IOR_EXPR)); ;} ! break; ! ! case 903: #line 3934 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_XOR_EXPR)); ;} ! break; ! ! case 904: #line 3936 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (BIT_NOT_EXPR)); ;} ! break; ! ! case 905: #line 3938 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COMPOUND_EXPR)); ;} ! break; ! ! case 906: #line 3940 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ;} ! break; ! ! case 907: #line 3942 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (LT_EXPR)); ;} ! break; ! ! case 908: #line 3944 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (GT_EXPR)); ;} ! break; ! ! case 909: #line 3946 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ;} ! break; ! ! case 910: #line 3948 "parse.y" ! { yyval.ttype = frob_opname (ansi_assopname (yyvsp[-1].code)); ;} ! break; ! ! case 911: #line 3950 "parse.y" ! { yyval.ttype = frob_opname (ansi_assopname (NOP_EXPR)); ;} ! break; ! ! case 912: #line 3952 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ;} ! break; ! ! case 913: #line 3954 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ;} ! break; ! ! case 914: #line 3956 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (POSTINCREMENT_EXPR)); ;} ! break; ! ! case 915: #line 3958 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (PREDECREMENT_EXPR)); ;} ! break; ! ! case 916: #line 3960 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_ANDIF_EXPR)); ;} ! break; ! ! case 917: #line 3962 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_ORIF_EXPR)); ;} ! break; ! ! case 918: #line 3964 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (TRUTH_NOT_EXPR)); ;} ! break; ! ! case 919: #line 3966 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COND_EXPR)); ;} ! break; ! ! case 920: #line 3968 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (yyvsp[-1].code)); ;} ! break; ! ! case 921: #line 3970 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (COMPONENT_REF)); ;} ! break; ! ! case 922: #line 3972 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (MEMBER_REF)); ;} ! break; ! ! case 923: #line 3974 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (CALL_EXPR)); ;} ! break; ! ! case 924: #line 3976 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (ARRAY_REF)); ;} ! break; ! ! case 925: #line 3978 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (NEW_EXPR)); ;} ! break; ! ! case 926: #line 3980 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (DELETE_EXPR)); ;} ! break; ! ! case 927: #line 3982 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (VEC_NEW_EXPR)); ;} ! break; ! ! case 928: #line 3984 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (VEC_DELETE_EXPR)); ;} ! break; ! ! case 929: #line 3986 "parse.y" ! { yyval.ttype = frob_opname (grokoptypename (yyvsp[-2].ftype.t, yyvsp[-1].ttype)); ;} ! break; ! ! case 930: #line 3988 "parse.y" ! { yyval.ttype = frob_opname (ansi_opname (ERROR_MARK)); ;} ! break; ! ! case 931: #line 3995 "parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.itype = lineno; ;} ! break; + } + + /* Line 991 of yacc.c. */ + #line 10227 "p2092.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 930: *** 9129,9139 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 10241,10251 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 9146,9158 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 10258,10270 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 9161,9175 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 10273,10287 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 9177,9183 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 10289,10295 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 9189,9290 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 10301,10392 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 9292,9300 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 10394,10400 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 9314,9326 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 10414,10428 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 9329,9334 **** --- 10431,10438 ---- #endif return yyresult; } + + #line 3999 "parse.y" *************** debug_yytranslate (value) *** 9341,9343 **** --- 10445,10448 ---- } #endif + diff -Nrc3pad gcc-3.2.2/gcc/cp/parse.h gcc-3.2.3/gcc/cp/parse.h *** gcc-3.2.2/gcc/cp/parse.h Wed Feb 5 03:19:13 2003 --- gcc-3.2.3/gcc/cp/parse.h Tue Apr 22 08:12:08 2003 *************** *** 1,107 **** ! #ifndef BISON_P13971_H ! # define BISON_P13971_H ! #ifndef YYSTYPE ! typedef union { long itype; tree ttype; char *strtype; enum tree_code code; flagged_type_tree ftype; struct unparsed_text *pi; ! } yystype; ! # define YYSTYPE yystype #endif - # define IDENTIFIER 257 - # define tTYPENAME 258 - # define SELFNAME 259 - # define PFUNCNAME 260 - # define SCSPEC 261 - # define TYPESPEC 262 - # define CV_QUALIFIER 263 - # define CONSTANT 264 - # define VAR_FUNC_NAME 265 - # define STRING 266 - # define ELLIPSIS 267 - # define SIZEOF 268 - # define ENUM 269 - # define IF 270 - # define ELSE 271 - # define WHILE 272 - # define DO 273 - # define FOR 274 - # define SWITCH 275 - # define CASE 276 - # define DEFAULT 277 - # define BREAK 278 - # define CONTINUE 279 - # define RETURN_KEYWORD 280 - # define GOTO 281 - # define ASM_KEYWORD 282 - # define TYPEOF 283 - # define ALIGNOF 284 - # define SIGOF 285 - # define ATTRIBUTE 286 - # define EXTENSION 287 - # define LABEL 288 - # define REALPART 289 - # define IMAGPART 290 - # define VA_ARG 291 - # define AGGR 292 - # define VISSPEC 293 - # define DELETE 294 - # define NEW 295 - # define THIS 296 - # define OPERATOR 297 - # define CXX_TRUE 298 - # define CXX_FALSE 299 - # define NAMESPACE 300 - # define TYPENAME_KEYWORD 301 - # define USING 302 - # define LEFT_RIGHT 303 - # define TEMPLATE 304 - # define TYPEID 305 - # define DYNAMIC_CAST 306 - # define STATIC_CAST 307 - # define REINTERPRET_CAST 308 - # define CONST_CAST 309 - # define SCOPE 310 - # define EXPORT 311 - # define EMPTY 312 - # define PTYPENAME 313 - # define NSNAME 314 - # define THROW 315 - # define ASSIGN 316 - # define OROR 317 - # define ANDAND 318 - # define MIN_MAX 319 - # define EQCOMPARE 320 - # define ARITHCOMPARE 321 - # define LSHIFT 322 - # define RSHIFT 323 - # define POINTSAT_STAR 324 - # define DOT_STAR 325 - # define UNARY 326 - # define PLUSPLUS 327 - # define MINUSMINUS 328 - # define HYPERUNARY 329 - # define POINTSAT 330 - # define TRY 331 - # define CATCH 332 - # define EXTERN_LANG_STRING 333 - # define ALL 334 - # define PRE_PARSED_CLASS_DECL 335 - # define DEFARG 336 - # define DEFARG_MARKER 337 - # define PRE_PARSED_FUNCTION_DECL 338 - # define TYPENAME_DEFN 339 - # define IDENTIFIER_DEFN 340 - # define PTYPENAME_DEFN 341 - # define END_OF_LINE 342 - # define END_OF_SAVED_INPUT 343 - extern YYSTYPE yylval; ! #endif /* not BISON_P13971_H */ ! #define YYEMPTY -2 --- 1,233 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! IDENTIFIER = 258, ! tTYPENAME = 259, ! SELFNAME = 260, ! PFUNCNAME = 261, ! SCSPEC = 262, ! TYPESPEC = 263, ! CV_QUALIFIER = 264, ! CONSTANT = 265, ! VAR_FUNC_NAME = 266, ! STRING = 267, ! ELLIPSIS = 268, ! SIZEOF = 269, ! ENUM = 270, ! IF = 271, ! ELSE = 272, ! WHILE = 273, ! DO = 274, ! FOR = 275, ! SWITCH = 276, ! CASE = 277, ! DEFAULT = 278, ! BREAK = 279, ! CONTINUE = 280, ! RETURN_KEYWORD = 281, ! GOTO = 282, ! ASM_KEYWORD = 283, ! TYPEOF = 284, ! ALIGNOF = 285, ! SIGOF = 286, ! ATTRIBUTE = 287, ! EXTENSION = 288, ! LABEL = 289, ! REALPART = 290, ! IMAGPART = 291, ! VA_ARG = 292, ! AGGR = 293, ! VISSPEC = 294, ! DELETE = 295, ! NEW = 296, ! THIS = 297, ! OPERATOR = 298, ! CXX_TRUE = 299, ! CXX_FALSE = 300, ! NAMESPACE = 301, ! TYPENAME_KEYWORD = 302, ! USING = 303, ! LEFT_RIGHT = 304, ! TEMPLATE = 305, ! TYPEID = 306, ! DYNAMIC_CAST = 307, ! STATIC_CAST = 308, ! REINTERPRET_CAST = 309, ! CONST_CAST = 310, ! SCOPE = 311, ! EXPORT = 312, ! EMPTY = 313, ! NSNAME = 314, ! PTYPENAME = 315, ! THROW = 316, ! ASSIGN = 317, ! OROR = 318, ! ANDAND = 319, ! MIN_MAX = 320, ! EQCOMPARE = 321, ! ARITHCOMPARE = 322, ! RSHIFT = 323, ! LSHIFT = 324, ! DOT_STAR = 325, ! POINTSAT_STAR = 326, ! MINUSMINUS = 327, ! PLUSPLUS = 328, ! UNARY = 329, ! HYPERUNARY = 330, ! POINTSAT = 331, ! CATCH = 332, ! TRY = 333, ! EXTERN_LANG_STRING = 334, ! ALL = 335, ! PRE_PARSED_CLASS_DECL = 336, ! DEFARG = 337, ! DEFARG_MARKER = 338, ! PRE_PARSED_FUNCTION_DECL = 339, ! TYPENAME_DEFN = 340, ! IDENTIFIER_DEFN = 341, ! PTYPENAME_DEFN = 342, ! END_OF_LINE = 343, ! END_OF_SAVED_INPUT = 344 ! }; ! #endif ! #define IDENTIFIER 258 ! #define tTYPENAME 259 ! #define SELFNAME 260 ! #define PFUNCNAME 261 ! #define SCSPEC 262 ! #define TYPESPEC 263 ! #define CV_QUALIFIER 264 ! #define CONSTANT 265 ! #define VAR_FUNC_NAME 266 ! #define STRING 267 ! #define ELLIPSIS 268 ! #define SIZEOF 269 ! #define ENUM 270 ! #define IF 271 ! #define ELSE 272 ! #define WHILE 273 ! #define DO 274 ! #define FOR 275 ! #define SWITCH 276 ! #define CASE 277 ! #define DEFAULT 278 ! #define BREAK 279 ! #define CONTINUE 280 ! #define RETURN_KEYWORD 281 ! #define GOTO 282 ! #define ASM_KEYWORD 283 ! #define TYPEOF 284 ! #define ALIGNOF 285 ! #define SIGOF 286 ! #define ATTRIBUTE 287 ! #define EXTENSION 288 ! #define LABEL 289 ! #define REALPART 290 ! #define IMAGPART 291 ! #define VA_ARG 292 ! #define AGGR 293 ! #define VISSPEC 294 ! #define DELETE 295 ! #define NEW 296 ! #define THIS 297 ! #define OPERATOR 298 ! #define CXX_TRUE 299 ! #define CXX_FALSE 300 ! #define NAMESPACE 301 ! #define TYPENAME_KEYWORD 302 ! #define USING 303 ! #define LEFT_RIGHT 304 ! #define TEMPLATE 305 ! #define TYPEID 306 ! #define DYNAMIC_CAST 307 ! #define STATIC_CAST 308 ! #define REINTERPRET_CAST 309 ! #define CONST_CAST 310 ! #define SCOPE 311 ! #define EXPORT 312 ! #define EMPTY 313 ! #define NSNAME 314 ! #define PTYPENAME 315 ! #define THROW 316 ! #define ASSIGN 317 ! #define OROR 318 ! #define ANDAND 319 ! #define MIN_MAX 320 ! #define EQCOMPARE 321 ! #define ARITHCOMPARE 322 ! #define RSHIFT 323 ! #define LSHIFT 324 ! #define DOT_STAR 325 ! #define POINTSAT_STAR 326 ! #define MINUSMINUS 327 ! #define PLUSPLUS 328 ! #define UNARY 329 ! #define HYPERUNARY 330 ! #define POINTSAT 331 ! #define CATCH 332 ! #define TRY 333 ! #define EXTERN_LANG_STRING 334 ! #define ALL 335 ! #define PRE_PARSED_CLASS_DECL 336 ! #define DEFARG 337 ! #define DEFARG_MARKER 338 ! #define PRE_PARSED_FUNCTION_DECL 339 ! #define TYPENAME_DEFN 340 ! #define IDENTIFIER_DEFN 341 ! #define PTYPENAME_DEFN 342 ! #define END_OF_LINE 343 ! #define END_OF_SAVED_INPUT 344 ! ! ! ! ! #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) ! #line 240 "parse.y" ! typedef union YYSTYPE { long itype; tree ttype; char *strtype; enum tree_code code; flagged_type_tree ftype; struct unparsed_text *pi; ! } YYSTYPE; ! /* Line 1248 of yacc.c. */ ! #line 223 "p2092.h" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif extern YYSTYPE yylval; ! ! ! #define YYEMPTY (-2) diff -Nrc3pad gcc-3.2.2/gcc/cp/pt.c gcc-3.2.3/gcc/cp/pt.c *** gcc-3.2.2/gcc/cp/pt.c Thu Dec 26 12:58:03 2002 --- gcc-3.2.3/gcc/cp/pt.c Sun Mar 16 14:28:41 2003 *************** void *** 695,702 **** maybe_process_partial_specialization (type) tree type; { ! if (IS_AGGR_TYPE (type) && CLASSTYPE_USE_TEMPLATE (type)) { if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) && !COMPLETE_TYPE_P (type)) { --- 695,716 ---- maybe_process_partial_specialization (type) tree type; { ! /* TYPE maybe an ERROR_MARK_NODE. */ ! tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE; ! ! if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) { + /* This is for ordinary explicit specialization and partial + specialization of a template class such as: + + template <> class C; + + or: + + template class C; + + Make sure that `C' and `C' are implicit instantiations. */ + if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) && !COMPLETE_TYPE_P (type)) { *************** maybe_process_partial_specialization (ty *** 714,719 **** --- 728,789 ---- else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) error ("specialization of `%T' after instantiation", type); } + else if (CLASS_TYPE_P (type) + && !CLASSTYPE_USE_TEMPLATE (type) + && CLASSTYPE_TEMPLATE_INFO (type) + && context && CLASS_TYPE_P (context) + && CLASSTYPE_TEMPLATE_INFO (context)) + { + /* This is for an explicit specialization of member class + template according to [temp.expl.spec/18]: + + template <> template class C::D; + + The context `C' must be an implicit instantiation. + Otherwise this is just a member class template declared + earlier like: + + template <> class C { template class D; }; + template <> template class C::D; + + In the first case, `C::D' is a specialization of `C::D' + while in the second case, `C::D' is a primary template + and `C::D' may not exist. */ + + if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) + && !COMPLETE_TYPE_P (type)) + { + tree t; + + if (current_namespace + != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) + { + pedwarn ("specializing `%#T' in different namespace", type); + cp_pedwarn_at (" from definition of `%#D'", + CLASSTYPE_TI_TEMPLATE (type)); + } + + /* Check for invalid specialization after instantiation: + + template <> template <> class C::D; + template <> template class C::D; */ + + for (t = DECL_TEMPLATE_INSTANTIATIONS + (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); + t; t = TREE_CHAIN (t)) + if (TREE_VALUE (t) != type + && TYPE_CONTEXT (TREE_VALUE (t)) == context) + error ("specialization `%T' after instantiation `%T'", + type, TREE_VALUE (t)); + + /* Mark TYPE as a specialization. And as a result, we only + have one level of template argument for the innermost + class template. */ + SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); + CLASSTYPE_TI_ARGS (type) + = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); + } + } else if (processing_specialization) error ("explicit specialization of non-template `%T'", type); } *************** most_general_template (decl) *** 9432,9437 **** --- 9502,9511 ---- /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE in some cases. (See cp-tree.h for details.) */ if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) + break; + + if (CLASS_TYPE_P (TREE_TYPE (decl)) + && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) break; /* Stop if we run into an explicitly specialized class template. */ diff -Nrc3pad gcc-3.2.2/gcc/cp/search.c gcc-3.2.3/gcc/cp/search.c *** gcc-3.2.2/gcc/cp/search.c Tue Jan 21 19:00:29 2003 --- gcc-3.2.3/gcc/cp/search.c Thu Mar 13 21:41:38 2003 *************** lookup_conversions (type) *** 2693,2700 **** tree t; tree conversions = NULL_TREE; ! if (COMPLETE_TYPE_P (type)) ! bfs_walk (TYPE_BINFO (type), add_conversions, 0, &conversions); for (t = conversions; t; t = TREE_CHAIN (t)) IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (t)))) = 0; --- 2693,2700 ---- tree t; tree conversions = NULL_TREE; ! complete_type (type); ! bfs_walk (TYPE_BINFO (type), add_conversions, 0, &conversions); for (t = conversions; t; t = TREE_CHAIN (t)) IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (t)))) = 0; diff -Nrc3pad gcc-3.2.2/gcc/cp/typeck2.c gcc-3.2.3/gcc/cp/typeck2.c *** gcc-3.2.2/gcc/cp/typeck2.c Thu Oct 31 00:02:35 2002 --- gcc-3.2.3/gcc/cp/typeck2.c Mon Feb 24 15:29:26 2003 *************** abstract_virtuals_error (decl, type) *** 133,138 **** --- 133,144 ---- tree u; tree tu; + if (processing_template_decl) + /* If we are processing a template, TYPE may be a template + class where CLASSTYPE_PURE_VIRTUALS always contains + inline friends. */ + return 0; + if (!CLASS_TYPE_P (type) || !CLASSTYPE_PURE_VIRTUALS (type)) return 0; diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.1 gcc-3.2.3/gcc/doc/cpp.1 *** gcc-3.2.2/gcc/doc/cpp.1 Wed Feb 5 03:13:55 2003 --- gcc-3.2.3/gcc/doc/cpp.1 Tue Apr 22 07:07:27 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:55 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:27 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "CPP 1" ! .TH CPP 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" cpp \- The C Preprocessor --- 138,144 ---- .\" ====================================================================== .\" .IX Title "CPP 1" ! .TH CPP 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" cpp \- The C Preprocessor diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info gcc-3.2.3/gcc/doc/cpp.info *** gcc-3.2.2/gcc/doc/cpp.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info Tue Apr 22 07:07:10 2003 *************** *** 0 **** --- 1,86 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + Indirect: + cpp.info-1: 191 + cpp.info-2: 49827 + cpp.info-3: 96680 + cpp.info-4: 142535 + cpp.info-5: 190066 +  + Tag Table: + (Indirect) + Node: Top191 + Node: Overview2796 + Node: Initial processing5164 + Node: Tokenization11621 + Ref: Tokenization-Footnote-118792 + Node: The preprocessing language18903 + Node: Header Files21776 + Node: Include Syntax23654 + Node: Include Operation25156 + Node: Search Path27052 + Node: Once-Only Headers30129 + Node: Computed Includes31783 + Node: Wrapper Headers34922 + Node: System Headers37341 + Node: Macros39386 + Node: Object-like Macros40486 + Node: Function-like Macros44072 + Node: Macro Arguments45682 + Node: Stringification49827 + Node: Concatenation53028 + Node: Variadic Macros56142 + Node: Predefined Macros60932 + Node: Standard Predefined Macros61515 + Node: Common Predefined Macros66795 + Node: System-specific Predefined Macros73375 + Node: C++ Named Operators75387 + Node: Undefining and Redefining Macros76342 + Node: Macro Pitfalls78420 + Node: Misnesting78945 + Node: Operator Precedence Problems80046 + Node: Swallowing the Semicolon81901 + Node: Duplication of Side Effects83913 + Node: Self-Referential Macros86085 + Node: Argument Prescan88495 + Node: Newlines in Arguments92238 + Node: Conditionals93183 + Node: Conditional Uses95012 + Node: Conditional Syntax96365 + Node: Ifdef96680 + Node: If99846 + Node: Defined102259 + Node: Else103532 + Node: Elif104093 + Node: Deleted Code105373 + Node: Diagnostics106615 + Node: Line Control108232 + Node: Pragmas112039 + Node: Other Directives116308 + Node: Preprocessor Output117502 + Node: Traditional Mode120702 + Node: Implementation Details126281 + Node: Implementation-defined behavior126903 + Node: Implementation limits129176 + Node: Obsolete Features131883 + Node: Assertions132370 + Node: Obsolete once-only headers134901 + Node: Miscellaneous obsolete features136669 + Node: Differences from previous versions138023 + Node: Invocation142535 + Ref: -MF149854 + Node: Environment Variables162264 + Ref: DEPENDENCIES_OUTPUT163914 + Node: GNU Free Documentation License164954 + Node: Option Index184852 + Node: Index of Directives188319 + Node: Concept Index190066 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info-1 gcc-3.2.3/gcc/doc/cpp.info-1 *** gcc-3.2.2/gcc/doc/cpp.info-1 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info-1 Tue Apr 22 07:07:09 2003 *************** *** 0 **** --- 1,1240 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + File: cpp.info, Node: Top, Next: Overview, Up: (dir) + + + + The C preprocessor implements the macro language used to transform C, + C++, and Objective-C programs before they are compiled. It can also be + useful on its own. + + * Menu: + + * Overview:: + * Header Files:: + * Macros:: + * Conditionals:: + * Diagnostics:: + * Line Control:: + * Pragmas:: + * Other Directives:: + * Preprocessor Output:: + * Traditional Mode:: + * Implementation Details:: + * Invocation:: + * Environment Variables:: + * GNU Free Documentation License:: + * Option Index:: + * Index of Directives:: + * Concept Index:: + + --- The Detailed Node Listing --- + + Overview + + * Initial processing:: + * Tokenization:: + * The preprocessing language:: + + Header Files + + * Include Syntax:: + * Include Operation:: + * Search Path:: + * Once-Only Headers:: + * Computed Includes:: + * Wrapper Headers:: + * System Headers:: + + Macros + + * Object-like Macros:: + * Function-like Macros:: + * Macro Arguments:: + * Stringification:: + * Concatenation:: + * Variadic Macros:: + * Predefined Macros:: + * Undefining and Redefining Macros:: + * Macro Pitfalls:: + + Predefined Macros + + * Standard Predefined Macros:: + * Common Predefined Macros:: + * System-specific Predefined Macros:: + * C++ Named Operators:: + + Macro Pitfalls + + * Misnesting:: + * Operator Precedence Problems:: + * Swallowing the Semicolon:: + * Duplication of Side Effects:: + * Self-Referential Macros:: + * Argument Prescan:: + * Newlines in Arguments:: + + Conditionals + + * Conditional Uses:: + * Conditional Syntax:: + * Deleted Code:: + + Conditional Syntax + + * Ifdef:: + * If:: + * Defined:: + * Else:: + * Elif:: + + Implementation Details + + * Implementation-defined behavior:: + * Implementation limits:: + * Obsolete Features:: + * Differences from previous versions:: + + Obsolete Features + + * Assertions:: + * Obsolete once-only headers:: + * Miscellaneous obsolete features:: + + Copyright (C) 1987, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997, + 1998, 1999, 2000, 2001 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation. A copy of + the license is included in the section entitled "GNU Free Documentation + License". + + This manual contains no Invariant Sections. The Front-Cover Texts + are (a) (see below), and the Back-Cover Texts are (b) (see below). + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise funds + for GNU development. + +  + File: cpp.info, Node: Overview, Next: Header Files, Prev: Top, Up: Top + + Overview + ******** + + The C preprocessor, often known as "cpp", is a "macro processor" + that is used automatically by the C compiler to transform your program + before compilation. It is called a macro processor because it allows + you to define "macros", which are brief abbreviations for longer + constructs. + + The C preprocessor is intended to be used only with C, C++, and + Objective-C source code. In the past, it has been abused as a general + text processor. It will choke on input which does not obey C's lexical + rules. For example, apostrophes will be interpreted as the beginning of + character constants, and cause errors. Also, you cannot rely on it + preserving characteristics of the input which are not significant to + C-family languages. If a Makefile is preprocessed, all the hard tabs + will be removed, and the Makefile will not work. + + Having said that, you can often get away with using cpp on things + which are not C. Other Algol-ish programming languages are often safe + (Pascal, Ada, etc.) So is assembly, with caution. `-traditional' mode + preserves more white space, and is otherwise more permissive. Many of + the problems can be avoided by writing C or C++ style comments instead + of native language comments, and keeping macros simple. + + Wherever possible, you should use a preprocessor geared to the + language you are writing in. Modern versions of the GNU assembler have + macro facilities. Most high level programming languages have their own + conditional compilation and inclusion mechanism. If all else fails, + try a true general text processor, such as GNU M4. + + C preprocessors vary in some details. This manual discusses the GNU + C preprocessor, which provides a small superset of the features of ISO + Standard C. In its default mode, the GNU C preprocessor does not do a + few things required by the standard. These are features which are + rarely, if ever, used, and may cause surprising changes to the meaning + of a program which does not expect them. To get strict ISO Standard C, + you should use the `-std=c89' or `-std=c99' options, depending on which + version of the standard you want. To get all the mandatory + diagnostics, you must also use `-pedantic'. *Note Invocation::. + + * Menu: + + * Initial processing:: + * Tokenization:: + * The preprocessing language:: + +  + File: cpp.info, Node: Initial processing, Next: Tokenization, Up: Overview + + Initial processing + ================== + + The preprocessor performs a series of textual transformations on its + input. These happen before all other processing. Conceptually, they + happen in a rigid order, and the entire file is run through each + transformation before the next one begins. GNU CPP actually does them + all at once, for performance reasons. These transformations correspond + roughly to the first three "phases of translation" described in the C + standard. + + 1. The input file is read into memory and broken into lines. + + GNU CPP expects its input to be a text file, that is, an + unstructured stream of ASCII characters, with some characters + indicating the end of a line of text. Extended ASCII character + sets, such as ISO Latin-1 or Unicode encoded in UTF-8, are also + acceptable. Character sets that are not strict supersets of + seven-bit ASCII will not work. We plan to add complete support + for international character sets in a future release. + + Different systems use different conventions to indicate the end of + a line. GCC accepts the ASCII control sequences `LF', `CR LF', + `CR', and `LF CR' as end-of-line markers. The first three are the + canonical sequences used by Unix, DOS and VMS, and the classic Mac + OS (before OSX) respectively. You may therefore safely copy + source code written on any of those systems to a different one and + use it without conversion. (GCC may lose track of the current + line number if a file doesn't consistently use one convention, as + sometimes happens when it is edited on computers with different + conventions that share a network file system.) `LF CR' is + included because it has been reported as an end-of-line marker + under exotic conditions. + + If the last line of any input file lacks an end-of-line marker, + the end of the file is considered to implicitly supply one. The C + standard says that this condition provokes undefined behavior, so + GCC will emit a warning message. + + 2. If trigraphs are enabled, they are replaced by their corresponding + single characters. + + These are nine three-character sequences, all starting with `??', + that are defined by ISO C to stand for single characters. They + permit obsolete systems that lack some of C's punctuation to use + C. For example, `??/' stands for `\', so '??/n' is a character + constant for a newline. By default, GCC ignores trigraphs, but if + you request a strictly conforming mode with the `-std' option, then + it converts them. + + Trigraphs are not popular and many compilers implement them + incorrectly. Portable code should not rely on trigraphs being + either converted or ignored. If you use the `-Wall' or + `-Wtrigraphs' options, GCC will warn you when a trigraph would + change the meaning of your program if it were converted. + + In a string constant, you can prevent a sequence of question marks + from being confused with a trigraph by inserting a backslash + between the question marks. "(??\?)" is the string `(???)', not + `(?]'. Traditional C compilers do not recognize this idiom. + + The nine trigraphs and their replacements are + + Trigraph: ??( ??) ??< ??> ??= ??/ ??' ??! ??- + Replacement: [ ] { } # \ ^ | ~ + + 3. Continued lines are merged into one long line. + + A continued line is a line which ends with a backslash, `\'. The + backslash is removed and the following line is joined with the + current one. No space is inserted, so you may split a line + anywhere, even in the middle of a word. (It is generally more + readable to split lines only at white space.) + + The trailing backslash on a continued line is commonly referred to + as a "backslash-newline". + + If there is white space between a backslash and the end of a line, + that is still a continued line. However, as this is usually the + result of an editing mistake, and many compilers will not accept + it as a continued line, GCC will warn you about it. + + 4. All comments are replaced with single spaces. + + There are two kinds of comments. "Block comments" begin with `/*' + and continue until the next `*/'. Block comments do not nest: + + /* this is /* one comment */ text outside comment + + "Line comments" begin with `//' and continue to the end of the + current line. Line comments do not nest either, but it does not + matter, because they would end in the same place anyway. + + // this is // one comment + text outside comment + + It is safe to put line comments inside block comments, or vice versa. + + /* block comment + // contains line comment + yet more comment + */ outside comment + + // line comment /* contains block comment */ + + But beware of commenting out one end of a block comment with a line + comment. + + // l.c. /* block comment begins + oops! this isn't a comment anymore */ + + Comments are not recognized within string literals. "/* blah */" is + the string constant `/* blah */', not an empty string. + + Line comments are not in the 1989 edition of the C standard, but they + are recognized by GCC as an extension. In C++ and in the 1999 edition + of the C standard, they are an official part of the language. + + Since these transformations happen before all other processing, you + can split a line mechanically with backslash-newline anywhere. You can + comment out the end of a line. You can continue a line comment onto the + next line with backslash-newline. You can even split `/*', `*/', and + `//' onto multiple lines with backslash-newline. For example: + + /\ + * + */ # /* + */ defi\ + ne FO\ + O 10\ + 20 + + is equivalent to `#define FOO 1020'. All these tricks are extremely + confusing and should not be used in code intended to be readable. + + There is no way to prevent a backslash at the end of a line from + being interpreted as a backslash-newline. + + "foo\\ + bar" + + is equivalent to `"foo\bar"', not to `"foo\\bar"'. To avoid having to + worry about this, do not use the deprecated GNU extension which permits + multi-line strings. Instead, use string literal concatenation: + + "foo\\" + "bar" + + Your program will be more portable this way, too. + +  + File: cpp.info, Node: Tokenization, Next: The preprocessing language, Prev: Initial processing, Up: Overview + + Tokenization + ============ + + After the textual transformations are finished, the input file is + converted into a sequence of "preprocessing tokens". These mostly + correspond to the syntactic tokens used by the C compiler, but there are + a few differences. White space separates tokens; it is not itself a + token of any kind. Tokens do not have to be separated by white space, + but it is often necessary to avoid ambiguities. + + When faced with a sequence of characters that has more than one + possible tokenization, the preprocessor is greedy. It always makes + each token, starting from the left, as big as possible before moving on + to the next token. For instance, `a+++++b' is interpreted as + `a ++ ++ + b', not as `a ++ + ++ b', even though the latter + tokenization could be part of a valid C program and the former could + not. + + Once the input file is broken into tokens, the token boundaries never + change, except when the `##' preprocessing operator is used to paste + tokens together. *Note Concatenation::. For example, + + #define foo() bar + foo()baz + ==> bar baz + _not_ + ==> barbaz + + The compiler does not re-tokenize the preprocessor's output. Each + preprocessing token becomes one compiler token. + + Preprocessing tokens fall into five broad classes: identifiers, + preprocessing numbers, string literals, punctuators, and other. An + "identifier" is the same as an identifier in C: any sequence of + letters, digits, or underscores, which begins with a letter or + underscore. Keywords of C have no significance to the preprocessor; + they are ordinary identifiers. You can define a macro whose name is a + keyword, for instance. The only identifier which can be considered a + preprocessing keyword is `defined'. *Note Defined::. + + This is mostly true of other languages which use the C preprocessor. + However, a few of the keywords of C++ are significant even in the + preprocessor. *Note C++ Named Operators::. + + In the 1999 C standard, identifiers may contain letters which are not + part of the "basic source character set," at the implementation's + discretion (such as accented Latin letters, Greek letters, or Chinese + ideograms). This may be done with an extended character set, or the + `\u' and `\U' escape sequences. GCC does not presently implement + either feature in the preprocessor or the compiler. + + As an extension, GCC treats `$' as a letter. This is for + compatibility with some systems, such as VMS, where `$' is commonly + used in system-defined function and object names. `$' is not a letter + in strictly conforming mode, or if you specify the `-$' option. *Note + Invocation::. + + A "preprocessing number" has a rather bizarre definition. The + category includes all the normal integer and floating point constants + one expects of C, but also a number of other things one might not + initially recognize as a number. Formally, preprocessing numbers begin + with an optional period, a required decimal digit, and then continue + with any sequence of letters, digits, underscores, periods, and + exponents. Exponents are the two-character sequences `e+', `e-', `E+', + `E-', `p+', `p-', `P+', and `P-'. (The exponents that begin with `p' + or `P' are new to C99. They are used for hexadecimal floating-point + constants.) + + The purpose of this unusual definition is to isolate the preprocessor + from the full complexity of numeric constants. It does not have to + distinguish between lexically valid and invalid floating-point numbers, + which is complicated. The definition also permits you to split an + identifier at any position and get exactly two tokens, which can then be + pasted back together with the `##' operator. + + It's possible for preprocessing numbers to cause programs to be + misinterpreted. For example, `0xE+12' is a preprocessing number which + does not translate to any valid numeric constant, therefore a syntax + error. It does not mean `0xE + 12', which is what you might have + intended. + + "String literals" are string constants, character constants, and + header file names (the argument of `#include').(1) String constants + and character constants are straightforward: "..." or '...'. In either + case embedded quotes should be escaped with a backslash: '\'' is the + character constant for `''. There is no limit on the length of a + character constant, but the value of a character constant that contains + more than one character is implementation-defined. *Note + Implementation Details::. + + Header file names either look like string constants, "...", or are + written with angle brackets instead, <...>. In either case, backslash + is an ordinary character. There is no way to escape the closing quote + or angle bracket. The preprocessor looks for the header file in + different places depending on which form you use. *Note Include + Operation::. + + In standard C, no string literal may extend past the end of a line. + GNU CPP accepts multi-line string constants, but not multi-line + character constants or header file names. This extension is deprecated + and will be removed in GCC 3.1. You may use continued lines instead, + or string constant concatenation. *Note Differences from previous + versions::. + + "Punctuators" are all the usual bits of punctuation which are + meaningful to C and C++. All but three of the punctuation characters in + ASCII are C punctuators. The exceptions are `@', `$', and ``'. In + addition, all the two- and three-character operators are punctuators. + There are also six "digraphs", which the C++ standard calls + "alternative tokens", which are merely alternate ways to spell other + punctuators. This is a second attempt to work around missing + punctuation in obsolete systems. It has no negative side effects, + unlike trigraphs, but does not cover as much ground. The digraphs and + their corresponding normal punctuators are: + + Digraph: <% %> <: :> %: %:%: + Punctuator: { } [ ] # ## + + Any other single character is considered "other." It is passed on to + the preprocessor's output unmolested. The C compiler will almost + certainly reject source code containing "other" tokens. In ASCII, the + only other characters are `@', `$', ``', and control characters other + than NUL (all bits zero). (Note that `$' is normally considered a + letter.) All characters with the high bit set (numeric range + 0x7F-0xFF) are also "other" in the present implementation. This will + change when proper support for international character sets is added to + GCC. + + NUL is a special case because of the high probability that its + appearance is accidental, and because it may be invisible to the user + (many terminals do not display NUL at all). Within comments, NULs are + silently ignored, just as any other character would be. In running + text, NUL is considered white space. For example, these two directives + have the same meaning. + + #define X^@1 + #define X 1 + + (where `^@' is ASCII NUL). Within string or character constants, NULs + are preserved. In the latter two cases the preprocessor emits a + warning message. + + ---------- Footnotes ---------- + + (1) The C standard uses the term "string literal" to refer only to + what we are calling "string constants". + +  + File: cpp.info, Node: The preprocessing language, Prev: Tokenization, Up: Overview + + The preprocessing language + ========================== + + After tokenization, the stream of tokens may simply be passed + straight to the compiler's parser. However, if it contains any + operations in the "preprocessing language", it will be transformed + first. This stage corresponds roughly to the standard's "translation + phase 4" and is what most people think of as the preprocessor's job. + + The preprocessing language consists of "directives" to be executed + and "macros" to be expanded. Its primary capabilities are: + + * Inclusion of header files. These are files of declarations that + can be substituted into your program. + + * Macro expansion. You can define "macros", which are abbreviations + for arbitrary fragments of C code. The preprocessor will replace + the macros with their definitions throughout the program. Some + macros are automatically defined for you. + + * Conditional compilation. You can include or exclude parts of the + program according to various conditions. + + * Line control. If you use a program to combine or rearrange source + files into an intermediate file which is then compiled, you can + use line control to inform the compiler where each source line + originally came from. + + * Diagnostics. You can detect problems at compile time and issue + errors or warnings. + + There are a few more, less useful, features. + + Except for expansion of predefined macros, all these operations are + triggered with "preprocessing directives". Preprocessing directives + are lines in your program that start with `#'. Whitespace is allowed + before and after the `#'. The `#' is followed by an identifier, the + "directive name". It specifies the operation to perform. Directives + are commonly referred to as `#NAME' where NAME is the directive name. + For example, `#define' is the directive that defines a macro. + + The `#' which begins a directive cannot come from a macro expansion. + Also, the directive name is not macro expanded. Thus, if `foo' is + defined as a macro expanding to `define', that does not make `#foo' a + valid preprocessing directive. + + The set of valid directive names is fixed. Programs cannot define + new preprocessing directives. + + Some directives require arguments; these make up the rest of the + directive line and must be separated from the directive name by + whitespace. For example, `#define' must be followed by a macro name + and the intended expansion of the macro. + + A preprocessing directive cannot cover more than one line. The line + may, however, be continued with backslash-newline, or by a block comment + which extends past the end of the line. In either case, when the + directive is processed, the continuations have already been merged with + the first line to make one long line. + +  + File: cpp.info, Node: Header Files, Next: Macros, Prev: Overview, Up: Top + + Header Files + ************ + + A header file is a file containing C declarations and macro + definitions (*note Macros::) to be shared between several source files. + You request the use of a header file in your program by "including" + it, with the C preprocessing directive `#include'. + + Header files serve two purposes. + + * System header files declare the interfaces to parts of the + operating system. You include them in your program to supply the + definitions and declarations you need to invoke system calls and + libraries. + + * Your own header files contain declarations for interfaces between + the source files of your program. Each time you have a group of + related declarations and macro definitions all or most of which + are needed in several different source files, it is a good idea to + create a header file for them. + + Including a header file produces the same results as copying the + header file into each source file that needs it. Such copying would be + time-consuming and error-prone. With a header file, the related + declarations appear in only one place. If they need to be changed, they + can be changed in one place, and programs that include the header file + will automatically use the new version when next recompiled. The header + file eliminates the labor of finding and changing all the copies as well + as the risk that a failure to find one copy will result in + inconsistencies within a program. + + In C, the usual convention is to give header files names that end + with `.h'. It is most portable to use only letters, digits, dashes, and + underscores in header file names, and at most one dot. + + * Menu: + + * Include Syntax:: + * Include Operation:: + * Search Path:: + * Once-Only Headers:: + * Computed Includes:: + * Wrapper Headers:: + * System Headers:: + +  + File: cpp.info, Node: Include Syntax, Next: Include Operation, Up: Header Files + + Include Syntax + ============== + + Both user and system header files are included using the + preprocessing directive `#include'. It has two variants: + + `#include ' + This variant is used for system header files. It searches for a + file named FILE in a standard list of system directories. You can + prepend directories to this list with the `-I' option (*note + Invocation::). + + `#include "FILE"' + This variant is used for header files of your own program. It + searches for a file named FILE first in the directory containing + the current file, then in the same directories used for `'. + + The argument of `#include', whether delimited with quote marks or + angle brackets, behaves like a string constant in that comments are not + recognized, and macro names are not expanded. Thus, `#include ' + specifies inclusion of a system header file named `x/*y'. + + However, if backslashes occur within FILE, they are considered + ordinary text characters, not escape characters. None of the character + escape sequences appropriate to string constants in C are processed. + Thus, `#include "x\n\\y"' specifies a filename containing three + backslashes. (Some systems interpret `\' as a pathname separator. All + of these also interpret `/' the same way. It is most portable to use + only `/'.) + + It is an error if there is anything (other than comments) on the line + after the file name. + +  + File: cpp.info, Node: Include Operation, Next: Search Path, Prev: Include Syntax, Up: Header Files + + Include Operation + ================= + + The `#include' directive works by directing the C preprocessor to + scan the specified file as input before continuing with the rest of the + current file. The output from the preprocessor contains the output + already generated, followed by the output resulting from the included + file, followed by the output that comes from the text after the + `#include' directive. For example, if you have a header file + `header.h' as follows, + + char *test (void); + + and a main program called `program.c' that uses the header file, like + this, + + int x; + #include "header.h" + + int + main (void) + { + puts (test ()); + } + + the compiler will see the same token stream as it would if `program.c' + read + + int x; + char *test (void); + + int + main (void) + { + puts (test ()); + } + + Included files are not limited to declarations and macro definitions; + those are merely the typical uses. Any fragment of a C program can be + included from another file. The include file could even contain the + beginning of a statement that is concluded in the containing file, or + the end of a statement that was started in the including file. However, + a comment or a string or character constant may not start in the + included file and finish in the including file. An unterminated + comment, string constant or character constant in an included file is + considered to end (with an error message) at the end of the file. + + To avoid confusion, it is best if header files contain only complete + syntactic units--function declarations or definitions, type + declarations, etc. + + The line following the `#include' directive is always treated as a + separate line by the C preprocessor, even if the included file lacks a + final newline. + +  + File: cpp.info, Node: Search Path, Next: Once-Only Headers, Prev: Include Operation, Up: Header Files + + Search Path + =========== + + GCC looks in several different places for headers. On a normal Unix + system, if you do not instruct it otherwise, it will look for headers + requested with `#include ' in: + + /usr/local/include + /usr/lib/gcc-lib/TARGET/VERSION/include + /usr/TARGET/include + /usr/include + + For C++ programs, it will also look in `/usr/include/g++-v3', first. + In the above, TARGET is the canonical name of the system GCC was + configured to compile code for; often but not always the same as the + canonical name of the system it runs on. VERSION is the version of GCC + in use. + + You can add to this list with the `-IDIR' command line option. All + the directories named by `-I' are searched, in left-to-right order, + _before_ the default directories. The only exception is when `dir' is + already searched by default. In this case, the option is ignored and + the search order for system directories remains unchanged. + + Duplicate directories are removed from the quote and bracket search + chains before the two chains are merged to make the final search chain. + Thus, it is possible for a directory to occur twice in the final search + chain if it was specified in both the quote and bracket chains. + + You can prevent GCC from searching any of the default directories + with the `-nostdinc' option. This is useful when you are compiling an + operating system kernel or some other program that does not use the + standard C library facilities, or the standard C library itself. `-I' + options are not ignored as described above when `-nostdinc' is in + effect. + + GCC looks for headers requested with `#include "FILE"' first in the + directory containing the current file, then in the same places it would + have looked for a header requested with angle brackets. For example, + if `/usr/include/sys/stat.h' contains `#include "types.h"', GCC looks + for `types.h' first in `/usr/include/sys', then in its usual search + path. + + `#line' (*note Line Control::) does not change GCC's idea of the + directory containing the current file. + + You may put `-I-' at any point in your list of `-I' options. This + has two effects. First, directories appearing before the `-I-' in the + list are searched only for headers requested with quote marks. + Directories after `-I-' are searched for all headers. Second, the + directory containing the current file is not searched for anything, + unless it happens to be one of the directories named by an `-I' switch. + + `-I. -I-' is not the same as no `-I' options at all, and does not + cause the same behavior for `<>' includes that `""' includes get with + no special options. `-I.' searches the compiler's current working + directory for header files. That may or may not be the same as the + directory containing the current file. + + If you need to look for headers in a directory named `-', write + `-I./-'. + + There are several more ways to adjust the header search path. They + are generally less useful. *Note Invocation::. + +  + File: cpp.info, Node: Once-Only Headers, Next: Computed Includes, Prev: Search Path, Up: Header Files + + Once-Only Headers + ================= + + If a header file happens to be included twice, the compiler will + process its contents twice. This is very likely to cause an error, + e.g. when the compiler sees the same structure definition twice. Even + if it does not, it will certainly waste time. + + The standard way to prevent this is to enclose the entire real + contents of the file in a conditional, like this: + + /* File foo. */ + #ifndef FILE_FOO_SEEN + #define FILE_FOO_SEEN + + THE ENTIRE FILE + + #endif /* !FILE_FOO_SEEN */ + + This construct is commonly known as a "wrapper #ifndef". When the + header is included again, the conditional will be false, because + `FILE_FOO_SEEN' is defined. The preprocessor will skip over the entire + contents of the file, and the compiler will not see it twice. + + GNU CPP optimizes even further. It remembers when a header file has + a wrapper `#ifndef'. If a subsequent `#include' specifies that header, + and the macro in the `#ifndef' is still defined, it does not bother to + rescan the file at all. + + You can put comments outside the wrapper. They will not interfere + with this optimization. + + The macro `FILE_FOO_SEEN' is called the "controlling macro" or + "guard macro". In a user header file, the macro name should not begin + with `_'. In a system header file, it should begin with `__' to avoid + conflicts with user programs. In any kind of header file, the macro + name should contain the name of the file and some additional text, to + avoid conflicts with other header files. + +  + File: cpp.info, Node: Computed Includes, Next: Wrapper Headers, Prev: Once-Only Headers, Up: Header Files + + Computed Includes + ================= + + Sometimes it is necessary to select one of several different header + files to be included into your program. They might specify + configuration parameters to be used on different sorts of operating + systems, for instance. You could do this with a series of conditionals, + + #if SYSTEM_1 + # include "system_1.h" + #elif SYSTEM_2 + # include "system_2.h" + #elif SYSTEM_3 + ... + #endif + + That rapidly becomes tedious. Instead, the preprocessor offers the + ability to use a macro for the header name. This is called a "computed + include". Instead of writing a header name as the direct argument of + `#include', you simply put a macro name there instead: + + #define SYSTEM_H "system_1.h" + ... + #include SYSTEM_H + + `SYSTEM_H' will be expanded, and the preprocessor will look for + `system_1.h' as if the `#include' had been written that way originally. + `SYSTEM_H' could be defined by your Makefile with a `-D' option. + + You must be careful when you define the macro. `#define' saves + tokens, not text. The preprocessor has no way of knowing that the macro + will be used as the argument of `#include', so it generates ordinary + tokens, not a header name. This is unlikely to cause problems if you + use double-quote includes, which are close enough to string constants. + If you use angle brackets, however, you may have trouble. + + The syntax of a computed include is actually a bit more general than + the above. If the first non-whitespace character after `#include' is + not `"' or `<', then the entire line is macro-expanded like running + text would be. + + If the line expands to a single string constant, the contents of that + string constant are the file to be included. CPP does not re-examine + the string for embedded quotes, but neither does it process backslash + escapes in the string. Therefore + + #define HEADER "a\"b" + #include HEADER + + looks for a file named `a\"b'. CPP searches for the file according to + the rules for double-quoted includes. + + If the line expands to a token stream beginning with a `<' token and + including a `>' token, then the tokens between the `<' and the first + `>' are combined to form the filename to be included. Any whitespace + between tokens is reduced to a single space; then any space after the + initial `<' is retained, but a trailing space before the closing `>' is + ignored. CPP searches for the file according to the rules for + angle-bracket includes. + + In either case, if there are any tokens on the line after the file + name, an error occurs and the directive is not processed. It is also + an error if the result of expansion does not match either of the two + expected forms. + + These rules are implementation-defined behavior according to the C + standard. To minimize the risk of different compilers interpreting your + computed includes differently, we recommend you use only a single + object-like macro which expands to a string constant. This will also + minimize confusion for people reading your program. + +  + File: cpp.info, Node: Wrapper Headers, Next: System Headers, Prev: Computed Includes, Up: Header Files + + Wrapper Headers + =============== + + Sometimes it is necessary to adjust the contents of a system-provided + header file without editing it directly. GCC's `fixincludes' operation + does this, for example. One way to do that would be to create a new + header file with the same name and insert it in the search path before + the original header. That works fine as long as you're willing to + replace the old header entirely. But what if you want to refer to the + old header from the new one? + + You cannot simply include the old header with `#include'. That will + start from the beginning, and find your new header again. If your + header is not protected from multiple inclusion (*note Once-Only + Headers::), it will recurse infinitely and cause a fatal error. + + You could include the old header with an absolute pathname: + #include "/usr/include/old-header.h" + + This works, but is not clean; should the system headers ever move, you + would have to edit the new headers to match. + + There is no way to solve this problem within the C standard, but you + can use the GNU extension `#include_next'. It means, "Include the + _next_ file with this name." This directive works like `#include' + except in searching for the specified file: it starts searching the + list of header file directories _after_ the directory in which the + current file was found. + + Suppose you specify `-I /usr/local/include', and the list of + directories to search also includes `/usr/include'; and suppose both + directories contain `signal.h'. Ordinary `#include ' finds + the file under `/usr/local/include'. If that file contains + `#include_next ', it starts searching after that directory, + and finds the file in `/usr/include'. + + `#include_next' does not distinguish between `' and `"FILE"' + inclusion, nor does it check that the file you specify has the same + name as the current file. It simply looks for the file named, starting + with the directory in the search path after the one where the current + file was found. + + The use of `#include_next' can lead to great confusion. We + recommend it be used only when there is no other alternative. In + particular, it should not be used in the headers belonging to a specific + program; it should be used only to make global corrections along the + lines of `fixincludes'. + +  + File: cpp.info, Node: System Headers, Prev: Wrapper Headers, Up: Header Files + + System Headers + ============== + + The header files declaring interfaces to the operating system and + runtime libraries often cannot be written in strictly conforming C. + Therefore, GCC gives code found in "system headers" special treatment. + All warnings, other than those generated by `#warning' (*note + Diagnostics::), are suppressed while GCC is processing a system header. + Macros defined in a system header are immune to a few warnings + wherever they are expanded. This immunity is granted on an ad-hoc + basis, when we find that a warning generates lots of false positives + because of code in macros defined in system headers. + + Normally, only the headers found in specific directories are + considered system headers. These directories are determined when GCC + is compiled. There are, however, two ways to make normal headers into + system headers. + + The `-isystem' command line option adds its argument to the list of + directories to search for headers, just like `-I'. Any headers found + in that directory will be considered system headers. + + All directories named by `-isystem' are searched _after_ all + directories named by `-I', no matter what their order was on the + command line. If the same directory is named by both `-I' and + `-isystem', the `-I' option is ignored. GCC provides an informative + message when this occurs if `-v' is used. + + There is also a directive, `#pragma GCC system_header', which tells + GCC to consider the rest of the current include file a system header, + no matter where it was found. Code that comes before the `#pragma' in + the file will not be affected. `#pragma GCC system_header' has no + effect in the primary source file. + + On very old systems, some of the pre-defined system header + directories get even more special treatment. GNU C++ considers code in + headers found in those directories to be surrounded by an `extern "C"' + block. There is no way to request this behavior with a `#pragma', or + from the command line. + +  + File: cpp.info, Node: Macros, Next: Conditionals, Prev: Header Files, Up: Top + + Macros + ****** + + A "macro" is a fragment of code which has been given a name. + Whenever the name is used, it is replaced by the contents of the macro. + There are two kinds of macros. They differ mostly in what they look + like when they are used. "Object-like" macros resemble data objects + when used, "function-like" macros resemble function calls. + + You may define any valid identifier as a macro, even if it is a C + keyword. The preprocessor does not know anything about keywords. This + can be useful if you wish to hide a keyword such as `const' from an + older compiler that does not understand it. However, the preprocessor + operator `defined' (*note Defined::) can never be defined as a macro, + and C++'s named operators (*note C++ Named Operators::) cannot be + macros when you are compiling C++. + + * Menu: + + * Object-like Macros:: + * Function-like Macros:: + * Macro Arguments:: + * Stringification:: + * Concatenation:: + * Variadic Macros:: + * Predefined Macros:: + * Undefining and Redefining Macros:: + * Macro Pitfalls:: + +  + File: cpp.info, Node: Object-like Macros, Next: Function-like Macros, Up: Macros + + Object-like Macros + ================== + + An "object-like macro" is a simple identifier which will be replaced + by a code fragment. It is called object-like because it looks like a + data object in code that uses it. They are most commonly used to give + symbolic names to numeric constants. + + You create macros with the `#define' directive. `#define' is + followed by the name of the macro and then the token sequence it should + be an abbreviation for, which is variously referred to as the macro's + "body", "expansion" or "replacement list". For example, + + #define BUFFER_SIZE 1024 + + defines a macro named `BUFFER_SIZE' as an abbreviation for the token + `1024'. If somewhere after this `#define' directive there comes a C + statement of the form + + foo = (char *) malloc (BUFFER_SIZE); + + then the C preprocessor will recognize and "expand" the macro + `BUFFER_SIZE'. The C compiler will see the same tokens as it would if + you had written + + foo = (char *) malloc (1024); + + By convention, macro names are written in upper case. Programs are + easier to read when it is possible to tell at a glance which names are + macros. + + The macro's body ends at the end of the `#define' line. You may + continue the definition onto multiple lines, if necessary, using + backslash-newline. When the macro is expanded, however, it will all + come out on one line. For example, + + #define NUMBERS 1, \ + 2, \ + 3 + int x[] = { NUMBERS }; + ==> int x[] = { 1, 2, 3 }; + + The most common visible consequence of this is surprising line numbers + in error messages. + + There is no restriction on what can go in a macro body provided it + decomposes into valid preprocessing tokens. Parentheses need not + balance, and the body need not resemble valid C code. (If it does not, + you may get error messages from the C compiler when you use the macro.) + + The C preprocessor scans your program sequentially. Macro + definitions take effect at the place you write them. Therefore, the + following input to the C preprocessor + + foo = X; + #define X 4 + bar = X; + + produces + + foo = X; + bar = 4; + + When the preprocessor expands a macro name, the macro's expansion + replaces the macro invocation, then the expansion is examined for more + macros to expand. For example, + + #define TABLESIZE BUFSIZE + #define BUFSIZE 1024 + TABLESIZE + ==> BUFSIZE + ==> 1024 + + `TABLESIZE' is expanded first to produce `BUFSIZE', then that macro is + expanded to produce the final result, `1024'. + + Notice that `BUFSIZE' was not defined when `TABLESIZE' was defined. + The `#define' for `TABLESIZE' uses exactly the expansion you + specify--in this case, `BUFSIZE'--and does not check to see whether it + too contains macro names. Only when you _use_ `TABLESIZE' is the + result of its expansion scanned for more macro names. + + This makes a difference if you change the definition of `BUFSIZE' at + some point in the source file. `TABLESIZE', defined as shown, will + always expand using the definition of `BUFSIZE' that is currently in + effect: + + #define BUFSIZE 1020 + #define TABLESIZE BUFSIZE + #undef BUFSIZE + #define BUFSIZE 37 + + Now `TABLESIZE' expands (in two stages) to `37'. + + If the expansion of a macro contains its own name, either directly or + via intermediate macros, it is not expanded again when the expansion is + examined for more macros. This prevents infinite recursion. *Note + Self-Referential Macros::, for the precise details. + +  + File: cpp.info, Node: Function-like Macros, Next: Macro Arguments, Prev: Object-like Macros, Up: Macros + + Function-like Macros + ==================== + + You can also define macros whose use looks like a function call. + These are called "function-like macros". To define a function-like + macro, you use the same `#define' directive, but you put a pair of + parentheses immediately after the macro name. For example, + + #define lang_init() c_init() + lang_init() + ==> c_init() + + A function-like macro is only expanded if its name appears with a + pair of parentheses after it. If you write just the name, it is left + alone. This can be useful when you have a function and a macro of the + same name, and you wish to use the function sometimes. + + extern void foo(void); + #define foo() /* optimized inline version */ + ... + foo(); + funcptr = foo; + + Here the call to `foo()' will use the macro, but the function + pointer will get the address of the real function. If the macro were to + be expanded, it would cause a syntax error. + + If you put spaces between the macro name and the parentheses in the + macro definition, that does not define a function-like macro, it defines + an object-like macro whose expansion happens to begin with a pair of + parentheses. + + #define lang_init () c_init() + lang_init() + ==> () c_init()() + + The first two pairs of parentheses in this expansion come from the + macro. The third is the pair that was originally after the macro + invocation. Since `lang_init' is an object-like macro, it does not + consume those parentheses. + +  + File: cpp.info, Node: Macro Arguments, Next: Stringification, Prev: Function-like Macros, Up: Macros + + Macro Arguments + =============== + + Function-like macros can take "arguments", just like true functions. + To define a macro that uses arguments, you insert "parameters" between + the pair of parentheses in the macro definition that make the macro + function-like. The parameters must be valid C identifiers, separated + by commas and optionally whitespace. + + To invoke a macro that takes arguments, you write the name of the + macro followed by a list of "actual arguments" in parentheses, separated + by commas. The invocation of the macro need not be restricted to a + single logical line--it can cross as many lines in the source file as + you wish. The number of arguments you give must match the number of + parameters in the macro definition. When the macro is expanded, each + use of a parameter in its body is replaced by the tokens of the + corresponding argument. (You need not use all of the parameters in the + macro body.) + + As an example, here is a macro that computes the minimum of two + numeric values, as it is defined in many C programs, and some uses. + + #define min(X, Y) ((X) < (Y) ? (X) : (Y)) + x = min(a, b); ==> x = ((a) < (b) ? (a) : (b)); + y = min(1, 2); ==> y = ((1) < (2) ? (1) : (2)); + z = min(a + 28, *p); ==> z = ((a + 28) < (*p) ? (a + 28) : (*p)); + + (In this small example you can already see several of the dangers of + macro arguments. *Note Macro Pitfalls::, for detailed explanations.) + + Leading and trailing whitespace in each argument is dropped, and all + whitespace between the tokens of an argument is reduced to a single + space. Parentheses within each argument must balance; a comma within + such parentheses does not end the argument. However, there is no + requirement for square brackets or braces to balance, and they do not + prevent a comma from separating arguments. Thus, + + macro (array[x = y, x + 1]) + + passes two arguments to `macro': `array[x = y' and `x + 1]'. If you + want to supply `array[x = y, x + 1]' as an argument, you can write it + as `array[(x = y, x + 1)]', which is equivalent C code. + + All arguments to a macro are completely macro-expanded before they + are substituted into the macro body. After substitution, the complete + text is scanned again for macros to expand, including the arguments. + This rule may seem strange, but it is carefully designed so you need + not worry about whether any function call is actually a macro + invocation. You can run into trouble if you try to be too clever, + though. *Note Argument Prescan::, for detailed discussion. + + For example, `min (min (a, b), c)' is first expanded to + + min (((a) < (b) ? (a) : (b)), (c)) + + and then to + + ((((a) < (b) ? (a) : (b))) < (c) + ? (((a) < (b) ? (a) : (b))) + : (c)) + + (Line breaks shown here for clarity would not actually be generated.) + + You can leave macro arguments empty; this is not an error to the + preprocessor (but many macros will then expand to invalid code). You + cannot leave out arguments entirely; if a macro takes two arguments, + there must be exactly one comma at the top level of its argument list. + Here are some silly examples using `min': + + min(, b) ==> (( ) < (b) ? ( ) : (b)) + min(a, ) ==> ((a ) < ( ) ? (a ) : ( )) + min(,) ==> (( ) < ( ) ? ( ) : ( )) + min((,),) ==> (((,)) < ( ) ? ((,)) : ( )) + + min() error--> macro "min" requires 2 arguments, but only 1 given + min(,,) error--> macro "min" passed 3 arguments, but takes just 2 + + Whitespace is not a preprocessing token, so if a macro `foo' takes + one argument, `foo ()' and `foo ( )' both supply it an empty argument. + Previous GNU preprocessor implementations and documentation were + incorrect on this point, insisting that a function-like macro that + takes a single argument be passed a space if an empty argument was + required. + + Macro parameters appearing inside string literals are not replaced by + their corresponding actual arguments. + + #define foo(x) x, "x" + foo(bar) ==> bar, "x" + diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info-2 gcc-3.2.3/gcc/doc/cpp.info-2 *** gcc-3.2.2/gcc/doc/cpp.info-2 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info-2 Tue Apr 22 07:07:10 2003 *************** *** 0 **** --- 1,1148 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + File: cpp.info, Node: Stringification, Next: Concatenation, Prev: Macro Arguments, Up: Macros + + Stringification + =============== + + Sometimes you may want to convert a macro argument into a string + constant. Parameters are not replaced inside string constants, but you + can use the `#' preprocessing operator instead. When a macro parameter + is used with a leading `#', the preprocessor replaces it with the + literal text of the actual argument, converted to a string constant. + Unlike normal parameter replacement, the argument is not macro-expanded + first. This is called "stringification". + + There is no way to combine an argument with surrounding text and + stringify it all together. Instead, you can write a series of adjacent + string constants and stringified arguments. The preprocessor will + replace the stringified arguments with string constants. The C + compiler will then combine all the adjacent string constants into one + long string. + + Here is an example of a macro definition that uses stringification: + + #define WARN_IF(EXP) \ + do { if (EXP) \ + fprintf (stderr, "Warning: " #EXP "\n"); } \ + while (0) + WARN_IF (x == 0); + ==> do { if (x == 0) + fprintf (stderr, "Warning: " "x == 0" "\n"); } while (0); + + The argument for `EXP' is substituted once, as-is, into the `if' + statement, and once, stringified, into the argument to `fprintf'. If + `x' were a macro, it would be expanded in the `if' statement, but not + in the string. + + The `do' and `while (0)' are a kludge to make it possible to write + `WARN_IF (ARG);', which the resemblance of `WARN_IF' to a function + would make C programmers want to do; see *Note Swallowing the + Semicolon::. + + Stringification in C involves more than putting double-quote + characters around the fragment. The preprocessor backslash-escapes the + quotes surrounding embedded string constants, and all backslashes + within string and character constants, in order to get a valid C string + constant with the proper contents. Thus, stringifying `p = "foo\n";' + results in "p = \"foo\\n\";". However, backslashes that are not inside + string or character constants are not duplicated: `\n' by itself + stringifies to "\n". + + All leading and trailing whitespace in text being stringified is + ignored. Any sequence of whitespace in the middle of the text is + converted to a single space in the stringified result. Comments are + replaced by whitespace long before stringification happens, so they + never appear in stringified text. + + There is no way to convert a macro argument into a character + constant. + + If you want to stringify the result of expansion of a macro argument, + you have to use two levels of macros. + + #define xstr(s) str(s) + #define str(s) #s + #define foo 4 + str (foo) + ==> "foo" + xstr (foo) + ==> xstr (4) + ==> str (4) + ==> "4" + + `s' is stringified when it is used in `str', so it is not + macro-expanded first. But `s' is an ordinary argument to `xstr', so it + is completely macro-expanded before `xstr' itself is expanded (*note + Argument Prescan::). Therefore, by the time `str' gets to its + argument, it has already been macro-expanded. + +  + File: cpp.info, Node: Concatenation, Next: Variadic Macros, Prev: Stringification, Up: Macros + + Concatenation + ============= + + It is often useful to merge two tokens into one while expanding + macros. This is called "token pasting" or "token concatenation". The + `##' preprocessing operator performs token pasting. When a macro is + expanded, the two tokens on either side of each `##' operator are + combined into a single token, which then replaces the `##' and the two + original tokens in the macro expansion. Usually both will be + identifiers, or one will be an identifier and the other a preprocessing + number. When pasted, they make a longer identifier. This isn't the + only valid case. It is also possible to concatenate two numbers (or a + number and a name, such as `1.5' and `e3') into a number. Also, + multi-character operators such as `+=' can be formed by token pasting. + + However, two tokens that don't together form a valid token cannot be + pasted together. For example, you cannot concatenate `x' with `+' in + either order. If you try, the preprocessor issues a warning and emits + the two tokens. Whether it puts white space between the tokens is + undefined. It is common to find unnecessary uses of `##' in complex + macros. If you get this warning, it is likely that you can simply + remove the `##'. + + Both the tokens combined by `##' could come from the macro body, but + you could just as well write them as one token in the first place. + Token pasting is most useful when one or both of the tokens comes from a + macro argument. If either of the tokens next to an `##' is a parameter + name, it is replaced by its actual argument before `##' executes. As + with stringification, the actual argument is not macro-expanded first. + If the argument is empty, that `##' has no effect. + + Keep in mind that the C preprocessor converts comments to whitespace + before macros are even considered. Therefore, you cannot create a + comment by concatenating `/' and `*'. You can put as much whitespace + between `##' and its operands as you like, including comments, and you + can put comments in arguments that will be concatenated. However, it + is an error if `##' appears at either end of a macro body. + + Consider a C program that interprets named commands. There probably + needs to be a table of commands, perhaps an array of structures declared + as follows: + + struct command + { + char *name; + void (*function) (void); + }; + + struct command commands[] = + { + { "quit", quit_command }, + { "help", help_command }, + ... + }; + + It would be cleaner not to have to give each command name twice, + once in the string constant and once in the function name. A macro + which takes the name of a command as an argument can make this + unnecessary. The string constant can be created with stringification, + and the function name by concatenating the argument with `_command'. + Here is how it is done: + + #define COMMAND(NAME) { #NAME, NAME ## _command } + + struct command commands[] = + { + COMMAND (quit), + COMMAND (help), + ... + }; + +  + File: cpp.info, Node: Variadic Macros, Next: Predefined Macros, Prev: Concatenation, Up: Macros + + Variadic Macros + =============== + + A macro can be declared to accept a variable number of arguments + much as a function can. The syntax for defining the macro is similar + to that of a function. Here is an example: + + #define eprintf(...) fprintf (stderr, __VA_ARGS__) + + This kind of macro is called "variadic". When the macro is invoked, + all the tokens in its argument list after the last named argument (this + macro has none), including any commas, become the "variable argument". + This sequence of tokens replaces the identifier `__VA_ARGS__' in the + macro body wherever it appears. Thus, we have this expansion: + + eprintf ("%s:%d: ", input_file, lineno) + ==> fprintf (stderr, "%s:%d: ", input_file, lineno) + + The variable argument is completely macro-expanded before it is + inserted into the macro expansion, just like an ordinary argument. You + may use the `#' and `##' operators to stringify the variable argument + or to paste its leading or trailing token with another token. (But see + below for an important special case for `##'.) + + If your macro is complicated, you may want a more descriptive name + for the variable argument than `__VA_ARGS__'. GNU CPP permits this, as + an extension. You may write an argument name immediately before the + `...'; that name is used for the variable argument. The `eprintf' + macro above could be written + + #define eprintf(args...) fprintf (stderr, args) + + using this extension. You cannot use `__VA_ARGS__' and this extension + in the same macro. + + You can have named arguments as well as variable arguments in a + variadic macro. We could define `eprintf' like this, instead: + + #define eprintf(format, ...) fprintf (stderr, format, __VA_ARGS__) + + This formulation looks more descriptive, but unfortunately it is less + flexible: you must now supply at least one argument after the format + string. In standard C, you cannot omit the comma separating the named + argument from the variable arguments. Furthermore, if you leave the + variable argument empty, you will get a syntax error, because there + will be an extra comma after the format string. + + eprintf("success!\n", ); + ==> fprintf(stderr, "success!\n", ); + + GNU CPP has a pair of extensions which deal with this problem. + First, you are allowed to leave the variable argument out entirely: + + eprintf ("success!\n") + ==> fprintf(stderr, "success!\n", ); + + Second, the `##' token paste operator has a special meaning when placed + between a comma and a variable argument. If you write + + #define eprintf(format, ...) fprintf (stderr, format, ##__VA_ARGS__) + + and the variable argument is left out when the `eprintf' macro is used, + then the comma before the `##' will be deleted. This does _not_ happen + if you pass an empty argument, nor does it happen if the token + preceding `##' is anything other than a comma. + + eprintf ("success!\n") + ==> fprintf(stderr, "success!\n"); + + The above explanation is ambiguous about the case where the only macro + parameter is a variable arguments parameter, as it is meaningless to + try to distinguish whether no argument at all is an empty argument or a + missing argument. In this case the C99 standard is clear that the + comma must remain, however the existing GCC extension used to swallow + the comma. So CPP retains the comma when conforming to a specific C + standard, and drops it otherwise. + + C99 mandates that the only place the identifier `__VA_ARGS__' can + appear is in the replacement list of a variadic macro. It may not be + used as a macro name, macro argument name, or within a different type + of macro. It may also be forbidden in open text; the standard is + ambiguous. We recommend you avoid using it except for its defined + purpose. + + Variadic macros are a new feature in C99. GNU CPP has supported them + for a long time, but only with a named variable argument (`args...', + not `...' and `__VA_ARGS__'). If you are concerned with portability to + previous versions of GCC, you should use only named variable arguments. + On the other hand, if you are concerned with portability to other + conforming implementations of C99, you should use only `__VA_ARGS__'. + + Previous versions of GNU CPP implemented the comma-deletion extension + much more generally. We have restricted it in this release to minimize + the differences from C99. To get the same effect with both this and + previous versions of GCC, the token preceding the special `##' must be + a comma, and there must be white space between that comma and whatever + comes immediately before it: + + #define eprintf(format, args...) fprintf (stderr, format , ##args) + + *Note Differences from previous versions::, for the gory details. + +  + File: cpp.info, Node: Predefined Macros, Next: Undefining and Redefining Macros, Prev: Variadic Macros, Up: Macros + + Predefined Macros + ================= + + Several object-like macros are predefined; you use them without + supplying their definitions. They fall into three classes: standard, + common, and system-specific. + + In C++, there is a fourth category, the named operators. They act + like predefined macros, but you cannot undefine them. + + * Menu: + + * Standard Predefined Macros:: + * Common Predefined Macros:: + * System-specific Predefined Macros:: + * C++ Named Operators:: + +  + File: cpp.info, Node: Standard Predefined Macros, Next: Common Predefined Macros, Up: Predefined Macros + + Standard Predefined Macros + -------------------------- + + The standard predefined macros are specified by the C and/or C++ + language standards, so they are available with all compilers that + implement those standards. Older compilers may not provide all of + them. Their names all start with double underscores. + + `__FILE__' + This macro expands to the name of the current input file, in the + form of a C string constant. This is the path by which the + preprocessor opened the file, not the short name specified in + `#include' or as the input file name argument. For example, + `"/usr/local/include/myheader.h"' is a possible expansion of this + macro. + + `__LINE__' + This macro expands to the current input line number, in the form + of a decimal integer constant. While we call it a predefined + macro, it's a pretty strange macro, since its "definition" changes + with each new line of source code. + + `__FILE__' and `__LINE__' are useful in generating an error message + to report an inconsistency detected by the program; the message can + state the source line at which the inconsistency was detected. For + example, + + fprintf (stderr, "Internal error: " + "negative string length " + "%d at %s, line %d.", + length, __FILE__, __LINE__); + + An `#include' directive changes the expansions of `__FILE__' and + `__LINE__' to correspond to the included file. At the end of that + file, when processing resumes on the input file that contained the + `#include' directive, the expansions of `__FILE__' and `__LINE__' + revert to the values they had before the `#include' (but `__LINE__' is + then incremented by one as processing moves to the line after the + `#include'). + + A `#line' directive changes `__LINE__', and may change `__FILE__' as + well. *Note Line Control::. + + C99 introduces `__func__', and GCC has provided `__FUNCTION__' for a + long time. Both of these are strings containing the name of the + current function (there are slight semantic differences; see the GCC + manual). Neither of them is a macro; the preprocessor does not know the + name of the current function. They tend to be useful in conjunction + with `__FILE__' and `__LINE__', though. + + `__DATE__' + This macro expands to a string constant that describes the date on + which the preprocessor is being run. The string constant contains + eleven characters and looks like `"Feb 12 1996"'. If the day of + the month is less than 10, it is padded with a space on the left. + + `__TIME__' + This macro expands to a string constant that describes the time at + which the preprocessor is being run. The string constant contains + eight characters and looks like `"23:59:01"'. + + `__STDC__' + In normal operation, this macro expands to the constant 1, to + signify that this compiler conforms to ISO Standard C. If GNU CPP + is used with a compiler other than GCC, this is not necessarily + true; however, the preprocessor always conforms to the standard, + unless the `-traditional' option is used. + + This macro is not defined if the `-traditional' option is used. + + On some hosts, the system compiler uses a different convention, + where `__STDC__' is normally 0, but is 1 if the user specifies + strict conformance to the C Standard. GNU CPP follows the host + convention when processing system header files, but when + processing user files `__STDC__' is always 1. This has been + reported to cause problems; for instance, some versions of Solaris + provide X Windows headers that expect `__STDC__' to be either + undefined or 1. *Note Invocation::. + + `__STDC_VERSION__' + This macro expands to the C Standard's version number, a long + integer constant of the form `YYYYMML' where YYYY and MM are the + year and month of the Standard version. This signifies which + version of the C Standard the compiler conforms to. Like + `__STDC__', this is not necessarily accurate for the entire + implementation, unless GNU CPP is being used with GCC. + + The value `199409L' signifies the 1989 C standard as amended in + 1994, which is the current default; the value `199901L' signifies + the 1999 revision of the C standard. Support for the 1999 + revision is not yet complete. + + This macro is not defined if the `-traditional' option is used, nor + when compiling C++ or Objective-C. + + `__STDC_HOSTED__' + This macro is defined, with value 1, if the compiler's target is a + "hosted environment". A hosted environment has the complete + facilities of the standard C library available. + + `__cplusplus' + This macro is defined when the C++ compiler is in use. You can use + `__cplusplus' to test whether a header is compiled by a C compiler + or a C++ compiler. This macro is similar to `__STDC_VERSION__', in + that it expands to a version number. A fully conforming + implementation of the 1998 C++ standard will define this macro to + `199711L'. The GNU C++ compiler is not yet fully conforming, so + it uses `1' instead. We hope to complete our implementation in + the near future. + + +  + File: cpp.info, Node: Common Predefined Macros, Next: System-specific Predefined Macros, Prev: Standard Predefined Macros, Up: Predefined Macros + + Common Predefined Macros + ------------------------ + + The common predefined macros are GNU C extensions. They are + available with the same meanings regardless of the machine or operating + system on which you are using GNU C. Their names all start with double + underscores. + + `__GNUC__' + `__GNUC_MINOR__' + `__GNUC_PATCHLEVEL__' + These macros are defined by all GNU compilers that use the C + preprocessor: C, C++, and Objective-C. Their values are the major + version, minor version, and patch level of the compiler, as integer + constants. For example, GCC 3.2.1 will define `__GNUC__' to 3, + `__GNUC_MINOR__' to 2, and `__GNUC_PATCHLEVEL__' to 1. They are + defined only when the entire compiler is in use; if you invoke the + preprocessor directly, they are not defined. + + `__GNUC_PATCHLEVEL__' is new to GCC 3.0; it is also present in the + widely-used development snapshots leading up to 3.0 (which identify + themselves as GCC 2.96 or 2.97, depending on which snapshot you + have). + + If all you need to know is whether or not your program is being + compiled by GCC, you can simply test `__GNUC__'. If you need to + write code which depends on a specific version, you must be more + careful. Each time the minor version is increased, the patch + level is reset to zero; each time the major version is increased + (which happens rarely), the minor version and patch level are + reset. If you wish to use the predefined macros directly in the + conditional, you will need to write it like this: + + /* Test for GCC > 3.2.0 */ + #if __GNUC__ > 3 || \ + (__GNUC__ == 3 && (__GNUC_MINOR__ > 2 || \ + (__GNUC_MINOR__ == 2 && \ + __GNUC_PATCHLEVEL__ > 0)) + + Another approach is to use the predefined macros to calculate a + single number, then compare that against a threshold: + + #define GCC_VERSION (__GNUC__ * 10000 \ + + __GNUC_MINOR__ * 100 \ + + __GNUC_PATCHLEVEL__) + ... + /* Test for GCC > 3.2.0 */ + #if GCC_VERSION > 30200 + + Many people find this form easier to understand. + + `__OBJC__' + This macro is defined, with value 1, when the Objective-C compiler + is in use. You can use `__OBJC__' to test whether a header is + compiled by a C compiler or a Objective-C compiler. + + `__GNUG__' + The GNU C++ compiler defines this. Testing it is equivalent to + testing `(__GNUC__ && __cplusplus)'. + + `__STRICT_ANSI__' + GCC defines this macro if and only if the `-ansi' switch, or a + `-std' switch specifying strict conformance to some version of ISO + C, was specified when GCC was invoked. It is defined to `1'. + This macro exists primarily to direct GNU libc's header files to + restrict their definitions to the minimal set found in the 1989 C + standard. + + `__BASE_FILE__' + This macro expands to the name of the main input file, in the form + of a C string constant. This is the source file that was specified + on the command line of the preprocessor or C compiler. + + `__INCLUDE_LEVEL__' + This macro expands to a decimal integer constant that represents + the depth of nesting in include files. The value of this macro is + incremented on every `#include' directive and decremented at the + end of every included file. It starts out at 0, it's value within + the base file specified on the command line. + + `__VERSION__' + This macro expands to a string constant which describes the + version of the compiler in use. You should not rely on its + contents having any particular form, but it can be counted on to + contain at least the release number. + + `__OPTIMIZE__' + `__OPTIMIZE_SIZE__' + `__NO_INLINE__' + These macros describe the compilation mode. `__OPTIMIZE__' is + defined in all optimizing compilations. `__OPTIMIZE_SIZE__' is + defined if the compiler is optimizing for size, not speed. + `__NO_INLINE__' is defined if no functions will be inlined into + their callers (when not optimizing, or when inlining has been + specifically disabled by `-fno-inline'). + + These macros cause certain GNU header files to provide optimized + definitions, using macros or inline functions, of system library + functions. You should not use these macros in any way unless you + make sure that programs will execute with the same effect whether + or not they are defined. If they are defined, their value is 1. + + `__CHAR_UNSIGNED__' + GCC defines this macro if and only if the data type `char' is + unsigned on the target machine. It exists to cause the standard + header file `limits.h' to work correctly. You should not use this + macro yourself; instead, refer to the standard macros defined in + `limits.h'. + + `__REGISTER_PREFIX__' + This macro expands to a single token (not a string constant) which + is the prefix applied to CPU register names in assembly language + for this target. You can use it to write assembly that is usable + in multiple environments. For example, in the `m68k-aout' + environment it expands to nothing, but in the `m68k-coff' + environment it expands to a single `%'. + + `__USER_LABEL_PREFIX__' + This macro expands to a single token which is the prefix applied to + user labels (symbols visible to C code) in assembly. For example, + in the `m68k-aout' environment it expands to an `_', but in the + `m68k-coff' environment it expands to nothing. + + This macro will have the correct definition even if + `-f(no-)underscores' is in use, but it will not be correct if + target-specific options that adjust this prefix are used (e.g. the + OSF/rose `-mno-underscores' option). + + `__SIZE_TYPE__' + `__PTRDIFF_TYPE__' + `__WCHAR_TYPE__' + `__WINT_TYPE__' + These macros are defined to the correct underlying types for the + `size_t', `ptrdiff_t', `wchar_t', and `wint_t' typedefs, + respectively. They exist to make the standard header files + `stddef.h' and `wchar.h' work correctly. You should not use these + macros directly; instead, include the appropriate headers and use + the typedefs. + + `__USING_SJLJ_EXCEPTIONS__' + This macro is defined, with value 1, if the compiler uses the old + mechanism based on `setjmp' and `longjmp' for exception handling. + +  + File: cpp.info, Node: System-specific Predefined Macros, Next: C++ Named Operators, Prev: Common Predefined Macros, Up: Predefined Macros + + System-specific Predefined Macros + --------------------------------- + + The C preprocessor normally predefines several macros that indicate + what type of system and machine is in use. They are obviously + different on each target supported by GCC. This manual, being for all + systems and machines, cannot tell you what their names are, but you can + use `cpp -dM' to see them all. *Note Invocation::. All system-specific + predefined macros expand to the constant 1, so you can test them with + either `#ifdef' or `#if'. + + The C standard requires that all system-specific macros be part of + the "reserved namespace". All names which begin with two underscores, + or an underscore and a capital letter, are reserved for the compiler and + library to use as they wish. However, historically system-specific + macros have had names with no special prefix; for instance, it is common + to find `unix' defined on Unix systems. For all such macros, GCC + provides a parallel macro with two underscores added at the beginning + and the end. If `unix' is defined, `__unix__' will be defined too. + There will never be more than two underscores; the parallel of `_mips' + is `__mips__'. + + When the `-ansi' option, or any `-std' option that requests strict + conformance, is given to the compiler, all the system-specific + predefined macros outside the reserved namespace are suppressed. The + parallel macros, inside the reserved namespace, remain defined. + + We are slowly phasing out all predefined macros which are outside the + reserved namespace. You should never use them in new programs, and we + encourage you to correct older code to use the parallel macros whenever + you find it. We don't recommend you use the system-specific macros that + are in the reserved namespace, either. It is better in the long run to + check specifically for features you need, using a tool such as + `autoconf'. + +  + File: cpp.info, Node: C++ Named Operators, Prev: System-specific Predefined Macros, Up: Predefined Macros + + C++ Named Operators + ------------------- + + In C++, there are eleven keywords which are simply alternate + spellings of operators normally written with punctuation. These + keywords are treated as such even in the preprocessor. They function + as operators in `#if', and they cannot be defined as macros or + poisoned. In C, you can request that those keywords take their C++ + meaning by including `iso646.h'. That header defines each one as a + normal object-like macro expanding to the appropriate punctuator. + + These are the named operators and their corresponding punctuators: + + Named Operator Punctuator + `and' `&&' + `and_eq' `&=' + `bitand' `&' + `bitor' `|' + `compl' `~' + `not' `!' + `not_eq' `!=' + `or' `||' + `or_eq' `|=' + `xor' `^' + `xor_eq' `^=' + +  + File: cpp.info, Node: Undefining and Redefining Macros, Next: Macro Pitfalls, Prev: Predefined Macros, Up: Macros + + Undefining and Redefining Macros + ================================ + + If a macro ceases to be useful, it may be "undefined" with the + `#undef' directive. `#undef' takes a single argument, the name of the + macro to undefine. You use the bare macro name, even if the macro is + function-like. It is an error if anything appears on the line after + the macro name. `#undef' has no effect if the name is not a macro. + + #define FOO 4 + x = FOO; ==> x = 4; + #undef FOO + x = FOO; ==> x = FOO; + + Once a macro has been undefined, that identifier may be "redefined" + as a macro by a subsequent `#define' directive. The new definition + need not have any resemblance to the old definition. + + However, if an identifier which is currently a macro is redefined, + then the new definition must be "effectively the same" as the old one. + Two macro definitions are effectively the same if: + * Both are the same type of macro (object- or function-like). + + * All the tokens of the replacement list are the same. + + * If there are any parameters, they are the same. + + * Whitespace appears in the same places in both. It need not be + exactly the same amount of whitespace, though. Remember that + comments count as whitespace. + + These definitions are effectively the same: + #define FOUR (2 + 2) + #define FOUR (2 + 2) + #define FOUR (2 /* two */ + 2) + + but these are not: + #define FOUR (2 + 2) + #define FOUR ( 2+2 ) + #define FOUR (2 * 2) + #define FOUR(score,and,seven,years,ago) (2 + 2) + + If a macro is redefined with a definition that is not effectively the + same as the old one, the preprocessor issues a warning and changes the + macro to use the new definition. If the new definition is effectively + the same, the redefinition is silently ignored. This allows, for + instance, two different headers to define a common macro. The + preprocessor will only complain if the definitions do not match. + +  + File: cpp.info, Node: Macro Pitfalls, Prev: Undefining and Redefining Macros, Up: Macros + + Macro Pitfalls + ============== + + In this section we describe some special rules that apply to macros + and macro expansion, and point out certain cases in which the rules have + counter-intuitive consequences that you must watch out for. + + * Menu: + + * Misnesting:: + * Operator Precedence Problems:: + * Swallowing the Semicolon:: + * Duplication of Side Effects:: + * Self-Referential Macros:: + * Argument Prescan:: + * Newlines in Arguments:: + +  + File: cpp.info, Node: Misnesting, Next: Operator Precedence Problems, Up: Macro Pitfalls + + Misnesting + ---------- + + When a macro is called with arguments, the arguments are substituted + into the macro body and the result is checked, together with the rest of + the input file, for more macro calls. It is possible to piece together + a macro call coming partially from the macro body and partially from the + arguments. For example, + + #define twice(x) (2*(x)) + #define call_with_1(x) x(1) + call_with_1 (twice) + ==> twice(1) + ==> (2*(1)) + + Macro definitions do not have to have balanced parentheses. By + writing an unbalanced open parenthesis in a macro body, it is possible + to create a macro call that begins inside the macro body but ends + outside of it. For example, + + #define strange(file) fprintf (file, "%s %d", + ... + strange(stderr) p, 35) + ==> fprintf (stderr, "%s %d", p, 35) + + The ability to piece together a macro call can be useful, but the + use of unbalanced open parentheses in a macro body is just confusing, + and should be avoided. + +  + File: cpp.info, Node: Operator Precedence Problems, Next: Swallowing the Semicolon, Prev: Misnesting, Up: Macro Pitfalls + + Operator Precedence Problems + ---------------------------- + + You may have noticed that in most of the macro definition examples + shown above, each occurrence of a macro argument name had parentheses + around it. In addition, another pair of parentheses usually surround + the entire macro definition. Here is why it is best to write macros + that way. + + Suppose you define a macro as follows, + + #define ceil_div(x, y) (x + y - 1) / y + + whose purpose is to divide, rounding up. (One use for this operation is + to compute how many `int' objects are needed to hold a certain number + of `char' objects.) Then suppose it is used as follows: + + a = ceil_div (b & c, sizeof (int)); + ==> a = (b & c + sizeof (int) - 1) / sizeof (int); + + This does not do what is intended. The operator-precedence rules of C + make it equivalent to this: + + a = (b & (c + sizeof (int) - 1)) / sizeof (int); + + What we want is this: + + a = ((b & c) + sizeof (int) - 1)) / sizeof (int); + + Defining the macro as + + #define ceil_div(x, y) ((x) + (y) - 1) / (y) + + provides the desired result. + + Unintended grouping can result in another way. Consider `sizeof + ceil_div(1, 2)'. That has the appearance of a C expression that would + compute the size of the type of `ceil_div (1, 2)', but in fact it means + something very different. Here is what it expands to: + + sizeof ((1) + (2) - 1) / (2) + + This would take the size of an integer and divide it by two. The + precedence rules have put the division outside the `sizeof' when it was + intended to be inside. + + Parentheses around the entire macro definition prevent such problems. + Here, then, is the recommended way to define `ceil_div': + + #define ceil_div(x, y) (((x) + (y) - 1) / (y)) + +  + File: cpp.info, Node: Swallowing the Semicolon, Next: Duplication of Side Effects, Prev: Operator Precedence Problems, Up: Macro Pitfalls + + Swallowing the Semicolon + ------------------------ + + Often it is desirable to define a macro that expands into a compound + statement. Consider, for example, the following macro, that advances a + pointer (the argument `p' says where to find it) across whitespace + characters: + + #define SKIP_SPACES(p, limit) \ + { char *lim = (limit); \ + while (p < lim) { \ + if (*p++ != ' ') { \ + p--; break; }}} + + Here backslash-newline is used to split the macro definition, which must + be a single logical line, so that it resembles the way such code would + be laid out if not part of a macro definition. + + A call to this macro might be `SKIP_SPACES (p, lim)'. Strictly + speaking, the call expands to a compound statement, which is a complete + statement with no need for a semicolon to end it. However, since it + looks like a function call, it minimizes confusion if you can use it + like a function call, writing a semicolon afterward, as in `SKIP_SPACES + (p, lim);' + + This can cause trouble before `else' statements, because the + semicolon is actually a null statement. Suppose you write + + if (*p != 0) + SKIP_SPACES (p, lim); + else ... + + The presence of two statements--the compound statement and a null + statement--in between the `if' condition and the `else' makes invalid C + code. + + The definition of the macro `SKIP_SPACES' can be altered to solve + this problem, using a `do ... while' statement. Here is how: + + #define SKIP_SPACES(p, limit) \ + do { char *lim = (limit); \ + while (p < lim) { \ + if (*p++ != ' ') { \ + p--; break; }}} \ + while (0) + + Now `SKIP_SPACES (p, lim);' expands into + + do {...} while (0); + + which is one statement. The loop executes exactly once; most compilers + generate no extra code for it. + +  + File: cpp.info, Node: Duplication of Side Effects, Next: Self-Referential Macros, Prev: Swallowing the Semicolon, Up: Macro Pitfalls + + Duplication of Side Effects + --------------------------- + + Many C programs define a macro `min', for "minimum", like this: + + #define min(X, Y) ((X) < (Y) ? (X) : (Y)) + + When you use this macro with an argument containing a side effect, + as shown here, + + next = min (x + y, foo (z)); + + it expands as follows: + + next = ((x + y) < (foo (z)) ? (x + y) : (foo (z))); + + where `x + y' has been substituted for `X' and `foo (z)' for `Y'. + + The function `foo' is used only once in the statement as it appears + in the program, but the expression `foo (z)' has been substituted twice + into the macro expansion. As a result, `foo' might be called two times + when the statement is executed. If it has side effects or if it takes + a long time to compute, the results might not be what you intended. We + say that `min' is an "unsafe" macro. + + The best solution to this problem is to define `min' in a way that + computes the value of `foo (z)' only once. The C language offers no + standard way to do this, but it can be done with GNU extensions as + follows: + + #define min(X, Y) \ + ({ typeof (X) x_ = (X); \ + typeof (Y) y_ = (Y); \ + (x_ < y_) ? x_ : y_; }) + + The `({ ... })' notation produces a compound statement that acts as + an expression. Its value is the value of its last statement. This + permits us to define local variables and assign each argument to one. + The local variables have underscores after their names to reduce the + risk of conflict with an identifier of wider scope (it is impossible to + avoid this entirely). Now each argument is evaluated exactly once. + + If you do not wish to use GNU C extensions, the only solution is to + be careful when _using_ the macro `min'. For example, you can + calculate the value of `foo (z)', save it in a variable, and use that + variable in `min': + + #define min(X, Y) ((X) < (Y) ? (X) : (Y)) + ... + { + int tem = foo (z); + next = min (x + y, tem); + } + + (where we assume that `foo' returns type `int'). + +  + File: cpp.info, Node: Self-Referential Macros, Next: Argument Prescan, Prev: Duplication of Side Effects, Up: Macro Pitfalls + + Self-Referential Macros + ----------------------- + + A "self-referential" macro is one whose name appears in its + definition. Recall that all macro definitions are rescanned for more + macros to replace. If the self-reference were considered a use of the + macro, it would produce an infinitely large expansion. To prevent this, + the self-reference is not considered a macro call. It is passed into + the preprocessor output unchanged. Let's consider an example: + + #define foo (4 + foo) + + where `foo' is also a variable in your program. + + Following the ordinary rules, each reference to `foo' will expand + into `(4 + foo)'; then this will be rescanned and will expand into `(4 + + (4 + foo))'; and so on until the computer runs out of memory. + + The self-reference rule cuts this process short after one step, at + `(4 + foo)'. Therefore, this macro definition has the possibly useful + effect of causing the program to add 4 to the value of `foo' wherever + `foo' is referred to. + + In most cases, it is a bad idea to take advantage of this feature. A + person reading the program who sees that `foo' is a variable will not + expect that it is a macro as well. The reader will come across the + identifier `foo' in the program and think its value should be that of + the variable `foo', whereas in fact the value is four greater. + + One common, useful use of self-reference is to create a macro which + expands to itself. If you write + + #define EPERM EPERM + + then the macro `EPERM' expands to `EPERM'. Effectively, it is left + alone by the preprocessor whenever it's used in running text. You can + tell that it's a macro with `#ifdef'. You might do this if you want to + define numeric constants with an `enum', but have `#ifdef' be true for + each constant. + + If a macro `x' expands to use a macro `y', and the expansion of `y' + refers to the macro `x', that is an "indirect self-reference" of `x'. + `x' is not expanded in this case either. Thus, if we have + + #define x (4 + y) + #define y (2 * x) + + then `x' and `y' expand as follows: + + x ==> (4 + y) + ==> (4 + (2 * x)) + + y ==> (2 * x) + ==> (2 * (4 + y)) + + Each macro is expanded when it appears in the definition of the other + macro, but not when it indirectly appears in its own definition. + +  + File: cpp.info, Node: Argument Prescan, Next: Newlines in Arguments, Prev: Self-Referential Macros, Up: Macro Pitfalls + + Argument Prescan + ---------------- + + Macro arguments are completely macro-expanded before they are + substituted into a macro body, unless they are stringified or pasted + with other tokens. After substitution, the entire macro body, including + the substituted arguments, is scanned again for macros to be expanded. + The result is that the arguments are scanned _twice_ to expand macro + calls in them. + + Most of the time, this has no effect. If the argument contained any + macro calls, they are expanded during the first scan. The result + therefore contains no macro calls, so the second scan does not change + it. If the argument were substituted as given, with no prescan, the + single remaining scan would find the same macro calls and produce the + same results. + + You might expect the double scan to change the results when a + self-referential macro is used in an argument of another macro (*note + Self-Referential Macros::): the self-referential macro would be + expanded once in the first scan, and a second time in the second scan. + However, this is not what happens. The self-references that do not + expand in the first scan are marked so that they will not expand in the + second scan either. + + You might wonder, "Why mention the prescan, if it makes no + difference? And why not skip it and make the preprocessor faster?" + The answer is that the prescan does make a difference in three special + cases: + + * Nested calls to a macro. + + We say that "nested" calls to a macro occur when a macro's argument + contains a call to that very macro. For example, if `f' is a macro + that expects one argument, `f (f (1))' is a nested pair of calls to + `f'. The desired expansion is made by expanding `f (1)' and + substituting that into the definition of `f'. The prescan causes + the expected result to happen. Without the prescan, `f (1)' itself + would be substituted as an argument, and the inner use of `f' would + appear during the main scan as an indirect self-reference and + would not be expanded. + + * Macros that call other macros that stringify or concatenate. + + If an argument is stringified or concatenated, the prescan does not + occur. If you _want_ to expand a macro, then stringify or + concatenate its expansion, you can do that by causing one macro to + call another macro that does the stringification or concatenation. + For instance, if you have + + #define AFTERX(x) X_ ## x + #define XAFTERX(x) AFTERX(x) + #define TABLESIZE 1024 + #define BUFSIZE TABLESIZE + + then `AFTERX(BUFSIZE)' expands to `X_BUFSIZE', and + `XAFTERX(BUFSIZE)' expands to `X_1024'. (Not to `X_TABLESIZE'. + Prescan always does a complete expansion.) + + * Macros used in arguments, whose expansions contain unshielded + commas. + + This can cause a macro expanded on the second scan to be called + with the wrong number of arguments. Here is an example: + + #define foo a,b + #define bar(x) lose(x) + #define lose(x) (1 + (x)) + + We would like `bar(foo)' to turn into `(1 + (foo))', which would + then turn into `(1 + (a,b))'. Instead, `bar(foo)' expands into + `lose(a,b)', and you get an error because `lose' requires a single + argument. In this case, the problem is easily solved by the same + parentheses that ought to be used to prevent misnesting of + arithmetic operations: + + #define foo (a,b) + or + #define bar(x) lose((x)) + + The extra pair of parentheses prevents the comma in `foo''s + definition from being interpreted as an argument separator. + + +  + File: cpp.info, Node: Newlines in Arguments, Prev: Argument Prescan, Up: Macro Pitfalls + + Newlines in Arguments + --------------------- + + The invocation of a function-like macro can extend over many logical + lines. However, in the present implementation, the entire expansion + comes out on one line. Thus line numbers emitted by the compiler or + debugger refer to the line the invocation started on, which might be + different to the line containing the argument causing the problem. + + Here is an example illustrating this: + + #define ignore_second_arg(a,b,c) a; c + + ignore_second_arg (foo (), + ignored (), + syntax error); + + The syntax error triggered by the tokens `syntax error' results in an + error message citing line three--the line of ignore_second_arg-- even + though the problematic code comes from line five. + + We consider this a bug, and intend to fix it in the near future. + +  + File: cpp.info, Node: Conditionals, Next: Diagnostics, Prev: Macros, Up: Top + + Conditionals + ************ + + A "conditional" is a directive that instructs the preprocessor to + select whether or not to include a chunk of code in the final token + stream passed to the compiler. Preprocessor conditionals can test + arithmetic expressions, or whether a name is defined as a macro, or both + simultaneously using the special `defined' operator. + + A conditional in the C preprocessor resembles in some ways an `if' + statement in C, but it is important to understand the difference between + them. The condition in an `if' statement is tested during the + execution of your program. Its purpose is to allow your program to + behave differently from run to run, depending on the data it is + operating on. The condition in a preprocessing conditional directive is + tested when your program is compiled. Its purpose is to allow different + code to be included in the program depending on the situation at the + time of compilation. + + However, the distinction is becoming less clear. Modern compilers + often do test `if' statements when a program is compiled, if their + conditions are known not to vary at run time, and eliminate code which + can never be executed. If you can count on your compiler to do this, + you may find that your program is more readable if you use `if' + statements with constant conditions (perhaps determined by macros). Of + course, you can only use this to exclude code, not type definitions or + other preprocessing directives, and you can only do it if the code + remains syntactically valid when it is not to be used. + + GCC version 3 eliminates this kind of never-executed code even when + not optimizing. Older versions did it only when optimizing. + + * Menu: + + * Conditional Uses:: + * Conditional Syntax:: + * Deleted Code:: + +  + File: cpp.info, Node: Conditional Uses, Next: Conditional Syntax, Up: Conditionals + + Conditional Uses + ================ + + There are three general reasons to use a conditional. + + * A program may need to use different code depending on the machine + or operating system it is to run on. In some cases the code for + one operating system may be erroneous on another operating system; + for example, it might refer to data types or constants that do not + exist on the other system. When this happens, it is not enough to + avoid executing the invalid code. Its mere presence will cause + the compiler to reject the program. With a preprocessing + conditional, the offending code can be effectively excised from + the program when it is not valid. + + * You may want to be able to compile the same source file into two + different programs. One version might make frequent time-consuming + consistency checks on its intermediate data, or print the values of + those data for debugging, and the other not. + + * A conditional whose condition is always false is one way to + exclude code from the program but keep it as a sort of comment for + future reference. + + Simple programs that do not need system-specific logic or complex + debugging hooks generally will not need to use preprocessing + conditionals. + +  + File: cpp.info, Node: Conditional Syntax, Next: Deleted Code, Prev: Conditional Uses, Up: Conditionals + + Conditional Syntax + ================== + + A conditional in the C preprocessor begins with a "conditional + directive": `#if', `#ifdef' or `#ifndef'. + + * Menu: + + * Ifdef:: + * If:: + * Defined:: + * Else:: + * Elif:: + diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info-3 gcc-3.2.3/gcc/doc/cpp.info-3 *** gcc-3.2.2/gcc/doc/cpp.info-3 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info-3 Tue Apr 22 07:07:10 2003 *************** *** 0 **** --- 1,1103 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + File: cpp.info, Node: Ifdef, Next: If, Up: Conditional Syntax + + Ifdef + ----- + + The simplest sort of conditional is + + #ifdef MACRO + + CONTROLLED TEXT + + #endif /* MACRO */ + + This block is called a "conditional group". CONTROLLED TEXT will be + included in the output of the preprocessor if and only if MACRO is + defined. We say that the conditional "succeeds" if MACRO is defined, + "fails" if it is not. + + The CONTROLLED TEXT inside of a conditional can include + preprocessing directives. They are executed only if the conditional + succeeds. You can nest conditional groups inside other conditional + groups, but they must be completely nested. In other words, `#endif' + always matches the nearest `#ifdef' (or `#ifndef', or `#if'). Also, + you cannot start a conditional group in one file and end it in another. + + Even if a conditional fails, the CONTROLLED TEXT inside it is still + run through initial transformations and tokenization. Therefore, it + must all be lexically valid C. Normally the only way this matters is + that all comments and string literals inside a failing conditional group + must still be properly ended. + + The comment following the `#endif' is not required, but it is a good + practice if there is a lot of CONTROLLED TEXT, because it helps people + match the `#endif' to the corresponding `#ifdef'. Older programs + sometimes put MACRO directly after the `#endif' without enclosing it in + a comment. This is invalid code according to the C standard. GNU CPP + accepts it with a warning. It never affects which `#ifndef' the + `#endif' matches. + + Sometimes you wish to use some code if a macro is _not_ defined. + You can do this by writing `#ifndef' instead of `#ifdef'. One common + use of `#ifndef' is to include code only the first time a header file + is included. *Note Once-Only Headers::. + + Macro definitions can vary between compilations for several reasons. + Here are some samples. + + * Some macros are predefined on each kind of machine (*note + System-specific Predefined Macros::). This allows you to provide + code specially tuned for a particular machine. + + * System header files define more macros, associated with the + features they implement. You can test these macros with + conditionals to avoid using a system feature on a machine where it + is not implemented. + + * Macros can be defined or undefined with the `-D' and `-U' command + line options when you compile the program. You can arrange to + compile the same source file into two different programs by + choosing a macro name to specify which program you want, writing + conditionals to test whether or how this macro is defined, and + then controlling the state of the macro with command line options, + perhaps set in the Makefile. *Note Invocation::. + + * Your program might have a special header file (often called + `config.h') that is adjusted when the program is compiled. It can + define or not define macros depending on the features of the + system and the desired capabilities of the program. The + adjustment can be automated by a tool such as `autoconf', or done + by hand. + +  + File: cpp.info, Node: If, Next: Defined, Prev: Ifdef, Up: Conditional Syntax + + If + -- + + The `#if' directive allows you to test the value of an arithmetic + expression, rather than the mere existence of one macro. Its syntax is + + #if EXPRESSION + + CONTROLLED TEXT + + #endif /* EXPRESSION */ + + EXPRESSION is a C expression of integer type, subject to stringent + restrictions. It may contain + + * Integer constants. + + * Character constants, which are interpreted as they would be in + normal code. + + * Arithmetic operators for addition, subtraction, multiplication, + division, bitwise operations, shifts, comparisons, and logical + operations (`&&' and `||'). The latter two obey the usual + short-circuiting rules of standard C. + + * Macros. All macros in the expression are expanded before actual + computation of the expression's value begins. + + * Uses of the `defined' operator, which lets you check whether macros + are defined in the middle of an `#if'. + + * Identifiers that are not macros, which are all considered to be the + number zero. This allows you to write `#if MACRO' instead of + `#ifdef MACRO', if you know that MACRO, when defined, will always + have a nonzero value. Function-like macros used without their + function call parentheses are also treated as zero. + + In some contexts this shortcut is undesirable. The `-Wundef' + option causes GCC to warn whenever it encounters an identifier + which is not a macro in an `#if'. + + The preprocessor does not know anything about types in the language. + Therefore, `sizeof' operators are not recognized in `#if', and neither + are `enum' constants. They will be taken as identifiers which are not + macros, and replaced by zero. In the case of `sizeof', this is likely + to cause the expression to be invalid. + + The preprocessor calculates the value of EXPRESSION. It carries out + all calculations in the widest integer type known to the compiler; on + most machines supported by GCC this is 64 bits. This is not the same + rule as the compiler uses to calculate the value of a constant + expression, and may give different results in some cases. If the value + comes out to be nonzero, the `#if' succeeds and the CONTROLLED TEXT is + included; otherwise it is skipped. + + If EXPRESSION is not correctly formed, GCC issues an error and + treats the conditional as having failed. + +  + File: cpp.info, Node: Defined, Next: Else, Prev: If, Up: Conditional Syntax + + Defined + ------- + + The special operator `defined' is used in `#if' and `#elif' + expressions to test whether a certain name is defined as a macro. + `defined NAME' and `defined (NAME)' are both expressions whose value is + 1 if NAME is defined as a macro at the current point in the program, + and 0 otherwise. Thus, `#if defined MACRO' is precisely equivalent to + `#ifdef MACRO'. + + `defined' is useful when you wish to test more than one macro for + existence at once. For example, + + #if defined (__vax__) || defined (__ns16000__) + + would succeed if either of the names `__vax__' or `__ns16000__' is + defined as a macro. + + Conditionals written like this: + + #if defined BUFSIZE && BUFSIZE >= 1024 + + can generally be simplified to just `#if BUFSIZE >= 1024', since if + `BUFSIZE' is not defined, it will be interpreted as having the value + zero. + + If the `defined' operator appears as a result of a macro expansion, + the C standard says the behavior is undefined. GNU cpp treats it as a + genuine `defined' operator and evaluates it normally. It will warn + wherever your code uses this feature if you use the command-line option + `-pedantic', since other compilers may handle it differently. + +  + File: cpp.info, Node: Else, Next: Elif, Prev: Defined, Up: Conditional Syntax + + Else + ---- + + The `#else' directive can be added to a conditional to provide + alternative text to be used if the condition fails. This is what it + looks like: + + #if EXPRESSION + TEXT-IF-TRUE + #else /* Not EXPRESSION */ + TEXT-IF-FALSE + #endif /* Not EXPRESSION */ + + If EXPRESSION is nonzero, the TEXT-IF-TRUE is included and the + TEXT-IF-FALSE is skipped. If EXPRESSION is zero, the opposite happens. + + You can use `#else' with `#ifdef' and `#ifndef', too. + +  + File: cpp.info, Node: Elif, Prev: Else, Up: Conditional Syntax + + Elif + ---- + + One common case of nested conditionals is used to check for more + than two possible alternatives. For example, you might have + + #if X == 1 + ... + #else /* X != 1 */ + #if X == 2 + ... + #else /* X != 2 */ + ... + #endif /* X != 2 */ + #endif /* X != 1 */ + + Another conditional directive, `#elif', allows this to be + abbreviated as follows: + + #if X == 1 + ... + #elif X == 2 + ... + #else /* X != 2 and X != 1*/ + ... + #endif /* X != 2 and X != 1*/ + + `#elif' stands for "else if". Like `#else', it goes in the middle + of a conditional group and subdivides it; it does not require a + matching `#endif' of its own. Like `#if', the `#elif' directive + includes an expression to be tested. The text following the `#elif' is + processed only if the original `#if'-condition failed and the `#elif' + condition succeeds. + + More than one `#elif' can go in the same conditional group. Then + the text after each `#elif' is processed only if the `#elif' condition + succeeds after the original `#if' and all previous `#elif' directives + within it have failed. + + `#else' is allowed after any number of `#elif' directives, but + `#elif' may not follow `#else'. + +  + File: cpp.info, Node: Deleted Code, Prev: Conditional Syntax, Up: Conditionals + + Deleted Code + ============ + + If you replace or delete a part of the program but want to keep the + old code around for future reference, you often cannot simply comment it + out. Block comments do not nest, so the first comment inside the old + code will end the commenting-out. The probable result is a flood of + syntax errors. + + One way to avoid this problem is to use an always-false conditional + instead. For instance, put `#if 0' before the deleted code and + `#endif' after it. This works even if the code being turned off + contains conditionals, but they must be entire conditionals (balanced + `#if' and `#endif'). + + Some people use `#ifdef notdef' instead. This is risky, because + `notdef' might be accidentally defined as a macro, and then the + conditional would succeed. `#if 0' can be counted on to fail. + + Do not use `#if 0' for comments which are not C code. Use a real + comment, instead. The interior of `#if 0' must consist of complete + tokens; in particular, single-quote characters must balance. Comments + often contain unbalanced single-quote characters (known in English as + apostrophes). These confuse `#if 0'. They don't confuse `/*'. + +  + File: cpp.info, Node: Diagnostics, Next: Line Control, Prev: Conditionals, Up: Top + + Diagnostics + *********** + + The directive `#error' causes the preprocessor to report a fatal + error. The tokens forming the rest of the line following `#error' are + used as the error message. + + You would use `#error' inside of a conditional that detects a + combination of parameters which you know the program does not properly + support. For example, if you know that the program will not run + properly on a VAX, you might write + + #ifdef __vax__ + #error "Won't work on VAXen. See comments at get_last_object." + #endif + + If you have several configuration parameters that must be set up by + the installation in a consistent way, you can use conditionals to detect + an inconsistency and report it with `#error'. For example, + + #if !defined(UNALIGNED_INT_ASM_OP) && defined(DWARF2_DEBUGGING_INFO) + #error "DWARF2_DEBUGGING_INFO requires UNALIGNED_INT_ASM_OP." + #endif + + The directive `#warning' is like `#error', but causes the + preprocessor to issue a warning and continue preprocessing. The tokens + following `#warning' are used as the warning message. + + You might use `#warning' in obsolete header files, with a message + directing the user to the header file which should be used instead. + + Neither `#error' nor `#warning' macro-expands its argument. + Internal whitespace sequences are each replaced with a single space. + The line must consist of complete tokens. It is wisest to make the + argument of these directives be a single string constant; this avoids + problems with apostrophes and the like. + +  + File: cpp.info, Node: Line Control, Next: Pragmas, Prev: Diagnostics, Up: Top + + Line Control + ************ + + The C preprocessor informs the C compiler of the location in your + source code where each token came from. Presently, this is just the + file name and line number. All the tokens resulting from macro + expansion are reported as having appeared on the line of the source + file where the outermost macro was used. We intend to be more accurate + in the future. + + If you write a program which generates source code, such as the + `bison' parser generator, you may want to adjust the preprocessor's + notion of the current file name and line number by hand. Parts of the + output from `bison' are generated from scratch, other parts come from a + standard parser file. The rest are copied verbatim from `bison''s + input. You would like compiler error messages and symbolic debuggers + to be able to refer to `bison''s input file. + + `bison' or any such program can arrange this by writing `#line' + directives into the output file. `#line' is a directive that specifies + the original line number and source file name for subsequent input in + the current preprocessor input file. `#line' has three variants: + + `#line LINENUM' + LINENUM is a non-negative decimal integer constant. It specifies + the line number which should be reported for the following line of + input. Subsequent lines are counted from LINENUM. + + `#line LINENUM FILENAME' + LINENUM is the same as for the first form, and has the same + effect. In addition, FILENAME is a string constant. The + following line and all subsequent lines are reported to come from + the file it specifies, until something else happens to change that. + FILENAME is interpreted according to the normal rules for a string + constant: backslash escapes are interpreted. This is different + from `#include'. + + Previous versions of GNU CPP did not interpret escapes in `#line'; + we have changed it because the standard requires they be + interpreted, and most other compilers do. + + `#line ANYTHING ELSE' + ANYTHING ELSE is checked for macro calls, which are expanded. The + result should match one of the above two forms. + + `#line' directives alter the results of the `__FILE__' and + `__LINE__' predefined macros from that point on. *Note Standard + Predefined Macros::. They do not have any effect on `#include''s idea + of the directory containing the current file. This is a change from + GCC 2.95. Previously, a file reading + + #line 1 "../src/gram.y" + #include "gram.h" + + would search for `gram.h' in `../src', then the `-I' chain; the + directory containing the physical source file would not be searched. + In GCC 3.0 and later, the `#include' is not affected by the presence of + a `#line' referring to a different directory. + + We made this change because the old behavior caused problems when + generated source files were transported between machines. For instance, + it is common practice to ship generated parsers with a source release, + so that people building the distribution do not need to have yacc or + Bison installed. These files frequently have `#line' directives + referring to the directory tree of the system where the distribution was + created. If GCC tries to search for headers in those directories, the + build is likely to fail. + + The new behavior can cause failures too, if the generated file is not + in the same directory as its source and it attempts to include a header + which would be visible searching from the directory containing the + source file. However, this problem is easily solved with an additional + `-I' switch on the command line. The failures caused by the old + semantics could sometimes be corrected only by editing the generated + files, which is difficult and error-prone. + +  + File: cpp.info, Node: Pragmas, Next: Other Directives, Prev: Line Control, Up: Top + + Pragmas + ******* + + The `#pragma' directive is the method specified by the C standard + for providing additional information to the compiler, beyond what is + conveyed in the language itself. Three forms of this directive + (commonly known as "pragmas") are specified by the 1999 C standard. A + C compiler is free to attach any meaning it likes to other pragmas. + + GCC has historically preferred to use extensions to the syntax of the + language, such as `__attribute__', for this purpose. However, GCC does + define a few pragmas of its own. These mostly have effects on the + entire translation unit or source file. + + In GCC version 3, all GNU-defined, supported pragmas have been given + a `GCC' prefix. This is in line with the `STDC' prefix on all pragmas + defined by C99. For backward compatibility, pragmas which were + recognized by previous versions are still recognized without the `GCC' + prefix, but that usage is deprecated. Some older pragmas are + deprecated in their entirety. They are not recognized with the `GCC' + prefix. *Note Obsolete Features::. + + C99 introduces the `_Pragma' operator. This feature addresses a + major problem with `#pragma': being a directive, it cannot be produced + as the result of macro expansion. `_Pragma' is an operator, much like + `sizeof' or `defined', and can be embedded in a macro. + + Its syntax is `_Pragma (STRING-LITERAL)', where STRING-LITERAL can + be either a normal or wide-character string literal. It is + destringized, by replacing all `\\' with a single `\' and all `\"' with + a `"'. The result is then processed as if it had appeared as the right + hand side of a `#pragma' directive. For example, + + _Pragma ("GCC dependency \"parse.y\"") + + has the same effect as `#pragma GCC dependency "parse.y"'. The same + effect could be achieved using macros, for example + + #define DO_PRAGMA(x) _Pragma (#x) + DO_PRAGMA (GCC dependency "parse.y") + + The standard is unclear on where a `_Pragma' operator can appear. + The preprocessor does not accept it within a preprocessing conditional + directive like `#if'. To be safe, you are probably best keeping it out + of directives other than `#define', and putting it on a line of its own. + + This manual documents the pragmas which are meaningful to the + preprocessor itself. Other pragmas are meaningful to the C or C++ + compilers. They are documented in the GCC manual. + + `#pragma GCC dependency' + `#pragma GCC dependency' allows you to check the relative dates of + the current file and another file. If the other file is more + recent than the current file, a warning is issued. This is useful + if the current file is derived from the other file, and should be + regenerated. The other file is searched for using the normal + include search path. Optional trailing text can be used to give + more information in the warning message. + + #pragma GCC dependency "parse.y" + #pragma GCC dependency "/usr/include/time.h" rerun fixincludes + + `#pragma GCC poison' + Sometimes, there is an identifier that you want to remove + completely from your program, and make sure that it never creeps + back in. To enforce this, you can "poison" the identifier with + this pragma. `#pragma GCC poison' is followed by a list of + identifiers to poison. If any of those identifiers appears + anywhere in the source after the directive, it is a hard error. + For example, + + #pragma GCC poison printf sprintf fprintf + sprintf(some_string, "hello"); + + will produce an error. + + If a poisoned identifier appears as part of the expansion of a + macro which was defined before the identifier was poisoned, it + will _not_ cause an error. This lets you poison an identifier + without worrying about system headers defining macros that use it. + + For example, + + #define strrchr rindex + #pragma GCC poison rindex + strrchr(some_string, 'h'); + + will not produce an error. + + `#pragma GCC system_header' + This pragma takes no arguments. It causes the rest of the code in + the current file to be treated as if it came from a system header. + *Note System Headers::. + + +  + File: cpp.info, Node: Other Directives, Next: Preprocessor Output, Prev: Pragmas, Up: Top + + Other Directives + **************** + + The `#ident' directive takes one argument, a string constant. On + some systems, that string constant is copied into a special segment of + the object file. On other systems, the directive is ignored. + + This directive is not part of the C standard, but it is not an + official GNU extension either. We believe it came from System V. + + The `#sccs' directive is recognized on some systems, because it + appears in their header files. It is a very old, obscure, extension + which we did not invent, and we have been unable to find any + documentation of what it should do, so GCC simply ignores it. + + The "null directive" consists of a `#' followed by a newline, with + only whitespace (including comments) in between. A null directive is + understood as a preprocessing directive but has no effect on the + preprocessor output. The primary significance of the existence of the + null directive is that an input line consisting of just a `#' will + produce no output, rather than a line of output containing just a `#'. + Supposedly some old C programs contain such lines. + +  + File: cpp.info, Node: Preprocessor Output, Next: Traditional Mode, Prev: Other Directives, Up: Top + + Preprocessor Output + ******************* + + When the C preprocessor is used with the C, C++, or Objective-C + compilers, it is integrated into the compiler and communicates a stream + of binary tokens directly to the compiler's parser. However, it can + also be used in the more conventional standalone mode, where it produces + textual output. + + The output from the C preprocessor looks much like the input, except + that all preprocessing directive lines have been replaced with blank + lines and all comments with spaces. Long runs of blank lines are + discarded. + + The ISO standard specifies that it is implementation defined whether + a preprocessor preserves whitespace between tokens, or replaces it with + e.g. a single space. In GNU CPP, whitespace between tokens is collapsed + to become a single space, with the exception that the first token on a + non-directive line is preceded with sufficient spaces that it appears in + the same column in the preprocessed output that it appeared in the + original source file. This is so the output is easy to read. *Note + Differences from previous versions::. CPP does not insert any + whitespace where there was none in the original source, except where + necessary to prevent an accidental token paste. + + Source file name and line number information is conveyed by lines of + the form + + # LINENUM FILENAME FLAGS + + These are called "linemarkers". They are inserted as needed into the + output (but never within a string or character constant). They mean + that the following line originated in file FILENAME at line LINENUM. + FILENAME will never contain any non-printing characters; they are + replaced with octal escape sequences. + + After the file name comes zero or more flags, which are `1', `2', + `3', or `4'. If there are multiple flags, spaces separate them. Here + is what the flags mean: + + `1' + This indicates the start of a new file. + + `2' + This indicates returning to a file (after having included another + file). + + `3' + This indicates that the following text comes from a system header + file, so certain warnings should be suppressed. + + `4' + This indicates that the following text should be treated as being + wrapped in an implicit `extern "C"' block. + + As an extension, the preprocessor accepts linemarkers in + non-assembler input files. They are treated like the corresponding + `#line' directive, (*note Line Control::), except that trailing flags + are permitted, and are interpreted with the meanings described above. + If multiple flags are given, they must be in ascending order. + + Some directives may be duplicated in the output of the preprocessor. + These are `#ident' (always), `#pragma' (only if the preprocessor does + not handle the pragma itself), and `#define' and `#undef' (with certain + debugging options). If this happens, the `#' of the directive will + always be in the first column, and there will be no space between the + `#' and the directive name. If macro expansion happens to generate + tokens which might be mistaken for a duplicated directive, a space will + be inserted between the `#' and the directive name. + +  + File: cpp.info, Node: Traditional Mode, Next: Implementation Details, Prev: Preprocessor Output, Up: Top + + Traditional Mode + **************** + + Traditional (pre-standard) C preprocessing is rather different from + the preprocessing specified by the standard. When GCC is given the + `-traditional' option, it attempts to emulate a traditional + preprocessor. We do not guarantee that GCC's behavior under + `-traditional' matches any pre-standard preprocessor exactly. + + Traditional mode exists only for backward compatibility. We have no + plans to augment it in any way nor will we change it except to fix + catastrophic bugs. You should be aware that modern C libraries often + have header files which are incompatible with traditional mode. + + This is a list of the differences. It may not be complete, and may + not correspond exactly to the behavior of either GCC or a true + traditional preprocessor. + + * Traditional macro expansion pays no attention to single-quote or + double-quote characters; macro argument symbols are replaced by the + argument values even when they appear within apparent string or + character constants. + + * Traditionally, it is permissible for a macro expansion to end in + the middle of a string or character constant. The constant + continues into the text surrounding the macro call. + + * However, the end of the line terminates a string or character + constant, with no error. (This is a kluge. Traditional mode is + commonly used to preprocess things which are not C, and have a + different comment syntax. Single apostrophes often appear in + comments. This kluge prevents the traditional preprocessor from + issuing errors on such comments.) + + * Preprocessing directives are recognized in traditional C only when + their leading `#' appears in the first column. There can be no + whitespace between the beginning of the line and the `#'. + + * In traditional C, a comment is equivalent to no text at all. (In + ISO C, a comment counts as whitespace.) It can be used sort of + the same way that `##' is used in ISO C, to paste macro arguments + together. + + * Traditional C does not have the concept of a preprocessing number. + + * A macro is not suppressed within its own definition, in + traditional C. Thus, any macro that is used recursively + inevitably causes an error. + + * The `#' and `##' operators are not available in traditional C. + + * In traditional C, the text at the end of a macro expansion can run + together with the text after the macro call, to produce a single + token. This is impossible in ISO C. + + * None of the GNU extensions to the preprocessor are available in + traditional mode, with the exception of a partial implementation of + assertions, and those may be removed in the future. + + * A true traditional C preprocessor does not recognize `#elif', + `#error', or `#pragma'. GCC supports `#elif' and `#error' even in + traditional mode, but not `#pragma'. + + * Traditional mode is text-based, not token-based, and comments are + stripped after macro expansion. Therefore, `/**/' can be used to + paste tokens together provided that there is no whitespace between + it and the tokens to be pasted. + + * Traditional mode preserves the amount and form of whitespace + provided by the user. Hard tabs remain hard tabs. This can be + useful, e.g. if you are preprocessing a Makefile (which we do not + encourage). + + You can request warnings about features that did not exist, or worked + differently, in traditional C with the `-Wtraditional' option. This + works only if you do _not_ specify `-traditional'. GCC does not warn + about features of ISO C which you must use when you are using a + conforming compiler, such as the `#' and `##' operators. + + Presently `-Wtraditional' warns about: + + * Macro parameters that appear within string literals in the macro + body. In traditional C macro replacement takes place within + string literals, but does not in ISO C. + + * In traditional C, some preprocessor directives did not exist. + Traditional preprocessors would only consider a line to be a + directive if the `#' appeared in column 1 on the line. Therefore + `-Wtraditional' warns about directives that traditional C + understands but would ignore because the `#' does not appear as the + first character on the line. It also suggests you hide directives + like `#pragma' not understood by traditional C by indenting them. + Some traditional implementations would not recognize `#elif', so it + suggests avoiding it altogether. + + * A function-like macro that appears without an argument list. In + traditional C this was an error. In ISO C it merely means that the + macro is not expanded. + + * The unary plus operator. This did not exist in traditional C. + + * The `U' and `LL' integer constant suffixes, which were not + available in traditional C. (Traditional C does support the `L' + suffix for simple long integer constants.) You are not warned + about uses of these suffixes in macros defined in system headers. + For instance, `UINT_MAX' may well be defined as `4294967295U', but + you will not be warned if you use `UINT_MAX'. + + You can usually avoid the warning, and the related warning about + constants which are so large that they are unsigned, by writing the + integer constant in question in hexadecimal, with no U suffix. + Take care, though, because this gives the wrong result in exotic + cases. + +  + File: cpp.info, Node: Implementation Details, Next: Invocation, Prev: Traditional Mode, Up: Top + + Implementation Details + ********************** + + Here we document details of how the preprocessor's implementation + affects its user-visible behavior. You should try to avoid undue + reliance on behavior described here, as it is possible that it will + change subtly in future implementations. + + Also documented here are obsolete features and changes from previous + versions of GNU CPP. + + * Menu: + + * Implementation-defined behavior:: + * Implementation limits:: + * Obsolete Features:: + * Differences from previous versions:: + +  + File: cpp.info, Node: Implementation-defined behavior, Next: Implementation limits, Up: Implementation Details + + Implementation-defined behavior + =============================== + + This is how GNU CPP behaves in all the cases which the C standard + describes as "implementation-defined". This term means that the + implementation is free to do what it likes, but must document its choice + and stick to it. + + * The mapping of physical source file multi-byte characters to the + execution character set. + + Currently, GNU cpp only supports character sets that are strict + supersets of ASCII, and performs no translation of characters. + + * Non-empty sequences of whitespace characters. + + In textual output, each whitespace sequence is collapsed to a + single space. For aesthetic reasons, the first token on each + non-directive line of output is preceded with sufficient spaces + that it appears in the same column as it did in the original + source file. + + * The numeric value of character constants in preprocessor + expressions. + + The preprocessor and compiler interpret character constants in the + same way; escape sequences such as `\a' are given the values they + would have on the target machine. + + Multi-character character constants are interpreted a character at + a time, shifting the previous result left by the number of bits per + character on the host, and adding the new character. For example, + 'ab' on an 8-bit host would be interpreted as 'a' * 256 + 'b'. If + there are more characters in the constant than can fit in the + widest native integer type on the host, usually a `long', the + excess characters are ignored and a diagnostic is given. + + * Source file inclusion. + + For a discussion on how the preprocessor locates header files, + *Note Include Operation::. + + * Interpretation of the filename resulting from a macro-expanded + `#include' directive. + + *Note Computed Includes::. + + * Treatment of a `#pragma' directive that after macro-expansion + results in a standard pragma. + + No macro expansion occurs on any `#pragma' directive line, so the + question does not arise. + + Note that GCC does not yet implement any of the standard pragmas. + + +  + File: cpp.info, Node: Implementation limits, Next: Obsolete Features, Prev: Implementation-defined behavior, Up: Implementation Details + + Implementation limits + ===================== + + GNU CPP has a small number of internal limits. This section lists + the limits which the C standard requires to be no lower than some + minimum, and all the others we are aware of. We intend there to be as + few limits as possible. If you encounter an undocumented or + inconvenient limit, please report that to us as a bug. (See the + section on reporting bugs in the GCC manual.) + + Where we say something is limited "only by available memory", that + means that internal data structures impose no intrinsic limit, and space + is allocated with `malloc' or equivalent. The actual limit will + therefore depend on many things, such as the size of other things + allocated by the compiler at the same time, the amount of memory + consumed by other processes on the same computer, etc. + + * Nesting levels of `#include' files. + + We impose an arbitrary limit of 200 levels, to avoid runaway + recursion. The standard requires at least 15 levels. + + * Nesting levels of conditional inclusion. + + The C standard mandates this be at least 63. GNU CPP is limited + only by available memory. + + * Levels of parenthesised expressions within a full expression. + + The C standard requires this to be at least 63. In preprocessor + conditional expressions, it is limited only by available memory. + + * Significant initial characters in an identifier or macro name. + + The preprocessor treats all characters as significant. The C + standard requires only that the first 63 be significant. + + * Number of macros simultaneously defined in a single translation + unit. + + The standard requires at least 4095 be possible. GNU CPP is + limited only by available memory. + + * Number of parameters in a macro definition and arguments in a + macro call. + + We allow `USHRT_MAX', which is no smaller than 65,535. The minimum + required by the standard is 127. + + * Number of characters on a logical source line. + + The C standard requires a minimum of 4096 be permitted. GNU CPP + places no limits on this, but you may get incorrect column numbers + reported in diagnostics for lines longer than 65,535 characters. + + * Maximum size of a source file. + + The standard does not specify any lower limit on the maximum size + of a source file. GNU cpp maps files into memory, so it is + limited by the available address space. This is generally at + least two gigabytes. Depending on the operating system, the size + of physical memory may or may not be a limitation. + + +  + File: cpp.info, Node: Obsolete Features, Next: Differences from previous versions, Prev: Implementation limits, Up: Implementation Details + + Obsolete Features + ================= + + GNU CPP has a number of features which are present mainly for + compatibility with older programs. We discourage their use in new code. + In some cases, we plan to remove the feature in a future version of GCC. + + * Menu: + + * Assertions:: + * Obsolete once-only headers:: + * Miscellaneous obsolete features:: + +  + File: cpp.info, Node: Assertions, Next: Obsolete once-only headers, Up: Obsolete Features + + Assertions + ---------- + + "Assertions" are a deprecated alternative to macros in writing + conditionals to test what sort of computer or system the compiled + program will run on. Assertions are usually predefined, but you can + define them with preprocessing directives or command-line options. + + Assertions were intended to provide a more systematic way to describe + the compiler's target system. However, in practice they are just as + unpredictable as the system-specific predefined macros. In addition, + they are not part of any standard, and only a few compilers support + them. Therefore, the use of assertions is *less* portable than the use + of system-specific predefined macros. We recommend you do not use them + at all. + + An assertion looks like this: + + #PREDICATE (ANSWER) + + PREDICATE must be a single identifier. ANSWER can be any sequence of + tokens; all characters are significant except for leading and trailing + whitespace, and differences in internal whitespace sequences are + ignored. (This is similar to the rules governing macro redefinition.) + Thus, `(x + y)' is different from `(x+y)' but equivalent to + `( x + y )'. Parentheses do not nest inside an answer. + + To test an assertion, you write it in an `#if'. For example, this + conditional succeeds if either `vax' or `ns16000' has been asserted as + an answer for `machine'. + + #if #machine (vax) || #machine (ns16000) + + You can test whether _any_ answer is asserted for a predicate by + omitting the answer in the conditional: + + #if #machine + + Assertions are made with the `#assert' directive. Its sole argument + is the assertion to make, without the leading `#' that identifies + assertions in conditionals. + + #assert PREDICATE (ANSWER) + + You may make several assertions with the same predicate and different + answers. Subsequent assertions do not override previous ones for the + same predicate. All the answers for any given predicate are + simultaneously true. + + Assertions can be cancelled with the `#unassert' directive. It has + the same syntax as `#assert'. In that form it cancels only the answer + which was specified on the `#unassert' line; other answers for that + predicate remain true. You can cancel an entire predicate by leaving + out the answer: + + #unassert PREDICATE + + In either form, if no such assertion has been made, `#unassert' has no + effect. + + You can also make or cancel assertions using command line options. + *Note Invocation::. + +  + File: cpp.info, Node: Obsolete once-only headers, Next: Miscellaneous obsolete features, Prev: Assertions, Up: Obsolete Features + + Obsolete once-only headers + -------------------------- + + GNU CPP supports two more ways of indicating that a header file + should be read only once. Neither one is as portable as a wrapper + `#ifndef', and we recommend you do not use them in new programs. + + In the Objective-C language, there is a variant of `#include' called + `#import' which includes a file, but does so at most once. If you use + `#import' instead of `#include', then you don't need the conditionals + inside the header file to prevent multiple inclusion of the contents. + GCC permits the use of `#import' in C and C++ as well as Objective-C. + However, it is not in standard C or C++ and should therefore not be + used by portable programs. + + `#import' is not a well designed feature. It requires the users of + a header file to know that it should only be included once. It is much + better for the header file's implementor to write the file so that users + don't need to know this. Using a wrapper `#ifndef' accomplishes this + goal. + + In the present implementation, a single use of `#import' will + prevent the file from ever being read again, by either `#import' or + `#include'. You should not rely on this; do not use both `#import' and + `#include' to refer to the same header file. + + Another way to prevent a header file from being included more than + once is with the `#pragma once' directive. If `#pragma once' is seen + when scanning a header file, that file will never be read again, no + matter what. + + `#pragma once' does not have the problems that `#import' does, but + it is not recognized by all preprocessors, so you cannot rely on it in + a portable program. + +  + File: cpp.info, Node: Miscellaneous obsolete features, Prev: Obsolete once-only headers, Up: Obsolete Features + + Miscellaneous obsolete features + ------------------------------- + + Here are a few more obsolete features. + + * Attempting to paste two tokens which together do not form a valid + preprocessing token. + + The preprocessor currently warns about this, and the resulting + preprocessed output is undefined. The tokens remain distinct if + the preprocessor is being used directly by the compiler front end. + + Most of the time, when you get this warning, you will find that + `##' is being used superstitiously, to guard against whitespace + appearing between two tokens. It is almost always safe to delete + the `##'. + + * `#pragma poison' + + This is the same as `#pragma GCC poison'. The version without the + `GCC' prefix is deprecated. *Note Pragmas::. + + * Multi-line string constants + + GCC currently allows a string constant to extend across multiple + logical lines of the source file. This extension is deprecated + and will be removed in a future version of GCC. Such string + constants are already rejected in all directives apart from + `#define'. + + Instead, make use of ISO C concatenation of adjacent string + literals, or use `\n' followed by a backslash-newline. + + +  + File: cpp.info, Node: Differences from previous versions, Prev: Obsolete Features, Up: Implementation Details + + Differences from previous versions + ================================== + + This section details behavior which has changed from previous + versions of GNU CPP. We do not plan to change it again in the near + future, but we do not promise not to, either. + + The "previous versions" discussed here are 2.95 and before. The + behavior of GCC 3.0 is mostly the same as the behavior of the widely + used 2.96 and 2.97 development snapshots. Where there are differences, + they generally represent bugs in the snapshots. + + * Order of evaluation of `#' and `##' operators + + The standard does not specify the order of evaluation of a chain of + `##' operators, nor whether `#' is evaluated before, after, or at + the same time as `##'. You should therefore not write any code + which depends on any specific ordering. It is possible to + guarantee an ordering, if you need one, by suitable use of nested + macros. + + An example of where this might matter is pasting the arguments `1', + `e' and `-2'. This would be fine for left-to-right pasting, but + right-to-left pasting would produce an invalid token `e-2'. + + GCC 3.0 evaluates `#' and `##' at the same time and strictly left + to right. Older versions evaluated all `#' operators first, then + all `##' operators, in an unreliable order. + + * The form of whitespace betwen tokens in preprocessor output + + *Note Preprocessor Output::, for the current textual format. This + is also the format used by stringification. Normally, the + preprocessor communicates tokens directly to the compiler's + parser, and whitespace does not come up at all. + + Older versions of GCC preserved all whitespace provided by the + user and inserted lots more whitespace of their own, because they + could not accurately predict when extra spaces were needed to + prevent accidental token pasting. + + * Optional argument when invoking rest argument macros + + As an extension, GCC permits you to omit the variable arguments + entirely when you use a variable argument macro. This is + forbidden by the 1999 C standard, and will provoke a pedantic + warning with GCC 3.0. Previous versions accepted it silently. + + * `##' swallowing preceding text in rest argument macros + + Formerly, in a macro expansion, if `##' appeared before a variable + arguments parameter, and the set of tokens specified for that + argument in the macro invocation was empty, previous versions of + GNU CPP would back up and remove the preceding sequence of + non-whitespace characters (*not* the preceding token). This + extension is in direct conflict with the 1999 C standard and has + been drastically pared back. + + In the current version of the preprocessor, if `##' appears between + a comma and a variable arguments parameter, and the variable + argument is omitted entirely, the comma will be removed from the + expansion. If the variable argument is empty, or the token before + `##' is not a comma, then `##' behaves as a normal token paste. + + * Traditional mode and GNU extensions + + Traditional mode used to be implemented in the same program as + normal preprocessing. Therefore, all the GNU extensions to the + preprocessor were still available in traditional mode. It is now + a separate program and does not implement any of the GNU + extensions, except for a partial implementation of assertions. + Even those may be removed in a future release. + + * `#line' and `#include' + + The `#line' directive used to change GCC's notion of the + "directory containing the current file," used by `#include' with a + double-quoted header file name. In 3.0 and later, it does not. + *Note Line Control::, for further explanation. + + * Syntax of `#line' + + In GCC 2.95 and previous, the string constant argument to `#line' + was treated the same way as the argument to `#include': backslash + escapes were not honored, and the string ended at the second `"'. + This is not compliant with the C standard. In GCC 3.0, an attempt + was made to correct the behavior, so that the string was treated + as a real string constant, but it turned out to be buggy. In 3.1, + the bugs have been fixed. (We are not fixing the bugs in 3.0 + because they affect relatively few people and the fix is quite + invasive.) + + diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info-4 gcc-3.2.3/gcc/doc/cpp.info-4 *** gcc-3.2.2/gcc/doc/cpp.info-4 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info-4 Tue Apr 22 07:07:10 2003 *************** *** 0 **** --- 1,1054 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + File: cpp.info, Node: Invocation, Next: Environment Variables, Prev: Implementation Details, Up: Top + + Invocation + ********** + + Most often when you use the C preprocessor you will not have to + invoke it explicitly: the C compiler will do so automatically. + However, the preprocessor is sometimes useful on its own. All the + options listed here are also acceptable to the C compiler and have the + same meaning, except that the C compiler has different rules for + specifying the output file. + + *Note:* Whether you use the preprocessor by way of `gcc' or `cpp', + the "compiler driver" is run first. This program's purpose is to + translate your command into invocations of the programs that do the + actual work. Their command line interfaces are similar but not + identical to the documented interface, and may change without notice. + + The C preprocessor expects two file names as arguments, INFILE and + OUTFILE. The preprocessor reads INFILE together with any other files + it specifies with `#include'. All the output generated by the combined + input files is written in OUTFILE. + + Either INFILE or OUTFILE may be `-', which as INFILE means to read + from standard input and as OUTFILE means to write to standard output. + Also, if either file is omitted, it means the same as if `-' had been + specified for that file. + + Unless otherwise noted, or the option ends in `=', all options which + take an argument may have that argument appear either immediately after + the option, or with a space between option and argument: `-Ifoo' and + `-I foo' have the same effect. + + Many options have multi-letter names; therefore multiple + single-letter options may _not_ be grouped: `-dM' is very different from + `-d -M'. + + `-D NAME' + Predefine NAME as a macro, with definition `1'. + + `-D NAME=DEFINITION' + Predefine NAME as a macro, with definition DEFINITION. There are + no restrictions on the contents of DEFINITION, but if you are + invoking the preprocessor from a shell or shell-like program you + may need to use the shell's quoting syntax to protect characters + such as spaces that have a meaning in the shell syntax. + + If you wish to define a function-like macro on the command line, + write its argument list with surrounding parentheses before the + equals sign (if any). Parentheses are meaningful to most shells, + so you will need to quote the option. With `sh' and `csh', + `-D'NAME(ARGS...)=DEFINITION'' works. + + `-D' and `-U' options are processed in the order they are given on + the command line. All `-imacros FILE' and `-include FILE' options + are processed after all `-D' and `-U' options. + + `-U NAME' + Cancel any previous definition of NAME, either built in or + provided with a `-D' option. + + `-undef' + Do not predefine any system-specific macros. The common predefined + macros remain defined. + + `-I DIR' + Add the directory DIR to the list of directories to be searched + for header files. *Note Search Path::. Directories named by `-I' + are searched before the standard system include directories. + + It is dangerous to specify a standard system include directory in + an `-I' option. This defeats the special treatment of system + headers (*note System Headers::) . It can also defeat the repairs + to buggy system headers which GCC makes when it is installed. + + `-o FILE' + Write output to FILE. This is the same as specifying FILE as the + second non-option argument to `cpp'. `gcc' has a different + interpretation of a second non-option argument, so you must use + `-o' to specify the output file. + + `-Wall' + Turns on all optional warnings which are desirable for normal + code. At present this is `-Wcomment' and `-Wtrigraphs'. Note that + many of the preprocessor's warnings are on by default and have no + options to control them. + + `-Wcomment' + `-Wcomments' + Warn whenever a comment-start sequence `/*' appears in a `/*' + comment, or whenever a backslash-newline appears in a `//' comment. + (Both forms have the same effect.) + + `-Wtrigraphs' + Warn if any trigraphs are encountered. This option used to take + effect only if `-trigraphs' was also specified, but now works + independently. Warnings are not given for trigraphs within + comments, as they do not affect the meaning of the program. + + `-Wtraditional' + Warn about certain constructs that behave differently in + traditional and ISO C. Also warn about ISO C constructs that have + no traditional C equivalent, and problematic constructs which + should be avoided. *Note Traditional Mode::. + + `-Wimport' + Warn the first time `#import' is used. + + `-Wundef' + Warn whenever an identifier which is not a macro is encountered in + an `#if' directive, outside of `defined'. Such identifiers are + replaced with zero. + + `-Werror' + Make all warnings into hard errors. Source code which triggers + warnings will be rejected. + + `-Wsystem-headers' + Issue warnings for code in system headers. These are normally + unhelpful in finding bugs in your own code, therefore suppressed. + If you are responsible for the system library, you may want to see + them. + + `-w' + Suppress all warnings, including those which GNU CPP issues by + default. + + `-pedantic' + Issue all the mandatory diagnostics listed in the C standard. + Some of them are left out by default, since they trigger + frequently on harmless code. + + `-pedantic-errors' + Issue all the mandatory diagnostics, and make all mandatory + diagnostics into errors. This includes mandatory diagnostics that + GCC issues without `-pedantic' but treats as warnings. + + `-M' + Instead of outputting the result of preprocessing, output a rule + suitable for `make' describing the dependencies of the main source + file. The preprocessor outputs one `make' rule containing the + object file name for that source file, a colon, and the names of + all the included files, including those coming from `-include' or + `-imacros' command line options. + + Unless specified explicitly (with `-MT' or `-MQ'), the object file + name consists of the basename of the source file with any suffix + replaced with object file suffix. If there are many included + files then the rule is split into several lines using `\'-newline. + The rule has no commands. + + This option does not suppress the preprocessor's debug output, + such as `-dM'. To avoid mixing such debug output with the + dependency rules you should explicitly specify the dependency + output file with `-MF', or use an environment variable like + `DEPENDENCIES_OUTPUT' (*note DEPENDENCIES_OUTPUT::). Debug output + will still be sent to the regular output stream as normal. + + Passing `-M' to the driver implies `-E'. + + `-MM' + Like `-M' but do not mention header files that are found in system + header directories, nor header files that are included, directly + or indirectly, from such a header. + + This implies that the choice of angle brackets or double quotes in + an `#include' directive does not in itself determine whether that + header will appear in `-MM' dependency output. This is a slight + change in semantics from GCC versions 3.0 and earlier. + + `-MF FILE' + When used with `-M' or `-MM', specifies a file to write the + dependencies to. If no `-MF' switch is given the preprocessor + sends the rules to the same place it would have sent preprocessed + output. + + When used with the driver options `-MD' or `-MMD', `-MF' overrides + the default dependency output file. + + `-MG' + When used with `-M' or `-MM', `-MG' says to treat missing header + files as generated files and assume they live in the same + directory as the source file. It suppresses preprocessed output, + as a missing header file is ordinarily an error. + + This feature is used in automatic updating of makefiles. + + `-MP' + This option instructs CPP to add a phony target for each dependency + other than the main file, causing each to depend on nothing. These + dummy rules work around errors `make' gives if you remove header + files without updating the `Makefile' to match. + + This is typical output: + + test.o: test.c test.h + + test.h: + + `-MT TARGET' + Change the target of the rule emitted by dependency generation. By + default CPP takes the name of the main input file, including any + path, deletes any file suffix such as `.c', and appends the + platform's usual object suffix. The result is the target. + + An `-MT' option will set the target to be exactly the string you + specify. If you want multiple targets, you can specify them as a + single argument to `-MT', or use multiple `-MT' options. + + For example, `-MT '$(objpfx)foo.o'' might give + + $(objpfx)foo.o: foo.c + + `-MQ TARGET' + Same as `-MT', but it quotes any characters which are special to + Make. `-MQ '$(objpfx)foo.o'' gives + + $$(objpfx)foo.o: foo.c + + The default target is automatically quoted, as if it were given + with `-MQ'. + + `-MD' + `-MD' is equivalent to `-M -MF FILE', except that `-E' is not + implied. The driver determines FILE based on whether an `-o' + option is given. If it is, the driver uses its argument but with + a suffix of `.d', otherwise it take the basename of the input file + and applies a `.d' suffix. + + If `-MD' is used in conjunction with `-E', any `-o' switch is + understood to specify the dependency output file (but *note + -MF::), but if used without `-E', each `-o' is understood to + specify a target object file. + + Since `-E' is not implied, `-MD' can be used to generate a + dependency output file as a side-effect of the compilation process. + + `-MMD' + Like `-MD' except mention only user header files, not system + -header files. + + `-x c' + `-x c++' + `-x objective-c' + `-x assembler-with-cpp' + Specify the source language: C, C++, Objective-C, or assembly. + This has nothing to do with standards conformance or extensions; + it merely selects which base syntax to expect. If you give none + of these options, cpp will deduce the language from the extension + of the source file: `.c', `.cc', `.m', or `.S'. Some other common + extensions for C++ and assembly are also recognized. If cpp does + not recognize the extension, it will treat the file as C; this is + the most generic mode. + + *Note:* Previous versions of cpp accepted a `-lang' option which + selected both the language and the standards conformance level. + This option has been removed, because it conflicts with the `-l' + option. + + `-std=STANDARD' + `-ansi' + Specify the standard to which the code should conform. Currently + cpp only knows about the standards for C; other language standards + will be added in the future. + + STANDARD may be one of: + `iso9899:1990' + `c89' + The ISO C standard from 1990. `c89' is the customary + shorthand for this version of the standard. + + The `-ansi' option is equivalent to `-std=c89'. + + `iso9899:199409' + The 1990 C standard, as amended in 1994. + + `iso9899:1999' + `c99' + `iso9899:199x' + `c9x' + The revised ISO C standard, published in December 1999. + Before publication, this was known as C9X. + + `gnu89' + The 1990 C standard plus GNU extensions. This is the default. + + `gnu99' + `gnu9x' + The 1999 C standard plus GNU extensions. + + `-I-' + Split the include path. Any directories specified with `-I' + options before `-I-' are searched only for headers requested with + `#include "FILE"'; they are not searched for `#include '. + If additional directories are specified with `-I' options after + the `-I-', those directories are searched for all `#include' + directives. + + In addition, `-I-' inhibits the use of the directory of the current + file directory as the first search directory for `#include "FILE"'. + *Note Search Path::. + + `-nostdinc' + Do not search the standard system directories for header files. + Only the directories you have specified with `-I' options (and the + directory of the current file, if appropriate) are searched. + + `-nostdinc++' + Do not search for header files in the C++-specific standard + directories, but do still search the other standard directories. + (This option is used when building the C++ library.) + + `-include FILE' + Process FILE as if `#include "file"' appeared as the first line of + the primary source file. However, the first directory searched + for FILE is the preprocessor's working directory _instead of_ the + directory containing the main source file. If not found there, it + is searched for in the remainder of the `#include "..."' search + chain as normal. + + If multiple `-include' options are given, the files are included + in the order they appear on the command line. + + `-imacros FILE' + Exactly like `-include', except that any output produced by + scanning FILE is thrown away. Macros it defines remain defined. + This allows you to acquire all the macros from a header without + also processing its declarations. + + All files specified by `-imacros' are processed before all files + specified by `-include'. + + `-idirafter DIR' + Search DIR for header files, but do it _after_ all directories + specified with `-I' and the standard system directories have been + exhausted. DIR is treated as a system include directory. + + `-iprefix PREFIX' + Specify PREFIX as the prefix for subsequent `-iwithprefix' + options. If the prefix represents a directory, you should include + the final `/'. + + `-iwithprefix DIR' + `-iwithprefixbefore DIR' + Append DIR to the prefix specified previously with `-iprefix', and + add the resulting directory to the include search path. + `-iwithprefixbefore' puts it in the same place `-I' would; + `-iwithprefix' puts it where `-idirafter' would. + + Use of these options is discouraged. + + `-isystem DIR' + Search DIR for header files, after all directories specified by + `-I' but before the standard system directories. Mark it as a + system directory, so that it gets the same special treatment as is + applied to the standard system directories. *Note System + Headers::. + + `-fpreprocessed' + Indicate to the preprocessor that the input file has already been + preprocessed. This suppresses things like macro expansion, + trigraph conversion, escaped newline splicing, and processing of + most directives. The preprocessor still recognizes and removes + comments, so that you can pass a file preprocessed with `-C' to + the compiler without problems. In this mode the integrated + preprocessor is little more than a tokenizer for the front ends. + + `-fpreprocessed' is implicit if the input file has one of the + extensions `.i', `.ii' or `.mi'. These are the extensions that + GCC uses for preprocessed files created by `-save-temps'. + + `-ftabstop=WIDTH' + Set the distance between tab stops. This helps the preprocessor + report correct column numbers in warnings or errors, even if tabs + appear on the line. If the value is less than 1 or greater than + 100, the option is ignored. The default is 8. + + `-fno-show-column' + Do not print column numbers in diagnostics. This may be necessary + if diagnostics are being scanned by a program that does not + understand the column numbers, such as `dejagnu'. + + `-A PREDICATE=ANSWER' + Make an assertion with the predicate PREDICATE and answer ANSWER. + This form is preferred to the older form `-A PREDICATE(ANSWER)', + which is still supported, because it does not use shell special + characters. *Note Assertions::. + + `-A -PREDICATE=ANSWER' + Cancel an assertion with the predicate PREDICATE and answer ANSWER. + + `-A-' + Cancel all predefined assertions and all assertions preceding it on + the command line. Also, undefine all predefined macros and all + macros preceding it on the command line. (This is a historical + wart and may change in the future.) + + `-dCHARS' + CHARS is a sequence of one or more of the following characters, + and must not be preceded by a space. Other characters are + interpreted by the compiler proper, or reserved for future + versions of GCC, and so are silently ignored. If you specify + characters whose behavior conflicts, the result is undefined. + + `M' + Instead of the normal output, generate a list of `#define' + directives for all the macros defined during the execution of + the preprocessor, including predefined macros. This gives + you a way of finding out what is predefined in your version + of the preprocessor. Assuming you have no file `foo.h', the + command + + touch foo.h; cpp -dM foo.h + + will show all the predefined macros. + + `D' + Like `M' except in two respects: it does _not_ include the + predefined macros, and it outputs _both_ the `#define' + directives and the result of preprocessing. Both kinds of + output go to the standard output file. + + `N' + Like `D', but emit only the macro names, not their expansions. + + `I' + Output `#include' directives in addition to the result of + preprocessing. + + `-P' + Inhibit generation of linemarkers in the output from the + preprocessor. This might be useful when running the preprocessor + on something that is not C code, and will be sent to a program + which might be confused by the linemarkers. *Note Preprocessor + Output::. + + `-C' + Do not discard comments. All comments are passed through to the + output file, except for comments in processed directives, which + are deleted along with the directive. + + You should be prepared for side effects when using `-C'; it causes + the preprocessor to treat comments as tokens in their own right. + For example, comments appearing at the start of what would be a + directive line have the effect of turning that line into an + ordinary source line, since the first token on the line is no + longer a `#'. + + `-gcc' + Define the macros __GNUC__, __GNUC_MINOR__ and + __GNUC_PATCHLEVEL__. These are defined automatically when you use + `gcc -E'; you can turn them off in that case with `-no-gcc'. + + `-traditional' + Try to imitate the behavior of old-fashioned C, as opposed to ISO + C. *Note Traditional Mode::. + + `-trigraphs' + Process trigraph sequences. *Note Initial processing::. + + `-remap' + Enable special code to work around file systems which only permit + very short file names, such as MS-DOS. + + `-$' + Forbid the use of `$' in identifiers. The C standard allows + implementations to define extra characters that can appear in + identifiers. By default GNU CPP permits `$', a common extension. + + `-h' + `--help' + `--target-help' + Print text describing all the command line options instead of + preprocessing anything. + + `-v' + Verbose mode. Print out GNU CPP's version number at the beginning + of execution, and report the final form of the include path. + + `-H' + Print the name of each header file used, in addition to other + normal activities. Each name is indented to show how deep in the + `#include' stack it is. + + `-version' + `--version' + Print out GNU CPP's version number. With one dash, proceed to + preprocess as normal. With two dashes, exit immediately. + +  + File: cpp.info, Node: Environment Variables, Next: GNU Free Documentation License, Prev: Invocation, Up: Top + + Environment Variables + ********************* + + This section describes the environment variables that affect how CPP + operates. You can use them to specify directories or prefixes to use + when searching for include files, or to control dependency output. + + Note that you can also specify places to search using options such as + `-I', and control dependency output with options like `-M' (*note + Invocation::). These take precedence over environment variables, which + in turn take precedence over the configuration of GCC. + + `CPATH' + `C_INCLUDE_PATH' + `CPLUS_INCLUDE_PATH' + `OBJC_INCLUDE_PATH' + Each variable's value is a list of directories separated by a + special character, much like `PATH', in which to look for header + files. The special character, `PATH_SEPARATOR', is + target-dependent and determined at GCC build time. For + Windows-based targets it is a semicolon, and for almost all other + targets it is a colon. + + `CPATH' specifies a list of directories to be searched as if + specified with `-I', but after any paths given with `-I' options + on the command line. The environment variable is used regardless + of which language is being preprocessed. + + The remaining environment variables apply only when preprocessing + the particular language indicated. Each specifies a list of + directories to be searched as if specified with `-isystem', but + after any paths given with `-isystem' options on the command line. + + See also *Note Search Path::. + + `DEPENDENCIES_OUTPUT' + If this variable is set, its value specifies how to output + dependencies for Make based on the non-system header files + processed by the compiler. System header files are ignored in the + dependency output. + + The value of `DEPENDENCIES_OUTPUT' can be just a file name, in + which case the Make rules are written to that file, guessing the + target name from the source file name. Or the value can have the + form `FILE TARGET', in which case the rules are written to file + FILE using TARGET as the target name. + + In other words, this environment variable is equivalent to + combining the options `-MM' and `-MF' (*note Invocation::), with + an optional `-MT' switch too. + + `SUNPRO_DEPENDENCIES' + This variable is the same as the environment variable + `DEPENDENCIES_OUTPUT' (*note DEPENDENCIES_OUTPUT::), except that + system header files are not ignored, so it implies `-M' rather + than `-MM'. However, the dependence on the main input file is + omitted. *Note Invocation::. + +  + File: cpp.info, Node: GNU Free Documentation License, Next: Option Index, Prev: Environment Variables, Up: Top + + GNU Free Documentation License + ****************************** + + Version 1.1, March 2000 + Copyright (C) 2000 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + 0. PREAMBLE + + The purpose of this License is to make a manual, textbook, or other + written document "free" in the sense of freedom: to assure everyone + the effective freedom to copy and redistribute it, with or without + modifying it, either commercially or noncommercially. Secondarily, + this License preserves for the author and publisher a way to get + credit for their work, while not being considered responsible for + modifications made by others. + + This License is a kind of "copyleft", which means that derivative + works of the document must themselves be free in the same sense. + It complements the GNU General Public License, which is a copyleft + license designed for free software. + + We have designed this License in order to use it for manuals for + free software, because free software needs free documentation: a + free program should come with manuals providing the same freedoms + that the software does. But this License is not limited to + software manuals; it can be used for any textual work, regardless + of subject matter or whether it is published as a printed book. + We recommend this License principally for works whose purpose is + instruction or reference. + + 1. APPLICABILITY AND DEFINITIONS + + This License applies to any manual or other work that contains a + notice placed by the copyright holder saying it can be distributed + under the terms of this License. The "Document", below, refers to + any such manual or work. Any member of the public is a licensee, + and is addressed as "you". + + A "Modified Version" of the Document means any work containing the + Document or a portion of it, either copied verbatim, or with + modifications and/or translated into another language. + + A "Secondary Section" is a named appendix or a front-matter + section of the Document that deals exclusively with the + relationship of the publishers or authors of the Document to the + Document's overall subject (or to related matters) and contains + nothing that could fall directly within that overall subject. + (For example, if the Document is in part a textbook of + mathematics, a Secondary Section may not explain any mathematics.) + The relationship could be a matter of historical connection with + the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + The "Invariant Sections" are certain Secondary Sections whose + titles are designated, as being those of Invariant Sections, in + the notice that says that the Document is released under this + License. + + The "Cover Texts" are certain short passages of text that are + listed, as Front-Cover Texts or Back-Cover Texts, in the notice + that says that the Document is released under this License. + + A "Transparent" copy of the Document means a machine-readable copy, + represented in a format whose specification is available to the + general public, whose contents can be viewed and edited directly + and straightforwardly with generic text editors or (for images + composed of pixels) generic paint programs or (for drawings) some + widely available drawing editor, and that is suitable for input to + text formatters or for automatic translation to a variety of + formats suitable for input to text formatters. A copy made in an + otherwise Transparent file format whose markup has been designed + to thwart or discourage subsequent modification by readers is not + Transparent. A copy that is not "Transparent" is called "Opaque". + + Examples of suitable formats for Transparent copies include plain + ASCII without markup, Texinfo input format, LaTeX input format, + SGML or XML using a publicly available DTD, and + standard-conforming simple HTML designed for human modification. + Opaque formats include PostScript, PDF, proprietary formats that + can be read and edited only by proprietary word processors, SGML + or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML produced by some word + processors for output purposes only. + + The "Title Page" means, for a printed book, the title page itself, + plus such following pages as are needed to hold, legibly, the + material this License requires to appear in the title page. For + works in formats which do not have any title page as such, "Title + Page" means the text near the most prominent appearance of the + work's title, preceding the beginning of the body of the text. + + 2. VERBATIM COPYING + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the + copyright notices, and the license notice saying this License + applies to the Document are reproduced in all copies, and that you + add no other conditions whatsoever to those of this License. You + may not use technical measures to obstruct or control the reading + or further copying of the copies you make or distribute. However, + you may accept compensation in exchange for copies. If you + distribute a large enough number of copies you must also follow + the conditions in section 3. + + You may also lend copies, under the same conditions stated above, + and you may publicly display copies. + + 3. COPYING IN QUANTITY + + If you publish printed copies of the Document numbering more than + 100, and the Document's license notice requires Cover Texts, you + must enclose the copies in covers that carry, clearly and legibly, + all these Cover Texts: Front-Cover Texts on the front cover, and + Back-Cover Texts on the back cover. Both covers must also clearly + and legibly identify you as the publisher of these copies. The + front cover must present the full title with all words of the + title equally prominent and visible. You may add other material + on the covers in addition. Copying with changes limited to the + covers, as long as they preserve the title of the Document and + satisfy these conditions, can be treated as verbatim copying in + other respects. + + If the required texts for either cover are too voluminous to fit + legibly, you should put the first ones listed (as many as fit + reasonably) on the actual cover, and continue the rest onto + adjacent pages. + + If you publish or distribute Opaque copies of the Document + numbering more than 100, you must either include a + machine-readable Transparent copy along with each Opaque copy, or + state in or with each Opaque copy a publicly-accessible + computer-network location containing a complete Transparent copy + of the Document, free of added material, which the general + network-using public has access to download anonymously at no + charge using public-standard network protocols. If you use the + latter option, you must take reasonably prudent steps, when you + begin distribution of Opaque copies in quantity, to ensure that + this Transparent copy will remain thus accessible at the stated + location until at least one year after the last time you + distribute an Opaque copy (directly or through your agents or + retailers) of that edition to the public. + + It is requested, but not required, that you contact the authors of + the Document well before redistributing any large number of + copies, to give them a chance to provide you with an updated + version of the Document. + + 4. MODIFICATIONS + + You may copy and distribute a Modified Version of the Document + under the conditions of sections 2 and 3 above, provided that you + release the Modified Version under precisely this License, with + the Modified Version filling the role of the Document, thus + licensing distribution and modification of the Modified Version to + whoever possesses a copy of it. In addition, you must do these + things in the Modified Version: + + A. Use in the Title Page (and on the covers, if any) a title + distinct from that of the Document, and from those of + previous versions (which should, if there were any, be listed + in the History section of the Document). You may use the + same title as a previous version if the original publisher of + that version gives permission. + + B. List on the Title Page, as authors, one or more persons or + entities responsible for authorship of the modifications in + the Modified Version, together with at least five of the + principal authors of the Document (all of its principal + authors, if it has less than five). + + C. State on the Title page the name of the publisher of the + Modified Version, as the publisher. + + D. Preserve all the copyright notices of the Document. + + E. Add an appropriate copyright notice for your modifications + adjacent to the other copyright notices. + + F. Include, immediately after the copyright notices, a license + notice giving the public permission to use the Modified + Version under the terms of this License, in the form shown in + the Addendum below. + + G. Preserve in that license notice the full lists of Invariant + Sections and required Cover Texts given in the Document's + license notice. + + H. Include an unaltered copy of this License. + + I. Preserve the section entitled "History", and its title, and + add to it an item stating at least the title, year, new + authors, and publisher of the Modified Version as given on + the Title Page. If there is no section entitled "History" in + the Document, create one stating the title, year, authors, + and publisher of the Document as given on its Title Page, + then add an item describing the Modified Version as stated in + the previous sentence. + + J. Preserve the network location, if any, given in the Document + for public access to a Transparent copy of the Document, and + likewise the network locations given in the Document for + previous versions it was based on. These may be placed in + the "History" section. You may omit a network location for a + work that was published at least four years before the + Document itself, or if the original publisher of the version + it refers to gives permission. + + K. In any section entitled "Acknowledgments" or "Dedications", + preserve the section's title, and preserve in the section all + the substance and tone of each of the contributor + acknowledgments and/or dedications given therein. + + L. Preserve all the Invariant Sections of the Document, + unaltered in their text and in their titles. Section numbers + or the equivalent are not considered part of the section + titles. + + M. Delete any section entitled "Endorsements". Such a section + may not be included in the Modified Version. + + N. Do not retitle any existing section as "Endorsements" or to + conflict in title with any Invariant Section. + + If the Modified Version includes new front-matter sections or + appendices that qualify as Secondary Sections and contain no + material copied from the Document, you may at your option + designate some or all of these sections as invariant. To do this, + add their titles to the list of Invariant Sections in the Modified + Version's license notice. These titles must be distinct from any + other section titles. + + You may add a section entitled "Endorsements", provided it contains + nothing but endorsements of your Modified Version by various + parties--for example, statements of peer review or that the text + has been approved by an organization as the authoritative + definition of a standard. + + You may add a passage of up to five words as a Front-Cover Text, + and a passage of up to 25 words as a Back-Cover Text, to the end + of the list of Cover Texts in the Modified Version. Only one + passage of Front-Cover Text and one of Back-Cover Text may be + added by (or through arrangements made by) any one entity. If the + Document already includes a cover text for the same cover, + previously added by you or by arrangement made by the same entity + you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous + publisher that added the old one. + + The author(s) and publisher(s) of the Document do not by this + License give permission to use their names for publicity for or to + assert or imply endorsement of any Modified Version. + + 5. COMBINING DOCUMENTS + + You may combine the Document with other documents released under + this License, under the terms defined in section 4 above for + modified versions, provided that you include in the combination + all of the Invariant Sections of all of the original documents, + unmodified, and list them all as Invariant Sections of your + combined work in its license notice. + + The combined work need only contain one copy of this License, and + multiple identical Invariant Sections may be replaced with a single + copy. If there are multiple Invariant Sections with the same name + but different contents, make the title of each such section unique + by adding at the end of it, in parentheses, the name of the + original author or publisher of that section if known, or else a + unique number. Make the same adjustment to the section titles in + the list of Invariant Sections in the license notice of the + combined work. + + In the combination, you must combine any sections entitled + "History" in the various original documents, forming one section + entitled "History"; likewise combine any sections entitled + "Acknowledgments", and any sections entitled "Dedications". You + must delete all sections entitled "Endorsements." + + 6. COLLECTIONS OF DOCUMENTS + + You may make a collection consisting of the Document and other + documents released under this License, and replace the individual + copies of this License in the various documents with a single copy + that is included in the collection, provided that you follow the + rules of this License for verbatim copying of each of the + documents in all other respects. + + You may extract a single document from such a collection, and + distribute it individually under this License, provided you insert + a copy of this License into the extracted document, and follow + this License in all other respects regarding verbatim copying of + that document. + + 7. AGGREGATION WITH INDEPENDENT WORKS + + A compilation of the Document or its derivatives with other + separate and independent documents or works, in or on a volume of + a storage or distribution medium, does not as a whole count as a + Modified Version of the Document, provided no compilation + copyright is claimed for the compilation. Such a compilation is + called an "aggregate", and this License does not apply to the + other self-contained works thus compiled with the Document, on + account of their being thus compiled, if they are not themselves + derivative works of the Document. + + If the Cover Text requirement of section 3 is applicable to these + copies of the Document, then if the Document is less than one + quarter of the entire aggregate, the Document's Cover Texts may be + placed on covers that surround only the Document within the + aggregate. Otherwise they must appear on covers around the whole + aggregate. + + 8. TRANSLATION + + Translation is considered a kind of modification, so you may + distribute translations of the Document under the terms of section + 4. Replacing Invariant Sections with translations requires special + permission from their copyright holders, but you may include + translations of some or all Invariant Sections in addition to the + original versions of these Invariant Sections. You may include a + translation of this License provided that you also include the + original English version of this License. In case of a + disagreement between the translation and the original English + version of this License, the original English version will prevail. + + 9. TERMINATION + + You may not copy, modify, sublicense, or distribute the Document + except as expressly provided for under this License. Any other + attempt to copy, modify, sublicense or distribute the Document is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 10. FUTURE REVISIONS OF THIS LICENSE + + The Free Software Foundation may publish new, revised versions of + the GNU Free Documentation License from time to time. Such new + versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. See + `http://www.gnu.org/copyleft/'. + + Each version of the License is given a distinguishing version + number. If the Document specifies that a particular numbered + version of this License "or any later version" applies to it, you + have the option of following the terms and conditions either of + that specified version or of any later version that has been + published (not as a draft) by the Free Software Foundation. If + the Document does not specify a version number of this License, + you may choose any version ever published (not as a draft) by the + Free Software Foundation. + + ADDENDUM: How to use this License for your documents + ==================================================== + + To use this License in a document you have written, include a copy of + the License in the document and put the following copyright and license + notices just after the title page: + + Copyright (C) YEAR YOUR NAME. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 + or any later version published by the Free Software Foundation; + with the Invariant Sections being LIST THEIR TITLES, with the + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. + A copy of the license is included in the section entitled ``GNU + Free Documentation License''. + + If you have no Invariant Sections, write "with no Invariant Sections" + instead of saying which ones are invariant. If you have no Front-Cover + Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being + LIST"; likewise for Back-Cover Texts. + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of + free software license, such as the GNU General Public License, to + permit their use in free software. + +  + File: cpp.info, Node: Option Index, Next: Index of Directives, Prev: GNU Free Documentation License, Up: Top + + Option Index + ************ + + CPP's command line options are indexed here without any initial `-' + or `--'. + + * Menu: + + * $: Invocation. + * A: Invocation. + * A-: Invocation. + * ansi: Invocation. + * C: Invocation. + * D: Invocation. + * dD: Invocation. + * dI: Invocation. + * dM: Invocation. + * dN: Invocation. + * fno-show-column: Invocation. + * fpreprocessed: Invocation. + * ftabstop: Invocation. + * gcc: Invocation. + * H: Invocation. + * h: Invocation. + * help: Invocation. + * I: Invocation. + * I-: Invocation. + * idirafter: Invocation. + * imacros: Invocation. + * include: Invocation. + * iprefix: Invocation. + * isystem: Invocation. + * iwithprefix: Invocation. + * iwithprefixbefore: Invocation. + * M: Invocation. + * MD: Invocation. + * MF: Invocation. + * MG: Invocation. + * MM: Invocation. + * MMD: Invocation. + * MP: Invocation. + * MQ: Invocation. + * MT: Invocation. + * nostdinc: Invocation. + * nostdinc++: Invocation. + * o: Invocation. + * P: Invocation. + * pedantic: Invocation. + * pedantic-errors: Invocation. + * remap: Invocation. + * std=: Invocation. + * target-help: Invocation. + * traditional: Invocation. + * trigraphs: Invocation. + * U: Invocation. + * undef: Invocation. + * v: Invocation. + * version: Invocation. + * w: Invocation. + * Wall: Invocation. + * Wcomment: Invocation. + * Wcomments: Invocation. + * Werror: Invocation. + * Wimport: Invocation. + * Wsystem-headers: Invocation. + * Wtraditional: Invocation. + * Wtrigraphs: Invocation. + * Wundef: Invocation. + * x: Invocation. + +  + File: cpp.info, Node: Index of Directives, Next: Concept Index, Prev: Option Index, Up: Top + + Index of Directives + ******************* + + * Menu: + + * #assert: Assertions. + * #define: Object-like Macros. + * #elif: Elif. + * #else: Else. + * #endif: Ifdef. + * #error: Diagnostics. + * #ident: Other Directives. + * #if: Conditional Syntax. + * #ifdef: Ifdef. + * #ifndef: Ifdef. + * #import: Obsolete once-only headers. + * #include: Include Syntax. + * #include_next: Wrapper Headers. + * #line: Line Control. + * #pragma GCC dependency: Pragmas. + * #pragma GCC poison: Pragmas. + * #pragma GCC system_header <1>: Pragmas. + * #pragma GCC system_header: System Headers. + * #sccs: Other Directives. + * #unassert: Assertions. + * #undef: Undefining and Redefining Macros. + * #warning: Diagnostics. + * C_INCLUDE_PATH: Environment Variables. + * CPATH: Environment Variables. + * CPLUS_INCLUDE_PATH: Environment Variables. + * DEPENDENCIES_OUTPUT: Environment Variables. + * OBJC_INCLUDE_PATH: Environment Variables. + * SUNPRO_DEPENDENCIES: Environment Variables. + diff -Nrc3pad gcc-3.2.2/gcc/doc/cpp.info-5 gcc-3.2.3/gcc/doc/cpp.info-5 *** gcc-3.2.2/gcc/doc/cpp.info-5 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cpp.info-5 Tue Apr 22 07:07:10 2003 *************** *** 0 **** --- 1,126 ---- + This is doc/cpp.info, produced by makeinfo version 4.5 from + doc/cpp.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpp: (cpp). The GNU C preprocessor. + END-INFO-DIR-ENTRY + +  + File: cpp.info, Node: Concept Index, Prev: Index of Directives, Up: Top + + Concept Index + ************* + + * Menu: + + * # operator: Stringification. + * ## operator: Concatenation. + * _Pragma: Pragmas. + * alternative tokens: Tokenization. + * arguments: Macro Arguments. + * arguments in macro definitions: Macro Arguments. + * assertions: Assertions. + * assertions, cancelling: Assertions. + * backslash-newline: Initial processing. + * block comments: Initial processing. + * C++ named operators: C++ Named Operators. + * character constants: Tokenization. + * character sets: Initial processing. + * command line: Invocation. + * commenting out code: Deleted Code. + * comments: Initial processing. + * common predefined macros: Common Predefined Macros. + * computed includes: Computed Includes. + * concatenation: Concatenation. + * conditional group: Ifdef. + * conditionals: Conditionals. + * continued lines: Initial processing. + * controlling macro: Once-Only Headers. + * defined: Defined. + * dependencies for make as output: Environment Variables. + * dependencies, make: Invocation. + * diagnostic: Diagnostics. + * differences from previous versions: Differences from previous versions. + * digraphs: Tokenization. + * directive line: The preprocessing language. + * directive name: The preprocessing language. + * directives: The preprocessing language. + * empty macro arguments: Macro Arguments. + * environment variables: Environment Variables. + * expansion of arguments: Argument Prescan. + * FDL, GNU Free Documentation License: GNU Free Documentation License. + * function-like macros: Function-like Macros. + * grouping options: Invocation. + * guard macro: Once-Only Headers. + * header file: Header Files. + * header file names: Tokenization. + * identifiers: Tokenization. + * implementation limits: Implementation limits. + * implementation-defined behavior: Implementation-defined behavior. + * including just once: Once-Only Headers. + * invalid token paste: Miscellaneous obsolete features. + * invocation: Invocation. + * iso646.h: C++ Named Operators. + * line comments: Initial processing. + * line control: Line Control. + * line endings: Initial processing. + * linemarkers: Preprocessor Output. + * macro argument expansion: Argument Prescan. + * macros in include: Computed Includes. + * macros with arguments: Macro Arguments. + * macros with variable arguments: Variadic Macros. + * make: Invocation. + * manifest constants: Object-like Macros. + * multi-line string constants: Miscellaneous obsolete features. + * named operators: C++ Named Operators. + * newlines in macro arguments: Newlines in Arguments. + * null directive: Other Directives. + * numbers: Tokenization. + * object-like macro: Object-like Macros. + * options: Invocation. + * options, grouping: Invocation. + * other tokens: Tokenization. + * output format: Preprocessor Output. + * overriding a header file: Wrapper Headers. + * parentheses in macro bodies: Operator Precedence Problems. + * pitfalls of macros: Macro Pitfalls. + * pragma poison: Miscellaneous obsolete features. + * predefined macros: Predefined Macros. + * predefined macros, system-specific: System-specific Predefined Macros. + * predicates: Assertions. + * preprocessing directives: The preprocessing language. + * preprocessing numbers: Tokenization. + * preprocessing tokens: Tokenization. + * prescan of macro arguments: Argument Prescan. + * problems with macros: Macro Pitfalls. + * punctuators: Tokenization. + * redefining macros: Undefining and Redefining Macros. + * repeated inclusion: Once-Only Headers. + * reporting errors: Diagnostics. + * reporting warnings: Diagnostics. + * reserved namespace: System-specific Predefined Macros. + * self-reference: Self-Referential Macros. + * semicolons (after macro calls): Swallowing the Semicolon. + * side effects (in macro arguments): Duplication of Side Effects. + * standard predefined macros.: Standard Predefined Macros. + * string constants: Tokenization. + * string literals: Tokenization. + * stringification: Stringification. + * symbolic constants: Object-like Macros. + * system header files <1>: System Headers. + * system header files: Header Files. + * system-specific predefined macros: System-specific Predefined Macros. + * testing predicates: Assertions. + * token concatenation: Concatenation. + * token pasting: Concatenation. + * tokens: Tokenization. + * trigraphs: Initial processing. + * undefining macros: Undefining and Redefining Macros. + * unsafe macros: Duplication of Side Effects. + * variable number of arguments: Variadic Macros. + * variadic macros: Variadic Macros. + * wrapper #ifndef: Once-Only Headers. + * wrapper headers: Wrapper Headers. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/cppinternals.info gcc-3.2.3/gcc/doc/cppinternals.info *** gcc-3.2.2/gcc/doc/cppinternals.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/cppinternals.info Tue Apr 22 07:07:26 2003 *************** *** 0 **** --- 1,1034 ---- + This is doc/cppinternals.info, produced by makeinfo version 4.5 from + doc/cppinternals.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Cpplib: (cppinternals). Cpplib internals. + END-INFO-DIR-ENTRY + + This file documents the internals of the GNU C Preprocessor. + + Copyright 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to make and distribute verbatim copies of this + manual provided the copyright notice and this permission notice are + preserved on all copies. + + Permission is granted to copy and distribute modified versions of + this manual under the conditions for verbatim copying, provided also + that the entire resulting derived work is distributed under the terms + of a permission notice identical to this one. + + Permission is granted to copy and distribute translations of this + manual into another language, under the above conditions for modified + versions. + +  + File: cppinternals.info, Node: Top, Next: Conventions, Up: (dir) + + + + Cpplib--the GNU C Preprocessor + ****************************** + + The GNU C preprocessor in GCC 3.x has been completely rewritten. It + is now implemented as a library, "cpplib", so it can be easily shared + between a stand-alone preprocessor, and a preprocessor integrated with + the C, C++ and Objective-C front ends. It is also available for use by + other programs, though this is not recommended as its exposed interface + has not yet reached a point of reasonable stability. + + The library has been written to be re-entrant, so that it can be used + to preprocess many files simultaneously if necessary. It has also been + written with the preprocessing token as the fundamental unit; the + preprocessor in previous versions of GCC would operate on text strings + as the fundamental unit. + + This brief manual documents the internals of cpplib, and explains + some of the tricky issues. It is intended that, along with the + comments in the source code, a reasonably competent C programmer should + be able to figure out what the code is doing, and why things have been + implemented the way they have. + + * Menu: + + * Conventions:: Conventions used in the code. + * Lexer:: The combined C, C++ and Objective-C Lexer. + * Hash Nodes:: All identifiers are entered into a hash table. + * Macro Expansion:: Macro expansion algorithm. + * Token Spacing:: Spacing and paste avoidance issues. + * Line Numbering:: Tracking location within files. + * Guard Macros:: Optimizing header files with guard macros. + * Files:: File handling. + * Index:: Index. + +  + File: cppinternals.info, Node: Conventions, Next: Lexer, Prev: Top, Up: Top + + Conventions + *********** + + cpplib has two interfaces--one is exposed internally only, and the + other is for both internal and external use. + + The convention is that functions and types that are exposed to + multiple files internally are prefixed with `_cpp_', and are to be + found in the file `cpphash.h'. Functions and types exposed to external + clients are in `cpplib.h', and prefixed with `cpp_'. For historical + reasons this is no longer quite true, but we should strive to stick to + it. + + We are striving to reduce the information exposed in `cpplib.h' to + the bare minimum necessary, and then to keep it there. This makes clear + exactly what external clients are entitled to assume, and allows us to + change internals in the future without worrying whether library clients + are perhaps relying on some kind of undocumented implementation-specific + behavior. + +  + File: cppinternals.info, Node: Lexer, Next: Hash Nodes, Prev: Conventions, Up: Top + + The Lexer + ********* + + Overview + ======== + + The lexer is contained in the file `cpplex.c'. It is a hand-coded + lexer, and not implemented as a state machine. It can understand C, C++ + and Objective-C source code, and has been extended to allow reasonably + successful preprocessing of assembly language. The lexer does not make + an initial pass to strip out trigraphs and escaped newlines, but handles + them as they are encountered in a single pass of the input file. It + returns preprocessing tokens individually, not a line at a time. + + It is mostly transparent to users of the library, since the library's + interface for obtaining the next token, `cpp_get_token', takes care of + lexing new tokens, handling directives, and expanding macros as + necessary. However, the lexer does expose some functionality so that + clients of the library can easily spell a given token, such as + `cpp_spell_token' and `cpp_token_len'. These functions are useful when + generating diagnostics, and for emitting the preprocessed output. + + Lexing a token + ============== + + Lexing of an individual token is handled by `_cpp_lex_direct' and + its subroutines. In its current form the code is quite complicated, + with read ahead characters and such-like, since it strives to not step + back in the character stream in preparation for handling non-ASCII file + encodings. The current plan is to convert any such files to UTF-8 + before processing them. This complexity is therefore unnecessary and + will be removed, so I'll not discuss it further here. + + The job of `_cpp_lex_direct' is simply to lex a token. It is not + responsible for issues like directive handling, returning lookahead + tokens directly, multiple-include optimization, or conditional block + skipping. It necessarily has a minor ro^le to play in memory + management of lexed lines. I discuss these issues in a separate section + (*note Lexing a line::). + + The lexer places the token it lexes into storage pointed to by the + variable `cur_token', and then increments it. This variable is + important for correct diagnostic positioning. Unless a specific line + and column are passed to the diagnostic routines, they will examine the + `line' and `col' values of the token just before the location that + `cur_token' points to, and use that location to report the diagnostic. + + The lexer does not consider whitespace to be a token in its own + right. If whitespace (other than a new line) precedes a token, it sets + the `PREV_WHITE' bit in the token's flags. Each token has its `line' + and `col' variables set to the line and column of the first character + of the token. This line number is the line number in the translation + unit, and can be converted to a source (file, line) pair using the line + map code. + + The first token on a logical, i.e. unescaped, line has the flag + `BOL' set for beginning-of-line. This flag is intended for internal + use, both to distinguish a `#' that begins a directive from one that + doesn't, and to generate a call-back to clients that want to be + notified about the start of every non-directive line with tokens on it. + Clients cannot reliably determine this for themselves: the first token + might be a macro, and the tokens of a macro expansion do not have the + `BOL' flag set. The macro expansion may even be empty, and the next + token on the line certainly won't have the `BOL' flag set. + + New lines are treated specially; exactly how the lexer handles them + is context-dependent. The C standard mandates that directives are + terminated by the first unescaped newline character, even if it appears + in the middle of a macro expansion. Therefore, if the state variable + `in_directive' is set, the lexer returns a `CPP_EOF' token, which is + normally used to indicate end-of-file, to indicate end-of-directive. + In a directive a `CPP_EOF' token never means end-of-file. + Conveniently, if the caller was `collect_args', it already handles + `CPP_EOF' as if it were end-of-file, and reports an error about an + unterminated macro argument list. + + The C standard also specifies that a new line in the middle of the + arguments to a macro is treated as whitespace. This white space is + important in case the macro argument is stringified. The state variable + `parsing_args' is nonzero when the preprocessor is collecting the + arguments to a macro call. It is set to 1 when looking for the opening + parenthesis to a function-like macro, and 2 when collecting the actual + arguments up to the closing parenthesis, since these two cases need to + be distinguished sometimes. One such time is here: the lexer sets the + `PREV_WHITE' flag of a token if it meets a new line when `parsing_args' + is set to 2. It doesn't set it if it meets a new line when + `parsing_args' is 1, since then code like + + #define foo() bar + foo + baz + + would be output with an erroneous space before `baz': + + foo + baz + + This is a good example of the subtlety of getting token spacing + correct in the preprocessor; there are plenty of tests in the test + suite for corner cases like this. + + The lexer is written to treat each of `\r', `\n', `\r\n' and `\n\r' + as a single new line indicator. This allows it to transparently + preprocess MS-DOS, Macintosh and Unix files without their needing to + pass through a special filter beforehand. + + We also decided to treat a backslash, either `\' or the trigraph + `??/', separated from one of the above newline indicators by + non-comment whitespace only, as intending to escape the newline. It + tends to be a typing mistake, and cannot reasonably be mistaken for + anything else in any of the C-family grammars. Since handling it this + way is not strictly conforming to the ISO standard, the library issues a + warning wherever it encounters it. + + Handling newlines like this is made simpler by doing it in one place + only. The function `handle_newline' takes care of all newline + characters, and `skip_escaped_newlines' takes care of arbitrarily long + sequences of escaped newlines, deferring to `handle_newline' to handle + the newlines themselves. + + The most painful aspect of lexing ISO-standard C and C++ is handling + trigraphs and backlash-escaped newlines. Trigraphs are processed before + any interpretation of the meaning of a character is made, and + unfortunately there is a trigraph representation for a backslash, so it + is possible for the trigraph `??/' to introduce an escaped newline. + + Escaped newlines are tedious because theoretically they can occur + anywhere--between the `+' and `=' of the `+=' token, within the + characters of an identifier, and even between the `*' and `/' that + terminates a comment. Moreover, you cannot be sure there is just + one--there might be an arbitrarily long sequence of them. + + So, for example, the routine that lexes a number, `parse_number', + cannot assume that it can scan forwards until the first non-number + character and be done with it, because this could be the `\' + introducing an escaped newline, or the `?' introducing the trigraph + sequence that represents the `\' of an escaped newline. If it + encounters a `?' or `\', it calls `skip_escaped_newlines' to skip over + any potential escaped newlines before checking whether the number has + been finished. + + Similarly code in the main body of `_cpp_lex_direct' cannot simply + check for a `=' after a `+' character to determine whether it has a + `+=' token; it needs to be prepared for an escaped newline of some + sort. Such cases use the function `get_effective_char', which returns + the first character after any intervening escaped newlines. + + The lexer needs to keep track of the correct column position, + including counting tabs as specified by the `-ftabstop=' option. This + should be done even within C-style comments; they can appear in the + middle of a line, and we want to report diagnostics in the correct + position for text appearing after the end of the comment. + + Some identifiers, such as `__VA_ARGS__' and poisoned identifiers, + may be invalid and require a diagnostic. However, if they appear in a + macro expansion we don't want to complain with each use of the macro. + It is therefore best to catch them during the lexing stage, in + `parse_identifier'. In both cases, whether a diagnostic is needed or + not is dependent upon the lexer's state. For example, we don't want to + issue a diagnostic for re-poisoning a poisoned identifier, or for using + `__VA_ARGS__' in the expansion of a variable-argument macro. Therefore + `parse_identifier' makes use of state flags to determine whether a + diagnostic is appropriate. Since we change state on a per-token basis, + and don't lex whole lines at a time, this is not a problem. + + Another place where state flags are used to change behavior is whilst + lexing header names. Normally, a `<' would be lexed as a single token. + After a `#include' directive, though, it should be lexed as a single + token as far as the nearest `>' character. Note that we don't allow + the terminators of header names to be escaped; the first `"' or `>' + terminates the header name. + + Interpretation of some character sequences depends upon whether we + are lexing C, C++ or Objective-C, and on the revision of the standard in + force. For example, `::' is a single token in C++, but in C it is two + separate `:' tokens and almost certainly a syntax error. Such cases + are handled by `_cpp_lex_direct' based upon command-line flags stored + in the `cpp_options' structure. + + Once a token has been lexed, it leads an independent existence. The + spelling of numbers, identifiers and strings is copied to permanent + storage from the original input buffer, so a token remains valid and + correct even if its source buffer is freed with `_cpp_pop_buffer'. The + storage holding the spellings of such tokens remains until the client + program calls cpp_destroy, probably at the end of the translation unit. + + Lexing a line + ============= + + When the preprocessor was changed to return pointers to tokens, one + feature I wanted was some sort of guarantee regarding how long a + returned pointer remains valid. This is important to the stand-alone + preprocessor, the future direction of the C family front ends, and even + to cpplib itself internally. + + Occasionally the preprocessor wants to be able to peek ahead in the + token stream. For example, after the name of a function-like macro, it + wants to check the next token to see if it is an opening parenthesis. + Another example is that, after reading the first few tokens of a + `#pragma' directive and not recognizing it as a registered pragma, it + wants to backtrack and allow the user-defined handler for unknown + pragmas to access the full `#pragma' token stream. The stand-alone + preprocessor wants to be able to test the current token with the + previous one to see if a space needs to be inserted to preserve their + separate tokenization upon re-lexing (paste avoidance), so it needs to + be sure the pointer to the previous token is still valid. The + recursive-descent C++ parser wants to be able to perform tentative + parsing arbitrarily far ahead in the token stream, and then to be able + to jump back to a prior position in that stream if necessary. + + The rule I chose, which is fairly natural, is to arrange that the + preprocessor lex all tokens on a line consecutively into a token buffer, + which I call a "token run", and when meeting an unescaped new line + (newlines within comments do not count either), to start lexing back at + the beginning of the run. Note that we do _not_ lex a line of tokens + at once; if we did that `parse_identifier' would not have state flags + available to warn about invalid identifiers (*note Invalid + identifiers::). + + In other words, accessing tokens that appeared earlier in the current + line is valid, but since each logical line overwrites the tokens of the + previous line, tokens from prior lines are unavailable. In particular, + since a directive only occupies a single logical line, this means that + the directive handlers like the `#pragma' handler can jump around in + the directive's tokens if necessary. + + Two issues remain: what about tokens that arise from macro + expansions, and what happens when we have a long line that overflows + the token run? + + Since we promise clients that we preserve the validity of pointers + that we have already returned for tokens that appeared earlier in the + line, we cannot reallocate the run. Instead, on overflow it is + expanded by chaining a new token run on to the end of the existing one. + + The tokens forming a macro's replacement list are collected by the + `#define' handler, and placed in storage that is only freed by + `cpp_destroy'. So if a macro is expanded in our line of tokens, the + pointers to the tokens of its expansion that we return will always + remain valid. However, macros are a little trickier than that, since + they give rise to three sources of fresh tokens. They are the built-in + macros like `__LINE__', and the `#' and `##' operators for + stringification and token pasting. I handled this by allocating space + for these tokens from the lexer's token run chain. This means they + automatically receive the same lifetime guarantees as lexed tokens, and + we don't need to concern ourselves with freeing them. + + Lexing into a line of tokens solves some of the token memory + management issues, but not all. The opening parenthesis after a + function-like macro name might lie on a different line, and the front + ends definitely want the ability to look ahead past the end of the + current line. So cpplib only moves back to the start of the token run + at the end of a line if the variable `keep_tokens' is zero. + Line-buffering is quite natural for the preprocessor, and as a result + the only time cpplib needs to increment this variable is whilst looking + for the opening parenthesis to, and reading the arguments of, a + function-like macro. In the near future cpplib will export an + interface to increment and decrement this variable, so that clients can + share full control over the lifetime of token pointers too. + + The routine `_cpp_lex_token' handles moving to new token runs, + calling `_cpp_lex_direct' to lex new tokens, or returning + previously-lexed tokens if we stepped back in the token stream. It also + checks each token for the `BOL' flag, which might indicate a directive + that needs to be handled, or require a start-of-line call-back to be + made. `_cpp_lex_token' also handles skipping over tokens in failed + conditional blocks, and invalidates the control macro of the + multiple-include optimization if a token was successfully lexed outside + a directive. In other words, its callers do not need to concern + themselves with such issues. + +  + File: cppinternals.info, Node: Hash Nodes, Next: Macro Expansion, Prev: Lexer, Up: Top + + Hash Nodes + ********** + + When cpplib encounters an "identifier", it generates a hash code for + it and stores it in the hash table. By "identifier" we mean tokens + with type `CPP_NAME'; this includes identifiers in the usual C sense, + as well as keywords, directive names, macro names and so on. For + example, all of `pragma', `int', `foo' and `__GNUC__' are identifiers + and hashed when lexed. + + Each node in the hash table contain various information about the + identifier it represents. For example, its length and type. At any one + time, each identifier falls into exactly one of three categories: + + * Macros + + These have been declared to be macros, either on the command line + or with `#define'. A few, such as `__TIME__' are built-ins + entered in the hash table during initialization. The hash node + for a normal macro points to a structure with more information + about the macro, such as whether it is function-like, how many + arguments it takes, and its expansion. Built-in macros are + flagged as special, and instead contain an enum indicating which + of the various built-in macros it is. + + * Assertions + + Assertions are in a separate namespace to macros. To enforce + this, cpp actually prepends a `#' character before hashing and + entering it in the hash table. An assertion's node points to a + chain of answers to that assertion. + + * Void + + Everything else falls into this category--an identifier that is not + currently a macro, or a macro that has since been undefined with + `#undef'. + + When preprocessing C++, this category also includes the named + operators, such as `xor'. In expressions these behave like the + operators they represent, but in contexts where the spelling of a + token matters they are spelt differently. This spelling + distinction is relevant when they are operands of the stringizing + and pasting macro operators `#' and `##'. Named operator hash + nodes are flagged, both to catch the spelling distinction and to + prevent them from being defined as macros. + + The same identifiers share the same hash node. Since each identifier + token, after lexing, contains a pointer to its hash node, this is used + to provide rapid lookup of various information. For example, when + parsing a `#define' statement, CPP flags each argument's identifier + hash node with the index of that argument. This makes duplicated + argument checking an O(1) operation for each argument. Similarly, for + each identifier in the macro's expansion, lookup to see if it is an + argument, and which argument it is, is also an O(1) operation. Further, + each directive name, such as `endif', has an associated directive enum + stored in its hash node, so that directive lookup is also O(1). + +  + File: cppinternals.info, Node: Macro Expansion, Next: Token Spacing, Prev: Hash Nodes, Up: Top + + Macro Expansion Algorithm + ************************* + + Macro expansion is a tricky operation, fraught with nasty corner + cases and situations that render what you thought was a nifty way to + optimize the preprocessor's expansion algorithm wrong in quite subtle + ways. + + I strongly recommend you have a good grasp of how the C and C++ + standards require macros to be expanded before diving into this + section, let alone the code!. If you don't have a clear mental picture + of how things like nested macro expansion, stringification and token + pasting are supposed to work, damage to your sanity can quickly result. + + Internal representation of macros + ================================= + + The preprocessor stores macro expansions in tokenized form. This + saves repeated lexing passes during expansion, at the cost of a small + increase in memory consumption on average. The tokens are stored + contiguously in memory, so a pointer to the first one and a token count + is all you need to get the replacement list of a macro. + + If the macro is a function-like macro the preprocessor also stores + its parameters, in the form of an ordered list of pointers to the hash + table entry of each parameter's identifier. Further, in the macro's + stored expansion each occurrence of a parameter is replaced with a + special token of type `CPP_MACRO_ARG'. Each such token holds the index + of the parameter it represents in the parameter list, which allows + rapid replacement of parameters with their arguments during expansion. + Despite this optimization it is still necessary to store the original + parameters to the macro, both for dumping with e.g., `-dD', and to warn + about non-trivial macro redefinitions when the parameter names have + changed. + + Macro expansion overview + ======================== + + The preprocessor maintains a "context stack", implemented as a + linked list of `cpp_context' structures, which together represent the + macro expansion state at any one time. The `struct cpp_reader' member + variable `context' points to the current top of this stack. The top + normally holds the unexpanded replacement list of the innermost macro + under expansion, except when cpplib is about to pre-expand an argument, + in which case it holds that argument's unexpanded tokens. + + When there are no macros under expansion, cpplib is in "base + context". All contexts other than the base context contain a + contiguous list of tokens delimited by a starting and ending token. + When not in base context, cpplib obtains the next token from the list + of the top context. If there are no tokens left in the list, it pops + that context off the stack, and subsequent ones if necessary, until an + unexhausted context is found or it returns to base context. In base + context, cpplib reads tokens directly from the lexer. + + If it encounters an identifier that is both a macro and enabled for + expansion, cpplib prepares to push a new context for that macro on the + stack by calling the routine `enter_macro_context'. When this routine + returns, the new context will contain the unexpanded tokens of the + replacement list of that macro. In the case of function-like macros, + `enter_macro_context' also replaces any parameters in the replacement + list, stored as `CPP_MACRO_ARG' tokens, with the appropriate macro + argument. If the standard requires that the parameter be replaced with + its expanded argument, the argument will have been fully macro expanded + first. + + `enter_macro_context' also handles special macros like `__LINE__'. + Although these macros expand to a single token which cannot contain any + further macros, for reasons of token spacing (*note Token Spacing::) + and simplicity of implementation, cpplib handles these special macros + by pushing a context containing just that one token. + + The final thing that `enter_macro_context' does before returning is + to mark the macro disabled for expansion (except for special macros + like `__TIME__'). The macro is re-enabled when its context is later + popped from the context stack, as described above. This strict + ordering ensures that a macro is disabled whilst its expansion is being + scanned, but that it is _not_ disabled whilst any arguments to it are + being expanded. + + Scanning the replacement list for macros to expand + ================================================== + + The C standard states that, after any parameters have been replaced + with their possibly-expanded arguments, the replacement list is scanned + for nested macros. Further, any identifiers in the replacement list + that are not expanded during this scan are never again eligible for + expansion in the future, if the reason they were not expanded is that + the macro in question was disabled. + + Clearly this latter condition can only apply to tokens resulting from + argument pre-expansion. Other tokens never have an opportunity to be + re-tested for expansion. It is possible for identifiers that are + function-like macros to not expand initially but to expand during a + later scan. This occurs when the identifier is the last token of an + argument (and therefore originally followed by a comma or a closing + parenthesis in its macro's argument list), and when it replaces its + parameter in the macro's replacement list, the subsequent token happens + to be an opening parenthesis (itself possibly the first token of an + argument). + + It is important to note that when cpplib reads the last token of a + given context, that context still remains on the stack. Only when + looking for the _next_ token do we pop it off the stack and drop to a + lower context. This makes backing up by one token easy, but more + importantly ensures that the macro corresponding to the current context + is still disabled when we are considering the last token of its + replacement list for expansion (or indeed expanding it). As an + example, which illustrates many of the points above, consider + + #define foo(x) bar x + foo(foo) (2) + + which fully expands to `bar foo (2)'. During pre-expansion of the + argument, `foo' does not expand even though the macro is enabled, since + it has no following parenthesis [pre-expansion of an argument only uses + tokens from that argument; it cannot take tokens from whatever follows + the macro invocation]. This still leaves the argument token `foo' + eligible for future expansion. Then, when re-scanning after argument + replacement, the token `foo' is rejected for expansion, and marked + ineligible for future expansion, since the macro is now disabled. It + is disabled because the replacement list `bar foo' of the macro is + still on the context stack. + + If instead the algorithm looked for an opening parenthesis first and + then tested whether the macro were disabled it would be subtly wrong. + In the example above, the replacement list of `foo' would be popped in + the process of finding the parenthesis, re-enabling `foo' and expanding + it a second time. + + Looking for a function-like macro's opening parenthesis + ======================================================= + + Function-like macros only expand when immediately followed by a + parenthesis. To do this cpplib needs to temporarily disable macros and + read the next token. Unfortunately, because of spacing issues (*note + Token Spacing::), there can be fake padding tokens in-between, and if + the next real token is not a parenthesis cpplib needs to be able to + back up that one token as well as retain the information in any + intervening padding tokens. + + Backing up more than one token when macros are involved is not + permitted by cpplib, because in general it might involve issues like + restoring popped contexts onto the context stack, which are too hard. + Instead, searching for the parenthesis is handled by a special + function, `funlike_invocation_p', which remembers padding information + as it reads tokens. If the next real token is not an opening + parenthesis, it backs up that one token, and then pushes an extra + context just containing the padding information if necessary. + + Marking tokens ineligible for future expansion + ============================================== + + As discussed above, cpplib needs a way of marking tokens as + unexpandable. Since the tokens cpplib handles are read-only once they + have been lexed, it instead makes a copy of the token and adds the flag + `NO_EXPAND' to the copy. + + For efficiency and to simplify memory management by avoiding having + to remember to free these tokens, they are allocated as temporary tokens + from the lexer's current token run (*note Lexing a line::) using the + function `_cpp_temp_token'. The tokens are then re-used once the + current line of tokens has been read in. + + This might sound unsafe. However, tokens runs are not re-used at the + end of a line if it happens to be in the middle of a macro argument + list, and cpplib only wants to back-up more than one lexer token in + situations where no macro expansion is involved, so the optimization is + safe. + +  + File: cppinternals.info, Node: Token Spacing, Next: Line Numbering, Prev: Macro Expansion, Up: Top + + Token Spacing + ************* + + First, let's look at an issue that only concerns the stand-alone + preprocessor: we want to guarantee that re-reading its preprocessed + output results in an identical token stream. Without taking special + measures, this might not be the case because of macro substitution. + For example: + + #define PLUS + + #define EMPTY + #define f(x) =x= + +PLUS -EMPTY- PLUS+ f(=) + ==> + + - - + + = = = + _not_ + ==> ++ -- ++ === + + One solution would be to simply insert a space between all adjacent + tokens. However, we would like to keep space insertion to a minimum, + both for aesthetic reasons and because it causes problems for people who + still try to abuse the preprocessor for things like Fortran source and + Makefiles. + + For now, just notice that when tokens are added (or removed, as + shown by the `EMPTY' example) from the original lexed token stream, we + need to check for accidental token pasting. We call this "paste + avoidance". Token addition and removal can only occur because of macro + expansion, but accidental pasting can occur in many places: both before + and after each macro replacement, each argument replacement, and + additionally each token created by the `#' and `##' operators. + + Let's look at how the preprocessor gets whitespace output correct + normally. The `cpp_token' structure contains a flags byte, and one of + those flags is `PREV_WHITE'. This is flagged by the lexer, and + indicates that the token was preceded by whitespace of some form other + than a new line. The stand-alone preprocessor can use this flag to + decide whether to insert a space between tokens in the output. + + Now consider the result of the following macro expansion: + + #define add(x, y, z) x + y +z; + sum = add (1,2, 3); + ==> sum = 1 + 2 +3; + + The interesting thing here is that the tokens `1' and `2' are output + with a preceding space, and `3' is output without a preceding space, + but when lexed none of these tokens had that property. Careful + consideration reveals that `1' gets its preceding whitespace from the + space preceding `add' in the macro invocation, _not_ replacement list. + `2' gets its whitespace from the space preceding the parameter `y' in + the macro replacement list, and `3' has no preceding space because + parameter `z' has none in the replacement list. + + Once lexed, tokens are effectively fixed and cannot be altered, since + pointers to them might be held in many places, in particular by + in-progress macro expansions. So instead of modifying the two tokens + above, the preprocessor inserts a special token, which I call a + "padding token", into the token stream to indicate that spacing of the + subsequent token is special. The preprocessor inserts padding tokens + in front of every macro expansion and expanded macro argument. These + point to a "source token" from which the subsequent real token should + inherit its spacing. In the above example, the source tokens are `add' + in the macro invocation, and `y' and `z' in the macro replacement list, + respectively. + + It is quite easy to get multiple padding tokens in a row, for + example if a macro's first replacement token expands straight into + another macro. + + #define foo bar + #define bar baz + [foo] + ==> [baz] + + Here, two padding tokens are generated with sources the `foo' token + between the brackets, and the `bar' token from foo's replacement list, + respectively. Clearly the first padding token is the one we should + use, so our output code should contain a rule that the first padding + token in a sequence is the one that matters. + + But what if we happen to leave a macro expansion? Adjusting the + above example slightly: + + #define foo bar + #define bar EMPTY baz + #define EMPTY + [foo] EMPTY; + ==> [ baz] ; + + As shown, now there should be a space before `baz' and the semicolon + in the output. + + The rules we decided above fail for `baz': we generate three padding + tokens, one per macro invocation, before the token `baz'. We would + then have it take its spacing from the first of these, which carries + source token `foo' with no leading space. + + It is vital that cpplib get spacing correct in these examples since + any of these macro expansions could be stringified, where spacing + matters. + + So, this demonstrates that not just entering macro and argument + expansions, but leaving them requires special handling too. I made + cpplib insert a padding token with a `NULL' source token when leaving + macro expansions, as well as after each replaced argument in a macro's + replacement list. It also inserts appropriate padding tokens on either + side of tokens created by the `#' and `##' operators. I expanded the + rule so that, if we see a padding token with a `NULL' source token, + _and_ that source token has no leading space, then we behave as if we + have seen no padding tokens at all. A quick check shows this rule will + then get the above example correct as well. + + Now a relationship with paste avoidance is apparent: we have to be + careful about paste avoidance in exactly the same locations we have + padding tokens in order to get white space correct. This makes + implementation of paste avoidance easy: wherever the stand-alone + preprocessor is fixing up spacing because of padding tokens, and it + turns out that no space is needed, it has to take the extra step to + check that a space is not needed after all to avoid an accidental paste. + The function `cpp_avoid_paste' advises whether a space is required + between two consecutive tokens. To avoid excessive spacing, it tries + hard to only require a space if one is likely to be necessary, but for + reasons of efficiency it is slightly conservative and might recommend a + space where one is not strictly needed. + +  + File: cppinternals.info, Node: Line Numbering, Next: Guard Macros, Prev: Token Spacing, Up: Top + + Line numbering + ************** + + Just which line number anyway? + ============================== + + There are three reasonable requirements a cpplib client might have + for the line number of a token passed to it: + + * The source line it was lexed on. + + * The line it is output on. This can be different to the line it was + lexed on if, for example, there are intervening escaped newlines or + C-style comments. For example: + + foo /* A long + comment */ bar \ + baz + => + foo bar baz + + * If the token results from a macro expansion, the line of the macro + name, or possibly the line of the closing parenthesis in the case + of function-like macro expansion. + + The `cpp_token' structure contains `line' and `col' members. The + lexer fills these in with the line and column of the first character of + the token. Consequently, but maybe unexpectedly, a token from the + replacement list of a macro expansion carries the location of the token + within the `#define' directive, because cpplib expands a macro by + returning pointers to the tokens in its replacement list. The current + implementation of cpplib assigns tokens created from built-in macros + and the `#' and `##' operators the location of the most recently lexed + token. This is a because they are allocated from the lexer's token + runs, and because of the way the diagnostic routines infer the + appropriate location to report. + + The diagnostic routines in cpplib display the location of the most + recently _lexed_ token, unless they are passed a specific line and + column to report. For diagnostics regarding tokens that arise from + macro expansions, it might also be helpful for the user to see the + original location in the macro definition that the token came from. + Since that is exactly the information each token carries, such an + enhancement could be made relatively easily in future. + + The stand-alone preprocessor faces a similar problem when determining + the correct line to output the token on: the position attached to a + token is fairly useless if the token came from a macro expansion. All + tokens on a logical line should be output on its first physical line, so + the token's reported location is also wrong if it is part of a physical + line other than the first. + + To solve these issues, cpplib provides a callback that is generated + whenever it lexes a preprocessing token that starts a new logical line + other than a directive. It passes this token (which may be a `CPP_EOF' + token indicating the end of the translation unit) to the callback + routine, which can then use the line and column of this token to + produce correct output. + + Representation of line numbers + ============================== + + As mentioned above, cpplib stores with each token the line number + that it was lexed on. In fact, this number is not the number of the + line in the source file, but instead bears more resemblance to the + number of the line in the translation unit. + + The preprocessor maintains a monotonic increasing line count, which + is incremented at every new line character (and also at the end of any + buffer that does not end in a new line). Since a line number of zero is + useful to indicate certain special states and conditions, this variable + starts counting from one. + + This variable therefore uniquely enumerates each line in the + translation unit. With some simple infrastructure, it is straight + forward to map from this to the original source file and line number + pair, saving space whenever line number information needs to be saved. + The code the implements this mapping lies in the files `line-map.c' and + `line-map.h'. + + Command-line macros and assertions are implemented by pushing a + buffer containing the right hand side of an equivalent `#define' or + `#assert' directive. Some built-in macros are handled similarly. + Since these are all processed before the first line of the main input + file, it will typically have an assigned line closer to twenty than to + one. + +  + File: cppinternals.info, Node: Guard Macros, Next: Files, Prev: Line Numbering, Up: Top + + The Multiple-Include Optimization + ********************************* + + Header files are often of the form + + #ifndef FOO + #define FOO + ... + #endif + + to prevent the compiler from processing them more than once. The + preprocessor notices such header files, so that if the header file + appears in a subsequent `#include' directive and `FOO' is defined, then + it is ignored and it doesn't preprocess or even re-open the file a + second time. This is referred to as the "multiple include + optimization". + + Under what circumstances is such an optimization valid? If the file + were included a second time, it can only be optimized away if that + inclusion would result in no tokens to return, and no relevant + directives to process. Therefore the current implementation imposes + requirements and makes some allowances as follows: + + 1. There must be no tokens outside the controlling `#if'-`#endif' + pair, but whitespace and comments are permitted. + + 2. There must be no directives outside the controlling directive + pair, but the "null directive" (a line containing nothing other + than a single `#' and possibly whitespace) is permitted. + + 3. The opening directive must be of the form + + #ifndef FOO + + or + + #if !defined FOO [equivalently, #if !defined(FOO)] + + 4. In the second form above, the tokens forming the `#if' expression + must have come directly from the source file--no macro expansion + must have been involved. This is because macro definitions can + change, and tracking whether or not a relevant change has been + made is not worth the implementation cost. + + 5. There can be no `#else' or `#elif' directives at the outer + conditional block level, because they would probably contain + something of interest to a subsequent pass. + + First, when pushing a new file on the buffer stack, + `_stack_include_file' sets the controlling macro `mi_cmacro' to `NULL', + and sets `mi_valid' to `true'. This indicates that the preprocessor + has not yet encountered anything that would invalidate the + multiple-include optimization. As described in the next few + paragraphs, these two variables having these values effectively + indicates top-of-file. + + When about to return a token that is not part of a directive, + `_cpp_lex_token' sets `mi_valid' to `false'. This enforces the + constraint that tokens outside the controlling conditional block + invalidate the optimization. + + The `do_if', when appropriate, and `do_ifndef' directive handlers + pass the controlling macro to the function `push_conditional'. cpplib + maintains a stack of nested conditional blocks, and after processing + every opening conditional this function pushes an `if_stack' structure + onto the stack. In this structure it records the controlling macro for + the block, provided there is one and we're at top-of-file (as described + above). If an `#elif' or `#else' directive is encountered, the + controlling macro for that block is cleared to `NULL'. Otherwise, it + survives until the `#endif' closing the block, upon which `do_endif' + sets `mi_valid' to true and stores the controlling macro in `mi_cmacro'. + + `_cpp_handle_directive' clears `mi_valid' when processing any + directive other than an opening conditional and the null directive. + With this, and requiring top-of-file to record a controlling macro, and + no `#else' or `#elif' for it to survive and be copied to `mi_cmacro' by + `do_endif', we have enforced the absence of directives outside the main + conditional block for the optimization to be on. + + Note that whilst we are inside the conditional block, `mi_valid' is + likely to be reset to `false', but this does not matter since the the + closing `#endif' restores it to `true' if appropriate. + + Finally, since `_cpp_lex_direct' pops the file off the buffer stack + at `EOF' without returning a token, if the `#endif' directive was not + followed by any tokens, `mi_valid' is `true' and `_cpp_pop_file_buffer' + remembers the controlling macro associated with the file. Subsequent + calls to `stack_include_file' result in no buffer being pushed if the + controlling macro is defined, effecting the optimization. + + A quick word on how we handle the + + #if !defined FOO + + case. `_cpp_parse_expr' and `parse_defined' take steps to see whether + the three stages `!', `defined-expression' and `end-of-directive' occur + in order in a `#if' expression. If so, they return the guard macro to + `do_if' in the variable `mi_ind_cmacro', and otherwise set it to `NULL'. + `enter_macro_context' sets `mi_valid' to false, so if a macro was + expanded whilst parsing any part of the expression, then the + top-of-file test in `push_conditional' fails and the optimization is + turned off. + +  + File: cppinternals.info, Node: Files, Next: Index, Prev: Guard Macros, Up: Top + + File Handling + ************* + + Fairly obviously, the file handling code of cpplib resides in the + file `cppfiles.c'. It takes care of the details of file searching, + opening, reading and caching, for both the main source file and all the + headers it recursively includes. + + The basic strategy is to minimize the number of system calls. On + many systems, the basic `open ()' and `fstat ()' system calls can be + quite expensive. For every `#include'-d file, we need to try all the + directories in the search path until we find a match. Some projects, + such as glibc, pass twenty or thirty include paths on the command line, + so this can rapidly become time consuming. + + For a header file we have not encountered before we have little + choice but to do this. However, it is often the case that the same + headers are repeatedly included, and in these cases we try to avoid + repeating the filesystem queries whilst searching for the correct file. + + For each file we try to open, we store the constructed path in a + splay tree. This path first undergoes simplification by the function + `_cpp_simplify_pathname'. For example, `/usr/include/bits/../foo.h' is + simplified to `/usr/include/foo.h' before we enter it in the splay tree + and try to `open ()' the file. CPP will then find subsequent uses of + `foo.h', even as `/usr/include/foo.h', in the splay tree and save + system calls. + + Further, it is likely the file contents have also been cached, + saving a `read ()' system call. We don't bother caching the contents of + header files that are re-inclusion protected, and whose re-inclusion + macro is defined when we leave the header file for the first time. If + the host supports it, we try to map suitably large files into memory, + rather than reading them in directly. + + The include paths are internally stored on a null-terminated + singly-linked list, starting with the `"header.h"' directory search + chain, which then links into the `' directory chain. + + Files included with the `' syntax start the lookup directly + in the second half of this chain. However, files included with the + `"foo.h"' syntax start at the beginning of the chain, but with one + extra directory prepended. This is the directory of the current file; + the one containing the `#include' directive. Prepending this directory + on a per-file basis is handled by the function `search_from'. + + Note that a header included with a directory component, such as + `#include "mydir/foo.h"' and opened as + `/usr/local/include/mydir/foo.h', will have the complete path minus the + basename `foo.h' as the current directory. + + Enough information is stored in the splay tree that CPP can + immediately tell whether it can skip the header file because of the + multiple include optimization, whether the file didn't exist or + couldn't be opened for some reason, or whether the header was flagged + not to be re-used, as it is with the obsolete `#import' directive. + + For the benefit of MS-DOS filesystems with an 8.3 filename + limitation, CPP offers the ability to treat various include file names + as aliases for the real header files with shorter names. The map from + one to the other is found in a special file called `header.gcc', stored + in the command line (or system) include directories to which the mapping + applies. This may be higher up the directory tree than the full path to + the file minus the base name. + +  + File: cppinternals.info, Node: Index, Prev: Files, Up: Top + + Index + ***** + + * Menu: + + * assertions: Hash Nodes. + * controlling macros: Guard Macros. + * escaped newlines: Lexer. + * files: Files. + * guard macros: Guard Macros. + * hash table: Hash Nodes. + * header files: Conventions. + * identifiers: Hash Nodes. + * interface: Conventions. + * lexer: Lexer. + * line numbers: Line Numbering. + * macro expansion: Macro Expansion. + * macro representation (internal): Macro Expansion. + * macros: Hash Nodes. + * multiple-include optimization: Guard Macros. + * named operators: Hash Nodes. + * newlines: Lexer. + * paste avoidance: Token Spacing. + * spacing: Token Spacing. + * token run: Lexer. + * token spacing: Token Spacing. + + +  + Tag Table: + Node: Top910 + Node: Conventions2579 + Node: Lexer3523 + Ref: Invalid identifiers11446 + Ref: Lexing a line13395 + Node: Hash Nodes18168 + Node: Macro Expansion21050 + Node: Token Spacing30015 + Node: Line Numbering35897 + Node: Guard Macros39988 + Node: Files44786 + Node: Index48250 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/doc/extend.texi gcc-3.2.3/gcc/doc/extend.texi *** gcc-3.2.2/gcc/doc/extend.texi Wed Oct 9 21:31:00 2002 --- gcc-3.2.3/gcc/doc/extend.texi Fri Mar 21 15:02:35 2003 *************** the containing function. You should spe *** 843,861 **** returned by @code{__builtin_apply}. @end deftypefn - @cindex underscores in variables in macros - @cindex @samp{_} in variables in macros - @cindex local variables in macros - @cindex variables, local, in macros - @cindex macros, local variables in - - The reason for using names that start with underscores for the local - variables is to avoid conflicts with variable names that occur within the - expressions that are substituted for @code{a} and @code{b}. Eventually we - hope to design a new form of declaration syntax that allows you to declare - variables whose scopes start only after their initializers; this will be a - more reliable way to prevent such conflicts. - @node Typeof @section Referring to a Type with @code{typeof} @findex typeof --- 843,848 ---- *************** arithmetic type and evaluates each of it *** 906,911 **** --- 893,911 ---- _a > _b ? _a : _b; @}) @end example + @cindex underscores in variables in macros + @cindex @samp{_} in variables in macros + @cindex local variables in macros + @cindex variables, local, in macros + @cindex macros, local variables in + + The reason for using names that start with underscores for the local + variables is to avoid conflicts with variable names that occur within the + expressions that are substituted for @code{a} and @code{b}. Eventually we + hope to design a new form of declaration syntax that allows you to declare + variables whose scopes start only after their initializers; this will be a + more reliable way to prevent such conflicts. + @noindent Some more examples of the use of @code{typeof}: *************** empty string. *** 6072,6078 **** This pragma is similar in intent to to the asm labels extension (@pxref{Asm Labels}) in that the system programmer wants to change the assembly-level ABI without changing the source-level API. The ! preprocessor defines @code{__EXTERN_PREFIX} if the pragma is available. @end table @node Unnamed Fields --- 6072,6079 ---- This pragma is similar in intent to to the asm labels extension (@pxref{Asm Labels}) in that the system programmer wants to change the assembly-level ABI without changing the source-level API. The ! preprocessor defines @code{__PRAGMA_EXTERN_PREFIX} if the pragma is ! available. @end table @node Unnamed Fields diff -Nrc3pad gcc-3.2.2/gcc/doc/fsf-funding.7 gcc-3.2.3/gcc/doc/fsf-funding.7 *** gcc-3.2.2/gcc/doc/fsf-funding.7 Wed Feb 5 03:13:59 2003 --- gcc-3.2.3/gcc/doc/fsf-funding.7 Tue Apr 22 07:07:34 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:59 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:34 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "fsf-funding 7" ! .TH fsf-funding 7 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" fsf-funding \- Funding Free Software --- 138,144 ---- .\" ====================================================================== .\" .IX Title "fsf-funding 7" ! .TH fsf-funding 7 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" fsf-funding \- Funding Free Software diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.1 gcc-3.2.3/gcc/doc/gcc.1 *** gcc-3.2.2/gcc/doc/gcc.1 Wed Feb 5 03:13:59 2003 --- gcc-3.2.3/gcc/doc/gcc.1 Tue Apr 22 07:07:33 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:56 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:29 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "GCC 1" ! .TH GCC 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gcc \- \s-1GNU\s0 project C and \*(C+ compiler --- 138,144 ---- .\" ====================================================================== .\" .IX Title "GCC 1" ! .TH GCC 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gcc \- \s-1GNU\s0 project C and \*(C+ compiler diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info gcc-3.2.3/gcc/doc/gcc.info *** gcc-3.2.2/gcc/doc/gcc.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,265 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + Indirect: + gcc.info-1: 1225 + gcc.info-2: 46116 + gcc.info-3: 79123 + gcc.info-4: 112372 + gcc.info-5: 161065 + gcc.info-6: 194212 + gcc.info-7: 240279 + gcc.info-8: 286354 + gcc.info-9: 335494 + gcc.info-10: 372165 + gcc.info-11: 421193 + gcc.info-12: 462678 + gcc.info-13: 510634 + gcc.info-14: 554468 + gcc.info-15: 603958 + gcc.info-16: 613610 + gcc.info-17: 670545 + gcc.info-18: 719787 + gcc.info-19: 761299 + gcc.info-20: 804819 + gcc.info-21: 854438 + gcc.info-22: 899250 + gcc.info-23: 969159 +  + Tag Table: + (Indirect) + Node: Top1225 + Node: G++ and GCC2941 + Node: Standards5494 + Node: Invoking GCC12730 + Node: Option Summary16379 + Node: Overall Options37807 + Node: Invoking G++44670 + Node: C Dialect Options46116 + Node: C++ Dialect Options59639 + Node: Objective-C Dialect Options75711 + Node: Language Independent Options77335 + Node: Warning Options79123 + Node: Debugging Options112372 + Node: Optimize Options131328 + Node: Preprocessor Options161065 + Ref: -MF167647 + Node: Assembler Options180438 + Node: Link Options180805 + Ref: Link Options-Footnote-1188884 + Node: Directory Options189220 + Node: Spec Files194212 + Node: Target Options211719 + Node: Submodel Options215706 + Node: M680x0 Options217488 + Node: M68hc1x Options223496 + Node: VAX Options224677 + Node: SPARC Options225213 + Node: Convex Options234702 + Node: AMD29K Options236883 + Node: ARM Options240279 + Node: MN10200 Options252800 + Node: MN10300 Options253322 + Node: M32R/D Options254373 + Node: M88K Options256832 + Node: RS/6000 and PowerPC Options264756 + Node: RT Options284651 + Node: MIPS Options286354 + Node: i386 and x86-64 Options298035 + Node: HPPA Options312613 + Node: Intel 960 Options316689 + Node: DEC Alpha Options319632 + Node: DEC Alpha/VMS Options330649 + Node: Clipper Options331027 + Node: H8/300 Options331431 + Node: SH Options332360 + Node: System V Options334676 + Node: TMS320C3x/C4x Options335494 + Node: V850 Options341007 + Node: ARC Options343016 + Node: NS32K Options344218 + Node: AVR Options348468 + Node: MCore Options350269 + Node: IA-64 Options351413 + Node: D30V Options353801 + Node: S/390 and zSeries Options355044 + Node: CRIS Options356978 + Node: MMIX Options361012 + Node: PDP-11 Options363352 + Node: Xstormy16 Options365178 + Node: Xtensa Options365454 + Node: Code Gen Options372165 + Node: Environment Variables387980 + Ref: DEPENDENCIES_OUTPUT394297 + Node: Running Protoize395357 + Node: C Implementation401714 + Node: Translation implementation402648 + Node: Environment implementation403016 + Node: Identifiers implementation403309 + Node: Characters implementation403712 + Node: Integers implementation405569 + Node: Floating point implementation406421 + Node: Arrays and pointers implementation408270 + Ref: Arrays and pointers implementation-Footnote-1409573 + Node: Hints implementation409699 + Node: Structures unions enumerations and bit-fields implementation410128 + Node: Qualifiers implementation410937 + Node: Preprocessing directives implementation411248 + Node: Library functions implementation412865 + Node: Architecture implementation413190 + Node: Locale-specific behavior implementation413755 + Node: C Extensions414053 + Node: Statement Exprs418139 + Node: Local Labels421193 + Node: Labels as Values423258 + Ref: Labels as Values-Footnote-1425317 + Node: Nested Functions425502 + Node: Constructing Calls429340 + Node: Typeof431421 + Node: Lvalues434597 + Node: Conditionals437037 + Node: Long Long437928 + Node: Complex439427 + Node: Hex Floats442095 + Node: Zero Length443124 + Node: Variable Length446168 + Node: Variadic Macros448930 + Node: Escaped Newlines451320 + Node: Multi-line Strings452203 + Node: Subscripting452807 + Node: Pointer Arith453535 + Node: Initializers454100 + Node: Compound Literals454583 + Node: Designated Inits456746 + Node: Case Ranges460420 + Node: Cast to Union461100 + Node: Mixed Declarations462183 + Node: Function Attributes462678 + Node: Attribute Syntax484657 + Node: Function Prototypes495034 + Node: C++ Comments496827 + Node: Dollar Signs497422 + Node: Character Escapes497880 + Node: Alignment498167 + Node: Variable Attributes499487 + Node: Type Attributes510634 + Node: Inline521165 + Node: Extended Asm525874 + Node: Constraints542991 + Node: Simple Constraints543834 + Node: Multi-Alternative550324 + Node: Modifiers552035 + Node: Machine Constraints554468 + Node: Asm Labels571062 + Node: Explicit Reg Vars572738 + Node: Global Reg Vars574192 + Node: Local Reg Vars578757 + Node: Alternate Keywords580557 + Node: Incomplete Enums582244 + Node: Function Names583000 + Node: Return Address585437 + Node: Vector Extensions588016 + Node: Other Builtins590901 + Node: Target Builtins603457 + Node: X86 Built-in Functions603958 + Node: PowerPC AltiVec Built-in Functions613610 + Node: Pragmas670545 + Node: ARM Pragmas671011 + Node: Darwin Pragmas671605 + Node: Solaris Pragmas672644 + Node: Tru64 Pragmas673207 + Node: Unnamed Fields673948 + Node: C++ Extensions675019 + Node: Min and Max676580 + Node: Volatiles677964 + Node: Restricted Pointers681334 + Node: Vague Linkage682904 + Node: C++ Interface686563 + Ref: C++ Interface-Footnote-1691651 + Node: Template Instantiation691790 + Node: Bound member functions700621 + Node: C++ Attributes702172 + Node: Java Exceptions703777 + Node: Deprecated Features705174 + Node: Backwards Compatibility707140 + Node: Objective-C708488 + Node: Executing code before main709067 + Node: What you can and what you cannot do in +load711705 + Node: Type encoding713871 + Node: Garbage Collection717123 + Node: Constant string objects719787 + Node: compatibility_alias721421 + Node: Compatibility722300 + Node: Gcov728887 + Node: Gcov Intro729356 + Node: Invoking Gcov732031 + Node: Gcov and Optimization738105 + Node: Gcov Data Files739522 + Node: Trouble743087 + Node: Actual Bugs744681 + Node: Cross-Compiler Problems745589 + Node: Interoperation747099 + Node: External Bugs759807 + Node: Incompatibilities761299 + Node: Fixed Headers770907 + Node: Standard Libraries773216 + Node: Disappointments774586 + Node: C++ Misunderstandings779308 + Node: Static Definitions780034 + Node: Temporaries781081 + Node: Copy Assignment783058 + Node: Protoize Caveats784876 + Node: Non-bugs788831 + Node: Warnings and Errors798723 + Node: Bugs800483 + Node: Bug Criteria801836 + Node: Bug Lists804260 + Node: Bug Reporting804819 + Node: gccbug816922 + Node: Service817742 + Node: Contributing818488 + Node: VMS819227 + Node: Include Files and VMS819609 + Node: Global Declarations823474 + Node: VMS Misc827778 + Node: Funding832081 + Node: GNU Project834576 + Node: Copying835227 + Node: GNU Free Documentation License854438 + Node: Contributors874322 + Node: Option Index899250 + Node: Index969159 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-1 gcc-3.2.3/gcc/doc/gcc.info-1 *** gcc-3.2.2/gcc/doc/gcc.info-1 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-1 Tue Apr 22 07:07:13 2003 *************** *** 0 **** --- 1,1071 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Top, Next: G++ and GCC, Up: (DIR) + + Introduction + ************ + + This manual documents how to use the GNU compilers, as well as their + features and incompatibilities, and how to report bugs. It corresponds + to GCC version 3.2.3. The internals of the GNU compilers, including + how to port them to new targets and some information about how to write + front ends for new languages, are documented in a separate manual. + *Note Introduction: (gccint)Top. + + * Menu: + + * G++ and GCC:: You can compile C or C++ programs. + * Standards:: Language standards supported by GCC. + * Invoking GCC:: Command options supported by `gcc'. + * C Implementation:: How GCC implements the ISO C specification. + * C Extensions:: GNU extensions to the C language family. + * C++ Extensions:: GNU extensions to the C++ language. + * Objective-C:: GNU Objective-C runtime features. + * Compatibility:: Binary Compatibility + * Gcov:: `gcov'---a test coverage program. + * Trouble:: If you have trouble using GCC. + * Bugs:: How, why and where to report bugs. + * Service:: How to find suppliers of support for GCC. + * Contributing:: How to contribute to testing and developing GCC. + * VMS:: Using GCC on VMS. + + * Funding:: How to help assure funding for free software. + * GNU Project:: The GNU Project and GNU/Linux. + + * Copying:: GNU General Public License says + how you can copy and share GCC. + * GNU Free Documentation License:: How you can copy and share this manual. + * Contributors:: People who have contributed to GCC. + + * Option Index:: Index to command line options. + * Index:: Index of concepts and symbol names. + +  + File: gcc.info, Node: G++ and GCC, Next: Standards, Prev: Top, Up: Top + + Compile C, C++, Objective-C, Ada, Fortran, or Java + ************************************************** + + Several versions of the compiler (C, C++, Objective-C, Ada, Fortran, + and Java) are integrated; this is why we use the name "GNU Compiler + Collection". GCC can compile programs written in any of these + languages. The Ada, Fortran, and Java compilers are described in + separate manuals. + + "GCC" is a common shorthand term for the GNU Compiler Collection. + This is both the most general name for the compiler, and the name used + when the emphasis is on compiling C programs (as the abbreviation + formerly stood for "GNU C Compiler"). + + When referring to C++ compilation, it is usual to call the compiler + "G++". Since there is only one compiler, it is also accurate to call + it "GCC" no matter what the language context; however, the term "G++" + is more useful when the emphasis is on compiling C++ programs. + + Similarly, when we talk about Ada compilation, we usually call the + compiler "GNAT", for the same reasons. + + We use the name "GCC" to refer to the compilation system as a whole, + and more specifically to the language-independent part of the compiler. + For example, we refer to the optimization options as affecting the + behavior of "GCC" or sometimes just "the compiler". + + Front ends for other languages, such as Mercury and Pascal exist but + have not yet been integrated into GCC. These front ends, like that for + C++, are built in subdirectories of GCC and link to it. The result is + an integrated compiler that can compile programs written in C, C++, + Objective-C, or any of the languages for which you have installed front + ends. + + In this manual, we only discuss the options for the C, Objective-C, + and C++ compilers and those of the GCC core. Consult the documentation + of the other front ends for the options to use when compiling programs + written in other languages. + + G++ is a _compiler_, not merely a preprocessor. G++ builds object + code directly from your C++ program source. There is no intermediate C + version of the program. (By contrast, for example, some other + implementations use a program that generates a C program from your C++ + source.) Avoiding an intermediate C representation of the program means + that you get better object code, and better debugging information. The + GNU debugger, GDB, works with this information in the object code to + give you comprehensive C++ source-level editing capabilities (*note C + and C++: (gdb.info)C.). + +  + File: gcc.info, Node: Standards, Next: Invoking GCC, Prev: G++ and GCC, Up: Top + + Language Standards Supported by GCC + *********************************** + + For each language compiled by GCC for which there is a standard, GCC + attempts to follow one or more versions of that standard, possibly with + some exceptions, and possibly with some extensions. + + GCC supports three versions of the C standard, although support for + the most recent version is not yet complete. + + The original ANSI C standard (X3.159-1989) was ratified in 1989 and + published in 1990. This standard was ratified as an ISO standard + (ISO/IEC 9899:1990) later in 1990. There were no technical differences + between these publications, although the sections of the ANSI standard + were renumbered and became clauses in the ISO standard. This standard, + in both its forms, is commonly known as "C89", or occasionally as + "C90", from the dates of ratification. The ANSI standard, but not the + ISO standard, also came with a Rationale document. To select this + standard in GCC, use one of the options `-ansi', `-std=c89' or + `-std=iso9899:1990'; to obtain all the diagnostics required by the + standard, you should also specify `-pedantic' (or `-pedantic-errors' if + you want them to be errors rather than warnings). *Note Options + Controlling C Dialect: C Dialect Options. + + Errors in the 1990 ISO C standard were corrected in two Technical + Corrigenda published in 1994 and 1996. GCC does not support the + uncorrected version. + + An amendment to the 1990 standard was published in 1995. This + amendment added digraphs and `__STDC_VERSION__' to the language, but + otherwise concerned the library. This amendment is commonly known as + "AMD1"; the amended standard is sometimes known as "C94" or "C95". To + select this standard in GCC, use the option `-std=iso9899:199409' + (with, as for other standard versions, `-pedantic' to receive all + required diagnostics). + + A new edition of the ISO C standard was published in 1999 as ISO/IEC + 9899:1999, and is commonly known as "C99". GCC has incomplete support + for this standard version; see + `http://gcc.gnu.org/gcc-3.1/c99status.html' for details. To select this + standard, use `-std=c99' or `-std=iso9899:1999'. (While in + development, drafts of this standard version were referred to as "C9X".) + + Errors in the 1999 ISO C standard were corrected in a Technical + Corrigendum published in 2001. GCC does not support the uncorrected + version. + + GCC also has some limited support for traditional (pre-ISO) C with + the `-traditional' option. This support may be of use for compiling + some very old programs that have not been updated to ISO C, but should + not be used for new programs. It will not work with some modern C + libraries such as the GNU C library. + + By default, GCC provides some extensions to the C language that on + rare occasions conflict with the C standard. *Note Extensions to the C + Language Family: C Extensions. Use of the `-std' options listed above + will disable these extensions where they conflict with the C standard + version selected. You may also select an extended version of the C + language explicitly with `-std=gnu89' (for C89 with GNU extensions) or + `-std=gnu99' (for C99 with GNU extensions). The default, if no C + language dialect options are given, is `-std=gnu89'; this will change to + `-std=gnu99' in some future release when the C99 support is complete. + Some features that are part of the C99 standard are accepted as + extensions in C89 mode. + + The ISO C standard defines (in clause 4) two classes of conforming + implementation. A "conforming hosted implementation" supports the + whole standard including all the library facilities; a "conforming + freestanding implementation" is only required to provide certain + library facilities: those in `', `', `', + and `'; since AMD1, also those in `'; and in C99, + also those in `' and `'. In addition, complex + types, added in C99, are not required for freestanding implementations. + The standard also defines two environments for programs, a + "freestanding environment", required of all implementations and which + may not have library facilities beyond those required of freestanding + implementations, where the handling of program startup and termination + are implementation-defined, and a "hosted environment", which is not + required, in which all the library facilities are provided and startup + is through a function `int main (void)' or `int main (int, char *[])'. + An OS kernel would be a freestanding environment; a program using the + facilities of an operating system would normally be in a hosted + implementation. + + GCC aims towards being usable as a conforming freestanding + implementation, or as the compiler for a conforming hosted + implementation. By default, it will act as the compiler for a hosted + implementation, defining `__STDC_HOSTED__' as `1' and presuming that + when the names of ISO C functions are used, they have the semantics + defined in the standard. To make it act as a conforming freestanding + implementation for a freestanding environment, use the option + `-ffreestanding'; it will then define `__STDC_HOSTED__' to `0' and not + make assumptions about the meanings of function names from the standard + library, with exceptions noted below. To build an OS kernel, you may + well still need to make your own arrangements for linking and startup. + *Note Options Controlling C Dialect: C Dialect Options. + + GCC does not provide the library facilities required only of hosted + implementations, nor yet all the facilities required by C99 of + freestanding implementations; to use the facilities of a hosted + environment, you will need to find them elsewhere (for example, in the + GNU C library). *Note Standard Libraries: Standard Libraries. + + Most of the compiler support routines used by GCC are present in + `libgcc', but there are a few exceptions. GCC requires the + freestanding environment provide `memcpy', `memmove', `memset' and + `memcmp'. Some older ports of GCC are configured to use the BSD + `bcopy', `bzero' and `bcmp' functions instead, but this is deprecated + for new ports. Finally, if `__builtin_trap' is used, and the target + does not implement the `trap' pattern, then GCC will emit a call to + `abort'. + + For references to Technical Corrigenda, Rationale documents and + information concerning the history of C that is available online, see + `http://gcc.gnu.org/readings.html' + + There is no formal written standard for Objective-C. The most + authoritative manual is "Object-Oriented Programming and the + Objective-C Language", available at a number of web sites + + * `http://developer.apple.com/techpubs/macosx/Cocoa/ObjectiveC/' is + a recent version + + * `http://www.toodarkpark.org/computers/objc/' is an older example + + * `http://www.gnustep.org' has additional useful information + + *Note GNAT Reference Manual: (gnat_rm)Top, for information on + standard conformance and compatibility of the Ada compiler. + + *Note The GNU Fortran Language: (g77)Language, for details of the + Fortran language supported by GCC. + + *Note Compatibility with the Java Platform: (gcj)Compatibility, for + details of compatibility between `gcj' and the Java Platform. + +  + File: gcc.info, Node: Invoking GCC, Next: C Implementation, Prev: Standards, Up: Top + + GCC Command Options + ******************* + + When you invoke GCC, it normally does preprocessing, compilation, + assembly and linking. The "overall options" allow you to stop this + process at an intermediate stage. For example, the `-c' option says + not to run the linker. Then the output consists of object files output + by the assembler. + + Other options are passed on to one stage of processing. Some options + control the preprocessor and others the compiler itself. Yet other + options control the assembler and linker; most of these are not + documented here, since you rarely need to use any of them. + + Most of the command line options that you can use with GCC are useful + for C programs; when an option is only useful with another language + (usually C++), the explanation says so explicitly. If the description + for a particular option does not mention a source language, you can use + that option with all supported languages. + + *Note Compiling C++ Programs: Invoking G++, for a summary of special + options for compiling C++ programs. + + The `gcc' program accepts options and file names as operands. Many + options have multi-letter names; therefore multiple single-letter + options may _not_ be grouped: `-dr' is very different from `-d -r'. + + You can mix options and other arguments. For the most part, the + order you use doesn't matter. Order does matter when you use several + options of the same kind; for example, if you specify `-L' more than + once, the directories are searched in the order specified. + + Many options have long names starting with `-f' or with `-W'--for + example, `-fforce-mem', `-fstrength-reduce', `-Wformat' and so on. + Most of these have both positive and negative forms; the negative form + of `-ffoo' would be `-fno-foo'. This manual documents only one of + these two forms, whichever one is not the default. + + *Note Option Index::, for an index to GCC's options. + + * Menu: + + * Option Summary:: Brief list of all options, without explanations. + * Overall Options:: Controlling the kind of output: + an executable, object files, assembler files, + or preprocessed source. + * Invoking G++:: Compiling C++ programs. + * C Dialect Options:: Controlling the variant of C language compiled. + * C++ Dialect Options:: Variations on C++. + * Objective-C Dialect Options:: Variations on Objective-C. + * Language Independent Options:: Controlling how diagnostics should be + formatted. + * Warning Options:: How picky should the compiler be? + * Debugging Options:: Symbol tables, measurements, and debugging dumps. + * Optimize Options:: How much optimization? + * Preprocessor Options:: Controlling header files and macro definitions. + Also, getting dependency information for Make. + * Assembler Options:: Passing options to the assembler. + * Link Options:: Specifying libraries and so on. + * Directory Options:: Where to find header files and libraries. + Where to find the compiler executable files. + * Spec Files:: How to pass switches to sub-processes. + * Target Options:: Running a cross-compiler, or an old version of GCC. + * Submodel Options:: Specifying minor hardware or convention variations, + such as 68010 vs 68020. + * Code Gen Options:: Specifying conventions for function calls, data layout + and register usage. + * Environment Variables:: Env vars that affect GCC. + * Running Protoize:: Automatically adding or removing function prototypes. + +  + File: gcc.info, Node: Option Summary, Next: Overall Options, Up: Invoking GCC + + Option Summary + ============== + + Here is a summary of all the options, grouped by type. Explanations + are in the following sections. + + _Overall Options_ + *Note Options Controlling the Kind of Output: Overall Options. + -c -S -E -o FILE -pipe -pass-exit-codes -x LANGUAGE + -v -### --help --target-help --version + + _C Language Options_ + *Note Options Controlling C Dialect: C Dialect Options. + -ansi -std=STANDARD -aux-info FILENAME + -fno-asm -fno-builtin -fno-builtin-FUNCTION + -fhosted -ffreestanding + -trigraphs -no-integrated-cpp -traditional -traditional-cpp + -fallow-single-precision -fcond-mismatch + -fsigned-bitfields -fsigned-char + -funsigned-bitfields -funsigned-char + -fwritable-strings + + _C++ Language Options_ + *Note Options Controlling C++ Dialect: C++ Dialect Options. + -fno-access-control -fcheck-new -fconserve-space + -fno-const-strings -fdollars-in-identifiers + -fno-elide-constructors + -fno-enforce-eh-specs -fexternal-templates + -falt-external-templates + -ffor-scope -fno-for-scope -fno-gnu-keywords + -fno-implicit-templates + -fno-implicit-inline-templates + -fno-implement-inlines -fms-extensions + -fno-nonansi-builtins -fno-operator-names + -fno-optional-diags -fpermissive + -frepo -fno-rtti -fstats -ftemplate-depth-N + -fuse-cxa-atexit -fvtable-gc -fno-weak -nostdinc++ + -fno-default-inline -Wabi -Wctor-dtor-privacy + -Wnon-virtual-dtor -Wreorder + -Weffc++ -Wno-deprecated + -Wno-non-template-friend -Wold-style-cast + -Woverloaded-virtual -Wno-pmf-conversions + -Wsign-promo -Wsynth + + _Objective-C Language Options_ + *Note Options Controlling Objective-C Dialect: Objective-C Dialect + Options. + -fconstant-string-class=CLASS-NAME + -fgnu-runtime -fnext-runtime -gen-decls + -Wno-protocol -Wselector + + _Language Independent Options_ + *Note Options to Control Diagnostic Messages Formatting: Language + Independent Options. + -fmessage-length=N + -fdiagnostics-show-location=[once|every-line] + + _Warning Options_ + *Note Options to Request or Suppress Warnings: Warning Options. + -fsyntax-only -pedantic -pedantic-errors + -w -W -Wall -Waggregate-return + -Wcast-align -Wcast-qual -Wchar-subscripts -Wcomment + -Wconversion -Wno-deprecated-declarations + -Wdisabled-optimization -Wdiv-by-zero -Werror + -Wfloat-equal -Wformat -Wformat=2 + -Wformat-nonliteral -Wformat-security + -Wimplicit -Wimplicit-int + -Wimplicit-function-declaration + -Werror-implicit-function-declaration + -Wimport -Winline + -Wlarger-than-LEN -Wlong-long + -Wmain -Wmissing-braces + -Wmissing-format-attribute -Wmissing-noreturn + -Wmultichar -Wno-format-extra-args -Wno-format-y2k + -Wno-import -Wpacked -Wpadded + -Wparentheses -Wpointer-arith -Wredundant-decls + -Wreturn-type -Wsequence-point -Wshadow + -Wsign-compare -Wswitch -Wsystem-headers + -Wtrigraphs -Wundef -Wuninitialized + -Wunknown-pragmas -Wunreachable-code + -Wunused -Wunused-function -Wunused-label -Wunused-parameter + -Wunused-value -Wunused-variable -Wwrite-strings + + _C-only Warning Options_ + -Wbad-function-cast -Wmissing-declarations + -Wmissing-prototypes -Wnested-externs + -Wstrict-prototypes -Wtraditional + + _Debugging Options_ + *Note Options for Debugging Your Program or GCC: Debugging Options. + -dLETTERS -dumpspecs -dumpmachine -dumpversion + -fdump-unnumbered -fdump-translation-unit[-N] + -fdump-class-hierarchy[-N] + -fdump-tree-original[-N] -fdump-tree-optimized[-N] + -fdump-tree-inlined[-N] + -fmem-report -fpretend-float + -fprofile-arcs -fsched-verbose=N + -ftest-coverage -ftime-report + -g -gLEVEL -gcoff -gdwarf -gdwarf-1 -gdwarf-1+ -gdwarf-2 + -ggdb -gstabs -gstabs+ -gvms -gxcoff -gxcoff+ + -p -pg -print-file-name=LIBRARY -print-libgcc-file-name + -print-multi-directory -print-multi-lib + -print-prog-name=PROGRAM -print-search-dirs -Q + -save-temps -time + + _Optimization Options_ + *Note Options that Control Optimization: Optimize Options. + -falign-functions=N -falign-jumps=N + -falign-labels=N -falign-loops=N + -fbounds-check + -fbranch-probabilities -fcaller-saves -fcprop-registers + -fcse-follow-jumps -fcse-skip-blocks -fdata-sections + -fdelayed-branch -fdelete-null-pointer-checks + -fexpensive-optimizations -ffast-math -ffloat-store + -fforce-addr -fforce-mem -ffunction-sections + -fgcse -fgcse-lm -fgcse-sm + -finline-functions -finline-limit=N -fkeep-inline-functions + -fkeep-static-consts -fmerge-constants -fmerge-all-constants + -fmove-all-movables -fno-branch-count-reg + -fno-default-inline -fno-defer-pop + -fno-function-cse -fno-guess-branch-probability + -fno-inline -fno-math-errno -fno-peephole -fno-peephole2 + -funsafe-math-optimizations -fno-trapping-math + -fomit-frame-pointer -foptimize-register-move + -foptimize-sibling-calls -fprefetch-loop-arrays + -freduce-all-givs -fregmove -frename-registers + -frerun-cse-after-loop -frerun-loop-opt + -fschedule-insns -fschedule-insns2 + -fno-sched-interblock -fno-sched-spec + -fsched-spec-load -fsched-spec-load-dangerous + -fsingle-precision-constant -fssa -fssa-ccp -fssa-dce + -fstrength-reduce -fstrict-aliasing -fthread-jumps + -ftrapv -funroll-all-loops -funroll-loops + --param NAME=VALUE + -O -O0 -O1 -O2 -O3 -Os + + _Preprocessor Options_ + *Note Options Controlling the Preprocessor: Preprocessor Options. + -$ -AQUESTION=ANSWER -A-QUESTION[=ANSWER] + -C -dD -dI -dM -dN + -DMACRO[=DEFN] -E -H + -idirafter DIR + -include FILE -imacros FILE + -iprefix FILE -iwithprefix DIR + -iwithprefixbefore DIR -isystem DIR + -M -MM -MF -MG -MP -MQ -MT -nostdinc -P -remap + -trigraphs -undef -UMACRO -Wp,OPTION + + _Assembler Option_ + *Note Passing Options to the Assembler: Assembler Options. + -Wa,OPTION + + _Linker Options_ + *Note Options for Linking: Link Options. + OBJECT-FILE-NAME -lLIBRARY + -nostartfiles -nodefaultlibs -nostdlib + -s -static -static-libgcc -shared -shared-libgcc -symbolic + -Wl,OPTION -Xlinker OPTION + -u SYMBOL + + _Directory Options_ + *Note Options for Directory Search: Directory Options. + -BPREFIX -IDIR -I- -LDIR -specs=FILE + + _Target Options_ + *Note Target Options::. + -b MACHINE -V VERSION + + _Machine Dependent Options_ + *Note Hardware Models and Configurations: Submodel Options. + + _M680x0 Options_ + -m68000 -m68020 -m68020-40 -m68020-60 -m68030 -m68040 + -m68060 -mcpu32 -m5200 -m68881 -mbitfield -mc68000 -mc68020 + -mfpa -mnobitfield -mrtd -mshort -msoft-float -mpcrel + -malign-int -mstrict-align + + _M68hc1x Options_ + -m6811 -m6812 -m68hc11 -m68hc12 + -mauto-incdec -mshort -msoft-reg-count=COUNT + + _VAX Options_ + -mg -mgnu -munix + + _SPARC Options_ + -mcpu=CPU-TYPE + -mtune=CPU-TYPE + -mcmodel=CODE-MODEL + -m32 -m64 + -mapp-regs -mbroken-saverestore -mcypress + -mfaster-structs -mflat + -mfpu -mhard-float -mhard-quad-float + -mimpure-text -mlive-g0 -mno-app-regs + -mno-faster-structs -mno-flat -mno-fpu + -mno-impure-text -mno-stack-bias -mno-unaligned-doubles + -msoft-float -msoft-quad-float -msparclite -mstack-bias + -msupersparc -munaligned-doubles -mv8 + + _Convex Options_ + -mc1 -mc2 -mc32 -mc34 -mc38 + -margcount -mnoargcount + -mlong32 -mlong64 + -mvolatile-cache -mvolatile-nocache + + _AMD29K Options_ + -m29000 -m29050 -mbw -mnbw -mdw -mndw + -mlarge -mnormal -msmall + -mkernel-registers -mno-reuse-arg-regs + -mno-stack-check -mno-storem-bug + -mreuse-arg-regs -msoft-float -mstack-check + -mstorem-bug -muser-registers + + _ARM Options_ + -mapcs-frame -mno-apcs-frame + -mapcs-26 -mapcs-32 + -mapcs-stack-check -mno-apcs-stack-check + -mapcs-float -mno-apcs-float + -mapcs-reentrant -mno-apcs-reentrant + -msched-prolog -mno-sched-prolog + -mlittle-endian -mbig-endian -mwords-little-endian + -malignment-traps -mno-alignment-traps + -msoft-float -mhard-float -mfpe + -mthumb-interwork -mno-thumb-interwork + -mcpu=NAME -march=NAME -mfpe=NAME + -mstructure-size-boundary=N + -mbsd -mxopen -mno-symrename + -mabort-on-noreturn + -mlong-calls -mno-long-calls + -msingle-pic-base -mno-single-pic-base + -mpic-register=REG + -mnop-fun-dllimport + -mpoke-function-name + -mthumb -marm + -mtpcs-frame -mtpcs-leaf-frame + -mcaller-super-interworking -mcallee-super-interworking + + _MN10200 Options_ + -mrelax + + _MN10300 Options_ + -mmult-bug -mno-mult-bug + -mam33 -mno-am33 + -mno-crt0 -mrelax + + _M32R/D Options_ + -m32rx -m32r -mcode-model=MODEL-TYPE -msdata=SDATA-TYPE + -G NUM + + _M88K Options_ + -m88000 -m88100 -m88110 -mbig-pic + -mcheck-zero-division -mhandle-large-shift + -midentify-revision -mno-check-zero-division + -mno-ocs-debug-info -mno-ocs-frame-position + -mno-optimize-arg-area -mno-serialize-volatile + -mno-underscores -mocs-debug-info + -mocs-frame-position -moptimize-arg-area + -mserialize-volatile -mshort-data-NUM -msvr3 + -msvr4 -mtrap-large-shift -muse-div-instruction + -mversion-03.00 -mwarn-passed-structs + + _RS/6000 and PowerPC Options_ + -mcpu=CPU-TYPE + -mtune=CPU-TYPE + -mpower -mno-power -mpower2 -mno-power2 + -mpowerpc -mpowerpc64 -mno-powerpc + -maltivec -mno-altivec + -mpowerpc-gpopt -mno-powerpc-gpopt + -mpowerpc-gfxopt -mno-powerpc-gfxopt + -mnew-mnemonics -mold-mnemonics + -mfull-toc -mminimal-toc -mno-fp-in-toc -mno-sum-in-toc + -m64 -m32 -mxl-call -mno-xl-call -mpe + -msoft-float -mhard-float -mmultiple -mno-multiple + -mstring -mno-string -mupdate -mno-update + -mfused-madd -mno-fused-madd -mbit-align -mno-bit-align + -mstrict-align -mno-strict-align -mrelocatable + -mno-relocatable -mrelocatable-lib -mno-relocatable-lib + -mtoc -mno-toc -mlittle -mlittle-endian -mbig -mbig-endian + -mcall-aix -mcall-sysv -mcall-netbsd + -maix-struct-return -msvr4-struct-return + -mabi=altivec -mabi=no-altivec + -mprototype -mno-prototype + -msim -mmvme -mads -myellowknife -memb -msdata + -msdata=OPT -mvxworks -G NUM -pthread + + _RT Options_ + -mcall-lib-mul -mfp-arg-in-fpregs -mfp-arg-in-gregs + -mfull-fp-blocks -mhc-struct-return -min-line-mul + -mminimum-fp-blocks -mnohc-struct-return + + _MIPS Options_ + -mabicalls -march=CPU-TYPE -mtune=CPU=TYPE + -mcpu=CPU-TYPE -membedded-data -muninit-const-in-rodata + -membedded-pic -mfp32 -mfp64 -mfused-madd -mno-fused-madd + -mgas -mgp32 -mgp64 + -mgpopt -mhalf-pic -mhard-float -mint64 -mips1 + -mips2 -mips3 -mips4 -mlong64 -mlong32 -mlong-calls -mmemcpy + -mmips-as -mmips-tfile -mno-abicalls + -mno-embedded-data -mno-uninit-const-in-rodata + -mno-embedded-pic -mno-gpopt -mno-long-calls + -mno-memcpy -mno-mips-tfile -mno-rnames -mno-stats + -mrnames -msoft-float + -m4650 -msingle-float -mmad + -mstats -EL -EB -G NUM -nocpp + -mabi=32 -mabi=n32 -mabi=64 -mabi=eabi + -mfix7000 -mno-crt0 -mflush-func=FUNC -mno-flush-func + + _i386 and x86-64 Options_ + -mcpu=CPU-TYPE -march=CPU-TYPE -mfpmath=UNIT + -masm=DIALECT -mno-fancy-math-387 + -mno-fp-ret-in-387 -msoft-float -msvr3-shlib + -mno-wide-multiply -mrtd -malign-double + -mpreferred-stack-boundary=NUM + -mmmx -msse -msse2 -m3dnow + -mthreads -mno-align-stringops -minline-all-stringops + -mpush-args -maccumulate-outgoing-args -m128bit-long-double + -m96bit-long-double -mregparm=NUM -momit-leaf-frame-pointer + -mno-red-zone + -mcmodel=CODE-MODEL + -m32 -m64 + + _HPPA Options_ + -march=ARCHITECTURE-TYPE + -mbig-switch -mdisable-fpregs -mdisable-indexing + -mfast-indirect-calls -mgas -mjump-in-delay + -mlong-load-store -mno-big-switch -mno-disable-fpregs + -mno-disable-indexing -mno-fast-indirect-calls -mno-gas + -mno-jump-in-delay -mno-long-load-store + -mno-portable-runtime -mno-soft-float + -mno-space-regs -msoft-float -mpa-risc-1-0 + -mpa-risc-1-1 -mpa-risc-2-0 -mportable-runtime + -mschedule=CPU-TYPE -mspace-regs + + _Intel 960 Options_ + -mCPU-TYPE -masm-compat -mclean-linkage + -mcode-align -mcomplex-addr -mleaf-procedures + -mic-compat -mic2.0-compat -mic3.0-compat + -mintel-asm -mno-clean-linkage -mno-code-align + -mno-complex-addr -mno-leaf-procedures + -mno-old-align -mno-strict-align -mno-tail-call + -mnumerics -mold-align -msoft-float -mstrict-align + -mtail-call + + _DEC Alpha Options_ + -mno-fp-regs -msoft-float -malpha-as -mgas + -mieee -mieee-with-inexact -mieee-conformant + -mfp-trap-mode=MODE -mfp-rounding-mode=MODE + -mtrap-precision=MODE -mbuild-constants + -mcpu=CPU-TYPE -mtune=CPU-TYPE + -mbwx -mmax -mfix -mcix + -mfloat-vax -mfloat-ieee + -mexplicit-relocs -msmall-data -mlarge-data + -mmemory-latency=TIME + + _DEC Alpha/VMS Options_ + -mvms-return-codes + + _Clipper Options_ + -mc300 -mc400 + + _H8/300 Options_ + -mrelax -mh -ms -mint32 -malign-300 + + _SH Options_ + -m1 -m2 -m3 -m3e + -m4-nofpu -m4-single-only -m4-single -m4 + -m5-64media -m5-64media-nofpu + -m5-32media -m5-32media-nofpu + -m5-compact -m5-compact-nofpu + -mb -ml -mdalign -mrelax + -mbigtable -mfmovd -mhitachi -mnomacsave + -mieee -misize -mpadstruct -mspace + -mprefergot -musermode + + _System V Options_ + -Qy -Qn -YP,PATHS -Ym,DIR + + _ARC Options_ + -EB -EL + -mmangle-cpu -mcpu=CPU -mtext=TEXT-SECTION + -mdata=DATA-SECTION -mrodata=READONLY-DATA-SECTION + + _TMS320C3x/C4x Options_ + -mcpu=CPU -mbig -msmall -mregparm -mmemparm + -mfast-fix -mmpyi -mbk -mti -mdp-isr-reload + -mrpts=COUNT -mrptb -mdb -mloop-unsigned + -mparallel-insns -mparallel-mpy -mpreserve-float + + _V850 Options_ + -mlong-calls -mno-long-calls -mep -mno-ep + -mprolog-function -mno-prolog-function -mspace + -mtda=N -msda=N -mzda=N + -mv850 -mbig-switch + + _NS32K Options_ + -m32032 -m32332 -m32532 -m32081 -m32381 + -mmult-add -mnomult-add -msoft-float -mrtd -mnortd + -mregparam -mnoregparam -msb -mnosb + -mbitfield -mnobitfield -mhimem -mnohimem + + _AVR Options_ + -mmcu=MCU -msize -minit-stack=N -mno-interrupts + -mcall-prologues -mno-tablejump -mtiny-stack + + _MCore Options_ + -mhardlit -mno-hardlit -mdiv -mno-div -mrelax-immediates + -mno-relax-immediates -mwide-bitfields -mno-wide-bitfields + -m4byte-functions -mno-4byte-functions -mcallgraph-data + -mno-callgraph-data -mslow-bytes -mno-slow-bytes -mno-lsim + -mlittle-endian -mbig-endian -m210 -m340 -mstack-increment + + _MMIX Options_ + -mlibfuncs -mno-libfuncs -mepsilon -mno-epsilon -mabi=gnu + -mabi=mmixware -mzero-extend -mknuthdiv -mtoplevel-symbols + -melf -mbranch-predict -mno-branch-predict -mbase-addresses + -mno-base-addresses + + _IA-64 Options_ + -mbig-endian -mlittle-endian -mgnu-as -mgnu-ld -mno-pic + -mvolatile-asm-stop -mb-step -mregister-names -mno-sdata + -mconstant-gp -mauto-pic -minline-divide-min-latency + -minline-divide-max-throughput -mno-dwarf2-asm + -mfixed-range=REGISTER-RANGE + + _D30V Options_ + -mextmem -mextmemory -monchip -mno-asm-optimize + -masm-optimize -mbranch-cost=N -mcond-exec=N + + _S/390 and zSeries Options_ + -mhard-float -msoft-float -mbackchain -mno-backchain + -msmall-exec -mno-small-exec -mmvcle -mno-mvcle + -m64 -m31 -mdebug -mno-debug + + _CRIS Options_ + -mcpu=CPU -march=CPU -mtune=CPU + -mmax-stack-frame=N -melinux-stacksize=N + -metrax4 -metrax100 -mpdebug -mcc-init -mno-side-effects + -mstack-align -mdata-align -mconst-align + -m32-bit -m16-bit -m8-bit -mno-prologue-epilogue -mno-gotplt + -melf -maout -melinux -mlinux -sim -sim2 + + _PDP-11 Options_ + -mfpu -msoft-float -mac0 -mno-ac0 -m40 -m45 -m10 + -mbcopy -mbcopy-builtin -mint32 -mno-int16 + -mint16 -mno-int32 -mfloat32 -mno-float64 + -mfloat64 -mno-float32 -mabshi -mno-abshi + -mbranch-expensive -mbranch-cheap + -msplit -mno-split -munix-asm -mdec-asm + + _Xstormy16 Options_ + -msim + + _Xtensa Options_ + -mbig-endian -mlittle-endian + -mdensity -mno-density + -mmac16 -mno-mac16 + -mmul16 -mno-mul16 + -mmul32 -mno-mul32 + -mnsa -mno-nsa + -mminmax -mno-minmax + -msext -mno-sext + -mbooleans -mno-booleans + -mhard-float -msoft-float + -mfused-madd -mno-fused-madd + -mserialize-volatile -mno-serialize-volatile + -mtext-section-literals -mno-text-section-literals + -mtarget-align -mno-target-align + -mlongcalls -mno-longcalls + + _Code Generation Options_ + *Note Options for Code Generation Conventions: Code Gen Options. + -fcall-saved-REG -fcall-used-REG + -ffixed-REG -fexceptions + -fnon-call-exceptions -funwind-tables + -fasynchronous-unwind-tables + -finhibit-size-directive -finstrument-functions + -fno-common -fno-ident -fno-gnu-linker + -fpcc-struct-return -fpic -fPIC + -freg-struct-return -fshared-data -fshort-enums + -fshort-double -fshort-wchar -fvolatile + -fvolatile-global -fvolatile-static + -fverbose-asm -fpack-struct -fstack-check + -fstack-limit-register=REG -fstack-limit-symbol=SYM + -fargument-alias -fargument-noalias + -fargument-noalias-global -fleading-underscore + + + * Menu: + + * Overall Options:: Controlling the kind of output: + an executable, object files, assembler files, + or preprocessed source. + * C Dialect Options:: Controlling the variant of C language compiled. + * C++ Dialect Options:: Variations on C++. + * Objective-C Dialect Options:: Variations on Objective-C. + * Language Independent Options:: Controlling how diagnostics should be + formatted. + * Warning Options:: How picky should the compiler be? + * Debugging Options:: Symbol tables, measurements, and debugging dumps. + * Optimize Options:: How much optimization? + * Preprocessor Options:: Controlling header files and macro definitions. + Also, getting dependency information for Make. + * Assembler Options:: Passing options to the assembler. + * Link Options:: Specifying libraries and so on. + * Directory Options:: Where to find header files and libraries. + Where to find the compiler executable files. + * Spec Files:: How to pass switches to sub-processes. + * Target Options:: Running a cross-compiler, or an old version of GCC. + +  + File: gcc.info, Node: Overall Options, Next: Invoking G++, Prev: Option Summary, Up: Invoking GCC + + Options Controlling the Kind of Output + ====================================== + + Compilation can involve up to four stages: preprocessing, compilation + proper, assembly and linking, always in that order. The first three + stages apply to an individual source file, and end by producing an + object file; linking combines all the object files (those newly + compiled, and those specified as input) into an executable file. + + For any given input file, the file name suffix determines what kind + of compilation is done: + + `FILE.c' + C source code which must be preprocessed. + + `FILE.i' + C source code which should not be preprocessed. + + `FILE.ii' + C++ source code which should not be preprocessed. + + `FILE.m' + Objective-C source code. Note that you must link with the library + `libobjc.a' to make an Objective-C program work. + + `FILE.mi' + Objective-C source code which should not be preprocessed. + + `FILE.h' + C header file (not to be compiled or linked). + + `FILE.cc' + `FILE.cp' + `FILE.cxx' + `FILE.cpp' + `FILE.c++' + `FILE.C' + C++ source code which must be preprocessed. Note that in `.cxx', + the last two letters must both be literally `x'. Likewise, `.C' + refers to a literal capital C. + + `FILE.f' + `FILE.for' + `FILE.FOR' + Fortran source code which should not be preprocessed. + + `FILE.F' + `FILE.fpp' + `FILE.FPP' + Fortran source code which must be preprocessed (with the + traditional preprocessor). + + `FILE.r' + Fortran source code which must be preprocessed with a RATFOR + preprocessor (not included with GCC). + + *Note Options Controlling the Kind of Output: (g77)Overall + Options, for more details of the handling of Fortran input files. + + `FILE.ads' + Ada source code file which contains a library unit declaration (a + declaration of a package, subprogram, or generic, or a generic + instantiation), or a library unit renaming declaration (a package, + generic, or subprogram renaming declaration). Such files are also + called "specs". + + `FILE.adb' + Ada source code file containing a library unit body (a subprogram + or package body). Such files are also called "bodies". + + `FILE.s' + Assembler code. + + `FILE.S' + Assembler code which must be preprocessed. + + `OTHER' + An object file to be fed straight into linking. Any file name + with no recognized suffix is treated this way. + + You can specify the input language explicitly with the `-x' option: + + `-x LANGUAGE' + Specify explicitly the LANGUAGE for the following input files + (rather than letting the compiler choose a default based on the + file name suffix). This option applies to all following input + files until the next `-x' option. Possible values for LANGUAGE + are: + c c-header cpp-output + c++ c++-cpp-output + objective-c objc-cpp-output + assembler assembler-with-cpp + ada + f77 f77-cpp-input ratfor + java + + `-x none' + Turn off any specification of a language, so that subsequent files + are handled according to their file name suffixes (as they are if + `-x' has not been used at all). + + `-pass-exit-codes' + Normally the `gcc' program will exit with the code of 1 if any + phase of the compiler returns a non-success return code. If you + specify `-pass-exit-codes', the `gcc' program will instead return + with numerically highest error produced by any phase that returned + an error indication. + + If you only want some of the stages of compilation, you can use `-x' + (or filename suffixes) to tell `gcc' where to start, and one of the + options `-c', `-S', or `-E' to say where `gcc' is to stop. Note that + some combinations (for example, `-x cpp-output -E') instruct `gcc' to + do nothing at all. + + `-c' + Compile or assemble the source files, but do not link. The linking + stage simply is not done. The ultimate output is in the form of an + object file for each source file. + + By default, the object file name for a source file is made by + replacing the suffix `.c', `.i', `.s', etc., with `.o'. + + Unrecognized input files, not requiring compilation or assembly, + are ignored. + + `-S' + Stop after the stage of compilation proper; do not assemble. The + output is in the form of an assembler code file for each + non-assembler input file specified. + + By default, the assembler file name for a source file is made by + replacing the suffix `.c', `.i', etc., with `.s'. + + Input files that don't require compilation are ignored. + + `-E' + Stop after the preprocessing stage; do not run the compiler + proper. The output is in the form of preprocessed source code, + which is sent to the standard output. + + Input files which don't require preprocessing are ignored. + + `-o FILE' + Place output in file FILE. This applies regardless to whatever + sort of output is being produced, whether it be an executable file, + an object file, an assembler file or preprocessed C code. + + Since only one output file can be specified, it does not make + sense to use `-o' when compiling more than one input file, unless + you are producing an executable file as output. + + If `-o' is not specified, the default is to put an executable file + in `a.out', the object file for `SOURCE.SUFFIX' in `SOURCE.o', its + assembler file in `SOURCE.s', and all preprocessed C source on + standard output. + + `-v' + Print (on standard error output) the commands executed to run the + stages of compilation. Also print the version number of the + compiler driver program and of the preprocessor and the compiler + proper. + + `-###' + Like `-v' except the commands are not executed and all command + arguments are quoted. This is useful for shell scripts to capture + the driver-generated command lines. + + `-pipe' + Use pipes rather than temporary files for communication between the + various stages of compilation. This fails to work on some systems + where the assembler is unable to read from a pipe; but the GNU + assembler has no trouble. + + `--help' + Print (on the standard output) a description of the command line + options understood by `gcc'. If the `-v' option is also specified + then `--help' will also be passed on to the various processes + invoked by `gcc', so that they can display the command line options + they accept. If the `-W' option is also specified then command + line options which have no documentation associated with them will + also be displayed. + + `--target-help' + Print (on the standard output) a description of target specific + command line options for each tool. + + `--version' + Display the version number and copyrights of the invoked GCC. + +  + File: gcc.info, Node: Invoking G++, Next: C Dialect Options, Prev: Overall Options, Up: Invoking GCC + + Compiling C++ Programs + ====================== + + C++ source files conventionally use one of the suffixes `.C', `.cc', + `.cpp', `.c++', `.cp', or `.cxx'; preprocessed C++ files use the suffix + `.ii'. GCC recognizes files with these names and compiles them as C++ + programs even if you call the compiler the same way as for compiling C + programs (usually with the name `gcc'). + + However, C++ programs often require class libraries as well as a + compiler that understands the C++ language--and under some + circumstances, you might want to compile programs from standard input, + or otherwise without a suffix that flags them as C++ programs. `g++' + is a program that calls GCC with the default language set to C++, and + automatically specifies linking against the C++ library. On many + systems, `g++' is also installed with the name `c++'. + + When you compile C++ programs, you may specify many of the same + command-line options that you use for compiling programs in any + language; or command-line options meaningful for C and related + languages; or options that are meaningful only for C++ programs. *Note + Options Controlling C Dialect: C Dialect Options, for explanations of + options for languages related to C. *Note Options Controlling C++ + Dialect: C++ Dialect Options, for explanations of options that are + meaningful only for C++ programs. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-10 gcc-3.2.3/gcc/doc/gcc.info-10 *** gcc-3.2.2/gcc/doc/gcc.info-10 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-10 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1177 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Code Gen Options, Next: Environment Variables, Prev: Submodel Options, Up: Invoking GCC + + Options for Code Generation Conventions + ======================================= + + These machine-independent options control the interface conventions + used in code generation. + + Most of them have both positive and negative forms; the negative form + of `-ffoo' would be `-fno-foo'. In the table below, only one of the + forms is listed--the one which is not the default. You can figure out + the other form by either removing `no-' or adding it. + + `-fexceptions' + Enable exception handling. Generates extra code needed to + propagate exceptions. For some targets, this implies GCC will + generate frame unwind information for all functions, which can + produce significant data size overhead, although it does not + affect execution. If you do not specify this option, GCC will + enable it by default for languages like C++ which normally require + exception handling, and disable it for languages like C that do + not normally require it. However, you may need to enable this + option when compiling C code that needs to interoperate properly + with exception handlers written in C++. You may also wish to + disable this option if you are compiling older C++ programs that + don't use exception handling. + + `-fnon-call-exceptions' + Generate code that allows trapping instructions to throw + exceptions. Note that this requires platform-specific runtime + support that does not exist everywhere. Moreover, it only allows + _trapping_ instructions to throw exceptions, i.e. memory + references or floating point instructions. It does not allow + exceptions to be thrown from arbitrary signal handlers such as + `SIGALRM'. + + `-funwind-tables' + Similar to `-fexceptions', except that it will just generate any + needed static data, but will not affect the generated code in any + other way. You will normally not enable this option; instead, a + language processor that needs this handling would enable it on + your behalf. + + `-fasynchronous-unwind-tables' + Generate unwind table in dwarf2 format, if supported by target + machine. The table is exact at each instruction boundary, so it + can be used for stack unwinding from asynchronous events (such as + debugger or garbage collector). + + `-fpcc-struct-return' + Return "short" `struct' and `union' values in memory like longer + ones, rather than in registers. This convention is less + efficient, but it has the advantage of allowing intercallability + between GCC-compiled files and files compiled with other + compilers, particularly the Portable C Compiler (pcc). + + The precise convention for returning structures in memory depends + on the target configuration macros. + + Short structures and unions are those whose size and alignment + match that of some integer type. + + *Warning:* code compiled with the `-fpcc-struct-return' switch is + not binary compatible with code compiled with the + `-freg-struct-return' switch. Use it to conform to a non-default + application binary interface. + + `-freg-struct-return' + Return `struct' and `union' values in registers when possible. + This is more efficient for small structures than + `-fpcc-struct-return'. + + If you specify neither `-fpcc-struct-return' nor + `-freg-struct-return', GCC defaults to whichever convention is + standard for the target. If there is no standard convention, GCC + defaults to `-fpcc-struct-return', except on targets where GCC is + the principal compiler. In those cases, we can choose the + standard, and we chose the more efficient register return + alternative. + + *Warning:* code compiled with the `-freg-struct-return' switch is + not binary compatible with code compiled with the + `-fpcc-struct-return' switch. Use it to conform to a non-default + application binary interface. + + `-fshort-enums' + Allocate to an `enum' type only as many bytes as it needs for the + declared range of possible values. Specifically, the `enum' type + will be equivalent to the smallest integer type which has enough + room. + + *Warning:* the `-fshort-enums' switch causes GCC to generate code + that is not binary compatible with code generated without that + switch. Use it to conform to a non-default application binary + interface. + + `-fshort-double' + Use the same size for `double' as for `float'. + + *Warning:* the `-fshort-double' switch causes GCC to generate code + that is not binary compatible with code generated without that + switch. Use it to conform to a non-default application binary + interface. + + `-fshort-wchar' + Override the underlying type for `wchar_t' to be `short unsigned + int' instead of the default for the target. This option is useful + for building programs to run under WINE. + + *Warning:* the `-fshort-wchar' switch causes GCC to generate code + that is not binary compatible with code generated without that + switch. Use it to conform to a non-default application binary + interface. + + `-fshared-data' + Requests that the data and non-`const' variables of this + compilation be shared data rather than private data. The + distinction makes sense only on certain operating systems, where + shared data is shared between processes running the same program, + while private data exists in one copy per process. + + `-fno-common' + In C, allocate even uninitialized global variables in the data + section of the object file, rather than generating them as common + blocks. This has the effect that if the same variable is declared + (without `extern') in two different compilations, you will get an + error when you link them. The only reason this might be useful is + if you wish to verify that the program will work on other systems + which always work this way. + + `-fno-ident' + Ignore the `#ident' directive. + + `-fno-gnu-linker' + Do not output global initializations (such as C++ constructors and + destructors) in the form used by the GNU linker (on systems where + the GNU linker is the standard method of handling them). Use this + option when you want to use a non-GNU linker, which also requires + using the `collect2' program to make sure the system linker + includes constructors and destructors. (`collect2' is included in + the GCC distribution.) For systems which _must_ use `collect2', + the compiler driver `gcc' is configured to do this automatically. + + `-finhibit-size-directive' + Don't output a `.size' assembler directive, or anything else that + would cause trouble if the function is split in the middle, and the + two halves are placed at locations far apart in memory. This + option is used when compiling `crtstuff.c'; you should not need to + use it for anything else. + + `-fverbose-asm' + Put extra commentary information in the generated assembly code to + make it more readable. This option is generally only of use to + those who actually need to read the generated assembly code + (perhaps while debugging the compiler itself). + + `-fno-verbose-asm', the default, causes the extra information to + be omitted and is useful when comparing two assembler files. + + `-fvolatile' + Consider all memory references through pointers to be volatile. + + `-fvolatile-global' + Consider all memory references to extern and global data items to + be volatile. GCC does not consider static data items to be + volatile because of this switch. + + `-fvolatile-static' + Consider all memory references to static data to be volatile. + + `-fpic' + Generate position-independent code (PIC) suitable for use in a + shared library, if supported for the target machine. Such code + accesses all constant addresses through a global offset table + (GOT). The dynamic loader resolves the GOT entries when the + program starts (the dynamic loader is not part of GCC; it is part + of the operating system). If the GOT size for the linked + executable exceeds a machine-specific maximum size, you get an + error message from the linker indicating that `-fpic' does not + work; in that case, recompile with `-fPIC' instead. (These + maximums are 16k on the m88k, 8k on the Sparc, and 32k on the m68k + and RS/6000. The 386 has no such limit.) + + Position-independent code requires special support, and therefore + works only on certain machines. For the 386, GCC supports PIC for + System V but not for the Sun 386i. Code generated for the IBM + RS/6000 is always position-independent. + + `-fPIC' + If supported for the target machine, emit position-independent + code, suitable for dynamic linking and avoiding any limit on the + size of the global offset table. This option makes a difference + on the m68k, m88k, and the Sparc. + + Position-independent code requires special support, and therefore + works only on certain machines. + + `-ffixed-REG' + Treat the register named REG as a fixed register; generated code + should never refer to it (except perhaps as a stack pointer, frame + pointer or in some other fixed role). + + REG must be the name of a register. The register names accepted + are machine-specific and are defined in the `REGISTER_NAMES' macro + in the machine description macro file. + + This flag does not have a negative form, because it specifies a + three-way choice. + + `-fcall-used-REG' + Treat the register named REG as an allocable register that is + clobbered by function calls. It may be allocated for temporaries + or variables that do not live across a call. Functions compiled + this way will not save and restore the register REG. + + It is an error to used this flag with the frame pointer or stack + pointer. Use of this flag for other registers that have fixed + pervasive roles in the machine's execution model will produce + disastrous results. + + This flag does not have a negative form, because it specifies a + three-way choice. + + `-fcall-saved-REG' + Treat the register named REG as an allocable register saved by + functions. It may be allocated even for temporaries or variables + that live across a call. Functions compiled this way will save + and restore the register REG if they use it. + + It is an error to used this flag with the frame pointer or stack + pointer. Use of this flag for other registers that have fixed + pervasive roles in the machine's execution model will produce + disastrous results. + + A different sort of disaster will result from the use of this flag + for a register in which function values may be returned. + + This flag does not have a negative form, because it specifies a + three-way choice. + + `-fpack-struct' + Pack all structure members together without holes. + + *Warning:* the `-fpack-struct' switch causes GCC to generate code + that is not binary compatible with code generated without that + switch. Additionally, it makes the code suboptimial. Use it to + conform to a non-default application binary interface. + + `-finstrument-functions' + Generate instrumentation calls for entry and exit to functions. + Just after function entry and just before function exit, the + following profiling functions will be called with the address of + the current function and its call site. (On some platforms, + `__builtin_return_address' does not work beyond the current + function, so the call site information may not be available to the + profiling functions otherwise.) + + void __cyg_profile_func_enter (void *this_fn, + void *call_site); + void __cyg_profile_func_exit (void *this_fn, + void *call_site); + + The first argument is the address of the start of the current + function, which may be looked up exactly in the symbol table. + + This instrumentation is also done for functions expanded inline in + other functions. The profiling calls will indicate where, + conceptually, the inline function is entered and exited. This + means that addressable versions of such functions must be + available. If all your uses of a function are expanded inline, + this may mean an additional expansion of code size. If you use + `extern inline' in your C code, an addressable version of such + functions must be provided. (This is normally the case anyways, + but if you get lucky and the optimizer always expands the + functions inline, you might have gotten away without providing + static copies.) + + A function may be given the attribute `no_instrument_function', in + which case this instrumentation will not be done. This can be + used, for example, for the profiling functions listed above, + high-priority interrupt routines, and any functions from which the + profiling functions cannot safely be called (perhaps signal + handlers, if the profiling routines generate output or allocate + memory). + + `-fstack-check' + Generate code to verify that you do not go beyond the boundary of + the stack. You should specify this flag if you are running in an + environment with multiple threads, but only rarely need to specify + it in a single-threaded environment since stack overflow is + automatically detected on nearly all systems if there is only one + stack. + + Note that this switch does not actually cause checking to be done; + the operating system must do that. The switch causes generation + of code to ensure that the operating system sees the stack being + extended. + + `-fstack-limit-register=REG' + `-fstack-limit-symbol=SYM' + `-fno-stack-limit' + Generate code to ensure that the stack does not grow beyond a + certain value, either the value of a register or the address of a + symbol. If the stack would grow beyond the value, a signal is + raised. For most targets, the signal is raised before the stack + overruns the boundary, so it is possible to catch the signal + without taking special precautions. + + For instance, if the stack starts at absolute address `0x80000000' + and grows downwards, you can use the flags + `-fstack-limit-symbol=__stack_limit' and + `-Wl,--defsym,__stack_limit=0x7ffe0000' to enforce a stack limit + of 128KB. Note that this may only work with the GNU linker. + + `-fargument-alias' + `-fargument-noalias' + `-fargument-noalias-global' + Specify the possible relationships among parameters and between + parameters and global data. + + `-fargument-alias' specifies that arguments (parameters) may alias + each other and may alias global storage. + `-fargument-noalias' specifies that arguments do not alias each + other, but may alias global storage. + `-fargument-noalias-global' specifies that arguments do not alias + each other and do not alias global storage. + + Each language will automatically use whatever option is required by + the language standard. You should not need to use these options + yourself. + + `-fleading-underscore' + This option and its counterpart, `-fno-leading-underscore', + forcibly change the way C symbols are represented in the object + file. One use is to help link with legacy assembly code. + + *Warning:* the `-fleading-underscore' switch causes GCC to + generate code that is not binary compatible with code generated + without that switch. Use it to conform to a non-default + application binary interface. Not all targets provide complete + support for this switch. + +  + File: gcc.info, Node: Environment Variables, Next: Running Protoize, Prev: Code Gen Options, Up: Invoking GCC + + Environment Variables Affecting GCC + =================================== + + This section describes several environment variables that affect how + GCC operates. Some of them work by specifying directories or prefixes + to use when searching for various kinds of files. Some are used to + specify other aspects of the compilation environment. + + Note that you can also specify places to search using options such as + `-B', `-I' and `-L' (*note Directory Options::). These take precedence + over places specified using environment variables, which in turn take + precedence over those specified by the configuration of GCC. *Note + Controlling the Compilation Driver `gcc': (gccint)Driver. + + `LANG' + `LC_CTYPE' + `LC_MESSAGES' + `LC_ALL' + These environment variables control the way that GCC uses + localization information that allow GCC to work with different + national conventions. GCC inspects the locale categories + `LC_CTYPE' and `LC_MESSAGES' if it has been configured to do so. + These locale categories can be set to any value supported by your + installation. A typical value is `en_UK' for English in the United + Kingdom. + + The `LC_CTYPE' environment variable specifies character + classification. GCC uses it to determine the character boundaries + in a string; this is needed for some multibyte encodings that + contain quote and escape characters that would otherwise be + interpreted as a string end or escape. + + The `LC_MESSAGES' environment variable specifies the language to + use in diagnostic messages. + + If the `LC_ALL' environment variable is set, it overrides the value + of `LC_CTYPE' and `LC_MESSAGES'; otherwise, `LC_CTYPE' and + `LC_MESSAGES' default to the value of the `LANG' environment + variable. If none of these variables are set, GCC defaults to + traditional C English behavior. + + `TMPDIR' + If `TMPDIR' is set, it specifies the directory to use for temporary + files. GCC uses temporary files to hold the output of one stage of + compilation which is to be used as input to the next stage: for + example, the output of the preprocessor, which is the input to the + compiler proper. + + `GCC_EXEC_PREFIX' + If `GCC_EXEC_PREFIX' is set, it specifies a prefix to use in the + names of the subprograms executed by the compiler. No slash is + added when this prefix is combined with the name of a subprogram, + but you can specify a prefix that ends with a slash if you wish. + + If `GCC_EXEC_PREFIX' is not set, GCC will attempt to figure out an + appropriate prefix to use based on the pathname it was invoked + with. + + If GCC cannot find the subprogram using the specified prefix, it + tries looking in the usual places for the subprogram. + + The default value of `GCC_EXEC_PREFIX' is `PREFIX/lib/gcc-lib/' + where PREFIX is the value of `prefix' when you ran the `configure' + script. + + Other prefixes specified with `-B' take precedence over this + prefix. + + This prefix is also used for finding files such as `crt0.o' that + are used for linking. + + In addition, the prefix is used in an unusual way in finding the + directories to search for header files. For each of the standard + directories whose name normally begins with + `/usr/local/lib/gcc-lib' (more precisely, with the value of + `GCC_INCLUDE_DIR'), GCC tries replacing that beginning with the + specified prefix to produce an alternate directory name. Thus, + with `-Bfoo/', GCC will search `foo/bar' where it would normally + search `/usr/local/lib/bar'. These alternate directories are + searched first; the standard directories come next. + + `COMPILER_PATH' + The value of `COMPILER_PATH' is a colon-separated list of + directories, much like `PATH'. GCC tries the directories thus + specified when searching for subprograms, if it can't find the + subprograms using `GCC_EXEC_PREFIX'. + + `LIBRARY_PATH' + The value of `LIBRARY_PATH' is a colon-separated list of + directories, much like `PATH'. When configured as a native + compiler, GCC tries the directories thus specified when searching + for special linker files, if it can't find them using + `GCC_EXEC_PREFIX'. Linking using GCC also uses these directories + when searching for ordinary libraries for the `-l' option (but + directories specified with `-L' come first). + + `LANG' + This variable is used to pass locale information to the compiler. + One way in which this information is used is to determine the + character set to be used when character literals, string literals + and comments are parsed in C and C++. When the compiler is + configured to allow multibyte characters, the following values for + `LANG' are recognized: + + `C-JIS' + Recognize JIS characters. + + `C-SJIS' + Recognize SJIS characters. + + `C-EUCJP' + Recognize EUCJP characters. + + If `LANG' is not defined, or if it has some other value, then the + compiler will use mblen and mbtowc as defined by the default + locale to recognize and translate multibyte characters. + + Some additional environments variables affect the behavior of the + preprocessor. + + `CPATH' + `C_INCLUDE_PATH' + `CPLUS_INCLUDE_PATH' + `OBJC_INCLUDE_PATH' + Each variable's value is a list of directories separated by a + special character, much like `PATH', in which to look for header + files. The special character, `PATH_SEPARATOR', is + target-dependent and determined at GCC build time. For + Windows-based targets it is a semicolon, and for almost all other + targets it is a colon. + + `CPATH' specifies a list of directories to be searched as if + specified with `-I', but after any paths given with `-I' options + on the command line. The environment variable is used regardless + of which language is being preprocessed. + + The remaining environment variables apply only when preprocessing + the particular language indicated. Each specifies a list of + directories to be searched as if specified with `-isystem', but + after any paths given with `-isystem' options on the command line. + + `DEPENDENCIES_OUTPUT' + If this variable is set, its value specifies how to output + dependencies for Make based on the non-system header files + processed by the compiler. System header files are ignored in the + dependency output. + + The value of `DEPENDENCIES_OUTPUT' can be just a file name, in + which case the Make rules are written to that file, guessing the + target name from the source file name. Or the value can have the + form `FILE TARGET', in which case the rules are written to file + FILE using TARGET as the target name. + + In other words, this environment variable is equivalent to + combining the options `-MM' and `-MF' (*note Preprocessor + Options::), with an optional `-MT' switch too. + + `SUNPRO_DEPENDENCIES' + This variable is the same as the environment variable + `DEPENDENCIES_OUTPUT' (*note DEPENDENCIES_OUTPUT::), except that + system header files are not ignored, so it implies `-M' rather + than `-MM'. However, the dependence on the main input file is + omitted. *Note Preprocessor Options::. + +  + File: gcc.info, Node: Running Protoize, Prev: Environment Variables, Up: Invoking GCC + + Running Protoize + ================ + + The program `protoize' is an optional part of GCC. You can use it + to add prototypes to a program, thus converting the program to ISO C in + one respect. The companion program `unprotoize' does the reverse: it + removes argument types from any prototypes that are found. + + When you run these programs, you must specify a set of source files + as command line arguments. The conversion programs start out by + compiling these files to see what functions they define. The + information gathered about a file FOO is saved in a file named `FOO.X'. + + After scanning comes actual conversion. The specified files are all + eligible to be converted; any files they include (whether sources or + just headers) are eligible as well. + + But not all the eligible files are converted. By default, + `protoize' and `unprotoize' convert only source and header files in the + current directory. You can specify additional directories whose files + should be converted with the `-d DIRECTORY' option. You can also + specify particular files to exclude with the `-x FILE' option. A file + is converted if it is eligible, its directory name matches one of the + specified directory names, and its name within the directory has not + been excluded. + + Basic conversion with `protoize' consists of rewriting most function + definitions and function declarations to specify the types of the + arguments. The only ones not rewritten are those for varargs functions. + + `protoize' optionally inserts prototype declarations at the + beginning of the source file, to make them available for any calls that + precede the function's definition. Or it can insert prototype + declarations with block scope in the blocks where undeclared functions + are called. + + Basic conversion with `unprotoize' consists of rewriting most + function declarations to remove any argument types, and rewriting + function definitions to the old-style pre-ISO form. + + Both conversion programs print a warning for any function + declaration or definition that they can't convert. You can suppress + these warnings with `-q'. + + The output from `protoize' or `unprotoize' replaces the original + source file. The original file is renamed to a name ending with + `.save' (for DOS, the saved filename ends in `.sav' without the + original `.c' suffix). If the `.save' (`.sav' for DOS) file already + exists, then the source file is simply discarded. + + `protoize' and `unprotoize' both depend on GCC itself to scan the + program and collect information about the functions it uses. So + neither of these programs will work until GCC is installed. + + Here is a table of the options you can use with `protoize' and + `unprotoize'. Each option works with both programs unless otherwise + stated. + + `-B DIRECTORY' + Look for the file `SYSCALLS.c.X' in DIRECTORY, instead of the + usual directory (normally `/usr/local/lib'). This file contains + prototype information about standard system functions. This option + applies only to `protoize'. + + `-c COMPILATION-OPTIONS' + Use COMPILATION-OPTIONS as the options when running `gcc' to + produce the `.X' files. The special option `-aux-info' is always + passed in addition, to tell `gcc' to write a `.X' file. + + Note that the compilation options must be given as a single + argument to `protoize' or `unprotoize'. If you want to specify + several `gcc' options, you must quote the entire set of + compilation options to make them a single word in the shell. + + There are certain `gcc' arguments that you cannot use, because they + would produce the wrong kind of output. These include `-g', `-O', + `-c', `-S', and `-o' If you include these in the + COMPILATION-OPTIONS, they are ignored. + + `-C' + Rename files to end in `.C' (`.cc' for DOS-based file systems) + instead of `.c'. This is convenient if you are converting a C + program to C++. This option applies only to `protoize'. + + `-g' + Add explicit global declarations. This means inserting explicit + declarations at the beginning of each source file for each function + that is called in the file and was not declared. These + declarations precede the first function definition that contains a + call to an undeclared function. This option applies only to + `protoize'. + + `-i STRING' + Indent old-style parameter declarations with the string STRING. + This option applies only to `protoize'. + + `unprotoize' converts prototyped function definitions to old-style + function definitions, where the arguments are declared between the + argument list and the initial `{'. By default, `unprotoize' uses + five spaces as the indentation. If you want to indent with just + one space instead, use `-i " "'. + + `-k' + Keep the `.X' files. Normally, they are deleted after conversion + is finished. + + `-l' + Add explicit local declarations. `protoize' with `-l' inserts a + prototype declaration for each function in each block which calls + the function without any declaration. This option applies only to + `protoize'. + + `-n' + Make no real changes. This mode just prints information about the + conversions that would have been done without `-n'. + + `-N' + Make no `.save' files. The original files are simply deleted. + Use this option with caution. + + `-p PROGRAM' + Use the program PROGRAM as the compiler. Normally, the name `gcc' + is used. + + `-q' + Work quietly. Most warnings are suppressed. + + `-v' + Print the version number, just like `-v' for `gcc'. + + If you need special compiler options to compile one of your program's + source files, then you should generate that file's `.X' file specially, + by running `gcc' on that source file with the appropriate options and + the option `-aux-info'. Then run `protoize' on the entire set of + files. `protoize' will use the existing `.X' file because it is newer + than the source file. For example: + + gcc -Dfoo=bar file1.c -aux-info file1.X + protoize *.c + + You need to include the special files along with the rest in the + `protoize' command, even though their `.X' files already exist, because + otherwise they won't get converted. + + *Note Protoize Caveats::, for more information on how to use + `protoize' successfully. + +  + File: gcc.info, Node: C Implementation, Next: C Extensions, Prev: Invoking GCC, Up: Top + + C Implementation-defined behavior + ********************************* + + A conforming implementation of ISO C is required to document its + choice of behavior in each of the areas that are designated + "implementation defined." The following lists all such areas, along + with the section number from the ISO/IEC 9899:1999 standard. + + * Menu: + + * Translation implementation:: + * Environment implementation:: + * Identifiers implementation:: + * Characters implementation:: + * Integers implementation:: + * Floating point implementation:: + * Arrays and pointers implementation:: + * Hints implementation:: + * Structures unions enumerations and bit-fields implementation:: + * Qualifiers implementation:: + * Preprocessing directives implementation:: + * Library functions implementation:: + * Architecture implementation:: + * Locale-specific behavior implementation:: + +  + File: gcc.info, Node: Translation implementation, Next: Environment implementation, Up: C Implementation + + Translation + =========== + + * `How a diagnostic is identified (3.10, 5.1.1.3).' + + * `Whether each nonempty sequence of white-space characters other + than new-line is retained or replaced by one space character in + translation phase 3 (5.1.1.2).' + +  + File: gcc.info, Node: Environment implementation, Next: Identifiers implementation, Prev: Translation implementation, Up: C Implementation + + Environment + =========== + + The behavior of these points are dependent on the implementation of + the C library, and are not defined by GCC itself. + +  + File: gcc.info, Node: Identifiers implementation, Next: Characters implementation, Prev: Environment implementation, Up: C Implementation + + Identifiers + =========== + + * `Which additional multibyte characters may appear in identifiers + and their correspondence to universal character names (6.4.2).' + + * `The number of significant initial characters in an identifier + (5.2.4.1, 6.4.2).' + +  + File: gcc.info, Node: Characters implementation, Next: Integers implementation, Prev: Identifiers implementation, Up: C Implementation + + Characters + ========== + + * `The number of bits in a byte (3.6).' + + * `The values of the members of the execution character set (5.2.1).' + + * `The unique value of the member of the execution character set + produced for each of the standard alphabetic escape sequences + (5.2.2).' + + * `The value of a `char' object into which has been stored any + character other than a member of the basic execution character set + (6.2.5).' + + * `Which of `signed char' or `unsigned char' has the same range, + representation, and behavior as "plain" `char' (6.2.5, 6.3.1.1).' + + * `The mapping of members of the source character set (in character + constants and string literals) to members of the execution + character set (6.4.4.4, 5.1.1.2).' + + * `The value of an integer character constant containing more than + one character or containing a character or escape sequence that + does not map to a single-byte execution character (6.4.4.4).' + + * `The value of a wide character constant containing more than one + multibyte character, or containing a multibyte character or escape + sequence not represented in the extended execution character set + (6.4.4.4).' + + * `The current locale used to convert a wide character constant + consisting of a single multibyte character that maps to a member + of the extended execution character set into a corresponding wide + character code (6.4.4.4).' + + * `The current locale used to convert a wide string literal into + corresponding wide character codes (6.4.5).' + + * `The value of a string literal containing a multibyte character or + escape sequence not represented in the execution character set + (6.4.5).' + +  + File: gcc.info, Node: Integers implementation, Next: Floating point implementation, Prev: Characters implementation, Up: C Implementation + + Integers + ======== + + * `Any extended integer types that exist in the implementation + (6.2.5).' + + * `Whether signed integer types are represented using sign and + magnitude, two's complement, or one's complement, and whether the + extraordinary value is a trap representation or an ordinary value + (6.2.6.2).' + + * `The rank of any extended integer type relative to another extended + integer type with the same precision (6.3.1.1).' + + * `The result of, or the signal raised by, converting an integer to a + signed integer type when the value cannot be represented in an + object of that type (6.3.1.3).' + + * `The results of some bitwise operations on signed integers (6.5).' + +  + File: gcc.info, Node: Floating point implementation, Next: Arrays and pointers implementation, Prev: Integers implementation, Up: C Implementation + + Floating point + ============== + + * `The accuracy of the floating-point operations and of the library + functions in `' and `' that return + floating-point results (5.2.4.2.2).' + + * `The rounding behaviors characterized by non-standard values of + `FLT_ROUNDS' (5.2.4.2.2).' + + * `The evaluation methods characterized by non-standard negative + values of `FLT_EVAL_METHOD' (5.2.4.2.2).' + + * `The direction of rounding when an integer is converted to a + floating-point number that cannot exactly represent the original + value (6.3.1.4).' + + * `The direction of rounding when a floating-point number is + converted to a narrower floating-point number (6.3.1.5).' + + * `How the nearest representable value or the larger or smaller + representable value immediately adjacent to the nearest + representable value is chosen for certain floating constants + (6.4.4.2).' + + * `Whether and how floating expressions are contracted when not + disallowed by the `FP_CONTRACT' pragma (6.5).' + + * `The default state for the `FENV_ACCESS' pragma (7.6.1).' + + * `Additional floating-point exceptions, rounding modes, + environments, and classifications, and their macro names (7.6, + 7.12).' + + * `The default state for the `FP_CONTRACT' pragma (7.12.2).' + + * `Whether the "inexact" floating-point exception can be raised when + the rounded result actually does equal the mathematical result in + an IEC 60559 conformant implementation (F.9).' + + * `Whether the "underflow" (and "inexact") floating-point exception + can be raised when a result is tiny but not inexact in an IEC + 60559 conformant implementation (F.9).' + + +  + File: gcc.info, Node: Arrays and pointers implementation, Next: Hints implementation, Prev: Floating point implementation, Up: C Implementation + + Arrays and pointers + =================== + + * `The result of converting a pointer to an integer or vice versa + (6.3.2.3).' + + A cast from pointer to integer discards most-significant bits if + the pointer representation is larger than the integer type, + sign-extends(1) if the pointer representation is smaller than the + integer type, otherwise the bits are unchanged. + + A cast from integer to pointer discards most-significant bits if + the pointer representation is smaller than the integer type, + extends according to the signedness of the integer type if the + pointer representation is larger than the integer type, otherwise + the bits are unchanged. + + When casting from pointer to integer and back again, the resulting + pointer must reference the same object as the original pointer, + otherwise the behavior is undefined. That is, one may not use + integer arithmetic to avoid the undefined behavior of pointer + arithmetic as proscribed in 6.5.6/8. + + * `The size of the result of subtracting two pointers to elements of + the same array (6.5.6).' + + + ---------- Footnotes ---------- + + (1) Future versions of GCC may zero-extend, or use a target-defined + `ptr_extend' pattern. Do not rely on sign extension. + +  + File: gcc.info, Node: Hints implementation, Next: Structures unions enumerations and bit-fields implementation, Prev: Arrays and pointers implementation, Up: C Implementation + + Hints + ===== + + * `The extent to which suggestions made by using the `register' + storage-class specifier are effective (6.7.1).' + + * `The extent to which suggestions made by using the inline function + specifier are effective (6.7.4).' + + +  + File: gcc.info, Node: Structures unions enumerations and bit-fields implementation, Next: Qualifiers implementation, Prev: Hints implementation, Up: C Implementation + + Structures, unions, enumerations, and bit-fields + ================================================ + + * `Whether a "plain" int bit-field is treated as a `signed int' + bit-field or as an `unsigned int' bit-field (6.7.2, 6.7.2.1).' + + * `Allowable bit-field types other than `_Bool', `signed int', and + `unsigned int' (6.7.2.1).' + + * `Whether a bit-field can straddle a storage-unit boundary + (6.7.2.1).' + + * `The order of allocation of bit-fields within a unit (6.7.2.1).' + + * `The alignment of non-bit-field members of structures (6.7.2.1).' + + * `The integer type compatible with each enumerated type (6.7.2.2).' + + +  + File: gcc.info, Node: Qualifiers implementation, Next: Preprocessing directives implementation, Prev: Structures unions enumerations and bit-fields implementation, Up: C Implementation + + Qualifiers + ========== + + * `What constitutes an access to an object that has + volatile-qualified type (6.7.3).' + + +  + File: gcc.info, Node: Preprocessing directives implementation, Next: Library functions implementation, Prev: Qualifiers implementation, Up: C Implementation + + Preprocessing directives + ======================== + + * `How sequences in both forms of header names are mapped to headers + or external source file names (6.4.7).' + + * `Whether the value of a character constant in a constant expression + that controls conditional inclusion matches the value of the same + character constant in the execution character set (6.10.1).' + + * `Whether the value of a single-character character constant in a + constant expression that controls conditional inclusion may have a + negative value (6.10.1).' + + * `The places that are searched for an included `<>' delimited + header, and how the places are specified or the header is + identified (6.10.2).' + + * `How the named source file is searched for in an included `""' + delimited header (6.10.2).' + + * `The method by which preprocessing tokens (possibly resulting from + macro expansion) in a `#include' directive are combined into a + header name (6.10.2).' + + * `The nesting limit for `#include' processing (6.10.2).' + + * `Whether the `#' operator inserts a `\' character before the `\' + character that begins a universal character name in a character + constant or string literal (6.10.3.2).' + + * `The behavior on each recognized non-`STDC #pragma' directive + (6.10.6).' + + * `The definitions for `__DATE__' and `__TIME__' when respectively, + the date and time of translation are not available (6.10.8).' + + +  + File: gcc.info, Node: Library functions implementation, Next: Architecture implementation, Prev: Preprocessing directives implementation, Up: C Implementation + + Library functions + ================= + + The behavior of these points are dependent on the implementation of + the C library, and are not defined by GCC itself. + +  + File: gcc.info, Node: Architecture implementation, Next: Locale-specific behavior implementation, Prev: Library functions implementation, Up: C Implementation + + Architecture + ============ + + * `The values or expressions assigned to the macros specified in the + headers `', `', and `' (5.2.4.2, + 7.18.2, 7.18.3).' + + * `The number, order, and encoding of bytes in any object (when not + explicitly specified in this International Standard) (6.2.6.1).' + + * `The value of the result of the sizeof operator (6.5.3.4).' + + +  + File: gcc.info, Node: Locale-specific behavior implementation, Prev: Architecture implementation, Up: C Implementation + + Locale-specific behavior + ======================== + + The behavior of these points are dependent on the implementation of + the C library, and are not defined by GCC itself. + +  + File: gcc.info, Node: C Extensions, Next: C++ Extensions, Prev: C Implementation, Up: Top + + Extensions to the C Language Family + *********************************** + + GNU C provides several language features not found in ISO standard C. + (The `-pedantic' option directs GCC to print a warning message if any + of these features is used.) To test for the availability of these + features in conditional compilation, check for a predefined macro + `__GNUC__', which is always defined under GCC. + + These extensions are available in C and Objective-C. Most of them + are also available in C++. *Note Extensions to the C++ Language: C++ + Extensions, for extensions that apply _only_ to C++. + + Some features that are in ISO C99 but not C89 or C++ are also, as + extensions, accepted by GCC in C89 mode and in C++. + + * Menu: + + * Statement Exprs:: Putting statements and declarations inside expressions. + * Local Labels:: Labels local to a statement-expression. + * Labels as Values:: Getting pointers to labels, and computed gotos. + * Nested Functions:: As in Algol and Pascal, lexical scoping of functions. + * Constructing Calls:: Dispatching a call to another function. + * Typeof:: `typeof': referring to the type of an expression. + * Lvalues:: Using `?:', `,' and casts in lvalues. + * Conditionals:: Omitting the middle operand of a `?:' expression. + * Long Long:: Double-word integers---`long long int'. + * Complex:: Data types for complex numbers. + * Hex Floats:: Hexadecimal floating-point constants. + * Zero Length:: Zero-length arrays. + * Variable Length:: Arrays whose length is computed at run time. + * Variadic Macros:: Macros with a variable number of arguments. + * Escaped Newlines:: Slightly looser rules for escaped newlines. + * Multi-line Strings:: String literals with embedded newlines. + * Subscripting:: Any array can be subscripted, even if not an lvalue. + * Pointer Arith:: Arithmetic on `void'-pointers and function pointers. + * Initializers:: Non-constant initializers. + * Compound Literals:: Compound literals give structures, unions + or arrays as values. + * Designated Inits:: Labeling elements of initializers. + * Cast to Union:: Casting to union type from any member of the union. + * Case Ranges:: `case 1 ... 9' and such. + * Mixed Declarations:: Mixing declarations and code. + * Function Attributes:: Declaring that functions have no side effects, + or that they can never return. + * Attribute Syntax:: Formal syntax for attributes. + * Function Prototypes:: Prototype declarations and old-style definitions. + * C++ Comments:: C++ comments are recognized. + * Dollar Signs:: Dollar sign is allowed in identifiers. + * Character Escapes:: `\e' stands for the character . + * Variable Attributes:: Specifying attributes of variables. + * Type Attributes:: Specifying attributes of types. + * Alignment:: Inquiring about the alignment of a type or variable. + * Inline:: Defining inline functions (as fast as macros). + * Extended Asm:: Assembler instructions with C expressions as operands. + (With them you can define ``built-in'' functions.) + * Constraints:: Constraints for asm operands + * Asm Labels:: Specifying the assembler name to use for a C symbol. + * Explicit Reg Vars:: Defining variables residing in specified registers. + * Alternate Keywords:: `__const__', `__asm__', etc., for header files. + * Incomplete Enums:: `enum foo;', with details to follow. + * Function Names:: Printable strings which are the name of the current + function. + * Return Address:: Getting the return or frame address of a function. + * Vector Extensions:: Using vector instructions through built-in functions. + * Other Builtins:: Other built-in functions. + * Target Builtins:: Built-in functions specific to particular targets. + * Pragmas:: Pragmas accepted by GCC. + * Unnamed Fields:: Unnamed struct/union fields within structs/unions. + +  + File: gcc.info, Node: Statement Exprs, Next: Local Labels, Up: C Extensions + + Statements and Declarations in Expressions + ========================================== + + A compound statement enclosed in parentheses may appear as an + expression in GNU C. This allows you to use loops, switches, and local + variables within an expression. + + Recall that a compound statement is a sequence of statements + surrounded by braces; in this construct, parentheses go around the + braces. For example: + + ({ int y = foo (); int z; + if (y > 0) z = y; + else z = - y; + z; }) + + is a valid (though slightly more complex than necessary) expression for + the absolute value of `foo ()'. + + The last thing in the compound statement should be an expression + followed by a semicolon; the value of this subexpression serves as the + value of the entire construct. (If you use some other kind of statement + last within the braces, the construct has type `void', and thus + effectively no value.) + + This feature is especially useful in making macro definitions "safe" + (so that they evaluate each operand exactly once). For example, the + "maximum" function is commonly defined as a macro in standard C as + follows: + + #define max(a,b) ((a) > (b) ? (a) : (b)) + + But this definition computes either A or B twice, with bad results if + the operand has side effects. In GNU C, if you know the type of the + operands (here let's assume `int'), you can define the macro safely as + follows: + + #define maxint(a,b) \ + ({int _a = (a), _b = (b); _a > _b ? _a : _b; }) + + Embedded statements are not allowed in constant expressions, such as + the value of an enumeration constant, the width of a bit-field, or the + initial value of a static variable. + + If you don't know the type of the operand, you can still do this, + but you must use `typeof' (*note Typeof::). + + Statement expressions are not supported fully in G++, and their fate + there is unclear. (It is possible that they will become fully supported + at some point, or that they will be deprecated, or that the bugs that + are present will continue to exist indefinitely.) Presently, statement + expressions do not work well as default arguments. + + In addition, there are semantic issues with statement-expressions in + C++. If you try to use statement-expressions instead of inline + functions in C++, you may be surprised at the way object destruction is + handled. For example: + + #define foo(a) ({int b = (a); b + 3; }) + + does not work the same way as: + + inline int foo(int a) { int b = a; return b + 3; } + + In particular, if the expression passed into `foo' involves the + creation of temporaries, the destructors for those temporaries will be + run earlier in the case of the macro than in the case of the function. + + These considerations mean that it is probably a bad idea to use + statement-expressions of this form in header files that are designed to + work with C++. (Note that some versions of the GNU C Library contained + header files using statement-expression that lead to precisely this + bug.) + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-11 gcc-3.2.3/gcc/doc/gcc.info-11 *** gcc-3.2.2/gcc/doc/gcc.info-11 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-11 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1143 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Local Labels, Next: Labels as Values, Prev: Statement Exprs, Up: C Extensions + + Locally Declared Labels + ======================= + + Each statement expression is a scope in which "local labels" can be + declared. A local label is simply an identifier; you can jump to it + with an ordinary `goto' statement, but only from within the statement + expression it belongs to. + + A local label declaration looks like this: + + __label__ LABEL; + + or + + __label__ LABEL1, LABEL2, ...; + + Local label declarations must come at the beginning of the statement + expression, right after the `({', before any ordinary declarations. + + The label declaration defines the label _name_, but does not define + the label itself. You must do this in the usual way, with `LABEL:', + within the statements of the statement expression. + + The local label feature is useful because statement expressions are + often used in macros. If the macro contains nested loops, a `goto' can + be useful for breaking out of them. However, an ordinary label whose + scope is the whole function cannot be used: if the macro can be + expanded several times in one function, the label will be multiply + defined in that function. A local label avoids this problem. For + example: + + #define SEARCH(array, target) \ + ({ \ + __label__ found; \ + typeof (target) _SEARCH_target = (target); \ + typeof (*(array)) *_SEARCH_array = (array); \ + int i, j; \ + int value; \ + for (i = 0; i < max; i++) \ + for (j = 0; j < max; j++) \ + if (_SEARCH_array[i][j] == _SEARCH_target) \ + { value = i; goto found; } \ + value = -1; \ + found: \ + value; \ + }) + +  + File: gcc.info, Node: Labels as Values, Next: Nested Functions, Prev: Local Labels, Up: C Extensions + + Labels as Values + ================ + + You can get the address of a label defined in the current function + (or a containing function) with the unary operator `&&'. The value has + type `void *'. This value is a constant and can be used wherever a + constant of that type is valid. For example: + + void *ptr; + ... + ptr = &&foo; + + To use these values, you need to be able to jump to one. This is + done with the computed goto statement(1), `goto *EXP;'. For example, + + goto *ptr; + + Any expression of type `void *' is allowed. + + One way of using these constants is in initializing a static array + that will serve as a jump table: + + static void *array[] = { &&foo, &&bar, &&hack }; + + Then you can select a label with indexing, like this: + + goto *array[i]; + + Note that this does not check whether the subscript is in bounds--array + indexing in C never does that. + + Such an array of label values serves a purpose much like that of the + `switch' statement. The `switch' statement is cleaner, so use that + rather than an array unless the problem does not fit a `switch' + statement very well. + + Another use of label values is in an interpreter for threaded code. + The labels within the interpreter function can be stored in the + threaded code for super-fast dispatching. + + You may not use this mechanism to jump to code in a different + function. If you do that, totally unpredictable things will happen. + The best way to avoid this is to store the label address only in + automatic variables and never pass it as an argument. + + An alternate way to write the above example is + + static const int array[] = { &&foo - &&foo, &&bar - &&foo, + &&hack - &&foo }; + goto *(&&foo + array[i]); + + This is more friendly to code living in shared libraries, as it reduces + the number of dynamic relocations that are needed, and by consequence, + allows the data to be read-only. + + ---------- Footnotes ---------- + + (1) The analogous feature in Fortran is called an assigned goto, but + that name seems inappropriate in C, where one can do more than simply + store label addresses in label variables. + +  + File: gcc.info, Node: Nested Functions, Next: Constructing Calls, Prev: Labels as Values, Up: C Extensions + + Nested Functions + ================ + + A "nested function" is a function defined inside another function. + (Nested functions are not supported for GNU C++.) The nested function's + name is local to the block where it is defined. For example, here we + define a nested function named `square', and call it twice: + + foo (double a, double b) + { + double square (double z) { return z * z; } + + return square (a) + square (b); + } + + The nested function can access all the variables of the containing + function that are visible at the point of its definition. This is + called "lexical scoping". For example, here we show a nested function + which uses an inherited variable named `offset': + + bar (int *array, int offset, int size) + { + int access (int *array, int index) + { return array[index + offset]; } + int i; + ... + for (i = 0; i < size; i++) + ... access (array, i) ... + } + + Nested function definitions are permitted within functions in the + places where variable definitions are allowed; that is, in any block, + before the first statement in the block. + + It is possible to call the nested function from outside the scope of + its name by storing its address or passing the address to another + function: + + hack (int *array, int size) + { + void store (int index, int value) + { array[index] = value; } + + intermediate (store, size); + } + + Here, the function `intermediate' receives the address of `store' as + an argument. If `intermediate' calls `store', the arguments given to + `store' are used to store into `array'. But this technique works only + so long as the containing function (`hack', in this example) does not + exit. + + If you try to call the nested function through its address after the + containing function has exited, all hell will break loose. If you try + to call it after a containing scope level has exited, and if it refers + to some of the variables that are no longer in scope, you may be lucky, + but it's not wise to take the risk. If, however, the nested function + does not refer to anything that has gone out of scope, you should be + safe. + + GCC implements taking the address of a nested function using a + technique called "trampolines". A paper describing them is available as + + `http://people.debian.org/~aaronl/Usenix88-lexic.pdf'. + + A nested function can jump to a label inherited from a containing + function, provided the label was explicitly declared in the containing + function (*note Local Labels::). Such a jump returns instantly to the + containing function, exiting the nested function which did the `goto' + and any intermediate functions as well. Here is an example: + + bar (int *array, int offset, int size) + { + __label__ failure; + int access (int *array, int index) + { + if (index > size) + goto failure; + return array[index + offset]; + } + int i; + ... + for (i = 0; i < size; i++) + ... access (array, i) ... + ... + return 0; + + /* Control comes here from `access' + if it detects an error. */ + failure: + return -1; + } + + A nested function always has internal linkage. Declaring one with + `extern' is erroneous. If you need to declare the nested function + before its definition, use `auto' (which is otherwise meaningless for + function declarations). + + bar (int *array, int offset, int size) + { + __label__ failure; + auto int access (int *, int); + ... + int access (int *array, int index) + { + if (index > size) + goto failure; + return array[index + offset]; + } + ... + } + +  + File: gcc.info, Node: Constructing Calls, Next: Typeof, Prev: Nested Functions, Up: C Extensions + + Constructing Function Calls + =========================== + + Using the built-in functions described below, you can record the + arguments a function received, and call another function with the same + arguments, without knowing the number or types of the arguments. + + You can also record the return value of that function call, and + later return that value, without knowing what data type the function + tried to return (as long as your caller expects that data type). + + - Built-in Function: void * __builtin_apply_args () + This built-in function returns a pointer to data describing how to + perform a call with the same arguments as were passed to the + current function. + + The function saves the arg pointer register, structure value + address, and all registers that might be used to pass arguments to + a function into a block of memory allocated on the stack. Then it + returns the address of that block. + + - Built-in Function: void * __builtin_apply (void (*FUNCTION)(), void + *ARGUMENTS, size_t SIZE) + This built-in function invokes FUNCTION with a copy of the + parameters described by ARGUMENTS and SIZE. + + The value of ARGUMENTS should be the value returned by + `__builtin_apply_args'. The argument SIZE specifies the size of + the stack argument data, in bytes. + + This function returns a pointer to data describing how to return + whatever value was returned by FUNCTION. The data is saved in a + block of memory allocated on the stack. + + It is not always simple to compute the proper value for SIZE. The + value is used by `__builtin_apply' to compute the amount of data + that should be pushed on the stack and copied from the incoming + argument area. + + - Built-in Function: void __builtin_return (void *RESULT) + This built-in function returns the value described by RESULT from + the containing function. You should specify, for RESULT, a value + returned by `__builtin_apply'. + +  + File: gcc.info, Node: Typeof, Next: Lvalues, Prev: Constructing Calls, Up: C Extensions + + Referring to a Type with `typeof' + ================================= + + Another way to refer to the type of an expression is with `typeof'. + The syntax of using of this keyword looks like `sizeof', but the + construct acts semantically like a type name defined with `typedef'. + + There are two ways of writing the argument to `typeof': with an + expression or with a type. Here is an example with an expression: + + typeof (x[0](1)) + + This assumes that `x' is an array of pointers to functions; the type + described is that of the values of the functions. + + Here is an example with a typename as the argument: + + typeof (int *) + + Here the type described is that of pointers to `int'. + + If you are writing a header file that must work when included in ISO + C programs, write `__typeof__' instead of `typeof'. *Note Alternate + Keywords::. + + A `typeof'-construct can be used anywhere a typedef name could be + used. For example, you can use it in a declaration, in a cast, or + inside of `sizeof' or `typeof'. + + `typeof' is often useful in conjunction with the + statements-within-expressions feature. Here is how the two together can + be used to define a safe "maximum" macro that operates on any + arithmetic type and evaluates each of its arguments exactly once: + + #define max(a,b) \ + ({ typeof (a) _a = (a); \ + typeof (b) _b = (b); \ + _a > _b ? _a : _b; }) + + The reason for using names that start with underscores for the local + variables is to avoid conflicts with variable names that occur within + the expressions that are substituted for `a' and `b'. Eventually we + hope to design a new form of declaration syntax that allows you to + declare variables whose scopes start only after their initializers; + this will be a more reliable way to prevent such conflicts. + + Some more examples of the use of `typeof': + + * This declares `y' with the type of what `x' points to. + + typeof (*x) y; + + * This declares `y' as an array of such values. + + typeof (*x) y[4]; + + * This declares `y' as an array of pointers to characters: + + typeof (typeof (char *)[4]) y; + + It is equivalent to the following traditional C declaration: + + char *y[4]; + + To see the meaning of the declaration using `typeof', and why it + might be a useful way to write, let's rewrite it with these macros: + + #define pointer(T) typeof(T *) + #define array(T, N) typeof(T [N]) + + Now the declaration can be rewritten this way: + + array (pointer (char), 4) y; + + Thus, `array (pointer (char), 4)' is the type of arrays of 4 + pointers to `char'. + + _Compatibility Note:_ In addition to `typeof', GCC 2 supported a + more limited extension which permitted one to write + + typedef T = EXPR; + + with the effect of declaring T to have the type of the expression EXPR. + This extension does not work with GCC 3 (versions between 3.0 and 3.2 + will crash; 3.2.1 and later give an error). Code which relies on it + should be rewritten to use `typeof': + + typedef typeof(EXPR) T; + + This will work with all versions of GCC. + +  + File: gcc.info, Node: Lvalues, Next: Conditionals, Prev: Typeof, Up: C Extensions + + Generalized Lvalues + =================== + + Compound expressions, conditional expressions and casts are allowed + as lvalues provided their operands are lvalues. This means that you + can take their addresses or store values into them. + + Standard C++ allows compound expressions and conditional expressions + as lvalues, and permits casts to reference type, so use of this + extension is deprecated for C++ code. + + For example, a compound expression can be assigned, provided the last + expression in the sequence is an lvalue. These two expressions are + equivalent: + + (a, b) += 5 + a, (b += 5) + + Similarly, the address of the compound expression can be taken. + These two expressions are equivalent: + + &(a, b) + a, &b + + A conditional expression is a valid lvalue if its type is not void + and the true and false branches are both valid lvalues. For example, + these two expressions are equivalent: + + (a ? b : c) = 5 + (a ? b = 5 : (c = 5)) + + A cast is a valid lvalue if its operand is an lvalue. A simple + assignment whose left-hand side is a cast works by converting the + right-hand side first to the specified type, then to the type of the + inner left-hand side expression. After this is stored, the value is + converted back to the specified type to become the value of the + assignment. Thus, if `a' has type `char *', the following two + expressions are equivalent: + + (int)a = 5 + (int)(a = (char *)(int)5) + + An assignment-with-arithmetic operation such as `+=' applied to a + cast performs the arithmetic using the type resulting from the cast, + and then continues as in the previous case. Therefore, these two + expressions are equivalent: + + (int)a += 5 + (int)(a = (char *)(int) ((int)a + 5)) + + You cannot take the address of an lvalue cast, because the use of its + address would not work out coherently. Suppose that `&(int)f' were + permitted, where `f' has type `float'. Then the following statement + would try to store an integer bit-pattern where a floating point number + belongs: + + *&(int)f = 1; + + This is quite different from what `(int)f = 1' would do--that would + convert 1 to floating point and store it. Rather than cause this + inconsistency, we think it is better to prohibit use of `&' on a cast. + + If you really do want an `int *' pointer with the address of `f', + you can simply write `(int *)&f'. + +  + File: gcc.info, Node: Conditionals, Next: Long Long, Prev: Lvalues, Up: C Extensions + + Conditionals with Omitted Operands + ================================== + + The middle operand in a conditional expression may be omitted. Then + if the first operand is nonzero, its value is the value of the + conditional expression. + + Therefore, the expression + + x ? : y + + has the value of `x' if that is nonzero; otherwise, the value of `y'. + + This example is perfectly equivalent to + + x ? x : y + + In this simple case, the ability to omit the middle operand is not + especially useful. When it becomes useful is when the first operand + does, or may (if it is a macro argument), contain a side effect. Then + repeating the operand in the middle would perform the side effect + twice. Omitting the middle operand uses the value already computed + without the undesirable effects of recomputing it. + +  + File: gcc.info, Node: Long Long, Next: Complex, Prev: Conditionals, Up: C Extensions + + Double-Word Integers + ==================== + + ISO C99 supports data types for integers that are at least 64 bits + wide, and as an extension GCC supports them in C89 mode and in C++. + Simply write `long long int' for a signed integer, or `unsigned long + long int' for an unsigned integer. To make an integer constant of type + `long long int', add the suffix `LL' to the integer. To make an + integer constant of type `unsigned long long int', add the suffix `ULL' + to the integer. + + You can use these types in arithmetic like any other integer types. + Addition, subtraction, and bitwise boolean operations on these types + are open-coded on all types of machines. Multiplication is open-coded + if the machine supports fullword-to-doubleword a widening multiply + instruction. Division and shifts are open-coded only on machines that + provide special support. The operations that are not open-coded use + special library routines that come with GCC. + + There may be pitfalls when you use `long long' types for function + arguments, unless you declare function prototypes. If a function + expects type `int' for its argument, and you pass a value of type `long + long int', confusion will result because the caller and the subroutine + will disagree about the number of bytes for the argument. Likewise, if + the function expects `long long int' and you pass `int'. The best way + to avoid such problems is to use prototypes. + +  + File: gcc.info, Node: Complex, Next: Hex Floats, Prev: Long Long, Up: C Extensions + + Complex Numbers + =============== + + ISO C99 supports complex floating data types, and as an extension GCC + supports them in C89 mode and in C++, and supports complex integer data + types which are not part of ISO C99. You can declare complex types + using the keyword `_Complex'. As an extension, the older GNU keyword + `__complex__' is also supported. + + For example, `_Complex double x;' declares `x' as a variable whose + real part and imaginary part are both of type `double'. `_Complex + short int y;' declares `y' to have real and imaginary parts of type + `short int'; this is not likely to be useful, but it shows that the set + of complex types is complete. + + To write a constant with a complex data type, use the suffix `i' or + `j' (either one; they are equivalent). For example, `2.5fi' has type + `_Complex float' and `3i' has type `_Complex int'. Such a constant + always has a pure imaginary value, but you can form any complex value + you like by adding one to a real constant. This is a GNU extension; if + you have an ISO C99 conforming C library (such as GNU libc), and want + to construct complex constants of floating type, you should include + `' and use the macros `I' or `_Complex_I' instead. + + To extract the real part of a complex-valued expression EXP, write + `__real__ EXP'. Likewise, use `__imag__' to extract the imaginary + part. This is a GNU extension; for values of floating type, you should + use the ISO C99 functions `crealf', `creal', `creall', `cimagf', + `cimag' and `cimagl', declared in `' and also provided as + built-in functions by GCC. + + The operator `~' performs complex conjugation when used on a value + with a complex type. This is a GNU extension; for values of floating + type, you should use the ISO C99 functions `conjf', `conj' and `conjl', + declared in `' and also provided as built-in functions by + GCC. + + GCC can allocate complex automatic variables in a noncontiguous + fashion; it's even possible for the real part to be in a register while + the imaginary part is on the stack (or vice-versa). None of the + supported debugging info formats has a way to represent noncontiguous + allocation like this, so GCC describes a noncontiguous complex variable + as if it were two separate variables of noncomplex type. If the + variable's actual name is `foo', the two fictitious variables are named + `foo$real' and `foo$imag'. You can examine and set these two + fictitious variables with your debugger. + + A future version of GDB will know how to recognize such pairs and + treat them as a single variable with a complex type. + +  + File: gcc.info, Node: Hex Floats, Next: Zero Length, Prev: Complex, Up: C Extensions + + Hex Floats + ========== + + ISO C99 supports floating-point numbers written not only in the usual + decimal notation, such as `1.55e1', but also numbers such as `0x1.fp3' + written in hexadecimal format. As a GNU extension, GCC supports this + in C89 mode (except in some cases when strictly conforming) and in C++. + In that format the `0x' hex introducer and the `p' or `P' exponent + field are mandatory. The exponent is a decimal number that indicates + the power of 2 by which the significant part will be multiplied. Thus + `0x1.f' is 1 15/16, `p3' multiplies it by 8, and the value of `0x1.fp3' + is the same as `1.55e1'. + + Unlike for floating-point numbers in the decimal notation the + exponent is always required in the hexadecimal notation. Otherwise the + compiler would not be able to resolve the ambiguity of, e.g., `0x1.f'. + This could mean `1.0f' or `1.9375' since `f' is also the extension for + floating-point constants of type `float'. + +  + File: gcc.info, Node: Zero Length, Next: Variable Length, Prev: Hex Floats, Up: C Extensions + + Arrays of Length Zero + ===================== + + Zero-length arrays are allowed in GNU C. They are very useful as the + last element of a structure which is really a header for a + variable-length object: + + struct line { + int length; + char contents[0]; + }; + + struct line *thisline = (struct line *) + malloc (sizeof (struct line) + this_length); + thisline->length = this_length; + + In ISO C89, you would have to give `contents' a length of 1, which + means either you waste space or complicate the argument to `malloc'. + + In ISO C99, you would use a "flexible array member", which is + slightly different in syntax and semantics: + + * Flexible array members are written as `contents[]' without the `0'. + + * Flexible array members have incomplete type, and so the `sizeof' + operator may not be applied. As a quirk of the original + implementation of zero-length arrays, `sizeof' evaluates to zero. + + * Flexible array members may only appear as the last member of a + `struct' that is otherwise non-empty. + + GCC versions before 3.0 allowed zero-length arrays to be statically + initialized, as if they were flexible arrays. In addition to those + cases that were useful, it also allowed initializations in situations + that would corrupt later data. Non-empty initialization of zero-length + arrays is now treated like any case where there are more initializer + elements than the array holds, in that a suitable warning about "excess + elements in array" is given, and the excess elements (all of them, in + this case) are ignored. + + Instead GCC allows static initialization of flexible array members. + This is equivalent to defining a new structure containing the original + structure followed by an array of sufficient size to contain the data. + I.e. in the following, `f1' is constructed as if it were declared like + `f2'. + + struct f1 { + int x; int y[]; + } f1 = { 1, { 2, 3, 4 } }; + + struct f2 { + struct f1 f1; int data[3]; + } f2 = { { 1 }, { 2, 3, 4 } }; + + The convenience of this extension is that `f1' has the desired type, + eliminating the need to consistently refer to `f2.f1'. + + This has symmetry with normal static arrays, in that an array of + unknown size is also written with `[]'. + + Of course, this extension only makes sense if the extra data comes at + the end of a top-level object, as otherwise we would be overwriting + data at subsequent offsets. To avoid undue complication and confusion + with initialization of deeply nested arrays, we simply disallow any + non-empty initialization except when the structure is the top-level + object. For example: + + struct foo { int x; int y[]; }; + struct bar { struct foo z; }; + + struct foo a = { 1, { 2, 3, 4 } }; // Valid. + struct bar b = { { 1, { 2, 3, 4 } } }; // Invalid. + struct bar c = { { 1, { } } }; // Valid. + struct foo d[1] = { { 1 { 2, 3, 4 } } }; // Invalid. + +  + File: gcc.info, Node: Variable Length, Next: Variadic Macros, Prev: Zero Length, Up: C Extensions + + Arrays of Variable Length + ========================= + + Variable-length automatic arrays are allowed in ISO C99, and as an + extension GCC accepts them in C89 mode and in C++. (However, GCC's + implementation of variable-length arrays does not yet conform in detail + to the ISO C99 standard.) These arrays are declared like any other + automatic arrays, but with a length that is not a constant expression. + The storage is allocated at the point of declaration and deallocated + when the brace-level is exited. For example: + + FILE * + concat_fopen (char *s1, char *s2, char *mode) + { + char str[strlen (s1) + strlen (s2) + 1]; + strcpy (str, s1); + strcat (str, s2); + return fopen (str, mode); + } + + Jumping or breaking out of the scope of the array name deallocates + the storage. Jumping into the scope is not allowed; you get an error + message for it. + + You can use the function `alloca' to get an effect much like + variable-length arrays. The function `alloca' is available in many + other C implementations (but not in all). On the other hand, + variable-length arrays are more elegant. + + There are other differences between these two methods. Space + allocated with `alloca' exists until the containing _function_ returns. + The space for a variable-length array is deallocated as soon as the + array name's scope ends. (If you use both variable-length arrays and + `alloca' in the same function, deallocation of a variable-length array + will also deallocate anything more recently allocated with `alloca'.) + + You can also use variable-length arrays as arguments to functions: + + struct entry + tester (int len, char data[len][len]) + { + ... + } + + The length of an array is computed once when the storage is allocated + and is remembered for the scope of the array in case you access it with + `sizeof'. + + If you want to pass the array first and the length afterward, you can + use a forward declaration in the parameter list--another GNU extension. + + struct entry + tester (int len; char data[len][len], int len) + { + ... + } + + The `int len' before the semicolon is a "parameter forward + declaration", and it serves the purpose of making the name `len' known + when the declaration of `data' is parsed. + + You can write any number of such parameter forward declarations in + the parameter list. They can be separated by commas or semicolons, but + the last one must end with a semicolon, which is followed by the "real" + parameter declarations. Each forward declaration must match a "real" + declaration in parameter name and data type. ISO C99 does not support + parameter forward declarations. + +  + File: gcc.info, Node: Variadic Macros, Next: Escaped Newlines, Prev: Variable Length, Up: C Extensions + + Macros with a Variable Number of Arguments. + =========================================== + + In the ISO C standard of 1999, a macro can be declared to accept a + variable number of arguments much as a function can. The syntax for + defining the macro is similar to that of a function. Here is an + example: + + #define debug(format, ...) fprintf (stderr, format, __VA_ARGS__) + + Here `...' is a "variable argument". In the invocation of such a + macro, it represents the zero or more tokens until the closing + parenthesis that ends the invocation, including any commas. This set of + tokens replaces the identifier `__VA_ARGS__' in the macro body wherever + it appears. See the CPP manual for more information. + + GCC has long supported variadic macros, and used a different syntax + that allowed you to give a name to the variable arguments just like any + other argument. Here is an example: + + #define debug(format, args...) fprintf (stderr, format, args) + + This is in all ways equivalent to the ISO C example above, but + arguably more readable and descriptive. + + GNU CPP has two further variadic macro extensions, and permits them + to be used with either of the above forms of macro definition. + + In standard C, you are not allowed to leave the variable argument out + entirely; but you are allowed to pass an empty argument. For example, + this invocation is invalid in ISO C, because there is no comma after + the string: + + debug ("A message") + + GNU CPP permits you to completely omit the variable arguments in this + way. In the above examples, the compiler would complain, though since + the expansion of the macro still has the extra comma after the format + string. + + To help solve this problem, CPP behaves specially for variable + arguments used with the token paste operator, `##'. If instead you + write + + #define debug(format, ...) fprintf (stderr, format, ## __VA_ARGS__) + + and if the variable arguments are omitted or empty, the `##' + operator causes the preprocessor to remove the comma before it. If you + do provide some variable arguments in your macro invocation, GNU CPP + does not complain about the paste operation and instead places the + variable arguments after the comma. Just like any other pasted macro + argument, these arguments are not macro expanded. + +  + File: gcc.info, Node: Escaped Newlines, Next: Multi-line Strings, Prev: Variadic Macros, Up: C Extensions + + Slightly Looser Rules for Escaped Newlines + ========================================== + + Recently, the non-traditional preprocessor has relaxed its treatment + of escaped newlines. Previously, the newline had to immediately follow + a backslash. The current implementation allows whitespace in the form + of spaces, horizontal and vertical tabs, and form feeds between the + backslash and the subsequent newline. The preprocessor issues a + warning, but treats it as a valid escaped newline and combines the two + lines to form a single logical line. This works within comments and + tokens, including multi-line strings, as well as between tokens. + Comments are _not_ treated as whitespace for the purposes of this + relaxation, since they have not yet been replaced with spaces. + +  + File: gcc.info, Node: Multi-line Strings, Next: Subscripting, Prev: Escaped Newlines, Up: C Extensions + + String Literals with Embedded Newlines + ====================================== + + As an extension, GNU CPP permits string literals to cross multiple + lines without escaping the embedded newlines. Each embedded newline is + replaced with a single `\n' character in the resulting string literal, + regardless of what form the newline took originally. + + CPP currently allows such strings in directives as well (other than + the `#include' family). This is deprecated and will eventually be + removed. + +  + File: gcc.info, Node: Subscripting, Next: Pointer Arith, Prev: Multi-line Strings, Up: C Extensions + + Non-Lvalue Arrays May Have Subscripts + ===================================== + + In ISO C99, arrays that are not lvalues still decay to pointers, and + may be subscripted, although they may not be modified or used after the + next sequence point and the unary `&' operator may not be applied to + them. As an extension, GCC allows such arrays to be subscripted in C89 + mode, though otherwise they do not decay to pointers outside C99 mode. + For example, this is valid in GNU C though not valid in C89: + + struct foo {int a[4];}; + + struct foo f(); + + bar (int index) + { + return f().a[index]; + } + +  + File: gcc.info, Node: Pointer Arith, Next: Initializers, Prev: Subscripting, Up: C Extensions + + Arithmetic on `void'- and Function-Pointers + =========================================== + + In GNU C, addition and subtraction operations are supported on + pointers to `void' and on pointers to functions. This is done by + treating the size of a `void' or of a function as 1. + + A consequence of this is that `sizeof' is also allowed on `void' and + on function types, and returns 1. + + The option `-Wpointer-arith' requests a warning if these extensions + are used. + +  + File: gcc.info, Node: Initializers, Next: Compound Literals, Prev: Pointer Arith, Up: C Extensions + + Non-Constant Initializers + ========================= + + As in standard C++ and ISO C99, the elements of an aggregate + initializer for an automatic variable are not required to be constant + expressions in GNU C. Here is an example of an initializer with + run-time varying elements: + + foo (float f, float g) + { + float beat_freqs[2] = { f-g, f+g }; + ... + } + +  + File: gcc.info, Node: Compound Literals, Next: Designated Inits, Prev: Initializers, Up: C Extensions + + Compound Literals + ================= + + ISO C99 supports compound literals. A compound literal looks like a + cast containing an initializer. Its value is an object of the type + specified in the cast, containing the elements specified in the + initializer; it is an lvalue. As an extension, GCC supports compound + literals in C89 mode and in C++. + + Usually, the specified type is a structure. Assume that `struct + foo' and `structure' are declared as shown: + + struct foo {int a; char b[2];} structure; + + Here is an example of constructing a `struct foo' with a compound + literal: + + structure = ((struct foo) {x + y, 'a', 0}); + + This is equivalent to writing the following: + + { + struct foo temp = {x + y, 'a', 0}; + structure = temp; + } + + You can also construct an array. If all the elements of the + compound literal are (made up of) simple constant expressions, suitable + for use in initializers of objects of static storage duration, then the + compound literal can be coerced to a pointer to its first element and + used in such an initializer, as shown here: + + char **foo = (char *[]) { "x", "y", "z" }; + + Compound literals for scalar types and union types are is also + allowed, but then the compound literal is equivalent to a cast. + + As a GNU extension, GCC allows initialization of objects with static + storage duration by compound literals (which is not possible in ISO + C99, because the initializer is not a constant). It is handled as if + the object was initialized only with the bracket enclosed list if + compound literal's and object types match. The initializer list of the + compound literal must be constant. If the object being initialized has + array type of unknown size, the size is determined by compound literal + size. + + static struct foo x = (struct foo) {1, 'a', 'b'}; + static int y[] = (int []) {1, 2, 3}; + static int z[] = (int [3]) {1}; + + The above lines are equivalent to the following: + static struct foo x = {1, 'a', 'b'}; + static int y[] = {1, 2, 3}; + static int z[] = {1, 0, 0}; + +  + File: gcc.info, Node: Designated Inits, Next: Cast to Union, Prev: Compound Literals, Up: C Extensions + + Designated Initializers + ======================= + + Standard C89 requires the elements of an initializer to appear in a + fixed order, the same as the order of the elements in the array or + structure being initialized. + + In ISO C99 you can give the elements in any order, specifying the + array indices or structure field names they apply to, and GNU C allows + this as an extension in C89 mode as well. This extension is not + implemented in GNU C++. + + To specify an array index, write `[INDEX] =' before the element + value. For example, + + int a[6] = { [4] = 29, [2] = 15 }; + + is equivalent to + + int a[6] = { 0, 0, 15, 0, 29, 0 }; + + The index values must be constant expressions, even if the array being + initialized is automatic. + + An alternative syntax for this which has been obsolete since GCC 2.5 + but GCC still accepts is to write `[INDEX]' before the element value, + with no `='. + + To initialize a range of elements to the same value, write `[FIRST + ... LAST] = VALUE'. This is a GNU extension. For example, + + int widths[] = { [0 ... 9] = 1, [10 ... 99] = 2, [100] = 3 }; + + If the value in it has side-effects, the side-effects will happen only + once, not for each initialized field by the range initializer. + + Note that the length of the array is the highest value specified plus + one. + + In a structure initializer, specify the name of a field to initialize + with `.FIELDNAME =' before the element value. For example, given the + following structure, + + struct point { int x, y; }; + + the following initialization + + struct point p = { .y = yvalue, .x = xvalue }; + + is equivalent to + + struct point p = { xvalue, yvalue }; + + Another syntax which has the same meaning, obsolete since GCC 2.5, is + `FIELDNAME:', as shown here: + + struct point p = { y: yvalue, x: xvalue }; + + The `[INDEX]' or `.FIELDNAME' is known as a "designator". You can + also use a designator (or the obsolete colon syntax) when initializing + a union, to specify which element of the union should be used. For + example, + + union foo { int i; double d; }; + + union foo f = { .d = 4 }; + + will convert 4 to a `double' to store it in the union using the second + element. By contrast, casting 4 to type `union foo' would store it + into the union as the integer `i', since it is an integer. (*Note Cast + to Union::.) + + You can combine this technique of naming elements with ordinary C + initialization of successive elements. Each initializer element that + does not have a designator applies to the next consecutive element of + the array or structure. For example, + + int a[6] = { [1] = v1, v2, [4] = v4 }; + + is equivalent to + + int a[6] = { 0, v1, v2, 0, v4, 0 }; + + Labeling the elements of an array initializer is especially useful + when the indices are characters or belong to an `enum' type. For + example: + + int whitespace[256] + = { [' '] = 1, ['\t'] = 1, ['\h'] = 1, + ['\f'] = 1, ['\n'] = 1, ['\r'] = 1 }; + + You can also write a series of `.FIELDNAME' and `[INDEX]' + designators before an `=' to specify a nested subobject to initialize; + the list is taken relative to the subobject corresponding to the + closest surrounding brace pair. For example, with the `struct point' + declaration above: + + struct point ptarray[10] = { [2].y = yv2, [2].x = xv2, [0].x = xv0 }; + + If the same field is initialized multiple times, it will have value from + the last initialization. If any such overridden initialization has + side-effect, it is unspecified whether the side-effect happens or not. + Currently, gcc will discard them and issue a warning. + +  + File: gcc.info, Node: Case Ranges, Next: Mixed Declarations, Prev: Cast to Union, Up: C Extensions + + Case Ranges + =========== + + You can specify a range of consecutive values in a single `case' + label, like this: + + case LOW ... HIGH: + + This has the same effect as the proper number of individual `case' + labels, one for each integer value from LOW to HIGH, inclusive. + + This feature is especially useful for ranges of ASCII character + codes: + + case 'A' ... 'Z': + + *Be careful:* Write spaces around the `...', for otherwise it may be + parsed wrong when you use it with integer values. For example, write + this: + + case 1 ... 5: + + rather than this: + + case 1...5: + +  + File: gcc.info, Node: Cast to Union, Next: Case Ranges, Prev: Designated Inits, Up: C Extensions + + Cast to a Union Type + ==================== + + A cast to union type is similar to other casts, except that the type + specified is a union type. You can specify the type either with `union + TAG' or with a typedef name. A cast to union is actually a constructor + though, not a cast, and hence does not yield an lvalue like normal + casts. (*Note Compound Literals::.) + + The types that may be cast to the union type are those of the members + of the union. Thus, given the following union and variables: + + union foo { int i; double d; }; + int x; + double y; + + both `x' and `y' can be cast to type `union foo'. + + Using the cast as the right-hand side of an assignment to a variable + of union type is equivalent to storing in a member of the union: + + union foo u; + ... + u = (union foo) x == u.i = x + u = (union foo) y == u.d = y + + You can also use the union cast as a function argument: + + void hack (union foo); + ... + hack ((union foo) x); + +  + File: gcc.info, Node: Mixed Declarations, Next: Function Attributes, Prev: Case Ranges, Up: C Extensions + + Mixed Declarations and Code + =========================== + + ISO C99 and ISO C++ allow declarations and code to be freely mixed + within compound statements. As an extension, GCC also allows this in + C89 mode. For example, you could do: + + int i; + ... + i++; + int j = i + 2; + + Each identifier is visible from where it is declared until the end of + the enclosing block. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-12 gcc-3.2.3/gcc/doc/gcc.info-12 *** gcc-3.2.2/gcc/doc/gcc.info-12 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-12 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1098 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Function Attributes, Next: Attribute Syntax, Prev: Mixed Declarations, Up: C Extensions + + Declaring Attributes of Functions + ================================= + + In GNU C, you declare certain things about functions called in your + program which help the compiler optimize function calls and check your + code more carefully. + + The keyword `__attribute__' allows you to specify special attributes + when making a declaration. This keyword is followed by an attribute + specification inside double parentheses. The following attributes are + currently defined for functions on all targets: `noreturn', `noinline', + `always_inline', `pure', `const', `format', `format_arg', + `no_instrument_function', `section', `constructor', `destructor', + `used', `unused', `deprecated', `weak', `malloc', and `alias'. Several + other attributes are defined for functions on particular target + systems. Other attributes, including `section' are supported for + variables declarations (*note Variable Attributes::) and for types + (*note Type Attributes::). + + You may also specify attributes with `__' preceding and following + each keyword. This allows you to use them in header files without + being concerned about a possible macro of the same name. For example, + you may use `__noreturn__' instead of `noreturn'. + + *Note Attribute Syntax::, for details of the exact syntax for using + attributes. + + `noreturn' + A few standard library functions, such as `abort' and `exit', + cannot return. GCC knows this automatically. Some programs define + their own functions that never return. You can declare them + `noreturn' to tell the compiler this fact. For example, + + void fatal () __attribute__ ((noreturn)); + + void + fatal (...) + { + ... /* Print error message. */ ... + exit (1); + } + + The `noreturn' keyword tells the compiler to assume that `fatal' + cannot return. It can then optimize without regard to what would + happen if `fatal' ever did return. This makes slightly better + code. More importantly, it helps avoid spurious warnings of + uninitialized variables. + + Do not assume that registers saved by the calling function are + restored before calling the `noreturn' function. + + It does not make sense for a `noreturn' function to have a return + type other than `void'. + + The attribute `noreturn' is not implemented in GCC versions + earlier than 2.5. An alternative way to declare that a function + does not return, which works in the current version and in some + older versions, is as follows: + + typedef void voidfn (); + + volatile voidfn fatal; + + `noinline' + This function attribute prevents a function from being considered + for inlining. + + `always_inline' + Generally, functions are not inlined unless optimization is + specified. For functions declared inline, this attribute inlines + the function even if no optimization level was specified. + + `pure' + Many functions have no effects except the return value and their + return value depends only on the parameters and/or global + variables. Such a function can be subject to common subexpression + elimination and loop optimization just as an arithmetic operator + would be. These functions should be declared with the attribute + `pure'. For example, + + int square (int) __attribute__ ((pure)); + + says that the hypothetical function `square' is safe to call fewer + times than the program says. + + Some of common examples of pure functions are `strlen' or `memcmp'. + Interesting non-pure functions are functions with infinite loops + or those depending on volatile memory or other system resource, + that may change between two consecutive calls (such as `feof' in a + multithreading environment). + + The attribute `pure' is not implemented in GCC versions earlier + than 2.96. + + `const' + Many functions do not examine any values except their arguments, + and have no effects except the return value. Basically this is + just slightly more strict class than the `pure' attribute above, + since function is not allowed to read global memory. + + Note that a function that has pointer arguments and examines the + data pointed to must _not_ be declared `const'. Likewise, a + function that calls a non-`const' function usually must not be + `const'. It does not make sense for a `const' function to return + `void'. + + The attribute `const' is not implemented in GCC versions earlier + than 2.5. An alternative way to declare that a function has no + side effects, which works in the current version and in some older + versions, is as follows: + + typedef int intfn (); + + extern const intfn square; + + This approach does not work in GNU C++ from 2.6.0 on, since the + language specifies that the `const' must be attached to the return + value. + + `format (ARCHETYPE, STRING-INDEX, FIRST-TO-CHECK)' + The `format' attribute specifies that a function takes `printf', + `scanf', `strftime' or `strfmon' style arguments which should be + type-checked against a format string. For example, the + declaration: + + extern int + my_printf (void *my_object, const char *my_format, ...) + __attribute__ ((format (printf, 2, 3))); + + causes the compiler to check the arguments in calls to `my_printf' + for consistency with the `printf' style format string argument + `my_format'. + + The parameter ARCHETYPE determines how the format string is + interpreted, and should be `printf', `scanf', `strftime' or + `strfmon'. (You can also use `__printf__', `__scanf__', + `__strftime__' or `__strfmon__'.) The parameter STRING-INDEX + specifies which argument is the format string argument (starting + from 1), while FIRST-TO-CHECK is the number of the first argument + to check against the format string. For functions where the + arguments are not available to be checked (such as `vprintf'), + specify the third parameter as zero. In this case the compiler + only checks the format string for consistency. For `strftime' + formats, the third parameter is required to be zero. + + In the example above, the format string (`my_format') is the second + argument of the function `my_print', and the arguments to check + start with the third argument, so the correct parameters for the + format attribute are 2 and 3. + + The `format' attribute allows you to identify your own functions + which take format strings as arguments, so that GCC can check the + calls to these functions for errors. The compiler always (unless + `-ffreestanding' is used) checks formats for the standard library + functions `printf', `fprintf', `sprintf', `scanf', `fscanf', + `sscanf', `strftime', `vprintf', `vfprintf' and `vsprintf' + whenever such warnings are requested (using `-Wformat'), so there + is no need to modify the header file `stdio.h'. In C99 mode, the + functions `snprintf', `vsnprintf', `vscanf', `vfscanf' and + `vsscanf' are also checked. Except in strictly conforming C + standard modes, the X/Open function `strfmon' is also checked as + are `printf_unlocked' and `fprintf_unlocked'. *Note Options + Controlling C Dialect: C Dialect Options. + + `format_arg (STRING-INDEX)' + The `format_arg' attribute specifies that a function takes a format + string for a `printf', `scanf', `strftime' or `strfmon' style + function and modifies it (for example, to translate it into + another language), so the result can be passed to a `printf', + `scanf', `strftime' or `strfmon' style function (with the + remaining arguments to the format function the same as they would + have been for the unmodified string). For example, the + declaration: + + extern char * + my_dgettext (char *my_domain, const char *my_format) + __attribute__ ((format_arg (2))); + + causes the compiler to check the arguments in calls to a `printf', + `scanf', `strftime' or `strfmon' type function, whose format + string argument is a call to the `my_dgettext' function, for + consistency with the format string argument `my_format'. If the + `format_arg' attribute had not been specified, all the compiler + could tell in such calls to format functions would be that the + format string argument is not constant; this would generate a + warning when `-Wformat-nonliteral' is used, but the calls could + not be checked without the attribute. + + The parameter STRING-INDEX specifies which argument is the format + string argument (starting from 1). + + The `format-arg' attribute allows you to identify your own + functions which modify format strings, so that GCC can check the + calls to `printf', `scanf', `strftime' or `strfmon' type function + whose operands are a call to one of your own function. The + compiler always treats `gettext', `dgettext', and `dcgettext' in + this manner except when strict ISO C support is requested by + `-ansi' or an appropriate `-std' option, or `-ffreestanding' is + used. *Note Options Controlling C Dialect: C Dialect Options. + + `no_instrument_function' + If `-finstrument-functions' is given, profiling function calls will + be generated at entry and exit of most user-compiled functions. + Functions with this attribute will not be so instrumented. + + `section ("SECTION-NAME")' + Normally, the compiler places the code it generates in the `text' + section. Sometimes, however, you need additional sections, or you + need certain particular functions to appear in special sections. + The `section' attribute specifies that a function lives in a + particular section. For example, the declaration: + + extern void foobar (void) __attribute__ ((section ("bar"))); + + puts the function `foobar' in the `bar' section. + + Some file formats do not support arbitrary sections so the + `section' attribute is not available on all platforms. If you + need to map the entire contents of a module to a particular + section, consider using the facilities of the linker instead. + + `constructor' + `destructor' + The `constructor' attribute causes the function to be called + automatically before execution enters `main ()'. Similarly, the + `destructor' attribute causes the function to be called + automatically after `main ()' has completed or `exit ()' has been + called. Functions with these attributes are useful for + initializing data that will be used implicitly during the + execution of the program. + + These attributes are not currently implemented for Objective-C. + + `unused' + This attribute, attached to a function, means that the function is + meant to be possibly unused. GCC will not produce a warning for + this function. GNU C++ does not currently support this attribute + as definitions without parameters are valid in C++. + + `used' + This attribute, attached to a function, means that code must be + emitted for the function even if it appears that the function is + not referenced. This is useful, for example, when the function is + referenced only in inline assembly. + + `deprecated' + The `deprecated' attribute results in a warning if the function is + used anywhere in the source file. This is useful when identifying + functions that are expected to be removed in a future version of a + program. The warning also includes the location of the declaration + of the deprecated function, to enable users to easily find further + information about why the function is deprecated, or what they + should do instead. Note that the warnings only occurs for uses: + + int old_fn () __attribute__ ((deprecated)); + int old_fn (); + int (*fn_ptr)() = old_fn; + + results in a warning on line 3 but not line 2. + + The `deprecated' attribute can also be used for variables and + types (*note Variable Attributes::, *note Type Attributes::.) + + `weak' + The `weak' attribute causes the declaration to be emitted as a weak + symbol rather than a global. This is primarily useful in defining + library functions which can be overridden in user code, though it + can also be used with non-function declarations. Weak symbols are + supported for ELF targets, and also for a.out targets when using + the GNU assembler and linker. + + `malloc' + The `malloc' attribute is used to tell the compiler that a function + may be treated as if it were the malloc function. The compiler + assumes that calls to malloc result in a pointers that cannot + alias anything. This will often improve optimization. + + `alias ("TARGET")' + The `alias' attribute causes the declaration to be emitted as an + alias for another symbol, which must be specified. For instance, + + void __f () { /* do something */; } + void f () __attribute__ ((weak, alias ("__f"))); + + declares `f' to be a weak alias for `__f'. In C++, the mangled + name for the target must be used. + + Not all target machines support this attribute. + + `regparm (NUMBER)' + On the Intel 386, the `regparm' attribute causes the compiler to + pass up to NUMBER integer arguments in registers EAX, EDX, and ECX + instead of on the stack. Functions that take a variable number of + arguments will continue to be passed all of their arguments on the + stack. + + `stdcall' + On the Intel 386, the `stdcall' attribute causes the compiler to + assume that the called function will pop off the stack space used + to pass arguments, unless it takes a variable number of arguments. + + The PowerPC compiler for Windows NT currently ignores the `stdcall' + attribute. + + `cdecl' + On the Intel 386, the `cdecl' attribute causes the compiler to + assume that the calling function will pop off the stack space used + to pass arguments. This is useful to override the effects of the + `-mrtd' switch. + + The PowerPC compiler for Windows NT currently ignores the `cdecl' + attribute. + + `longcall' + On the RS/6000 and PowerPC, the `longcall' attribute causes the + compiler to always call the function via a pointer, so that + functions which reside further than 64 megabytes (67,108,864 + bytes) from the current location can be called. + + `long_call/short_call' + This attribute allows to specify how to call a particular function + on ARM. Both attributes override the `-mlong-calls' (*note ARM + Options::) command line switch and `#pragma long_calls' settings. + The `long_call' attribute causes the compiler to always call the + function by first loading its address into a register and then + using the contents of that register. The `short_call' attribute + always places the offset to the function from the call site into + the `BL' instruction directly. + + `dllimport' + On the PowerPC running Windows NT, the `dllimport' attribute causes + the compiler to call the function via a global pointer to the + function pointer that is set up by the Windows NT dll library. + The pointer name is formed by combining `__imp_' and the function + name. + + `dllexport' + On the PowerPC running Windows NT, the `dllexport' attribute causes + the compiler to provide a global pointer to the function pointer, + so that it can be called with the `dllimport' attribute. The + pointer name is formed by combining `__imp_' and the function name. + + `exception (EXCEPT-FUNC [, EXCEPT-ARG])' + On the PowerPC running Windows NT, the `exception' attribute causes + the compiler to modify the structured exception table entry it + emits for the declared function. The string or identifier + EXCEPT-FUNC is placed in the third entry of the structured + exception table. It represents a function, which is called by the + exception handling mechanism if an exception occurs. If it was + specified, the string or identifier EXCEPT-ARG is placed in the + fourth entry of the structured exception table. + + `function_vector' + Use this attribute on the H8/300 and H8/300H to indicate that the + specified function should be called through the function vector. + Calling a function through the function vector will reduce code + size, however; the function vector has a limited size (maximum 128 + entries on the H8/300 and 64 entries on the H8/300H) and shares + space with the interrupt vector. + + You must use GAS and GLD from GNU binutils version 2.7 or later for + this attribute to work correctly. + + `interrupt' + Use this attribute on the ARM, AVR, M32R/D and Xstormy16 ports to + indicate that the specified function is an interrupt handler. The + compiler will generate function entry and exit sequences suitable + for use in an interrupt handler when this attribute is present. + + Note, interrupt handlers for the H8/300, H8/300H and SH processors + can be specified via the `interrupt_handler' attribute. + + Note, on the AVR interrupts will be enabled inside the function. + + Note, for the ARM you can specify the kind of interrupt to be + handled by adding an optional parameter to the interrupt attribute + like this: + + void f () __attribute__ ((interrupt ("IRQ"))); + + Permissible values for this parameter are: IRQ, FIQ, SWI, ABORT + and UNDEF. + + `interrupt_handler' + Use this attribute on the H8/300, H8/300H and SH to indicate that + the specified function is an interrupt handler. The compiler will + generate function entry and exit sequences suitable for use in an + interrupt handler when this attribute is present. + + `sp_switch' + Use this attribute on the SH to indicate an `interrupt_handler' + function should switch to an alternate stack. It expects a string + argument that names a global variable holding the address of the + alternate stack. + + void *alt_stack; + void f () __attribute__ ((interrupt_handler, + sp_switch ("alt_stack"))); + + `trap_exit' + Use this attribute on the SH for an `interrupt_handle' to return + using `trapa' instead of `rte'. This attribute expects an integer + argument specifying the trap number to be used. + + `eightbit_data' + Use this attribute on the H8/300 and H8/300H to indicate that the + specified variable should be placed into the eight bit data + section. The compiler will generate more efficient code for + certain operations on data in the eight bit data area. Note the + eight bit data area is limited to 256 bytes of data. + + You must use GAS and GLD from GNU binutils version 2.7 or later for + this attribute to work correctly. + + `tiny_data' + Use this attribute on the H8/300H to indicate that the specified + variable should be placed into the tiny data section. The + compiler will generate more efficient code for loads and stores on + data in the tiny data section. Note the tiny data area is limited + to slightly under 32kbytes of data. + + `signal' + Use this attribute on the AVR to indicate that the specified + function is an signal handler. The compiler will generate function + entry and exit sequences suitable for use in an signal handler + when this attribute is present. Interrupts will be disabled + inside function. + + `naked' + Use this attribute on the ARM or AVR ports to indicate that the + specified function do not need prologue/epilogue sequences + generated by the compiler. It is up to the programmer to provide + these sequences. + + `model (MODEL-NAME)' + Use this attribute on the M32R/D to set the addressability of an + object, and the code generated for a function. The identifier + MODEL-NAME is one of `small', `medium', or `large', representing + each of the code models. + + Small model objects live in the lower 16MB of memory (so that their + addresses can be loaded with the `ld24' instruction), and are + callable with the `bl' instruction. + + Medium model objects may live anywhere in the 32-bit address space + (the compiler will generate `seth/add3' instructions to load their + addresses), and are callable with the `bl' instruction. + + Large model objects may live anywhere in the 32-bit address space + (the compiler will generate `seth/add3' instructions to load their + addresses), and may not be reachable with the `bl' instruction + (the compiler will generate the much slower `seth/add3/jl' + instruction sequence). + + + You can specify multiple attributes in a declaration by separating + them by commas within the double parentheses or by immediately + following an attribute declaration with another attribute declaration. + + Some people object to the `__attribute__' feature, suggesting that + ISO C's `#pragma' should be used instead. At the time `__attribute__' + was designed, there were two reasons for not doing this. + + 1. It is impossible to generate `#pragma' commands from a macro. + + 2. There is no telling what the same `#pragma' might mean in another + compiler. + + These two reasons applied to almost any application that might have + been proposed for `#pragma'. It was basically a mistake to use + `#pragma' for _anything_. + + The ISO C99 standard includes `_Pragma', which now allows pragmas to + be generated from macros. In addition, a `#pragma GCC' namespace is + now in use for GCC-specific pragmas. However, it has been found + convenient to use `__attribute__' to achieve a natural attachment of + attributes to their corresponding declarations, whereas `#pragma GCC' + is of use for constructs that do not naturally form part of the + grammar. *Note Miscellaneous Preprocessing Directives: (cpp)Other + Directives. + +  + File: gcc.info, Node: Attribute Syntax, Next: Function Prototypes, Prev: Function Attributes, Up: C Extensions + + Attribute Syntax + ================ + + This section describes the syntax with which `__attribute__' may be + used, and the constructs to which attribute specifiers bind, for the C + language. Some details may vary for C++ and Objective-C. Because of + infelicities in the grammar for attributes, some forms described here + may not be successfully parsed in all cases. + + There are some problems with the semantics of attributes in C++. For + example, there are no manglings for attributes, although they may affect + code generation, so problems may arise when attributed types are used in + conjunction with templates or overloading. Similarly, `typeid' does + not distinguish between types with different attributes. Support for + attributes in C++ may be restricted in future to attributes on + declarations only, but not on nested declarators. + + *Note Function Attributes::, for details of the semantics of + attributes applying to functions. *Note Variable Attributes::, for + details of the semantics of attributes applying to variables. *Note + Type Attributes::, for details of the semantics of attributes applying + to structure, union and enumerated types. + + An "attribute specifier" is of the form `__attribute__ + ((ATTRIBUTE-LIST))'. An "attribute list" is a possibly empty + comma-separated sequence of "attributes", where each attribute is one + of the following: + + * Empty. Empty attributes are ignored. + + * A word (which may be an identifier such as `unused', or a reserved + word such as `const'). + + * A word, followed by, in parentheses, parameters for the attribute. + These parameters take one of the following forms: + + * An identifier. For example, `mode' attributes use this form. + + * An identifier followed by a comma and a non-empty + comma-separated list of expressions. For example, `format' + attributes use this form. + + * A possibly empty comma-separated list of expressions. For + example, `format_arg' attributes use this form with the list + being a single integer constant expression, and `alias' + attributes use this form with the list being a single string + constant. + + An "attribute specifier list" is a sequence of one or more attribute + specifiers, not separated by any other tokens. + + An attribute specifier list may appear after the colon following a + label, other than a `case' or `default' label. The only attribute it + makes sense to use after a label is `unused'. This feature is intended + for code generated by programs which contains labels that may be unused + but which is compiled with `-Wall'. It would not normally be + appropriate to use in it human-written code, though it could be useful + in cases where the code that jumps to the label is contained within an + `#ifdef' conditional. + + An attribute specifier list may appear as part of a `struct', + `union' or `enum' specifier. It may go either immediately after the + `struct', `union' or `enum' keyword, or after the closing brace. It is + ignored if the content of the structure, union or enumerated type is + not defined in the specifier in which the attribute specifier list is + used--that is, in usages such as `struct __attribute__((foo)) bar' with + no following opening brace. Where attribute specifiers follow the + closing brace, they are considered to relate to the structure, union or + enumerated type defined, not to any enclosing declaration the type + specifier appears in, and the type defined is not complete until after + the attribute specifiers. + + Otherwise, an attribute specifier appears as part of a declaration, + counting declarations of unnamed parameters and type names, and relates + to that declaration (which may be nested in another declaration, for + example in the case of a parameter declaration), or to a particular + declarator within a declaration. Where an attribute specifier is + applied to a parameter declared as a function or an array, it should + apply to the function or array rather than the pointer to which the + parameter is implicitly converted, but this is not yet correctly + implemented. + + Any list of specifiers and qualifiers at the start of a declaration + may contain attribute specifiers, whether or not such a list may in that + context contain storage class specifiers. (Some attributes, however, + are essentially in the nature of storage class specifiers, and only make + sense where storage class specifiers may be used; for example, + `section'.) There is one necessary limitation to this syntax: the + first old-style parameter declaration in a function definition cannot + begin with an attribute specifier, because such an attribute applies to + the function instead by syntax described below (which, however, is not + yet implemented in this case). In some other cases, attribute + specifiers are permitted by this grammar but not yet supported by the + compiler. All attribute specifiers in this place relate to the + declaration as a whole. In the obsolescent usage where a type of `int' + is implied by the absence of type specifiers, such a list of specifiers + and qualifiers may be an attribute specifier list with no other + specifiers or qualifiers. + + An attribute specifier list may appear immediately before a + declarator (other than the first) in a comma-separated list of + declarators in a declaration of more than one identifier using a single + list of specifiers and qualifiers. Such attribute specifiers apply + only to the identifier before whose declarator they appear. For + example, in + + __attribute__((noreturn)) void d0 (void), + __attribute__((format(printf, 1, 2))) d1 (const char *, ...), + d2 (void) + + the `noreturn' attribute applies to all the functions declared; the + `format' attribute only applies to `d1'. + + An attribute specifier list may appear immediately before the comma, + `=' or semicolon terminating the declaration of an identifier other + than a function definition. At present, such attribute specifiers apply + to the declared object or function, but in future they may attach to the + outermost adjacent declarator. In simple cases there is no difference, + but, for example, in + + void (****f)(void) __attribute__((noreturn)); + + at present the `noreturn' attribute applies to `f', which causes a + warning since `f' is not a function, but in future it may apply to the + function `****f'. The precise semantics of what attributes in such + cases will apply to are not yet specified. Where an assembler name for + an object or function is specified (*note Asm Labels::), at present the + attribute must follow the `asm' specification; in future, attributes + before the `asm' specification may apply to the adjacent declarator, + and those after it to the declared object or function. + + An attribute specifier list may, in future, be permitted to appear + after the declarator in a function definition (before any old-style + parameter declarations or the function body). + + Attribute specifiers may be mixed with type qualifiers appearing + inside the `[]' of a parameter array declarator, in the C99 construct by + which such qualifiers are applied to the pointer to which the array is + implicitly converted. Such attribute specifiers apply to the pointer, + not to the array, but at present this is not implemented and they are + ignored. + + An attribute specifier list may appear at the start of a nested + declarator. At present, there are some limitations in this usage: the + attributes correctly apply to the declarator, but for most individual + attributes the semantics this implies are not implemented. When + attribute specifiers follow the `*' of a pointer declarator, they may + be mixed with any type qualifiers present. The following describes the + formal semantics of this syntax. It will make the most sense if you + are familiar with the formal specification of declarators in the ISO C + standard. + + Consider (as in C99 subclause 6.7.5 paragraph 4) a declaration `T + D1', where `T' contains declaration specifiers that specify a type TYPE + (such as `int') and `D1' is a declarator that contains an identifier + IDENT. The type specified for IDENT for derived declarators whose type + does not include an attribute specifier is as in the ISO C standard. + + If `D1' has the form `( ATTRIBUTE-SPECIFIER-LIST D )', and the + declaration `T D' specifies the type "DERIVED-DECLARATOR-TYPE-LIST + TYPE" for IDENT, then `T D1' specifies the type + "DERIVED-DECLARATOR-TYPE-LIST ATTRIBUTE-SPECIFIER-LIST TYPE" for IDENT. + + If `D1' has the form `* TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST + D', and the declaration `T D' specifies the type + "DERIVED-DECLARATOR-TYPE-LIST TYPE" for IDENT, then `T D1' specifies + the type "DERIVED-DECLARATOR-TYPE-LIST + TYPE-QUALIFIER-AND-ATTRIBUTE-SPECIFIER-LIST TYPE" for IDENT. + + For example, + + void (__attribute__((noreturn)) ****f) (void); + + specifies the type "pointer to pointer to pointer to pointer to + non-returning function returning `void'". As another example, + + char *__attribute__((aligned(8))) *f; + + specifies the type "pointer to 8-byte-aligned pointer to `char'". Note + again that this does not work with most attributes; for example, the + usage of `aligned' and `noreturn' attributes given above is not yet + supported. + + For compatibility with existing code written for compiler versions + that did not implement attributes on nested declarators, some laxity is + allowed in the placing of attributes. If an attribute that only applies + to types is applied to a declaration, it will be treated as applying to + the type of that declaration. If an attribute that only applies to + declarations is applied to the type of a declaration, it will be treated + as applying to that declaration; and, for compatibility with code + placing the attributes immediately before the identifier declared, such + an attribute applied to a function return type will be treated as + applying to the function type, and such an attribute applied to an array + element type will be treated as applying to the array type. If an + attribute that only applies to function types is applied to a + pointer-to-function type, it will be treated as applying to the pointer + target type; if such an attribute is applied to a function return type + that is not a pointer-to-function type, it will be treated as applying + to the function type. + +  + File: gcc.info, Node: Function Prototypes, Next: C++ Comments, Prev: Attribute Syntax, Up: C Extensions + + Prototypes and Old-Style Function Definitions + ============================================= + + GNU C extends ISO C to allow a function prototype to override a later + old-style non-prototype definition. Consider the following example: + + /* Use prototypes unless the compiler is old-fashioned. */ + #ifdef __STDC__ + #define P(x) x + #else + #define P(x) () + #endif + + /* Prototype function declaration. */ + int isroot P((uid_t)); + + /* Old-style function definition. */ + int + isroot (x) /* ??? lossage here ??? */ + uid_t x; + { + return x == 0; + } + + Suppose the type `uid_t' happens to be `short'. ISO C does not + allow this example, because subword arguments in old-style + non-prototype definitions are promoted. Therefore in this example the + function definition's argument is really an `int', which does not match + the prototype argument type of `short'. + + This restriction of ISO C makes it hard to write code that is + portable to traditional C compilers, because the programmer does not + know whether the `uid_t' type is `short', `int', or `long'. Therefore, + in cases like these GNU C allows a prototype to override a later + old-style definition. More precisely, in GNU C, a function prototype + argument type overrides the argument type specified by a later + old-style definition if the former type is the same as the latter type + before promotion. Thus in GNU C the above example is equivalent to the + following: + + int isroot (uid_t); + + int + isroot (uid_t x) + { + return x == 0; + } + + GNU C++ does not support old-style function definitions, so this + extension is irrelevant. + +  + File: gcc.info, Node: C++ Comments, Next: Dollar Signs, Prev: Function Prototypes, Up: C Extensions + + C++ Style Comments + ================== + + In GNU C, you may use C++ style comments, which start with `//' and + continue until the end of the line. Many other C implementations allow + such comments, and they are likely to be in a future C standard. + However, C++ style comments are not recognized if you specify `-ansi', + a `-std' option specifying a version of ISO C before C99, or + `-traditional', since they are incompatible with traditional constructs + like `dividend//*comment*/divisor'. + +  + File: gcc.info, Node: Dollar Signs, Next: Character Escapes, Prev: C++ Comments, Up: C Extensions + + Dollar Signs in Identifier Names + ================================ + + In GNU C, you may normally use dollar signs in identifier names. + This is because many traditional C implementations allow such + identifiers. However, dollar signs in identifiers are not supported on + a few target machines, typically because the target assembler does not + allow them. + +  + File: gcc.info, Node: Character Escapes, Next: Variable Attributes, Prev: Dollar Signs, Up: C Extensions + + The Character in Constants + ================================ + + You can use the sequence `\e' in a string or character constant to + stand for the ASCII character . + +  + File: gcc.info, Node: Alignment, Next: Inline, Prev: Type Attributes, Up: C Extensions + + Inquiring on Alignment of Types or Variables + ============================================ + + The keyword `__alignof__' allows you to inquire about how an object + is aligned, or the minimum alignment usually required by a type. Its + syntax is just like `sizeof'. + + For example, if the target machine requires a `double' value to be + aligned on an 8-byte boundary, then `__alignof__ (double)' is 8. This + is true on many RISC machines. On more traditional machine designs, + `__alignof__ (double)' is 4 or even 2. + + Some machines never actually require alignment; they allow reference + to any data type even at an odd addresses. For these machines, + `__alignof__' reports the _recommended_ alignment of a type. + + If the operand of `__alignof__' is an lvalue rather than a type, its + value is the required alignment for its type, taking into account any + minimum alignment specified with GCC's `__attribute__' extension (*note + Variable Attributes::). For example, after this declaration: + + struct foo { int x; char y; } foo1; + + the value of `__alignof__ (foo1.y)' is 1, even though its actual + alignment is probably 2 or 4, the same as `__alignof__ (int)'. + + It is an error to ask for the alignment of an incomplete type. + +  + File: gcc.info, Node: Variable Attributes, Next: Type Attributes, Prev: Character Escapes, Up: C Extensions + + Specifying Attributes of Variables + ================================== + + The keyword `__attribute__' allows you to specify special attributes + of variables or structure fields. This keyword is followed by an + attribute specification inside double parentheses. Ten attributes are + currently defined for variables: `aligned', `mode', `nocommon', + `packed', `section', `transparent_union', `unused', `deprecated', + `vector_size', and `weak'. Some other attributes are defined for + variables on particular target systems. Other attributes are available + for functions (*note Function Attributes::) and for types (*note Type + Attributes::). Other front ends might define more attributes (*note + Extensions to the C++ Language: C++ Extensions.). + + You may also specify attributes with `__' preceding and following + each keyword. This allows you to use them in header files without + being concerned about a possible macro of the same name. For example, + you may use `__aligned__' instead of `aligned'. + + *Note Attribute Syntax::, for details of the exact syntax for using + attributes. + + `aligned (ALIGNMENT)' + This attribute specifies a minimum alignment for the variable or + structure field, measured in bytes. For example, the declaration: + + int x __attribute__ ((aligned (16))) = 0; + + causes the compiler to allocate the global variable `x' on a + 16-byte boundary. On a 68040, this could be used in conjunction + with an `asm' expression to access the `move16' instruction which + requires 16-byte aligned operands. + + You can also specify the alignment of structure fields. For + example, to create a double-word aligned `int' pair, you could + write: + + struct foo { int x[2] __attribute__ ((aligned (8))); }; + + This is an alternative to creating a union with a `double' member + that forces the union to be double-word aligned. + + As in the preceding examples, you can explicitly specify the + alignment (in bytes) that you wish the compiler to use for a given + variable or structure field. Alternatively, you can leave out the + alignment factor and just ask the compiler to align a variable or + field to the maximum useful alignment for the target machine you + are compiling for. For example, you could write: + + short array[3] __attribute__ ((aligned)); + + Whenever you leave out the alignment factor in an `aligned' + attribute specification, the compiler automatically sets the + alignment for the declared variable or field to the largest + alignment which is ever used for any data type on the target + machine you are compiling for. Doing this can often make copy + operations more efficient, because the compiler can use whatever + instructions copy the biggest chunks of memory when performing + copies to or from the variables or fields that you have aligned + this way. + + The `aligned' attribute can only increase the alignment; but you + can decrease it by specifying `packed' as well. See below. + + Note that the effectiveness of `aligned' attributes may be limited + by inherent limitations in your linker. On many systems, the + linker is only able to arrange for variables to be aligned up to a + certain maximum alignment. (For some linkers, the maximum + supported alignment may be very very small.) If your linker is + only able to align variables up to a maximum of 8 byte alignment, + then specifying `aligned(16)' in an `__attribute__' will still + only provide you with 8 byte alignment. See your linker + documentation for further information. + + `mode (MODE)' + This attribute specifies the data type for the + declaration--whichever type corresponds to the mode MODE. This in + effect lets you request an integer or floating point type + according to its width. + + You may also specify a mode of `byte' or `__byte__' to indicate + the mode corresponding to a one-byte integer, `word' or `__word__' + for the mode of a one-word integer, and `pointer' or `__pointer__' + for the mode used to represent pointers. + + `nocommon' + This attribute specifies requests GCC not to place a variable + "common" but instead to allocate space for it directly. If you + specify the `-fno-common' flag, GCC will do this for all variables. + + Specifying the `nocommon' attribute for a variable provides an + initialization of zeros. A variable may only be initialized in one + source file. + + `packed' + The `packed' attribute specifies that a variable or structure field + should have the smallest possible alignment--one byte for a + variable, and one bit for a field, unless you specify a larger + value with the `aligned' attribute. + + Here is a structure in which the field `x' is packed, so that it + immediately follows `a': + + struct foo + { + char a; + int x[2] __attribute__ ((packed)); + }; + + `section ("SECTION-NAME")' + Normally, the compiler places the objects it generates in sections + like `data' and `bss'. Sometimes, however, you need additional + sections, or you need certain particular variables to appear in + special sections, for example to map to special hardware. The + `section' attribute specifies that a variable (or function) lives + in a particular section. For example, this small program uses + several specific section names: + + struct duart a __attribute__ ((section ("DUART_A"))) = { 0 }; + struct duart b __attribute__ ((section ("DUART_B"))) = { 0 }; + char stack[10000] __attribute__ ((section ("STACK"))) = { 0 }; + int init_data __attribute__ ((section ("INITDATA"))) = 0; + + main() + { + /* Initialize stack pointer */ + init_sp (stack + sizeof (stack)); + + /* Initialize initialized data */ + memcpy (&init_data, &data, &edata - &data); + + /* Turn on the serial ports */ + init_duart (&a); + init_duart (&b); + } + + Use the `section' attribute with an _initialized_ definition of a + _global_ variable, as shown in the example. GCC issues a warning + and otherwise ignores the `section' attribute in uninitialized + variable declarations. + + You may only use the `section' attribute with a fully initialized + global definition because of the way linkers work. The linker + requires each object be defined once, with the exception that + uninitialized variables tentatively go in the `common' (or `bss') + section and can be multiply "defined". You can force a variable + to be initialized with the `-fno-common' flag or the `nocommon' + attribute. + + Some file formats do not support arbitrary sections so the + `section' attribute is not available on all platforms. If you + need to map the entire contents of a module to a particular + section, consider using the facilities of the linker instead. + + `shared' + On Windows NT, in addition to putting variable definitions in a + named section, the section can also be shared among all running + copies of an executable or DLL. For example, this small program + defines shared data by putting it in a named section `shared' and + marking the section shareable: + + int foo __attribute__((section ("shared"), shared)) = 0; + + int + main() + { + /* Read and write foo. All running + copies see the same value. */ + return 0; + } + + You may only use the `shared' attribute along with `section' + attribute with a fully initialized global definition because of + the way linkers work. See `section' attribute for more + information. + + The `shared' attribute is only available on Windows NT. + + `transparent_union' + This attribute, attached to a function parameter which is a union, + means that the corresponding argument may have the type of any + union member, but the argument is passed as if its type were that + of the first union member. For more details see *Note Type + Attributes::. You can also use this attribute on a `typedef' for + a union data type; then it applies to all function parameters with + that type. + + `unused' + This attribute, attached to a variable, means that the variable is + meant to be possibly unused. GCC will not produce a warning for + this variable. + + `deprecated' + The `deprecated' attribute results in a warning if the variable is + used anywhere in the source file. This is useful when identifying + variables that are expected to be removed in a future version of a + program. The warning also includes the location of the declaration + of the deprecated variable, to enable users to easily find further + information about why the variable is deprecated, or what they + should do instead. Note that the warnings only occurs for uses: + + extern int old_var __attribute__ ((deprecated)); + extern int old_var; + int new_fn () { return old_var; } + + results in a warning on line 3 but not line 2. + + The `deprecated' attribute can also be used for functions and + types (*note Function Attributes::, *note Type Attributes::.) + + `vector_size (BYTES)' + This attribute specifies the vector size for the variable, + measured in bytes. For example, the declaration: + + int foo __attribute__ ((vector_size (16))); + + causes the compiler to set the mode for `foo', to be 16 bytes, + divided into `int' sized units. Assuming a 32-bit int (a vector of + 4 units of 4 bytes), the corresponding mode of `foo' will be V4SI. + + This attribute is only applicable to integral and float scalars, + although arrays, pointers, and function return values are allowed + in conjunction with this construct. + + Aggregates with this attribute are invalid, even if they are of + the same size as a corresponding scalar. For example, the + declaration: + + struct S { int a; }; + struct S __attribute__ ((vector_size (16))) foo; + + is invalid even if the size of the structure is the same as the + size of the `int'. + + `weak' + The `weak' attribute is described in *Note Function Attributes::. + + `model (MODEL-NAME)' + Use this attribute on the M32R/D to set the addressability of an + object. The identifier MODEL-NAME is one of `small', `medium', or + `large', representing each of the code models. + + Small model objects live in the lower 16MB of memory (so that their + addresses can be loaded with the `ld24' instruction). + + Medium and large model objects may live anywhere in the 32-bit + address space (the compiler will generate `seth/add3' instructions + to load their addresses). + + + To specify multiple attributes, separate them by commas within the + double parentheses: for example, `__attribute__ ((aligned (16), + packed))'. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-13 gcc-3.2.3/gcc/doc/gcc.info-13 *** gcc-3.2.2/gcc/doc/gcc.info-13 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-13 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,981 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Type Attributes, Next: Alignment, Prev: Variable Attributes, Up: C Extensions + + Specifying Attributes of Types + ============================== + + The keyword `__attribute__' allows you to specify special attributes + of `struct' and `union' types when you define such types. This keyword + is followed by an attribute specification inside double parentheses. + Five attributes are currently defined for types: `aligned', `packed', + `transparent_union', `unused', and `deprecated'. Other attributes are + defined for functions (*note Function Attributes::) and for variables + (*note Variable Attributes::). + + You may also specify any one of these attributes with `__' preceding + and following its keyword. This allows you to use these attributes in + header files without being concerned about a possible macro of the same + name. For example, you may use `__aligned__' instead of `aligned'. + + You may specify the `aligned' and `transparent_union' attributes + either in a `typedef' declaration or just past the closing curly brace + of a complete enum, struct or union type _definition_ and the `packed' + attribute only past the closing brace of a definition. + + You may also specify attributes between the enum, struct or union + tag and the name of the type rather than after the closing brace. + + *Note Attribute Syntax::, for details of the exact syntax for using + attributes. + + `aligned (ALIGNMENT)' + This attribute specifies a minimum alignment (in bytes) for + variables of the specified type. For example, the declarations: + + struct S { short f[3]; } __attribute__ ((aligned (8))); + typedef int more_aligned_int __attribute__ ((aligned (8))); + + force the compiler to insure (as far as it can) that each variable + whose type is `struct S' or `more_aligned_int' will be allocated + and aligned _at least_ on a 8-byte boundary. On a Sparc, having + all variables of type `struct S' aligned to 8-byte boundaries + allows the compiler to use the `ldd' and `std' (doubleword load and + store) instructions when copying one variable of type `struct S' to + another, thus improving run-time efficiency. + + Note that the alignment of any given `struct' or `union' type is + required by the ISO C standard to be at least a perfect multiple of + the lowest common multiple of the alignments of all of the members + of the `struct' or `union' in question. This means that you _can_ + effectively adjust the alignment of a `struct' or `union' type by + attaching an `aligned' attribute to any one of the members of such + a type, but the notation illustrated in the example above is a + more obvious, intuitive, and readable way to request the compiler + to adjust the alignment of an entire `struct' or `union' type. + + As in the preceding example, you can explicitly specify the + alignment (in bytes) that you wish the compiler to use for a given + `struct' or `union' type. Alternatively, you can leave out the + alignment factor and just ask the compiler to align a type to the + maximum useful alignment for the target machine you are compiling + for. For example, you could write: + + struct S { short f[3]; } __attribute__ ((aligned)); + + Whenever you leave out the alignment factor in an `aligned' + attribute specification, the compiler automatically sets the + alignment for the type to the largest alignment which is ever used + for any data type on the target machine you are compiling for. + Doing this can often make copy operations more efficient, because + the compiler can use whatever instructions copy the biggest chunks + of memory when performing copies to or from the variables which + have types that you have aligned this way. + + In the example above, if the size of each `short' is 2 bytes, then + the size of the entire `struct S' type is 6 bytes. The smallest + power of two which is greater than or equal to that is 8, so the + compiler sets the alignment for the entire `struct S' type to 8 + bytes. + + Note that although you can ask the compiler to select a + time-efficient alignment for a given type and then declare only + individual stand-alone objects of that type, the compiler's + ability to select a time-efficient alignment is primarily useful + only when you plan to create arrays of variables having the + relevant (efficiently aligned) type. If you declare or use arrays + of variables of an efficiently-aligned type, then it is likely + that your program will also be doing pointer arithmetic (or + subscripting, which amounts to the same thing) on pointers to the + relevant type, and the code that the compiler generates for these + pointer arithmetic operations will often be more efficient for + efficiently-aligned types than for other types. + + The `aligned' attribute can only increase the alignment; but you + can decrease it by specifying `packed' as well. See below. + + Note that the effectiveness of `aligned' attributes may be limited + by inherent limitations in your linker. On many systems, the + linker is only able to arrange for variables to be aligned up to a + certain maximum alignment. (For some linkers, the maximum + supported alignment may be very very small.) If your linker is + only able to align variables up to a maximum of 8 byte alignment, + then specifying `aligned(16)' in an `__attribute__' will still + only provide you with 8 byte alignment. See your linker + documentation for further information. + + `packed' + This attribute, attached to an `enum', `struct', or `union' type + definition, specified that the minimum required memory be used to + represent the type. + + Specifying this attribute for `struct' and `union' types is + equivalent to specifying the `packed' attribute on each of the + structure or union members. Specifying the `-fshort-enums' flag + on the line is equivalent to specifying the `packed' attribute on + all `enum' definitions. + + You may only specify this attribute after a closing curly brace on + an `enum' definition, not in a `typedef' declaration, unless that + declaration also contains the definition of the `enum'. + + `transparent_union' + This attribute, attached to a `union' type definition, indicates + that any function parameter having that union type causes calls to + that function to be treated in a special way. + + First, the argument corresponding to a transparent union type can + be of any type in the union; no cast is required. Also, if the + union contains a pointer type, the corresponding argument can be a + null pointer constant or a void pointer expression; and if the + union contains a void pointer type, the corresponding argument can + be any pointer expression. If the union member type is a pointer, + qualifiers like `const' on the referenced type must be respected, + just as with normal pointer conversions. + + Second, the argument is passed to the function using the calling + conventions of first member of the transparent union, not the + calling conventions of the union itself. All members of the union + must have the same machine representation; this is necessary for + this argument passing to work properly. + + Transparent unions are designed for library functions that have + multiple interfaces for compatibility reasons. For example, + suppose the `wait' function must accept either a value of type + `int *' to comply with Posix, or a value of type `union wait *' to + comply with the 4.1BSD interface. If `wait''s parameter were + `void *', `wait' would accept both kinds of arguments, but it + would also accept any other pointer type and this would make + argument type checking less useful. Instead, `' might + define the interface as follows: + + typedef union + { + int *__ip; + union wait *__up; + } wait_status_ptr_t __attribute__ ((__transparent_union__)); + + pid_t wait (wait_status_ptr_t); + + This interface allows either `int *' or `union wait *' arguments + to be passed, using the `int *' calling convention. The program + can call `wait' with arguments of either type: + + int w1 () { int w; return wait (&w); } + int w2 () { union wait w; return wait (&w); } + + With this interface, `wait''s implementation might look like this: + + pid_t wait (wait_status_ptr_t p) + { + return waitpid (-1, p.__ip, 0); + } + + `unused' + When attached to a type (including a `union' or a `struct'), this + attribute means that variables of that type are meant to appear + possibly unused. GCC will not produce a warning for any variables + of that type, even if the variable appears to do nothing. This is + often the case with lock or thread classes, which are usually + defined and then not referenced, but contain constructors and + destructors that have nontrivial bookkeeping functions. + + `deprecated' + The `deprecated' attribute results in a warning if the type is + used anywhere in the source file. This is useful when identifying + types that are expected to be removed in a future version of a + program. If possible, the warning also includes the location of + the declaration of the deprecated type, to enable users to easily + find further information about why the type is deprecated, or what + they should do instead. Note that the warnings only occur for + uses and then only if the type is being applied to an identifier + that itself is not being declared as deprecated. + + typedef int T1 __attribute__ ((deprecated)); + T1 x; + typedef T1 T2; + T2 y; + typedef T1 T3 __attribute__ ((deprecated)); + T3 z __attribute__ ((deprecated)); + + results in a warning on line 2 and 3 but not lines 4, 5, or 6. No + warning is issued for line 4 because T2 is not explicitly + deprecated. Line 5 has no warning because T3 is explicitly + deprecated. Similarly for line 6. + + The `deprecated' attribute can also be used for functions and + variables (*note Function Attributes::, *note Variable + Attributes::.) + + + To specify multiple attributes, separate them by commas within the + double parentheses: for example, `__attribute__ ((aligned (16), + packed))'. + +  + File: gcc.info, Node: Inline, Next: Extended Asm, Prev: Alignment, Up: C Extensions + + An Inline Function is As Fast As a Macro + ======================================== + + By declaring a function `inline', you can direct GCC to integrate + that function's code into the code for its callers. This makes + execution faster by eliminating the function-call overhead; in + addition, if any of the actual argument values are constant, their known + values may permit simplifications at compile time so that not all of the + inline function's code needs to be included. The effect on code size is + less predictable; object code may be larger or smaller with function + inlining, depending on the particular case. Inlining of functions is an + optimization and it really "works" only in optimizing compilation. If + you don't use `-O', no function is really inline. + + Inline functions are included in the ISO C99 standard, but there are + currently substantial differences between what GCC implements and what + the ISO C99 standard requires. + + To declare a function inline, use the `inline' keyword in its + declaration, like this: + + inline int + inc (int *a) + { + (*a)++; + } + + (If you are writing a header file to be included in ISO C programs, + write `__inline__' instead of `inline'. *Note Alternate Keywords::.) + You can also make all "simple enough" functions inline with the option + `-finline-functions'. + + Note that certain usages in a function definition can make it + unsuitable for inline substitution. Among these usages are: use of + varargs, use of alloca, use of variable sized data types (*note + Variable Length::), use of computed goto (*note Labels as Values::), + use of nonlocal goto, and nested functions (*note Nested Functions::). + Using `-Winline' will warn when a function marked `inline' could not be + substituted, and will give the reason for the failure. + + Note that in C and Objective-C, unlike C++, the `inline' keyword + does not affect the linkage of the function. + + GCC automatically inlines member functions defined within the class + body of C++ programs even if they are not explicitly declared `inline'. + (You can override this with `-fno-default-inline'; *note Options + Controlling C++ Dialect: C++ Dialect Options..) + + When a function is both inline and `static', if all calls to the + function are integrated into the caller, and the function's address is + never used, then the function's own assembler code is never referenced. + In this case, GCC does not actually output assembler code for the + function, unless you specify the option `-fkeep-inline-functions'. + Some calls cannot be integrated for various reasons (in particular, + calls that precede the function's definition cannot be integrated, and + neither can recursive calls within the definition). If there is a + nonintegrated call, then the function is compiled to assembler code as + usual. The function must also be compiled as usual if the program + refers to its address, because that can't be inlined. + + When an inline function is not `static', then the compiler must + assume that there may be calls from other source files; since a global + symbol can be defined only once in any program, the function must not + be defined in the other source files, so the calls therein cannot be + integrated. Therefore, a non-`static' inline function is always + compiled on its own in the usual fashion. + + If you specify both `inline' and `extern' in the function + definition, then the definition is used only for inlining. In no case + is the function compiled on its own, not even if you refer to its + address explicitly. Such an address becomes an external reference, as + if you had only declared the function, and had not defined it. + + This combination of `inline' and `extern' has almost the effect of a + macro. The way to use it is to put a function definition in a header + file with these keywords, and put another copy of the definition + (lacking `inline' and `extern') in a library file. The definition in + the header file will cause most calls to the function to be inlined. + If any uses of the function remain, they will refer to the single copy + in the library. + + For future compatibility with when GCC implements ISO C99 semantics + for inline functions, it is best to use `static inline' only. (The + existing semantics will remain available when `-std=gnu89' is + specified, but eventually the default will be `-std=gnu99' and that + will implement the C99 semantics, though it does not do so yet.) + + GCC does not inline any functions when not optimizing unless you + specify the `always_inline' attribute for the function, like this: + + /* Prototype. */ + inline void foo (const char) __attribute__((always_inline)); + +  + File: gcc.info, Node: Extended Asm, Next: Constraints, Prev: Inline, Up: C Extensions + + Assembler Instructions with C Expression Operands + ================================================= + + In an assembler instruction using `asm', you can specify the + operands of the instruction using C expressions. This means you need + not guess which registers or memory locations will contain the data you + want to use. + + You must specify an assembler instruction template much like what + appears in a machine description, plus an operand constraint string for + each operand. + + For example, here is how to use the 68881's `fsinx' instruction: + + asm ("fsinx %1,%0" : "=f" (result) : "f" (angle)); + + Here `angle' is the C expression for the input operand while `result' + is that of the output operand. Each has `"f"' as its operand + constraint, saying that a floating point register is required. The `=' + in `=f' indicates that the operand is an output; all output operands' + constraints must use `='. The constraints use the same language used + in the machine description (*note Constraints::). + + Each operand is described by an operand-constraint string followed by + the C expression in parentheses. A colon separates the assembler + template from the first output operand and another separates the last + output operand from the first input, if any. Commas separate the + operands within each group. The total number of operands is currently + limited to 30; this limitation may be lifted in some future version of + GCC. + + If there are no output operands but there are input operands, you + must place two consecutive colons surrounding the place where the output + operands would go. + + As of GCC version 3.1, it is also possible to specify input and + output operands using symbolic names which can be referenced within the + assembler code. These names are specified inside square brackets + preceding the constraint string, and can be referenced inside the + assembler code using `%[NAME]' instead of a percentage sign followed by + the operand number. Using named operands the above example could look + like: + + asm ("fsinx %[angle],%[output]" + : [output] "=f" (result) + : [angle] "f" (angle)); + + Note that the symbolic operand names have no relation whatsoever to + other C identifiers. You may use any name you like, even those of + existing C symbols, but must ensure that no two operands within the same + assembler construct use the same symbolic name. + + Output operand expressions must be lvalues; the compiler can check + this. The input operands need not be lvalues. The compiler cannot + check whether the operands have data types that are reasonable for the + instruction being executed. It does not parse the assembler instruction + template and does not know what it means or even whether it is valid + assembler input. The extended `asm' feature is most often used for + machine instructions the compiler itself does not know exist. If the + output expression cannot be directly addressed (for example, it is a + bit-field), your constraint must allow a register. In that case, GCC + will use the register as the output of the `asm', and then store that + register into the output. + + The ordinary output operands must be write-only; GCC will assume that + the values in these operands before the instruction are dead and need + not be generated. Extended asm supports input-output or read-write + operands. Use the constraint character `+' to indicate such an operand + and list it with the output operands. + + When the constraints for the read-write operand (or the operand in + which only some of the bits are to be changed) allows a register, you + may, as an alternative, logically split its function into two separate + operands, one input operand and one write-only output operand. The + connection between them is expressed by constraints which say they need + to be in the same location when the instruction executes. You can use + the same C expression for both operands, or different expressions. For + example, here we write the (fictitious) `combine' instruction with + `bar' as its read-only source operand and `foo' as its read-write + destination: + + asm ("combine %2,%0" : "=r" (foo) : "0" (foo), "g" (bar)); + + The constraint `"0"' for operand 1 says that it must occupy the same + location as operand 0. A number in constraint is allowed only in an + input operand and it must refer to an output operand. + + Only a number in the constraint can guarantee that one operand will + be in the same place as another. The mere fact that `foo' is the value + of both operands is not enough to guarantee that they will be in the + same place in the generated assembler code. The following would not + work reliably: + + asm ("combine %2,%0" : "=r" (foo) : "r" (foo), "g" (bar)); + + Various optimizations or reloading could cause operands 0 and 1 to + be in different registers; GCC knows no reason not to do so. For + example, the compiler might find a copy of the value of `foo' in one + register and use it for operand 1, but generate the output operand 0 in + a different register (copying it afterward to `foo''s own address). Of + course, since the register for operand 1 is not even mentioned in the + assembler code, the result will not work, but GCC can't tell that. + + As of GCC version 3.1, one may write `[NAME]' instead of the operand + number for a matching constraint. For example: + + asm ("cmoveq %1,%2,%[result]" + : [result] "=r"(result) + : "r" (test), "r"(new), "[result]"(old)); + + Some instructions clobber specific hard registers. To describe this, + write a third colon after the input operands, followed by the names of + the clobbered hard registers (given as strings). Here is a realistic + example for the VAX: + + asm volatile ("movc3 %0,%1,%2" + : /* no outputs */ + : "g" (from), "g" (to), "g" (count) + : "r0", "r1", "r2", "r3", "r4", "r5"); + + You may not write a clobber description in a way that overlaps with + an input or output operand. For example, you may not have an operand + describing a register class with one member if you mention that register + in the clobber list. There is no way for you to specify that an input + operand is modified without also specifying it as an output operand. + Note that if all the output operands you specify are for this purpose + (and hence unused), you will then also need to specify `volatile' for + the `asm' construct, as described below, to prevent GCC from deleting + the `asm' statement as unused. + + If you refer to a particular hardware register from the assembler + code, you will probably have to list the register after the third colon + to tell the compiler the register's value is modified. In some + assemblers, the register names begin with `%'; to produce one `%' in the + assembler code, you must write `%%' in the input. + + If your assembler instruction can alter the condition code register, + add `cc' to the list of clobbered registers. GCC on some machines + represents the condition codes as a specific hardware register; `cc' + serves to name this register. On other machines, the condition code is + handled differently, and specifying `cc' has no effect. But it is + valid no matter what the machine. + + If your assembler instruction modifies memory in an unpredictable + fashion, add `memory' to the list of clobbered registers. This will + cause GCC to not keep memory values cached in registers across the + assembler instruction. You will also want to add the `volatile' + keyword if the memory affected is not listed in the inputs or outputs + of the `asm', as the `memory' clobber does not count as a side-effect + of the `asm'. + + You can put multiple assembler instructions together in a single + `asm' template, separated by the characters normally used in assembly + code for the system. A combination that works in most places is a + newline to break the line, plus a tab character to move to the + instruction field (written as `\n\t'). Sometimes semicolons can be + used, if the assembler allows semicolons as a line-breaking character. + Note that some assembler dialects use semicolons to start a comment. + The input operands are guaranteed not to use any of the clobbered + registers, and neither will the output operands' addresses, so you can + read and write the clobbered registers as many times as you like. Here + is an example of multiple instructions in a template; it assumes the + subroutine `_foo' accepts arguments in registers 9 and 10: + + asm ("movl %0,r9\n\tmovl %1,r10\n\tcall _foo" + : /* no outputs */ + : "g" (from), "g" (to) + : "r9", "r10"); + + Unless an output operand has the `&' constraint modifier, GCC may + allocate it in the same register as an unrelated input operand, on the + assumption the inputs are consumed before the outputs are produced. + This assumption may be false if the assembler code actually consists of + more than one instruction. In such a case, use `&' for each output + operand that may not overlap an input. *Note Modifiers::. + + If you want to test the condition code produced by an assembler + instruction, you must include a branch and a label in the `asm' + construct, as follows: + + asm ("clr %0\n\tfrob %1\n\tbeq 0f\n\tmov #1,%0\n0:" + : "g" (result) + : "g" (input)); + + This assumes your assembler supports local labels, as the GNU assembler + and most Unix assemblers do. + + Speaking of labels, jumps from one `asm' to another are not + supported. The compiler's optimizers do not know about these jumps, and + therefore they cannot take account of them when deciding how to + optimize. + + Usually the most convenient way to use these `asm' instructions is to + encapsulate them in macros that look like functions. For example, + + #define sin(x) \ + ({ double __value, __arg = (x); \ + asm ("fsinx %1,%0": "=f" (__value): "f" (__arg)); \ + __value; }) + + Here the variable `__arg' is used to make sure that the instruction + operates on a proper `double' value, and to accept only those arguments + `x' which can convert automatically to a `double'. + + Another way to make sure the instruction operates on the correct data + type is to use a cast in the `asm'. This is different from using a + variable `__arg' in that it converts more different types. For + example, if the desired type were `int', casting the argument to `int' + would accept a pointer with no complaint, while assigning the argument + to an `int' variable named `__arg' would warn about using a pointer + unless the caller explicitly casts it. + + If an `asm' has output operands, GCC assumes for optimization + purposes the instruction has no side effects except to change the output + operands. This does not mean instructions with a side effect cannot be + used, but you must be careful, because the compiler may eliminate them + if the output operands aren't used, or move them out of loops, or + replace two with one if they constitute a common subexpression. Also, + if your instruction does have a side effect on a variable that otherwise + appears not to change, the old value of the variable may be reused later + if it happens to be found in a register. + + You can prevent an `asm' instruction from being deleted, moved + significantly, or combined, by writing the keyword `volatile' after the + `asm'. For example: + + #define get_and_set_priority(new) \ + ({ int __old; \ + asm volatile ("get_and_set_priority %0, %1" \ + : "=g" (__old) : "g" (new)); \ + __old; }) + + If you write an `asm' instruction with no outputs, GCC will know the + instruction has side-effects and will not delete the instruction or + move it outside of loops. + + The `volatile' keyword indicates that the instruction has important + side-effects. GCC will not delete a volatile `asm' if it is reachable. + (The instruction can still be deleted if GCC can prove that + control-flow will never reach the location of the instruction.) In + addition, GCC will not reschedule instructions across a volatile `asm' + instruction. For example: + + *(volatile int *)addr = foo; + asm volatile ("eieio" : : ); + + Assume `addr' contains the address of a memory mapped device register. + The PowerPC `eieio' instruction (Enforce In-order Execution of I/O) + tells the CPU to make sure that the store to that device register + happens before it issues any other I/O. + + Note that even a volatile `asm' instruction can be moved in ways + that appear insignificant to the compiler, such as across jump + instructions. You can't expect a sequence of volatile `asm' + instructions to remain perfectly consecutive. If you want consecutive + output, use a single `asm'. Also, GCC will perform some optimizations + across a volatile `asm' instruction; GCC does not "forget everything" + when it encounters a volatile `asm' instruction the way some other + compilers do. + + An `asm' instruction without any operands or clobbers (an "old + style" `asm') will be treated identically to a volatile `asm' + instruction. + + It is a natural idea to look for a way to give access to the + condition code left by the assembler instruction. However, when we + attempted to implement this, we found no way to make it work reliably. + The problem is that output operands might need reloading, which would + result in additional following "store" instructions. On most machines, + these instructions would alter the condition code before there was time + to test it. This problem doesn't arise for ordinary "test" and + "compare" instructions because they don't have any output operands. + + For reasons similar to those described above, it is not possible to + give an assembler instruction access to the condition code left by + previous instructions. + + If you are writing a header file that should be includable in ISO C + programs, write `__asm__' instead of `asm'. *Note Alternate Keywords::. + + i386 floating point asm operands + -------------------------------- + + There are several rules on the usage of stack-like regs in + asm_operands insns. These rules apply only to the operands that are + stack-like regs: + + 1. Given a set of input regs that die in an asm_operands, it is + necessary to know which are implicitly popped by the asm, and + which must be explicitly popped by gcc. + + An input reg that is implicitly popped by the asm must be + explicitly clobbered, unless it is constrained to match an output + operand. + + 2. For any input reg that is implicitly popped by an asm, it is + necessary to know how to adjust the stack to compensate for the + pop. If any non-popped input is closer to the top of the + reg-stack than the implicitly popped reg, it would not be possible + to know what the stack looked like--it's not clear how the rest of + the stack "slides up". + + All implicitly popped input regs must be closer to the top of the + reg-stack than any input that is not implicitly popped. + + It is possible that if an input dies in an insn, reload might use + the input reg for an output reload. Consider this example: + + asm ("foo" : "=t" (a) : "f" (b)); + + This asm says that input B is not popped by the asm, and that the + asm pushes a result onto the reg-stack, i.e., the stack is one + deeper after the asm than it was before. But, it is possible that + reload will think that it can use the same reg for both the input + and the output, if input B dies in this insn. + + If any input operand uses the `f' constraint, all output reg + constraints must use the `&' earlyclobber. + + The asm above would be written as + + asm ("foo" : "=&t" (a) : "f" (b)); + + 3. Some operands need to be in particular places on the stack. All + output operands fall in this category--there is no other way to + know which regs the outputs appear in unless the user indicates + this in the constraints. + + Output operands must specifically indicate which reg an output + appears in after an asm. `=f' is not allowed: the operand + constraints must select a class with a single reg. + + 4. Output operands may not be "inserted" between existing stack regs. + Since no 387 opcode uses a read/write operand, all output operands + are dead before the asm_operands, and are pushed by the + asm_operands. It makes no sense to push anywhere but the top of + the reg-stack. + + Output operands must start at the top of the reg-stack: output + operands may not "skip" a reg. + + 5. Some asm statements may need extra stack space for internal + calculations. This can be guaranteed by clobbering stack registers + unrelated to the inputs and outputs. + + + Here are a couple of reasonable asms to want to write. This asm + takes one input, which is internally popped, and produces two outputs. + + asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp)); + + This asm takes two inputs, which are popped by the `fyl2xp1' opcode, + and replaces them with one output. The user must code the `st(1)' + clobber for reg-stack.c to know that `fyl2xp1' pops both inputs. + + asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)"); + +  + File: gcc.info, Node: Constraints, Next: Asm Labels, Prev: Extended Asm, Up: C Extensions + + Constraints for `asm' Operands + ============================== + + Here are specific details on what constraint letters you can use with + `asm' operands. Constraints can say whether an operand may be in a + register, and which kinds of register; whether the operand can be a + memory reference, and which kinds of address; whether the operand may + be an immediate constant, and which possible values it may have. + Constraints can also require two operands to match. + + * Menu: + + * Simple Constraints:: Basic use of constraints. + * Multi-Alternative:: When an insn has two alternative constraint-patterns. + * Modifiers:: More precise control over effects of constraints. + * Machine Constraints:: Special constraints for some particular machines. + +  + File: gcc.info, Node: Simple Constraints, Next: Multi-Alternative, Up: Constraints + + Simple Constraints + ------------------ + + The simplest kind of constraint is a string full of letters, each of + which describes one kind of operand that is permitted. Here are the + letters that are allowed: + + whitespace + Whitespace characters are ignored and can be inserted at any + position except the first. This enables each alternative for + different operands to be visually aligned in the machine + description even if they have different number of constraints and + modifiers. + + `m' + A memory operand is allowed, with any kind of address that the + machine supports in general. + + `o' + A memory operand is allowed, but only if the address is + "offsettable". This means that adding a small integer (actually, + the width in bytes of the operand, as determined by its machine + mode) may be added to the address and the result is also a valid + memory address. + + For example, an address which is constant is offsettable; so is an + address that is the sum of a register and a constant (as long as a + slightly larger constant is also within the range of + address-offsets supported by the machine); but an autoincrement or + autodecrement address is not offsettable. More complicated + indirect/indexed addresses may or may not be offsettable depending + on the other addressing modes that the machine supports. + + Note that in an output operand which can be matched by another + operand, the constraint letter `o' is valid only when accompanied + by both `<' (if the target machine has predecrement addressing) + and `>' (if the target machine has preincrement addressing). + + `V' + A memory operand that is not offsettable. In other words, + anything that would fit the `m' constraint but not the `o' + constraint. + + `<' + A memory operand with autodecrement addressing (either + predecrement or postdecrement) is allowed. + + `>' + A memory operand with autoincrement addressing (either + preincrement or postincrement) is allowed. + + `r' + A register operand is allowed provided that it is in a general + register. + + `i' + An immediate integer operand (one with constant value) is allowed. + This includes symbolic constants whose values will be known only at + assembly time. + + `n' + An immediate integer operand with a known numeric value is allowed. + Many systems cannot support assembly-time constants for operands + less than a word wide. Constraints for these operands should use + `n' rather than `i'. + + `I', `J', `K', ... `P' + Other letters in the range `I' through `P' may be defined in a + machine-dependent fashion to permit immediate integer operands with + explicit integer values in specified ranges. For example, on the + 68000, `I' is defined to stand for the range of values 1 to 8. + This is the range permitted as a shift count in the shift + instructions. + + `E' + An immediate floating operand (expression code `const_double') is + allowed, but only if the target floating point format is the same + as that of the host machine (on which the compiler is running). + + `F' + An immediate floating operand (expression code `const_double') is + allowed. + + `G', `H' + `G' and `H' may be defined in a machine-dependent fashion to + permit immediate floating operands in particular ranges of values. + + `s' + An immediate integer operand whose value is not an explicit + integer is allowed. + + This might appear strange; if an insn allows a constant operand + with a value not known at compile time, it certainly must allow + any known value. So why use `s' instead of `i'? Sometimes it + allows better code to be generated. + + For example, on the 68000 in a fullword instruction it is possible + to use an immediate operand; but if the immediate value is between + -128 and 127, better code results from loading the value into a + register and using the register. This is because the load into + the register can be done with a `moveq' instruction. We arrange + for this to happen by defining the letter `K' to mean "any integer + outside the range -128 to 127", and then specifying `Ks' in the + operand constraints. + + `g' + Any register, memory or immediate integer operand is allowed, + except for registers that are not general registers. + + `X' + Any operand whatsoever is allowed. + + `0', `1', `2', ... `9' + An operand that matches the specified operand number is allowed. + If a digit is used together with letters within the same + alternative, the digit should come last. + + This number is allowed to be more than a single digit. If multiple + digits are encountered consecutavely, they are interpreted as a + single decimal integer. There is scant chance for ambiguity, + since to-date it has never been desirable that `10' be interpreted + as matching either operand 1 _or_ operand 0. Should this be + desired, one can use multiple alternatives instead. + + This is called a "matching constraint" and what it really means is + that the assembler has only a single operand that fills two roles + which `asm' distinguishes. For example, an add instruction uses + two input operands and an output operand, but on most CISC + machines an add instruction really has only two operands, one of + them an input-output operand: + + addl #35,r12 + + Matching constraints are used in these circumstances. More + precisely, the two operands that match must include one input-only + operand and one output-only operand. Moreover, the digit must be a + smaller number than the number of the operand that uses it in the + constraint. + + `p' + An operand that is a valid memory address is allowed. This is for + "load address" and "push address" instructions. + + `p' in the constraint must be accompanied by `address_operand' as + the predicate in the `match_operand'. This predicate interprets + the mode specified in the `match_operand' as the mode of the memory + reference for which the address would be valid. + + OTHER-LETTERS + Other letters can be defined in machine-dependent fashion to stand + for particular classes of registers or other arbitrary operand + types. `d', `a' and `f' are defined on the 68000/68020 to stand + for data, address and floating point registers. + + +  + File: gcc.info, Node: Multi-Alternative, Next: Modifiers, Prev: Simple Constraints, Up: Constraints + + Multiple Alternative Constraints + -------------------------------- + + Sometimes a single instruction has multiple alternative sets of + possible operands. For example, on the 68000, a logical-or instruction + can combine register or an immediate value into memory, or it can + combine any kind of operand into a register; but it cannot combine one + memory location into another. + + These constraints are represented as multiple alternatives. An + alternative can be described by a series of letters for each operand. + The overall constraint for an operand is made from the letters for this + operand from the first alternative, a comma, the letters for this + operand from the second alternative, a comma, and so on until the last + alternative. + + If all the operands fit any one alternative, the instruction is + valid. Otherwise, for each alternative, the compiler counts how many + instructions must be added to copy the operands so that that + alternative applies. The alternative requiring the least copying is + chosen. If two alternatives need the same amount of copying, the one + that comes first is chosen. These choices can be altered with the `?' + and `!' characters: + + `?' + Disparage slightly the alternative that the `?' appears in, as a + choice when no alternative applies exactly. The compiler regards + this alternative as one unit more costly for each `?' that appears + in it. + + `!' + Disparage severely the alternative that the `!' appears in. This + alternative can still be used if it fits without reloading, but if + reloading is needed, some other alternative will be used. + +  + File: gcc.info, Node: Modifiers, Next: Machine Constraints, Prev: Multi-Alternative, Up: Constraints + + Constraint Modifier Characters + ------------------------------ + + Here are constraint modifier characters. + + `=' + Means that this operand is write-only for this instruction: the + previous value is discarded and replaced by output data. + + `+' + Means that this operand is both read and written by the + instruction. + + When the compiler fixes up the operands to satisfy the constraints, + it needs to know which operands are inputs to the instruction and + which are outputs from it. `=' identifies an output; `+' + identifies an operand that is both input and output; all other + operands are assumed to be input only. + + If you specify `=' or `+' in a constraint, you put it in the first + character of the constraint string. + + `&' + Means (in a particular alternative) that this operand is an + "earlyclobber" operand, which is modified before the instruction is + finished using the input operands. Therefore, this operand may + not lie in a register that is used as an input operand or as part + of any memory address. + + `&' applies only to the alternative in which it is written. In + constraints with multiple alternatives, sometimes one alternative + requires `&' while others do not. See, for example, the `movdf' + insn of the 68000. + + An input operand can be tied to an earlyclobber operand if its only + use as an input occurs before the early result is written. Adding + alternatives of this form often allows GCC to produce better code + when only some of the inputs can be affected by the earlyclobber. + See, for example, the `mulsi3' insn of the ARM. + + `&' does not obviate the need to write `='. + + `%' + Declares the instruction to be commutative for this operand and the + following operand. This means that the compiler may interchange + the two operands if that is the cheapest way to make all operands + fit the constraints. + + `#' + Says that all following characters, up to the next comma, are to be + ignored as a constraint. They are significant only for choosing + register preferences. + + `*' + Says that the following character should be ignored when choosing + register preferences. `*' has no effect on the meaning of the + constraint as a constraint, and no effect on reloading. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-14 gcc-3.2.3/gcc/doc/gcc.info-14 *** gcc-3.2.2/gcc/doc/gcc.info-14 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-14 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1584 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Machine Constraints, Prev: Modifiers, Up: Constraints + + Constraints for Particular Machines + ----------------------------------- + + Whenever possible, you should use the general-purpose constraint + letters in `asm' arguments, since they will convey meaning more readily + to people reading your code. Failing that, use the constraint letters + that usually have very similar meanings across architectures. The most + commonly used constraints are `m' and `r' (for memory and + general-purpose registers respectively; *note Simple Constraints::), and + `I', usually the letter indicating the most common immediate-constant + format. + + For each machine architecture, the `config/MACHINE/MACHINE.h' file + defines additional constraints. These constraints are used by the + compiler itself for instruction generation, as well as for `asm' + statements; therefore, some of the constraints are not particularly + interesting for `asm'. The constraints are defined through these + macros: + + `REG_CLASS_FROM_LETTER' + Register class constraints (usually lower case). + + `CONST_OK_FOR_LETTER_P' + Immediate constant constraints, for non-floating point constants of + word size or smaller precision (usually upper case). + + `CONST_DOUBLE_OK_FOR_LETTER_P' + Immediate constant constraints, for all floating point constants + and for constants of greater than word size precision (usually + upper case). + + `EXTRA_CONSTRAINT' + Special cases of registers or memory. This macro is not required, + and is only defined for some machines. + + Inspecting these macro definitions in the compiler source for your + machine is the best way to be certain you have the right constraints. + However, here is a summary of the machine-dependent constraints + available on some particular machines. + + _ARM family--`arm.h'_ + + `f' + Floating-point register + + `F' + One of the floating-point constants 0.0, 0.5, 1.0, 2.0, 3.0, + 4.0, 5.0 or 10.0 + + `G' + Floating-point constant that would satisfy the constraint `F' + if it were negated + + `I' + Integer that is valid as an immediate operand in a data + processing instruction. That is, an integer in the range 0 + to 255 rotated by a multiple of 2 + + `J' + Integer in the range -4095 to 4095 + + `K' + Integer that satisfies constraint `I' when inverted (ones + complement) + + `L' + Integer that satisfies constraint `I' when negated (twos + complement) + + `M' + Integer in the range 0 to 32 + + `Q' + A memory reference where the exact address is in a single + register (``m'' is preferable for `asm' statements) + + `R' + An item in the constant pool + + `S' + A symbol in the text segment of the current file + + _AMD 29000 family--`a29k.h'_ + + `l' + Local register 0 + + `b' + Byte Pointer (`BP') register + + `q' + `Q' register + + `h' + Special purpose register + + `A' + First accumulator register + + `a' + Other accumulator register + + `f' + Floating point register + + `I' + Constant greater than 0, less than 0x100 + + `J' + Constant greater than 0, less than 0x10000 + + `K' + Constant whose high 24 bits are on (1) + + `L' + 16-bit constant whose high 8 bits are on (1) + + `M' + 32-bit constant whose high 16 bits are on (1) + + `N' + 32-bit negative constant that fits in 8 bits + + `O' + The constant 0x80000000 or, on the 29050, any 32-bit constant + whose low 16 bits are 0. + + `P' + 16-bit negative constant that fits in 8 bits + + `G' + `H' + A floating point constant (in `asm' statements, use the + machine independent `E' or `F' instead) + + _AVR family--`avr.h'_ + + `l' + Registers from r0 to r15 + + `a' + Registers from r16 to r23 + + `d' + Registers from r16 to r31 + + `w' + Registers from r24 to r31. These registers can be used in + `adiw' command + + `e' + Pointer register (r26-r31) + + `b' + Base pointer register (r28-r31) + + `q' + Stack pointer register (SPH:SPL) + + `t' + Temporary register r0 + + `x' + Register pair X (r27:r26) + + `y' + Register pair Y (r29:r28) + + `z' + Register pair Z (r31:r30) + + `I' + Constant greater than -1, less than 64 + + `J' + Constant greater than -64, less than 1 + + `K' + Constant integer 2 + + `L' + Constant integer 0 + + `M' + Constant that fits in 8 bits + + `N' + Constant integer -1 + + `O' + Constant integer 8, 16, or 24 + + `P' + Constant integer 1 + + `G' + A floating point constant 0.0 + + _IBM RS6000--`rs6000.h'_ + + `b' + Address base register + + `f' + Floating point register + + `h' + `MQ', `CTR', or `LINK' register + + `q' + `MQ' register + + `c' + `CTR' register + + `l' + `LINK' register + + `x' + `CR' register (condition register) number 0 + + `y' + `CR' register (condition register) + + `z' + `FPMEM' stack memory for FPR-GPR transfers + + `I' + Signed 16-bit constant + + `J' + Unsigned 16-bit constant shifted left 16 bits (use `L' + instead for `SImode' constants) + + `K' + Unsigned 16-bit constant + + `L' + Signed 16-bit constant shifted left 16 bits + + `M' + Constant larger than 31 + + `N' + Exact power of 2 + + `O' + Zero + + `P' + Constant whose negation is a signed 16-bit constant + + `G' + Floating point constant that can be loaded into a register + with one instruction per word + + `Q' + Memory operand that is an offset from a register (`m' is + preferable for `asm' statements) + + `R' + AIX TOC entry + + `S' + Constant suitable as a 64-bit mask operand + + `T' + Constant suitable as a 32-bit mask operand + + `U' + System V Release 4 small data area reference + + _Intel 386--`i386.h'_ + + `q' + `a', `b', `c', or `d' register for the i386. For x86-64 it + is equivalent to `r' class. (for 8-bit instructions that do + not use upper halves) + + `Q' + `a', `b', `c', or `d' register. (for 8-bit instructions, that + do use upper halves) + + `R' + Legacy register--equivalent to `r' class in i386 mode. (for + non-8-bit registers used together with 8-bit upper halves in + a single instruction) + + `A' + Specifies the `a' or `d' registers. This is primarily useful + for 64-bit integer values (when in 32-bit mode) intended to + be returned with the `d' register holding the most + significant bits and the `a' register holding the least + significant bits. + + `f' + Floating point register + + `t' + First (top of stack) floating point register + + `u' + Second floating point register + + `a' + `a' register + + `b' + `b' register + + `c' + `c' register + + `d' + `d' register + + `D' + `di' register + + `S' + `si' register + + `x' + `xmm' SSE register + + `y' + MMX register + + `I' + Constant in range 0 to 31 (for 32-bit shifts) + + `J' + Constant in range 0 to 63 (for 64-bit shifts) + + `K' + `0xff' + + `L' + `0xffff' + + `M' + 0, 1, 2, or 3 (shifts for `lea' instruction) + + `N' + Constant in range 0 to 255 (for `out' instruction) + + `Z' + Constant in range 0 to `0xffffffff' or symbolic reference + known to fit specified range. (for using immediates in zero + extending 32-bit to 64-bit x86-64 instructions) + + `e' + Constant in range -2147483648 to 2147483647 or symbolic + reference known to fit specified range. (for using + immediates in 64-bit x86-64 instructions) + + `G' + Standard 80387 floating point constant + + _Intel 960--`i960.h'_ + + `f' + Floating point register (`fp0' to `fp3') + + `l' + Local register (`r0' to `r15') + + `b' + Global register (`g0' to `g15') + + `d' + Any local or global register + + `I' + Integers from 0 to 31 + + `J' + 0 + + `K' + Integers from -31 to 0 + + `G' + Floating point 0 + + `H' + Floating point 1 + + _MIPS--`mips.h'_ + + `d' + General-purpose integer register + + `f' + Floating-point register (if available) + + `h' + `Hi' register + + `l' + `Lo' register + + `x' + `Hi' or `Lo' register + + `y' + General-purpose integer register + + `z' + Floating-point status register + + `I' + Signed 16-bit constant (for arithmetic instructions) + + `J' + Zero + + `K' + Zero-extended 16-bit constant (for logic instructions) + + `L' + Constant with low 16 bits zero (can be loaded with `lui') + + `M' + 32-bit constant which requires two instructions to load (a + constant which is not `I', `K', or `L') + + `N' + Negative 16-bit constant + + `O' + Exact power of two + + `P' + Positive 16-bit constant + + `G' + Floating point zero + + `Q' + Memory reference that can be loaded with more than one + instruction (`m' is preferable for `asm' statements) + + `R' + Memory reference that can be loaded with one instruction (`m' + is preferable for `asm' statements) + + `S' + Memory reference in external OSF/rose PIC format (`m' is + preferable for `asm' statements) + + _Motorola 680x0--`m68k.h'_ + + `a' + Address register + + `d' + Data register + + `f' + 68881 floating-point register, if available + + `x' + Sun FPA (floating-point) register, if available + + `y' + First 16 Sun FPA registers, if available + + `I' + Integer in the range 1 to 8 + + `J' + 16-bit signed number + + `K' + Signed number whose magnitude is greater than 0x80 + + `L' + Integer in the range -8 to -1 + + `M' + Signed number whose magnitude is greater than 0x100 + + `G' + Floating point constant that is not a 68881 constant + + `H' + Floating point constant that can be used by Sun FPA + + _Motorola 68HC11 & 68HC12 families--`m68hc11.h'_ + + `a' + Register 'a' + + `b' + Register 'b' + + `d' + Register 'd' + + `q' + An 8-bit register + + `t' + Temporary soft register _.tmp + + `u' + A soft register _.d1 to _.d31 + + `w' + Stack pointer register + + `x' + Register 'x' + + `y' + Register 'y' + + `z' + Pseudo register 'z' (replaced by 'x' or 'y' at the end) + + `A' + An address register: x, y or z + + `B' + An address register: x or y + + `D' + Register pair (x:d) to form a 32-bit value + + `L' + Constants in the range -65536 to 65535 + + `M' + Constants whose 16-bit low part is zero + + `N' + Constant integer 1 or -1 + + `O' + Constant integer 16 + + `P' + Constants in the range -8 to 2 + + + _SPARC--`sparc.h'_ + + `f' + Floating-point register that can hold 32- or 64-bit values. + + `e' + Floating-point register that can hold 64- or 128-bit values. + + `I' + Signed 13-bit constant + + `J' + Zero + + `K' + 32-bit constant with the low 12 bits clear (a constant that + can be loaded with the `sethi' instruction) + + `L' + A constant in the range supported by `movcc' instructions + + `M' + A constant in the range supported by `movrcc' instructions + + `N' + Same as `K', except that it verifies that bits that are not + in the lower 32-bit range are all zero. Must be used instead + of `K' for modes wider than `SImode' + + `G' + Floating-point zero + + `H' + Signed 13-bit constant, sign-extended to 32 or 64 bits + + `Q' + Floating-point constant whose integral representation can be + moved into an integer register using a single sethi + instruction + + `R' + Floating-point constant whose integral representation can be + moved into an integer register using a single mov instruction + + `S' + Floating-point constant whose integral representation can be + moved into an integer register using a high/lo_sum + instruction sequence + + `T' + Memory address aligned to an 8-byte boundary + + `U' + Even register + + `W' + Memory address for `e' constraint registers. + + + _TMS320C3x/C4x--`c4x.h'_ + + `a' + Auxiliary (address) register (ar0-ar7) + + `b' + Stack pointer register (sp) + + `c' + Standard (32-bit) precision integer register + + `f' + Extended (40-bit) precision register (r0-r11) + + `k' + Block count register (bk) + + `q' + Extended (40-bit) precision low register (r0-r7) + + `t' + Extended (40-bit) precision register (r0-r1) + + `u' + Extended (40-bit) precision register (r2-r3) + + `v' + Repeat count register (rc) + + `x' + Index register (ir0-ir1) + + `y' + Status (condition code) register (st) + + `z' + Data page register (dp) + + `G' + Floating-point zero + + `H' + Immediate 16-bit floating-point constant + + `I' + Signed 16-bit constant + + `J' + Signed 8-bit constant + + `K' + Signed 5-bit constant + + `L' + Unsigned 16-bit constant + + `M' + Unsigned 8-bit constant + + `N' + Ones complement of unsigned 16-bit constant + + `O' + High 16-bit constant (32-bit constant with 16 LSBs zero) + + `Q' + Indirect memory reference with signed 8-bit or index register + displacement + + `R' + Indirect memory reference with unsigned 5-bit displacement + + `S' + Indirect memory reference with 1 bit or index register + displacement + + `T' + Direct memory reference + + `U' + Symbolic address + + + _S/390 and zSeries--`s390.h'_ + + `a' + Address register (general purpose register except r0) + + `d' + Data register (arbitrary general purpose register) + + `f' + Floating-point register + + `I' + Unsigned 8-bit constant (0-255) + + `J' + Unsigned 12-bit constant (0-4095) + + `K' + Signed 16-bit constant (-32768-32767) + + `L' + Unsigned 16-bit constant (0-65535) + + `Q' + Memory reference without index register + + `S' + Symbolic constant suitable for use with the `larl' instruction + + + _Xstormy16--`stormy16.h'_ + + `a' + Register r0. + + `b' + Register r1. + + `c' + Register r2. + + `d' + Register r8. + + `e' + Registers r0 through r7. + + `t' + Registers r0 and r1. + + `y' + The carry register. + + `z' + Registers r8 and r9. + + `I' + A constant between 0 and 3 inclusive. + + `J' + A constant that has exactly one bit set. + + `K' + A constant that has exactly one bit clear. + + `L' + A constant between 0 and 255 inclusive. + + `M' + A constant between -255 and 0 inclusive. + + `N' + A constant between -3 and 0 inclusive. + + `O' + A constant between 1 and 4 inclusive. + + `P' + A constant between -4 and -1 inclusive. + + `Q' + A memory reference that is a stack push. + + `R' + A memory reference that is a stack pop. + + `S' + A memory reference that refers to an constant address of + known value. + + `T' + The register indicated by Rx (not implemented yet). + + `U' + A constant that is not between 2 and 15 inclusive. + + + _Xtensa--`xtensa.h'_ + + `a' + General-purpose 32-bit register + + `b' + One-bit boolean register + + `A' + MAC16 40-bit accumulator register + + `I' + Signed 12-bit integer constant, for use in MOVI instructions + + `J' + Signed 8-bit integer constant, for use in ADDI instructions + + `K' + Integer constant valid for BccI instructions + + `L' + Unsigned constant valid for BccUI instructions + + + +  + File: gcc.info, Node: Asm Labels, Next: Explicit Reg Vars, Prev: Constraints, Up: C Extensions + + Controlling Names Used in Assembler Code + ======================================== + + You can specify the name to be used in the assembler code for a C + function or variable by writing the `asm' (or `__asm__') keyword after + the declarator as follows: + + int foo asm ("myfoo") = 2; + + This specifies that the name to be used for the variable `foo' in the + assembler code should be `myfoo' rather than the usual `_foo'. + + On systems where an underscore is normally prepended to the name of + a C function or variable, this feature allows you to define names for + the linker that do not start with an underscore. + + It does not make sense to use this feature with a non-static local + variable since such variables do not have assembler names. If you are + trying to put the variable in a particular register, see *Note Explicit + Reg Vars::. GCC presently accepts such code with a warning, but will + probably be changed to issue an error, rather than a warning, in the + future. + + You cannot use `asm' in this way in a function _definition_; but you + can get the same effect by writing a declaration for the function + before its definition and putting `asm' there, like this: + + extern func () asm ("FUNC"); + + func (x, y) + int x, y; + ... + + It is up to you to make sure that the assembler names you choose do + not conflict with any other assembler symbols. Also, you must not use a + register name; that would produce completely invalid assembler code. + GCC does not as yet have the ability to store static variables in + registers. Perhaps that will be added. + +  + File: gcc.info, Node: Explicit Reg Vars, Next: Alternate Keywords, Prev: Asm Labels, Up: C Extensions + + Variables in Specified Registers + ================================ + + GNU C allows you to put a few global variables into specified + hardware registers. You can also specify the register in which an + ordinary register variable should be allocated. + + * Global register variables reserve registers throughout the program. + This may be useful in programs such as programming language + interpreters which have a couple of global variables that are + accessed very often. + + * Local register variables in specific registers do not reserve the + registers. The compiler's data flow analysis is capable of + determining where the specified registers contain live values, and + where they are available for other uses. Stores into local + register variables may be deleted when they appear to be dead + according to dataflow analysis. References to local register + variables may be deleted or moved or simplified. + + These local variables are sometimes convenient for use with the + extended `asm' feature (*note Extended Asm::), if you want to + write one output of the assembler instruction directly into a + particular register. (This will work provided the register you + specify fits the constraints specified for that operand in the + `asm'.) + + * Menu: + + * Global Reg Vars:: + * Local Reg Vars:: + +  + File: gcc.info, Node: Global Reg Vars, Next: Local Reg Vars, Up: Explicit Reg Vars + + Defining Global Register Variables + ---------------------------------- + + You can define a global register variable in GNU C like this: + + register int *foo asm ("a5"); + + Here `a5' is the name of the register which should be used. Choose a + register which is normally saved and restored by function calls on your + machine, so that library routines will not clobber it. + + Naturally the register name is cpu-dependent, so you would need to + conditionalize your program according to cpu type. The register `a5' + would be a good choice on a 68000 for a variable of pointer type. On + machines with register windows, be sure to choose a "global" register + that is not affected magically by the function call mechanism. + + In addition, operating systems on one type of cpu may differ in how + they name the registers; then you would need additional conditionals. + For example, some 68000 operating systems call this register `%a5'. + + Eventually there may be a way of asking the compiler to choose a + register automatically, but first we need to figure out how it should + choose and how to enable you to guide the choice. No solution is + evident. + + Defining a global register variable in a certain register reserves + that register entirely for this use, at least within the current + compilation. The register will not be allocated for any other purpose + in the functions in the current compilation. The register will not be + saved and restored by these functions. Stores into this register are + never deleted even if they would appear to be dead, but references may + be deleted or moved or simplified. + + It is not safe to access the global register variables from signal + handlers, or from more than one thread of control, because the system + library routines may temporarily use the register for other things + (unless you recompile them specially for the task at hand). + + It is not safe for one function that uses a global register variable + to call another such function `foo' by way of a third function `lose' + that was compiled without knowledge of this variable (i.e. in a + different source file in which the variable wasn't declared). This is + because `lose' might save the register and put some other value there. + For example, you can't expect a global register variable to be + available in the comparison-function that you pass to `qsort', since + `qsort' might have put something else in that register. (If you are + prepared to recompile `qsort' with the same global register variable, + you can solve this problem.) + + If you want to recompile `qsort' or other source files which do not + actually use your global register variable, so that they will not use + that register for any other purpose, then it suffices to specify the + compiler option `-ffixed-REG'. You need not actually add a global + register declaration to their source code. + + A function which can alter the value of a global register variable + cannot safely be called from a function compiled without this variable, + because it could clobber the value the caller expects to find there on + return. Therefore, the function which is the entry point into the part + of the program that uses the global register variable must explicitly + save and restore the value which belongs to its caller. + + On most machines, `longjmp' will restore to each global register + variable the value it had at the time of the `setjmp'. On some + machines, however, `longjmp' will not change the value of global + register variables. To be portable, the function that called `setjmp' + should make other arrangements to save the values of the global register + variables, and to restore them in a `longjmp'. This way, the same + thing will happen regardless of what `longjmp' does. + + All global register variable declarations must precede all function + definitions. If such a declaration could appear after function + definitions, the declaration would be too late to prevent the register + from being used for other purposes in the preceding functions. + + Global register variables may not have initial values, because an + executable file has no means to supply initial contents for a register. + + On the Sparc, there are reports that g3 ... g7 are suitable + registers, but certain library functions, such as `getwd', as well as + the subroutines for division and remainder, modify g3 and g4. g1 and + g2 are local temporaries. + + On the 68000, a2 ... a5 should be suitable, as should d2 ... d7. Of + course, it will not do to use more than a few of those. + +  + File: gcc.info, Node: Local Reg Vars, Prev: Global Reg Vars, Up: Explicit Reg Vars + + Specifying Registers for Local Variables + ---------------------------------------- + + You can define a local register variable with a specified register + like this: + + register int *foo asm ("a5"); + + Here `a5' is the name of the register which should be used. Note that + this is the same syntax used for defining global register variables, + but for a local variable it would appear within a function. + + Naturally the register name is cpu-dependent, but this is not a + problem, since specific registers are most often useful with explicit + assembler instructions (*note Extended Asm::). Both of these things + generally require that you conditionalize your program according to cpu + type. + + In addition, operating systems on one type of cpu may differ in how + they name the registers; then you would need additional conditionals. + For example, some 68000 operating systems call this register `%a5'. + + Defining such a register variable does not reserve the register; it + remains available for other uses in places where flow control determines + the variable's value is not live. However, these registers are made + unavailable for use in the reload pass; excessive use of this feature + leaves the compiler too few available registers to compile certain + functions. + + This option does not guarantee that GCC will generate code that has + this variable in the register you specify at all times. You may not + code an explicit reference to this register in an `asm' statement and + assume it will always refer to this variable. + + Stores into local register variables may be deleted when they appear + to be dead according to dataflow analysis. References to local + register variables may be deleted or moved or simplified. + +  + File: gcc.info, Node: Alternate Keywords, Next: Incomplete Enums, Prev: Explicit Reg Vars, Up: C Extensions + + Alternate Keywords + ================== + + The option `-traditional' disables certain keywords; `-ansi' and the + various `-std' options disable certain others. This causes trouble + when you want to use GNU C extensions, or ISO C features, in a + general-purpose header file that should be usable by all programs, + including ISO C programs and traditional ones. The keywords `asm', + `typeof' and `inline' cannot be used since they won't work in a program + compiled with `-ansi' (although `inline' can be used in a program + compiled with `-std=c99'), while the keywords `const', `volatile', + `signed', `typeof' and `inline' won't work in a program compiled with + `-traditional'. The ISO C99 keyword `restrict' is only available when + `-std=gnu99' (which will eventually be the default) or `-std=c99' (or + the equivalent `-std=iso9899:1999') is used. + + The way to solve these problems is to put `__' at the beginning and + end of each problematical keyword. For example, use `__asm__' instead + of `asm', `__const__' instead of `const', and `__inline__' instead of + `inline'. + + Other C compilers won't accept these alternative keywords; if you + want to compile with another compiler, you can define the alternate + keywords as macros to replace them with the customary keywords. It + looks like this: + + #ifndef __GNUC__ + #define __asm__ asm + #endif + + `-pedantic' and other options cause warnings for many GNU C + extensions. You can prevent such warnings within one expression by + writing `__extension__' before the expression. `__extension__' has no + effect aside from this. + +  + File: gcc.info, Node: Incomplete Enums, Next: Function Names, Prev: Alternate Keywords, Up: C Extensions + + Incomplete `enum' Types + ======================= + + You can define an `enum' tag without specifying its possible values. + This results in an incomplete type, much like what you get if you write + `struct foo' without describing the elements. A later declaration + which does specify the possible values completes the type. + + You can't allocate variables or storage using the type while it is + incomplete. However, you can work with pointers to that type. + + This extension may not be very useful, but it makes the handling of + `enum' more consistent with the way `struct' and `union' are handled. + + This extension is not supported by GNU C++. + +  + File: gcc.info, Node: Function Names, Next: Return Address, Prev: Incomplete Enums, Up: C Extensions + + Function Names as Strings + ========================= + + GCC predefines two magic identifiers to hold the name of the current + function. The identifier `__FUNCTION__' holds the name of the function + as it appears in the source. The identifier `__PRETTY_FUNCTION__' + holds the name of the function pretty printed in a language specific + fashion. + + These names are always the same in a C function, but in a C++ + function they may be different. For example, this program: + + extern "C" { + extern int printf (char *, ...); + } + + class a { + public: + sub (int i) + { + printf ("__FUNCTION__ = %s\n", __FUNCTION__); + printf ("__PRETTY_FUNCTION__ = %s\n", __PRETTY_FUNCTION__); + } + }; + + int + main (void) + { + a ax; + ax.sub (0); + return 0; + } + + gives this output: + + __FUNCTION__ = sub + __PRETTY_FUNCTION__ = int a::sub (int) + + The compiler automagically replaces the identifiers with a string + literal containing the appropriate name. Thus, they are neither + preprocessor macros, like `__FILE__' and `__LINE__', nor variables. + This means that they catenate with other string literals, and that they + can be used to initialize char arrays. For example + + char here[] = "Function " __FUNCTION__ " in " __FILE__; + + On the other hand, `#ifdef __FUNCTION__' does not have any special + meaning inside a function, since the preprocessor does not do anything + special with the identifier `__FUNCTION__'. + + Note that these semantics are deprecated, and that GCC 3.2 will + handle `__FUNCTION__' and `__PRETTY_FUNCTION__' the same way as + `__func__'. `__func__' is defined by the ISO standard C99: + + The identifier `__func__' is implicitly declared by the translator + as if, immediately following the opening brace of each function + definition, the declaration + static const char __func__[] = "function-name"; + + appeared, where function-name is the name of the lexically-enclosing + function. This name is the unadorned name of the function. + + By this definition, `__func__' is a variable, not a string literal. + In particular, `__func__' does not catenate with other string literals. + + In `C++', `__FUNCTION__' and `__PRETTY_FUNCTION__' are variables, + declared in the same way as `__func__'. + +  + File: gcc.info, Node: Return Address, Next: Vector Extensions, Prev: Function Names, Up: C Extensions + + Getting the Return or Frame Address of a Function + ================================================= + + These functions may be used to get information about the callers of a + function. + + - Built-in Function: void * __builtin_return_address (unsigned int + LEVEL) + This function returns the return address of the current function, + or of one of its callers. The LEVEL argument is number of frames + to scan up the call stack. A value of `0' yields the return + address of the current function, a value of `1' yields the return + address of the caller of the current function, and so forth. + + The LEVEL argument must be a constant integer. + + On some machines it may be impossible to determine the return + address of any function other than the current one; in such cases, + or when the top of the stack has been reached, this function will + return `0' or a random value. In addition, + `__builtin_frame_address' may be used to determine if the top of + the stack has been reached. + + This function should only be used with a nonzero argument for + debugging purposes. + + - Built-in Function: void * __builtin_frame_address (unsigned int + LEVEL) + This function is similar to `__builtin_return_address', but it + returns the address of the function frame rather than the return + address of the function. Calling `__builtin_frame_address' with a + value of `0' yields the frame address of the current function, a + value of `1' yields the frame address of the caller of the current + function, and so forth. + + The frame is the area on the stack which holds local variables and + saved registers. The frame address is normally the address of the + first word pushed on to the stack by the function. However, the + exact definition depends upon the processor and the calling + convention. If the processor has a dedicated frame pointer + register, and the function has a frame, then + `__builtin_frame_address' will return the value of the frame + pointer register. + + On some machines it may be impossible to determine the frame + address of any function other than the current one; in such cases, + or when the top of the stack has been reached, this function will + return `0' if the first frame pointer is properly initialized by + the startup code. + + This function should only be used with a nonzero argument for + debugging purposes. + +  + File: gcc.info, Node: Vector Extensions, Next: Other Builtins, Prev: Return Address, Up: C Extensions + + Using vector instructions through built-in functions + ==================================================== + + On some targets, the instruction set contains SIMD vector + instructions that operate on multiple values contained in one large + register at the same time. For example, on the i386 the MMX, 3Dnow! + and SSE extensions can be used this way. + + The first step in using these extensions is to provide the necessary + data types. This should be done using an appropriate `typedef': + + typedef int v4si __attribute__ ((mode(V4SI))); + + The base type `int' is effectively ignored by the compiler, the + actual properties of the new type `v4si' are defined by the + `__attribute__'. It defines the machine mode to be used; for vector + types these have the form `VNB'; N should be the number of elements in + the vector, and B should be the base mode of the individual elements. + The following can be used as base modes: + + `QI' + An integer that is as wide as the smallest addressable unit, + usually 8 bits. + + `HI' + An integer, twice as wide as a QI mode integer, usually 16 bits. + + `SI' + An integer, four times as wide as a QI mode integer, usually 32 + bits. + + `DI' + An integer, eight times as wide as a QI mode integer, usually 64 + bits. + + `SF' + A floating point value, as wide as a SI mode integer, usually 32 + bits. + + `DF' + A floating point value, as wide as a DI mode integer, usually 64 + bits. + + Not all base types or combinations are always valid; which modes can + be used is determined by the target machine. For example, if + targetting the i386 MMX extensions, only `V8QI', `V4HI' and `V2SI' are + allowed modes. + + There are no `V1xx' vector modes - they would be identical to the + corresponding base mode. + + There is no distinction between signed and unsigned vector modes. + This distinction is made by the operations that perform on the vectors, + not by the data type. + + The types defined in this manner are somewhat special, they cannot be + used with most normal C operations (i.e., a vector addition can _not_ + be represented by a normal addition of two vector type variables). You + can declare only variables and use them in function calls and returns, + as well as in assignments and some casts. It is possible to cast from + one vector type to another, provided they are of the same size (in + fact, you can also cast vectors to and from other datatypes of the same + size). + + A port that supports vector operations provides a set of built-in + functions that can be used to operate on vectors. For example, a + function to add two vectors and multiply the result by a third could + look like this: + + v4si f (v4si a, v4si b, v4si c) + { + v4si tmp = __builtin_addv4si (a, b); + return __builtin_mulv4si (tmp, c); + } + +  + File: gcc.info, Node: Other Builtins, Next: Target Builtins, Prev: Vector Extensions, Up: C Extensions + + Other built-in functions provided by GCC + ======================================== + + GCC provides a large number of built-in functions other than the ones + mentioned above. Some of these are for internal use in the processing + of exceptions or variable-length argument lists and will not be + documented here because they may change from time to time; we do not + recommend general use of these functions. + + The remaining functions are provided for optimization purposes. + + GCC includes built-in versions of many of the functions in the + standard C library. The versions prefixed with `__builtin_' will + always be treated as having the same meaning as the C library function + even if you specify the `-fno-builtin' option. (*note C Dialect + Options::) Many of these functions are only optimized in certain cases; + if they are not optimized in a particular case, a call to the library + function will be emitted. + + The functions `abort', `exit', `_Exit' and `_exit' are recognized + and presumed not to return, but otherwise are not built in. `_exit' is + not recognized in strict ISO C mode (`-ansi', `-std=c89' or + `-std=c99'). `_Exit' is not recognized in strict C89 mode (`-ansi' or + `-std=c89'). + + Outside strict ISO C mode, the functions `alloca', `bcmp', `bzero', + `index', `rindex', `ffs', `fputs_unlocked', `printf_unlocked' and + `fprintf_unlocked' may be handled as built-in functions. All these + functions have corresponding versions prefixed with `__builtin_', which + may be used even in strict C89 mode. + + The ISO C99 functions `conj', `conjf', `conjl', `creal', `crealf', + `creall', `cimag', `cimagf', `cimagl', `llabs' and `imaxabs' are + handled as built-in functions except in strict ISO C89 mode. There are + also built-in versions of the ISO C99 functions `cosf', `cosl', + `fabsf', `fabsl', `sinf', `sinl', `sqrtf', and `sqrtl', that are + recognized in any mode since ISO C89 reserves these names for the + purpose to which ISO C99 puts them. All these functions have + corresponding versions prefixed with `__builtin_'. + + The ISO C89 functions `abs', `cos', `fabs', `fprintf', `fputs', + `labs', `memcmp', `memcpy', `memset', `printf', `sin', `sqrt', `strcat', + `strchr', `strcmp', `strcpy', `strcspn', `strlen', `strncat', + `strncmp', `strncpy', `strpbrk', `strrchr', `strspn', and `strstr' are + all recognized as built-in functions unless `-fno-builtin' is specified + (or `-fno-builtin-FUNCTION' is specified for an individual function). + All of these functions have corresponding versions prefixed with + `__builtin_'. + + GCC provides built-in versions of the ISO C99 floating point + comparison macros that avoid raising exceptions for unordered operands. + They have the same names as the standard macros ( `isgreater', + `isgreaterequal', `isless', `islessequal', `islessgreater', and + `isunordered') , with `__builtin_' prefixed. We intend for a library + implementor to be able to simply `#define' each standard macro to its + built-in equivalent. + + - Built-in Function: int __builtin_types_compatible_p (TYPE1, TYPE2) + You can use the built-in function `__builtin_types_compatible_p' to + determine whether two types are the same. + + This built-in function returns 1 if the unqualified versions of the + types TYPE1 and TYPE2 (which are types, not expressions) are + compatible, 0 otherwise. The result of this built-in function can + be used in integer constant expressions. + + This built-in function ignores top level qualifiers (e.g., `const', + `volatile'). For example, `int' is equivalent to `const int'. + + The type `int[]' and `int[5]' are compatible. On the other hand, + `int' and `char *' are not compatible, even if the size of their + types, on the particular architecture are the same. Also, the + amount of pointer indirection is taken into account when + determining similarity. Consequently, `short *' is not similar to + `short **'. Furthermore, two types that are typedefed are + considered compatible if their underlying types are compatible. + + An `enum' type is considered to be compatible with another `enum' + type. For example, `enum {foo, bar}' is similar to `enum {hot, + dog}'. + + You would typically use this function in code whose execution + varies depending on the arguments' types. For example: + + #define foo(x) \ + ({ \ + typeof (x) tmp; \ + if (__builtin_types_compatible_p (typeof (x), long double)) \ + tmp = foo_long_double (tmp); \ + else if (__builtin_types_compatible_p (typeof (x), double)) \ + tmp = foo_double (tmp); \ + else if (__builtin_types_compatible_p (typeof (x), float)) \ + tmp = foo_float (tmp); \ + else \ + abort (); \ + tmp; \ + }) + + _Note:_ This construct is only available for C. + + + - Built-in Function: TYPE __builtin_choose_expr (CONST_EXP, EXP1, EXP2) + You can use the built-in function `__builtin_choose_expr' to + evaluate code depending on the value of a constant expression. + This built-in function returns EXP1 if CONST_EXP, which is a + constant expression that must be able to be determined at compile + time, is nonzero. Otherwise it returns 0. + + This built-in function is analogous to the `? :' operator in C, + except that the expression returned has its type unaltered by + promotion rules. Also, the built-in function does not evaluate + the expression that was not chosen. For example, if CONST_EXP + evaluates to true, EXP2 is not evaluated even if it has + side-effects. + + This built-in function can return an lvalue if the chosen argument + is an lvalue. + + If EXP1 is returned, the return type is the same as EXP1's type. + Similarly, if EXP2 is returned, its return type is the same as + EXP2. + + Example: + + #define foo(x) \ + __builtin_choose_expr (__builtin_types_compatible_p (typeof (x), double), \ + foo_double (x), \ + __builtin_choose_expr (__builtin_types_compatible_p (typeof (x), float), \ + foo_float (x), \ + /* The void expression results in a compile-time error \ + when assigning the result to something. */ \ + (void)0)) + + _Note:_ This construct is only available for C. Furthermore, the + unused expression (EXP1 or EXP2 depending on the value of + CONST_EXP) may still generate syntax errors. This may change in + future revisions. + + + - Built-in Function: int __builtin_constant_p (EXP) + You can use the built-in function `__builtin_constant_p' to + determine if a value is known to be constant at compile-time and + hence that GCC can perform constant-folding on expressions + involving that value. The argument of the function is the value + to test. The function returns the integer 1 if the argument is + known to be a compile-time constant and 0 if it is not known to be + a compile-time constant. A return of 0 does not indicate that the + value is _not_ a constant, but merely that GCC cannot prove it is + a constant with the specified value of the `-O' option. + + You would typically use this function in an embedded application + where memory was a critical resource. If you have some complex + calculation, you may want it to be folded if it involves + constants, but need to call a function if it does not. For + example: + + #define Scale_Value(X) \ + (__builtin_constant_p (X) \ + ? ((X) * SCALE + OFFSET) : Scale (X)) + + You may use this built-in function in either a macro or an inline + function. However, if you use it in an inlined function and pass + an argument of the function as the argument to the built-in, GCC + will never return 1 when you call the inline function with a + string constant or compound literal (*note Compound Literals::) + and will not return 1 when you pass a constant numeric value to + the inline function unless you specify the `-O' option. + + You may also use `__builtin_constant_p' in initializers for static + data. For instance, you can write + + static const int table[] = { + __builtin_constant_p (EXPRESSION) ? (EXPRESSION) : -1, + /* ... */ + }; + + This is an acceptable initializer even if EXPRESSION is not a + constant expression. GCC must be more conservative about + evaluating the built-in in this case, because it has no + opportunity to perform optimization. + + Previous versions of GCC did not accept this built-in in data + initializers. The earliest version where it is completely safe is + 3.0.1. + + - Built-in Function: long __builtin_expect (long EXP, long C) + You may use `__builtin_expect' to provide the compiler with branch + prediction information. In general, you should prefer to use + actual profile feedback for this (`-fprofile-arcs'), as + programmers are notoriously bad at predicting how their programs + actually perform. However, there are applications in which this + data is hard to collect. + + The return value is the value of EXP, which should be an integral + expression. The value of C must be a compile-time constant. The + semantics of the built-in are that it is expected that EXP == C. + For example: + + if (__builtin_expect (x, 0)) + foo (); + + would indicate that we do not expect to call `foo', since we + expect `x' to be zero. Since you are limited to integral + expressions for EXP, you should use constructions such as + + if (__builtin_expect (ptr != NULL, 1)) + error (); + + when testing pointer or floating-point values. + + - Built-in Function: void __builtin_prefetch (const void *ADDR, ...) + This function is used to minimize cache-miss latency by moving + data into a cache before it is accessed. You can insert calls to + `__builtin_prefetch' into code for which you know addresses of + data in memory that is likely to be accessed soon. If the target + supports them, data prefetch instructions will be generated. If + the prefetch is done early enough before the access then the data + will be in the cache by the time it is accessed. + + The value of ADDR is the address of the memory to prefetch. There + are two optional arguments, RW and LOCALITY. The value of RW is a + compile-time constant one or zero; one means that the prefetch is + preparing for a write to the memory address and zero, the default, + means that the prefetch is preparing for a read. The value + LOCALITY must be a compile-time constant integer between zero and + three. A value of zero means that the data has no temporal + locality, so it need not be left in the cache after the access. A + value of three means that the data has a high degree of temporal + locality and should be left in all levels of cache possible. + Values of one and two mean, respectively, a low or moderate degree + of temporal locality. The default is three. + + for (i = 0; i < n; i++) + { + a[i] = a[i] + b[i]; + __builtin_prefetch (&a[i+j], 1, 1); + __builtin_prefetch (&b[i+j], 0, 1); + /* ... */ + } + + Data prefetch does not generate faults if ADDR is invalid, but the + address expression itself must be valid. For example, a prefetch + of `p->next' will not fault if `p->next' is not a valid address, + but evaluation will fault if `p' is not a valid address. + + If the target does not support data prefetch, the address + expression is evaluated if it includes side effects but no other + code is generated and GCC does not issue a warning. + +  + File: gcc.info, Node: Target Builtins, Next: Pragmas, Prev: Other Builtins, Up: C Extensions + + Built-in Functions Specific to Particular Target Machines + ========================================================= + + On some target machines, GCC supports many built-in functions + specific to those machines. Generally these generate calls to specific + machine instructions, but allow the compiler to schedule those calls. + + * Menu: + + * X86 Built-in Functions:: + * PowerPC AltiVec Built-in Functions:: + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-15 gcc-3.2.3/gcc/doc/gcc.info-15 *** gcc-3.2.2/gcc/doc/gcc.info-15 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-15 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,261 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: X86 Built-in Functions, Next: PowerPC AltiVec Built-in Functions, Up: Target Builtins + + X86 Built-in Functions + ---------------------- + + These built-in functions are available for the i386 and x86-64 family + of computers, depending on the command-line switches used. + + The following machine modes are available for use with MMX built-in + functions (*note Vector Extensions::): `V2SI' for a vector of two + 32-bit integers, `V4HI' for a vector of four 16-bit integers, and + `V8QI' for a vector of eight 8-bit integers. Some of the built-in + functions operate on MMX registers as a whole 64-bit entity, these use + `DI' as their mode. + + If 3Dnow extensions are enabled, `V2SF' is used as a mode for a + vector of two 32-bit floating point values. + + If SSE extensions are enabled, `V4SF' is used for a vector of four + 32-bit floating point values. Some instructions use a vector of four + 32-bit integers, these use `V4SI'. Finally, some instructions operate + on an entire vector register, interpreting it as a 128-bit integer, + these use mode `TI'. + + The following built-in functions are made available by `-mmmx'. All + of them generate the machine instruction that is part of the name. + + v8qi __builtin_ia32_paddb (v8qi, v8qi) + v4hi __builtin_ia32_paddw (v4hi, v4hi) + v2si __builtin_ia32_paddd (v2si, v2si) + v8qi __builtin_ia32_psubb (v8qi, v8qi) + v4hi __builtin_ia32_psubw (v4hi, v4hi) + v2si __builtin_ia32_psubd (v2si, v2si) + v8qi __builtin_ia32_paddsb (v8qi, v8qi) + v4hi __builtin_ia32_paddsw (v4hi, v4hi) + v8qi __builtin_ia32_psubsb (v8qi, v8qi) + v4hi __builtin_ia32_psubsw (v4hi, v4hi) + v8qi __builtin_ia32_paddusb (v8qi, v8qi) + v4hi __builtin_ia32_paddusw (v4hi, v4hi) + v8qi __builtin_ia32_psubusb (v8qi, v8qi) + v4hi __builtin_ia32_psubusw (v4hi, v4hi) + v4hi __builtin_ia32_pmullw (v4hi, v4hi) + v4hi __builtin_ia32_pmulhw (v4hi, v4hi) + di __builtin_ia32_pand (di, di) + di __builtin_ia32_pandn (di,di) + di __builtin_ia32_por (di, di) + di __builtin_ia32_pxor (di, di) + v8qi __builtin_ia32_pcmpeqb (v8qi, v8qi) + v4hi __builtin_ia32_pcmpeqw (v4hi, v4hi) + v2si __builtin_ia32_pcmpeqd (v2si, v2si) + v8qi __builtin_ia32_pcmpgtb (v8qi, v8qi) + v4hi __builtin_ia32_pcmpgtw (v4hi, v4hi) + v2si __builtin_ia32_pcmpgtd (v2si, v2si) + v8qi __builtin_ia32_punpckhbw (v8qi, v8qi) + v4hi __builtin_ia32_punpckhwd (v4hi, v4hi) + v2si __builtin_ia32_punpckhdq (v2si, v2si) + v8qi __builtin_ia32_punpcklbw (v8qi, v8qi) + v4hi __builtin_ia32_punpcklwd (v4hi, v4hi) + v2si __builtin_ia32_punpckldq (v2si, v2si) + v8qi __builtin_ia32_packsswb (v4hi, v4hi) + v4hi __builtin_ia32_packssdw (v2si, v2si) + v8qi __builtin_ia32_packuswb (v4hi, v4hi) + + The following built-in functions are made available either with + `-msse', or with a combination of `-m3dnow' and `-march=athlon'. All + of them generate the machine instruction that is part of the name. + + v4hi __builtin_ia32_pmulhuw (v4hi, v4hi) + v8qi __builtin_ia32_pavgb (v8qi, v8qi) + v4hi __builtin_ia32_pavgw (v4hi, v4hi) + v4hi __builtin_ia32_psadbw (v8qi, v8qi) + v8qi __builtin_ia32_pmaxub (v8qi, v8qi) + v4hi __builtin_ia32_pmaxsw (v4hi, v4hi) + v8qi __builtin_ia32_pminub (v8qi, v8qi) + v4hi __builtin_ia32_pminsw (v4hi, v4hi) + int __builtin_ia32_pextrw (v4hi, int) + v4hi __builtin_ia32_pinsrw (v4hi, int, int) + int __builtin_ia32_pmovmskb (v8qi) + void __builtin_ia32_maskmovq (v8qi, v8qi, char *) + void __builtin_ia32_movntq (di *, di) + void __builtin_ia32_sfence (void) + + The following built-in functions are available when `-msse' is used. + All of them generate the machine instruction that is part of the name. + + int __builtin_ia32_comieq (v4sf, v4sf) + int __builtin_ia32_comineq (v4sf, v4sf) + int __builtin_ia32_comilt (v4sf, v4sf) + int __builtin_ia32_comile (v4sf, v4sf) + int __builtin_ia32_comigt (v4sf, v4sf) + int __builtin_ia32_comige (v4sf, v4sf) + int __builtin_ia32_ucomieq (v4sf, v4sf) + int __builtin_ia32_ucomineq (v4sf, v4sf) + int __builtin_ia32_ucomilt (v4sf, v4sf) + int __builtin_ia32_ucomile (v4sf, v4sf) + int __builtin_ia32_ucomigt (v4sf, v4sf) + int __builtin_ia32_ucomige (v4sf, v4sf) + v4sf __builtin_ia32_addps (v4sf, v4sf) + v4sf __builtin_ia32_subps (v4sf, v4sf) + v4sf __builtin_ia32_mulps (v4sf, v4sf) + v4sf __builtin_ia32_divps (v4sf, v4sf) + v4sf __builtin_ia32_addss (v4sf, v4sf) + v4sf __builtin_ia32_subss (v4sf, v4sf) + v4sf __builtin_ia32_mulss (v4sf, v4sf) + v4sf __builtin_ia32_divss (v4sf, v4sf) + v4si __builtin_ia32_cmpeqps (v4sf, v4sf) + v4si __builtin_ia32_cmpltps (v4sf, v4sf) + v4si __builtin_ia32_cmpleps (v4sf, v4sf) + v4si __builtin_ia32_cmpgtps (v4sf, v4sf) + v4si __builtin_ia32_cmpgeps (v4sf, v4sf) + v4si __builtin_ia32_cmpunordps (v4sf, v4sf) + v4si __builtin_ia32_cmpneqps (v4sf, v4sf) + v4si __builtin_ia32_cmpnltps (v4sf, v4sf) + v4si __builtin_ia32_cmpnleps (v4sf, v4sf) + v4si __builtin_ia32_cmpngtps (v4sf, v4sf) + v4si __builtin_ia32_cmpngeps (v4sf, v4sf) + v4si __builtin_ia32_cmpordps (v4sf, v4sf) + v4si __builtin_ia32_cmpeqss (v4sf, v4sf) + v4si __builtin_ia32_cmpltss (v4sf, v4sf) + v4si __builtin_ia32_cmpless (v4sf, v4sf) + v4si __builtin_ia32_cmpgtss (v4sf, v4sf) + v4si __builtin_ia32_cmpgess (v4sf, v4sf) + v4si __builtin_ia32_cmpunordss (v4sf, v4sf) + v4si __builtin_ia32_cmpneqss (v4sf, v4sf) + v4si __builtin_ia32_cmpnlts (v4sf, v4sf) + v4si __builtin_ia32_cmpnless (v4sf, v4sf) + v4si __builtin_ia32_cmpngtss (v4sf, v4sf) + v4si __builtin_ia32_cmpngess (v4sf, v4sf) + v4si __builtin_ia32_cmpordss (v4sf, v4sf) + v4sf __builtin_ia32_maxps (v4sf, v4sf) + v4sf __builtin_ia32_maxss (v4sf, v4sf) + v4sf __builtin_ia32_minps (v4sf, v4sf) + v4sf __builtin_ia32_minss (v4sf, v4sf) + v4sf __builtin_ia32_andps (v4sf, v4sf) + v4sf __builtin_ia32_andnps (v4sf, v4sf) + v4sf __builtin_ia32_orps (v4sf, v4sf) + v4sf __builtin_ia32_xorps (v4sf, v4sf) + v4sf __builtin_ia32_movss (v4sf, v4sf) + v4sf __builtin_ia32_movhlps (v4sf, v4sf) + v4sf __builtin_ia32_movlhps (v4sf, v4sf) + v4sf __builtin_ia32_unpckhps (v4sf, v4sf) + v4sf __builtin_ia32_unpcklps (v4sf, v4sf) + v4sf __builtin_ia32_cvtpi2ps (v4sf, v2si) + v4sf __builtin_ia32_cvtsi2ss (v4sf, int) + v2si __builtin_ia32_cvtps2pi (v4sf) + int __builtin_ia32_cvtss2si (v4sf) + v2si __builtin_ia32_cvttps2pi (v4sf) + int __builtin_ia32_cvttss2si (v4sf) + v4sf __builtin_ia32_rcpps (v4sf) + v4sf __builtin_ia32_rsqrtps (v4sf) + v4sf __builtin_ia32_sqrtps (v4sf) + v4sf __builtin_ia32_rcpss (v4sf) + v4sf __builtin_ia32_rsqrtss (v4sf) + v4sf __builtin_ia32_sqrtss (v4sf) + v4sf __builtin_ia32_shufps (v4sf, v4sf, int) + void __builtin_ia32_movntps (float *, v4sf) + int __builtin_ia32_movmskps (v4sf) + + The following built-in functions are available when `-msse' is used. + + `v4sf __builtin_ia32_loadaps (float *)' + Generates the `movaps' machine instruction as a load from memory. + + `void __builtin_ia32_storeaps (float *, v4sf)' + Generates the `movaps' machine instruction as a store to memory. + + `v4sf __builtin_ia32_loadups (float *)' + Generates the `movups' machine instruction as a load from memory. + + `void __builtin_ia32_storeups (float *, v4sf)' + Generates the `movups' machine instruction as a store to memory. + + `v4sf __builtin_ia32_loadsss (float *)' + Generates the `movss' machine instruction as a load from memory. + + `void __builtin_ia32_storess (float *, v4sf)' + Generates the `movss' machine instruction as a store to memory. + + `v4sf __builtin_ia32_loadhps (v4sf, v2si *)' + Generates the `movhps' machine instruction as a load from memory. + + `v4sf __builtin_ia32_loadlps (v4sf, v2si *)' + Generates the `movlps' machine instruction as a load from memory + + `void __builtin_ia32_storehps (v4sf, v2si *)' + Generates the `movhps' machine instruction as a store to memory. + + `void __builtin_ia32_storelps (v4sf, v2si *)' + Generates the `movlps' machine instruction as a store to memory. + + The following built-in functions are available when `-m3dnow' is + used. All of them generate the machine instruction that is part of the + name. + + void __builtin_ia32_femms (void) + v8qi __builtin_ia32_pavgusb (v8qi, v8qi) + v2si __builtin_ia32_pf2id (v2sf) + v2sf __builtin_ia32_pfacc (v2sf, v2sf) + v2sf __builtin_ia32_pfadd (v2sf, v2sf) + v2si __builtin_ia32_pfcmpeq (v2sf, v2sf) + v2si __builtin_ia32_pfcmpge (v2sf, v2sf) + v2si __builtin_ia32_pfcmpgt (v2sf, v2sf) + v2sf __builtin_ia32_pfmax (v2sf, v2sf) + v2sf __builtin_ia32_pfmin (v2sf, v2sf) + v2sf __builtin_ia32_pfmul (v2sf, v2sf) + v2sf __builtin_ia32_pfrcp (v2sf) + v2sf __builtin_ia32_pfrcpit1 (v2sf, v2sf) + v2sf __builtin_ia32_pfrcpit2 (v2sf, v2sf) + v2sf __builtin_ia32_pfrsqrt (v2sf) + v2sf __builtin_ia32_pfrsqrtit1 (v2sf, v2sf) + v2sf __builtin_ia32_pfsub (v2sf, v2sf) + v2sf __builtin_ia32_pfsubr (v2sf, v2sf) + v2sf __builtin_ia32_pi2fd (v2si) + v4hi __builtin_ia32_pmulhrw (v4hi, v4hi) + + The following built-in functions are available when both `-m3dnow' + and `-march=athlon' are used. All of them generate the machine + instruction that is part of the name. + + v2si __builtin_ia32_pf2iw (v2sf) + v2sf __builtin_ia32_pfnacc (v2sf, v2sf) + v2sf __builtin_ia32_pfpnacc (v2sf, v2sf) + v2sf __builtin_ia32_pi2fw (v2si) + v2sf __builtin_ia32_pswapdsf (v2sf) + v2si __builtin_ia32_pswapdsi (v2si) + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-16 gcc-3.2.3/gcc/doc/gcc.info-16 *** gcc-3.2.2/gcc/doc/gcc.info-16 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-16 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1106 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: PowerPC AltiVec Built-in Functions, Prev: X86 Built-in Functions, Up: Target Builtins + + PowerPC AltiVec Built-in Functions + ---------------------------------- + + These built-in functions are available for the PowerPC family of + computers, depending on the command-line switches used. + + The following machine modes are available for use with AltiVec + built-in functions (*note Vector Extensions::): `V4SI' for a vector of + four 32-bit integers, `V4SF' for a vector of four 32-bit floating point + numbers, `V8HI' for a vector of eight 16-bit integers, and `V16QI' for + a vector of sixteen 8-bit integers. + + The following functions are made available by including + `' and using `-maltivec' and `-mabi=altivec'. The functions + implement the functionality described in Motorola's AltiVec Programming + Interface Manual. + + _Note:_ Only the `' interface is supported. Internally, + GCC uses built-in functions to achieve the functionality in the + aforementioned header file, but they are not supported and are subject + to change without notice. + + vector signed char vec_abs (vector signed char, vector signed char); + vector signed short vec_abs (vector signed short, vector signed short); + vector signed int vec_abs (vector signed int, vector signed int); + vector signed float vec_abs (vector signed float, vector signed float); + + vector signed char vec_abss (vector signed char, vector signed char); + vector signed short vec_abss (vector signed short, vector signed short); + + vector signed char vec_add (vector signed char, vector signed char); + vector unsigned char vec_add (vector signed char, vector unsigned char); + + vector unsigned char vec_add (vector unsigned char, vector signed char); + + vector unsigned char vec_add (vector unsigned char, + vector unsigned char); + vector signed short vec_add (vector signed short, vector signed short); + vector unsigned short vec_add (vector signed short, + vector unsigned short); + vector unsigned short vec_add (vector unsigned short, + vector signed short); + vector unsigned short vec_add (vector unsigned short, + vector unsigned short); + vector signed int vec_add (vector signed int, vector signed int); + vector unsigned int vec_add (vector signed int, vector unsigned int); + vector unsigned int vec_add (vector unsigned int, vector signed int); + vector unsigned int vec_add (vector unsigned int, vector unsigned int); + vector float vec_add (vector float, vector float); + + vector unsigned int vec_addc (vector unsigned int, vector unsigned int); + + vector unsigned char vec_adds (vector signed char, + vector unsigned char); + vector unsigned char vec_adds (vector unsigned char, + vector signed char); + vector unsigned char vec_adds (vector unsigned char, + vector unsigned char); + vector signed char vec_adds (vector signed char, vector signed char); + vector unsigned short vec_adds (vector signed short, + vector unsigned short); + vector unsigned short vec_adds (vector unsigned short, + vector signed short); + vector unsigned short vec_adds (vector unsigned short, + vector unsigned short); + vector signed short vec_adds (vector signed short, vector signed short); + + vector unsigned int vec_adds (vector signed int, vector unsigned int); + vector unsigned int vec_adds (vector unsigned int, vector signed int); + vector unsigned int vec_adds (vector unsigned int, vector unsigned int); + + vector signed int vec_adds (vector signed int, vector signed int); + + vector float vec_and (vector float, vector float); + vector float vec_and (vector float, vector signed int); + vector float vec_and (vector signed int, vector float); + vector signed int vec_and (vector signed int, vector signed int); + vector unsigned int vec_and (vector signed int, vector unsigned int); + vector unsigned int vec_and (vector unsigned int, vector signed int); + vector unsigned int vec_and (vector unsigned int, vector unsigned int); + vector signed short vec_and (vector signed short, vector signed short); + vector unsigned short vec_and (vector signed short, + vector unsigned short); + vector unsigned short vec_and (vector unsigned short, + vector signed short); + vector unsigned short vec_and (vector unsigned short, + vector unsigned short); + vector signed char vec_and (vector signed char, vector signed char); + vector unsigned char vec_and (vector signed char, vector unsigned char); + + vector unsigned char vec_and (vector unsigned char, vector signed char); + + vector unsigned char vec_and (vector unsigned char, + vector unsigned char); + + vector float vec_andc (vector float, vector float); + vector float vec_andc (vector float, vector signed int); + vector float vec_andc (vector signed int, vector float); + vector signed int vec_andc (vector signed int, vector signed int); + vector unsigned int vec_andc (vector signed int, vector unsigned int); + vector unsigned int vec_andc (vector unsigned int, vector signed int); + vector unsigned int vec_andc (vector unsigned int, vector unsigned int); + + vector signed short vec_andc (vector signed short, vector signed short); + + vector unsigned short vec_andc (vector signed short, + vector unsigned short); + vector unsigned short vec_andc (vector unsigned short, + vector signed short); + vector unsigned short vec_andc (vector unsigned short, + vector unsigned short); + vector signed char vec_andc (vector signed char, vector signed char); + vector unsigned char vec_andc (vector signed char, + vector unsigned char); + vector unsigned char vec_andc (vector unsigned char, + vector signed char); + vector unsigned char vec_andc (vector unsigned char, + vector unsigned char); + + vector unsigned char vec_avg (vector unsigned char, + vector unsigned char); + vector signed char vec_avg (vector signed char, vector signed char); + vector unsigned short vec_avg (vector unsigned short, + vector unsigned short); + vector signed short vec_avg (vector signed short, vector signed short); + vector unsigned int vec_avg (vector unsigned int, vector unsigned int); + vector signed int vec_avg (vector signed int, vector signed int); + + vector float vec_ceil (vector float); + + vector signed int vec_cmpb (vector float, vector float); + + vector signed char vec_cmpeq (vector signed char, vector signed char); + vector signed char vec_cmpeq (vector unsigned char, + vector unsigned char); + vector signed short vec_cmpeq (vector signed short, + vector signed short); + vector signed short vec_cmpeq (vector unsigned short, + vector unsigned short); + vector signed int vec_cmpeq (vector signed int, vector signed int); + vector signed int vec_cmpeq (vector unsigned int, vector unsigned int); + vector signed int vec_cmpeq (vector float, vector float); + + vector signed int vec_cmpge (vector float, vector float); + + vector signed char vec_cmpgt (vector unsigned char, + vector unsigned char); + vector signed char vec_cmpgt (vector signed char, vector signed char); + vector signed short vec_cmpgt (vector unsigned short, + vector unsigned short); + vector signed short vec_cmpgt (vector signed short, + vector signed short); + vector signed int vec_cmpgt (vector unsigned int, vector unsigned int); + vector signed int vec_cmpgt (vector signed int, vector signed int); + vector signed int vec_cmpgt (vector float, vector float); + + vector signed int vec_cmple (vector float, vector float); + + vector signed char vec_cmplt (vector unsigned char, + vector unsigned char); + vector signed char vec_cmplt (vector signed char, vector signed char); + vector signed short vec_cmplt (vector unsigned short, + vector unsigned short); + vector signed short vec_cmplt (vector signed short, + vector signed short); + vector signed int vec_cmplt (vector unsigned int, vector unsigned int); + vector signed int vec_cmplt (vector signed int, vector signed int); + vector signed int vec_cmplt (vector float, vector float); + + vector float vec_ctf (vector unsigned int, const char); + vector float vec_ctf (vector signed int, const char); + + vector signed int vec_cts (vector float, const char); + + vector unsigned int vec_ctu (vector float, const char); + + void vec_dss (const char); + + void vec_dssall (void); + + void vec_dst (void *, int, const char); + + void vec_dstst (void *, int, const char); + + void vec_dststt (void *, int, const char); + + void vec_dstt (void *, int, const char); + + vector float vec_expte (vector float, vector float); + + vector float vec_floor (vector float, vector float); + + vector float vec_ld (int, vector float *); + vector float vec_ld (int, float *): + vector signed int vec_ld (int, int *); + vector signed int vec_ld (int, vector signed int *); + vector unsigned int vec_ld (int, vector unsigned int *); + vector unsigned int vec_ld (int, unsigned int *); + vector signed short vec_ld (int, short *, vector signed short *); + vector unsigned short vec_ld (int, unsigned short *, + vector unsigned short *); + vector signed char vec_ld (int, signed char *); + vector signed char vec_ld (int, vector signed char *); + vector unsigned char vec_ld (int, unsigned char *); + vector unsigned char vec_ld (int, vector unsigned char *); + + vector signed char vec_lde (int, signed char *); + vector unsigned char vec_lde (int, unsigned char *); + vector signed short vec_lde (int, short *); + vector unsigned short vec_lde (int, unsigned short *); + vector float vec_lde (int, float *); + vector signed int vec_lde (int, int *); + vector unsigned int vec_lde (int, unsigned int *); + + void float vec_ldl (int, float *); + void float vec_ldl (int, vector float *); + void signed int vec_ldl (int, vector signed int *); + void signed int vec_ldl (int, int *); + void unsigned int vec_ldl (int, unsigned int *); + void unsigned int vec_ldl (int, vector unsigned int *); + void signed short vec_ldl (int, vector signed short *); + void signed short vec_ldl (int, short *); + void unsigned short vec_ldl (int, vector unsigned short *); + void unsigned short vec_ldl (int, unsigned short *); + void signed char vec_ldl (int, vector signed char *); + void signed char vec_ldl (int, signed char *); + void unsigned char vec_ldl (int, vector unsigned char *); + void unsigned char vec_ldl (int, unsigned char *); + + vector float vec_loge (vector float); + + vector unsigned char vec_lvsl (int, void *, int *); + + vector unsigned char vec_lvsr (int, void *, int *); + + vector float vec_madd (vector float, vector float, vector float); + + vector signed short vec_madds (vector signed short, vector signed short, + vector signed short); + + vector unsigned char vec_max (vector signed char, vector unsigned char); + + vector unsigned char vec_max (vector unsigned char, vector signed char); + + vector unsigned char vec_max (vector unsigned char, + vector unsigned char); + vector signed char vec_max (vector signed char, vector signed char); + vector unsigned short vec_max (vector signed short, + vector unsigned short); + vector unsigned short vec_max (vector unsigned short, + vector signed short); + vector unsigned short vec_max (vector unsigned short, + vector unsigned short); + vector signed short vec_max (vector signed short, vector signed short); + vector unsigned int vec_max (vector signed int, vector unsigned int); + vector unsigned int vec_max (vector unsigned int, vector signed int); + vector unsigned int vec_max (vector unsigned int, vector unsigned int); + vector signed int vec_max (vector signed int, vector signed int); + vector float vec_max (vector float, vector float); + + vector signed char vec_mergeh (vector signed char, vector signed char); + vector unsigned char vec_mergeh (vector unsigned char, + vector unsigned char); + vector signed short vec_mergeh (vector signed short, + vector signed short); + vector unsigned short vec_mergeh (vector unsigned short, + vector unsigned short); + vector float vec_mergeh (vector float, vector float); + vector signed int vec_mergeh (vector signed int, vector signed int); + vector unsigned int vec_mergeh (vector unsigned int, + vector unsigned int); + + vector signed char vec_mergel (vector signed char, vector signed char); + vector unsigned char vec_mergel (vector unsigned char, + vector unsigned char); + vector signed short vec_mergel (vector signed short, + vector signed short); + vector unsigned short vec_mergel (vector unsigned short, + vector unsigned short); + vector float vec_mergel (vector float, vector float); + vector signed int vec_mergel (vector signed int, vector signed int); + vector unsigned int vec_mergel (vector unsigned int, + vector unsigned int); + + vector unsigned short vec_mfvscr (void); + + vector unsigned char vec_min (vector signed char, vector unsigned char); + + vector unsigned char vec_min (vector unsigned char, vector signed char); + + vector unsigned char vec_min (vector unsigned char, + vector unsigned char); + vector signed char vec_min (vector signed char, vector signed char); + vector unsigned short vec_min (vector signed short, + vector unsigned short); + vector unsigned short vec_min (vector unsigned short, + vector signed short); + vector unsigned short vec_min (vector unsigned short, + vector unsigned short); + vector signed short vec_min (vector signed short, vector signed short); + vector unsigned int vec_min (vector signed int, vector unsigned int); + vector unsigned int vec_min (vector unsigned int, vector signed int); + vector unsigned int vec_min (vector unsigned int, vector unsigned int); + vector signed int vec_min (vector signed int, vector signed int); + vector float vec_min (vector float, vector float); + + vector signed short vec_mladd (vector signed short, vector signed short, + vector signed short); + vector signed short vec_mladd (vector signed short, + vector unsigned short, + vector unsigned short); + vector signed short vec_mladd (vector unsigned short, + vector signed short, + vector signed short); + vector unsigned short vec_mladd (vector unsigned short, + vector unsigned short, + vector unsigned short); + + vector signed short vec_mradds (vector signed short, + vector signed short, + vector signed short); + + vector unsigned int vec_msum (vector unsigned char, + vector unsigned char, + vector unsigned int); + vector signed int vec_msum (vector signed char, vector unsigned char, + vector signed int); + vector unsigned int vec_msum (vector unsigned short, + vector unsigned short, + vector unsigned int); + vector signed int vec_msum (vector signed short, vector signed short, + vector signed int); + + vector unsigned int vec_msums (vector unsigned short, + vector unsigned short, + vector unsigned int); + vector signed int vec_msums (vector signed short, vector signed short, + vector signed int); + + void vec_mtvscr (vector signed int); + void vec_mtvscr (vector unsigned int); + void vec_mtvscr (vector signed short); + void vec_mtvscr (vector unsigned short); + void vec_mtvscr (vector signed char); + void vec_mtvscr (vector unsigned char); + + vector unsigned short vec_mule (vector unsigned char, + vector unsigned char); + vector signed short vec_mule (vector signed char, vector signed char); + vector unsigned int vec_mule (vector unsigned short, + vector unsigned short); + vector signed int vec_mule (vector signed short, vector signed short); + + vector unsigned short vec_mulo (vector unsigned char, + vector unsigned char); + vector signed short vec_mulo (vector signed char, vector signed char); + vector unsigned int vec_mulo (vector unsigned short, + vector unsigned short); + vector signed int vec_mulo (vector signed short, vector signed short); + + vector float vec_nmsub (vector float, vector float, vector float); + + vector float vec_nor (vector float, vector float); + vector signed int vec_nor (vector signed int, vector signed int); + vector unsigned int vec_nor (vector unsigned int, vector unsigned int); + vector signed short vec_nor (vector signed short, vector signed short); + vector unsigned short vec_nor (vector unsigned short, + vector unsigned short); + vector signed char vec_nor (vector signed char, vector signed char); + vector unsigned char vec_nor (vector unsigned char, + vector unsigned char); + + vector float vec_or (vector float, vector float); + vector float vec_or (vector float, vector signed int); + vector float vec_or (vector signed int, vector float); + vector signed int vec_or (vector signed int, vector signed int); + vector unsigned int vec_or (vector signed int, vector unsigned int); + vector unsigned int vec_or (vector unsigned int, vector signed int); + vector unsigned int vec_or (vector unsigned int, vector unsigned int); + vector signed short vec_or (vector signed short, vector signed short); + vector unsigned short vec_or (vector signed short, + vector unsigned short); + vector unsigned short vec_or (vector unsigned short, + vector signed short); + vector unsigned short vec_or (vector unsigned short, + vector unsigned short); + vector signed char vec_or (vector signed char, vector signed char); + vector unsigned char vec_or (vector signed char, vector unsigned char); + vector unsigned char vec_or (vector unsigned char, vector signed char); + vector unsigned char vec_or (vector unsigned char, + vector unsigned char); + + vector signed char vec_pack (vector signed short, vector signed short); + vector unsigned char vec_pack (vector unsigned short, + vector unsigned short); + vector signed short vec_pack (vector signed int, vector signed int); + vector unsigned short vec_pack (vector unsigned int, + vector unsigned int); + + vector signed short vec_packpx (vector unsigned int, + vector unsigned int); + + vector unsigned char vec_packs (vector unsigned short, + vector unsigned short); + vector signed char vec_packs (vector signed short, vector signed short); + + vector unsigned short vec_packs (vector unsigned int, + vector unsigned int); + vector signed short vec_packs (vector signed int, vector signed int); + + vector unsigned char vec_packsu (vector unsigned short, + vector unsigned short); + vector unsigned char vec_packsu (vector signed short, + vector signed short); + vector unsigned short vec_packsu (vector unsigned int, + vector unsigned int); + vector unsigned short vec_packsu (vector signed int, vector signed int); + + vector float vec_perm (vector float, vector float, + vector unsigned char); + vector signed int vec_perm (vector signed int, vector signed int, + vector unsigned char); + vector unsigned int vec_perm (vector unsigned int, vector unsigned int, + vector unsigned char); + vector signed short vec_perm (vector signed short, vector signed short, + vector unsigned char); + vector unsigned short vec_perm (vector unsigned short, + vector unsigned short, + vector unsigned char); + vector signed char vec_perm (vector signed char, vector signed char, + vector unsigned char); + vector unsigned char vec_perm (vector unsigned char, + vector unsigned char, + vector unsigned char); + + vector float vec_re (vector float); + + vector signed char vec_rl (vector signed char, vector unsigned char); + vector unsigned char vec_rl (vector unsigned char, + vector unsigned char); + vector signed short vec_rl (vector signed short, vector unsigned short); + + vector unsigned short vec_rl (vector unsigned short, + vector unsigned short); + vector signed int vec_rl (vector signed int, vector unsigned int); + vector unsigned int vec_rl (vector unsigned int, vector unsigned int); + + vector float vec_round (vector float); + + vector float vec_rsqrte (vector float); + + vector float vec_sel (vector float, vector float, vector signed int); + vector float vec_sel (vector float, vector float, vector unsigned int); + vector signed int vec_sel (vector signed int, vector signed int, + vector signed int); + vector signed int vec_sel (vector signed int, vector signed int, + vector unsigned int); + vector unsigned int vec_sel (vector unsigned int, vector unsigned int, + vector signed int); + vector unsigned int vec_sel (vector unsigned int, vector unsigned int, + vector unsigned int); + vector signed short vec_sel (vector signed short, vector signed short, + vector signed short); + vector signed short vec_sel (vector signed short, vector signed short, + vector unsigned short); + vector unsigned short vec_sel (vector unsigned short, + vector unsigned short, + vector signed short); + vector unsigned short vec_sel (vector unsigned short, + vector unsigned short, + vector unsigned short); + vector signed char vec_sel (vector signed char, vector signed char, + vector signed char); + vector signed char vec_sel (vector signed char, vector signed char, + vector unsigned char); + vector unsigned char vec_sel (vector unsigned char, + vector unsigned char, + vector signed char); + vector unsigned char vec_sel (vector unsigned char, + vector unsigned char, + vector unsigned char); + + vector signed char vec_sl (vector signed char, vector unsigned char); + vector unsigned char vec_sl (vector unsigned char, + vector unsigned char); + vector signed short vec_sl (vector signed short, vector unsigned short); + + vector unsigned short vec_sl (vector unsigned short, + vector unsigned short); + vector signed int vec_sl (vector signed int, vector unsigned int); + vector unsigned int vec_sl (vector unsigned int, vector unsigned int); + + vector float vec_sld (vector float, vector float, const char); + vector signed int vec_sld (vector signed int, vector signed int, + const char); + vector unsigned int vec_sld (vector unsigned int, vector unsigned int, + const char); + vector signed short vec_sld (vector signed short, vector signed short, + const char); + vector unsigned short vec_sld (vector unsigned short, + vector unsigned short, const char); + vector signed char vec_sld (vector signed char, vector signed char, + const char); + vector unsigned char vec_sld (vector unsigned char, + vector unsigned char, + const char); + + vector signed int vec_sll (vector signed int, vector unsigned int); + vector signed int vec_sll (vector signed int, vector unsigned short); + vector signed int vec_sll (vector signed int, vector unsigned char); + vector unsigned int vec_sll (vector unsigned int, vector unsigned int); + vector unsigned int vec_sll (vector unsigned int, + vector unsigned short); + vector unsigned int vec_sll (vector unsigned int, vector unsigned char); + + vector signed short vec_sll (vector signed short, vector unsigned int); + vector signed short vec_sll (vector signed short, + vector unsigned short); + vector signed short vec_sll (vector signed short, vector unsigned char); + + vector unsigned short vec_sll (vector unsigned short, + vector unsigned int); + vector unsigned short vec_sll (vector unsigned short, + vector unsigned short); + vector unsigned short vec_sll (vector unsigned short, + vector unsigned char); + vector signed char vec_sll (vector signed char, vector unsigned int); + vector signed char vec_sll (vector signed char, vector unsigned short); + vector signed char vec_sll (vector signed char, vector unsigned char); + vector unsigned char vec_sll (vector unsigned char, + vector unsigned int); + vector unsigned char vec_sll (vector unsigned char, + vector unsigned short); + vector unsigned char vec_sll (vector unsigned char, + vector unsigned char); + + vector float vec_slo (vector float, vector signed char); + vector float vec_slo (vector float, vector unsigned char); + vector signed int vec_slo (vector signed int, vector signed char); + vector signed int vec_slo (vector signed int, vector unsigned char); + vector unsigned int vec_slo (vector unsigned int, vector signed char); + vector unsigned int vec_slo (vector unsigned int, vector unsigned char); + + vector signed short vec_slo (vector signed short, vector signed char); + vector signed short vec_slo (vector signed short, vector unsigned char); + + vector unsigned short vec_slo (vector unsigned short, + vector signed char); + vector unsigned short vec_slo (vector unsigned short, + vector unsigned char); + vector signed char vec_slo (vector signed char, vector signed char); + vector signed char vec_slo (vector signed char, vector unsigned char); + vector unsigned char vec_slo (vector unsigned char, vector signed char); + + vector unsigned char vec_slo (vector unsigned char, + vector unsigned char); + + vector signed char vec_splat (vector signed char, const char); + vector unsigned char vec_splat (vector unsigned char, const char); + vector signed short vec_splat (vector signed short, const char); + vector unsigned short vec_splat (vector unsigned short, const char); + vector float vec_splat (vector float, const char); + vector signed int vec_splat (vector signed int, const char); + vector unsigned int vec_splat (vector unsigned int, const char); + + vector signed char vec_splat_s8 (const char); + + vector signed short vec_splat_s16 (const char); + + vector signed int vec_splat_s32 (const char); + + vector unsigned char vec_splat_u8 (const char); + + vector unsigned short vec_splat_u16 (const char); + + vector unsigned int vec_splat_u32 (const char); + + vector signed char vec_sr (vector signed char, vector unsigned char); + vector unsigned char vec_sr (vector unsigned char, + vector unsigned char); + vector signed short vec_sr (vector signed short, vector unsigned short); + + vector unsigned short vec_sr (vector unsigned short, + vector unsigned short); + vector signed int vec_sr (vector signed int, vector unsigned int); + vector unsigned int vec_sr (vector unsigned int, vector unsigned int); + + vector signed char vec_sra (vector signed char, vector unsigned char); + vector unsigned char vec_sra (vector unsigned char, + vector unsigned char); + vector signed short vec_sra (vector signed short, + vector unsigned short); + vector unsigned short vec_sra (vector unsigned short, + vector unsigned short); + vector signed int vec_sra (vector signed int, vector unsigned int); + vector unsigned int vec_sra (vector unsigned int, vector unsigned int); + + vector signed int vec_srl (vector signed int, vector unsigned int); + vector signed int vec_srl (vector signed int, vector unsigned short); + vector signed int vec_srl (vector signed int, vector unsigned char); + vector unsigned int vec_srl (vector unsigned int, vector unsigned int); + vector unsigned int vec_srl (vector unsigned int, + vector unsigned short); + vector unsigned int vec_srl (vector unsigned int, vector unsigned char); + + vector signed short vec_srl (vector signed short, vector unsigned int); + vector signed short vec_srl (vector signed short, + vector unsigned short); + vector signed short vec_srl (vector signed short, vector unsigned char); + + vector unsigned short vec_srl (vector unsigned short, + vector unsigned int); + vector unsigned short vec_srl (vector unsigned short, + vector unsigned short); + vector unsigned short vec_srl (vector unsigned short, + vector unsigned char); + vector signed char vec_srl (vector signed char, vector unsigned int); + vector signed char vec_srl (vector signed char, vector unsigned short); + vector signed char vec_srl (vector signed char, vector unsigned char); + vector unsigned char vec_srl (vector unsigned char, + vector unsigned int); + vector unsigned char vec_srl (vector unsigned char, + vector unsigned short); + vector unsigned char vec_srl (vector unsigned char, + vector unsigned char); + + vector float vec_sro (vector float, vector signed char); + vector float vec_sro (vector float, vector unsigned char); + vector signed int vec_sro (vector signed int, vector signed char); + vector signed int vec_sro (vector signed int, vector unsigned char); + vector unsigned int vec_sro (vector unsigned int, vector signed char); + vector unsigned int vec_sro (vector unsigned int, vector unsigned char); + + vector signed short vec_sro (vector signed short, vector signed char); + vector signed short vec_sro (vector signed short, vector unsigned char); + + vector unsigned short vec_sro (vector unsigned short, + vector signed char); + vector unsigned short vec_sro (vector unsigned short, + vector unsigned char); + vector signed char vec_sro (vector signed char, vector signed char); + vector signed char vec_sro (vector signed char, vector unsigned char); + vector unsigned char vec_sro (vector unsigned char, vector signed char); + + vector unsigned char vec_sro (vector unsigned char, + vector unsigned char); + + void vec_st (vector float, int, float *); + void vec_st (vector float, int, vector float *); + void vec_st (vector signed int, int, int *); + void vec_st (vector signed int, int, unsigned int *); + void vec_st (vector unsigned int, int, unsigned int *); + void vec_st (vector unsigned int, int, vector unsigned int *); + void vec_st (vector signed short, int, short *); + void vec_st (vector signed short, int, vector unsigned short *); + void vec_st (vector signed short, int, vector signed short *); + void vec_st (vector unsigned short, int, unsigned short *); + void vec_st (vector unsigned short, int, vector unsigned short *); + void vec_st (vector signed char, int, signed char *); + void vec_st (vector signed char, int, unsigned char *); + void vec_st (vector signed char, int, vector signed char *); + void vec_st (vector unsigned char, int, unsigned char *); + void vec_st (vector unsigned char, int, vector unsigned char *); + + void vec_ste (vector signed char, int, unsigned char *); + void vec_ste (vector signed char, int, signed char *); + void vec_ste (vector unsigned char, int, unsigned char *); + void vec_ste (vector signed short, int, short *); + void vec_ste (vector signed short, int, unsigned short *); + void vec_ste (vector unsigned short, int, void *); + void vec_ste (vector signed int, int, unsigned int *); + void vec_ste (vector signed int, int, int *); + void vec_ste (vector unsigned int, int, unsigned int *); + void vec_ste (vector float, int, float *); + + void vec_stl (vector float, int, vector float *); + void vec_stl (vector float, int, float *); + void vec_stl (vector signed int, int, vector signed int *); + void vec_stl (vector signed int, int, int *); + void vec_stl (vector signed int, int, unsigned int *); + void vec_stl (vector unsigned int, int, vector unsigned int *); + void vec_stl (vector unsigned int, int, unsigned int *); + void vec_stl (vector signed short, int, short *); + void vec_stl (vector signed short, int, unsigned short *); + void vec_stl (vector signed short, int, vector signed short *); + void vec_stl (vector unsigned short, int, unsigned short *); + void vec_stl (vector unsigned short, int, vector signed short *); + void vec_stl (vector signed char, int, signed char *); + void vec_stl (vector signed char, int, unsigned char *); + void vec_stl (vector signed char, int, vector signed char *); + void vec_stl (vector unsigned char, int, unsigned char *); + void vec_stl (vector unsigned char, int, vector unsigned char *); + + vector signed char vec_sub (vector signed char, vector signed char); + vector unsigned char vec_sub (vector signed char, vector unsigned char); + + vector unsigned char vec_sub (vector unsigned char, vector signed char); + + vector unsigned char vec_sub (vector unsigned char, + vector unsigned char); + vector signed short vec_sub (vector signed short, vector signed short); + vector unsigned short vec_sub (vector signed short, + vector unsigned short); + vector unsigned short vec_sub (vector unsigned short, + vector signed short); + vector unsigned short vec_sub (vector unsigned short, + vector unsigned short); + vector signed int vec_sub (vector signed int, vector signed int); + vector unsigned int vec_sub (vector signed int, vector unsigned int); + vector unsigned int vec_sub (vector unsigned int, vector signed int); + vector unsigned int vec_sub (vector unsigned int, vector unsigned int); + vector float vec_sub (vector float, vector float); + + vector unsigned int vec_subc (vector unsigned int, vector unsigned int); + + vector unsigned char vec_subs (vector signed char, + vector unsigned char); + vector unsigned char vec_subs (vector unsigned char, + vector signed char); + vector unsigned char vec_subs (vector unsigned char, + vector unsigned char); + vector signed char vec_subs (vector signed char, vector signed char); + vector unsigned short vec_subs (vector signed short, + vector unsigned short); + vector unsigned short vec_subs (vector unsigned short, + vector signed short); + vector unsigned short vec_subs (vector unsigned short, + vector unsigned short); + vector signed short vec_subs (vector signed short, vector signed short); + + vector unsigned int vec_subs (vector signed int, vector unsigned int); + vector unsigned int vec_subs (vector unsigned int, vector signed int); + vector unsigned int vec_subs (vector unsigned int, vector unsigned int); + + vector signed int vec_subs (vector signed int, vector signed int); + + vector unsigned int vec_sum4s (vector unsigned char, + vector unsigned int); + vector signed int vec_sum4s (vector signed char, vector signed int); + vector signed int vec_sum4s (vector signed short, vector signed int); + + vector signed int vec_sum2s (vector signed int, vector signed int); + + vector signed int vec_sums (vector signed int, vector signed int); + + vector float vec_trunc (vector float); + + vector signed short vec_unpackh (vector signed char); + vector unsigned int vec_unpackh (vector signed short); + vector signed int vec_unpackh (vector signed short); + + vector signed short vec_unpackl (vector signed char); + vector unsigned int vec_unpackl (vector signed short); + vector signed int vec_unpackl (vector signed short); + + vector float vec_xor (vector float, vector float); + vector float vec_xor (vector float, vector signed int); + vector float vec_xor (vector signed int, vector float); + vector signed int vec_xor (vector signed int, vector signed int); + vector unsigned int vec_xor (vector signed int, vector unsigned int); + vector unsigned int vec_xor (vector unsigned int, vector signed int); + vector unsigned int vec_xor (vector unsigned int, vector unsigned int); + vector signed short vec_xor (vector signed short, vector signed short); + vector unsigned short vec_xor (vector signed short, + vector unsigned short); + vector unsigned short vec_xor (vector unsigned short, + vector signed short); + vector unsigned short vec_xor (vector unsigned short, + vector unsigned short); + vector signed char vec_xor (vector signed char, vector signed char); + vector unsigned char vec_xor (vector signed char, vector unsigned char); + + vector unsigned char vec_xor (vector unsigned char, vector signed char); + + vector unsigned char vec_xor (vector unsigned char, + vector unsigned char); + + vector signed int vec_all_eq (vector signed char, vector unsigned char); + + vector signed int vec_all_eq (vector signed char, vector signed char); + vector signed int vec_all_eq (vector unsigned char, vector signed char); + + vector signed int vec_all_eq (vector unsigned char, + vector unsigned char); + vector signed int vec_all_eq (vector signed short, + vector unsigned short); + vector signed int vec_all_eq (vector signed short, vector signed short); + + vector signed int vec_all_eq (vector unsigned short, + vector signed short); + vector signed int vec_all_eq (vector unsigned short, + vector unsigned short); + vector signed int vec_all_eq (vector signed int, vector unsigned int); + vector signed int vec_all_eq (vector signed int, vector signed int); + vector signed int vec_all_eq (vector unsigned int, vector signed int); + vector signed int vec_all_eq (vector unsigned int, vector unsigned int); + + vector signed int vec_all_eq (vector float, vector float); + + vector signed int vec_all_ge (vector signed char, vector unsigned char); + + vector signed int vec_all_ge (vector unsigned char, vector signed char); + + vector signed int vec_all_ge (vector unsigned char, + vector unsigned char); + vector signed int vec_all_ge (vector signed char, vector signed char); + vector signed int vec_all_ge (vector signed short, + vector unsigned short); + vector signed int vec_all_ge (vector unsigned short, + vector signed short); + vector signed int vec_all_ge (vector unsigned short, + vector unsigned short); + vector signed int vec_all_ge (vector signed short, vector signed short); + + vector signed int vec_all_ge (vector signed int, vector unsigned int); + vector signed int vec_all_ge (vector unsigned int, vector signed int); + vector signed int vec_all_ge (vector unsigned int, vector unsigned int); + + vector signed int vec_all_ge (vector signed int, vector signed int); + vector signed int vec_all_ge (vector float, vector float); + + vector signed int vec_all_gt (vector signed char, vector unsigned char); + + vector signed int vec_all_gt (vector unsigned char, vector signed char); + + vector signed int vec_all_gt (vector unsigned char, + vector unsigned char); + vector signed int vec_all_gt (vector signed char, vector signed char); + vector signed int vec_all_gt (vector signed short, + vector unsigned short); + vector signed int vec_all_gt (vector unsigned short, + vector signed short); + vector signed int vec_all_gt (vector unsigned short, + vector unsigned short); + vector signed int vec_all_gt (vector signed short, vector signed short); + + vector signed int vec_all_gt (vector signed int, vector unsigned int); + vector signed int vec_all_gt (vector unsigned int, vector signed int); + vector signed int vec_all_gt (vector unsigned int, vector unsigned int); + + vector signed int vec_all_gt (vector signed int, vector signed int); + vector signed int vec_all_gt (vector float, vector float); + + vector signed int vec_all_in (vector float, vector float); + + vector signed int vec_all_le (vector signed char, vector unsigned char); + + vector signed int vec_all_le (vector unsigned char, vector signed char); + + vector signed int vec_all_le (vector unsigned char, + vector unsigned char); + vector signed int vec_all_le (vector signed char, vector signed char); + vector signed int vec_all_le (vector signed short, + vector unsigned short); + vector signed int vec_all_le (vector unsigned short, + vector signed short); + vector signed int vec_all_le (vector unsigned short, + vector unsigned short); + vector signed int vec_all_le (vector signed short, vector signed short); + + vector signed int vec_all_le (vector signed int, vector unsigned int); + vector signed int vec_all_le (vector unsigned int, vector signed int); + vector signed int vec_all_le (vector unsigned int, vector unsigned int); + + vector signed int vec_all_le (vector signed int, vector signed int); + vector signed int vec_all_le (vector float, vector float); + + vector signed int vec_all_lt (vector signed char, vector unsigned char); + + vector signed int vec_all_lt (vector unsigned char, vector signed char); + + vector signed int vec_all_lt (vector unsigned char, + vector unsigned char); + vector signed int vec_all_lt (vector signed char, vector signed char); + vector signed int vec_all_lt (vector signed short, + vector unsigned short); + vector signed int vec_all_lt (vector unsigned short, + vector signed short); + vector signed int vec_all_lt (vector unsigned short, + vector unsigned short); + vector signed int vec_all_lt (vector signed short, vector signed short); + + vector signed int vec_all_lt (vector signed int, vector unsigned int); + vector signed int vec_all_lt (vector unsigned int, vector signed int); + vector signed int vec_all_lt (vector unsigned int, vector unsigned int); + + vector signed int vec_all_lt (vector signed int, vector signed int); + vector signed int vec_all_lt (vector float, vector float); + + vector signed int vec_all_nan (vector float); + + vector signed int vec_all_ne (vector signed char, vector unsigned char); + + vector signed int vec_all_ne (vector signed char, vector signed char); + vector signed int vec_all_ne (vector unsigned char, vector signed char); + + vector signed int vec_all_ne (vector unsigned char, + vector unsigned char); + vector signed int vec_all_ne (vector signed short, + vector unsigned short); + vector signed int vec_all_ne (vector signed short, vector signed short); + + vector signed int vec_all_ne (vector unsigned short, + vector signed short); + vector signed int vec_all_ne (vector unsigned short, + vector unsigned short); + vector signed int vec_all_ne (vector signed int, vector unsigned int); + vector signed int vec_all_ne (vector signed int, vector signed int); + vector signed int vec_all_ne (vector unsigned int, vector signed int); + vector signed int vec_all_ne (vector unsigned int, vector unsigned int); + + vector signed int vec_all_ne (vector float, vector float); + + vector signed int vec_all_nge (vector float, vector float); + + vector signed int vec_all_ngt (vector float, vector float); + + vector signed int vec_all_nle (vector float, vector float); + + vector signed int vec_all_nlt (vector float, vector float); + + vector signed int vec_all_numeric (vector float); + + vector signed int vec_any_eq (vector signed char, vector unsigned char); + + vector signed int vec_any_eq (vector signed char, vector signed char); + vector signed int vec_any_eq (vector unsigned char, vector signed char); + + vector signed int vec_any_eq (vector unsigned char, + vector unsigned char); + vector signed int vec_any_eq (vector signed short, + vector unsigned short); + vector signed int vec_any_eq (vector signed short, vector signed short); + + vector signed int vec_any_eq (vector unsigned short, + vector signed short); + vector signed int vec_any_eq (vector unsigned short, + vector unsigned short); + vector signed int vec_any_eq (vector signed int, vector unsigned int); + vector signed int vec_any_eq (vector signed int, vector signed int); + vector signed int vec_any_eq (vector unsigned int, vector signed int); + vector signed int vec_any_eq (vector unsigned int, vector unsigned int); + + vector signed int vec_any_eq (vector float, vector float); + + vector signed int vec_any_ge (vector signed char, vector unsigned char); + + vector signed int vec_any_ge (vector unsigned char, vector signed char); + + vector signed int vec_any_ge (vector unsigned char, + vector unsigned char); + vector signed int vec_any_ge (vector signed char, vector signed char); + vector signed int vec_any_ge (vector signed short, + vector unsigned short); + vector signed int vec_any_ge (vector unsigned short, + vector signed short); + vector signed int vec_any_ge (vector unsigned short, + vector unsigned short); + vector signed int vec_any_ge (vector signed short, vector signed short); + + vector signed int vec_any_ge (vector signed int, vector unsigned int); + vector signed int vec_any_ge (vector unsigned int, vector signed int); + vector signed int vec_any_ge (vector unsigned int, vector unsigned int); + + vector signed int vec_any_ge (vector signed int, vector signed int); + vector signed int vec_any_ge (vector float, vector float); + + vector signed int vec_any_gt (vector signed char, vector unsigned char); + + vector signed int vec_any_gt (vector unsigned char, vector signed char); + + vector signed int vec_any_gt (vector unsigned char, + vector unsigned char); + vector signed int vec_any_gt (vector signed char, vector signed char); + vector signed int vec_any_gt (vector signed short, + vector unsigned short); + vector signed int vec_any_gt (vector unsigned short, + vector signed short); + vector signed int vec_any_gt (vector unsigned short, + vector unsigned short); + vector signed int vec_any_gt (vector signed short, vector signed short); + + vector signed int vec_any_gt (vector signed int, vector unsigned int); + vector signed int vec_any_gt (vector unsigned int, vector signed int); + vector signed int vec_any_gt (vector unsigned int, vector unsigned int); + + vector signed int vec_any_gt (vector signed int, vector signed int); + vector signed int vec_any_gt (vector float, vector float); + + vector signed int vec_any_le (vector signed char, vector unsigned char); + + vector signed int vec_any_le (vector unsigned char, vector signed char); + + vector signed int vec_any_le (vector unsigned char, + vector unsigned char); + vector signed int vec_any_le (vector signed char, vector signed char); + vector signed int vec_any_le (vector signed short, + vector unsigned short); + vector signed int vec_any_le (vector unsigned short, + vector signed short); + vector signed int vec_any_le (vector unsigned short, + vector unsigned short); + vector signed int vec_any_le (vector signed short, vector signed short); + + vector signed int vec_any_le (vector signed int, vector unsigned int); + vector signed int vec_any_le (vector unsigned int, vector signed int); + vector signed int vec_any_le (vector unsigned int, vector unsigned int); + + vector signed int vec_any_le (vector signed int, vector signed int); + vector signed int vec_any_le (vector float, vector float); + + vector signed int vec_any_lt (vector signed char, vector unsigned char); + + vector signed int vec_any_lt (vector unsigned char, vector signed char); + + vector signed int vec_any_lt (vector unsigned char, + vector unsigned char); + vector signed int vec_any_lt (vector signed char, vector signed char); + vector signed int vec_any_lt (vector signed short, + vector unsigned short); + vector signed int vec_any_lt (vector unsigned short, + vector signed short); + vector signed int vec_any_lt (vector unsigned short, + vector unsigned short); + vector signed int vec_any_lt (vector signed short, vector signed short); + + vector signed int vec_any_lt (vector signed int, vector unsigned int); + vector signed int vec_any_lt (vector unsigned int, vector signed int); + vector signed int vec_any_lt (vector unsigned int, vector unsigned int); + + vector signed int vec_any_lt (vector signed int, vector signed int); + vector signed int vec_any_lt (vector float, vector float); + + vector signed int vec_any_nan (vector float); + + vector signed int vec_any_ne (vector signed char, vector unsigned char); + + vector signed int vec_any_ne (vector signed char, vector signed char); + vector signed int vec_any_ne (vector unsigned char, vector signed char); + + vector signed int vec_any_ne (vector unsigned char, + vector unsigned char); + vector signed int vec_any_ne (vector signed short, + vector unsigned short); + vector signed int vec_any_ne (vector signed short, vector signed short); + + vector signed int vec_any_ne (vector unsigned short, + vector signed short); + vector signed int vec_any_ne (vector unsigned short, + vector unsigned short); + vector signed int vec_any_ne (vector signed int, vector unsigned int); + vector signed int vec_any_ne (vector signed int, vector signed int); + vector signed int vec_any_ne (vector unsigned int, vector signed int); + vector signed int vec_any_ne (vector unsigned int, vector unsigned int); + + vector signed int vec_any_ne (vector float, vector float); + + vector signed int vec_any_nge (vector float, vector float); + + vector signed int vec_any_ngt (vector float, vector float); + + vector signed int vec_any_nle (vector float, vector float); + + vector signed int vec_any_nlt (vector float, vector float); + + vector signed int vec_any_numeric (vector float); + + vector signed int vec_any_out (vector float, vector float); + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-17 gcc-3.2.3/gcc/doc/gcc.info-17 *** gcc-3.2.2/gcc/doc/gcc.info-17 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-17 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1210 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Pragmas, Next: Unnamed Fields, Prev: Target Builtins, Up: C Extensions + + Pragmas Accepted by GCC + ======================= + + GCC supports several types of pragmas, primarily in order to compile + code originally written for other compilers. Note that in general we + do not recommend the use of pragmas; *Note Function Attributes::, for + further explanation. + + * Menu: + + * ARM Pragmas:: + * Darwin Pragmas:: + * Solaris Pragmas:: + * Tru64 Pragmas:: + +  + File: gcc.info, Node: ARM Pragmas, Next: Darwin Pragmas, Up: Pragmas + + ARM Pragmas + ----------- + + The ARM target defines pragmas for controlling the default addition + of `long_call' and `short_call' attributes to functions. *Note + Function Attributes::, for information about the effects of these + attributes. + + `long_calls' + Set all subsequent functions to have the `long_call' attribute. + + `no_long_calls' + Set all subsequent functions to have the `short_call' attribute. + + `long_calls_off' + Do not affect the `long_call' or `short_call' attributes of + subsequent functions. + +  + File: gcc.info, Node: Darwin Pragmas, Next: Solaris Pragmas, Prev: ARM Pragmas, Up: Pragmas + + Darwin Pragmas + -------------- + + The following pragmas are available for all architectures running the + Darwin operating system. These are useful for compatibility with other + MacOS compilers. + + `mark TOKENS...' + This pragma is accepted, but has no effect. + + `options align=ALIGNMENT' + This pragma sets the alignment of fields in structures. The + values of ALIGNMENT may be `mac68k', to emulate m68k alignment, or + `power', to emulate PowerPC alignment. Uses of this pragma nest + properly; to restore the previous setting, use `reset' for the + ALIGNMENT. + + `segment TOKENS...' + This pragma is accepted, but has no effect. + + `unused (VAR [, VAR]...)' + This pragma declares variables to be possibly unused. GCC will not + produce warnings for the listed variables. The effect is similar + to that of the `unused' attribute, except that this pragma may + appear anywhere within the variables' scopes. + +  + File: gcc.info, Node: Solaris Pragmas, Next: Tru64 Pragmas, Prev: Darwin Pragmas, Up: Pragmas + + Solaris Pragmas + --------------- + + For compatibility with the SunPRO compiler, the following pragma is + supported. + + `redefine_extname OLDNAME NEWNAME' + This pragma gives the C function OLDNAME the assembler label + NEWNAME. The pragma must appear before the function declaration. + This pragma is equivalent to the asm labels extension (*note Asm + Labels::). The preprocessor defines `__PRAGMA_REDEFINE_EXTNAME' + if the pragma is available. + +  + File: gcc.info, Node: Tru64 Pragmas, Prev: Solaris Pragmas, Up: Pragmas + + Tru64 Pragmas + ------------- + + For compatibility with the Compaq C compiler, the following pragma + is supported. + + `extern_prefix STRING' + This pragma renames all subsequent function and variable + declarations such that STRING is prepended to the name. This + effect may be terminated by using another `extern_prefix' pragma + with the empty string. + + This pragma is similar in intent to to the asm labels extension + (*note Asm Labels::) in that the system programmer wants to change + the assembly-level ABI without changing the source-level API. The + preprocessor defines `__PRAGMA_EXTERN_PREFIX' if the pragma is + available. + +  + File: gcc.info, Node: Unnamed Fields, Prev: Pragmas, Up: C Extensions + + Unnamed struct/union fields within structs/unions. + ================================================== + + For compatibility with other compilers, GCC allows you to define a + structure or union that contains, as fields, structures and unions + without names. For example: + + struct { + int a; + union { + int b; + float c; + }; + int d; + } foo; + + In this example, the user would be able to access members of the + unnamed union with code like `foo.b'. Note that only unnamed structs + and unions are allowed, you may not have, for example, an unnamed `int'. + + You must never create such structures that cause ambiguous field + definitions. For example, this structure: + + struct { + int a; + struct { + int a; + }; + } foo; + + It is ambiguous which `a' is being referred to with `foo.a'. Such + constructs are not supported and must be avoided. In the future, such + constructs may be detected and treated as compilation errors. + +  + File: gcc.info, Node: C++ Extensions, Next: Objective-C, Prev: C Extensions, Up: Top + + Extensions to the C++ Language + ****************************** + + The GNU compiler provides these extensions to the C++ language (and + you can also use most of the C language extensions in your C++ + programs). If you want to write code that checks whether these + features are available, you can test for the GNU compiler the same way + as for C programs: check for a predefined macro `__GNUC__'. You can + also use `__GNUG__' to test specifically for GNU C++ (*note Standard + Predefined Macros: (cpp.info)Standard Predefined.). + + * Menu: + + * Min and Max:: C++ Minimum and maximum operators. + * Volatiles:: What constitutes an access to a volatile object. + * Restricted Pointers:: C99 restricted pointers and references. + * Vague Linkage:: Where G++ puts inlines, vtables and such. + * C++ Interface:: You can use a single C++ header file for both + declarations and definitions. + * Template Instantiation:: Methods for ensuring that exactly one copy of + each needed template instantiation is emitted. + * Bound member functions:: You can extract a function pointer to the + method denoted by a `->*' or `.*' expression. + * C++ Attributes:: Variable, function, and type attributes for C++ only. + * Java Exceptions:: Tweaking exception handling to work with Java. + * Deprecated Features:: Things might disappear from g++. + * Backwards Compatibility:: Compatibilities with earlier definitions of C++. + +  + File: gcc.info, Node: Min and Max, Next: Volatiles, Up: C++ Extensions + + Minimum and Maximum Operators in C++ + ==================================== + + It is very convenient to have operators which return the "minimum" + or the "maximum" of two arguments. In GNU C++ (but not in GNU C), + + `A ? B' + is the "maximum", returning the larger of the numeric values A and + B. + + These operations are not primitive in ordinary C++, since you can + use a macro to return the minimum of two things in C++, as in the + following example. + + #define MIN(X,Y) ((X) < (Y) ? : (X) : (Y)) + + You might then use `int min = MIN (i, j);' to set MIN to the minimum + value of variables I and J. + + However, side effects in `X' or `Y' may cause unintended behavior. + For example, `MIN (i++, j++)' will fail, incrementing the smaller + counter twice. The GNU C `typeof' extension allows you to write safe + macros that avoid this kind of problem (*note Typeof::). However, + writing `MIN' and `MAX' as macros also forces you to use function-call + notation for a fundamental arithmetic operation. Using GNU C++ + extensions, you can write `int min = i ?' are built into the compiler, they properly + handle expressions with side-effects; `int min = i++ (*ptr1)'. + + When using a reference to volatile, G++ does not treat equivalent + expressions as accesses to volatiles, but instead issues a warning that + no volatile is accessed. The rationale for this is that otherwise it + becomes difficult to determine where volatile access occur, and not + possible to ignore the return value from functions returning volatile + references. Again, if you wish to force a read, cast the reference to + an rvalue. + +  + File: gcc.info, Node: Restricted Pointers, Next: Vague Linkage, Prev: Volatiles, Up: C++ Extensions + + Restricting Pointer Aliasing + ============================ + + As with gcc, g++ understands the C99 feature of restricted pointers, + specified with the `__restrict__', or `__restrict' type qualifier. + Because you cannot compile C++ by specifying the `-std=c99' language + flag, `restrict' is not a keyword in C++. + + In addition to allowing restricted pointers, you can specify + restricted references, which indicate that the reference is not aliased + in the local context. + + void fn (int *__restrict__ rptr, int &__restrict__ rref) + { + ... + } + + In the body of `fn', RPTR points to an unaliased integer and RREF + refers to a (different) unaliased integer. + + You may also specify whether a member function's THIS pointer is + unaliased by using `__restrict__' as a member function qualifier. + + void T::fn () __restrict__ + { + ... + } + + Within the body of `T::fn', THIS will have the effective definition `T + *__restrict__ const this'. Notice that the interpretation of a + `__restrict__' member function qualifier is different to that of + `const' or `volatile' qualifier, in that it is applied to the pointer + rather than the object. This is consistent with other compilers which + implement restricted pointers. + + As with all outermost parameter qualifiers, `__restrict__' is + ignored in function definition matching. This means you only need to + specify `__restrict__' in a function definition, rather than in a + function prototype as well. + +  + File: gcc.info, Node: Vague Linkage, Next: C++ Interface, Prev: Restricted Pointers, Up: C++ Extensions + + Vague Linkage + ============= + + There are several constructs in C++ which require space in the object + file but are not clearly tied to a single translation unit. We say that + these constructs have "vague linkage". Typically such constructs are + emitted wherever they are needed, though sometimes we can be more + clever. + + Inline Functions + Inline functions are typically defined in a header file which can + be included in many different compilations. Hopefully they can + usually be inlined, but sometimes an out-of-line copy is + necessary, if the address of the function is taken or if inlining + fails. In general, we emit an out-of-line copy in all translation + units where one is needed. As an exception, we only emit inline + virtual functions with the vtable, since it will always require a + copy. + + Local static variables and string constants used in an inline + function are also considered to have vague linkage, since they + must be shared between all inlined and out-of-line instances of + the function. + + VTables + C++ virtual functions are implemented in most compilers using a + lookup table, known as a vtable. The vtable contains pointers to + the virtual functions provided by a class, and each object of the + class contains a pointer to its vtable (or vtables, in some + multiple-inheritance situations). If the class declares any + non-inline, non-pure virtual functions, the first one is chosen as + the "key method" for the class, and the vtable is only emitted in + the translation unit where the key method is defined. + + _Note:_ If the chosen key method is later defined as inline, the + vtable will still be emitted in every translation unit which + defines it. Make sure that any inline virtuals are declared + inline in the class body, even if they are not defined there. + + type_info objects + C++ requires information about types to be written out in order to + implement `dynamic_cast', `typeid' and exception handling. For + polymorphic classes (classes with virtual functions), the type_info + object is written out along with the vtable so that `dynamic_cast' + can determine the dynamic type of a class object at runtime. For + all other types, we write out the type_info object when it is + used: when applying `typeid' to an expression, throwing an object, + or referring to a type in a catch clause or exception + specification. + + Template Instantiations + Most everything in this section also applies to template + instantiations, but there are other options as well. *Note + Where's the Template?: Template Instantiation. + + + When used with GNU ld version 2.8 or later on an ELF system such as + Linux/GNU or Solaris 2, or on Microsoft Windows, duplicate copies of + these constructs will be discarded at link time. This is known as + COMDAT support. + + On targets that don't support COMDAT, but do support weak symbols, + GCC will use them. This way one copy will override all the others, but + the unused copies will still take up space in the executable. + + For targets which do not support either COMDAT or weak symbols, most + entities with vague linkage will be emitted as local symbols to avoid + duplicate definition errors from the linker. This will not happen for + local statics in inlines, however, as having multiple copies will + almost certainly break things. + + *Note Declarations and Definitions in One Header: C++ Interface, for + another way to control placement of these constructs. + +  + File: gcc.info, Node: C++ Interface, Next: Template Instantiation, Prev: Vague Linkage, Up: C++ Extensions + + Declarations and Definitions in One Header + ========================================== + + C++ object definitions can be quite complex. In principle, your + source code will need two kinds of things for each object that you use + across more than one source file. First, you need an "interface" + specification, describing its structure with type declarations and + function prototypes. Second, you need the "implementation" itself. It + can be tedious to maintain a separate interface description in a header + file, in parallel to the actual implementation. It is also dangerous, + since separate interface and implementation definitions may not remain + parallel. + + With GNU C++, you can use a single header file for both purposes. + + _Warning:_ The mechanism to specify this is in transition. For the + nonce, you must use one of two `#pragma' commands; in a future + release of GNU C++, an alternative mechanism will make these + `#pragma' commands unnecessary. + + The header file contains the full definitions, but is marked with + `#pragma interface' in the source code. This allows the compiler to + use the header file only as an interface specification when ordinary + source files incorporate it with `#include'. In the single source file + where the full implementation belongs, you can use either a naming + convention or `#pragma implementation' to indicate this alternate use + of the header file. + + `#pragma interface' + `#pragma interface "SUBDIR/OBJECTS.h"' + Use this directive in _header files_ that define object classes, + to save space in most of the object files that use those classes. + Normally, local copies of certain information (backup copies of + inline member functions, debugging information, and the internal + tables that implement virtual functions) must be kept in each + object file that includes class definitions. You can use this + pragma to avoid such duplication. When a header file containing + `#pragma interface' is included in a compilation, this auxiliary + information will not be generated (unless the main input source + file itself uses `#pragma implementation'). Instead, the object + files will contain references to be resolved at link time. + + The second form of this directive is useful for the case where you + have multiple headers with the same name in different directories. + If you use this form, you must specify the same string to `#pragma + implementation'. + + `#pragma implementation' + `#pragma implementation "OBJECTS.h"' + Use this pragma in a _main input file_, when you want full output + from included header files to be generated (and made globally + visible). The included header file, in turn, should use `#pragma + interface'. Backup copies of inline member functions, debugging + information, and the internal tables used to implement virtual + functions are all generated in implementation files. + + If you use `#pragma implementation' with no argument, it applies to + an include file with the same basename(1) as your source file. + For example, in `allclass.cc', giving just `#pragma implementation' + by itself is equivalent to `#pragma implementation "allclass.h"'. + + In versions of GNU C++ prior to 2.6.0 `allclass.h' was treated as + an implementation file whenever you would include it from + `allclass.cc' even if you never specified `#pragma + implementation'. This was deemed to be more trouble than it was + worth, however, and disabled. + + If you use an explicit `#pragma implementation', it must appear in + your source file _before_ you include the affected header files. + + Use the string argument if you want a single implementation file to + include code from multiple header files. (You must also use + `#include' to include the header file; `#pragma implementation' + only specifies how to use the file--it doesn't actually include + it.) + + There is no way to split up the contents of a single header file + into multiple implementation files. + + `#pragma implementation' and `#pragma interface' also have an effect + on function inlining. + + If you define a class in a header file marked with `#pragma + interface', the effect on a function defined in that class is similar to + an explicit `extern' declaration--the compiler emits no code at all to + define an independent version of the function. Its definition is used + only for inlining with its callers. + + Conversely, when you include the same header file in a main source + file that declares it as `#pragma implementation', the compiler emits + code for the function itself; this defines a version of the function + that can be found via pointers (or by callers compiled without + inlining). If all calls to the function can be inlined, you can avoid + emitting the function by compiling with `-fno-implement-inlines'. If + any calls were not inlined, you will get linker errors. + + ---------- Footnotes ---------- + + (1) A file's "basename" was the name stripped of all leading path + information and of trailing suffixes, such as `.h' or `.C' or `.cc'. + +  + File: gcc.info, Node: Template Instantiation, Next: Bound member functions, Prev: C++ Interface, Up: C++ Extensions + + Where's the Template? + ===================== + + C++ templates are the first language feature to require more + intelligence from the environment than one usually finds on a UNIX + system. Somehow the compiler and linker have to make sure that each + template instance occurs exactly once in the executable if it is needed, + and not at all otherwise. There are two basic approaches to this + problem, which I will refer to as the Borland model and the Cfront + model. + + Borland model + Borland C++ solved the template instantiation problem by adding + the code equivalent of common blocks to their linker; the compiler + emits template instances in each translation unit that uses them, + and the linker collapses them together. The advantage of this + model is that the linker only has to consider the object files + themselves; there is no external complexity to worry about. This + disadvantage is that compilation time is increased because the + template code is being compiled repeatedly. Code written for this + model tends to include definitions of all templates in the header + file, since they must be seen to be instantiated. + + Cfront model + The AT&T C++ translator, Cfront, solved the template instantiation + problem by creating the notion of a template repository, an + automatically maintained place where template instances are + stored. A more modern version of the repository works as follows: + As individual object files are built, the compiler places any + template definitions and instantiations encountered in the + repository. At link time, the link wrapper adds in the objects in + the repository and compiles any needed instances that were not + previously emitted. The advantages of this model are more optimal + compilation speed and the ability to use the system linker; to + implement the Borland model a compiler vendor also needs to + replace the linker. The disadvantages are vastly increased + complexity, and thus potential for error; for some code this can be + just as transparent, but in practice it can been very difficult to + build multiple programs in one directory and one program in + multiple directories. Code written for this model tends to + separate definitions of non-inline member templates into a + separate file, which should be compiled separately. + + When used with GNU ld version 2.8 or later on an ELF system such as + Linux/GNU or Solaris 2, or on Microsoft Windows, g++ supports the + Borland model. On other systems, g++ implements neither automatic + model. + + A future version of g++ will support a hybrid model whereby the + compiler will emit any instantiations for which the template definition + is included in the compile, and store template definitions and + instantiation context information into the object file for the rest. + The link wrapper will extract that information as necessary and invoke + the compiler to produce the remaining instantiations. The linker will + then combine duplicate instantiations. + + In the mean time, you have the following options for dealing with + template instantiations: + + 1. Compile your template-using code with `-frepo'. The compiler will + generate files with the extension `.rpo' listing all of the + template instantiations used in the corresponding object files + which could be instantiated there; the link wrapper, `collect2', + will then update the `.rpo' files to tell the compiler where to + place those instantiations and rebuild any affected object files. + The link-time overhead is negligible after the first pass, as the + compiler will continue to place the instantiations in the same + files. + + This is your best option for application code written for the + Borland model, as it will just work. Code written for the Cfront + model will need to be modified so that the template definitions + are available at one or more points of instantiation; usually this + is as simple as adding `#include ' to the end of each + template header. + + For library code, if you want the library to provide all of the + template instantiations it needs, just try to link all of its + object files together; the link will fail, but cause the + instantiations to be generated as a side effect. Be warned, + however, that this may cause conflicts if multiple libraries try + to provide the same instantiations. For greater control, use + explicit instantiation as described in the next option. + + 2. Compile your code with `-fno-implicit-templates' to disable the + implicit generation of template instances, and explicitly + instantiate all the ones you use. This approach requires more + knowledge of exactly which instances you need than do the others, + but it's less mysterious and allows greater control. You can + scatter the explicit instantiations throughout your program, + perhaps putting them in the translation units where the instances + are used or the translation units that define the templates + themselves; you can put all of the explicit instantiations you + need into one big file; or you can create small files like + + #include "Foo.h" + #include "Foo.cc" + + template class Foo; + template ostream& operator << + (ostream&, const Foo&); + + for each of the instances you need, and create a template + instantiation library from those. + + If you are using Cfront-model code, you can probably get away with + not using `-fno-implicit-templates' when compiling files that don't + `#include' the member template definitions. + + If you use one big file to do the instantiations, you may want to + compile it without `-fno-implicit-templates' so you get all of the + instances required by your explicit instantiations (but not by any + other files) without having to specify them as well. + + g++ has extended the template instantiation syntax outlined in the + Working Paper to allow forward declaration of explicit + instantiations (with `extern'), instantiation of the compiler + support data for a template class (i.e. the vtable) without + instantiating any of its members (with `inline'), and + instantiation of only the static data members of a template class, + without the support data or member functions (with (`static'): + + extern template int max (int, int); + inline template class Foo; + static template class Foo; + + 3. Do nothing. Pretend g++ does implement automatic instantiation + management. Code written for the Borland model will work fine, but + each translation unit will contain instances of each of the + templates it uses. In a large program, this can lead to an + unacceptable amount of code duplication. + + 4. Add `#pragma interface' to all files containing template + definitions. For each of these files, add `#pragma implementation + "FILENAME"' to the top of some `.C' file which `#include's it. + Then compile everything with `-fexternal-templates'. The + templates will then only be expanded in the translation unit which + implements them (i.e. has a `#pragma implementation' line for the + file where they live); all other files will use external + references. If you're lucky, everything should work properly. If + you get undefined symbol errors, you need to make sure that each + template instance which is used in the program is used in the file + which implements that template. If you don't have any use for a + particular instance in that file, you can just instantiate it + explicitly, using the syntax from the latest C++ working paper: + + template class A; + template ostream& operator << (ostream&, const A&); + + This strategy will work with code written for either model. If + you are using code written for the Cfront model, the file + containing a class template and the file containing its member + templates should be implemented in the same translation unit. + + 5. A slight variation on this approach is to use the flag + `-falt-external-templates' instead. This flag causes template + instances to be emitted in the translation unit that implements the + header where they are first instantiated, rather than the one which + implements the file where the templates are defined. This header + must be the same in all translation units, or things are likely to + break. + + *Note Declarations and Definitions in One Header: C++ Interface, + for more discussion of these pragmas. + +  + File: gcc.info, Node: Bound member functions, Next: C++ Attributes, Prev: Template Instantiation, Up: C++ Extensions + + Extracting the function pointer from a bound pointer to member function + ======================================================================= + + In C++, pointer to member functions (PMFs) are implemented using a + wide pointer of sorts to handle all the possible call mechanisms; the + PMF needs to store information about how to adjust the `this' pointer, + and if the function pointed to is virtual, where to find the vtable, and + where in the vtable to look for the member function. If you are using + PMFs in an inner loop, you should really reconsider that decision. If + that is not an option, you can extract the pointer to the function that + would be called for a given object/PMF pair and call it directly inside + the inner loop, to save a bit of time. + + Note that you will still be paying the penalty for the call through a + function pointer; on most modern architectures, such a call defeats the + branch prediction features of the CPU. This is also true of normal + virtual function calls. + + The syntax for this extension is + + extern A a; + extern int (A::*fp)(); + typedef int (*fptr)(A *); + + fptr p = (fptr)(a.*fp); + + For PMF constants (i.e. expressions of the form `&Klasse::Member'), + no object is needed to obtain the address of the function. They can be + converted to function pointers directly: + + fptr p1 = (fptr)(&A::foo); + + You must specify `-Wno-pmf-conversions' to use this extension. + +  + File: gcc.info, Node: C++ Attributes, Next: Java Exceptions, Prev: Bound member functions, Up: C++ Extensions + + C++-Specific Variable, Function, and Type Attributes + ==================================================== + + Some attributes only make sense for C++ programs. + + `init_priority (PRIORITY)' + In Standard C++, objects defined at namespace scope are guaranteed + to be initialized in an order in strict accordance with that of + their definitions _in a given translation unit_. No guarantee is + made for initializations across translation units. However, GNU + C++ allows users to control the order of initialization of objects + defined at namespace scope with the `init_priority' attribute by + specifying a relative PRIORITY, a constant integral expression + currently bounded between 101 and 65535 inclusive. Lower numbers + indicate a higher priority. + + In the following example, `A' would normally be created before + `B', but the `init_priority' attribute has reversed that order: + + Some_Class A __attribute__ ((init_priority (2000))); + Some_Class B __attribute__ ((init_priority (543))); + + Note that the particular values of PRIORITY do not matter; only + their relative ordering. + + `java_interface' + This type attribute informs C++ that the class is a Java + interface. It may only be applied to classes declared within an + `extern "Java"' block. Calls to methods declared in this + interface will be dispatched using GCJ's interface table + mechanism, instead of regular virtual table dispatch. + + +  + File: gcc.info, Node: Java Exceptions, Next: Deprecated Features, Prev: C++ Attributes, Up: C++ Extensions + + Java Exceptions + =============== + + The Java language uses a slightly different exception handling model + from C++. Normally, GNU C++ will automatically detect when you are + writing C++ code that uses Java exceptions, and handle them + appropriately. However, if C++ code only needs to execute destructors + when Java exceptions are thrown through it, GCC will guess incorrectly. + Sample problematic code is: + + struct S { ~S(); }; + extern void bar(); // is written in Java, and may throw exceptions + void foo() + { + S s; + bar(); + } + + The usual effect of an incorrect guess is a link failure, complaining of + a missing routine called `__gxx_personality_v0'. + + You can inform the compiler that Java exceptions are to be used in a + translation unit, irrespective of what it might think, by writing + `#pragma GCC java_exceptions' at the head of the file. This `#pragma' + must appear before any functions that throw or catch exceptions, or run + destructors when exceptions are thrown through them. + + You cannot mix Java and C++ exceptions in the same translation unit. + It is believed to be safe to throw a C++ exception from one file + through another file compiled for the Java exception model, or vice + versa, but there may be bugs in this area. + +  + File: gcc.info, Node: Deprecated Features, Next: Backwards Compatibility, Prev: Java Exceptions, Up: C++ Extensions + + Deprecated Features + =================== + + In the past, the GNU C++ compiler was extended to experiment with new + features, at a time when the C++ language was still evolving. Now that + the C++ standard is complete, some of those features are superseded by + superior alternatives. Using the old features might cause a warning in + some cases that the feature will be dropped in the future. In other + cases, the feature might be gone already. + + While the list below is not exhaustive, it documents some of the + options that are now deprecated: + + `-fexternal-templates' + `-falt-external-templates' + These are two of the many ways for g++ to implement template + instantiation. *Note Template Instantiation::. The C++ standard + clearly defines how template definitions have to be organized + across implementation units. g++ has an implicit instantiation + mechanism that should work just fine for standard-conforming code. + + `-fstrict-prototype' + `-fno-strict-prototype' + Previously it was possible to use an empty prototype parameter + list to indicate an unspecified number of parameters (like C), + rather than no parameters, as C++ demands. This feature has been + removed, except where it is required for backwards compatibility + *Note Backwards Compatibility::. + + The named return value extension has been deprecated, and is now + removed from g++. + + The use of initializer lists with new expressions has been + deprecated, and is now removed from g++. + + Floating and complex non-type template parameters have been + deprecated, and are now removed from g++. + + The implicit typename extension has been deprecated and will be + removed from g++ at some point. In some cases g++ determines that a + dependant type such as `TPL::X' is a type without needing a + `typename' keyword, contrary to the standard. + +  + File: gcc.info, Node: Backwards Compatibility, Prev: Deprecated Features, Up: C++ Extensions + + Backwards Compatibility + ======================= + + Now that there is a definitive ISO standard C++, G++ has a + specification to adhere to. The C++ language evolved over time, and + features that used to be acceptable in previous drafts of the standard, + such as the ARM [Annotated C++ Reference Manual], are no longer + accepted. In order to allow compilation of C++ written to such drafts, + G++ contains some backwards compatibilities. _All such backwards + compatibility features are liable to disappear in future versions of + G++._ They should be considered deprecated *Note Deprecated Features::. + + `For scope' + If a variable is declared at for scope, it used to remain in scope + until the end of the scope which contained the for statement + (rather than just within the for scope). G++ retains this, but + issues a warning, if such a variable is accessed outside the for + scope. + + `Implicit C language' + Old C system header files did not contain an `extern "C" {...}' + scope to set the language. On such systems, all header files are + implicitly scoped inside a C language scope. Also, an empty + prototype `()' will be treated as an unspecified number of + arguments, rather than no arguments, as C++ demands. + +  + File: gcc.info, Node: Objective-C, Next: Compatibility, Prev: C++ Extensions, Up: Top + + GNU Objective-C runtime features + ******************************** + + This document is meant to describe some of the GNU Objective-C + runtime features. It is not intended to teach you Objective-C, there + are several resources on the Internet that present the language. + Questions and comments about this document to Ovidiu Predescu + . + + * Menu: + + * Executing code before main:: + * Type encoding:: + * Garbage Collection:: + * Constant string objects:: + * compatibility_alias:: + +  + File: gcc.info, Node: Executing code before main, Next: Type encoding, Prev: Objective-C, Up: Objective-C + + `+load': Executing code before main + =================================== + + The GNU Objective-C runtime provides a way that allows you to execute + code before the execution of the program enters the `main' function. + The code is executed on a per-class and a per-category basis, through a + special class method `+load'. + + This facility is very useful if you want to initialize global + variables which can be accessed by the program directly, without + sending a message to the class first. The usual way to initialize + global variables, in the `+initialize' method, might not be useful + because `+initialize' is only called when the first message is sent to a + class object, which in some cases could be too late. + + Suppose for example you have a `FileStream' class that declares + `Stdin', `Stdout' and `Stderr' as global variables, like below: + + + FileStream *Stdin = nil; + FileStream *Stdout = nil; + FileStream *Stderr = nil; + + @implementation FileStream + + + (void)initialize + { + Stdin = [[FileStream new] initWithFd:0]; + Stdout = [[FileStream new] initWithFd:1]; + Stderr = [[FileStream new] initWithFd:2]; + } + + /* Other methods here */ + @end + + In this example, the initialization of `Stdin', `Stdout' and + `Stderr' in `+initialize' occurs too late. The programmer can send a + message to one of these objects before the variables are actually + initialized, thus sending messages to the `nil' object. The + `+initialize' method which actually initializes the global variables is + not invoked until the first message is sent to the class object. The + solution would require these variables to be initialized just before + entering `main'. + + The correct solution of the above problem is to use the `+load' + method instead of `+initialize': + + + @implementation FileStream + + + (void)load + { + Stdin = [[FileStream new] initWithFd:0]; + Stdout = [[FileStream new] initWithFd:1]; + Stderr = [[FileStream new] initWithFd:2]; + } + + /* Other methods here */ + @end + + The `+load' is a method that is not overridden by categories. If a + class and a category of it both implement `+load', both methods are + invoked. This allows some additional initializations to be performed in + a category. + + This mechanism is not intended to be a replacement for `+initialize'. + You should be aware of its limitations when you decide to use it + instead of `+initialize'. + + * Menu: + + * What you can and what you cannot do in +load:: + +  + File: gcc.info, Node: What you can and what you cannot do in +load, Prev: Executing code before main, Up: Executing code before main + + What you can and what you cannot do in `+load' + ---------------------------------------------- + + The `+load' implementation in the GNU runtime guarantees you the + following things: + + * you can write whatever C code you like; + + * you can send messages to Objective-C constant strings (`@"this is a + constant string"'); + + * you can allocate and send messages to objects whose class is + implemented in the same file; + + * the `+load' implementation of all super classes of a class are + executed before the `+load' of that class is executed; + + * the `+load' implementation of a class is executed before the + `+load' implementation of any category. + + + In particular, the following things, even if they can work in a + particular case, are not guaranteed: + + * allocation of or sending messages to arbitrary objects; + + * allocation of or sending messages to objects whose classes have a + category implemented in the same file; + + + You should make no assumptions about receiving `+load' in sibling + classes when you write `+load' of a class. The order in which sibling + classes receive `+load' is not guaranteed. + + The order in which `+load' and `+initialize' are called could be + problematic if this matters. If you don't allocate objects inside + `+load', it is guaranteed that `+load' is called before `+initialize'. + If you create an object inside `+load' the `+initialize' method of + object's class is invoked even if `+load' was not invoked. Note if you + explicitly call `+load' on a class, `+initialize' will be called first. + To avoid possible problems try to implement only one of these methods. + + The `+load' method is also invoked when a bundle is dynamically + loaded into your running program. This happens automatically without + any intervening operation from you. When you write bundles and you + need to write `+load' you can safely create and send messages to + objects whose classes already exist in the running program. The same + restrictions as above apply to classes defined in bundle. + +  + File: gcc.info, Node: Type encoding, Next: Garbage Collection, Prev: Executing code before main, Up: Objective-C + + Type encoding + ============= + + The Objective-C compiler generates type encodings for all the types. + These type encodings are used at runtime to find out information about + selectors and methods and about objects and classes. + + The types are encoded in the following way: + + `char' `c' + `unsigned char' `C' + `short' `s' + `unsigned short' `S' + `int' `i' + `unsigned int' `I' + `long' `l' + `unsigned long' `L' + `long long' `q' + `unsigned long `Q' + long' + `float' `f' + `double' `d' + `void' `v' + `id' `@' + `Class' `#' + `SEL' `:' + `char*' `*' + unknown type `?' + bit-fields `b' followed by the starting position of the + bit-field, the type of the bit-field and the size of + the bit-field (the bit-fields encoding was changed + from the NeXT's compiler encoding, see below) + + The encoding of bit-fields has changed to allow bit-fields to be + properly handled by the runtime functions that compute sizes and + alignments of types that contain bit-fields. The previous encoding + contained only the size of the bit-field. Using only this information + it is not possible to reliably compute the size occupied by the + bit-field. This is very important in the presence of the Boehm's + garbage collector because the objects are allocated using the typed + memory facility available in this collector. The typed memory + allocation requires information about where the pointers are located + inside the object. + + The position in the bit-field is the position, counting in bits, of + the bit closest to the beginning of the structure. + + The non-atomic types are encoded as follows: + + pointers `^' followed by the pointed type. + arrays `[' followed by the number of elements in the array + followed by the type of the elements followed by `]' + structures `{' followed by the name of the structure (or `?' if the + structure is unnamed), the `=' sign, the type of the + members and by `}' + unions `(' followed by the name of the structure (or `?' if the + union is unnamed), the `=' sign, the type of the members + followed by `)' + + Here are some types and their encodings, as they are generated by the + compiler on an i386 machine: + + + Objective-C type Compiler encoding + int a[10]; `[10i]' + struct { `{?=i[3f]b128i3b131i2c}' + int i; + float f[3]; + int a:3; + int b:2; + char c; + } + + + In addition to the types the compiler also encodes the type + specifiers. The table below describes the encoding of the current + Objective-C type specifiers: + + + Specifier Encoding + `const' `r' + `in' `n' + `inout' `N' + `out' `o' + `bycopy' `O' + `oneway' `V' + + + The type specifiers are encoded just before the type. Unlike types + however, the type specifiers are only encoded when they appear in method + argument types. + +  + File: gcc.info, Node: Garbage Collection, Next: Constant string objects, Prev: Type encoding, Up: Objective-C + + Garbage Collection + ================== + + Support for a new memory management policy has been added by using a + powerful conservative garbage collector, known as the + Boehm-Demers-Weiser conservative garbage collector. It is available + from `http://www.hpl.hp.com/personal/Hans_Boehm/gc/'. + + To enable the support for it you have to configure the compiler + using an additional argument, `--enable-objc-gc'. You need to have + garbage collector installed before building the compiler. This will + build an additional runtime library which has several enhancements to + support the garbage collector. The new library has a new name, + `libobjc_gc.a' to not conflict with the non-garbage-collected library. + + When the garbage collector is used, the objects are allocated using + the so-called typed memory allocation mechanism available in the + Boehm-Demers-Weiser collector. This mode requires precise information + on where pointers are located inside objects. This information is + computed once per class, immediately after the class has been + initialized. + + There is a new runtime function `class_ivar_set_gcinvisible()' which + can be used to declare a so-called "weak pointer" reference. Such a + pointer is basically hidden for the garbage collector; this can be + useful in certain situations, especially when you want to keep track of + the allocated objects, yet allow them to be collected. This kind of + pointers can only be members of objects, you cannot declare a global + pointer as a weak reference. Every type which is a pointer type can be + declared a weak pointer, including `id', `Class' and `SEL'. + + Here is an example of how to use this feature. Suppose you want to + implement a class whose instances hold a weak pointer reference; the + following class does this: + + + @interface WeakPointer : Object + { + const void* weakPointer; + } + + - initWithPointer:(const void*)p; + - (const void*)weakPointer; + @end + + + @implementation WeakPointer + + + (void)initialize + { + class_ivar_set_gcinvisible (self, "weakPointer", YES); + } + + - initWithPointer:(const void*)p + { + weakPointer = p; + return self; + } + + - (const void*)weakPointer + { + return weakPointer; + } + + @end + + Weak pointers are supported through a new type character specifier + represented by the `!' character. The `class_ivar_set_gcinvisible()' + function adds or removes this specifier to the string type description + of the instance variable named as argument. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-18 gcc-3.2.3/gcc/doc/gcc.info-18 *** gcc-3.2.2/gcc/doc/gcc.info-18 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-18 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,985 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Constant string objects, Next: compatibility_alias, Prev: Garbage Collection, Up: Objective-C + + Constant string objects + ======================= + + GNU Objective-C provides constant string objects that are generated + directly by the compiler. You declare a constant string object by + prefixing a C constant string with the character `@': + + id myString = @"this is a constant string object"; + + The constant string objects are usually instances of the + `NXConstantString' class which is provided by the GNU Objective-C + runtime. To get the definition of this class you must include the + `objc/NXConstStr.h' header file. + + User defined libraries may want to implement their own constant + string class. To be able to support them, the GNU Objective-C compiler + provides a new command line options + `-fconstant-string-class=CLASS-NAME'. The provided class should adhere + to a strict structure, the same as `NXConstantString''s structure: + + + @interface NXConstantString : Object + { + char *c_string; + unsigned int len; + } + @end + + User class libraries may choose to inherit the customized constant + string class from a different class than `Object'. There is no + requirement in the methods the constant string class has to implement. + + When a file is compiled with the `-fconstant-string-class' option, + all the constant string objects will be instances of the class specified + as argument to this option. It is possible to have multiple compilation + units referring to different constant string classes, neither the + compiler nor the linker impose any restrictions in doing this. + +  + File: gcc.info, Node: compatibility_alias, Prev: Constant string objects, Up: Objective-C + + compatibility_alias + =================== + + This is a feature of the Objective-C compiler rather than of the + runtime, anyway since it is documented nowhere and its existence was + forgotten, we are documenting it here. + + The keyword `@compatibility_alias' allows you to define a class name + as equivalent to another class name. For example: + + @compatibility_alias WOApplication GSWApplication; + + tells the compiler that each time it encounters `WOApplication' as a + class name, it should replace it with `GSWApplication' (that is, + `WOApplication' is just an alias for `GSWApplication'). + + There are some constraints on how this can be used-- + + * `WOApplication' (the alias) must not be an existing class; + + * `GSWApplication' (the real class) must be an existing class. + + +  + File: gcc.info, Node: Compatibility, Next: Gcov, Prev: Objective-C, Up: Top + + Binary Compatibility + ******************** + + Binary compatibility encompasses several related concepts: + + "application binary interface (ABI)" + The set of runtime conventions followed by all of the tools that + deal with binary representations of a program, including + compilers, assemblers, linkers, and language runtime support. + Some ABIs are formal with a written specification, possibly + designed by multiple interested parties. Others are simply the + way things are actually done by a particular set of tools. + + "ABI conformance" + A compiler conforms to an ABI if it generates code that follows + all of the specifications enumerated by that ABI. A library + conforms to an ABI if it is implemented according to that ABI. An + application conforms to an ABI if it is built using tools that + conform to that ABI and does not contain source code that + specifically changes behavior specified by the ABI. + + "calling conventions" + Calling conventions are a subset of an ABI that specify of how + arguments are passed and function results are returned. + + "interoperability" + Different sets of tools are interoperable if they generate files + that can be used in the same program. The set of tools includes + compilers, assemblers, linkers, libraries, header files, startup + files, and debuggers. Binaries produced by different sets of + tools are not interoperable unless they implement the same ABI. + This applies to different versions of the same tools as well as + tools from different vendors. + + "intercallability" + Whether a function in a binary built by one set of tools can call a + function in a binary built by a different set of tools is a subset + of interoperability. + + "implementation-defined features" + Language standards include lists of implementation-defined + features whose behavior can vary from one implementation to + another. Some of these features are normally covered by a + platform's ABI and others are not. The features that are not + covered by an ABI generally affect how a program behaves, but not + intercallability. + + "compatibility" + Conformance to the same ABI and the same behavior of + implementation-defined features are both relevant for + compatibility. + + The application binary interface implemented by a C or C++ compiler + affects code generation and runtime support for: + + * size and alignment of data types + + * layout of structured types + + * calling conventions + + * register usage conventions + + * interfaces for runtime arithmetic support + + * object file formats + + In addition, the application binary interface implemented by a C++ + compiler affects code generation and runtime support for: + * name mangling + + * exception handling + + * invoking constructors and destructors + + * layout, alignment, and padding of classes + + * layout and alignment of virtual tables + + Some GCC compilation options cause the compiler to generate code that + does not conform to the platform's default ABI. Other options cause + different program behavior for implementation-defined features that are + not covered by an ABI. These options are provided for consistency with + other compilers that do not follow the platform's default ABI or the + usual behavior of implementation-defined features for the platform. Be + very careful about using such options. + + Most platforms have a well-defined ABI that covers C code, but ABIs + that cover C++ functionality are not yet common. + + Starting with GCC 3.2, GCC binary conventions for C++ are based on a + written, vendor-neutral C++ ABI that was designed to be specific to + 64-bit Itanium but also includes generic specifications that apply to + any platform. This C++ ABI is also implemented by other compiler + vendors on some platforms, notably GNU/Linux and BSD systems. We have + tried hard to provide a stable ABI that will be compatible with future + GCC releases, but it is possible that we will encounter problems that + make this difficult. Such problems could include different + interpretations of the C++ ABI by different vendors, bugs in the ABI, or + bugs in the implementation of the ABI in different compilers. GCC's + `-Wabi' switch warns when G++ generates code that is probably not + compatible with the C++ ABI. + + The C++ library used with a C++ compiler includes the Standard C++ + Library, with functionality defined in the C++ Standard, plus language + runtime support. The runtime support is included in a C++ ABI, but + there is no formal ABI for the Standard C++ Library. Two + implementations of that library are interoperable if one follows the + de-facto ABI of the other and if they are both built with the same + compiler, or with compilers that conform to the same ABI for C++ + compiler and runtime support. + + When G++ and another C++ compiler conform to the same C++ ABI, but + the implementations of the Standard C++ Library that they normally use + do not follow the same ABI for the Standard C++ Library, object files + built with those compilers can be used in the same program only if they + use the same C++ library. This requires specifying the location of the + C++ library header files when invoking the compiler whose usual library + is not being used. The location of GCC's C++ header files depends on + how the GCC build was configured, but can be seen by using the G++ `-v' + option. With default configuration options for G++ 3.2 the compile + line for a different C++ compiler needs to include + + -IGCC_INSTALL_DIRECTORY/include/c++/3.2 + + Similarly, compiling code with G++ that must use a C++ library other + than the GNU C++ library requires specifying the location of the header + files for that other library. + + The most straightforward way to link a program to use a particular + C++ library is to use a C++ driver that specifies that C++ library by + default. The `g++' driver, for example, tells the linker where to find + GCC's C++ library (`libstdc++') plus the other libraries and startup + files it needs, in the proper order. + + If a program must use a different C++ library and it's not possible + to do the final link using a C++ driver that uses that library by + default, it is necessary to tell `g++' the location and name of that + library. It might also be necessary to specify different startup files + and other runtime support libraries, and to suppress the use of GCC's + support libraries with one or more of the options `-nostdlib', + `-nostartfiles', and `-nodefaultlibs'. + +  + File: gcc.info, Node: Gcov, Next: Trouble, Prev: Compatibility, Up: Top + + `gcov'--a Test Coverage Program + ******************************* + + `gcov' is a tool you can use in conjunction with GCC to test code + coverage in your programs. + + * Menu: + + * Gcov Intro:: Introduction to gcov. + * Invoking Gcov:: How to use gcov. + * Gcov and Optimization:: Using gcov with GCC optimization. + * Gcov Data Files:: The files used by gcov. + +  + File: gcc.info, Node: Gcov Intro, Next: Invoking Gcov, Up: Gcov + + Introduction to `gcov' + ====================== + + `gcov' is a test coverage program. Use it in concert with GCC to + analyze your programs to help create more efficient, faster running + code. You can use `gcov' as a profiling tool to help discover where + your optimization efforts will best affect your code. You can also use + `gcov' along with the other profiling tool, `gprof', to assess which + parts of your code use the greatest amount of computing time. + + Profiling tools help you analyze your code's performance. Using a + profiler such as `gcov' or `gprof', you can find out some basic + performance statistics, such as: + + * how often each line of code executes + + * what lines of code are actually executed + + * how much computing time each section of code uses + + Once you know these things about how your code works when compiled, + you can look at each module to see which modules should be optimized. + `gcov' helps you determine where to work on optimization. + + Software developers also use coverage testing in concert with + testsuites, to make sure software is actually good enough for a release. + Testsuites can verify that a program works as expected; a coverage + program tests to see how much of the program is exercised by the + testsuite. Developers can then determine what kinds of test cases need + to be added to the testsuites to create both better testing and a better + final product. + + You should compile your code without optimization if you plan to use + `gcov' because the optimization, by combining some lines of code into + one function, may not give you as much information as you need to look + for `hot spots' where the code is using a great deal of computer time. + Likewise, because `gcov' accumulates statistics by line (at the lowest + resolution), it works best with a programming style that places only + one statement on each line. If you use complicated macros that expand + to loops or to other control structures, the statistics are less + helpful--they only report on the line where the macro call appears. If + your complex macros behave like functions, you can replace them with + inline functions to solve this problem. + + `gcov' creates a logfile called `SOURCEFILE.gcov' which indicates + how many times each line of a source file `SOURCEFILE.c' has executed. + You can use these logfiles along with `gprof' to aid in fine-tuning the + performance of your programs. `gprof' gives timing information you can + use along with the information you get from `gcov'. + + `gcov' works only on code compiled with GCC. It is not compatible + with any other profiling or test coverage mechanism. + +  + File: gcc.info, Node: Invoking Gcov, Next: Gcov and Optimization, Prev: Gcov Intro, Up: Gcov + + Invoking gcov + ============= + + gcov [OPTIONS] SOURCEFILE + + `gcov' accepts the following options: + + `-h' + `--help' + Display help about using `gcov' (on the standard output), and exit + without doing any further processing. + + `-v' + `--version' + Display the `gcov' version number (on the standard output), and + exit without doing any further processing. + + `-b' + `--branch-probabilities' + Write branch frequencies to the output file, and write branch + summary info to the standard output. This option allows you to + see how often each branch in your program was taken. + + `-c' + `--branch-counts' + Write branch frequencies as the number of branches taken, rather + than the percentage of branches taken. + + `-n' + `--no-output' + Do not create the `gcov' output file. + + `-l' + `--long-file-names' + Create long file names for included source files. For example, if + the header file `x.h' contains code, and was included in the file + `a.c', then running `gcov' on the file `a.c' will produce an + output file called `a.c.x.h.gcov' instead of `x.h.gcov'. This can + be useful if `x.h' is included in multiple source files. + + `-f' + `--function-summaries' + Output summaries for each function in addition to the file level + summary. + + `-o DIRECTORY' + `--object-directory DIRECTORY' + The directory where the object files live. Gcov will search for + `.bb', `.bbg', and `.da' files in this directory. + + When using `gcov', you must first compile your program with two + special GCC options: `-fprofile-arcs -ftest-coverage'. This tells the + compiler to generate additional information needed by gcov (basically a + flow graph of the program) and also includes additional code in the + object files for generating the extra profiling information needed by + gcov. These additional files are placed in the directory where the + source code is located. + + Running the program will cause profile output to be generated. For + each source file compiled with `-fprofile-arcs', an accompanying `.da' + file will be placed in the source directory. + + Running `gcov' with your program's source file names as arguments + will now produce a listing of the code along with frequency of execution + for each line. For example, if your program is called `tmp.c', this is + what you see when you use the basic `gcov' facility: + + $ gcc -fprofile-arcs -ftest-coverage tmp.c + $ a.out + $ gcov tmp.c + 87.50% of 8 source lines executed in file tmp.c + Creating tmp.c.gcov. + + The file `tmp.c.gcov' contains output from `gcov'. Here is a sample: + + main() + { + 1 int i, total; + + 1 total = 0; + + 11 for (i = 0; i < 10; i++) + 10 total += i; + + 1 if (total != 45) + ###### printf ("Failure\n"); + else + 1 printf ("Success\n"); + 1 } + + When you use the `-b' option, your output looks like this: + + $ gcov -b tmp.c + 87.50% of 8 source lines executed in file tmp.c + 80.00% of 5 branches executed in file tmp.c + 80.00% of 5 branches taken at least once in file tmp.c + 50.00% of 2 calls executed in file tmp.c + Creating tmp.c.gcov. + + Here is a sample of a resulting `tmp.c.gcov' file: + + main() + { + 1 int i, total; + + 1 total = 0; + + 11 for (i = 0; i < 10; i++) + branch 0 taken = 91% + branch 1 taken = 100% + branch 2 taken = 100% + 10 total += i; + + 1 if (total != 45) + branch 0 taken = 100% + ###### printf ("Failure\n"); + call 0 never executed + branch 1 never executed + else + 1 printf ("Success\n"); + call 0 returns = 100% + 1 } + + For each basic block, a line is printed after the last line of the + basic block describing the branch or call that ends the basic block. + There can be multiple branches and calls listed for a single source + line if there are multiple basic blocks that end on that line. In this + case, the branches and calls are each given a number. There is no + simple way to map these branches and calls back to source constructs. + In general, though, the lowest numbered branch or call will correspond + to the leftmost construct on the source line. + + For a branch, if it was executed at least once, then a percentage + indicating the number of times the branch was taken divided by the + number of times the branch was executed will be printed. Otherwise, the + message "never executed" is printed. + + For a call, if it was executed at least once, then a percentage + indicating the number of times the call returned divided by the number + of times the call was executed will be printed. This will usually be + 100%, but may be less for functions call `exit' or `longjmp', and thus + may not return every time they are called. + + The execution counts are cumulative. If the example program were + executed again without removing the `.da' file, the count for the + number of times each line in the source was executed would be added to + the results of the previous run(s). This is potentially useful in + several ways. For example, it could be used to accumulate data over a + number of program runs as part of a test verification suite, or to + provide more accurate long-term information over a large number of + program runs. + + The data in the `.da' files is saved immediately before the program + exits. For each source file compiled with `-fprofile-arcs', the + profiling code first attempts to read in an existing `.da' file; if the + file doesn't match the executable (differing number of basic block + counts) it will ignore the contents of the file. It then adds in the + new execution counts and finally writes the data to the file. + +  + File: gcc.info, Node: Gcov and Optimization, Next: Gcov Data Files, Prev: Invoking Gcov, Up: Gcov + + Using `gcov' with GCC Optimization + ================================== + + If you plan to use `gcov' to help optimize your code, you must first + compile your program with two special GCC options: `-fprofile-arcs + -ftest-coverage'. Aside from that, you can use any other GCC options; + but if you want to prove that every single line in your program was + executed, you should not compile with optimization at the same time. + On some machines the optimizer can eliminate some simple code lines by + combining them with other lines. For example, code like this: + + if (a != b) + c = 1; + else + c = 0; + + can be compiled into one instruction on some machines. In this case, + there is no way for `gcov' to calculate separate execution counts for + each line because there isn't separate code for each line. Hence the + `gcov' output looks like this if you compiled the program with + optimization: + + 100 if (a != b) + 100 c = 1; + 100 else + 100 c = 0; + + The output shows that this block of code, combined by optimization, + executed 100 times. In one sense this result is correct, because there + was only one instruction representing all four of these lines. However, + the output does not indicate how many times the result was 0 and how + many times the result was 1. + +  + File: gcc.info, Node: Gcov Data Files, Prev: Gcov and Optimization, Up: Gcov + + Brief description of `gcov' data files + ====================================== + + `gcov' uses three files for doing profiling. The names of these + files are derived from the original _source_ file by substituting the + file suffix with either `.bb', `.bbg', or `.da'. All of these files + are placed in the same directory as the source file, and contain data + stored in a platform-independent method. + + The `.bb' and `.bbg' files are generated when the source file is + compiled with the GCC `-ftest-coverage' option. The `.bb' file + contains a list of source files (including headers), functions within + those files, and line numbers corresponding to each basic block in the + source file. + + The `.bb' file format consists of several lists of 4-byte integers + which correspond to the line numbers of each basic block in the file. + Each list is terminated by a line number of 0. A line number of -1 is + used to designate that the source file name (padded to a 4-byte + boundary and followed by another -1) follows. In addition, a line + number of -2 is used to designate that the name of a function (also + padded to a 4-byte boundary and followed by a -2) follows. + + The `.bbg' file is used to reconstruct the program flow graph for + the source file. It contains a list of the program flow arcs (possible + branches taken from one basic block to another) for each function which, + in combination with the `.bb' file, enables gcov to reconstruct the + program flow. + + In the `.bbg' file, the format is: + number of basic blocks for function #0 (4-byte number) + total number of arcs for function #0 (4-byte number) + count of arcs in basic block #0 (4-byte number) + destination basic block of arc #0 (4-byte number) + flag bits (4-byte number) + destination basic block of arc #1 (4-byte number) + flag bits (4-byte number) + ... + destination basic block of arc #N (4-byte number) + flag bits (4-byte number) + count of arcs in basic block #1 (4-byte number) + destination basic block of arc #0 (4-byte number) + flag bits (4-byte number) + ... + + A -1 (stored as a 4-byte number) is used to separate each function's + list of basic blocks, and to verify that the file has been read + correctly. + + The `.da' file is generated when a program containing object files + built with the GCC `-fprofile-arcs' option is executed. A separate + `.da' file is created for each source file compiled with this option, + and the name of the `.da' file is stored as an absolute pathname in the + resulting object file. This path name is derived from the source file + name by substituting a `.da' suffix. + + The format of the `.da' file is fairly simple. The first 8-byte + number is the number of counts in the file, followed by the counts + (stored as 8-byte numbers). Each count corresponds to the number of + times each arc in the program is executed. The counts are cumulative; + each time the program is executed, it attempts to combine the existing + `.da' files with the new counts for this invocation of the program. It + ignores the contents of any `.da' files whose number of arcs doesn't + correspond to the current program, and merely overwrites them instead. + + All three of these files use the functions in `gcov-io.h' to store + integers; the functions in this header provide a machine-independent + mechanism for storing and retrieving data from a stream. + +  + File: gcc.info, Node: Trouble, Next: Bugs, Prev: Gcov, Up: Top + + Known Causes of Trouble with GCC + ******************************** + + This section describes known problems that affect users of GCC. Most + of these are not GCC bugs per se--if they were, we would fix them. But + the result for a user may be like the result of a bug. + + Some of these problems are due to bugs in other software, some are + missing features that are too much work to add, and some are places + where people's opinions differ as to what is best. + + * Menu: + + * Actual Bugs:: Bugs we will fix later. + * Cross-Compiler Problems:: Common problems of cross compiling with GCC. + * Interoperation:: Problems using GCC with other compilers, + and with certain linkers, assemblers and debuggers. + * External Bugs:: Problems compiling certain programs. + * Incompatibilities:: GCC is incompatible with traditional C. + * Fixed Headers:: GCC uses corrected versions of system header files. + This is necessary, but doesn't always work smoothly. + * Standard Libraries:: GCC uses the system C library, which might not be + compliant with the ISO C standard. + * Disappointments:: Regrettable things we can't change, but not quite bugs. + * C++ Misunderstandings:: Common misunderstandings with GNU C++. + * Protoize Caveats:: Things to watch out for when using `protoize'. + * Non-bugs:: Things we think are right, but some others disagree. + * Warnings and Errors:: Which problems in your code get warnings, + and which get errors. + +  + File: gcc.info, Node: Actual Bugs, Next: Cross-Compiler Problems, Up: Trouble + + Actual Bugs We Haven't Fixed Yet + ================================ + + * The `fixincludes' script interacts badly with automounters; if the + directory of system header files is automounted, it tends to be + unmounted while `fixincludes' is running. This would seem to be a + bug in the automounter. We don't know any good way to work around + it. + + * The `fixproto' script will sometimes add prototypes for the + `sigsetjmp' and `siglongjmp' functions that reference the + `jmp_buf' type before that type is defined. To work around this, + edit the offending file and place the typedef in front of the + prototypes. + + * When `-pedantic-errors' is specified, GCC will incorrectly give an + error message when a function name is specified in an expression + involving the comma operator. + +  + File: gcc.info, Node: Cross-Compiler Problems, Next: Interoperation, Prev: Actual Bugs, Up: Trouble + + Cross-Compiler Problems + ======================= + + You may run into problems with cross compilation on certain machines, + for several reasons. + + * Cross compilation can run into trouble for certain machines because + some target machines' assemblers require floating point numbers to + be written as _integer_ constants in certain contexts. + + The compiler writes these integer constants by examining the + floating point value as an integer and printing that integer, + because this is simple to write and independent of the details of + the floating point representation. But this does not work if the + compiler is running on a different machine with an incompatible + floating point format, or even a different byte-ordering. + + In addition, correct constant folding of floating point values + requires representing them in the target machine's format. (The C + standard does not quite require this, but in practice it is the + only way to win.) + + It is now possible to overcome these problems by defining macros + such as `REAL_VALUE_TYPE'. But doing so is a substantial amount of + work for each target machine. *Note Cross Compilation and + Floating Point: (gccint)Cross-compilation. + + * At present, the program `mips-tfile' which adds debug support to + object files on MIPS systems does not work in a cross compile + environment. + +  + File: gcc.info, Node: Interoperation, Next: External Bugs, Prev: Cross-Compiler Problems, Up: Trouble + + Interoperation + ============== + + This section lists various difficulties encountered in using GCC + together with other compilers or with the assemblers, linkers, + libraries and debuggers on certain systems. + + * On many platforms, GCC supports a different ABI for C++ than do + other compilers, so the object files compiled by GCC cannot be + used with object files generated by another C++ compiler. + + An area where the difference is most apparent is name mangling. + The use of different name mangling is intentional, to protect you + from more subtle problems. Compilers differ as to many internal + details of C++ implementation, including: how class instances are + laid out, how multiple inheritance is implemented, and how virtual + function calls are handled. If the name encoding were made the + same, your programs would link against libraries provided from + other compilers--but the programs would then crash when run. + Incompatible libraries are then detected at link time, rather than + at run time. + + * Older GDB versions sometimes fail to read the output of GCC version + 2. If you have trouble, get GDB version 4.4 or later. + + * DBX rejects some files produced by GCC, though it accepts similar + constructs in output from PCC. Until someone can supply a coherent + description of what is valid DBX input and what is not, there is + nothing I can do about these problems. You are on your own. + + * The GNU assembler (GAS) does not support PIC. To generate PIC + code, you must use some other assembler, such as `/bin/as'. + + * On some BSD systems, including some versions of Ultrix, use of + profiling causes static variable destructors (currently used only + in C++) not to be run. + + * On some SGI systems, when you use `-lgl_s' as an option, it gets + translated magically to `-lgl_s -lX11_s -lc_s'. Naturally, this + does not happen when you use GCC. You must specify all three + options explicitly. + + * On a Sparc, GCC aligns all values of type `double' on an 8-byte + boundary, and it expects every `double' to be so aligned. The Sun + compiler usually gives `double' values 8-byte alignment, with one + exception: function arguments of type `double' may not be aligned. + + As a result, if a function compiled with Sun CC takes the address + of an argument of type `double' and passes this pointer of type + `double *' to a function compiled with GCC, dereferencing the + pointer may cause a fatal signal. + + One way to solve this problem is to compile your entire program + with GCC. Another solution is to modify the function that is + compiled with Sun CC to copy the argument into a local variable; + local variables are always properly aligned. A third solution is + to modify the function that uses the pointer to dereference it via + the following function `access_double' instead of directly with + `*': + + inline double + access_double (double *unaligned_ptr) + { + union d2i { double d; int i[2]; }; + + union d2i *p = (union d2i *) unaligned_ptr; + union d2i u; + + u.i[0] = p->i[0]; + u.i[1] = p->i[1]; + + return u.d; + } + + Storing into the pointer can be done likewise with the same union. + + * On Solaris, the `malloc' function in the `libmalloc.a' library may + allocate memory that is only 4 byte aligned. Since GCC on the + Sparc assumes that doubles are 8 byte aligned, this may result in a + fatal signal if doubles are stored in memory allocated by the + `libmalloc.a' library. + + The solution is to not use the `libmalloc.a' library. Use instead + `malloc' and related functions from `libc.a'; they do not have + this problem. + + * Sun forgot to include a static version of `libdl.a' with some + versions of SunOS (mainly 4.1). This results in undefined symbols + when linking static binaries (that is, if you use `-static'). If + you see undefined symbols `_dlclose', `_dlsym' or `_dlopen' when + linking, compile and link against the file `mit/util/misc/dlsym.c' + from the MIT version of X windows. + + * The 128-bit long double format that the Sparc port supports + currently works by using the architecturally defined quad-word + floating point instructions. Since there is no hardware that + supports these instructions they must be emulated by the operating + system. Long doubles do not work in Sun OS versions 4.0.3 and + earlier, because the kernel emulator uses an obsolete and + incompatible format. Long doubles do not work in Sun OS version + 4.1.1 due to a problem in a Sun library. Long doubles do work on + Sun OS versions 4.1.2 and higher, but GCC does not enable them by + default. Long doubles appear to work in Sun OS 5.x (Solaris 2.x). + + * On HP-UX version 9.01 on the HP PA, the HP compiler `cc' does not + compile GCC correctly. We do not yet know why. However, GCC + compiled on earlier HP-UX versions works properly on HP-UX 9.01 + and can compile itself properly on 9.01. + + * On the HP PA machine, ADB sometimes fails to work on functions + compiled with GCC. Specifically, it fails to work on functions + that use `alloca' or variable-size arrays. This is because GCC + doesn't generate HP-UX unwind descriptors for such functions. It + may even be impossible to generate them. + + * Debugging (`-g') is not supported on the HP PA machine, unless you + use the preliminary GNU tools. + + * Taking the address of a label may generate errors from the HP-UX + PA assembler. GAS for the PA does not have this problem. + + * Using floating point parameters for indirect calls to static + functions will not work when using the HP assembler. There simply + is no way for GCC to specify what registers hold arguments for + static functions when using the HP assembler. GAS for the PA does + not have this problem. + + * In extremely rare cases involving some very large functions you may + receive errors from the HP linker complaining about an out of + bounds unconditional branch offset. This used to occur more often + in previous versions of GCC, but is now exceptionally rare. If + you should run into it, you can work around by making your + function smaller. + + * GCC compiled code sometimes emits warnings from the HP-UX + assembler of the form: + + (warning) Use of GR3 when + frame >= 8192 may cause conflict. + + These warnings are harmless and can be safely ignored. + + * On the IBM RS/6000, compiling code of the form + + extern int foo; + + ... foo ... + + static int foo; + + will cause the linker to report an undefined symbol `foo'. + Although this behavior differs from most other systems, it is not a + bug because redefining an `extern' variable as `static' is + undefined in ISO C. + + * In extremely rare cases involving some very large functions you may + receive errors from the AIX Assembler complaining about a + displacement that is too large. If you should run into it, you + can work around by making your function smaller. + + * The `libstdc++.a' library in GCC relies on the SVR4 dynamic linker + semantics which merges global symbols between libraries and + applications, especially necessary for C++ streams functionality. + This is not the default behavior of AIX shared libraries and + dynamic linking. `libstdc++.a' is built on AIX with + "runtime-linking" enabled so that symbol merging can occur. To + utilize this feature, the application linked with `libstdc++.a' + must include the `-Wl,-brtl' flag on the link line. G++ cannot + impose this because this option may interfere with the semantics + of the user program and users may not always use `g++' to link his + or her application. Applications are not required to use the + `-Wl,-brtl' flag on the link line--the rest of the `libstdc++.a' + library which is not dependent on the symbol merging semantics + will continue to function correctly. + + * An application can interpose its own definition of functions for + functions invoked by `libstdc++.a' with "runtime-linking" enabled + on AIX. To accomplish this the application must be linked with + "runtime-linking" option and the functions explicitly must be + exported by the application (`-Wl,-brtl,-bE:exportfile'). + + * AIX on the RS/6000 provides support (NLS) for environments outside + of the United States. Compilers and assemblers use NLS to support + locale-specific representations of various objects including + floating-point numbers (`.' vs `,' for separating decimal + fractions). There have been problems reported where the library + linked with GCC does not produce the same floating-point formats + that the assembler accepts. If you have this problem, set the + `LANG' environment variable to `C' or `En_US'. + + * Even if you specify `-fdollars-in-identifiers', you cannot + successfully use `$' in identifiers on the RS/6000 due to a + restriction in the IBM assembler. GAS supports these identifiers. + + * There is an assembler bug in versions of DG/UX prior to 5.4.2.01 + that occurs when the `fldcr' instruction is used. GCC uses + `fldcr' on the 88100 to serialize volatile memory references. Use + the option `-mno-serialize-volatile' if your version of the + assembler has this bug. + + * On VMS, GAS versions 1.38.1 and earlier may cause spurious warning + messages from the linker. These warning messages complain of + mismatched psect attributes. You can ignore them. + + * On NewsOS version 3, if you include both of the files `stddef.h' + and `sys/types.h', you get an error because there are two typedefs + of `size_t'. You should change `sys/types.h' by adding these + lines around the definition of `size_t': + + #ifndef _SIZE_T + #define _SIZE_T + ACTUAL-TYPEDEF-HERE + #endif + + * On the Alliant, the system's own convention for returning + structures and unions is unusual, and is not compatible with GCC + no matter what options are used. + + * On the IBM RT PC, the MetaWare HighC compiler (hc) uses a different + convention for structure and union returning. Use the option + `-mhc-struct-return' to tell GCC to use a convention compatible + with it. + + * On Ultrix, the Fortran compiler expects registers 2 through 5 to + be saved by function calls. However, the C compiler uses + conventions compatible with BSD Unix: registers 2 through 5 may be + clobbered by function calls. + + GCC uses the same convention as the Ultrix C compiler. You can use + these options to produce code compatible with the Fortran compiler: + + -fcall-saved-r2 -fcall-saved-r3 -fcall-saved-r4 -fcall-saved-r5 + + * On the WE32k, you may find that programs compiled with GCC do not + work with the standard shared C library. You may need to link with + the ordinary C compiler. If you do so, you must specify the + following options: + + -L/usr/local/lib/gcc-lib/we32k-att-sysv/2.8.1 -lgcc -lc_s + + The first specifies where to find the library `libgcc.a' specified + with the `-lgcc' option. + + GCC does linking by invoking `ld', just as `cc' does, and there is + no reason why it _should_ matter which compilation program you use + to invoke `ld'. If someone tracks this problem down, it can + probably be fixed easily. + + * On the Alpha, you may get assembler errors about invalid syntax as + a result of floating point constants. This is due to a bug in the + C library functions `ecvt', `fcvt' and `gcvt'. Given valid + floating point numbers, they sometimes print `NaN'. + + * On Irix 4.0.5F (and perhaps in some other versions), an assembler + bug sometimes reorders instructions incorrectly when optimization + is turned on. If you think this may be happening to you, try + using the GNU assembler; GAS version 2.1 supports ECOFF on Irix. + + Or use the `-noasmopt' option when you compile GCC with itself, + and then again when you compile your program. (This is a temporary + kludge to turn off assembler optimization on Irix.) If this + proves to be what you need, edit the assembler spec in the file + `specs' so that it unconditionally passes `-O0' to the assembler, + and never passes `-O2' or `-O3'. + +  + File: gcc.info, Node: External Bugs, Next: Incompatibilities, Prev: Interoperation, Up: Trouble + + Problems Compiling Certain Programs + =================================== + + Certain programs have problems compiling. + + * Parse errors may occur compiling X11 on a Decstation running + Ultrix 4.2 because of problems in DEC's versions of the X11 header + files `X11/Xlib.h' and `X11/Xutil.h'. People recommend adding + `-I/usr/include/mit' to use the MIT versions of the header files, + using the `-traditional' switch to turn off ISO C, or fixing the + header files by adding this: + + #ifdef __STDC__ + #define NeedFunctionPrototypes 0 + #endif + + * On various 386 Unix systems derived from System V, including SCO, + ISC, and ESIX, you may get error messages about running out of + virtual memory while compiling certain programs. + + You can prevent this problem by linking GCC with the GNU malloc + (which thus replaces the malloc that comes with the system). GNU + malloc is available as a separate package, and also in the file + `src/gmalloc.c' in the GNU Emacs 19 distribution. + + If you have installed GNU malloc as a separate library package, + use this option when you relink GCC: + + MALLOC=/usr/local/lib/libgmalloc.a + + Alternatively, if you have compiled `gmalloc.c' from Emacs 19, copy + the object file to `gmalloc.o' and use this option when you relink + GCC: + + MALLOC=gmalloc.o + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-19 gcc-3.2.3/gcc/doc/gcc.info-19 *** gcc-3.2.2/gcc/doc/gcc.info-19 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-19 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1019 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Incompatibilities, Next: Fixed Headers, Prev: External Bugs, Up: Trouble + + Incompatibilities of GCC + ======================== + + There are several noteworthy incompatibilities between GNU C and K&R + (non-ISO) versions of C. The `-traditional' option eliminates many of + these incompatibilities, _but not all_, by telling GCC to behave like a + K&R C compiler. + + * GCC normally makes string constants read-only. If several + identical-looking string constants are used, GCC stores only one + copy of the string. + + One consequence is that you cannot call `mktemp' with a string + constant argument. The function `mktemp' always alters the string + its argument points to. + + Another consequence is that `sscanf' does not work on some systems + when passed a string constant as its format control string or + input. This is because `sscanf' incorrectly tries to write into + the string constant. Likewise `fscanf' and `scanf'. + + The best solution to these problems is to change the program to use + `char'-array variables with initialization strings for these + purposes instead of string constants. But if this is not possible, + you can use the `-fwritable-strings' flag, which directs GCC to + handle string constants the same way most C compilers do. + `-traditional' also has this effect, among others. + + * `-2147483648' is positive. + + This is because 2147483648 cannot fit in the type `int', so + (following the ISO C rules) its data type is `unsigned long int'. + Negating this value yields 2147483648 again. + + * GCC does not substitute macro arguments when they appear inside of + string constants. For example, the following macro in GCC + + #define foo(a) "a" + + will produce output `"a"' regardless of what the argument A is. + + The `-traditional' option directs GCC to handle such cases (among + others) in the old-fashioned (non-ISO) fashion. + + * When you use `setjmp' and `longjmp', the only automatic variables + guaranteed to remain valid are those declared `volatile'. This is + a consequence of automatic register allocation. Consider this + function: + + jmp_buf j; + + foo () + { + int a, b; + + a = fun1 (); + if (setjmp (j)) + return a; + + a = fun2 (); + /* `longjmp (j)' may occur in `fun3'. */ + return a + fun3 (); + } + + Here `a' may or may not be restored to its first value when the + `longjmp' occurs. If `a' is allocated in a register, then its + first value is restored; otherwise, it keeps the last value stored + in it. + + If you use the `-W' option with the `-O' option, you will get a + warning when GCC thinks such a problem might be possible. + + The `-traditional' option directs GCC to put variables in the + stack by default, rather than in registers, in functions that call + `setjmp'. This results in the behavior found in traditional C + compilers. + + * Programs that use preprocessing directives in the middle of macro + arguments do not work with GCC. For example, a program like this + will not work: + + foobar ( + #define luser + hack) + + ISO C does not permit such a construct. It would make sense to + support it when `-traditional' is used, but it is too much work to + implement. + + * K&R compilers allow comments to cross over an inclusion boundary + (i.e. started in an include file and ended in the including file). + I think this would be quite ugly and can't imagine it could be + needed. + + * Declarations of external variables and functions within a block + apply only to the block containing the declaration. In other + words, they have the same scope as any other declaration in the + same place. + + In some other C compilers, a `extern' declaration affects all the + rest of the file even if it happens within a block. + + The `-traditional' option directs GCC to treat all `extern' + declarations as global, like traditional compilers. + + * In traditional C, you can combine `long', etc., with a typedef + name, as shown here: + + typedef int foo; + typedef long foo bar; + + In ISO C, this is not allowed: `long' and other type modifiers + require an explicit `int'. Because this criterion is expressed by + Bison grammar rules rather than C code, the `-traditional' flag + cannot alter it. + + * PCC allows typedef names to be used as function parameters. The + difficulty described immediately above applies here too. + + * When in `-traditional' mode, GCC allows the following erroneous + pair of declarations to appear together in a given scope: + + typedef int foo; + typedef foo foo; + + * GCC treats all characters of identifiers as significant, even when + in `-traditional' mode. According to K&R-1 (2.2), "No more than + the first eight characters are significant, although more may be + used.". Also according to K&R-1 (2.2), "An identifier is a + sequence of letters and digits; the first character must be a + letter. The underscore _ counts as a letter.", but GCC also + allows dollar signs in identifiers. + + * PCC allows whitespace in the middle of compound assignment + operators such as `+='. GCC, following the ISO standard, does not + allow this. The difficulty described immediately above applies + here too. + + * GCC complains about unterminated character constants inside of + preprocessing conditionals that fail. Some programs have English + comments enclosed in conditionals that are guaranteed to fail; if + these comments contain apostrophes, GCC will probably report an + error. For example, this code would produce an error: + + #if 0 + You can't expect this to work. + #endif + + The best solution to such a problem is to put the text into an + actual C comment delimited by `/*...*/'. However, `-traditional' + suppresses these error messages. + + * Many user programs contain the declaration `long time ();'. In the + past, the system header files on many systems did not actually + declare `time', so it did not matter what type your program + declared it to return. But in systems with ISO C headers, `time' + is declared to return `time_t', and if that is not the same as + `long', then `long time ();' is erroneous. + + The solution is to change your program to use appropriate system + headers (`' on systems with ISO C headers) and not to + declare `time' if the system header files declare it, or failing + that to use `time_t' as the return type of `time'. + + * When compiling functions that return `float', PCC converts it to a + double. GCC actually returns a `float'. If you are concerned + with PCC compatibility, you should declare your functions to return + `double'; you might as well say what you mean. + + * When compiling functions that return structures or unions, GCC + output code normally uses a method different from that used on most + versions of Unix. As a result, code compiled with GCC cannot call + a structure-returning function compiled with PCC, and vice versa. + + The method used by GCC is as follows: a structure or union which is + 1, 2, 4 or 8 bytes long is returned like a scalar. A structure or + union with any other size is stored into an address supplied by + the caller (usually in a special, fixed register, but on some + machines it is passed on the stack). The machine-description + macros `STRUCT_VALUE' and `STRUCT_INCOMING_VALUE' tell GCC where + to pass this address. + + By contrast, PCC on most target machines returns structures and + unions of any size by copying the data into an area of static + storage, and then returning the address of that storage as if it + were a pointer value. The caller must copy the data from that + memory area to the place where the value is wanted. GCC does not + use this method because it is slower and nonreentrant. + + On some newer machines, PCC uses a reentrant convention for all + structure and union returning. GCC on most of these machines uses + a compatible convention when returning structures and unions in + memory, but still returns small structures and unions in registers. + + You can tell GCC to use a compatible convention for all structure + and union returning with the option `-fpcc-struct-return'. + + * GCC complains about program fragments such as `0x74ae-0x4000' + which appear to be two hexadecimal constants separated by the minus + operator. Actually, this string is a single "preprocessing token". + Each such token must correspond to one token in C. Since this + does not, GCC prints an error message. Although it may appear + obvious that what is meant is an operator and two values, the ISO + C standard specifically requires that this be treated as erroneous. + + A "preprocessing token" is a "preprocessing number" if it begins + with a digit and is followed by letters, underscores, digits, + periods and `e+', `e-', `E+', `E-', `p+', `p-', `P+', or `P-' + character sequences. (In strict C89 mode, the sequences `p+', + `p-', `P+' and `P-' cannot appear in preprocessing numbers.) + + To make the above program fragment valid, place whitespace in + front of the minus sign. This whitespace will end the + preprocessing number. + +  + File: gcc.info, Node: Fixed Headers, Next: Standard Libraries, Prev: Incompatibilities, Up: Trouble + + Fixed Header Files + ================== + + GCC needs to install corrected versions of some system header files. + This is because most target systems have some header files that won't + work with GCC unless they are changed. Some have bugs, some are + incompatible with ISO C, and some depend on special features of other + compilers. + + Installing GCC automatically creates and installs the fixed header + files, by running a program called `fixincludes' (or for certain + targets an alternative such as `fixinc.svr4'). Normally, you don't + need to pay attention to this. But there are cases where it doesn't do + the right thing automatically. + + * If you update the system's header files, such as by installing a + new system version, the fixed header files of GCC are not + automatically updated. The easiest way to update them is to + reinstall GCC. (If you want to be clever, look in the makefile + and you can find a shortcut.) + + * On some systems, in particular SunOS 4, header file directories + contain machine-specific symbolic links in certain places. This + makes it possible to share most of the header files among hosts + running the same version of SunOS 4 on different machine models. + + The programs that fix the header files do not understand this + special way of using symbolic links; therefore, the directory of + fixed header files is good only for the machine model used to + build it. + + In SunOS 4, only programs that look inside the kernel will notice + the difference between machine models. Therefore, for most + purposes, you need not be concerned about this. + + It is possible to make separate sets of fixed header files for the + different machine models, and arrange a structure of symbolic + links so as to use the proper set, but you'll have to do this by + hand. + + * On Lynxos, GCC by default does not fix the header files. This is + because bugs in the shell cause the `fixincludes' script to fail. + + This means you will encounter problems due to bugs in the system + header files. It may be no comfort that they aren't GCC's fault, + but it does mean that there's nothing for us to do about them. + +  + File: gcc.info, Node: Standard Libraries, Next: Disappointments, Prev: Fixed Headers, Up: Trouble + + Standard Libraries + ================== + + GCC by itself attempts to be a conforming freestanding + implementation. *Note Language Standards Supported by GCC: Standards, + for details of what this means. Beyond the library facilities required + of such an implementation, the rest of the C library is supplied by the + vendor of the operating system. If that C library doesn't conform to + the C standards, then your programs might get warnings (especially when + using `-Wall') that you don't expect. + + For example, the `sprintf' function on SunOS 4.1.3 returns `char *' + while the C standard says that `sprintf' returns an `int'. The + `fixincludes' program could make the prototype for this function match + the Standard, but that would be wrong, since the function will still + return `char *'. + + If you need a Standard compliant library, then you need to find one, + as GCC does not provide one. The GNU C library (called `glibc') + provides ISO C, POSIX, BSD, SystemV and X/Open compatibility for + GNU/Linux and HURD-based GNU systems; no recent version of it supports + other systems, though some very old versions did. Version 2.2 of the + GNU C library includes nearly complete C99 support. You could also ask + your operating system vendor if newer libraries are available. + +  + File: gcc.info, Node: Disappointments, Next: C++ Misunderstandings, Prev: Standard Libraries, Up: Trouble + + Disappointments and Misunderstandings + ===================================== + + These problems are perhaps regrettable, but we don't know any + practical way around them. + + * Certain local variables aren't recognized by debuggers when you + compile with optimization. + + This occurs because sometimes GCC optimizes the variable out of + existence. There is no way to tell the debugger how to compute the + value such a variable "would have had", and it is not clear that + would be desirable anyway. So GCC simply does not mention the + eliminated variable when it writes debugging information. + + You have to expect a certain amount of disagreement between the + executable and your source code, when you use optimization. + + * Users often think it is a bug when GCC reports an error for code + like this: + + int foo (struct mumble *); + + struct mumble { ... }; + + int foo (struct mumble *x) + { ... } + + This code really is erroneous, because the scope of `struct + mumble' in the prototype is limited to the argument list + containing it. It does not refer to the `struct mumble' defined + with file scope immediately below--they are two unrelated types + with similar names in different scopes. + + But in the definition of `foo', the file-scope type is used + because that is available to be inherited. Thus, the definition + and the prototype do not match, and you get an error. + + This behavior may seem silly, but it's what the ISO standard + specifies. It is easy enough for you to make your code work by + moving the definition of `struct mumble' above the prototype. + It's not worth being incompatible with ISO C just to avoid an + error for the example shown above. + + * Accesses to bit-fields even in volatile objects works by accessing + larger objects, such as a byte or a word. You cannot rely on what + size of object is accessed in order to read or write the + bit-field; it may even vary for a given bit-field according to the + precise usage. + + If you care about controlling the amount of memory that is + accessed, use volatile but do not use bit-fields. + + * GCC comes with shell scripts to fix certain known problems in + system header files. They install corrected copies of various + header files in a special directory where only GCC will normally + look for them. The scripts adapt to various systems by searching + all the system header files for the problem cases that we know + about. + + If new system header files are installed, nothing automatically + arranges to update the corrected header files. You will have to + reinstall GCC to fix the new header files. More specifically, go + to the build directory and delete the files `stmp-fixinc' and + `stmp-headers', and the subdirectory `include'; then do `make + install' again. + + * On 68000 and x86 systems, for instance, you can get paradoxical + results if you test the precise values of floating point numbers. + For example, you can find that a floating point value which is not + a NaN is not equal to itself. This results from the fact that the + floating point registers hold a few more bits of precision than + fit in a `double' in memory. Compiled code moves values between + memory and floating point registers at its convenience, and moving + them into memory truncates them. + + You can partially avoid this problem by using the `-ffloat-store' + option (*note Optimize Options::). + + * On the MIPS, variable argument functions using `varargs.h' cannot + have a floating point value for the first argument. The reason + for this is that in the absence of a prototype in scope, if the + first argument is a floating point, it is passed in a floating + point register, rather than an integer register. + + If the code is rewritten to use the ISO standard `stdarg.h' method + of variable arguments, and the prototype is in scope at the time + of the call, everything will work fine. + + * On the H8/300 and H8/300H, variable argument functions must be + implemented using the ISO standard `stdarg.h' method of variable + arguments. Furthermore, calls to functions using `stdarg.h' + variable arguments must have a prototype for the called function + in scope at the time of the call. + + * On AIX and other platforms without weak symbol support, templates + need to be instantiated explicitly and symbols for static members + of templates will not be generated. + +  + File: gcc.info, Node: C++ Misunderstandings, Next: Protoize Caveats, Prev: Disappointments, Up: Trouble + + Common Misunderstandings with GNU C++ + ===================================== + + C++ is a complex language and an evolving one, and its standard + definition (the ISO C++ standard) was only recently completed. As a + result, your C++ compiler may occasionally surprise you, even when its + behavior is correct. This section discusses some areas that frequently + give rise to questions of this sort. + + * Menu: + + * Static Definitions:: Static member declarations are not definitions + * Temporaries:: Temporaries may vanish before you expect + * Copy Assignment:: Copy Assignment operators copy virtual bases twice + +  + File: gcc.info, Node: Static Definitions, Next: Temporaries, Up: C++ Misunderstandings + + Declare _and_ Define Static Members + ----------------------------------- + + When a class has static data members, it is not enough to _declare_ + the static member; you must also _define_ it. For example: + + class Foo + { + ... + void method(); + static int bar; + }; + + This declaration only establishes that the class `Foo' has an `int' + named `Foo::bar', and a member function named `Foo::method'. But you + still need to define _both_ `method' and `bar' elsewhere. According to + the ISO standard, you must supply an initializer in one (and only one) + source file, such as: + + int Foo::bar = 0; + + Other C++ compilers may not correctly implement the standard + behavior. As a result, when you switch to `g++' from one of these + compilers, you may discover that a program that appeared to work + correctly in fact does not conform to the standard: `g++' reports as + undefined symbols any static data members that lack definitions. + +  + File: gcc.info, Node: Temporaries, Next: Copy Assignment, Prev: Static Definitions, Up: C++ Misunderstandings + + Temporaries May Vanish Before You Expect + ---------------------------------------- + + It is dangerous to use pointers or references to _portions_ of a + temporary object. The compiler may very well delete the object before + you expect it to, leaving a pointer to garbage. The most common place + where this problem crops up is in classes like string classes, + especially ones that define a conversion function to type `char *' or + `const char *'--which is one reason why the standard `string' class + requires you to call the `c_str' member function. However, any class + that returns a pointer to some internal structure is potentially + subject to this problem. + + For example, a program may use a function `strfunc' that returns + `string' objects, and another function `charfunc' that operates on + pointers to `char': + + string strfunc (); + void charfunc (const char *); + + void + f () + { + const char *p = strfunc().c_str(); + ... + charfunc (p); + ... + charfunc (p); + } + + In this situation, it may seem reasonable to save a pointer to the C + string returned by the `c_str' member function and use that rather than + call `c_str' repeatedly. However, the temporary string created by the + call to `strfunc' is destroyed after `p' is initialized, at which point + `p' is left pointing to freed memory. + + Code like this may run successfully under some other compilers, + particularly obsolete cfront-based compilers that delete temporaries + along with normal local variables. However, the GNU C++ behavior is + standard-conforming, so if your program depends on late destruction of + temporaries it is not portable. + + The safe way to write such code is to give the temporary a name, + which forces it to remain until the end of the scope of the name. For + example: + + string& tmp = strfunc (); + charfunc (tmp.c_str ()); + +  + File: gcc.info, Node: Copy Assignment, Prev: Temporaries, Up: C++ Misunderstandings + + Implicit Copy-Assignment for Virtual Bases + ------------------------------------------ + + When a base class is virtual, only one subobject of the base class + belongs to each full object. Also, the constructors and destructors are + invoked only once, and called from the most-derived class. However, + such objects behave unspecified when being assigned. For example: + + struct Base{ + char *name; + Base(char *n) : name(strdup(n)){} + Base& operator= (const Base& other){ + free (name); + name = strdup (other.name); + } + }; + + struct A:virtual Base{ + int val; + A():Base("A"){} + }; + + struct B:virtual Base{ + int bval; + B():Base("B"){} + }; + + struct Derived:public A, public B{ + Derived():Base("Derived"){} + }; + + void func(Derived &d1, Derived &d2) + { + d1 = d2; + } + + The C++ standard specifies that `Base::Base' is only called once + when constructing or copy-constructing a Derived object. It is + unspecified whether `Base::operator=' is called more than once when the + implicit copy-assignment for Derived objects is invoked (as it is + inside `func' in the example). + + g++ implements the "intuitive" algorithm for copy-assignment: assign + all direct bases, then assign all members. In that algorithm, the + virtual base subobject can be encountered many times. In the example, + copying proceeds in the following order: `val', `name' (via `strdup'), + `bval', and `name' again. + + If application code relies on copy-assignment, a user-defined + copy-assignment operator removes any uncertainties. With such an + operator, the application can define whether and how the virtual base + subobject is assigned. + +  + File: gcc.info, Node: Protoize Caveats, Next: Non-bugs, Prev: C++ Misunderstandings, Up: Trouble + + Caveats of using `protoize' + =========================== + + The conversion programs `protoize' and `unprotoize' can sometimes + change a source file in a way that won't work unless you rearrange it. + + * `protoize' can insert references to a type name or type tag before + the definition, or in a file where they are not defined. + + If this happens, compiler error messages should show you where the + new references are, so fixing the file by hand is straightforward. + + * There are some C constructs which `protoize' cannot figure out. + For example, it can't determine argument types for declaring a + pointer-to-function variable; this you must do by hand. `protoize' + inserts a comment containing `???' each time it finds such a + variable; so you can find all such variables by searching for this + string. ISO C does not require declaring the argument types of + pointer-to-function types. + + * Using `unprotoize' can easily introduce bugs. If the program + relied on prototypes to bring about conversion of arguments, these + conversions will not take place in the program without prototypes. + One case in which you can be sure `unprotoize' is safe is when you + are removing prototypes that were made with `protoize'; if the + program worked before without any prototypes, it will work again + without them. + + You can find all the places where this problem might occur by + compiling the program with the `-Wconversion' option. It prints a + warning whenever an argument is converted. + + * Both conversion programs can be confused if there are macro calls + in and around the text to be converted. In other words, the + standard syntax for a declaration or definition must not result + from expanding a macro. This problem is inherent in the design of + C and cannot be fixed. If only a few functions have confusing + macro calls, you can easily convert them manually. + + * `protoize' cannot get the argument types for a function whose + definition was not actually compiled due to preprocessing + conditionals. When this happens, `protoize' changes nothing in + regard to such a function. `protoize' tries to detect such + instances and warn about them. + + You can generally work around this problem by using `protoize' step + by step, each time specifying a different set of `-D' options for + compilation, until all of the functions have been converted. + There is no automatic way to verify that you have got them all, + however. + + * Confusion may result if there is an occasion to convert a function + declaration or definition in a region of source code where there + is more than one formal parameter list present. Thus, attempts to + convert code containing multiple (conditionally compiled) versions + of a single function header (in the same vicinity) may not produce + the desired (or expected) results. + + If you plan on converting source files which contain such code, it + is recommended that you first make sure that each conditionally + compiled region of source code which contains an alternative + function header also contains at least one additional follower + token (past the final right parenthesis of the function header). + This should circumvent the problem. + + * `unprotoize' can become confused when trying to convert a function + definition or declaration which contains a declaration for a + pointer-to-function formal argument which has the same name as the + function being defined or declared. We recommend you avoid such + choices of formal parameter names. + + * You might also want to correct some of the indentation by hand and + break long lines. (The conversion programs don't write lines + longer than eighty characters in any case.) + +  + File: gcc.info, Node: Non-bugs, Next: Warnings and Errors, Prev: Protoize Caveats, Up: Trouble + + Certain Changes We Don't Want to Make + ===================================== + + This section lists changes that people frequently request, but which + we do not make because we think GCC is better without them. + + * Checking the number and type of arguments to a function which has + an old-fashioned definition and no prototype. + + Such a feature would work only occasionally--only for calls that + appear in the same file as the called function, following the + definition. The only way to check all calls reliably is to add a + prototype for the function. But adding a prototype eliminates the + motivation for this feature. So the feature is not worthwhile. + + * Warning about using an expression whose type is signed as a shift + count. + + Shift count operands are probably signed more often than unsigned. + Warning about this would cause far more annoyance than good. + + * Warning about assigning a signed value to an unsigned variable. + + Such assignments must be very common; warning about them would + cause more annoyance than good. + + * Warning when a non-void function value is ignored. + + Coming as I do from a Lisp background, I balk at the idea that + there is something dangerous about discarding a value. There are + functions that return values which some callers may find useful; + it makes no sense to clutter the program with a cast to `void' + whenever the value isn't useful. + + * Making `-fshort-enums' the default. + + This would cause storage layout to be incompatible with most other + C compilers. And it doesn't seem very important, given that you + can get the same result in other ways. The case where it matters + most is when the enumeration-valued object is inside a structure, + and in that case you can specify a field width explicitly. + + * Making bit-fields unsigned by default on particular machines where + "the ABI standard" says to do so. + + The ISO C standard leaves it up to the implementation whether a + bit-field declared plain `int' is signed or not. This in effect + creates two alternative dialects of C. + + The GNU C compiler supports both dialects; you can specify the + signed dialect with `-fsigned-bitfields' and the unsigned dialect + with `-funsigned-bitfields'. However, this leaves open the + question of which dialect to use by default. + + Currently, the preferred dialect makes plain bit-fields signed, + because this is simplest. Since `int' is the same as `signed int' + in every other context, it is cleanest for them to be the same in + bit-fields as well. + + Some computer manufacturers have published Application Binary + Interface standards which specify that plain bit-fields should be + unsigned. It is a mistake, however, to say anything about this + issue in an ABI. This is because the handling of plain bit-fields + distinguishes two dialects of C. Both dialects are meaningful on + every type of machine. Whether a particular object file was + compiled using signed bit-fields or unsigned is of no concern to + other object files, even if they access the same bit-fields in the + same data structures. + + A given program is written in one or the other of these two + dialects. The program stands a chance to work on most any machine + if it is compiled with the proper dialect. It is unlikely to work + at all if compiled with the wrong dialect. + + Many users appreciate the GNU C compiler because it provides an + environment that is uniform across machines. These users would be + inconvenienced if the compiler treated plain bit-fields + differently on certain machines. + + Occasionally users write programs intended only for a particular + machine type. On these occasions, the users would benefit if the + GNU C compiler were to support by default the same dialect as the + other compilers on that machine. But such applications are rare. + And users writing a program to run on more than one type of + machine cannot possibly benefit from this kind of compatibility. + + This is why GCC does and will treat plain bit-fields in the same + fashion on all types of machines (by default). + + There are some arguments for making bit-fields unsigned by default + on all machines. If, for example, this becomes a universal de + facto standard, it would make sense for GCC to go along with it. + This is something to be considered in the future. + + (Of course, users strongly concerned about portability should + indicate explicitly in each bit-field whether it is signed or not. + In this way, they write programs which have the same meaning in + both C dialects.) + + * Undefining `__STDC__' when `-ansi' is not used. + + Currently, GCC defines `__STDC__' as long as you don't use + `-traditional'. This provides good results in practice. + + Programmers normally use conditionals on `__STDC__' to ask whether + it is safe to use certain features of ISO C, such as function + prototypes or ISO token concatenation. Since plain `gcc' supports + all the features of ISO C, the correct answer to these questions is + "yes". + + Some users try to use `__STDC__' to check for the availability of + certain library facilities. This is actually incorrect usage in + an ISO C program, because the ISO C standard says that a conforming + freestanding implementation should define `__STDC__' even though it + does not have the library facilities. `gcc -ansi -pedantic' is a + conforming freestanding implementation, and it is therefore + required to define `__STDC__', even though it does not come with + an ISO C library. + + Sometimes people say that defining `__STDC__' in a compiler that + does not completely conform to the ISO C standard somehow violates + the standard. This is illogical. The standard is a standard for + compilers that claim to support ISO C, such as `gcc -ansi'--not + for other compilers such as plain `gcc'. Whatever the ISO C + standard says is relevant to the design of plain `gcc' without + `-ansi' only for pragmatic reasons, not as a requirement. + + GCC normally defines `__STDC__' to be 1, and in addition defines + `__STRICT_ANSI__' if you specify the `-ansi' option, or a `-std' + option for strict conformance to some version of ISO C. On some + hosts, system include files use a different convention, where + `__STDC__' is normally 0, but is 1 if the user specifies strict + conformance to the C Standard. GCC follows the host convention + when processing system include files, but when processing user + files it follows the usual GNU C convention. + + * Undefining `__STDC__' in C++. + + Programs written to compile with C++-to-C translators get the + value of `__STDC__' that goes with the C compiler that is + subsequently used. These programs must test `__STDC__' to + determine what kind of C preprocessor that compiler uses: whether + they should concatenate tokens in the ISO C fashion or in the + traditional fashion. + + These programs work properly with GNU C++ if `__STDC__' is defined. + They would not work otherwise. + + In addition, many header files are written to provide prototypes + in ISO C but not in traditional C. Many of these header files can + work without change in C++ provided `__STDC__' is defined. If + `__STDC__' is not defined, they will all fail, and will all need + to be changed to test explicitly for C++ as well. + + * Deleting "empty" loops. + + Historically, GCC has not deleted "empty" loops under the + assumption that the most likely reason you would put one in a + program is to have a delay, so deleting them will not make real + programs run any faster. + + However, the rationale here is that optimization of a nonempty loop + cannot produce an empty one, which holds for C but is not always + the case for C++. + + Moreover, with `-funroll-loops' small "empty" loops are already + removed, so the current behavior is both sub-optimal and + inconsistent and will change in the future. + + * Making side effects happen in the same order as in some other + compiler. + + It is never safe to depend on the order of evaluation of side + effects. For example, a function call like this may very well + behave differently from one compiler to another: + + void func (int, int); + + int i = 2; + func (i++, i++); + + There is no guarantee (in either the C or the C++ standard language + definitions) that the increments will be evaluated in any + particular order. Either increment might happen first. `func' + might get the arguments `2, 3', or it might get `3, 2', or even + `2, 2'. + + * Not allowing structures with volatile fields in registers. + + Strictly speaking, there is no prohibition in the ISO C standard + against allowing structures with volatile fields in registers, but + it does not seem to make any sense and is probably not what you + wanted to do. So the compiler will give an error message in this + case. + + * Making certain warnings into errors by default. + + Some ISO C testsuites report failure when the compiler does not + produce an error message for a certain program. + + ISO C requires a "diagnostic" message for certain kinds of invalid + programs, but a warning is defined by GCC to count as a + diagnostic. If GCC produces a warning but not an error, that is + correct ISO C support. If test suites call this "failure", they + should be run with the GCC option `-pedantic-errors', which will + turn these warnings into errors. + + +  + File: gcc.info, Node: Warnings and Errors, Prev: Non-bugs, Up: Trouble + + Warning Messages and Error Messages + =================================== + + The GNU compiler can produce two kinds of diagnostics: errors and + warnings. Each kind has a different purpose: + + "Errors" report problems that make it impossible to compile your + program. GCC reports errors with the source file name and line + number where the problem is apparent. + + "Warnings" report other unusual conditions in your code that _may_ + indicate a problem, although compilation can (and does) proceed. + Warning messages also report the source file name and line number, + but include the text `warning:' to distinguish them from error + messages. + + Warnings may indicate danger points where you should check to make + sure that your program really does what you intend; or the use of + obsolete features; or the use of nonstandard features of GNU C or C++. + Many warnings are issued only if you ask for them, with one of the `-W' + options (for instance, `-Wall' requests a variety of useful warnings). + + GCC always tries to compile your program if possible; it never + gratuitously rejects a program whose meaning is clear merely because + (for instance) it fails to conform to a standard. In some cases, + however, the C and C++ standards specify that certain extensions are + forbidden, and a diagnostic _must_ be issued by a conforming compiler. + The `-pedantic' option tells GCC to issue warnings in such cases; + `-pedantic-errors' says to make them errors instead. This does not + mean that _all_ non-ISO constructs get warnings or errors. + + *Note Options to Request or Suppress Warnings: Warning Options, for + more detail on these and related command-line options. + +  + File: gcc.info, Node: Bugs, Next: Service, Prev: Trouble, Up: Top + + Reporting Bugs + ************** + + Your bug reports play an essential role in making GCC reliable. + + When you encounter a problem, the first thing to do is to see if it + is already known. *Note Trouble::. If it isn't known, then you should + report the problem. + + Reporting a bug may help you by bringing a solution to your problem, + or it may not. (If it does not, look in the service directory; see + *Note Service::.) In any case, the principal function of a bug report + is to help the entire community by making the next version of GCC work + better. Bug reports are your contribution to the maintenance of GCC. + + Since the maintainers are very overloaded, we cannot respond to every + bug report. However, if the bug has not been fixed, we are likely to + send you a patch and ask you to tell us whether it works. + + In order for a bug report to serve its purpose, you must include the + information that makes for fixing the bug. + + * Menu: + + * Criteria: Bug Criteria. Have you really found a bug? + * Where: Bug Lists. Where to send your bug report. + * Reporting: Bug Reporting. How to report a bug effectively. + * GNATS: gccbug. You can use a bug reporting tool. + * Known: Trouble. Known problems. + * Help: Service. Where to ask for help. + +  + File: gcc.info, Node: Bug Criteria, Next: Bug Lists, Up: Bugs + + Have You Found a Bug? + ===================== + + If you are not sure whether you have found a bug, here are some + guidelines: + + * If the compiler gets a fatal signal, for any input whatever, that + is a compiler bug. Reliable compilers never crash. + + * If the compiler produces invalid assembly code, for any input + whatever (except an `asm' statement), that is a compiler bug, + unless the compiler reports errors (not just warnings) which would + ordinarily prevent the assembler from being run. + + * If the compiler produces valid assembly code that does not + correctly execute the input source code, that is a compiler bug. + + However, you must double-check to make sure, because you may have + run into an incompatibility between GNU C and traditional C (*note + Incompatibilities::). These incompatibilities might be considered + bugs, but they are inescapable consequences of valuable features. + + Or you may have a program whose behavior is undefined, which + happened by chance to give the desired results with another C or + C++ compiler. + + For example, in many nonoptimizing compilers, you can write `x;' + at the end of a function instead of `return x;', with the same + results. But the value of the function is undefined if `return' + is omitted; it is not a bug when GCC produces different results. + + Problems often result from expressions with two increment + operators, as in `f (*p++, *p++)'. Your previous compiler might + have interpreted that expression the way you intended; GCC might + interpret it another way. Neither compiler is wrong. The bug is + in your code. + + After you have localized the error to a single source line, it + should be easy to check for these things. If your program is + correct and well defined, you have found a compiler bug. + + * If the compiler produces an error message for valid input, that is + a compiler bug. + + * If the compiler does not produce an error message for invalid + input, that is a compiler bug. However, you should note that your + idea of "invalid input" might be my idea of "an extension" or + "support for traditional practice". + + * If you are an experienced user of one of the languages GCC + supports, your suggestions for improvement of GCC are welcome in + any case. + +  + File: gcc.info, Node: Bug Lists, Next: Bug Reporting, Prev: Bug Criteria, Up: Bugs + + Where to Report Bugs + ==================== + + Send bug reports for the GNU Compiler Collection to + . In accordance with the GNU-wide convention, in + which bug reports for tool "foo" are sent to `bug-foo@gnu.org', the + address may also be used; it will forward to the + address given above. + + Please read `http://gcc.gnu.org/bugs.html' for additional and/or + more up-to-date bug reporting instructions before you post a bug report. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-2 gcc-3.2.3/gcc/doc/gcc.info-2 *** gcc-3.2.2/gcc/doc/gcc.info-2 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-2 Tue Apr 22 07:07:13 2003 *************** *** 0 **** --- 1,811 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: C Dialect Options, Next: C++ Dialect Options, Prev: Invoking G++, Up: Invoking GCC + + Options Controlling C Dialect + ============================= + + The following options control the dialect of C (or languages derived + from C, such as C++ and Objective-C) that the compiler accepts: + + `-ansi' + In C mode, support all ISO C89 programs. In C++ mode, remove GNU + extensions that conflict with ISO C++. + + This turns off certain features of GCC that are incompatible with + ISO C89 (when compiling C code), or of standard C++ (when + compiling C++ code), such as the `asm' and `typeof' keywords, and + predefined macros such as `unix' and `vax' that identify the type + of system you are using. It also enables the undesirable and + rarely used ISO trigraph feature. For the C compiler, it disables + recognition of C++ style `//' comments as well as the `inline' + keyword. + + The alternate keywords `__asm__', `__extension__', `__inline__' + and `__typeof__' continue to work despite `-ansi'. You would not + want to use them in an ISO C program, of course, but it is useful + to put them in header files that might be included in compilations + done with `-ansi'. Alternate predefined macros such as `__unix__' + and `__vax__' are also available, with or without `-ansi'. + + The `-ansi' option does not cause non-ISO programs to be rejected + gratuitously. For that, `-pedantic' is required in addition to + `-ansi'. *Note Warning Options::. + + The macro `__STRICT_ANSI__' is predefined when the `-ansi' option + is used. Some header files may notice this macro and refrain from + declaring certain functions or defining certain macros that the + ISO standard doesn't call for; this is to avoid interfering with + any programs that might use these names for other things. + + Functions which would normally be built in but do not have + semantics defined by ISO C (such as `alloca' and `ffs') are not + built-in functions with `-ansi' is used. *Note Other built-in + functions provided by GCC: Other Builtins, for details of the + functions affected. + + `-std=' + Determine the language standard. This option is currently only + supported when compiling C. A value for this option must be + provided; possible values are + + `c89' + `iso9899:1990' + ISO C89 (same as `-ansi'). + + `iso9899:199409' + ISO C89 as modified in amendment 1. + + `c99' + `c9x' + `iso9899:1999' + `iso9899:199x' + ISO C99. Note that this standard is not yet fully supported; + see `http://gcc.gnu.org/gcc-3.1/c99status.html' for more + information. The names `c9x' and `iso9899:199x' are + deprecated. + + `gnu89' + Default, ISO C89 plus GNU extensions (including some C99 + features). + + `gnu99' + + `gnu9x' + ISO C99 plus GNU extensions. When ISO C99 is fully + implemented in GCC, this will become the default. The name + `gnu9x' is deprecated. + + + Even when this option is not specified, you can still use some of + the features of newer standards in so far as they do not conflict + with previous C standards. For example, you may use + `__restrict__' even when `-std=c99' is not specified. + + The `-std' options specifying some version of ISO C have the same + effects as `-ansi', except that features that were not in ISO C89 + but are in the specified version (for example, `//' comments and + the `inline' keyword in ISO C99) are not disabled. + + *Note Language Standards Supported by GCC: Standards, for details + of these standard versions. + + `-aux-info FILENAME' + Output to the given filename prototyped declarations for all + functions declared and/or defined in a translation unit, including + those in header files. This option is silently ignored in any + language other than C. + + Besides declarations, the file indicates, in comments, the origin + of each declaration (source file and line), whether the + declaration was implicit, prototyped or unprototyped (`I', `N' for + new or `O' for old, respectively, in the first character after the + line number and the colon), and whether it came from a declaration + or a definition (`C' or `F', respectively, in the following + character). In the case of function definitions, a K&R-style list + of arguments followed by their declarations is also provided, + inside comments, after the declaration. + + `-fno-asm' + Do not recognize `asm', `inline' or `typeof' as a keyword, so that + code can use these words as identifiers. You can use the keywords + `__asm__', `__inline__' and `__typeof__' instead. `-ansi' implies + `-fno-asm'. + + In C++, this switch only affects the `typeof' keyword, since `asm' + and `inline' are standard keywords. You may want to use the + `-fno-gnu-keywords' flag instead, which has the same effect. In + C99 mode (`-std=c99' or `-std=gnu99'), this switch only affects + the `asm' and `typeof' keywords, since `inline' is a standard + keyword in ISO C99. + + `-fno-builtin' + `-fno-builtin-FUNCTION (C and Objective-C only)' + Don't recognize built-in functions that do not begin with + `__builtin_' as prefix. *Note Other built-in functions provided + by GCC: Other Builtins, for details of the functions affected, + including those which are not built-in functions when `-ansi' or + `-std' options for strict ISO C conformance are used because they + do not have an ISO standard meaning. + + GCC normally generates special code to handle certain built-in + functions more efficiently; for instance, calls to `alloca' may + become single instructions that adjust the stack directly, and + calls to `memcpy' may become inline copy loops. The resulting + code is often both smaller and faster, but since the function + calls no longer appear as such, you cannot set a breakpoint on + those calls, nor can you change the behavior of the functions by + linking with a different library. + + In C++, `-fno-builtin' is always in effect. The `-fbuiltin' + option has no effect. Therefore, in C++, the only way to get the + optimization benefits of built-in functions is to call the function + using the `__builtin_' prefix. The GNU C++ Standard Library uses + built-in functions to implement many functions (like + `std::strchr'), so that you automatically get efficient code. + + With the `-fno-builtin-FUNCTION' option, not available when + compiling C++, only the built-in function FUNCTION is disabled. + FUNCTION must not begin with `__builtin_'. If a function is named + this is not built-in in this version of GCC, this option is + ignored. There is no corresponding `-fbuiltin-FUNCTION' option; + if you wish to enable built-in functions selectively when using + `-fno-builtin' or `-ffreestanding', you may define macros such as: + + #define abs(n) __builtin_abs ((n)) + #define strcpy(d, s) __builtin_strcpy ((d), (s)) + + `-fhosted' + Assert that compilation takes place in a hosted environment. This + implies `-fbuiltin'. A hosted environment is one in which the + entire standard library is available, and in which `main' has a + return type of `int'. Examples are nearly everything except a + kernel. This is equivalent to `-fno-freestanding'. + + `-ffreestanding' + Assert that compilation takes place in a freestanding environment. + This implies `-fno-builtin'. A freestanding environment is one + in which the standard library may not exist, and program startup + may not necessarily be at `main'. The most obvious example is an + OS kernel. This is equivalent to `-fno-hosted'. + + *Note Language Standards Supported by GCC: Standards, for details + of freestanding and hosted environments. + + `-trigraphs' + Support ISO C trigraphs. The `-ansi' option (and `-std' options + for strict ISO C conformance) implies `-trigraphs'. + + `-no-integrated-cpp' + Invoke the external cpp during compilation. The default is to use + the integrated cpp (internal cpp). This option also allows a + user-supplied cpp via the `-B' option. This flag is applicable in + both C and C++ modes. + + We do not guarantee to retain this option in future, and we may + change its semantics. + + `-traditional' + Attempt to support some aspects of traditional C compilers. + Specifically: + + * All `extern' declarations take effect globally even if they + are written inside of a function definition. This includes + implicit declarations of functions. + + * The newer keywords `typeof', `inline', `signed', `const' and + `volatile' are not recognized. (You can still use the + alternative keywords such as `__typeof__', `__inline__', and + so on.) + + * Comparisons between pointers and integers are always allowed. + + * Integer types `unsigned short' and `unsigned char' promote to + `unsigned int'. + + * Out-of-range floating point literals are not an error. + + * Certain constructs which ISO regards as a single invalid + preprocessing number, such as `0xe-0xd', are treated as + expressions instead. + + * String "constants" are not necessarily constant; they are + stored in writable space, and identical looking constants are + allocated separately. (This is the same as the effect of + `-fwritable-strings'.) + + * All automatic variables not declared `register' are preserved + by `longjmp'. Ordinarily, GNU C follows ISO C: automatic + variables not declared `volatile' may be clobbered. + + * The character escape sequences `\x' and `\a' evaluate as the + literal characters `x' and `a' respectively. Without + `-traditional', `\x' is a prefix for the hexadecimal + representation of a character, and `\a' produces a bell. + + This option is deprecated and may be removed. + + You may wish to use `-fno-builtin' as well as `-traditional' if + your program uses names that are normally GNU C built-in functions + for other purposes of its own. + + You cannot use `-traditional' if you include any header files that + rely on ISO C features. Some vendors are starting to ship systems + with ISO C header files and you cannot use `-traditional' on such + systems to compile files that include any system headers. + + The `-traditional' option also enables `-traditional-cpp'. + + `-traditional-cpp' + Attempt to support some aspects of traditional C preprocessors. + See the GNU CPP manual for details. + + `-fcond-mismatch' + Allow conditional expressions with mismatched types in the second + and third arguments. The value of such an expression is void. + This option is not supported for C++. + + `-funsigned-char' + Let the type `char' be unsigned, like `unsigned char'. + + Each kind of machine has a default for what `char' should be. It + is either like `unsigned char' by default or like `signed char' by + default. + + Ideally, a portable program should always use `signed char' or + `unsigned char' when it depends on the signedness of an object. + But many programs have been written to use plain `char' and expect + it to be signed, or expect it to be unsigned, depending on the + machines they were written for. This option, and its inverse, let + you make such a program work with the opposite default. + + The type `char' is always a distinct type from each of `signed + char' or `unsigned char', even though its behavior is always just + like one of those two. + + `-fsigned-char' + Let the type `char' be signed, like `signed char'. + + Note that this is equivalent to `-fno-unsigned-char', which is the + negative form of `-funsigned-char'. Likewise, the option + `-fno-signed-char' is equivalent to `-funsigned-char'. + + `-fsigned-bitfields' + `-funsigned-bitfields' + `-fno-signed-bitfields' + `-fno-unsigned-bitfields' + These options control whether a bit-field is signed or unsigned, + when the declaration does not use either `signed' or `unsigned'. + By default, such a bit-field is signed, because this is + consistent: the basic integer types such as `int' are signed types. + + However, when `-traditional' is used, bit-fields are all unsigned + no matter what. + + `-fwritable-strings' + Store string constants in the writable data segment and don't + uniquize them. This is for compatibility with old programs which + assume they can write into string constants. The option + `-traditional' also has this effect. + + Writing into string constants is a very bad idea; "constants" + should be constant. + + `-fallow-single-precision' + Do not promote single precision math operations to double + precision, even when compiling with `-traditional'. + + Traditional K&R C promotes all floating point operations to double + precision, regardless of the sizes of the operands. On the + architecture for which you are compiling, single precision may be + faster than double precision. If you must use `-traditional', + but want to use single precision operations when the operands are + single precision, use this option. This option has no effect + when compiling with ISO or GNU C conventions (the default). + +  + File: gcc.info, Node: C++ Dialect Options, Next: Objective-C Dialect Options, Prev: C Dialect Options, Up: Invoking GCC + + Options Controlling C++ Dialect + =============================== + + This section describes the command-line options that are only + meaningful for C++ programs; but you can also use most of the GNU + compiler options regardless of what language your program is in. For + example, you might compile a file `firstClass.C' like this: + + g++ -g -frepo -O -c firstClass.C + + In this example, only `-frepo' is an option meant only for C++ + programs; you can use the other options with any language supported by + GCC. + + Here is a list of options that are _only_ for compiling C++ programs: + + `-fno-access-control' + Turn off all access checking. This switch is mainly useful for + working around bugs in the access control code. + + `-fcheck-new' + Check that the pointer returned by `operator new' is non-null + before attempting to modify the storage allocated. The current + Working Paper requires that `operator new' never return a null + pointer, so this check is normally unnecessary. + + An alternative to using this option is to specify that your + `operator new' does not throw any exceptions; if you declare it + `throw()', G++ will check the return value. See also `new + (nothrow)'. + + `-fconserve-space' + Put uninitialized or runtime-initialized global variables into the + common segment, as C does. This saves space in the executable at + the cost of not diagnosing duplicate definitions. If you compile + with this flag and your program mysteriously crashes after + `main()' has completed, you may have an object that is being + destroyed twice because two definitions were merged. + + This option is no longer useful on most targets, now that support + has been added for putting variables into BSS without making them + common. + + `-fno-const-strings' + Give string constants type `char *' instead of type `const char + *'. By default, G++ uses type `const char *' as required by the + standard. Even if you use `-fno-const-strings', you cannot + actually modify the value of a string constant, unless you also use + `-fwritable-strings'. + + This option might be removed in a future release of G++. For + maximum portability, you should structure your code so that it + works with string constants that have type `const char *'. + + `-fdollars-in-identifiers' + Accept `$' in identifiers. You can also explicitly prohibit use of + `$' with the option `-fno-dollars-in-identifiers'. (GNU C allows + `$' by default on most target systems, but there are a few + exceptions.) Traditional C allowed the character `$' to form part + of identifiers. However, ISO C and C++ forbid `$' in identifiers. + + `-fno-elide-constructors' + The C++ standard allows an implementation to omit creating a + temporary which is only used to initialize another object of the + same type. Specifying this option disables that optimization, and + forces G++ to call the copy constructor in all cases. + + `-fno-enforce-eh-specs' + Don't check for violation of exception specifications at runtime. + This option violates the C++ standard, but may be useful for + reducing code size in production builds, much like defining + `NDEBUG'. The compiler will still optimize based on the exception + specifications. + + `-fexternal-templates' + Cause `#pragma interface' and `implementation' to apply to + template instantiation; template instances are emitted or not + according to the location of the template definition. *Note + Template Instantiation::, for more information. + + This option is deprecated. + + `-falt-external-templates' + Similar to `-fexternal-templates', but template instances are + emitted or not according to the place where they are first + instantiated. *Note Template Instantiation::, for more + information. + + This option is deprecated. + + `-ffor-scope' + `-fno-for-scope' + If `-ffor-scope' is specified, the scope of variables declared in + a for-init-statement is limited to the `for' loop itself, as + specified by the C++ standard. If `-fno-for-scope' is specified, + the scope of variables declared in a for-init-statement extends to + the end of the enclosing scope, as was the case in old versions of + G++, and other (traditional) implementations of C++. + + The default if neither flag is given to follow the standard, but + to allow and give a warning for old-style code that would + otherwise be invalid, or have different behavior. + + `-fno-gnu-keywords' + Do not recognize `typeof' as a keyword, so that code can use this + word as an identifier. You can use the keyword `__typeof__' + instead. `-ansi' implies `-fno-gnu-keywords'. + + `-fno-implicit-templates' + Never emit code for non-inline templates which are instantiated + implicitly (i.e. by use); only emit code for explicit + instantiations. *Note Template Instantiation::, for more + information. + + `-fno-implicit-inline-templates' + Don't emit code for implicit instantiations of inline templates, + either. The default is to handle inlines differently so that + compiles with and without optimization will need the same set of + explicit instantiations. + + `-fno-implement-inlines' + To save space, do not emit out-of-line copies of inline functions + controlled by `#pragma implementation'. This will cause linker + errors if these functions are not inlined everywhere they are + called. + + `-fms-extensions' + Disable pedantic warnings about constructs used in MFC, such as + implicit int and getting a pointer to member function via + non-standard syntax. + + `-fno-nonansi-builtins' + Disable built-in declarations of functions that are not mandated by + ANSI/ISO C. These include `ffs', `alloca', `_exit', `index', + `bzero', `conjf', and other related functions. + + `-fno-operator-names' + Do not treat the operator name keywords `and', `bitand', `bitor', + `compl', `not', `or' and `xor' as synonyms as keywords. + + `-fno-optional-diags' + Disable diagnostics that the standard says a compiler does not + need to issue. Currently, the only such diagnostic issued by G++ + is the one for a name having multiple meanings within a class. + + `-fpermissive' + Downgrade messages about nonconformant code from errors to + warnings. By default, G++ effectively sets `-pedantic-errors' + without `-pedantic'; this option reverses that. This behavior and + this option are superseded by `-pedantic', which works as it does + for GNU C. + + `-frepo' + Enable automatic template instantiation at link time. This option + also implies `-fno-implicit-templates'. *Note Template + Instantiation::, for more information. + + `-fno-rtti' + Disable generation of information about every class with virtual + functions for use by the C++ runtime type identification features + (`dynamic_cast' and `typeid'). If you don't use those parts of + the language, you can save some space by using this flag. Note + that exception handling uses the same information, but it will + generate it as needed. + + `-fstats' + Emit statistics about front-end processing at the end of the + compilation. This information is generally only useful to the G++ + development team. + + `-ftemplate-depth-N' + Set the maximum instantiation depth for template classes to N. A + limit on the template instantiation depth is needed to detect + endless recursions during template class instantiation. ANSI/ISO + C++ conforming programs must not rely on a maximum depth greater + than 17. + + `-fuse-cxa-atexit' + Register destructors for objects with static storage duration with + the `__cxa_atexit' function rather than the `atexit' function. + This option is required for fully standards-compliant handling of + static destructors, but will only work if your C library supports + `__cxa_atexit'. + + `-fvtable-gc' + Emit special relocations for vtables and virtual function + references so that the linker can identify unused virtual + functions and zero out vtable slots that refer to them. This is + most useful with `-ffunction-sections' and `-Wl,--gc-sections', in + order to also discard the functions themselves. + + This optimization requires GNU as and GNU ld. Not all systems + support this option. `-Wl,--gc-sections' is ignored without + `-static'. + + `-fno-weak' + Do not use weak symbol support, even if it is provided by the + linker. By default, G++ will use weak symbols if they are + available. This option exists only for testing, and should not be + used by end-users; it will result in inferior code and has no + benefits. This option may be removed in a future release of G++. + + `-nostdinc++' + Do not search for header files in the standard directories + specific to C++, but do still search the other standard + directories. (This option is used when building the C++ library.) + + In addition, these optimization, warning, and code generation options + have meanings only for C++ programs: + + `-fno-default-inline' + Do not assume `inline' for functions defined inside a class scope. + *Note Options That Control Optimization: Optimize Options. Note + that these functions will have linkage like inline functions; they + just won't be inlined by default. + + `-Wabi (C++ only)' + Warn when G++ generates code that is probably not compatible with + the vendor-neutral C++ ABI. Although an effort has been made to + warn about all such cases, there are probably some cases that are + not warned about, even though G++ is generating incompatible code. + There may also be cases where warnings are emitted even though + the code that is generated will be compatible. + + You should rewrite your code to avoid these warnings if you are + concerned about the fact that code generated by G++ may not be + binary compatible with code generated by other compilers. + + The known incompatibilites at this point include: + + * Incorrect handling of tail-padding for bit-fields. G++ may + attempt to pack data into the same byte as a base class. For + example: + + struct A { virtual void f(); int f1 : 1; }; + struct B : public A { int f2 : 1; }; + + In this case, G++ will place `B::f2' into the same byte + as`A::f1'; other compilers will not. You can avoid this + problem by explicitly padding `A' so that its size is a + multiple of the byte size on your platform; that will cause + G++ and other compilers to layout `B' identically. + + * Incorrect handling of tail-padding for virtual bases. G++ + does not use tail padding when laying out virtual bases. For + example: + + struct A { virtual void f(); char c1; }; + struct B { B(); char c2; }; + struct C : public A, public virtual B {}; + + In this case, G++ will not place `B' into the tail-padding for + `A'; other compilers will. You can avoid this problem by + explicitly padding `A' so that its size is a multiple of its + alignment (ignoring virtual base classes); that will cause + G++ and other compilers to layout `C' identically. + + + `-Wctor-dtor-privacy (C++ only)' + Warn when a class seems unusable, because all the constructors or + destructors in a class are private and the class has no friends or + public static member functions. + + `-Wnon-virtual-dtor (C++ only)' + Warn when a class declares a non-virtual destructor that should + probably be virtual, because it looks like the class will be used + polymorphically. + + `-Wreorder (C++ only)' + Warn when the order of member initializers given in the code does + not match the order in which they must be executed. For instance: + + struct A { + int i; + int j; + A(): j (0), i (1) { } + }; + + Here the compiler will warn that the member initializers for `i' + and `j' will be rearranged to match the declaration order of the + members. + + The following `-W...' options are not affected by `-Wall'. + + `-Weffc++ (C++ only)' + Warn about violations of the following style guidelines from Scott + Meyers' `Effective C++' book: + + * Item 11: Define a copy constructor and an assignment + operator for classes with dynamically allocated memory. + + * Item 12: Prefer initialization to assignment in constructors. + + * Item 14: Make destructors virtual in base classes. + + * Item 15: Have `operator=' return a reference to `*this'. + + * Item 23: Don't try to return a reference when you must + return an object. + + + and about violations of the following style guidelines from Scott + Meyers' `More Effective C++' book: + + * Item 6: Distinguish between prefix and postfix forms of + increment and decrement operators. + + * Item 7: Never overload `&&', `||', or `,'. + + + If you use this option, you should be aware that the standard + library headers do not obey all of these guidelines; you can use + `grep -v' to filter out those warnings. + + `-Wno-deprecated (C++ only)' + Do not warn about usage of deprecated features. *Note Deprecated + Features::. + + `-Wno-non-template-friend (C++ only)' + Disable warnings when non-templatized friend functions are declared + within a template. With the advent of explicit template + specification support in G++, if the name of the friend is an + unqualified-id (i.e., `friend foo(int)'), the C++ language + specification demands that the friend declare or define an + ordinary, nontemplate function. (Section 14.5.3). Before G++ + implemented explicit specification, unqualified-ids could be + interpreted as a particular specialization of a templatized + function. Because this non-conforming behavior is no longer the + default behavior for G++, `-Wnon-template-friend' allows the + compiler to check existing code for potential trouble spots, and + is on by default. This new compiler behavior can be turned off + with `-Wno-non-template-friend' which keeps the conformant + compiler code but disables the helpful warning. + + `-Wold-style-cast (C++ only)' + Warn if an old-style (C-style) cast to a non-void type is used + within a C++ program. The new-style casts (`static_cast', + `reinterpret_cast', and `const_cast') are less vulnerable to + unintended effects, and much easier to grep for. + + `-Woverloaded-virtual (C++ only)' + Warn when a function declaration hides virtual functions from a + base class. For example, in: + + struct A { + virtual void f(); + }; + + struct B: public A { + void f(int); + }; + + the `A' class version of `f' is hidden in `B', and code like this: + + B* b; + b->f(); + + will fail to compile. + + `-Wno-pmf-conversions (C++ only)' + Disable the diagnostic for converting a bound pointer to member + function to a plain pointer. + + `-Wsign-promo (C++ only)' + Warn when overload resolution chooses a promotion from unsigned or + enumeral type to a signed type over a conversion to an unsigned + type of the same size. Previous versions of G++ would try to + preserve unsignedness, but the standard mandates the current + behavior. + + `-Wsynth (C++ only)' + Warn when G++'s synthesis behavior does not match that of cfront. + For instance: + + struct A { + operator int (); + A& operator = (int); + }; + + main () + { + A a,b; + a = b; + } + + In this example, G++ will synthesize a default `A& operator = + (const A&);', while cfront will use the user-defined `operator ='. + +  + File: gcc.info, Node: Objective-C Dialect Options, Next: Language Independent Options, Prev: C++ Dialect Options, Up: Invoking GCC + + Options Controlling Objective-C Dialect + ======================================= + + This section describes the command-line options that are only + meaningful for Objective-C programs; but you can also use most of the + GNU compiler options regardless of what language your program is in. + For example, you might compile a file `some_class.m' like this: + + gcc -g -fgnu-runtime -O -c some_class.m + + In this example, only `-fgnu-runtime' is an option meant only for + Objective-C programs; you can use the other options with any language + supported by GCC. + + Here is a list of options that are _only_ for compiling Objective-C + programs: + + `-fconstant-string-class=CLASS-NAME' + Use CLASS-NAME as the name of the class to instantiate for each + literal string specified with the syntax `@"..."'. The default + class name is `NXConstantString'. + + `-fgnu-runtime' + Generate object code compatible with the standard GNU Objective-C + runtime. This is the default for most types of systems. + + `-fnext-runtime' + Generate output compatible with the NeXT runtime. This is the + default for NeXT-based systems, including Darwin and Mac OS X. + + `-gen-decls' + Dump interface declarations for all classes seen in the source + file to a file named `SOURCENAME.decl'. + + `-Wno-protocol' + Do not warn if methods required by a protocol are not implemented + in the class adopting it. + + `-Wselector' + Warn if a selector has multiple methods of different types defined. + + +  + File: gcc.info, Node: Language Independent Options, Next: Warning Options, Prev: Objective-C Dialect Options, Up: Invoking GCC + + Options to Control Diagnostic Messages Formatting + ================================================= + + Traditionally, diagnostic messages have been formatted irrespective + of the output device's aspect (e.g. its width, ...). The options + described below can be used to control the diagnostic messages + formatting algorithm, e.g. how many characters per line, how often + source location information should be reported. Right now, only the + C++ front end can honor these options. However it is expected, in the + near future, that the remaining front ends would be able to digest them + correctly. + + `-fmessage-length=N' + Try to format error messages so that they fit on lines of about N + characters. The default is 72 characters for `g++' and 0 for the + rest of the front ends supported by GCC. If N is zero, then no + line-wrapping will be done; each error message will appear on a + single line. + + `-fdiagnostics-show-location=once' + Only meaningful in line-wrapping mode. Instructs the diagnostic + messages reporter to emit _once_ source location information; that + is, in case the message is too long to fit on a single physical + line and has to be wrapped, the source location won't be emitted + (as prefix) again, over and over, in subsequent continuation + lines. This is the default behavior. + + `-fdiagnostics-show-location=every-line' + Only meaningful in line-wrapping mode. Instructs the diagnostic + messages reporter to emit the same source location information (as + prefix) for physical lines that result from the process of breaking + a message which is too long to fit on a single line. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-20 gcc-3.2.3/gcc/doc/gcc.info-20 *** gcc-3.2.2/gcc/doc/gcc.info-20 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-20 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1063 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Bug Reporting, Next: gccbug, Prev: Bug Lists, Up: Bugs + + How to Report Bugs + ================== + + The fundamental principle of reporting bugs usefully is this: + *report all the facts*. If you are not sure whether to state a fact or + leave it out, state it! + + Often people omit facts because they think they know what causes the + problem and they conclude that some details don't matter. Thus, you + might assume that the name of the variable you use in an example does + not matter. Well, probably it doesn't, but one cannot be sure. + Perhaps the bug is a stray memory reference which happens to fetch from + the location where that name is stored in memory; perhaps, if the name + were different, the contents of that location would fool the compiler + into doing the right thing despite the bug. Play it safe and give a + specific, complete example. That is the easiest thing for you to do, + and the most helpful. + + Keep in mind that the purpose of a bug report is to enable someone to + fix the bug if it is not known. It isn't very important what happens if + the bug is already known. Therefore, always write your bug reports on + the assumption that the bug is not known. + + Sometimes people give a few sketchy facts and ask, "Does this ring a + bell?" This cannot help us fix a bug, so it is basically useless. We + respond by asking for enough details to enable us to investigate. You + might as well expedite matters by sending them to begin with. + + Try to make your bug report self-contained. If we have to ask you + for more information, it is best if you include all the previous + information in your response, as well as the information that was + missing. + + Please report each bug in a separate message. This makes it easier + for us to track which bugs have been fixed and to forward your bugs + reports to the appropriate maintainer. + + To enable someone to investigate the bug, you should include all + these things: + + * The version of GCC. You can get this by running it with the `-v' + option. + + Without this, we won't know whether there is any point in looking + for the bug in the current version of GCC. + + * A complete input file that will reproduce the bug. If the bug is + in the C preprocessor, send a source file and any header files + that it requires. If the bug is in the compiler proper (`cc1'), + send the preprocessor output generated by adding `-save-temps' to + the compilation command (*note Debugging Options::). When you do + this, use the same `-I', `-D' or `-U' options that you used in + actual compilation. Then send the INPUT.i or INPUT.ii files + generated. + + A single statement is not enough of an example. In order to + compile it, it must be embedded in a complete file of compiler + input; and the bug might depend on the details of how this is done. + + Without a real example one can compile, all anyone can do about + your bug report is wish you luck. It would be futile to try to + guess how to provoke the bug. For example, bugs in register + allocation and reloading frequently depend on every little detail + of the function they happen in. + + Even if the input file that fails comes from a GNU program, you + should still send the complete test case. Don't ask the GCC + maintainers to do the extra work of obtaining the program in + question--they are all overworked as it is. Also, the problem may + depend on what is in the header files on your system; it is + unreliable for the GCC maintainers to try the problem with the + header files available to them. By sending CPP output, you can + eliminate this source of uncertainty and save us a certain + percentage of wild goose chases. + + * The command arguments you gave GCC to compile that example and + observe the bug. For example, did you use `-O'? To guarantee you + won't omit something important, list all the options. + + If we were to try to guess the arguments, we would probably guess + wrong and then we would not encounter the bug. + + * The type of machine you are using, and the operating system name + and version number. + + * The operands you gave to the `configure' command when you installed + the compiler. + + * A complete list of any modifications you have made to the compiler + source. (We don't promise to investigate the bug unless it + happens in an unmodified compiler. But if you've made + modifications and don't tell us, then you are sending us on a wild + goose chase.) + + Be precise about these changes. A description in English is not + enough--send a context diff for them. + + Adding files of your own (such as a machine description for a + machine we don't support) is a modification of the compiler source. + + * Details of any other deviations from the standard procedure for + installing GCC. + + * A description of what behavior you observe that you believe is + incorrect. For example, "The compiler gets a fatal signal," or, + "The assembler instruction at line 208 in the output is incorrect." + + Of course, if the bug is that the compiler gets a fatal signal, + then one can't miss it. But if the bug is incorrect output, the + maintainer might not notice unless it is glaringly wrong. None of + us has time to study all the assembler code from a 50-line C + program just on the chance that one instruction might be wrong. + We need _you_ to do this part! + + Even if the problem you experience is a fatal signal, you should + still say so explicitly. Suppose something strange is going on, + such as, your copy of the compiler is out of synch, or you have + encountered a bug in the C library on your system. (This has + happened!) Your copy might crash and the copy here would not. If + you said to expect a crash, then when the compiler here fails to + crash, we would know that the bug was not happening. If you don't + say to expect a crash, then we would not know whether the bug was + happening. We would not be able to draw any conclusion from our + observations. + + If the problem is a diagnostic when compiling GCC with some other + compiler, say whether it is a warning or an error. + + Often the observed symptom is incorrect output when your program + is run. Sad to say, this is not enough information unless the + program is short and simple. None of us has time to study a large + program to figure out how it would work if compiled correctly, + much less which line of it was compiled wrong. So you will have + to do that. Tell us which source line it is, and what incorrect + result happens when that line is executed. A person who + understands the program can find this as easily as finding a bug + in the program itself. + + * If you send examples of assembler code output from GCC, please use + `-g' when you make them. The debugging information includes + source line numbers which are essential for correlating the output + with the input. + + * If you wish to mention something in the GCC source, refer to it by + context, not by line number. + + The line numbers in the development sources don't match those in + your sources. Your line numbers would convey no useful + information to the maintainers. + + * Additional information from a debugger might enable someone to + find a problem on a machine which he does not have available. + However, you need to think when you collect this information if + you want it to have any chance of being useful. + + For example, many people send just a backtrace, but that is never + useful by itself. A simple backtrace with arguments conveys little + about GCC because the compiler is largely data-driven; the same + functions are called over and over for different RTL insns, doing + different things depending on the details of the insn. + + Most of the arguments listed in the backtrace are useless because + they are pointers to RTL list structure. The numeric values of the + pointers, which the debugger prints in the backtrace, have no + significance whatever; all that matters is the contents of the + objects they point to (and most of the contents are other such + pointers). + + In addition, most compiler passes consist of one or more loops that + scan the RTL insn sequence. The most vital piece of information + about such a loop--which insn it has reached--is usually in a + local variable, not in an argument. + + What you need to provide in addition to a backtrace are the values + of the local variables for several stack frames up. When a local + variable or an argument is an RTX, first print its value and then + use the GDB command `pr' to print the RTL expression that it points + to. (If GDB doesn't run on your machine, use your debugger to call + the function `debug_rtx' with the RTX as an argument.) In + general, whenever a variable is a pointer, its value is no use + without the data it points to. + + Here are some things that are not necessary: + + * A description of the envelope of the bug. + + Often people who encounter a bug spend a lot of time investigating + which changes to the input file will make the bug go away and which + changes will not affect it. + + This is often time consuming and not very useful, because the way + we will find the bug is by running a single example under the + debugger with breakpoints, not by pure deduction from a series of + examples. You might as well save your time for something else. + + Of course, if you can find a simpler example to report _instead_ of + the original one, that is a convenience. Errors in the output + will be easier to spot, running under the debugger will take less + time, etc. Most GCC bugs involve just one function, so the most + straightforward way to simplify an example is to delete all the + function definitions except the one where the bug occurs. Those + earlier in the file may be replaced by external declarations if + the crucial function depends on them. (Exception: inline + functions may affect compilation of functions defined later in the + file.) + + However, simplification is not vital; if you don't want to do this, + report the bug anyway and send the entire test case you used. + + * In particular, some people insert conditionals `#ifdef BUG' around + a statement which, if removed, makes the bug not happen. These + are just clutter; we won't pay any attention to them anyway. + Besides, you should send us cpp output, and that can't have + conditionals. + + * A patch for the bug. + + A patch for the bug is useful if it is a good one. But don't omit + the necessary information, such as the test case, on the + assumption that a patch is all we need. We might see problems + with your patch and decide to fix the problem another way, or we + might not understand it at all. + + Sometimes with a program as complicated as GCC it is very hard to + construct an example that will make the program follow a certain + path through the code. If you don't send the example, we won't be + able to construct one, so we won't be able to verify that the bug + is fixed. + + And if we can't understand what bug you are trying to fix, or why + your patch should be an improvement, we won't install it. A test + case will help us to understand. + + See `http://gcc.gnu.org/contribute.html' for guidelines on how to + make it easy for us to understand and install your patches. + + * A guess about what the bug is or what it depends on. + + Such guesses are usually wrong. Even I can't guess right about + such things without first using the debugger to find the facts. + + * A core dump file. + + We have no way of examining a core dump for your type of machine + unless we have an identical system--and if we do have one, we + should be able to reproduce the crash ourselves. + +  + File: gcc.info, Node: gccbug, Prev: Bug Reporting, Up: Bugs + + The gccbug script + ================= + + To simplify creation of bug reports, and to allow better tracking of + reports, we use the GNATS bug tracking system. Part of that system is + the `gccbug' script. This is a Unix shell script, so you need a shell + to run it. It is normally installed in the same directory where `gcc' + is installed. + + The gccbug script is derived from send-pr, *note Creating new + Problem Reports: (send-pr)using send-pr.. When invoked, it starts a + text editor so you can fill out the various fields of the report. When + the you quit the editor, the report is automatically send to the bug + reporting address. + + A number of fields in this bug report form are specific to GCC, and + are explained at `http://gcc.gnu.org/gnats.html'. + +  + File: gcc.info, Node: Service, Next: Contributing, Prev: Bugs, Up: Top + + How To Get Help with GCC + ************************ + + If you need help installing, using or changing GCC, there are two + ways to find it: + + * Send a message to a suitable network mailing list. First try + (for help installing or using GCC), and if + that brings no response, try . For help changing + GCC, ask . If you think you have found a bug in + GCC, please report it following the instructions at *note Bug + Reporting::. + + * Look in the service directory for someone who might help you for a + fee. The service directory is found at + `http://www.gnu.org/prep/service.html'. + +  + File: gcc.info, Node: Contributing, Next: VMS, Prev: Service, Up: Top + + Contributing to GCC Development + ******************************* + + If you would like to help pretest GCC releases to assure they work + well, our current development sources are available by CVS (see + `http://gcc.gnu.org/cvs.html'). Source and binary snapshots are also + available for FTP; see `http://gcc.gnu.org/snapshots.html'. + + If you would like to work on improvements to GCC, please read the + advice at these URLs: + + `http://gcc.gnu.org/contribute.html' + `http://gcc.gnu.org/contributewhy.html' + + for information on how to make useful contributions and avoid + duplication of effort. Suggested projects are listed at + `http://gcc.gnu.org/projects/'. + +  + File: gcc.info, Node: VMS, Next: Funding, Prev: Contributing, Up: Top + + Using GCC on VMS + **************** + + Here is how to use GCC on VMS. + + * Menu: + + * Include Files and VMS:: Where the preprocessor looks for the include files. + * Global Declarations:: How to do globaldef, globalref and globalvalue with + GCC. + * VMS Misc:: Misc information. + +  + File: gcc.info, Node: Include Files and VMS, Next: Global Declarations, Up: VMS + + Include Files and VMS + ===================== + + Due to the differences between the filesystems of Unix and VMS, GCC + attempts to translate file names in `#include' into names that VMS will + understand. The basic strategy is to prepend a prefix to the + specification of the include file, convert the whole filename to a VMS + filename, and then try to open the file. GCC tries various prefixes + one by one until one of them succeeds: + + 1. The first prefix is the `GNU_CC_INCLUDE:' logical name: this is + where GNU C header files are traditionally stored. If you wish to + store header files in non-standard locations, then you can assign + the logical `GNU_CC_INCLUDE' to be a search list, where each + element of the list is suitable for use with a rooted logical. + + 2. The next prefix tried is `SYS$SYSROOT:[SYSLIB.]'. This is where + VAX-C header files are traditionally stored. + + 3. If the include file specification by itself is a valid VMS + filename, the preprocessor then uses this name with no prefix in + an attempt to open the include file. + + 4. If the file specification is not a valid VMS filename (i.e. does + not contain a device or a directory specifier, and contains a `/' + character), the preprocessor tries to convert it from Unix syntax + to VMS syntax. + + Conversion works like this: the first directory name becomes a + device, and the rest of the directories are converted into + VMS-format directory names. For example, the name `X11/foobar.h' + is translated to `X11:[000000]foobar.h' or `X11:foobar.h', + whichever one can be opened. This strategy allows you to assign a + logical name to point to the actual location of the header files. + + 5. If none of these strategies succeeds, the `#include' fails. + + Include directives of the form: + + #include foobar + + are a common source of incompatibility between VAX-C and GCC. VAX-C + treats this much like a standard `#include ' directive. That + is incompatible with the ISO C behavior implemented by GCC: to expand + the name `foobar' as a macro. Macro expansion should eventually yield + one of the two standard formats for `#include': + + #include "FILE" + #include + + If you have this problem, the best solution is to modify the source + to convert the `#include' directives to one of the two standard forms. + That will work with either compiler. If you want a quick and dirty fix, + define the file names as macros with the proper expansion, like this: + + #define stdio + + This will work, as long as the name doesn't conflict with anything else + in the program. + + Another source of incompatibility is that VAX-C assumes that: + + #include "foobar" + + is actually asking for the file `foobar.h'. GCC does not make this + assumption, and instead takes what you ask for literally; it tries to + read the file `foobar'. The best way to avoid this problem is to + always specify the desired file extension in your include directives. + + GCC for VMS is distributed with a set of include files that is + sufficient to compile most general purpose programs. Even though the + GCC distribution does not contain header files to define constants and + structures for some VMS system-specific functions, there is no reason + why you cannot use GCC with any of these functions. You first may have + to generate or create header files, either by using the public domain + utility `UNSDL' (which can be found on a DECUS tape), or by extracting + the relevant modules from one of the system macro libraries, and using + an editor to construct a C header file. + + A `#include' file name cannot contain a DECNET node name. The + preprocessor reports an I/O error if you attempt to use a node name, + whether explicitly, or implicitly via a logical name. + +  + File: gcc.info, Node: Global Declarations, Next: VMS Misc, Prev: Include Files and VMS, Up: VMS + + Global Declarations and VMS + =========================== + + GCC does not provide the `globalref', `globaldef' and `globalvalue' + keywords of VAX-C. You can get the same effect with an obscure feature + of GAS, the GNU assembler. (This requires GAS version 1.39 or later.) + The following macros allow you to use this feature in a fairly natural + way: + + #ifdef __GNUC__ + #define GLOBALREF(TYPE,NAME) \ + TYPE NAME \ + asm ("_$$PsectAttributes_GLOBALSYMBOL$$" #NAME) + #define GLOBALDEF(TYPE,NAME,VALUE) \ + TYPE NAME \ + asm ("_$$PsectAttributes_GLOBALSYMBOL$$" #NAME) \ + = VALUE + #define GLOBALVALUEREF(TYPE,NAME) \ + const TYPE NAME[1] \ + asm ("_$$PsectAttributes_GLOBALVALUE$$" #NAME) + #define GLOBALVALUEDEF(TYPE,NAME,VALUE) \ + const TYPE NAME[1] \ + asm ("_$$PsectAttributes_GLOBALVALUE$$" #NAME) \ + = {VALUE} + #else + #define GLOBALREF(TYPE,NAME) \ + globalref TYPE NAME + #define GLOBALDEF(TYPE,NAME,VALUE) \ + globaldef TYPE NAME = VALUE + #define GLOBALVALUEDEF(TYPE,NAME,VALUE) \ + globalvalue TYPE NAME = VALUE + #define GLOBALVALUEREF(TYPE,NAME) \ + globalvalue TYPE NAME + #endif + + (The `_$$PsectAttributes_GLOBALSYMBOL' prefix at the start of the name + is removed by the assembler, after it has modified the attributes of + the symbol). These macros are provided in the VMS binaries + distribution in a header file `GNU_HACKS.H'. An example of the usage + is: + + GLOBALREF (int, ijk); + GLOBALDEF (int, jkl, 0); + + The macros `GLOBALREF' and `GLOBALDEF' cannot be used + straightforwardly for arrays, since there is no way to insert the array + dimension into the declaration at the right place. However, you can + declare an array with these macros if you first define a typedef for the + array type, like this: + + typedef int intvector[10]; + GLOBALREF (intvector, foo); + + Array and structure initializers will also break the macros; you can + define the initializer to be a macro of its own, or you can expand the + `GLOBALDEF' macro by hand. You may find a case where you wish to use + the `GLOBALDEF' macro with a large array, but you are not interested in + explicitly initializing each element of the array. In such cases you + can use an initializer like: `{0,}', which will initialize the entire + array to `0'. + + A shortcoming of this implementation is that a variable declared with + `GLOBALVALUEREF' or `GLOBALVALUEDEF' is always an array. For example, + the declaration: + + GLOBALVALUEREF(int, ijk); + + declares the variable `ijk' as an array of type `int [1]'. This is + done because a globalvalue is actually a constant; its "value" is what + the linker would normally consider an address. That is not how an + integer value works in C, but it is how an array works. So treating + the symbol as an array name gives consistent results--with the + exception that the value seems to have the wrong type. *Don't try to + access an element of the array.* It doesn't have any elements. The + array "address" may not be the address of actual storage. + + The fact that the symbol is an array may lead to warnings where the + variable is used. Insert type casts to avoid the warnings. Here is an + example; it takes advantage of the ISO C feature allowing macros that + expand to use the same name as the macro itself. + + GLOBALVALUEREF (int, ss$_normal); + GLOBALVALUEDEF (int, xyzzy,123); + #ifdef __GNUC__ + #define ss$_normal ((int) ss$_normal) + #define xyzzy ((int) xyzzy) + #endif + + Don't use `globaldef' or `globalref' with a variable whose type is + an enumeration type; this is not implemented. Instead, make the + variable an integer, and use a `globalvaluedef' for each of the + enumeration values. An example of this would be: + + #ifdef __GNUC__ + GLOBALDEF (int, color, 0); + GLOBALVALUEDEF (int, RED, 0); + GLOBALVALUEDEF (int, BLUE, 1); + GLOBALVALUEDEF (int, GREEN, 3); + #else + enum globaldef color {RED, BLUE, GREEN = 3}; + #endif + +  + File: gcc.info, Node: VMS Misc, Prev: Global Declarations, Up: VMS + + Other VMS Issues + ================ + + GCC automatically arranges for `main' to return 1 by default if you + fail to specify an explicit return value. This will be interpreted by + VMS as a status code indicating a normal successful completion. + Version 1 of GCC did not provide this default. + + GCC on VMS works only with the GNU assembler, GAS. You need version + 1.37 or later of GAS in order to produce value debugging information for + the VMS debugger. Use the ordinary VMS linker with the object files + produced by GAS. + + Under previous versions of GCC, the generated code would occasionally + give strange results when linked to the sharable `VAXCRTL' library. + Now this should work. + + A caveat for use of `const' global variables: the `const' modifier + must be specified in every external declaration of the variable in all + of the source files that use that variable. Otherwise the linker will + issue warnings about conflicting attributes for the variable. Your + program will still work despite the warnings, but the variable will be + placed in writable storage. + + Although the VMS linker does distinguish between upper and lower case + letters in global symbols, most VMS compilers convert all such symbols + into upper case and most run-time library routines also have upper case + names. To be able to reliably call such routines, GCC (by means of the + assembler GAS) converts global symbols into upper case like other VMS + compilers. However, since the usual practice in C is to distinguish + case, GCC (via GAS) tries to preserve usual C behavior by augmenting + each name that is not all lower case. This means truncating the name + to at most 23 characters and then adding more characters at the end + which encode the case pattern of those 23. Names which contain at + least one dollar sign are an exception; they are converted directly into + upper case without augmentation. + + Name augmentation yields bad results for programs that use + precompiled libraries (such as Xlib) which were generated by another + compiler. You can use the compiler option `/NOCASE_HACK' to inhibit + augmentation; it makes external C functions and variables + case-independent as is usual on VMS. Alternatively, you could write + all references to the functions and variables in such libraries using + lower case; this will work on VMS, but is not portable to other + systems. The compiler option `/NAMES' also provides control over + global name handling. + + Function and variable names are handled somewhat differently with + G++. The GNU C++ compiler performs "name mangling" on function names, + which means that it adds information to the function name to describe + the data types of the arguments that the function takes. One result of + this is that the name of a function can become very long. Since the + VMS linker only recognizes the first 31 characters in a name, special + action is taken to ensure that each function and variable has a unique + name that can be represented in 31 characters. + + If the name (plus a name augmentation, if required) is less than 32 + characters in length, then no special action is performed. If the name + is longer than 31 characters, the assembler (GAS) will generate a hash + string based upon the function name, truncate the function name to 23 + characters, and append the hash string to the truncated name. If the + `/VERBOSE' compiler option is used, the assembler will print both the + full and truncated names of each symbol that is truncated. + + The `/NOCASE_HACK' compiler option should not be used when you are + compiling programs that use libg++. libg++ has several instances of + objects (i.e. `Filebuf' and `filebuf') which become indistinguishable + in a case-insensitive environment. This leads to cases where you need + to inhibit augmentation selectively (if you were using libg++ and Xlib + in the same program, for example). There is no special feature for + doing this, but you can get the result by defining a macro for each + mixed case symbol for which you wish to inhibit augmentation. The + macro should expand into the lower case equivalent of itself. For + example: + + #define StuDlyCapS studlycaps + + These macro definitions can be placed in a header file to minimize + the number of changes to your source code. + +  + File: gcc.info, Node: Funding, Next: GNU Project, Prev: VMS, Up: Top + + Funding Free Software + ********************* + + If you want to have more free software a few years from now, it makes + sense for you to help encourage people to contribute funds for its + development. The most effective approach known is to encourage + commercial redistributors to donate. + + Users of free software systems can boost the pace of development by + encouraging for-a-fee distributors to donate part of their selling price + to free software developers--the Free Software Foundation, and others. + + The way to convince distributors to do this is to demand it and + expect it from them. So when you compare distributors, judge them + partly by how much they give to free software development. Show + distributors they must compete to be the one who gives the most. + + To make this approach work, you must insist on numbers that you can + compare, such as, "We will donate ten dollars to the Frobnitz project + for each disk sold." Don't be satisfied with a vague promise, such as + "A portion of the profits are donated," since it doesn't give a basis + for comparison. + + Even a precise fraction "of the profits from this disk" is not very + meaningful, since creative accounting and unrelated business decisions + can greatly alter what fraction of the sales price counts as profit. + If the price you pay is $50, ten percent of the profit is probably less + than a dollar; it might be a few cents, or nothing at all. + + Some redistributors do development work themselves. This is useful + too; but to keep everyone honest, you need to inquire how much they do, + and what kind. Some kinds of development make much more long-term + difference than others. For example, maintaining a separate version of + a program contributes very little; maintaining the standard version of a + program for the whole community contributes much. Easy new ports + contribute little, since someone else would surely do them; difficult + ports such as adding a new CPU to the GNU Compiler Collection + contribute more; major new features or packages contribute the most. + + By establishing the idea that supporting further development is "the + proper thing to do" when distributing free software for a fee, we can + assure a steady flow of resources into making more free software. + + Copyright (C) 1994 Free Software Foundation, Inc. + Verbatim copying and redistribution of this section is permitted + without royalty; alteration is not permitted. + +  + File: gcc.info, Node: GNU Project, Next: Copying, Prev: Funding, Up: Top + + The GNU Project and GNU/Linux + ***************************** + + The GNU Project was launched in 1984 to develop a complete Unix-like + operating system which is free software: the GNU system. (GNU is a + recursive acronym for "GNU's Not Unix"; it is pronounced "guh-NEW".) + Variants of the GNU operating system, which use the kernel Linux, are + now widely used; though these systems are often referred to as "Linux", + they are more accurately called GNU/Linux systems. + + For more information, see: + `http://www.gnu.org/' + `http://www.gnu.org/gnu/linux-and-gnu.html' + +  + File: gcc.info, Node: Copying, Next: GNU Free Documentation License, Prev: GNU Project, Up: Top + + GNU GENERAL PUBLIC LICENSE + ************************** + + Version 2, June 1991 + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + ======== + + The licenses for most software are designed to take away your + freedom to share and change it. By contrast, the GNU General Public + License is intended to guarantee your freedom to share and change free + software--to make sure the software is free for all its users. This + General Public License applies to most of the Free Software + Foundation's software and to any other program whose authors commit to + using it. (Some other Free Software Foundation software is covered by + the GNU Library General Public License instead.) You can apply it to + your programs, too. + + When we speak of free software, we are referring to freedom, not + price. Our General Public Licenses are designed to make sure that you + have the freedom to distribute copies of free software (and charge for + this service if you wish), that you receive source code or can get it + if you want it, that you can change the software or use pieces of it in + new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid + anyone to deny you these rights or to ask you to surrender the rights. + These restrictions translate to certain responsibilities for you if you + distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether + gratis or for a fee, you must give the recipients all the rights that + you have. You must make sure that they, too, receive or can get the + source code. And you must show them these terms so they know their + rights. + + We protect your rights with two steps: (1) copyright the software, + and (2) offer you this license which gives you legal permission to copy, + distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain + that everyone understands that there is no warranty for this free + software. If the software is modified by someone else and passed on, we + want its recipients to know that what they have is not the original, so + that any problems introduced by others will not reflect on the original + authors' reputations. + + Finally, any free program is threatened constantly by software + patents. We wish to avoid the danger that redistributors of a free + program will individually obtain patent licenses, in effect making the + program proprietary. To prevent this, we have made it clear that any + patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and + modification follow. + + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + 0. This License applies to any program or other work which contains a + notice placed by the copyright holder saying it may be distributed + under the terms of this General Public License. The "Program", + below, refers to any such program or work, and a "work based on + the Program" means either the Program or any derivative work under + copyright law: that is to say, a work containing the Program or a + portion of it, either verbatim or with modifications and/or + translated into another language. (Hereinafter, translation is + included without limitation in the term "modification".) Each + licensee is addressed as "you". + + Activities other than copying, distribution and modification are + not covered by this License; they are outside its scope. The act + of running the Program is not restricted, and the output from the + Program is covered only if its contents constitute a work based on + the Program (independent of having been made by running the + Program). Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's + source code as you receive it, in any medium, provided that you + conspicuously and appropriately publish on each copy an appropriate + copyright notice and disclaimer of warranty; keep intact all the + notices that refer to this License and to the absence of any + warranty; and give any other recipients of the Program a copy of + this License along with the Program. + + You may charge a fee for the physical act of transferring a copy, + and you may at your option offer warranty protection in exchange + for a fee. + + 2. You may modify your copy or copies of the Program or any portion + of it, thus forming a work based on the Program, and copy and + distribute such modifications or work under the terms of Section 1 + above, provided that you also meet all of these conditions: + + a. You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b. You must cause any work that you distribute or publish, that + in whole or in part contains or is derived from the Program + or any part thereof, to be licensed as a whole at no charge + to all third parties under the terms of this License. + + c. If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display + an announcement including an appropriate copyright notice and + a notice that there is no warranty (or else, saying that you + provide a warranty) and that users may redistribute the + program under these conditions, and telling the user how to + view a copy of this License. (Exception: if the Program + itself is interactive but does not normally print such an + announcement, your work based on the Program is not required + to print an announcement.) + + These requirements apply to the modified work as a whole. If + identifiable sections of that work are not derived from the + Program, and can be reasonably considered independent and separate + works in themselves, then this License, and its terms, do not + apply to those sections when you distribute them as separate + works. But when you distribute the same sections as part of a + whole which is a work based on the Program, the distribution of + the whole must be on the terms of this License, whose permissions + for other licensees extend to the entire whole, and thus to each + and every part regardless of who wrote it. + + Thus, it is not the intent of this section to claim rights or + contest your rights to work written entirely by you; rather, the + intent is to exercise the right to control the distribution of + derivative or collective works based on the Program. + + In addition, mere aggregation of another work not based on the + Program with the Program (or with a work based on the Program) on + a volume of a storage or distribution medium does not bring the + other work under the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, + under Section 2) in object code or executable form under the terms + of Sections 1 and 2 above provided that you also do one of the + following: + + a. Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of + Sections 1 and 2 above on a medium customarily used for + software interchange; or, + + b. Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a + medium customarily used for software interchange; or, + + c. Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with + such an offer, in accord with Subsection b above.) + + The source code for a work means the preferred form of the work for + making modifications to it. For an executable work, complete + source code means all the source code for all modules it contains, + plus any associated interface definition files, plus the scripts + used to control compilation and installation of the executable. + However, as a special exception, the source code distributed need + not include anything that is normally distributed (in either + source or binary form) with the major components (compiler, + kernel, and so on) of the operating system on which the executable + runs, unless that component itself accompanies the executable. + + If distribution of executable or object code is made by offering + access to copy from a designated place, then offering equivalent + access to copy the source code from the same place counts as + distribution of the source code, even though third parties are not + compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program + except as expressly provided under this License. Any attempt + otherwise to copy, modify, sublicense or distribute the Program is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 5. You are not required to accept this License, since you have not + signed it. However, nothing else grants you permission to modify + or distribute the Program or its derivative works. These actions + are prohibited by law if you do not accept this License. + Therefore, by modifying or distributing the Program (or any work + based on the Program), you indicate your acceptance of this + License to do so, and all its terms and conditions for copying, + distributing or modifying the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the + Program), the recipient automatically receives a license from the + original licensor to copy, distribute or modify the Program + subject to these terms and conditions. You may not impose any + further restrictions on the recipients' exercise of the rights + granted herein. You are not responsible for enforcing compliance + by third parties to this License. + + 7. If, as a consequence of a court judgment or allegation of patent + infringement or for any other reason (not limited to patent + issues), conditions are imposed on you (whether by court order, + agreement or otherwise) that contradict the conditions of this + License, they do not excuse you from the conditions of this + License. If you cannot distribute so as to satisfy simultaneously + your obligations under this License and any other pertinent + obligations, then as a consequence you may not distribute the + Program at all. For example, if a patent license would not permit + royalty-free redistribution of the Program by all those who + receive copies directly or indirectly through you, then the only + way you could satisfy both it and this License would be to refrain + entirely from distribution of the Program. + + If any portion of this section is held invalid or unenforceable + under any particular circumstance, the balance of the section is + intended to apply and the section as a whole is intended to apply + in other circumstances. + + It is not the purpose of this section to induce you to infringe any + patents or other property right claims or to contest validity of + any such claims; this section has the sole purpose of protecting + the integrity of the free software distribution system, which is + implemented by public license practices. Many people have made + generous contributions to the wide range of software distributed + through that system in reliance on consistent application of that + system; it is up to the author/donor to decide if he or she is + willing to distribute software through any other system and a + licensee cannot impose that choice. + + This section is intended to make thoroughly clear what is believed + to be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in + certain countries either by patents or by copyrighted interfaces, + the original copyright holder who places the Program under this + License may add an explicit geographical distribution limitation + excluding those countries, so that distribution is permitted only + in or among countries not thus excluded. In such case, this + License incorporates the limitation as if written in the body of + this License. + + 9. The Free Software Foundation may publish revised and/or new + versions of the General Public License from time to time. Such + new versions will be similar in spirit to the present version, but + may differ in detail to address new problems or concerns. + + Each version is given a distinguishing version number. If the + Program specifies a version number of this License which applies + to it and "any later version", you have the option of following + the terms and conditions either of that version or of any later + version published by the Free Software Foundation. If the Program + does not specify a version number of this License, you may choose + any version ever published by the Free Software Foundation. + + 10. If you wish to incorporate parts of the Program into other free + programs whose distribution conditions are different, write to the + author to ask for permission. For software which is copyrighted + by the Free Software Foundation, write to the Free Software + Foundation; we sometimes make exceptions for this. Our decision + will be guided by the two goals of preserving the free status of + all derivatives of our free software and of promoting the sharing + and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO + WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE + LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT + HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT + WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT + NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE + QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE + PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY + SERVICING, REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN + WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY + MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE + LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, + INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR + INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF + DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU + OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY + OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN + ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + ============================================= + + If you develop a new program, and you want it to be of the greatest + possible use to the public, the best way to achieve this is to make it + free software which everyone can redistribute and change under these + terms. + + To do so, attach the following notices to the program. It is safest + to attach them to the start of each source file to most effectively + convey the exclusion of warranty; and each file should have at least + the "copyright" line and a pointer to where the full notice is found. + + ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. + Copyright (C) YEAR NAME OF AUTHOR + + This program 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 2 of the License, or + (at your option) any later version. + + This program 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 this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. + + Also add information on how to contact you by electronic and paper + mail. + + If the program is interactive, make it output a short notice like + this when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) YEAR NAME OF AUTHOR + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details + type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + + The hypothetical commands `show w' and `show c' should show the + appropriate parts of the General Public License. Of course, the + commands you use may be called something other than `show w' and `show + c'; they could even be mouse-clicks or menu items--whatever suits your + program. + + You should also get your employer (if you work as a programmer) or + your school, if any, to sign a "copyright disclaimer" for the program, + if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + SIGNATURE OF TY COON, 1 April 1989 + Ty Coon, President of Vice + + This General Public License does not permit incorporating your + program into proprietary programs. If your program is a subroutine + library, you may consider it more useful to permit linking proprietary + applications with the library. If this is what you want to do, use the + GNU Library General Public License instead of this License. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-21 gcc-3.2.3/gcc/doc/gcc.info-21 *** gcc-3.2.2/gcc/doc/gcc.info-21 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-21 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1228 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: GNU Free Documentation License, Next: Contributors, Prev: Copying, Up: Top + + GNU Free Documentation License + ****************************** + + Version 1.1, March 2000 + Copyright (C) 2000 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + 0. PREAMBLE + + The purpose of this License is to make a manual, textbook, or other + written document "free" in the sense of freedom: to assure everyone + the effective freedom to copy and redistribute it, with or without + modifying it, either commercially or noncommercially. Secondarily, + this License preserves for the author and publisher a way to get + credit for their work, while not being considered responsible for + modifications made by others. + + This License is a kind of "copyleft", which means that derivative + works of the document must themselves be free in the same sense. + It complements the GNU General Public License, which is a copyleft + license designed for free software. + + We have designed this License in order to use it for manuals for + free software, because free software needs free documentation: a + free program should come with manuals providing the same freedoms + that the software does. But this License is not limited to + software manuals; it can be used for any textual work, regardless + of subject matter or whether it is published as a printed book. + We recommend this License principally for works whose purpose is + instruction or reference. + + 1. APPLICABILITY AND DEFINITIONS + + This License applies to any manual or other work that contains a + notice placed by the copyright holder saying it can be distributed + under the terms of this License. The "Document", below, refers to + any such manual or work. Any member of the public is a licensee, + and is addressed as "you". + + A "Modified Version" of the Document means any work containing the + Document or a portion of it, either copied verbatim, or with + modifications and/or translated into another language. + + A "Secondary Section" is a named appendix or a front-matter + section of the Document that deals exclusively with the + relationship of the publishers or authors of the Document to the + Document's overall subject (or to related matters) and contains + nothing that could fall directly within that overall subject. + (For example, if the Document is in part a textbook of + mathematics, a Secondary Section may not explain any mathematics.) + The relationship could be a matter of historical connection with + the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + The "Invariant Sections" are certain Secondary Sections whose + titles are designated, as being those of Invariant Sections, in + the notice that says that the Document is released under this + License. + + The "Cover Texts" are certain short passages of text that are + listed, as Front-Cover Texts or Back-Cover Texts, in the notice + that says that the Document is released under this License. + + A "Transparent" copy of the Document means a machine-readable copy, + represented in a format whose specification is available to the + general public, whose contents can be viewed and edited directly + and straightforwardly with generic text editors or (for images + composed of pixels) generic paint programs or (for drawings) some + widely available drawing editor, and that is suitable for input to + text formatters or for automatic translation to a variety of + formats suitable for input to text formatters. A copy made in an + otherwise Transparent file format whose markup has been designed + to thwart or discourage subsequent modification by readers is not + Transparent. A copy that is not "Transparent" is called "Opaque". + + Examples of suitable formats for Transparent copies include plain + ASCII without markup, Texinfo input format, LaTeX input format, + SGML or XML using a publicly available DTD, and + standard-conforming simple HTML designed for human modification. + Opaque formats include PostScript, PDF, proprietary formats that + can be read and edited only by proprietary word processors, SGML + or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML produced by some word + processors for output purposes only. + + The "Title Page" means, for a printed book, the title page itself, + plus such following pages as are needed to hold, legibly, the + material this License requires to appear in the title page. For + works in formats which do not have any title page as such, "Title + Page" means the text near the most prominent appearance of the + work's title, preceding the beginning of the body of the text. + + 2. VERBATIM COPYING + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the + copyright notices, and the license notice saying this License + applies to the Document are reproduced in all copies, and that you + add no other conditions whatsoever to those of this License. You + may not use technical measures to obstruct or control the reading + or further copying of the copies you make or distribute. However, + you may accept compensation in exchange for copies. If you + distribute a large enough number of copies you must also follow + the conditions in section 3. + + You may also lend copies, under the same conditions stated above, + and you may publicly display copies. + + 3. COPYING IN QUANTITY + + If you publish printed copies of the Document numbering more than + 100, and the Document's license notice requires Cover Texts, you + must enclose the copies in covers that carry, clearly and legibly, + all these Cover Texts: Front-Cover Texts on the front cover, and + Back-Cover Texts on the back cover. Both covers must also clearly + and legibly identify you as the publisher of these copies. The + front cover must present the full title with all words of the + title equally prominent and visible. You may add other material + on the covers in addition. Copying with changes limited to the + covers, as long as they preserve the title of the Document and + satisfy these conditions, can be treated as verbatim copying in + other respects. + + If the required texts for either cover are too voluminous to fit + legibly, you should put the first ones listed (as many as fit + reasonably) on the actual cover, and continue the rest onto + adjacent pages. + + If you publish or distribute Opaque copies of the Document + numbering more than 100, you must either include a + machine-readable Transparent copy along with each Opaque copy, or + state in or with each Opaque copy a publicly-accessible + computer-network location containing a complete Transparent copy + of the Document, free of added material, which the general + network-using public has access to download anonymously at no + charge using public-standard network protocols. If you use the + latter option, you must take reasonably prudent steps, when you + begin distribution of Opaque copies in quantity, to ensure that + this Transparent copy will remain thus accessible at the stated + location until at least one year after the last time you + distribute an Opaque copy (directly or through your agents or + retailers) of that edition to the public. + + It is requested, but not required, that you contact the authors of + the Document well before redistributing any large number of + copies, to give them a chance to provide you with an updated + version of the Document. + + 4. MODIFICATIONS + + You may copy and distribute a Modified Version of the Document + under the conditions of sections 2 and 3 above, provided that you + release the Modified Version under precisely this License, with + the Modified Version filling the role of the Document, thus + licensing distribution and modification of the Modified Version to + whoever possesses a copy of it. In addition, you must do these + things in the Modified Version: + + A. Use in the Title Page (and on the covers, if any) a title + distinct from that of the Document, and from those of + previous versions (which should, if there were any, be listed + in the History section of the Document). You may use the + same title as a previous version if the original publisher of + that version gives permission. + + B. List on the Title Page, as authors, one or more persons or + entities responsible for authorship of the modifications in + the Modified Version, together with at least five of the + principal authors of the Document (all of its principal + authors, if it has less than five). + + C. State on the Title page the name of the publisher of the + Modified Version, as the publisher. + + D. Preserve all the copyright notices of the Document. + + E. Add an appropriate copyright notice for your modifications + adjacent to the other copyright notices. + + F. Include, immediately after the copyright notices, a license + notice giving the public permission to use the Modified + Version under the terms of this License, in the form shown in + the Addendum below. + + G. Preserve in that license notice the full lists of Invariant + Sections and required Cover Texts given in the Document's + license notice. + + H. Include an unaltered copy of this License. + + I. Preserve the section entitled "History", and its title, and + add to it an item stating at least the title, year, new + authors, and publisher of the Modified Version as given on + the Title Page. If there is no section entitled "History" in + the Document, create one stating the title, year, authors, + and publisher of the Document as given on its Title Page, + then add an item describing the Modified Version as stated in + the previous sentence. + + J. Preserve the network location, if any, given in the Document + for public access to a Transparent copy of the Document, and + likewise the network locations given in the Document for + previous versions it was based on. These may be placed in + the "History" section. You may omit a network location for a + work that was published at least four years before the + Document itself, or if the original publisher of the version + it refers to gives permission. + + K. In any section entitled "Acknowledgments" or "Dedications", + preserve the section's title, and preserve in the section all + the substance and tone of each of the contributor + acknowledgments and/or dedications given therein. + + L. Preserve all the Invariant Sections of the Document, + unaltered in their text and in their titles. Section numbers + or the equivalent are not considered part of the section + titles. + + M. Delete any section entitled "Endorsements". Such a section + may not be included in the Modified Version. + + N. Do not retitle any existing section as "Endorsements" or to + conflict in title with any Invariant Section. + + If the Modified Version includes new front-matter sections or + appendices that qualify as Secondary Sections and contain no + material copied from the Document, you may at your option + designate some or all of these sections as invariant. To do this, + add their titles to the list of Invariant Sections in the Modified + Version's license notice. These titles must be distinct from any + other section titles. + + You may add a section entitled "Endorsements", provided it contains + nothing but endorsements of your Modified Version by various + parties--for example, statements of peer review or that the text + has been approved by an organization as the authoritative + definition of a standard. + + You may add a passage of up to five words as a Front-Cover Text, + and a passage of up to 25 words as a Back-Cover Text, to the end + of the list of Cover Texts in the Modified Version. Only one + passage of Front-Cover Text and one of Back-Cover Text may be + added by (or through arrangements made by) any one entity. If the + Document already includes a cover text for the same cover, + previously added by you or by arrangement made by the same entity + you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous + publisher that added the old one. + + The author(s) and publisher(s) of the Document do not by this + License give permission to use their names for publicity for or to + assert or imply endorsement of any Modified Version. + + 5. COMBINING DOCUMENTS + + You may combine the Document with other documents released under + this License, under the terms defined in section 4 above for + modified versions, provided that you include in the combination + all of the Invariant Sections of all of the original documents, + unmodified, and list them all as Invariant Sections of your + combined work in its license notice. + + The combined work need only contain one copy of this License, and + multiple identical Invariant Sections may be replaced with a single + copy. If there are multiple Invariant Sections with the same name + but different contents, make the title of each such section unique + by adding at the end of it, in parentheses, the name of the + original author or publisher of that section if known, or else a + unique number. Make the same adjustment to the section titles in + the list of Invariant Sections in the license notice of the + combined work. + + In the combination, you must combine any sections entitled + "History" in the various original documents, forming one section + entitled "History"; likewise combine any sections entitled + "Acknowledgments", and any sections entitled "Dedications". You + must delete all sections entitled "Endorsements." + + 6. COLLECTIONS OF DOCUMENTS + + You may make a collection consisting of the Document and other + documents released under this License, and replace the individual + copies of this License in the various documents with a single copy + that is included in the collection, provided that you follow the + rules of this License for verbatim copying of each of the + documents in all other respects. + + You may extract a single document from such a collection, and + distribute it individually under this License, provided you insert + a copy of this License into the extracted document, and follow + this License in all other respects regarding verbatim copying of + that document. + + 7. AGGREGATION WITH INDEPENDENT WORKS + + A compilation of the Document or its derivatives with other + separate and independent documents or works, in or on a volume of + a storage or distribution medium, does not as a whole count as a + Modified Version of the Document, provided no compilation + copyright is claimed for the compilation. Such a compilation is + called an "aggregate", and this License does not apply to the + other self-contained works thus compiled with the Document, on + account of their being thus compiled, if they are not themselves + derivative works of the Document. + + If the Cover Text requirement of section 3 is applicable to these + copies of the Document, then if the Document is less than one + quarter of the entire aggregate, the Document's Cover Texts may be + placed on covers that surround only the Document within the + aggregate. Otherwise they must appear on covers around the whole + aggregate. + + 8. TRANSLATION + + Translation is considered a kind of modification, so you may + distribute translations of the Document under the terms of section + 4. Replacing Invariant Sections with translations requires special + permission from their copyright holders, but you may include + translations of some or all Invariant Sections in addition to the + original versions of these Invariant Sections. You may include a + translation of this License provided that you also include the + original English version of this License. In case of a + disagreement between the translation and the original English + version of this License, the original English version will prevail. + + 9. TERMINATION + + You may not copy, modify, sublicense, or distribute the Document + except as expressly provided for under this License. Any other + attempt to copy, modify, sublicense or distribute the Document is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 10. FUTURE REVISIONS OF THIS LICENSE + + The Free Software Foundation may publish new, revised versions of + the GNU Free Documentation License from time to time. Such new + versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. See + `http://www.gnu.org/copyleft/'. + + Each version of the License is given a distinguishing version + number. If the Document specifies that a particular numbered + version of this License "or any later version" applies to it, you + have the option of following the terms and conditions either of + that specified version or of any later version that has been + published (not as a draft) by the Free Software Foundation. If + the Document does not specify a version number of this License, + you may choose any version ever published (not as a draft) by the + Free Software Foundation. + + ADDENDUM: How to use this License for your documents + ==================================================== + + To use this License in a document you have written, include a copy of + the License in the document and put the following copyright and license + notices just after the title page: + + Copyright (C) YEAR YOUR NAME. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 + or any later version published by the Free Software Foundation; + with the Invariant Sections being LIST THEIR TITLES, with the + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. + A copy of the license is included in the section entitled ``GNU + Free Documentation License''. + + If you have no Invariant Sections, write "with no Invariant Sections" + instead of saying which ones are invariant. If you have no Front-Cover + Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being + LIST"; likewise for Back-Cover Texts. + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of + free software license, such as the GNU General Public License, to + permit their use in free software. + +  + File: gcc.info, Node: Contributors, Next: Option Index, Prev: GNU Free Documentation License, Up: Top + + Contributors to GCC + ******************* + + The GCC project would like to thank its many contributors. Without + them the project would not have been nearly as successful as it has + been. Any omissions in this list are accidental. Feel free to contact + if you have been left out or some of your + contributions are not listed. Please keep this list in alphabetical + order. + + * Analog Devices helped implement the support for complex data types + and iterators. + + * John David Anglin for threading-related fixes and improvements to + libstdc++-v3, and the HP-UX port. + + * James van Artsdalen wrote the code that makes efficient use of the + Intel 80387 register stack. + + * Alasdair Baird for various bugfixes. + + * Gerald Baumgartner added the signature extension to the C++ front + end. + + * Godmar Back for his Java improvements and encouragement. + + * Scott Bambrough for help porting the Java compiler. + + * Jon Beniston for his Win32 port of Java. + + * Geoff Berry for his Java object serialization work and various + patches. + + * Eric Blake for helping to make GCJ and libgcj conform to the + specifications. + + * Hans-J. Boehm for his garbage collector, IA-64 libffi port, and + other Java work. + + * Neil Booth for work on cpplib, lang hooks, debug hooks and other + miscellaneous clean-ups. + + * Per Bothner for his direction via the steering committee and + various improvements to our infrastructure for supporting new + languages. Chill front end implementation. Initial + implementations of cpplib, fix-header, config.guess, libio, and + past C++ library (libg++) maintainer. Dreaming up, designing and + implementing much of GCJ. + + * Devon Bowen helped port GCC to the Tahoe. + + * Don Bowman for mips-vxworks contributions. + + * Dave Brolley for work on cpplib and Chill. + + * Robert Brown implemented the support for Encore 32000 systems. + + * Christian Bruel for improvements to local store elimination. + + * Herman A.J. ten Brugge for various fixes. + + * Joerg Brunsmann for Java compiler hacking and help with the GCJ + FAQ. + + * Joe Buck for his direction via the steering committee. + + * Craig Burley for leadership of the Fortran effort. + + * Stephan Buys for contributing Doxygen notes for libstdc++. + + * Paolo Carlini for libstdc++ work: lots of efficiency improvements + to the string class, hard detective work on the frustrating + localization issues, and keeping up with the problem reports. + + * John Carr for his alias work, SPARC hacking, infrastructure + improvements, previous contributions to the steering committee, + loop optimizations, etc. + + * Steve Chamberlain for support for the Hitachi SH and H8 processors + and the PicoJava processor, and for GCJ config fixes. + + * Glenn Chambers for help with the GCJ FAQ. + + * John-Marc Chandonia for various libgcj patches. + + * Scott Christley for his Objective-C contributions. + + * Eric Christopher for his Java porting help and clean-ups. + + * Branko Cibej for more warning contributions. + + * The GNU Classpath project for all of their merged runtime code. + + * Nick Clifton for arm, mcore, fr30, v850, m32r work, `--help', and + other random hacking. + + * Michael Cook for libstdc++ cleanup patches to reduce warnings. + + * Ralf Corsepius for SH testing and minor bugfixing. + + * Stan Cox for care and feeding of the x86 port and lots of behind + the scenes hacking. + + * Alex Crain provided changes for the 3b1. + + * Ian Dall for major improvements to the NS32k port. + + * Dario Dariol contributed the four varieties of sample programs + that print a copy of their source. + + * Russell Davidson for fstream and stringstream fixes in libstdc++. + + * Mo DeJong for GCJ and libgcj bug fixes. + + * Gabriel Dos Reis for contributions to g++, contributions and + maintenance of GCC diagnostics infrastructure, libstdc++-v3, + including valarray<>, complex<>, maintaining the numerics library + (including that pesky :-) and keeping up-to-date anything + to do with numbers. + + * Ulrich Drepper for his work on glibc, testing of GCC using glibc, + ISO C99 support, CFG dumping support, etc., plus support of the + C++ runtime libraries including for all kinds of C interface + issues, contributing and maintaining complex<>, sanity checking + and disbursement, configuration architecture, libio maintenance, + and early math work. + + * Richard Earnshaw for his ongoing work with the ARM. + + * David Edelsohn for his direction via the steering committee, + ongoing work with the RS6000/PowerPC port, help cleaning up Haifa + loop changes, and for doing the entire AIX port of libstdc++ with + his bare hands. + + * Kevin Ediger for the floating point formatting of num_put::do_put + in libstdc++. + + * Phil Edwards for libstdc++ work including configuration hackery, + documentation maintainer, chief breaker of the web pages, the + occasional iostream bugfix, and work on shared library symbol + versioning. + + * Paul Eggert for random hacking all over GCC. + + * Mark Elbrecht for various DJGPP improvements, and for libstdc++ + configuration support for locales and fstream-related fixes. + + * Vadim Egorov for libstdc++ fixes in strings, streambufs, and + iostreams. + + * Ben Elliston for his work to move the Objective-C runtime into its + own subdirectory and for his work on autoconf. + + * Marc Espie for OpenBSD support. + + * Doug Evans for much of the global optimization framework, arc, + m32r, and SPARC work. + + * Fred Fish for BeOS support and Ada fixes. + + * Ivan Fontes Garcia for the Portugese translation of the GCJ FAQ. + + * Peter Gerwinski for various bugfixes and the Pascal front end. + + * Kaveh Ghazi for his direction via the steering committee and + amazing work to make `-W -Wall' useful. + + * John Gilmore for a donation to the FSF earmarked improving GNU + Java. + + * Judy Goldberg for c++ contributions. + + * Torbjorn Granlund for various fixes and the c-torture testsuite, + multiply- and divide-by-constant optimization, improved long long + support, improved leaf function register allocation, and his + direction via the steering committee. + + * Anthony Green for his `-Os' contributions and Java front end work. + + * Stu Grossman for gdb hacking, allowing GCJ developers to debug our + code. + + * Michael K. Gschwind contributed the port to the PDP-11. + + * Ron Guilmette implemented the `protoize' and `unprotoize' tools, + the support for Dwarf symbolic debugging information, and much of + the support for System V Release 4. He has also worked heavily on + the Intel 386 and 860 support. + + * Bruno Haible for improvements in the runtime overhead for EH, new + warnings and assorted bugfixes. + + * Andrew Haley for his amazing Java compiler and library efforts. + + * Chris Hanson assisted in making GCC work on HP-UX for the 9000 + series 300. + + * Michael Hayes for various thankless work he's done trying to get + the c30/c40 ports functional. Lots of loop and unroll + improvements and fixes. + + * Kate Hedstrom for staking the g77 folks with an initial testsuite. + + * Richard Henderson for his ongoing SPARC, alpha, and ia32 work, loop + opts, and generally fixing lots of old problems we've ignored for + years, flow rewrite and lots of further stuff, including reviewing + tons of patches. + + * Nobuyuki Hikichi of Software Research Associates, Tokyo, + contributed the support for the Sony NEWS machine. + + * Manfred Hollstein for his ongoing work to keep the m88k alive, lots + of testing an bugfixing, particularly of our configury code. + + * Steve Holmgren for MachTen patches. + + * Jan Hubicka for his x86 port improvements. + + * Christian Iseli for various bugfixes. + + * Kamil Iskra for general m68k hacking. + + * Lee Iverson for random fixes and MIPS testing. + + * Andreas Jaeger for various fixes to the MIPS port + + * Jakub Jelinek for his SPARC work and sibling call optimizations as + well as lots of bug fixes and test cases, and for improving the + Java build system. + + * Janis Johnson for ia64 testing and fixes and for her quality + improvement sidetracks. + + * J. Kean Johnston for OpenServer support. + + * Tim Josling for the sample language treelang based originally on + Richard Kenner's ""toy" language". + + * Nicolai Josuttis for additional libstdc++ documentation. + + * Klaus Kaempf for his ongoing work to make alpha-vms a viable + target. + + * David Kashtan of SRI adapted GCC to VMS. + + * Ryszard Kabatek for many, many libstdc++ bugfixes and + optimizations of strings, especially member functions, and for + auto_ptr fixes. + + * Geoffrey Keating for his ongoing work to make the PPC work for + GNU/Linux and his automatic regression tester. + + * Brendan Kehoe for his ongoing work with g++ and for a lot of early + work in just about every part of libstdc++. + + * Oliver M. Kellogg of Deutsche Aerospace contributed the port to the + MIL-STD-1750A. + + * Richard Kenner of the New York University Ultracomputer Research + Laboratory wrote the machine descriptions for the AMD 29000, the + DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the + support for instruction attributes. He also made changes to + better support RISC processors including changes to common + subexpression elimination, strength reduction, function calling + sequence handling, and condition code support, in addition to + generalizing the code for frame pointer elimination and delay slot + scheduling. Richard Kenner was also the head maintainer of GCC + for several years. + + * Mumit Khan for various contributions to the Cygwin and Mingw32 + ports and maintaining binary releases for Windows hosts, and for + massive libstdc++ porting work to Cygwin/Mingw32. + + * Robin Kirkham for cpu32 support. + + * Mark Klein for PA improvements. + + * Thomas Koenig for various bugfixes. + + * Bruce Korb for the new and improved fixincludes code. + + * Benjamin Kosnik for his g++ work and for leading the libstdc++-v3 + effort. + + * Charles LaBrec contributed the support for the Integrated Solutions + 68020 system. + + * Jeff Law for his direction via the steering committee, + coordinating the entire egcs project and GCC 2.95, rolling out + snapshots and releases, handling merges from GCC2, reviewing tons + of patches that might have fallen through the cracks else, and + random but extensive hacking. + + * Marc Lehmann for his direction via the steering committee and + helping with analysis and improvements of x86 performance. + + * Ted Lemon wrote parts of the RTL reader and printer. + + * Kriang Lerdsuwanakij for improvements to demangler and various c++ + fixes. + + * Warren Levy for tremendous work on libgcj (Java Runtime Library) + and random work on the Java front end. + + * Alain Lichnewsky ported GCC to the MIPS CPU. + + * Oskar Liljeblad for hacking on AWT and his many Java bug reports + and patches. + + * Robert Lipe for OpenServer support, new testsuites, testing, etc. + + * Weiwen Liu for testing and various bugfixes. + + * Dave Love for his ongoing work with the Fortran front end and + runtime libraries. + + * Martin von Lo"wis for internal consistency checking infrastructure, + various C++ improvements including namespace support, and tons of + assistance with libstdc++/compiler merges. + + * H.J. Lu for his previous contributions to the steering committee, + many x86 bug reports, prototype patches, and keeping the GNU/Linux + ports working. + + * Greg McGary for random fixes and (someday) bounded pointers. + + * Andrew MacLeod for his ongoing work in building a real EH system, + various code generation improvements, work on the global + optimizer, etc. + + * Vladimir Makarov for hacking some ugly i960 problems, PowerPC + hacking improvements to compile-time performance, overall + knowledge and direction in the area of instruction scheduling, and + design and implementation of the automaton based instruction + scheduler. + + * Bob Manson for his behind the scenes work on dejagnu. + + * Philip Martin for lots of libstdc++ string and vector iterator + fixes and improvements, and string clean up and testsuites. + + * All of the Mauve project contributors, for Java test code. + + * Bryce McKinlay for numerous GCJ and libgcj fixes and improvements. + + * Adam Megacz for his work on the Win32 port of GCJ. + + * Michael Meissner for LRS framework, ia32, m32r, v850, m88k, MIPS, + powerpc, haifa, ECOFF debug support, and other assorted hacking. + + * Jason Merrill for his direction via the steering committee and + leading the g++ effort. + + * David Miller for his direction via the steering committee, lots of + SPARC work, improvements in jump.c and interfacing with the Linux + kernel developers. + + * Gary Miller ported GCC to Charles River Data Systems machines. + + * Alfred Minarik for libstdc++ string and ios bugfixes, and turning + the entire libstdc++ testsuite namespace-compatible. + + * Mark Mitchell for his direction via the steering committee, + mountains of C++ work, load/store hoisting out of loops, alias + analysis improvements, ISO C `restrict' support, and serving as + release manager for GCC 3.x. + + * Alan Modra for various GNU/Linux bits and testing. + + * Toon Moene for his direction via the steering committee, Fortran + maintenance, and his ongoing work to make us make Fortran run fast. + + * Jason Molenda for major help in the care and feeding of all the + services on the gcc.gnu.org (formerly egcs.cygnus.com) + machine--mail, web services, ftp services, etc etc. Doing all + this work on scrap paper and the backs of envelopes would have + been... difficult. + + * Catherine Moore for fixing various ugly problems we have sent her + way, including the haifa bug which was killing the Alpha & PowerPC + Linux kernels. + + * Mike Moreton for his various Java patches. + + * David Mosberger-Tang for various Alpha improvements. + + * Stephen Moshier contributed the floating point emulator that + assists in cross-compilation and permits support for floating + point numbers wider than 64 bits and for ISO C99 support. + + * Bill Moyer for his behind the scenes work on various issues. + + * Philippe De Muyter for his work on the m68k port. + + * Joseph S. Myers for his work on the PDP-11 port, format checking + and ISO C99 support, and continuous emphasis on (and contributions + to) documentation. + + * Nathan Myers for his work on libstdc++-v3: architecture and + authorship through the first three snapshots, including + implementation of locale infrastructure, string, shadow C headers, + and the initial project documentation (DESIGN, CHECKLIST, and so + forth). Later, more work on MT-safe string and shadow headers. + + * Felix Natter for documentation on porting libstdc++. + + * NeXT, Inc. donated the front end that supports the Objective-C + language. + + * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to + the search engine setup, various documentation fixes and other + small fixes. + + * Geoff Noer for this work on getting cygwin native builds working. + + * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64, + FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and + related infrastructure improvements. + + * Alexandre Oliva for various build infrastructure improvements, + scripts and amazing testing work, including keeping libtool issues + sane and happy. + + * Melissa O'Neill for various NeXT fixes. + + * Rainer Orth for random MIPS work, including improvements to our o32 + ABI support, improvements to dejagnu's MIPS support, Java + configuration clean-ups and porting work, etc. + + * Paul Petersen wrote the machine description for the Alliant FX/8. + + * Alexandre Petit-Bianco for implementing much of the Java compiler + and continued Java maintainership. + + * Matthias Pfaller for major improvements to the NS32k port. + + * Gerald Pfeifer for his direction via the steering committee, + pointing out lots of problems we need to solve, maintenance of the + web pages, and taking care of documentation maintenance in general. + + * Ovidiu Predescu for his work on the Objective-C front end and + runtime libraries. + + * Ken Raeburn for various improvements to checker, MIPS ports and + various cleanups in the compiler. + + * Rolf W. Rasmussen for hacking on AWT. + + * David Reese of Sun Microsystems contributed to the Solaris on + PowerPC port. + + * Joern Rennecke for maintaining the sh port, loop, regmove & reload + hacking. + + * Loren J. Rittle for improvements to libstdc++-v3 including the + FreeBSD port, threading fixes, thread-related configury changes, + critical threading documentation, and solutions to really tricky + I/O problems. + + * Craig Rodrigues for processing tons of bug reports. + + * Gavin Romig-Koch for lots of behind the scenes MIPS work. + + * Ken Rose for fixes to our delay slot filling code. + + * Paul Rubin wrote most of the preprocessor. + + * Chip Salzenberg for libstdc++ patches and improvements to locales, + traits, Makefiles, libio, libtool hackery, and "long long" support. + + * Juha Sarlin for improvements to the H8 code generator. + + * Greg Satz assisted in making GCC work on HP-UX for the 9000 series + 300. + + * Bradley Schatz for his work on the GCJ FAQ. + + * Peter Schauer wrote the code to allow debugging to work on the + Alpha. + + * William Schelter did most of the work on the Intel 80386 support. + + * Bernd Schmidt for various code generation improvements and major + work in the reload pass as well a serving as release manager for + GCC 2.95.3. + + * Peter Schmid for constant testing of libstdc++ - especially + application testing, going above and beyond what was requested for + the release criteria - and libstdc++ header file tweaks. + + * Jason Schroeder for jcf-dump patches. + + * Andreas Schwab for his work on the m68k port. + + * Joel Sherrill for his direction via the steering committee, RTEMS + contributions and RTEMS testing. + + * Nathan Sidwell for many C++ fixes/improvements. + + * Jeffrey Siegal for helping RMS with the original design of GCC, + some code which handles the parse tree and RTL data structures, + constant folding and help with the original VAX & m68k ports. + + * Kenny Simpson for prompting libstdc++ fixes due to defect reports + from the LWG (thereby keeping us in line with updates from the + ISO). + + * Franz Sirl for his ongoing work with making the PPC port stable + for linux. + + * Andrey Slepuhin for assorted AIX hacking. + + * Christopher Smith did the port for Convex machines. + + * Randy Smith finished the Sun FPA support. + + * Scott Snyder for queue, iterator, istream, and string fixes and + libstdc++ testsuite entries. + + * Brad Spencer for contributions to the GLIBCPP_FORCE_NEW technique. + + * Richard Stallman, for writing the original gcc and launching the + GNU project. + + * Jan Stein of the Chalmers Computer Society provided support for + Genix, as well as part of the 32000 machine description. + + * Nigel Stephens for various mips16 related fixes/improvements. + + * Jonathan Stone wrote the machine description for the Pyramid + computer. + + * Graham Stott for various infrastructure improvements. + + * John Stracke for his Java HTTP protocol fixes. + + * Mike Stump for his Elxsi port, g++ contributions over the years + and more recently his vxworks contributions + + * Jeff Sturm for Java porting help, bug fixes, and encouragement. + + * Shigeya Suzuki for this fixes for the bsdi platforms. + + * Ian Lance Taylor for his mips16 work, general configury hacking, + fixincludes, etc. + + * Holger Teutsch provided the support for the Clipper CPU. + + * Gary Thomas for his ongoing work to make the PPC work for + GNU/Linux. + + * Philipp Thomas for random bugfixes throughout the compiler + + * Jason Thorpe for thread support in libstdc++ on NetBSD. + + * Kresten Krab Thorup wrote the run time support for the Objective-C + language and the fantastic Java bytecode interpreter. + + * Michael Tiemann for random bugfixes, the first instruction + scheduler, initial C++ support, function integration, NS32k, SPARC + and M88k machine description work, delay slot scheduling. + + * Andreas Tobler for his work porting libgcj to Darwin. + + * Teemu Torma for thread safe exception handling support. + + * Leonard Tower wrote parts of the parser, RTL generator, and RTL + definitions, and of the VAX machine description. + + * Tom Tromey for internationalization support and for his many Java + contributions and libgcj maintainership. + + * Lassi Tuura for improvements to config.guess to determine HP + processor types. + + * Petter Urkedal for libstdc++ CXXFLAGS, math, and algorithms fixes. + + * Brent Verner for work with the libstdc++ cshadow files and their + associated configure steps. + + * Todd Vierling for contributions for NetBSD ports. + + * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML + guidance. + + * Dean Wakerley for converting the install documentation from HTML + to texinfo in time for GCC 3.0. + + * Krister Walfridsson for random bugfixes. + + * Stephen M. Webb for time and effort on making libstdc++ shadow + files work with the tricky Solaris 8+ headers, and for pushing the + build-time header tree. + + * John Wehle for various improvements for the x86 code generator, + related infrastructure improvements to help x86 code generation, + value range propagation and other work, WE32k port. + + * Zack Weinberg for major work on cpplib and various other bugfixes. + + * Matt Welsh for help with Linux Threads support in GCJ. + + * Urban Widmark for help fixing java.io. + + * Mark Wielaard for new Java library code and his work integrating + with Classpath. + + * Dale Wiles helped port GCC to the Tahoe. + + * Bob Wilson from Tensilica, Inc. for the Xtensa port. + + * Jim Wilson for his direction via the steering committee, tackling + hard problems in various places that nobody else wanted to work + on, strength reduction and other loop optimizations. + + * Carlo Wood for various fixes. + + * Tom Wood for work on the m88k port. + + * Masanobu Yuhara of Fujitsu Laboratories implemented the machine + description for the Tron architecture (specifically, the Gmicro). + + * Kevin Zachmann helped ported GCC to the Tahoe. + + * Gilles Zunino for help porting Java to Irix. + + + We'd also like to thank the folks who have contributed time and + energy in testing GCC: + + * Michael Abd-El-Malek + + * Thomas Arend + + * Bonzo Armstrong + + * Steven Ashe + + * Chris Baldwin + + * David Billinghurst + + * Jim Blandy + + * Stephane Bortzmeyer + + * Horst von Brand + + * Frank Braun + + * Rodney Brown + + * Joe Buck + + * Craig Burley + + * Sidney Cadot + + * Bradford Castalia + + * Ralph Doncaster + + * Ulrich Drepper + + * David Edelsohn + + * Richard Emberson + + * Levente Farkas + + * Graham Fawcett + + * Robert A. French + + * Jo"rgen Freyh + + * Mark K. Gardner + + * Charles-Antoine Gauthier + + * Yung Shing Gene + + * Kaveh Ghazi + + * David Gilbert + + * Simon Gornall + + * Fred Gray + + * John Griffin + + * Patrik Hagglund + + * Phil Hargett + + * Amancio Hasty + + * Bryan W. Headley + + * Kate Hedstrom + + * Richard Henderson + + * Kevin B. Hendricks + + * Manfred Hollstein + + * Kamil Iskra + + * Joep Jansen + + * Christian Joensson + + * David Kidd + + * Tobias Kuipers + + * Anand Krishnaswamy + + * Jeff Law + + * Robert Lipe + + * llewelly + + * Damon Love + + * Dave Love + + * H.J. Lu + + * Brad Lucier + + * Mumit Khan + + * Matthias Klose + + * Martin Knoblauch + + * Jesse Macnish + + * David Miller + + * Toon Moene + + * Stefan Morrell + + * Anon A. Mous + + * Matthias Mueller + + * Pekka Nikander + + * Alexandre Oliva + + * Jon Olson + + * Magnus Persson + + * Chris Pollard + + * Richard Polton + + * David Rees + + * Paul Reilly + + * Tom Reilly + + * Loren J. Rittle + + * Torsten Rueger + + * Danny Sadinoff + + * Marc Schifer + + * Peter Schmid + + * David Schuler + + * Vin Shelton + + * Franz Sirl + + * Tim Souder + + * Mike Stump + + * Adam Sulmicki + + * George Talbot + + * Gregory Warnes + + * Carlo Wood + + * David E. Young + + * And many others + + And finally we'd like to thank everyone who uses the compiler, + submits bug reports and generally reminds us why we're doing this work + in the first place. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-22 gcc-3.2.3/gcc/doc/gcc.info-22 *** gcc-3.2.2/gcc/doc/gcc.info-22 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-22 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,1224 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Option Index, Next: Index, Prev: Contributors, Up: Top + + Option Index + ************ + + GCC's command line options are indexed here without any initial `-' + or `--'. Where an option has both positive and negative forms (such as + `-fOPTION' and `-fno-OPTION'), relevant entries in the manual are + indexed under the most appropriate form; it may sometimes be useful to + look up both forms. + + * Menu: + + * ###: Overall Options. + * $: Preprocessor Options. + * A: Preprocessor Options. + * A-: Preprocessor Options. + * ansi <1>: Non-bugs. + * ansi <2>: Other Builtins. + * ansi <3>: Preprocessor Options. + * ansi <4>: C Dialect Options. + * ansi: Standards. + * aux-info: C Dialect Options. + * b: Target Options. + * B: Directory Options. + * bcopy-builtin: PDP-11 Options. + * c: Link Options. + * C: Preprocessor Options. + * c: Overall Options. + * D: Preprocessor Options. + * d: Debugging Options. + * da: Debugging Options. + * dA: Debugging Options. + * dB: Debugging Options. + * db: Debugging Options. + * dC: Debugging Options. + * dc: Debugging Options. + * dD <1>: Preprocessor Options. + * dD: Debugging Options. + * dd: Debugging Options. + * dE: Debugging Options. + * de: Debugging Options. + * dF: Debugging Options. + * df: Debugging Options. + * dG: Debugging Options. + * dg: Debugging Options. + * dh: Debugging Options. + * dI: Preprocessor Options. + * di: Debugging Options. + * dj: Debugging Options. + * dk: Debugging Options. + * dL: Debugging Options. + * dl: Debugging Options. + * dM: Preprocessor Options. + * dm: Debugging Options. + * dM: Debugging Options. + * dN <1>: Preprocessor Options. + * dN: Debugging Options. + * dn: Debugging Options. + * do: Debugging Options. + * dP: Debugging Options. + * dp: Debugging Options. + * dR: Debugging Options. + * dr: Debugging Options. + * dS: Debugging Options. + * ds: Debugging Options. + * dt: Debugging Options. + * dumpmachine: Debugging Options. + * dumpspecs: Debugging Options. + * dumpversion: Debugging Options. + * dv: Debugging Options. + * dw: Debugging Options. + * dx: Debugging Options. + * dX: Debugging Options. + * dy: Debugging Options. + * dz: Debugging Options. + * E <1>: Link Options. + * E: Overall Options. + * EB <1>: ARC Options. + * EB: MIPS Options. + * EL <1>: ARC Options. + * EL: MIPS Options. + * falign-functions: Optimize Options. + * falign-jumps: Optimize Options. + * falign-labels: Optimize Options. + * falign-loops: Optimize Options. + * fallow-single-precision: C Dialect Options. + * falt-external-templates <1>: Template Instantiation. + * falt-external-templates: C++ Dialect Options. + * fargument-alias: Code Gen Options. + * fargument-noalias: Code Gen Options. + * fargument-noalias-global: Code Gen Options. + * fbounds-check: Optimize Options. + * fbranch-probabilities: Optimize Options. + * fcall-saved <1>: Interoperation. + * fcall-saved: Code Gen Options. + * fcall-used: Code Gen Options. + * fcaller-saves: Optimize Options. + * fcheck-new: C++ Dialect Options. + * fcond-mismatch: C Dialect Options. + * fconserve-space: C++ Dialect Options. + * fconstant-string-class: Objective-C Dialect Options. + * fcse-follow-jumps: Optimize Options. + * fcse-skip-blocks: Optimize Options. + * fdata-sections: Optimize Options. + * fdelayed-branch: Optimize Options. + * fdelete-null-pointer-checks: Optimize Options. + * fdiagnostics-show-location: Language Independent Options. + * fdollars-in-identifiers <1>: Interoperation. + * fdollars-in-identifiers: C++ Dialect Options. + * fdump-class-hierarchy: Debugging Options. + * fdump-translation-unit: Debugging Options. + * fdump-tree: Debugging Options. + * fdump-unnumbered: Debugging Options. + * fexceptions: Code Gen Options. + * fexpensive-optimizations: Optimize Options. + * fexternal-templates <1>: Template Instantiation. + * fexternal-templates: C++ Dialect Options. + * ffast-math: Optimize Options. + * ffixed: Code Gen Options. + * ffloat-store <1>: Disappointments. + * ffloat-store: Optimize Options. + * ffor-scope: C++ Dialect Options. + * fforce-addr: Optimize Options. + * fforce-mem: Optimize Options. + * ffreestanding <1>: Function Attributes. + * ffreestanding <2>: C Dialect Options. + * ffreestanding: Standards. + * ffunction-sections: Optimize Options. + * fgcse: Optimize Options. + * fgcse-lm: Optimize Options. + * fgcse-sm: Optimize Options. + * fgnu-runtime: Objective-C Dialect Options. + * fhosted: C Dialect Options. + * finhibit-size-directive: Code Gen Options. + * finline-functions: Optimize Options. + * finline-limit: Optimize Options. + * finstrument-functions <1>: Function Attributes. + * finstrument-functions: Code Gen Options. + * fkeep-inline-functions <1>: Inline. + * fkeep-inline-functions: Optimize Options. + * fkeep-static-consts: Optimize Options. + * fleading-underscore: Code Gen Options. + * fmem-report: Debugging Options. + * fmessage-length: Language Independent Options. + * fmove-all-movables: Optimize Options. + * fms-extensions: C++ Dialect Options. + * fnext-runtime: Objective-C Dialect Options. + * fno-access-control: C++ Dialect Options. + * fno-asm: C Dialect Options. + * fno-branch-count-reg: Optimize Options. + * fno-builtin <1>: Other Builtins. + * fno-builtin: C Dialect Options. + * fno-common <1>: Variable Attributes. + * fno-common: Code Gen Options. + * fno-const-strings: C++ Dialect Options. + * fno-cprop-registers: Optimize Options. + * fno-default-inline <1>: Inline. + * fno-default-inline <2>: Optimize Options. + * fno-default-inline: C++ Dialect Options. + * fno-defer-pop: Optimize Options. + * fno-elide-constructors: C++ Dialect Options. + * fno-enforce-eh-specs: C++ Dialect Options. + * fno-for-scope: C++ Dialect Options. + * fno-function-cse: Optimize Options. + * fno-gnu-keywords: C++ Dialect Options. + * fno-gnu-linker: Code Gen Options. + * fno-guess-branch-probability: Optimize Options. + * fno-ident: Code Gen Options. + * fno-implement-inlines <1>: C++ Interface. + * fno-implement-inlines: C++ Dialect Options. + * fno-implicit-inline-templates: C++ Dialect Options. + * fno-implicit-templates <1>: Template Instantiation. + * fno-implicit-templates: C++ Dialect Options. + * fno-inline: Optimize Options. + * fno-math-errno: Optimize Options. + * fno-nonansi-builtins: C++ Dialect Options. + * fno-operator-names: C++ Dialect Options. + * fno-optional-diags: C++ Dialect Options. + * fno-peephole: Optimize Options. + * fno-peephole2: Optimize Options. + * fno-rtti: C++ Dialect Options. + * fno-sched-interblock: Optimize Options. + * fno-sched-spec: Optimize Options. + * fno-show-column: Preprocessor Options. + * fno-signed-bitfields: C Dialect Options. + * fno-stack-limit: Code Gen Options. + * fno-trapping-math: Optimize Options. + * fno-unsigned-bitfields: C Dialect Options. + * fno-weak: C++ Dialect Options. + * fnon-call-exceptions: Code Gen Options. + * fomit-frame-pointer: Optimize Options. + * foptimize-register-move: Optimize Options. + * foptimize-sibling-calls: Optimize Options. + * fpack-struct: Code Gen Options. + * fpcc-struct-return <1>: Incompatibilities. + * fpcc-struct-return: Code Gen Options. + * fpermissive: C++ Dialect Options. + * fPIC: Code Gen Options. + * fpic: Code Gen Options. + * fprefetch-loop-arrays: Optimize Options. + * fpreprocessed: Preprocessor Options. + * fpretend-float: Debugging Options. + * fprofile-arcs <1>: Other Builtins. + * fprofile-arcs: Debugging Options. + * freduce-all-givs: Optimize Options. + * freg-struct-return: Code Gen Options. + * fregmove: Optimize Options. + * frename-registers: Optimize Options. + * frepo <1>: Template Instantiation. + * frepo: C++ Dialect Options. + * frerun-cse-after-loop: Optimize Options. + * frerun-loop-opt: Optimize Options. + * fsched-spec-load: Optimize Options. + * fsched-spec-load-dangerous: Optimize Options. + * fsched-verbose: Debugging Options. + * fschedule-insns: Optimize Options. + * fschedule-insns2: Optimize Options. + * fshared-data: Code Gen Options. + * fshort-double: Code Gen Options. + * fshort-enums <1>: Non-bugs. + * fshort-enums <2>: Type Attributes. + * fshort-enums: Code Gen Options. + * fshort-wchar: Code Gen Options. + * fsigned-bitfields <1>: Non-bugs. + * fsigned-bitfields: C Dialect Options. + * fsigned-char: C Dialect Options. + * fsingle-precision-constant: Optimize Options. + * fssa: Optimize Options. + * fssa-ccp: Optimize Options. + * fssa-dce: Optimize Options. + * fstack-check: Code Gen Options. + * fstack-limit-register: Code Gen Options. + * fstack-limit-symbol: Code Gen Options. + * fstats: C++ Dialect Options. + * fstrength-reduce: Optimize Options. + * fstrict-aliasing: Optimize Options. + * fsyntax-only: Warning Options. + * ftabstop: Preprocessor Options. + * ftemplate-depth: C++ Dialect Options. + * ftest-coverage: Debugging Options. + * fthread-jumps: Optimize Options. + * ftime-report: Debugging Options. + * ftrapv: Optimize Options. + * funroll-all-loops: Optimize Options. + * funroll-loops <1>: Non-bugs. + * funroll-loops: Optimize Options. + * funsafe-math-optimizations: Optimize Options. + * funsigned-bitfields <1>: Non-bugs. + * funsigned-bitfields: C Dialect Options. + * funsigned-char: C Dialect Options. + * funwind-tables: Code Gen Options. + * fuse-cxa-atexit: C++ Dialect Options. + * fverbose-asm: Code Gen Options. + * fvolatile: Code Gen Options. + * fvolatile-global: Code Gen Options. + * fvolatile-static: Code Gen Options. + * fvtable-gc: C++ Dialect Options. + * fwritable-strings <1>: Incompatibilities. + * fwritable-strings: C Dialect Options. + * G <1>: System V Options. + * G <2>: MIPS Options. + * G <3>: RS/6000 and PowerPC Options. + * G: M32R/D Options. + * g: Debugging Options. + * gcc: Preprocessor Options. + * gcoff: Debugging Options. + * gdwarf: Debugging Options. + * gdwarf+: Debugging Options. + * gdwarf-2: Debugging Options. + * gen-decls: Objective-C Dialect Options. + * ggdb: Debugging Options. + * gstabs: Debugging Options. + * gstabs+: Debugging Options. + * gvms: Debugging Options. + * gxcoff: Debugging Options. + * gxcoff+: Debugging Options. + * H: Preprocessor Options. + * h: Preprocessor Options. + * help <1>: Preprocessor Options. + * help: Overall Options. + * I <1>: Directory Options. + * I: Preprocessor Options. + * I- <1>: Directory Options. + * I-: Preprocessor Options. + * idirafter: Preprocessor Options. + * imacros: Preprocessor Options. + * include: Preprocessor Options. + * iprefix: Preprocessor Options. + * isystem: Preprocessor Options. + * iwithprefix: Preprocessor Options. + * iwithprefixbefore: Preprocessor Options. + * L: Directory Options. + * l: Link Options. + * lobjc: Link Options. + * M: Preprocessor Options. + * m1: SH Options. + * m10: PDP-11 Options. + * m128bit-long-double: i386 and x86-64 Options. + * m16-bit: CRIS Options. + * m2: SH Options. + * m210: MCore Options. + * m29000: AMD29K Options. + * m29050: AMD29K Options. + * m3: SH Options. + * m31: S/390 and zSeries Options. + * m32 <1>: i386 and x86-64 Options. + * m32: SPARC Options. + * m32-bit: CRIS Options. + * m32032: NS32K Options. + * m32081: NS32K Options. + * m32332: NS32K Options. + * m32381: NS32K Options. + * m32532: NS32K Options. + * m32r: M32R/D Options. + * m32rx: M32R/D Options. + * m340: MCore Options. + * m386: i386 and x86-64 Options. + * m3dnow: i386 and x86-64 Options. + * m3e: SH Options. + * m4: SH Options. + * m4-nofpu: SH Options. + * m4-single: SH Options. + * m4-single-only: SH Options. + * m40: PDP-11 Options. + * m45: PDP-11 Options. + * m4650: MIPS Options. + * m486: i386 and x86-64 Options. + * m4byte-functions: MCore Options. + * m5200: M680x0 Options. + * m64 <1>: S/390 and zSeries Options. + * m64 <2>: i386 and x86-64 Options. + * m64: SPARC Options. + * m68000: M680x0 Options. + * m68020: M680x0 Options. + * m68020-40: M680x0 Options. + * m68020-60: M680x0 Options. + * m68030: M680x0 Options. + * m68040: M680x0 Options. + * m68060: M680x0 Options. + * m6811: M68hc1x Options. + * m6812: M68hc1x Options. + * m68881: M680x0 Options. + * m68hc11: M68hc1x Options. + * m68hc12: M68hc1x Options. + * m8-bit: CRIS Options. + * m88000: M88K Options. + * m88100: M88K Options. + * m88110: M88K Options. + * m96bit-long-double: i386 and x86-64 Options. + * mabi-mmixware: MMIX Options. + * mabi=32: MIPS Options. + * mabi=64: MIPS Options. + * mabi=altivec: RS/6000 and PowerPC Options. + * mabi=eabi: MIPS Options. + * mabi=gnu: MMIX Options. + * mabi=n32: MIPS Options. + * mabi=no-altivec: RS/6000 and PowerPC Options. + * mabi=o64: MIPS Options. + * mabicalls: MIPS Options. + * mabort-on-noreturn: ARM Options. + * mabshi: PDP-11 Options. + * mac0: PDP-11 Options. + * maccumulate-outgoing-args: i386 and x86-64 Options. + * mads: RS/6000 and PowerPC Options. + * maix-struct-return: RS/6000 and PowerPC Options. + * maix32: RS/6000 and PowerPC Options. + * maix64: RS/6000 and PowerPC Options. + * malign-300: H8/300 Options. + * malign-double: i386 and x86-64 Options. + * malign-int: M680x0 Options. + * malignment-traps: ARM Options. + * malpha-as: DEC Alpha Options. + * maltivec: RS/6000 and PowerPC Options. + * mam33: MN10300 Options. + * maout: CRIS Options. + * mapcs: ARM Options. + * mapcs-26: ARM Options. + * mapcs-32: ARM Options. + * mapcs-frame: ARM Options. + * mapp-regs: SPARC Options. + * march <1>: CRIS Options. + * march <2>: HPPA Options. + * march <3>: i386 and x86-64 Options. + * march <4>: MIPS Options. + * march: ARM Options. + * margcount: Convex Options. + * masm-compat: Intel 960 Options. + * masm-optimize: D30V Options. + * masm=DIALECT: i386 and x86-64 Options. + * mauto-incdec: M68hc1x Options. + * mauto-pic: IA-64 Options. + * mb: SH Options. + * mb-step: IA-64 Options. + * mbackchain: S/390 and zSeries Options. + * mbase-addresses: MMIX Options. + * mbcopy: PDP-11 Options. + * mbig <1>: TMS320C3x/C4x Options. + * mbig: RS/6000 and PowerPC Options. + * mbig-endian <1>: Xtensa Options. + * mbig-endian <2>: IA-64 Options. + * mbig-endian <3>: MCore Options. + * mbig-endian <4>: RS/6000 and PowerPC Options. + * mbig-endian: ARM Options. + * mbig-memory: TMS320C3x/C4x Options. + * mbig-pic: M88K Options. + * mbig-switch <1>: V850 Options. + * mbig-switch: HPPA Options. + * mbigtable: SH Options. + * mbit-align: RS/6000 and PowerPC Options. + * mbitfield <1>: NS32K Options. + * mbitfield: M680x0 Options. + * mbk: TMS320C3x/C4x Options. + * mbooleans: Xtensa Options. + * mbranch-cheap: PDP-11 Options. + * mbranch-cost: D30V Options. + * mbranch-expensive: PDP-11 Options. + * mbranch-predict: MMIX Options. + * mbroken-saverestore: SPARC Options. + * mbsd: ARM Options. + * mbuild-constants: DEC Alpha Options. + * mbw: AMD29K Options. + * mbwx: DEC Alpha Options. + * mc1: Convex Options. + * mc2: Convex Options. + * mc300: Clipper Options. + * mc32: Convex Options. + * mc34: Convex Options. + * mc38: Convex Options. + * mc400: Clipper Options. + * mc68000: M680x0 Options. + * mc68020: M680x0 Options. + * mca: Intel 960 Options. + * mcall-aix: RS/6000 and PowerPC Options. + * mcall-gnu: RS/6000 and PowerPC Options. + * mcall-lib-mul: RT Options. + * mcall-linux: RS/6000 and PowerPC Options. + * mcall-netbsd: RS/6000 and PowerPC Options. + * mcall-prologues: AVR Options. + * mcall-solaris: RS/6000 and PowerPC Options. + * mcall-sysv: RS/6000 and PowerPC Options. + * mcall-sysv-eabi: RS/6000 and PowerPC Options. + * mcall-sysv-noeabi: RS/6000 and PowerPC Options. + * mcallee-super-interworking: ARM Options. + * mcaller-super-interworking: ARM Options. + * mcallgraph-data: MCore Options. + * mcc-init: CRIS Options. + * mcf: Intel 960 Options. + * mcheck-zero-division: M88K Options. + * mcix: DEC Alpha Options. + * mcmodel=embmedany: SPARC Options. + * mcmodel=kernel: i386 and x86-64 Options. + * mcmodel=large: i386 and x86-64 Options. + * mcmodel=medany: SPARC Options. + * mcmodel=medium: i386 and x86-64 Options. + * mcmodel=medlow: SPARC Options. + * mcmodel=medmid: SPARC Options. + * mcmodel=small: i386 and x86-64 Options. + * mcode-align: Intel 960 Options. + * mcode-model=large: M32R/D Options. + * mcode-model=medium: M32R/D Options. + * mcode-model=small: M32R/D Options. + * mcomplex-addr: Intel 960 Options. + * mcond-exec: D30V Options. + * mconst-align: CRIS Options. + * mconstant-gp: IA-64 Options. + * mcpu <1>: CRIS Options. + * mcpu <2>: ARC Options. + * mcpu <3>: TMS320C3x/C4x Options. + * mcpu <4>: DEC Alpha Options. + * mcpu <5>: i386 and x86-64 Options. + * mcpu <6>: MIPS Options. + * mcpu <7>: RS/6000 and PowerPC Options. + * mcpu <8>: ARM Options. + * mcpu: SPARC Options. + * mcpu32: M680x0 Options. + * mcypress: SPARC Options. + * MD: Preprocessor Options. + * mdalign: SH Options. + * mdata: ARC Options. + * mdata-align: CRIS Options. + * mdb: TMS320C3x/C4x Options. + * mdebug: S/390 and zSeries Options. + * mdec-asm: PDP-11 Options. + * mdensity: Xtensa Options. + * mdisable-fpregs: HPPA Options. + * mdisable-indexing: HPPA Options. + * mdiv: MCore Options. + * mdouble-float: MIPS Options. + * mdp-isr-reload: TMS320C3x/C4x Options. + * mdw: AMD29K Options. + * mdwarf2-asm: IA-64 Options. + * meabi: RS/6000 and PowerPC Options. + * melf <1>: MMIX Options. + * melf: CRIS Options. + * melinux: CRIS Options. + * melinux-stacksize: CRIS Options. + * memb: RS/6000 and PowerPC Options. + * membedded-data: MIPS Options. + * membedded-pic: MIPS Options. + * mentry: MIPS Options. + * mep: V850 Options. + * mepsilon: MMIX Options. + * metrax100: CRIS Options. + * metrax4: CRIS Options. + * mexplicit-relocs: DEC Alpha Options. + * mextmem: D30V Options. + * mextmemory: D30V Options. + * MF: Preprocessor Options. + * mfast-fix: TMS320C3x/C4x Options. + * mfast-indirect-calls: HPPA Options. + * mfaster-structs: SPARC Options. + * mfix: DEC Alpha Options. + * mfix7000: MIPS Options. + * mfixed-range: IA-64 Options. + * mflat: SPARC Options. + * mfloat-ieee: DEC Alpha Options. + * mfloat-vax: DEC Alpha Options. + * mfloat32: PDP-11 Options. + * mfloat64: PDP-11 Options. + * mflush-func: MIPS Options. + * mfmovd: SH Options. + * mfp: ARM Options. + * mfp-arg-in-fpregs: RT Options. + * mfp-arg-in-gregs: RT Options. + * mfp-reg: DEC Alpha Options. + * mfp-rounding-mode: DEC Alpha Options. + * mfp-trap-mode: DEC Alpha Options. + * mfp32: MIPS Options. + * mfp64: MIPS Options. + * mfpa: M680x0 Options. + * mfpe: ARM Options. + * mfpu <1>: PDP-11 Options. + * mfpu: SPARC Options. + * mfull-fp-blocks: RT Options. + * mfull-toc: RS/6000 and PowerPC Options. + * mfused-madd <1>: Xtensa Options. + * mfused-madd <2>: MIPS Options. + * mfused-madd: RS/6000 and PowerPC Options. + * mg: VAX Options. + * MG: Preprocessor Options. + * mgas <1>: DEC Alpha Options. + * mgas <2>: HPPA Options. + * mgas: MIPS Options. + * mgnu: VAX Options. + * mgnu-as: IA-64 Options. + * mgnu-ld: IA-64 Options. + * mgotplt: CRIS Options. + * mgp32: MIPS Options. + * mgp64: MIPS Options. + * mgpopt: MIPS Options. + * mh: H8/300 Options. + * mhalf-pic: MIPS Options. + * mhandle-large-shift: M88K Options. + * mhard-float <1>: Xtensa Options. + * mhard-float <2>: S/390 and zSeries Options. + * mhard-float <3>: MIPS Options. + * mhard-float <4>: RS/6000 and PowerPC Options. + * mhard-float <5>: ARM Options. + * mhard-float: SPARC Options. + * mhard-quad-float: SPARC Options. + * mhardlit: MCore Options. + * mhc-struct-return <1>: Interoperation. + * mhc-struct-return: RT Options. + * mhimem: NS32K Options. + * mhitachi: SH Options. + * mic-compat: Intel 960 Options. + * mic2.0-compat: Intel 960 Options. + * mic3.0-compat: Intel 960 Options. + * midentify-revision: M88K Options. + * mieee <1>: SH Options. + * mieee: DEC Alpha Options. + * mieee-conformant: DEC Alpha Options. + * mieee-fp: i386 and x86-64 Options. + * mieee-with-inexact: DEC Alpha Options. + * mimpure-text: AMD29K Options. + * min-line-mul: RT Options. + * minit-stack: AVR Options. + * minline-all-stringops: i386 and x86-64 Options. + * minline-divide-max-throughput: IA-64 Options. + * minline-divide-min-latency: IA-64 Options. + * mint16: PDP-11 Options. + * mint32 <1>: PDP-11 Options. + * mint32: H8/300 Options. + * mint64: MIPS Options. + * mintel-asm: Intel 960 Options. + * mips1: MIPS Options. + * mips16: MIPS Options. + * mips2: MIPS Options. + * mips3: MIPS Options. + * mips4: MIPS Options. + * misize: SH Options. + * mjump-in-delay: HPPA Options. + * mka: Intel 960 Options. + * mkb: Intel 960 Options. + * mkernel-registers: AMD29K Options. + * mknuthdiv: MMIX Options. + * ml: SH Options. + * mlarge: AMD29K Options. + * mlarge-data: DEC Alpha Options. + * mleaf-procedures: Intel 960 Options. + * mlibfuncs: MMIX Options. + * mlinker-opt: HPPA Options. + * mlinux: CRIS Options. + * mlittle: RS/6000 and PowerPC Options. + * mlittle-endian <1>: Xtensa Options. + * mlittle-endian <2>: IA-64 Options. + * mlittle-endian <3>: MCore Options. + * mlittle-endian <4>: RS/6000 and PowerPC Options. + * mlittle-endian <5>: ARM Options. + * mlittle-endian: SPARC Options. + * mlive-g0: SPARC Options. + * mlong-calls <1>: V850 Options. + * mlong-calls <2>: MIPS Options. + * mlong-calls: ARM Options. + * mlong-double-64: Intel 960 Options. + * mlong-load-store: HPPA Options. + * mlong32 <1>: MIPS Options. + * mlong32: Convex Options. + * mlong64 <1>: MIPS Options. + * mlong64: Convex Options. + * mlongcalls: Xtensa Options. + * mloop-unsigned: TMS320C3x/C4x Options. + * MM: Preprocessor Options. + * mmac16: Xtensa Options. + * mmad: MIPS Options. + * mmangle-cpu: ARC Options. + * mmax: DEC Alpha Options. + * mmax-stack-frame: CRIS Options. + * mmc: Intel 960 Options. + * mmcu: AVR Options. + * MMD: Preprocessor Options. + * mmemcpy: MIPS Options. + * mmemory-latency: DEC Alpha Options. + * mmemparm: TMS320C3x/C4x Options. + * mminimal-toc: RS/6000 and PowerPC Options. + * mminimum-fp-blocks: RT Options. + * mminmax: Xtensa Options. + * mmips-as: MIPS Options. + * mmips-tfile: MIPS Options. + * mmmx: i386 and x86-64 Options. + * mmpyi: TMS320C3x/C4x Options. + * mmul16: Xtensa Options. + * mmul32: Xtensa Options. + * mmult-bug: MN10300 Options. + * mmulti-add: NS32K Options. + * mmultiple: RS/6000 and PowerPC Options. + * mmvcle: S/390 and zSeries Options. + * mmvme: RS/6000 and PowerPC Options. + * mnbw: AMD29K Options. + * mndw: AMD29K Options. + * mnew-mnemonics: RS/6000 and PowerPC Options. + * mno-3dnow: i386 and x86-64 Options. + * mno-4byte-functions: MCore Options. + * mno-abicalls: MIPS Options. + * mno-abshi: PDP-11 Options. + * mno-ac0: PDP-11 Options. + * mno-align-double: i386 and x86-64 Options. + * mno-align-int: M680x0 Options. + * mno-align-stringops: i386 and x86-64 Options. + * mno-alignment-traps: ARM Options. + * mno-altivec: RS/6000 and PowerPC Options. + * mno-am33: MN10300 Options. + * mno-app-regs: SPARC Options. + * mno-asm-optimize: D30V Options. + * mno-backchain: S/390 and zSeries Options. + * mno-base-addresses: MMIX Options. + * mno-bit-align: RS/6000 and PowerPC Options. + * mno-bk: TMS320C3x/C4x Options. + * mno-booleans: Xtensa Options. + * mno-branch-predict: MMIX Options. + * mno-bwx: DEC Alpha Options. + * mno-callgraph-data: MCore Options. + * mno-check-zero-division: M88K Options. + * mno-cix: DEC Alpha Options. + * mno-code-align: Intel 960 Options. + * mno-complex-addr: Intel 960 Options. + * mno-const-align: CRIS Options. + * mno-crt0: MN10300 Options. + * mno-data-align: CRIS Options. + * mno-db: TMS320C3x/C4x Options. + * mno-debug: S/390 and zSeries Options. + * mno-density: Xtensa Options. + * mno-div: MCore Options. + * mno-dwarf2-asm: IA-64 Options. + * mno-eabi: RS/6000 and PowerPC Options. + * mno-embedded-data: MIPS Options. + * mno-embedded-pic: MIPS Options. + * mno-ep: V850 Options. + * mno-epsilon: MMIX Options. + * mno-explicit-relocs: DEC Alpha Options. + * mno-fancy-math-387: i386 and x86-64 Options. + * mno-fast-fix: TMS320C3x/C4x Options. + * mno-faster-structs: SPARC Options. + * mno-fix: DEC Alpha Options. + * mno-flat: SPARC Options. + * mno-float32: PDP-11 Options. + * mno-float64: PDP-11 Options. + * mno-fp-in-toc: RS/6000 and PowerPC Options. + * mno-fp-regs: DEC Alpha Options. + * mno-fp-ret-in-387: i386 and x86-64 Options. + * mno-fpu: SPARC Options. + * mno-fused-madd <1>: Xtensa Options. + * mno-fused-madd <2>: MIPS Options. + * mno-fused-madd: RS/6000 and PowerPC Options. + * mno-gnu-as: IA-64 Options. + * mno-gnu-ld: IA-64 Options. + * mno-gotplt: CRIS Options. + * mno-gpopt: MIPS Options. + * mno-half-pic: MIPS Options. + * mno-hardlit: MCore Options. + * mno-ieee-fp: i386 and x86-64 Options. + * mno-impure-text: AMD29K Options. + * mno-int16: PDP-11 Options. + * mno-int32: PDP-11 Options. + * mno-interrupts: AVR Options. + * mno-knuthdiv: MMIX Options. + * mno-leaf-procedures: Intel 960 Options. + * mno-libfuncs: MMIX Options. + * mno-long-calls <1>: V850 Options. + * mno-long-calls <2>: MIPS Options. + * mno-long-calls: ARM Options. + * mno-longcalls: Xtensa Options. + * mno-loop-unsigned: TMS320C3x/C4x Options. + * mno-mac16: Xtensa Options. + * mno-mad: MIPS Options. + * mno-max: DEC Alpha Options. + * mno-memcpy: MIPS Options. + * mno-minmax: Xtensa Options. + * mno-mips-tfile: MIPS Options. + * mno-mips16: MIPS Options. + * mno-mmx: i386 and x86-64 Options. + * mno-mpyi: TMS320C3x/C4x Options. + * mno-mul16: Xtensa Options. + * mno-mul32: Xtensa Options. + * mno-mult-bug: MN10300 Options. + * mno-multiple: RS/6000 and PowerPC Options. + * mno-multm: AMD29K Options. + * mno-mvcle: S/390 and zSeries Options. + * mno-nsa: Xtensa Options. + * mno-ocs-debug-info: M88K Options. + * mno-ocs-frame-position: M88K Options. + * mno-optimize-arg-area: M88K Options. + * mno-parallel-insns: TMS320C3x/C4x Options. + * mno-parallel-mpy: TMS320C3x/C4x Options. + * mno-pic: IA-64 Options. + * mno-power: RS/6000 and PowerPC Options. + * mno-power2: RS/6000 and PowerPC Options. + * mno-powerpc: RS/6000 and PowerPC Options. + * mno-powerpc-gfxopt: RS/6000 and PowerPC Options. + * mno-powerpc-gpopt: RS/6000 and PowerPC Options. + * mno-powerpc64: RS/6000 and PowerPC Options. + * mno-prolog-function: V850 Options. + * mno-prologue-epilogue: CRIS Options. + * mno-prototype: RS/6000 and PowerPC Options. + * mno-push-args: i386 and x86-64 Options. + * mno-register-names: IA-64 Options. + * mno-regnames: RS/6000 and PowerPC Options. + * mno-relax-immediate: MCore Options. + * mno-relocatable: RS/6000 and PowerPC Options. + * mno-relocatable-lib: RS/6000 and PowerPC Options. + * mno-reuse-arg-regs: AMD29K Options. + * mno-rnames: MIPS Options. + * mno-rptb: TMS320C3x/C4x Options. + * mno-rpts: TMS320C3x/C4x Options. + * mno-sched-prolog: ARM Options. + * mno-sdata <1>: IA-64 Options. + * mno-sdata: RS/6000 and PowerPC Options. + * mno-serialize-volatile <1>: Interoperation. + * mno-serialize-volatile <2>: Xtensa Options. + * mno-serialize-volatile: M88K Options. + * mno-sext: Xtensa Options. + * mno-short-load-bytes: ARM Options. + * mno-short-load-words: ARM Options. + * mno-side-effects: CRIS Options. + * mno-slow-bytes: MCore Options. + * mno-small-exec: S/390 and zSeries Options. + * mno-soft-float: DEC Alpha Options. + * mno-space-regs: HPPA Options. + * mno-split: PDP-11 Options. + * mno-split-addresses: MIPS Options. + * mno-sse: i386 and x86-64 Options. + * mno-stack-align: CRIS Options. + * mno-stack-bias: SPARC Options. + * mno-stack-check: AMD29K Options. + * mno-stats: MIPS Options. + * mno-storem-bug: AMD29K Options. + * mno-strict-align <1>: Intel 960 Options. + * mno-strict-align <2>: RS/6000 and PowerPC Options. + * mno-strict-align: M680x0 Options. + * mno-string: RS/6000 and PowerPC Options. + * mno-sum-in-toc: RS/6000 and PowerPC Options. + * mno-svr3-shlib: i386 and x86-64 Options. + * mno-symrename: ARM Options. + * mno-tablejump: AVR Options. + * mno-tail-call: Intel 960 Options. + * mno-target-align: Xtensa Options. + * mno-text-section-literals: Xtensa Options. + * mno-toc: RS/6000 and PowerPC Options. + * mno-toplevel-symbols: MMIX Options. + * mno-unaligned-doubles: SPARC Options. + * mno-underscores: M88K Options. + * mno-uninit-const-in-rodata: MIPS Options. + * mno-update: RS/6000 and PowerPC Options. + * mno-volatile-asm-stop: IA-64 Options. + * mno-wide-bitfields: MCore Options. + * mno-xl-call: RS/6000 and PowerPC Options. + * mno-zero-extend: MMIX Options. + * mnoargcount: Convex Options. + * mnobitfield <1>: NS32K Options. + * mnobitfield: M680x0 Options. + * mnohc-struct-return: RT Options. + * mnohimem: NS32K Options. + * mnomacsave: SH Options. + * mnomulti-add: NS32K Options. + * mnop-fun-dllimport: ARM Options. + * mnoregparam: NS32K Options. + * mnormal: AMD29K Options. + * mnosb: NS32K Options. + * mnsa: Xtensa Options. + * mnumerics: Intel 960 Options. + * mocs-debug-info: M88K Options. + * mocs-frame-position: M88K Options. + * mold-align: Intel 960 Options. + * mold-mnemonics: RS/6000 and PowerPC Options. + * momit-leaf-frame-pointer: i386 and x86-64 Options. + * monchip: D30V Options. + * moptimize-arg-area: M88K Options. + * MP: Preprocessor Options. + * mpa-risc-1-0: HPPA Options. + * mpa-risc-1-1: HPPA Options. + * mpa-risc-2-0: HPPA Options. + * mpadstruct: SH Options. + * mparallel-insns: TMS320C3x/C4x Options. + * mparallel-mpy: TMS320C3x/C4x Options. + * mparanoid: TMS320C3x/C4x Options. + * mpcrel: M680x0 Options. + * mpdebug: CRIS Options. + * mpe: RS/6000 and PowerPC Options. + * mpentium: i386 and x86-64 Options. + * mpentiumpro: i386 and x86-64 Options. + * mpic-register: ARM Options. + * mpoke-function-name: ARM Options. + * mportable-runtime: HPPA Options. + * mpower: RS/6000 and PowerPC Options. + * mpower2: RS/6000 and PowerPC Options. + * mpowerpc: RS/6000 and PowerPC Options. + * mpowerpc-gfxopt: RS/6000 and PowerPC Options. + * mpowerpc-gpopt: RS/6000 and PowerPC Options. + * mpowerpc64: RS/6000 and PowerPC Options. + * mprefergot: SH Options. + * mpreferred-stack-boundary: i386 and x86-64 Options. + * mprolog-function: V850 Options. + * mprologue-epilogue: CRIS Options. + * mprototype: RS/6000 and PowerPC Options. + * mpush-args: i386 and x86-64 Options. + * MQ: Preprocessor Options. + * mregister-names: IA-64 Options. + * mregnames: RS/6000 and PowerPC Options. + * mregparam: NS32K Options. + * mregparm <1>: TMS320C3x/C4x Options. + * mregparm: i386 and x86-64 Options. + * mrelax <1>: SH Options. + * mrelax <2>: H8/300 Options. + * mrelax <3>: MN10300 Options. + * mrelax: MN10200 Options. + * mrelax-immediate: MCore Options. + * mrelocatable: RS/6000 and PowerPC Options. + * mrelocatable-lib: RS/6000 and PowerPC Options. + * mreuse-arg-regs: AMD29K Options. + * mrnames: MIPS Options. + * mrodata: ARC Options. + * mrptb: TMS320C3x/C4x Options. + * mrpts: TMS320C3x/C4x Options. + * mrtd <1>: Function Attributes. + * mrtd <2>: NS32K Options. + * mrtd <3>: i386 and x86-64 Options. + * mrtd: M680x0 Options. + * ms: H8/300 Options. + * ms2600: H8/300 Options. + * msa: Intel 960 Options. + * msb <1>: NS32K Options. + * msb: Intel 960 Options. + * mschedule: HPPA Options. + * msda: V850 Options. + * msdata <1>: IA-64 Options. + * msdata: RS/6000 and PowerPC Options. + * msdata-data: RS/6000 and PowerPC Options. + * msdata=default: RS/6000 and PowerPC Options. + * msdata=eabi: RS/6000 and PowerPC Options. + * msdata=none <1>: RS/6000 and PowerPC Options. + * msdata=none: M32R/D Options. + * msdata=sdata: M32R/D Options. + * msdata=sysv: RS/6000 and PowerPC Options. + * msdata=use: M32R/D Options. + * mserialize-volatile <1>: Xtensa Options. + * mserialize-volatile: M88K Options. + * msext: Xtensa Options. + * mshort <1>: M68hc1x Options. + * mshort: M680x0 Options. + * mshort-data: M88K Options. + * mshort-load-bytes: ARM Options. + * mshort-load-words: ARM Options. + * msim <1>: Xstormy16 Options. + * msim: RS/6000 and PowerPC Options. + * msingle-float: MIPS Options. + * msingle-pic-base: ARM Options. + * msize: AVR Options. + * mslow-bytes: MCore Options. + * msmall <1>: TMS320C3x/C4x Options. + * msmall: AMD29K Options. + * msmall-data: DEC Alpha Options. + * msmall-exec: S/390 and zSeries Options. + * msmall-memory: TMS320C3x/C4x Options. + * msoft-float <1>: Xtensa Options. + * msoft-float <2>: PDP-11 Options. + * msoft-float <3>: S/390 and zSeries Options. + * msoft-float <4>: NS32K Options. + * msoft-float <5>: DEC Alpha Options. + * msoft-float <6>: Intel 960 Options. + * msoft-float <7>: HPPA Options. + * msoft-float <8>: i386 and x86-64 Options. + * msoft-float <9>: MIPS Options. + * msoft-float <10>: RS/6000 and PowerPC Options. + * msoft-float <11>: ARM Options. + * msoft-float <12>: AMD29K Options. + * msoft-float <13>: SPARC Options. + * msoft-float: M680x0 Options. + * msoft-quad-float: SPARC Options. + * msoft-reg-count: M68hc1x Options. + * mspace <1>: V850 Options. + * mspace: SH Options. + * msparclite: SPARC Options. + * msplit: PDP-11 Options. + * msplit-addresses: MIPS Options. + * msse: i386 and x86-64 Options. + * mstack-align: CRIS Options. + * mstack-bias: SPARC Options. + * mstack-check: AMD29K Options. + * mstats: MIPS Options. + * mstorem-bug: AMD29K Options. + * mstrict-align <1>: Intel 960 Options. + * mstrict-align <2>: RS/6000 and PowerPC Options. + * mstrict-align: M680x0 Options. + * mstring: RS/6000 and PowerPC Options. + * mstructure-size-boundary: ARM Options. + * msupersparc: SPARC Options. + * msvr3: M88K Options. + * msvr3-shlib: i386 and x86-64 Options. + * msvr4: M88K Options. + * msvr4-struct-return: RS/6000 and PowerPC Options. + * MT: Preprocessor Options. + * mtail-call: Intel 960 Options. + * mtarget-align: Xtensa Options. + * mtda: V850 Options. + * mtext: ARC Options. + * mtext-section-literals: Xtensa Options. + * mthreads: i386 and x86-64 Options. + * mthumb: ARM Options. + * mthumb-interwork: ARM Options. + * mti: TMS320C3x/C4x Options. + * mtiny-stack: AVR Options. + * mtoc: RS/6000 and PowerPC Options. + * mtoplevel-symbols: MMIX Options. + * mtpcs-frame: ARM Options. + * mtpcs-leaf-frame: ARM Options. + * mtrap-large-shift: M88K Options. + * mtrap-precision: DEC Alpha Options. + * mtune <1>: CRIS Options. + * mtune <2>: DEC Alpha Options. + * mtune <3>: MIPS Options. + * mtune <4>: RS/6000 and PowerPC Options. + * mtune <5>: ARM Options. + * mtune: SPARC Options. + * munaligned-doubles: SPARC Options. + * muninit-const-in-rodata: MIPS Options. + * munix: VAX Options. + * munix-asm: PDP-11 Options. + * mupdate: RS/6000 and PowerPC Options. + * muse-div-instruction: M88K Options. + * muser-registers: AMD29K Options. + * musermode: SH Options. + * mv8: SPARC Options. + * mv850: V850 Options. + * mversion-03.00: M88K Options. + * mvms-return-codes: DEC Alpha/VMS Options. + * mvolatile-asm-stop: IA-64 Options. + * mvolatile-cache: Convex Options. + * mvolatile-nocache: Convex Options. + * mvxworks: RS/6000 and PowerPC Options. + * mwarn-passed-structs: M88K Options. + * mwide-bitfields: MCore Options. + * mwords-little-endian: ARM Options. + * mxl-call: RS/6000 and PowerPC Options. + * mxopen: ARM Options. + * myellowknife: RS/6000 and PowerPC Options. + * mzda: V850 Options. + * mzero-extend: MMIX Options. + * no-crt0: MIPS Options. + * no-integrated-cpp: C Dialect Options. + * no-red-zone: i386 and x86-64 Options. + * noasmopt: Interoperation. + * nocpp: MIPS Options. + * nodefaultlibs: Link Options. + * nostartfiles: Link Options. + * nostdinc: Preprocessor Options. + * nostdinc++ <1>: Preprocessor Options. + * nostdinc++: C++ Dialect Options. + * nostdlib: Link Options. + * o: Preprocessor Options. + * O: Optimize Options. + * o: Overall Options. + * O0: Optimize Options. + * O1: Optimize Options. + * O2: Optimize Options. + * O3: Optimize Options. + * Os: Optimize Options. + * P: Preprocessor Options. + * p: Debugging Options. + * param: Optimize Options. + * pass-exit-codes: Overall Options. + * pedantic <1>: Warnings and Errors. + * pedantic <2>: Alternate Keywords. + * pedantic <3>: C Extensions. + * pedantic <4>: Preprocessor Options. + * pedantic <5>: Warning Options. + * pedantic: Standards. + * pedantic-errors <1>: Warnings and Errors. + * pedantic-errors <2>: Non-bugs. + * pedantic-errors <3>: Actual Bugs. + * pedantic-errors <4>: Preprocessor Options. + * pedantic-errors <5>: Warning Options. + * pedantic-errors: Standards. + * pg: Debugging Options. + * pipe: Overall Options. + * print-file-name: Debugging Options. + * print-libgcc-file-name: Debugging Options. + * print-multi-directory: Debugging Options. + * print-multi-lib: Debugging Options. + * print-prog-name: Debugging Options. + * print-search-dirs: Debugging Options. + * pthread: RS/6000 and PowerPC Options. + * Q: Debugging Options. + * Qn: System V Options. + * Qy: System V Options. + * remap: Preprocessor Options. + * s: Link Options. + * S <1>: Link Options. + * S: Overall Options. + * save-temps: Debugging Options. + * shared: Link Options. + * shared-libgcc: Link Options. + * sim: CRIS Options. + * sim2: CRIS Options. + * specs: Directory Options. + * static: Link Options. + * static-libgcc: Link Options. + * std <1>: Non-bugs. + * std <2>: Other Builtins. + * std <3>: C Dialect Options. + * std: Standards. + * std=: Preprocessor Options. + * symbolic: Link Options. + * target-help <1>: Preprocessor Options. + * target-help: Overall Options. + * time: Debugging Options. + * traditional <1>: Non-bugs. + * traditional <2>: Incompatibilities. + * traditional <3>: Preprocessor Options. + * traditional <4>: C Dialect Options. + * traditional: Standards. + * traditional-cpp: C Dialect Options. + * trigraphs <1>: Preprocessor Options. + * trigraphs: C Dialect Options. + * u: Link Options. + * U: Preprocessor Options. + * undef: Preprocessor Options. + * V: Target Options. + * v <1>: Preprocessor Options. + * v: Overall Options. + * version <1>: Preprocessor Options. + * version: Overall Options. + * W: Incompatibilities. + * w: Preprocessor Options. + * W: Warning Options. + * w: Warning Options. + * Wa: Assembler Options. + * Wabi: C++ Dialect Options. + * Waggregate-return: Warning Options. + * Wall <1>: Standard Libraries. + * Wall <2>: Preprocessor Options. + * Wall: Warning Options. + * Wbad-function-cast: Warning Options. + * Wcast-align: Warning Options. + * Wcast-qual: Warning Options. + * Wchar-subscripts: Warning Options. + * Wcomment <1>: Preprocessor Options. + * Wcomment: Warning Options. + * Wcomments: Preprocessor Options. + * Wconversion <1>: Protoize Caveats. + * Wconversion: Warning Options. + * Wctor-dtor-privacy: C++ Dialect Options. + * Wdisabled-optimization: Warning Options. + * Wdiv-by-zero: Warning Options. + * Weffc++: C++ Dialect Options. + * Werror <1>: Preprocessor Options. + * Werror: Warning Options. + * Werror-implicit-function-declaration: Warning Options. + * Wfloat-equal: Warning Options. + * Wformat <1>: Function Attributes. + * Wformat: Warning Options. + * Wformat-nonliteral <1>: Function Attributes. + * Wformat-nonliteral: Warning Options. + * Wformat-security: Warning Options. + * Wformat=2: Warning Options. + * Wimplicit: Warning Options. + * Wimplicit-function-declaration: Warning Options. + * Wimplicit-int: Warning Options. + * Wimport: Preprocessor Options. + * Winline <1>: Inline. + * Winline: Warning Options. + * Wl: Link Options. + * Wlarger-than: Warning Options. + * Wlong-long: Warning Options. + * Wmain: Warning Options. + * Wmissing-braces: Warning Options. + * Wmissing-declarations: Warning Options. + * Wmissing-format-attribute: Warning Options. + * Wmissing-noreturn: Warning Options. + * Wmissing-prototypes: Warning Options. + * Wmultichar: Warning Options. + * Wnested-externs: Warning Options. + * Wno-deprecated: C++ Dialect Options. + * Wno-deprecated-declarations: Warning Options. + * Wno-div-by-zero: Warning Options. + * Wno-format-extra-args: Warning Options. + * Wno-format-y2k: Warning Options. + * Wno-import: Warning Options. + * Wno-long-long: Warning Options. + * Wno-multichar: Warning Options. + * Wno-non-template-friend: C++ Dialect Options. + * Wno-pmf-conversions <1>: Bound member functions. + * Wno-pmf-conversions: C++ Dialect Options. + * Wno-protocol: Objective-C Dialect Options. + * Wnon-virtual-dtor: C++ Dialect Options. + * Wold-style-cast: C++ Dialect Options. + * Woverloaded-virtual: C++ Dialect Options. + * Wp: Preprocessor Options. + * Wpacked: Warning Options. + * Wpadded: Warning Options. + * Wparentheses: Warning Options. + * Wpointer-arith <1>: Pointer Arith. + * Wpointer-arith: Warning Options. + * Wredundant-decls: Warning Options. + * Wreorder <1>: Warning Options. + * Wreorder: C++ Dialect Options. + * Wreturn-type: Warning Options. + * Wselector: Objective-C Dialect Options. + * Wsequence-point: Warning Options. + * Wshadow: Warning Options. + * Wsign-compare: Warning Options. + * Wsign-promo: C++ Dialect Options. + * Wstrict-prototypes: Warning Options. + * Wswitch: Warning Options. + * Wsynth: C++ Dialect Options. + * Wsystem-headers <1>: Preprocessor Options. + * Wsystem-headers: Warning Options. + * Wtraditional <1>: Preprocessor Options. + * Wtraditional: Warning Options. + * Wtrigraphs <1>: Preprocessor Options. + * Wtrigraphs: Warning Options. + * Wundef <1>: Preprocessor Options. + * Wundef: Warning Options. + * Wuninitialized: Warning Options. + * Wunknown-pragmas: Warning Options. + * Wunreachable-code: Warning Options. + * Wunused: Warning Options. + * Wunused-function: Warning Options. + * Wunused-label: Warning Options. + * Wunused-parameter: Warning Options. + * Wunused-value: Warning Options. + * Wunused-variable: Warning Options. + * Wwrite-strings: Warning Options. + * x <1>: Preprocessor Options. + * x: Overall Options. + * Xlinker: Link Options. + * Ym: System V Options. + * YP: System V Options. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-23 gcc-3.2.3/gcc/doc/gcc.info-23 *** gcc-3.2.2/gcc/doc/gcc.info-23 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-23 Tue Apr 22 07:07:15 2003 *************** *** 0 **** --- 1,749 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Index, Prev: Option Index, Up: Top + + Index + ***** + + * Menu: + + * ! in constraint: Multi-Alternative. + * # in constraint: Modifiers. + * #pragma: Pragmas. + * #pragma implementation: C++ Interface. + * #pragma implementation, implied: C++ Interface. + * #pragma interface: C++ Interface. + * #pragma, reason for not using: Function Attributes. + * $: Dollar Signs. + * % in constraint: Modifiers. + * %include: Spec Files. + * %include_noerr: Spec Files. + * %rename: Spec Files. + * & in constraint: Modifiers. + * ': Incompatibilities. + * * in constraint: Modifiers. + * + in constraint: Modifiers. + * -lgcc, use with -nodefaultlibs: Link Options. + * -lgcc, use with -nostdlib: Link Options. + * -nodefaultlibs and unresolved references: Link Options. + * -nostdlib and unresolved references: Link Options. + * .sdata/.sdata2 references (PowerPC): RS/6000 and PowerPC Options. + * //: C++ Comments. + * 0 in constraint: Simple Constraints. + * < in constraint: Simple Constraints. + * in constraint: Simple Constraints. + * >?: Min and Max. + * ? in constraint: Multi-Alternative. + * ?: extensions <1>: Conditionals. + * ?: extensions: Lvalues. + * ?: side effect: Conditionals. + * \a: C Dialect Options. + * \x: C Dialect Options. + * _ in variables in macros: Typeof. + * __builtin_apply: Constructing Calls. + * __builtin_apply_args: Constructing Calls. + * __builtin_choose_expr: Other Builtins. + * __builtin_constant_p: Other Builtins. + * __builtin_expect: Other Builtins. + * __builtin_frame_address: Return Address. + * __builtin_isgreater: Other Builtins. + * __builtin_isgreaterequal: Other Builtins. + * __builtin_isless: Other Builtins. + * __builtin_islessequal: Other Builtins. + * __builtin_islessgreater: Other Builtins. + * __builtin_isunordered: Other Builtins. + * __builtin_prefetch: Other Builtins. + * __builtin_return: Constructing Calls. + * __builtin_return_address: Return Address. + * __builtin_types_compatible_p: Other Builtins. + * __complex__ keyword: Complex. + * __extension__: Alternate Keywords. + * __func__ identifier: Function Names. + * __FUNCTION__ identifier: Function Names. + * __imag__ keyword: Complex. + * __PRETTY_FUNCTION__ identifier: Function Names. + * __real__ keyword: Complex. + * __STDC_HOSTED__: Standards. + * _Complex keyword: Complex. + * _Exit: Other Builtins. + * _exit: Other Builtins. + * ABI: Compatibility. + * abort: Other Builtins. + * abs: Other Builtins. + * accessing volatiles: Volatiles. + * Ada: G++ and GCC. + * address constraints: Simple Constraints. + * address of a label: Labels as Values. + * address_operand: Simple Constraints. + * alias attribute: Function Attributes. + * aliasing of parameters: Code Gen Options. + * aligned attribute <1>: Type Attributes. + * aligned attribute: Variable Attributes. + * alignment: Alignment. + * Alliant: Interoperation. + * alloca: Other Builtins. + * alloca vs variable-length arrays: Variable Length. + * alternate keywords: Alternate Keywords. + * always_inline function attribute: Function Attributes. + * AMD x86-64 Options: i386 and x86-64 Options. + * AMD1: Standards. + * AMD29K options: AMD29K Options. + * ANSI C: Standards. + * ANSI C standard: Standards. + * ANSI C89: Standards. + * ANSI support: C Dialect Options. + * ANSI X3.159-1989: Standards. + * apostrophes: Incompatibilities. + * application binary interface: Compatibility. + * ARC Options: ARC Options. + * arguments in frame (88k): M88K Options. + * ARM [Annotated C++ Reference Manual]: Backwards Compatibility. + * ARM options: ARM Options. + * arrays of length zero: Zero Length. + * arrays of variable length: Variable Length. + * arrays, non-lvalue: Subscripting. + * asm constraints: Constraints. + * asm expressions: Extended Asm. + * assembler instructions: Extended Asm. + * assembler names for identifiers: Asm Labels. + * assembler syntax, 88k: M88K Options. + * assembly code, invalid: Bug Criteria. + * attribute of types: Type Attributes. + * attribute of variables: Variable Attributes. + * attribute syntax: Attribute Syntax. + * autoincrement/decrement addressing: Simple Constraints. + * automatic inline for C++ member fns: Inline. + * AVR Options: AVR Options. + * backtrace for bug reports: Bug Reporting. + * Backwards Compatibility: Backwards Compatibility. + * bcmp: Other Builtins. + * binary compatibility: Compatibility. + * bit shift overflow (88k): M88K Options. + * bound pointer to member function: Bound member functions. + * bug criteria: Bug Criteria. + * bug report mailing lists: Bug Lists. + * bugs: Bugs. + * bugs, known: Trouble. + * built-in functions <1>: Other Builtins. + * built-in functions: C Dialect Options. + * byte writes (29k): AMD29K Options. + * bzero: Other Builtins. + * C compilation options: Invoking GCC. + * C intermediate output, nonexistent: G++ and GCC. + * C language extensions: C Extensions. + * C language, traditional: C Dialect Options. + * C standard: Standards. + * C standards: Standards. + * c++: Invoking G++. + * C++: G++ and GCC. + * C++ comments: C++ Comments. + * C++ compilation options: Invoking GCC. + * C++ interface and implementation headers: C++ Interface. + * C++ language extensions: C++ Extensions. + * C++ member fns, automatically inline: Inline. + * C++ misunderstandings: C++ Misunderstandings. + * C++ options, command line: C++ Dialect Options. + * C++ pragmas, effect on inlining: C++ Interface. + * C++ source file suffixes: Invoking G++. + * C++ static data, declaring and defining: Static Definitions. + * C89: Standards. + * C90: Standards. + * C94: Standards. + * C95: Standards. + * C99: Standards. + * C9X: Standards. + * C_INCLUDE_PATH: Environment Variables. + * calling functions through the function vector on the H8/300 processors: Function Attributes. + * case labels in initializers: Designated Inits. + * case ranges: Case Ranges. + * case sensitivity and VMS: VMS Misc. + * cast to a union: Cast to Union. + * casts as lvalues: Lvalues. + * cimag: Other Builtins. + * cimagf: Other Builtins. + * cimagl: Other Builtins. + * code generation conventions: Code Gen Options. + * code, mixed with declarations: Mixed Declarations. + * command options: Invoking GCC. + * comments, C++ style: C++ Comments. + * comparison of signed and unsigned values, warning: Warning Options. + * compiler bugs, reporting: Bug Reporting. + * compiler compared to C++ preprocessor: G++ and GCC. + * compiler options, C++: C++ Dialect Options. + * compiler options, Objective-C: Objective-C Dialect Options. + * compiler version, specifying: Target Options. + * COMPILER_PATH: Environment Variables. + * complex conjugation: Complex. + * complex numbers: Complex. + * compound expressions as lvalues: Lvalues. + * compound literals: Compound Literals. + * computed gotos: Labels as Values. + * conditional expressions as lvalues: Lvalues. + * conditional expressions, extensions: Conditionals. + * conflicting types: Disappointments. + * conj: Other Builtins. + * conjf: Other Builtins. + * conjl: Other Builtins. + * const applied to function: Function Attributes. + * const function attribute: Function Attributes. + * constants in constraints: Simple Constraints. + * constraint modifier characters: Modifiers. + * constraint, matching: Simple Constraints. + * constraints, asm: Constraints. + * constraints, machine specific: Machine Constraints. + * constructing calls: Constructing Calls. + * constructor expressions: Compound Literals. + * constructor function attribute: Function Attributes. + * contributors: Contributors. + * Convex options: Convex Options. + * core dump: Bug Criteria. + * cos: Other Builtins. + * cosf: Other Builtins. + * cosl: Other Builtins. + * CPATH: Environment Variables. + * CPLUS_INCLUDE_PATH: Environment Variables. + * creal: Other Builtins. + * crealf: Other Builtins. + * creall: Other Builtins. + * CRIS Options: CRIS Options. + * cross compiling: Target Options. + * D30V Options: D30V Options. + * DBX: Interoperation. + * deallocating variable length arrays: Variable Length. + * debug_rtx: Bug Reporting. + * debugging information options: Debugging Options. + * debugging, 88k OCS: M88K Options. + * declaration scope: Incompatibilities. + * declarations inside expressions: Statement Exprs. + * declarations, mixed with code: Mixed Declarations. + * declaring attributes of functions: Function Attributes. + * declaring static data in C++: Static Definitions. + * defining static data in C++: Static Definitions. + * dependencies for make as output: Environment Variables. + * dependencies, make: Preprocessor Options. + * DEPENDENCIES_OUTPUT: Environment Variables. + * deprecated attribute.: Function Attributes. + * designated initializers: Designated Inits. + * designator lists: Designated Inits. + * designators: Designated Inits. + * destructor function attribute: Function Attributes. + * diagnostic messages: Language Independent Options. + * dialect options: C Dialect Options. + * digits in constraint: Simple Constraints. + * directory options: Directory Options. + * divide instruction, 88k: M88K Options. + * dollar signs in identifier names: Dollar Signs. + * double-word arithmetic: Long Long. + * downward funargs: Nested Functions. + * DW bit (29k): AMD29K Options. + * E in constraint: Simple Constraints. + * earlyclobber operand: Modifiers. + * eight bit data on the H8/300 and H8/300H: Function Attributes. + * environment variables: Environment Variables. + * error messages: Warnings and Errors. + * escape sequences, traditional: C Dialect Options. + * escaped newlines: Escaped Newlines. + * exclamation point: Multi-Alternative. + * exit: Other Builtins. + * exit status and VMS: VMS Misc. + * explicit register variables: Explicit Reg Vars. + * expressions containing statements: Statement Exprs. + * expressions, compound, as lvalues: Lvalues. + * expressions, conditional, as lvalues: Lvalues. + * expressions, constructor: Compound Literals. + * extended asm: Extended Asm. + * extensible constraints: Simple Constraints. + * extensions, ?: <1>: Conditionals. + * extensions, ?:: Lvalues. + * extensions, C language: C Extensions. + * extensions, C++ language: C++ Extensions. + * external declaration scope: Incompatibilities. + * F in constraint: Simple Constraints. + * fabs: Other Builtins. + * fabsf: Other Builtins. + * fabsl: Other Builtins. + * fatal signal: Bug Criteria. + * FDL, GNU Free Documentation License: GNU Free Documentation License. + * ffs: Other Builtins. + * file name suffix: Overall Options. + * file names: Link Options. + * flexible array members: Zero Length. + * float as function value type: Incompatibilities. + * floating point precision <1>: Disappointments. + * floating point precision: Optimize Options. + * format function attribute: Function Attributes. + * format_arg function attribute: Function Attributes. + * Fortran: G++ and GCC. + * forwarding calls: Constructing Calls. + * fprintf: Other Builtins. + * fprintf_unlocked: Other Builtins. + * fputs: Other Builtins. + * fputs_unlocked: Other Builtins. + * freestanding environment: Standards. + * freestanding implementation: Standards. + * fscanf, and constant strings: Incompatibilities. + * function addressability on the M32R/D: Function Attributes. + * function attributes: Function Attributes. + * function pointers, arithmetic: Pointer Arith. + * function prototype declarations: Function Prototypes. + * function without a prologue/epilogue code: Function Attributes. + * function, size of pointer to: Pointer Arith. + * functions called via pointer on the RS/6000 and PowerPC: Function Attributes. + * functions in arbitrary sections: Function Attributes. + * functions that are passed arguments in registers on the 386: Function Attributes. + * functions that behave like malloc: Function Attributes. + * functions that do not pop the argument stack on the 386: Function Attributes. + * functions that do pop the argument stack on the 386: Function Attributes. + * functions that have no side effects: Function Attributes. + * functions that never return: Function Attributes. + * functions that pop the argument stack on the 386: Function Attributes. + * functions which are exported from a dll on PowerPC Windows NT: Function Attributes. + * functions which are imported from a dll on PowerPC Windows NT: Function Attributes. + * functions which specify exception handling on PowerPC Windows NT: Function Attributes. + * functions with printf, scanf, strftime or strfmon style arguments: Function Attributes. + * g in constraint: Simple Constraints. + * G in constraint: Simple Constraints. + * g++: Invoking G++. + * G++: G++ and GCC. + * GCC: G++ and GCC. + * GCC command options: Invoking GCC. + * gcc-bugs@gcc.gnu.org or bug-gcc@gnu.org: Bug Lists. + * GCC_EXEC_PREFIX: Environment Variables. + * gccbug script: gccbug. + * generalized lvalues: Lvalues. + * global offset table: Code Gen Options. + * global register after longjmp: Global Reg Vars. + * global register variables: Global Reg Vars. + * GLOBALDEF: Global Declarations. + * GLOBALREF: Global Declarations. + * GLOBALVALUEDEF: Global Declarations. + * GLOBALVALUEREF: Global Declarations. + * GNAT: G++ and GCC. + * goto with computed label: Labels as Values. + * gp-relative references (MIPS): MIPS Options. + * gprof: Debugging Options. + * grouping options: Invoking GCC. + * H in constraint: Simple Constraints. + * hardware models and configurations, specifying: Submodel Options. + * header files and VMS: Include Files and VMS. + * hex floats: Hex Floats. + * hosted environment <1>: C Dialect Options. + * hosted environment: Standards. + * hosted implementation: Standards. + * HPPA Options: HPPA Options. + * I in constraint: Simple Constraints. + * i in constraint: Simple Constraints. + * i386 Options: i386 and x86-64 Options. + * IA-64 Options: IA-64 Options. + * IBM RS/6000 and PowerPC Options: RS/6000 and PowerPC Options. + * IBM RT options: RT Options. + * IBM RT PC: Interoperation. + * identifier names, dollar signs in: Dollar Signs. + * identifiers, names in assembler code: Asm Labels. + * identifying source, compiler (88k): M88K Options. + * imaxabs: Other Builtins. + * implementation-defined behavior, C language: C Implementation. + * implied #pragma implementation: C++ Interface. + * include files and VMS: Include Files and VMS. + * incompatibilities of GCC: Incompatibilities. + * increment operators: Bug Criteria. + * index: Other Builtins. + * indirect calls on ARM: Function Attributes. + * init_priority attribute: C++ Attributes. + * initializations in expressions: Compound Literals. + * initializers with labeled elements: Designated Inits. + * initializers, non-constant: Initializers. + * inline automatic for C++ member fns: Inline. + * inline functions: Inline. + * inline functions, omission of: Inline. + * inlining and C++ pragmas: C++ Interface. + * installation trouble: Trouble. + * integrating function code: Inline. + * Intel 386 Options: i386 and x86-64 Options. + * interface and implementation headers, C++: C++ Interface. + * intermediate C version, nonexistent: G++ and GCC. + * interrupt handler functions: Function Attributes. + * interrupt handler functions on the H8/300 and SH processors: Function Attributes. + * introduction: Top. + * invalid assembly code: Bug Criteria. + * invalid input: Bug Criteria. + * invoking g++: Invoking G++. + * ISO 9899: Standards. + * ISO C: Standards. + * ISO C standard: Standards. + * ISO C89: Standards. + * ISO C90: Standards. + * ISO C94: Standards. + * ISO C95: Standards. + * ISO C99: Standards. + * ISO C9X: Standards. + * ISO support: C Dialect Options. + * ISO/IEC 9899: Standards. + * Java: G++ and GCC. + * java_interface attribute: C++ Attributes. + * kernel and user registers (29k): AMD29K Options. + * keywords, alternate: Alternate Keywords. + * known causes of trouble: Trouble. + * labeled elements in initializers: Designated Inits. + * labels as values: Labels as Values. + * labs: Other Builtins. + * LANG: Environment Variables. + * language dialect options: C Dialect Options. + * large bit shifts (88k): M88K Options. + * LC_ALL: Environment Variables. + * LC_CTYPE: Environment Variables. + * LC_MESSAGES: Environment Variables. + * length-zero arrays: Zero Length. + * Libraries: Link Options. + * LIBRARY_PATH: Environment Variables. + * link options: Link Options. + * LL integer suffix: Long Long. + * llabs: Other Builtins. + * load address instruction: Simple Constraints. + * local labels: Local Labels. + * local variables in macros: Typeof. + * local variables, specifying registers: Local Reg Vars. + * locale: Environment Variables. + * locale definition: Environment Variables. + * long long data types: Long Long. + * longjmp: Global Reg Vars. + * longjmp and automatic variables: C Dialect Options. + * longjmp incompatibilities: Incompatibilities. + * longjmp warnings: Warning Options. + * lvalues, generalized: Lvalues. + * m in constraint: Simple Constraints. + * M32R/D options: M32R/D Options. + * M680x0 options: M680x0 Options. + * M68hc1x options: M68hc1x Options. + * M88k options: M88K Options. + * machine dependent options: Submodel Options. + * machine specific constraints: Machine Constraints. + * macro with variable arguments: Variadic Macros. + * macros containing asm: Extended Asm. + * macros, inline alternative: Inline. + * macros, local labels: Local Labels. + * macros, local variables in: Typeof. + * macros, statements in expressions: Statement Exprs. + * macros, types of arguments: Typeof. + * main and the exit status: VMS Misc. + * make: Preprocessor Options. + * malloc attribute: Function Attributes. + * matching constraint: Simple Constraints. + * maximum operator: Min and Max. + * MCore options: MCore Options. + * member fns, automatically inline: Inline. + * memcmp: Other Builtins. + * memcpy: Other Builtins. + * memory model (29k): AMD29K Options. + * memory references in constraints: Simple Constraints. + * memset: Other Builtins. + * message formatting: Language Independent Options. + * messages, warning: Warning Options. + * messages, warning and error: Warnings and Errors. + * middle-operands, omitted: Conditionals. + * minimum operator: Min and Max. + * MIPS options: MIPS Options. + * misunderstandings in C++: C++ Misunderstandings. + * mixed declarations and code: Mixed Declarations. + * mktemp, and constant strings: Incompatibilities. + * MMIX Options: MMIX Options. + * MN10200 options: MN10200 Options. + * MN10300 options: MN10300 Options. + * mode attribute: Variable Attributes. + * modifiers in constraints: Modifiers. + * multi-line string literals: Multi-line Strings. + * multiple alternative constraints: Multi-Alternative. + * multiprecision arithmetic: Long Long. + * n in constraint: Simple Constraints. + * name augmentation: VMS Misc. + * names used in assembler code: Asm Labels. + * naming convention, implementation headers: C++ Interface. + * nested functions: Nested Functions. + * newlines (escaped): Escaped Newlines. + * no_instrument_function function attribute: Function Attributes. + * nocommon attribute: Variable Attributes. + * noinline function attribute: Function Attributes. + * non-constant initializers: Initializers. + * non-static inline function: Inline. + * noreturn function attribute: Function Attributes. + * NS32K options: NS32K Options. + * o in constraint: Simple Constraints. + * OBJC_INCLUDE_PATH: Environment Variables. + * Objective-C: G++ and GCC. + * Objective-C options, command line: Objective-C Dialect Options. + * OCS (88k): M88K Options. + * offsettable address: Simple Constraints. + * old-style function definitions: Function Prototypes. + * omitted middle-operands: Conditionals. + * open coding: Inline. + * operand constraints, asm: Constraints. + * optimize options: Optimize Options. + * options to control diagnostics formatting: Language Independent Options. + * options to control warnings: Warning Options. + * options, C++: C++ Dialect Options. + * options, code generation: Code Gen Options. + * options, debugging: Debugging Options. + * options, dialect: C Dialect Options. + * options, directory search: Directory Options. + * options, GCC command: Invoking GCC. + * options, grouping: Invoking GCC. + * options, linking: Link Options. + * options, Objective-C: Objective-C Dialect Options. + * options, optimization: Optimize Options. + * options, order: Invoking GCC. + * options, preprocessor: Preprocessor Options. + * order of evaluation, side effects: Non-bugs. + * order of options: Invoking GCC. + * other register constraints: Simple Constraints. + * output file option: Overall Options. + * overloaded virtual fn, warning: C++ Dialect Options. + * p in constraint: Simple Constraints. + * packed attribute: Variable Attributes. + * parameter forward declaration: Variable Length. + * parameters, aliased: Code Gen Options. + * PDP-11 Options: PDP-11 Options. + * PIC: Code Gen Options. + * pmf: Bound member functions. + * pointer arguments: Function Attributes. + * pointer to member function: Bound member functions. + * portions of temporary objects, pointers to: Temporaries. + * pragma, extern_prefix: Tru64 Pragmas. + * pragma, long_calls: ARM Pragmas. + * pragma, long_calls_off: ARM Pragmas. + * pragma, mark: Darwin Pragmas. + * pragma, no_long_calls: ARM Pragmas. + * pragma, options align: Darwin Pragmas. + * pragma, reason for not using: Function Attributes. + * pragma, redefine_extname: Solaris Pragmas. + * pragma, segment: Darwin Pragmas. + * pragma, unused: Darwin Pragmas. + * pragmas: Pragmas. + * pragmas in C++, effect on inlining: C++ Interface. + * pragmas, interface and implementation: C++ Interface. + * pragmas, warning of unknown: Warning Options. + * preprocessing numbers: Incompatibilities. + * preprocessing tokens: Incompatibilities. + * preprocessor options: Preprocessor Options. + * printf: Other Builtins. + * printf_unlocked: Other Builtins. + * processor selection (29k): AMD29K Options. + * prof: Debugging Options. + * promotion of formal parameters: Function Prototypes. + * pure function attribute: Function Attributes. + * push address instruction: Simple Constraints. + * qsort, and global register variables: Global Reg Vars. + * question mark: Multi-Alternative. + * r in constraint: Simple Constraints. + * r0-relative references (88k): M88K Options. + * ranges in case statements: Case Ranges. + * read-only strings: Incompatibilities. + * register positions in frame (88k): M88K Options. + * register variable after longjmp: Global Reg Vars. + * registers: Extended Asm. + * registers for local variables: Local Reg Vars. + * registers in constraints: Simple Constraints. + * registers, global allocation: Explicit Reg Vars. + * registers, global variables in: Global Reg Vars. + * reordering, warning <1>: Warning Options. + * reordering, warning: C++ Dialect Options. + * reporting bugs: Bugs. + * rest argument (in macro): Variadic Macros. + * restricted pointers: Restricted Pointers. + * restricted references: Restricted Pointers. + * restricted this pointer: Restricted Pointers. + * return value of main: VMS Misc. + * rindex: Other Builtins. + * RS/6000 and PowerPC Options: RS/6000 and PowerPC Options. + * RT options: RT Options. + * RT PC: Interoperation. + * RTTI: Vague Linkage. + * run-time options: Code Gen Options. + * s in constraint: Simple Constraints. + * S/390 and zSeries Options: S/390 and zSeries Options. + * scanf, and constant strings: Incompatibilities. + * scope of a variable length array: Variable Length. + * scope of declaration: Disappointments. + * scope of external declarations: Incompatibilities. + * search path: Directory Options. + * section function attribute: Function Attributes. + * section variable attribute: Variable Attributes. + * sequential consistency on 88k: M88K Options. + * setjmp: Global Reg Vars. + * setjmp incompatibilities: Incompatibilities. + * shared strings: Incompatibilities. + * shared variable attribute: Variable Attributes. + * shared VMS run time system: VMS Misc. + * side effect in ?:: Conditionals. + * side effects, macro argument: Statement Exprs. + * side effects, order of evaluation: Non-bugs. + * signal handler functions on the AVR processors: Function Attributes. + * signed and unsigned values, comparison warning: Warning Options. + * simple constraints: Simple Constraints. + * sin: Other Builtins. + * sinf: Other Builtins. + * sinl: Other Builtins. + * sizeof: Typeof. + * smaller data references: M32R/D Options. + * smaller data references (88k): M88K Options. + * smaller data references (MIPS): MIPS Options. + * smaller data references (PowerPC): RS/6000 and PowerPC Options. + * SPARC options: SPARC Options. + * Spec Files: Spec Files. + * specified registers: Explicit Reg Vars. + * specifying compiler version and target machine: Target Options. + * specifying hardware config: Submodel Options. + * specifying machine version: Target Options. + * specifying registers for local variables: Local Reg Vars. + * sqrt: Other Builtins. + * sqrtf: Other Builtins. + * sqrtl: Other Builtins. + * sscanf, and constant strings: Incompatibilities. + * stack checks (29k): AMD29K Options. + * statements inside expressions: Statement Exprs. + * static data in C++, declaring and defining: Static Definitions. + * stdarg.h and RT PC: RT Options. + * storem bug (29k): AMD29K Options. + * strcat: Other Builtins. + * strchr: Other Builtins. + * strcmp: Other Builtins. + * strcpy: Other Builtins. + * strcspn: Other Builtins. + * string constants: Incompatibilities. + * strlen: Other Builtins. + * strncat: Other Builtins. + * strncmp: Other Builtins. + * strncpy: Other Builtins. + * strpbrk: Other Builtins. + * strrchr: Other Builtins. + * strspn: Other Builtins. + * strstr: Other Builtins. + * struct: Unnamed Fields. + * structure passing (88k): M88K Options. + * structures: Incompatibilities. + * structures, constructor expression: Compound Literals. + * submodel options: Submodel Options. + * subscripting: Subscripting. + * subscripting and function values: Subscripting. + * suffixes for C++ source: Invoking G++. + * SUNPRO_DEPENDENCIES: Environment Variables. + * suppressing warnings: Warning Options. + * surprises in C++: C++ Misunderstandings. + * SVr4: M88K Options. + * syntax checking: Warning Options. + * synthesized methods, warning: C++ Dialect Options. + * system headers, warnings from: Warning Options. + * target machine, specifying: Target Options. + * target options: Target Options. + * TC1: Standards. + * TC2: Standards. + * Technical Corrigenda: Standards. + * Technical Corrigendum 1: Standards. + * Technical Corrigendum 2: Standards. + * template instantiation: Template Instantiation. + * temporaries, lifetime of: Temporaries. + * thunks: Nested Functions. + * tiny data section on the H8/300H: Function Attributes. + * TMPDIR: Environment Variables. + * TMS320C3x/C4x Options: TMS320C3x/C4x Options. + * traditional C language: C Dialect Options. + * type alignment: Alignment. + * type attributes: Type Attributes. + * type_info: Vague Linkage. + * typedef names as function parameters: Incompatibilities. + * typeof: Typeof. + * ULL integer suffix: Long Long. + * Ultrix calling convention: Interoperation. + * undefined behavior: Bug Criteria. + * undefined function value: Bug Criteria. + * underscores in variables in macros: Typeof. + * underscores, avoiding (88k): M88K Options. + * union: Unnamed Fields. + * union, casting to a: Cast to Union. + * unions: Incompatibilities. + * unknown pragmas, warning: Warning Options. + * unresolved references and -nodefaultlibs: Link Options. + * unresolved references and -nostdlib: Link Options. + * unused attribute.: Function Attributes. + * used attribute.: Function Attributes. + * V in constraint: Simple Constraints. + * V850 Options: V850 Options. + * vague linkage: Vague Linkage. + * value after longjmp: Global Reg Vars. + * varargs.h and RT PC: RT Options. + * variable addressability on the M32R/D: Variable Attributes. + * variable alignment: Alignment. + * variable attributes: Variable Attributes. + * variable number of arguments: Variadic Macros. + * variable-length array scope: Variable Length. + * variable-length arrays: Variable Length. + * variables in specified registers: Explicit Reg Vars. + * variables, local, in macros: Typeof. + * variadic macros: Variadic Macros. + * VAX calling convention: Interoperation. + * VAX options: VAX Options. + * VAXCRTL: VMS Misc. + * VLAs: Variable Length. + * VMS and case sensitivity: VMS Misc. + * VMS and include files: Include Files and VMS. + * void pointers, arithmetic: Pointer Arith. + * void, size of pointer to: Pointer Arith. + * volatile access: Volatiles. + * volatile applied to function: Function Attributes. + * volatile read: Volatiles. + * volatile write: Volatiles. + * vtable: Vague Linkage. + * warning for comparison of signed and unsigned values: Warning Options. + * warning for overloaded virtual fn: C++ Dialect Options. + * warning for reordering of member initializers <1>: Warning Options. + * warning for reordering of member initializers: C++ Dialect Options. + * warning for synthesized methods: C++ Dialect Options. + * warning for unknown pragmas: Warning Options. + * warning messages: Warning Options. + * warnings from system headers: Warning Options. + * warnings vs errors: Warnings and Errors. + * weak attribute: Function Attributes. + * whitespace: Incompatibilities. + * X in constraint: Simple Constraints. + * X3.159-1989: Standards. + * x86-64 Options: i386 and x86-64 Options. + * Xstormy16 Options: Xstormy16 Options. + * Xtensa Options: Xtensa Options. + * zero division on 88k: M88K Options. + * zero-length arrays: Zero Length. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-3 gcc-3.2.3/gcc/doc/gcc.info-3 *** gcc-3.2.2/gcc/doc/gcc.info-3 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-3 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,796 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Warning Options, Next: Debugging Options, Prev: Language Independent Options, Up: Invoking GCC + + Options to Request or Suppress Warnings + ======================================= + + Warnings are diagnostic messages that report constructions which are + not inherently erroneous but which are risky or suggest there may have + been an error. + + You can request many specific warnings with options beginning `-W', + for example `-Wimplicit' to request warnings on implicit declarations. + Each of these specific warning options also has a negative form + beginning `-Wno-' to turn off warnings; for example, `-Wno-implicit'. + This manual lists only one of the two forms, whichever is not the + default. + + The following options control the amount and kinds of warnings + produced by GCC; for further, language-specific options also refer to + *Note C++ Dialect Options:: and *Note Objective-C Dialect Options::. + + `-fsyntax-only' + Check the code for syntax errors, but don't do anything beyond + that. + + `-pedantic' + Issue all the warnings demanded by strict ISO C and ISO C++; + reject all programs that use forbidden extensions, and some other + programs that do not follow ISO C and ISO C++. For ISO C, follows + the version of the ISO C standard specified by any `-std' option + used. + + Valid ISO C and ISO C++ programs should compile properly with or + without this option (though a rare few will require `-ansi' or a + `-std' option specifying the required version of ISO C). However, + without this option, certain GNU extensions and traditional C and + C++ features are supported as well. With this option, they are + rejected. + + `-pedantic' does not cause warning messages for use of the + alternate keywords whose names begin and end with `__'. Pedantic + warnings are also disabled in the expression that follows + `__extension__'. However, only system header files should use + these escape routes; application programs should avoid them. + *Note Alternate Keywords::. + + Some users try to use `-pedantic' to check programs for strict ISO + C conformance. They soon find that it does not do quite what they + want: it finds some non-ISO practices, but not all--only those for + which ISO C _requires_ a diagnostic, and some others for which + diagnostics have been added. + + A feature to report any failure to conform to ISO C might be + useful in some instances, but would require considerable + additional work and would be quite different from `-pedantic'. We + don't have plans to support such a feature in the near future. + + Where the standard specified with `-std' represents a GNU extended + dialect of C, such as `gnu89' or `gnu99', there is a corresponding + "base standard", the version of ISO C on which the GNU extended + dialect is based. Warnings from `-pedantic' are given where they + are required by the base standard. (It would not make sense for + such warnings to be given only for features not in the specified + GNU C dialect, since by definition the GNU dialects of C include + all features the compiler supports with the given option, and + there would be nothing to warn about.) + + `-pedantic-errors' + Like `-pedantic', except that errors are produced rather than + warnings. + + `-w' + Inhibit all warning messages. + + `-Wno-import' + Inhibit warning messages about the use of `#import'. + + `-Wchar-subscripts' + Warn if an array subscript has type `char'. This is a common cause + of error, as programmers often forget that this type is signed on + some machines. + + `-Wcomment' + Warn whenever a comment-start sequence `/*' appears in a `/*' + comment, or whenever a Backslash-Newline appears in a `//' comment. + + `-Wformat' + Check calls to `printf' and `scanf', etc., to make sure that the + arguments supplied have types appropriate to the format string + specified, and that the conversions specified in the format string + make sense. This includes standard functions, and others + specified by format attributes (*note Function Attributes::), in + the `printf', `scanf', `strftime' and `strfmon' (an X/Open + extension, not in the C standard) families. + + The formats are checked against the format features supported by + GNU libc version 2.2. These include all ISO C89 and C99 features, + as well as features from the Single Unix Specification and some + BSD and GNU extensions. Other library implementations may not + support all these features; GCC does not support warning about + features that go beyond a particular library's limitations. + However, if `-pedantic' is used with `-Wformat', warnings will be + given about format features not in the selected standard version + (but not for `strfmon' formats, since those are not in any version + of the C standard). *Note Options Controlling C Dialect: C + Dialect Options. + + `-Wformat' is included in `-Wall'. For more control over some + aspects of format checking, the options `-Wno-format-y2k', + `-Wno-format-extra-args', `-Wformat-nonliteral', + `-Wformat-security' and `-Wformat=2' are available, but are not + included in `-Wall'. + + `-Wno-format-y2k' + If `-Wformat' is specified, do not warn about `strftime' formats + which may yield only a two-digit year. + + `-Wno-format-extra-args' + If `-Wformat' is specified, do not warn about excess arguments to a + `printf' or `scanf' format function. The C standard specifies + that such arguments are ignored. + + Where the unused arguments lie between used arguments that are + specified with `$' operand number specifications, normally + warnings are still given, since the implementation could not know + what type to pass to `va_arg' to skip the unused arguments. + However, in the case of `scanf' formats, this option will suppress + the warning if the unused arguments are all pointers, since the + Single Unix Specification says that such unused arguments are + allowed. + + `-Wformat-nonliteral' + If `-Wformat' is specified, also warn if the format string is not a + string literal and so cannot be checked, unless the format function + takes its format arguments as a `va_list'. + + `-Wformat-security' + If `-Wformat' is specified, also warn about uses of format + functions that represent possible security problems. At present, + this warns about calls to `printf' and `scanf' functions where the + format string is not a string literal and there are no format + arguments, as in `printf (foo);'. This may be a security hole if + the format string came from untrusted input and contains `%n'. + (This is currently a subset of what `-Wformat-nonliteral' warns + about, but in future warnings may be added to `-Wformat-security' + that are not included in `-Wformat-nonliteral'.) + + `-Wformat=2' + Enable `-Wformat' plus format checks not included in `-Wformat'. + Currently equivalent to `-Wformat -Wformat-nonliteral + -Wformat-security'. + + `-Wimplicit-int' + Warn when a declaration does not specify a type. + + `-Wimplicit-function-declaration' + `-Werror-implicit-function-declaration' + Give a warning (or error) whenever a function is used before being + declared. + + `-Wimplicit' + Same as `-Wimplicit-int' and `-Wimplicit-function-declaration'. + + `-Wmain' + Warn if the type of `main' is suspicious. `main' should be a + function with external linkage, returning int, taking either zero + arguments, two, or three arguments of appropriate types. + + `-Wmissing-braces' + Warn if an aggregate or union initializer is not fully bracketed. + In the following example, the initializer for `a' is not fully + bracketed, but that for `b' is fully bracketed. + + int a[2][2] = { 0, 1, 2, 3 }; + int b[2][2] = { { 0, 1 }, { 2, 3 } }; + + `-Wparentheses' + Warn if parentheses are omitted in certain contexts, such as when + there is an assignment in a context where a truth value is + expected, or when operators are nested whose precedence people + often get confused about. + + Also warn about constructions where there may be confusion to which + `if' statement an `else' branch belongs. Here is an example of + such a case: + + { + if (a) + if (b) + foo (); + else + bar (); + } + + In C, every `else' branch belongs to the innermost possible `if' + statement, which in this example is `if (b)'. This is often not + what the programmer expected, as illustrated in the above example + by indentation the programmer chose. When there is the potential + for this confusion, GCC will issue a warning when this flag is + specified. To eliminate the warning, add explicit braces around + the innermost `if' statement so there is no way the `else' could + belong to the enclosing `if'. The resulting code would look like + this: + + { + if (a) + { + if (b) + foo (); + else + bar (); + } + } + + `-Wsequence-point' + Warn about code that may have undefined semantics because of + violations of sequence point rules in the C standard. + + The C standard defines the order in which expressions in a C + program are evaluated in terms of "sequence points", which + represent a partial ordering between the execution of parts of the + program: those executed before the sequence point, and those + executed after it. These occur after the evaluation of a full + expression (one which is not part of a larger expression), after + the evaluation of the first operand of a `&&', `||', `? :' or `,' + (comma) operator, before a function is called (but after the + evaluation of its arguments and the expression denoting the called + function), and in certain other places. Other than as expressed + by the sequence point rules, the order of evaluation of + subexpressions of an expression is not specified. All these rules + describe only a partial order rather than a total order, since, + for example, if two functions are called within one expression + with no sequence point between them, the order in which the + functions are called is not specified. However, the standards + committee have ruled that function calls do not overlap. + + It is not specified when between sequence points modifications to + the values of objects take effect. Programs whose behavior + depends on this have undefined behavior; the C standard specifies + that "Between the previous and next sequence point an object shall + have its stored value modified at most once by the evaluation of + an expression. Furthermore, the prior value shall be read only to + determine the value to be stored.". If a program breaks these + rules, the results on any particular implementation are entirely + unpredictable. + + Examples of code with undefined behavior are `a = a++;', `a[n] = + b[n++]' and `a[i++] = i;'. Some more complicated cases are not + diagnosed by this option, and it may give an occasional false + positive result, but in general it has been found fairly effective + at detecting this sort of problem in programs. + + The present implementation of this option only works for C + programs. A future implementation may also work for C++ programs. + + The C standard is worded confusingly, therefore there is some + debate over the precise meaning of the sequence point rules in + subtle cases. Links to discussions of the problem, including + proposed formal definitions, may be found on our readings page, at + `http://gcc.gnu.org/readings.html'. + + `-Wreturn-type' + Warn whenever a function is defined with a return-type that + defaults to `int'. Also warn about any `return' statement with no + return-value in a function whose return-type is not `void'. + + For C++, a function without return type always produces a + diagnostic message, even when `-Wno-return-type' is specified. + The only exceptions are `main' and functions defined in system + headers. + + `-Wswitch' + Warn whenever a `switch' statement has an index of enumeral type + and lacks a `case' for one or more of the named codes of that + enumeration. (The presence of a `default' label prevents this + warning.) `case' labels outside the enumeration range also + provoke warnings when this option is used. + + `-Wtrigraphs' + Warn if any trigraphs are encountered that might change the + meaning of the program (trigraphs within comments are not warned + about). + + `-Wunused-function' + Warn whenever a static function is declared but not defined or a + non\-inline static function is unused. + + `-Wunused-label' + Warn whenever a label is declared but not used. + + To suppress this warning use the `unused' attribute (*note + Variable Attributes::). + + `-Wunused-parameter' + Warn whenever a function parameter is unused aside from its + declaration. + + To suppress this warning use the `unused' attribute (*note + Variable Attributes::). + + `-Wunused-variable' + Warn whenever a local variable or non-constant static variable is + unused aside from its declaration + + To suppress this warning use the `unused' attribute (*note + Variable Attributes::). + + `-Wunused-value' + Warn whenever a statement computes a result that is explicitly not + used. + + To suppress this warning cast the expression to `void'. + + `-Wunused' + All all the above `-Wunused' options combined. + + In order to get a warning about an unused function parameter, you + must either specify `-W -Wunused' or separately specify + `-Wunused-parameter'. + + `-Wuninitialized' + Warn if an automatic variable is used without first being + initialized or if a variable may be clobbered by a `setjmp' call. + + These warnings are possible only in optimizing compilation, + because they require data flow information that is computed only + when optimizing. If you don't specify `-O', you simply won't get + these warnings. + + These warnings occur only for variables that are candidates for + register allocation. Therefore, they do not occur for a variable + that is declared `volatile', or whose address is taken, or whose + size is other than 1, 2, 4 or 8 bytes. Also, they do not occur for + structures, unions or arrays, even when they are in registers. + + Note that there may be no warning about a variable that is used + only to compute a value that itself is never used, because such + computations may be deleted by data flow analysis before the + warnings are printed. + + These warnings are made optional because GCC is not smart enough + to see all the reasons why the code might be correct despite + appearing to have an error. Here is one example of how this can + happen: + + { + int x; + switch (y) + { + case 1: x = 1; + break; + case 2: x = 4; + break; + case 3: x = 5; + } + foo (x); + } + + If the value of `y' is always 1, 2 or 3, then `x' is always + initialized, but GCC doesn't know this. Here is another common + case: + + { + int save_y; + if (change_y) save_y = y, y = new_y; + ... + if (change_y) y = save_y; + } + + This has no bug because `save_y' is used only if it is set. + + This option also warns when a non-volatile automatic variable + might be changed by a call to `longjmp'. These warnings as well + are possible only in optimizing compilation. + + The compiler sees only the calls to `setjmp'. It cannot know + where `longjmp' will be called; in fact, a signal handler could + call it at any point in the code. As a result, you may get a + warning even when there is in fact no problem because `longjmp' + cannot in fact be called at the place which would cause a problem. + + Some spurious warnings can be avoided if you declare all the + functions you use that never return as `noreturn'. *Note Function + Attributes::. + + `-Wreorder (C++ only)' + Warn when the order of member initializers given in the code does + not match the order in which they must be executed. For instance: + + `-Wunknown-pragmas' + Warn when a #pragma directive is encountered which is not + understood by GCC. If this command line option is used, warnings + will even be issued for unknown pragmas in system header files. + This is not the case if the warnings were only enabled by the + `-Wall' command line option. + + `-Wall' + All of the above `-W' options combined. This enables all the + warnings about constructions that some users consider + questionable, and that are easy to avoid (or modify to prevent the + warning), even in conjunction with macros. + + `-Wdiv-by-zero' + Warn about compile-time integer division by zero. This is + default. To inhibit the warning messages, use `-Wno-div-by-zero'. + Floating point division by zero is not warned about, as it can be + a legitimate way of obtaining infinities and NaNs. + + `-Wmultichar' + Warn if a multicharacter constant (`'FOOF'') is used. This is + default. To inhibit the warning messages, use `-Wno-multichar'. + Usually they indicate a typo in the user's code, as they have + implementation-defined values, and should not be used in portable + code. + + `-Wsystem-headers' + Print warning messages for constructs found in system header files. + Warnings from system headers are normally suppressed, on the + assumption that they usually do not indicate real problems and + would only make the compiler output harder to read. Using this + command line option tells GCC to emit warnings from system headers + as if they occurred in user code. However, note that using + `-Wall' in conjunction with this option will _not_ warn about + unknown pragmas in system headers--for that, `-Wunknown-pragmas' + must also be used. + + The following `-W...' options are not implied by `-Wall'. Some of + them warn about constructions that users generally do not consider + questionable, but which occasionally you might wish to check for; + others warn about constructions that are necessary or hard to avoid in + some cases, and there is no simple way to modify the code to suppress + the warning. + + `-W' + Print extra warning messages for these events: + + * A function can return either with or without a value. + (Falling off the end of the function body is considered + returning without a value.) For example, this function would + evoke such a warning: + + foo (a) + { + if (a > 0) + return a; + } + + * An expression-statement or the left-hand side of a comma + expression contains no side effects. To suppress the + warning, cast the unused expression to void. For example, an + expression such as `x[i,j]' will cause a warning, but + `x[(void)i,j]' will not. + + * An unsigned value is compared against zero with `<' or `<='. + + * A comparison like `x<=y<=z' appears; this is equivalent to + `(x<=y ? 1 : 0) <= z', which is a different interpretation + from that of ordinary mathematical notation. + + * Storage-class specifiers like `static' are not the first + things in a declaration. According to the C Standard, this + usage is obsolescent. + + * The return type of a function has a type qualifier such as + `const'. Such a type qualifier has no effect, since the + value returned by a function is not an lvalue. (But don't + warn about the GNU extension of `volatile void' return types. + That extension will be warned about if `-pedantic' is + specified.) + + * If `-Wall' or `-Wunused' is also specified, warn about unused + arguments. + + * A comparison between signed and unsigned values could produce + an incorrect result when the signed value is converted to + unsigned. (But don't warn if `-Wno-sign-compare' is also + specified.) + + * An aggregate has a partly bracketed initializer. For + example, the following code would evoke such a warning, + because braces are missing around the initializer for `x.h': + + struct s { int f, g; }; + struct t { struct s h; int i; }; + struct t x = { 1, 2, 3 }; + + * An aggregate has an initializer which does not initialize all + members. For example, the following code would cause such a + warning, because `x.h' would be implicitly initialized to + zero: + + struct s { int f, g, h; }; + struct s x = { 3, 4 }; + + `-Wfloat-equal' + Warn if floating point values are used in equality comparisons. + + The idea behind this is that sometimes it is convenient (for the + programmer) to consider floating-point values as approximations to + infinitely precise real numbers. If you are doing this, then you + need to compute (by analysing the code, or in some other way) the + maximum or likely maximum error that the computation introduces, + and allow for it when performing comparisons (and when producing + output, but that's a different problem). In particular, instead + of testing for equality, you would check to see whether the two + values have ranges that overlap; and this is done with the + relational operators, so equality comparisons are probably + mistaken. + + `-Wtraditional (C only)' + Warn about certain constructs that behave differently in + traditional and ISO C. Also warn about ISO C constructs that have + no traditional C equivalent, and/or problematic constructs which + should be avoided. + + * Macro parameters that appear within string literals in the + macro body. In traditional C macro replacement takes place + within string literals, but does not in ISO C. + + * In traditional C, some preprocessor directives did not exist. + Traditional preprocessors would only consider a line to be a + directive if the `#' appeared in column 1 on the line. + Therefore `-Wtraditional' warns about directives that + traditional C understands but would ignore because the `#' + does not appear as the first character on the line. It also + suggests you hide directives like `#pragma' not understood by + traditional C by indenting them. Some traditional + implementations would not recognize `#elif', so it suggests + avoiding it altogether. + + * A function-like macro that appears without arguments. + + * The unary plus operator. + + * The `U' integer constant suffix, or the `F' or `L' floating + point constant suffixes. (Traditional C does support the `L' + suffix on integer constants.) Note, these suffixes appear in + macros defined in the system headers of most modern systems, + e.g. the `_MIN'/`_MAX' macros in `'. Use of these + macros in user code might normally lead to spurious warnings, + however gcc's integrated preprocessor has enough context to + avoid warning in these cases. + + * A function declared external in one block and then used after + the end of the block. + + * A `switch' statement has an operand of type `long'. + + * A non-`static' function declaration follows a `static' one. + This construct is not accepted by some traditional C + compilers. + + * The ISO type of an integer constant has a different width or + signedness from its traditional type. This warning is only + issued if the base of the constant is ten. I.e. hexadecimal + or octal values, which typically represent bit patterns, are + not warned about. + + * Usage of ISO string concatenation is detected. + + * Initialization of automatic aggregates. + + * Identifier conflicts with labels. Traditional C lacks a + separate namespace for labels. + + * Initialization of unions. If the initializer is zero, the + warning is omitted. This is done under the assumption that + the zero initializer in user code appears conditioned on e.g. + `__STDC__' to avoid missing initializer warnings and relies + on default initialization to zero in the traditional C case. + + * Conversions by prototypes between fixed/floating point values + and vice versa. The absence of these prototypes when + compiling with traditional C would cause serious problems. + This is a subset of the possible conversion warnings, for the + full set use `-Wconversion'. + + `-Wundef' + Warn if an undefined identifier is evaluated in an `#if' directive. + + `-Wshadow' + Warn whenever a local variable shadows another local variable, + parameter or global variable or whenever a built-in function is + shadowed. + + `-Wlarger-than-LEN' + Warn whenever an object of larger than LEN bytes is defined. + + `-Wpointer-arith' + Warn about anything that depends on the "size of" a function type + or of `void'. GNU C assigns these types a size of 1, for + convenience in calculations with `void *' pointers and pointers to + functions. + + `-Wbad-function-cast (C only)' + Warn whenever a function call is cast to a non-matching type. For + example, warn if `int malloc()' is cast to `anything *'. + + `-Wcast-qual' + Warn whenever a pointer is cast so as to remove a type qualifier + from the target type. For example, warn if a `const char *' is + cast to an ordinary `char *'. + + `-Wcast-align' + Warn whenever a pointer is cast such that the required alignment + of the target is increased. For example, warn if a `char *' is + cast to an `int *' on machines where integers can only be accessed + at two- or four-byte boundaries. + + `-Wwrite-strings' + When compiling C, give string constants the type `const + char[LENGTH]' so that copying the address of one into a + non-`const' `char *' pointer will get a warning; when compiling + C++, warn about the deprecated conversion from string constants to + `char *'. These warnings will help you find at compile time code + that can try to write into a string constant, but only if you have + been very careful about using `const' in declarations and + prototypes. Otherwise, it will just be a nuisance; this is why we + did not make `-Wall' request these warnings. + + `-Wconversion' + Warn if a prototype causes a type conversion that is different + from what would happen to the same argument in the absence of a + prototype. This includes conversions of fixed point to floating + and vice versa, and conversions changing the width or signedness + of a fixed point argument except when the same as the default + promotion. + + Also, warn if a negative integer constant expression is implicitly + converted to an unsigned type. For example, warn about the + assignment `x = -1' if `x' is unsigned. But do not warn about + explicit casts like `(unsigned) -1'. + + `-Wsign-compare' + Warn when a comparison between signed and unsigned values could + produce an incorrect result when the signed value is converted to + unsigned. This warning is also enabled by `-W'; to get the other + warnings of `-W' without this warning, use `-W -Wno-sign-compare'. + + `-Waggregate-return' + Warn if any functions that return structures or unions are defined + or called. (In languages where you can return an array, this also + elicits a warning.) + + `-Wstrict-prototypes (C only)' + Warn if a function is declared or defined without specifying the + argument types. (An old-style function definition is permitted + without a warning if preceded by a declaration which specifies the + argument types.) + + `-Wmissing-prototypes (C only)' + Warn if a global function is defined without a previous prototype + declaration. This warning is issued even if the definition itself + provides a prototype. The aim is to detect global functions that + fail to be declared in header files. + + `-Wmissing-declarations' + Warn if a global function is defined without a previous + declaration. Do so even if the definition itself provides a + prototype. Use this option to detect global functions that are + not declared in header files. + + `-Wmissing-noreturn' + Warn about functions which might be candidates for attribute + `noreturn'. Note these are only possible candidates, not absolute + ones. Care should be taken to manually verify functions actually + do not ever return before adding the `noreturn' attribute, + otherwise subtle code generation bugs could be introduced. You + will not get a warning for `main' in hosted C environments. + + `-Wmissing-format-attribute' + If `-Wformat' is enabled, also warn about functions which might be + candidates for `format' attributes. Note these are only possible + candidates, not absolute ones. GCC will guess that `format' + attributes might be appropriate for any function that calls a + function like `vprintf' or `vscanf', but this might not always be + the case, and some functions for which `format' attributes are + appropriate may not be detected. This option has no effect unless + `-Wformat' is enabled (possibly by `-Wall'). + + `-Wno-deprecated-declarations' + Do not warn about uses of functions, variables, and types marked as + deprecated by using the `deprecated' attribute. (*note Function + Attributes::, *note Variable Attributes::, *note Type + Attributes::.) + + `-Wpacked' + Warn if a structure is given the packed attribute, but the packed + attribute has no effect on the layout or size of the structure. + Such structures may be mis-aligned for little benefit. For + instance, in this code, the variable `f.x' in `struct bar' will be + misaligned even though `struct bar' does not itself have the + packed attribute: + + struct foo { + int x; + char a, b, c, d; + } __attribute__((packed)); + struct bar { + char z; + struct foo f; + }; + + `-Wpadded' + Warn if padding is included in a structure, either to align an + element of the structure or to align the whole structure. + Sometimes when this happens it is possible to rearrange the fields + of the structure to reduce the padding and so make the structure + smaller. + + `-Wredundant-decls' + Warn if anything is declared more than once in the same scope, + even in cases where multiple declaration is valid and changes + nothing. + + `-Wnested-externs (C only)' + Warn if an `extern' declaration is encountered within a function. + + `-Wunreachable-code' + Warn if the compiler detects that code will never be executed. + + This option is intended to warn when the compiler detects that at + least a whole line of source code will never be executed, because + some condition is never satisfied or because it is after a + procedure that never returns. + + It is possible for this option to produce a warning even though + there are circumstances under which part of the affected line can + be executed, so care should be taken when removing + apparently-unreachable code. + + For instance, when a function is inlined, a warning may mean that + the line is unreachable in only one inlined copy of the function. + + This option is not made part of `-Wall' because in a debugging + version of a program there is often substantial code which checks + correct functioning of the program and is, hopefully, unreachable + because the program does work. Another common use of unreachable + code is to provide behavior which is selectable at compile-time. + + `-Winline' + Warn if a function can not be inlined and it was declared as + inline. + + `-Wlong-long' + Warn if `long long' type is used. This is default. To inhibit + the warning messages, use `-Wno-long-long'. Flags `-Wlong-long' + and `-Wno-long-long' are taken into account only when `-pedantic' + flag is used. + + `-Wdisabled-optimization' + Warn if a requested optimization pass is disabled. This warning + does not generally indicate that there is anything wrong with your + code; it merely indicates that GCC's optimizers were unable to + handle the code effectively. Often, the problem is that your code + is too big or too complex; GCC will refuse to optimize programs + when the optimization itself is likely to take inordinate amounts + of time. + + `-Werror' + Make all warnings into errors. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-4 gcc-3.2.3/gcc/doc/gcc.info-4 *** gcc-3.2.2/gcc/doc/gcc.info-4 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-4 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1209 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Debugging Options, Next: Optimize Options, Prev: Warning Options, Up: Invoking GCC + + Options for Debugging Your Program or GCC + ========================================= + + GCC has various special options that are used for debugging either + your program or GCC: + + `-g' + Produce debugging information in the operating system's native + format (stabs, COFF, XCOFF, or DWARF). GDB can work with this + debugging information. + + On most systems that use stabs format, `-g' enables use of extra + debugging information that only GDB can use; this extra information + makes debugging work better in GDB but will probably make other + debuggers crash or refuse to read the program. If you want to + control for certain whether to generate the extra information, use + `-gstabs+', `-gstabs', `-gxcoff+', `-gxcoff', `-gdwarf-1+', + `-gdwarf-1', or `-gvms' (see below). + + Unlike most other C compilers, GCC allows you to use `-g' with + `-O'. The shortcuts taken by optimized code may occasionally + produce surprising results: some variables you declared may not + exist at all; flow of control may briefly move where you did not + expect it; some statements may not be executed because they + compute constant results or their values were already at hand; + some statements may execute in different places because they were + moved out of loops. + + Nevertheless it proves possible to debug optimized output. This + makes it reasonable to use the optimizer for programs that might + have bugs. + + The following options are useful when GCC is generated with the + capability for more than one debugging format. + + `-ggdb' + Produce debugging information for use by GDB. This means to use + the most expressive format available (DWARF 2, stabs, or the + native format if neither of those are supported), including GDB + extensions if at all possible. + + `-gstabs' + Produce debugging information in stabs format (if that is + supported), without GDB extensions. This is the format used by + DBX on most BSD systems. On MIPS, Alpha and System V Release 4 + systems this option produces stabs debugging output which is not + understood by DBX or SDB. On System V Release 4 systems this + option requires the GNU assembler. + + `-gstabs+' + Produce debugging information in stabs format (if that is + supported), using GNU extensions understood only by the GNU + debugger (GDB). The use of these extensions is likely to make + other debuggers crash or refuse to read the program. + + `-gcoff' + Produce debugging information in COFF format (if that is + supported). This is the format used by SDB on most System V + systems prior to System V Release 4. + + `-gxcoff' + Produce debugging information in XCOFF format (if that is + supported). This is the format used by the DBX debugger on IBM + RS/6000 systems. + + `-gxcoff+' + Produce debugging information in XCOFF format (if that is + supported), using GNU extensions understood only by the GNU + debugger (GDB). The use of these extensions is likely to make + other debuggers crash or refuse to read the program, and may cause + assemblers other than the GNU assembler (GAS) to fail with an + error. + + `-gdwarf' + Produce debugging information in DWARF version 1 format (if that is + supported). This is the format used by SDB on most System V + Release 4 systems. + + `-gdwarf+' + Produce debugging information in DWARF version 1 format (if that is + supported), using GNU extensions understood only by the GNU + debugger (GDB). The use of these extensions is likely to make + other debuggers crash or refuse to read the program. + + `-gdwarf-2' + Produce debugging information in DWARF version 2 format (if that is + supported). This is the format used by DBX on IRIX 6. + + `-gvms' + Produce debugging information in VMS debug format (if that is + supported). This is the format used by DEBUG on VMS systems. + + `-gLEVEL' + `-ggdbLEVEL' + `-gstabsLEVEL' + `-gcoffLEVEL' + `-gxcoffLEVEL' + `-gvmsLEVEL' + Request debugging information and also use LEVEL to specify how + much information. The default level is 2. + + Level 1 produces minimal information, enough for making backtraces + in parts of the program that you don't plan to debug. This + includes descriptions of functions and external variables, but no + information about local variables and no line numbers. + + Level 3 includes extra information, such as all the macro + definitions present in the program. Some debuggers support macro + expansion when you use `-g3'. + + Note that in order to avoid confusion between DWARF1 debug level 2, + and DWARF2, neither `-gdwarf' nor `-gdwarf-2' accept a + concatenated debug level. Instead use an additional `-gLEVEL' + option to change the debug level for DWARF1 or DWARF2. + + `-p' + Generate extra code to write profile information suitable for the + analysis program `prof'. You must use this option when compiling + the source files you want data about, and you must also use it when + linking. + + `-pg' + Generate extra code to write profile information suitable for the + analysis program `gprof'. You must use this option when compiling + the source files you want data about, and you must also use it when + linking. + + `-Q' + Makes the compiler print out each function name as it is compiled, + and print some statistics about each pass when it finishes. + + `-ftime-report' + Makes the compiler print some statistics about the time consumed + by each pass when it finishes. + + `-fmem-report' + Makes the compiler print some statistics about permanent memory + allocation when it finishes. + + `-fprofile-arcs' + Instrument "arcs" during compilation to generate coverage data or + for profile-directed block ordering. During execution the program + records how many times each branch is executed and how many times + it is taken. When the compiled program exits it saves this data + to a file called `SOURCENAME.da' for each source file. + + For profile-directed block ordering, compile the program with + `-fprofile-arcs' plus optimization and code generation options, + generate the arc profile information by running the program on a + selected workload, and then compile the program again with the same + optimization and code generation options plus + `-fbranch-probabilities' (*note Options that Control Optimization: + Optimize Options.). + + The other use of `-fprofile-arcs' is for use with `gcov', when it + is used with the `-ftest-coverage' option. + + With `-fprofile-arcs', for each function of your program GCC + creates a program flow graph, then finds a spanning tree for the + graph. Only arcs that are not on the spanning tree have to be + instrumented: the compiler adds code to count the number of times + that these arcs are executed. When an arc is the only exit or + only entrance to a block, the instrumentation code can be added to + the block; otherwise, a new basic block must be created to hold + the instrumentation code. + + `-ftest-coverage' + Create data files for the `gcov' code-coverage utility (*note + `gcov'--a Test Coverage Program: Gcov.). The data file names + begin with the name of your source file: + + `SOURCENAME.bb' + A mapping from basic blocks to line numbers, which `gcov' + uses to associate basic block execution counts with line + numbers. + + `SOURCENAME.bbg' + A list of all arcs in the program flow graph. This allows + `gcov' to reconstruct the program flow graph, so that it can + compute all basic block and arc execution counts from the + information in the `SOURCENAME.da' file. + + Use `-ftest-coverage' with `-fprofile-arcs'; the latter option + adds instrumentation to the program, which then writes execution + counts to another data file: + + `SOURCENAME.da' + Runtime arc execution counts, used in conjunction with the arc + information in the file `SOURCENAME.bbg'. + + Coverage data will map better to the source files if + `-ftest-coverage' is used without optimization. + + `-dLETTERS' + Says to make debugging dumps during compilation at times specified + by LETTERS. This is used for debugging the compiler. The file + names for most of the dumps are made by appending a pass number + and a word to the source file name (e.g. `foo.c.00.rtl' or + `foo.c.01.sibling'). Here are the possible letters for use in + LETTERS, and their meanings: + + `A' + Annotate the assembler output with miscellaneous debugging + information. + + `b' + Dump after computing branch probabilities, to `FILE.14.bp'. + + `B' + Dump after block reordering, to `FILE.29.bbro'. + + `c' + Dump after instruction combination, to the file + `FILE.16.combine'. + + `C' + Dump after the first if conversion, to the file `FILE.17.ce'. + + `d' + Dump after delayed branch scheduling, to `FILE.31.dbr'. + + `D' + Dump all macro definitions, at the end of preprocessing, in + addition to normal output. + + `e' + Dump after SSA optimizations, to `FILE.04.ssa' and + `FILE.07.ussa'. + + `E' + Dump after the second if conversion, to `FILE.26.ce2'. + + `f' + Dump after life analysis, to `FILE.15.life'. + + `F' + Dump after purging `ADDRESSOF' codes, to `FILE.09.addressof'. + + `g' + Dump after global register allocation, to `FILE.21.greg'. + + `h' + Dump after finalization of EH handling code, to `FILE.02.eh'. + + `k' + Dump after reg-to-stack conversion, to `FILE.28.stack'. + + `o' + Dump after post-reload optimizations, to `FILE.22.postreload'. + + `G' + Dump after GCSE, to `FILE.10.gcse'. + + `i' + Dump after sibling call optimizations, to `FILE.01.sibling'. + + `j' + Dump after the first jump optimization, to `FILE.03.jump'. + + `k' + Dump after conversion from registers to stack, to + `FILE.32.stack'. + + `l' + Dump after local register allocation, to `FILE.20.lreg'. + + `L' + Dump after loop optimization, to `FILE.11.loop'. + + `M' + Dump after performing the machine dependent reorganisation + pass, to `FILE.30.mach'. + + `n' + Dump after register renumbering, to `FILE.25.rnreg'. + + `N' + Dump after the register move pass, to `FILE.18.regmove'. + + `r' + Dump after RTL generation, to `FILE.00.rtl'. + + `R' + Dump after the second scheduling pass, to `FILE.27.sched2'. + + `s' + Dump after CSE (including the jump optimization that + sometimes follows CSE), to `FILE.08.cse'. + + `S' + Dump after the first scheduling pass, to `FILE.19.sched'. + + `t' + Dump after the second CSE pass (including the jump + optimization that sometimes follows CSE), to `FILE.12.cse2'. + + `w' + Dump after the second flow pass, to `FILE.23.flow2'. + + `X' + Dump after SSA dead code elimination, to `FILE.06.ssadce'. + + `z' + Dump after the peephole pass, to `FILE.24.peephole2'. + + `a' + Produce all the dumps listed above. + + `m' + Print statistics on memory usage, at the end of the run, to + standard error. + + `p' + Annotate the assembler output with a comment indicating which + pattern and alternative was used. The length of each + instruction is also printed. + + `P' + Dump the RTL in the assembler output as a comment before each + instruction. Also turns on `-dp' annotation. + + `v' + For each of the other indicated dump files (except for + `FILE.00.rtl'), dump a representation of the control flow + graph suitable for viewing with VCG to `FILE.PASS.vcg'. + + `x' + Just generate RTL for a function instead of compiling it. + Usually used with `r'. + + `y' + Dump debugging information during parsing, to standard error. + + `-fdump-unnumbered' + When doing debugging dumps (see `-d' option above), suppress + instruction numbers and line number note output. This makes it + more feasible to use diff on debugging dumps for compiler + invocations with different options, in particular with and without + `-g'. + + `-fdump-translation-unit (C and C++ only)' + `-fdump-translation-unit-OPTIONS (C and C++ only)' + Dump a representation of the tree structure for the entire + translation unit to a file. The file name is made by appending + `.tu' to the source file name. If the `-OPTIONS' form is used, + OPTIONS controls the details of the dump as described for the + `-fdump-tree' options. + + `-fdump-class-hierarchy (C++ only)' + `-fdump-class-hierarchy-OPTIONS (C++ only)' + Dump a representation of each class's hierarchy and virtual + function table layout to a file. The file name is made by + appending `.class' to the source file name. If the `-OPTIONS' + form is used, OPTIONS controls the details of the dump as + described for the `-fdump-tree' options. + + `-fdump-tree-SWITCH (C++ only)' + `-fdump-tree-SWITCH-OPTIONS (C++ only)' + Control the dumping at various stages of processing the + intermediate language tree to a file. The file name is generated + by appending a switch specific suffix to the source file name. If + the `-OPTIONS' form is used, OPTIONS is a list of `-' separated + options that control the details of the dump. Not all options are + applicable to all dumps, those which are not meaningful will be + ignored. The following options are available + + `address' + Print the address of each node. Usually this is not + meaningful as it changes according to the environment and + source file. Its primary use is for tying up a dump file with + a debug environment. + + `slim' + Inhibit dumping of members of a scope or body of a function + merely because that scope has been reached. Only dump such + items when they are directly reachable by some other path. + + `all' + Turn on all options. + + The following tree dumps are possible: + `original' + Dump before any tree based optimization, to `FILE.original'. + + `optimized' + Dump after all tree based optimization, to `FILE.optimized'. + + `inlined' + Dump after function inlining, to `FILE.inlined'. + + `-fsched-verbose=N' + On targets that use instruction scheduling, this option controls + the amount of debugging output the scheduler prints. This + information is written to standard error, unless `-dS' or `-dR' is + specified, in which case it is output to the usual dump listing + file, `.sched' or `.sched2' respectively. However for N greater + than nine, the output is always printed to standard error. + + For N greater than zero, `-fsched-verbose' outputs the same + information as `-dRS'. For N greater than one, it also output + basic block probabilities, detailed ready list information and + unit/insn info. For N greater than two, it includes RTL at abort + point, control-flow and regions info. And for N over four, + `-fsched-verbose' also includes dependence info. + + `-fpretend-float' + When running a cross-compiler, pretend that the target machine + uses the same floating point format as the host machine. This + causes incorrect output of the actual floating constants, but the + actual instruction sequence will probably be the same as GCC would + make when running on the target machine. + + `-save-temps' + Store the usual "temporary" intermediate files permanently; place + them in the current directory and name them based on the source + file. Thus, compiling `foo.c' with `-c -save-temps' would produce + files `foo.i' and `foo.s', as well as `foo.o'. This creates a + preprocessed `foo.i' output file even though the compiler now + normally uses an integrated preprocessor. + + `-time' + Report the CPU time taken by each subprocess in the compilation + sequence. For C source files, this is the compiler proper and + assembler (plus the linker if linking is done). The output looks + like this: + + # cc1 0.12 0.01 + # as 0.00 0.01 + + The first number on each line is the "user time," that is time + spent executing the program itself. The second number is "system + time," time spent executing operating system routines on behalf of + the program. Both numbers are in seconds. + + `-print-file-name=LIBRARY' + Print the full absolute name of the library file LIBRARY that + would be used when linking--and don't do anything else. With this + option, GCC does not compile or link anything; it just prints the + file name. + + `-print-multi-directory' + Print the directory name corresponding to the multilib selected by + any other switches present in the command line. This directory is + supposed to exist in `GCC_EXEC_PREFIX'. + + `-print-multi-lib' + Print the mapping from multilib directory names to compiler + switches that enable them. The directory name is separated from + the switches by `;', and each switch starts with an `@' instead of + the `-', without spaces between multiple switches. This is + supposed to ease shell-processing. + + `-print-prog-name=PROGRAM' + Like `-print-file-name', but searches for a program such as `cpp'. + + `-print-libgcc-file-name' + Same as `-print-file-name=libgcc.a'. + + This is useful when you use `-nostdlib' or `-nodefaultlibs' but + you do want to link with `libgcc.a'. You can do + + gcc -nostdlib FILES... `gcc -print-libgcc-file-name` + + `-print-search-dirs' + Print the name of the configured installation directory and a list + of program and library directories gcc will search--and don't do + anything else. + + This is useful when gcc prints the error message `installation + problem, cannot exec cpp0: No such file or directory'. To resolve + this you either need to put `cpp0' and the other compiler + components where gcc expects to find them, or you can set the + environment variable `GCC_EXEC_PREFIX' to the directory where you + installed them. Don't forget the trailing '/'. *Note Environment + Variables::. + + `-dumpmachine' + Print the compiler's target machine (for example, + `i686-pc-linux-gnu')--and don't do anything else. + + `-dumpversion' + Print the compiler version (for example, `3.0')--and don't do + anything else. + + `-dumpspecs' + Print the compiler's built-in specs--and don't do anything else. + (This is used when GCC itself is being built.) *Note Spec Files::. + +  + File: gcc.info, Node: Optimize Options, Next: Preprocessor Options, Prev: Debugging Options, Up: Invoking GCC + + Options That Control Optimization + ================================= + + These options control various sorts of optimizations: + + `-O' + `-O1' + Optimize. Optimizing compilation takes somewhat more time, and a + lot more memory for a large function. + + Without `-O', the compiler's goal is to reduce the cost of + compilation and to make debugging produce the expected results. + Statements are independent: if you stop the program with a + breakpoint between statements, you can then assign a new value to + any variable or change the program counter to any other statement + in the function and get exactly the results you would expect from + the source code. + + With `-O', the compiler tries to reduce code size and execution + time, without performing any optimizations that take a great deal + of compilation time. + + `-O2' + Optimize even more. GCC performs nearly all supported + optimizations that do not involve a space-speed tradeoff. The + compiler does not perform loop unrolling or function inlining when + you specify `-O2'. As compared to `-O', this option increases + both compilation time and the performance of the generated code. + + `-O2' turns on all optional optimizations except for loop + unrolling, function inlining, and register renaming. It also + turns on the `-fforce-mem' option on all machines and frame + pointer elimination on machines where doing so does not interfere + with debugging. + + Please note the warning under `-fgcse' about invoking `-O2' on + programs that use computed gotos. + + `-O3' + Optimize yet more. `-O3' turns on all optimizations specified by + `-O2' and also turns on the `-finline-functions' and + `-frename-registers' options. + + `-O0' + Do not optimize. + + `-Os' + Optimize for size. `-Os' enables all `-O2' optimizations that do + not typically increase code size. It also performs further + optimizations designed to reduce code size. + + If you use multiple `-O' options, with or without level numbers, + the last such option is the one that is effective. + + Options of the form `-fFLAG' specify machine-independent flags. + Most flags have both positive and negative forms; the negative form of + `-ffoo' would be `-fno-foo'. In the table below, only one of the forms + is listed--the one which is not the default. You can figure out the + other form by either removing `no-' or adding it. + + `-ffloat-store' + Do not store floating point variables in registers, and inhibit + other options that might change whether a floating point value is + taken from a register or memory. + + This option prevents undesirable excess precision on machines such + as the 68000 where the floating registers (of the 68881) keep more + precision than a `double' is supposed to have. Similarly for the + x86 architecture. For most programs, the excess precision does + only good, but a few programs rely on the precise definition of + IEEE floating point. Use `-ffloat-store' for such programs, after + modifying them to store all pertinent intermediate computations + into variables. + + `-fno-default-inline' + Do not make member functions inline by default merely because they + are defined inside the class scope (C++ only). Otherwise, when + you specify `-O', member functions defined inside class scope are + compiled inline by default; i.e., you don't need to add `inline' + in front of the member function name. + + `-fno-defer-pop' + Always pop the arguments to each function call as soon as that + function returns. For machines which must pop arguments after a + function call, the compiler normally lets arguments accumulate on + the stack for several function calls and pops them all at once. + + `-fforce-mem' + Force memory operands to be copied into registers before doing + arithmetic on them. This produces better code by making all memory + references potential common subexpressions. When they are not + common subexpressions, instruction combination should eliminate + the separate register-load. The `-O2' option turns on this option. + + `-fforce-addr' + Force memory address constants to be copied into registers before + doing arithmetic on them. This may produce better code just as + `-fforce-mem' may. + + `-fomit-frame-pointer' + Don't keep the frame pointer in a register for functions that + don't need one. This avoids the instructions to save, set up and + restore frame pointers; it also makes an extra register available + in many functions. *It also makes debugging impossible on some + machines.* + + On some machines, such as the VAX, this flag has no effect, because + the standard calling sequence automatically handles the frame + pointer and nothing is saved by pretending it doesn't exist. The + machine-description macro `FRAME_POINTER_REQUIRED' controls + whether a target machine supports this flag. *Note Register + Usage: (gccint)Registers. + + `-foptimize-sibling-calls' + Optimize sibling and tail recursive calls. + + `-ftrapv' + This option generates traps for signed overflow on addition, + subtraction, multiplication operations. + + `-fno-inline' + Don't pay attention to the `inline' keyword. Normally this option + is used to keep the compiler from expanding any functions inline. + Note that if you are not optimizing, no functions can be expanded + inline. + + `-finline-functions' + Integrate all simple functions into their callers. The compiler + heuristically decides which functions are simple enough to be worth + integrating in this way. + + If all calls to a given function are integrated, and the function + is declared `static', then the function is normally not output as + assembler code in its own right. + + `-finline-limit=N' + By default, gcc limits the size of functions that can be inlined. + This flag allows the control of this limit for functions that are + explicitly marked as inline (ie marked with the inline keyword or + defined within the class definition in c++). N is the size of + functions that can be inlined in number of pseudo instructions + (not counting parameter handling). The default value of N is 600. + Increasing this value can result in more inlined code at the cost + of compilation time and memory consumption. Decreasing usually + makes the compilation faster and less code will be inlined (which + presumably means slower programs). This option is particularly + useful for programs that use inlining heavily such as those based + on recursive templates with C++. + + _Note:_ pseudo instruction represents, in this particular context, + an abstract measurement of function's size. In no way, it + represents a count of assembly instructions and as such its exact + meaning might change from one release to an another. + + `-fkeep-inline-functions' + Even if all calls to a given function are integrated, and the + function is declared `static', nevertheless output a separate + run-time callable version of the function. This switch does not + affect `extern inline' functions. + + `-fkeep-static-consts' + Emit variables declared `static const' when optimization isn't + turned on, even if the variables aren't referenced. + + GCC enables this option by default. If you want to force the + compiler to check if the variable was referenced, regardless of + whether or not optimization is turned on, use the + `-fno-keep-static-consts' option. + + `-fmerge-constants' + Attempt to merge identical constants (string constants and + floating point constants) accross compilation units. + + This option is default for optimized compilation if assembler and + linker support it. Use `-fno-merge-constants' to inhibit this + behavior. + + `-fmerge-all-constants' + Attempt to merge identical constants and identical variables. + + This option implies `-fmerge-constants'. In addition to + `-fmerge-constants' this considers e.g. even constant initialized + arrays or initialized constant variables with integral or floating + point types. Languages like C or C++ require each non-automatic + variable to have distinct location, so using this option will + result in non-conforming behavior. + + `-fno-branch-count-reg' + Do not use "decrement and branch" instructions on a count register, + but instead generate a sequence of instructions that decrement a + register, compare it against zero, then branch based upon the + result. This option is only meaningful on architectures that + support such instructions, which include x86, PowerPC, IA-64 and + S/390. + + `-fno-function-cse' + Do not put function addresses in registers; make each instruction + that calls a constant function contain the function's address + explicitly. + + This option results in less efficient code, but some strange hacks + that alter the assembler output may be confused by the + optimizations performed when this option is not used. + + `-ffast-math' + Sets `-fno-math-errno', `-funsafe-math-optimizations', and + `-fno-trapping-math'. + + This option causes the preprocessor macro `__FAST_MATH__' to be + defined. + + This option should never be turned on by any `-O' option since it + can result in incorrect output for programs which depend on an + exact implementation of IEEE or ISO rules/specifications for math + functions. + + `-fno-math-errno' + Do not set ERRNO after calling math functions that are executed + with a single instruction, e.g., sqrt. A program that relies on + IEEE exceptions for math error handling may want to use this flag + for speed while maintaining IEEE arithmetic compatibility. + + This option should never be turned on by any `-O' option since it + can result in incorrect output for programs which depend on an + exact implementation of IEEE or ISO rules/specifications for math + functions. + + The default is `-fmath-errno'. + + `-funsafe-math-optimizations' + Allow optimizations for floating-point arithmetic that (a) assume + that arguments and results are valid and (b) may violate IEEE or + ANSI standards. When used at link-time, it may include libraries + or startup files that change the default FPU control word or other + similar optimizations. + + This option should never be turned on by any `-O' option since it + can result in incorrect output for programs which depend on an + exact implementation of IEEE or ISO rules/specifications for math + functions. + + The default is `-fno-unsafe-math-optimizations'. + + `-fno-trapping-math' + Compile code assuming that floating-point operations cannot + generate user-visible traps. Setting this option may allow faster + code if one relies on "non-stop" IEEE arithmetic, for example. + + This option should never be turned on by any `-O' option since it + can result in incorrect output for programs which depend on an + exact implementation of IEEE or ISO rules/specifications for math + functions. + + The default is `-ftrapping-math'. + + `-fbounds-check' + For front-ends that support it, generate additional code to check + that indices used to access arrays are within the declared range. + This is currenly only supported by the Java and Fortran 77 + front-ends, where this option defaults to true and false + respectively. + + + The following options control specific optimizations. The `-O2' + option turns on all of these optimizations except `-funroll-loops' and + `-funroll-all-loops'. On most machines, the `-O' option turns on the + `-fthread-jumps' and `-fdelayed-branch' options, but specific machines + may handle it differently. + + You can use the following flags in the rare cases when "fine-tuning" + of optimizations to be performed is desired. + + Not all of the optimizations performed by GCC have `-f' options to + control them. + + `-fstrength-reduce' + Perform the optimizations of loop strength reduction and + elimination of iteration variables. + + `-fthread-jumps' + Perform optimizations where we check to see if a jump branches to a + location where another comparison subsumed by the first is found. + If so, the first branch is redirected to either the destination of + the second branch or a point immediately following it, depending + on whether the condition is known to be true or false. + + `-fcse-follow-jumps' + In common subexpression elimination, scan through jump instructions + when the target of the jump is not reached by any other path. For + example, when CSE encounters an `if' statement with an `else' + clause, CSE will follow the jump when the condition tested is + false. + + `-fcse-skip-blocks' + This is similar to `-fcse-follow-jumps', but causes CSE to follow + jumps which conditionally skip over blocks. When CSE encounters a + simple `if' statement with no else clause, `-fcse-skip-blocks' + causes CSE to follow the jump around the body of the `if'. + + `-frerun-cse-after-loop' + Re-run common subexpression elimination after loop optimizations + has been performed. + + `-frerun-loop-opt' + Run the loop optimizer twice. + + `-fgcse' + Perform a global common subexpression elimination pass. This pass + also performs global constant and copy propagation. + + _Note:_ When compiling a program using computed gotos, a GCC + extension, you may get better runtime performance if you disable + the global common subexpression elmination pass by adding + `-fno-gcse' to the command line. + + `-fgcse-lm' + When `-fgcse-lm' is enabled, global common subexpression + elimination will attempt to move loads which are only killed by + stores into themselves. This allows a loop containing a + load/store sequence to be changed to a load outside the loop, and + a copy/store within the loop. + + `-fgcse-sm' + When `-fgcse-sm' is enabled, A store motion pass is run after + global common subexpression elimination. This pass will attempt + to move stores out of loops. When used in conjunction with + `-fgcse-lm', loops containing a load/store sequence can be changed + to a load before the loop and a store after the loop. + + `-fdelete-null-pointer-checks' + Use global dataflow analysis to identify and eliminate useless + checks for null pointers. The compiler assumes that dereferencing + a null pointer would have halted the program. If a pointer is + checked after it has already been dereferenced, it cannot be null. + + In some environments, this assumption is not true, and programs can + safely dereference null pointers. Use + `-fno-delete-null-pointer-checks' to disable this optimization for + programs which depend on that behavior. + + `-fexpensive-optimizations' + Perform a number of minor optimizations that are relatively + expensive. + + `-foptimize-register-move' + `-fregmove' + Attempt to reassign register numbers in move instructions and as + operands of other simple instructions in order to maximize the + amount of register tying. This is especially helpful on machines + with two-operand instructions. GCC enables this optimization by + default with `-O2' or higher. + + Note `-fregmove' and `-foptimize-register-move' are the same + optimization. + + `-fdelayed-branch' + If supported for the target machine, attempt to reorder + instructions to exploit instruction slots available after delayed + branch instructions. + + `-fschedule-insns' + If supported for the target machine, attempt to reorder + instructions to eliminate execution stalls due to required data + being unavailable. This helps machines that have slow floating + point or memory load instructions by allowing other instructions + to be issued until the result of the load or floating point + instruction is required. + + `-fschedule-insns2' + Similar to `-fschedule-insns', but requests an additional pass of + instruction scheduling after register allocation has been done. + This is especially useful on machines with a relatively small + number of registers and where memory load instructions take more + than one cycle. + + `-fno-sched-interblock' + Don't schedule instructions across basic blocks. This is normally + enabled by default when scheduling before register allocation, i.e. + with `-fschedule-insns' or at `-O2' or higher. + + `-fno-sched-spec' + Don't allow speculative motion of non-load instructions. This is + normally enabled by default when scheduling before register + allocation, i.e. with `-fschedule-insns' or at `-O2' or higher. + + `-fsched-spec-load' + Allow speculative motion of some load instructions. This only + makes sense when scheduling before register allocation, i.e. with + `-fschedule-insns' or at `-O2' or higher. + + `-fsched-spec-load-dangerous' + Allow speculative motion of more load instructions. This only + makes sense when scheduling before register allocation, i.e. with + `-fschedule-insns' or at `-O2' or higher. + + `-ffunction-sections' + `-fdata-sections' + Place each function or data item into its own section in the output + file if the target supports arbitrary sections. The name of the + function or the name of the data item determines the section's name + in the output file. + + Use these options on systems where the linker can perform + optimizations to improve locality of reference in the instruction + space. HPPA processors running HP-UX and Sparc processors running + Solaris 2 have linkers with such optimizations. Other systems + using the ELF object format as well as AIX may have these + optimizations in the future. + + Only use these options when there are significant benefits from + doing so. When you specify these options, the assembler and + linker will create larger object and executable files and will + also be slower. You will not be able to use `gprof' on all + systems if you specify this option and you may have problems with + debugging if you specify both this option and `-g'. + + `-fcaller-saves' + Enable values to be allocated in registers that will be clobbered + by function calls, by emitting extra instructions to save and + restore the registers around such calls. Such allocation is done + only when it seems to result in better code than would otherwise + be produced. + + This option is always enabled by default on certain machines, + usually those which have no call-preserved registers to use + instead. + + For all machines, optimization level 2 and higher enables this + flag by default. + + `-funroll-loops' + Unroll loops whose number of iterations can be determined at + compile time or upon entry to the loop. `-funroll-loops' implies + both `-fstrength-reduce' and `-frerun-cse-after-loop'. This + option makes code larger, and may or may not make it run faster. + + `-funroll-all-loops' + Unroll all loops, even if their number of iterations is uncertain + when the loop is entered. This usually makes programs run more + slowly. `-funroll-all-loops' implies the same options as + `-funroll-loops', + + `-fprefetch-loop-arrays' + If supported by the target machine, generate instructions to + prefetch memory to improve the performance of loops that access + large arrays. + + `-fmove-all-movables' + Forces all invariant computations in loops to be moved outside the + loop. + + `-freduce-all-givs' + Forces all general-induction variables in loops to be + strength-reduced. + + _Note:_ When compiling programs written in Fortran, + `-fmove-all-movables' and `-freduce-all-givs' are enabled by + default when you use the optimizer. + + These options may generate better or worse code; results are highly + dependent on the structure of loops within the source code. + + These two options are intended to be removed someday, once they + have helped determine the efficacy of various approaches to + improving loop optimizations. + + Please let us ( and ) know how + use of these options affects the performance of your production + code. We're very interested in code that runs _slower_ when these + options are _enabled_. + + `-fno-peephole' + `-fno-peephole2' + Disable any machine-specific peephole optimizations. The + difference between `-fno-peephole' and `-fno-peephole2' is in how + they are implemented in the compiler; some targets use one, some + use the other, a few use both. + + `-fbranch-probabilities' + After running a program compiled with `-fprofile-arcs' (*note + Options for Debugging Your Program or `gcc': Debugging Options.), + you can compile it a second time using `-fbranch-probabilities', + to improve optimizations based on the number of times each branch + was taken. When the program compiled with `-fprofile-arcs' exits + it saves arc execution counts to a file called `SOURCENAME.da' for + each source file The information in this data file is very + dependent on the structure of the generated code, so you must use + the same source code and the same optimization options for both + compilations. + + With `-fbranch-probabilities', GCC puts a `REG_EXEC_COUNT' note on + the first instruction of each basic block, and a `REG_BR_PROB' + note on each `JUMP_INSN' and `CALL_INSN'. These can be used to + improve optimization. Currently, they are only used in one place: + in `reorg.c', instead of guessing which path a branch is mostly to + take, the `REG_BR_PROB' values are used to exactly determine which + path is taken more often. + + `-fno-guess-branch-probability' + Do not guess branch probabilities using a randomized model. + + Sometimes gcc will opt to use a randomized model to guess branch + probabilities, when none are available from either profiling + feedback (`-fprofile-arcs') or `__builtin_expect'. This means that + different runs of the compiler on the same program may produce + different object code. + + In a hard real-time system, people don't want different runs of the + compiler to produce code that has different behavior; minimizing + non-determinism is of paramount import. This switch allows users + to reduce non-determinism, possibly at the expense of inferior + optimization. + + `-fstrict-aliasing' + Allows the compiler to assume the strictest aliasing rules + applicable to the language being compiled. For C (and C++), this + activates optimizations based on the type of expressions. In + particular, an object of one type is assumed never to reside at + the same address as an object of a different type, unless the + types are almost the same. For example, an `unsigned int' can + alias an `int', but not a `void*' or a `double'. A character type + may alias any other type. + + Pay special attention to code like this: + union a_union { + int i; + double d; + }; + + int f() { + a_union t; + t.d = 3.0; + return t.i; + } + The practice of reading from a different union member than the one + most recently written to (called "type-punning") is common. Even + with `-fstrict-aliasing', type-punning is allowed, provided the + memory is accessed through the union type. So, the code above + will work as expected. However, this code might not: + int f() { + a_union t; + int* ip; + t.d = 3.0; + ip = &t.i; + return *ip; + } + + Every language that wishes to perform language-specific alias + analysis should define a function that computes, given an `tree' + node, an alias set for the node. Nodes in different alias sets + are not allowed to alias. For an example, see the C front-end + function `c_get_alias_set'. + + `-falign-functions' + `-falign-functions=N' + Align the start of functions to the next power-of-two greater than + N, skipping up to N bytes. For instance, `-falign-functions=32' + aligns functions to the next 32-byte boundary, but + `-falign-functions=24' would align to the next 32-byte boundary + only if this can be done by skipping 23 bytes or less. + + `-fno-align-functions' and `-falign-functions=1' are equivalent + and mean that functions will not be aligned. + + Some assemblers only support this flag when N is a power of two; + in that case, it is rounded up. + + If N is not specified, use a machine-dependent default. + + `-falign-labels' + `-falign-labels=N' + Align all branch targets to a power-of-two boundary, skipping up to + N bytes like `-falign-functions'. This option can easily make + code slower, because it must insert dummy operations for when the + branch target is reached in the usual flow of the code. + + If `-falign-loops' or `-falign-jumps' are applicable and are + greater than this value, then their values are used instead. + + If N is not specified, use a machine-dependent default which is + very likely to be `1', meaning no alignment. + + `-falign-loops' + `-falign-loops=N' + Align loops to a power-of-two boundary, skipping up to N bytes + like `-falign-functions'. The hope is that the loop will be + executed many times, which will make up for any execution of the + dummy operations. + + If N is not specified, use a machine-dependent default. + + `-falign-jumps' + `-falign-jumps=N' + Align branch targets to a power-of-two boundary, for branch targets + where the targets can only be reached by jumping, skipping up to N + bytes like `-falign-functions'. In this case, no dummy operations + need be executed. + + If N is not specified, use a machine-dependent default. + + `-fssa' + Perform optimizations in static single assignment form. Each + function's flow graph is translated into SSA form, optimizations + are performed, and the flow graph is translated back from SSA + form. Users should not specify this option, since it is not yet + ready for production use. + + `-fssa-ccp' + Perform Sparse Conditional Constant Propagation in SSA form. + Requires `-fssa'. Like `-fssa', this is an experimental feature. + + `-fssa-dce' + Perform aggressive dead-code elimination in SSA form. Requires + `-fssa'. Like `-fssa', this is an experimental feature. + + `-fsingle-precision-constant' + Treat floating point constant as single precision constant instead + of implicitly converting it to double precision constant. + + `-frename-registers' + Attempt to avoid false dependencies in scheduled code by making use + of registers left over after register allocation. This + optimization will most benefit processors with lots of registers. + It can, however, make debugging impossible, since variables will + no longer stay in a "home register". + + `-fno-cprop-registers' + After register allocation and post-register allocation instruction + splitting, we perform a copy-propagation pass to try to reduce + scheduling dependencies and occasionally eliminate the copy. + + `--param NAME=VALUE' + In some places, GCC uses various constants to control the amount of + optimization that is done. For example, GCC will not inline + functions that contain more that a certain number of instructions. + You can control some of these constants on the command-line using + the `--param' option. + + In each case, the VALUE is an integer. The allowable choices for + NAME are given in the following table: + + `max-delay-slot-insn-search' + The maximum number of instructions to consider when looking + for an instruction to fill a delay slot. If more than this + arbitrary number of instructions is searched, the time + savings from filling the delay slot will be minimal so stop + searching. Increasing values mean more aggressive + optimization, making the compile time increase with probably + small improvement in executable run time. + + `max-delay-slot-live-search' + When trying to fill delay slots, the maximum number of + instructions to consider when searching for a block with + valid live register information. Increasing this arbitrarily + chosen value means more aggressive optimization, increasing + the compile time. This parameter should be removed when the + delay slot code is rewritten to maintain the control-flow + graph. + + `max-gcse-memory' + The approximate maximum amount of memory that will be + allocated in order to perform the global common subexpression + elimination optimization. If more memory than specified is + required, the optimization will not be done. + + `max-gcse-passes' + The maximum number of passes of GCSE to run. + + `max-pending-list-length' + The maximum number of pending dependencies scheduling will + allow before flushing the current state and starting over. + Large functions with few branches or calls can create + excessively large lists which needlessly consume memory and + resources. + + `max-inline-insns' + If an function contains more than this many instructions, it + will not be inlined. This option is precisely equivalent to + `-finline-limit'. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-5 gcc-3.2.3/gcc/doc/gcc.info-5 *** gcc-3.2.2/gcc/doc/gcc.info-5 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-5 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,812 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Preprocessor Options, Next: Assembler Options, Prev: Optimize Options, Up: Invoking GCC + + Options Controlling the Preprocessor + ==================================== + + These options control the C preprocessor, which is run on each C + source file before actual compilation. + + If you use the `-E' option, nothing is done except preprocessing. + Some of these options make sense only together with `-E' because they + cause the preprocessor output to be unsuitable for actual compilation. + + You can use `-Wp,OPTION' to bypass the compiler driver and pass + OPTION directly through to the preprocessor. If OPTION contains + commas, it is split into multiple options at the commas. However, many + options are modified, translated or interpreted by the compiler driver + before being passed to the preprocessor, and `-Wp' forcibly bypasses + this phase. The preprocessor's direct interface is undocumented and + subject to change, so whenever possible you should avoid using `-Wp' + and let the driver handle the options instead. + + `-D NAME' + Predefine NAME as a macro, with definition `1'. + + `-D NAME=DEFINITION' + Predefine NAME as a macro, with definition DEFINITION. There are + no restrictions on the contents of DEFINITION, but if you are + invoking the preprocessor from a shell or shell-like program you + may need to use the shell's quoting syntax to protect characters + such as spaces that have a meaning in the shell syntax. + + If you wish to define a function-like macro on the command line, + write its argument list with surrounding parentheses before the + equals sign (if any). Parentheses are meaningful to most shells, + so you will need to quote the option. With `sh' and `csh', + `-D'NAME(ARGS...)=DEFINITION'' works. + + `-D' and `-U' options are processed in the order they are given on + the command line. All `-imacros FILE' and `-include FILE' options + are processed after all `-D' and `-U' options. + + `-U NAME' + Cancel any previous definition of NAME, either built in or + provided with a `-D' option. + + `-undef' + Do not predefine any system-specific macros. The common predefined + macros remain defined. + + `-I DIR' + Add the directory DIR to the list of directories to be searched + for header files. Directories named by `-I' are searched before + the standard system include directories. + + It is dangerous to specify a standard system include directory in + an `-I' option. This defeats the special treatment of system + headers . It can also defeat the repairs to buggy system headers + which GCC makes when it is installed. + + `-o FILE' + Write output to FILE. This is the same as specifying FILE as the + second non-option argument to `cpp'. `gcc' has a different + interpretation of a second non-option argument, so you must use + `-o' to specify the output file. + + `-Wall' + Turns on all optional warnings which are desirable for normal + code. At present this is `-Wcomment' and `-Wtrigraphs'. Note that + many of the preprocessor's warnings are on by default and have no + options to control them. + + `-Wcomment' + `-Wcomments' + Warn whenever a comment-start sequence `/*' appears in a `/*' + comment, or whenever a backslash-newline appears in a `//' comment. + (Both forms have the same effect.) + + `-Wtrigraphs' + Warn if any trigraphs are encountered. This option used to take + effect only if `-trigraphs' was also specified, but now works + independently. Warnings are not given for trigraphs within + comments, as they do not affect the meaning of the program. + + `-Wtraditional' + Warn about certain constructs that behave differently in + traditional and ISO C. Also warn about ISO C constructs that have + no traditional C equivalent, and problematic constructs which + should be avoided. + + `-Wimport' + Warn the first time `#import' is used. + + `-Wundef' + Warn whenever an identifier which is not a macro is encountered in + an `#if' directive, outside of `defined'. Such identifiers are + replaced with zero. + + `-Werror' + Make all warnings into hard errors. Source code which triggers + warnings will be rejected. + + `-Wsystem-headers' + Issue warnings for code in system headers. These are normally + unhelpful in finding bugs in your own code, therefore suppressed. + If you are responsible for the system library, you may want to see + them. + + `-w' + Suppress all warnings, including those which GNU CPP issues by + default. + + `-pedantic' + Issue all the mandatory diagnostics listed in the C standard. + Some of them are left out by default, since they trigger + frequently on harmless code. + + `-pedantic-errors' + Issue all the mandatory diagnostics, and make all mandatory + diagnostics into errors. This includes mandatory diagnostics that + GCC issues without `-pedantic' but treats as warnings. + + `-M' + Instead of outputting the result of preprocessing, output a rule + suitable for `make' describing the dependencies of the main source + file. The preprocessor outputs one `make' rule containing the + object file name for that source file, a colon, and the names of + all the included files, including those coming from `-include' or + `-imacros' command line options. + + Unless specified explicitly (with `-MT' or `-MQ'), the object file + name consists of the basename of the source file with any suffix + replaced with object file suffix. If there are many included + files then the rule is split into several lines using `\'-newline. + The rule has no commands. + + This option does not suppress the preprocessor's debug output, + such as `-dM'. To avoid mixing such debug output with the + dependency rules you should explicitly specify the dependency + output file with `-MF', or use an environment variable like + `DEPENDENCIES_OUTPUT' (*note DEPENDENCIES_OUTPUT::). Debug output + will still be sent to the regular output stream as normal. + + Passing `-M' to the driver implies `-E'. + + `-MM' + Like `-M' but do not mention header files that are found in system + header directories, nor header files that are included, directly + or indirectly, from such a header. + + This implies that the choice of angle brackets or double quotes in + an `#include' directive does not in itself determine whether that + header will appear in `-MM' dependency output. This is a slight + change in semantics from GCC versions 3.0 and earlier. + + `-MF FILE' + When used with `-M' or `-MM', specifies a file to write the + dependencies to. If no `-MF' switch is given the preprocessor + sends the rules to the same place it would have sent preprocessed + output. + + When used with the driver options `-MD' or `-MMD', `-MF' overrides + the default dependency output file. + + `-MG' + When used with `-M' or `-MM', `-MG' says to treat missing header + files as generated files and assume they live in the same + directory as the source file. It suppresses preprocessed output, + as a missing header file is ordinarily an error. + + This feature is used in automatic updating of makefiles. + + `-MP' + This option instructs CPP to add a phony target for each dependency + other than the main file, causing each to depend on nothing. These + dummy rules work around errors `make' gives if you remove header + files without updating the `Makefile' to match. + + This is typical output: + + test.o: test.c test.h + + test.h: + + `-MT TARGET' + Change the target of the rule emitted by dependency generation. By + default CPP takes the name of the main input file, including any + path, deletes any file suffix such as `.c', and appends the + platform's usual object suffix. The result is the target. + + An `-MT' option will set the target to be exactly the string you + specify. If you want multiple targets, you can specify them as a + single argument to `-MT', or use multiple `-MT' options. + + For example, `-MT '$(objpfx)foo.o'' might give + + $(objpfx)foo.o: foo.c + + `-MQ TARGET' + Same as `-MT', but it quotes any characters which are special to + Make. `-MQ '$(objpfx)foo.o'' gives + + $$(objpfx)foo.o: foo.c + + The default target is automatically quoted, as if it were given + with `-MQ'. + + `-MD' + `-MD' is equivalent to `-M -MF FILE', except that `-E' is not + implied. The driver determines FILE based on whether an `-o' + option is given. If it is, the driver uses its argument but with + a suffix of `.d', otherwise it take the basename of the input file + and applies a `.d' suffix. + + If `-MD' is used in conjunction with `-E', any `-o' switch is + understood to specify the dependency output file (but *note + -MF::), but if used without `-E', each `-o' is understood to + specify a target object file. + + Since `-E' is not implied, `-MD' can be used to generate a + dependency output file as a side-effect of the compilation process. + + `-MMD' + Like `-MD' except mention only user header files, not system + -header files. + + `-x c' + `-x c++' + `-x objective-c' + `-x assembler-with-cpp' + Specify the source language: C, C++, Objective-C, or assembly. + This has nothing to do with standards conformance or extensions; + it merely selects which base syntax to expect. If you give none + of these options, cpp will deduce the language from the extension + of the source file: `.c', `.cc', `.m', or `.S'. Some other common + extensions for C++ and assembly are also recognized. If cpp does + not recognize the extension, it will treat the file as C; this is + the most generic mode. + + *Note:* Previous versions of cpp accepted a `-lang' option which + selected both the language and the standards conformance level. + This option has been removed, because it conflicts with the `-l' + option. + + `-std=STANDARD' + `-ansi' + Specify the standard to which the code should conform. Currently + cpp only knows about the standards for C; other language standards + will be added in the future. + + STANDARD may be one of: + `iso9899:1990' + `c89' + The ISO C standard from 1990. `c89' is the customary + shorthand for this version of the standard. + + The `-ansi' option is equivalent to `-std=c89'. + + `iso9899:199409' + The 1990 C standard, as amended in 1994. + + `iso9899:1999' + `c99' + `iso9899:199x' + `c9x' + The revised ISO C standard, published in December 1999. + Before publication, this was known as C9X. + + `gnu89' + The 1990 C standard plus GNU extensions. This is the default. + + `gnu99' + `gnu9x' + The 1999 C standard plus GNU extensions. + + `-I-' + Split the include path. Any directories specified with `-I' + options before `-I-' are searched only for headers requested with + `#include "FILE"'; they are not searched for `#include '. + If additional directories are specified with `-I' options after + the `-I-', those directories are searched for all `#include' + directives. + + In addition, `-I-' inhibits the use of the directory of the current + file directory as the first search directory for `#include "FILE"'. + + `-nostdinc' + Do not search the standard system directories for header files. + Only the directories you have specified with `-I' options (and the + directory of the current file, if appropriate) are searched. + + `-nostdinc++' + Do not search for header files in the C++-specific standard + directories, but do still search the other standard directories. + (This option is used when building the C++ library.) + + `-include FILE' + Process FILE as if `#include "file"' appeared as the first line of + the primary source file. However, the first directory searched + for FILE is the preprocessor's working directory _instead of_ the + directory containing the main source file. If not found there, it + is searched for in the remainder of the `#include "..."' search + chain as normal. + + If multiple `-include' options are given, the files are included + in the order they appear on the command line. + + `-imacros FILE' + Exactly like `-include', except that any output produced by + scanning FILE is thrown away. Macros it defines remain defined. + This allows you to acquire all the macros from a header without + also processing its declarations. + + All files specified by `-imacros' are processed before all files + specified by `-include'. + + `-idirafter DIR' + Search DIR for header files, but do it _after_ all directories + specified with `-I' and the standard system directories have been + exhausted. DIR is treated as a system include directory. + + `-iprefix PREFIX' + Specify PREFIX as the prefix for subsequent `-iwithprefix' + options. If the prefix represents a directory, you should include + the final `/'. + + `-iwithprefix DIR' + `-iwithprefixbefore DIR' + Append DIR to the prefix specified previously with `-iprefix', and + add the resulting directory to the include search path. + `-iwithprefixbefore' puts it in the same place `-I' would; + `-iwithprefix' puts it where `-idirafter' would. + + Use of these options is discouraged. + + `-isystem DIR' + Search DIR for header files, after all directories specified by + `-I' but before the standard system directories. Mark it as a + system directory, so that it gets the same special treatment as is + applied to the standard system directories. + + `-fpreprocessed' + Indicate to the preprocessor that the input file has already been + preprocessed. This suppresses things like macro expansion, + trigraph conversion, escaped newline splicing, and processing of + most directives. The preprocessor still recognizes and removes + comments, so that you can pass a file preprocessed with `-C' to + the compiler without problems. In this mode the integrated + preprocessor is little more than a tokenizer for the front ends. + + `-fpreprocessed' is implicit if the input file has one of the + extensions `.i', `.ii' or `.mi'. These are the extensions that + GCC uses for preprocessed files created by `-save-temps'. + + `-ftabstop=WIDTH' + Set the distance between tab stops. This helps the preprocessor + report correct column numbers in warnings or errors, even if tabs + appear on the line. If the value is less than 1 or greater than + 100, the option is ignored. The default is 8. + + `-fno-show-column' + Do not print column numbers in diagnostics. This may be necessary + if diagnostics are being scanned by a program that does not + understand the column numbers, such as `dejagnu'. + + `-A PREDICATE=ANSWER' + Make an assertion with the predicate PREDICATE and answer ANSWER. + This form is preferred to the older form `-A PREDICATE(ANSWER)', + which is still supported, because it does not use shell special + characters. + + `-A -PREDICATE=ANSWER' + Cancel an assertion with the predicate PREDICATE and answer ANSWER. + + `-A-' + Cancel all predefined assertions and all assertions preceding it on + the command line. Also, undefine all predefined macros and all + macros preceding it on the command line. (This is a historical + wart and may change in the future.) + + `-dCHARS' + CHARS is a sequence of one or more of the following characters, + and must not be preceded by a space. Other characters are + interpreted by the compiler proper, or reserved for future + versions of GCC, and so are silently ignored. If you specify + characters whose behavior conflicts, the result is undefined. + + `M' + Instead of the normal output, generate a list of `#define' + directives for all the macros defined during the execution of + the preprocessor, including predefined macros. This gives + you a way of finding out what is predefined in your version + of the preprocessor. Assuming you have no file `foo.h', the + command + + touch foo.h; cpp -dM foo.h + + will show all the predefined macros. + + `D' + Like `M' except in two respects: it does _not_ include the + predefined macros, and it outputs _both_ the `#define' + directives and the result of preprocessing. Both kinds of + output go to the standard output file. + + `N' + Like `D', but emit only the macro names, not their expansions. + + `I' + Output `#include' directives in addition to the result of + preprocessing. + + `-P' + Inhibit generation of linemarkers in the output from the + preprocessor. This might be useful when running the preprocessor + on something that is not C code, and will be sent to a program + which might be confused by the linemarkers. + + `-C' + Do not discard comments. All comments are passed through to the + output file, except for comments in processed directives, which + are deleted along with the directive. + + You should be prepared for side effects when using `-C'; it causes + the preprocessor to treat comments as tokens in their own right. + For example, comments appearing at the start of what would be a + directive line have the effect of turning that line into an + ordinary source line, since the first token on the line is no + longer a `#'. + + `-gcc' + Define the macros __GNUC__, __GNUC_MINOR__ and + __GNUC_PATCHLEVEL__. These are defined automatically when you use + `gcc -E'; you can turn them off in that case with `-no-gcc'. + + `-traditional' + Try to imitate the behavior of old-fashioned C, as opposed to ISO + C. + + `-trigraphs' + Process trigraph sequences. These are three-character sequences, + all starting with `??', that are defined by ISO C to stand for + single characters. For example, `??/' stands for `\', so `'??/n'' + is a character constant for a newline. By default, GCC ignores + trigraphs, but in standard-conforming modes it converts them. See + the `-std' and `-ansi' options. + + The nine trigraphs and their replacements are + + Trigraph: ??( ??) ??< ??> ??= ??/ ??' ??! ??- + Replacement: [ ] { } # \ ^ | ~ + + `-remap' + Enable special code to work around file systems which only permit + very short file names, such as MS-DOS. + + `-$' + Forbid the use of `$' in identifiers. The C standard allows + implementations to define extra characters that can appear in + identifiers. By default GNU CPP permits `$', a common extension. + + `-h' + `--help' + `--target-help' + Print text describing all the command line options instead of + preprocessing anything. + + `-v' + Verbose mode. Print out GNU CPP's version number at the beginning + of execution, and report the final form of the include path. + + `-H' + Print the name of each header file used, in addition to other + normal activities. Each name is indented to show how deep in the + `#include' stack it is. + + `-version' + `--version' + Print out GNU CPP's version number. With one dash, proceed to + preprocess as normal. With two dashes, exit immediately. + +  + File: gcc.info, Node: Assembler Options, Next: Link Options, Prev: Preprocessor Options, Up: Invoking GCC + + Passing Options to the Assembler + ================================ + + You can pass options to the assembler. + + `-Wa,OPTION' + Pass OPTION as an option to the assembler. If OPTION contains + commas, it is split into multiple options at the commas. + +  + File: gcc.info, Node: Link Options, Next: Directory Options, Prev: Assembler Options, Up: Invoking GCC + + Options for Linking + =================== + + These options come into play when the compiler links object files + into an executable output file. They are meaningless if the compiler is + not doing a link step. + + `OBJECT-FILE-NAME' + A file name that does not end in a special recognized suffix is + considered to name an object file or library. (Object files are + distinguished from libraries by the linker according to the file + contents.) If linking is done, these object files are used as + input to the linker. + + `-c' + `-S' + `-E' + If any of these options is used, then the linker is not run, and + object file names should not be used as arguments. *Note Overall + Options::. + + `-lLIBRARY' + `-l LIBRARY' + Search the library named LIBRARY when linking. (The second + alternative with the library as a separate argument is only for + POSIX compliance and is not recommended.) + + It makes a difference where in the command you write this option; + the linker searches and processes libraries and object files in + the order they are specified. Thus, `foo.o -lz bar.o' searches + library `z' after file `foo.o' but before `bar.o'. If `bar.o' + refers to functions in `z', those functions may not be loaded. + + The linker searches a standard list of directories for the library, + which is actually a file named `libLIBRARY.a'. The linker then + uses this file as if it had been specified precisely by name. + + The directories searched include several standard system + directories plus any that you specify with `-L'. + + Normally the files found this way are library files--archive files + whose members are object files. The linker handles an archive + file by scanning through it for members which define symbols that + have so far been referenced but not defined. But if the file that + is found is an ordinary object file, it is linked in the usual + fashion. The only difference between using an `-l' option and + specifying a file name is that `-l' surrounds LIBRARY with `lib' + and `.a' and searches several directories. + + `-lobjc' + You need this special case of the `-l' option in order to link an + Objective-C program. + + `-nostartfiles' + Do not use the standard system startup files when linking. The + standard system libraries are used normally, unless `-nostdlib' or + `-nodefaultlibs' is used. + + `-nodefaultlibs' + Do not use the standard system libraries when linking. Only the + libraries you specify will be passed to the linker. The standard + startup files are used normally, unless `-nostartfiles' is used. + The compiler may generate calls to memcmp, memset, and memcpy for + System V (and ISO C) environments or to bcopy and bzero for BSD + environments. These entries are usually resolved by entries in + libc. These entry points should be supplied through some other + mechanism when this option is specified. + + `-nostdlib' + Do not use the standard system startup files or libraries when + linking. No startup files and only the libraries you specify will + be passed to the linker. The compiler may generate calls to + memcmp, memset, and memcpy for System V (and ISO C) environments + or to bcopy and bzero for BSD environments. These entries are + usually resolved by entries in libc. These entry points should be + supplied through some other mechanism when this option is + specified. + + One of the standard libraries bypassed by `-nostdlib' and + `-nodefaultlibs' is `libgcc.a', a library of internal subroutines + that GCC uses to overcome shortcomings of particular machines, or + special needs for some languages. (*Note Interfacing to GCC + Output: (gccint)Interface, for more discussion of `libgcc.a'.) In + most cases, you need `libgcc.a' even when you want to avoid other + standard libraries. In other words, when you specify `-nostdlib' + or `-nodefaultlibs' you should usually specify `-lgcc' as well. + This ensures that you have no unresolved references to internal GCC + library subroutines. (For example, `__main', used to ensure C++ + constructors will be called; *note `collect2': (gccint)Collect2..) + + `-s' + Remove all symbol table and relocation information from the + executable. + + `-static' + On systems that support dynamic linking, this prevents linking + with the shared libraries. On other systems, this option has no + effect. + + `-shared' + Produce a shared object which can then be linked with other + objects to form an executable. Not all systems support this + option. For predictable results, you must also specify the same + set of options that were used to generate code (`-fpic', `-fPIC', + or model suboptions) when you specify this option.(1) + + `-shared-libgcc' + `-static-libgcc' + On systems that provide `libgcc' as a shared library, these options + force the use of either the shared or static version respectively. + If no shared version of `libgcc' was built when the compiler was + configured, these options have no effect. + + There are several situations in which an application should use the + shared `libgcc' instead of the static version. The most common of + these is when the application wishes to throw and catch exceptions + across different shared libraries. In that case, each of the + libraries as well as the application itself should use the shared + `libgcc'. + + Therefore, the G++ and GCJ drivers automatically add + `-shared-libgcc' whenever you build a shared library or a main + executable, because C++ and Java programs typically use + exceptions, so this is the right thing to do. + + If, instead, you use the GCC driver to create shared libraries, + you may find that they will not always be linked with the shared + `libgcc'. If GCC finds, at its configuration time, that you have + a GNU linker that does not support option `--eh-frame-hdr', it + will link the shared version of `libgcc' into shared libraries by + default. Otherwise, it will take advantage of the linker and + optimize away the linking with the shared version of `libgcc', + linking with the static version of libgcc by default. This allows + exceptions to propagate through such shared libraries, without + incurring relocation costs at library load time. + + However, if a library or main executable is supposed to throw or + catch exceptions, you must link it using the G++ or GCJ driver, as + appropriate for the languages used in the program, or using the + option `-shared-libgcc', such that it is linked with the shared + `libgcc'. + + `-symbolic' + Bind references to global symbols when building a shared object. + Warn about any unresolved references (unless overridden by the + link editor option `-Xlinker -z -Xlinker defs'). Only a few + systems support this option. + + `-Xlinker OPTION' + Pass OPTION as an option to the linker. You can use this to + supply system-specific linker options which GCC does not know how + to recognize. + + If you want to pass an option that takes an argument, you must use + `-Xlinker' twice, once for the option and once for the argument. + For example, to pass `-assert definitions', you must write + `-Xlinker -assert -Xlinker definitions'. It does not work to write + `-Xlinker "-assert definitions"', because this passes the entire + string as a single argument, which is not what the linker expects. + + `-Wl,OPTION' + Pass OPTION as an option to the linker. If OPTION contains + commas, it is split into multiple options at the commas. + + `-u SYMBOL' + Pretend the symbol SYMBOL is undefined, to force linking of + library modules to define it. You can use `-u' multiple times with + different symbols to force loading of additional library modules. + + ---------- Footnotes ---------- + + (1) On some systems, `gcc -shared' needs to build supplementary stub + code for constructors to work. On multi-libbed systems, `gcc -shared' + must select the correct support libraries to link against. Failing to + supply the correct flags may lead to subtle defects. Supplying them in + cases where they are not necessary is innocuous. + +  + File: gcc.info, Node: Directory Options, Next: Spec Files, Prev: Link Options, Up: Invoking GCC + + Options for Directory Search + ============================ + + These options specify directories to search for header files, for + libraries and for parts of the compiler: + + `-IDIR' + Add the directory DIR to the head of the list of directories to be + searched for header files. This can be used to override a system + header file, substituting your own version, since these + directories are searched before the system header file + directories. However, you should not use this option to add + directories that contain vendor-supplied system header files (use + `-isystem' for that). If you use more than one `-I' option, the + directories are scanned in left-to-right order; the standard + system directories come after. + + If a standard system include directory, or a directory specified + with `-isystem', is also specified with `-I', the `-I' option will + be ignored. The directory will still be searched but as a system + directory at its normal position in the system include chain. + This is to ensure that GCC's procedure to fix buggy system headers + and the ordering for the include_next directive are not + inadvertantly changed. If you really need to change the search + order for system directories, use the `-nostdinc' and/or + `-isystem' options. + + `-I-' + Any directories you specify with `-I' options before the `-I-' + option are searched only for the case of `#include "FILE"'; they + are not searched for `#include '. + + If additional directories are specified with `-I' options after + the `-I-', these directories are searched for all `#include' + directives. (Ordinarily _all_ `-I' directories are used this way.) + + In addition, the `-I-' option inhibits the use of the current + directory (where the current input file came from) as the first + search directory for `#include "FILE"'. There is no way to + override this effect of `-I-'. With `-I.' you can specify + searching the directory which was current when the compiler was + invoked. That is not exactly the same as what the preprocessor + does by default, but it is often satisfactory. + + `-I-' does not inhibit the use of the standard system directories + for header files. Thus, `-I-' and `-nostdinc' are independent. + + `-LDIR' + Add directory DIR to the list of directories to be searched for + `-l'. + + `-BPREFIX' + This option specifies where to find the executables, libraries, + include files, and data files of the compiler itself. + + The compiler driver program runs one or more of the subprograms + `cpp', `cc1', `as' and `ld'. It tries PREFIX as a prefix for each + program it tries to run, both with and without `MACHINE/VERSION/' + (*note Target Options::). + + For each subprogram to be run, the compiler driver first tries the + `-B' prefix, if any. If that name is not found, or if `-B' was + not specified, the driver tries two standard prefixes, which are + `/usr/lib/gcc/' and `/usr/local/lib/gcc-lib/'. If neither of + those results in a file name that is found, the unmodified program + name is searched for using the directories specified in your + `PATH' environment variable. + + The compiler will check to see if the path provided by the `-B' + refers to a directory, and if necessary it will add a directory + separator character at the end of the path. + + `-B' prefixes that effectively specify directory names also apply + to libraries in the linker, because the compiler translates these + options into `-L' options for the linker. They also apply to + includes files in the preprocessor, because the compiler + translates these options into `-isystem' options for the + preprocessor. In this case, the compiler appends `include' to the + prefix. + + The run-time support file `libgcc.a' can also be searched for using + the `-B' prefix, if needed. If it is not found there, the two + standard prefixes above are tried, and that is all. The file is + left out of the link if it is not found by those means. + + Another way to specify a prefix much like the `-B' prefix is to use + the environment variable `GCC_EXEC_PREFIX'. *Note Environment + Variables::. + + As a special kludge, if the path provided by `-B' is + `[dir/]stageN/', where N is a number in the range 0 to 9, then it + will be replaced by `[dir/]include'. This is to help with + boot-strapping the compiler. + + `-specs=FILE' + Process FILE after the compiler reads in the standard `specs' + file, in order to override the defaults that the `gcc' driver + program uses when determining what switches to pass to `cc1', + `cc1plus', `as', `ld', etc. More than one `-specs=FILE' can be + specified on the command line, and they are processed in order, + from left to right. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-6 gcc-3.2.3/gcc/doc/gcc.info-6 *** gcc-3.2.2/gcc/doc/gcc.info-6 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-6 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1209 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: Spec Files, Next: Target Options, Prev: Directory Options, Up: Invoking GCC + + Specifying subprocesses and the switches to pass to them + ======================================================== + + `gcc' is a driver program. It performs its job by invoking a + sequence of other programs to do the work of compiling, assembling and + linking. GCC interprets its command-line parameters and uses these to + deduce which programs it should invoke, and which command-line options + it ought to place on their command lines. This behavior is controlled + by "spec strings". In most cases there is one spec string for each + program that GCC can invoke, but a few programs have multiple spec + strings to control their behavior. The spec strings built into GCC can + be overridden by using the `-specs=' command-line switch to specify a + spec file. + + "Spec files" are plaintext files that are used to construct spec + strings. They consist of a sequence of directives separated by blank + lines. The type of directive is determined by the first non-whitespace + character on the line and it can be one of the following: + + `%COMMAND' + Issues a COMMAND to the spec file processor. The commands that can + appear here are: + + `%include ' + Search for FILE and insert its text at the current point in + the specs file. + + `%include_noerr ' + Just like `%include', but do not generate an error message if + the include file cannot be found. + + `%rename OLD_NAME NEW_NAME' + Rename the spec string OLD_NAME to NEW_NAME. + + + `*[SPEC_NAME]:' + This tells the compiler to create, override or delete the named + spec string. All lines after this directive up to the next + directive or blank line are considered to be the text for the spec + string. If this results in an empty string then the spec will be + deleted. (Or, if the spec did not exist, then nothing will + happened.) Otherwise, if the spec does not currently exist a new + spec will be created. If the spec does exist then its contents + will be overridden by the text of this directive, unless the first + character of that text is the `+' character, in which case the + text will be appended to the spec. + + `[SUFFIX]:' + Creates a new `[SUFFIX] spec' pair. All lines after this directive + and up to the next directive or blank line are considered to make + up the spec string for the indicated suffix. When the compiler + encounters an input file with the named suffix, it will processes + the spec string in order to work out how to compile that file. + For example: + + .ZZ: + z-compile -input %i + + This says that any input file whose name ends in `.ZZ' should be + passed to the program `z-compile', which should be invoked with the + command-line switch `-input' and with the result of performing the + `%i' substitution. (See below.) + + As an alternative to providing a spec string, the text that + follows a suffix directive can be one of the following: + + `@LANGUAGE' + This says that the suffix is an alias for a known LANGUAGE. + This is similar to using the `-x' command-line switch to GCC + to specify a language explicitly. For example: + + .ZZ: + @c++ + + Says that .ZZ files are, in fact, C++ source files. + + `#NAME' + This causes an error messages saying: + + NAME compiler not installed on this system. + + GCC already has an extensive list of suffixes built into it. This + directive will add an entry to the end of the list of suffixes, but + since the list is searched from the end backwards, it is + effectively possible to override earlier entries using this + technique. + + + GCC has the following spec strings built into it. Spec files can + override these strings or create their own. Note that individual + targets can also add their own spec strings to this list. + + asm Options to pass to the assembler + asm_final Options to pass to the assembler post-processor + cpp Options to pass to the C preprocessor + cc1 Options to pass to the C compiler + cc1plus Options to pass to the C++ compiler + endfile Object files to include at the end of the link + link Options to pass to the linker + lib Libraries to include on the command line to the linker + libgcc Decides which GCC support library to pass to the linker + linker Sets the name of the linker + predefines Defines to be passed to the C preprocessor + signed_char Defines to pass to CPP to say whether `char' is signed + by default + startfile Object files to include at the start of the link + + Here is a small example of a spec file: + + %rename lib old_lib + + *lib: + --start-group -lgcc -lc -leval1 --end-group %(old_lib) + + This example renames the spec called `lib' to `old_lib' and then + overrides the previous definition of `lib' with a new one. The new + definition adds in some extra command-line options before including the + text of the old definition. + + "Spec strings" are a list of command-line options to be passed to + their corresponding program. In addition, the spec strings can contain + `%'-prefixed sequences to substitute variable text or to conditionally + insert text into the command line. Using these constructs it is + possible to generate quite complex command lines. + + Here is a table of all defined `%'-sequences for spec strings. Note + that spaces are not generated automatically around the results of + expanding these sequences. Therefore you can concatenate them together + or combine them with constant text in a single argument. + + `%%' + Substitute one `%' into the program name or argument. + + `%i' + Substitute the name of the input file being processed. + + `%b' + Substitute the basename of the input file being processed. This + is the substring up to (and not including) the last period and not + including the directory. + + `%B' + This is the same as `%b', but include the file suffix (text after + the last period). + + `%d' + Marks the argument containing or following the `%d' as a temporary + file name, so that that file will be deleted if GCC exits + successfully. Unlike `%g', this contributes no text to the + argument. + + `%gSUFFIX' + Substitute a file name that has suffix SUFFIX and is chosen once + per compilation, and mark the argument in the same way as `%d'. + To reduce exposure to denial-of-service attacks, the file name is + now chosen in a way that is hard to predict even when previously + chosen file names are known. For example, `%g.s ... %g.o ... %g.s' + might turn into `ccUVUUAU.s ccXYAXZ12.o ccUVUUAU.s'. SUFFIX + matches the regexp `[.A-Za-z]*' or the special string `%O', which + is treated exactly as if `%O' had been preprocessed. Previously, + `%g' was simply substituted with a file name chosen once per + compilation, without regard to any appended suffix (which was + therefore treated just like ordinary text), making such attacks + more likely to succeed. + + `%uSUFFIX' + Like `%g', but generates a new temporary file name even if + `%uSUFFIX' was already seen. + + `%USUFFIX' + Substitutes the last file name generated with `%uSUFFIX', + generating a new one if there is no such last file name. In the + absence of any `%uSUFFIX', this is just like `%gSUFFIX', except + they don't share the same suffix _space_, so `%g.s ... %U.s ... + %g.s ... %U.s' would involve the generation of two distinct file + names, one for each `%g.s' and another for each `%U.s'. + Previously, `%U' was simply substituted with a file name chosen + for the previous `%u', without regard to any appended suffix. + + `%jSUFFIX' + Substitutes the name of the `HOST_BIT_BUCKET', if any, and if it is + writable, and if save-temps is off; otherwise, substitute the name + of a temporary file, just like `%u'. This temporary file is not + meant for communication between processes, but rather as a junk + disposal mechanism. + + `%.SUFFIX' + Substitutes .SUFFIX for the suffixes of a matched switch's args + when it is subsequently output with `%*'. SUFFIX is terminated by + the next space or %. + + `%w' + Marks the argument containing or following the `%w' as the + designated output file of this compilation. This puts the argument + into the sequence of arguments that `%o' will substitute later. + + `%o' + Substitutes the names of all the output files, with spaces + automatically placed around them. You should write spaces around + the `%o' as well or the results are undefined. `%o' is for use in + the specs for running the linker. Input files whose names have no + recognized suffix are not compiled at all, but they are included + among the output files, so they will be linked. + + `%O' + Substitutes the suffix for object files. Note that this is + handled specially when it immediately follows `%g, %u, or %U', + because of the need for those to form complete file names. The + handling is such that `%O' is treated exactly as if it had already + been substituted, except that `%g, %u, and %U' do not currently + support additional SUFFIX characters following `%O' as they would + following, for example, `.o'. + + `%p' + Substitutes the standard macro predefinitions for the current + target machine. Use this when running `cpp'. + + `%P' + Like `%p', but puts `__' before and after the name of each + predefined macro, except for macros that start with `__' or with + `_L', where L is an uppercase letter. This is for ISO C. + + `%I' + Substitute a `-iprefix' option made from `GCC_EXEC_PREFIX'. + + `%s' + Current argument is the name of a library or startup file of some + sort. Search for that file in a standard list of directories and + substitute the full name found. + + `%eSTR' + Print STR as an error message. STR is terminated by a newline. + Use this when inconsistent options are detected. + + `%|' + Output `-' if the input for the current command is coming from a + pipe. + + `%(NAME)' + Substitute the contents of spec string NAME at this point. + + `%[NAME]' + Like `%(...)' but put `__' around `-D' arguments. + + `%x{OPTION}' + Accumulate an option for `%X'. + + `%X' + Output the accumulated linker options specified by `-Wl' or a `%x' + spec string. + + `%Y' + Output the accumulated assembler options specified by `-Wa'. + + `%Z' + Output the accumulated preprocessor options specified by `-Wp'. + + `%v1' + Substitute the major version number of GCC. (For version 2.9.5, + this is 2.) + + `%v2' + Substitute the minor version number of GCC. (For version 2.9.5, + this is 9.) + + `%v3' + Substitute the patch level number of GCC. (For version 2.9.5, + this is 5.) + + `%a' + Process the `asm' spec. This is used to compute the switches to + be passed to the assembler. + + `%A' + Process the `asm_final' spec. This is a spec string for passing + switches to an assembler post-processor, if such a program is + needed. + + `%l' + Process the `link' spec. This is the spec for computing the + command line passed to the linker. Typically it will make use of + the `%L %G %S %D and %E' sequences. + + `%D' + Dump out a `-L' option for each directory that GCC believes might + contain startup files. If the target supports multilibs then the + current multilib directory will be prepended to each of these + paths. + + `%M' + Output the multilib directory with directory separators replaced + with `_'. If multilib directories are not set, or the multilib + directory is `.' then this option emits nothing. + + `%L' + Process the `lib' spec. This is a spec string for deciding which + libraries should be included on the command line to the linker. + + `%G' + Process the `libgcc' spec. This is a spec string for deciding + which GCC support library should be included on the command line + to the linker. + + `%S' + Process the `startfile' spec. This is a spec for deciding which + object files should be the first ones passed to the linker. + Typically this might be a file named `crt0.o'. + + `%E' + Process the `endfile' spec. This is a spec string that specifies + the last object files that will be passed to the linker. + + `%C' + Process the `cpp' spec. This is used to construct the arguments + to be passed to the C preprocessor. + + `%c' + Process the `signed_char' spec. This is intended to be used to + tell cpp whether a char is signed. It typically has the + definition: + %{funsigned-char:-D__CHAR_UNSIGNED__} + + `%1' + Process the `cc1' spec. This is used to construct the options to + be passed to the actual C compiler (`cc1'). + + `%2' + Process the `cc1plus' spec. This is used to construct the options + to be passed to the actual C++ compiler (`cc1plus'). + + `%*' + Substitute the variable part of a matched option. See below. + Note that each comma in the substituted string is replaced by a + single space. + + `%{`S'}' + Substitutes the `-S' switch, if that switch was given to GCC. If + that switch was not specified, this substitutes nothing. Note that + the leading dash is omitted when specifying this option, and it is + automatically inserted if the substitution is performed. Thus the + spec string `%{foo}' would match the command-line option `-foo' + and would output the command line option `-foo'. + + `%W{`S'}' + Like %{`S'} but mark last argument supplied within as a file to be + deleted on failure. + + `%{`S'*}' + Substitutes all the switches specified to GCC whose names start + with `-S', but which also take an argument. This is used for + switches like `-o', `-D', `-I', etc. GCC considers `-o foo' as + being one switch whose names starts with `o'. %{o*} would + substitute this text, including the space. Thus two arguments + would be generated. + + `%{^`S'*}' + Like %{`S'*}, but don't put a blank between a switch and its + argument. Thus %{^o*} would only generate one argument, not two. + + `%{`S'*&`T'*}' + Like %{`S'*}, but preserve order of `S' and `T' options (the order + of `S' and `T' in the spec is not significant). There can be any + number of ampersand-separated variables; for each the wild card is + optional. Useful for CPP as `%{D*&U*&A*}'. + + `%{<`S'}' + Remove all occurrences of `-S' from the command line. Note--this + command is position dependent. `%' commands in the spec string + before this option will see `-S', `%' commands in the spec string + after this option will not. + + `%{`S'*:`X'}' + Substitutes `X' if one or more switches whose names start with + `-S' are specified to GCC. Note that the tail part of the `-S' + option (i.e. the part matched by the `*') will be substituted for + each occurrence of `%*' within `X'. + + `%{`S':`X'}' + Substitutes `X', but only if the `-S' switch was given to GCC. + + `%{!`S':`X'}' + Substitutes `X', but only if the `-S' switch was _not_ given to + GCC. + + `%{|`S':`X'}' + Like %{`S':`X'}, but if no `S' switch, substitute `-'. + + `%{|!`S':`X'}' + Like %{!`S':`X'}, but if there is an `S' switch, substitute `-'. + + `%{.`S':`X'}' + Substitutes `X', but only if processing a file with suffix `S'. + + `%{!.`S':`X'}' + Substitutes `X', but only if _not_ processing a file with suffix + `S'. + + `%{`S'|`P':`X'}' + Substitutes `X' if either `-S' or `-P' was given to GCC. This may + be combined with `!' and `.' sequences as well, although they have + a stronger binding than the `|'. For example a spec string like + this: + + %{.c:-foo} %{!.c:-bar} %{.c|d:-baz} %{!.c|d:-boggle} + + will output the following command-line options from the following + input command-line options: + + fred.c -foo -baz + jim.d -bar -boggle + -d fred.c -foo -baz -boggle + -d jim.d -bar -baz -boggle + + + The conditional text `X' in a %{`S':`X'} or %{!`S':`X'} construct + may contain other nested `%' constructs or spaces, or even newlines. + They are processed as usual, as described above. + + The `-O', `-f', `-m', and `-W' switches are handled specifically in + these constructs. If another value of `-O' or the negated form of a + `-f', `-m', or `-W' switch is found later in the command line, the + earlier switch value is ignored, except with {`S'*} where `S' is just + one letter, which passes all matching options. + + The character `|' at the beginning of the predicate text is used to + indicate that a command should be piped to the following command, but + only if `-pipe' is specified. + + It is built into GCC which switches take arguments and which do not. + (You might think it would be useful to generalize this to allow each + compiler's spec to say which switches take arguments. But this cannot + be done in a consistent fashion. GCC cannot even decide which input + files have been specified without knowing which switches take arguments, + and it must know which input files to compile in order to tell which + compilers to run). + + GCC also knows implicitly that arguments starting in `-l' are to be + treated as compiler output files, and passed to the linker in their + proper position among the other output files. + +  + File: gcc.info, Node: Target Options, Next: Submodel Options, Prev: Spec Files, Up: Invoking GCC + + Specifying Target Machine and Compiler Version + ============================================== + + By default, GCC compiles code for the same type of machine that you + are using. However, it can also be installed as a cross-compiler, to + compile for some other type of machine. In fact, several different + configurations of GCC, for different target machines, can be installed + side by side. Then you specify which one to use with the `-b' option. + + In addition, older and newer versions of GCC can be installed side + by side. One of them (probably the newest) will be the default, but + you may sometimes wish to use another. + + `-b MACHINE' + The argument MACHINE specifies the target machine for compilation. + This is useful when you have installed GCC as a cross-compiler. + + The value to use for MACHINE is the same as was specified as the + machine type when configuring GCC as a cross-compiler. For + example, if a cross-compiler was configured with `configure + i386v', meaning to compile for an 80386 running System V, then you + would specify `-b i386v' to run that cross compiler. + + When you do not specify `-b', it normally means to compile for the + same type of machine that you are using. + + `-V VERSION' + The argument VERSION specifies which version of GCC to run. This + is useful when multiple versions are installed. For example, + VERSION might be `2.0', meaning to run GCC version 2.0. + + The default version, when you do not specify `-V', is the last + version of GCC that you installed. + + The `-b' and `-V' options actually work by controlling part of the + file name used for the executable files and libraries used for + compilation. A given version of GCC, for a given target machine, is + normally kept in the directory `/usr/local/lib/gcc-lib/MACHINE/VERSION'. + + Thus, sites can customize the effect of `-b' or `-V' either by + changing the names of these directories or adding alternate names (or + symbolic links). If in directory `/usr/local/lib/gcc-lib/' the file + `80386' is a link to the file `i386v', then `-b 80386' becomes an alias + for `-b i386v'. + + In one respect, the `-b' or `-V' do not completely change to a + different compiler: the top-level driver program `gcc' that you + originally invoked continues to run and invoke the other executables + (preprocessor, compiler per se, assembler and linker) that do the real + work. However, since no real work is done in the driver program, it + usually does not matter that the driver program in use is not the one + for the specified target. It is common for the interface to the other + executables to change incompatibly between compiler versions, so unless + the version specified is very close to that of the driver (for example, + `-V 3.0' with a driver program from GCC version 3.0.1), use of `-V' may + not work; for example, using `-V 2.95.2' will not work with a driver + program from GCC 3.0. + + The only way that the driver program depends on the target machine is + in the parsing and handling of special machine-specific options. + However, this is controlled by a file which is found, along with the + other executables, in the directory for the specified version and + target machine. As a result, a single installed driver program adapts + to any specified target machine, and sufficiently similar compiler + versions. + + The driver program executable does control one significant thing, + however: the default version and target machine. Therefore, you can + install different instances of the driver program, compiled for + different targets or versions, under different names. + + For example, if the driver for version 2.0 is installed as `ogcc' + and that for version 2.1 is installed as `gcc', then the command `gcc' + will use version 2.1 by default, while `ogcc' will use 2.0 by default. + However, you can choose either version with either command with the + `-V' option. + +  + File: gcc.info, Node: Submodel Options, Next: Code Gen Options, Prev: Target Options, Up: Invoking GCC + + Hardware Models and Configurations + ================================== + + Earlier we discussed the standard option `-b' which chooses among + different installed compilers for completely different target machines, + such as VAX vs. 68000 vs. 80386. + + In addition, each of these target machine types can have its own + special options, starting with `-m', to choose among various hardware + models or configurations--for example, 68010 vs 68020, floating + coprocessor or none. A single installed version of the compiler can + compile for any model or configuration, according to the options + specified. + + Some configurations of the compiler also support additional special + options, usually for compatibility with other compilers on the same + platform. + + These options are defined by the macro `TARGET_SWITCHES' in the + machine description. The default for the options is also defined by + that macro, which enables you to change the defaults. + + * Menu: + + * M680x0 Options:: + * M68hc1x Options:: + * VAX Options:: + * SPARC Options:: + * Convex Options:: + * AMD29K Options:: + * ARM Options:: + * MN10200 Options:: + * MN10300 Options:: + * M32R/D Options:: + * M88K Options:: + * RS/6000 and PowerPC Options:: + * RT Options:: + * MIPS Options:: + * i386 and x86-64 Options:: + * HPPA Options:: + * Intel 960 Options:: + * DEC Alpha Options:: + * DEC Alpha/VMS Options:: + * Clipper Options:: + * H8/300 Options:: + * SH Options:: + * System V Options:: + * TMS320C3x/C4x Options:: + * V850 Options:: + * ARC Options:: + * NS32K Options:: + * AVR Options:: + * MCore Options:: + * IA-64 Options:: + * D30V Options:: + * S/390 and zSeries Options:: + * CRIS Options:: + * MMIX Options:: + * PDP-11 Options:: + * Xstormy16 Options:: + * Xtensa Options:: + +  + File: gcc.info, Node: M680x0 Options, Next: M68hc1x Options, Up: Submodel Options + + M680x0 Options + -------------- + + These are the `-m' options defined for the 68000 series. The default + values for these options depends on which style of 68000 was selected + when the compiler was configured; the defaults for the most common + choices are given below. + + `-m68000' + `-mc68000' + Generate output for a 68000. This is the default when the + compiler is configured for 68000-based systems. + + Use this option for microcontrollers with a 68000 or EC000 core, + including the 68008, 68302, 68306, 68307, 68322, 68328 and 68356. + + `-m68020' + `-mc68020' + Generate output for a 68020. This is the default when the + compiler is configured for 68020-based systems. + + `-m68881' + Generate output containing 68881 instructions for floating point. + This is the default for most 68020 systems unless `--nfp' was + specified when the compiler was configured. + + `-m68030' + Generate output for a 68030. This is the default when the + compiler is configured for 68030-based systems. + + `-m68040' + Generate output for a 68040. This is the default when the + compiler is configured for 68040-based systems. + + This option inhibits the use of 68881/68882 instructions that have + to be emulated by software on the 68040. Use this option if your + 68040 does not have code to emulate those instructions. + + `-m68060' + Generate output for a 68060. This is the default when the + compiler is configured for 68060-based systems. + + This option inhibits the use of 68020 and 68881/68882 instructions + that have to be emulated by software on the 68060. Use this + option if your 68060 does not have code to emulate those + instructions. + + `-mcpu32' + Generate output for a CPU32. This is the default when the + compiler is configured for CPU32-based systems. + + Use this option for microcontrollers with a CPU32 or CPU32+ core, + including the 68330, 68331, 68332, 68333, 68334, 68336, 68340, + 68341, 68349 and 68360. + + `-m5200' + Generate output for a 520X "coldfire" family cpu. This is the + default when the compiler is configured for 520X-based systems. + + Use this option for microcontroller with a 5200 core, including + the MCF5202, MCF5203, MCF5204 and MCF5202. + + `-m68020-40' + Generate output for a 68040, without using any of the new + instructions. This results in code which can run relatively + efficiently on either a 68020/68881 or a 68030 or a 68040. The + generated code does use the 68881 instructions that are emulated + on the 68040. + + `-m68020-60' + Generate output for a 68060, without using any of the new + instructions. This results in code which can run relatively + efficiently on either a 68020/68881 or a 68030 or a 68040. The + generated code does use the 68881 instructions that are emulated + on the 68060. + + `-mfpa' + Generate output containing Sun FPA instructions for floating point. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not available for all m68k + targets. Normally the facilities of the machine's usual C + compiler are used, but this can't be done directly in + cross-compilation. You must make your own arrangements to provide + suitable library functions for cross-compilation. The embedded + targets `m68k-*-aout' and `m68k-*-coff' do provide software + floating point support. + + `-mshort' + Consider type `int' to be 16 bits wide, like `short int'. + + `-mnobitfield' + Do not use the bit-field instructions. The `-m68000', `-mcpu32' + and `-m5200' options imply `-mnobitfield'. + + `-mbitfield' + Do use the bit-field instructions. The `-m68020' option implies + `-mbitfield'. This is the default if you use a configuration + designed for a 68020. + + `-mrtd' + Use a different function-calling convention, in which functions + that take a fixed number of arguments return with the `rtd' + instruction, which pops their arguments while returning. This + saves one instruction in the caller since there is no need to pop + the arguments there. + + This calling convention is incompatible with the one normally used + on Unix, so you cannot use it if you need to call libraries + compiled with the Unix compiler. + + Also, you must provide function prototypes for all functions that + take variable numbers of arguments (including `printf'); otherwise + incorrect code will be generated for calls to those functions. + + In addition, seriously incorrect code will result if you call a + function with too many arguments. (Normally, extra arguments are + harmlessly ignored.) + + The `rtd' instruction is supported by the 68010, 68020, 68030, + 68040, 68060 and CPU32 processors, but not by the 68000 or 5200. + + `-malign-int' + `-mno-align-int' + Control whether GCC aligns `int', `long', `long long', `float', + `double', and `long double' variables on a 32-bit boundary + (`-malign-int') or a 16-bit boundary (`-mno-align-int'). Aligning + variables on 32-bit boundaries produces code that runs somewhat + faster on processors with 32-bit busses at the expense of more + memory. + + *Warning:* if you use the `-malign-int' switch, GCC will align + structures containing the above types differently than most + published application binary interface specifications for the m68k. + + `-mpcrel' + Use the pc-relative addressing mode of the 68000 directly, instead + of using a global offset table. At present, this option implies + `-fpic', allowing at most a 16-bit offset for pc-relative + addressing. `-fPIC' is not presently supported with `-mpcrel', + though this could be supported for 68020 and higher processors. + + `-mno-strict-align' + `-mstrict-align' + Do not (do) assume that unaligned memory references will be + handled by the system. + + +  + File: gcc.info, Node: M68hc1x Options, Next: VAX Options, Prev: M680x0 Options, Up: Submodel Options + + M68hc1x Options + --------------- + + These are the `-m' options defined for the 68hc11 and 68hc12 + microcontrollers. The default values for these options depends on + which style of microcontroller was selected when the compiler was + configured; the defaults for the most common choices are given below. + + `-m6811' + `-m68hc11' + Generate output for a 68HC11. This is the default when the + compiler is configured for 68HC11-based systems. + + `-m6812' + `-m68hc12' + Generate output for a 68HC12. This is the default when the + compiler is configured for 68HC12-based systems. + + `-mauto-incdec' + Enable the use of 68HC12 pre and post auto-increment and + auto-decrement addressing modes. + + `-mshort' + Consider type `int' to be 16 bits wide, like `short int'. + + `-msoft-reg-count=COUNT' + Specify the number of pseudo-soft registers which are used for the + code generation. The maximum number is 32. Using more pseudo-soft + register may or may not result in better code depending on the + program. The default is 4 for 68HC11 and 2 for 68HC12. + + +  + File: gcc.info, Node: VAX Options, Next: SPARC Options, Prev: M68hc1x Options, Up: Submodel Options + + VAX Options + ----------- + + These `-m' options are defined for the VAX: + + `-munix' + Do not output certain jump instructions (`aobleq' and so on) that + the Unix assembler for the VAX cannot handle across long ranges. + + `-mgnu' + Do output those jump instructions, on the assumption that you will + assemble with the GNU assembler. + + `-mg' + Output code for g-format floating point numbers instead of + d-format. + +  + File: gcc.info, Node: SPARC Options, Next: Convex Options, Prev: VAX Options, Up: Submodel Options + + SPARC Options + ------------- + + These `-m' switches are supported on the SPARC: + + `-mno-app-regs' + `-mapp-regs' + Specify `-mapp-regs' to generate output using the global registers + 2 through 4, which the SPARC SVR4 ABI reserves for applications. + This is the default. + + To be fully SVR4 ABI compliant at the cost of some performance + loss, specify `-mno-app-regs'. You should compile libraries and + system software with this option. + + `-mfpu' + `-mhard-float' + Generate output containing floating point instructions. This is + the default. + + `-mno-fpu' + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not available for all SPARC + targets. Normally the facilities of the machine's usual C + compiler are used, but this cannot be done directly in + cross-compilation. You must make your own arrangements to provide + suitable library functions for cross-compilation. The embedded + targets `sparc-*-aout' and `sparclite-*-*' do provide software + floating point support. + + `-msoft-float' changes the calling convention in the output file; + therefore, it is only useful if you compile _all_ of a program with + this option. In particular, you need to compile `libgcc.a', the + library that comes with GCC, with `-msoft-float' in order for this + to work. + + `-mhard-quad-float' + Generate output containing quad-word (long double) floating point + instructions. + + `-msoft-quad-float' + Generate output containing library calls for quad-word (long + double) floating point instructions. The functions called are + those specified in the SPARC ABI. This is the default. + + As of this writing, there are no sparc implementations that have + hardware support for the quad-word floating point instructions. + They all invoke a trap handler for one of these instructions, and + then the trap handler emulates the effect of the instruction. + Because of the trap handler overhead, this is much slower than + calling the ABI library routines. Thus the `-msoft-quad-float' + option is the default. + + `-mno-flat' + `-mflat' + With `-mflat', the compiler does not generate save/restore + instructions and will use a "flat" or single register window + calling convention. This model uses %i7 as the frame pointer and + is compatible with the normal register window model. Code from + either may be intermixed. The local registers and the input + registers (0-5) are still treated as "call saved" registers and + will be saved on the stack as necessary. + + With `-mno-flat' (the default), the compiler emits save/restore + instructions (except for leaf functions) and is the normal mode of + operation. + + `-mno-unaligned-doubles' + `-munaligned-doubles' + Assume that doubles have 8 byte alignment. This is the default. + + With `-munaligned-doubles', GCC assumes that doubles have 8 byte + alignment only if they are contained in another type, or if they + have an absolute address. Otherwise, it assumes they have 4 byte + alignment. Specifying this option avoids some rare compatibility + problems with code generated by other compilers. It is not the + default because it results in a performance loss, especially for + floating point code. + + `-mno-faster-structs' + `-mfaster-structs' + With `-mfaster-structs', the compiler assumes that structures + should have 8 byte alignment. This enables the use of pairs of + `ldd' and `std' instructions for copies in structure assignment, + in place of twice as many `ld' and `st' pairs. However, the use + of this changed alignment directly violates the Sparc ABI. Thus, + it's intended only for use on targets where the developer + acknowledges that their resulting code will not be directly in + line with the rules of the ABI. + + `-mv8' + `-msparclite' + These two options select variations on the SPARC architecture. + + By default (unless specifically configured for the Fujitsu + SPARClite), GCC generates code for the v7 variant of the SPARC + architecture. + + `-mv8' will give you SPARC v8 code. The only difference from v7 + code is that the compiler emits the integer multiply and integer + divide instructions which exist in SPARC v8 but not in SPARC v7. + + `-msparclite' will give you SPARClite code. This adds the integer + multiply, integer divide step and scan (`ffs') instructions which + exist in SPARClite but not in SPARC v7. + + These options are deprecated and will be deleted in a future GCC + release. They have been replaced with `-mcpu=xxx'. + + `-mcypress' + `-msupersparc' + These two options select the processor for which the code is + optimized. + + With `-mcypress' (the default), the compiler optimizes code for the + Cypress CY7C602 chip, as used in the SparcStation/SparcServer 3xx + series. This is also appropriate for the older SparcStation 1, 2, + IPX etc. + + With `-msupersparc' the compiler optimizes code for the SuperSparc + cpu, as used in the SparcStation 10, 1000 and 2000 series. This + flag also enables use of the full SPARC v8 instruction set. + + These options are deprecated and will be deleted in a future GCC + release. They have been replaced with `-mcpu=xxx'. + + `-mcpu=CPU_TYPE' + Set the instruction set, register set, and instruction scheduling + parameters for machine type CPU_TYPE. Supported values for + CPU_TYPE are `v7', `cypress', `v8', `supersparc', `sparclite', + `hypersparc', `sparclite86x', `f930', `f934', `sparclet', + `tsc701', `v9', and `ultrasparc'. + + Default instruction scheduling parameters are used for values that + select an architecture and not an implementation. These are `v7', + `v8', `sparclite', `sparclet', `v9'. + + Here is a list of each supported architecture and their supported + implementations. + + v7: cypress + v8: supersparc, hypersparc + sparclite: f930, f934, sparclite86x + sparclet: tsc701 + v9: ultrasparc + + `-mtune=CPU_TYPE' + Set the instruction scheduling parameters for machine type + CPU_TYPE, but do not set the instruction set or register set that + the option `-mcpu=CPU_TYPE' would. + + The same values for `-mcpu=CPU_TYPE' can be used for + `-mtune=CPU_TYPE', but the only useful values are those that + select a particular cpu implementation. Those are `cypress', + `supersparc', `hypersparc', `f930', `f934', `sparclite86x', + `tsc701', and `ultrasparc'. + + + These `-m' switches are supported in addition to the above on the + SPARCLET processor. + + `-mlittle-endian' + Generate code for a processor running in little-endian mode. + + `-mlive-g0' + Treat register `%g0' as a normal register. GCC will continue to + clobber it as necessary but will not assume it always reads as 0. + + `-mbroken-saverestore' + Generate code that does not use non-trivial forms of the `save' and + `restore' instructions. Early versions of the SPARCLET processor + do not correctly handle `save' and `restore' instructions used with + arguments. They correctly handle them used without arguments. A + `save' instruction used without arguments increments the current + window pointer but does not allocate a new stack frame. It is + assumed that the window overflow trap handler will properly handle + this case as will interrupt handlers. + + These `-m' switches are supported in addition to the above on SPARC + V9 processors in 64-bit environments. + + `-mlittle-endian' + Generate code for a processor running in little-endian mode. + + `-m32' + `-m64' + Generate code for a 32-bit or 64-bit environment. The 32-bit + environment sets int, long and pointer to 32 bits. The 64-bit + environment sets int to 32 bits and long and pointer to 64 bits. + + `-mcmodel=medlow' + Generate code for the Medium/Low code model: the program must be + linked in the low 32 bits of the address space. Pointers are 64 + bits. Programs can be statically or dynamically linked. + + `-mcmodel=medmid' + Generate code for the Medium/Middle code model: the program must + be linked in the low 44 bits of the address space, the text + segment must be less than 2G bytes, and data segment must be + within 2G of the text segment. Pointers are 64 bits. + + `-mcmodel=medany' + Generate code for the Medium/Anywhere code model: the program may + be linked anywhere in the address space, the text segment must be + less than 2G bytes, and data segment must be within 2G of the text + segment. Pointers are 64 bits. + + `-mcmodel=embmedany' + Generate code for the Medium/Anywhere code model for embedded + systems: assume a 32-bit text and a 32-bit data segment, both + starting anywhere (determined at link time). Register %g4 points + to the base of the data segment. Pointers are still 64 bits. + Programs are statically linked, PIC is not supported. + + `-mstack-bias' + `-mno-stack-bias' + With `-mstack-bias', GCC assumes that the stack pointer, and frame + pointer if present, are offset by -2047 which must be added back + when making stack frame references. Otherwise, assume no such + offset is present. + +  + File: gcc.info, Node: Convex Options, Next: AMD29K Options, Prev: SPARC Options, Up: Submodel Options + + Convex Options + -------------- + + These `-m' options are defined for Convex: + + `-mc1' + Generate output for C1. The code will run on any Convex machine. + The preprocessor symbol `__convex__c1__' is defined. + + `-mc2' + Generate output for C2. Uses instructions not available on C1. + Scheduling and other optimizations are chosen for max performance + on C2. The preprocessor symbol `__convex_c2__' is defined. + + `-mc32' + Generate output for C32xx. Uses instructions not available on C1. + Scheduling and other optimizations are chosen for max performance + on C32. The preprocessor symbol `__convex_c32__' is defined. + + `-mc34' + Generate output for C34xx. Uses instructions not available on C1. + Scheduling and other optimizations are chosen for max performance + on C34. The preprocessor symbol `__convex_c34__' is defined. + + `-mc38' + Generate output for C38xx. Uses instructions not available on C1. + Scheduling and other optimizations are chosen for max performance + on C38. The preprocessor symbol `__convex_c38__' is defined. + + `-margcount' + Generate code which puts an argument count in the word preceding + each argument list. This is compatible with regular CC, and a few + programs may need the argument count word. GDB and other + source-level debuggers do not need it; this info is in the symbol + table. + + `-mnoargcount' + Omit the argument count word. This is the default. + + `-mvolatile-cache' + Allow volatile references to be cached. This is the default. + + `-mvolatile-nocache' + Volatile references bypass the data cache, going all the way to + memory. This is only needed for multi-processor code that does + not use standard synchronization instructions. Making + non-volatile references to volatile locations will not necessarily + work. + + `-mlong32' + Type long is 32 bits, the same as type int. This is the default. + + `-mlong64' + Type long is 64 bits, the same as type long long. This option is + useless, because no library support exists for it. + +  + File: gcc.info, Node: AMD29K Options, Next: ARM Options, Prev: Convex Options, Up: Submodel Options + + AMD29K Options + -------------- + + These `-m' options are defined for the AMD Am29000: + + `-mdw' + Generate code that assumes the `DW' bit is set, i.e., that byte and + halfword operations are directly supported by the hardware. This + is the default. + + `-mndw' + Generate code that assumes the `DW' bit is not set. + + `-mbw' + Generate code that assumes the system supports byte and halfword + write operations. This is the default. + + `-mnbw' + Generate code that assumes the systems does not support byte and + halfword write operations. `-mnbw' implies `-mndw'. + + `-msmall' + Use a small memory model that assumes that all function addresses + are either within a single 256 KB segment or at an absolute + address of less than 256k. This allows the `call' instruction to + be used instead of a `const', `consth', `calli' sequence. + + `-mnormal' + Use the normal memory model: Generate `call' instructions only when + calling functions in the same file and `calli' instructions + otherwise. This works if each file occupies less than 256 KB but + allows the entire executable to be larger than 256 KB. This is + the default. + + `-mlarge' + Always use `calli' instructions. Specify this option if you expect + a single file to compile into more than 256 KB of code. + + `-m29050' + Generate code for the Am29050. + + `-m29000' + Generate code for the Am29000. This is the default. + + `-mkernel-registers' + Generate references to registers `gr64-gr95' instead of to + registers `gr96-gr127'. This option can be used when compiling + kernel code that wants a set of global registers disjoint from + that used by user-mode code. + + Note that when this option is used, register names in `-f' flags + must use the normal, user-mode, names. + + `-muser-registers' + Use the normal set of global registers, `gr96-gr127'. This is the + default. + + `-mstack-check' + `-mno-stack-check' + Insert (or do not insert) a call to `__msp_check' after each stack + adjustment. This is often used for kernel code. + + `-mstorem-bug' + `-mno-storem-bug' + `-mstorem-bug' handles 29k processors which cannot handle the + separation of a mtsrim insn and a storem instruction (most 29000 + chips to date, but not the 29050). + + `-mno-reuse-arg-regs' + `-mreuse-arg-regs' + `-mno-reuse-arg-regs' tells the compiler to only use incoming + argument registers for copying out arguments. This helps detect + calling a function with fewer arguments than it was declared with. + + `-mno-impure-text' + `-mimpure-text' + `-mimpure-text', used in addition to `-shared', tells the compiler + to not pass `-assert pure-text' to the linker when linking a + shared object. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not part of GCC. Normally + the facilities of the machine's usual C compiler are used, but + this can't be done directly in cross-compilation. You must make + your own arrangements to provide suitable library functions for + cross-compilation. + + `-mno-multm' + Do not generate multm or multmu instructions. This is useful for + some embedded systems which do not have trap handlers for these + instructions. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-7 gcc-3.2.3/gcc/doc/gcc.info-7 *** gcc-3.2.2/gcc/doc/gcc.info-7 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-7 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1130 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: ARM Options, Next: MN10200 Options, Prev: AMD29K Options, Up: Submodel Options + + ARM Options + ----------- + + These `-m' options are defined for Advanced RISC Machines (ARM) + architectures: + + `-mapcs-frame' + Generate a stack frame that is compliant with the ARM Procedure + Call Standard for all functions, even if this is not strictly + necessary for correct execution of the code. Specifying + `-fomit-frame-pointer' with this option will cause the stack + frames not to be generated for leaf functions. The default is + `-mno-apcs-frame'. + + `-mapcs' + This is a synonym for `-mapcs-frame'. + + `-mapcs-26' + Generate code for a processor running with a 26-bit program + counter, and conforming to the function calling standards for the + APCS 26-bit option. This option replaces the `-m2' and `-m3' + options of previous releases of the compiler. + + `-mapcs-32' + Generate code for a processor running with a 32-bit program + counter, and conforming to the function calling standards for the + APCS 32-bit option. This option replaces the `-m6' option of + previous releases of the compiler. + + `-mthumb-interwork' + Generate code which supports calling between the ARM and Thumb + instruction sets. Without this option the two instruction sets + cannot be reliably used inside one program. The default is + `-mno-thumb-interwork', since slightly larger code is generated + when `-mthumb-interwork' is specified. + + `-mno-sched-prolog' + Prevent the reordering of instructions in the function prolog, or + the merging of those instruction with the instructions in the + function's body. This means that all functions will start with a + recognizable set of instructions (or in fact one of a choice from + a small set of different function prologues), and this information + can be used to locate the start if functions inside an executable + piece of code. The default is `-msched-prolog'. + + `-mhard-float' + Generate output containing floating point instructions. This is + the default. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not available for all ARM + targets. Normally the facilities of the machine's usual C + compiler are used, but this cannot be done directly in + cross-compilation. You must make your own arrangements to provide + suitable library functions for cross-compilation. + + `-msoft-float' changes the calling convention in the output file; + therefore, it is only useful if you compile _all_ of a program with + this option. In particular, you need to compile `libgcc.a', the + library that comes with GCC, with `-msoft-float' in order for this + to work. + + `-mlittle-endian' + Generate code for a processor running in little-endian mode. This + is the default for all standard configurations. + + `-mbig-endian' + Generate code for a processor running in big-endian mode; the + default is to compile code for a little-endian processor. + + `-mwords-little-endian' + This option only applies when generating code for big-endian + processors. Generate code for a little-endian word order but a + big-endian byte order. That is, a byte order of the form + `32107654'. Note: this option should only be used if you require + compatibility with code for big-endian ARM processors generated by + versions of the compiler prior to 2.8. + + `-malignment-traps' + Generate code that will not trap if the MMU has alignment traps + enabled. On ARM architectures prior to ARMv4, there were no + instructions to access half-word objects stored in memory. + However, when reading from memory a feature of the ARM + architecture allows a word load to be used, even if the address is + unaligned, and the processor core will rotate the data as it is + being loaded. This option tells the compiler that such misaligned + accesses will cause a MMU trap and that it should instead + synthesise the access as a series of byte accesses. The compiler + can still use word accesses to load half-word data if it knows + that the address is aligned to a word boundary. + + This option is ignored when compiling for ARM architecture 4 or + later, since these processors have instructions to directly access + half-word objects in memory. + + `-mno-alignment-traps' + Generate code that assumes that the MMU will not trap unaligned + accesses. This produces better code when the target instruction + set does not have half-word memory operations (i.e. + implementations prior to ARMv4). + + Note that you cannot use this option to access unaligned word + objects, since the processor will only fetch one 32-bit aligned + object from memory. + + The default setting for most targets is `-mno-alignment-traps', + since this produces better code when there are no half-word memory + instructions available. + + `-mshort-load-bytes' + `-mno-short-load-words' + These are deprecated aliases for `-malignment-traps'. + + `-mno-short-load-bytes' + `-mshort-load-words' + This are deprecated aliases for `-mno-alignment-traps'. + + `-mbsd' + This option only applies to RISC iX. Emulate the native BSD-mode + compiler. This is the default if `-ansi' is not specified. + + `-mxopen' + This option only applies to RISC iX. Emulate the native + X/Open-mode compiler. + + `-mno-symrename' + This option only applies to RISC iX. Do not run the assembler + post-processor, `symrename', after code has been assembled. + Normally it is necessary to modify some of the standard symbols in + preparation for linking with the RISC iX C library; this option + suppresses this pass. The post-processor is never run when the + compiler is built for cross-compilation. + + `-mcpu=NAME' + This specifies the name of the target ARM processor. GCC uses + this name to determine what kind of instructions it can emit when + generating assembly code. Permissible names are: `arm2', `arm250', + `arm3', `arm6', `arm60', `arm600', `arm610', `arm620', `arm7', + `arm7m', `arm7d', `arm7dm', `arm7di', `arm7dmi', `arm70', `arm700', + `arm700i', `arm710', `arm710c', `arm7100', `arm7500', `arm7500fe', + `arm7tdmi', `arm8', `strongarm', `strongarm110', `strongarm1100', + `arm8', `arm810', `arm9', `arm9e', `arm920', `arm920t', `arm940t', + `arm9tdmi', `arm10tdmi', `arm1020t', `xscale'. + + `-mtune=NAME' + This option is very similar to the `-mcpu=' option, except that + instead of specifying the actual target processor type, and hence + restricting which instructions can be used, it specifies that GCC + should tune the performance of the code as if the target were of + the type specified in this option, but still choosing the + instructions that it will generate based on the cpu specified by a + `-mcpu=' option. For some ARM implementations better performance + can be obtained by using this option. + + `-march=NAME' + This specifies the name of the target ARM architecture. GCC uses + this name to determine what kind of instructions it can emit when + generating assembly code. This option can be used in conjunction + with or instead of the `-mcpu=' option. Permissible names are: + `armv2', `armv2a', `armv3', `armv3m', `armv4', `armv4t', `armv5', + `armv5t', `armv5te'. + + `-mfpe=NUMBER' + `-mfp=NUMBER' + This specifies the version of the floating point emulation + available on the target. Permissible values are 2 and 3. `-mfp=' + is a synonym for `-mfpe=', for compatibility with older versions + of GCC. + + `-mstructure-size-boundary=N' + The size of all structures and unions will be rounded up to a + multiple of the number of bits set by this option. Permissible + values are 8 and 32. The default value varies for different + toolchains. For the COFF targeted toolchain the default value is + 8. Specifying the larger number can produce faster, more + efficient code, but can also increase the size of the program. + The two values are potentially incompatible. Code compiled with + one value cannot necessarily expect to work with code or libraries + compiled with the other value, if they exchange information using + structures or unions. + + `-mabort-on-noreturn' + Generate a call to the function `abort' at the end of a `noreturn' + function. It will be executed if the function tries to return. + + `-mlong-calls' + `-mno-long-calls' + Tells the compiler to perform function calls by first loading the + address of the function into a register and then performing a + subroutine call on this register. This switch is needed if the + target function will lie outside of the 64 megabyte addressing + range of the offset based version of subroutine call instruction. + + Even if this switch is enabled, not all function calls will be + turned into long calls. The heuristic is that static functions, + functions which have the `short-call' attribute, functions that + are inside the scope of a `#pragma no_long_calls' directive and + functions whose definitions have already been compiled within the + current compilation unit, will not be turned into long calls. The + exception to this rule is that weak function definitions, + functions with the `long-call' attribute or the `section' + attribute, and functions that are within the scope of a `#pragma + long_calls' directive, will always be turned into long calls. + + This feature is not enabled by default. Specifying + `-mno-long-calls' will restore the default behavior, as will + placing the function calls within the scope of a `#pragma + long_calls_off' directive. Note these switches have no effect on + how the compiler generates code to handle function calls via + function pointers. + + `-mnop-fun-dllimport' + Disable support for the `dllimport' attribute. + + `-msingle-pic-base' + Treat the register used for PIC addressing as read-only, rather + than loading it in the prologue for each function. The run-time + system is responsible for initializing this register with an + appropriate value before execution begins. + + `-mpic-register=REG' + Specify the register to be used for PIC addressing. The default + is R10 unless stack-checking is enabled, when R9 is used. + + `-mpoke-function-name' + Write the name of each function into the text section, directly + preceding the function prologue. The generated code is similar to + this: + + t0 + .ascii "arm_poke_function_name", 0 + .align + t1 + .word 0xff000000 + (t1 - t0) + arm_poke_function_name + mov ip, sp + stmfd sp!, {fp, ip, lr, pc} + sub fp, ip, #4 + + When performing a stack backtrace, code can inspect the value of + `pc' stored at `fp + 0'. If the trace function then looks at + location `pc - 12' and the top 8 bits are set, then we know that + there is a function name embedded immediately preceding this + location and has length `((pc[-3]) & 0xff000000)'. + + `-mthumb' + Generate code for the 16-bit Thumb instruction set. The default + is to use the 32-bit ARM instruction set. + + `-mtpcs-frame' + Generate a stack frame that is compliant with the Thumb Procedure + Call Standard for all non-leaf functions. (A leaf function is one + that does not call any other functions.) The default is + `-mno-tpcs-frame'. + + `-mtpcs-leaf-frame' + Generate a stack frame that is compliant with the Thumb Procedure + Call Standard for all leaf functions. (A leaf function is one + that does not call any other functions.) The default is + `-mno-apcs-leaf-frame'. + + `-mcallee-super-interworking' + Gives all externally visible functions in the file being compiled + an ARM instruction set header which switches to Thumb mode before + executing the rest of the function. This allows these functions + to be called from non-interworking code. + + `-mcaller-super-interworking' + Allows calls via function pointers (including virtual functions) to + execute correctly regardless of whether the target code has been + compiled for interworking or not. There is a small overhead in + the cost of executing a function pointer if this option is enabled. + + +  + File: gcc.info, Node: MN10200 Options, Next: MN10300 Options, Prev: ARM Options, Up: Submodel Options + + MN10200 Options + --------------- + + These `-m' options are defined for Matsushita MN10200 architectures: + `-mrelax' + Indicate to the linker that it should perform a relaxation + optimization pass to shorten branches, calls and absolute memory + addresses. This option only has an effect when used on the + command line for the final link step. + + This option makes symbolic debugging impossible. + +  + File: gcc.info, Node: MN10300 Options, Next: M32R/D Options, Prev: MN10200 Options, Up: Submodel Options + + MN10300 Options + --------------- + + These `-m' options are defined for Matsushita MN10300 architectures: + + `-mmult-bug' + Generate code to avoid bugs in the multiply instructions for the + MN10300 processors. This is the default. + + `-mno-mult-bug' + Do not generate code to avoid bugs in the multiply instructions + for the MN10300 processors. + + `-mam33' + Generate code which uses features specific to the AM33 processor. + + `-mno-am33' + Do not generate code which uses features specific to the AM33 + processor. This is the default. + + `-mno-crt0' + Do not link in the C run-time initialization object file. + + `-mrelax' + Indicate to the linker that it should perform a relaxation + optimization pass to shorten branches, calls and absolute memory + addresses. This option only has an effect when used on the + command line for the final link step. + + This option makes symbolic debugging impossible. + +  + File: gcc.info, Node: M32R/D Options, Next: M88K Options, Prev: MN10300 Options, Up: Submodel Options + + M32R/D Options + -------------- + + These `-m' options are defined for Mitsubishi M32R/D architectures: + + `-m32rx' + Generate code for the M32R/X. + + `-m32r' + Generate code for the M32R. This is the default. + + `-mcode-model=small' + Assume all objects live in the lower 16MB of memory (so that their + addresses can be loaded with the `ld24' instruction), and assume + all subroutines are reachable with the `bl' instruction. This is + the default. + + The addressability of a particular object can be set with the + `model' attribute. + + `-mcode-model=medium' + Assume objects may be anywhere in the 32-bit address space (the + compiler will generate `seth/add3' instructions to load their + addresses), and assume all subroutines are reachable with the `bl' + instruction. + + `-mcode-model=large' + Assume objects may be anywhere in the 32-bit address space (the + compiler will generate `seth/add3' instructions to load their + addresses), and assume subroutines may not be reachable with the + `bl' instruction (the compiler will generate the much slower + `seth/add3/jl' instruction sequence). + + `-msdata=none' + Disable use of the small data area. Variables will be put into + one of `.data', `bss', or `.rodata' (unless the `section' + attribute has been specified). This is the default. + + The small data area consists of sections `.sdata' and `.sbss'. + Objects may be explicitly put in the small data area with the + `section' attribute using one of these sections. + + `-msdata=sdata' + Put small global and static data in the small data area, but do not + generate special code to reference them. + + `-msdata=use' + Put small global and static data in the small data area, and + generate special instructions to reference them. + + `-G NUM' + Put global and static objects less than or equal to NUM bytes into + the small data or bss sections instead of the normal data or bss + sections. The default value of NUM is 8. The `-msdata' option + must be set to one of `sdata' or `use' for this option to have any + effect. + + All modules should be compiled with the same `-G NUM' value. + Compiling with different values of NUM may or may not work; if it + doesn't the linker will give an error message--incorrect code will + not be generated. + + +  + File: gcc.info, Node: M88K Options, Next: RS/6000 and PowerPC Options, Prev: M32R/D Options, Up: Submodel Options + + M88K Options + ------------ + + These `-m' options are defined for Motorola 88k architectures: + + `-m88000' + Generate code that works well on both the m88100 and the m88110. + + `-m88100' + Generate code that works best for the m88100, but that also runs + on the m88110. + + `-m88110' + Generate code that works best for the m88110, and may not run on + the m88100. + + `-mbig-pic' + Obsolete option to be removed from the next revision. Use `-fPIC'. + + `-midentify-revision' + Include an `ident' directive in the assembler output recording the + source file name, compiler name and version, timestamp, and + compilation flags used. + + `-mno-underscores' + In assembler output, emit symbol names without adding an underscore + character at the beginning of each name. The default is to use an + underscore as prefix on each name. + + `-mocs-debug-info' + `-mno-ocs-debug-info' + Include (or omit) additional debugging information (about + registers used in each stack frame) as specified in the 88open + Object Compatibility Standard, "OCS". This extra information + allows debugging of code that has had the frame pointer + eliminated. The default for DG/UX, SVr4, and Delta 88 SVr3.2 is + to include this information; other 88k configurations omit this + information by default. + + `-mocs-frame-position' + When emitting COFF debugging information for automatic variables + and parameters stored on the stack, use the offset from the + canonical frame address, which is the stack pointer (register 31) + on entry to the function. The DG/UX, SVr4, Delta88 SVr3.2, and + BCS configurations use `-mocs-frame-position'; other 88k + configurations have the default `-mno-ocs-frame-position'. + + `-mno-ocs-frame-position' + When emitting COFF debugging information for automatic variables + and parameters stored on the stack, use the offset from the frame + pointer register (register 30). When this option is in effect, + the frame pointer is not eliminated when debugging information is + selected by the -g switch. + + `-moptimize-arg-area' + Save space by reorganizing the stack frame. This option generates + code that does not agree with the 88open specifications, but uses + less memory. + + `-mno-optimize-arg-area' + Do not reorganize the stack frame to save space. This is the + default. The generated conforms to the specification, but uses + more memory. + + `-mshort-data-NUM' + Generate smaller data references by making them relative to `r0', + which allows loading a value using a single instruction (rather + than the usual two). You control which data references are + affected by specifying NUM with this option. For example, if you + specify `-mshort-data-512', then the data references affected are + those involving displacements of less than 512 bytes. + `-mshort-data-NUM' is not effective for NUM greater than 64k. + + `-mserialize-volatile' + `-mno-serialize-volatile' + Do, or don't, generate code to guarantee sequential consistency of + volatile memory references. By default, consistency is guaranteed. + + The order of memory references made by the MC88110 processor does + not always match the order of the instructions requesting those + references. In particular, a load instruction may execute before + a preceding store instruction. Such reordering violates + sequential consistency of volatile memory references, when there + are multiple processors. When consistency must be guaranteed, + GCC generates special instructions, as needed, to force execution + in the proper order. + + The MC88100 processor does not reorder memory references and so + always provides sequential consistency. However, by default, GCC + generates the special instructions to guarantee consistency even + when you use `-m88100', so that the code may be run on an MC88110 + processor. If you intend to run your code only on the MC88100 + processor, you may use `-mno-serialize-volatile'. + + The extra code generated to guarantee consistency may affect the + performance of your application. If you know that you can safely + forgo this guarantee, you may use `-mno-serialize-volatile'. + + `-msvr4' + `-msvr3' + Turn on (`-msvr4') or off (`-msvr3') compiler extensions related + to System V release 4 (SVr4). This controls the following: + + 1. Which variant of the assembler syntax to emit. + + 2. `-msvr4' makes the C preprocessor recognize `#pragma weak' + that is used on System V release 4. + + 3. `-msvr4' makes GCC issue additional declaration directives + used in SVr4. + + `-msvr4' is the default for the m88k-motorola-sysv4 and + m88k-dg-dgux m88k configurations. `-msvr3' is the default for all + other m88k configurations. + + `-mversion-03.00' + This option is obsolete, and is ignored. + + `-mno-check-zero-division' + `-mcheck-zero-division' + Do, or don't, generate code to guarantee that integer division by + zero will be detected. By default, detection is guaranteed. + + Some models of the MC88100 processor fail to trap upon integer + division by zero under certain conditions. By default, when + compiling code that might be run on such a processor, GCC + generates code that explicitly checks for zero-valued divisors and + traps with exception number 503 when one is detected. Use of + `-mno-check-zero-division' suppresses such checking for code + generated to run on an MC88100 processor. + + GCC assumes that the MC88110 processor correctly detects all + instances of integer division by zero. When `-m88110' is + specified, no explicit checks for zero-valued divisors are + generated, and both `-mcheck-zero-division' and + `-mno-check-zero-division' are ignored. + + `-muse-div-instruction' + Use the div instruction for signed integer division on the MC88100 + processor. By default, the div instruction is not used. + + On the MC88100 processor the signed integer division instruction + div) traps to the operating system on a negative operand. The + operating system transparently completes the operation, but at a + large cost in execution time. By default, when compiling code + that might be run on an MC88100 processor, GCC emulates signed + integer division using the unsigned integer division instruction + divu), thereby avoiding the large penalty of a trap to the + operating system. Such emulation has its own, smaller, execution + cost in both time and space. To the extent that your code's + important signed integer division operations are performed on two + nonnegative operands, it may be desirable to use the div + instruction directly. + + On the MC88110 processor the div instruction (also known as the + divs instruction) processes negative operands without trapping to + the operating system. When `-m88110' is specified, + `-muse-div-instruction' is ignored, and the div instruction is used + for signed integer division. + + Note that the result of dividing `INT_MIN' by -1 is undefined. In + particular, the behavior of such a division with and without + `-muse-div-instruction' may differ. + + `-mtrap-large-shift' + `-mhandle-large-shift' + Include code to detect bit-shifts of more than 31 bits; + respectively, trap such shifts or emit code to handle them + properly. By default GCC makes no special provision for large bit + shifts. + + `-mwarn-passed-structs' + Warn when a function passes a struct as an argument or result. + Structure-passing conventions have changed during the evolution of + the C language, and are often the source of portability problems. + By default, GCC issues no such warning. + +  + File: gcc.info, Node: RS/6000 and PowerPC Options, Next: RT Options, Prev: M88K Options, Up: Submodel Options + + IBM RS/6000 and PowerPC Options + ------------------------------- + + These `-m' options are defined for the IBM RS/6000 and PowerPC: + `-mpower' + `-mno-power' + `-mpower2' + `-mno-power2' + `-mpowerpc' + `-mno-powerpc' + `-mpowerpc-gpopt' + `-mno-powerpc-gpopt' + `-mpowerpc-gfxopt' + `-mno-powerpc-gfxopt' + `-mpowerpc64' + `-mno-powerpc64' + GCC supports two related instruction set architectures for the + RS/6000 and PowerPC. The "POWER" instruction set are those + instructions supported by the `rios' chip set used in the original + RS/6000 systems and the "PowerPC" instruction set is the + architecture of the Motorola MPC5xx, MPC6xx, MPC8xx + microprocessors, and the IBM 4xx microprocessors. + + Neither architecture is a subset of the other. However there is a + large common subset of instructions supported by both. An MQ + register is included in processors supporting the POWER + architecture. + + You use these options to specify which instructions are available + on the processor you are using. The default value of these + options is determined when configuring GCC. Specifying the + `-mcpu=CPU_TYPE' overrides the specification of these options. We + recommend you use the `-mcpu=CPU_TYPE' option rather than the + options listed above. + + The `-mpower' option allows GCC to generate instructions that are + found only in the POWER architecture and to use the MQ register. + Specifying `-mpower2' implies `-power' and also allows GCC to + generate instructions that are present in the POWER2 architecture + but not the original POWER architecture. + + The `-mpowerpc' option allows GCC to generate instructions that + are found only in the 32-bit subset of the PowerPC architecture. + Specifying `-mpowerpc-gpopt' implies `-mpowerpc' and also allows + GCC to use the optional PowerPC architecture instructions in the + General Purpose group, including floating-point square root. + Specifying `-mpowerpc-gfxopt' implies `-mpowerpc' and also allows + GCC to use the optional PowerPC architecture instructions in the + Graphics group, including floating-point select. + + The `-mpowerpc64' option allows GCC to generate the additional + 64-bit instructions that are found in the full PowerPC64 + architecture and to treat GPRs as 64-bit, doubleword quantities. + GCC defaults to `-mno-powerpc64'. + + If you specify both `-mno-power' and `-mno-powerpc', GCC will use + only the instructions in the common subset of both architectures + plus some special AIX common-mode calls, and will not use the MQ + register. Specifying both `-mpower' and `-mpowerpc' permits GCC + to use any instruction from either architecture and to allow use + of the MQ register; specify this for the Motorola MPC601. + + `-mnew-mnemonics' + `-mold-mnemonics' + Select which mnemonics to use in the generated assembler code. + With `-mnew-mnemonics', GCC uses the assembler mnemonics defined + for the PowerPC architecture. With `-mold-mnemonics' it uses the + assembler mnemonics defined for the POWER architecture. + Instructions defined in only one architecture have only one + mnemonic; GCC uses that mnemonic irrespective of which of these + options is specified. + + GCC defaults to the mnemonics appropriate for the architecture in + use. Specifying `-mcpu=CPU_TYPE' sometimes overrides the value of + these option. Unless you are building a cross-compiler, you + should normally not specify either `-mnew-mnemonics' or + `-mold-mnemonics', but should instead accept the default. + + `-mcpu=CPU_TYPE' + Set architecture type, register usage, choice of mnemonics, and + instruction scheduling parameters for machine type CPU_TYPE. + Supported values for CPU_TYPE are `rios', `rios1', `rsc', `rios2', + `rs64a', `601', `602', `603', `603e', `604', `604e', `620', `630', + `740', `7400', `7450', `750', `power', `power2', `powerpc', `403', + `505', `801', `821', `823', and `860' and `common'. + + `-mcpu=common' selects a completely generic processor. Code + generated under this option will run on any POWER or PowerPC + processor. GCC will use only the instructions in the common + subset of both architectures, and will not use the MQ register. + GCC assumes a generic processor model for scheduling purposes. + + `-mcpu=power', `-mcpu=power2', `-mcpu=powerpc', and + `-mcpu=powerpc64' specify generic POWER, POWER2, pure 32-bit + PowerPC (i.e., not MPC601), and 64-bit PowerPC architecture machine + types, with an appropriate, generic processor model assumed for + scheduling purposes. + + The other options specify a specific processor. Code generated + under those options will run best on that processor, and may not + run at all on others. + + The `-mcpu' options automatically enable or disable other `-m' + options as follows: + + `common' + `-mno-power', `-mno-powerc' + + `power' + `power2' + `rios1' + `rios2' + `rsc' + `-mpower', `-mno-powerpc', `-mno-new-mnemonics' + + `powerpc' + `rs64a' + `602' + `603' + `603e' + `604' + `620' + `630' + `740' + `7400' + `7450' + `750' + `505' + `-mno-power', `-mpowerpc', `-mnew-mnemonics' + + `601' + `-mpower', `-mpowerpc', `-mnew-mnemonics' + + `403' + `821' + `860' + `-mno-power', `-mpowerpc', `-mnew-mnemonics', `-msoft-float' + + `-mtune=CPU_TYPE' + Set the instruction scheduling parameters for machine type + CPU_TYPE, but do not set the architecture type, register usage, or + choice of mnemonics, as `-mcpu=CPU_TYPE' would. The same values + for CPU_TYPE are used for `-mtune' as for `-mcpu'. If both are + specified, the code generated will use the architecture, + registers, and mnemonics set by `-mcpu', but the scheduling + parameters set by `-mtune'. + + `-maltivec' + `-mno-altivec' + These switches enable or disable the use of built-in functions that + allow access to the AltiVec instruction set. You may also need to + set `-mabi=altivec' to adjust the current ABI with AltiVec ABI + enhancements. + + `-mfull-toc' + `-mno-fp-in-toc' + `-mno-sum-in-toc' + `-mminimal-toc' + Modify generation of the TOC (Table Of Contents), which is created + for every executable file. The `-mfull-toc' option is selected by + default. In that case, GCC will allocate at least one TOC entry + for each unique non-automatic variable reference in your program. + GCC will also place floating-point constants in the TOC. However, + only 16,384 entries are available in the TOC. + + If you receive a linker error message that saying you have + overflowed the available TOC space, you can reduce the amount of + TOC space used with the `-mno-fp-in-toc' and `-mno-sum-in-toc' + options. `-mno-fp-in-toc' prevents GCC from putting floating-point + constants in the TOC and `-mno-sum-in-toc' forces GCC to generate + code to calculate the sum of an address and a constant at run-time + instead of putting that sum into the TOC. You may specify one or + both of these options. Each causes GCC to produce very slightly + slower and larger code at the expense of conserving TOC space. + + If you still run out of space in the TOC even when you specify + both of these options, specify `-mminimal-toc' instead. This + option causes GCC to make only one TOC entry for every file. When + you specify this option, GCC will produce code that is slower and + larger but which uses extremely little TOC space. You may wish to + use this option only on files that contain less frequently + executed code. + + `-maix64' + `-maix32' + Enable 64-bit AIX ABI and calling convention: 64-bit pointers, + 64-bit `long' type, and the infrastructure needed to support them. + Specifying `-maix64' implies `-mpowerpc64' and `-mpowerpc', while + `-maix32' disables the 64-bit ABI and implies `-mno-powerpc64'. + GCC defaults to `-maix32'. + + `-mxl-call' + `-mno-xl-call' + On AIX, pass floating-point arguments to prototyped functions + beyond the register save area (RSA) on the stack in addition to + argument FPRs. The AIX calling convention was extended but not + initially documented to handle an obscure K&R C case of calling a + function that takes the address of its arguments with fewer + arguments than declared. AIX XL compilers access floating point + arguments which do not fit in the RSA from the stack when a + subroutine is compiled without optimization. Because always + storing floating-point arguments on the stack is inefficient and + rarely needed, this option is not enabled by default and only is + necessary when calling subroutines compiled by AIX XL compilers + without optimization. + + `-mpe' + Support "IBM RS/6000 SP" "Parallel Environment" (PE). Link an + application written to use message passing with special startup + code to enable the application to run. The system must have PE + installed in the standard location (`/usr/lpp/ppe.poe/'), or the + `specs' file must be overridden with the `-specs=' option to + specify the appropriate directory location. The Parallel + Environment does not support threads, so the `-mpe' option and the + `-pthread' option are incompatible. + + `-msoft-float' + `-mhard-float' + Generate code that does not use (uses) the floating-point register + set. Software floating point emulation is provided if you use the + `-msoft-float' option, and pass the option to GCC when linking. + + `-mmultiple' + `-mno-multiple' + Generate code that uses (does not use) the load multiple word + instructions and the store multiple word instructions. These + instructions are generated by default on POWER systems, and not + generated on PowerPC systems. Do not use `-mmultiple' on little + endian PowerPC systems, since those instructions do not work when + the processor is in little endian mode. The exceptions are PPC740 + and PPC750 which permit the instructions usage in little endian + mode. + + `-mstring' + `-mno-string' + Generate code that uses (does not use) the load string instructions + and the store string word instructions to save multiple registers + and do small block moves. These instructions are generated by + default on POWER systems, and not generated on PowerPC systems. + Do not use `-mstring' on little endian PowerPC systems, since those + instructions do not work when the processor is in little endian + mode. The exceptions are PPC740 and PPC750 which permit the + instructions usage in little endian mode. + + `-mupdate' + `-mno-update' + Generate code that uses (does not use) the load or store + instructions that update the base register to the address of the + calculated memory location. These instructions are generated by + default. If you use `-mno-update', there is a small window + between the time that the stack pointer is updated and the address + of the previous frame is stored, which means code that walks the + stack frame across interrupts or signals may get corrupted data. + + `-mfused-madd' + `-mno-fused-madd' + Generate code that uses (does not use) the floating point multiply + and accumulate instructions. These instructions are generated by + default if hardware floating is used. + + `-mno-bit-align' + `-mbit-align' + On System V.4 and embedded PowerPC systems do not (do) force + structures and unions that contain bit-fields to be aligned to the + base type of the bit-field. + + For example, by default a structure containing nothing but 8 + `unsigned' bit-fields of length 1 would be aligned to a 4 byte + boundary and have a size of 4 bytes. By using `-mno-bit-align', + the structure would be aligned to a 1 byte boundary and be one + byte in size. + + `-mno-strict-align' + `-mstrict-align' + On System V.4 and embedded PowerPC systems do not (do) assume that + unaligned memory references will be handled by the system. + + `-mrelocatable' + `-mno-relocatable' + On embedded PowerPC systems generate code that allows (does not + allow) the program to be relocated to a different address at + runtime. If you use `-mrelocatable' on any module, all objects + linked together must be compiled with `-mrelocatable' or + `-mrelocatable-lib'. + + `-mrelocatable-lib' + `-mno-relocatable-lib' + On embedded PowerPC systems generate code that allows (does not + allow) the program to be relocated to a different address at + runtime. Modules compiled with `-mrelocatable-lib' can be linked + with either modules compiled without `-mrelocatable' and + `-mrelocatable-lib' or with modules compiled with the + `-mrelocatable' options. + + `-mno-toc' + `-mtoc' + On System V.4 and embedded PowerPC systems do not (do) assume that + register 2 contains a pointer to a global area pointing to the + addresses used in the program. + + `-mlittle' + `-mlittle-endian' + On System V.4 and embedded PowerPC systems compile code for the + processor in little endian mode. The `-mlittle-endian' option is + the same as `-mlittle'. + + `-mbig' + `-mbig-endian' + On System V.4 and embedded PowerPC systems compile code for the + processor in big endian mode. The `-mbig-endian' option is the + same as `-mbig'. + + `-mcall-sysv' + On System V.4 and embedded PowerPC systems compile code using + calling conventions that adheres to the March 1995 draft of the + System V Application Binary Interface, PowerPC processor + supplement. This is the default unless you configured GCC using + `powerpc-*-eabiaix'. + + `-mcall-sysv-eabi' + Specify both `-mcall-sysv' and `-meabi' options. + + `-mcall-sysv-noeabi' + Specify both `-mcall-sysv' and `-mno-eabi' options. + + `-mcall-aix' + On System V.4 and embedded PowerPC systems compile code using + calling conventions that are similar to those used on AIX. This + is the default if you configured GCC using `powerpc-*-eabiaix'. + + `-mcall-solaris' + On System V.4 and embedded PowerPC systems compile code for the + Solaris operating system. + + `-mcall-linux' + On System V.4 and embedded PowerPC systems compile code for the + Linux-based GNU system. + + `-mcall-gnu' + On System V.4 and embedded PowerPC systems compile code for the + Hurd-based GNU system. + + `-mcall-netbsd' + On System V.4 and embedded PowerPC systems compile code for the + NetBSD operating system. + + `-maix-struct-return' + Return all structures in memory (as specified by the AIX ABI). + + `-msvr4-struct-return' + Return structures smaller than 8 bytes in registers (as specified + by the SVR4 ABI). + + `-mabi=altivec' + Extend the current ABI with AltiVec ABI extensions. This does not + change the default ABI, instead it adds the AltiVec ABI extensions + to the current ABI. + + `-mabi=no-altivec' + Disable AltiVec ABI extensions for the current ABI. + + `-mprototype' + `-mno-prototype' + On System V.4 and embedded PowerPC systems assume that all calls to + variable argument functions are properly prototyped. Otherwise, + the compiler must insert an instruction before every non + prototyped call to set or clear bit 6 of the condition code + register (CR) to indicate whether floating point values were + passed in the floating point registers in case the function takes + a variable arguments. With `-mprototype', only calls to + prototyped variable argument functions will set or clear the bit. + + `-msim' + On embedded PowerPC systems, assume that the startup module is + called `sim-crt0.o' and that the standard C libraries are + `libsim.a' and `libc.a'. This is the default for + `powerpc-*-eabisim'. configurations. + + `-mmvme' + On embedded PowerPC systems, assume that the startup module is + called `crt0.o' and the standard C libraries are `libmvme.a' and + `libc.a'. + + `-mads' + On embedded PowerPC systems, assume that the startup module is + called `crt0.o' and the standard C libraries are `libads.a' and + `libc.a'. + + `-myellowknife' + On embedded PowerPC systems, assume that the startup module is + called `crt0.o' and the standard C libraries are `libyk.a' and + `libc.a'. + + `-mvxworks' + On System V.4 and embedded PowerPC systems, specify that you are + compiling for a VxWorks system. + + `-memb' + On embedded PowerPC systems, set the PPC_EMB bit in the ELF flags + header to indicate that `eabi' extended relocations are used. + + `-meabi' + `-mno-eabi' + On System V.4 and embedded PowerPC systems do (do not) adhere to + the Embedded Applications Binary Interface (eabi) which is a set of + modifications to the System V.4 specifications. Selecting `-meabi' + means that the stack is aligned to an 8 byte boundary, a function + `__eabi' is called to from `main' to set up the eabi environment, + and the `-msdata' option can use both `r2' and `r13' to point to + two separate small data areas. Selecting `-mno-eabi' means that + the stack is aligned to a 16 byte boundary, do not call an + initialization function from `main', and the `-msdata' option will + only use `r13' to point to a single small data area. The `-meabi' + option is on by default if you configured GCC using one of the + `powerpc*-*-eabi*' options. + + `-msdata=eabi' + On System V.4 and embedded PowerPC systems, put small initialized + `const' global and static data in the `.sdata2' section, which is + pointed to by register `r2'. Put small initialized non-`const' + global and static data in the `.sdata' section, which is pointed + to by register `r13'. Put small uninitialized global and static + data in the `.sbss' section, which is adjacent to the `.sdata' + section. The `-msdata=eabi' option is incompatible with the + `-mrelocatable' option. The `-msdata=eabi' option also sets the + `-memb' option. + + `-msdata=sysv' + On System V.4 and embedded PowerPC systems, put small global and + static data in the `.sdata' section, which is pointed to by + register `r13'. Put small uninitialized global and static data in + the `.sbss' section, which is adjacent to the `.sdata' section. + The `-msdata=sysv' option is incompatible with the `-mrelocatable' + option. + + `-msdata=default' + `-msdata' + On System V.4 and embedded PowerPC systems, if `-meabi' is used, + compile code the same as `-msdata=eabi', otherwise compile code the + same as `-msdata=sysv'. + + `-msdata-data' + On System V.4 and embedded PowerPC systems, put small global and + static data in the `.sdata' section. Put small uninitialized + global and static data in the `.sbss' section. Do not use + register `r13' to address small data however. This is the default + behavior unless other `-msdata' options are used. + + `-msdata=none' + `-mno-sdata' + On embedded PowerPC systems, put all initialized global and static + data in the `.data' section, and all uninitialized data in the + `.bss' section. + + `-G NUM' + On embedded PowerPC systems, put global and static items less than + or equal to NUM bytes into the small data or bss sections instead + of the normal data or bss section. By default, NUM is 8. The `-G + NUM' switch is also passed to the linker. All modules should be + compiled with the same `-G NUM' value. + + `-mregnames' + `-mno-regnames' + On System V.4 and embedded PowerPC systems do (do not) emit + register names in the assembly language output using symbolic + forms. + + `-pthread' + Adds support for multithreading with the "pthreads" library. This + option sets flags for both the preprocessor and linker. + + +  + File: gcc.info, Node: RT Options, Next: MIPS Options, Prev: RS/6000 and PowerPC Options, Up: Submodel Options + + IBM RT Options + -------------- + + These `-m' options are defined for the IBM RT PC: + + `-min-line-mul' + Use an in-line code sequence for integer multiplies. This is the + default. + + `-mcall-lib-mul' + Call `lmul$$' for integer multiples. + + `-mfull-fp-blocks' + Generate full-size floating point data blocks, including the + minimum amount of scratch space recommended by IBM. This is the + default. + + `-mminimum-fp-blocks' + Do not include extra scratch space in floating point data blocks. + This results in smaller code, but slower execution, since scratch + space must be allocated dynamically. + + `-mfp-arg-in-fpregs' + Use a calling sequence incompatible with the IBM calling + convention in which floating point arguments are passed in + floating point registers. Note that `varargs.h' and `stdarg.h' + will not work with floating point operands if this option is + specified. + + `-mfp-arg-in-gregs' + Use the normal calling convention for floating point arguments. + This is the default. + + `-mhc-struct-return' + Return structures of more than one word in memory, rather than in a + register. This provides compatibility with the MetaWare HighC (hc) + compiler. Use the option `-fpcc-struct-return' for compatibility + with the Portable C Compiler (pcc). + + `-mnohc-struct-return' + Return some structures of more than one word in registers, when + convenient. This is the default. For compatibility with the + IBM-supplied compilers, use the option `-fpcc-struct-return' or the + option `-mhc-struct-return'. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-8 gcc-3.2.3/gcc/doc/gcc.info-8 *** gcc-3.2.2/gcc/doc/gcc.info-8 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-8 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1286 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: MIPS Options, Next: i386 and x86-64 Options, Prev: RT Options, Up: Submodel Options + + MIPS Options + ------------ + + These `-m' options are defined for the MIPS family of computers: + + `-march=CPU-TYPE' + Assume the defaults for the machine type CPU-TYPE when generating + instructions. The choices for CPU-TYPE are `r2000', `r3000', + `r3900', `r4000', `r4100', `r4300', `r4400', `r4600', `r4650', + `r5000', `r6000', `r8000', and `orion'. Additionally, the + `r2000', `r3000', `r4000', `r5000', and `r6000' can be abbreviated + as `r2k' (or `r2K'), `r3k', etc. + + `-mtune=CPU-TYPE' + Assume the defaults for the machine type CPU-TYPE when scheduling + instructions. The choices for CPU-TYPE are `r2000', `r3000', + `r3900', `r4000', `r4100', `r4300', `r4400', `r4600', `r4650', + `r5000', `r6000', `r8000', and `orion'. Additionally, the + `r2000', `r3000', `r4000', `r5000', and `r6000' can be abbreviated + as `r2k' (or `r2K'), `r3k', etc. While picking a specific + CPU-TYPE will schedule things appropriately for that particular + chip, the compiler will not generate any code that does not meet + level 1 of the MIPS ISA (instruction set architecture) without a + `-mipsX' or `-mabi' switch being used. + + `-mcpu=CPU-TYPE' + This is identical to specifying both `-march' and `-mtune'. + + `-mips1' + Issue instructions from level 1 of the MIPS ISA. This is the + default. `r3000' is the default CPU-TYPE at this ISA level. + + `-mips2' + Issue instructions from level 2 of the MIPS ISA (branch likely, + square root instructions). `r6000' is the default CPU-TYPE at this + ISA level. + + `-mips3' + Issue instructions from level 3 of the MIPS ISA (64-bit + instructions). `r4000' is the default CPU-TYPE at this ISA level. + + `-mips4' + Issue instructions from level 4 of the MIPS ISA (conditional move, + prefetch, enhanced FPU instructions). `r8000' is the default + CPU-TYPE at this ISA level. + + `-mfp32' + Assume that 32 32-bit floating point registers are available. + This is the default. + + `-mfp64' + Assume that 32 64-bit floating point registers are available. + This is the default when the `-mips3' option is used. + + `-mfused-madd' + `-mno-fused-madd' + Generate code that uses (does not use) the floating point multiply + and accumulate instructions, when they are available. These + instructions are generated by default if they are available, but + this may be undesirable if the extra precision causes problems or + on certain chips in the mode where denormals are rounded to zero + where denormals generated by multiply and accumulate instructions + cause exceptions anyway. + + `-mgp32' + Assume that 32 32-bit general purpose registers are available. + This is the default. + + `-mgp64' + Assume that 32 64-bit general purpose registers are available. + This is the default when the `-mips3' option is used. + + `-mint64' + Force int and long types to be 64 bits wide. See `-mlong32' for an + explanation of the default, and the width of pointers. + + `-mlong64' + Force long types to be 64 bits wide. See `-mlong32' for an + explanation of the default, and the width of pointers. + + `-mlong32' + Force long, int, and pointer types to be 32 bits wide. + + If none of `-mlong32', `-mlong64', or `-mint64' are set, the size + of ints, longs, and pointers depends on the ABI and ISA chosen. + For `-mabi=32', and `-mabi=n32', ints and longs are 32 bits wide. + For `-mabi=64', ints are 32 bits, and longs are 64 bits wide. For + `-mabi=eabi' and either `-mips1' or `-mips2', ints and longs are + 32 bits wide. For `-mabi=eabi' and higher ISAs, ints are 32 bits, + and longs are 64 bits wide. The width of pointer types is the + smaller of the width of longs or the width of general purpose + registers (which in turn depends on the ISA). + + `-mabi=32' + `-mabi=o64' + `-mabi=n32' + `-mabi=64' + `-mabi=eabi' + Generate code for the indicated ABI. The default instruction + level is `-mips1' for `32', `-mips3' for `n32', and `-mips4' + otherwise. Conversely, with `-mips1' or `-mips2', the default ABI + is `32'; otherwise, the default ABI is `64'. + + `-mmips-as' + Generate code for the MIPS assembler, and invoke `mips-tfile' to + add normal debug information. This is the default for all + platforms except for the OSF/1 reference platform, using the + OSF/rose object format. If the either of the `-gstabs' or + `-gstabs+' switches are used, the `mips-tfile' program will + encapsulate the stabs within MIPS ECOFF. + + `-mgas' + Generate code for the GNU assembler. This is the default on the + OSF/1 reference platform, using the OSF/rose object format. Also, + this is the default if the configure option `--with-gnu-as' is + used. + + `-msplit-addresses' + `-mno-split-addresses' + Generate code to load the high and low parts of address constants + separately. This allows GCC to optimize away redundant loads of + the high order bits of addresses. This optimization requires GNU + as and GNU ld. This optimization is enabled by default for some + embedded targets where GNU as and GNU ld are standard. + + `-mrnames' + `-mno-rnames' + The `-mrnames' switch says to output code using the MIPS software + names for the registers, instead of the hardware names (ie, A0 + instead of $4). The only known assembler that supports this option + is the Algorithmics assembler. + + `-mgpopt' + `-mno-gpopt' + The `-mgpopt' switch says to write all of the data declarations + before the instructions in the text section, this allows the MIPS + assembler to generate one word memory references instead of using + two words for short global or static data items. This is on by + default if optimization is selected. + + `-mstats' + `-mno-stats' + For each non-inline function processed, the `-mstats' switch + causes the compiler to emit one line to the standard error file to + print statistics about the program (number of registers saved, + stack size, etc.). + + `-mmemcpy' + `-mno-memcpy' + The `-mmemcpy' switch makes all block moves call the appropriate + string function (`memcpy' or `bcopy') instead of possibly + generating inline code. + + `-mmips-tfile' + `-mno-mips-tfile' + The `-mno-mips-tfile' switch causes the compiler not postprocess + the object file with the `mips-tfile' program, after the MIPS + assembler has generated it to add debug support. If `mips-tfile' + is not run, then no local variables will be available to the + debugger. In addition, `stage2' and `stage3' objects will have + the temporary file names passed to the assembler embedded in the + object file, which means the objects will not compare the same. + The `-mno-mips-tfile' switch should only be used when there are + bugs in the `mips-tfile' program that prevents compilation. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not part of GCC. Normally + the facilities of the machine's usual C compiler are used, but + this can't be done directly in cross-compilation. You must make + your own arrangements to provide suitable library functions for + cross-compilation. + + `-mhard-float' + Generate output containing floating point instructions. This is + the default if you use the unmodified sources. + + `-mabicalls' + `-mno-abicalls' + Emit (or do not emit) the pseudo operations `.abicalls', + `.cpload', and `.cprestore' that some System V.4 ports use for + position independent code. + + `-mlong-calls' + `-mno-long-calls' + Do all calls with the `JALR' instruction, which requires loading + up a function's address into a register before the call. You need + to use this switch, if you call outside of the current 512 + megabyte segment to functions that are not through pointers. + + `-mhalf-pic' + `-mno-half-pic' + Put pointers to extern references into the data section and load + them up, rather than put the references in the text section. + + `-membedded-pic' + `-mno-embedded-pic' + Generate PIC code suitable for some embedded systems. All calls + are made using PC relative address, and all data is addressed + using the $gp register. No more than 65536 bytes of global data + may be used. This requires GNU as and GNU ld which do most of the + work. This currently only works on targets which use ECOFF; it + does not work with ELF. + + `-membedded-data' + `-mno-embedded-data' + Allocate variables to the read-only data section first if + possible, then next in the small data section if possible, + otherwise in data. This gives slightly slower code than the + default, but reduces the amount of RAM required when executing, + and thus may be preferred for some embedded systems. + + `-muninit-const-in-rodata' + `-mno-uninit-const-in-rodata' + When used together with `-membedded-data', it will always store + uninitialized const variables in the read-only data section. + + `-msingle-float' + `-mdouble-float' + The `-msingle-float' switch tells gcc to assume that the floating + point coprocessor only supports single precision operations, as on + the `r4650' chip. The `-mdouble-float' switch permits gcc to use + double precision operations. This is the default. + + `-mmad' + `-mno-mad' + Permit use of the `mad', `madu' and `mul' instructions, as on the + `r4650' chip. + + `-m4650' + Turns on `-msingle-float', `-mmad', and, at least for now, + `-mcpu=r4650'. + + `-mips16' + `-mno-mips16' + Enable 16-bit instructions. + + `-mentry' + Use the entry and exit pseudo ops. This option can only be used + with `-mips16'. + + `-EL' + Compile code for the processor in little endian mode. The + requisite libraries are assumed to exist. + + `-EB' + Compile code for the processor in big endian mode. The requisite + libraries are assumed to exist. + + `-G NUM' + Put global and static items less than or equal to NUM bytes into + the small data or bss sections instead of the normal data or bss + section. This allows the assembler to emit one word memory + reference instructions based on the global pointer (GP or $28), + instead of the normal two words used. By default, NUM is 8 when + the MIPS assembler is used, and 0 when the GNU assembler is used. + The `-G NUM' switch is also passed to the assembler and linker. + All modules should be compiled with the same `-G NUM' value. + + `-nocpp' + Tell the MIPS assembler to not run its preprocessor over user + assembler files (with a `.s' suffix) when assembling them. + + `-mfix7000' + Pass an option to gas which will cause nops to be inserted if the + read of the destination register of an mfhi or mflo instruction + occurs in the following two instructions. + + `-no-crt0' + Do not include the default crt0. + + `-mflush-func=FUNC' + `-mno-flush-func' + Specifies the function to call to flush the I and D caches, or to + not call any such function. If called, the function must take the + same arguments as the common `_flush_func()', that is, the address + of the memory range for which the cache is being flushed, the size + of the memory range, and the number 3 (to flush both caches). The + default depends on the target gcc was configured for, but commonly + is either `_flush_func' or `__cpu_flush'. + + These options are defined by the macro `TARGET_SWITCHES' in the + machine description. The default for the options is also defined by + that macro, which enables you to change the defaults. + +  + File: gcc.info, Node: i386 and x86-64 Options, Next: HPPA Options, Prev: MIPS Options, Up: Submodel Options + + Intel 386 and AMD x86-64 Options + -------------------------------- + + These `-m' options are defined for the i386 and x86-64 family of + computers: + + `-mcpu=CPU-TYPE' + Tune to CPU-TYPE everything applicable about the generated code, + except for the ABI and the set of available instructions. The + choices for CPU-TYPE are `i386', `i486', `i586', `i686', + `pentium', `pentium-mmx', `pentiumpro', `pentium2', `pentium3', + `pentium4', `k6', `k6-2', `k6-3', `athlon', `athlon-tbird', + `athlon-4', `athlon-xp' and `athlon-mp'. + + While picking a specific CPU-TYPE will schedule things + appropriately for that particular chip, the compiler will not + generate any code that does not run on the i386 without the + `-march=CPU-TYPE' option being used. `i586' is equivalent to + `pentium' and `i686' is equivalent to `pentiumpro'. `k6' and + `athlon' are the AMD chips as opposed to the Intel ones. + + `-march=CPU-TYPE' + Generate instructions for the machine type CPU-TYPE. The choices + for CPU-TYPE are the same as for `-mcpu'. Moreover, specifying + `-march=CPU-TYPE' implies `-mcpu=CPU-TYPE'. + + `-m386' + `-m486' + `-mpentium' + `-mpentiumpro' + These options are synonyms for `-mcpu=i386', `-mcpu=i486', + `-mcpu=pentium', and `-mcpu=pentiumpro' respectively. These + synonyms are deprecated. + + `-mfpmath=UNIT' + generate floating point arithmetics for selected unit UNIT. the + choices for UNIT are: + + `387' + Use the standard 387 floating point coprocessor present + majority of chips and emulated otherwise. Code compiled with + this option will run almost everywhere. The temporary + results are computed in 80bit precesion instead of precision + specified by the type resulting in slightly different results + compared to most of other chips. See `-ffloat-store' for more + detailed description. + + This is the default choice for i386 compiler. + + `sse' + Use scalar floating point instructions present in the SSE + instruction set. This instruction set is supported by + Pentium3 and newer chips, in the AMD line by Athlon-4, + Athlon-xp and Athlon-mp chips. The earlier version of SSE + instruction set supports only single precision arithmetics, + thus the double and extended precision arithmetics is still + done using 387. Later version, present only in Pentium4 and + the future AMD x86-64 chips supports double precision + arithmetics too. + + For i387 you need to use `-march=CPU-TYPE', `-msse' or + `-msse2' switches to enable SSE extensions and make this + option effective. For x86-64 compiler, these extensions are + enabled by default. + + The resulting code should be considerably faster in majority + of cases and avoid the numerical instability problems of 387 + code, but may break some existing code that expects + temporaries to be 80bit. + + This is the default choice for x86-64 compiler. + + `sse,387' + Attempt to utilize both instruction sets at once. This + effectivly double the amount of available registers and on + chips with separate execution units for 387 and SSE the + execution resources too. Use this option with care, as it is + still experimental, because gcc register allocator does not + model separate functional units well resulting in instable + performance. + + `-masm=DIALECT' + Output asm instructions using selected DIALECT. Supported choices + are `intel' or `att' (the default one). + + `-mieee-fp' + `-mno-ieee-fp' + Control whether or not the compiler uses IEEE floating point + comparisons. These handle correctly the case where the result of a + comparison is unordered. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not part of GCC. Normally + the facilities of the machine's usual C compiler are used, but + this can't be done directly in cross-compilation. You must make + your own arrangements to provide suitable library functions for + cross-compilation. + + On machines where a function returns floating point results in the + 80387 register stack, some floating point opcodes may be emitted + even if `-msoft-float' is used. + + `-mno-fp-ret-in-387' + Do not use the FPU registers for return values of functions. + + The usual calling convention has functions return values of types + `float' and `double' in an FPU register, even if there is no FPU. + The idea is that the operating system should emulate an FPU. + + The option `-mno-fp-ret-in-387' causes such values to be returned + in ordinary CPU registers instead. + + `-mno-fancy-math-387' + Some 387 emulators do not support the `sin', `cos' and `sqrt' + instructions for the 387. Specify this option to avoid generating + those instructions. This option is the default on FreeBSD, + OpenBSD and NetBSD. This option is overridden when `-march' + indicates that the target cpu will always have an FPU and so the + instruction will not need emulation. As of revision 2.6.1, these + instructions are not generated unless you also use the + `-funsafe-math-optimizations' switch. + + `-malign-double' + `-mno-align-double' + Control whether GCC aligns `double', `long double', and `long + long' variables on a two word boundary or a one word boundary. + Aligning `double' variables on a two word boundary will produce + code that runs somewhat faster on a `Pentium' at the expense of + more memory. + + *Warning:* if you use the `-malign-double' switch, structures + containing the above types will be aligned differently than the + published application binary interface specifications for the 386 + and will not be binary compatible with structures in code compiled + without that switch. + + `-m128bit-long-double' + Control the size of `long double' type. i386 application binary + interface specify the size to be 12 bytes, while modern + architectures (Pentium and newer) prefer `long double' aligned to + 8 or 16 byte boundary. This is impossible to reach with 12 byte + long doubles in the array accesses. + + *Warning:* if you use the `-m128bit-long-double' switch, the + structures and arrays containing `long double' will change their + size as well as function calling convention for function taking + `long double' will be modified. + + `-m96bit-long-double' + Set the size of `long double' to 96 bits as required by the i386 + application binary interface. This is the default. + + `-msvr3-shlib' + `-mno-svr3-shlib' + Control whether GCC places uninitialized local variables into the + `bss' or `data' segments. `-msvr3-shlib' places them into `bss'. + These options are meaningful only on System V Release 3. + + `-mrtd' + Use a different function-calling convention, in which functions + that take a fixed number of arguments return with the `ret' NUM + instruction, which pops their arguments while returning. This + saves one instruction in the caller since there is no need to pop + the arguments there. + + You can specify that an individual function is called with this + calling sequence with the function attribute `stdcall'. You can + also override the `-mrtd' option by using the function attribute + `cdecl'. *Note Function Attributes::. + + *Warning:* this calling convention is incompatible with the one + normally used on Unix, so you cannot use it if you need to call + libraries compiled with the Unix compiler. + + Also, you must provide function prototypes for all functions that + take variable numbers of arguments (including `printf'); otherwise + incorrect code will be generated for calls to those functions. + + In addition, seriously incorrect code will result if you call a + function with too many arguments. (Normally, extra arguments are + harmlessly ignored.) + + `-mregparm=NUM' + Control how many registers are used to pass integer arguments. By + default, no registers are used to pass arguments, and at most 3 + registers can be used. You can control this behavior for a + specific function by using the function attribute `regparm'. + *Note Function Attributes::. + + *Warning:* if you use this switch, and NUM is nonzero, then you + must build all modules with the same value, including any + libraries. This includes the system libraries and startup modules. + + `-mpreferred-stack-boundary=NUM' + Attempt to keep the stack boundary aligned to a 2 raised to NUM + byte boundary. If `-mpreferred-stack-boundary' is not specified, + the default is 4 (16 bytes or 128 bits), except when optimizing + for code size (`-Os'), in which case the default is the minimum + correct alignment (4 bytes for x86, and 8 bytes for x86-64). + + On Pentium and PentiumPro, `double' and `long double' values + should be aligned to an 8 byte boundary (see `-malign-double') or + suffer significant run time performance penalties. On Pentium + III, the Streaming SIMD Extension (SSE) data type `__m128' suffers + similar penalties if it is not 16 byte aligned. + + To ensure proper alignment of this values on the stack, the stack + boundary must be as aligned as that required by any value stored + on the stack. Further, every function must be generated such that + it keeps the stack aligned. Thus calling a function compiled with + a higher preferred stack boundary from a function compiled with a + lower preferred stack boundary will most likely misalign the + stack. It is recommended that libraries that use callbacks always + use the default setting. + + This extra alignment does consume extra stack space, and generally + increases code size. Code that is sensitive to stack space usage, + such as embedded systems and operating system kernels, may want to + reduce the preferred alignment to `-mpreferred-stack-boundary=2'. + + `-mmmx' + `-mno-mmx' + + `-msse' + `-mno-sse' + + `-msse2' + `-mno-sse2' + + `-m3dnow' + `-mno-3dnow' + These switches enable or disable the use of built-in functions + that allow direct access to the MMX, SSE and 3Dnow extensions of + the instruction set. + + *Note X86 Built-in Functions::, for details of the functions + enabled and disabled by these switches. + + To have SSE/SSE2 instructions generated automatically from + floating-point code, see `-mfpmath=sse'. + + `-mpush-args' + `-mno-push-args' + Use PUSH operations to store outgoing parameters. This method is + shorter and usually equally fast as method using SUB/MOV + operations and is enabled by default. In some cases disabling it + may improve performance because of improved scheduling and reduced + dependencies. + + `-maccumulate-outgoing-args' + If enabled, the maximum amount of space required for outgoing + arguments will be computed in the function prologue. This is + faster on most modern CPUs because of reduced dependencies, + improved scheduling and reduced stack usage when preferred stack + boundary is not equal to 2. The drawback is a notable increase in + code size. This switch implies `-mno-push-args'. + + `-mthreads' + Support thread-safe exception handling on `Mingw32'. Code that + relies on thread-safe exception handling must compile and link all + code with the `-mthreads' option. When compiling, `-mthreads' + defines `-D_MT'; when linking, it links in a special thread helper + library `-lmingwthrd' which cleans up per thread exception + handling data. + + `-mno-align-stringops' + Do not align destination of inlined string operations. This + switch reduces code size and improves performance in case the + destination is already aligned, but gcc don't know about it. + + `-minline-all-stringops' + By default GCC inlines string operations only when destination is + known to be aligned at least to 4 byte boundary. This enables + more inlining, increase code size, but may improve performance of + code that depends on fast memcpy, strlen and memset for short + lengths. + + `-momit-leaf-frame-pointer' + Don't keep the frame pointer in a register for leaf functions. + This avoids the instructions to save, set up and restore frame + pointers and makes an extra register available in leaf functions. + The option `-fomit-frame-pointer' removes the frame pointer for + all functions which might make debugging harder. + + These `-m' switches are supported in addition to the above on AMD + x86-64 processors in 64-bit environments. + + `-m32' + `-m64' + Generate code for a 32-bit or 64-bit environment. The 32-bit + environment sets int, long and pointer to 32 bits and generates + code that runs on any i386 system. The 64-bit environment sets + int to 32 bits and long and pointer to 64 bits and generates code + for AMD's x86-64 architecture. + + `-mno-red-zone' + Do not use a so called red zone for x86-64 code. The red zone is + mandated by the x86-64 ABI, it is a 128-byte area beyond the + location of the stack pointer that will not be modified by signal + or interrupt handlers and therefore can be used for temporary data + without adjusting the stack pointer. The flag `-mno-red-zone' + disables this red zone. + + `-mcmodel=small' + Generate code for the small code model: the program and its + symbols must be linked in the lower 2 GB of the address space. + Pointers are 64 bits. Programs can be statically or dynamically + linked. This is the default code model. + + `-mcmodel=kernel' + Generate code for the kernel code model. The kernel runs in the + negative 2 GB of the address space. This model has to be used for + Linux kernel code. + + `-mcmodel=medium' + Generate code for the medium model: The program is linked in the + lower 2 GB of the address space but symbols can be located + anywhere in the address space. Programs can be statically or + dynamically linked, but building of shared libraries are not + supported with the medium model. + + `-mcmodel=large' + Generate code for the large model: This model makes no assumptions + about addresses and sizes of sections. Currently GCC does not + implement this model. + +  + File: gcc.info, Node: HPPA Options, Next: Intel 960 Options, Prev: i386 and x86-64 Options, Up: Submodel Options + + HPPA Options + ------------ + + These `-m' options are defined for the HPPA family of computers: + + `-march=ARCHITECTURE-TYPE' + Generate code for the specified architecture. The choices for + ARCHITECTURE-TYPE are `1.0' for PA 1.0, `1.1' for PA 1.1, and + `2.0' for PA 2.0 processors. Refer to `/usr/lib/sched.models' on + an HP-UX system to determine the proper architecture option for + your machine. Code compiled for lower numbered architectures will + run on higher numbered architectures, but not the other way around. + + PA 2.0 support currently requires gas snapshot 19990413 or later. + The next release of binutils (current is 2.9.1) will probably + contain PA 2.0 support. + + `-mpa-risc-1-0' + `-mpa-risc-1-1' + `-mpa-risc-2-0' + Synonyms for `-march=1.0', `-march=1.1', and `-march=2.0' + respectively. + + `-mbig-switch' + Generate code suitable for big switch tables. Use this option + only if the assembler/linker complain about out of range branches + within a switch table. + + `-mjump-in-delay' + Fill delay slots of function calls with unconditional jump + instructions by modifying the return pointer for the function call + to be the target of the conditional jump. + + `-mdisable-fpregs' + Prevent floating point registers from being used in any manner. + This is necessary for compiling kernels which perform lazy context + switching of floating point registers. If you use this option and + attempt to perform floating point operations, the compiler will + abort. + + `-mdisable-indexing' + Prevent the compiler from using indexing address modes. This + avoids some rather obscure problems when compiling MIG generated + code under MACH. + + `-mno-space-regs' + Generate code that assumes the target has no space registers. + This allows GCC to generate faster indirect calls and use unscaled + index address modes. + + Such code is suitable for level 0 PA systems and kernels. + + `-mfast-indirect-calls' + Generate code that assumes calls never cross space boundaries. + This allows GCC to emit code which performs faster indirect calls. + + This option will not work in the presence of shared libraries or + nested functions. + + `-mlong-load-store' + Generate 3-instruction load and store sequences as sometimes + required by the HP-UX 10 linker. This is equivalent to the `+k' + option to the HP compilers. + + `-mportable-runtime' + Use the portable calling conventions proposed by HP for ELF + systems. + + `-mgas' + Enable the use of assembler directives only GAS understands. + + `-mschedule=CPU-TYPE' + Schedule code according to the constraints for the machine type + CPU-TYPE. The choices for CPU-TYPE are `700' `7100', `7100LC', + `7200', and `8000'. Refer to `/usr/lib/sched.models' on an HP-UX + system to determine the proper scheduling option for your machine. + + `-mlinker-opt' + Enable the optimization pass in the HPUX linker. Note this makes + symbolic debugging impossible. It also triggers a bug in the HPUX + 8 and HPUX 9 linkers in which they give bogus error messages when + linking some programs. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries are not available for all HPPA + targets. Normally the facilities of the machine's usual C + compiler are used, but this cannot be done directly in + cross-compilation. You must make your own arrangements to provide + suitable library functions for cross-compilation. The embedded + target `hppa1.1-*-pro' does provide software floating point + support. + + `-msoft-float' changes the calling convention in the output file; + therefore, it is only useful if you compile _all_ of a program with + this option. In particular, you need to compile `libgcc.a', the + library that comes with GCC, with `-msoft-float' in order for this + to work. + +  + File: gcc.info, Node: Intel 960 Options, Next: DEC Alpha Options, Prev: HPPA Options, Up: Submodel Options + + Intel 960 Options + ----------------- + + These `-m' options are defined for the Intel 960 implementations: + + `-mCPU-TYPE' + Assume the defaults for the machine type CPU-TYPE for some of the + other options, including instruction scheduling, floating point + support, and addressing modes. The choices for CPU-TYPE are `ka', + `kb', `mc', `ca', `cf', `sa', and `sb'. The default is `kb'. + + `-mnumerics' + `-msoft-float' + The `-mnumerics' option indicates that the processor does support + floating-point instructions. The `-msoft-float' option indicates + that floating-point support should not be assumed. + + `-mleaf-procedures' + `-mno-leaf-procedures' + Do (or do not) attempt to alter leaf procedures to be callable + with the `bal' instruction as well as `call'. This will result in + more efficient code for explicit calls when the `bal' instruction + can be substituted by the assembler or linker, but less efficient + code in other cases, such as calls via function pointers, or using + a linker that doesn't support this optimization. + + `-mtail-call' + `-mno-tail-call' + Do (or do not) make additional attempts (beyond those of the + machine-independent portions of the compiler) to optimize + tail-recursive calls into branches. You may not want to do this + because the detection of cases where this is not valid is not + totally complete. The default is `-mno-tail-call'. + + `-mcomplex-addr' + `-mno-complex-addr' + Assume (or do not assume) that the use of a complex addressing + mode is a win on this implementation of the i960. Complex + addressing modes may not be worthwhile on the K-series, but they + definitely are on the C-series. The default is currently + `-mcomplex-addr' for all processors except the CB and CC. + + `-mcode-align' + `-mno-code-align' + Align code to 8-byte boundaries for faster fetching (or don't + bother). Currently turned on by default for C-series + implementations only. + + `-mic-compat' + `-mic2.0-compat' + `-mic3.0-compat' + Enable compatibility with iC960 v2.0 or v3.0. + + `-masm-compat' + `-mintel-asm' + Enable compatibility with the iC960 assembler. + + `-mstrict-align' + `-mno-strict-align' + Do not permit (do permit) unaligned accesses. + + `-mold-align' + Enable structure-alignment compatibility with Intel's gcc release + version 1.3 (based on gcc 1.37). This option implies + `-mstrict-align'. + + `-mlong-double-64' + Implement type `long double' as 64-bit floating point numbers. + Without the option `long double' is implemented by 80-bit floating + point numbers. The only reason we have it because there is no + 128-bit `long double' support in `fp-bit.c' yet. So it is only + useful for people using soft-float targets. Otherwise, we should + recommend against use of it. + + +  + File: gcc.info, Node: DEC Alpha Options, Next: DEC Alpha/VMS Options, Prev: Intel 960 Options, Up: Submodel Options + + DEC Alpha Options + ----------------- + + These `-m' options are defined for the DEC Alpha implementations: + + `-mno-soft-float' + `-msoft-float' + Use (do not use) the hardware floating-point instructions for + floating-point operations. When `-msoft-float' is specified, + functions in `libgcc.a' will be used to perform floating-point + operations. Unless they are replaced by routines that emulate the + floating-point operations, or compiled in such a way as to call + such emulations routines, these routines will issue floating-point + operations. If you are compiling for an Alpha without + floating-point operations, you must ensure that the library is + built so as not to call them. + + Note that Alpha implementations without floating-point operations + are required to have floating-point registers. + + `-mfp-reg' + `-mno-fp-regs' + Generate code that uses (does not use) the floating-point register + set. `-mno-fp-regs' implies `-msoft-float'. If the floating-point + register set is not used, floating point operands are passed in + integer registers as if they were integers and floating-point + results are passed in `$0' instead of `$f0'. This is a + non-standard calling sequence, so any function with a + floating-point argument or return value called by code compiled + with `-mno-fp-regs' must also be compiled with that option. + + A typical use of this option is building a kernel that does not + use, and hence need not save and restore, any floating-point + registers. + + `-mieee' + The Alpha architecture implements floating-point hardware + optimized for maximum performance. It is mostly compliant with + the IEEE floating point standard. However, for full compliance, + software assistance is required. This option generates code fully + IEEE compliant code _except_ that the INEXACT-FLAG is not + maintained (see below). If this option is turned on, the + preprocessor macro `_IEEE_FP' is defined during compilation. The + resulting code is less efficient but is able to correctly support + denormalized numbers and exceptional IEEE values such as + not-a-number and plus/minus infinity. Other Alpha compilers call + this option `-ieee_with_no_inexact'. + + `-mieee-with-inexact' + This is like `-mieee' except the generated code also maintains the + IEEE INEXACT-FLAG. Turning on this option causes the generated + code to implement fully-compliant IEEE math. In addition to + `_IEEE_FP', `_IEEE_FP_EXACT' is defined as a preprocessor macro. + On some Alpha implementations the resulting code may execute + significantly slower than the code generated by default. Since + there is very little code that depends on the INEXACT-FLAG, you + should normally not specify this option. Other Alpha compilers + call this option `-ieee_with_inexact'. + + `-mfp-trap-mode=TRAP-MODE' + This option controls what floating-point related traps are enabled. + Other Alpha compilers call this option `-fptm TRAP-MODE'. The + trap mode can be set to one of four values: + + `n' + This is the default (normal) setting. The only traps that + are enabled are the ones that cannot be disabled in software + (e.g., division by zero trap). + + `u' + In addition to the traps enabled by `n', underflow traps are + enabled as well. + + `su' + Like `su', but the instructions are marked to be safe for + software completion (see Alpha architecture manual for + details). + + `sui' + Like `su', but inexact traps are enabled as well. + + `-mfp-rounding-mode=ROUNDING-MODE' + Selects the IEEE rounding mode. Other Alpha compilers call this + option `-fprm ROUNDING-MODE'. The ROUNDING-MODE can be one of: + + `n' + Normal IEEE rounding mode. Floating point numbers are + rounded towards the nearest machine number or towards the + even machine number in case of a tie. + + `m' + Round towards minus infinity. + + `c' + Chopped rounding mode. Floating point numbers are rounded + towards zero. + + `d' + Dynamic rounding mode. A field in the floating point control + register (FPCR, see Alpha architecture reference manual) + controls the rounding mode in effect. The C library + initializes this register for rounding towards plus infinity. + Thus, unless your program modifies the FPCR, `d' corresponds + to round towards plus infinity. + + `-mtrap-precision=TRAP-PRECISION' + In the Alpha architecture, floating point traps are imprecise. + This means without software assistance it is impossible to recover + from a floating trap and program execution normally needs to be + terminated. GCC can generate code that can assist operating + system trap handlers in determining the exact location that caused + a floating point trap. Depending on the requirements of an + application, different levels of precisions can be selected: + + `p' + Program precision. This option is the default and means a + trap handler can only identify which program caused a + floating point exception. + + `f' + Function precision. The trap handler can determine the + function that caused a floating point exception. + + `i' + Instruction precision. The trap handler can determine the + exact instruction that caused a floating point exception. + + Other Alpha compilers provide the equivalent options called + `-scope_safe' and `-resumption_safe'. + + `-mieee-conformant' + This option marks the generated code as IEEE conformant. You must + not use this option unless you also specify `-mtrap-precision=i' + and either `-mfp-trap-mode=su' or `-mfp-trap-mode=sui'. Its only + effect is to emit the line `.eflag 48' in the function prologue of + the generated assembly file. Under DEC Unix, this has the effect + that IEEE-conformant math library routines will be linked in. + + `-mbuild-constants' + Normally GCC examines a 32- or 64-bit integer constant to see if + it can construct it from smaller constants in two or three + instructions. If it cannot, it will output the constant as a + literal and generate code to load it from the data segment at + runtime. + + Use this option to require GCC to construct _all_ integer constants + using code, even if it takes more instructions (the maximum is + six). + + You would typically use this option to build a shared library + dynamic loader. Itself a shared library, it must relocate itself + in memory before it can find the variables and constants in its + own data segment. + + `-malpha-as' + `-mgas' + Select whether to generate code to be assembled by the + vendor-supplied assembler (`-malpha-as') or by the GNU assembler + `-mgas'. + + `-mbwx' + `-mno-bwx' + `-mcix' + `-mno-cix' + `-mfix' + `-mno-fix' + `-mmax' + `-mno-max' + Indicate whether GCC should generate code to use the optional BWX, + CIX, FIX and MAX instruction sets. The default is to use the + instruction sets supported by the CPU type specified via `-mcpu=' + option or that of the CPU on which GCC was built if none was + specified. + + `-mfloat-vax' + `-mfloat-ieee' + Generate code that uses (does not use) VAX F and G floating point + arithmetic instead of IEEE single and double precision. + + `-mexplicit-relocs' + `-mno-explicit-relocs' + Older Alpha assemblers provided no way to generate symbol + relocations except via assembler macros. Use of these macros does + not allow optimial instruction scheduling. GNU binutils as of + version 2.12 supports a new syntax that allows the compiler to + explicitly mark which relocations should apply to which + instructions. This option is mostly useful for debugging, as GCC + detects the capabilities of the assembler when it is built and + sets the default accordingly. + + `-msmall-data' + `-mlarge-data' + When `-mexplicit-relocs' is in effect, static data is accessed via + "gp-relative" relocations. When `-msmall-data' is used, objects 8 + bytes long or smaller are placed in a "small data area" (the + `.sdata' and `.sbss' sections) and are accessed via 16-bit + relocations off of the `$gp' register. This limits the size of + the small data area to 64KB, but allows the variables to be + directly accessed via a single instruction. + + The default is `-mlarge-data'. With this option the data area is + limited to just below 2GB. Programs that require more than 2GB of + data must use `malloc' or `mmap' to allocate the data in the heap + instead of in the program's data segment. + + When generating code for shared libraries, `-fpic' implies + `-msmall-data' and `-fPIC' implies `-mlarge-data'. + + `-mcpu=CPU_TYPE' + Set the instruction set and instruction scheduling parameters for + machine type CPU_TYPE. You can specify either the `EV' style name + or the corresponding chip number. GCC supports scheduling + parameters for the EV4, EV5 and EV6 family of processors and will + choose the default values for the instruction set from the + processor you specify. If you do not specify a processor type, + GCC will default to the processor on which the compiler was built. + + Supported values for CPU_TYPE are + + `ev4' + + `ev45' + `21064' + Schedules as an EV4 and has no instruction set extensions. + + `ev5' + `21164' + Schedules as an EV5 and has no instruction set extensions. + + `ev56' + `21164a' + Schedules as an EV5 and supports the BWX extension. + + `pca56' + `21164pc' + `21164PC' + Schedules as an EV5 and supports the BWX and MAX extensions. + + `ev6' + `21264' + Schedules as an EV6 and supports the BWX, FIX, and MAX + extensions. + + `ev67' + + `21264a' + Schedules as an EV6 and supports the BWX, CIX, FIX, and MAX + extensions. + + `-mtune=CPU_TYPE' + Set only the instruction scheduling parameters for machine type + CPU_TYPE. The instruction set is not changed. + + `-mmemory-latency=TIME' + Sets the latency the scheduler should assume for typical memory + references as seen by the application. This number is highly + dependent on the memory access patterns used by the application + and the size of the external cache on the machine. + + Valid options for TIME are + + `NUMBER' + A decimal number representing clock cycles. + + `L1' + `L2' + `L3' + `main' + The compiler contains estimates of the number of clock cycles + for "typical" EV4 & EV5 hardware for the Level 1, 2 & 3 caches + (also called Dcache, Scache, and Bcache), as well as to main + memory. Note that L3 is only valid for EV5. + + +  + File: gcc.info, Node: DEC Alpha/VMS Options, Next: Clipper Options, Prev: DEC Alpha Options, Up: Submodel Options + + DEC Alpha/VMS Options + --------------------- + + These `-m' options are defined for the DEC Alpha/VMS implementations: + + `-mvms-return-codes' + Return VMS condition codes from main. The default is to return + POSIX style condition (e.g. error) codes. + +  + File: gcc.info, Node: Clipper Options, Next: H8/300 Options, Prev: DEC Alpha/VMS Options, Up: Submodel Options + + Clipper Options + --------------- + + These `-m' options are defined for the Clipper implementations: + + `-mc300' + Produce code for a C300 Clipper processor. This is the default. + + `-mc400' + Produce code for a C400 Clipper processor, i.e. use floating point + registers f8-f15. + +  + File: gcc.info, Node: H8/300 Options, Next: SH Options, Prev: Clipper Options, Up: Submodel Options + + H8/300 Options + -------------- + + These `-m' options are defined for the H8/300 implementations: + + `-mrelax' + Shorten some address references at link time, when possible; uses + the linker option `-relax'. *Note `ld' and the H8/300: + (ld.info)H8/300, for a fuller description. + + `-mh' + Generate code for the H8/300H. + + `-ms' + Generate code for the H8/S. + + `-ms2600' + Generate code for the H8/S2600. This switch must be used with + `-ms'. + + `-mint32' + Make `int' data 32 bits by default. + + `-malign-300' + On the H8/300H and H8/S, use the same alignment rules as for the + H8/300. The default for the H8/300H and H8/S is to align longs + and floats on 4 byte boundaries. `-malign-300' causes them to be + aligned on 2 byte boundaries. This option has no effect on the + H8/300. + +  + File: gcc.info, Node: SH Options, Next: System V Options, Prev: H8/300 Options, Up: Submodel Options + + SH Options + ---------- + + These `-m' options are defined for the SH implementations: + + `-m1' + Generate code for the SH1. + + `-m2' + Generate code for the SH2. + + `-m3' + Generate code for the SH3. + + `-m3e' + Generate code for the SH3e. + + `-m4-nofpu' + Generate code for the SH4 without a floating-point unit. + + `-m4-single-only' + Generate code for the SH4 with a floating-point unit that only + supports single-precision arithmetic. + + `-m4-single' + Generate code for the SH4 assuming the floating-point unit is in + single-precision mode by default. + + `-m4' + Generate code for the SH4. + + `-mb' + Compile code for the processor in big endian mode. + + `-ml' + Compile code for the processor in little endian mode. + + `-mdalign' + Align doubles at 64-bit boundaries. Note that this changes the + calling conventions, and thus some functions from the standard C + library will not work unless you recompile it first with + `-mdalign'. + + `-mrelax' + Shorten some address references at link time, when possible; uses + the linker option `-relax'. + + `-mbigtable' + Use 32-bit offsets in `switch' tables. The default is to use + 16-bit offsets. + + `-mfmovd' + Enable the use of the instruction `fmovd'. + + `-mhitachi' + Comply with the calling conventions defined by Hitachi. + + `-mnomacsave' + Mark the `MAC' register as call-clobbered, even if `-mhitachi' is + given. + + `-mieee' + Increase IEEE-compliance of floating-point code. + + `-misize' + Dump instruction size and location in the assembly code. + + `-mpadstruct' + This option is deprecated. It pads structures to multiple of 4 + bytes, which is incompatible with the SH ABI. + + `-mspace' + Optimize for space instead of speed. Implied by `-Os'. + + `-mprefergot' + When generating position-independent code, emit function calls + using the Global Offset Table instead of the Procedure Linkage + Table. + + `-musermode' + Generate a library function call to invalidate instruction cache + entries, after fixing up a trampoline. This library function call + doesn't assume it can write to the whole memory address space. + This is the default when the target is `sh-*-linux*'. + +  + File: gcc.info, Node: System V Options, Next: TMS320C3x/C4x Options, Prev: SH Options, Up: Submodel Options + + Options for System V + -------------------- + + These additional options are available on System V Release 4 for + compatibility with other compilers on those systems: + + `-G' + Create a shared object. It is recommended that `-symbolic' or + `-shared' be used instead. + + `-Qy' + Identify the versions of each tool used by the compiler, in a + `.ident' assembler directive in the output. + + `-Qn' + Refrain from adding `.ident' directives to the output file (this is + the default). + + `-YP,DIRS' + Search the directories DIRS, and no others, for libraries + specified with `-l'. + + `-Ym,DIR' + Look in the directory DIR to find the M4 preprocessor. The + assembler uses this option. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcc.info-9 gcc-3.2.3/gcc/doc/gcc.info-9 *** gcc-3.2.2/gcc/doc/gcc.info-9 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gcc.info-9 Tue Apr 22 07:07:14 2003 *************** *** 0 **** --- 1,1058 ---- + This is doc/gcc.info, produced by makeinfo version 4.5 from + doc/gcc.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gcc: (gcc). The GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the use of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcc.info, Node: TMS320C3x/C4x Options, Next: V850 Options, Prev: System V Options, Up: Submodel Options + + TMS320C3x/C4x Options + --------------------- + + These `-m' options are defined for TMS320C3x/C4x implementations: + + `-mcpu=CPU_TYPE' + Set the instruction set, register set, and instruction scheduling + parameters for machine type CPU_TYPE. Supported values for + CPU_TYPE are `c30', `c31', `c32', `c40', and `c44'. The default + is `c40' to generate code for the TMS320C40. + + `-mbig-memory' + + `-mbig' + `-msmall-memory' + `-msmall' + Generates code for the big or small memory model. The small memory + model assumed that all data fits into one 64K word page. At + run-time the data page (DP) register must be set to point to the + 64K page containing the .bss and .data program sections. The big + memory model is the default and requires reloading of the DP + register for every direct memory access. + + `-mbk' + `-mno-bk' + Allow (disallow) allocation of general integer operands into the + block count register BK. + + `-mdb' + `-mno-db' + Enable (disable) generation of code using decrement and branch, + DBcond(D), instructions. This is enabled by default for the C4x. + To be on the safe side, this is disabled for the C3x, since the + maximum iteration count on the C3x is 2^23 + 1 (but who iterates + loops more than 2^23 times on the C3x?). Note that GCC will try + to reverse a loop so that it can utilise the decrement and branch + instruction, but will give up if there is more than one memory + reference in the loop. Thus a loop where the loop counter is + decremented can generate slightly more efficient code, in cases + where the RPTB instruction cannot be utilised. + + `-mdp-isr-reload' + `-mparanoid' + Force the DP register to be saved on entry to an interrupt service + routine (ISR), reloaded to point to the data section, and restored + on exit from the ISR. This should not be required unless someone + has violated the small memory model by modifying the DP register, + say within an object library. + + `-mmpyi' + `-mno-mpyi' + For the C3x use the 24-bit MPYI instruction for integer multiplies + instead of a library call to guarantee 32-bit results. Note that + if one of the operands is a constant, then the multiplication will + be performed using shifts and adds. If the `-mmpyi' option is not + specified for the C3x, then squaring operations are performed + inline instead of a library call. + + `-mfast-fix' + `-mno-fast-fix' + The C3x/C4x FIX instruction to convert a floating point value to an + integer value chooses the nearest integer less than or equal to the + floating point value rather than to the nearest integer. Thus if + the floating point number is negative, the result will be + incorrectly truncated an additional code is necessary to detect + and correct this case. This option can be used to disable + generation of the additional code required to correct the result. + + `-mrptb' + `-mno-rptb' + Enable (disable) generation of repeat block sequences using the + RPTB instruction for zero overhead looping. The RPTB construct is + only used for innermost loops that do not call functions or jump + across the loop boundaries. There is no advantage having nested + RPTB loops due to the overhead required to save and restore the + RC, RS, and RE registers. This is enabled by default with `-O2'. + + `-mrpts=COUNT' + `-mno-rpts' + Enable (disable) the use of the single instruction repeat + instruction RPTS. If a repeat block contains a single + instruction, and the loop count can be guaranteed to be less than + the value COUNT, GCC will emit a RPTS instruction instead of a + RPTB. If no value is specified, then a RPTS will be emitted even + if the loop count cannot be determined at compile time. Note that + the repeated instruction following RPTS does not have to be + reloaded from memory each iteration, thus freeing up the CPU buses + for operands. However, since interrupts are blocked by this + instruction, it is disabled by default. + + `-mloop-unsigned' + `-mno-loop-unsigned' + The maximum iteration count when using RPTS and RPTB (and DB on + the C40) is 2^31 + 1 since these instructions test if the + iteration count is negative to terminate the loop. If the + iteration count is unsigned there is a possibility than the 2^31 + + 1 maximum iteration count may be exceeded. This switch allows an + unsigned iteration count. + + `-mti' + Try to emit an assembler syntax that the TI assembler (asm30) is + happy with. This also enforces compatibility with the API + employed by the TI C3x C compiler. For example, long doubles are + passed as structures rather than in floating point registers. + + `-mregparm' + `-mmemparm' + Generate code that uses registers (stack) for passing arguments to + functions. By default, arguments are passed in registers where + possible rather than by pushing arguments on to the stack. + + `-mparallel-insns' + `-mno-parallel-insns' + Allow the generation of parallel instructions. This is enabled by + default with `-O2'. + + `-mparallel-mpy' + `-mno-parallel-mpy' + Allow the generation of MPY||ADD and MPY||SUB parallel + instructions, provided `-mparallel-insns' is also specified. + These instructions have tight register constraints which can + pessimize the code generation of large functions. + + +  + File: gcc.info, Node: V850 Options, Next: ARC Options, Prev: TMS320C3x/C4x Options, Up: Submodel Options + + V850 Options + ------------ + + These `-m' options are defined for V850 implementations: + + `-mlong-calls' + `-mno-long-calls' + Treat all calls as being far away (near). If calls are assumed to + be far away, the compiler will always load the functions address + up into a register, and call indirect through the pointer. + + `-mno-ep' + `-mep' + Do not optimize (do optimize) basic blocks that use the same index + pointer 4 or more times to copy pointer into the `ep' register, and + use the shorter `sld' and `sst' instructions. The `-mep' option + is on by default if you optimize. + + `-mno-prolog-function' + `-mprolog-function' + Do not use (do use) external functions to save and restore + registers at the prolog and epilog of a function. The external + functions are slower, but use less code space if more than one + function saves the same number of registers. The + `-mprolog-function' option is on by default if you optimize. + + `-mspace' + Try to make the code as small as possible. At present, this just + turns on the `-mep' and `-mprolog-function' options. + + `-mtda=N' + Put static or global variables whose size is N bytes or less into + the tiny data area that register `ep' points to. The tiny data + area can hold up to 256 bytes in total (128 bytes for byte + references). + + `-msda=N' + Put static or global variables whose size is N bytes or less into + the small data area that register `gp' points to. The small data + area can hold up to 64 kilobytes. + + `-mzda=N' + Put static or global variables whose size is N bytes or less into + the first 32 kilobytes of memory. + + `-mv850' + Specify that the target processor is the V850. + + `-mbig-switch' + Generate code suitable for big switch tables. Use this option + only if the assembler/linker complain about out of range branches + within a switch table. + +  + File: gcc.info, Node: ARC Options, Next: NS32K Options, Prev: V850 Options, Up: Submodel Options + + ARC Options + ----------- + + These options are defined for ARC implementations: + + `-EL' + Compile code for little endian mode. This is the default. + + `-EB' + Compile code for big endian mode. + + `-mmangle-cpu' + Prepend the name of the cpu to all public symbol names. In + multiple-processor systems, there are many ARC variants with + different instruction and register set characteristics. This flag + prevents code compiled for one cpu to be linked with code compiled + for another. No facility exists for handling variants that are + "almost identical". This is an all or nothing option. + + `-mcpu=CPU' + Compile code for ARC variant CPU. Which variants are supported + depend on the configuration. All variants support `-mcpu=base', + this is the default. + + `-mtext=TEXT-SECTION' + `-mdata=DATA-SECTION' + `-mrodata=READONLY-DATA-SECTION' + Put functions, data, and readonly data in TEXT-SECTION, + DATA-SECTION, and READONLY-DATA-SECTION respectively by default. + This can be overridden with the `section' attribute. *Note + Variable Attributes::. + + +  + File: gcc.info, Node: NS32K Options, Next: AVR Options, Prev: ARC Options, Up: Submodel Options + + NS32K Options + ------------- + + These are the `-m' options defined for the 32000 series. The default + values for these options depends on which style of 32000 was selected + when the compiler was configured; the defaults for the most common + choices are given below. + + `-m32032' + `-m32032' + Generate output for a 32032. This is the default when the + compiler is configured for 32032 and 32016 based systems. + + `-m32332' + `-m32332' + Generate output for a 32332. This is the default when the + compiler is configured for 32332-based systems. + + `-m32532' + `-m32532' + Generate output for a 32532. This is the default when the + compiler is configured for 32532-based systems. + + `-m32081' + Generate output containing 32081 instructions for floating point. + This is the default for all systems. + + `-m32381' + Generate output containing 32381 instructions for floating point. + This also implies `-m32081'. The 32381 is only compatible with + the 32332 and 32532 cpus. This is the default for the + pc532-netbsd configuration. + + `-mmulti-add' + Try and generate multiply-add floating point instructions `polyF' + and `dotF'. This option is only available if the `-m32381' option + is in effect. Using these instructions requires changes to + register allocation which generally has a negative impact on + performance. This option should only be enabled when compiling + code particularly likely to make heavy use of multiply-add + instructions. + + `-mnomulti-add' + Do not try and generate multiply-add floating point instructions + `polyF' and `dotF'. This is the default on all platforms. + + `-msoft-float' + Generate output containing library calls for floating point. + *Warning:* the requisite libraries may not be available. + + `-mnobitfield' + Do not use the bit-field instructions. On some machines it is + faster to use shifting and masking operations. This is the + default for the pc532. + + `-mbitfield' + Do use the bit-field instructions. This is the default for all + platforms except the pc532. + + `-mrtd' + Use a different function-calling convention, in which functions + that take a fixed number of arguments return pop their arguments + on return with the `ret' instruction. + + This calling convention is incompatible with the one normally used + on Unix, so you cannot use it if you need to call libraries + compiled with the Unix compiler. + + Also, you must provide function prototypes for all functions that + take variable numbers of arguments (including `printf'); otherwise + incorrect code will be generated for calls to those functions. + + In addition, seriously incorrect code will result if you call a + function with too many arguments. (Normally, extra arguments are + harmlessly ignored.) + + This option takes its name from the 680x0 `rtd' instruction. + + `-mregparam' + Use a different function-calling convention where the first two + arguments are passed in registers. + + This calling convention is incompatible with the one normally used + on Unix, so you cannot use it if you need to call libraries + compiled with the Unix compiler. + + `-mnoregparam' + Do not pass any arguments in registers. This is the default for + all targets. + + `-msb' + It is OK to use the sb as an index register which is always loaded + with zero. This is the default for the pc532-netbsd target. + + `-mnosb' + The sb register is not available for use or has not been + initialized to zero by the run time system. This is the default + for all targets except the pc532-netbsd. It is also implied + whenever `-mhimem' or `-fpic' is set. + + `-mhimem' + Many ns32000 series addressing modes use displacements of up to + 512MB. If an address is above 512MB then displacements from zero + can not be used. This option causes code to be generated which + can be loaded above 512MB. This may be useful for operating + systems or ROM code. + + `-mnohimem' + Assume code will be loaded in the first 512MB of virtual address + space. This is the default for all platforms. + + +  + File: gcc.info, Node: AVR Options, Next: MCore Options, Prev: NS32K Options, Up: Submodel Options + + AVR Options + ----------- + + These options are defined for AVR implementations: + + `-mmcu=MCU' + Specify ATMEL AVR instruction set or MCU type. + + Instruction set avr1 is for the minimal AVR core, not supported by + the C compiler, only for assembler programs (MCU types: at90s1200, + attiny10, attiny11, attiny12, attiny15, attiny28). + + Instruction set avr2 (default) is for the classic AVR core with up + to 8K program memory space (MCU types: at90s2313, at90s2323, + attiny22, at90s2333, at90s2343, at90s4414, at90s4433, at90s4434, + at90s8515, at90c8534, at90s8535). + + Instruction set avr3 is for the classic AVR core with up to 128K + program memory space (MCU types: atmega103, atmega603, at43usb320, + at76c711). + + Instruction set avr4 is for the enhanced AVR core with up to 8K + program memory space (MCU types: atmega8, atmega83, atmega85). + + Instruction set avr5 is for the enhanced AVR core with up to 128K + program memory space (MCU types: atmega16, atmega161, atmega163, + atmega32, atmega323, atmega64, atmega128, at43usb355, at94k). + + `-msize' + Output instruction sizes to the asm file. + + `-minit-stack=N' + Specify the initial stack address, which may be a symbol or + numeric value, `__stack' is the default. + + `-mno-interrupts' + Generated code is not compatible with hardware interrupts. Code + size will be smaller. + + `-mcall-prologues' + Functions prologues/epilogues expanded as call to appropriate + subroutines. Code size will be smaller. + + `-mno-tablejump' + Do not generate tablejump insns which sometimes increase code size. + + `-mtiny-stack' + Change only the low 8 bits of the stack pointer. + +  + File: gcc.info, Node: MCore Options, Next: IA-64 Options, Prev: AVR Options, Up: Submodel Options + + MCore Options + ------------- + + These are the `-m' options defined for the Motorola M*Core + processors. + + `-mhardlit' + `-mhardlit' + `-mno-hardlit' + Inline constants into the code stream if it can be done in two + instructions or less. + + `-mdiv' + `-mdiv' + `-mno-div' + Use the divide instruction. (Enabled by default). + + `-mrelax-immediate' + `-mrelax-immediate' + `-mno-relax-immediate' + Allow arbitrary sized immediates in bit operations. + + `-mwide-bitfields' + `-mwide-bitfields' + `-mno-wide-bitfields' + Always treat bit-fields as int-sized. + + `-m4byte-functions' + `-m4byte-functions' + `-mno-4byte-functions' + Force all functions to be aligned to a four byte boundary. + + `-mcallgraph-data' + `-mcallgraph-data' + `-mno-callgraph-data' + Emit callgraph information. + + `-mslow-bytes' + `-mslow-bytes' + `-mno-slow-bytes' + Prefer word access when reading byte quantities. + + `-mlittle-endian' + `-mlittle-endian' + `-mbig-endian' + Generate code for a little endian target. + + `-m210' + `-m210' + `-m340' + Generate code for the 210 processor. + +  + File: gcc.info, Node: IA-64 Options, Next: D30V Options, Prev: MCore Options, Up: Submodel Options + + IA-64 Options + ------------- + + These are the `-m' options defined for the Intel IA-64 architecture. + + `-mbig-endian' + Generate code for a big endian target. This is the default for + HPUX. + + `-mlittle-endian' + Generate code for a little endian target. This is the default for + AIX5 and Linux. + + `-mgnu-as' + `-mno-gnu-as' + Generate (or don't) code for the GNU assembler. This is the + default. + + `-mgnu-ld' + `-mno-gnu-ld' + Generate (or don't) code for the GNU linker. This is the default. + + `-mno-pic' + Generate code that does not use a global pointer register. The + result is not position independent code, and violates the IA-64 + ABI. + + `-mvolatile-asm-stop' + `-mno-volatile-asm-stop' + Generate (or don't) a stop bit immediately before and after + volatile asm statements. + + `-mb-step' + Generate code that works around Itanium B step errata. + + `-mregister-names' + `-mno-register-names' + Generate (or don't) `in', `loc', and `out' register names for the + stacked registers. This may make assembler output more readable. + + `-mno-sdata' + `-msdata' + Disable (or enable) optimizations that use the small data section. + This may be useful for working around optimizer bugs. + + `-mconstant-gp' + Generate code that uses a single constant global pointer value. + This is useful when compiling kernel code. + + `-mauto-pic' + Generate code that is self-relocatable. This implies + `-mconstant-gp'. This is useful when compiling firmware code. + + `-minline-divide-min-latency' + Generate code for inline divides using the minimum latency + algorithm. + + `-minline-divide-max-throughput' + Generate code for inline divides using the maximum throughput + algorithm. + + `-mno-dwarf2-asm' + `-mdwarf2-asm' + Don't (or do) generate assembler code for the DWARF2 line number + debugging info. This may be useful when not using the GNU + assembler. + + `-mfixed-range=REGISTER-RANGE' + Generate code treating the given register range as fixed registers. + A fixed register is one that the register allocator can not use. + This is useful when compiling kernel code. A register range is + specified as two registers separated by a dash. Multiple register + ranges can be specified separated by a comma. + +  + File: gcc.info, Node: D30V Options, Next: S/390 and zSeries Options, Prev: IA-64 Options, Up: Submodel Options + + D30V Options + ------------ + + These `-m' options are defined for D30V implementations: + + `-mextmem' + Link the `.text', `.data', `.bss', `.strings', `.rodata', + `.rodata1', `.data1' sections into external memory, which starts + at location `0x80000000'. + + `-mextmemory' + Same as the `-mextmem' switch. + + `-monchip' + Link the `.text' section into onchip text memory, which starts at + location `0x0'. Also link `.data', `.bss', `.strings', `.rodata', + `.rodata1', `.data1' sections into onchip data memory, which + starts at location `0x20000000'. + + `-mno-asm-optimize' + `-masm-optimize' + Disable (enable) passing `-O' to the assembler when optimizing. + The assembler uses the `-O' option to automatically parallelize + adjacent short instructions where possible. + + `-mbranch-cost=N' + Increase the internal costs of branches to N. Higher costs means + that the compiler will issue more instructions to avoid doing a + branch. The default is 2. + + `-mcond-exec=N' + Specify the maximum number of conditionally executed instructions + that replace a branch. The default is 4. + +  + File: gcc.info, Node: S/390 and zSeries Options, Next: CRIS Options, Prev: D30V Options, Up: Submodel Options + + S/390 and zSeries Options + ------------------------- + + These are the `-m' options defined for the S/390 and zSeries + architecture. + + `-mhard-float' + `-msoft-float' + Use (do not use) the hardware floating-point instructions and + registers for floating-point operations. When `-msoft-float' is + specified, functions in `libgcc.a' will be used to perform + floating-point operations. When `-mhard-float' is specified, the + compiler generates IEEE floating-point instructions. This is the + default. + + `-mbackchain' + `-mno-backchain' + Generate (or do not generate) code which maintains an explicit + backchain within the stack frame that points to the caller's frame. + This is currently needed to allow debugging. The default is to + generate the backchain. + + `-msmall-exec' + `-mno-small-exec' + Generate (or do not generate) code using the `bras' instruction to + do subroutine calls. This only works reliably if the total + executable size does not exceed 64k. The default is to use the + `basr' instruction instead, which does not have this limitation. + + `-m64' + `-m31' + When `-m31' is specified, generate code compliant to the Linux for + S/390 ABI. When `-m64' is specified, generate code compliant to + the Linux for zSeries ABI. This allows GCC in particular to + generate 64-bit instructions. For the `s390' targets, the default + is `-m31', while the `s390x' targets default to `-m64'. + + `-mmvcle' + `-mno-mvcle' + Generate (or do not generate) code using the `mvcle' instruction + to perform block moves. When `-mno-mvcle' is specifed, use a + `mvc' loop instead. This is the default. + + `-mdebug' + `-mno-debug' + Print (or do not print) additional debug information when + compiling. The default is to not print debug information. + + +  + File: gcc.info, Node: CRIS Options, Next: MMIX Options, Prev: S/390 and zSeries Options, Up: Submodel Options + + CRIS Options + ------------ + + These options are defined specifically for the CRIS ports. + + `-march=ARCHITECTURE-TYPE' + `-mcpu=ARCHITECTURE-TYPE' + Generate code for the specified architecture. The choices for + ARCHITECTURE-TYPE are `v3', `v8' and `v10' for respectively + ETRAX 4, ETRAX 100, and ETRAX 100 LX. Default is `v0' except for + cris-axis-linux-gnu, where the default is `v10'. + + `-mtune=ARCHITECTURE-TYPE' + Tune to ARCHITECTURE-TYPE everything applicable about the generated + code, except for the ABI and the set of available instructions. + The choices for ARCHITECTURE-TYPE are the same as for + `-march=ARCHITECTURE-TYPE'. + + `-mmax-stack-frame=N' + Warn when the stack frame of a function exceeds N bytes. + + `-melinux-stacksize=N' + Only available with the `cris-axis-aout' target. Arranges for + indications in the program to the kernel loader that the stack of + the program should be set to N bytes. + + `-metrax4' + `-metrax100' + The options `-metrax4' and `-metrax100' are synonyms for + `-march=v3' and `-march=v8' respectively. + + `-mpdebug' + Enable CRIS-specific verbose debug-related information in the + assembly code. This option also has the effect to turn off the + `#NO_APP' formatted-code indicator to the assembler at the + beginning of the assembly file. + + `-mcc-init' + Do not use condition-code results from previous instruction; + always emit compare and test instructions before use of condition + codes. + + `-mno-side-effects' + Do not emit instructions with side-effects in addressing modes + other than post-increment. + + `-mstack-align' + `-mno-stack-align' + `-mdata-align' + `-mno-data-align' + `-mconst-align' + `-mno-const-align' + These options (no-options) arranges (eliminate arrangements) for + the stack-frame, individual data and constants to be aligned for + the maximum single data access size for the chosen CPU model. The + default is to arrange for 32-bit alignment. ABI details such as + structure layout are not affected by these options. + + `-m32-bit' + `-m16-bit' + `-m8-bit' + Similar to the stack- data- and const-align options above, these + options arrange for stack-frame, writable data and constants to + all be 32-bit, 16-bit or 8-bit aligned. The default is 32-bit + alignment. + + `-mno-prologue-epilogue' + `-mprologue-epilogue' + With `-mno-prologue-epilogue', the normal function prologue and + epilogue that sets up the stack-frame are omitted and no return + instructions or return sequences are generated in the code. Use + this option only together with visual inspection of the compiled + code: no warnings or errors are generated when call-saved + registers must be saved, or storage for local variable needs to be + allocated. + + `-mno-gotplt' + `-mgotplt' + With `-fpic' and `-fPIC', don't generate (do generate) instruction + sequences that load addresses for functions from the PLT part of + the GOT rather than (traditional on other architectures) calls to + the PLT. The default is `-mgotplt'. + + `-maout' + Legacy no-op option only recognized with the cris-axis-aout target. + + `-melf' + Legacy no-op option only recognized with the cris-axis-elf and + cris-axis-linux-gnu targets. + + `-melinux' + Only recognized with the cris-axis-aout target, where it selects a + GNU/linux-like multilib, include files and instruction set for + `-march=v8'. + + `-mlinux' + Legacy no-op option only recognized with the cris-axis-linux-gnu + target. + + `-sim' + This option, recognized for the cris-axis-aout and cris-axis-elf + arranges to link with input-output functions from a simulator + library. Code, initialized data and zero-initialized data are + allocated consecutively. + + `-sim2' + Like `-sim', but pass linker options to locate initialized data at + 0x40000000 and zero-initialized data at 0x80000000. + +  + File: gcc.info, Node: MMIX Options, Next: PDP-11 Options, Prev: CRIS Options, Up: Submodel Options + + MMIX Options + ------------ + + These options are defined for the MMIX: + + `-mlibfuncs' + `-mno-libfuncs' + Specify that intrinsic library functions are being compiled, + passing all values in registers, no matter the size. + + `-mepsilon' + `-mno-epsilon' + Generate floating-point comparison instructions that compare with + respect to the `rE' epsilon register. + + `-mabi=mmixware' + `-mabi=gnu' + Generate code that passes function parameters and return values + that (in the called function) are seen as registers `$0' and up, + as opposed to the GNU ABI which uses global registers `$231' and + up. + + `-mzero-extend' + `-mno-zero-extend' + When reading data from memory in sizes shorter than 64 bits, use + (do not use) zero-extending load instructions by default, rather + than sign-extending ones. + + `-mknuthdiv' + `-mno-knuthdiv' + Make the result of a division yielding a remainder have the same + sign as the divisor. With the default, `-mno-knuthdiv', the sign + of the remainder follows the sign of the dividend. Both methods + are arithmetically valid, the latter being almost exclusively used. + + `-mtoplevel-symbols' + `-mno-toplevel-symbols' + Prepend (do not prepend) a `:' to all global symbols, so the + assembly code can be used with the `PREFIX' assembly directive. + + `-melf' + Generate an executable in the ELF format, rather than the default + `mmo' format used by the `mmix' simulator. + + `-mbranch-predict' + `-mno-branch-predict' + Use (do not use) the probable-branch instructions, when static + branch prediction indicates a probable branch. + + `-mbase-addresses' + `-mno-base-addresses' + Generate (do not generate) code that uses _base addresses_. Using + a base address automatically generates a request (handled by the + assembler and the linker) for a constant to be set up in a global + register. The register is used for one or more base address + requests within the range 0 to 255 from the value held in the + register. The generally leads to short and fast code, but the + number of different data items that can be addressed is limited. + This means that a program that uses lots of static data may + require `-mno-base-addresses'. + +  + File: gcc.info, Node: PDP-11 Options, Next: Xstormy16 Options, Prev: MMIX Options, Up: Submodel Options + + PDP-11 Options + -------------- + + These options are defined for the PDP-11: + + `-mfpu' + Use hardware FPP floating point. This is the default. (FIS + floating point on the PDP-11/40 is not supported.) + + `-msoft-float' + Do not use hardware floating point. + + `-mac0' + Return floating-point results in ac0 (fr0 in Unix assembler + syntax). + + `-mno-ac0' + Return floating-point results in memory. This is the default. + + `-m40' + Generate code for a PDP-11/40. + + `-m45' + Generate code for a PDP-11/45. This is the default. + + `-m10' + Generate code for a PDP-11/10. + + `-mbcopy-builtin' + Use inline `movstrhi' patterns for copying memory. This is the + default. + + `-mbcopy' + Do not use inline `movstrhi' patterns for copying memory. + + `-mint16' + `-mno-int32' + Use 16-bit `int'. This is the default. + + `-mint32' + `-mno-int16' + Use 32-bit `int'. + + `-mfloat64' + `-mno-float32' + Use 64-bit `float'. This is the default. + + `-mfloat32' + + `-mno-float64' + Use 32-bit `float'. + + `-mabshi' + Use `abshi2' pattern. This is the default. + + `-mno-abshi' + Do not use `abshi2' pattern. + + `-mbranch-expensive' + Pretend that branches are expensive. This is for experimenting + with code generation only. + + `-mbranch-cheap' + Do not pretend that branches are expensive. This is the default. + + `-msplit' + Generate code for a system with split I&D. + + `-mno-split' + Generate code for a system without split I&D. This is the default. + + `-munix-asm' + Use Unix assembler syntax. This is the default when configured for + `pdp11-*-bsd'. + + `-mdec-asm' + Use DEC assembler syntax. This is the default when configured for + any PDP-11 target other than `pdp11-*-bsd'. + +  + File: gcc.info, Node: Xstormy16 Options, Next: Xtensa Options, Prev: PDP-11 Options, Up: Submodel Options + + Xstormy16 Options + ----------------- + + These options are defined for Xstormy16: + + `-msim' + Choose startup files and linker script suitable for the simulator. + +  + File: gcc.info, Node: Xtensa Options, Prev: Xstormy16 Options, Up: Submodel Options + + Xtensa Options + -------------- + + The Xtensa architecture is designed to support many different + configurations. The compiler's default options can be set to match a + particular Xtensa configuration by copying a configuration file into the + GCC sources when building GCC. The options below may be used to + override the default options. + + `-mbig-endian' + `-mlittle-endian' + Specify big-endian or little-endian byte ordering for the target + Xtensa processor. + + `-mdensity' + `-mno-density' + Enable or disable use of the optional Xtensa code density + instructions. + + `-mmac16' + `-mno-mac16' + Enable or disable use of the Xtensa MAC16 option. When enabled, + GCC will generate MAC16 instructions from standard C code, with the + limitation that it will use neither the MR register file nor any + instruction that operates on the MR registers. When this option is + disabled, GCC will translate 16-bit multiply/accumulate operations + to a combination of core instructions and library calls, depending + on whether any other multiplier options are enabled. + + `-mmul16' + `-mno-mul16' + Enable or disable use of the 16-bit integer multiplier option. + When enabled, the compiler will generate 16-bit multiply + instructions for multiplications of 16 bits or smaller in standard + C code. When this option is disabled, the compiler will either + use 32-bit multiply or MAC16 instructions if they are available or + generate library calls to perform the multiply operations using + shifts and adds. + + `-mmul32' + `-mno-mul32' + Enable or disable use of the 32-bit integer multiplier option. + When enabled, the compiler will generate 32-bit multiply + instructions for multiplications of 32 bits or smaller in standard + C code. When this option is disabled, the compiler will generate + library calls to perform the multiply operations using either + shifts and adds or 16-bit multiply instructions if they are + available. + + `-mnsa' + `-mno-nsa' + Enable or disable use of the optional normalization shift amount + (`NSA') instructions to implement the built-in `ffs' function. + + `-mminmax' + `-mno-minmax' + Enable or disable use of the optional minimum and maximum value + instructions. + + `-msext' + `-mno-sext' + Enable or disable use of the optional sign extend (`SEXT') + instruction. + + `-mbooleans' + `-mno-booleans' + Enable or disable support for the boolean register file used by + Xtensa coprocessors. This is not typically useful by itself but + may be required for other options that make use of the boolean + registers (e.g., the floating-point option). + + `-mhard-float' + `-msoft-float' + Enable or disable use of the floating-point option. When enabled, + GCC generates floating-point instructions for 32-bit `float' + operations. When this option is disabled, GCC generates library + calls to emulate 32-bit floating-point operations using integer + instructions. Regardless of this option, 64-bit `double' + operations are always emulated with calls to library functions. + + `-mfused-madd' + `-mno-fused-madd' + Enable or disable use of fused multiply/add and multiply/subtract + instructions in the floating-point option. This has no effect if + the floating-point option is not also enabled. Disabling fused + multiply/add and multiply/subtract instructions forces the + compiler to use separate instructions for the multiply and + add/subtract operations. This may be desirable in some cases + where strict IEEE 754-compliant results are required: the fused + multiply add/subtract instructions do not round the intermediate + result, thereby producing results with _more_ bits of precision + than specified by the IEEE standard. Disabling fused multiply + add/subtract instructions also ensures that the program output is + not sensitive to the compiler's ability to combine multiply and + add/subtract operations. + + `-mserialize-volatile' + `-mno-serialize-volatile' + When this option is enabled, GCC inserts `MEMW' instructions before + `volatile' memory references to guarantee sequential consistency. + The default is `-mserialize-volatile'. Use + `-mno-serialize-volatile' to omit the `MEMW' instructions. + + `-mtext-section-literals' + `-mno-text-section-literals' + Control the treatment of literal pools. The default is + `-mno-text-section-literals', which places literals in a separate + section in the output file. This allows the literal pool to be + placed in a data RAM/ROM, and it also allows the linker to combine + literal pools from separate object files to remove redundant + literals and improve code size. With `-mtext-section-literals', + the literals are interspersed in the text section in order to keep + them as close as possible to their references. This may be + necessary for large assembly files. + + `-mtarget-align' + `-mno-target-align' + When this option is enabled, GCC instructs the assembler to + automatically align instructions to reduce branch penalties at the + expense of some code density. The assembler attempts to widen + density instructions to align branch targets and the instructions + following call instructions. If there are not enough preceding + safe density instructions to align a target, no widening will be + performed. The default is `-mtarget-align'. These options do not + affect the treatment of auto-aligned instructions like `LOOP', + which the assembler will always align, either by widening density + instructions or by inserting no-op instructions. + + `-mlongcalls' + `-mno-longcalls' + When this option is enabled, GCC instructs the assembler to + translate direct calls to indirect calls unless it can determine + that the target of a direct call is in the range allowed by the + call instruction. This translation typically occurs for calls to + functions in other source files. Specifically, the assembler + translates a direct `CALL' instruction into an `L32R' followed by + a `CALLX' instruction. The default is `-mno-longcalls'. This + option should be used in programs where the call target can + potentially be out of range. This option is implemented in the + assembler, not the compiler, so the assembly code generated by GCC + will still show direct call instructions--look at the disassembled + object code to see the actual instructions. Note that the + assembler will use an indirect call for every cross-file call, not + just those that really will be out of range. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info gcc-3.2.3/gcc/doc/gccint.info *** gcc-3.2.2/gcc/doc/gccint.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,243 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + Indirect: + gccint.info-1: 1250 + gccint.info-2: 48415 + gccint.info-3: 91676 + gccint.info-4: 127912 + gccint.info-5: 173371 + gccint.info-6: 222790 + gccint.info-7: 261767 + gccint.info-8: 302440 + gccint.info-9: 343547 + gccint.info-10: 360144 + gccint.info-11: 406797 + gccint.info-12: 453949 + gccint.info-13: 489017 + gccint.info-14: 538134 + gccint.info-15: 587199 + gccint.info-16: 635215 + gccint.info-17: 675920 + gccint.info-18: 723825 + gccint.info-19: 768901 + gccint.info-20: 816265 + gccint.info-21: 865703 + gccint.info-22: 907964 + gccint.info-23: 934646 +  + Tag Table: + (Indirect) + Node: Top1250 + Node: Contributing3727 + Node: Portability4473 + Node: Interface6234 + Node: Languages10479 + Node: Source Tree12032 + Node: Configure Terms12650 + Node: Top Level15613 + Node: gcc Directory17736 + Node: Subdirectories18702 + Node: Configuration21004 + Node: Config Fragments21654 + Node: System Config22746 + Node: Configuration Files23036 + Node: Build25711 + Node: Makefile26114 + Node: Library Files29505 + Node: Headers30058 + Node: Documentation32095 + Node: Texinfo Manuals32888 + Node: Man Page Generation35009 + Node: Miscellaneous Docs36917 + Node: Front End38261 + Node: Front End Directory41550 + Node: Front End Config46061 + Node: Back End48415 + Node: Test Suites51428 + Node: Test Idioms51928 + Node: C Tests54796 + Node: libgcj Tests57542 + Node: Passes58454 + Node: Trees81772 + Node: Deficiencies84501 + Node: Tree overview84734 + Node: Macros and Functions88872 + Node: Identifiers89009 + Node: Containers90529 + Node: Types91676 + Node: Scopes104401 + Node: Namespaces105160 + Node: Classes107968 + Node: Declarations112570 + Node: Functions118629 + Node: Function Basics121162 + Node: Function Bodies127912 + Node: Attributes141818 + Node: Expression trees143054 + Node: RTL167446 + Node: RTL Objects169480 + Node: RTL Classes173371 + Node: Accessors177932 + Node: Flags180315 + Node: Machine Modes195220 + Node: Constants203953 + Node: Regs and Memory209919 + Node: Arithmetic222790 + Node: Comparisons229449 + Node: Bit-Fields233572 + Node: Vector Operations234993 + Node: Conversions236771 + Node: RTL Declarations240081 + Node: Side Effects240893 + Node: Incdec256686 + Node: Assembler260242 + Node: Insns261767 + Node: Calls286565 + Node: Sharing289162 + Node: Reading RTL292266 + Node: Machine Desc293252 + Node: Overview295531 + Node: Patterns297573 + Node: Example301006 + Node: RTL Template302440 + Node: Output Template314908 + Node: Output Statement318893 + Node: Constraints322867 + Node: Simple Constraints323801 + Node: Multi-Alternative336165 + Node: Class Preferences339003 + Node: Modifiers339886 + Node: Machine Constraints343547 + Node: Standard Names360144 + Ref: prologue instruction pattern399527 + Ref: epilogue instruction pattern400020 + Node: Pattern Ordering402749 + Node: Dependent Patterns403979 + Node: Jump Patterns406797 + Node: Looping Patterns412547 + Node: Insn Canonicalizations417153 + Node: Expander Definitions420654 + Node: Insn Splitting428789 + Node: Including Patterns438407 + Node: Peephole Definitions440185 + Node: define_peephole441435 + Node: define_peephole2447784 + Node: Insn Attributes450848 + Node: Defining Attributes451934 + Node: Expressions453949 + Node: Tagging Insns460541 + Node: Attr Example464906 + Node: Insn Lengths467285 + Node: Constant Attributes470547 + Node: Delay Slots471710 + Node: Function Units474924 + Node: Conditional Execution480597 + Node: Constant Definitions483456 + Node: Target Macros485037 + Node: Target Structure487726 + Node: Driver489017 + Node: Run-time Target508350 + Node: Per-Function Data515840 + Node: Storage Layout519105 + Node: Type Layout538134 + Node: Escape Sequences548486 + Node: Registers549401 + Node: Register Basics550324 + Node: Allocation Order555929 + Node: Values in Registers557345 + Node: Leaf Functions562180 + Node: Stack Registers564969 + Node: Register Classes565769 + Node: Stack and Calling586703 + Node: Frame Layout587199 + Node: Exception Handling594064 + Node: Stack Checking598566 + Node: Frame Registers602123 + Node: Elimination607575 + Node: Stack Arguments611548 + Node: Register Arguments619104 + Node: Scalar Return630974 + Node: Aggregate Return635215 + Node: Caller Saves638932 + Node: Function Entry640472 + Node: Profiling652561 + Node: Tail Calls654894 + Node: Varargs655485 + Node: Trampolines663163 + Node: Library Calls670398 + Node: Addressing Modes675920 + Node: Condition Code687197 + Node: Costs694524 + Node: Scheduling706283 + Node: Sections711799 + Node: PIC719954 + Node: Assembler Format722755 + Node: File Framework723825 + Node: Data Output728685 + Node: Uninitialized Data736558 + Node: Label Output741958 + Node: Initialization756751 + Node: Macros for Initialization762732 + Node: Instruction Output768901 + Node: Dispatch Tables777941 + Node: Exception Region Output780496 + Node: Alignment Output783850 + Node: Debugging Info787722 + Node: All Debuggers788386 + Node: DBX Options791269 + Node: DBX Hooks796644 + Node: File Names and DBX800468 + Node: SDB and DWARF802444 + Node: VMS Debug805885 + Node: Cross-compilation806433 + Node: Mode Switching813012 + Node: Target Attributes816265 + Node: Misc820102 + Node: Host Config848584 + Node: Fragments854620 + Node: Target Fragment855763 + Node: Host Fragment860258 + Node: Collect2861695 + Node: Header Dirs864252 + Node: Funding865703 + Node: GNU Project868209 + Node: Copying868863 + Node: GNU Free Documentation License888077 + Node: Contributors907964 + Node: Option Index932895 + Node: Index934646 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-1 gcc-3.2.3/gcc/doc/gccint.info-1 *** gcc-3.2.2/gcc/doc/gccint.info-1 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-1 Tue Apr 22 07:07:18 2003 *************** *** 0 **** --- 1,1187 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Top, Next: Contributing, Up: (DIR) + + Introduction + ************ + + This manual documents the internals of the GNU compilers, including + how to port them to new targets and some information about how to write + front ends for new languages. It corresponds to GCC version 3.2.3. + The use of the GNU compilers is documented in a separate manual. *Note + Introduction: (gcc)Top. + + This manual is mainly a reference manual rather than a tutorial. It + discusses how to contribute to GCC (*note Contributing::), the + characteristics of the machines supported by GCC as hosts and targets + (*note Portability::), how GCC relates to the ABIs on such systems + (*note Interface::), and the characteristics of the languages for which + GCC front ends are written (*note Languages::). It then describes the + GCC source tree structure and build system, some of the interfaces to + GCC front ends, and how support for a target system is implemented in + GCC. + + Additional tutorial information is linked to from + `http://gcc.gnu.org/readings.html'. + + * Menu: + + * Contributing:: How to contribute to testing and developing GCC. + * Portability:: Goals of GCC's portability features. + * Interface:: Function-call interface of GCC output. + * Languages:: Languages for which GCC front ends are written. + * Source Tree:: GCC source tree structure and build system. + * Passes:: Order of passes, what they do, and what each file is for. + * Trees:: The source representation used by the C and C++ front ends. + * RTL:: The intermediate representation that most passes work on. + * Machine Desc:: How to write machine description instruction patterns. + * Target Macros:: How to write the machine description C macros and functions. + * Host Config:: Writing the `xm-MACHINE.h' file. + * Fragments:: Writing the `t-TARGET' and `x-HOST' files. + * Collect2:: How `collect2' works; how it finds `ld'. + * Header Dirs:: Understanding the standard header file directories. + + * Funding:: How to help assure funding for free software. + * GNU Project:: The GNU Project and GNU/Linux. + + * Copying:: GNU General Public License says + how you can copy and share GCC. + * GNU Free Documentation License:: How you can copy and share this manual. + * Contributors:: People who have contributed to GCC. + + * Option Index:: Index to command line options. + * Index:: Index of concepts and symbol names. + +  + File: gccint.info, Node: Contributing, Next: Portability, Prev: Top, Up: Top + + Contributing to GCC Development + ******************************* + + If you would like to help pretest GCC releases to assure they work + well, our current development sources are available by CVS (see + `http://gcc.gnu.org/cvs.html'). Source and binary snapshots are also + available for FTP; see `http://gcc.gnu.org/snapshots.html'. + + If you would like to work on improvements to GCC, please read the + advice at these URLs: + + `http://gcc.gnu.org/contribute.html' + `http://gcc.gnu.org/contributewhy.html' + + for information on how to make useful contributions and avoid + duplication of effort. Suggested projects are listed at + `http://gcc.gnu.org/projects/'. + +  + File: gccint.info, Node: Portability, Next: Interface, Prev: Contributing, Up: Top + + GCC and Portability + ******************* + + The main goal of GCC was to make a good, fast compiler for machines + in the class that the GNU system aims to run on: 32-bit machines that + address 8-bit bytes and have several general registers. Elegance, + theoretical power and simplicity are only secondary. + + GCC gets most of the information about the target machine from a + machine description which gives an algebraic formula for each of the + machine's instructions. This is a very clean way to describe the + target. But when the compiler needs information that is difficult to + express in this fashion, I have not hesitated to define an ad-hoc + parameter to the machine description. The purpose of portability is to + reduce the total work needed on the compiler; it was not of interest + for its own sake. + + GCC does not contain machine dependent code, but it does contain code + that depends on machine parameters such as endianness (whether the most + significant byte has the highest or lowest address of the bytes in a + word) and the availability of autoincrement addressing. In the + RTL-generation pass, it is often necessary to have multiple strategies + for generating code for a particular kind of syntax tree, strategies + that are usable for different combinations of parameters. Often I have + not tried to address all possible cases, but only the common ones or + only the ones that I have encountered. As a result, a new target may + require additional strategies. You will know if this happens because + the compiler will call `abort'. Fortunately, the new strategies can be + added in a machine-independent fashion, and will affect only the target + machines that need them. + +  + File: gccint.info, Node: Interface, Next: Languages, Prev: Portability, Up: Top + + Interfacing to GCC Output + ************************* + + GCC is normally configured to use the same function calling + convention normally in use on the target system. This is done with the + machine-description macros described (*note Target Macros::). + + However, returning of structure and union values is done differently + on some target machines. As a result, functions compiled with PCC + returning such types cannot be called from code compiled with GCC, and + vice versa. This does not cause trouble often because few Unix library + routines return structures or unions. + + GCC code returns structures and unions that are 1, 2, 4 or 8 bytes + long in the same registers used for `int' or `double' return values. + (GCC typically allocates variables of such types in registers also.) + Structures and unions of other sizes are returned by storing them into + an address passed by the caller (usually in a register). The + machine-description macros `STRUCT_VALUE' and `STRUCT_INCOMING_VALUE' + tell GCC where to pass this address. + + By contrast, PCC on most target machines returns structures and + unions of any size by copying the data into an area of static storage, + and then returning the address of that storage as if it were a pointer + value. The caller must copy the data from that memory area to the + place where the value is wanted. This is slower than the method used + by GCC, and fails to be reentrant. + + On some target machines, such as RISC machines and the 80386, the + standard system convention is to pass to the subroutine the address of + where to return the value. On these machines, GCC has been configured + to be compatible with the standard compiler, when this method is used. + It may not be compatible for structures of 1, 2, 4 or 8 bytes. + + GCC uses the system's standard convention for passing arguments. On + some machines, the first few arguments are passed in registers; in + others, all are passed on the stack. It would be possible to use + registers for argument passing on any machine, and this would probably + result in a significant speedup. But the result would be complete + incompatibility with code that follows the standard convention. So this + change is practical only if you are switching to GCC as the sole C + compiler for the system. We may implement register argument passing on + certain machines once we have a complete GNU system so that we can + compile the libraries with GCC. + + On some machines (particularly the Sparc), certain types of arguments + are passed "by invisible reference". This means that the value is + stored in memory, and the address of the memory location is passed to + the subroutine. + + If you use `longjmp', beware of automatic variables. ISO C says that + automatic variables that are not declared `volatile' have undefined + values after a `longjmp'. And this is all GCC promises to do, because + it is very difficult to restore register variables correctly, and one + of GCC's features is that it can put variables in registers without + your asking it to. + + If you want a variable to be unaltered by `longjmp', and you don't + want to write `volatile' because old C compilers don't accept it, just + take the address of the variable. If a variable's address is ever + taken, even if just to compute it and ignore it, then the variable + cannot go in a register: + + { + int careful; + &careful; + ... + } + + Code compiled with GCC may call certain library routines. Most of + them handle arithmetic for which there are no instructions. This + includes multiply and divide on some machines, and floating point + operations on any machine for which floating point support is disabled + with `-msoft-float'. Some standard parts of the C library, such as + `bcopy' or `memcpy', are also called automatically. The usual function + call interface is used for calling the library routines. + + Some of these routines can be defined in mostly machine-independent + C; they appear in `libgcc2.c'. Others must be hand-written in assembly + language for each processor. Wherever they are defined, they are + compiled into the support library, `libgcc.a', which is automatically + searched when you link programs with GCC. + +  + File: gccint.info, Node: Languages, Next: Source Tree, Prev: Interface, Up: Top + + Language Front Ends in GCC + ************************** + + The interface to front ends for languages in GCC, and in particular + the `tree' structure (*note Trees::), was initially designed for C, and + many aspects of it are still somewhat biased towards C and C-like + languages. It is, however, reasonably well suited to other procedural + languages, and front ends for many such languages have been written for + GCC. + + Writing a compiler as a front end for GCC, rather than compiling + directly to assembler or generating C code which is then compiled by + GCC, has several advantages: + + * GCC front ends benefit from the support for many different target + machines already present in GCC. + + * GCC front ends benefit from all the optimizations in GCC. Some of + these, such as alias analysis, may work better when GCC is + compiling directly from source code then when it is compiling from + generated C code. + + * Better debugging information is generated when compiling directly + from source code than when going via intermediate generated C code. + + Because of the advantages of writing a compiler as a GCC front end, + GCC front ends have also been created for languages very different from + those for which GCC was designed, such as the declarative + logic/functional language Mercury. For these reasons, it may also be + useful to implement compilers created for specialized purposes (for + example, as part of a research project) as GCC front ends. + +  + File: gccint.info, Node: Source Tree, Next: Passes, Prev: Languages, Up: Top + + Source Tree Structure and Build System + ************************************** + + This chapter describes the structure of the GCC source tree, and how + GCC is built. The user documentation for building and installing GCC + is in a separate manual (`http://gcc.gnu.org/install/'), with which it + is presumed that you are familiar. + + * Menu: + + * Configure Terms:: Configuration terminology and history. + * Top Level:: The top level source directory. + * gcc Directory:: The `gcc' subdirectory. + * Test Suites:: The GCC test suites. + +  + File: gccint.info, Node: Configure Terms, Next: Top Level, Up: Source Tree + + Configure Terms and History + =========================== + + The configure and build process has a long and colorful history, and + can be confusing to anyone who doesn't know why things are the way they + are. While there are other documents which describe the configuration + process in detail, here are a few things that everyone working on GCC + should know. + + There are three system names that the build knows about: the machine + you are building on ("build"), the machine that you are building for + ("host"), and the machine that GCC will produce code for ("target"). + When you configure GCC, you specify these with `--build=', `--host=', + and `--target='. + + Specifying the host without specifying the build should be avoided, + as `configure' may (and once did) assume that the host you specify is + also the build, which may not be true. + + If build, host, and target are all the same, this is called a + "native". If build and host are the same but target is different, this + is called a "cross". If build, host, and target are all different this + is called a "canadian" (for obscure reasons dealing with Canada's + political party and the background of the person working on the build + at that time). If host and target are the same, but build is + different, you are using a cross-compiler to build a native for a + different system. Some people call this a "host-x-host", "crossed + native", or "cross-built native". If build and target are the same, + but host is different, you are using a cross compiler to build a cross + compiler that produces code for the machine you're building on. This + is rare, so there is no common way of describing it (although I propose + calling it a "crossback"). + + If build and host are the same, the GCC you are building will also be + used to build the target libraries (like `libstdc++'). If build and + host are different, you must have already build and installed a cross + compiler that will be used to build the target libraries (if you + configured with `--target=foo-bar', this compiler will be called + `foo-bar-gcc'). + + In the case of target libraries, the machine you're building for is + the machine you specified with `--target'. So, build is the machine + you're building on (no change there), host is the machine you're + building for (the target libraries are built for the target, so host is + the target you specified), and target doesn't apply (because you're not + building a compiler, you're building libraries). The configure/make + process will adjust these variables as needed. It also sets + `$with_cross_host' to the original `--host' value in case you need it. + + The `libiberty' support library is built up to three times: once for + the host, once for the target (even if they are the same), and once for + the build if build and host are different. This allows it to be used + by all programs which are generated in the course of the build process. + +  + File: gccint.info, Node: Top Level, Next: gcc Directory, Prev: Configure Terms, Up: Source Tree + + Top Level Source Directory + ========================== + + The top level source directory in a GCC distribution contains several + files and directories that are shared with other software distributions + such as that of GNU Binutils. It also contains several subdirectories + that contain parts of GCC and its runtime libraries: + + `boehm-gc' + The Boehm conservative garbage collector, used as part of the Java + runtime library. + + `contrib' + Contributed scripts that may be found useful in conjunction with + GCC. One of these, `contrib/texi2pod.pl', is used to generate man + pages from Texinfo manuals as part of the GCC build process. + + `fastjar' + An implementation of the `jar' command, used with the Java front + end. + + `gcc' + The main sources of GCC itself (except for runtime libraries), + including optimizers, support for different target architectures, + language front ends, and test suites. *Note The `gcc' + Subdirectory: gcc Directory, for details. + + `include' + Headers for the `libiberty' library. + + `libf2c' + The Fortran runtime library. + + `libffi' + The `libffi' library, used as part of the Java runtime library. + + `libiberty' + The `libiberty' library, used for portability and for some + generally useful data structures and algorithms. *Note + Introduction: (libiberty)Top, for more information about this + library. + + `libjava' + The Java runtime library. + + `libobjc' + The Objective-C runtime library. + + `libstdc++-v3' + The C++ runtime library. + + `maintainer-scripts' + Scripts used by the `gccadmin' account on `gcc.gnu.org'. + + `zlib' + The `zlib' compression library, used by the Java front end and as + part of the Java runtime library. + + The build system in the top level directory, including how recursion + into subdirectories works and how building runtime libraries for + multilibs is handled, is documented in a separate manual, included with + GNU Binutils. *Note GNU configure and build system: (configure)Top, + for details. + +  + File: gccint.info, Node: gcc Directory, Next: Test Suites, Prev: Top Level, Up: Source Tree + + The `gcc' Subdirectory + ====================== + + The `gcc' directory contains many files that are part of the C + sources of GCC, other files used as part of the configuration and build + process, and subdirectories including documentation and a test suite. + The files that are sources of GCC are documented in a separate chapter. + *Note Passes and Files of the Compiler: Passes. + + * Menu: + + * Subdirectories:: Subdirectories of `gcc'. + * Configuration:: The configuration process, and the files it uses. + * Build:: The build system in the `gcc' directory. + * Makefile:: Targets in `gcc/Makefile'. + * Library Files:: Library source files and headers under `gcc/'. + * Headers:: Headers installed by GCC. + * Documentation:: Building documentation in GCC. + * Front End:: Anatomy of a language front end. + * Back End:: Anatomy of a target back end. + +  + File: gccint.info, Node: Subdirectories, Next: Configuration, Up: gcc Directory + + Subdirectories of `gcc' + ----------------------- + + The `gcc' directory contains the following subdirectories: + + `LANGUAGE' + Subdirectories for various languages. Directories containing a + file `config-lang.in' are language subdirectories. The contents of + the subdirectories `cp' (for C++) and `objc' (for Objective-C) are + documented in this manual (*note Passes and Files of the Compiler: + Passes.); those for other languages are not. *Note Anatomy of a + Language Front End: Front End, for details of the files in these + directories. + + `config' + Configuration files for supported architectures and operating + systems. *Note Anatomy of a Target Back End: Back End, for + details of the files in thie directory. + + `doc' + Texinfo documentation for GCC, together with automatically + generated man pages and support for converting the installation + manual to HTML. *Note Documentation::. + + `fixinc' + The support for fixing system headers to work with GCC. See + `fixinc/README' for more information. The headers fixed by this + mechanism are installed in `LIBSUBDIR/include'. Along with those + headers, `README-fixinc' is also installed, as + `LIBSUBDIR/include/README'. + + `ginclude' + System headers installed by GCC, mainly those required by the C + standard of freestanding implementations. *Note Headers Installed + by GCC: Headers, for details of when these and other headers are + installed. + + `intl' + GNU `libintl', from GNU `gettext', for systems which do not + include it in libc. Properly, this directory should be at top + level, parallel to the `gcc' directory. + + `po' + Message catalogs with translations of messages produced by GCC into + various languages, `LANGUAGE.po'. This directory also contains + `gcc.pot', the template for these message catalogues, `exgettext', + a wrapper around `gettext' to extract the messages from the GCC + sources and create `gcc.pot', which is run by `make gcc.pot', and + `EXCLUDES', a list of files from which messages should not be + extracted. + + `testsuite' + The GCC test suites (except for those for runtime libraries). + *Note Test Suites::. + +  + File: gccint.info, Node: Configuration, Next: Build, Prev: Subdirectories, Up: gcc Directory + + Configuration in the `gcc' Directory + ------------------------------------ + + The `gcc' directory is configured with an Autoconf-generated script + `configure'. The `configure' script is generated from `configure.in' + and `aclocal.m4'. From the files `configure.in' and `acconfig.h', + Autoheader generates the file `config.in'. The file `cstamp-h.in' is + used as a timestamp. + + * Menu: + + * Config Fragments:: Scripts used by `configure'. + * System Config:: The `config.gcc' file. + * Configuration Files:: Files created by running `configure'. + +  + File: gccint.info, Node: Config Fragments, Next: System Config, Up: Configuration + + Scripts Used by `configure' + ........................... + + `configure' uses some other scripts to help in its work: + + * The standard GNU `config.sub' and `config.guess' files, kept in + the top level directory, are used. FIXME: when is the + `config.guess' file in the `gcc' directory (that just calls the + top level one) used? + + * The file `config.gcc' is used to handle configuration specific to + the particular build, host or target machine. (In general, this + should only be used for features that cannot reasonably be tested + in Autoconf feature tests.) *Note The `config.gcc' File: System + Config, for details of the contents of this file. + + * Each language subdirectory has a file `LANGUAGE/config-lang.in' + that is used for front-end-specific configuration. *Note The + Front End `config-lang.in' File: Front End Config, for details of + this file. + + * A helper script `configure.frag' is used as part of creating the + output of `configure'. + +  + File: gccint.info, Node: System Config, Next: Configuration Files, Prev: Config Fragments, Up: Configuration + + The `config.gcc' File + ..................... + + FIXME: document the contents of this file, and what variables should + be set to control build, host and target configuration. + +  + File: gccint.info, Node: Configuration Files, Prev: System Config, Up: Configuration + + Files Created by `configure' + ............................ + + Here we spell out what files will be set up by `configure' in the + `gcc' directory. Some other files are created as temporary files in + the configuration process, and are not used in the subsequent build; + these are not documented. + + * `Makefile' is constructed from `Makefile.in', together with the + host and target fragments (*note Makefile Fragments: Fragments.) + `t-TARGET' and `x-HOST' from `config', if any, and language + Makefile fragments `LANGUAGE/Make-lang.in'. + + * `auto-host.h' contains information about the host machine + determined by `configure'. If the host machine is different from + the build machine, then `auto-build.h' is also created, containing + such information about the build machine. + + * `config.status' is a script that may be run to recreate the + current configuration. + + * `configargs.h' is a header containing details of the arguments + passed to `configure' to configure GCC, and of the thread model + used. + + * `cstamp-h' is used as a timestamp. + + * `fixinc/Makefile' is constructed from `fixinc/Makefile.in'. + + * `gccbug', a script for reporting bugs in GCC, is constructed from + `gccbug.in'. + + * `intl/Makefile' is constructed from `intl/Makefile.in'. + + * `mklibgcc', a shell script to create a Makefile to build libgcc, + is constructed from `mklibgcc.in'. + + * If a language `config-lang.in' file (*note The Front End + `config-lang.in' File: Front End Config.) sets `outputs', then the + files listed in `outputs' there are also generated. + + The following configuration headers are created from the Makefile, + using `mkconfig.sh', rather than directly by `configure'. `config.h', + `hconfig.h' and `tconfig.h' all contain the `xm-MACHINE.h' header, if + any, appropriate to the host, build and target machines respectively, + the configuration headers for the target, and some definitions; for the + host and build machines, these include the autoconfigured headers + generated by `configure'. The other configuration headers are + determined by `config.gcc'. They also contain the typedefs for `rtx', + `rtvec' and `tree'. + + * `config.h', for use in programs that run on the host machine. + + * `hconfig.h', for use in programs that run on the build machine. + + * `tconfig.h', for use in programs and libraries for the target + machine. + + * `tm_p.h', which includes the header `MACHINE-protos.h' that + contains prototypes for functions in the target `.c' file. FIXME: + why is such a separate header necessary? + +  + File: gccint.info, Node: Build, Next: Makefile, Prev: Configuration, Up: gcc Directory + + Build System in the `gcc' Directory + ----------------------------------- + + FIXME: describe the build system, including what is built in what + stages. Also list the various source files that are used in the build + process but aren't source files of GCC itself and so aren't documented + below (*note Passes::). + +  + File: gccint.info, Node: Makefile, Next: Library Files, Prev: Build, Up: gcc Directory + + Makefile Targets + ---------------- + + `all' + This is the default target. Depending on what your + build/host/target configuration is, it coordinates all the things + that need to be built. + + `doc' + Produce info-formatted documentation. Also, `make dvi' is + available for DVI-formatted documentation, and `make + generated-manpages' to generate man pages. + + `mostlyclean' + Delete the files made while building the compiler. + + `clean' + That, and all the other files built by `make all'. + + `distclean' + That, and all the files created by `configure'. + + `extraclean' + That, and any temporary or intermediate files, like emacs backup + files. + + `maintainer-clean' + Distclean plus any file that can be generated from other files. + Note that additional tools may be required beyond what is normally + needed to build gcc. + + `install' + Installs gcc. + + `uninstall' + Deletes installed files. + + `check' + Run the testsuite. This creates a `testsuite' subdirectory that + has various `.sum' and `.log' files containing the results of the + testing. You can run subsets with, for example, `make check-gcc'. + You can specify specific tests by setting RUNTESTFLAGS to be the + name of the `.exp' file, optionally followed by (for some tests) + an equals and a file wildcard, like: + + make check-gcc RUNTESTFLAGS="execute.exp=19980413-*" + + Note that running the testsuite may require additional tools be + installed, such as TCL or dejagnu. + + `bootstrap' + Builds gcc three times--once with the native compiler, once with + the native-built compiler it just built, and once with the + compiler it built the second time. In theory, the last two should + produce the same results, which `make compare' can check. Each + step of this process is called a "stage", and the results of each + stage N (N = 1...3) are copied to a subdirectory `stageN/'. + + `bootstrap-lean' + Like `bootstrap', except that the various stages are removed once + they're no longer needed. This saves disk space. + + `bubblestrap' + Once bootstrapped, this incrementally rebuilds each of the three + stages, one at a time. It does this by "bubbling" the stages up + from their subdirectories, rebuilding them, and copying them back + to their subdirectories. This will allow you to, for example, + quickly rebuild a bootstrapped compiler after changing the + sources, without having to do a full bootstrap. + + `quickstrap' + Rebuilds the most recently built stage. Since each stage requires + special invocation, using this target means you don't have to keep + track of which stage you're on or what invocation that stage needs. + + `cleanstrap' + Removed everything (`make clean') and rebuilds (`make bootstrap'). + + `stageN (N = 1...4)' + For each stage, moves the appropriate files to the `stageN' + subdirectory. + + `unstageN (N = 1...4)' + Undoes the corresponding `stageN'. + + `restageN (N = 1...4)' + Undoes the corresponding `stageN' and rebuilds it with the + appropriate flags. + + `compare' + Compares the results of stages 2 and 3. This ensures that the + compiler is running properly, since it should produce the same + object files regardless of how it itself was compiled. + + +  + File: gccint.info, Node: Library Files, Next: Headers, Prev: Makefile, Up: gcc Directory + + Library Source Files and Headers under the `gcc' Directory + ---------------------------------------------------------- + + FIXME: list here, with explanation, all the C source files and + headers under the `gcc' directory that aren't built into the GCC + executable but rather are part of runtime libraries and object files, + such as `crtstuff.c' and `unwind-dw2.c'. *Note Headers Installed by + GCC: Headers, for more information about the `ginclude' directory. + +  + File: gccint.info, Node: Headers, Next: Documentation, Prev: Library Files, Up: gcc Directory + + Headers Installed by GCC + ------------------------ + + In general, GCC expects the system C library to provide most of the + headers to be used with it. However, GCC will fix those headers if + necessary to make them work with GCC, and will install some headers + required of freestanding implementations. These headers are installed + in `LIBSUBDIR/include'. Headers for non-C runtime libraries are also + installed by GCC; these are not documented here. (FIXME: document them + somewhere.) + + Several of the headers GCC installs are in the `ginclude' directory. + These headers, `iso646.h', `stdarg.h', `stdbool.h', `stddef.h' and + `varargs.h', are installed in `LIBSUBDIR/include', unless the target + Makefile fragment (*note Target Fragment::) overrides this by setting + `USER_H'. + + In addition to these headers and those generated by fixing system + headers to work with GCC, some other headers may also be installed in + `LIBSUBDIR/include'. `config.gcc' may set `extra_headers'; this + specifies additional headers under `config' to be installed on some + systems. GCC normally installs a `' file; these are kept as + `config/float-FORMAT.h', where FORMAT is specified by a `float_format' + setting in `config.gcc', and a setting `float_format=none' disables + installation of this header. GCC also installs its own version of + `'; this is generated from `glimits.h', together with + `limitx.h' and `limity.h' if the system also has its own version of + `'. (GCC provides its own header because it is required of + ISO C freestanding implementations, but needs to include the system + header from its own header as well because other standards such as + POSIX specify additional values to be defined in `'.) The + system's `' header is used via + `LIBSUBDIR/include/syslimits.h', which is copied from `gsyslimits.h' if + it does not need fixing to work with GCC; if it needs fixing, + `syslimits.h' is the fixed copy. + +  + File: gccint.info, Node: Documentation, Next: Front End, Prev: Headers, Up: gcc Directory + + Building Documentation + ---------------------- + + The main GCC documentation is in the form of manuals in Texinfo + format. These are installed in Info format, and DVI versions may be + generated by `make dvi'. In addition, some man pages are generated + from the Texinfo manuals, there are some other text files with + miscellaneous documentation, and runtime libraries have their own + documentation outside the `gcc' directory. FIXME: document the + documentation for runtime libraries somewhere. + + * Menu: + + * Texinfo Manuals:: GCC manuals in Texinfo format. + * Man Page Generation:: Generating man pages from Texinfo manuals. + * Miscellaneous Docs:: Miscellaneous text files with documentation. + +  + File: gccint.info, Node: Texinfo Manuals, Next: Man Page Generation, Up: Documentation + + Texinfo Manuals + ............... + + The manuals for GCC as a whole, and the C and C++ front ends, are in + files `doc/*.texi'. Other front ends have their own manuals in files + `LANGUAGE/*.texi'. Common files `doc/include/*.texi' are provided + which may be included in multiple manuals; the following files are in + `doc/include': + + `fdl.texi' + The GNU Free Documentation License. + + `funding.texi' + The section "Funding Free Software". + + `gcc-common.texi' + Common definitions for manuals. + + `gpl.texi' + The GNU General Public License. + + `texinfo.tex' + A copy of `texinfo.tex' known to work with the GCC manuals. + + DVI formatted manuals are generated by `make dvi', which uses + `texi2dvi' (via the Makefile macro `$(TEXI2DVI)'). Info manuals are + generated by `make info' (which is run as part of a bootstrap); this + generates the manuals in the source directory, using `makeinfo' via the + Makefile macro `$(MAKEINFO)', and they are included in release + distributions. + + Manuals are also provided on the GCC web site, in both HTML and + PostScript forms. This is done via the script + `maintainer-scripts/update_web_docs'. Each manual to be provided + online must be listed in the definition of `MANUALS' in that file; a + file `NAME.texi' must only appear once in the source tree, and the + output manual must have the same name as the source file. (However, + other Texinfo files, included in manuals but not themselves the root + files of manuals, may have names that appear more than once in the + source tree.) The manual file `NAME.texi' should only include other + files in its own directory or in `doc/include'. HTML manuals will be + generated by `makeinfo --html' and PostScript manuals by `texi2dvi' and + `dvips'. All Texinfo files that are parts of manuals must be checked + into CVS, even if they are generated files, for the generation of + online manuals to work. + + The installation manual, `doc/install.texi', is also provided on the + GCC web site. The HTML version is generated by the script + `doc/install.texi2html'. + +  + File: gccint.info, Node: Man Page Generation, Next: Miscellaneous Docs, Prev: Texinfo Manuals, Up: Documentation + + Man Page Generation + ................... + + Because of user demand, in addition to full Texinfo manuals, man + pages are provided which contain extracts from those manuals. These man + pages are generated from the Texinfo manuals using + `contrib/texi2pod.pl' and `pod2man'. (The man page for `g++', + `cp/g++.1', just contains a `.so' reference to `gcc.1', but all the + other man pages are generated from Texinfo manuals.) + + Because many systems may not have the necessary tools installed to + generate the man pages, they are only generated if the `configure' + script detects that recent enough tools are installed, and the + Makefiles allow generating man pages to fail without aborting the + build. Man pages are also included in release distributions. They are + generated in the source directory. + + Magic comments in Texinfo files starting `@c man' control what parts + of a Texinfo file go into a man page. Only a subset of Texinfo is + supported by `texi2pod.pl', and it may be necessary to add support for + more Texinfo features to this script when generating new man pages. To + improve the man page output, some special Texinfo macros are provided + in `doc/include/gcc-common.texi' which `texi2pod.pl' understands: + + `@gcctabopt' + Use in the form `@table @gcctabopt' for tables of options, where + for printed output the effect of `@code' is better than that of + `@option' but for man page output a different effect is wanted. + + `@gccoptlist' + Use for summary lists of options in manuals. + + `@gol' + Use at the end of each line inside `@gccoptlist'. This is + necessary to avoid problems with differences in how the + `@gccoptlist' macro is handled by different Texinfo formatters. + + FIXME: describe the `texi2pod.pl' input language and magic comments + in more detail. + +  + File: gccint.info, Node: Miscellaneous Docs, Prev: Man Page Generation, Up: Documentation + + Miscellaneous Documentation + ........................... + + In addition to the formal documentation that is installed by GCC, + there are several other text files with miscellaneous documentation: + + `ABOUT-GCC-NLS' + Notes on GCC's Native Language Support. FIXME: this should be + part of this manual rather than a separate file. + + `ABOUT-NLS' + Notes on the Free Translation Project. + + `COPYING' + The GNU General Public License. + + `COPYING.LIB' + The GNU Lesser General Public License. + + `*ChangeLog*' + `*/ChangeLog*' + Change log files for various parts of GCC. + + `LANGUAGES' + Details of a few changes to the GCC front-end interface. FIXME: + the information in this file should be part of general + documentation of the front-end interface in this manual. + + `ONEWS' + Information about new features in old versions of GCC. (For recent + versions, the information is on the GCC web site.) + + `README.Portability' + Information about portability issues when writing code in GCC. + FIXME: why isn't this part of this manual or of the GCC Coding + Conventions? + + `SERVICE' + A pointer to the GNU Service Directory. + + FIXME: document such files in subdirectories, at least `config', + `cp', `objc', `testsuite'. + +  + File: gccint.info, Node: Front End, Next: Back End, Prev: Documentation, Up: gcc Directory + + Anatomy of a Language Front End + ------------------------------- + + A front end for a language in GCC has the following parts: + + * A directory `LANGUAGE' under `gcc' containing source files for + that front end. *Note The Front End `LANGUAGE' Directory: Front + End Directory, for details. + + * A mention of the language in the list of supported languages in + `gcc/doc/install.texi'. + + * Details of contributors to that front end in + `gcc/doc/contrib.texi'. If the details are in that front end's + own manual then there should be a link to that manual's list in + `contrib.texi'. + + * Information about support for that language in + `gcc/doc/frontends.texi'. + + * Information about standards for that language, and the front end's + support for them, in `gcc/doc/standards.texi'. This may be a link + to such information in the front end's own manual. + + * Details of source file suffixes for that language and `-x LANG' + options supported, in `gcc/doc/invoke.texi'. + + * Entries in `default_compilers' in `gcc.c' for source file suffixes + for that language. + + * Preferably test suites, which may be under `gcc/testsuite' or + runtime library directories. FIXME: document somewhere how to + write test suite harnesses. + + * Probably a runtime library for the language, outside the `gcc' + directory. FIXME: document this further. + + * Details of the directories of any runtime libraries in + `gcc/doc/sourcebuild.texi'. + + If the front end is added to the official GCC CVS repository, the + following are also necessary: + + * At least one GNATS category for bugs in that front end and runtime + libraries. This category needs to be mentioned in + `gcc/gccbug.in', and in `gnats.html' on the GCC web site, as well + as being added to the GNATS database. + + * Normally, one or more maintainers of that front end listed in + `MAINTAINERS'. + + * Mentions on the GCC web site in `index.html' and `frontends.html', + with any relevant links on `readings.html'. (Front ends that are + not an official part of GCC may also be listed on + `frontends.html', with relevant links.) + + * A news item on `index.html', and possibly an announcement on the + mailing list. + + * The front end's manuals should be mentioned in + `maintainer-scripts/update_web_docs' (*note Texinfo Manuals::) and + the online manuals should be linked to from + `onlinedocs/index.html'. + + * Any old releases or CVS repositories of the front end, before its + inclusion in GCC, should be made available on the GCC FTP site + `ftp://gcc.gnu.org/pub/gcc/old-releases/'. + + * The release and snapshot script `maintainer-scripts/gcc_release' + should be updated to generate appropriate tarballs for this front + end. + + * If this front end includes its own version files that include the + current date, `maintainer-scripts/update_version' should be + updated accordingly. + + * `CVSROOT/modules' in the GCC CVS repository should be updated. + + * Menu: + + * Front End Directory:: The front end `LANGUAGE' directory. + * Front End Config:: The front end `config-lang.in' file. + +  + File: gccint.info, Node: Front End Directory, Next: Front End Config, Up: Front End + + The Front End `LANGUAGE' Directory + .................................. + + A front end `LANGUAGE' directory contains the source files of that + front end (but not of any runtime libraries, which should be outside + the `gcc' directory). This includes documentation, and possibly some + subsidiary programs build alongside the front end. Certain files are + special and other parts of the compiler depend on their names: + + `config-lang.in' + This file is required in all language subdirectories. *Note The + Front End `config-lang.in' File: Front End Config, for details of + its contents + + `Make-lang.in' + This file is required in all language subdirectories. It contains + targets `LANG.HOOK' (where `LANG' is the setting of `language' in + `config-lang.in') for the following values of `HOOK', and any + other Makefile rules required to build those targets (which may if + necessary use other Makefiles specified in `outputs' in + `config-lang.in', although this is deprecated). + + `all.build' + `all.cross' + `start.encap' + `rest.encap' + FIXME: exactly what goes in each of these targets? + + `info' + Build info documentation for the front end, in the source + directory. This target is only called by `make bootstrap' if + a suitable version of `makeinfo' is available, so does not + need to check for this, and should fail if an error occurs. + + `dvi' + Build DVI documentation for the front end, in the build + directory. This should be done using `$(TEXI2DVI)', with + appropriate `-I' arguments pointing to directories of + included files. + + `generated-manpages' + Build generated man pages for the front end from Texinfo + manuals (*note Man Page Generation::), in the source + directory. This target is only called if the necessary tools + are available, but should ignore errors so as not to stop the + build if errors occur; man pages are optional and the tools + involved may be installed in a broken way. + + `install-normal' + FIXME: what is this target for? + + `install-common' + Install everything that is part of the front end, apart from + the compiler executables listed in `compilers' in + `config-lang.in' that are installed in `LIBSUBDIR' by the + main `Makefile'. + + `install-info' + Install info documentation for the front end, if it is + present in the source directory. (It may not be present if a + suitable version of `makeinfo' was not installed.) This + target should run the command `install-info' to update the + info directory, but should ignore errors when running that + command. + + `install-man' + Install man pages for the front end. This target should + ignore errors. + + `uninstall' + Uninstall files installed by installing the compiler. This is + currently documented not to be supported, so the hook need + not do anything. + + `mostlyclean' + `clean' + `distclean' + `extraclean' + `maintainer-clean' + Except for `extraclean', the language parts of the standard + GNU `*clean' targets. *Note Standard Targets for Users: + (standards)Standard Targets, for details of the standard + targets. `extraclean' does `distclean' and also deletes + anything likely to be found in the source directory that + shouldn't be in the distribution. For GCC, + `maintainer-clean' should delete all generated files in the + source directory that are not checked into CVS, but should + not delete anything checked into CVS. + + `stage1' + `stage2' + `stage3' + `stage4' + Move to the stage directory files not included in + `stagestuff' in `config-lang.in' or otherwise moved by the + main `Makefile'. + + `lang-options.h' + This file provides entries for `documented_lang_options' in + `toplev.c' describing command-line options the front end accepts + for `--help' output. + + `lang-specs.h' + This file provides entries for `default_compilers' in `gcc.c' + which override the default of giving an error that a compiler for + that language is not installed. + + `LANGUAGE-tree.def' + This file, which need not exist, defines any language-specific tree + codes. + +  + File: gccint.info, Node: Front End Config, Prev: Front End Directory, Up: Front End + + The Front End `config-lang.in' File + ................................... + + Each language subdirectory contains a `config-lang.in' file. This + file is a shell script that may define some variables describing the + language: + + `language' + This definition must be present, and gives the name of the language + for some purposes such as arguments to `--enable-languages'. + + `lang_requires' + If defined, this variable lists (space-separated) language front + ends other than C that this front end requires to be enabled (with + the names given being their `language' settings). For example, the + Java front end depends on the C++ front end, so sets + `lang_requires=c++'. + + `target_libs' + If defined, this variable lists (space-separated) targets in the + top level `Makefile' to build the runtime libraries for this + language, such as `target-libobjc'. + + `lang_dirs' + If defined, this variable lists (space-separated) top level + directories (parallel to `gcc'), apart from the runtime libraries, + that should not be configured if this front end is not built. + + `build_by_default' + If defined to `no', this language front end is not built unless + enabled in a `--enable-languages' argument. Otherwise, front ends + are built by default, subject to any special logic in + `configure.in' (as is present to disable the Ada front end if the + Ada compiler is not already installed). + + `boot_language' + If defined to `yes', this front end is built in stage 1 of the + bootstrap. This is only relevant to front ends written in their + own languages. + + `compilers' + If defined, a space-separated list of compiler executables that + should be installed in `LIBSUBDIR'. The names here will each end + with `\$(exeext)'. + + `stagestuff' + If defined, a space-separated list of files that should be moved to + the `stageN' directories in each stage of bootstrap. + + `outputs' + If defined, a space-separated list of files that should be + generated by `configure' substituting values in them. This + mechanism can be used to create a file `LANGUAGE/Makefile' from + `LANGUAGE/Makefile.in', but this is deprecated, building + everything from the single `gcc/Makefile' is preferred. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-10 gcc-3.2.3/gcc/doc/gccint.info-10 *** gcc-3.2.2/gcc/doc/gccint.info-10 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-10 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1058 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Standard Names, Next: Pattern Ordering, Prev: Constraints, Up: Machine Desc + + Standard Pattern Names For Generation + ===================================== + + Here is a table of the instruction names that are meaningful in the + RTL generation pass of the compiler. Giving one of these names to an + instruction pattern tells the RTL generation pass that it can use the + pattern to accomplish a certain task. + + `movM' + Here M stands for a two-letter machine mode name, in lower case. + This instruction pattern moves data with that machine mode from + operand 1 to operand 0. For example, `movsi' moves full-word data. + + If operand 0 is a `subreg' with mode M of a register whose own + mode is wider than M, the effect of this instruction is to store + the specified value in the part of the register that corresponds + to mode M. Bits outside of M, but which are within the same + target word as the `subreg' are undefined. Bits which are outside + the target word are left unchanged. + + This class of patterns is special in several ways. First of all, + each of these names up to and including full word size _must_ be + defined, because there is no other way to copy a datum from one + place to another. If there are patterns accepting operands in + larger modes, `movM' must be defined for integer modes of those + sizes. + + Second, these patterns are not used solely in the RTL generation + pass. Even the reload pass can generate move insns to copy values + from stack slots into temporary registers. When it does so, one + of the operands is a hard register and the other is an operand + that can need to be reloaded into a register. + + Therefore, when given such a pair of operands, the pattern must + generate RTL which needs no reloading and needs no temporary + registers--no registers other than the operands. For example, if + you support the pattern with a `define_expand', then in such a + case the `define_expand' mustn't call `force_reg' or any other such + function which might generate new pseudo registers. + + This requirement exists even for subword modes on a RISC machine + where fetching those modes from memory normally requires several + insns and some temporary registers. + + During reload a memory reference with an invalid address may be + passed as an operand. Such an address will be replaced with a + valid address later in the reload pass. In this case, nothing may + be done with the address except to use it as it stands. If it is + copied, it will not be replaced with a valid address. No attempt + should be made to make such an address into a valid address and no + routine (such as `change_address') that will do so may be called. + Note that `general_operand' will fail when applied to such an + address. + + The global variable `reload_in_progress' (which must be explicitly + declared if required) can be used to determine whether such special + handling is required. + + The variety of operands that have reloads depends on the rest of + the machine description, but typically on a RISC machine these can + only be pseudo registers that did not get hard registers, while on + other machines explicit memory references will get optional + reloads. + + If a scratch register is required to move an object to or from + memory, it can be allocated using `gen_reg_rtx' prior to life + analysis. + + If there are cases which need scratch registers during or after + reload, you must define `SECONDARY_INPUT_RELOAD_CLASS' and/or + `SECONDARY_OUTPUT_RELOAD_CLASS' to detect them, and provide + patterns `reload_inM' or `reload_outM' to handle them. *Note + Register Classes::. + + The global variable `no_new_pseudos' can be used to determine if it + is unsafe to create new pseudo registers. If this variable is + nonzero, then it is unsafe to call `gen_reg_rtx' to allocate a new + pseudo. + + The constraints on a `movM' must permit moving any hard register + to any other hard register provided that `HARD_REGNO_MODE_OK' + permits mode M in both registers and `REGISTER_MOVE_COST' applied + to their classes returns a value of 2. + + It is obligatory to support floating point `movM' instructions + into and out of any registers that can hold fixed point values, + because unions and structures (which have modes `SImode' or + `DImode') can be in those registers and they may have floating + point members. + + There may also be a need to support fixed point `movM' + instructions in and out of floating point registers. + Unfortunately, I have forgotten why this was so, and I don't know + whether it is still true. If `HARD_REGNO_MODE_OK' rejects fixed + point values in floating point registers, then the constraints of + the fixed point `movM' instructions must be designed to avoid ever + trying to reload into a floating point register. + + `reload_inM' + `reload_outM' + Like `movM', but used when a scratch register is required to move + between operand 0 and operand 1. Operand 2 describes the scratch + register. See the discussion of the `SECONDARY_RELOAD_CLASS' + macro in *note Register Classes::. + + There are special restrictions on the form of the `match_operand's + used in these patterns. First, only the predicate for the reload + operand is examined, i.e., `reload_in' examines operand 1, but not + the predicates for operand 0 or 2. Second, there may be only one + alternative in the constraints. Third, only a single register + class letter may be used for the constraint; subsequent constraint + letters are ignored. As a special exception, an empty constraint + string matches the `ALL_REGS' register class. This may relieve + ports of the burden of defining an `ALL_REGS' constraint letter + just for these patterns. + + `movstrictM' + Like `movM' except that if operand 0 is a `subreg' with mode M of + a register whose natural mode is wider, the `movstrictM' + instruction is guaranteed not to alter any of the register except + the part which belongs to mode M. + + `load_multiple' + Load several consecutive memory locations into consecutive + registers. Operand 0 is the first of the consecutive registers, + operand 1 is the first memory location, and operand 2 is a + constant: the number of consecutive registers. + + Define this only if the target machine really has such an + instruction; do not define this if the most efficient way of + loading consecutive registers from memory is to do them one at a + time. + + On some machines, there are restrictions as to which consecutive + registers can be stored into memory, such as particular starting or + ending register numbers or only a range of valid counts. For those + machines, use a `define_expand' (*note Expander Definitions::) and + make the pattern fail if the restrictions are not met. + + Write the generated insn as a `parallel' with elements being a + `set' of one register from the appropriate memory location (you may + also need `use' or `clobber' elements). Use a `match_parallel' + (*note RTL Template::) to recognize the insn. See `a29k.md' and + `rs6000.md' for examples of the use of this insn pattern. + + `store_multiple' + Similar to `load_multiple', but store several consecutive registers + into consecutive memory locations. Operand 0 is the first of the + consecutive memory locations, operand 1 is the first register, and + operand 2 is a constant: the number of consecutive registers. + + `pushM' + Output an push instruction. Operand 0 is value to push. Used + only when `PUSH_ROUNDING' is defined. For historical reason, this + pattern may be missing and in such case an `mov' expander is used + instead, with a `MEM' expression forming the push operation. The + `mov' expander method is deprecated. + + `addM3' + Add operand 2 and operand 1, storing the result in operand 0. All + operands must have mode M. This can be used even on two-address + machines, by means of constraints requiring operands 1 and 0 to be + the same location. + + `subM3', `mulM3' + `divM3', `udivM3', `modM3', `umodM3' + `sminM3', `smaxM3', `uminM3', `umaxM3' + `andM3', `iorM3', `xorM3' + Similar, for other arithmetic operations. + + `minM3', `maxM3' + Floating point min and max operations. If both operands are zeros, + or if either operand is NaN, then it is unspecified which of the + two operands is returned as the result. + + `mulhisi3' + Multiply operands 1 and 2, which have mode `HImode', and store a + `SImode' product in operand 0. + + `mulqihi3', `mulsidi3' + Similar widening-multiplication instructions of other widths. + + `umulqihi3', `umulhisi3', `umulsidi3' + Similar widening-multiplication instructions that do unsigned + multiplication. + + `smulM3_highpart' + Perform a signed multiplication of operands 1 and 2, which have + mode M, and store the most significant half of the product in + operand 0. The least significant half of the product is discarded. + + `umulM3_highpart' + Similar, but the multiplication is unsigned. + + `divmodM4' + Signed division that produces both a quotient and a remainder. + Operand 1 is divided by operand 2 to produce a quotient stored in + operand 0 and a remainder stored in operand 3. + + For machines with an instruction that produces both a quotient and + a remainder, provide a pattern for `divmodM4' but do not provide + patterns for `divM3' and `modM3'. This allows optimization in the + relatively common case when both the quotient and remainder are + computed. + + If an instruction that just produces a quotient or just a remainder + exists and is more efficient than the instruction that produces + both, write the output routine of `divmodM4' to call + `find_reg_note' and look for a `REG_UNUSED' note on the quotient + or remainder and generate the appropriate instruction. + + `udivmodM4' + Similar, but does unsigned division. + + `ashlM3' + Arithmetic-shift operand 1 left by a number of bits specified by + operand 2, and store the result in operand 0. Here M is the mode + of operand 0 and operand 1; operand 2's mode is specified by the + instruction pattern, and the compiler will convert the operand to + that mode before generating the instruction. + + `ashrM3', `lshrM3', `rotlM3', `rotrM3' + Other shift and rotate instructions, analogous to the `ashlM3' + instructions. + + `negM2' + Negate operand 1 and store the result in operand 0. + + `absM2' + Store the absolute value of operand 1 into operand 0. + + `sqrtM2' + Store the square root of operand 1 into operand 0. + + The `sqrt' built-in function of C always uses the mode which + corresponds to the C data type `double'. + + `ffsM2' + Store into operand 0 one plus the index of the least significant + 1-bit of operand 1. If operand 1 is zero, store zero. M is the + mode of operand 0; operand 1's mode is specified by the instruction + pattern, and the compiler will convert the operand to that mode + before generating the instruction. + + The `ffs' built-in function of C always uses the mode which + corresponds to the C data type `int'. + + `one_cmplM2' + Store the bitwise-complement of operand 1 into operand 0. + + `cmpM' + Compare operand 0 and operand 1, and set the condition codes. The + RTL pattern should look like this: + + (set (cc0) (compare (match_operand:M 0 ...) + (match_operand:M 1 ...))) + + `tstM' + Compare operand 0 against zero, and set the condition codes. The + RTL pattern should look like this: + + (set (cc0) (match_operand:M 0 ...)) + + `tstM' patterns should not be defined for machines that do not use + `(cc0)'. Doing so would confuse the optimizer since it would no + longer be clear which `set' operations were comparisons. The + `cmpM' patterns should be used instead. + + `movstrM' + Block move instruction. The addresses of the destination and + source strings are the first two operands, and both are in mode + `Pmode'. + + The number of bytes to move is the third operand, in mode M. + Usually, you specify `word_mode' for M. However, if you can + generate better code knowing the range of valid lengths is smaller + than those representable in a full word, you should provide a + pattern with a mode corresponding to the range of values you can + handle efficiently (e.g., `QImode' for values in the range 0-127; + note we avoid numbers that appear negative) and also a pattern + with `word_mode'. + + The fourth operand is the known shared alignment of the source and + destination, in the form of a `const_int' rtx. Thus, if the + compiler knows that both source and destination are word-aligned, + it may provide the value 4 for this operand. + + Descriptions of multiple `movstrM' patterns can only be beneficial + if the patterns for smaller modes have fewer restrictions on their + first, second and fourth operands. Note that the mode M in + `movstrM' does not impose any restriction on the mode of + individually moved data units in the block. + + These patterns need not give special consideration to the + possibility that the source and destination strings might overlap. + + `clrstrM' + Block clear instruction. The addresses of the destination string + is the first operand, in mode `Pmode'. The number of bytes to + clear is the second operand, in mode M. See `movstrM' for a + discussion of the choice of mode. + + The third operand is the known alignment of the destination, in + the form of a `const_int' rtx. Thus, if the compiler knows that + the destination is word-aligned, it may provide the value 4 for + this operand. + + The use for multiple `clrstrM' is as for `movstrM'. + + `cmpstrM' + Block compare instruction, with five operands. Operand 0 is the + output; it has mode M. The remaining four operands are like the + operands of `movstrM'. The two memory blocks specified are + compared byte by byte in lexicographic order. The effect of the + instruction is to store a value in operand 0 whose sign indicates + the result of the comparison. + + `strlenM' + Compute the length of a string, with three operands. Operand 0 is + the result (of mode M), operand 1 is a `mem' referring to the + first character of the string, operand 2 is the character to + search for (normally zero), and operand 3 is a constant describing + the known alignment of the beginning of the string. + + `floatMN2' + Convert signed integer operand 1 (valid for fixed point mode M) to + floating point mode N and store in operand 0 (which has mode N). + + `floatunsMN2' + Convert unsigned integer operand 1 (valid for fixed point mode M) + to floating point mode N and store in operand 0 (which has mode N). + + `fixMN2' + Convert operand 1 (valid for floating point mode M) to fixed point + mode N as a signed number and store in operand 0 (which has mode + N). This instruction's result is defined only when the value of + operand 1 is an integer. + + `fixunsMN2' + Convert operand 1 (valid for floating point mode M) to fixed point + mode N as an unsigned number and store in operand 0 (which has + mode N). This instruction's result is defined only when the value + of operand 1 is an integer. + + `ftruncM2' + Convert operand 1 (valid for floating point mode M) to an integer + value, still represented in floating point mode M, and store it in + operand 0 (valid for floating point mode M). + + `fix_truncMN2' + Like `fixMN2' but works for any floating point value of mode M by + converting the value to an integer. + + `fixuns_truncMN2' + Like `fixunsMN2' but works for any floating point value of mode M + by converting the value to an integer. + + `truncMN2' + Truncate operand 1 (valid for mode M) to mode N and store in + operand 0 (which has mode N). Both modes must be fixed point or + both floating point. + + `extendMN2' + Sign-extend operand 1 (valid for mode M) to mode N and store in + operand 0 (which has mode N). Both modes must be fixed point or + both floating point. + + `zero_extendMN2' + Zero-extend operand 1 (valid for mode M) to mode N and store in + operand 0 (which has mode N). Both modes must be fixed point. + + `extv' + Extract a bit-field from operand 1 (a register or memory operand), + where operand 2 specifies the width in bits and operand 3 the + starting bit, and store it in operand 0. Operand 0 must have mode + `word_mode'. Operand 1 may have mode `byte_mode' or `word_mode'; + often `word_mode' is allowed only for registers. Operands 2 and 3 + must be valid for `word_mode'. + + The RTL generation pass generates this instruction only with + constants for operands 2 and 3. + + The bit-field value is sign-extended to a full word integer before + it is stored in operand 0. + + `extzv' + Like `extv' except that the bit-field value is zero-extended. + + `insv' + Store operand 3 (which must be valid for `word_mode') into a + bit-field in operand 0, where operand 1 specifies the width in + bits and operand 2 the starting bit. Operand 0 may have mode + `byte_mode' or `word_mode'; often `word_mode' is allowed only for + registers. Operands 1 and 2 must be valid for `word_mode'. + + The RTL generation pass generates this instruction only with + constants for operands 1 and 2. + + `movMODEcc' + Conditionally move operand 2 or operand 3 into operand 0 according + to the comparison in operand 1. If the comparison is true, + operand 2 is moved into operand 0, otherwise operand 3 is moved. + + The mode of the operands being compared need not be the same as + the operands being moved. Some machines, sparc64 for example, + have instructions that conditionally move an integer value based + on the floating point condition codes and vice versa. + + If the machine does not have conditional move instructions, do not + define these patterns. + + `sCOND' + Store zero or nonzero in the operand according to the condition + codes. Value stored is nonzero iff the condition COND is true. + COND is the name of a comparison operation expression code, such + as `eq', `lt' or `leu'. + + You specify the mode that the operand must have when you write the + `match_operand' expression. The compiler automatically sees which + mode you have used and supplies an operand of that mode. + + The value stored for a true condition must have 1 as its low bit, + or else must be negative. Otherwise the instruction is not + suitable and you should omit it from the machine description. You + describe to the compiler exactly which value is stored by defining + the macro `STORE_FLAG_VALUE' (*note Misc::). If a description + cannot be found that can be used for all the `sCOND' patterns, you + should omit those operations from the machine description. + + These operations may fail, but should do so only in relatively + uncommon cases; if they would fail for common cases involving + integer comparisons, it is best to omit these patterns. + + If these operations are omitted, the compiler will usually + generate code that copies the constant one to the target and + branches around an assignment of zero to the target. If this code + is more efficient than the potential instructions used for the + `sCOND' pattern followed by those required to convert the result + into a 1 or a zero in `SImode', you should omit the `sCOND' + operations from the machine description. + + `bCOND' + Conditional branch instruction. Operand 0 is a `label_ref' that + refers to the label to jump to. Jump if the condition codes meet + condition COND. + + Some machines do not follow the model assumed here where a + comparison instruction is followed by a conditional branch + instruction. In that case, the `cmpM' (and `tstM') patterns should + simply store the operands away and generate all the required insns + in a `define_expand' (*note Expander Definitions::) for the + conditional branch operations. All calls to expand `bCOND' + patterns are immediately preceded by calls to expand either a + `cmpM' pattern or a `tstM' pattern. + + Machines that use a pseudo register for the condition code value, + or where the mode used for the comparison depends on the condition + being tested, should also use the above mechanism. *Note Jump + Patterns::. + + The above discussion also applies to the `movMODEcc' and `sCOND' + patterns. + + `jump' + A jump inside a function; an unconditional branch. Operand 0 is + the `label_ref' of the label to jump to. This pattern name is + mandatory on all machines. + + `call' + Subroutine call instruction returning no value. Operand 0 is the + function to call; operand 1 is the number of bytes of arguments + pushed as a `const_int'; operand 2 is the number of registers used + as operands. + + On most machines, operand 2 is not actually stored into the RTL + pattern. It is supplied for the sake of some RISC machines which + need to put this information into the assembler code; they can put + it in the RTL instead of operand 1. + + Operand 0 should be a `mem' RTX whose address is the address of the + function. Note, however, that this address can be a `symbol_ref' + expression even if it would not be a legitimate memory address on + the target machine. If it is also not a valid argument for a call + instruction, the pattern for this operation should be a + `define_expand' (*note Expander Definitions::) that places the + address into a register and uses that register in the call + instruction. + + `call_value' + Subroutine call instruction returning a value. Operand 0 is the + hard register in which the value is returned. There are three more + operands, the same as the three operands of the `call' instruction + (but with numbers increased by one). + + Subroutines that return `BLKmode' objects use the `call' insn. + + `call_pop', `call_value_pop' + Similar to `call' and `call_value', except used if defined and if + `RETURN_POPS_ARGS' is nonzero. They should emit a `parallel' that + contains both the function call and a `set' to indicate the + adjustment made to the frame pointer. + + For machines where `RETURN_POPS_ARGS' can be nonzero, the use of + these patterns increases the number of functions for which the + frame pointer can be eliminated, if desired. + + `untyped_call' + Subroutine call instruction returning a value of any type. + Operand 0 is the function to call; operand 1 is a memory location + where the result of calling the function is to be stored; operand + 2 is a `parallel' expression where each element is a `set' + expression that indicates the saving of a function return value + into the result block. + + This instruction pattern should be defined to support + `__builtin_apply' on machines where special instructions are needed + to call a subroutine with arbitrary arguments or to save the value + returned. This instruction pattern is required on machines that + have multiple registers that can hold a return value (i.e. + `FUNCTION_VALUE_REGNO_P' is true for more than one register). + + `return' + Subroutine return instruction. This instruction pattern name + should be defined only if a single instruction can do all the work + of returning from a function. + + Like the `movM' patterns, this pattern is also used after the RTL + generation phase. In this case it is to support machines where + multiple instructions are usually needed to return from a + function, but some class of functions only requires one + instruction to implement a return. Normally, the applicable + functions are those which do not need to save any registers or + allocate stack space. + + For such machines, the condition specified in this pattern should + only be true when `reload_completed' is nonzero and the function's + epilogue would only be a single instruction. For machines with + register windows, the routine `leaf_function_p' may be used to + determine if a register window push is required. + + Machines that have conditional return instructions should define + patterns such as + + (define_insn "" + [(set (pc) + (if_then_else (match_operator + 0 "comparison_operator" + [(cc0) (const_int 0)]) + (return) + (pc)))] + "CONDITION" + "...") + + where CONDITION would normally be the same condition specified on + the named `return' pattern. + + `untyped_return' + Untyped subroutine return instruction. This instruction pattern + should be defined to support `__builtin_return' on machines where + special instructions are needed to return a value of any type. + + Operand 0 is a memory location where the result of calling a + function with `__builtin_apply' is stored; operand 1 is a + `parallel' expression where each element is a `set' expression + that indicates the restoring of a function return value from the + result block. + + `nop' + No-op instruction. This instruction pattern name should always be + defined to output a no-op in assembler code. `(const_int 0)' will + do as an RTL pattern. + + `indirect_jump' + An instruction to jump to an address which is operand zero. This + pattern name is mandatory on all machines. + + `casesi' + Instruction to jump through a dispatch table, including bounds + checking. This instruction takes five operands: + + 1. The index to dispatch on, which has mode `SImode'. + + 2. The lower bound for indices in the table, an integer constant. + + 3. The total range of indices in the table--the largest index + minus the smallest one (both inclusive). + + 4. A label that precedes the table itself. + + 5. A label to jump to if the index has a value outside the + bounds. (If the machine-description macro + `CASE_DROPS_THROUGH' is defined, then an out-of-bounds index + drops through to the code following the jump table instead of + jumping to this label. In that case, this label is not + actually used by the `casesi' instruction, but it is always + provided as an operand.) + + The table is a `addr_vec' or `addr_diff_vec' inside of a + `jump_insn'. The number of elements in the table is one plus the + difference between the upper bound and the lower bound. + + `tablejump' + Instruction to jump to a variable address. This is a low-level + capability which can be used to implement a dispatch table when + there is no `casesi' pattern. + + This pattern requires two operands: the address or offset, and a + label which should immediately precede the jump table. If the + macro `CASE_VECTOR_PC_RELATIVE' evaluates to a nonzero value then + the first operand is an offset which counts from the address of + the table; otherwise, it is an absolute address to jump to. In + either case, the first operand has mode `Pmode'. + + The `tablejump' insn is always the last insn before the jump table + it uses. Its assembler code normally has no need to use the + second operand, but you should incorporate it in the RTL pattern so + that the jump optimizer will not delete the table as unreachable + code. + + `decrement_and_branch_until_zero' + Conditional branch instruction that decrements a register and + jumps if the register is nonzero. Operand 0 is the register to + decrement and test; operand 1 is the label to jump to if the + register is nonzero. *Note Looping Patterns::. + + This optional instruction pattern is only used by the combiner, + typically for loops reversed by the loop optimizer when strength + reduction is enabled. + + `doloop_end' + Conditional branch instruction that decrements a register and + jumps if the register is nonzero. This instruction takes five + operands: Operand 0 is the register to decrement and test; operand + 1 is the number of loop iterations as a `const_int' or + `const0_rtx' if this cannot be determined until run-time; operand + 2 is the actual or estimated maximum number of iterations as a + `const_int'; operand 3 is the number of enclosed loops as a + `const_int' (an innermost loop has a value of 1); operand 4 is the + label to jump to if the register is nonzero. *Note Looping + Patterns::. + + This optional instruction pattern should be defined for machines + with low-overhead looping instructions as the loop optimizer will + try to modify suitable loops to utilize it. If nested + low-overhead looping is not supported, use a `define_expand' + (*note Expander Definitions::) and make the pattern fail if + operand 3 is not `const1_rtx'. Similarly, if the actual or + estimated maximum number of iterations is too large for this + instruction, make it fail. + + `doloop_begin' + Companion instruction to `doloop_end' required for machines that + need to perform some initialization, such as loading special + registers used by a low-overhead looping instruction. If + initialization insns do not always need to be emitted, use a + `define_expand' (*note Expander Definitions::) and make it fail. + + `canonicalize_funcptr_for_compare' + Canonicalize the function pointer in operand 1 and store the result + into operand 0. + + Operand 0 is always a `reg' and has mode `Pmode'; operand 1 may be + a `reg', `mem', `symbol_ref', `const_int', etc and also has mode + `Pmode'. + + Canonicalization of a function pointer usually involves computing + the address of the function which would be called if the function + pointer were used in an indirect call. + + Only define this pattern if function pointers on the target machine + can have different values but still call the same function when + used in an indirect call. + + `save_stack_block' + `save_stack_function' + `save_stack_nonlocal' + `restore_stack_block' + `restore_stack_function' + `restore_stack_nonlocal' + Most machines save and restore the stack pointer by copying it to + or from an object of mode `Pmode'. Do not define these patterns on + such machines. + + Some machines require special handling for stack pointer saves and + restores. On those machines, define the patterns corresponding to + the non-standard cases by using a `define_expand' (*note Expander + Definitions::) that produces the required insns. The three types + of saves and restores are: + + 1. `save_stack_block' saves the stack pointer at the start of a + block that allocates a variable-sized object, and + `restore_stack_block' restores the stack pointer when the + block is exited. + + 2. `save_stack_function' and `restore_stack_function' do a + similar job for the outermost block of a function and are + used when the function allocates variable-sized objects or + calls `alloca'. Only the epilogue uses the restored stack + pointer, allowing a simpler save or restore sequence on some + machines. + + 3. `save_stack_nonlocal' is used in functions that contain labels + branched to by nested functions. It saves the stack pointer + in such a way that the inner function can use + `restore_stack_nonlocal' to restore the stack pointer. The + compiler generates code to restore the frame and argument + pointer registers, but some machines require saving and + restoring additional data such as register window information + or stack backchains. Place insns in these patterns to save + and restore any such required data. + + When saving the stack pointer, operand 0 is the save area and + operand 1 is the stack pointer. The mode used to allocate the + save area defaults to `Pmode' but you can override that choice by + defining the `STACK_SAVEAREA_MODE' macro (*note Storage Layout::). + You must specify an integral mode, or `VOIDmode' if no save area + is needed for a particular type of save (either because no save is + needed or because a machine-specific save area can be used). + Operand 0 is the stack pointer and operand 1 is the save area for + restore operations. If `save_stack_block' is defined, operand 0 + must not be `VOIDmode' since these saves can be arbitrarily nested. + + A save area is a `mem' that is at a constant offset from + `virtual_stack_vars_rtx' when the stack pointer is saved for use by + nonlocal gotos and a `reg' in the other two cases. + + `allocate_stack' + Subtract (or add if `STACK_GROWS_DOWNWARD' is undefined) operand 1 + from the stack pointer to create space for dynamically allocated + data. + + Store the resultant pointer to this space into operand 0. If you + are allocating space from the main stack, do this by emitting a + move insn to copy `virtual_stack_dynamic_rtx' to operand 0. If + you are allocating the space elsewhere, generate code to copy the + location of the space to operand 0. In the latter case, you must + ensure this space gets freed when the corresponding space on the + main stack is free. + + Do not define this pattern if all that must be done is the + subtraction. Some machines require other operations such as stack + probes or maintaining the back chain. Define this pattern to emit + those operations in addition to updating the stack pointer. + + `probe' + Some machines require instructions to be executed after space is + allocated from the stack, for example to generate a reference at + the bottom of the stack. + + If you need to emit instructions before the stack has been + adjusted, put them into the `allocate_stack' pattern. Otherwise, + define this pattern to emit the required instructions. + + No operands are provided. + + `check_stack' + If stack checking cannot be done on your system by probing the + stack with a load or store instruction (*note Stack Checking::), + define this pattern to perform the needed check and signaling an + error if the stack has overflowed. The single operand is the + location in the stack furthest from the current stack pointer that + you need to validate. Normally, on machines where this pattern is + needed, you would obtain the stack limit from a global or + thread-specific variable or register. + + `nonlocal_goto' + Emit code to generate a non-local goto, e.g., a jump from one + function to a label in an outer function. This pattern has four + arguments, each representing a value to be used in the jump. The + first argument is to be loaded into the frame pointer, the second + is the address to branch to (code to dispatch to the actual label), + the third is the address of a location where the stack is saved, + and the last is the address of the label, to be placed in the + location for the incoming static chain. + + On most machines you need not define this pattern, since GCC will + already generate the correct code, which is to load the frame + pointer and static chain, restore the stack (using the + `restore_stack_nonlocal' pattern, if defined), and jump indirectly + to the dispatcher. You need only define this pattern if this code + will not work on your machine. + + `nonlocal_goto_receiver' + This pattern, if defined, contains code needed at the target of a + nonlocal goto after the code already generated by GCC. You will + not normally need to define this pattern. A typical reason why + you might need this pattern is if some value, such as a pointer to + a global table, must be restored when the frame pointer is + restored. Note that a nonlocal goto only occurs within a + unit-of-translation, so a global table pointer that is shared by + all functions of a given module need not be restored. There are + no arguments. + + `exception_receiver' + This pattern, if defined, contains code needed at the site of an + exception handler that isn't needed at the site of a nonlocal + goto. You will not normally need to define this pattern. A + typical reason why you might need this pattern is if some value, + such as a pointer to a global table, must be restored after + control flow is branched to the handler of an exception. There + are no arguments. + + `builtin_setjmp_setup' + This pattern, if defined, contains additional code needed to + initialize the `jmp_buf'. You will not normally need to define + this pattern. A typical reason why you might need this pattern is + if some value, such as a pointer to a global table, must be + restored. Though it is preferred that the pointer value be + recalculated if possible (given the address of a label for + instance). The single argument is a pointer to the `jmp_buf'. + Note that the buffer is five words long and that the first three + are normally used by the generic mechanism. + + `builtin_setjmp_receiver' + This pattern, if defined, contains code needed at the site of an + built-in setjmp that isn't needed at the site of a nonlocal goto. + You will not normally need to define this pattern. A typical + reason why you might need this pattern is if some value, such as a + pointer to a global table, must be restored. It takes one + argument, which is the label to which builtin_longjmp transfered + control; this pattern may be emitted at a small offset from that + label. + + `builtin_longjmp' + This pattern, if defined, performs the entire action of the + longjmp. You will not normally need to define this pattern unless + you also define `builtin_setjmp_setup'. The single argument is a + pointer to the `jmp_buf'. + + `eh_return' + This pattern, if defined, affects the way `__builtin_eh_return', + and thence the call frame exception handling library routines, are + built. It is intended to handle non-trivial actions needed along + the abnormal return path. + + The pattern takes two arguments. The first is an offset to be + applied to the stack pointer. It will have been copied to some + appropriate location (typically `EH_RETURN_STACKADJ_RTX') which + will survive until after reload to when the normal epilogue is + generated. The second argument is the address of the exception + handler to which the function should return. This will normally + need to copied by the pattern to some special register or memory + location. + + This pattern only needs to be defined if call frame exception + handling is to be used, and simple moves involving + `EH_RETURN_STACKADJ_RTX' and `EH_RETURN_HANDLER_RTX' are not + sufficient. + + `prologue' + This pattern, if defined, emits RTL for entry to a function. The + function entry is responsible for setting up the stack frame, + initializing the frame pointer register, saving callee saved + registers, etc. + + Using a prologue pattern is generally preferred over defining + `TARGET_ASM_FUNCTION_PROLOGUE' to emit assembly code for the + prologue. + + The `prologue' pattern is particularly useful for targets which + perform instruction scheduling. + + `epilogue' + This pattern emits RTL for exit from a function. The function + exit is responsible for deallocating the stack frame, restoring + callee saved registers and emitting the return instruction. + + Using an epilogue pattern is generally preferred over defining + `TARGET_ASM_FUNCTION_EPILOGUE' to emit assembly code for the + epilogue. + + The `epilogue' pattern is particularly useful for targets which + perform instruction scheduling or which have delay slots for their + return instruction. + + `sibcall_epilogue' + This pattern, if defined, emits RTL for exit from a function + without the final branch back to the calling function. This + pattern will be emitted before any sibling call (aka tail call) + sites. + + The `sibcall_epilogue' pattern must not clobber any arguments used + for parameter passing or any stack slots for arguments passed to + the current function. + + `trap' + This pattern, if defined, signals an error, typically by causing + some kind of signal to be raised. Among other places, it is used + by the Java front end to signal `invalid array index' exceptions. + + `conditional_trap' + Conditional trap instruction. Operand 0 is a piece of RTL which + performs a comparison. Operand 1 is the trap code, an integer. + + A typical `conditional_trap' pattern looks like + + (define_insn "conditional_trap" + [(trap_if (match_operator 0 "trap_operator" + [(cc0) (const_int 0)]) + (match_operand 1 "const_int_operand" "i"))] + "" + "...") + + `prefetch' + This pattern, if defined, emits code for a non-faulting data + prefetch instruction. Operand 0 is the address of the memory to + prefetch. Operand 1 is a constant 1 if the prefetch is preparing + for a write to the memory address, or a constant 0 otherwise. + Operand 2 is the expected degree of temporal locality of the data + and is a value between 0 and 3, inclusive; 0 means that the data + has no temporal locality, so it need not be left in the cache + after the access; 3 means that the data has a high degree of + temporal locality and should be left in all levels of cache + possible; 1 and 2 mean, respectively, a low or moderate degree of + temporal locality. + + Targets that do not support write prefetches or locality hints can + ignore the values of operands 1 and 2. + + `cycle_display' + This pattern, if present, will be emitted by the instruction + scheduler at the beginning of each new clock cycle. This can be + used for annotating the assembler output with cycle counts. + Operand 0 is a `const_int' that holds the clock cycle. + + +  + File: gccint.info, Node: Pattern Ordering, Next: Dependent Patterns, Prev: Standard Names, Up: Machine Desc + + When the Order of Patterns Matters + ================================== + + Sometimes an insn can match more than one instruction pattern. Then + the pattern that appears first in the machine description is the one + used. Therefore, more specific patterns (patterns that will match + fewer things) and faster instructions (those that will produce better + code when they do match) should usually go first in the description. + + In some cases the effect of ordering the patterns can be used to hide + a pattern when it is not valid. For example, the 68000 has an + instruction for converting a fullword to floating point and another for + converting a byte to floating point. An instruction converting an + integer to floating point could match either one. We put the pattern + to convert the fullword first to make sure that one will be used rather + than the other. (Otherwise a large integer might be generated as a + single-byte immediate quantity, which would not work.) Instead of + using this pattern ordering it would be possible to make the pattern + for convert-a-byte smart enough to deal properly with any constant + value. + +  + File: gccint.info, Node: Dependent Patterns, Next: Jump Patterns, Prev: Pattern Ordering, Up: Machine Desc + + Interdependence of Patterns + =========================== + + Every machine description must have a named pattern for each of the + conditional branch names `bCOND'. The recognition template must always + have the form + + (set (pc) + (if_then_else (COND (cc0) (const_int 0)) + (label_ref (match_operand 0 "" "")) + (pc))) + + In addition, every machine description must have an anonymous pattern + for each of the possible reverse-conditional branches. Their templates + look like + + (set (pc) + (if_then_else (COND (cc0) (const_int 0)) + (pc) + (label_ref (match_operand 0 "" "")))) + + They are necessary because jump optimization can turn direct-conditional + branches into reverse-conditional branches. + + It is often convenient to use the `match_operator' construct to + reduce the number of patterns that must be specified for branches. For + example, + + (define_insn "" + [(set (pc) + (if_then_else (match_operator 0 "comparison_operator" + [(cc0) (const_int 0)]) + (pc) + (label_ref (match_operand 1 "" ""))))] + "CONDITION" + "...") + + In some cases machines support instructions identical except for the + machine mode of one or more operands. For example, there may be + "sign-extend halfword" and "sign-extend byte" instructions whose + patterns are + + (set (match_operand:SI 0 ...) + (extend:SI (match_operand:HI 1 ...))) + + (set (match_operand:SI 0 ...) + (extend:SI (match_operand:QI 1 ...))) + + Constant integers do not specify a machine mode, so an instruction to + extend a constant value could match either pattern. The pattern it + actually will match is the one that appears first in the file. For + correct results, this must be the one for the widest possible mode + (`HImode', here). If the pattern matches the `QImode' instruction, the + results will be incorrect if the constant value does not actually fit + that mode. + + Such instructions to extend constants are rarely generated because + they are optimized away, but they do occasionally happen in nonoptimized + compilations. + + If a constraint in a pattern allows a constant, the reload pass may + replace a register with a constant permitted by the constraint in some + cases. Similarly for memory references. Because of this substitution, + you should not provide separate patterns for increment and decrement + instructions. Instead, they should be generated from the same pattern + that supports register-register add insns by examining the operands and + generating the appropriate machine instruction. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-11 gcc-3.2.3/gcc/doc/gccint.info-11 *** gcc-3.2.2/gcc/doc/gccint.info-11 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-11 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1120 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Jump Patterns, Next: Looping Patterns, Prev: Dependent Patterns, Up: Machine Desc + + Defining Jump Instruction Patterns + ================================== + + For most machines, GCC assumes that the machine has a condition code. + A comparison insn sets the condition code, recording the results of both + signed and unsigned comparison of the given operands. A separate branch + insn tests the condition code and branches or not according its value. + The branch insns come in distinct signed and unsigned flavors. Many + common machines, such as the VAX, the 68000 and the 32000, work this + way. + + Some machines have distinct signed and unsigned compare + instructions, and only one set of conditional branch instructions. The + easiest way to handle these machines is to treat them just like the + others until the final stage where assembly code is written. At this + time, when outputting code for the compare instruction, peek ahead at + the following branch using `next_cc0_user (insn)'. (The variable + `insn' refers to the insn being output, in the output-writing code in + an instruction pattern.) If the RTL says that is an unsigned branch, + output an unsigned compare; otherwise output a signed compare. When + the branch itself is output, you can treat signed and unsigned branches + identically. + + The reason you can do this is that GCC always generates a pair of + consecutive RTL insns, possibly separated by `note' insns, one to set + the condition code and one to test it, and keeps the pair inviolate + until the end. + + To go with this technique, you must define the machine-description + macro `NOTICE_UPDATE_CC' to do `CC_STATUS_INIT'; in other words, no + compare instruction is superfluous. + + Some machines have compare-and-branch instructions and no condition + code. A similar technique works for them. When it is time to "output" + a compare instruction, record its operands in two static variables. + When outputting the branch-on-condition-code instruction that follows, + actually output a compare-and-branch instruction that uses the + remembered operands. + + It also works to define patterns for compare-and-branch instructions. + In optimizing compilation, the pair of compare and branch instructions + will be combined according to these patterns. But this does not happen + if optimization is not requested. So you must use one of the solutions + above in addition to any special patterns you define. + + In many RISC machines, most instructions do not affect the condition + code and there may not even be a separate condition code register. On + these machines, the restriction that the definition and use of the + condition code be adjacent insns is not necessary and can prevent + important optimizations. For example, on the IBM RS/6000, there is a + delay for taken branches unless the condition code register is set three + instructions earlier than the conditional branch. The instruction + scheduler cannot perform this optimization if it is not permitted to + separate the definition and use of the condition code register. + + On these machines, do not use `(cc0)', but instead use a register to + represent the condition code. If there is a specific condition code + register in the machine, use a hard register. If the condition code or + comparison result can be placed in any general register, or if there are + multiple condition registers, use a pseudo register. + + On some machines, the type of branch instruction generated may + depend on the way the condition code was produced; for example, on the + 68k and Sparc, setting the condition code directly from an add or + subtract instruction does not clear the overflow bit the way that a test + instruction does, so a different branch instruction must be used for + some conditional branches. For machines that use `(cc0)', the set and + use of the condition code must be adjacent (separated only by `note' + insns) allowing flags in `cc_status' to be used. (*Note Condition + Code::.) Also, the comparison and branch insns can be located from + each other by using the functions `prev_cc0_setter' and `next_cc0_user'. + + However, this is not true on machines that do not use `(cc0)'. On + those machines, no assumptions can be made about the adjacency of the + compare and branch insns and the above methods cannot be used. Instead, + we use the machine mode of the condition code register to record + different formats of the condition code register. + + Registers used to store the condition code value should have a mode + that is in class `MODE_CC'. Normally, it will be `CCmode'. If + additional modes are required (as for the add example mentioned above in + the Sparc), define the macro `EXTRA_CC_MODES' to list the additional + modes required (*note Condition Code::). Also define `SELECT_CC_MODE' + to choose a mode given an operand of a compare. + + If it is known during RTL generation that a different mode will be + required (for example, if the machine has separate compare instructions + for signed and unsigned quantities, like most IBM processors), they can + be specified at that time. + + If the cases that require different modes would be made by + instruction combination, the macro `SELECT_CC_MODE' determines which + machine mode should be used for the comparison result. The patterns + should be written using that mode. To support the case of the add on + the Sparc discussed above, we have the pattern + + (define_insn "" + [(set (reg:CC_NOOV 0) + (compare:CC_NOOV + (plus:SI (match_operand:SI 0 "register_operand" "%r") + (match_operand:SI 1 "arith_operand" "rI")) + (const_int 0)))] + "" + "...") + + The `SELECT_CC_MODE' macro on the Sparc returns `CC_NOOVmode' for + comparisons whose argument is a `plus'. + +  + File: gccint.info, Node: Looping Patterns, Next: Insn Canonicalizations, Prev: Jump Patterns, Up: Machine Desc + + Defining Looping Instruction Patterns + ===================================== + + Some machines have special jump instructions that can be utilised to + make loops more efficient. A common example is the 68000 `dbra' + instruction which performs a decrement of a register and a branch if the + result was greater than zero. Other machines, in particular digital + signal processors (DSPs), have special block repeat instructions to + provide low-overhead loop support. For example, the TI TMS320C3x/C4x + DSPs have a block repeat instruction that loads special registers to + mark the top and end of a loop and to count the number of loop + iterations. This avoids the need for fetching and executing a + `dbra'-like instruction and avoids pipeline stalls associated with the + jump. + + GCC has three special named patterns to support low overhead looping. + They are `decrement_and_branch_until_zero', `doloop_begin', and + `doloop_end'. The first pattern, `decrement_and_branch_until_zero', is + not emitted during RTL generation but may be emitted during the + instruction combination phase. This requires the assistance of the + loop optimizer, using information collected during strength reduction, + to reverse a loop to count down to zero. Some targets also require the + loop optimizer to add a `REG_NONNEG' note to indicate that the + iteration count is always positive. This is needed if the target + performs a signed loop termination test. For example, the 68000 uses a + pattern similar to the following for its `dbra' instruction: + + (define_insn "decrement_and_branch_until_zero" + [(set (pc) + (if_then_else + (ge (plus:SI (match_operand:SI 0 "general_operand" "+d*am") + (const_int -1)) + (const_int 0)) + (label_ref (match_operand 1 "" "")) + (pc))) + (set (match_dup 0) + (plus:SI (match_dup 0) + (const_int -1)))] + "find_reg_note (insn, REG_NONNEG, 0)" + "...") + + Note that since the insn is both a jump insn and has an output, it + must deal with its own reloads, hence the `m' constraints. Also note + that since this insn is generated by the instruction combination phase + combining two sequential insns together into an implicit parallel insn, + the iteration counter needs to be biased by the same amount as the + decrement operation, in this case -1. Note that the following similar + pattern will not be matched by the combiner. + + (define_insn "decrement_and_branch_until_zero" + [(set (pc) + (if_then_else + (ge (match_operand:SI 0 "general_operand" "+d*am") + (const_int 1)) + (label_ref (match_operand 1 "" "")) + (pc))) + (set (match_dup 0) + (plus:SI (match_dup 0) + (const_int -1)))] + "find_reg_note (insn, REG_NONNEG, 0)" + "...") + + The other two special looping patterns, `doloop_begin' and + `doloop_end', are emitted by the loop optimizer for certain + well-behaved loops with a finite number of loop iterations using + information collected during strength reduction. + + The `doloop_end' pattern describes the actual looping instruction + (or the implicit looping operation) and the `doloop_begin' pattern is + an optional companion pattern that can be used for initialization + needed for some low-overhead looping instructions. + + Note that some machines require the actual looping instruction to be + emitted at the top of the loop (e.g., the TMS320C3x/C4x DSPs). Emitting + the true RTL for a looping instruction at the top of the loop can cause + problems with flow analysis. So instead, a dummy `doloop' insn is + emitted at the end of the loop. The machine dependent reorg pass checks + for the presence of this `doloop' insn and then searches back to the + top of the loop, where it inserts the true looping insn (provided there + are no instructions in the loop which would cause problems). Any + additional labels can be emitted at this point. In addition, if the + desired special iteration counter register was not allocated, this + machine dependent reorg pass could emit a traditional compare and jump + instruction pair. + + The essential difference between the + `decrement_and_branch_until_zero' and the `doloop_end' patterns is that + the loop optimizer allocates an additional pseudo register for the + latter as an iteration counter. This pseudo register cannot be used + within the loop (i.e., general induction variables cannot be derived + from it), however, in many cases the loop induction variable may become + redundant and removed by the flow pass. + +  + File: gccint.info, Node: Insn Canonicalizations, Next: Expander Definitions, Prev: Looping Patterns, Up: Machine Desc + + Canonicalization of Instructions + ================================ + + There are often cases where multiple RTL expressions could represent + an operation performed by a single machine instruction. This situation + is most commonly encountered with logical, branch, and + multiply-accumulate instructions. In such cases, the compiler attempts + to convert these multiple RTL expressions into a single canonical form + to reduce the number of insn patterns required. + + In addition to algebraic simplifications, following canonicalizations + are performed: + + * For commutative and comparison operators, a constant is always + made the second operand. If a machine only supports a constant as + the second operand, only patterns that match a constant in the + second operand need be supplied. + + For these operators, if only one operand is a `neg', `not', + `mult', `plus', or `minus' expression, it will be the first + operand. + + * For the `compare' operator, a constant is always the second operand + on machines where `cc0' is used (*note Jump Patterns::). On other + machines, there are rare cases where the compiler might want to + construct a `compare' with a constant as the first operand. + However, these cases are not common enough for it to be worthwhile + to provide a pattern matching a constant as the first operand + unless the machine actually has such an instruction. + + An operand of `neg', `not', `mult', `plus', or `minus' is made the + first operand under the same conditions as above. + + * `(minus X (const_int N))' is converted to `(plus X (const_int + -N))'. + + * Within address computations (i.e., inside `mem'), a left shift is + converted into the appropriate multiplication by a power of two. + + * De`Morgan's Law is used to move bitwise negation inside a bitwise + logical-and or logical-or operation. If this results in only one + operand being a `not' expression, it will be the first one. + + A machine that has an instruction that performs a bitwise + logical-and of one operand with the bitwise negation of the other + should specify the pattern for that instruction as + + (define_insn "" + [(set (match_operand:M 0 ...) + (and:M (not:M (match_operand:M 1 ...)) + (match_operand:M 2 ...)))] + "..." + "...") + + Similarly, a pattern for a "NAND" instruction should be written + + (define_insn "" + [(set (match_operand:M 0 ...) + (ior:M (not:M (match_operand:M 1 ...)) + (not:M (match_operand:M 2 ...))))] + "..." + "...") + + In both cases, it is not necessary to include patterns for the many + logically equivalent RTL expressions. + + * The only possible RTL expressions involving both bitwise + exclusive-or and bitwise negation are `(xor:M X Y)' and `(not:M + (xor:M X Y))'. + + * The sum of three items, one of which is a constant, will only + appear in the form + + (plus:M (plus:M X Y) CONSTANT) + + * On machines that do not use `cc0', `(compare X (const_int 0))' + will be converted to X. + + * Equality comparisons of a group of bits (usually a single bit) + with zero will be written using `zero_extract' rather than the + equivalent `and' or `sign_extract' operations. + + +  + File: gccint.info, Node: Expander Definitions, Next: Insn Splitting, Prev: Insn Canonicalizations, Up: Machine Desc + + Defining RTL Sequences for Code Generation + ========================================== + + On some target machines, some standard pattern names for RTL + generation cannot be handled with single insn, but a sequence of RTL + insns can represent them. For these target machines, you can write a + `define_expand' to specify how to generate the sequence of RTL. + + A `define_expand' is an RTL expression that looks almost like a + `define_insn'; but, unlike the latter, a `define_expand' is used only + for RTL generation and it can produce more than one RTL insn. + + A `define_expand' RTX has four operands: + + * The name. Each `define_expand' must have a name, since the only + use for it is to refer to it by name. + + * The RTL template. This is a vector of RTL expressions representing + a sequence of separate instructions. Unlike `define_insn', there + is no implicit surrounding `PARALLEL'. + + * The condition, a string containing a C expression. This + expression is used to express how the availability of this pattern + depends on subclasses of target machine, selected by command-line + options when GCC is run. This is just like the condition of a + `define_insn' that has a standard name. Therefore, the condition + (if present) may not depend on the data in the insn being matched, + but only the target-machine-type flags. The compiler needs to + test these conditions during initialization in order to learn + exactly which named instructions are available in a particular run. + + * The preparation statements, a string containing zero or more C + statements which are to be executed before RTL code is generated + from the RTL template. + + Usually these statements prepare temporary registers for use as + internal operands in the RTL template, but they can also generate + RTL insns directly by calling routines such as `emit_insn', etc. + Any such insns precede the ones that come from the RTL template. + + Every RTL insn emitted by a `define_expand' must match some + `define_insn' in the machine description. Otherwise, the compiler will + crash when trying to generate code for the insn or trying to optimize + it. + + The RTL template, in addition to controlling generation of RTL insns, + also describes the operands that need to be specified when this pattern + is used. In particular, it gives a predicate for each operand. + + A true operand, which needs to be specified in order to generate RTL + from the pattern, should be described with a `match_operand' in its + first occurrence in the RTL template. This enters information on the + operand's predicate into the tables that record such things. GCC uses + the information to preload the operand into a register if that is + required for valid RTL code. If the operand is referred to more than + once, subsequent references should use `match_dup'. + + The RTL template may also refer to internal "operands" which are + temporary registers or labels used only within the sequence made by the + `define_expand'. Internal operands are substituted into the RTL + template with `match_dup', never with `match_operand'. The values of + the internal operands are not passed in as arguments by the compiler + when it requests use of this pattern. Instead, they are computed + within the pattern, in the preparation statements. These statements + compute the values and store them into the appropriate elements of + `operands' so that `match_dup' can find them. + + There are two special macros defined for use in the preparation + statements: `DONE' and `FAIL'. Use them with a following semicolon, as + a statement. + + `DONE' + Use the `DONE' macro to end RTL generation for the pattern. The + only RTL insns resulting from the pattern on this occasion will be + those already emitted by explicit calls to `emit_insn' within the + preparation statements; the RTL template will not be generated. + + `FAIL' + Make the pattern fail on this occasion. When a pattern fails, it + means that the pattern was not truly available. The calling + routines in the compiler will try other strategies for code + generation using other patterns. + + Failure is currently supported only for binary (addition, + multiplication, shifting, etc.) and bit-field (`extv', `extzv', + and `insv') operations. + + If the preparation falls through (invokes neither `DONE' nor + `FAIL'), then the `define_expand' acts like a `define_insn' in that the + RTL template is used to generate the insn. + + The RTL template is not used for matching, only for generating the + initial insn list. If the preparation statement always invokes `DONE' + or `FAIL', the RTL template may be reduced to a simple list of + operands, such as this example: + + (define_expand "addsi3" + [(match_operand:SI 0 "register_operand" "") + (match_operand:SI 1 "register_operand" "") + (match_operand:SI 2 "register_operand" "")] + "" + " + { + handle_add (operands[0], operands[1], operands[2]); + DONE; + }") + + Here is an example, the definition of left-shift for the SPUR chip: + + (define_expand "ashlsi3" + [(set (match_operand:SI 0 "register_operand" "") + (ashift:SI + (match_operand:SI 1 "register_operand" "") + (match_operand:SI 2 "nonmemory_operand" "")))] + "" + " + + { + if (GET_CODE (operands[2]) != CONST_INT + || (unsigned) INTVAL (operands[2]) > 3) + FAIL; + }") + + This example uses `define_expand' so that it can generate an RTL insn + for shifting when the shift-count is in the supported range of 0 to 3 + but fail in other cases where machine insns aren't available. When it + fails, the compiler tries another strategy using different patterns + (such as, a library call). + + If the compiler were able to handle nontrivial condition-strings in + patterns with names, then it would be possible to use a `define_insn' + in that case. Here is another case (zero-extension on the 68000) which + makes more use of the power of `define_expand': + + (define_expand "zero_extendhisi2" + [(set (match_operand:SI 0 "general_operand" "") + (const_int 0)) + (set (strict_low_part + (subreg:HI + (match_dup 0) + 0)) + (match_operand:HI 1 "general_operand" ""))] + "" + "operands[1] = make_safe_from (operands[1], operands[0]);") + + Here two RTL insns are generated, one to clear the entire output operand + and the other to copy the input operand into its low half. This + sequence is incorrect if the input operand refers to [the old value of] + the output operand, so the preparation statement makes sure this isn't + so. The function `make_safe_from' copies the `operands[1]' into a + temporary register if it refers to `operands[0]'. It does this by + emitting another RTL insn. + + Finally, a third example shows the use of an internal operand. + Zero-extension on the SPUR chip is done by `and'-ing the result against + a halfword mask. But this mask cannot be represented by a `const_int' + because the constant value is too large to be legitimate on this + machine. So it must be copied into a register with `force_reg' and + then the register used in the `and'. + + (define_expand "zero_extendhisi2" + [(set (match_operand:SI 0 "register_operand" "") + (and:SI (subreg:SI + (match_operand:HI 1 "register_operand" "") + 0) + (match_dup 2)))] + "" + "operands[2] + = force_reg (SImode, GEN_INT (65535)); ") + + *Note:* If the `define_expand' is used to serve a standard binary or + unary arithmetic operation or a bit-field operation, then the last insn + it generates must not be a `code_label', `barrier' or `note'. It must + be an `insn', `jump_insn' or `call_insn'. If you don't need a real insn + at the end, emit an insn to copy the result of the operation into + itself. Such an insn will generate no code, but it can avoid problems + in the compiler. + +  + File: gccint.info, Node: Insn Splitting, Next: Including Patterns, Prev: Expander Definitions, Up: Machine Desc + + Defining How to Split Instructions + ================================== + + There are two cases where you should specify how to split a pattern + into multiple insns. On machines that have instructions requiring delay + slots (*note Delay Slots::) or that have instructions whose output is + not available for multiple cycles (*note Function Units::), the compiler + phases that optimize these cases need to be able to move insns into + one-instruction delay slots. However, some insns may generate more + than one machine instruction. These insns cannot be placed into a + delay slot. + + Often you can rewrite the single insn as a list of individual insns, + each corresponding to one machine instruction. The disadvantage of + doing so is that it will cause the compilation to be slower and require + more space. If the resulting insns are too complex, it may also + suppress some optimizations. The compiler splits the insn if there is a + reason to believe that it might improve instruction or delay slot + scheduling. + + The insn combiner phase also splits putative insns. If three insns + are merged into one insn with a complex expression that cannot be + matched by some `define_insn' pattern, the combiner phase attempts to + split the complex pattern into two insns that are recognized. Usually + it can break the complex pattern into two patterns by splitting out some + subexpression. However, in some other cases, such as performing an + addition of a large constant in two insns on a RISC machine, the way to + split the addition into two insns is machine-dependent. + + The `define_split' definition tells the compiler how to split a + complex insn into several simpler insns. It looks like this: + + (define_split + [INSN-PATTERN] + "CONDITION" + [NEW-INSN-PATTERN-1 + NEW-INSN-PATTERN-2 + ...] + "PREPARATION-STATEMENTS") + + INSN-PATTERN is a pattern that needs to be split and CONDITION is + the final condition to be tested, as in a `define_insn'. When an insn + matching INSN-PATTERN and satisfying CONDITION is found, it is replaced + in the insn list with the insns given by NEW-INSN-PATTERN-1, + NEW-INSN-PATTERN-2, etc. + + The PREPARATION-STATEMENTS are similar to those statements that are + specified for `define_expand' (*note Expander Definitions::) and are + executed before the new RTL is generated to prepare for the generated + code or emit some insns whose pattern is not fixed. Unlike those in + `define_expand', however, these statements must not generate any new + pseudo-registers. Once reload has completed, they also must not + allocate any space in the stack frame. + + Patterns are matched against INSN-PATTERN in two different + circumstances. If an insn needs to be split for delay slot scheduling + or insn scheduling, the insn is already known to be valid, which means + that it must have been matched by some `define_insn' and, if + `reload_completed' is nonzero, is known to satisfy the constraints of + that `define_insn'. In that case, the new insn patterns must also be + insns that are matched by some `define_insn' and, if `reload_completed' + is nonzero, must also satisfy the constraints of those definitions. + + As an example of this usage of `define_split', consider the following + example from `a29k.md', which splits a `sign_extend' from `HImode' to + `SImode' into a pair of shift insns: + + (define_split + [(set (match_operand:SI 0 "gen_reg_operand" "") + (sign_extend:SI (match_operand:HI 1 "gen_reg_operand" "")))] + "" + [(set (match_dup 0) + (ashift:SI (match_dup 1) + (const_int 16))) + (set (match_dup 0) + (ashiftrt:SI (match_dup 0) + (const_int 16)))] + " + { operands[1] = gen_lowpart (SImode, operands[1]); }") + + When the combiner phase tries to split an insn pattern, it is always + the case that the pattern is _not_ matched by any `define_insn'. The + combiner pass first tries to split a single `set' expression and then + the same `set' expression inside a `parallel', but followed by a + `clobber' of a pseudo-reg to use as a scratch register. In these + cases, the combiner expects exactly two new insn patterns to be + generated. It will verify that these patterns match some `define_insn' + definitions, so you need not do this test in the `define_split' (of + course, there is no point in writing a `define_split' that will never + produce insns that match). + + Here is an example of this use of `define_split', taken from + `rs6000.md': + + (define_split + [(set (match_operand:SI 0 "gen_reg_operand" "") + (plus:SI (match_operand:SI 1 "gen_reg_operand" "") + (match_operand:SI 2 "non_add_cint_operand" "")))] + "" + [(set (match_dup 0) (plus:SI (match_dup 1) (match_dup 3))) + (set (match_dup 0) (plus:SI (match_dup 0) (match_dup 4)))] + " + { + int low = INTVAL (operands[2]) & 0xffff; + int high = (unsigned) INTVAL (operands[2]) >> 16; + + if (low & 0x8000) + high++, low |= 0xffff0000; + + operands[3] = GEN_INT (high << 16); + operands[4] = GEN_INT (low); + }") + + Here the predicate `non_add_cint_operand' matches any `const_int' + that is _not_ a valid operand of a single add insn. The add with the + smaller displacement is written so that it can be substituted into the + address of a subsequent operation. + + An example that uses a scratch register, from the same file, + generates an equality comparison of a register and a large constant: + + (define_split + [(set (match_operand:CC 0 "cc_reg_operand" "") + (compare:CC (match_operand:SI 1 "gen_reg_operand" "") + (match_operand:SI 2 "non_short_cint_operand" ""))) + (clobber (match_operand:SI 3 "gen_reg_operand" ""))] + "find_single_use (operands[0], insn, 0) + && (GET_CODE (*find_single_use (operands[0], insn, 0)) == EQ + || GET_CODE (*find_single_use (operands[0], insn, 0)) == NE)" + [(set (match_dup 3) (xor:SI (match_dup 1) (match_dup 4))) + (set (match_dup 0) (compare:CC (match_dup 3) (match_dup 5)))] + " + { + /* Get the constant we are comparing against, C, and see what it + looks like sign-extended to 16 bits. Then see what constant + could be XOR'ed with C to get the sign-extended value. */ + + int c = INTVAL (operands[2]); + int sextc = (c << 16) >> 16; + int xorv = c ^ sextc; + + operands[4] = GEN_INT (xorv); + operands[5] = GEN_INT (sextc); + }") + + To avoid confusion, don't write a single `define_split' that accepts + some insns that match some `define_insn' as well as some insns that + don't. Instead, write two separate `define_split' definitions, one for + the insns that are valid and one for the insns that are not valid. + + The splitter is allowed to split jump instructions into sequence of + jumps or create new jumps in while splitting non-jump instructions. As + the central flowgraph and branch prediction information needs to be + updated, several restriction apply. + + Splitting of jump instruction into sequence that over by another jump + instruction is always valid, as compiler expect identical behavior of + new jump. When new sequence contains multiple jump instructions or new + labels, more assistance is needed. Splitter is required to create only + unconditional jumps, or simple conditional jump instructions. + Additionally it must attach a `REG_BR_PROB' note to each conditional + jump. An global variable `split_branch_probability' hold the + probability of original branch in case it was an simple conditional + jump, -1 otherwise. To simplify recomputing of edge frequencies, new + sequence is required to have only forward jumps to the newly created + labels. + + For the common case where the pattern of a define_split exactly + matches the pattern of a define_insn, use `define_insn_and_split'. It + looks like this: + + (define_insn_and_split + [INSN-PATTERN] + "CONDITION" + "OUTPUT-TEMPLATE" + "SPLIT-CONDITION" + [NEW-INSN-PATTERN-1 + NEW-INSN-PATTERN-2 + ...] + "PREPARATION-STATEMENTS" + [INSN-ATTRIBUTES]) + + INSN-PATTERN, CONDITION, OUTPUT-TEMPLATE, and INSN-ATTRIBUTES are + used as in `define_insn'. The NEW-INSN-PATTERN vector and the + PREPARATION-STATEMENTS are used as in a `define_split'. The + SPLIT-CONDITION is also used as in `define_split', with the additional + behavior that if the condition starts with `&&', the condition used for + the split will be the constructed as a logical "and" of the split + condition with the insn condition. For example, from i386.md: + + (define_insn_and_split "zero_extendhisi2_and" + [(set (match_operand:SI 0 "register_operand" "=r") + (zero_extend:SI (match_operand:HI 1 "register_operand" "0"))) + (clobber (reg:CC 17))] + "TARGET_ZERO_EXTEND_WITH_AND && !optimize_size" + "#" + "&& reload_completed" + [(parallel [(set (match_dup 0) + (and:SI (match_dup 0) (const_int 65535))) + (clobber (reg:CC 17))])] + "" + [(set_attr "type" "alu1")]) + + In this case, the actual split condition will be + `TARGET_ZERO_EXTEND_WITH_AND && !optimize_size && reload_completed'. + + The `define_insn_and_split' construction provides exactly the same + functionality as two separate `define_insn' and `define_split' + patterns. It exists for compactness, and as a maintenance tool to + prevent having to ensure the two patterns' templates match. + +  + File: gccint.info, Node: Including Patterns, Next: Peephole Definitions, Prev: Insn Splitting, Up: Machine Desc + + Including Patterns in Machine Descriptions. + =========================================== + + The `include' pattern tells the compiler tools where to look for + patterns that are in files other than in the file `.md'. This is used + only at build time and there is no preprocessing allowed. + + It looks like: + + + (include + PATHNAME) + + For example: + + + (include "filestuff") + + Where PATHNAME is a string that specifies the the location of the + file, specifies the include file to be in + `gcc/config/target/filestuff'. The directory `gcc/config/target' is + regarded as the default directory. + + Machine descriptions may be split up into smaller more manageable + subsections and placed into subdirectories. + + By specifying: + + + (include "BOGUS/filestuff") + + the include file is specified to be in + `gcc/config/TARGET/BOGUS/filestuff'. + + Specifying an absolute path for the include file such as; + + (include "/u2/BOGUS/filestuff") + is permitted but is not encouraged. + + RTL Generation Tool Options for Directory Search + ------------------------------------------------ + + The `-IDIR' option specifies directories to search for machine + descriptions. For example: + + + genrecog -I/p1/abc/proc1 -I/p2/abcd/pro2 target.md + + Add the directory DIR to the head of the list of directories to be + searched for header files. This can be used to override a system + machine definition file, substituting your own version, since these + directories are searched before the default machine description file + directories. If you use more than one `-I' option, the directories are + scanned in left-to-right order; the standard default directory come + after. + +  + File: gccint.info, Node: Peephole Definitions, Next: Insn Attributes, Prev: Including Patterns, Up: Machine Desc + + Machine-Specific Peephole Optimizers + ==================================== + + In addition to instruction patterns the `md' file may contain + definitions of machine-specific peephole optimizations. + + The combiner does not notice certain peephole optimizations when the + data flow in the program does not suggest that it should try them. For + example, sometimes two consecutive insns related in purpose can be + combined even though the second one does not appear to use a register + computed in the first one. A machine-specific peephole optimizer can + detect such opportunities. + + There are two forms of peephole definitions that may be used. The + original `define_peephole' is run at assembly output time to match + insns and substitute assembly text. Use of `define_peephole' is + deprecated. + + A newer `define_peephole2' matches insns and substitutes new insns. + The `peephole2' pass is run after register allocation but before + scheduling, which may result in much better code for targets that do + scheduling. + + * Menu: + + * define_peephole:: RTL to Text Peephole Optimizers + * define_peephole2:: RTL to RTL Peephole Optimizers + +  + File: gccint.info, Node: define_peephole, Next: define_peephole2, Up: Peephole Definitions + + RTL to Text Peephole Optimizers + ------------------------------- + + A definition looks like this: + + (define_peephole + [INSN-PATTERN-1 + INSN-PATTERN-2 + ...] + "CONDITION" + "TEMPLATE" + "OPTIONAL-INSN-ATTRIBUTES") + + The last string operand may be omitted if you are not using any + machine-specific information in this machine description. If present, + it must obey the same rules as in a `define_insn'. + + In this skeleton, INSN-PATTERN-1 and so on are patterns to match + consecutive insns. The optimization applies to a sequence of insns when + INSN-PATTERN-1 matches the first one, INSN-PATTERN-2 matches the next, + and so on. + + Each of the insns matched by a peephole must also match a + `define_insn'. Peepholes are checked only at the last stage just + before code generation, and only optionally. Therefore, any insn which + would match a peephole but no `define_insn' will cause a crash in code + generation in an unoptimized compilation, or at various optimization + stages. + + The operands of the insns are matched with `match_operands', + `match_operator', and `match_dup', as usual. What is not usual is that + the operand numbers apply to all the insn patterns in the definition. + So, you can check for identical operands in two insns by using + `match_operand' in one insn and `match_dup' in the other. + + The operand constraints used in `match_operand' patterns do not have + any direct effect on the applicability of the peephole, but they will + be validated afterward, so make sure your constraints are general enough + to apply whenever the peephole matches. If the peephole matches but + the constraints are not satisfied, the compiler will crash. + + It is safe to omit constraints in all the operands of the peephole; + or you can write constraints which serve as a double-check on the + criteria previously tested. + + Once a sequence of insns matches the patterns, the CONDITION is + checked. This is a C expression which makes the final decision whether + to perform the optimization (we do so if the expression is nonzero). If + CONDITION is omitted (in other words, the string is empty) then the + optimization is applied to every sequence of insns that matches the + patterns. + + The defined peephole optimizations are applied after register + allocation is complete. Therefore, the peephole definition can check + which operands have ended up in which kinds of registers, just by + looking at the operands. + + The way to refer to the operands in CONDITION is to write + `operands[I]' for operand number I (as matched by `(match_operand I + ...)'). Use the variable `insn' to refer to the last of the insns + being matched; use `prev_active_insn' to find the preceding insns. + + When optimizing computations with intermediate results, you can use + CONDITION to match only when the intermediate results are not used + elsewhere. Use the C expression `dead_or_set_p (INSN, OP)', where INSN + is the insn in which you expect the value to be used for the last time + (from the value of `insn', together with use of `prev_nonnote_insn'), + and OP is the intermediate value (from `operands[I]'). + + Applying the optimization means replacing the sequence of insns with + one new insn. The TEMPLATE controls ultimate output of assembler code + for this combined insn. It works exactly like the template of a + `define_insn'. Operand numbers in this template are the same ones used + in matching the original sequence of insns. + + The result of a defined peephole optimizer does not need to match + any of the insn patterns in the machine description; it does not even + have an opportunity to match them. The peephole optimizer definition + itself serves as the insn pattern to control how the insn is output. + + Defined peephole optimizers are run as assembler code is being + output, so the insns they produce are never combined or rearranged in + any way. + + Here is an example, taken from the 68000 machine description: + + (define_peephole + [(set (reg:SI 15) (plus:SI (reg:SI 15) (const_int 4))) + (set (match_operand:DF 0 "register_operand" "=f") + (match_operand:DF 1 "register_operand" "ad"))] + "FP_REG_P (operands[0]) && ! FP_REG_P (operands[1])" + { + rtx xoperands[2]; + xoperands[1] = gen_rtx (REG, SImode, REGNO (operands[1]) + 1); + #ifdef MOTOROLA + output_asm_insn ("move.l %1,(sp)", xoperands); + output_asm_insn ("move.l %1,-(sp)", operands); + return "fmove.d (sp)+,%0"; + #else + output_asm_insn ("movel %1,sp@", xoperands); + output_asm_insn ("movel %1,sp@-", operands); + return "fmoved sp@+,%0"; + #endif + }) + + The effect of this optimization is to change + + jbsr _foobar + addql #4,sp + movel d1,sp@- + movel d0,sp@- + fmoved sp@+,fp0 + + into + + jbsr _foobar + movel d1,sp@ + movel d0,sp@- + fmoved sp@+,fp0 + + INSN-PATTERN-1 and so on look _almost_ like the second operand of + `define_insn'. There is one important difference: the second operand + of `define_insn' consists of one or more RTX's enclosed in square + brackets. Usually, there is only one: then the same action can be + written as an element of a `define_peephole'. But when there are + multiple actions in a `define_insn', they are implicitly enclosed in a + `parallel'. Then you must explicitly write the `parallel', and the + square brackets within it, in the `define_peephole'. Thus, if an insn + pattern looks like this, + + (define_insn "divmodsi4" + [(set (match_operand:SI 0 "general_operand" "=d") + (div:SI (match_operand:SI 1 "general_operand" "0") + (match_operand:SI 2 "general_operand" "dmsK"))) + (set (match_operand:SI 3 "general_operand" "=d") + (mod:SI (match_dup 1) (match_dup 2)))] + "TARGET_68020" + "divsl%.l %2,%3:%0") + + then the way to mention this insn in a peephole is as follows: + + (define_peephole + [... + (parallel + [(set (match_operand:SI 0 "general_operand" "=d") + (div:SI (match_operand:SI 1 "general_operand" "0") + (match_operand:SI 2 "general_operand" "dmsK"))) + (set (match_operand:SI 3 "general_operand" "=d") + (mod:SI (match_dup 1) (match_dup 2)))]) + ...] + ...) + +  + File: gccint.info, Node: define_peephole2, Prev: define_peephole, Up: Peephole Definitions + + RTL to RTL Peephole Optimizers + ------------------------------ + + The `define_peephole2' definition tells the compiler how to + substitute one sequence of instructions for another sequence, what + additional scratch registers may be needed and what their lifetimes + must be. + + (define_peephole2 + [INSN-PATTERN-1 + INSN-PATTERN-2 + ...] + "CONDITION" + [NEW-INSN-PATTERN-1 + NEW-INSN-PATTERN-2 + ...] + "PREPARATION-STATEMENTS") + + The definition is almost identical to `define_split' (*note Insn + Splitting::) except that the pattern to match is not a single + instruction, but a sequence of instructions. + + It is possible to request additional scratch registers for use in the + output template. If appropriate registers are not free, the pattern + will simply not match. + + Scratch registers are requested with a `match_scratch' pattern at + the top level of the input pattern. The allocated register (initially) + will be dead at the point requested within the original sequence. If + the scratch is used at more than a single point, a `match_dup' pattern + at the top level of the input pattern marks the last position in the + input sequence at which the register must be available. + + Here is an example from the IA-32 machine description: + + (define_peephole2 + [(match_scratch:SI 2 "r") + (parallel [(set (match_operand:SI 0 "register_operand" "") + (match_operator:SI 3 "arith_or_logical_operator" + [(match_dup 0) + (match_operand:SI 1 "memory_operand" "")])) + (clobber (reg:CC 17))])] + "! optimize_size && ! TARGET_READ_MODIFY" + [(set (match_dup 2) (match_dup 1)) + (parallel [(set (match_dup 0) + (match_op_dup 3 [(match_dup 0) (match_dup 2)])) + (clobber (reg:CC 17))])] + "") + + This pattern tries to split a load from its use in the hopes that we'll + be able to schedule around the memory load latency. It allocates a + single `SImode' register of class `GENERAL_REGS' (`"r"') that needs to + be live only at the point just before the arithmetic. + + A real example requiring extended scratch lifetimes is harder to + come by, so here's a silly made-up example: + + (define_peephole2 + [(match_scratch:SI 4 "r") + (set (match_operand:SI 0 "" "") (match_operand:SI 1 "" "")) + (set (match_operand:SI 2 "" "") (match_dup 1)) + (match_dup 4) + (set (match_operand:SI 3 "" "") (match_dup 1))] + "/* determine 1 does not overlap 0 and 2 */" + [(set (match_dup 4) (match_dup 1)) + (set (match_dup 0) (match_dup 4)) + (set (match_dup 2) (match_dup 4))] + (set (match_dup 3) (match_dup 4))] + "") + + If we had not added the `(match_dup 4)' in the middle of the input + sequence, it might have been the case that the register we chose at the + beginning of the sequence is killed by the first or second `set'. + +  + File: gccint.info, Node: Insn Attributes, Next: Conditional Execution, Prev: Peephole Definitions, Up: Machine Desc + + Instruction Attributes + ====================== + + In addition to describing the instruction supported by the target + machine, the `md' file also defines a group of "attributes" and a set of + values for each. Every generated insn is assigned a value for each + attribute. One possible attribute would be the effect that the insn + has on the machine's condition code. This attribute can then be used + by `NOTICE_UPDATE_CC' to track the condition codes. + + * Menu: + + * Defining Attributes:: Specifying attributes and their values. + * Expressions:: Valid expressions for attribute values. + * Tagging Insns:: Assigning attribute values to insns. + * Attr Example:: An example of assigning attributes. + * Insn Lengths:: Computing the length of insns. + * Constant Attributes:: Defining attributes that are constant. + * Delay Slots:: Defining delay slots required for a machine. + * Function Units:: Specifying information for insn scheduling. + +  + File: gccint.info, Node: Defining Attributes, Next: Expressions, Up: Insn Attributes + + Defining Attributes and their Values + ------------------------------------ + + The `define_attr' expression is used to define each attribute + required by the target machine. It looks like: + + (define_attr NAME LIST-OF-VALUES DEFAULT) + + NAME is a string specifying the name of the attribute being defined. + + LIST-OF-VALUES is either a string that specifies a comma-separated + list of values that can be assigned to the attribute, or a null string + to indicate that the attribute takes numeric values. + + DEFAULT is an attribute expression that gives the value of this + attribute for insns that match patterns whose definition does not + include an explicit value for this attribute. *Note Attr Example::, + for more information on the handling of defaults. *Note Constant + Attributes::, for information on attributes that do not depend on any + particular insn. + + For each defined attribute, a number of definitions are written to + the `insn-attr.h' file. For cases where an explicit set of values is + specified for an attribute, the following are defined: + + * A `#define' is written for the symbol `HAVE_ATTR_NAME'. + + * An enumeral class is defined for `attr_NAME' with elements of the + form `UPPER-NAME_UPPER-VALUE' where the attribute name and value + are first converted to upper case. + + * A function `get_attr_NAME' is defined that is passed an insn and + returns the attribute value for that insn. + + For example, if the following is present in the `md' file: + + (define_attr "type" "branch,fp,load,store,arith" ...) + + the following lines will be written to the file `insn-attr.h'. + + #define HAVE_ATTR_type + enum attr_type {TYPE_BRANCH, TYPE_FP, TYPE_LOAD, + TYPE_STORE, TYPE_ARITH}; + extern enum attr_type get_attr_type (); + + If the attribute takes numeric values, no `enum' type will be + defined and the function to obtain the attribute's value will return + `int'. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-12 gcc-3.2.3/gcc/doc/gccint.info-12 *** gcc-3.2.2/gcc/doc/gccint.info-12 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-12 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,832 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Expressions, Next: Tagging Insns, Prev: Defining Attributes, Up: Insn Attributes + + Attribute Expressions + --------------------- + + RTL expressions used to define attributes use the codes described + above plus a few specific to attribute definitions, to be discussed + below. Attribute value expressions must have one of the following + forms: + + `(const_int I)' + The integer I specifies the value of a numeric attribute. I must + be non-negative. + + The value of a numeric attribute can be specified either with a + `const_int', or as an integer represented as a string in + `const_string', `eq_attr' (see below), `attr', `symbol_ref', + simple arithmetic expressions, and `set_attr' overrides on + specific instructions (*note Tagging Insns::). + + `(const_string VALUE)' + The string VALUE specifies a constant attribute value. If VALUE + is specified as `"*"', it means that the default value of the + attribute is to be used for the insn containing this expression. + `"*"' obviously cannot be used in the DEFAULT expression of a + `define_attr'. + + If the attribute whose value is being specified is numeric, VALUE + must be a string containing a non-negative integer (normally + `const_int' would be used in this case). Otherwise, it must + contain one of the valid values for the attribute. + + `(if_then_else TEST TRUE-VALUE FALSE-VALUE)' + TEST specifies an attribute test, whose format is defined below. + The value of this expression is TRUE-VALUE if TEST is true, + otherwise it is FALSE-VALUE. + + `(cond [TEST1 VALUE1 ...] DEFAULT)' + The first operand of this expression is a vector containing an even + number of expressions and consisting of pairs of TEST and VALUE + expressions. The value of the `cond' expression is that of the + VALUE corresponding to the first true TEST expression. If none of + the TEST expressions are true, the value of the `cond' expression + is that of the DEFAULT expression. + + TEST expressions can have one of the following forms: + + `(const_int I)' + This test is true if I is nonzero and false otherwise. + + `(not TEST)' + `(ior TEST1 TEST2)' + `(and TEST1 TEST2)' + These tests are true if the indicated logical function is true. + + `(match_operand:M N PRED CONSTRAINTS)' + This test is true if operand N of the insn whose attribute value + is being determined has mode M (this part of the test is ignored + if M is `VOIDmode') and the function specified by the string PRED + returns a nonzero value when passed operand N and mode M (this + part of the test is ignored if PRED is the null string). + + The CONSTRAINTS operand is ignored and should be the null string. + + `(le ARITH1 ARITH2)' + `(leu ARITH1 ARITH2)' + `(lt ARITH1 ARITH2)' + `(ltu ARITH1 ARITH2)' + `(gt ARITH1 ARITH2)' + `(gtu ARITH1 ARITH2)' + `(ge ARITH1 ARITH2)' + `(geu ARITH1 ARITH2)' + `(ne ARITH1 ARITH2)' + `(eq ARITH1 ARITH2)' + These tests are true if the indicated comparison of the two + arithmetic expressions is true. Arithmetic expressions are formed + with `plus', `minus', `mult', `div', `mod', `abs', `neg', `and', + `ior', `xor', `not', `ashift', `lshiftrt', and `ashiftrt' + expressions. + + `const_int' and `symbol_ref' are always valid terms (*note Insn + Lengths::,for additional forms). `symbol_ref' is a string + denoting a C expression that yields an `int' when evaluated by the + `get_attr_...' routine. It should normally be a global variable. + + `(eq_attr NAME VALUE)' + NAME is a string specifying the name of an attribute. + + VALUE is a string that is either a valid value for attribute NAME, + a comma-separated list of values, or `!' followed by a value or + list. If VALUE does not begin with a `!', this test is true if + the value of the NAME attribute of the current insn is in the list + specified by VALUE. If VALUE begins with a `!', this test is true + if the attribute's value is _not_ in the specified list. + + For example, + + (eq_attr "type" "load,store") + + is equivalent to + + (ior (eq_attr "type" "load") (eq_attr "type" "store")) + + If NAME specifies an attribute of `alternative', it refers to the + value of the compiler variable `which_alternative' (*note Output + Statement::) and the values must be small integers. For example, + + (eq_attr "alternative" "2,3") + + is equivalent to + + (ior (eq (symbol_ref "which_alternative") (const_int 2)) + (eq (symbol_ref "which_alternative") (const_int 3))) + + Note that, for most attributes, an `eq_attr' test is simplified in + cases where the value of the attribute being tested is known for + all insns matching a particular pattern. This is by far the most + common case. + + `(attr_flag NAME)' + The value of an `attr_flag' expression is true if the flag + specified by NAME is true for the `insn' currently being scheduled. + + NAME is a string specifying one of a fixed set of flags to test. + Test the flags `forward' and `backward' to determine the direction + of a conditional branch. Test the flags `very_likely', `likely', + `very_unlikely', and `unlikely' to determine if a conditional + branch is expected to be taken. + + If the `very_likely' flag is true, then the `likely' flag is also + true. Likewise for the `very_unlikely' and `unlikely' flags. + + This example describes a conditional branch delay slot which can + be nullified for forward branches that are taken (annul-true) or + for backward branches which are not taken (annul-false). + + (define_delay (eq_attr "type" "cbranch") + [(eq_attr "in_branch_delay" "true") + (and (eq_attr "in_branch_delay" "true") + (attr_flag "forward")) + (and (eq_attr "in_branch_delay" "true") + (attr_flag "backward"))]) + + The `forward' and `backward' flags are false if the current `insn' + being scheduled is not a conditional branch. + + The `very_likely' and `likely' flags are true if the `insn' being + scheduled is not a conditional branch. The `very_unlikely' and + `unlikely' flags are false if the `insn' being scheduled is not a + conditional branch. + + `attr_flag' is only used during delay slot scheduling and has no + meaning to other passes of the compiler. + + `(attr NAME)' + The value of another attribute is returned. This is most useful + for numeric attributes, as `eq_attr' and `attr_flag' produce more + efficient code for non-numeric attributes. + +  + File: gccint.info, Node: Tagging Insns, Next: Attr Example, Prev: Expressions, Up: Insn Attributes + + Assigning Attribute Values to Insns + ----------------------------------- + + The value assigned to an attribute of an insn is primarily + determined by which pattern is matched by that insn (or which + `define_peephole' generated it). Every `define_insn' and + `define_peephole' can have an optional last argument to specify the + values of attributes for matching insns. The value of any attribute + not specified in a particular insn is set to the default value for that + attribute, as specified in its `define_attr'. Extensive use of default + values for attributes permits the specification of the values for only + one or two attributes in the definition of most insn patterns, as seen + in the example in the next section. + + The optional last argument of `define_insn' and `define_peephole' is + a vector of expressions, each of which defines the value for a single + attribute. The most general way of assigning an attribute's value is + to use a `set' expression whose first operand is an `attr' expression + giving the name of the attribute being set. The second operand of the + `set' is an attribute expression (*note Expressions::) giving the value + of the attribute. + + When the attribute value depends on the `alternative' attribute + (i.e., which is the applicable alternative in the constraint of the + insn), the `set_attr_alternative' expression can be used. It allows + the specification of a vector of attribute expressions, one for each + alternative. + + When the generality of arbitrary attribute expressions is not + required, the simpler `set_attr' expression can be used, which allows + specifying a string giving either a single attribute value or a list of + attribute values, one for each alternative. + + The form of each of the above specifications is shown below. In + each case, NAME is a string specifying the attribute to be set. + + `(set_attr NAME VALUE-STRING)' + VALUE-STRING is either a string giving the desired attribute value, + or a string containing a comma-separated list giving the values for + succeeding alternatives. The number of elements must match the + number of alternatives in the constraint of the insn pattern. + + Note that it may be useful to specify `*' for some alternative, in + which case the attribute will assume its default value for insns + matching that alternative. + + `(set_attr_alternative NAME [VALUE1 VALUE2 ...])' + Depending on the alternative of the insn, the value will be one of + the specified values. This is a shorthand for using a `cond' with + tests on the `alternative' attribute. + + `(set (attr NAME) VALUE)' + The first operand of this `set' must be the special RTL expression + `attr', whose sole operand is a string giving the name of the + attribute being set. VALUE is the value of the attribute. + + The following shows three different ways of representing the same + attribute value specification: + + (set_attr "type" "load,store,arith") + + (set_attr_alternative "type" + [(const_string "load") (const_string "store") + (const_string "arith")]) + + (set (attr "type") + (cond [(eq_attr "alternative" "1") (const_string "load") + (eq_attr "alternative" "2") (const_string "store")] + (const_string "arith"))) + + The `define_asm_attributes' expression provides a mechanism to + specify the attributes assigned to insns produced from an `asm' + statement. It has the form: + + (define_asm_attributes [ATTR-SETS]) + + where ATTR-SETS is specified the same as for both the `define_insn' and + the `define_peephole' expressions. + + These values will typically be the "worst case" attribute values. + For example, they might indicate that the condition code will be + clobbered. + + A specification for a `length' attribute is handled specially. The + way to compute the length of an `asm' insn is to multiply the length + specified in the expression `define_asm_attributes' by the number of + machine instructions specified in the `asm' statement, determined by + counting the number of semicolons and newlines in the string. + Therefore, the value of the `length' attribute specified in a + `define_asm_attributes' should be the maximum possible length of a + single machine instruction. + +  + File: gccint.info, Node: Attr Example, Next: Insn Lengths, Prev: Tagging Insns, Up: Insn Attributes + + Example of Attribute Specifications + ----------------------------------- + + The judicious use of defaulting is important in the efficient use of + insn attributes. Typically, insns are divided into "types" and an + attribute, customarily called `type', is used to represent this value. + This attribute is normally used only to define the default value for + other attributes. An example will clarify this usage. + + Assume we have a RISC machine with a condition code and in which only + full-word operations are performed in registers. Let us assume that we + can divide all insns into loads, stores, (integer) arithmetic + operations, floating point operations, and branches. + + Here we will concern ourselves with determining the effect of an + insn on the condition code and will limit ourselves to the following + possible effects: The condition code can be set unpredictably + (clobbered), not be changed, be set to agree with the results of the + operation, or only changed if the item previously set into the + condition code has been modified. + + Here is part of a sample `md' file for such a machine: + + (define_attr "type" "load,store,arith,fp,branch" (const_string "arith")) + + (define_attr "cc" "clobber,unchanged,set,change0" + (cond [(eq_attr "type" "load") + (const_string "change0") + (eq_attr "type" "store,branch") + (const_string "unchanged") + (eq_attr "type" "arith") + (if_then_else (match_operand:SI 0 "" "") + (const_string "set") + (const_string "clobber"))] + (const_string "clobber"))) + + (define_insn "" + [(set (match_operand:SI 0 "general_operand" "=r,r,m") + (match_operand:SI 1 "general_operand" "r,m,r"))] + "" + "@ + move %0,%1 + load %0,%1 + store %0,%1" + [(set_attr "type" "arith,load,store")]) + + Note that we assume in the above example that arithmetic operations + performed on quantities smaller than a machine word clobber the + condition code since they will set the condition code to a value + corresponding to the full-word result. + +  + File: gccint.info, Node: Insn Lengths, Next: Constant Attributes, Prev: Attr Example, Up: Insn Attributes + + Computing the Length of an Insn + ------------------------------- + + For many machines, multiple types of branch instructions are + provided, each for different length branch displacements. In most + cases, the assembler will choose the correct instruction to use. + However, when the assembler cannot do so, GCC can when a special + attribute, the `length' attribute, is defined. This attribute must be + defined to have numeric values by specifying a null string in its + `define_attr'. + + In the case of the `length' attribute, two additional forms of + arithmetic terms are allowed in test expressions: + + `(match_dup N)' + This refers to the address of operand N of the current insn, which + must be a `label_ref'. + + `(pc)' + This refers to the address of the _current_ insn. It might have + been more consistent with other usage to make this the address of + the _next_ insn but this would be confusing because the length of + the current insn is to be computed. + + For normal insns, the length will be determined by value of the + `length' attribute. In the case of `addr_vec' and `addr_diff_vec' insn + patterns, the length is computed as the number of vectors multiplied by + the size of each vector. + + Lengths are measured in addressable storage units (bytes). + + The following macros can be used to refine the length computation: + + `FIRST_INSN_ADDRESS' + When the `length' insn attribute is used, this macro specifies the + value to be assigned to the address of the first insn in a + function. If not specified, 0 is used. + + `ADJUST_INSN_LENGTH (INSN, LENGTH)' + If defined, modifies the length assigned to instruction INSN as a + function of the context in which it is used. LENGTH is an lvalue + that contains the initially computed length of the insn and should + be updated with the correct length of the insn. + + This macro will normally not be required. A case in which it is + required is the ROMP. On this machine, the size of an `addr_vec' + insn must be increased by two to compensate for the fact that + alignment may be required. + + The routine that returns `get_attr_length' (the value of the + `length' attribute) can be used by the output routine to determine the + form of the branch instruction to be written, as the example below + illustrates. + + As an example of the specification of variable-length branches, + consider the IBM 360. If we adopt the convention that a register will + be set to the starting address of a function, we can jump to labels + within 4k of the start using a four-byte instruction. Otherwise, we + need a six-byte sequence to load the address from memory and then + branch to it. + + On such a machine, a pattern for a branch instruction might be + specified as follows: + + (define_insn "jump" + [(set (pc) + (label_ref (match_operand 0 "" "")))] + "" + { + return (get_attr_length (insn) == 4 + ? "b %l0" : "l r15,=a(%l0); br r15"); + } + [(set (attr "length") + (if_then_else (lt (match_dup 0) (const_int 4096)) + (const_int 4) + (const_int 6)))]) + +  + File: gccint.info, Node: Constant Attributes, Next: Delay Slots, Prev: Insn Lengths, Up: Insn Attributes + + Constant Attributes + ------------------- + + A special form of `define_attr', where the expression for the + default value is a `const' expression, indicates an attribute that is + constant for a given run of the compiler. Constant attributes may be + used to specify which variety of processor is used. For example, + + (define_attr "cpu" "m88100,m88110,m88000" + (const + (cond [(symbol_ref "TARGET_88100") (const_string "m88100") + (symbol_ref "TARGET_88110") (const_string "m88110")] + (const_string "m88000")))) + + (define_attr "memory" "fast,slow" + (const + (if_then_else (symbol_ref "TARGET_FAST_MEM") + (const_string "fast") + (const_string "slow")))) + + The routine generated for constant attributes has no parameters as it + does not depend on any particular insn. RTL expressions used to define + the value of a constant attribute may use the `symbol_ref' form, but + may not use either the `match_operand' form or `eq_attr' forms + involving insn attributes. + +  + File: gccint.info, Node: Delay Slots, Next: Function Units, Prev: Constant Attributes, Up: Insn Attributes + + Delay Slot Scheduling + --------------------- + + The insn attribute mechanism can be used to specify the requirements + for delay slots, if any, on a target machine. An instruction is said to + require a "delay slot" if some instructions that are physically after + the instruction are executed as if they were located before it. + Classic examples are branch and call instructions, which often execute + the following instruction before the branch or call is performed. + + On some machines, conditional branch instructions can optionally + "annul" instructions in the delay slot. This means that the + instruction will not be executed for certain branch outcomes. Both + instructions that annul if the branch is true and instructions that + annul if the branch is false are supported. + + Delay slot scheduling differs from instruction scheduling in that + determining whether an instruction needs a delay slot is dependent only + on the type of instruction being generated, not on data flow between the + instructions. See the next section for a discussion of data-dependent + instruction scheduling. + + The requirement of an insn needing one or more delay slots is + indicated via the `define_delay' expression. It has the following form: + + (define_delay TEST + [DELAY-1 ANNUL-TRUE-1 ANNUL-FALSE-1 + DELAY-2 ANNUL-TRUE-2 ANNUL-FALSE-2 + ...]) + + TEST is an attribute test that indicates whether this `define_delay' + applies to a particular insn. If so, the number of required delay + slots is determined by the length of the vector specified as the second + argument. An insn placed in delay slot N must satisfy attribute test + DELAY-N. ANNUL-TRUE-N is an attribute test that specifies which insns + may be annulled if the branch is true. Similarly, ANNUL-FALSE-N + specifies which insns in the delay slot may be annulled if the branch + is false. If annulling is not supported for that delay slot, `(nil)' + should be coded. + + For example, in the common case where branch and call insns require + a single delay slot, which may contain any insn other than a branch or + call, the following would be placed in the `md' file: + + (define_delay (eq_attr "type" "branch,call") + [(eq_attr "type" "!branch,call") (nil) (nil)]) + + Multiple `define_delay' expressions may be specified. In this case, + each such expression specifies different delay slot requirements and + there must be no insn for which tests in two `define_delay' expressions + are both true. + + For example, if we have a machine that requires one delay slot for + branches but two for calls, no delay slot can contain a branch or call + insn, and any valid insn in the delay slot for the branch can be + annulled if the branch is true, we might represent this as follows: + + (define_delay (eq_attr "type" "branch") + [(eq_attr "type" "!branch,call") + (eq_attr "type" "!branch,call") + (nil)]) + + (define_delay (eq_attr "type" "call") + [(eq_attr "type" "!branch,call") (nil) (nil) + (eq_attr "type" "!branch,call") (nil) (nil)]) + +  + File: gccint.info, Node: Function Units, Prev: Delay Slots, Up: Insn Attributes + + Specifying Function Units + ------------------------- + + On most RISC machines, there are instructions whose results are not + available for a specific number of cycles. Common cases are + instructions that load data from memory. On many machines, a pipeline + stall will result if the data is referenced too soon after the load + instruction. + + In addition, many newer microprocessors have multiple function + units, usually one for integer and one for floating point, and often + will incur pipeline stalls when a result that is needed is not yet + ready. + + The descriptions in this section allow the specification of how much + time must elapse between the execution of an instruction and the time + when its result is used. It also allows specification of when the + execution of an instruction will delay execution of similar instructions + due to function unit conflicts. + + For the purposes of the specifications in this section, a machine is + divided into "function units", each of which execute a specific class + of instructions in first-in-first-out order. Function units that + accept one instruction each cycle and allow a result to be used in the + succeeding instruction (usually via forwarding) need not be specified. + Classic RISC microprocessors will normally have a single function unit, + which we can call `memory'. The newer "superscalar" processors will + often have function units for floating point operations, usually at + least a floating point adder and multiplier. + + Each usage of a function units by a class of insns is specified with + a `define_function_unit' expression, which looks like this: + + (define_function_unit NAME MULTIPLICITY SIMULTANEITY + TEST READY-DELAY ISSUE-DELAY + [CONFLICT-LIST]) + + NAME is a string giving the name of the function unit. + + MULTIPLICITY is an integer specifying the number of identical units + in the processor. If more than one unit is specified, they will be + scheduled independently. Only truly independent units should be + counted; a pipelined unit should be specified as a single unit. (The + only common example of a machine that has multiple function units for a + single instruction class that are truly independent and not pipelined + are the two multiply and two increment units of the CDC 6600.) + + SIMULTANEITY specifies the maximum number of insns that can be + executing in each instance of the function unit simultaneously or zero + if the unit is pipelined and has no limit. + + All `define_function_unit' definitions referring to function unit + NAME must have the same name and values for MULTIPLICITY and + SIMULTANEITY. + + TEST is an attribute test that selects the insns we are describing + in this definition. Note that an insn may use more than one function + unit and a function unit may be specified in more than one + `define_function_unit'. + + READY-DELAY is an integer that specifies the number of cycles after + which the result of the instruction can be used without introducing any + stalls. + + ISSUE-DELAY is an integer that specifies the number of cycles after + the instruction matching the TEST expression begins using this unit + until a subsequent instruction can begin. A cost of N indicates an N-1 + cycle delay. A subsequent instruction may also be delayed if an + earlier instruction has a longer READY-DELAY value. This blocking + effect is computed using the SIMULTANEITY, READY-DELAY, ISSUE-DELAY, + and CONFLICT-LIST terms. For a normal non-pipelined function unit, + SIMULTANEITY is one, the unit is taken to block for the READY-DELAY + cycles of the executing insn, and smaller values of ISSUE-DELAY are + ignored. + + CONFLICT-LIST is an optional list giving detailed conflict costs for + this unit. If specified, it is a list of condition test expressions to + be applied to insns chosen to execute in NAME following the particular + insn matching TEST that is already executing in NAME. For each insn in + the list, ISSUE-DELAY specifies the conflict cost; for insns not in the + list, the cost is zero. If not specified, CONFLICT-LIST defaults to + all instructions that use the function unit. + + Typical uses of this vector are where a floating point function unit + can pipeline either single- or double-precision operations, but not + both, or where a memory unit can pipeline loads, but not stores, etc. + + As an example, consider a classic RISC machine where the result of a + load instruction is not available for two cycles (a single "delay" + instruction is required) and where only one load instruction can be + executed simultaneously. This would be specified as: + + (define_function_unit "memory" 1 1 (eq_attr "type" "load") 2 0) + + For the case of a floating point function unit that can pipeline + either single or double precision, but not both, the following could be + specified: + + (define_function_unit + "fp" 1 0 (eq_attr "type" "sp_fp") 4 4 [(eq_attr "type" "dp_fp")]) + (define_function_unit + "fp" 1 0 (eq_attr "type" "dp_fp") 4 4 [(eq_attr "type" "sp_fp")]) + + *Note:* The scheduler attempts to avoid function unit conflicts and + uses all the specifications in the `define_function_unit' expression. + It has recently come to our attention that these specifications may not + allow modeling of some of the newer "superscalar" processors that have + insns using multiple pipelined units. These insns will cause a + potential conflict for the second unit used during their execution and + there is no way of representing that conflict. We welcome any examples + of how function unit conflicts work in such processors and suggestions + for their representation. + +  + File: gccint.info, Node: Conditional Execution, Next: Constant Definitions, Prev: Insn Attributes, Up: Machine Desc + + Conditional Execution + ===================== + + A number of architectures provide for some form of conditional + execution, or predication. The hallmark of this feature is the ability + to nullify most of the instructions in the instruction set. When the + instruction set is large and not entirely symmetric, it can be quite + tedious to describe these forms directly in the `.md' file. An + alternative is the `define_cond_exec' template. + + (define_cond_exec + [PREDICATE-PATTERN] + "CONDITION" + "OUTPUT-TEMPLATE") + + PREDICATE-PATTERN is the condition that must be true for the insn to + be executed at runtime and should match a relational operator. One can + use `match_operator' to match several relational operators at once. + Any `match_operand' operands must have no more than one alternative. + + CONDITION is a C expression that must be true for the generated + pattern to match. + + OUTPUT-TEMPLATE is a string similar to the `define_insn' output + template (*note Output Template::), except that the `*' and `@' special + cases do not apply. This is only useful if the assembly text for the + predicate is a simple prefix to the main insn. In order to handle the + general case, there is a global variable `current_insn_predicate' that + will contain the entire predicate if the current insn is predicated, + and will otherwise be `NULL'. + + When `define_cond_exec' is used, an implicit reference to the + `predicable' instruction attribute is made. *Note Insn Attributes::. + This attribute must be boolean (i.e. have exactly two elements in its + LIST-OF-VALUES). Further, it must not be used with complex + expressions. That is, the default and all uses in the insns must be a + simple constant, not dependent on the alternative or anything else. + + For each `define_insn' for which the `predicable' attribute is true, + a new `define_insn' pattern will be generated that matches a predicated + version of the instruction. For example, + + (define_insn "addsi" + [(set (match_operand:SI 0 "register_operand" "r") + (plus:SI (match_operand:SI 1 "register_operand" "r") + (match_operand:SI 2 "register_operand" "r")))] + "TEST1" + "add %2,%1,%0") + + (define_cond_exec + [(ne (match_operand:CC 0 "register_operand" "c") + (const_int 0))] + "TEST2" + "(%0)") + + generates a new pattern + + (define_insn "" + [(cond_exec + (ne (match_operand:CC 3 "register_operand" "c") (const_int 0)) + (set (match_operand:SI 0 "register_operand" "r") + (plus:SI (match_operand:SI 1 "register_operand" "r") + (match_operand:SI 2 "register_operand" "r"))))] + "(TEST2) && (TEST1)" + "(%3) add %2,%1,%0") + +  + File: gccint.info, Node: Constant Definitions, Prev: Conditional Execution, Up: Machine Desc + + Constant Definitions + ==================== + + Using literal constants inside instruction patterns reduces + legibility and can be a maintenance problem. + + To overcome this problem, you may use the `define_constants' + expression. It contains a vector of name-value pairs. From that point + on, wherever any of the names appears in the MD file, it is as if the + corresponding value had been written instead. You may use + `define_constants' multiple times; each appearance adds more constants + to the table. It is an error to redefine a constant with a different + value. + + To come back to the a29k load multiple example, instead of + + (define_insn "" + [(match_parallel 0 "load_multiple_operation" + [(set (match_operand:SI 1 "gpc_reg_operand" "=r") + (match_operand:SI 2 "memory_operand" "m")) + (use (reg:SI 179)) + (clobber (reg:SI 179))])] + "" + "loadm 0,0,%1,%2") + + You could write: + + (define_constants [ + (R_BP 177) + (R_FC 178) + (R_CR 179) + (R_Q 180) + ]) + + (define_insn "" + [(match_parallel 0 "load_multiple_operation" + [(set (match_operand:SI 1 "gpc_reg_operand" "=r") + (match_operand:SI 2 "memory_operand" "m")) + (use (reg:SI R_CR)) + (clobber (reg:SI R_CR))])] + "" + "loadm 0,0,%1,%2") + + The constants that are defined with a define_constant are also output + in the insn-codes.h header file as #defines. + +  + File: gccint.info, Node: Target Macros, Next: Host Config, Prev: Machine Desc, Up: Top + + Target Description Macros and Functions + *************************************** + + In addition to the file `MACHINE.md', a machine description includes + a C header file conventionally given the name `MACHINE.h' and a C + source file named `MACHINE.c'. The header file defines numerous macros + that convey the information about the target machine that does not fit + into the scheme of the `.md' file. The file `tm.h' should be a link to + `MACHINE.h'. The header file `config.h' includes `tm.h' and most + compiler source files include `config.h'. The source file defines a + variable `targetm', which is a structure containing pointers to + functions and data relating to the target machine. `MACHINE.c' should + also contain their definitions, if they are not defined elsewhere in + GCC, and other functions called through the macros defined in the `.h' + file. + + * Menu: + + * Target Structure:: The `targetm' variable. + * Driver:: Controlling how the driver runs the compilation passes. + * Run-time Target:: Defining `-m' options like `-m68000' and `-m68020'. + * Per-Function Data:: Defining data structures for per-function information. + * Storage Layout:: Defining sizes and alignments of data. + * Type Layout:: Defining sizes and properties of basic user data types. + * Escape Sequences:: Defining the value of target character escape sequences + * Registers:: Naming and describing the hardware registers. + * Register Classes:: Defining the classes of hardware registers. + * Stack and Calling:: Defining which way the stack grows and by how much. + * Varargs:: Defining the varargs macros. + * Trampolines:: Code set up at run time to enter a nested function. + * Library Calls:: Controlling how library routines are implicitly called. + * Addressing Modes:: Defining addressing modes valid for memory operands. + * Condition Code:: Defining how insns update the condition code. + * Costs:: Defining relative costs of different operations. + * Scheduling:: Adjusting the behavior of the instruction scheduler. + * Sections:: Dividing storage into text, data, and other sections. + * PIC:: Macros for position independent code. + * Assembler Format:: Defining how to write insns and pseudo-ops to output. + * Debugging Info:: Defining the format of debugging output. + * Cross-compilation:: Handling floating point for cross-compilers. + * Mode Switching:: Insertion of mode-switching instructions. + * Target Attributes:: Defining target-specific uses of `__attribute__'. + * Misc:: Everything else. + +  + File: gccint.info, Node: Target Structure, Next: Driver, Up: Target Macros + + The Global `targetm' Variable + ============================= + + - Variable: struct gcc_target targetm + The target `.c' file must define the global `targetm' variable + which contains pointers to functions and data relating to the + target machine. The variable is declared in `target.h'; + `target-def.h' defines the macro `TARGET_INITIALIZER' which is + used to initialize the variable, and macros for the default + initializers for elements of the structure. The `.c' file should + override those macros for which the default definition is + inappropriate. For example: + #include "target.h" + #include "target-def.h" + + /* Initialize the GCC target structure. */ + + #undef TARGET_COMP_TYPE_ATTRIBUTES + #define TARGET_COMP_TYPE_ATTRIBUTES MACHINE_comp_type_attributes + + struct gcc_target targetm = TARGET_INITIALIZER; + + Where a macro should be defined in the `.c' file in this manner to + form part of the `targetm' structure, it is documented below as a + "Target Hook" with a prototype. Many macros will change in future from + being defined in the `.h' file to being part of the `targetm' structure. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-13 gcc-3.2.3/gcc/doc/gccint.info-13 *** gcc-3.2.2/gcc/doc/gccint.info-13 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-13 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1164 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Driver, Next: Run-time Target, Prev: Target Structure, Up: Target Macros + + Controlling the Compilation Driver, `gcc' + ========================================= + + You can control the compilation driver. + + `SWITCH_TAKES_ARG (CHAR)' + A C expression which determines whether the option `-CHAR' takes + arguments. The value should be the number of arguments that + option takes-zero, for many options. + + By default, this macro is defined as `DEFAULT_SWITCH_TAKES_ARG', + which handles the standard options properly. You need not define + `SWITCH_TAKES_ARG' unless you wish to add additional options which + take arguments. Any redefinition should call + `DEFAULT_SWITCH_TAKES_ARG' and then check for additional options. + + `WORD_SWITCH_TAKES_ARG (NAME)' + A C expression which determines whether the option `-NAME' takes + arguments. The value should be the number of arguments that + option takes-zero, for many options. This macro rather than + `SWITCH_TAKES_ARG' is used for multi-character option names. + + By default, this macro is defined as + `DEFAULT_WORD_SWITCH_TAKES_ARG', which handles the standard options + properly. You need not define `WORD_SWITCH_TAKES_ARG' unless you + wish to add additional options which take arguments. Any + redefinition should call `DEFAULT_WORD_SWITCH_TAKES_ARG' and then + check for additional options. + + `SWITCH_CURTAILS_COMPILATION (CHAR)' + A C expression which determines whether the option `-CHAR' stops + compilation before the generation of an executable. The value is + boolean, nonzero if the option does stop an executable from being + generated, zero otherwise. + + By default, this macro is defined as + `DEFAULT_SWITCH_CURTAILS_COMPILATION', which handles the standard + options properly. You need not define + `SWITCH_CURTAILS_COMPILATION' unless you wish to add additional + options which affect the generation of an executable. Any + redefinition should call `DEFAULT_SWITCH_CURTAILS_COMPILATION' and + then check for additional options. + + `SWITCHES_NEED_SPACES' + A string-valued C expression which enumerates the options for which + the linker needs a space between the option and its argument. + + If this macro is not defined, the default value is `""'. + + `TARGET_OPTION_TRANSLATE_TABLE' + If defined, a list of pairs of strings, the first of which is a + potential command line target to the `gcc' driver program, and the + second of which is a space-separated (tabs and other whitespace + are not supported) list of options with which to replace the first + option. The target defining this list is responsible for assuring + that the results are valid. Replacement options may not be the + `--opt' style, they must be the `-opt' style. It is the intention + of this macro to provide a mechanism for substitution that affects + the multilibs chosen, such as one option that enables many + options, some of which select multilibs. Example nonsensical + definition, where `-malt-abi', `-EB', and `-mspoo' cause different + multilibs to be chosen: + + #define TARGET_OPTION_TRANSLATE_TABLE \ + { "-fast", "-march=fast-foo -malt-abi -I/usr/fast-foo" }, \ + { "-compat", "-EB -malign=4 -mspoo" } + + `CPP_SPEC' + A C string constant that tells the GCC driver program options to + pass to CPP. It can also specify how to translate options you + give to GCC into options for GCC to pass to the CPP. + + Do not define this macro if it does not need to do anything. + + `CPLUSPLUS_CPP_SPEC' + This macro is just like `CPP_SPEC', but is used for C++, rather + than C. If you do not define this macro, then the value of + `CPP_SPEC' (if any) will be used instead. + + `NO_BUILTIN_SIZE_TYPE' + If this macro is defined, the preprocessor will not define the + built-in macro `__SIZE_TYPE__'. The macro `__SIZE_TYPE__' must + then be defined by `CPP_SPEC' instead. + + This should be defined if `SIZE_TYPE' depends on target dependent + flags which are not accessible to the preprocessor. Otherwise, it + should not be defined. + + `NO_BUILTIN_PTRDIFF_TYPE' + If this macro is defined, the preprocessor will not define the + built-in macro `__PTRDIFF_TYPE__'. The macro `__PTRDIFF_TYPE__' + must then be defined by `CPP_SPEC' instead. + + This should be defined if `PTRDIFF_TYPE' depends on target + dependent flags which are not accessible to the preprocessor. + Otherwise, it should not be defined. + + `NO_BUILTIN_WCHAR_TYPE' + If this macro is defined, the preprocessor will not define the + built-in macro `__WCHAR_TYPE__'. The macro `__WCHAR_TYPE__' must + then be defined by `CPP_SPEC' instead. + + This should be defined if `WCHAR_TYPE' depends on target dependent + flags which are not accessible to the preprocessor. Otherwise, it + should not be defined. + + `NO_BUILTIN_WINT_TYPE' + If this macro is defined, the preprocessor will not define the + built-in macro `__WINT_TYPE__'. The macro `__WINT_TYPE__' must + then be defined by `CPP_SPEC' instead. + + This should be defined if `WINT_TYPE' depends on target dependent + flags which are not accessible to the preprocessor. Otherwise, it + should not be defined. + + `CC1_SPEC' + A C string constant that tells the GCC driver program options to + pass to `cc1', `cc1plus', `f771', and the other language front + ends. It can also specify how to translate options you give to + GCC into options for GCC to pass to front ends. + + Do not define this macro if it does not need to do anything. + + `CC1PLUS_SPEC' + A C string constant that tells the GCC driver program options to + pass to `cc1plus'. It can also specify how to translate options + you give to GCC into options for GCC to pass to the `cc1plus'. + + Do not define this macro if it does not need to do anything. Note + that everything defined in CC1_SPEC is already passed to `cc1plus' + so there is no need to duplicate the contents of CC1_SPEC in + CC1PLUS_SPEC. + + `ASM_SPEC' + A C string constant that tells the GCC driver program options to + pass to the assembler. It can also specify how to translate + options you give to GCC into options for GCC to pass to the + assembler. See the file `sun3.h' for an example of this. + + Do not define this macro if it does not need to do anything. + + `ASM_FINAL_SPEC' + A C string constant that tells the GCC driver program how to run + any programs which cleanup after the normal assembler. Normally, + this is not needed. See the file `mips.h' for an example of this. + + Do not define this macro if it does not need to do anything. + + `LINK_SPEC' + A C string constant that tells the GCC driver program options to + pass to the linker. It can also specify how to translate options + you give to GCC into options for GCC to pass to the linker. + + Do not define this macro if it does not need to do anything. + + `LIB_SPEC' + Another C string constant used much like `LINK_SPEC'. The + difference between the two is that `LIB_SPEC' is used at the end + of the command given to the linker. + + If this macro is not defined, a default is provided that loads the + standard C library from the usual place. See `gcc.c'. + + `LIBGCC_SPEC' + Another C string constant that tells the GCC driver program how + and when to place a reference to `libgcc.a' into the linker + command line. This constant is placed both before and after the + value of `LIB_SPEC'. + + If this macro is not defined, the GCC driver provides a default + that passes the string `-lgcc' to the linker. + + `STARTFILE_SPEC' + Another C string constant used much like `LINK_SPEC'. The + difference between the two is that `STARTFILE_SPEC' is used at the + very beginning of the command given to the linker. + + If this macro is not defined, a default is provided that loads the + standard C startup file from the usual place. See `gcc.c'. + + `ENDFILE_SPEC' + Another C string constant used much like `LINK_SPEC'. The + difference between the two is that `ENDFILE_SPEC' is used at the + very end of the command given to the linker. + + Do not define this macro if it does not need to do anything. + + `THREAD_MODEL_SPEC' + GCC `-v' will print the thread model GCC was configured to use. + However, this doesn't work on platforms that are multilibbed on + thread models, such as AIX 4.3. On such platforms, define + `THREAD_MODEL_SPEC' such that it evaluates to a string without + blanks that names one of the recognized thread models. `%*', the + default value of this macro, will expand to the value of + `thread_file' set in `config.gcc'. + + `EXTRA_SPECS' + Define this macro to provide additional specifications to put in + the `specs' file that can be used in various specifications like + `CC1_SPEC'. + + The definition should be an initializer for an array of structures, + containing a string constant, that defines the specification name, + and a string constant that provides the specification. + + Do not define this macro if it does not need to do anything. + + `EXTRA_SPECS' is useful when an architecture contains several + related targets, which have various `..._SPECS' which are similar + to each other, and the maintainer would like one central place to + keep these definitions. + + For example, the PowerPC System V.4 targets use `EXTRA_SPECS' to + define either `_CALL_SYSV' when the System V calling sequence is + used or `_CALL_AIX' when the older AIX-based calling sequence is + used. + + The `config/rs6000/rs6000.h' target file defines: + + #define EXTRA_SPECS \ + { "cpp_sysv_default", CPP_SYSV_DEFAULT }, + + #define CPP_SYS_DEFAULT "" + + The `config/rs6000/sysv.h' target file defines: + #undef CPP_SPEC + #define CPP_SPEC \ + "%{posix: -D_POSIX_SOURCE } \ + %{mcall-sysv: -D_CALL_SYSV } %{mcall-aix: -D_CALL_AIX } \ + %{!mcall-sysv: %{!mcall-aix: %(cpp_sysv_default) }} \ + %{msoft-float: -D_SOFT_FLOAT} %{mcpu=403: -D_SOFT_FLOAT}" + + #undef CPP_SYSV_DEFAULT + #define CPP_SYSV_DEFAULT "-D_CALL_SYSV" + + while the `config/rs6000/eabiaix.h' target file defines + `CPP_SYSV_DEFAULT' as: + + #undef CPP_SYSV_DEFAULT + #define CPP_SYSV_DEFAULT "-D_CALL_AIX" + + `LINK_LIBGCC_SPECIAL' + Define this macro if the driver program should find the library + `libgcc.a' itself and should not pass `-L' options to the linker. + If you do not define this macro, the driver program will pass the + argument `-lgcc' to tell the linker to do the search and will pass + `-L' options to it. + + `LINK_LIBGCC_SPECIAL_1' + Define this macro if the driver program should find the library + `libgcc.a'. If you do not define this macro, the driver program + will pass the argument `-lgcc' to tell the linker to do the search. + This macro is similar to `LINK_LIBGCC_SPECIAL', except that it does + not affect `-L' options. + + `LINK_GCC_C_SEQUENCE_SPEC' + The sequence in which libgcc and libc are specified to the linker. + By default this is `%G %L %G'. + + `LINK_COMMAND_SPEC' + A C string constant giving the complete command line need to + execute the linker. When you do this, you will need to update + your port each time a change is made to the link command line + within `gcc.c'. Therefore, define this macro only if you need to + completely redefine the command line for invoking the linker and + there is no other way to accomplish the effect you need. + Overriding this macro may be avoidable by overriding + `LINK_GCC_C_SEQUENCE_SPEC' instead. + + `LINK_ELIMINATE_DUPLICATE_LDIRECTORIES' + A nonzero value causes `collect2' to remove duplicate + `-LDIRECTORY' search directories from linking commands. Do not + give it a nonzero value if removing duplicate search directories + changes the linker's semantics. + + `MULTILIB_DEFAULTS' + Define this macro as a C expression for the initializer of an + array of string to tell the driver program which options are + defaults for this target and thus do not need to be handled + specially when using `MULTILIB_OPTIONS'. + + Do not define this macro if `MULTILIB_OPTIONS' is not defined in + the target makefile fragment or if none of the options listed in + `MULTILIB_OPTIONS' are set by default. *Note Target Fragment::. + + `RELATIVE_PREFIX_NOT_LINKDIR' + Define this macro to tell `gcc' that it should only translate a + `-B' prefix into a `-L' linker option if the prefix indicates an + absolute file name. + + `STANDARD_EXEC_PREFIX' + Define this macro as a C string constant if you wish to override + the standard choice of `/usr/local/lib/gcc-lib/' as the default + prefix to try when searching for the executable files of the + compiler. + + `MD_EXEC_PREFIX' + If defined, this macro is an additional prefix to try after + `STANDARD_EXEC_PREFIX'. `MD_EXEC_PREFIX' is not searched when the + `-b' option is used, or the compiler is built as a cross compiler. + If you define `MD_EXEC_PREFIX', then be sure to add it to the + list of directories used to find the assembler in `configure.in'. + + `STANDARD_STARTFILE_PREFIX' + Define this macro as a C string constant if you wish to override + the standard choice of `/usr/local/lib/' as the default prefix to + try when searching for startup files such as `crt0.o'. + + `MD_STARTFILE_PREFIX' + If defined, this macro supplies an additional prefix to try after + the standard prefixes. `MD_EXEC_PREFIX' is not searched when the + `-b' option is used, or when the compiler is built as a cross + compiler. + + `MD_STARTFILE_PREFIX_1' + If defined, this macro supplies yet another prefix to try after the + standard prefixes. It is not searched when the `-b' option is + used, or when the compiler is built as a cross compiler. + + `INIT_ENVIRONMENT' + Define this macro as a C string constant if you wish to set + environment variables for programs called by the driver, such as + the assembler and loader. The driver passes the value of this + macro to `putenv' to initialize the necessary environment + variables. + + `LOCAL_INCLUDE_DIR' + Define this macro as a C string constant if you wish to override + the standard choice of `/usr/local/include' as the default prefix + to try when searching for local header files. `LOCAL_INCLUDE_DIR' + comes before `SYSTEM_INCLUDE_DIR' in the search order. + + Cross compilers do not search either `/usr/local/include' or its + replacement. + + `MODIFY_TARGET_NAME' + Define this macro if you with to define command-line switches that + modify the default target name + + For each switch, you can include a string to be appended to the + first part of the configuration name or a string to be deleted + from the configuration name, if present. The definition should be + an initializer for an array of structures. Each array element + should have three elements: the switch name (a string constant, + including the initial dash), one of the enumeration codes `ADD' or + `DELETE' to indicate whether the string should be inserted or + deleted, and the string to be inserted or deleted (a string + constant). + + For example, on a machine where `64' at the end of the + configuration name denotes a 64-bit target and you want the `-32' + and `-64' switches to select between 32- and 64-bit targets, you + would code + + #define MODIFY_TARGET_NAME \ + { { "-32", DELETE, "64"}, \ + {"-64", ADD, "64"}} + + `SYSTEM_INCLUDE_DIR' + Define this macro as a C string constant if you wish to specify a + system-specific directory to search for header files before the + standard directory. `SYSTEM_INCLUDE_DIR' comes before + `STANDARD_INCLUDE_DIR' in the search order. + + Cross compilers do not use this macro and do not search the + directory specified. + + `STANDARD_INCLUDE_DIR' + Define this macro as a C string constant if you wish to override + the standard choice of `/usr/include' as the default prefix to try + when searching for header files. + + Cross compilers do not use this macro and do not search either + `/usr/include' or its replacement. + + `STANDARD_INCLUDE_COMPONENT' + The "component" corresponding to `STANDARD_INCLUDE_DIR'. See + `INCLUDE_DEFAULTS', below, for the description of components. If + you do not define this macro, no component is used. + + `INCLUDE_DEFAULTS' + Define this macro if you wish to override the entire default + search path for include files. For a native compiler, the default + search path usually consists of `GCC_INCLUDE_DIR', + `LOCAL_INCLUDE_DIR', `SYSTEM_INCLUDE_DIR', + `GPLUSPLUS_INCLUDE_DIR', and `STANDARD_INCLUDE_DIR'. In addition, + `GPLUSPLUS_INCLUDE_DIR' and `GCC_INCLUDE_DIR' are defined + automatically by `Makefile', and specify private search areas for + GCC. The directory `GPLUSPLUS_INCLUDE_DIR' is used only for C++ + programs. + + The definition should be an initializer for an array of structures. + Each array element should have four elements: the directory name (a + string constant), the component name (also a string constant), a + flag for C++-only directories, and a flag showing that the + includes in the directory don't need to be wrapped in `extern `C'' + when compiling C++. Mark the end of the array with a null element. + + The component name denotes what GNU package the include file is + part of, if any, in all upper-case letters. For example, it might + be `GCC' or `BINUTILS'. If the package is part of a + vendor-supplied operating system, code the component name as `0'. + + For example, here is the definition used for VAX/VMS: + + #define INCLUDE_DEFAULTS \ + { \ + { "GNU_GXX_INCLUDE:", "G++", 1, 1}, \ + { "GNU_CC_INCLUDE:", "GCC", 0, 0}, \ + { "SYS$SYSROOT:[SYSLIB.]", 0, 0, 0}, \ + { ".", 0, 0, 0}, \ + { 0, 0, 0, 0} \ + } + + Here is the order of prefixes tried for exec files: + + 1. Any prefixes specified by the user with `-B'. + + 2. The environment variable `GCC_EXEC_PREFIX', if any. + + 3. The directories specified by the environment variable + `COMPILER_PATH'. + + 4. The macro `STANDARD_EXEC_PREFIX'. + + 5. `/usr/lib/gcc/'. + + 6. The macro `MD_EXEC_PREFIX', if any. + + Here is the order of prefixes tried for startfiles: + + 1. Any prefixes specified by the user with `-B'. + + 2. The environment variable `GCC_EXEC_PREFIX', if any. + + 3. The directories specified by the environment variable + `LIBRARY_PATH' (or port-specific name; native only, cross + compilers do not use this). + + 4. The macro `STANDARD_EXEC_PREFIX'. + + 5. `/usr/lib/gcc/'. + + 6. The macro `MD_EXEC_PREFIX', if any. + + 7. The macro `MD_STARTFILE_PREFIX', if any. + + 8. The macro `STANDARD_STARTFILE_PREFIX'. + + 9. `/lib/'. + + 10. `/usr/lib/'. + +  + File: gccint.info, Node: Run-time Target, Next: Per-Function Data, Prev: Driver, Up: Target Macros + + Run-time Target Specification + ============================= + + Here are run-time target specifications. + + `CPP_PREDEFINES' + Define this to be a string constant containing `-D' options to + define the predefined macros that identify this machine and system. + These macros will be predefined unless the `-ansi' option (or a + `-std' option for strict ISO C conformance) is specified. + + In addition, a parallel set of macros are predefined, whose names + are made by appending `__' at the beginning and at the end. These + `__' macros are permitted by the ISO standard, so they are + predefined regardless of whether `-ansi' or a `-std' option is + specified. + + For example, on the Sun, one can use the following value: + + "-Dmc68000 -Dsun -Dunix" + + The result is to define the macros `__mc68000__', `__sun__' and + `__unix__' unconditionally, and the macros `mc68000', `sun' and + `unix' provided `-ansi' is not specified. + + `extern int target_flags;' + This declaration should be present. + + `TARGET_...' + This series of macros is to allow compiler command arguments to + enable or disable the use of optional features of the target + machine. For example, one machine description serves both the + 68000 and the 68020; a command argument tells the compiler whether + it should use 68020-only instructions or not. This command + argument works by means of a macro `TARGET_68020' that tests a bit + in `target_flags'. + + Define a macro `TARGET_FEATURENAME' for each such option. Its + definition should test a bit in `target_flags'. It is recommended + that a helper macro `TARGET_MASK_FEATURENAME' is defined for each + bit-value to test, and used in `TARGET_FEATURENAME' and + `TARGET_SWITCHES'. For example: + + #define TARGET_MASK_68020 1 + #define TARGET_68020 (target_flags & TARGET_MASK_68020) + + One place where these macros are used is in the + condition-expressions of instruction patterns. Note how + `TARGET_68020' appears frequently in the 68000 machine description + file, `m68k.md'. Another place they are used is in the + definitions of the other macros in the `MACHINE.h' file. + + `TARGET_SWITCHES' + This macro defines names of command options to set and clear bits + in `target_flags'. Its definition is an initializer with a + subgrouping for each command option. + + Each subgrouping contains a string constant, that defines the + option name, a number, which contains the bits to set in + `target_flags', and a second string which is the description + displayed by `--help'. If the number is negative then the bits + specified by the number are cleared instead of being set. If the + description string is present but empty, then no help information + will be displayed for that option, but it will not count as an + undocumented option. The actual option name is made by appending + `-m' to the specified name. Non-empty description strings should + be marked with `N_(...)' for `xgettext'. Please do not mark empty + strings because the empty string is reserved by GNU gettext. + `gettext("")' returns the header entry of the message catalog with + meta information, not the empty string. + + In addition to the description for `--help', more detailed + documentation for each option should be added to `invoke.texi'. + + One of the subgroupings should have a null string. The number in + this grouping is the default value for `target_flags'. Any target + options act starting with that value. + + Here is an example which defines `-m68000' and `-m68020' with + opposite meanings, and picks the latter as the default: + + #define TARGET_SWITCHES \ + { { "68020", TARGET_MASK_68020, "" }, \ + { "68000", -TARGET_MASK_68020, \ + N_("Compile for the 68000") }, \ + { "", TARGET_MASK_68020, "" }} + + `TARGET_OPTIONS' + This macro is similar to `TARGET_SWITCHES' but defines names of + command options that have values. Its definition is an + initializer with a subgrouping for each command option. + + Each subgrouping contains a string constant, that defines the + fixed part of the option name, the address of a variable, and a + description string. Non-empty description strings should be + marked with `N_(...)' for `xgettext'. Please do not mark empty + strings because the empty string is reserved by GNU gettext. + `gettext("")' returns the header entry of the message catalog with + meta information, not the empty string. + + The variable, type `char *', is set to the variable part of the + given option if the fixed part matches. The actual option name is + made by appending `-m' to the specified name. Again, each option + should also be documented in `invoke.texi'. + + Here is an example which defines `-mshort-data-NUMBER'. If the + given option is `-mshort-data-512', the variable `m88k_short_data' + will be set to the string `"512"'. + + extern char *m88k_short_data; + #define TARGET_OPTIONS \ + { { "short-data-", &m88k_short_data, \ + N_("Specify the size of the short data section") } } + + `TARGET_VERSION' + This macro is a C statement to print on `stderr' a string + describing the particular machine description choice. Every + machine description should define `TARGET_VERSION'. For example: + + #ifdef MOTOROLA + #define TARGET_VERSION \ + fprintf (stderr, " (68k, Motorola syntax)"); + #else + #define TARGET_VERSION \ + fprintf (stderr, " (68k, MIT syntax)"); + #endif + + `OVERRIDE_OPTIONS' + Sometimes certain combinations of command options do not make + sense on a particular target machine. You can define a macro + `OVERRIDE_OPTIONS' to take account of this. This macro, if + defined, is executed once just after all the command options have + been parsed. + + Don't use this macro to turn on various extra optimizations for + `-O'. That is what `OPTIMIZATION_OPTIONS' is for. + + `OPTIMIZATION_OPTIONS (LEVEL, SIZE)' + Some machines may desire to change what optimizations are + performed for various optimization levels. This macro, if + defined, is executed once just after the optimization level is + determined and before the remainder of the command options have + been parsed. Values set in this macro are used as the default + values for the other command line options. + + LEVEL is the optimization level specified; 2 if `-O2' is + specified, 1 if `-O' is specified, and 0 if neither is specified. + + SIZE is nonzero if `-Os' is specified and zero otherwise. + + You should not use this macro to change options that are not + machine-specific. These should uniformly selected by the same + optimization level on all supported machines. Use this macro to + enable machine-specific optimizations. + + *Do not examine `write_symbols' in this macro!* The debugging + options are not supposed to alter the generated code. + + `CAN_DEBUG_WITHOUT_FP' + Define this macro if debugging can be performed even without a + frame pointer. If this macro is defined, GCC will turn on the + `-fomit-frame-pointer' option whenever `-O' is specified. + +  + File: gccint.info, Node: Per-Function Data, Next: Storage Layout, Prev: Run-time Target, Up: Target Macros + + Defining data structures for per-function information. + ====================================================== + + If the target needs to store information on a per-function basis, GCC + provides a macro and a couple of variables to allow this. Note, just + using statics to store the information is a bad idea, since GCC supports + nested functions, so you can be halfway through encoding one function + when another one comes along. + + GCC defines a data structure called `struct function' which contains + all of the data specific to an individual function. This structure + contains a field called `machine' whose type is `struct + machine_function *', which can be used by targets to point to their own + specific data. + + If a target needs per-function specific data it should define the + type `struct machine_function' and also the macro `INIT_EXPANDERS'. + This macro should be used to initialize some or all of the function + pointers `init_machine_status', `free_machine_status' and + `mark_machine_status'. These pointers are explained below. + + One typical use of per-function, target specific data is to create an + RTX to hold the register containing the function's return address. This + RTX can then be used to implement the `__builtin_return_address' + function, for level 0. + + Note--earlier implementations of GCC used a single data area to hold + all of the per-function information. Thus when processing of a nested + function began the old per-function data had to be pushed onto a stack, + and when the processing was finished, it had to be popped off the + stack. GCC used to provide function pointers called + `save_machine_status' and `restore_machine_status' to handle the saving + and restoring of the target specific information. Since the single + data area approach is no longer used, these pointers are no longer + supported. + + The macro and function pointers are described below. + + `INIT_EXPANDERS' + Macro called to initialize any target specific information. This + macro is called once per function, before generation of any RTL + has begun. The intention of this macro is to allow the + initialization of the function pointers below. + + `init_machine_status' + This is a `void (*)(struct function *)' function pointer. If this + pointer is non-`NULL' it will be called once per function, before + function compilation starts, in order to allow the target to + perform any target specific initialization of the `struct + function' structure. It is intended that this would be used to + initialize the `machine' of that structure. + + `free_machine_status' + This is a `void (*)(struct function *)' function pointer. If this + pointer is non-`NULL' it will be called once per function, after + the function has been compiled, in order to allow any memory + allocated during the `init_machine_status' function call to be + freed. + + `mark_machine_status' + This is a `void (*)(struct function *)' function pointer. If this + pointer is non-`NULL' it will be called once per function in order + to mark any data items in the `struct machine_function' structure + which need garbage collection. + + +  + File: gccint.info, Node: Storage Layout, Next: Type Layout, Prev: Per-Function Data, Up: Target Macros + + Storage Layout + ============== + + Note that the definitions of the macros in this table which are + sizes or alignments measured in bits do not need to be constant. They + can be C expressions that refer to static variables, such as the + `target_flags'. *Note Run-time Target::. + + `BITS_BIG_ENDIAN' + Define this macro to have the value 1 if the most significant bit + in a byte has the lowest number; otherwise define it to have the + value zero. This means that bit-field instructions count from the + most significant bit. If the machine has no bit-field + instructions, then this must still be defined, but it doesn't + matter which value it is defined to. This macro need not be a + constant. + + This macro does not affect the way structure fields are packed into + bytes or words; that is controlled by `BYTES_BIG_ENDIAN'. + + `BYTES_BIG_ENDIAN' + Define this macro to have the value 1 if the most significant byte + in a word has the lowest number. This macro need not be a + constant. + + `WORDS_BIG_ENDIAN' + Define this macro to have the value 1 if, in a multiword object, + the most significant word has the lowest number. This applies to + both memory locations and registers; GCC fundamentally assumes + that the order of words in memory is the same as the order in + registers. This macro need not be a constant. + + `LIBGCC2_WORDS_BIG_ENDIAN' + Define this macro if `WORDS_BIG_ENDIAN' is not constant. This + must be a constant value with the same meaning as + `WORDS_BIG_ENDIAN', which will be used only when compiling + `libgcc2.c'. Typically the value will be set based on + preprocessor defines. + + `FLOAT_WORDS_BIG_ENDIAN' + Define this macro to have the value 1 if `DFmode', `XFmode' or + `TFmode' floating point numbers are stored in memory with the word + containing the sign bit at the lowest address; otherwise define it + to have the value 0. This macro need not be a constant. + + You need not define this macro if the ordering is the same as for + multi-word integers. + + `BITS_PER_UNIT' + Define this macro to be the number of bits in an addressable + storage unit (byte); normally 8. + + `BITS_PER_WORD' + Number of bits in a word; normally 32. + + `MAX_BITS_PER_WORD' + Maximum number of bits in a word. If this is undefined, the + default is `BITS_PER_WORD'. Otherwise, it is the constant value + that is the largest value that `BITS_PER_WORD' can have at + run-time. + + `UNITS_PER_WORD' + Number of storage units in a word; normally 4. + + `MIN_UNITS_PER_WORD' + Minimum number of units in a word. If this is undefined, the + default is `UNITS_PER_WORD'. Otherwise, it is the constant value + that is the smallest value that `UNITS_PER_WORD' can have at + run-time. + + `POINTER_SIZE' + Width of a pointer, in bits. You must specify a value no wider + than the width of `Pmode'. If it is not equal to the width of + `Pmode', you must define `POINTERS_EXTEND_UNSIGNED'. + + `POINTERS_EXTEND_UNSIGNED' + A C expression whose value is greater than zero if pointers that + need to be extended from being `POINTER_SIZE' bits wide to `Pmode' + are to be zero-extended and zero if they are to be sign-extended. + If the value is less then zero then there must be an "ptr_extend" + instruction that extends a pointer from `POINTER_SIZE' to `Pmode'. + + You need not define this macro if the `POINTER_SIZE' is equal to + the width of `Pmode'. + + `PROMOTE_MODE (M, UNSIGNEDP, TYPE)' + A macro to update M and UNSIGNEDP when an object whose type is + TYPE and which has the specified mode and signedness is to be + stored in a register. This macro is only called when TYPE is a + scalar type. + + On most RISC machines, which only have operations that operate on + a full register, define this macro to set M to `word_mode' if M is + an integer mode narrower than `BITS_PER_WORD'. In most cases, + only integer modes should be widened because wider-precision + floating-point operations are usually more expensive than their + narrower counterparts. + + For most machines, the macro definition does not change UNSIGNEDP. + However, some machines, have instructions that preferentially + handle either signed or unsigned quantities of certain modes. For + example, on the DEC Alpha, 32-bit loads from memory and 32-bit add + instructions sign-extend the result to 64 bits. On such machines, + set UNSIGNEDP according to which kind of extension is more + efficient. + + Do not define this macro if it would never modify M. + + `PROMOTE_FUNCTION_ARGS' + Define this macro if the promotion described by `PROMOTE_MODE' + should also be done for outgoing function arguments. + + `PROMOTE_FUNCTION_RETURN' + Define this macro if the promotion described by `PROMOTE_MODE' + should also be done for the return value of functions. + + If this macro is defined, `FUNCTION_VALUE' must perform the same + promotions done by `PROMOTE_MODE'. + + `PROMOTE_FOR_CALL_ONLY' + Define this macro if the promotion described by `PROMOTE_MODE' + should _only_ be performed for outgoing function arguments or + function return values, as specified by `PROMOTE_FUNCTION_ARGS' + and `PROMOTE_FUNCTION_RETURN', respectively. + + `PARM_BOUNDARY' + Normal alignment required for function parameters on the stack, in + bits. All stack parameters receive at least this much alignment + regardless of data type. On most machines, this is the same as the + size of an integer. + + `STACK_BOUNDARY' + Define this macro to the minimum alignment enforced by hardware + for the stack pointer on this machine. The definition is a C + expression for the desired alignment (measured in bits). This + value is used as a default if `PREFERRED_STACK_BOUNDARY' is not + defined. On most machines, this should be the same as + `PARM_BOUNDARY'. + + `PREFERRED_STACK_BOUNDARY' + Define this macro if you wish to preserve a certain alignment for + the stack pointer, greater than what the hardware enforces. The + definition is a C expression for the desired alignment (measured + in bits). This macro must evaluate to a value equal to or larger + than `STACK_BOUNDARY'. + + `FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN' + A C expression that evaluates true if `PREFERRED_STACK_BOUNDARY' is + not guaranteed by the runtime and we should emit code to align the + stack at the beginning of `main'. + + If `PUSH_ROUNDING' is not defined, the stack will always be aligned + to the specified boundary. If `PUSH_ROUNDING' is defined and + specifies a less strict alignment than `PREFERRED_STACK_BOUNDARY', + the stack may be momentarily unaligned while pushing arguments. + + `FUNCTION_BOUNDARY' + Alignment required for a function entry point, in bits. + + `BIGGEST_ALIGNMENT' + Biggest alignment that any data type can require on this machine, + in bits. + + `MINIMUM_ATOMIC_ALIGNMENT' + If defined, the smallest alignment, in bits, that can be given to + an object that can be referenced in one operation, without + disturbing any nearby object. Normally, this is `BITS_PER_UNIT', + but may be larger on machines that don't have byte or half-word + store operations. + + `BIGGEST_FIELD_ALIGNMENT' + Biggest alignment that any structure or union field can require on + this machine, in bits. If defined, this overrides + `BIGGEST_ALIGNMENT' for structure and union fields only, unless + the field alignment has been set by the `__attribute__ ((aligned + (N)))' construct. + + `ADJUST_FIELD_ALIGN (FIELD, COMPUTED)' + An expression for the alignment of a structure field FIELD if the + alignment computed in the usual way (including applying of + `BIGGEST_ALIGNMENT' and `BIGGEST_FIELD_ALIGNMENT' to the + alignment) is COMPUTED. It overrides alignment only if the field + alignment has not been set by the `__attribute__ ((aligned (N)))' + construct. + + `MAX_OFILE_ALIGNMENT' + Biggest alignment supported by the object file format of this + machine. Use this macro to limit the alignment which can be + specified using the `__attribute__ ((aligned (N)))' construct. If + not defined, the default value is `BIGGEST_ALIGNMENT'. + + `DATA_ALIGNMENT (TYPE, BASIC-ALIGN)' + If defined, a C expression to compute the alignment for a variable + in the static store. TYPE is the data type, and BASIC-ALIGN is + the alignment that the object would ordinarily have. The value of + this macro is used instead of that alignment to align the object. + + If this macro is not defined, then BASIC-ALIGN is used. + + One use of this macro is to increase alignment of medium-size data + to make it all fit in fewer cache lines. Another is to cause + character arrays to be word-aligned so that `strcpy' calls that + copy constants to character arrays can be done inline. + + `CONSTANT_ALIGNMENT (CONSTANT, BASIC-ALIGN)' + If defined, a C expression to compute the alignment given to a + constant that is being placed in memory. CONSTANT is the constant + and BASIC-ALIGN is the alignment that the object would ordinarily + have. The value of this macro is used instead of that alignment to + align the object. + + If this macro is not defined, then BASIC-ALIGN is used. + + The typical use of this macro is to increase alignment for string + constants to be word aligned so that `strcpy' calls that copy + constants can be done inline. + + `LOCAL_ALIGNMENT (TYPE, BASIC-ALIGN)' + If defined, a C expression to compute the alignment for a variable + in the local store. TYPE is the data type, and BASIC-ALIGN is the + alignment that the object would ordinarily have. The value of this + macro is used instead of that alignment to align the object. + + If this macro is not defined, then BASIC-ALIGN is used. + + One use of this macro is to increase alignment of medium-size data + to make it all fit in fewer cache lines. + + `EMPTY_FIELD_BOUNDARY' + Alignment in bits to be given to a structure bit-field that + follows an empty field such as `int : 0;'. + + Note that `PCC_BITFIELD_TYPE_MATTERS' also affects the alignment + that results from an empty field. + + `STRUCTURE_SIZE_BOUNDARY' + Number of bits which any structure or union's size must be a + multiple of. Each structure or union's size is rounded up to a + multiple of this. + + If you do not define this macro, the default is the same as + `BITS_PER_UNIT'. + + `STRICT_ALIGNMENT' + Define this macro to be the value 1 if instructions will fail to + work if given data not on the nominal alignment. If instructions + will merely go slower in that case, define this macro as 0. + + `PCC_BITFIELD_TYPE_MATTERS' + Define this if you wish to imitate the way many other C compilers + handle alignment of bit-fields and the structures that contain + them. + + The behavior is that the type written for a bit-field (`int', + `short', or other integer type) imposes an alignment for the + entire structure, as if the structure really did contain an + ordinary field of that type. In addition, the bit-field is placed + within the structure so that it would fit within such a field, not + crossing a boundary for it. + + Thus, on most machines, a bit-field whose type is written as `int' + would not cross a four-byte boundary, and would force four-byte + alignment for the whole structure. (The alignment used may not be + four bytes; it is controlled by the other alignment parameters.) + + If the macro is defined, its definition should be a C expression; + a nonzero value for the expression enables this behavior. + + Note that if this macro is not defined, or its value is zero, some + bit-fields may cross more than one alignment boundary. The + compiler can support such references if there are `insv', `extv', + and `extzv' insns that can directly reference memory. + + The other known way of making bit-fields work is to define + `STRUCTURE_SIZE_BOUNDARY' as large as `BIGGEST_ALIGNMENT'. Then + every structure can be accessed with fullwords. + + Unless the machine has bit-field instructions or you define + `STRUCTURE_SIZE_BOUNDARY' that way, you must define + `PCC_BITFIELD_TYPE_MATTERS' to have a nonzero value. + + If your aim is to make GCC use the same conventions for laying out + bit-fields as are used by another compiler, here is how to + investigate what the other compiler does. Compile and run this + program: + + struct foo1 + { + char x; + char :0; + char y; + }; + + struct foo2 + { + char x; + int :0; + char y; + }; + + main () + { + printf ("Size of foo1 is %d\n", + sizeof (struct foo1)); + printf ("Size of foo2 is %d\n", + sizeof (struct foo2)); + exit (0); + } + + If this prints 2 and 5, then the compiler's behavior is what you + would get from `PCC_BITFIELD_TYPE_MATTERS'. + + `BITFIELD_NBYTES_LIMITED' + Like `PCC_BITFIELD_TYPE_MATTERS' except that its effect is limited + to aligning a bit-field within the structure. + + `MEMBER_TYPE_FORCES_BLK (FIELD)' + Return 1 if a structure or array containing FIELD should be + accessed using `BLKMODE'. + + Normally, this is not needed. See the file `c4x.h' for an example + of how to use this macro to prevent a structure having a floating + point field from being accessed in an integer mode. + + `ROUND_TYPE_SIZE (TYPE, COMPUTED, SPECIFIED)' + Define this macro as an expression for the overall size of a type + (given by TYPE as a tree node) when the size computed in the usual + way is COMPUTED and the alignment is SPECIFIED. + + The default is to round COMPUTED up to a multiple of SPECIFIED. + + `ROUND_TYPE_SIZE_UNIT (TYPE, COMPUTED, SPECIFIED)' + Similar to `ROUND_TYPE_SIZE', but sizes and alignments are + specified in units (bytes). If you define `ROUND_TYPE_SIZE', you + must also define this macro and they must be defined consistently + with each other. + + `ROUND_TYPE_ALIGN (TYPE, COMPUTED, SPECIFIED)' + Define this macro as an expression for the alignment of a type + (given by TYPE as a tree node) if the alignment computed in the + usual way is COMPUTED and the alignment explicitly specified was + SPECIFIED. + + The default is to use SPECIFIED if it is larger; otherwise, use + the smaller of COMPUTED and `BIGGEST_ALIGNMENT' + + `MAX_FIXED_MODE_SIZE' + An integer expression for the size in bits of the largest integer + machine mode that should actually be used. All integer machine + modes of this size or smaller can be used for structures and + unions with the appropriate sizes. If this macro is undefined, + `GET_MODE_BITSIZE (DImode)' is assumed. + + `VECTOR_MODE_SUPPORTED_P(MODE)' + Define this macro to be nonzero if the port is prepared to handle + insns involving vector mode MODE. At the very least, it must have + move patterns for this mode. + + `STACK_SAVEAREA_MODE (SAVE_LEVEL)' + If defined, an expression of type `enum machine_mode' that + specifies the mode of the save area operand of a + `save_stack_LEVEL' named pattern (*note Standard Names::). + SAVE_LEVEL is one of `SAVE_BLOCK', `SAVE_FUNCTION', or + `SAVE_NONLOCAL' and selects which of the three named patterns is + having its mode specified. + + You need not define this macro if it always returns `Pmode'. You + would most commonly define this macro if the `save_stack_LEVEL' + patterns need to support both a 32- and a 64-bit mode. + + `STACK_SIZE_MODE' + If defined, an expression of type `enum machine_mode' that + specifies the mode of the size increment operand of an + `allocate_stack' named pattern (*note Standard Names::). + + You need not define this macro if it always returns `word_mode'. + You would most commonly define this macro if the `allocate_stack' + pattern needs to support both a 32- and a 64-bit mode. + + `CHECK_FLOAT_VALUE (MODE, VALUE, OVERFLOW)' + A C statement to validate the value VALUE (of type `double') for + mode MODE. This means that you check whether VALUE fits within + the possible range of values for mode MODE on this target machine. + The mode MODE is always a mode of class `MODE_FLOAT'. OVERFLOW + is nonzero if the value is already known to be out of range. + + If VALUE is not valid or if OVERFLOW is nonzero, you should set + OVERFLOW to 1 and then assign some valid value to VALUE. Allowing + an invalid value to go through the compiler can produce incorrect + assembler code which may even cause Unix assemblers to crash. + + This macro need not be defined if there is no work for it to do. + + `TARGET_FLOAT_FORMAT' + A code distinguishing the floating point format of the target + machine. There are five defined values: + + `IEEE_FLOAT_FORMAT' + This code indicates IEEE floating point. It is the default; + there is no need to define this macro when the format is IEEE. + + `VAX_FLOAT_FORMAT' + This code indicates the "D float" format used on the VAX. + + `IBM_FLOAT_FORMAT' + This code indicates the format used on the IBM System/370. + + `C4X_FLOAT_FORMAT' + This code indicates the format used on the TMS320C3x/C4x. + + `UNKNOWN_FLOAT_FORMAT' + This code indicates any other format. + + The value of this macro is compared with `HOST_FLOAT_FORMAT', which + is defined by the `configure' script, to determine whether the + target machine has the same format as the host machine. If any + other formats are actually in use on supported machines, new codes + should be defined for them. + + The ordering of the component words of floating point values + stored in memory is controlled by `FLOAT_WORDS_BIG_ENDIAN'. + + + - Target Hook: bool TARGET_MS_BITFIELD_LAYOUT_P (tree RECORD_TYPE) + This target hook returns `true' if bit-fields in the given + RECORD_TYPE are to be laid out following the rules of Microsoft + Visual C/C++, namely: (i) a bit-field won't share the same storage + unit with the previous bit-field if their underlying types have + different sizes, and the bit-field will be aligned to the highest + alignment of the underlying types of itself and of the previous + bit-field; (ii) a zero-sized bit-field will affect the alignment of + the whole enclosing structure, even if it is unnamed; except that + (iii) a zero-sized bit-field will be disregarded unless it follows + another bit-field of non-zero size. If this hook returns `true', + other macros that control bit-field layout are ignored. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-14 gcc-3.2.3/gcc/doc/gccint.info-14 *** gcc-3.2.2/gcc/doc/gccint.info-14 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-14 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1116 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Type Layout, Next: Escape Sequences, Prev: Storage Layout, Up: Target Macros + + Layout of Source Language Data Types + ==================================== + + These macros define the sizes and other characteristics of the + standard basic data types used in programs being compiled. Unlike the + macros in the previous section, these apply to specific features of C + and related languages, rather than to fundamental aspects of storage + layout. + + `INT_TYPE_SIZE' + A C expression for the size in bits of the type `int' on the + target machine. If you don't define this, the default is one word. + + `SHORT_TYPE_SIZE' + A C expression for the size in bits of the type `short' on the + target machine. If you don't define this, the default is half a + word. (If this would be less than one storage unit, it is rounded + up to one unit.) + + `LONG_TYPE_SIZE' + A C expression for the size in bits of the type `long' on the + target machine. If you don't define this, the default is one word. + + `ADA_LONG_TYPE_SIZE' + On some machines, the size used for the Ada equivalent of the type + `long' by a native Ada compiler differs from that used by C. In + that situation, define this macro to be a C expression to be used + for the size of that type. If you don't define this, the default + is the value of `LONG_TYPE_SIZE'. + + `MAX_LONG_TYPE_SIZE' + Maximum number for the size in bits of the type `long' on the + target machine. If this is undefined, the default is + `LONG_TYPE_SIZE'. Otherwise, it is the constant value that is the + largest value that `LONG_TYPE_SIZE' can have at run-time. This is + used in `cpp'. + + `LONG_LONG_TYPE_SIZE' + A C expression for the size in bits of the type `long long' on the + target machine. If you don't define this, the default is two + words. If you want to support GNU Ada on your machine, the value + of this macro must be at least 64. + + `CHAR_TYPE_SIZE' + A C expression for the size in bits of the type `char' on the + target machine. If you don't define this, the default is + `BITS_PER_UNIT'. + + `MAX_CHAR_TYPE_SIZE' + Maximum number for the size in bits of the type `char' on the + target machine. If this is undefined, the default is + `CHAR_TYPE_SIZE'. Otherwise, it is the constant value that is the + largest value that `CHAR_TYPE_SIZE' can have at run-time. This is + used in `cpp'. + + `BOOL_TYPE_SIZE' + A C expression for the size in bits of the C++ type `bool' and C99 + type `_Bool' on the target machine. If you don't define this, and + you probably shouldn't, the default is `CHAR_TYPE_SIZE'. + + `FLOAT_TYPE_SIZE' + A C expression for the size in bits of the type `float' on the + target machine. If you don't define this, the default is one word. + + `DOUBLE_TYPE_SIZE' + A C expression for the size in bits of the type `double' on the + target machine. If you don't define this, the default is two + words. + + `LONG_DOUBLE_TYPE_SIZE' + A C expression for the size in bits of the type `long double' on + the target machine. If you don't define this, the default is two + words. + + Maximum number for the size in bits of the type `long double' on + the target machine. If this is undefined, the default is + `LONG_DOUBLE_TYPE_SIZE'. Otherwise, it is the constant value that + is the largest value that `LONG_DOUBLE_TYPE_SIZE' can have at + run-time. This is used in `cpp'. + + Define this macro to be 1 if the target machine uses 80-bit + floating-point values with 128-bit size and alignment. This is + used in `real.c'. + + `WIDEST_HARDWARE_FP_SIZE' + A C expression for the size in bits of the widest floating-point + format supported by the hardware. If you define this macro, you + must specify a value less than or equal to the value of + `LONG_DOUBLE_TYPE_SIZE'. If you do not define this macro, the + value of `LONG_DOUBLE_TYPE_SIZE' is the default. + + `DEFAULT_SIGNED_CHAR' + An expression whose value is 1 or 0, according to whether the type + `char' should be signed or unsigned by default. The user can + always override this default with the options `-fsigned-char' and + `-funsigned-char'. + + `DEFAULT_SHORT_ENUMS' + A C expression to determine whether to give an `enum' type only as + many bytes as it takes to represent the range of possible values + of that type. A nonzero value means to do that; a zero value + means all `enum' types should be allocated like `int'. + + If you don't define the macro, the default is 0. + + `SIZE_TYPE' + A C expression for a string describing the name of the data type + to use for size values. The typedef name `size_t' is defined + using the contents of the string. + + The string can contain more than one keyword. If so, separate + them with spaces, and write first any length keyword, then + `unsigned' if appropriate, and finally `int'. The string must + exactly match one of the data type names defined in the function + `init_decl_processing' in the file `c-decl.c'. You may not omit + `int' or change the order--that would cause the compiler to crash + on startup. + + If you don't define this macro, the default is `"long unsigned + int"'. + + `PTRDIFF_TYPE' + A C expression for a string describing the name of the data type + to use for the result of subtracting two pointers. The typedef + name `ptrdiff_t' is defined using the contents of the string. See + `SIZE_TYPE' above for more information. + + If you don't define this macro, the default is `"long int"'. + + `WCHAR_TYPE' + A C expression for a string describing the name of the data type + to use for wide characters. The typedef name `wchar_t' is defined + using the contents of the string. See `SIZE_TYPE' above for more + information. + + If you don't define this macro, the default is `"int"'. + + `WCHAR_TYPE_SIZE' + A C expression for the size in bits of the data type for wide + characters. This is used in `cpp', which cannot make use of + `WCHAR_TYPE'. + + `MAX_WCHAR_TYPE_SIZE' + Maximum number for the size in bits of the data type for wide + characters. If this is undefined, the default is + `WCHAR_TYPE_SIZE'. Otherwise, it is the constant value that is the + largest value that `WCHAR_TYPE_SIZE' can have at run-time. This is + used in `cpp'. + + `GCOV_TYPE_SIZE' + A C expression for the size in bits of the type used for gcov + counters on the target machine. If you don't define this, the + default is one `LONG_TYPE_SIZE' in case it is greater or equal to + 64-bit and `LONG_LONG_TYPE_SIZE' otherwise. You may want to + re-define the type to ensure atomicity for counters in + multithreaded programs. + + `WINT_TYPE' + A C expression for a string describing the name of the data type to + use for wide characters passed to `printf' and returned from + `getwc'. The typedef name `wint_t' is defined using the contents + of the string. See `SIZE_TYPE' above for more information. + + If you don't define this macro, the default is `"unsigned int"'. + + `INTMAX_TYPE' + A C expression for a string describing the name of the data type + that can represent any value of any standard or extended signed + integer type. The typedef name `intmax_t' is defined using the + contents of the string. See `SIZE_TYPE' above for more + information. + + If you don't define this macro, the default is the first of + `"int"', `"long int"', or `"long long int"' that has as much + precision as `long long int'. + + `UINTMAX_TYPE' + A C expression for a string describing the name of the data type + that can represent any value of any standard or extended unsigned + integer type. The typedef name `uintmax_t' is defined using the + contents of the string. See `SIZE_TYPE' above for more + information. + + If you don't define this macro, the default is the first of + `"unsigned int"', `"long unsigned int"', or `"long long unsigned + int"' that has as much precision as `long long unsigned int'. + + `TARGET_PTRMEMFUNC_VBIT_LOCATION' + The C++ compiler represents a pointer-to-member-function with a + struct that looks like: + + struct { + union { + void (*fn)(); + ptrdiff_t vtable_index; + }; + ptrdiff_t delta; + }; + + The C++ compiler must use one bit to indicate whether the function + that will be called through a pointer-to-member-function is + virtual. Normally, we assume that the low-order bit of a function + pointer must always be zero. Then, by ensuring that the + vtable_index is odd, we can distinguish which variant of the union + is in use. But, on some platforms function pointers can be odd, + and so this doesn't work. In that case, we use the low-order bit + of the `delta' field, and shift the remainder of the `delta' field + to the left. + + GCC will automatically make the right selection about where to + store this bit using the `FUNCTION_BOUNDARY' setting for your + platform. However, some platforms such as ARM/Thumb have + `FUNCTION_BOUNDARY' set such that functions always start at even + addresses, but the lowest bit of pointers to functions indicate + whether the function at that address is in ARM or Thumb mode. If + this is the case of your architecture, you should define this + macro to `ptrmemfunc_vbit_in_delta'. + + In general, you should not have to define this macro. On + architectures in which function addresses are always even, + according to `FUNCTION_BOUNDARY', GCC will automatically define + this macro to `ptrmemfunc_vbit_in_pfn'. + + `TARGET_VTABLE_USES_DESCRIPTORS' + Normally, the C++ compiler uses function pointers in vtables. This + macro allows the target to change to use "function descriptors" + instead. Function descriptors are found on targets for whom a + function pointer is actually a small data structure. Normally the + data structure consists of the actual code address plus a data + pointer to which the function's data is relative. + + If vtables are used, the value of this macro should be the number + of words that the function descriptor occupies. + +  + File: gccint.info, Node: Escape Sequences, Next: Registers, Prev: Type Layout, Up: Target Macros + + Target Character Escape Sequences + ================================= + + By default, GCC assumes that the C character escape sequences take on + their ASCII values for the target. If this is not correct, you must + explicitly define all of the macros below. + + `TARGET_BELL' + A C constant expression for the integer value for escape sequence + `\a'. + + `TARGET_ESC' + A C constant expression for the integer value of the target escape + character. As an extension, GCC evaluates the escape sequences + `\e' and `\E' to this. + + `TARGET_BS' + `TARGET_TAB' + `TARGET_NEWLINE' + C constant expressions for the integer values for escape sequences + `\b', `\t' and `\n'. + + `TARGET_VT' + `TARGET_FF' + `TARGET_CR' + C constant expressions for the integer values for escape sequences + `\v', `\f' and `\r'. + +  + File: gccint.info, Node: Registers, Next: Register Classes, Prev: Escape Sequences, Up: Target Macros + + Register Usage + ============== + + This section explains how to describe what registers the target + machine has, and how (in general) they can be used. + + The description of which registers a specific instruction can use is + done with register classes; see *Note Register Classes::. For + information on using registers to access a stack frame, see *Note Frame + Registers::. For passing values in registers, see *Note Register + Arguments::. For returning values in registers, see *Note Scalar + Return::. + + * Menu: + + * Register Basics:: Number and kinds of registers. + * Allocation Order:: Order in which registers are allocated. + * Values in Registers:: What kinds of values each reg can hold. + * Leaf Functions:: Renumbering registers for leaf functions. + * Stack Registers:: Handling a register stack such as 80387. + +  + File: gccint.info, Node: Register Basics, Next: Allocation Order, Up: Registers + + Basic Characteristics of Registers + ---------------------------------- + + Registers have various characteristics. + + `FIRST_PSEUDO_REGISTER' + Number of hardware registers known to the compiler. They receive + numbers 0 through `FIRST_PSEUDO_REGISTER-1'; thus, the first + pseudo register's number really is assigned the number + `FIRST_PSEUDO_REGISTER'. + + `FIXED_REGISTERS' + An initializer that says which registers are used for fixed + purposes all throughout the compiled code and are therefore not + available for general allocation. These would include the stack + pointer, the frame pointer (except on machines where that can be + used as a general register when no frame pointer is needed), the + program counter on machines where that is considered one of the + addressable registers, and any other numbered register with a + standard use. + + This information is expressed as a sequence of numbers, separated + by commas and surrounded by braces. The Nth number is 1 if + register N is fixed, 0 otherwise. + + The table initialized from this macro, and the table initialized by + the following one, may be overridden at run time either + automatically, by the actions of the macro + `CONDITIONAL_REGISTER_USAGE', or by the user with the command + options `-ffixed-REG', `-fcall-used-REG' and `-fcall-saved-REG'. + + `CALL_USED_REGISTERS' + Like `FIXED_REGISTERS' but has 1 for each register that is + clobbered (in general) by function calls as well as for fixed + registers. This macro therefore identifies the registers that are + not available for general allocation of values that must live + across function calls. + + If a register has 0 in `CALL_USED_REGISTERS', the compiler + automatically saves it on function entry and restores it on + function exit, if the register is used within the function. + + `CALL_REALLY_USED_REGISTERS' + Like `CALL_USED_REGISTERS' except this macro doesn't require that + the entire set of `FIXED_REGISTERS' be included. + (`CALL_USED_REGISTERS' must be a superset of `FIXED_REGISTERS'). + This macro is optional. If not specified, it defaults to the value + of `CALL_USED_REGISTERS'. + + `HARD_REGNO_CALL_PART_CLOBBERED (REGNO, MODE)' + A C expression that is nonzero if it is not permissible to store a + value of mode MODE in hard register number REGNO across a call + without some part of it being clobbered. For most machines this + macro need not be defined. It is only required for machines that + do not preserve the entire contents of a register across a call. + + `CONDITIONAL_REGISTER_USAGE' + Zero or more C statements that may conditionally modify five + variables `fixed_regs', `call_used_regs', `global_regs', + `reg_names', and `reg_class_contents', to take into account any + dependence of these register sets on target flags. The first three + of these are of type `char []' (interpreted as Boolean vectors). + `global_regs' is a `const char *[]', and `reg_class_contents' is a + `HARD_REG_SET'. Before the macro is called, `fixed_regs', + `call_used_regs', `reg_class_contents', and `reg_names' have been + initialized from `FIXED_REGISTERS', `CALL_USED_REGISTERS', + `REG_CLASS_CONTENTS', and `REGISTER_NAMES', respectively. + `global_regs' has been cleared, and any `-ffixed-REG', + `-fcall-used-REG' and `-fcall-saved-REG' command options have been + applied. + + You need not define this macro if it has no work to do. + + If the usage of an entire class of registers depends on the target + flags, you may indicate this to GCC by using this macro to modify + `fixed_regs' and `call_used_regs' to 1 for each of the registers + in the classes which should not be used by GCC. Also define the + macro `REG_CLASS_FROM_LETTER' to return `NO_REGS' if it is called + with a letter for a class that shouldn't be used. + + (However, if this class is not included in `GENERAL_REGS' and all + of the insn patterns whose constraints permit this class are + controlled by target switches, then GCC will automatically avoid + using these registers when the target switches are opposed to + them.) + + `NON_SAVING_SETJMP' + If this macro is defined and has a nonzero value, it means that + `setjmp' and related functions fail to save the registers, or that + `longjmp' fails to restore them. To compensate, the compiler + avoids putting variables in registers in functions that use + `setjmp'. + + `INCOMING_REGNO (OUT)' + Define this macro if the target machine has register windows. + This C expression returns the register number as seen by the + called function corresponding to the register number OUT as seen + by the calling function. Return OUT if register number OUT is not + an outbound register. + + `OUTGOING_REGNO (IN)' + Define this macro if the target machine has register windows. + This C expression returns the register number as seen by the + calling function corresponding to the register number IN as seen + by the called function. Return IN if register number IN is not an + inbound register. + + `LOCAL_REGNO (REGNO)' + Define this macro if the target machine has register windows. + This C expression returns true if the register is call-saved but + is in the register window. Unlike most call-saved registers, such + registers need not be explicitly restored on function exit or + during non-local gotos. + + +  + File: gccint.info, Node: Allocation Order, Next: Values in Registers, Prev: Register Basics, Up: Registers + + Order of Allocation of Registers + -------------------------------- + + Registers are allocated in order. + + `REG_ALLOC_ORDER' + If defined, an initializer for a vector of integers, containing the + numbers of hard registers in the order in which GCC should prefer + to use them (from most preferred to least). + + If this macro is not defined, registers are used lowest numbered + first (all else being equal). + + One use of this macro is on machines where the highest numbered + registers must always be saved and the save-multiple-registers + instruction supports only sequences of consecutive registers. On + such machines, define `REG_ALLOC_ORDER' to be an initializer that + lists the highest numbered allocable register first. + + `ORDER_REGS_FOR_LOCAL_ALLOC' + A C statement (sans semicolon) to choose the order in which to + allocate hard registers for pseudo-registers local to a basic + block. + + Store the desired register order in the array `reg_alloc_order'. + Element 0 should be the register to allocate first; element 1, the + next register; and so on. + + The macro body should not assume anything about the contents of + `reg_alloc_order' before execution of the macro. + + On most machines, it is not necessary to define this macro. + +  + File: gccint.info, Node: Values in Registers, Next: Leaf Functions, Prev: Allocation Order, Up: Registers + + How Values Fit in Registers + --------------------------- + + This section discusses the macros that describe which kinds of values + (specifically, which machine modes) each register can hold, and how many + consecutive registers are needed for a given mode. + + `HARD_REGNO_NREGS (REGNO, MODE)' + A C expression for the number of consecutive hard registers, + starting at register number REGNO, required to hold a value of mode + MODE. + + On a machine where all registers are exactly one word, a suitable + definition of this macro is + + #define HARD_REGNO_NREGS(REGNO, MODE) \ + ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) \ + / UNITS_PER_WORD) + + `HARD_REGNO_MODE_OK (REGNO, MODE)' + A C expression that is nonzero if it is permissible to store a + value of mode MODE in hard register number REGNO (or in several + registers starting with that one). For a machine where all + registers are equivalent, a suitable definition is + + #define HARD_REGNO_MODE_OK(REGNO, MODE) 1 + + You need not include code to check for the numbers of fixed + registers, because the allocation mechanism considers them to be + always occupied. + + On some machines, double-precision values must be kept in even/odd + register pairs. You can implement that by defining this macro to + reject odd register numbers for such modes. + + The minimum requirement for a mode to be OK in a register is that + the `movMODE' instruction pattern support moves between the + register and other hard register in the same class and that moving + a value into the register and back out not alter it. + + Since the same instruction used to move `word_mode' will work for + all narrower integer modes, it is not necessary on any machine for + `HARD_REGNO_MODE_OK' to distinguish between these modes, provided + you define patterns `movhi', etc., to take advantage of this. This + is useful because of the interaction between `HARD_REGNO_MODE_OK' + and `MODES_TIEABLE_P'; it is very desirable for all integer modes + to be tieable. + + Many machines have special registers for floating point arithmetic. + Often people assume that floating point machine modes are allowed + only in floating point registers. This is not true. Any + registers that can hold integers can safely _hold_ a floating + point machine mode, whether or not floating arithmetic can be done + on it in those registers. Integer move instructions can be used + to move the values. + + On some machines, though, the converse is true: fixed-point machine + modes may not go in floating registers. This is true if the + floating registers normalize any value stored in them, because + storing a non-floating value there would garble it. In this case, + `HARD_REGNO_MODE_OK' should reject fixed-point machine modes in + floating registers. But if the floating registers do not + automatically normalize, if you can store any bit pattern in one + and retrieve it unchanged without a trap, then any machine mode + may go in a floating register, so you can define this macro to say + so. + + The primary significance of special floating registers is rather + that they are the registers acceptable in floating point arithmetic + instructions. However, this is of no concern to + `HARD_REGNO_MODE_OK'. You handle it by writing the proper + constraints for those instructions. + + On some machines, the floating registers are especially slow to + access, so that it is better to store a value in a stack frame + than in such a register if floating point arithmetic is not being + done. As long as the floating registers are not in class + `GENERAL_REGS', they will not be used unless some pattern's + constraint asks for one. + + `MODES_TIEABLE_P (MODE1, MODE2)' + A C expression that is nonzero if a value of mode MODE1 is + accessible in mode MODE2 without copying. + + If `HARD_REGNO_MODE_OK (R, MODE1)' and `HARD_REGNO_MODE_OK (R, + MODE2)' are always the same for any R, then `MODES_TIEABLE_P + (MODE1, MODE2)' should be nonzero. If they differ for any R, you + should define this macro to return zero unless some other + mechanism ensures the accessibility of the value in a narrower + mode. + + You should define this macro to return nonzero in as many cases as + possible since doing so will allow GCC to perform better register + allocation. + + `AVOID_CCMODE_COPIES' + Define this macro if the compiler should avoid copies to/from + `CCmode' registers. You should only define this macro if support + for copying to/from `CCmode' is incomplete. + +  + File: gccint.info, Node: Leaf Functions, Next: Stack Registers, Prev: Values in Registers, Up: Registers + + Handling Leaf Functions + ----------------------- + + On some machines, a leaf function (i.e., one which makes no calls) + can run more efficiently if it does not make its own register window. + Often this means it is required to receive its arguments in the + registers where they are passed by the caller, instead of the registers + where they would normally arrive. + + The special treatment for leaf functions generally applies only when + other conditions are met; for example, often they may use only those + registers for its own variables and temporaries. We use the term "leaf + function" to mean a function that is suitable for this special + handling, so that functions with no calls are not necessarily "leaf + functions". + + GCC assigns register numbers before it knows whether the function is + suitable for leaf function treatment. So it needs to renumber the + registers in order to output a leaf function. The following macros + accomplish this. + + `LEAF_REGISTERS' + Name of a char vector, indexed by hard register number, which + contains 1 for a register that is allowable in a candidate for leaf + function treatment. + + If leaf function treatment involves renumbering the registers, + then the registers marked here should be the ones before + renumbering--those that GCC would ordinarily allocate. The + registers which will actually be used in the assembler code, after + renumbering, should not be marked with 1 in this vector. + + Define this macro only if the target machine offers a way to + optimize the treatment of leaf functions. + + `LEAF_REG_REMAP (REGNO)' + A C expression whose value is the register number to which REGNO + should be renumbered, when a function is treated as a leaf + function. + + If REGNO is a register number which should not appear in a leaf + function before renumbering, then the expression should yield -1, + which will cause the compiler to abort. + + Define this macro only if the target machine offers a way to + optimize the treatment of leaf functions, and registers need to be + renumbered to do this. + + `TARGET_ASM_FUNCTION_PROLOGUE' and `TARGET_ASM_FUNCTION_EPILOGUE' + must usually treat leaf functions specially. They can test the C + variable `current_function_is_leaf' which is nonzero for leaf + functions. `current_function_is_leaf' is set prior to local register + allocation and is valid for the remaining compiler passes. They can + also test the C variable `current_function_uses_only_leaf_regs' which + is nonzero for leaf functions which only use leaf registers. + `current_function_uses_only_leaf_regs' is valid after reload and is + only useful if `LEAF_REGISTERS' is defined. + +  + File: gccint.info, Node: Stack Registers, Prev: Leaf Functions, Up: Registers + + Registers That Form a Stack + --------------------------- + + There are special features to handle computers where some of the + "registers" form a stack, as in the 80387 coprocessor for the 80386. + Stack registers are normally written by pushing onto the stack, and are + numbered relative to the top of the stack. + + Currently, GCC can only handle one group of stack-like registers, and + they must be consecutively numbered. + + `STACK_REGS' + Define this if the machine has any stack-like registers. + + `FIRST_STACK_REG' + The number of the first stack-like register. This one is the top + of the stack. + + `LAST_STACK_REG' + The number of the last stack-like register. This one is the + bottom of the stack. + +  + File: gccint.info, Node: Register Classes, Next: Stack and Calling, Prev: Registers, Up: Target Macros + + Register Classes + ================ + + On many machines, the numbered registers are not all equivalent. + For example, certain registers may not be allowed for indexed + addressing; certain registers may not be allowed in some instructions. + These machine restrictions are described to the compiler using + "register classes". + + You define a number of register classes, giving each one a name and + saying which of the registers belong to it. Then you can specify + register classes that are allowed as operands to particular instruction + patterns. + + In general, each register will belong to several classes. In fact, + one class must be named `ALL_REGS' and contain all the registers. + Another class must be named `NO_REGS' and contain no registers. Often + the union of two classes will be another class; however, this is not + required. + + One of the classes must be named `GENERAL_REGS'. There is nothing + terribly special about the name, but the operand constraint letters `r' + and `g' specify this class. If `GENERAL_REGS' is the same as + `ALL_REGS', just define it as a macro which expands to `ALL_REGS'. + + Order the classes so that if class X is contained in class Y then X + has a lower class number than Y. + + The way classes other than `GENERAL_REGS' are specified in operand + constraints is through machine-dependent operand constraint letters. + You can define such letters to correspond to various classes, then use + them in operand constraints. + + You should define a class for the union of two classes whenever some + instruction allows both classes. For example, if an instruction allows + either a floating point (coprocessor) register or a general register + for a certain operand, you should define a class `FLOAT_OR_GENERAL_REGS' + which includes both of them. Otherwise you will get suboptimal code. + + You must also specify certain redundant information about the + register classes: for each class, which classes contain it and which + ones are contained in it; for each pair of classes, the largest class + contained in their union. + + When a value occupying several consecutive registers is expected in a + certain class, all the registers used must belong to that class. + Therefore, register classes cannot be used to enforce a requirement for + a register pair to start with an even-numbered register. The way to + specify this requirement is with `HARD_REGNO_MODE_OK'. + + Register classes used for input-operands of bitwise-and or shift + instructions have a special requirement: each such class must have, for + each fixed-point machine mode, a subclass whose registers can transfer + that mode to or from memory. For example, on some machines, the + operations for single-byte values (`QImode') are limited to certain + registers. When this is so, each register class that is used in a + bitwise-and or shift instruction must have a subclass consisting of + registers from which single-byte values can be loaded or stored. This + is so that `PREFERRED_RELOAD_CLASS' can always have a possible value to + return. + + `enum reg_class' + An enumeral type that must be defined with all the register class + names as enumeral values. `NO_REGS' must be first. `ALL_REGS' + must be the last register class, followed by one more enumeral + value, `LIM_REG_CLASSES', which is not a register class but rather + tells how many classes there are. + + Each register class has a number, which is the value of casting + the class name to type `int'. The number serves as an index in + many of the tables described below. + + `N_REG_CLASSES' + The number of distinct register classes, defined as follows: + + #define N_REG_CLASSES (int) LIM_REG_CLASSES + + `REG_CLASS_NAMES' + An initializer containing the names of the register classes as C + string constants. These names are used in writing some of the + debugging dumps. + + `REG_CLASS_CONTENTS' + An initializer containing the contents of the register classes, as + integers which are bit masks. The Nth integer specifies the + contents of class N. The way the integer MASK is interpreted is + that register R is in the class if `MASK & (1 << R)' is 1. + + When the machine has more than 32 registers, an integer does not + suffice. Then the integers are replaced by sub-initializers, + braced groupings containing several integers. Each + sub-initializer must be suitable as an initializer for the type + `HARD_REG_SET' which is defined in `hard-reg-set.h'. In this + situation, the first integer in each sub-initializer corresponds to + registers 0 through 31, the second integer to registers 32 through + 63, and so on. + + `REGNO_REG_CLASS (REGNO)' + A C expression whose value is a register class containing hard + register REGNO. In general there is more than one such class; + choose a class which is "minimal", meaning that no smaller class + also contains the register. + + `BASE_REG_CLASS' + A macro whose definition is the name of the class to which a valid + base register must belong. A base register is one used in an + address which is the register value plus a displacement. + + `MODE_BASE_REG_CLASS (MODE)' + This is a variation of the `BASE_REG_CLASS' macro which allows the + selection of a base register in a mode depenedent manner. If MODE + is VOIDmode then it should return the same value as + `BASE_REG_CLASS'. + + `INDEX_REG_CLASS' + A macro whose definition is the name of the class to which a valid + index register must belong. An index register is one used in an + address where its value is either multiplied by a scale factor or + added to another register (as well as added to a displacement). + + `REG_CLASS_FROM_LETTER (CHAR)' + A C expression which defines the machine-dependent operand + constraint letters for register classes. If CHAR is such a + letter, the value should be the register class corresponding to + it. Otherwise, the value should be `NO_REGS'. The register + letter `r', corresponding to class `GENERAL_REGS', will not be + passed to this macro; you do not need to handle it. + + `REGNO_OK_FOR_BASE_P (NUM)' + A C expression which is nonzero if register number NUM is suitable + for use as a base register in operand addresses. It may be either + a suitable hard register or a pseudo register that has been + allocated such a hard register. + + `REGNO_MODE_OK_FOR_BASE_P (NUM, MODE)' + A C expression that is just like `REGNO_OK_FOR_BASE_P', except that + that expression may examine the mode of the memory reference in + MODE. You should define this macro if the mode of the memory + reference affects whether a register may be used as a base + register. If you define this macro, the compiler will use it + instead of `REGNO_OK_FOR_BASE_P'. + + `REGNO_OK_FOR_INDEX_P (NUM)' + A C expression which is nonzero if register number NUM is suitable + for use as an index register in operand addresses. It may be + either a suitable hard register or a pseudo register that has been + allocated such a hard register. + + The difference between an index register and a base register is + that the index register may be scaled. If an address involves the + sum of two registers, neither one of them scaled, then either one + may be labeled the "base" and the other the "index"; but whichever + labeling is used must fit the machine's constraints of which + registers may serve in each capacity. The compiler will try both + labelings, looking for one that is valid, and will reload one or + both registers only if neither labeling works. + + `PREFERRED_RELOAD_CLASS (X, CLASS)' + A C expression that places additional restrictions on the register + class to use when it is necessary to copy value X into a register + in class CLASS. The value is a register class; perhaps CLASS, or + perhaps another, smaller class. On many machines, the following + definition is safe: + + #define PREFERRED_RELOAD_CLASS(X,CLASS) CLASS + + Sometimes returning a more restrictive class makes better code. + For example, on the 68000, when X is an integer constant that is + in range for a `moveq' instruction, the value of this macro is + always `DATA_REGS' as long as CLASS includes the data registers. + Requiring a data register guarantees that a `moveq' will be used. + + If X is a `const_double', by returning `NO_REGS' you can force X + into a memory constant. This is useful on certain machines where + immediate floating values cannot be loaded into certain kinds of + registers. + + `PREFERRED_OUTPUT_RELOAD_CLASS (X, CLASS)' + Like `PREFERRED_RELOAD_CLASS', but for output reloads instead of + input reloads. If you don't define this macro, the default is to + use CLASS, unchanged. + + `LIMIT_RELOAD_CLASS (MODE, CLASS)' + A C expression that places additional restrictions on the register + class to use when it is necessary to be able to hold a value of + mode MODE in a reload register for which class CLASS would + ordinarily be used. + + Unlike `PREFERRED_RELOAD_CLASS', this macro should be used when + there are certain modes that simply can't go in certain reload + classes. + + The value is a register class; perhaps CLASS, or perhaps another, + smaller class. + + Don't define this macro unless the target machine has limitations + which require the macro to do something nontrivial. + + `SECONDARY_RELOAD_CLASS (CLASS, MODE, X)' + `SECONDARY_INPUT_RELOAD_CLASS (CLASS, MODE, X)' + `SECONDARY_OUTPUT_RELOAD_CLASS (CLASS, MODE, X)' + Many machines have some registers that cannot be copied directly + to or from memory or even from other types of registers. An + example is the `MQ' register, which on most machines, can only be + copied to or from general registers, but not memory. Some + machines allow copying all registers to and from memory, but + require a scratch register for stores to some memory locations + (e.g., those with symbolic address on the RT, and those with + certain symbolic address on the Sparc when compiling PIC). In + some cases, both an intermediate and a scratch register are + required. + + You should define these macros to indicate to the reload phase + that it may need to allocate at least one register for a reload in + addition to the register to contain the data. Specifically, if + copying X to a register CLASS in MODE requires an intermediate + register, you should define `SECONDARY_INPUT_RELOAD_CLASS' to + return the largest register class all of whose registers can be + used as intermediate registers or scratch registers. + + If copying a register CLASS in MODE to X requires an intermediate + or scratch register, `SECONDARY_OUTPUT_RELOAD_CLASS' should be + defined to return the largest register class required. If the + requirements for input and output reloads are the same, the macro + `SECONDARY_RELOAD_CLASS' should be used instead of defining both + macros identically. + + The values returned by these macros are often `GENERAL_REGS'. + Return `NO_REGS' if no spare register is needed; i.e., if X can be + directly copied to or from a register of CLASS in MODE without + requiring a scratch register. Do not define this macro if it + would always return `NO_REGS'. + + If a scratch register is required (either with or without an + intermediate register), you should define patterns for + `reload_inM' or `reload_outM', as required (*note Standard + Names::. These patterns, which will normally be implemented with + a `define_expand', should be similar to the `movM' patterns, + except that operand 2 is the scratch register. + + Define constraints for the reload register and scratch register + that contain a single register class. If the original reload + register (whose class is CLASS) can meet the constraint given in + the pattern, the value returned by these macros is used for the + class of the scratch register. Otherwise, two additional reload + registers are required. Their classes are obtained from the + constraints in the insn pattern. + + X might be a pseudo-register or a `subreg' of a pseudo-register, + which could either be in a hard register or in memory. Use + `true_regnum' to find out; it will return -1 if the pseudo is in + memory and the hard register number if it is in a register. + + These macros should not be used in the case where a particular + class of registers can only be copied to memory and not to another + class of registers. In that case, secondary reload registers are + not needed and would not be helpful. Instead, a stack location + must be used to perform the copy and the `movM' pattern should use + memory as an intermediate storage. This case often occurs between + floating-point and general registers. + + `SECONDARY_MEMORY_NEEDED (CLASS1, CLASS2, M)' + Certain machines have the property that some registers cannot be + copied to some other registers without using memory. Define this + macro on those machines to be a C expression that is nonzero if + objects of mode M in registers of CLASS1 can only be copied to + registers of class CLASS2 by storing a register of CLASS1 into + memory and loading that memory location into a register of CLASS2. + + Do not define this macro if its value would always be zero. + + `SECONDARY_MEMORY_NEEDED_RTX (MODE)' + Normally when `SECONDARY_MEMORY_NEEDED' is defined, the compiler + allocates a stack slot for a memory location needed for register + copies. If this macro is defined, the compiler instead uses the + memory location defined by this macro. + + Do not define this macro if you do not define + `SECONDARY_MEMORY_NEEDED'. + + `SECONDARY_MEMORY_NEEDED_MODE (MODE)' + When the compiler needs a secondary memory location to copy + between two registers of mode MODE, it normally allocates + sufficient memory to hold a quantity of `BITS_PER_WORD' bits and + performs the store and load operations in a mode that many bits + wide and whose class is the same as that of MODE. + + This is right thing to do on most machines because it ensures that + all bits of the register are copied and prevents accesses to the + registers in a narrower mode, which some machines prohibit for + floating-point registers. + + However, this default behavior is not correct on some machines, + such as the DEC Alpha, that store short integers in floating-point + registers differently than in integer registers. On those + machines, the default widening will not work correctly and you + must define this macro to suppress that widening in some cases. + See the file `alpha.h' for details. + + Do not define this macro if you do not define + `SECONDARY_MEMORY_NEEDED' or if widening MODE to a mode that is + `BITS_PER_WORD' bits wide is correct for your machine. + + `SMALL_REGISTER_CLASSES' + On some machines, it is risky to let hard registers live across + arbitrary insns. Typically, these machines have instructions that + require values to be in specific registers (like an accumulator), + and reload will fail if the required hard register is used for + another purpose across such an insn. + + Define `SMALL_REGISTER_CLASSES' to be an expression with a nonzero + value on these machines. When this macro has a nonzero value, the + compiler will try to minimize the lifetime of hard registers. + + It is always safe to define this macro with a nonzero value, but + if you unnecessarily define it, you will reduce the amount of + optimizations that can be performed in some cases. If you do not + define this macro with a nonzero value when it is required, the + compiler will run out of spill registers and print a fatal error + message. For most machines, you should not define this macro at + all. + + `CLASS_LIKELY_SPILLED_P (CLASS)' + A C expression whose value is nonzero if pseudos that have been + assigned to registers of class CLASS would likely be spilled + because registers of CLASS are needed for spill registers. + + The default value of this macro returns 1 if CLASS has exactly one + register and zero otherwise. On most machines, this default + should be used. Only define this macro to some other expression + if pseudos allocated by `local-alloc.c' end up in memory because + their hard registers were needed for spill registers. If this + macro returns nonzero for those classes, those pseudos will only + be allocated by `global.c', which knows how to reallocate the + pseudo to another register. If there would not be another + register available for reallocation, you should not change the + definition of this macro since the only effect of such a + definition would be to slow down register allocation. + + `CLASS_MAX_NREGS (CLASS, MODE)' + A C expression for the maximum number of consecutive registers of + class CLASS needed to hold a value of mode MODE. + + This is closely related to the macro `HARD_REGNO_NREGS'. In fact, + the value of the macro `CLASS_MAX_NREGS (CLASS, MODE)' should be + the maximum value of `HARD_REGNO_NREGS (REGNO, MODE)' for all + REGNO values in the class CLASS. + + This macro helps control the handling of multiple-word values in + the reload pass. + + `CLASS_CANNOT_CHANGE_MODE' + If defined, a C expression for a class that contains registers for + which the compiler may not change modes arbitrarily. + + `CLASS_CANNOT_CHANGE_MODE_P(FROM, TO)' + A C expression that is true if, for a register in + `CLASS_CANNOT_CHANGE_MODE', the requested mode punning is invalid. + + For the example, loading 32-bit integer or floating-point objects + into floating-point registers on the Alpha extends them to 64 bits. + Therefore loading a 64-bit object and then storing it as a 32-bit + object does not store the low-order 32 bits, as would be the case + for a normal register. Therefore, `alpha.h' defines + `CLASS_CANNOT_CHANGE_MODE' as `FLOAT_REGS' and + `CLASS_CANNOT_CHANGE_MODE_P' restricts mode changes to same-size + modes. + + Compare this to IA-64, which extends floating-point values to 82 + bits, and stores 64-bit integers in a different format than 64-bit + doubles. Therefore `CLASS_CANNOT_CHANGE_MODE_P' is always true. + + Three other special macros describe which operands fit which + constraint letters. + + `CONST_OK_FOR_LETTER_P (VALUE, C)' + A C expression that defines the machine-dependent operand + constraint letters (`I', `J', `K', ... `P') that specify + particular ranges of integer values. If C is one of those + letters, the expression should check that VALUE, an integer, is in + the appropriate range and return 1 if so, 0 otherwise. If C is + not one of those letters, the value should be 0 regardless of + VALUE. + + `CONST_DOUBLE_OK_FOR_LETTER_P (VALUE, C)' + A C expression that defines the machine-dependent operand + constraint letters that specify particular ranges of + `const_double' values (`G' or `H'). + + If C is one of those letters, the expression should check that + VALUE, an RTX of code `const_double', is in the appropriate range + and return 1 if so, 0 otherwise. If C is not one of those + letters, the value should be 0 regardless of VALUE. + + `const_double' is used for all floating-point constants and for + `DImode' fixed-point constants. A given letter can accept either + or both kinds of values. It can use `GET_MODE' to distinguish + between these kinds. + + `EXTRA_CONSTRAINT (VALUE, C)' + A C expression that defines the optional machine-dependent + constraint letters that can be used to segregate specific types of + operands, usually memory references, for the target machine. Any + letter that is not elsewhere defined and not matched by + `REG_CLASS_FROM_LETTER' may be used. Normally this macro will not + be defined. + + If it is required for a particular target machine, it should + return 1 if VALUE corresponds to the operand type represented by + the constraint letter C. If C is not defined as an extra + constraint, the value returned should be 0 regardless of VALUE. + + For example, on the ROMP, load instructions cannot have their + output in r0 if the memory reference contains a symbolic address. + Constraint letter `Q' is defined as representing a memory address + that does _not_ contain a symbolic address. An alternative is + specified with a `Q' constraint on the input and `r' on the + output. The next alternative specifies `m' on the input and a + register class that does not include r0 on the output. + +  + File: gccint.info, Node: Stack and Calling, Next: Varargs, Prev: Register Classes, Up: Target Macros + + Stack Layout and Calling Conventions + ==================================== + + This describes the stack layout and calling conventions. + + * Menu: + + * Frame Layout:: + * Exception Handling:: + * Stack Checking:: + * Frame Registers:: + * Elimination:: + * Stack Arguments:: + * Register Arguments:: + * Scalar Return:: + * Aggregate Return:: + * Caller Saves:: + * Function Entry:: + * Profiling:: + * Tail Calls:: + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-15 gcc-3.2.3/gcc/doc/gccint.info-15 *** gcc-3.2.2/gcc/doc/gccint.info-15 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-15 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1058 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Frame Layout, Next: Exception Handling, Up: Stack and Calling + + Basic Stack Layout + ------------------ + + Here is the basic stack layout. + + `STACK_GROWS_DOWNWARD' + Define this macro if pushing a word onto the stack moves the stack + pointer to a smaller address. + + When we say, "define this macro if ...," it means that the + compiler checks this macro only with `#ifdef' so the precise + definition used does not matter. + + `STACK_PUSH_CODE' + This macro defines the operation used when something is pushed on + the stack. In RTL, a push operation will be `(set (mem + (STACK_PUSH_CODE (reg sp))) ...)' + + The choices are `PRE_DEC', `POST_DEC', `PRE_INC', and `POST_INC'. + Which of these is correct depends on the stack direction and on + whether the stack pointer points to the last item on the stack or + whether it points to the space for the next item on the stack. + + The default is `PRE_DEC' when `STACK_GROWS_DOWNWARD' is defined, + which is almost always right, and `PRE_INC' otherwise, which is + often wrong. + + `FRAME_GROWS_DOWNWARD' + Define this macro if the addresses of local variable slots are at + negative offsets from the frame pointer. + + `ARGS_GROW_DOWNWARD' + Define this macro if successive arguments to a function occupy + decreasing addresses on the stack. + + `STARTING_FRAME_OFFSET' + Offset from the frame pointer to the first local variable slot to + be allocated. + + If `FRAME_GROWS_DOWNWARD', find the next slot's offset by + subtracting the first slot's length from `STARTING_FRAME_OFFSET'. + Otherwise, it is found by adding the length of the first slot to + the value `STARTING_FRAME_OFFSET'. + + `STACK_POINTER_OFFSET' + Offset from the stack pointer register to the first location at + which outgoing arguments are placed. If not specified, the + default value of zero is used. This is the proper value for most + machines. + + If `ARGS_GROW_DOWNWARD', this is the offset to the location above + the first location at which outgoing arguments are placed. + + `FIRST_PARM_OFFSET (FUNDECL)' + Offset from the argument pointer register to the first argument's + address. On some machines it may depend on the data type of the + function. + + If `ARGS_GROW_DOWNWARD', this is the offset to the location above + the first argument's address. + + `STACK_DYNAMIC_OFFSET (FUNDECL)' + Offset from the stack pointer register to an item dynamically + allocated on the stack, e.g., by `alloca'. + + The default value for this macro is `STACK_POINTER_OFFSET' plus the + length of the outgoing arguments. The default is correct for most + machines. See `function.c' for details. + + `DYNAMIC_CHAIN_ADDRESS (FRAMEADDR)' + A C expression whose value is RTL representing the address in a + stack frame where the pointer to the caller's frame is stored. + Assume that FRAMEADDR is an RTL expression for the address of the + stack frame itself. + + If you don't define this macro, the default is to return the value + of FRAMEADDR--that is, the stack frame address is also the address + of the stack word that points to the previous frame. + + `SETUP_FRAME_ADDRESSES' + If defined, a C expression that produces the machine-specific code + to setup the stack so that arbitrary frames can be accessed. For + example, on the Sparc, we must flush all of the register windows + to the stack before we can access arbitrary stack frames. You + will seldom need to define this macro. + + `BUILTIN_SETJMP_FRAME_VALUE' + If defined, a C expression that contains an rtx that is used to + store the address of the current frame into the built in `setjmp' + buffer. The default value, `virtual_stack_vars_rtx', is correct + for most machines. One reason you may need to define this macro + is if `hard_frame_pointer_rtx' is the appropriate value on your + machine. + + `RETURN_ADDR_RTX (COUNT, FRAMEADDR)' + A C expression whose value is RTL representing the value of the + return address for the frame COUNT steps up from the current + frame, after the prologue. FRAMEADDR is the frame pointer of the + COUNT frame, or the frame pointer of the COUNT - 1 frame if + `RETURN_ADDR_IN_PREVIOUS_FRAME' is defined. + + The value of the expression must always be the correct address when + COUNT is zero, but may be `NULL_RTX' if there is not way to + determine the return address of other frames. + + `RETURN_ADDR_IN_PREVIOUS_FRAME' + Define this if the return address of a particular stack frame is + accessed from the frame pointer of the previous stack frame. + + `INCOMING_RETURN_ADDR_RTX' + A C expression whose value is RTL representing the location of the + incoming return address at the beginning of any function, before + the prologue. This RTL is either a `REG', indicating that the + return value is saved in `REG', or a `MEM' representing a location + in the stack. + + You only need to define this macro if you want to support call + frame debugging information like that provided by DWARF 2. + + If this RTL is a `REG', you should also define + `DWARF_FRAME_RETURN_COLUMN' to `DWARF_FRAME_REGNUM (REGNO)'. + + `INCOMING_FRAME_SP_OFFSET' + A C expression whose value is an integer giving the offset, in + bytes, from the value of the stack pointer register to the top of + the stack frame at the beginning of any function, before the + prologue. The top of the frame is defined to be the value of the + stack pointer in the previous frame, just before the call + instruction. + + You only need to define this macro if you want to support call + frame debugging information like that provided by DWARF 2. + + `ARG_POINTER_CFA_OFFSET (FUNDECL)' + A C expression whose value is an integer giving the offset, in + bytes, from the argument pointer to the canonical frame address + (cfa). The final value should coincide with that calculated by + `INCOMING_FRAME_SP_OFFSET'. Which is unfortunately not usable + during virtual register instantiation. + + The default value for this macro is `FIRST_PARM_OFFSET (fundecl)', + which is correct for most machines; in general, the arguments are + found immediately before the stack frame. Note that this is not + the case on some targets that save registers into the caller's + frame, such as SPARC and rs6000, and so such targets need to + define this macro. + + You only need to define this macro if the default is incorrect, + and you want to support call frame debugging information like that + provided by DWARF 2. + + `SMALL_STACK' + Define this macro if the stack size for the target is very small. + This has the effect of disabling gcc's built-in `alloca', though + `__builtin_alloca' is not affected. + +  + File: gccint.info, Node: Exception Handling, Next: Stack Checking, Prev: Frame Layout, Up: Stack and Calling + + Exception Handling Support + -------------------------- + + `EH_RETURN_DATA_REGNO (N)' + A C expression whose value is the Nth register number used for + data by exception handlers, or `INVALID_REGNUM' if fewer than N + registers are usable. + + The exception handling library routines communicate with the + exception handlers via a set of agreed upon registers. Ideally + these registers should be call-clobbered; it is possible to use + call-saved registers, but may negatively impact code size. The + target must support at least 2 data registers, but should define 4 + if there are enough free registers. + + You must define this macro if you want to support call frame + exception handling like that provided by DWARF 2. + + `EH_RETURN_STACKADJ_RTX' + A C expression whose value is RTL representing a location in which + to store a stack adjustment to be applied before function return. + This is used to unwind the stack to an exception handler's call + frame. It will be assigned zero on code paths that return + normally. + + Typically this is a call-clobbered hard register that is otherwise + untouched by the epilogue, but could also be a stack slot. + + You must define this macro if you want to support call frame + exception handling like that provided by DWARF 2. + + `EH_RETURN_HANDLER_RTX' + A C expression whose value is RTL representing a location in which + to store the address of an exception handler to which we should + return. It will not be assigned on code paths that return + normally. + + Typically this is the location in the call frame at which the + normal return address is stored. For targets that return by + popping an address off the stack, this might be a memory address + just below the _target_ call frame rather than inside the current + call frame. `EH_RETURN_STACKADJ_RTX' will have already been + assigned, so it may be used to calculate the location of the + target call frame. + + Some targets have more complex requirements than storing to an + address calculable during initial code generation. In that case + the `eh_return' instruction pattern should be used instead. + + If you want to support call frame exception handling, you must + define either this macro or the `eh_return' instruction pattern. + + `ASM_PREFERRED_EH_DATA_FORMAT(CODE, GLOBAL)' + This macro chooses the encoding of pointers embedded in the + exception handling sections. If at all possible, this should be + defined such that the exception handling section will not require + dynamic relocations, and so may be read-only. + + CODE is 0 for data, 1 for code labels, 2 for function pointers. + GLOBAL is true if the symbol may be affected by dynamic + relocations. The macro should return a combination of the + `DW_EH_PE_*' defines as found in `dwarf2.h'. + + If this macro is not defined, pointers will not be encoded but + represented directly. + + `ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX(FILE, ENCODING, SIZE, ADDR, DONE)' + This macro allows the target to emit whatever special magic is + required to represent the encoding chosen by + `ASM_PREFERRED_EH_DATA_FORMAT'. Generic code takes care of + pc-relative and indirect encodings; this must be defined if the + target uses text-relative or data-relative encodings. + + This is a C statement that branches to DONE if the format was + handled. ENCODING is the format chosen, SIZE is the number of + bytes that the format occupies, ADDR is the `SYMBOL_REF' to be + emitted. + + `MD_FALLBACK_FRAME_STATE_FOR(CONTEXT, FS, SUCCESS)' + This macro allows the target to add cpu and operating system + specific code to the call-frame unwinder for use when there is no + unwind data available. The most common reason to implement this + macro is to unwind through signal frames. + + This macro is called from `uw_frame_state_for' in `unwind-dw2.c' + and `unwind-ia64.c'. CONTEXT is an `_Unwind_Context'; FS is an + `_Unwind_FrameState'. Examine `context->ra' for the address of + the code being executed and `context->cfa' for the stack pointer + value. If the frame can be decoded, the register save addresses + should be updated in FS and the macro should branch to SUCCESS. + If the frame cannot be decoded, the macro should do nothing. + +  + File: gccint.info, Node: Stack Checking, Next: Frame Registers, Prev: Exception Handling, Up: Stack and Calling + + Specifying How Stack Checking is Done + ------------------------------------- + + GCC will check that stack references are within the boundaries of + the stack, if the `-fstack-check' is specified, in one of three ways: + + 1. If the value of the `STACK_CHECK_BUILTIN' macro is nonzero, GCC + will assume that you have arranged for stack checking to be done at + appropriate places in the configuration files, e.g., in + `TARGET_ASM_FUNCTION_PROLOGUE'. GCC will do not other special + processing. + + 2. If `STACK_CHECK_BUILTIN' is zero and you defined a named pattern + called `check_stack' in your `md' file, GCC will call that pattern + with one argument which is the address to compare the stack value + against. You must arrange for this pattern to report an error if + the stack pointer is out of range. + + 3. If neither of the above are true, GCC will generate code to + periodically "probe" the stack pointer using the values of the + macros defined below. + + Normally, you will use the default values of these macros, so GCC + will use the third approach. + + `STACK_CHECK_BUILTIN' + A nonzero value if stack checking is done by the configuration + files in a machine-dependent manner. You should define this macro + if stack checking is require by the ABI of your machine or if you + would like to have to stack checking in some more efficient way + than GCC's portable approach. The default value of this macro is + zero. + + `STACK_CHECK_PROBE_INTERVAL' + An integer representing the interval at which GCC must generate + stack probe instructions. You will normally define this macro to + be no larger than the size of the "guard pages" at the end of a + stack area. The default value of 4096 is suitable for most + systems. + + `STACK_CHECK_PROBE_LOAD' + A integer which is nonzero if GCC should perform the stack probe + as a load instruction and zero if GCC should use a store + instruction. The default is zero, which is the most efficient + choice on most systems. + + `STACK_CHECK_PROTECT' + The number of bytes of stack needed to recover from a stack + overflow, for languages where such a recovery is supported. The + default value of 75 words should be adequate for most machines. + + `STACK_CHECK_MAX_FRAME_SIZE' + The maximum size of a stack frame, in bytes. GCC will generate + probe instructions in non-leaf functions to ensure at least this + many bytes of stack are available. If a stack frame is larger + than this size, stack checking will not be reliable and GCC will + issue a warning. The default is chosen so that GCC only generates + one instruction on most systems. You should normally not change + the default value of this macro. + + `STACK_CHECK_FIXED_FRAME_SIZE' + GCC uses this value to generate the above warning message. It + represents the amount of fixed frame used by a function, not + including space for any callee-saved registers, temporaries and + user variables. You need only specify an upper bound for this + amount and will normally use the default of four words. + + `STACK_CHECK_MAX_VAR_SIZE' + The maximum size, in bytes, of an object that GCC will place in the + fixed area of the stack frame when the user specifies + `-fstack-check'. GCC computed the default from the values of the + above macros and you will normally not need to override that + default. + +  + File: gccint.info, Node: Frame Registers, Next: Elimination, Prev: Stack Checking, Up: Stack and Calling + + Registers That Address the Stack Frame + -------------------------------------- + + This discusses registers that address the stack frame. + + `STACK_POINTER_REGNUM' + The register number of the stack pointer register, which must also + be a fixed register according to `FIXED_REGISTERS'. On most + machines, the hardware determines which register this is. + + `FRAME_POINTER_REGNUM' + The register number of the frame pointer register, which is used to + access automatic variables in the stack frame. On some machines, + the hardware determines which register this is. On other + machines, you can choose any register you wish for this purpose. + + `HARD_FRAME_POINTER_REGNUM' + On some machines the offset between the frame pointer and starting + offset of the automatic variables is not known until after register + allocation has been done (for example, because the saved registers + are between these two locations). On those machines, define + `FRAME_POINTER_REGNUM' the number of a special, fixed register to + be used internally until the offset is known, and define + `HARD_FRAME_POINTER_REGNUM' to be the actual hard register number + used for the frame pointer. + + You should define this macro only in the very rare circumstances + when it is not possible to calculate the offset between the frame + pointer and the automatic variables until after register + allocation has been completed. When this macro is defined, you + must also indicate in your definition of `ELIMINABLE_REGS' how to + eliminate `FRAME_POINTER_REGNUM' into either + `HARD_FRAME_POINTER_REGNUM' or `STACK_POINTER_REGNUM'. + + Do not define this macro if it would be the same as + `FRAME_POINTER_REGNUM'. + + `ARG_POINTER_REGNUM' + The register number of the arg pointer register, which is used to + access the function's argument list. On some machines, this is + the same as the frame pointer register. On some machines, the + hardware determines which register this is. On other machines, + you can choose any register you wish for this purpose. If this is + not the same register as the frame pointer register, then you must + mark it as a fixed register according to `FIXED_REGISTERS', or + arrange to be able to eliminate it (*note Elimination::). + + `RETURN_ADDRESS_POINTER_REGNUM' + The register number of the return address pointer register, which + is used to access the current function's return address from the + stack. On some machines, the return address is not at a fixed + offset from the frame pointer or stack pointer or argument + pointer. This register can be defined to point to the return + address on the stack, and then be converted by `ELIMINABLE_REGS' + into either the frame pointer or stack pointer. + + Do not define this macro unless there is no other way to get the + return address from the stack. + + `STATIC_CHAIN_REGNUM' + `STATIC_CHAIN_INCOMING_REGNUM' + Register numbers used for passing a function's static chain + pointer. If register windows are used, the register number as + seen by the called function is `STATIC_CHAIN_INCOMING_REGNUM', + while the register number as seen by the calling function is + `STATIC_CHAIN_REGNUM'. If these registers are the same, + `STATIC_CHAIN_INCOMING_REGNUM' need not be defined. + + The static chain register need not be a fixed register. + + If the static chain is passed in memory, these macros should not be + defined; instead, the next two macros should be defined. + + `STATIC_CHAIN' + `STATIC_CHAIN_INCOMING' + If the static chain is passed in memory, these macros provide rtx + giving `mem' expressions that denote where they are stored. + `STATIC_CHAIN' and `STATIC_CHAIN_INCOMING' give the locations as + seen by the calling and called functions, respectively. Often the + former will be at an offset from the stack pointer and the latter + at an offset from the frame pointer. + + The variables `stack_pointer_rtx', `frame_pointer_rtx', and + `arg_pointer_rtx' will have been initialized prior to the use of + these macros and should be used to refer to those items. + + If the static chain is passed in a register, the two previous + macros should be defined instead. + + `DWARF_FRAME_REGISTERS' + This macro specifies the maximum number of hard registers that can + be saved in a call frame. This is used to size data structures + used in DWARF2 exception handling. + + Prior to GCC 3.0, this macro was needed in order to establish a + stable exception handling ABI in the face of adding new hard + registers for ISA extensions. In GCC 3.0 and later, the EH ABI is + insulated from changes in the number of hard registers. + Nevertheless, this macro can still be used to reduce the runtime + memory requirements of the exception handling routines, which can + be substantial if the ISA contains a lot of registers that are not + call-saved. + + If this macro is not defined, it defaults to + `FIRST_PSEUDO_REGISTER'. + + `PRE_GCC3_DWARF_FRAME_REGISTERS' + This macro is similar to `DWARF_FRAME_REGISTERS', but is provided + for backward compatibility in pre GCC 3.0 compiled code. + + If this macro is not defined, it defaults to + `DWARF_FRAME_REGISTERS'. + + +  + File: gccint.info, Node: Elimination, Next: Stack Arguments, Prev: Frame Registers, Up: Stack and Calling + + Eliminating Frame Pointer and Arg Pointer + ----------------------------------------- + + This is about eliminating the frame pointer and arg pointer. + + `FRAME_POINTER_REQUIRED' + A C expression which is nonzero if a function must have and use a + frame pointer. This expression is evaluated in the reload pass. + If its value is nonzero the function will have a frame pointer. + + The expression can in principle examine the current function and + decide according to the facts, but on most machines the constant 0 + or the constant 1 suffices. Use 0 when the machine allows code to + be generated with no frame pointer, and doing so saves some time + or space. Use 1 when there is no possible advantage to avoiding a + frame pointer. + + In certain cases, the compiler does not know how to produce valid + code without a frame pointer. The compiler recognizes those cases + and automatically gives the function a frame pointer regardless of + what `FRAME_POINTER_REQUIRED' says. You don't need to worry about + them. + + In a function that does not require a frame pointer, the frame + pointer register can be allocated for ordinary usage, unless you + mark it as a fixed register. See `FIXED_REGISTERS' for more + information. + + `INITIAL_FRAME_POINTER_OFFSET (DEPTH-VAR)' + A C statement to store in the variable DEPTH-VAR the difference + between the frame pointer and the stack pointer values immediately + after the function prologue. The value would be computed from + information such as the result of `get_frame_size ()' and the + tables of registers `regs_ever_live' and `call_used_regs'. + + If `ELIMINABLE_REGS' is defined, this macro will be not be used and + need not be defined. Otherwise, it must be defined even if + `FRAME_POINTER_REQUIRED' is defined to always be true; in that + case, you may set DEPTH-VAR to anything. + + `ELIMINABLE_REGS' + If defined, this macro specifies a table of register pairs used to + eliminate unneeded registers that point into the stack frame. If + it is not defined, the only elimination attempted by the compiler + is to replace references to the frame pointer with references to + the stack pointer. + + The definition of this macro is a list of structure + initializations, each of which specifies an original and + replacement register. + + On some machines, the position of the argument pointer is not + known until the compilation is completed. In such a case, a + separate hard register must be used for the argument pointer. + This register can be eliminated by replacing it with either the + frame pointer or the argument pointer, depending on whether or not + the frame pointer has been eliminated. + + In this case, you might specify: + #define ELIMINABLE_REGS \ + {{ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \ + {ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \ + {FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}} + + Note that the elimination of the argument pointer with the stack + pointer is specified first since that is the preferred elimination. + + `CAN_ELIMINATE (FROM-REG, TO-REG)' + A C expression that returns nonzero if the compiler is allowed to + try to replace register number FROM-REG with register number + TO-REG. This macro need only be defined if `ELIMINABLE_REGS' is + defined, and will usually be the constant 1, since most of the + cases preventing register elimination are things that the compiler + already knows about. + + `INITIAL_ELIMINATION_OFFSET (FROM-REG, TO-REG, OFFSET-VAR)' + This macro is similar to `INITIAL_FRAME_POINTER_OFFSET'. It + specifies the initial difference between the specified pair of + registers. This macro must be defined if `ELIMINABLE_REGS' is + defined. + +  + File: gccint.info, Node: Stack Arguments, Next: Register Arguments, Prev: Elimination, Up: Stack and Calling + + Passing Function Arguments on the Stack + --------------------------------------- + + The macros in this section control how arguments are passed on the + stack. See the following section for other macros that control passing + certain arguments in registers. + + `PROMOTE_PROTOTYPES' + A C expression whose value is nonzero if an argument declared in a + prototype as an integral type smaller than `int' should actually + be passed as an `int'. In addition to avoiding errors in certain + cases of mismatch, it also makes for better code on certain + machines. If the macro is not defined in target header files, it + defaults to 0. + + `PUSH_ARGS' + A C expression. If nonzero, push insns will be used to pass + outgoing arguments. If the target machine does not have a push + instruction, set it to zero. That directs GCC to use an alternate + strategy: to allocate the entire argument block and then store the + arguments into it. When `PUSH_ARGS' is nonzero, `PUSH_ROUNDING' + must be defined too. + + `PUSH_ROUNDING (NPUSHED)' + A C expression that is the number of bytes actually pushed onto the + stack when an instruction attempts to push NPUSHED bytes. + + On some machines, the definition + + #define PUSH_ROUNDING(BYTES) (BYTES) + + will suffice. But on other machines, instructions that appear to + push one byte actually push two bytes in an attempt to maintain + alignment. Then the definition should be + + #define PUSH_ROUNDING(BYTES) (((BYTES) + 1) & ~1) + + `ACCUMULATE_OUTGOING_ARGS' + A C expression. If nonzero, the maximum amount of space required + for outgoing arguments will be computed and placed into the + variable `current_function_outgoing_args_size'. No space will be + pushed onto the stack for each call; instead, the function + prologue should increase the stack frame size by this amount. + + Setting both `PUSH_ARGS' and `ACCUMULATE_OUTGOING_ARGS' is not + proper. + + `REG_PARM_STACK_SPACE (FNDECL)' + Define this macro if functions should assume that stack space has + been allocated for arguments even when their values are passed in + registers. + + The value of this macro is the size, in bytes, of the area + reserved for arguments passed in registers for the function + represented by FNDECL, which can be zero if GCC is calling a + library function. + + This space can be allocated by the caller, or be a part of the + machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE' says + which. + + `MAYBE_REG_PARM_STACK_SPACE' + `FINAL_REG_PARM_STACK_SPACE (CONST_SIZE, VAR_SIZE)' + Define these macros in addition to the one above if functions might + allocate stack space for arguments even when their values are + passed in registers. These should be used when the stack space + allocated for arguments in registers is not a simple constant + independent of the function declaration. + + The value of the first macro is the size, in bytes, of the area + that we should initially assume would be reserved for arguments + passed in registers. + + The value of the second macro is the actual size, in bytes, of the + area that will be reserved for arguments passed in registers. + This takes two arguments: an integer representing the number of + bytes of fixed sized arguments on the stack, and a tree + representing the number of bytes of variable sized arguments on + the stack. + + When these macros are defined, `REG_PARM_STACK_SPACE' will only be + called for libcall functions, the current function, or for a + function being called when it is known that such stack space must + be allocated. In each case this value can be easily computed. + + When deciding whether a called function needs such stack space, + and how much space to reserve, GCC uses these two macros instead of + `REG_PARM_STACK_SPACE'. + + `OUTGOING_REG_PARM_STACK_SPACE' + Define this if it is the responsibility of the caller to allocate + the area reserved for arguments passed in registers. + + If `ACCUMULATE_OUTGOING_ARGS' is defined, this macro controls + whether the space for these arguments counts in the value of + `current_function_outgoing_args_size'. + + `STACK_PARMS_IN_REG_PARM_AREA' + Define this macro if `REG_PARM_STACK_SPACE' is defined, but the + stack parameters don't skip the area specified by it. + + Normally, when a parameter is not passed in registers, it is + placed on the stack beyond the `REG_PARM_STACK_SPACE' area. + Defining this macro suppresses this behavior and causes the + parameter to be passed on the stack in its natural location. + + `RETURN_POPS_ARGS (FUNDECL, FUNTYPE, STACK-SIZE)' + A C expression that should indicate the number of bytes of its own + arguments that a function pops on returning, or 0 if the function + pops no arguments and the caller must therefore pop them all after + the function returns. + + FUNDECL is a C variable whose value is a tree node that describes + the function in question. Normally it is a node of type + `FUNCTION_DECL' that describes the declaration of the function. + From this you can obtain the `DECL_ATTRIBUTES' of the function. + + FUNTYPE is a C variable whose value is a tree node that describes + the function in question. Normally it is a node of type + `FUNCTION_TYPE' that describes the data type of the function. + From this it is possible to obtain the data types of the value and + arguments (if known). + + When a call to a library function is being considered, FUNDECL + will contain an identifier node for the library function. Thus, if + you need to distinguish among various library functions, you can + do so by their names. Note that "library function" in this + context means a function used to perform arithmetic, whose name is + known specially in the compiler and was not mentioned in the C + code being compiled. + + STACK-SIZE is the number of bytes of arguments passed on the + stack. If a variable number of bytes is passed, it is zero, and + argument popping will always be the responsibility of the calling + function. + + On the VAX, all functions always pop their arguments, so the + definition of this macro is STACK-SIZE. On the 68000, using the + standard calling convention, no functions pop their arguments, so + the value of the macro is always 0 in this case. But an + alternative calling convention is available in which functions + that take a fixed number of arguments pop them but other functions + (such as `printf') pop nothing (the caller pops all). When this + convention is in use, FUNTYPE is examined to determine whether a + function takes a fixed number of arguments. + + `CALL_POPS_ARGS (CUM)' + A C expression that should indicate the number of bytes a call + sequence pops off the stack. It is added to the value of + `RETURN_POPS_ARGS' when compiling a function call. + + CUM is the variable in which all arguments to the called function + have been accumulated. + + On certain architectures, such as the SH5, a call trampoline is + used that pops certain registers off the stack, depending on the + arguments that have been passed to the function. Since this is a + property of the call site, not of the called function, + `RETURN_POPS_ARGS' is not appropriate. + + +  + File: gccint.info, Node: Register Arguments, Next: Scalar Return, Prev: Stack Arguments, Up: Stack and Calling + + Passing Arguments in Registers + ------------------------------ + + This section describes the macros which let you control how various + types of arguments are passed in registers or how they are arranged in + the stack. + + `FUNCTION_ARG (CUM, MODE, TYPE, NAMED)' + A C expression that controls whether a function argument is passed + in a register, and which register. + + The arguments are CUM, which summarizes all the previous + arguments; MODE, the machine mode of the argument; TYPE, the data + type of the argument as a tree node or 0 if that is not known + (which happens for C support library functions); and NAMED, which + is 1 for an ordinary argument and 0 for nameless arguments that + correspond to `...' in the called function's prototype. TYPE can + be an incomplete type if a syntax error has previously occurred. + + The value of the expression is usually either a `reg' RTX for the + hard register in which to pass the argument, or zero to pass the + argument on the stack. + + For machines like the VAX and 68000, where normally all arguments + are pushed, zero suffices as a definition. + + The value of the expression can also be a `parallel' RTX. This is + used when an argument is passed in multiple locations. The mode + of the of the `parallel' should be the mode of the entire + argument. The `parallel' holds any number of `expr_list' pairs; + each one describes where part of the argument is passed. In each + `expr_list' the first operand must be a `reg' RTX for the hard + register in which to pass this part of the argument, and the mode + of the register RTX indicates how large this part of the argument + is. The second operand of the `expr_list' is a `const_int' which + gives the offset in bytes into the entire argument of where this + part starts. As a special exception the first `expr_list' in the + `parallel' RTX may have a first operand of zero. This indicates + that the entire argument is also stored on the stack. + + The last time this macro is called, it is called with `MODE == + VOIDmode', and its result is passed to the `call' or `call_value' + pattern as operands 2 and 3 respectively. + + The usual way to make the ISO library `stdarg.h' work on a machine + where some arguments are usually passed in registers, is to cause + nameless arguments to be passed on the stack instead. This is done + by making `FUNCTION_ARG' return 0 whenever NAMED is 0. + + You may use the macro `MUST_PASS_IN_STACK (MODE, TYPE)' in the + definition of this macro to determine if this argument is of a + type that must be passed in the stack. If `REG_PARM_STACK_SPACE' + is not defined and `FUNCTION_ARG' returns nonzero for such an + argument, the compiler will abort. If `REG_PARM_STACK_SPACE' is + defined, the argument will be computed in the stack and then + loaded into a register. + + `MUST_PASS_IN_STACK (MODE, TYPE)' + Define as a C expression that evaluates to nonzero if we do not + know how to pass TYPE solely in registers. The file `expr.h' + defines a definition that is usually appropriate, refer to + `expr.h' for additional documentation. + + `FUNCTION_INCOMING_ARG (CUM, MODE, TYPE, NAMED)' + Define this macro if the target machine has "register windows", so + that the register in which a function sees an arguments is not + necessarily the same as the one in which the caller passed the + argument. + + For such machines, `FUNCTION_ARG' computes the register in which + the caller passes the value, and `FUNCTION_INCOMING_ARG' should be + defined in a similar fashion to tell the function being called + where the arguments will arrive. + + If `FUNCTION_INCOMING_ARG' is not defined, `FUNCTION_ARG' serves + both purposes. + + `FUNCTION_ARG_PARTIAL_NREGS (CUM, MODE, TYPE, NAMED)' + A C expression for the number of words, at the beginning of an + argument, that must be put in registers. The value must be zero + for arguments that are passed entirely in registers or that are + entirely pushed on the stack. + + On some machines, certain arguments must be passed partially in + registers and partially in memory. On these machines, typically + the first N words of arguments are passed in registers, and the + rest on the stack. If a multi-word argument (a `double' or a + structure) crosses that boundary, its first few words must be + passed in registers and the rest must be pushed. This macro tells + the compiler when this occurs, and how many of the words should go + in registers. + + `FUNCTION_ARG' for these arguments should return the first + register to be used by the caller for this argument; likewise + `FUNCTION_INCOMING_ARG', for the called function. + + `FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)' + A C expression that indicates when an argument must be passed by + reference. If nonzero for an argument, a copy of that argument is + made in memory and a pointer to the argument is passed instead of + the argument itself. The pointer is passed in whatever way is + appropriate for passing a pointer to that type. + + On machines where `REG_PARM_STACK_SPACE' is not defined, a suitable + definition of this macro might be + #define FUNCTION_ARG_PASS_BY_REFERENCE\ + (CUM, MODE, TYPE, NAMED) \ + MUST_PASS_IN_STACK (MODE, TYPE) + + `FUNCTION_ARG_CALLEE_COPIES (CUM, MODE, TYPE, NAMED)' + If defined, a C expression that indicates when it is the called + function's responsibility to make a copy of arguments passed by + invisible reference. Normally, the caller makes a copy and passes + the address of the copy to the routine being called. When + `FUNCTION_ARG_CALLEE_COPIES' is defined and is nonzero, the caller + does not make a copy. Instead, it passes a pointer to the "live" + value. The called function must not modify this value. If it can + be determined that the value won't be modified, it need not make a + copy; otherwise a copy must be made. + + `FUNCTION_ARG_REG_LITTLE_ENDIAN' + If defined TRUE on a big-endian system then structure arguments + passed (and returned) in registers are passed in a little-endian + manner instead of the big-endian manner. On the HP-UX IA64 and + PA64 platforms structures are aligned differently then integral + values and setting this value to true will allow for the special + handling of structure arguments and return values. + + `CUMULATIVE_ARGS' + A C type for declaring a variable that is used as the first + argument of `FUNCTION_ARG' and other related values. For some + target machines, the type `int' suffices and can hold the number + of bytes of argument so far. + + There is no need to record in `CUMULATIVE_ARGS' anything about the + arguments that have been passed on the stack. The compiler has + other variables to keep track of that. For target machines on + which all arguments are passed on the stack, there is no need to + store anything in `CUMULATIVE_ARGS'; however, the data structure + must exist and should not be empty, so use `int'. + + `INIT_CUMULATIVE_ARGS (CUM, FNTYPE, LIBNAME, INDIRECT)' + A C statement (sans semicolon) for initializing the variable CUM + for the state at the beginning of the argument list. The variable + has type `CUMULATIVE_ARGS'. The value of FNTYPE is the tree node + for the data type of the function which will receive the args, or 0 + if the args are to a compiler support library function. The value + of INDIRECT is nonzero when processing an indirect call, for + example a call through a function pointer. The value of INDIRECT + is zero for a call to an explicitly named function, a library + function call, or when `INIT_CUMULATIVE_ARGS' is used to find + arguments for the function being compiled. + + When processing a call to a compiler support library function, + LIBNAME identifies which one. It is a `symbol_ref' rtx which + contains the name of the function, as a string. LIBNAME is 0 when + an ordinary C function call is being processed. Thus, each time + this macro is called, either LIBNAME or FNTYPE is nonzero, but + never both of them at once. + + `INIT_CUMULATIVE_LIBCALL_ARGS (CUM, MODE, LIBNAME)' + Like `INIT_CUMULATIVE_ARGS' but only used for outgoing libcalls, + it gets a `MODE' argument instead of FNTYPE, that would be `NULL'. + INDIRECT would always be zero, too. If this macro is not + defined, `INIT_CUMULATIVE_ARGS (cum, NULL_RTX, libname, 0)' is + used instead. + + `INIT_CUMULATIVE_INCOMING_ARGS (CUM, FNTYPE, LIBNAME)' + Like `INIT_CUMULATIVE_ARGS' but overrides it for the purposes of + finding the arguments for the function being compiled. If this + macro is undefined, `INIT_CUMULATIVE_ARGS' is used instead. + + The value passed for LIBNAME is always 0, since library routines + with special calling conventions are never compiled with GCC. The + argument LIBNAME exists for symmetry with `INIT_CUMULATIVE_ARGS'. + + `FUNCTION_ARG_ADVANCE (CUM, MODE, TYPE, NAMED)' + A C statement (sans semicolon) to update the summarizer variable + CUM to advance past an argument in the argument list. The values + MODE, TYPE and NAMED describe that argument. Once this is done, + the variable CUM is suitable for analyzing the _following_ + argument with `FUNCTION_ARG', etc. + + This macro need not do anything if the argument in question was + passed on the stack. The compiler knows how to track the amount + of stack space used for arguments without any special help. + + `FUNCTION_ARG_PADDING (MODE, TYPE)' + If defined, a C expression which determines whether, and in which + direction, to pad out an argument with extra space. The value + should be of type `enum direction': either `upward' to pad above + the argument, `downward' to pad below, or `none' to inhibit + padding. + + The _amount_ of padding is always just enough to reach the next + multiple of `FUNCTION_ARG_BOUNDARY'; this macro does not control + it. + + This macro has a default definition which is right for most + systems. For little-endian machines, the default is to pad + upward. For big-endian machines, the default is to pad downward + for an argument of constant size shorter than an `int', and upward + otherwise. + + `PAD_VARARGS_DOWN' + If defined, a C expression which determines whether the default + implementation of va_arg will attempt to pad down before reading + the next argument, if that argument is smaller than its aligned + space as controlled by `PARM_BOUNDARY'. If this macro is not + defined, all such arguments are padded down if `BYTES_BIG_ENDIAN' + is true. + + `FUNCTION_ARG_BOUNDARY (MODE, TYPE)' + If defined, a C expression that gives the alignment boundary, in + bits, of an argument with the specified mode and type. If it is + not defined, `PARM_BOUNDARY' is used for all arguments. + + `FUNCTION_ARG_REGNO_P (REGNO)' + A C expression that is nonzero if REGNO is the number of a hard + register in which function arguments are sometimes passed. This + does _not_ include implicit arguments such as the static chain and + the structure-value address. On many machines, no registers can be + used for this purpose since all function arguments are pushed on + the stack. + + `LOAD_ARGS_REVERSED' + If defined, the order in which arguments are loaded into their + respective argument registers is reversed so that the last + argument is loaded first. This macro only affects arguments + passed in registers. + + +  + File: gccint.info, Node: Scalar Return, Next: Aggregate Return, Prev: Register Arguments, Up: Stack and Calling + + How Scalar Function Values Are Returned + --------------------------------------- + + This section discusses the macros that control returning scalars as + values--values that can fit in registers. + + `TRADITIONAL_RETURN_FLOAT' + Define this macro if `-traditional' should not cause functions + declared to return `float' to convert the value to `double'. + + `FUNCTION_VALUE (VALTYPE, FUNC)' + A C expression to create an RTX representing the place where a + function returns a value of data type VALTYPE. VALTYPE is a tree + node representing a data type. Write `TYPE_MODE (VALTYPE)' to get + the machine mode used to represent that type. On many machines, + only the mode is relevant. (Actually, on most machines, scalar + values are returned in the same place regardless of mode). + + The value of the expression is usually a `reg' RTX for the hard + register where the return value is stored. The value can also be a + `parallel' RTX, if the return value is in multiple places. See + `FUNCTION_ARG' for an explanation of the `parallel' form. + + If `PROMOTE_FUNCTION_RETURN' is defined, you must apply the same + promotion rules specified in `PROMOTE_MODE' if VALTYPE is a scalar + type. + + If the precise function being called is known, FUNC is a tree node + (`FUNCTION_DECL') for it; otherwise, FUNC is a null pointer. This + makes it possible to use a different value-returning convention + for specific functions when all their calls are known. + + `FUNCTION_VALUE' is not used for return vales with aggregate data + types, because these are returned in another way. See + `STRUCT_VALUE_REGNUM' and related macros, below. + + `FUNCTION_OUTGOING_VALUE (VALTYPE, FUNC)' + Define this macro if the target machine has "register windows" so + that the register in which a function returns its value is not the + same as the one in which the caller sees the value. + + For such machines, `FUNCTION_VALUE' computes the register in which + the caller will see the value. `FUNCTION_OUTGOING_VALUE' should be + defined in a similar fashion to tell the function where to put the + value. + + If `FUNCTION_OUTGOING_VALUE' is not defined, `FUNCTION_VALUE' + serves both purposes. + + `FUNCTION_OUTGOING_VALUE' is not used for return vales with + aggregate data types, because these are returned in another way. + See `STRUCT_VALUE_REGNUM' and related macros, below. + + `LIBCALL_VALUE (MODE)' + A C expression to create an RTX representing the place where a + library function returns a value of mode MODE. If the precise + function being called is known, FUNC is a tree node + (`FUNCTION_DECL') for it; otherwise, FUNC is a null pointer. This + makes it possible to use a different value-returning convention + for specific functions when all their calls are known. + + Note that "library function" in this context means a compiler + support routine, used to perform arithmetic, whose name is known + specially by the compiler and was not mentioned in the C code being + compiled. + + The definition of `LIBRARY_VALUE' need not be concerned aggregate + data types, because none of the library functions returns such + types. + + `FUNCTION_VALUE_REGNO_P (REGNO)' + A C expression that is nonzero if REGNO is the number of a hard + register in which the values of called function may come back. + + A register whose use for returning values is limited to serving as + the second of a pair (for a value of type `double', say) need not + be recognized by this macro. So for most machines, this definition + suffices: + + #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0) + + If the machine has register windows, so that the caller and the + called function use different registers for the return value, this + macro should recognize only the caller's register numbers. + + `APPLY_RESULT_SIZE' + Define this macro if `untyped_call' and `untyped_return' need more + space than is implied by `FUNCTION_VALUE_REGNO_P' for saving and + restoring an arbitrary return value. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-16 gcc-3.2.3/gcc/doc/gccint.info-16 *** gcc-3.2.2/gcc/doc/gccint.info-16 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-16 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,881 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Aggregate Return, Next: Caller Saves, Prev: Scalar Return, Up: Stack and Calling + + How Large Values Are Returned + ----------------------------- + + When a function value's mode is `BLKmode' (and in some other cases), + the value is not returned according to `FUNCTION_VALUE' (*note Scalar + Return::). Instead, the caller passes the address of a block of memory + in which the value should be stored. This address is called the + "structure value address". + + This section describes how to control returning structure values in + memory. + + `RETURN_IN_MEMORY (TYPE)' + A C expression which can inhibit the returning of certain function + values in registers, based on the type of value. A nonzero value + says to return the function value in memory, just as large + structures are always returned. Here TYPE will be a C expression + of type `tree', representing the data type of the value. + + Note that values of mode `BLKmode' must be explicitly handled by + this macro. Also, the option `-fpcc-struct-return' takes effect + regardless of this macro. On most systems, it is possible to + leave the macro undefined; this causes a default definition to be + used, whose value is the constant 1 for `BLKmode' values, and 0 + otherwise. + + Do not use this macro to indicate that structures and unions + should always be returned in memory. You should instead use + `DEFAULT_PCC_STRUCT_RETURN' to indicate this. + + `DEFAULT_PCC_STRUCT_RETURN' + Define this macro to be 1 if all structure and union return values + must be in memory. Since this results in slower code, this should + be defined only if needed for compatibility with other compilers + or with an ABI. If you define this macro to be 0, then the + conventions used for structure and union return values are decided + by the `RETURN_IN_MEMORY' macro. + + If not defined, this defaults to the value 1. + + `STRUCT_VALUE_REGNUM' + If the structure value address is passed in a register, then + `STRUCT_VALUE_REGNUM' should be the number of that register. + + `STRUCT_VALUE' + If the structure value address is not passed in a register, define + `STRUCT_VALUE' as an expression returning an RTX for the place + where the address is passed. If it returns 0, the address is + passed as an "invisible" first argument. + + `STRUCT_VALUE_INCOMING_REGNUM' + On some architectures the place where the structure value address + is found by the called function is not the same place that the + caller put it. This can be due to register windows, or it could + be because the function prologue moves it to a different place. + + If the incoming location of the structure value address is in a + register, define this macro as the register number. + + `STRUCT_VALUE_INCOMING' + If the incoming location is not a register, then you should define + `STRUCT_VALUE_INCOMING' as an expression for an RTX for where the + called function should find the value. If it should find the + value on the stack, define this to create a `mem' which refers to + the frame pointer. A definition of 0 means that the address is + passed as an "invisible" first argument. + + `PCC_STATIC_STRUCT_RETURN' + Define this macro if the usual system convention on the target + machine for returning structures and unions is for the called + function to return the address of a static variable containing the + value. + + Do not define this if the usual system convention is for the + caller to pass an address to the subroutine. + + This macro has effect in `-fpcc-struct-return' mode, but it does + nothing when you use `-freg-struct-return' mode. + +  + File: gccint.info, Node: Caller Saves, Next: Function Entry, Prev: Aggregate Return, Up: Stack and Calling + + Caller-Saves Register Allocation + -------------------------------- + + If you enable it, GCC can save registers around function calls. This + makes it possible to use call-clobbered registers to hold variables that + must live across calls. + + `DEFAULT_CALLER_SAVES' + Define this macro if function calls on the target machine do not + preserve any registers; in other words, if `CALL_USED_REGISTERS' + has 1 for all registers. When defined, this macro enables + `-fcaller-saves' by default for all optimization levels. It has + no effect for optimization levels 2 and higher, where + `-fcaller-saves' is the default. + + `CALLER_SAVE_PROFITABLE (REFS, CALLS)' + A C expression to determine whether it is worthwhile to consider + placing a pseudo-register in a call-clobbered hard register and + saving and restoring it around each function call. The expression + should be 1 when this is worth doing, and 0 otherwise. + + If you don't define this macro, a default is used which is good on + most machines: `4 * CALLS < REFS'. + + `HARD_REGNO_CALLER_SAVE_MODE (REGNO, NREGS)' + A C expression specifying which mode is required for saving NREGS + of a pseudo-register in call-clobbered hard register REGNO. If + REGNO is unsuitable for caller save, `VOIDmode' should be + returned. For most machines this macro need not be defined since + GCC will select the smallest suitable mode. + +  + File: gccint.info, Node: Function Entry, Next: Profiling, Prev: Caller Saves, Up: Stack and Calling + + Function Entry and Exit + ----------------------- + + This section describes the macros that output function entry + ("prologue") and exit ("epilogue") code. + + - Target Hook: void TARGET_ASM_FUNCTION_PROLOGUE (FILE *FILE, + HOST_WIDE_INT SIZE) + If defined, a function that outputs the assembler code for entry + to a function. The prologue is responsible for setting up the + stack frame, initializing the frame pointer register, saving + registers that must be saved, and allocating SIZE additional bytes + of storage for the local variables. SIZE is an integer. FILE is + a stdio stream to which the assembler code should be output. + + The label for the beginning of the function need not be output by + this macro. That has already been done when the macro is run. + + To determine which registers to save, the macro can refer to the + array `regs_ever_live': element R is nonzero if hard register R is + used anywhere within the function. This implies the function + prologue should save register R, provided it is not one of the + call-used registers. (`TARGET_ASM_FUNCTION_EPILOGUE' must + likewise use `regs_ever_live'.) + + On machines that have "register windows", the function entry code + does not save on the stack the registers that are in the windows, + even if they are supposed to be preserved by function calls; + instead it takes appropriate steps to "push" the register stack, + if any non-call-used registers are used in the function. + + On machines where functions may or may not have frame-pointers, the + function entry code must vary accordingly; it must set up the frame + pointer if one is wanted, and not otherwise. To determine whether + a frame pointer is in wanted, the macro can refer to the variable + `frame_pointer_needed'. The variable's value will be 1 at run + time in a function that needs a frame pointer. *Note + Elimination::. + + The function entry code is responsible for allocating any stack + space required for the function. This stack space consists of the + regions listed below. In most cases, these regions are allocated + in the order listed, with the last listed region closest to the + top of the stack (the lowest address if `STACK_GROWS_DOWNWARD' is + defined, and the highest address if it is not defined). You can + use a different order for a machine if doing so is more convenient + or required for compatibility reasons. Except in cases where + required by standard or by a debugger, there is no reason why the + stack layout used by GCC need agree with that used by other + compilers for a machine. + + - Target Hook: void TARGET_ASM_FUNCTION_END_PROLOGUE (FILE *FILE) + If defined, a function that outputs assembler code at the end of a + prologue. This should be used when the function prologue is being + emitted as RTL, and you have some extra assembler that needs to be + emitted. *Note prologue instruction pattern::. + + - Target Hook: void TARGET_ASM_FUNCTION_BEGIN_EPILOGUE (FILE *FILE) + If defined, a function that outputs assembler code at the start of + an epilogue. This should be used when the function epilogue is + being emitted as RTL, and you have some extra assembler that needs + to be emitted. *Note epilogue instruction pattern::. + + - Target Hook: void TARGET_ASM_FUNCTION_EPILOGUE (FILE *FILE, + HOST_WIDE_INT SIZE) + If defined, a function that outputs the assembler code for exit + from a function. The epilogue is responsible for restoring the + saved registers and stack pointer to their values when the + function was called, and returning control to the caller. This + macro takes the same arguments as the macro + `TARGET_ASM_FUNCTION_PROLOGUE', and the registers to restore are + determined from `regs_ever_live' and `CALL_USED_REGISTERS' in the + same way. + + On some machines, there is a single instruction that does all the + work of returning from the function. On these machines, give that + instruction the name `return' and do not define the macro + `TARGET_ASM_FUNCTION_EPILOGUE' at all. + + Do not define a pattern named `return' if you want the + `TARGET_ASM_FUNCTION_EPILOGUE' to be used. If you want the target + switches to control whether return instructions or epilogues are + used, define a `return' pattern with a validity condition that + tests the target switches appropriately. If the `return' + pattern's validity condition is false, epilogues will be used. + + On machines where functions may or may not have frame-pointers, the + function exit code must vary accordingly. Sometimes the code for + these two cases is completely different. To determine whether a + frame pointer is wanted, the macro can refer to the variable + `frame_pointer_needed'. The variable's value will be 1 when + compiling a function that needs a frame pointer. + + Normally, `TARGET_ASM_FUNCTION_PROLOGUE' and + `TARGET_ASM_FUNCTION_EPILOGUE' must treat leaf functions specially. + The C variable `current_function_is_leaf' is nonzero for such a + function. *Note Leaf Functions::. + + On some machines, some functions pop their arguments on exit while + others leave that for the caller to do. For example, the 68020 + when given `-mrtd' pops arguments in functions that take a fixed + number of arguments. + + Your definition of the macro `RETURN_POPS_ARGS' decides which + functions pop their own arguments. `TARGET_ASM_FUNCTION_EPILOGUE' + needs to know what was decided. The variable that is called + `current_function_pops_args' is the number of bytes of its + arguments that a function should pop. *Note Scalar Return::. + + * A region of `current_function_pretend_args_size' bytes of + uninitialized space just underneath the first argument + arriving on the stack. (This may not be at the very start of + the allocated stack region if the calling sequence has pushed + anything else since pushing the stack arguments. But + usually, on such machines, nothing else has been pushed yet, + because the function prologue itself does all the pushing.) + This region is used on machines where an argument may be + passed partly in registers and partly in memory, and, in some + cases to support the features in `' and + `'. + + * An area of memory used to save certain registers used by the + function. The size of this area, which may also include + space for such things as the return address and pointers to + previous stack frames, is machine-specific and usually + depends on which registers have been used in the function. + Machines with register windows often do not require a save + area. + + * A region of at least SIZE bytes, possibly rounded up to an + allocation boundary, to contain the local variables of the + function. On some machines, this region and the save area + may occur in the opposite order, with the save area closer to + the top of the stack. + + * Optionally, when `ACCUMULATE_OUTGOING_ARGS' is defined, a + region of `current_function_outgoing_args_size' bytes to be + used for outgoing argument lists of the function. *Note + Stack Arguments::. + + Normally, it is necessary for the macros + `TARGET_ASM_FUNCTION_PROLOGUE' and `TARGET_ASM_FUNCTION_EPILOGUE' + to treat leaf functions specially. The C variable + `current_function_is_leaf' is nonzero for such a function. + + `EXIT_IGNORE_STACK' + Define this macro as a C expression that is nonzero if the return + instruction or the function epilogue ignores the value of the stack + pointer; in other words, if it is safe to delete an instruction to + adjust the stack pointer before a return from the function. + + Note that this macro's value is relevant only for functions for + which frame pointers are maintained. It is never safe to delete a + final stack adjustment in a function that has no frame pointer, + and the compiler knows this regardless of `EXIT_IGNORE_STACK'. + + `EPILOGUE_USES (REGNO)' + Define this macro as a C expression that is nonzero for registers + that are used by the epilogue or the `return' pattern. The stack + and frame pointer registers are already be assumed to be used as + needed. + + `EH_USES (REGNO)' + Define this macro as a C expression that is nonzero for registers + that are used by the exception handling mechanism, and so should + be considered live on entry to an exception edge. + + `DELAY_SLOTS_FOR_EPILOGUE' + Define this macro if the function epilogue contains delay slots to + which instructions from the rest of the function can be "moved". + The definition should be a C expression whose value is an integer + representing the number of delay slots there. + + `ELIGIBLE_FOR_EPILOGUE_DELAY (INSN, N)' + A C expression that returns 1 if INSN can be placed in delay slot + number N of the epilogue. + + The argument N is an integer which identifies the delay slot now + being considered (since different slots may have different rules of + eligibility). It is never negative and is always less than the + number of epilogue delay slots (what `DELAY_SLOTS_FOR_EPILOGUE' + returns). If you reject a particular insn for a given delay slot, + in principle, it may be reconsidered for a subsequent delay slot. + Also, other insns may (at least in principle) be considered for + the so far unfilled delay slot. + + The insns accepted to fill the epilogue delay slots are put in an + RTL list made with `insn_list' objects, stored in the variable + `current_function_epilogue_delay_list'. The insn for the first + delay slot comes first in the list. Your definition of the macro + `TARGET_ASM_FUNCTION_EPILOGUE' should fill the delay slots by + outputting the insns in this list, usually by calling + `final_scan_insn'. + + You need not define this macro if you did not define + `DELAY_SLOTS_FOR_EPILOGUE'. + + `ASM_OUTPUT_MI_THUNK (FILE, THUNK_FNDECL, DELTA, FUNCTION)' + A C compound statement that outputs the assembler code for a thunk + function, used to implement C++ virtual function calls with + multiple inheritance. The thunk acts as a wrapper around a + virtual function, adjusting the implicit object parameter before + handing control off to the real function. + + First, emit code to add the integer DELTA to the location that + contains the incoming first argument. Assume that this argument + contains a pointer, and is the one used to pass the `this' pointer + in C++. This is the incoming argument _before_ the function + prologue, e.g. `%o0' on a sparc. The addition must preserve the + values of all other incoming arguments. + + After the addition, emit code to jump to FUNCTION, which is a + `FUNCTION_DECL'. This is a direct pure jump, not a call, and does + not touch the return address. Hence returning from FUNCTION will + return to whoever called the current `thunk'. + + The effect must be as if FUNCTION had been called directly with + the adjusted first argument. This macro is responsible for + emitting all of the code for a thunk function; + `TARGET_ASM_FUNCTION_PROLOGUE' and `TARGET_ASM_FUNCTION_EPILOGUE' + are not invoked. + + The THUNK_FNDECL is redundant. (DELTA and FUNCTION have already + been extracted from it.) It might possibly be useful on some + targets, but probably not. + + If you do not define this macro, the target-independent code in + the C++ front end will generate a less efficient heavyweight thunk + that calls FUNCTION instead of jumping to it. The generic + approach does not support varargs. + +  + File: gccint.info, Node: Profiling, Next: Tail Calls, Prev: Function Entry, Up: Stack and Calling + + Generating Code for Profiling + ----------------------------- + + These macros will help you generate code for profiling. + + `FUNCTION_PROFILER (FILE, LABELNO)' + A C statement or compound statement to output to FILE some + assembler code to call the profiling subroutine `mcount'. + + The details of how `mcount' expects to be called are determined by + your operating system environment, not by GCC. To figure them out, + compile a small program for profiling using the system's installed + C compiler and look at the assembler code that results. + + Older implementations of `mcount' expect the address of a counter + variable to be loaded into some register. The name of this + variable is `LP' followed by the number LABELNO, so you would + generate the name using `LP%d' in a `fprintf'. + + `PROFILE_HOOK' + A C statement or compound statement to output to FILE some assembly + code to call the profiling subroutine `mcount' even the target does + not support profiling. + + `NO_PROFILE_COUNTERS' + Define this macro if the `mcount' subroutine on your system does + not need a counter variable allocated for each function. This is + true for almost all modern implementations. If you define this + macro, you must not use the LABELNO argument to + `FUNCTION_PROFILER'. + + `PROFILE_BEFORE_PROLOGUE' + Define this macro if the code for function profiling should come + before the function prologue. Normally, the profiling code comes + after. + + `TARGET_ALLOWS_PROFILING_WITHOUT_FRAME_POINTER' + On some targets, it is impossible to use profiling when the frame + pointer has been omitted. For example, on x86 GNU/Linux systems, + the `mcount' routine provided by the GNU C Library finds the + address of the routine that called the routine that called `mcount' + by looking in the immediate caller's stack frame. If the immediate + caller has no frame pointer, this lookup will fail. + + By default, GCC assumes that the target does allow profiling when + the frame pointer is omitted. This macro should be defined to a C + expression that evaluates to `false' if the target does not allow + profiling when the frame pointer is omitted. + + +  + File: gccint.info, Node: Tail Calls, Prev: Profiling, Up: Stack and Calling + + Permitting tail calls + --------------------- + + `FUNCTION_OK_FOR_SIBCALL (DECL)' + A C expression that evaluates to true if it is ok to perform a + sibling call to DECL from the current function. + + It is not uncommon for limitations of calling conventions to + prevent tail calls to functions outside the current unit of + translation, or during PIC compilation. Use this macro to enforce + these restrictions, as the `sibcall' md pattern can not fail, or + fall over to a "normal" call. + +  + File: gccint.info, Node: Varargs, Next: Trampolines, Prev: Stack and Calling, Up: Target Macros + + Implementing the Varargs Macros + =============================== + + GCC comes with an implementation of `' and `' + that work without change on machines that pass arguments on the stack. + Other machines require their own implementations of varargs, and the + two machine independent header files must have conditionals to include + it. + + ISO `' differs from traditional `' mainly in + the calling convention for `va_start'. The traditional implementation + takes just one argument, which is the variable in which to store the + argument pointer. The ISO implementation of `va_start' takes an + additional second argument. The user is supposed to write the last + named argument of the function here. + + However, `va_start' should not use this argument. The way to find + the end of the named arguments is with the built-in functions described + below. + + `__builtin_saveregs ()' + Use this built-in function to save the argument registers in + memory so that the varargs mechanism can access them. Both ISO + and traditional versions of `va_start' must use + `__builtin_saveregs', unless you use `SETUP_INCOMING_VARARGS' (see + below) instead. + + On some machines, `__builtin_saveregs' is open-coded under the + control of the macro `EXPAND_BUILTIN_SAVEREGS'. On other machines, + it calls a routine written in assembler language, found in + `libgcc2.c'. + + Code generated for the call to `__builtin_saveregs' appears at the + beginning of the function, as opposed to where the call to + `__builtin_saveregs' is written, regardless of what the code is. + This is because the registers must be saved before the function + starts to use them for its own purposes. + + `__builtin_args_info (CATEGORY)' + Use this built-in function to find the first anonymous arguments in + registers. + + In general, a machine may have several categories of registers + used for arguments, each for a particular category of data types. + (For example, on some machines, floating-point registers are used + for floating-point arguments while other arguments are passed in + the general registers.) To make non-varargs functions use the + proper calling convention, you have defined the `CUMULATIVE_ARGS' + data type to record how many registers in each category have been + used so far + + `__builtin_args_info' accesses the same data structure of type + `CUMULATIVE_ARGS' after the ordinary argument layout is finished + with it, with CATEGORY specifying which word to access. Thus, the + value indicates the first unused register in a given category. + + Normally, you would use `__builtin_args_info' in the implementation + of `va_start', accessing each category just once and storing the + value in the `va_list' object. This is because `va_list' will + have to update the values, and there is no way to alter the values + accessed by `__builtin_args_info'. + + `__builtin_next_arg (LASTARG)' + This is the equivalent of `__builtin_args_info', for stack + arguments. It returns the address of the first anonymous stack + argument, as type `void *'. If `ARGS_GROW_DOWNWARD', it returns + the address of the location above the first anonymous stack + argument. Use it in `va_start' to initialize the pointer for + fetching arguments from the stack. Also use it in `va_start' to + verify that the second parameter LASTARG is the last named argument + of the current function. + + `__builtin_classify_type (OBJECT)' + Since each machine has its own conventions for which data types are + passed in which kind of register, your implementation of `va_arg' + has to embody these conventions. The easiest way to categorize the + specified data type is to use `__builtin_classify_type' together + with `sizeof' and `__alignof__'. + + `__builtin_classify_type' ignores the value of OBJECT, considering + only its data type. It returns an integer describing what kind of + type that is--integer, floating, pointer, structure, and so on. + + The file `typeclass.h' defines an enumeration that you can use to + interpret the values of `__builtin_classify_type'. + + These machine description macros help implement varargs: + + `EXPAND_BUILTIN_SAVEREGS ()' + If defined, is a C expression that produces the machine-specific + code for a call to `__builtin_saveregs'. This code will be moved + to the very beginning of the function, before any parameter access + are made. The return value of this function should be an RTX that + contains the value to use as the return of `__builtin_saveregs'. + + `SETUP_INCOMING_VARARGS (ARGS_SO_FAR, MODE, TYPE, PRETEND_ARGS_SIZE, SECOND_TIME)' + This macro offers an alternative to using `__builtin_saveregs' and + defining the macro `EXPAND_BUILTIN_SAVEREGS'. Use it to store the + anonymous register arguments into the stack so that all the + arguments appear to have been passed consecutively on the stack. + Once this is done, you can use the standard implementation of + varargs that works for machines that pass all their arguments on + the stack. + + The argument ARGS_SO_FAR is the `CUMULATIVE_ARGS' data structure, + containing the values that are obtained after processing the named + arguments. The arguments MODE and TYPE describe the last named + argument--its machine mode and its data type as a tree node. + + The macro implementation should do two things: first, push onto the + stack all the argument registers _not_ used for the named + arguments, and second, store the size of the data thus pushed into + the `int'-valued variable whose name is supplied as the argument + PRETEND_ARGS_SIZE. The value that you store here will serve as + additional offset for setting up the stack frame. + + Because you must generate code to push the anonymous arguments at + compile time without knowing their data types, + `SETUP_INCOMING_VARARGS' is only useful on machines that have just + a single category of argument register and use it uniformly for + all data types. + + If the argument SECOND_TIME is nonzero, it means that the + arguments of the function are being analyzed for the second time. + This happens for an inline function, which is not actually + compiled until the end of the source file. The macro + `SETUP_INCOMING_VARARGS' should not generate any instructions in + this case. + + `STRICT_ARGUMENT_NAMING' + Define this macro to be a nonzero value if the location where a + function argument is passed depends on whether or not it is a + named argument. + + This macro controls how the NAMED argument to `FUNCTION_ARG' is + set for varargs and stdarg functions. If this macro returns a + nonzero value, the NAMED argument is always true for named + arguments, and false for unnamed arguments. If it returns a value + of zero, but `SETUP_INCOMING_VARARGS' is defined, then all + arguments are treated as named. Otherwise, all named arguments + except the last are treated as named. + + You need not define this macro if it always returns zero. + + `PRETEND_OUTGOING_VARARGS_NAMED' + If you need to conditionally change ABIs so that one works with + `SETUP_INCOMING_VARARGS', but the other works like neither + `SETUP_INCOMING_VARARGS' nor `STRICT_ARGUMENT_NAMING' was defined, + then define this macro to return nonzero if + `SETUP_INCOMING_VARARGS' is used, zero otherwise. Otherwise, you + should not define this macro. + +  + File: gccint.info, Node: Trampolines, Next: Library Calls, Prev: Varargs, Up: Target Macros + + Trampolines for Nested Functions + ================================ + + A "trampoline" is a small piece of code that is created at run time + when the address of a nested function is taken. It normally resides on + the stack, in the stack frame of the containing function. These macros + tell GCC how to generate code to allocate and initialize a trampoline. + + The instructions in the trampoline must do two things: load a + constant address into the static chain register, and jump to the real + address of the nested function. On CISC machines such as the m68k, + this requires two instructions, a move immediate and a jump. Then the + two addresses exist in the trampoline as word-long immediate operands. + On RISC machines, it is often necessary to load each address into a + register in two parts. Then pieces of each address form separate + immediate operands. + + The code generated to initialize the trampoline must store the + variable parts--the static chain value and the function address--into + the immediate operands of the instructions. On a CISC machine, this is + simply a matter of copying each address to a memory reference at the + proper offset from the start of the trampoline. On a RISC machine, it + may be necessary to take out pieces of the address and store them + separately. + + `TRAMPOLINE_TEMPLATE (FILE)' + A C statement to output, on the stream FILE, assembler code for a + block of data that contains the constant parts of a trampoline. + This code should not include a label--the label is taken care of + automatically. + + If you do not define this macro, it means no template is needed + for the target. Do not define this macro on systems where the + block move code to copy the trampoline into place would be larger + than the code to generate it on the spot. + + `TRAMPOLINE_SECTION' + The name of a subroutine to switch to the section in which the + trampoline template is to be placed (*note Sections::). The + default is a value of `readonly_data_section', which places the + trampoline in the section containing read-only data. + + `TRAMPOLINE_SIZE' + A C expression for the size in bytes of the trampoline, as an + integer. + + `TRAMPOLINE_ALIGNMENT' + Alignment required for trampolines, in bits. + + If you don't define this macro, the value of `BIGGEST_ALIGNMENT' + is used for aligning trampolines. + + `INITIALIZE_TRAMPOLINE (ADDR, FNADDR, STATIC_CHAIN)' + A C statement to initialize the variable parts of a trampoline. + ADDR is an RTX for the address of the trampoline; FNADDR is an RTX + for the address of the nested function; STATIC_CHAIN is an RTX for + the static chain value that should be passed to the function when + it is called. + + `TRAMPOLINE_ADJUST_ADDRESS (ADDR)' + A C statement that should perform any machine-specific adjustment + in the address of the trampoline. Its argument contains the + address that was passed to `INITIALIZE_TRAMPOLINE'. In case the + address to be used for a function call should be different from + the address in which the template was stored, the different + address should be assigned to ADDR. If this macro is not defined, + ADDR will be used for function calls. + + `ALLOCATE_TRAMPOLINE (FP)' + A C expression to allocate run-time space for a trampoline. The + expression value should be an RTX representing a memory reference + to the space for the trampoline. + + If this macro is not defined, by default the trampoline is + allocated as a stack slot. This default is right for most + machines. The exceptions are machines where it is impossible to + execute instructions in the stack area. On such machines, you may + have to implement a separate stack, using this macro in + conjunction with `TARGET_ASM_FUNCTION_PROLOGUE' and + `TARGET_ASM_FUNCTION_EPILOGUE'. + + FP points to a data structure, a `struct function', which + describes the compilation status of the immediate containing + function of the function which the trampoline is for. Normally + (when `ALLOCATE_TRAMPOLINE' is not defined), the stack slot for the + trampoline is in the stack frame of this containing function. + Other allocation strategies probably must do something analogous + with this information. + + Implementing trampolines is difficult on many machines because they + have separate instruction and data caches. Writing into a stack + location fails to clear the memory in the instruction cache, so when + the program jumps to that location, it executes the old contents. + + Here are two possible solutions. One is to clear the relevant parts + of the instruction cache whenever a trampoline is set up. The other is + to make all trampolines identical, by having them jump to a standard + subroutine. The former technique makes trampoline execution faster; the + latter makes initialization faster. + + To clear the instruction cache when a trampoline is initialized, + define the following macros which describe the shape of the cache. + + `INSN_CACHE_SIZE' + The total size in bytes of the cache. + + `INSN_CACHE_LINE_WIDTH' + The length in bytes of each cache line. The cache is divided into + cache lines which are disjoint slots, each holding a contiguous + chunk of data fetched from memory. Each time data is brought into + the cache, an entire line is read at once. The data loaded into a + cache line is always aligned on a boundary equal to the line size. + + `INSN_CACHE_DEPTH' + The number of alternative cache lines that can hold any particular + memory location. + + Alternatively, if the machine has system calls or instructions to + clear the instruction cache directly, you can define the following + macro. + + `CLEAR_INSN_CACHE (BEG, END)' + If defined, expands to a C expression clearing the _instruction + cache_ in the specified interval. If it is not defined, and the + macro `INSN_CACHE_SIZE' is defined, some generic code is generated + to clear the cache. The definition of this macro would typically + be a series of `asm' statements. Both BEG and END are both pointer + expressions. + + To use a standard subroutine, define the following macro. In + addition, you must make sure that the instructions in a trampoline fill + an entire cache line with identical instructions, or else ensure that + the beginning of the trampoline code is always aligned at the same + point in its cache line. Look in `m68k.h' as a guide. + + `TRANSFER_FROM_TRAMPOLINE' + Define this macro if trampolines need a special subroutine to do + their work. The macro should expand to a series of `asm' + statements which will be compiled with GCC. They go in a library + function named `__transfer_from_trampoline'. + + If you need to avoid executing the ordinary prologue code of a + compiled C function when you jump to the subroutine, you can do so + by placing a special label of your own in the assembler code. Use + one `asm' statement to generate an assembler label, and another to + make the label global. Then trampolines can use that label to + jump directly to your special assembler code. + +  + File: gccint.info, Node: Library Calls, Next: Addressing Modes, Prev: Trampolines, Up: Target Macros + + Implicit Calls to Library Routines + ================================== + + Here is an explanation of implicit calls to library routines. + + `MULSI3_LIBCALL' + A C string constant giving the name of the function to call for + multiplication of one signed full-word by another. If you do not + define this macro, the default name is used, which is `__mulsi3', + a function defined in `libgcc.a'. + + `DIVSI3_LIBCALL' + A C string constant giving the name of the function to call for + division of one signed full-word by another. If you do not define + this macro, the default name is used, which is `__divsi3', a + function defined in `libgcc.a'. + + `UDIVSI3_LIBCALL' + A C string constant giving the name of the function to call for + division of one unsigned full-word by another. If you do not + define this macro, the default name is used, which is `__udivsi3', + a function defined in `libgcc.a'. + + `MODSI3_LIBCALL' + A C string constant giving the name of the function to call for the + remainder in division of one signed full-word by another. If you + do not define this macro, the default name is used, which is + `__modsi3', a function defined in `libgcc.a'. + + `UMODSI3_LIBCALL' + A C string constant giving the name of the function to call for the + remainder in division of one unsigned full-word by another. If + you do not define this macro, the default name is used, which is + `__umodsi3', a function defined in `libgcc.a'. + + `MULDI3_LIBCALL' + A C string constant giving the name of the function to call for + multiplication of one signed double-word by another. If you do not + define this macro, the default name is used, which is `__muldi3', + a function defined in `libgcc.a'. + + `DIVDI3_LIBCALL' + A C string constant giving the name of the function to call for + division of one signed double-word by another. If you do not + define this macro, the default name is used, which is `__divdi3', a + function defined in `libgcc.a'. + + `UDIVDI3_LIBCALL' + A C string constant giving the name of the function to call for + division of one unsigned full-word by another. If you do not + define this macro, the default name is used, which is `__udivdi3', + a function defined in `libgcc.a'. + + `MODDI3_LIBCALL' + A C string constant giving the name of the function to call for the + remainder in division of one signed double-word by another. If + you do not define this macro, the default name is used, which is + `__moddi3', a function defined in `libgcc.a'. + + `UMODDI3_LIBCALL' + A C string constant giving the name of the function to call for the + remainder in division of one unsigned full-word by another. If + you do not define this macro, the default name is used, which is + `__umoddi3', a function defined in `libgcc.a'. + + `INIT_TARGET_OPTABS' + Define this macro as a C statement that declares additional library + routines renames existing ones. `init_optabs' calls this macro + after initializing all the normal library routines. + + `FLOAT_LIB_COMPARE_RETURNS_BOOL' + Define this macro as a C statement that returns nonzero if a call + to the floating point comparison library function will return a + boolean value that indicates the result of the comparison. It + should return zero if one of gcc's own libgcc functions is called. + + Most ports don't need to define this macro. + + `TARGET_EDOM' + The value of `EDOM' on the target machine, as a C integer constant + expression. If you don't define this macro, GCC does not attempt + to deposit the value of `EDOM' into `errno' directly. Look in + `/usr/include/errno.h' to find the value of `EDOM' on your system. + + If you do not define `TARGET_EDOM', then compiled code reports + domain errors by calling the library function and letting it + report the error. If mathematical functions on your system use + `matherr' when there is an error, then you should leave + `TARGET_EDOM' undefined so that `matherr' is used normally. + + `GEN_ERRNO_RTX' + Define this macro as a C expression to create an rtl expression + that refers to the global "variable" `errno'. (On certain systems, + `errno' may not actually be a variable.) If you don't define this + macro, a reasonable default is used. + + `TARGET_MEM_FUNCTIONS' + Define this macro if GCC should generate calls to the ISO C (and + System V) library functions `memcpy', `memmove' and `memset' + rather than the BSD functions `bcopy' and `bzero'. + + `LIBGCC_NEEDS_DOUBLE' + Define this macro if `float' arguments cannot be passed to library + routines (so they must be converted to `double'). This macro + affects both how library calls are generated and how the library + routines in `libgcc.a' accept their arguments. It is useful on + machines where floating and fixed point arguments are passed + differently, such as the i860. + + `NEXT_OBJC_RUNTIME' + Define this macro to generate code for Objective-C message sending + using the calling convention of the NeXT system. This calling + convention involves passing the object, the selector and the + method arguments all at once to the method-lookup library function. + + The default calling convention passes just the object and the + selector to the lookup function, which returns a pointer to the + method. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-17 gcc-3.2.3/gcc/doc/gccint.info-17 *** gcc-3.2.2/gcc/doc/gccint.info-17 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-17 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1026 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Addressing Modes, Next: Condition Code, Prev: Library Calls, Up: Target Macros + + Addressing Modes + ================ + + This is about addressing modes. + + `HAVE_PRE_INCREMENT' + `HAVE_PRE_DECREMENT' + `HAVE_POST_INCREMENT' + `HAVE_POST_DECREMENT' + A C expression that is nonzero if the machine supports + pre-increment, pre-decrement, post-increment, or post-decrement + addressing respectively. + + `HAVE_PRE_MODIFY_DISP' + `HAVE_POST_MODIFY_DISP' + A C expression that is nonzero if the machine supports pre- or + post-address side-effect generation involving constants other than + the size of the memory operand. + + `HAVE_PRE_MODIFY_REG' + `HAVE_POST_MODIFY_REG' + A C expression that is nonzero if the machine supports pre- or + post-address side-effect generation involving a register + displacement. + + `CONSTANT_ADDRESS_P (X)' + A C expression that is 1 if the RTX X is a constant which is a + valid address. On most machines, this can be defined as + `CONSTANT_P (X)', but a few machines are more restrictive in which + constant addresses are supported. + + `CONSTANT_P' accepts integer-values expressions whose values are + not explicitly known, such as `symbol_ref', `label_ref', and + `high' expressions and `const' arithmetic expressions, in addition + to `const_int' and `const_double' expressions. + + `MAX_REGS_PER_ADDRESS' + A number, the maximum number of registers that can appear in a + valid memory address. Note that it is up to you to specify a + value equal to the maximum number that `GO_IF_LEGITIMATE_ADDRESS' + would ever accept. + + `GO_IF_LEGITIMATE_ADDRESS (MODE, X, LABEL)' + A C compound statement with a conditional `goto LABEL;' executed + if X (an RTX) is a legitimate memory address on the target machine + for a memory operand of mode MODE. + + It usually pays to define several simpler macros to serve as + subroutines for this one. Otherwise it may be too complicated to + understand. + + This macro must exist in two variants: a strict variant and a + non-strict one. The strict variant is used in the reload pass. It + must be defined so that any pseudo-register that has not been + allocated a hard register is considered a memory reference. In + contexts where some kind of register is required, a pseudo-register + with no hard register must be rejected. + + The non-strict variant is used in other passes. It must be + defined to accept all pseudo-registers in every context where some + kind of register is required. + + Compiler source files that want to use the strict variant of this + macro define the macro `REG_OK_STRICT'. You should use an `#ifdef + REG_OK_STRICT' conditional to define the strict variant in that + case and the non-strict variant otherwise. + + Subroutines to check for acceptable registers for various purposes + (one for base registers, one for index registers, and so on) are + typically among the subroutines used to define + `GO_IF_LEGITIMATE_ADDRESS'. Then only these subroutine macros + need have two variants; the higher levels of macros may be the + same whether strict or not. + + Normally, constant addresses which are the sum of a `symbol_ref' + and an integer are stored inside a `const' RTX to mark them as + constant. Therefore, there is no need to recognize such sums + specifically as legitimate addresses. Normally you would simply + recognize any `const' as legitimate. + + Usually `PRINT_OPERAND_ADDRESS' is not prepared to handle constant + sums that are not marked with `const'. It assumes that a naked + `plus' indicates indexing. If so, then you _must_ reject such + naked constant sums as illegitimate addresses, so that none of + them will be given to `PRINT_OPERAND_ADDRESS'. + + On some machines, whether a symbolic address is legitimate depends + on the section that the address refers to. On these machines, + define the macro `ENCODE_SECTION_INFO' to store the information + into the `symbol_ref', and then check for it here. When you see a + `const', you will have to look inside it to find the `symbol_ref' + in order to determine the section. *Note Assembler Format::. + + The best way to modify the name string is by adding text to the + beginning, with suitable punctuation to prevent any ambiguity. + Allocate the new name in `saveable_obstack'. You will have to + modify `ASM_OUTPUT_LABELREF' to remove and decode the added text + and output the name accordingly, and define `STRIP_NAME_ENCODING' + to access the original name string. + + You can check the information stored here into the `symbol_ref' in + the definitions of the macros `GO_IF_LEGITIMATE_ADDRESS' and + `PRINT_OPERAND_ADDRESS'. + + `REG_OK_FOR_BASE_P (X)' + A C expression that is nonzero if X (assumed to be a `reg' RTX) is + valid for use as a base register. For hard registers, it should + always accept those which the hardware permits and reject the + others. Whether the macro accepts or rejects pseudo registers + must be controlled by `REG_OK_STRICT' as described above. This + usually requires two variant definitions, of which `REG_OK_STRICT' + controls the one actually used. + + `REG_MODE_OK_FOR_BASE_P (X, MODE)' + A C expression that is just like `REG_OK_FOR_BASE_P', except that + that expression may examine the mode of the memory reference in + MODE. You should define this macro if the mode of the memory + reference affects whether a register may be used as a base + register. If you define this macro, the compiler will use it + instead of `REG_OK_FOR_BASE_P'. + + `REG_OK_FOR_INDEX_P (X)' + A C expression that is nonzero if X (assumed to be a `reg' RTX) is + valid for use as an index register. + + The difference between an index register and a base register is + that the index register may be scaled. If an address involves the + sum of two registers, neither one of them scaled, then either one + may be labeled the "base" and the other the "index"; but whichever + labeling is used must fit the machine's constraints of which + registers may serve in each capacity. The compiler will try both + labelings, looking for one that is valid, and will reload one or + both registers only if neither labeling works. + + `FIND_BASE_TERM (X)' + A C expression to determine the base term of address X. This + macro is used in only one place: `find_base_term' in alias.c. + + It is always safe for this macro to not be defined. It exists so + that alias analysis can understand machine-dependent addresses. + + The typical use of this macro is to handle addresses containing a + label_ref or symbol_ref within an UNSPEC. + + `LEGITIMIZE_ADDRESS (X, OLDX, MODE, WIN)' + A C compound statement that attempts to replace X with a valid + memory address for an operand of mode MODE. WIN will be a C + statement label elsewhere in the code; the macro definition may use + + GO_IF_LEGITIMATE_ADDRESS (MODE, X, WIN); + + to avoid further processing if the address has become legitimate. + + X will always be the result of a call to `break_out_memory_refs', + and OLDX will be the operand that was given to that function to + produce X. + + The code generated by this macro should not alter the substructure + of X. If it transforms X into a more legitimate form, it should + assign X (which will always be a C variable) a new value. + + It is not necessary for this macro to come up with a legitimate + address. The compiler has standard ways of doing so in all cases. + In fact, it is safe for this macro to do nothing. But often a + machine-dependent strategy can generate better code. + + `LEGITIMIZE_RELOAD_ADDRESS (X, MODE, OPNUM, TYPE, IND_LEVELS, WIN)' + A C compound statement that attempts to replace X, which is an + address that needs reloading, with a valid memory address for an + operand of mode MODE. WIN will be a C statement label elsewhere + in the code. It is not necessary to define this macro, but it + might be useful for performance reasons. + + For example, on the i386, it is sometimes possible to use a single + reload register instead of two by reloading a sum of two pseudo + registers into a register. On the other hand, for number of RISC + processors offsets are limited so that often an intermediate + address needs to be generated in order to address a stack slot. + By defining `LEGITIMIZE_RELOAD_ADDRESS' appropriately, the + intermediate addresses generated for adjacent some stack slots can + be made identical, and thus be shared. + + _Note_: This macro should be used with caution. It is necessary + to know something of how reload works in order to effectively use + this, and it is quite easy to produce macros that build in too + much knowledge of reload internals. + + _Note_: This macro must be able to reload an address created by a + previous invocation of this macro. If it fails to handle such + addresses then the compiler may generate incorrect code or abort. + + The macro definition should use `push_reload' to indicate parts + that need reloading; OPNUM, TYPE and IND_LEVELS are usually + suitable to be passed unaltered to `push_reload'. + + The code generated by this macro must not alter the substructure of + X. If it transforms X into a more legitimate form, it should + assign X (which will always be a C variable) a new value. This + also applies to parts that you change indirectly by calling + `push_reload'. + + The macro definition may use `strict_memory_address_p' to test if + the address has become legitimate. + + If you want to change only a part of X, one standard way of doing + this is to use `copy_rtx'. Note, however, that is unshares only a + single level of rtl. Thus, if the part to be changed is not at the + top level, you'll need to replace first the top level. It is not + necessary for this macro to come up with a legitimate address; + but often a machine-dependent strategy can generate better code. + + `GO_IF_MODE_DEPENDENT_ADDRESS (ADDR, LABEL)' + A C statement or compound statement with a conditional `goto + LABEL;' executed if memory address X (an RTX) can have different + meanings depending on the machine mode of the memory reference it + is used for or if the address is valid for some modes but not + others. + + Autoincrement and autodecrement addresses typically have + mode-dependent effects because the amount of the increment or + decrement is the size of the operand being addressed. Some + machines have other mode-dependent addresses. Many RISC machines + have no mode-dependent addresses. + + You may assume that ADDR is a valid address for the machine. + + `LEGITIMATE_CONSTANT_P (X)' + A C expression that is nonzero if X is a legitimate constant for + an immediate operand on the target machine. You can assume that X + satisfies `CONSTANT_P', so you need not check this. In fact, `1' + is a suitable definition for this macro on machines where anything + `CONSTANT_P' is valid. + +  + File: gccint.info, Node: Condition Code, Next: Costs, Prev: Addressing Modes, Up: Target Macros + + Condition Code Status + ===================== + + This describes the condition code status. + + The file `conditions.h' defines a variable `cc_status' to describe + how the condition code was computed (in case the interpretation of the + condition code depends on the instruction that it was set by). This + variable contains the RTL expressions on which the condition code is + currently based, and several standard flags. + + Sometimes additional machine-specific flags must be defined in the + machine description header file. It can also add additional + machine-specific information by defining `CC_STATUS_MDEP'. + + `CC_STATUS_MDEP' + C code for a data type which is used for declaring the `mdep' + component of `cc_status'. It defaults to `int'. + + This macro is not used on machines that do not use `cc0'. + + `CC_STATUS_MDEP_INIT' + A C expression to initialize the `mdep' field to "empty". The + default definition does nothing, since most machines don't use the + field anyway. If you want to use the field, you should probably + define this macro to initialize it. + + This macro is not used on machines that do not use `cc0'. + + `NOTICE_UPDATE_CC (EXP, INSN)' + A C compound statement to set the components of `cc_status' + appropriately for an insn INSN whose body is EXP. It is this + macro's responsibility to recognize insns that set the condition + code as a byproduct of other activity as well as those that + explicitly set `(cc0)'. + + This macro is not used on machines that do not use `cc0'. + + If there are insns that do not set the condition code but do alter + other machine registers, this macro must check to see whether they + invalidate the expressions that the condition code is recorded as + reflecting. For example, on the 68000, insns that store in address + registers do not set the condition code, which means that usually + `NOTICE_UPDATE_CC' can leave `cc_status' unaltered for such insns. + But suppose that the previous insn set the condition code based + on location `a4@(102)' and the current insn stores a new value in + `a4'. Although the condition code is not changed by this, it will + no longer be true that it reflects the contents of `a4@(102)'. + Therefore, `NOTICE_UPDATE_CC' must alter `cc_status' in this case + to say that nothing is known about the condition code value. + + The definition of `NOTICE_UPDATE_CC' must be prepared to deal with + the results of peephole optimization: insns whose patterns are + `parallel' RTXs containing various `reg', `mem' or constants which + are just the operands. The RTL structure of these insns is not + sufficient to indicate what the insns actually do. What + `NOTICE_UPDATE_CC' should do when it sees one is just to run + `CC_STATUS_INIT'. + + A possible definition of `NOTICE_UPDATE_CC' is to call a function + that looks at an attribute (*note Insn Attributes::) named, for + example, `cc'. This avoids having detailed information about + patterns in two places, the `md' file and in `NOTICE_UPDATE_CC'. + + `EXTRA_CC_MODES' + A list of additional modes for condition code values in registers + (*note Jump Patterns::). This macro should expand to a sequence of + calls of the macro `CC' separated by white space. `CC' takes two + arguments. The first is the enumeration name of the mode, which + should begin with `CC' and end with `mode'. The second is a C + string giving the printable name of the mode; it should be the + same as the first argument, but with the trailing `mode' removed. + + You should only define this macro if additional modes are required. + + A sample definition of `EXTRA_CC_MODES' is: + #define EXTRA_CC_MODES \ + CC(CC_NOOVmode, "CC_NOOV") \ + CC(CCFPmode, "CCFP") \ + CC(CCFPEmode, "CCFPE") + + `SELECT_CC_MODE (OP, X, Y)' + Returns a mode from class `MODE_CC' to be used when comparison + operation code OP is applied to rtx X and Y. For example, on the + Sparc, `SELECT_CC_MODE' is defined as (see *note Jump Patterns:: + for a description of the reason for this definition) + + #define SELECT_CC_MODE(OP,X,Y) \ + (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT \ + ? ((OP == EQ || OP == NE) ? CCFPmode : CCFPEmode) \ + : ((GET_CODE (X) == PLUS || GET_CODE (X) == MINUS \ + || GET_CODE (X) == NEG) \ + ? CC_NOOVmode : CCmode)) + + You need not define this macro if `EXTRA_CC_MODES' is not defined. + + `CANONICALIZE_COMPARISON (CODE, OP0, OP1)' + On some machines not all possible comparisons are defined, but you + can convert an invalid comparison into a valid one. For example, + the Alpha does not have a `GT' comparison, but you can use an `LT' + comparison instead and swap the order of the operands. + + On such machines, define this macro to be a C statement to do any + required conversions. CODE is the initial comparison code and OP0 + and OP1 are the left and right operands of the comparison, + respectively. You should modify CODE, OP0, and OP1 as required. + + GCC will not assume that the comparison resulting from this macro + is valid but will see if the resulting insn matches a pattern in + the `md' file. + + You need not define this macro if it would never change the + comparison code or operands. + + `REVERSIBLE_CC_MODE (MODE)' + A C expression whose value is one if it is always safe to reverse a + comparison whose mode is MODE. If `SELECT_CC_MODE' can ever + return MODE for a floating-point inequality comparison, then + `REVERSIBLE_CC_MODE (MODE)' must be zero. + + You need not define this macro if it would always returns zero or + if the floating-point format is anything other than + `IEEE_FLOAT_FORMAT'. For example, here is the definition used on + the Sparc, where floating-point inequality comparisons are always + given `CCFPEmode': + + #define REVERSIBLE_CC_MODE(MODE) ((MODE) != CCFPEmode) + + A C expression whose value is reversed condition code of the CODE + for comparison done in CC_MODE MODE. The macro is used only in + case `REVERSIBLE_CC_MODE (MODE)' is nonzero. Define this macro in + case machine has some non-standard way how to reverse certain + conditionals. For instance in case all floating point conditions + are non-trapping, compiler may freely convert unordered compares + to ordered one. Then definition may look like: + + #define REVERSE_CONDITION(CODE, MODE) \ + ((MODE) != CCFPmode ? reverse_condition (CODE) \ + : reverse_condition_maybe_unordered (CODE)) + + `REVERSE_CONDEXEC_PREDICATES_P (CODE1, CODE2)' + A C expression that returns true if the conditional execution + predicate CODE1 is the inverse of CODE2 and vice versa. Define + this to return 0 if the target has conditional execution + predicates that cannot be reversed safely. If no expansion is + specified, this macro is defined as follows: + + #define REVERSE_CONDEXEC_PREDICATES_P (x, y) \ + ((x) == reverse_condition (y)) + + +  + File: gccint.info, Node: Costs, Next: Scheduling, Prev: Condition Code, Up: Target Macros + + Describing Relative Costs of Operations + ======================================= + + These macros let you describe the relative speed of various + operations on the target machine. + + `CONST_COSTS (X, CODE, OUTER_CODE)' + A part of a C `switch' statement that describes the relative costs + of constant RTL expressions. It must contain `case' labels for + expression codes `const_int', `const', `symbol_ref', `label_ref' + and `const_double'. Each case must ultimately reach a `return' + statement to return the relative cost of the use of that kind of + constant value in an expression. The cost may depend on the + precise value of the constant, which is available for examination + in X, and the rtx code of the expression in which it is contained, + found in OUTER_CODE. + + CODE is the expression code--redundant, since it can be obtained + with `GET_CODE (X)'. + + `RTX_COSTS (X, CODE, OUTER_CODE)' + Like `CONST_COSTS' but applies to nonconstant RTL expressions. + This can be used, for example, to indicate how costly a multiply + instruction is. In writing this macro, you can use the construct + `COSTS_N_INSNS (N)' to specify a cost equal to N fast + instructions. OUTER_CODE is the code of the expression in which X + is contained. + + This macro is optional; do not define it if the default cost + assumptions are adequate for the target machine. + + `DEFAULT_RTX_COSTS (X, CODE, OUTER_CODE)' + This macro, if defined, is called for any case not handled by the + `RTX_COSTS' or `CONST_COSTS' macros. This eliminates the need to + put case labels into the macro, but the code, or any functions it + calls, must assume that the RTL in X could be of any type that has + not already been handled. The arguments are the same as for + `RTX_COSTS', and the macro should execute a return statement giving + the cost of any RTL expressions that it can handle. The default + cost calculation is used for any RTL for which this macro does not + return a value. + + This macro is optional; do not define it if the default cost + assumptions are adequate for the target machine. + + `ADDRESS_COST (ADDRESS)' + An expression giving the cost of an addressing mode that contains + ADDRESS. If not defined, the cost is computed from the ADDRESS + expression and the `CONST_COSTS' values. + + For most CISC machines, the default cost is a good approximation + of the true cost of the addressing mode. However, on RISC + machines, all instructions normally have the same length and + execution time. Hence all addresses will have equal costs. + + In cases where more than one form of an address is known, the form + with the lowest cost will be used. If multiple forms have the + same, lowest, cost, the one that is the most complex will be used. + + For example, suppose an address that is equal to the sum of a + register and a constant is used twice in the same basic block. + When this macro is not defined, the address will be computed in a + register and memory references will be indirect through that + register. On machines where the cost of the addressing mode + containing the sum is no higher than that of a simple indirect + reference, this will produce an additional instruction and + possibly require an additional register. Proper specification of + this macro eliminates this overhead for such machines. + + Similar use of this macro is made in strength reduction of loops. + + ADDRESS need not be valid as an address. In such a case, the cost + is not relevant and can be any value; invalid addresses need not be + assigned a different cost. + + On machines where an address involving more than one register is as + cheap as an address computation involving only one register, + defining `ADDRESS_COST' to reflect this can cause two registers to + be live over a region of code where only one would have been if + `ADDRESS_COST' were not defined in that manner. This effect should + be considered in the definition of this macro. Equivalent costs + should probably only be given to addresses with different numbers + of registers on machines with lots of registers. + + This macro will normally either not be defined or be defined as a + constant. + + `REGISTER_MOVE_COST (MODE, FROM, TO)' + A C expression for the cost of moving data of mode MODE from a + register in class FROM to one in class TO. The classes are + expressed using the enumeration values such as `GENERAL_REGS'. A + value of 2 is the default; other values are interpreted relative to + that. + + It is not required that the cost always equal 2 when FROM is the + same as TO; on some machines it is expensive to move between + registers if they are not general registers. + + If reload sees an insn consisting of a single `set' between two + hard registers, and if `REGISTER_MOVE_COST' applied to their + classes returns a value of 2, reload does not check to ensure that + the constraints of the insn are met. Setting a cost of other than + 2 will allow reload to verify that the constraints are met. You + should do this if the `movM' pattern's constraints do not allow + such copying. + + `MEMORY_MOVE_COST (MODE, CLASS, IN)' + A C expression for the cost of moving data of mode MODE between a + register of class CLASS and memory; IN is zero if the value is to + be written to memory, nonzero if it is to be read in. This cost + is relative to those in `REGISTER_MOVE_COST'. If moving between + registers and memory is more expensive than between two registers, + you should define this macro to express the relative cost. + + If you do not define this macro, GCC uses a default cost of 4 plus + the cost of copying via a secondary reload register, if one is + needed. If your machine requires a secondary reload register to + copy between memory and a register of CLASS but the reload + mechanism is more complex than copying via an intermediate, define + this macro to reflect the actual cost of the move. + + GCC defines the function `memory_move_secondary_cost' if secondary + reloads are needed. It computes the costs due to copying via a + secondary register. If your machine copies from memory using a + secondary register in the conventional way but the default base + value of 4 is not correct for your machine, define this macro to + add some other value to the result of that function. The + arguments to that function are the same as to this macro. + + `BRANCH_COST' + A C expression for the cost of a branch instruction. A value of 1 + is the default; other values are interpreted relative to that. + + Here are additional macros which do not specify precise relative + costs, but only that certain actions are more expensive than GCC would + ordinarily expect. + + `SLOW_BYTE_ACCESS' + Define this macro as a C expression which is nonzero if accessing + less than a word of memory (i.e. a `char' or a `short') is no + faster than accessing a word of memory, i.e., if such access + require more than one instruction or if there is no difference in + cost between byte and (aligned) word loads. + + When this macro is not defined, the compiler will access a field by + finding the smallest containing object; when it is defined, a + fullword load will be used if alignment permits. Unless bytes + accesses are faster than word accesses, using word accesses is + preferable since it may eliminate subsequent memory access if + subsequent accesses occur to other fields in the same word of the + structure, but to different bytes. + + `SLOW_UNALIGNED_ACCESS (MODE, ALIGNMENT)' + Define this macro to be the value 1 if memory accesses described + by the MODE and ALIGNMENT parameters have a cost many times greater + than aligned accesses, for example if they are emulated in a trap + handler. + + When this macro is nonzero, the compiler will act as if + `STRICT_ALIGNMENT' were nonzero when generating code for block + moves. This can cause significantly more instructions to be + produced. Therefore, do not set this macro nonzero if unaligned + accesses only add a cycle or two to the time for a memory access. + + If the value of this macro is always zero, it need not be defined. + If this macro is defined, it should produce a nonzero value when + `STRICT_ALIGNMENT' is nonzero. + + `DONT_REDUCE_ADDR' + Define this macro to inhibit strength reduction of memory + addresses. (On some machines, such strength reduction seems to do + harm rather than good.) + + `MOVE_RATIO' + The threshold of number of scalar memory-to-memory move insns, + _below_ which a sequence of insns should be generated instead of a + string move insn or a library call. Increasing the value will + always make code faster, but eventually incurs high cost in + increased code size. + + Note that on machines where the corresponding move insn is a + `define_expand' that emits a sequence of insns, this macro counts + the number of such sequences. + + If you don't define this, a reasonable default is used. + + `MOVE_BY_PIECES_P (SIZE, ALIGNMENT)' + A C expression used to determine whether `move_by_pieces' will be + used to copy a chunk of memory, or whether some other block move + mechanism will be used. Defaults to 1 if `move_by_pieces_ninsns' + returns less than `MOVE_RATIO'. + + `MOVE_MAX_PIECES' + A C expression used by `move_by_pieces' to determine the largest + unit a load or store used to copy memory is. Defaults to + `MOVE_MAX'. + + `USE_LOAD_POST_INCREMENT (MODE)' + A C expression used to determine whether a load postincrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_POST_INCREMENT'. + + `USE_LOAD_POST_DECREMENT (MODE)' + A C expression used to determine whether a load postdecrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_POST_DECREMENT'. + + `USE_LOAD_PRE_INCREMENT (MODE)' + A C expression used to determine whether a load preincrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_PRE_INCREMENT'. + + `USE_LOAD_PRE_DECREMENT (MODE)' + A C expression used to determine whether a load predecrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_PRE_DECREMENT'. + + `USE_STORE_POST_INCREMENT (MODE)' + A C expression used to determine whether a store postincrement is + a good thing to use for a given mode. Defaults to the value of + `HAVE_POST_INCREMENT'. + + `USE_STORE_POST_DECREMENT (MODE)' + A C expression used to determine whether a store postdecrement is + a good thing to use for a given mode. Defaults to the value of + `HAVE_POST_DECREMENT'. + + `USE_STORE_PRE_INCREMENT (MODE)' + This macro is used to determine whether a store preincrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_PRE_INCREMENT'. + + `USE_STORE_PRE_DECREMENT (MODE)' + This macro is used to determine whether a store predecrement is a + good thing to use for a given mode. Defaults to the value of + `HAVE_PRE_DECREMENT'. + + `NO_FUNCTION_CSE' + Define this macro if it is as good or better to call a constant + function address than to call an address kept in a register. + + `NO_RECURSIVE_FUNCTION_CSE' + Define this macro if it is as good or better for a function to call + itself with an explicit address than to call an address kept in a + register. + +  + File: gccint.info, Node: Scheduling, Next: Sections, Prev: Costs, Up: Target Macros + + Adjusting the Instruction Scheduler + =================================== + + The instruction scheduler may need a fair amount of machine-specific + adjustment in order to produce good code. GCC provides several target + hooks for this purpose. It is usually enough to define just a few of + them: try the first ones in this list first. + + - Target Hook: int TARGET_SCHED_ISSUE_RATE (void) + This hook returns the maximum number of instructions that can ever + issue at the same time on the target machine. The default is one. + This value must be constant over the entire compilation. If you + need it to vary depending on what the instructions are, you must + use `TARGET_SCHED_VARIABLE_ISSUE'. + + - Target Hook: int TARGET_SCHED_VARIABLE_ISSUE (FILE *FILE, int + VERBOSE, rtx INSN, int MORE) + This hook is executed by the scheduler after it has scheduled an + insn from the ready list. It should return the number of insns + which can still be issued in the current cycle. Normally this is + `MORE - 1'. You should define this hook if some insns take more + machine resources than others, so that fewer insns can follow them + in the same cycle. FILE is either a null pointer, or a stdio + stream to write any debug output to. VERBOSE is the verbose level + provided by `-fsched-verbose-N'. INSN is the instruction that was + scheduled. + + - Target Hook: int TARGET_SCHED_ADJUST_COST (rtx INSN, rtx LINK, rtx + DEP_INSN, int COST) + This function corrects the value of COST based on the relationship + between INSN and DEP_INSN through the dependence LINK. It should + return the new value. The default is to make no adjustment to + COST. This can be used for example to specify to the scheduler + that an output- or anti-dependence does not incur the same cost as + a data-dependence. + + - Target Hook: int TARGET_SCHED_ADJUST_PRIORITY (rtx INSN, int + PRIORITY) + This hook adjusts the integer scheduling priority PRIORITY of + INSN. It should return the new priority. Reduce the priority to + execute INSN earlier, increase the priority to execute INSN later. + Do not define this hook if you do not need to adjust the + scheduling priorities of insns. + + - Target Hook: int TARGET_SCHED_REORDER (FILE *FILE, int VERBOSE, rtx + *READY, int *N_READYP, int CLOCK) + This hook is executed by the scheduler after it has scheduled the + ready list, to allow the machine description to reorder it (for + example to combine two small instructions together on `VLIW' + machines). FILE is either a null pointer, or a stdio stream to + write any debug output to. VERBOSE is the verbose level provided + by `-fsched-verbose-N'. READY is a pointer to the ready list of + instructions that are ready to be scheduled. N_READYP is a + pointer to the number of elements in the ready list. The scheduler + reads the ready list in reverse order, starting with + READY[*N_READYP-1] and going to READY[0]. CLOCK is the timer tick + of the scheduler. You may modify the ready list and the number of + ready insns. The return value is the number of insns that can + issue this cycle; normally this is just `issue_rate'. See also + `TARGET_SCHED_REORDER2'. + + - Target Hook: int TARGET_SCHED_REORDER2 (FILE *FILE, int VERBOSE, rtx + *READY, int *N_READY, CLOCK) + Like `TARGET_SCHED_REORDER', but called at a different time. That + function is called whenever the scheduler starts a new cycle. + This one is called once per iteration over a cycle, immediately + after `TARGET_SCHED_VARIABLE_ISSUE'; it can reorder the ready list + and return the number of insns to be scheduled in the same cycle. + Defining this hook can be useful if there are frequent situations + where scheduling one insn causes other insns to become ready in + the same cycle. These other insns can then be taken into account + properly. + + - Target Hook: void TARGET_SCHED_INIT (FILE *FILE, int VERBOSE, int + MAX_READY) + This hook is executed by the scheduler at the beginning of each + block of instructions that are to be scheduled. FILE is either a + null pointer, or a stdio stream to write any debug output to. + VERBOSE is the verbose level provided by `-fsched-verbose-N'. + MAX_READY is the maximum number of insns in the current scheduling + region that can be live at the same time. This can be used to + allocate scratch space if it is needed, e.g. by + `TARGET_SCHED_REORDER'. + + - Target Hook: void TARGET_SCHED_FINISH (FILE *FILE, int VERBOSE) + This hook is executed by the scheduler at the end of each block of + instructions that are to be scheduled. It can be used to perform + cleanup of any actions done by the other scheduling hooks. FILE + is either a null pointer, or a stdio stream to write any debug + output to. VERBOSE is the verbose level provided by + `-fsched-verbose-N'. + + - Target Hook: rtx TARGET_SCHED_CYCLE_DISPLAY (int CLOCK, rtx LAST) + This hook is called in verbose mode only, at the beginning of each + pass over a basic block. It should insert an insn into the chain + after LAST, which has no effect, but records the value CLOCK in + RTL dumps and assembly output. Define this hook only if you need + this level of detail about what the scheduler is doing. + +  + File: gccint.info, Node: Sections, Next: PIC, Prev: Scheduling, Up: Target Macros + + Dividing the Output into Sections (Texts, Data, ...) + ==================================================== + + An object file is divided into sections containing different types of + data. In the most common case, there are three sections: the "text + section", which holds instructions and read-only data; the "data + section", which holds initialized writable data; and the "bss section", + which holds uninitialized data. Some systems have other kinds of + sections. + + The compiler must tell the assembler when to switch sections. These + macros control what commands to output to tell the assembler this. You + can also define additional sections. + + `TEXT_SECTION_ASM_OP' + A C expression whose value is a string, including spacing, + containing the assembler operation that should precede + instructions and read-only data. Normally `"\t.text"' is right. + + `TEXT_SECTION' + A C statement that switches to the default section containing + instructions. Normally this is not needed, as simply defining + `TEXT_SECTION_ASM_OP' is enough. The MIPS port uses this to sort + all functions after all data declarations. + + `DATA_SECTION_ASM_OP' + A C expression whose value is a string, including spacing, + containing the assembler operation to identify the following data + as writable initialized data. Normally `"\t.data"' is right. + + `SHARED_SECTION_ASM_OP' + If defined, a C expression whose value is a string, including + spacing, containing the assembler operation to identify the + following data as shared data. If not defined, + `DATA_SECTION_ASM_OP' will be used. + + `BSS_SECTION_ASM_OP' + If defined, a C expression whose value is a string, including + spacing, containing the assembler operation to identify the + following data as uninitialized global data. If not defined, and + neither `ASM_OUTPUT_BSS' nor `ASM_OUTPUT_ALIGNED_BSS' are defined, + uninitialized global data will be output in the data section if + `-fno-common' is passed, otherwise `ASM_OUTPUT_COMMON' will be + used. + + `SHARED_BSS_SECTION_ASM_OP' + If defined, a C expression whose value is a string, including + spacing, containing the assembler operation to identify the + following data as uninitialized global shared data. If not + defined, and `BSS_SECTION_ASM_OP' is, the latter will be used. + + `INIT_SECTION_ASM_OP' + If defined, a C expression whose value is a string, including + spacing, containing the assembler operation to identify the + following data as initialization code. If not defined, GCC will + assume such a section does not exist. + + `FINI_SECTION_ASM_OP' + If defined, a C expression whose value is a string, including + spacing, containing the assembler operation to identify the + following data as finalization code. If not defined, GCC will + assume such a section does not exist. + + `CRT_CALL_STATIC_FUNCTION (SECTION_OP, FUNCTION)' + If defined, an ASM statement that switches to a different section + via SECTION_OP, calls FUNCTION, and switches back to the text + section. This is used in `crtstuff.c' if `INIT_SECTION_ASM_OP' or + `FINI_SECTION_ASM_OP' to calls to initialization and finalization + functions from the init and fini sections. By default, this macro + uses a simple function call. Some ports need hand-crafted + assembly code to avoid dependencies on registers initialized in + the function prologue or to ensure that constant pools don't end + up too far way in the text section. + + `FORCE_CODE_SECTION_ALIGN' + If defined, an ASM statement that aligns a code section to some + arbitrary boundary. This is used to force all fragments of the + `.init' and `.fini' sections to have to same alignment and thus + prevent the linker from having to add any padding. + + `EXTRA_SECTIONS' + A list of names for sections other than the standard two, which are + `in_text' and `in_data'. You need not define this macro on a + system with no other sections (that GCC needs to use). + + `EXTRA_SECTION_FUNCTIONS' + One or more functions to be defined in `varasm.c'. These + functions should do jobs analogous to those of `text_section' and + `data_section', for your additional sections. Do not define this + macro if you do not define `EXTRA_SECTIONS'. + + `READONLY_DATA_SECTION' + On most machines, read-only variables, constants, and jump tables + are placed in the text section. If this is not the case on your + machine, this macro should be defined to be the name of a function + (either `data_section' or a function defined in `EXTRA_SECTIONS') + that switches to the section to be used for read-only items. + + If these items should be placed in the text section, this macro + should not be defined. + + `SELECT_SECTION (EXP, RELOC, ALIGN)' + A C statement or statements to switch to the appropriate section + for output of EXP. You can assume that EXP is either a `VAR_DECL' + node or a constant of some sort. RELOC indicates whether the + initial value of EXP requires link-time relocations. Bit 1 is set + when variable contains local relocations only, while bit 2 is set + for global relocations. Select the section by calling + `text_section' or one of the alternatives for other sections. + ALIGN is the constant alignment in bits. + + Do not define this macro if you put all read-only variables and + constants in the read-only data section (usually the text section). + + `SELECT_RTX_SECTION (MODE, RTX, ALIGN)' + A C statement or statements to switch to the appropriate section + for output of RTX in mode MODE. You can assume that RTX is some + kind of constant in RTL. The argument MODE is redundant except in + the case of a `const_int' rtx. Select the section by calling + `text_section' or one of the alternatives for other sections. + ALIGN is the constant alignment in bits. + + Do not define this macro if you put all constants in the read-only + data section. + + `JUMP_TABLES_IN_TEXT_SECTION' + Define this macro to be an expression with a nonzero value if jump + tables (for `tablejump' insns) should be output in the text + section, along with the assembler instructions. Otherwise, the + readonly data section is used. + + This macro is irrelevant if there is no separate readonly data + section. + + `ENCODE_SECTION_INFO (DECL)' + Define this macro if references to a symbol or a constant must be + treated differently depending on something about the variable or + function named by the symbol (such as what section it is in). + + The macro definition, if any, is executed under two circumstances. + One is immediately after the rtl for DECL that represents a + variable or a function has been created and stored in `DECL_RTL + (DECL)'. The value of the rtl will be a `mem' whose address is a + `symbol_ref'. The other is immediately after the rtl for DECL + that represents a constant has been created and stored in + `TREE_CST_RTL (DECL)'. The macro is called once for each distinct + constant in a source file. + + The usual thing for this macro to do is to record a flag in the + `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified + name string in the `symbol_ref' (if one bit is not enough + information). + + `STRIP_NAME_ENCODING (VAR, SYM_NAME)' + Decode SYM_NAME and store the real name part in VAR, sans the + characters that encode section info. Define this macro if + `ENCODE_SECTION_INFO' alters the symbol's name string. + + `UNIQUE_SECTION (DECL, RELOC)' + A C statement to build up a unique section name, expressed as a + `STRING_CST' node, and assign it to `DECL_SECTION_NAME (DECL)'. + RELOC indicates whether the initial value of EXP requires + link-time relocations. If you do not define this macro, GCC will + use the symbol name prefixed by `.' as the section name. Note - + this macro can now be called for uninitialized data items as well + as initialized data and functions. + +  + File: gccint.info, Node: PIC, Next: Assembler Format, Prev: Sections, Up: Target Macros + + Position Independent Code + ========================= + + This section describes macros that help implement generation of + position independent code. Simply defining these macros is not enough + to generate valid PIC; you must also add support to the macros + `GO_IF_LEGITIMATE_ADDRESS' and `PRINT_OPERAND_ADDRESS', as well as + `LEGITIMIZE_ADDRESS'. You must modify the definition of `movsi' to do + something appropriate when the source operand contains a symbolic + address. You may also need to alter the handling of switch statements + so that they use relative addresses. + + `PIC_OFFSET_TABLE_REGNUM' + The register number of the register used to address a table of + static data addresses in memory. In some cases this register is + defined by a processor's "application binary interface" (ABI). + When this macro is defined, RTL is generated for this register + once, as with the stack pointer and frame pointer registers. If + this macro is not defined, it is up to the machine-dependent files + to allocate such a register (if necessary). Note that this + register must be fixed when in use (e.g. when `flag_pic' is true). + + `PIC_OFFSET_TABLE_REG_CALL_CLOBBERED' + Define this macro if the register defined by + `PIC_OFFSET_TABLE_REGNUM' is clobbered by calls. Do not define + this macro if `PIC_OFFSET_TABLE_REGNUM' is not defined. + + `FINALIZE_PIC' + By generating position-independent code, when two different + programs (A and B) share a common library (libC.a), the text of + the library can be shared whether or not the library is linked at + the same address for both programs. In some of these + environments, position-independent code requires not only the use + of different addressing modes, but also special code to enable the + use of these addressing modes. + + The `FINALIZE_PIC' macro serves as a hook to emit these special + codes once the function is being compiled into assembly code, but + not before. (It is not done before, because in the case of + compiling an inline function, it would lead to multiple PIC + prologues being included in functions which used inline functions + and were compiled to assembly language.) + + `LEGITIMATE_PIC_OPERAND_P (X)' + A C expression that is nonzero if X is a legitimate immediate + operand on the target machine when generating position independent + code. You can assume that X satisfies `CONSTANT_P', so you need + not check this. You can also assume FLAG_PIC is true, so you need + not check it either. You need not define this macro if all + constants (including `SYMBOL_REF') can be immediate operands when + generating position independent code. + +  + File: gccint.info, Node: Assembler Format, Next: Debugging Info, Prev: PIC, Up: Target Macros + + Defining the Output Assembler Language + ====================================== + + This section describes macros whose principal purpose is to describe + how to write instructions in assembler language--rather than what the + instructions do. + + * Menu: + + * File Framework:: Structural information for the assembler file. + * Data Output:: Output of constants (numbers, strings, addresses). + * Uninitialized Data:: Output of uninitialized variables. + * Label Output:: Output and generation of labels. + * Initialization:: General principles of initialization + and termination routines. + * Macros for Initialization:: + Specific macros that control the handling of + initialization and termination routines. + * Instruction Output:: Output of actual instructions. + * Dispatch Tables:: Output of jump tables. + * Exception Region Output:: Output of exception region code. + * Alignment Output:: Pseudo ops for alignment and skipping data. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-18 gcc-3.2.3/gcc/doc/gccint.info-18 *** gcc-3.2.2/gcc/doc/gccint.info-18 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-18 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,979 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: File Framework, Next: Data Output, Up: Assembler Format + + The Overall Framework of an Assembler File + ------------------------------------------ + + This describes the overall framework of an assembler file. + + `ASM_FILE_START (STREAM)' + A C expression which outputs to the stdio stream STREAM some + appropriate text to go at the start of an assembler file. + + Normally this macro is defined to output a line containing + `#NO_APP', which is a comment that has no effect on most + assemblers but tells the GNU assembler that it can save time by not + checking for certain assembler constructs. + + On systems that use SDB, it is necessary to output certain + commands; see `attasm.h'. + + `ASM_FILE_END (STREAM)' + A C expression which outputs to the stdio stream STREAM some + appropriate text to go at the end of an assembler file. + + If this macro is not defined, the default is to output nothing + special at the end of the file. Most systems don't require any + definition. + + On systems that use SDB, it is necessary to output certain + commands; see `attasm.h'. + + `ASM_COMMENT_START' + A C string constant describing how to begin a comment in the target + assembler language. The compiler assumes that the comment will + end at the end of the line. + + `ASM_APP_ON' + A C string constant for text to be output before each `asm' + statement or group of consecutive ones. Normally this is + `"#APP"', which is a comment that has no effect on most assemblers + but tells the GNU assembler that it must check the lines that + follow for all valid assembler constructs. + + `ASM_APP_OFF' + A C string constant for text to be output after each `asm' + statement or group of consecutive ones. Normally this is + `"#NO_APP"', which tells the GNU assembler to resume making the + time-saving assumptions that are valid for ordinary compiler + output. + + `ASM_OUTPUT_SOURCE_FILENAME (STREAM, NAME)' + A C statement to output COFF information or DWARF debugging + information which indicates that filename NAME is the current + source file to the stdio stream STREAM. + + This macro need not be defined if the standard form of output for + the file format in use is appropriate. + + `OUTPUT_QUOTED_STRING (STREAM, STRING)' + A C statement to output the string STRING to the stdio stream + STREAM. If you do not call the function `output_quoted_string' in + your config files, GCC will only call it to output filenames to + the assembler source. So you can use it to canonicalize the format + of the filename using this macro. + + `ASM_OUTPUT_SOURCE_LINE (STREAM, LINE)' + A C statement to output DBX or SDB debugging information before + code for line number LINE of the current source file to the stdio + stream STREAM. + + This macro need not be defined if the standard form of debugging + information for the debugger in use is appropriate. + + `ASM_OUTPUT_IDENT (STREAM, STRING)' + A C statement to output something to the assembler file to handle a + `#ident' directive containing the text STRING. If this macro is + not defined, nothing is output for a `#ident' directive. + + `OBJC_PROLOGUE' + A C statement to output any assembler statements which are + required to precede any Objective-C object definitions or message + sending. The statement is executed only when compiling an + Objective-C program. + + - Target Hook: void TARGET_ASM_NAMED_SECTION (const char *NAME, + unsigned int FLAGS, unsigned int ALIGN) + Output assembly directives to switch to section NAME. The section + should have attributes as specified by FLAGS, which is a bit mask + of the `SECTION_*' flags defined in `output.h'. If ALIGN is + nonzero, it contains an alignment in bytes to be used for the + section, otherwise some target default should be used. Only + targets that must specify an alignment within the section + directive need pay attention to ALIGN - we will still use + `ASM_OUTPUT_ALIGN'. + + - Target Hook: bool TARGET_HAVE_NAMED_SECTIONS + This flag is true if the target supports + `TARGET_ASM_NAMED_SECTION'. + + - Target Hook: unsigned int TARGET_SECTION_TYPE_FLAGS (tree DECL, + const char *NAME, int RELOC) + Choose a set of section attributes for use by + `TARGET_ASM_NAMED_SECTION' based on a variable or function decl, a + section name, and whether or not the declaration's initializer may + contain runtime relocations. DECL may be null, in which case + read-write data should be assumed. + + The default version if this function handles choosing code vs data, + read-only vs read-write data, and `flag_pic'. You should only + need to override this if your target has special flags that might + be set via `__attribute__'. + +  + File: gccint.info, Node: Data Output, Next: Uninitialized Data, Prev: File Framework, Up: Assembler Format + + Output of Data + -------------- + + - Target Hook: const char * TARGET_ASM_BYTE_OP + - Target Hook: const char * TARGET_ASM_ALIGNED_HI_OP + - Target Hook: const char * TARGET_ASM_ALIGNED_SI_OP + - Target Hook: const char * TARGET_ASM_ALIGNED_DI_OP + - Target Hook: const char * TARGET_ASM_ALIGNED_TI_OP + - Target Hook: const char * TARGET_ASM_UNALIGNED_HI_OP + - Target Hook: const char * TARGET_ASM_UNALIGNED_SI_OP + - Target Hook: const char * TARGET_ASM_UNALIGNED_DI_OP + - Target Hook: const char * TARGET_ASM_UNALIGNED_TI_OP + These hooks specify assembly directives for creating certain kinds + of integer object. The `TARGET_ASM_BYTE_OP' directive creates a + byte-sized object, the `TARGET_ASM_ALIGNED_HI_OP' one creates an + aligned two-byte object, and so on. Any of the hooks may be + `NULL', indicating that no suitable directive is available. + + The compiler will print these strings at the start of a new line, + followed immediately by the object's initial value. In most cases, + the string should contain a tab, a pseudo-op, and then another tab. + + - Target Hook: bool TARGET_ASM_INTEGER (rtx X, unsigned int SIZE, int + ALIGNED_P) + The `assemble_integer' function uses this hook to output an + integer object. X is the object's value, SIZE is its size in + bytes and ALIGNED_P indicates whether it is aligned. The function + should return `true' if it was able to output the object. If it + returns false, `assemble_integer' will try to split the object + into smaller parts. + + The default implementation of this hook will use the + `TARGET_ASM_BYTE_OP' family of strings, returning `false' when the + relevant string is `NULL'. + + `OUTPUT_ADDR_CONST_EXTRA (STREAM, X, FAIL)' + A C statement to recognize RTX patterns that `output_addr_const' + can't deal with, and output assembly code to STREAM corresponding + to the pattern X. This may be used to allow machine-dependent + `UNSPEC's to appear within constants. + + If `OUTPUT_ADDR_CONST_EXTRA' fails to recognize a pattern, it must + `goto fail', so that a standard error message is printed. If it + prints an error message itself, by calling, for example, + `output_operand_lossage', it may just complete normally. + + `ASM_OUTPUT_ASCII (STREAM, PTR, LEN)' + A C statement to output to the stdio stream STREAM an assembler + instruction to assemble a string constant containing the LEN bytes + at PTR. PTR will be a C expression of type `char *' and LEN a C + expression of type `int'. + + If the assembler has a `.ascii' pseudo-op as found in the Berkeley + Unix assembler, do not define the macro `ASM_OUTPUT_ASCII'. + + `ASM_OUTPUT_FDESC (STREAM, DECL, N)' + A C statement to output word N of a function descriptor for DECL. + This must be defined if `TARGET_VTABLE_USES_DESCRIPTORS' is + defined, and is otherwise unused. + + `CONSTANT_POOL_BEFORE_FUNCTION' + You may define this macro as a C expression. You should define the + expression to have a nonzero value if GCC should output the + constant pool for a function before the code for the function, or + a zero value if GCC should output the constant pool after the + function. If you do not define this macro, the usual case, GCC + will output the constant pool before the function. + + `ASM_OUTPUT_POOL_PROLOGUE (FILE, FUNNAME, FUNDECL, SIZE)' + A C statement to output assembler commands to define the start of + the constant pool for a function. FUNNAME is a string giving the + name of the function. Should the return type of the function be + required, it can be obtained via FUNDECL. SIZE is the size, in + bytes, of the constant pool that will be written immediately after + this call. + + If no constant-pool prefix is required, the usual case, this macro + need not be defined. + + `ASM_OUTPUT_SPECIAL_POOL_ENTRY (FILE, X, MODE, ALIGN, LABELNO, JUMPTO)' + A C statement (with or without semicolon) to output a constant in + the constant pool, if it needs special treatment. (This macro + need not do anything for RTL expressions that can be output + normally.) + + The argument FILE is the standard I/O stream to output the + assembler code on. X is the RTL expression for the constant to + output, and MODE is the machine mode (in case X is a `const_int'). + ALIGN is the required alignment for the value X; you should + output an assembler directive to force this much alignment. + + The argument LABELNO is a number to use in an internal label for + the address of this pool entry. The definition of this macro is + responsible for outputting the label definition at the proper + place. Here is how to do this: + + ASM_OUTPUT_INTERNAL_LABEL (FILE, "LC", LABELNO); + + When you output a pool entry specially, you should end with a + `goto' to the label JUMPTO. This will prevent the same pool entry + from being output a second time in the usual manner. + + You need not define this macro if it would do nothing. + + `CONSTANT_AFTER_FUNCTION_P (EXP)' + Define this macro as a C expression which is nonzero if the + constant EXP, of type `tree', should be output after the code for a + function. The compiler will normally output all constants before + the function; you need not define this macro if this is OK. + + `ASM_OUTPUT_POOL_EPILOGUE (FILE FUNNAME FUNDECL SIZE)' + A C statement to output assembler commands to at the end of the + constant pool for a function. FUNNAME is a string giving the name + of the function. Should the return type of the function be + required, you can obtain it via FUNDECL. SIZE is the size, in + bytes, of the constant pool that GCC wrote immediately before this + call. + + If no constant-pool epilogue is required, the usual case, you need + not define this macro. + + `IS_ASM_LOGICAL_LINE_SEPARATOR (C)' + Define this macro as a C expression which is nonzero if C is used + as a logical line separator by the assembler. + + If you do not define this macro, the default is that only the + character `;' is treated as a logical line separator. + + - Target Hook: const char * TARGET_ASM_OPEN_PAREN + - Target Hook: const char * TARGET_ASM_CLOSE_PAREN + These target hooks are C string constants, describing the syntax + in the assembler for grouping arithmetic expressions. If not + overridden, they default to normal parentheses, which is correct + for most assemblers. + + These macros are provided by `real.h' for writing the definitions of + `ASM_OUTPUT_DOUBLE' and the like: + + `REAL_VALUE_TO_TARGET_SINGLE (X, L)' + `REAL_VALUE_TO_TARGET_DOUBLE (X, L)' + `REAL_VALUE_TO_TARGET_LONG_DOUBLE (X, L)' + These translate X, of type `REAL_VALUE_TYPE', to the target's + floating point representation, and store its bit pattern in the + array of `long int' whose address is L. The number of elements in + the output array is determined by the size of the desired target + floating point data type: 32 bits of it go in each `long int' array + element. Each array element holds 32 bits of the result, even if + `long int' is wider than 32 bits on the host machine. + + The array element values are designed so that you can print them + out using `fprintf' in the order they should appear in the target + machine's memory. + + `REAL_VALUE_TO_DECIMAL (X, FORMAT, STRING)' + This macro converts X, of type `REAL_VALUE_TYPE', to a decimal + number and stores it as a string into STRING. You must pass, as + STRING, the address of a long enough block of space to hold the + result. + + The argument FORMAT is a `printf'-specification that serves as a + suggestion for how to format the output string. + +  + File: gccint.info, Node: Uninitialized Data, Next: Label Output, Prev: Data Output, Up: Assembler Format + + Output of Uninitialized Variables + --------------------------------- + + Each of the macros in this section is used to do the whole job of + outputting a single uninitialized variable. + + `ASM_OUTPUT_COMMON (STREAM, NAME, SIZE, ROUNDED)' + A C statement (sans semicolon) to output to the stdio stream + STREAM the assembler definition of a common-label named NAME whose + size is SIZE bytes. The variable ROUNDED is the size rounded up + to whatever alignment the caller wants. + + Use the expression `assemble_name (STREAM, NAME)' to output the + name itself; before and after that, output the additional + assembler syntax for defining the name, and a newline. + + This macro controls how the assembler definitions of uninitialized + common global variables are output. + + `ASM_OUTPUT_ALIGNED_COMMON (STREAM, NAME, SIZE, ALIGNMENT)' + Like `ASM_OUTPUT_COMMON' except takes the required alignment as a + separate, explicit argument. If you define this macro, it is used + in place of `ASM_OUTPUT_COMMON', and gives you more flexibility in + handling the required alignment of the variable. The alignment is + specified as the number of bits. + + `ASM_OUTPUT_ALIGNED_DECL_COMMON (STREAM, DECL, NAME, SIZE, ALIGNMENT)' + Like `ASM_OUTPUT_ALIGNED_COMMON' except that DECL of the variable + to be output, if there is one, or `NULL_TREE' if there is no + corresponding variable. If you define this macro, GCC will use it + in place of both `ASM_OUTPUT_COMMON' and + `ASM_OUTPUT_ALIGNED_COMMON'. Define this macro when you need to + see the variable's decl in order to chose what to output. + + `ASM_OUTPUT_SHARED_COMMON (STREAM, NAME, SIZE, ROUNDED)' + If defined, it is similar to `ASM_OUTPUT_COMMON', except that it + is used when NAME is shared. If not defined, `ASM_OUTPUT_COMMON' + will be used. + + `ASM_OUTPUT_BSS (STREAM, DECL, NAME, SIZE, ROUNDED)' + A C statement (sans semicolon) to output to the stdio stream + STREAM the assembler definition of uninitialized global DECL named + NAME whose size is SIZE bytes. The variable ROUNDED is the size + rounded up to whatever alignment the caller wants. + + Try to use function `asm_output_bss' defined in `varasm.c' when + defining this macro. If unable, use the expression `assemble_name + (STREAM, NAME)' to output the name itself; before and after that, + output the additional assembler syntax for defining the name, and + a newline. + + This macro controls how the assembler definitions of uninitialized + global variables are output. This macro exists to properly + support languages like C++ which do not have `common' data. + However, this macro currently is not defined for all targets. If + this macro and `ASM_OUTPUT_ALIGNED_BSS' are not defined then + `ASM_OUTPUT_COMMON' or `ASM_OUTPUT_ALIGNED_COMMON' or + `ASM_OUTPUT_ALIGNED_DECL_COMMON' is used. + + `ASM_OUTPUT_ALIGNED_BSS (STREAM, DECL, NAME, SIZE, ALIGNMENT)' + Like `ASM_OUTPUT_BSS' except takes the required alignment as a + separate, explicit argument. If you define this macro, it is used + in place of `ASM_OUTPUT_BSS', and gives you more flexibility in + handling the required alignment of the variable. The alignment is + specified as the number of bits. + + Try to use function `asm_output_aligned_bss' defined in file + `varasm.c' when defining this macro. + + `ASM_OUTPUT_SHARED_BSS (STREAM, DECL, NAME, SIZE, ROUNDED)' + If defined, it is similar to `ASM_OUTPUT_BSS', except that it is + used when NAME is shared. If not defined, `ASM_OUTPUT_BSS' will + be used. + + `ASM_OUTPUT_LOCAL (STREAM, NAME, SIZE, ROUNDED)' + A C statement (sans semicolon) to output to the stdio stream + STREAM the assembler definition of a local-common-label named NAME + whose size is SIZE bytes. The variable ROUNDED is the size + rounded up to whatever alignment the caller wants. + + Use the expression `assemble_name (STREAM, NAME)' to output the + name itself; before and after that, output the additional + assembler syntax for defining the name, and a newline. + + This macro controls how the assembler definitions of uninitialized + static variables are output. + + `ASM_OUTPUT_ALIGNED_LOCAL (STREAM, NAME, SIZE, ALIGNMENT)' + Like `ASM_OUTPUT_LOCAL' except takes the required alignment as a + separate, explicit argument. If you define this macro, it is used + in place of `ASM_OUTPUT_LOCAL', and gives you more flexibility in + handling the required alignment of the variable. The alignment is + specified as the number of bits. + + `ASM_OUTPUT_ALIGNED_DECL_LOCAL (STREAM, DECL, NAME, SIZE, ALIGNMENT)' + Like `ASM_OUTPUT_ALIGNED_DECL' except that DECL of the variable to + be output, if there is one, or `NULL_TREE' if there is no + corresponding variable. If you define this macro, GCC will use it + in place of both `ASM_OUTPUT_DECL' and `ASM_OUTPUT_ALIGNED_DECL'. + Define this macro when you need to see the variable's decl in + order to chose what to output. + + `ASM_OUTPUT_SHARED_LOCAL (STREAM, NAME, SIZE, ROUNDED)' + If defined, it is similar to `ASM_OUTPUT_LOCAL', except that it is + used when NAME is shared. If not defined, `ASM_OUTPUT_LOCAL' will + be used. + +  + File: gccint.info, Node: Label Output, Next: Initialization, Prev: Uninitialized Data, Up: Assembler Format + + Output and Generation of Labels + ------------------------------- + + This is about outputting labels. + + `ASM_OUTPUT_LABEL (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM the assembler definition of a label named NAME. Use the + expression `assemble_name (STREAM, NAME)' to output the name + itself; before and after that, output the additional assembler + syntax for defining the name, and a newline. + + `ASM_DECLARE_FUNCTION_NAME (STREAM, NAME, DECL)' + A C statement (sans semicolon) to output to the stdio stream + STREAM any text necessary for declaring the name NAME of a + function which is being defined. This macro is responsible for + outputting the label definition (perhaps using + `ASM_OUTPUT_LABEL'). The argument DECL is the `FUNCTION_DECL' + tree node representing the function. + + If this macro is not defined, then the function name is defined in + the usual manner as a label (by means of `ASM_OUTPUT_LABEL'). + + `ASM_DECLARE_FUNCTION_SIZE (STREAM, NAME, DECL)' + A C statement (sans semicolon) to output to the stdio stream + STREAM any text necessary for declaring the size of a function + which is being defined. The argument NAME is the name of the + function. The argument DECL is the `FUNCTION_DECL' tree node + representing the function. + + If this macro is not defined, then the function size is not + defined. + + `ASM_DECLARE_OBJECT_NAME (STREAM, NAME, DECL)' + A C statement (sans semicolon) to output to the stdio stream + STREAM any text necessary for declaring the name NAME of an + initialized variable which is being defined. This macro must + output the label definition (perhaps using `ASM_OUTPUT_LABEL'). + The argument DECL is the `VAR_DECL' tree node representing the + variable. + + If this macro is not defined, then the variable name is defined in + the usual manner as a label (by means of `ASM_OUTPUT_LABEL'). + + `ASM_DECLARE_REGISTER_GLOBAL (STREAM, DECL, REGNO, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM any text necessary for claiming a register REGNO for a + global variable DECL with name NAME. + + If you don't define this macro, that is equivalent to defining it + to do nothing. + + `ASM_FINISH_DECLARE_OBJECT (STREAM, DECL, TOPLEVEL, ATEND)' + A C statement (sans semicolon) to finish up declaring a variable + name once the compiler has processed its initializer fully and + thus has had a chance to determine the size of an array when + controlled by an initializer. This is used on systems where it's + necessary to declare something about the size of the object. + + If you don't define this macro, that is equivalent to defining it + to do nothing. + + `ASM_GLOBALIZE_LABEL (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM some commands that will make the label NAME global; that + is, available for reference from other files. Use the expression + `assemble_name (STREAM, NAME)' to output the name itself; before + and after that, output the additional assembler syntax for making + that name global, and a newline. + + `ASM_WEAKEN_LABEL (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM some commands that will make the label NAME weak; that is, + available for reference from other files but only used if no other + definition is available. Use the expression `assemble_name + (STREAM, NAME)' to output the name itself; before and after that, + output the additional assembler syntax for making that name weak, + and a newline. + + If you don't define this macro or `ASM_WEAKEN_DECL', GCC will not + support weak symbols and you should not define the `SUPPORTS_WEAK' + macro. + + `ASM_WEAKEN_DECL (STREAM, DECL, NAME, VALUE)' + Combines (and replaces) the function of `ASM_WEAKEN_LABEL' and + `ASM_OUTPUT_WEAK_ALIAS', allowing access to the associated function + or variable decl. If VALUE is not `NULL', this C statement should + output to the stdio stream STREAM assembler code which defines + (equates) the weak symbol NAME to have the value VALUE. If VALUE + is `NULL', it should output commands to make NAME weak. + + `SUPPORTS_WEAK' + A C expression which evaluates to true if the target supports weak + symbols. + + If you don't define this macro, `defaults.h' provides a default + definition. If either `ASM_WEAKEN_LABEL' or `ASM_WEAKEN_DECL' is + defined, the default definition is `1'; otherwise, it is `0'. + Define this macro if you want to control weak symbol support with + a compiler flag such as `-melf'. + + `MAKE_DECL_ONE_ONLY' + A C statement (sans semicolon) to mark DECL to be emitted as a + public symbol such that extra copies in multiple translation units + will be discarded by the linker. Define this macro if your object + file format provides support for this concept, such as the `COMDAT' + section flags in the Microsoft Windows PE/COFF format, and this + support requires changes to DECL, such as putting it in a separate + section. + + `SUPPORTS_ONE_ONLY' + A C expression which evaluates to true if the target supports + one-only semantics. + + If you don't define this macro, `varasm.c' provides a default + definition. If `MAKE_DECL_ONE_ONLY' is defined, the default + definition is `1'; otherwise, it is `0'. Define this macro if you + want to control one-only symbol support with a compiler flag, or if + setting the `DECL_ONE_ONLY' flag is enough to mark a declaration to + be emitted as one-only. + + `ASM_OUTPUT_EXTERNAL (STREAM, DECL, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM any text necessary for declaring the name of an external + symbol named NAME which is referenced in this compilation but not + defined. The value of DECL is the tree node for the declaration. + + This macro need not be defined if it does not need to output + anything. The GNU assembler and most Unix assemblers don't + require anything. + + `ASM_OUTPUT_EXTERNAL_LIBCALL (STREAM, SYMREF)' + A C statement (sans semicolon) to output on STREAM an assembler + pseudo-op to declare a library function name external. The name + of the library function is given by SYMREF, which has type `rtx' + and is a `symbol_ref'. + + This macro need not be defined if it does not need to output + anything. The GNU assembler and most Unix assemblers don't + require anything. + + `ASM_OUTPUT_LABELREF (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM a reference in assembler syntax to a label named NAME. + This should add `_' to the front of the name, if that is customary + on your operating system, as it is in most Berkeley Unix systems. + This macro is used in `assemble_name'. + + `ASM_OUTPUT_SYMBOL_REF (STREAM, SYM)' + A C statement (sans semicolon) to output a reference to + `SYMBOL_REF' SYM. If not defined, `assemble_name' will be used to + output the name of the symbol. This macro may be used to modify + the way a symbol is referenced depending on information encoded by + `ENCODE_SECTION_INFO'. + + `ASM_OUTPUT_LABEL_REF (STREAM, BUF)' + A C statement (sans semicolon) to output a reference to BUF, the + result of ASM_GENERATE_INTERNAL_LABEL. If not defined, + `assemble_name' will be used to output the name of the symbol. + This macro is not used by `output_asm_label', or the `%l' + specifier that calls it; the intention is that this macro should + be set when it is necessary to output a label differently when its + address is being taken. + + `ASM_OUTPUT_INTERNAL_LABEL (STREAM, PREFIX, NUM)' + A C statement to output to the stdio stream STREAM a label whose + name is made from the string PREFIX and the number NUM. + + It is absolutely essential that these labels be distinct from the + labels used for user-level functions and variables. Otherwise, + certain programs will have name conflicts with internal labels. + + It is desirable to exclude internal labels from the symbol table + of the object file. Most assemblers have a naming convention for + labels that should be excluded; on many systems, the letter `L' at + the beginning of a label has this effect. You should find out what + convention your system uses, and follow it. + + The usual definition of this macro is as follows: + + fprintf (STREAM, "L%s%d:\n", PREFIX, NUM) + + `ASM_OUTPUT_DEBUG_LABEL (STREAM, PREFIX, NUM)' + A C statement to output to the stdio stream STREAM a debug info + label whose name is made from the string PREFIX and the number + NUM. This is useful for VLIW targets, where debug info labels may + need to be treated differently than branch target labels. On some + systems, branch target labels must be at the beginning of + instruction bundles, but debug info labels can occur in the middle + of instruction bundles. + + If this macro is not defined, then `ASM_OUTPUT_INTERNAL_LABEL' + will be used. + + `ASM_OUTPUT_ALTERNATE_LABEL_NAME (STREAM, STRING)' + A C statement to output to the stdio stream STREAM the string + STRING. + + The default definition of this macro is as follows: + + fprintf (STREAM, "%s:\n", LABEL_ALTERNATE_NAME (INSN)) + + `ASM_GENERATE_INTERNAL_LABEL (STRING, PREFIX, NUM)' + A C statement to store into the string STRING a label whose name + is made from the string PREFIX and the number NUM. + + This string, when output subsequently by `assemble_name', should + produce the output that `ASM_OUTPUT_INTERNAL_LABEL' would produce + with the same PREFIX and NUM. + + If the string begins with `*', then `assemble_name' will output + the rest of the string unchanged. It is often convenient for + `ASM_GENERATE_INTERNAL_LABEL' to use `*' in this way. If the + string doesn't start with `*', then `ASM_OUTPUT_LABELREF' gets to + output the string, and may change it. (Of course, + `ASM_OUTPUT_LABELREF' is also part of your machine description, so + you should know what it does on your machine.) + + `ASM_FORMAT_PRIVATE_NAME (OUTVAR, NAME, NUMBER)' + A C expression to assign to OUTVAR (which is a variable of type + `char *') a newly allocated string made from the string NAME and + the number NUMBER, with some suitable punctuation added. Use + `alloca' to get space for the string. + + The string will be used as an argument to `ASM_OUTPUT_LABELREF' to + produce an assembler label for an internal static variable whose + name is NAME. Therefore, the string must be such as to result in + valid assembler code. The argument NUMBER is different each time + this macro is executed; it prevents conflicts between + similarly-named internal static variables in different scopes. + + Ideally this string should not be a valid C identifier, to prevent + any conflict with the user's own symbols. Most assemblers allow + periods or percent signs in assembler symbols; putting at least + one of these between the name and the number will suffice. + + `ASM_OUTPUT_DEF (STREAM, NAME, VALUE)' + A C statement to output to the stdio stream STREAM assembler code + which defines (equates) the symbol NAME to have the value VALUE. + + If `SET_ASM_OP' is defined, a default definition is provided which + is correct for most systems. + + `ASM_OUTPUT_DEF_FROM_DECLS (STREAM, DECL_OF_NAME, DECL_OF_VALUE)' + A C statement to output to the stdio stream STREAM assembler code + which defines (equates) the symbol whose tree node is DECL_OF_NAME + to have the value of the tree node DECL_OF_VALUE. This macro will + be used in preference to `ASM_OUTPUT_DEF' if it is defined and if + the tree nodes are available. + + `ASM_OUTPUT_DEFINE_LABEL_DIFFERENCE_SYMBOL (STREAM, SYMBOL, HIGH, LOW)' + A C statement to output to the stdio stream STREAM assembler code + which defines (equates) the symbol SYMBOL to have a value equal to + the difference of the two symbols HIGH and LOW, i.e. HIGH minus + LOW. GCC guarantees that the symbols HIGH and LOW are already + known by the assembler so that the difference resolves into a + constant. + + If `SET_ASM_OP' is defined, a default definition is provided which + is correct for most systems. + + `ASM_OUTPUT_WEAK_ALIAS (STREAM, NAME, VALUE)' + A C statement to output to the stdio stream STREAM assembler code + which defines (equates) the weak symbol NAME to have the value + VALUE. If VALUE is `NULL', it defines NAME as an undefined weak + symbol. + + Define this macro if the target only supports weak aliases; define + `ASM_OUTPUT_DEF' instead if possible. + + `OBJC_GEN_METHOD_LABEL (BUF, IS_INST, CLASS_NAME, CAT_NAME, SEL_NAME)' + Define this macro to override the default assembler names used for + Objective-C methods. + + The default name is a unique method number followed by the name of + the class (e.g. `_1_Foo'). For methods in categories, the name of + the category is also included in the assembler name (e.g. + `_1_Foo_Bar'). + + These names are safe on most systems, but make debugging difficult + since the method's selector is not present in the name. + Therefore, particular systems define other ways of computing names. + + BUF is an expression of type `char *' which gives you a buffer in + which to store the name; its length is as long as CLASS_NAME, + CAT_NAME and SEL_NAME put together, plus 50 characters extra. + + The argument IS_INST specifies whether the method is an instance + method or a class method; CLASS_NAME is the name of the class; + CAT_NAME is the name of the category (or `NULL' if the method is + not in a category); and SEL_NAME is the name of the selector. + + On systems where the assembler can handle quoted names, you can + use this macro to provide more human-readable names. + + `ASM_DECLARE_CLASS_REFERENCE (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM commands to declare that the label NAME is an Objective-C + class reference. This is only needed for targets whose linkers + have special support for NeXT-style runtimes. + + `ASM_DECLARE_UNRESOLVED_REFERENCE (STREAM, NAME)' + A C statement (sans semicolon) to output to the stdio stream + STREAM commands to declare that the label NAME is an unresolved + Objective-C class reference. This is only needed for targets + whose linkers have special support for NeXT-style runtimes. + +  + File: gccint.info, Node: Initialization, Next: Macros for Initialization, Prev: Label Output, Up: Assembler Format + + How Initialization Functions Are Handled + ---------------------------------------- + + The compiled code for certain languages includes "constructors" + (also called "initialization routines")--functions to initialize data + in the program when the program is started. These functions need to be + called before the program is "started"--that is to say, before `main' + is called. + + Compiling some languages generates "destructors" (also called + "termination routines") that should be called when the program + terminates. + + To make the initialization and termination functions work, the + compiler must output something in the assembler code to cause those + functions to be called at the appropriate time. When you port the + compiler to a new system, you need to specify how to do this. + + There are two major ways that GCC currently supports the execution of + initialization and termination functions. Each way has two variants. + Much of the structure is common to all four variations. + + The linker must build two lists of these functions--a list of + initialization functions, called `__CTOR_LIST__', and a list of + termination functions, called `__DTOR_LIST__'. + + Each list always begins with an ignored function pointer (which may + hold 0, -1, or a count of the function pointers after it, depending on + the environment). This is followed by a series of zero or more function + pointers to constructors (or destructors), followed by a function + pointer containing zero. + + Depending on the operating system and its executable file format, + either `crtstuff.c' or `libgcc2.c' traverses these lists at startup + time and exit time. Constructors are called in reverse order of the + list; destructors in forward order. + + The best way to handle static constructors works only for object file + formats which provide arbitrarily-named sections. A section is set + aside for a list of constructors, and another for a list of destructors. + Traditionally these are called `.ctors' and `.dtors'. Each object file + that defines an initialization function also puts a word in the + constructor section to point to that function. The linker accumulates + all these words into one contiguous `.ctors' section. Termination + functions are handled similarly. + + This method will be chosen as the default by `target-def.h' if + `TARGET_ASM_NAMED_SECTION' is defined. A target that does not support + arbitrary sections, but does support special designated constructor and + destructor sections may define `CTORS_SECTION_ASM_OP' and + `DTORS_SECTION_ASM_OP' to achieve the same effect. + + When arbitrary sections are available, there are two variants, + depending upon how the code in `crtstuff.c' is called. On systems that + support a ".init" section which is executed at program startup, parts + of `crtstuff.c' are compiled into that section. The program is linked + by the `gcc' driver like this: + + ld -o OUTPUT_FILE crti.o crtbegin.o ... -lgcc crtend.o crtn.o + + The prologue of a function (`__init') appears in the `.init' section + of `crti.o'; the epilogue appears in `crtn.o'. Likewise for the + function `__fini' in the ".fini" section. Normally these files are + provided by the operating system or by the GNU C library, but are + provided by GCC for a few targets. + + The objects `crtbegin.o' and `crtend.o' are (for most targets) + compiled from `crtstuff.c'. They contain, among other things, code + fragments within the `.init' and `.fini' sections that branch to + routines in the `.text' section. The linker will pull all parts of a + section together, which results in a complete `__init' function that + invokes the routines we need at startup. + + To use this variant, you must define the `INIT_SECTION_ASM_OP' macro + properly. + + If no init section is available, when GCC compiles any function + called `main' (or more accurately, any function designated as a program + entry point by the language front end calling `expand_main_function'), + it inserts a procedure call to `__main' as the first executable code + after the function prologue. The `__main' function is defined in + `libgcc2.c' and runs the global constructors. + + In file formats that don't support arbitrary sections, there are + again two variants. In the simplest variant, the GNU linker (GNU `ld') + and an `a.out' format must be used. In this case, + `TARGET_ASM_CONSTRUCTOR' is defined to produce a `.stabs' entry of type + `N_SETT', referencing the name `__CTOR_LIST__', and with the address of + the void function containing the initialization code as its value. The + GNU linker recognizes this as a request to add the value to a "set"; + the values are accumulated, and are eventually placed in the executable + as a vector in the format described above, with a leading (ignored) + count and a trailing zero element. `TARGET_ASM_DESTRUCTOR' is handled + similarly. Since no init section is available, the absence of + `INIT_SECTION_ASM_OP' causes the compilation of `main' to call `__main' + as above, starting the initialization process. + + The last variant uses neither arbitrary sections nor the GNU linker. + This is preferable when you want to do dynamic linking and when using + file formats which the GNU linker does not support, such as `ECOFF'. In + this case, `TARGET_HAVE_CTORS_DTORS' is false, initialization and + termination functions are recognized simply by their names. This + requires an extra program in the linkage step, called `collect2'. This + program pretends to be the linker, for use with GCC; it does its job by + running the ordinary linker, but also arranges to include the vectors of + initialization and termination functions. These functions are called + via `__main' as described above. In order to use this method, + `use_collect2' must be defined in the target in `config.gcc'. + + The following section describes the specific macros that control and + customize the handling of initialization and termination functions. + +  + File: gccint.info, Node: Macros for Initialization, Next: Instruction Output, Prev: Initialization, Up: Assembler Format + + Macros Controlling Initialization Routines + ------------------------------------------ + + Here are the macros that control how the compiler handles + initialization and termination functions: + + `INIT_SECTION_ASM_OP' + If defined, a C string constant, including spacing, for the + assembler operation to identify the following data as + initialization code. If not defined, GCC will assume such a + section does not exist. When you are using special sections for + initialization and termination functions, this macro also controls + how `crtstuff.c' and `libgcc2.c' arrange to run the initialization + functions. + + `HAS_INIT_SECTION' + If defined, `main' will not call `__main' as described above. + This macro should be defined for systems that control start-up code + on a symbol-by-symbol basis, such as OSF/1, and should not be + defined explicitly for systems that support `INIT_SECTION_ASM_OP'. + + `LD_INIT_SWITCH' + If defined, a C string constant for a switch that tells the linker + that the following symbol is an initialization routine. + + `LD_FINI_SWITCH' + If defined, a C string constant for a switch that tells the linker + that the following symbol is a finalization routine. + + `COLLECT_SHARED_INIT_FUNC (STREAM, FUNC)' + If defined, a C statement that will write a function that can be + automatically called when a shared library is loaded. The function + should call FUNC, which takes no arguments. If not defined, and + the object format requires an explicit initialization function, + then a function called `_GLOBAL__DI' will be generated. + + This function and the following one are used by collect2 when + linking a shared library that needs constructors or destructors, + or has DWARF2 exception tables embedded in the code. + + `COLLECT_SHARED_FINI_FUNC (STREAM, FUNC)' + If defined, a C statement that will write a function that can be + automatically called when a shared library is unloaded. The + function should call FUNC, which takes no arguments. If not + defined, and the object format requires an explicit finalization + function, then a function called `_GLOBAL__DD' will be generated. + + `INVOKE__main' + If defined, `main' will call `__main' despite the presence of + `INIT_SECTION_ASM_OP'. This macro should be defined for systems + where the init section is not actually run automatically, but is + still useful for collecting the lists of constructors and + destructors. + + `SUPPORTS_INIT_PRIORITY' + If nonzero, the C++ `init_priority' attribute is supported and the + compiler should emit instructions to control the order of + initialization of objects. If zero, the compiler will issue an + error message upon encountering an `init_priority' attribute. + + - Target Hook: bool TARGET_HAVE_CTORS_DTORS + This value is true if the target supports some "native" method of + collecting constructors and destructors to be run at startup and + exit. It is false if we must use `collect2'. + + - Target Hook: void TARGET_ASM_CONSTRUCTOR (rtx SYMBOL, int PRIORITY) + If defined, a function that outputs assembler code to arrange to + call the function referenced by SYMBOL at initialization time. + + Assume that SYMBOL is a `SYMBOL_REF' for a function taking no + arguments and with no return value. If the target supports + initialization priorities, PRIORITY is a value between 0 and + `MAX_INIT_PRIORITY'; otherwise it must be `DEFAULT_INIT_PRIORITY'. + + If this macro is not defined by the target, a suitable default will + be chosen if (1) the target supports arbitrary section names, (2) + the target defines `CTORS_SECTION_ASM_OP', or (3) `USE_COLLECT2' + is not defined. + + - Target Hook: void TARGET_ASM_DESTRUCTOR (rtx SYMBOL, int PRIORITY) + This is like `TARGET_ASM_CONSTRUCTOR' but used for termination + functions rather than initialization functions. + + If `TARGET_HAVE_CTORS_DTORS' is true, the initialization routine + generated for the generated object file will have static linkage. + + If your system uses `collect2' as the means of processing + constructors, then that program normally uses `nm' to scan an object + file for constructor functions to be called. + + On certain kinds of systems, you can define these macros to make + `collect2' work faster (and, in some cases, make it work at all): + + `OBJECT_FORMAT_COFF' + Define this macro if the system uses COFF (Common Object File + Format) object files, so that `collect2' can assume this format + and scan object files directly for dynamic constructor/destructor + functions. + + `OBJECT_FORMAT_ROSE' + Define this macro if the system uses ROSE format object files, so + that `collect2' can assume this format and scan object files + directly for dynamic constructor/destructor functions. + + These macros are effective only in a native compiler; `collect2' as + part of a cross compiler always uses `nm' for the target machine. + + `REAL_NM_FILE_NAME' + Define this macro as a C string constant containing the file name + to use to execute `nm'. The default is to search the path + normally for `nm'. + + If your system supports shared libraries and has a program to list + the dynamic dependencies of a given library or executable, you can + define these macros to enable support for running initialization + and termination functions in shared libraries: + + `LDD_SUFFIX' + Define this macro to a C string constant containing the name of + the program which lists dynamic dependencies, like `"ldd"' under + SunOS 4. + + `PARSE_LDD_OUTPUT (PTR)' + Define this macro to be C code that extracts filenames from the + output of the program denoted by `LDD_SUFFIX'. PTR is a variable + of type `char *' that points to the beginning of a line of output + from `LDD_SUFFIX'. If the line lists a dynamic dependency, the + code must advance PTR to the beginning of the filename on that + line. Otherwise, it must set PTR to `NULL'. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-19 gcc-3.2.3/gcc/doc/gccint.info-19 *** gcc-3.2.2/gcc/doc/gccint.info-19 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-19 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,1100 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Instruction Output, Next: Dispatch Tables, Prev: Macros for Initialization, Up: Assembler Format + + Output of Assembler Instructions + -------------------------------- + + This describes assembler instruction output. + + `REGISTER_NAMES' + A C initializer containing the assembler's names for the machine + registers, each one as a C string constant. This is what + translates register numbers in the compiler into assembler + language. + + `ADDITIONAL_REGISTER_NAMES' + If defined, a C initializer for an array of structures containing + a name and a register number. This macro defines additional names + for hard registers, thus allowing the `asm' option in declarations + to refer to registers using alternate names. + + `ASM_OUTPUT_OPCODE (STREAM, PTR)' + Define this macro if you are using an unusual assembler that + requires different names for the machine instructions. + + The definition is a C statement or statements which output an + assembler instruction opcode to the stdio stream STREAM. The + macro-operand PTR is a variable of type `char *' which points to + the opcode name in its "internal" form--the form that is written + in the machine description. The definition should output the + opcode name to STREAM, performing any translation you desire, and + increment the variable PTR to point at the end of the opcode so + that it will not be output twice. + + In fact, your macro definition may process less than the entire + opcode name, or more than the opcode name; but if you want to + process text that includes `%'-sequences to substitute operands, + you must take care of the substitution yourself. Just be sure to + increment PTR over whatever text should not be output normally. + + If you need to look at the operand values, they can be found as the + elements of `recog_data.operand'. + + If the macro definition does nothing, the instruction is output in + the usual way. + + `FINAL_PRESCAN_INSN (INSN, OPVEC, NOPERANDS)' + If defined, a C statement to be executed just prior to the output + of assembler code for INSN, to modify the extracted operands so + they will be output differently. + + Here the argument OPVEC is the vector containing the operands + extracted from INSN, and NOPERANDS is the number of elements of + the vector which contain meaningful data for this insn. The + contents of this vector are what will be used to convert the insn + template into assembler code, so you can change the assembler + output by changing the contents of the vector. + + This macro is useful when various assembler syntaxes share a single + file of instruction patterns; by defining this macro differently, + you can cause a large class of instructions to be output + differently (such as with rearranged operands). Naturally, + variations in assembler syntax affecting individual insn patterns + ought to be handled by writing conditional output routines in + those patterns. + + If this macro is not defined, it is equivalent to a null statement. + + `FINAL_PRESCAN_LABEL' + If defined, `FINAL_PRESCAN_INSN' will be called on each + `CODE_LABEL'. In that case, OPVEC will be a null pointer and + NOPERANDS will be zero. + + `PRINT_OPERAND (STREAM, X, CODE)' + A C compound statement to output to stdio stream STREAM the + assembler syntax for an instruction operand X. X is an RTL + expression. + + CODE is a value that can be used to specify one of several ways of + printing the operand. It is used when identical operands must be + printed differently depending on the context. CODE comes from the + `%' specification that was used to request printing of the + operand. If the specification was just `%DIGIT' then CODE is 0; + if the specification was `%LTR DIGIT' then CODE is the ASCII code + for LTR. + + If X is a register, this macro should print the register's name. + The names can be found in an array `reg_names' whose type is `char + *[]'. `reg_names' is initialized from `REGISTER_NAMES'. + + When the machine description has a specification `%PUNCT' (a `%' + followed by a punctuation character), this macro is called with a + null pointer for X and the punctuation character for CODE. + + `PRINT_OPERAND_PUNCT_VALID_P (CODE)' + A C expression which evaluates to true if CODE is a valid + punctuation character for use in the `PRINT_OPERAND' macro. If + `PRINT_OPERAND_PUNCT_VALID_P' is not defined, it means that no + punctuation characters (except for the standard one, `%') are used + in this way. + + `PRINT_OPERAND_ADDRESS (STREAM, X)' + A C compound statement to output to stdio stream STREAM the + assembler syntax for an instruction operand that is a memory + reference whose address is X. X is an RTL expression. + + On some machines, the syntax for a symbolic address depends on the + section that the address refers to. On these machines, define the + macro `ENCODE_SECTION_INFO' to store the information into the + `symbol_ref', and then check for it here. *Note Assembler + Format::. + + `DBR_OUTPUT_SEQEND(FILE)' + A C statement, to be executed after all slot-filler instructions + have been output. If necessary, call `dbr_sequence_length' to + determine the number of slots filled in a sequence (zero if not + currently outputting a sequence), to decide how many no-ops to + output, or whatever. + + Don't define this macro if it has nothing to do, but it is helpful + in reading assembly output if the extent of the delay sequence is + made explicit (e.g. with white space). + + Note that output routines for instructions with delay slots must be + prepared to deal with not being output as part of a sequence (i.e. + when the scheduling pass is not run, or when no slot fillers could + be found.) The variable `final_sequence' is null when not + processing a sequence, otherwise it contains the `sequence' rtx + being output. + + `REGISTER_PREFIX' + `LOCAL_LABEL_PREFIX' + `USER_LABEL_PREFIX' + `IMMEDIATE_PREFIX' + If defined, C string expressions to be used for the `%R', `%L', + `%U', and `%I' options of `asm_fprintf' (see `final.c'). These + are useful when a single `md' file must support multiple assembler + formats. In that case, the various `tm.h' files can define these + macros differently. + + `ASM_FPRINTF_EXTENSIONS(FILE, ARGPTR, FORMAT)' + If defined this macro should expand to a series of `case' + statements which will be parsed inside the `switch' statement of + the `asm_fprintf' function. This allows targets to define extra + printf formats which may useful when generating their assembler + statements. Note that upper case letters are reserved for future + generic extensions to asm_fprintf, and so are not available to + target specific code. The output file is given by the parameter + FILE. The varargs input pointer is ARGPTR and the rest of the + format string, starting the character after the one that is being + switched upon, is pointed to by FORMAT. + + `ASSEMBLER_DIALECT' + If your target supports multiple dialects of assembler language + (such as different opcodes), define this macro as a C expression + that gives the numeric index of the assembler language dialect to + use, with zero as the first variant. + + If this macro is defined, you may use constructs of the form + `{option0|option1|option2...}' + + in the output templates of patterns (*note Output Template::) or + in the first argument of `asm_fprintf'. This construct outputs + `option0', `option1', `option2', etc., if the value of + `ASSEMBLER_DIALECT' is zero, one, two, etc. Any special characters + within these strings retain their usual meaning. If there are + fewer alternatives within the braces than the value of + `ASSEMBLER_DIALECT', the construct outputs nothing. + + If you do not define this macro, the characters `{', `|' and `}' + do not have any special meaning when used in templates or operands + to `asm_fprintf'. + + Define the macros `REGISTER_PREFIX', `LOCAL_LABEL_PREFIX', + `USER_LABEL_PREFIX' and `IMMEDIATE_PREFIX' if you can express the + variations in assembler language syntax with that mechanism. + Define `ASSEMBLER_DIALECT' and use the `{option0|option1}' syntax + if the syntax variant are larger and involve such things as + different opcodes or operand order. + + `ASM_OUTPUT_REG_PUSH (STREAM, REGNO)' + A C expression to output to STREAM some assembler code which will + push hard register number REGNO onto the stack. The code need not + be optimal, since this macro is used only when profiling. + + `ASM_OUTPUT_REG_POP (STREAM, REGNO)' + A C expression to output to STREAM some assembler code which will + pop hard register number REGNO off of the stack. The code need + not be optimal, since this macro is used only when profiling. + +  + File: gccint.info, Node: Dispatch Tables, Next: Exception Region Output, Prev: Instruction Output, Up: Assembler Format + + Output of Dispatch Tables + ------------------------- + + This concerns dispatch tables. + + `ASM_OUTPUT_ADDR_DIFF_ELT (STREAM, BODY, VALUE, REL)' + A C statement to output to the stdio stream STREAM an assembler + pseudo-instruction to generate a difference between two labels. + VALUE and REL are the numbers of two internal labels. The + definitions of these labels are output using + `ASM_OUTPUT_INTERNAL_LABEL', and they must be printed in the same + way here. For example, + + fprintf (STREAM, "\t.word L%d-L%d\n", + VALUE, REL) + + You must provide this macro on machines where the addresses in a + dispatch table are relative to the table's own address. If + defined, GCC will also use this macro on all machines when + producing PIC. BODY is the body of the `ADDR_DIFF_VEC'; it is + provided so that the mode and flags can be read. + + `ASM_OUTPUT_ADDR_VEC_ELT (STREAM, VALUE)' + This macro should be provided on machines where the addresses in a + dispatch table are absolute. + + The definition should be a C statement to output to the stdio + stream STREAM an assembler pseudo-instruction to generate a + reference to a label. VALUE is the number of an internal label + whose definition is output using `ASM_OUTPUT_INTERNAL_LABEL'. For + example, + + fprintf (STREAM, "\t.word L%d\n", VALUE) + + `ASM_OUTPUT_CASE_LABEL (STREAM, PREFIX, NUM, TABLE)' + Define this if the label before a jump-table needs to be output + specially. The first three arguments are the same as for + `ASM_OUTPUT_INTERNAL_LABEL'; the fourth argument is the jump-table + which follows (a `jump_insn' containing an `addr_vec' or + `addr_diff_vec'). + + This feature is used on system V to output a `swbeg' statement for + the table. + + If this macro is not defined, these labels are output with + `ASM_OUTPUT_INTERNAL_LABEL'. + + `ASM_OUTPUT_CASE_END (STREAM, NUM, TABLE)' + Define this if something special must be output at the end of a + jump-table. The definition should be a C statement to be executed + after the assembler code for the table is written. It should write + the appropriate code to stdio stream STREAM. The argument TABLE + is the jump-table insn, and NUM is the label-number of the + preceding label. + + If this macro is not defined, nothing special is output at the end + of the jump-table. + +  + File: gccint.info, Node: Exception Region Output, Next: Alignment Output, Prev: Dispatch Tables, Up: Assembler Format + + Assembler Commands for Exception Regions + ---------------------------------------- + + This describes commands marking the start and the end of an exception + region. + + `EH_FRAME_SECTION_NAME' + If defined, a C string constant for the name of the section + containing exception handling frame unwind information. If not + defined, GCC will provide a default definition if the target + supports named sections. `crtstuff.c' uses this macro to switch + to the appropriate section. + + You should define this symbol if your target supports DWARF 2 frame + unwind information and the default definition does not work. + + `EH_FRAME_IN_DATA_SECTION' + If defined, DWARF 2 frame unwind information will be placed in the + data section even though the target supports named sections. This + might be necessary, for instance, if the system linker does garbage + collection and sections cannot be marked as not to be collected. + + Do not define this macro unless `TARGET_ASM_NAMED_SECTION' is also + defined. + + `MASK_RETURN_ADDR' + An rtx used to mask the return address found via + `RETURN_ADDR_RTX', so that it does not contain any extraneous set + bits in it. + + `DWARF2_UNWIND_INFO' + Define this macro to 0 if your target supports DWARF 2 frame unwind + information, but it does not yet work with exception handling. + Otherwise, if your target supports this information (if it defines + `INCOMING_RETURN_ADDR_RTX' and either `UNALIGNED_INT_ASM_OP' or + `OBJECT_FORMAT_ELF'), GCC will provide a default definition of 1. + + If this macro is defined to 1, the DWARF 2 unwinder will be the + default exception handling mechanism; otherwise, + `setjmp'/`longjmp' will be used by default. + + If this macro is defined to anything, the DWARF 2 unwinder will be + used instead of inline unwinders and `__unwind_function' in the + non-`setjmp' case. + + `DWARF_CIE_DATA_ALIGNMENT' + This macro need only be defined if the target might save registers + in the function prologue at an offset to the stack pointer that is + not aligned to `UNITS_PER_WORD'. The definition should be the + negative minimum alignment if `STACK_GROWS_DOWNWARD' is defined, + and the positive minimum alignment otherwise. *Note SDB and + DWARF::. Only applicable if the target supports DWARF 2 frame + unwind information. + + + - Target Hook: void TARGET_ASM_EXCEPTION_SECTION () + If defined, a function that switches to the section in which the + main exception table is to be placed (*note Sections::). The + default is a function that switches to a section named + `.gcc_except_table' on machines that support named sections via + `TARGET_ASM_NAMED_SECTION', otherwise if `-fpic' or `-fPIC' is in + effect, the `data_section', otherwise the `readonly_data_section'. + + - Target Hook: void TARGET_ASM_EH_FRAME_SECTION () + If defined, a function that switches to the section in which the + DWARF 2 frame unwind information to be placed (*note Sections::). + The default is a function that outputs a standard GAS section + directive, if `EH_FRAME_SECTION_NAME' is defined, or else a data + section directive followed by a synthetic label. + +  + File: gccint.info, Node: Alignment Output, Prev: Exception Region Output, Up: Assembler Format + + Assembler Commands for Alignment + -------------------------------- + + This describes commands for alignment. + + `JUMP_ALIGN (LABEL)' + The alignment (log base 2) to put in front of LABEL, which is a + common destination of jumps and has no fallthru incoming edge. + + This macro need not be defined if you don't want any special + alignment to be done at such a time. Most machine descriptions do + not currently define the macro. + + Unless it's necessary to inspect the LABEL parameter, it is better + to set the variable ALIGN_JUMPS in the target's + `OVERRIDE_OPTIONS'. Otherwise, you should try to honor the user's + selection in ALIGN_JUMPS in a `JUMP_ALIGN' implementation. + + `LABEL_ALIGN_AFTER_BARRIER (LABEL)' + The alignment (log base 2) to put in front of LABEL, which follows + a `BARRIER'. + + This macro need not be defined if you don't want any special + alignment to be done at such a time. Most machine descriptions do + not currently define the macro. + + `LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP' + The maximum number of bytes to skip when applying + `LABEL_ALIGN_AFTER_BARRIER'. This works only if + `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined. + + `LOOP_ALIGN (LABEL)' + The alignment (log base 2) to put in front of LABEL, which follows + a `NOTE_INSN_LOOP_BEG' note. + + This macro need not be defined if you don't want any special + alignment to be done at such a time. Most machine descriptions do + not currently define the macro. + + Unless it's necessary to inspect the LABEL parameter, it is better + to set the variable `align_loops' in the target's + `OVERRIDE_OPTIONS'. Otherwise, you should try to honor the user's + selection in `align_loops' in a `LOOP_ALIGN' implementation. + + `LOOP_ALIGN_MAX_SKIP' + The maximum number of bytes to skip when applying `LOOP_ALIGN'. + This works only if `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined. + + `LABEL_ALIGN (LABEL)' + The alignment (log base 2) to put in front of LABEL. If + `LABEL_ALIGN_AFTER_BARRIER' / `LOOP_ALIGN' specify a different + alignment, the maximum of the specified values is used. + + Unless it's necessary to inspect the LABEL parameter, it is better + to set the variable `align_labels' in the target's + `OVERRIDE_OPTIONS'. Otherwise, you should try to honor the user's + selection in `align_labels' in a `LABEL_ALIGN' implementation. + + `LABEL_ALIGN_MAX_SKIP' + The maximum number of bytes to skip when applying `LABEL_ALIGN'. + This works only if `ASM_OUTPUT_MAX_SKIP_ALIGN' is defined. + + `ASM_OUTPUT_SKIP (STREAM, NBYTES)' + A C statement to output to the stdio stream STREAM an assembler + instruction to advance the location counter by NBYTES bytes. + Those bytes should be zero when loaded. NBYTES will be a C + expression of type `int'. + + `ASM_NO_SKIP_IN_TEXT' + Define this macro if `ASM_OUTPUT_SKIP' should not be used in the + text section because it fails to put zeros in the bytes that are + skipped. This is true on many Unix systems, where the pseudo-op + to skip bytes produces no-op instructions rather than zeros when + used in the text section. + + `ASM_OUTPUT_ALIGN (STREAM, POWER)' + A C statement to output to the stdio stream STREAM an assembler + command to advance the location counter to a multiple of 2 to the + POWER bytes. POWER will be a C expression of type `int'. + + `ASM_OUTPUT_MAX_SKIP_ALIGN (STREAM, POWER, MAX_SKIP)' + A C statement to output to the stdio stream STREAM an assembler + command to advance the location counter to a multiple of 2 to the + POWER bytes, but only if MAX_SKIP or fewer bytes are needed to + satisfy the alignment request. POWER and MAX_SKIP will be a C + expression of type `int'. + +  + File: gccint.info, Node: Debugging Info, Next: Cross-compilation, Prev: Assembler Format, Up: Target Macros + + Controlling Debugging Information Format + ======================================== + + This describes how to specify debugging information. + + * Menu: + + * All Debuggers:: Macros that affect all debugging formats uniformly. + * DBX Options:: Macros enabling specific options in DBX format. + * DBX Hooks:: Hook macros for varying DBX format. + * File Names and DBX:: Macros controlling output of file names in DBX format. + * SDB and DWARF:: Macros for SDB (COFF) and DWARF formats. + * VMS Debug:: Macros for VMS debug format. + +  + File: gccint.info, Node: All Debuggers, Next: DBX Options, Up: Debugging Info + + Macros Affecting All Debugging Formats + -------------------------------------- + + These macros affect all debugging formats. + + `DBX_REGISTER_NUMBER (REGNO)' + A C expression that returns the DBX register number for the + compiler register number REGNO. In the default macro provided, + the value of this expression will be REGNO itself. But sometimes + there are some registers that the compiler knows about and DBX + does not, or vice versa. In such cases, some register may need to + have one number in the compiler and another for DBX. + + If two registers have consecutive numbers inside GCC, and they can + be used as a pair to hold a multiword value, then they _must_ have + consecutive numbers after renumbering with `DBX_REGISTER_NUMBER'. + Otherwise, debuggers will be unable to access such a pair, because + they expect register pairs to be consecutive in their own + numbering scheme. + + If you find yourself defining `DBX_REGISTER_NUMBER' in way that + does not preserve register pairs, then what you must do instead is + redefine the actual register numbering scheme. + + `DEBUGGER_AUTO_OFFSET (X)' + A C expression that returns the integer offset value for an + automatic variable having address X (an RTL expression). The + default computation assumes that X is based on the frame-pointer + and gives the offset from the frame-pointer. This is required for + targets that produce debugging output for DBX or COFF-style + debugging output for SDB and allow the frame-pointer to be + eliminated when the `-g' options is used. + + `DEBUGGER_ARG_OFFSET (OFFSET, X)' + A C expression that returns the integer offset value for an + argument having address X (an RTL expression). The nominal offset + is OFFSET. + + `PREFERRED_DEBUGGING_TYPE' + A C expression that returns the type of debugging output GCC should + produce when the user specifies just `-g'. Define this if you + have arranged for GCC to support more than one format of debugging + output. Currently, the allowable values are `DBX_DEBUG', + `SDB_DEBUG', `DWARF_DEBUG', `DWARF2_DEBUG', `XCOFF_DEBUG', + `VMS_DEBUG', and `VMS_AND_DWARF2_DEBUG'. + + When the user specifies `-ggdb', GCC normally also uses the value + of this macro to select the debugging output format, but with two + exceptions. If `DWARF2_DEBUGGING_INFO' is defined and + `LINKER_DOES_NOT_WORK_WITH_DWARF2' is not defined, GCC uses the + value `DWARF2_DEBUG'. Otherwise, if `DBX_DEBUGGING_INFO' is + defined, GCC uses `DBX_DEBUG'. + + The value of this macro only affects the default debugging output; + the user can always get a specific type of output by using + `-gstabs', `-gcoff', `-gdwarf-1', `-gdwarf-2', `-gxcoff', or + `-gvms'. + +  + File: gccint.info, Node: DBX Options, Next: DBX Hooks, Prev: All Debuggers, Up: Debugging Info + + Specific Options for DBX Output + ------------------------------- + + These are specific options for DBX output. + + `DBX_DEBUGGING_INFO' + Define this macro if GCC should produce debugging output for DBX + in response to the `-g' option. + + `XCOFF_DEBUGGING_INFO' + Define this macro if GCC should produce XCOFF format debugging + output in response to the `-g' option. This is a variant of DBX + format. + + `DEFAULT_GDB_EXTENSIONS' + Define this macro to control whether GCC should by default generate + GDB's extended version of DBX debugging information (assuming + DBX-format debugging information is enabled at all). If you don't + define the macro, the default is 1: always generate the extended + information if there is any occasion to. + + `DEBUG_SYMS_TEXT' + Define this macro if all `.stabs' commands should be output while + in the text section. + + `ASM_STABS_OP' + A C string constant, including spacing, naming the assembler + pseudo op to use instead of `"\t.stabs\t"' to define an ordinary + debugging symbol. If you don't define this macro, `"\t.stabs\t"' + is used. This macro applies only to DBX debugging information + format. + + `ASM_STABD_OP' + A C string constant, including spacing, naming the assembler + pseudo op to use instead of `"\t.stabd\t"' to define a debugging + symbol whose value is the current location. If you don't define + this macro, `"\t.stabd\t"' is used. This macro applies only to + DBX debugging information format. + + `ASM_STABN_OP' + A C string constant, including spacing, naming the assembler + pseudo op to use instead of `"\t.stabn\t"' to define a debugging + symbol with no name. If you don't define this macro, + `"\t.stabn\t"' is used. This macro applies only to DBX debugging + information format. + + `DBX_NO_XREFS' + Define this macro if DBX on your system does not support the + construct `xsTAGNAME'. On some systems, this construct is used to + describe a forward reference to a structure named TAGNAME. On + other systems, this construct is not supported at all. + + `DBX_CONTIN_LENGTH' + A symbol name in DBX-format debugging information is normally + continued (split into two separate `.stabs' directives) when it + exceeds a certain length (by default, 80 characters). On some + operating systems, DBX requires this splitting; on others, + splitting must not be done. You can inhibit splitting by defining + this macro with the value zero. You can override the default + splitting-length by defining this macro as an expression for the + length you desire. + + `DBX_CONTIN_CHAR' + Normally continuation is indicated by adding a `\' character to + the end of a `.stabs' string when a continuation follows. To use + a different character instead, define this macro as a character + constant for the character you want to use. Do not define this + macro if backslash is correct for your system. + + `DBX_STATIC_STAB_DATA_SECTION' + Define this macro if it is necessary to go to the data section + before outputting the `.stabs' pseudo-op for a non-global static + variable. + + `DBX_TYPE_DECL_STABS_CODE' + The value to use in the "code" field of the `.stabs' directive for + a typedef. The default is `N_LSYM'. + + `DBX_STATIC_CONST_VAR_CODE' + The value to use in the "code" field of the `.stabs' directive for + a static variable located in the text section. DBX format does not + provide any "right" way to do this. The default is `N_FUN'. + + `DBX_REGPARM_STABS_CODE' + The value to use in the "code" field of the `.stabs' directive for + a parameter passed in registers. DBX format does not provide any + "right" way to do this. The default is `N_RSYM'. + + `DBX_REGPARM_STABS_LETTER' + The letter to use in DBX symbol data to identify a symbol as a + parameter passed in registers. DBX format does not customarily + provide any way to do this. The default is `'P''. + + `DBX_MEMPARM_STABS_LETTER' + The letter to use in DBX symbol data to identify a symbol as a + stack parameter. The default is `'p''. + + `DBX_FUNCTION_FIRST' + Define this macro if the DBX information for a function and its + arguments should precede the assembler code for the function. + Normally, in DBX format, the debugging information entirely + follows the assembler code. + + `DBX_LBRAC_FIRST' + Define this macro if the `N_LBRAC' symbol for a block should + precede the debugging information for variables and functions + defined in that block. Normally, in DBX format, the `N_LBRAC' + symbol comes first. + + `DBX_BLOCKS_FUNCTION_RELATIVE' + Define this macro if the value of a symbol describing the scope of + a block (`N_LBRAC' or `N_RBRAC') should be relative to the start + of the enclosing function. Normally, GCC uses an absolute address. + + `DBX_USE_BINCL' + Define this macro if GCC should generate `N_BINCL' and `N_EINCL' + stabs for included header files, as on Sun systems. This macro + also directs GCC to output a type number as a pair of a file + number and a type number within the file. Normally, GCC does not + generate `N_BINCL' or `N_EINCL' stabs, and it outputs a single + number for a type number. + +  + File: gccint.info, Node: DBX Hooks, Next: File Names and DBX, Prev: DBX Options, Up: Debugging Info + + Open-Ended Hooks for DBX Format + ------------------------------- + + These are hooks for DBX format. + + `DBX_OUTPUT_LBRAC (STREAM, NAME)' + Define this macro to say how to output to STREAM the debugging + information for the start of a scope level for variable names. The + argument NAME is the name of an assembler symbol (for use with + `assemble_name') whose value is the address where the scope begins. + + `DBX_OUTPUT_RBRAC (STREAM, NAME)' + Like `DBX_OUTPUT_LBRAC', but for the end of a scope level. + + `DBX_OUTPUT_NFUN (STREAM, LSCOPE_LABEL, DECL)' + Define this macro if the target machine requires special handling + to output an `N_FUN' entry for the function DECL. + + `DBX_OUTPUT_ENUM (STREAM, TYPE)' + Define this macro if the target machine requires special handling + to output an enumeration type. The definition should be a C + statement (sans semicolon) to output the appropriate information + to STREAM for the type TYPE. + + `DBX_OUTPUT_FUNCTION_END (STREAM, FUNCTION)' + Define this macro if the target machine requires special output at + the end of the debugging information for a function. The + definition should be a C statement (sans semicolon) to output the + appropriate information to STREAM. FUNCTION is the + `FUNCTION_DECL' node for the function. + + `DBX_OUTPUT_STANDARD_TYPES (SYMS)' + Define this macro if you need to control the order of output of the + standard data types at the beginning of compilation. The argument + SYMS is a `tree' which is a chain of all the predefined global + symbols, including names of data types. + + Normally, DBX output starts with definitions of the types for + integers and characters, followed by all the other predefined + types of the particular language in no particular order. + + On some machines, it is necessary to output different particular + types first. To do this, define `DBX_OUTPUT_STANDARD_TYPES' to + output those symbols in the necessary order. Any predefined types + that you don't explicitly output will be output afterward in no + particular order. + + Be careful not to define this macro so that it works only for C. + There are no global variables to access most of the built-in + types, because another language may have another set of types. + The way to output a particular type is to look through SYMS to see + if you can find it. Here is an example: + + { + tree decl; + for (decl = syms; decl; decl = TREE_CHAIN (decl)) + if (!strcmp (IDENTIFIER_POINTER (DECL_NAME (decl)), + "long int")) + dbxout_symbol (decl); + ... + } + + This does nothing if the expected type does not exist. + + See the function `init_decl_processing' in `c-decl.c' to find the + names to use for all the built-in C types. + + Here is another way of finding a particular type: + + { + tree decl; + for (decl = syms; decl; decl = TREE_CHAIN (decl)) + if (TREE_CODE (decl) == TYPE_DECL + && (TREE_CODE (TREE_TYPE (decl)) + == INTEGER_CST) + && TYPE_PRECISION (TREE_TYPE (decl)) == 16 + && TYPE_UNSIGNED (TREE_TYPE (decl))) + /* This must be `unsigned short'. */ + dbxout_symbol (decl); + ... + } + + `NO_DBX_FUNCTION_END' + Some stabs encapsulation formats (in particular ECOFF), cannot + handle the `.stabs "",N_FUN,,0,0,Lscope-function-1' gdb dbx + extension construct. On those machines, define this macro to turn + this feature off without disturbing the rest of the gdb extensions. + + +  + File: gccint.info, Node: File Names and DBX, Next: SDB and DWARF, Prev: DBX Hooks, Up: Debugging Info + + File Names in DBX Format + ------------------------ + + This describes file names in DBX format. + + `DBX_WORKING_DIRECTORY' + Define this if DBX wants to have the current directory recorded in + each object file. + + Note that the working directory is always recorded if GDB + extensions are enabled. + + `DBX_OUTPUT_MAIN_SOURCE_FILENAME (STREAM, NAME)' + A C statement to output DBX debugging information to the stdio + stream STREAM which indicates that file NAME is the main source + file--the file specified as the input file for compilation. This + macro is called only once, at the beginning of compilation. + + This macro need not be defined if the standard form of output for + DBX debugging information is appropriate. + + `DBX_OUTPUT_MAIN_SOURCE_DIRECTORY (STREAM, NAME)' + A C statement to output DBX debugging information to the stdio + stream STREAM which indicates that the current directory during + compilation is named NAME. + + This macro need not be defined if the standard form of output for + DBX debugging information is appropriate. + + `DBX_OUTPUT_MAIN_SOURCE_FILE_END (STREAM, NAME)' + A C statement to output DBX debugging information at the end of + compilation of the main source file NAME. + + If you don't define this macro, nothing special is output at the + end of compilation, which is correct for most machines. + + `DBX_OUTPUT_SOURCE_FILENAME (STREAM, NAME)' + A C statement to output DBX debugging information to the stdio + stream STREAM which indicates that file NAME is the current source + file. This output is generated each time input shifts to a + different source file as a result of `#include', the end of an + included file, or a `#line' command. + + This macro need not be defined if the standard form of output for + DBX debugging information is appropriate. + +  + File: gccint.info, Node: SDB and DWARF, Next: VMS Debug, Prev: File Names and DBX, Up: Debugging Info + + Macros for SDB and DWARF Output + ------------------------------- + + Here are macros for SDB and DWARF output. + + `SDB_DEBUGGING_INFO' + Define this macro if GCC should produce COFF-style debugging output + for SDB in response to the `-g' option. + + `DWARF_DEBUGGING_INFO' + Define this macro if GCC should produce dwarf format debugging + output in response to the `-g' option. + + `DWARF2_DEBUGGING_INFO' + Define this macro if GCC should produce dwarf version 2 format + debugging output in response to the `-g' option. + + To support optional call frame debugging information, you must also + define `INCOMING_RETURN_ADDR_RTX' and either set + `RTX_FRAME_RELATED_P' on the prologue insns if you use RTL for the + prologue, or call `dwarf2out_def_cfa' and `dwarf2out_reg_save' as + appropriate from `TARGET_ASM_FUNCTION_PROLOGUE' if you don't. + + `DWARF2_FRAME_INFO' + Define this macro to a nonzero value if GCC should always output + Dwarf 2 frame information. If `DWARF2_UNWIND_INFO' (*note + Exception Region Output:: is nonzero, GCC will output this + information not matter how you define `DWARF2_FRAME_INFO'. + + `LINKER_DOES_NOT_WORK_WITH_DWARF2' + Define this macro if the linker does not work with Dwarf version 2. + Normally, if the user specifies only `-ggdb' GCC will use Dwarf + version 2 if available; this macro disables this. See the + description of the `PREFERRED_DEBUGGING_TYPE' macro for more + details. + + `DWARF2_GENERATE_TEXT_SECTION_LABEL' + By default, the Dwarf 2 debugging information generator will + generate a label to mark the beginning of the text section. If it + is better simply to use the name of the text section itself, + rather than an explicit label, to indicate the beginning of the + text section, define this macro to zero. + + `DWARF2_ASM_LINE_DEBUG_INFO' + Define this macro to be a nonzero value if the assembler can + generate Dwarf 2 line debug info sections. This will result in + much more compact line number tables, and hence is desirable if it + works. + + `PUT_SDB_...' + Define these macros to override the assembler syntax for the + special SDB assembler directives. See `sdbout.c' for a list of + these macros and their arguments. If the standard syntax is used, + you need not define them yourself. + + `SDB_DELIM' + Some assemblers do not support a semicolon as a delimiter, even + between SDB assembler directives. In that case, define this macro + to be the delimiter to use (usually `\n'). It is not necessary to + define a new set of `PUT_SDB_OP' macros if this is the only change + required. + + `SDB_GENERATE_FAKE' + Define this macro to override the usual method of constructing a + dummy name for anonymous structure and union types. See + `sdbout.c' for more information. + + `SDB_ALLOW_UNKNOWN_REFERENCES' + Define this macro to allow references to unknown structure, union, + or enumeration tags to be emitted. Standard COFF does not allow + handling of unknown references, MIPS ECOFF has support for it. + + `SDB_ALLOW_FORWARD_REFERENCES' + Define this macro to allow references to structure, union, or + enumeration tags that have not yet been seen to be handled. Some + assemblers choke if forward tags are used, while some require it. + +  + File: gccint.info, Node: VMS Debug, Prev: SDB and DWARF, Up: Debugging Info + + Macros for VMS Debug Format + --------------------------- + + Here are macros for VMS debug format. + + `VMS_DEBUGGING_INFO' + Define this macro if GCC should produce debugging output for VMS + in response to the `-g' option. The default behavior for VMS is + to generate minimal debug info for a traceback in the absence of + `-g' unless explicitly overridden with `-g0'. This behavior is + controlled by `OPTIMIZATION_OPTIONS' and `OVERRIDE_OPTIONS'. + +  + File: gccint.info, Node: Cross-compilation, Next: Mode Switching, Prev: Debugging Info, Up: Target Macros + + Cross Compilation and Floating Point + ==================================== + + While all modern machines use 2's complement representation for + integers, there are a variety of representations for floating point + numbers. This means that in a cross-compiler the representation of + floating point numbers in the compiled program may be different from + that used in the machine doing the compilation. + + Because different representation systems may offer different amounts + of range and precision, the cross compiler cannot safely use the host + machine's floating point arithmetic. Therefore, floating point + constants must be represented in the target machine's format. This + means that the cross compiler cannot use `atof' to parse a floating + point constant; it must have its own special routine to use instead. + Also, constant folding must emulate the target machine's arithmetic (or + must not be done at all). + + The macros in the following table should be defined only if you are + cross compiling between different floating point formats. + + Otherwise, don't define them. Then default definitions will be set + up which use `double' as the data type, `==' to test for equality, etc. + + You don't need to worry about how many times you use an operand of + any of these macros. The compiler never uses operands which have side + effects. + + `REAL_VALUE_TYPE' + A macro for the C data type to be used to hold a floating point + value in the target machine's format. Typically this would be a + `struct' containing an array of `int'. + + `REAL_VALUES_EQUAL (X, Y)' + A macro for a C expression which compares for equality the two + values, X and Y, both of type `REAL_VALUE_TYPE'. + + `REAL_VALUES_LESS (X, Y)' + A macro for a C expression which tests whether X is less than Y, + both values being of type `REAL_VALUE_TYPE' and interpreted as + floating point numbers in the target machine's representation. + + `REAL_VALUE_LDEXP (X, SCALE)' + A macro for a C expression which performs the standard library + function `ldexp', but using the target machine's floating point + representation. Both X and the value of the expression have type + `REAL_VALUE_TYPE'. The second argument, SCALE, is an integer. + + `REAL_VALUE_FIX (X)' + A macro whose definition is a C expression to convert the + target-machine floating point value X to a signed integer. X has + type `REAL_VALUE_TYPE'. + + `REAL_VALUE_UNSIGNED_FIX (X)' + A macro whose definition is a C expression to convert the + target-machine floating point value X to an unsigned integer. X + has type `REAL_VALUE_TYPE'. + + `REAL_VALUE_RNDZINT (X)' + A macro whose definition is a C expression to round the + target-machine floating point value X towards zero to an integer + value (but still as a floating point number). X has type + `REAL_VALUE_TYPE', and so does the value. + + `REAL_VALUE_UNSIGNED_RNDZINT (X)' + A macro whose definition is a C expression to round the + target-machine floating point value X towards zero to an unsigned + integer value (but still represented as a floating point number). + X has type `REAL_VALUE_TYPE', and so does the value. + + `REAL_VALUE_ATOF (STRING, MODE)' + A macro for a C expression which converts STRING, an expression of + type `char *', into a floating point number in the target machine's + representation for mode MODE. The value has type + `REAL_VALUE_TYPE'. + + `REAL_INFINITY' + Define this macro if infinity is a possible floating point value, + and therefore division by 0 is legitimate. + + `REAL_VALUE_ISINF (X)' + A macro for a C expression which determines whether X, a floating + point value, is infinity. The value has type `int'. By default, + this is defined to call `isinf'. + + `REAL_VALUE_ISNAN (X)' + A macro for a C expression which determines whether X, a floating + point value, is a "nan" (not-a-number). The value has type `int'. + By default, this is defined to call `isnan'. + + Define the following additional macros if you want to make floating + point constant folding work while cross compiling. If you don't define + them, cross compilation is still possible, but constant folding will + not happen for floating point values. + + `REAL_ARITHMETIC (OUTPUT, CODE, X, Y)' + A macro for a C statement which calculates an arithmetic operation + of the two floating point values X and Y, both of type + `REAL_VALUE_TYPE' in the target machine's representation, to + produce a result of the same type and representation which is + stored in OUTPUT (which will be a variable). + + The operation to be performed is specified by CODE, a tree code + which will always be one of the following: `PLUS_EXPR', + `MINUS_EXPR', `MULT_EXPR', `RDIV_EXPR', `MAX_EXPR', `MIN_EXPR'. + + The expansion of this macro is responsible for checking for + overflow. If overflow happens, the macro expansion should execute + the statement `return 0;', which indicates the inability to + perform the arithmetic operation requested. + + `REAL_VALUE_NEGATE (X)' + A macro for a C expression which returns the negative of the + floating point value X. Both X and the value of the expression + have type `REAL_VALUE_TYPE' and are in the target machine's + floating point representation. + + There is no way for this macro to report overflow, since overflow + can't happen in the negation operation. + + `REAL_VALUE_TRUNCATE (MODE, X)' + A macro for a C expression which converts the floating point value + X to mode MODE. + + Both X and the value of the expression are in the target machine's + floating point representation and have type `REAL_VALUE_TYPE'. + However, the value should have an appropriate bit pattern to be + output properly as a floating constant whose precision accords + with mode MODE. + + There is no way for this macro to report overflow. + + `REAL_VALUE_TO_INT (LOW, HIGH, X)' + A macro for a C expression which converts a floating point value X + into a double-precision integer which is then stored into LOW and + HIGH, two variables of type INT. + + `REAL_VALUE_FROM_INT (X, LOW, HIGH, MODE)' + A macro for a C expression which converts a double-precision + integer found in LOW and HIGH, two variables of type INT, into a + floating point value which is then stored into X. The value is in + the target machine's representation for mode MODE and has the type + `REAL_VALUE_TYPE'. + +  + File: gccint.info, Node: Mode Switching, Next: Target Attributes, Prev: Cross-compilation, Up: Target Macros + + Mode Switching Instructions + =========================== + + The following macros control mode switching optimizations: + + `OPTIMIZE_MODE_SWITCHING (ENTITY)' + Define this macro if the port needs extra instructions inserted + for mode switching in an optimizing compilation. + + For an example, the SH4 can perform both single and double + precision floating point operations, but to perform a single + precision operation, the FPSCR PR bit has to be cleared, while for + a double precision operation, this bit has to be set. Changing + the PR bit requires a general purpose register as a scratch + register, hence these FPSCR sets have to be inserted before + reload, i.e. you can't put this into instruction emitting or + `MACHINE_DEPENDENT_REORG'. + + You can have multiple entities that are mode-switched, and select + at run time which entities actually need it. + `OPTIMIZE_MODE_SWITCHING' should return nonzero for any ENTITY + that needs mode-switching. If you define this macro, you also + have to define `NUM_MODES_FOR_MODE_SWITCHING', `MODE_NEEDED', + `MODE_PRIORITY_TO_MODE' and `EMIT_MODE_SET'. `NORMAL_MODE' is + optional. + + `NUM_MODES_FOR_MODE_SWITCHING' + If you define `OPTIMIZE_MODE_SWITCHING', you have to define this as + initializer for an array of integers. Each initializer element N + refers to an entity that needs mode switching, and specifies the + number of different modes that might need to be set for this + entity. The position of the initializer in the initializer - + starting counting at zero - determines the integer that is used to + refer to the mode-switched entity in question. In macros that + take mode arguments / yield a mode result, modes are represented + as numbers 0 ... N - 1. N is used to specify that no mode switch + is needed / supplied. + + `MODE_NEEDED (ENTITY, INSN)' + ENTITY is an integer specifying a mode-switched entity. If + `OPTIMIZE_MODE_SWITCHING' is defined, you must define this macro to + return an integer value not larger than the corresponding element + in `NUM_MODES_FOR_MODE_SWITCHING', to denote the mode that ENTITY + must be switched into prior to the execution of INSN. + + `NORMAL_MODE (ENTITY)' + If this macro is defined, it is evaluated for every ENTITY that + needs mode switching. It should evaluate to an integer, which is + a mode that ENTITY is assumed to be switched to at function entry + and exit. + + `MODE_PRIORITY_TO_MODE (ENTITY, N)' + This macro specifies the order in which modes for ENTITY are + processed. 0 is the highest priority, + `NUM_MODES_FOR_MODE_SWITCHING[ENTITY] - 1' the lowest. The value + of the macro should be an integer designating a mode for ENTITY. + For any fixed ENTITY, `mode_priority_to_mode' (ENTITY, N) shall be + a bijection in 0 ... `num_modes_for_mode_switching[ENTITY] - 1'. + + `EMIT_MODE_SET (ENTITY, MODE, HARD_REGS_LIVE)' + Generate one or more insns to set ENTITY to MODE. HARD_REG_LIVE + is the set of hard registers live at the point where the insn(s) + are to be inserted. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-2 gcc-3.2.3/gcc/doc/gccint.info-2 *** gcc-3.2.2/gcc/doc/gccint.info-2 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-2 Tue Apr 22 07:07:18 2003 *************** *** 0 **** --- 1,970 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Back End, Prev: Front End, Up: gcc Directory + + Anatomy of a Target Back End + ---------------------------- + + A back end for a target architecture in GCC has the following parts: + + * A directory `MACHINE' under `gcc/config', containing a machine + description `MACHINE.md' file (*note Machine Descriptions: Machine + Desc.), header files `MACHINE.h' and `MACHINE-protos.h' and a + source file `MACHINE.c' (*note Target Description Macros and + Functions: Target Macros.), possibly a target Makefile fragment + `t-MACHINE' (*note The Target Makefile Fragment: Target + Fragment.), and maybe some other files. The names of these files + may be changed from the defaults given by explicit specifications + in `config.gcc'. + + * Entries in `config.gcc' (*note The `config.gcc' File: System + Config.) for the systems with this target architecture. + + * Documentation in `gcc/doc/invoke.texi' for any command-line + options supported by this target (*note Run-time Target + Specification: Run-time Target.). This means both entries in the + summary table of options and details of the individual options. + + * Documentation in `gcc/doc/extend.texi' for any target-specific + attributes supported (*note Defining target-specific uses of + `__attribute__': Target Attributes.), including where the same + attribute is already supported on some targets, which are + enumerated in the manual. + + * Documentation in `gcc/doc/extend.texi' for any target-specific + pragmas supported. + + * Documentation in `gcc/doc/extend.texi' of any target-specific + built-in functions supported. + + * Documentation in `gcc/doc/md.texi' of any target-specific + constraint letters (*note Constraints for Particular Machines: + Machine Constraints.). + + * A note in `gcc/doc/contrib.texi' under the person or people who + contributed the target support. + + * Entries in `gcc/doc/install.texi' for all target triplets + supported with this target architecture, giving details of any + special notes about installation for this target, or saying that + there are no special notes if there are none. + + * Possibly other support outside the `gcc' directory for runtime + libraries. FIXME: reference docs for this. The libstdc++ porting + manual needs to be installed as info for this to work, or to be a + chapter of this manual. + + If the back end is added to the official GCC CVS repository, the + following are also necessary: + + * An entry for the target architecture in `readings.html' on the GCC + web site, with any relevant links. + + * A news item about the contribution of support for that target + architecture, in `index.html' on the GCC web site. + + * Normally, one or more maintainers of that target listed in + `MAINTAINERS'. Some existing architectures may be unmaintained, + but it would be unusual to add support for a target that does not + have a maintainer when support is added. + +  + File: gccint.info, Node: Test Suites, Prev: gcc Directory, Up: Source Tree + + Test Suites + =========== + + GCC contains several test suites to help maintain compiler quality. + Most of the runtime libraries and language front ends in GCC have test + suites. Currently only the C language test suites are documented here; + FIXME: document the others. + + * Menu: + + * Test Idioms:: Idioms used in test suite code. + * C Tests:: The C language test suites. + * libgcj Tests:: The Java library test suites. + +  + File: gccint.info, Node: Test Idioms, Next: C Tests, Up: Test Suites + + Idioms Used in Test Suite Code + ------------------------------ + + In the `gcc.c-torture' test suites, test cases are commonly named + after the date on which they were added. This allows people to tell at + a glance whether a test failure is because of a recently found bug that + has not yet been fixed, or whether it may be a regression. In other + test suites, more descriptive names are used. In general C test cases + have a trailing `-N.c', starting with `-1.c', in case other test cases + with similar names are added later. + + Test cases should use `abort ()' to indicate failure and `exit (0)' + for success; on some targets these may be redefined to indicate failure + and success in other ways. + + In the `gcc.dg' test suite, it is often necessary to test that an + error is indeed a hard error and not just a warning--for example, where + it is a constraint violation in the C standard, which must become an + error with `-pedantic-errors'. The following idiom, where the first + line shown is line LINE of the file and the line that generates the + error, is used for this: + + /* { dg-bogus "warning" "warning in place of error" } */ + /* { dg-error "REGEXP" "MESSAGE" { target *-*-* } LINE } */ + + It may be necessary to check that an expression is an integer + constant expression and has a certain value. To check that `E' has + value `V', an idiom similar to the following is used: + + char x[((E) == (V) ? 1 : -1)]; + + In `gcc.dg' tests, `__typeof__' is sometimes used to make assertions + about the types of expressions. See, for example, + `gcc.dg/c99-condexpr-1.c'. The more subtle uses depend on the exact + rules for the types of conditional expressions in the C standard; see, + for example, `gcc.dg/c99-intconst-1.c'. + + It is useful to be able to test that optimizations are being made + properly. This cannot be done in all cases, but it can be done where + the optimization will lead to code being optimized away (for example, + where flow analysis or alias analysis should show that certain code + cannot be called) or to functions not being called because they have + been expanded as built-in functions. Such tests go in + `gcc.c-torture/execute'. Where code should be optimized away, a call + to a nonexistent function such as `link_failure ()' may be inserted; a + definition + + #ifndef __OPTIMIZE__ + void + link_failure (void) + { + abort (); + } + #endif + + will also be needed so that linking still succeeds when the test is run + without optimization. When all calls to a built-in function should + have been optimized and no calls to the non-built-in version of the + function should remain, that function may be defined as `static' to + call `abort ()' (although redeclaring a function as static may not work + on all targets). + + FIXME: discuss non-C test suites here. + +  + File: gccint.info, Node: C Tests, Next: libgcj Tests, Prev: Test Idioms, Up: Test Suites + + C Language Test Suites + ---------------------- + + GCC contains the following C language test suites, in the + `gcc/testsuite' directory: + + `gcc.c-torture/compat' + FIXME: describe this. + + This directory should probably not be used for new tests. + + `gcc.c-torture/compile' + This test suite contains test cases that should compile, but do not + need to link or run. These test cases are compiled with several + different combinations of optimization options. All warnings are + disabled for these test cases, so this directory is not suitable if + you wish to test for the presence or absence of compiler warnings. + While special options can be set, and tests disabled on specific + platforms, by the use of `.x' files, mostly these test cases + should not contain platform dependencies. FIXME: discuss how + defines such as `NO_LABEL_VALUES' and `STACK_SIZE' are used. + + `gcc.c-torture/execute' + This test suite contains test cases that should compile, link and + run; otherwise the same comments as for `gcc.c-torture/compile' + apply. + + `gcc.c-torture/unsorted' + FIXME: describe this. + + This directory should probably not be used for new tests. + + `gcc.dg' + This test suite contains tests using the more modern `dg' harness. + Magic comments determine whether the file is preprocessed, + compiled, linked or run. In these tests, error and warning + message texts are compared against expected texts or regular + expressions given in comments. These tests are run with the + options `-ansi -pedantic' unless other options are given in the + test. Except as noted below they are not run with multiple + optimization options. + + `gcc.dg/cpp' + This subdirectory contains tests of the preprocessor. + + `gcc.dg/debug' + This subdirectory contains tests for debug formats. Tests in this + subdirectory are run for each debug format that the compiler + supports. + + `gcc.dg/format' + This subdirectory contains tests of the `-Wformat' format + checking. Tests in this directory are run with and without + `-DWIDE'. + + `gcc.dg/noncompile' + This subdirectory contains tests of code that should not compile + and does not need any special compilation options. They are run + with multiple optimization options, since sometimes invalid code + crashes the compiler with optimization. + + `gcc.dg/special' + FIXME: describe this. + + `gcc.c-torture/misc-tests' + FIXME: describe this, when it should be used for new tests and + when it shouldn't. + + FIXME: merge in `testsuite/README.gcc' and discuss the format of + test cases and magic comments more. + +  + File: gccint.info, Node: libgcj Tests, Prev: C Tests, Up: Test Suites + + The Java library test suites. + ----------------------------- + + Runtime tests are executed via `make check' from the `testsuite' + directory of the libjava hierarchy in the build tree. Additional + runtime tests can be checked into this testsuite. + + Regression testing of the core packages in libgcj is also covered by + the Mauve test suite. The Mauve Project develops tests for the Java + Class Libraries. These tests are run as part of libgcj testing by + specifying the location of the Mauve tree when invoking `make', as in + `make MAUVEDIR=~/mauve check'. + + The Jacks project provides a test suite for Java compilers that can + be used to test changes that affect the GCJ front end. There is no + automated mechanism to run the Jacks suite as part of GCJ testing. + + We encourage developers to contribute test cases to Mauve and Jacks. + +  + File: gccint.info, Node: Passes, Next: Trees, Prev: Source Tree, Up: Top + + Passes and Files of the Compiler + ******************************** + + The overall control structure of the compiler is in `toplev.c'. This + file is responsible for initialization, decoding arguments, opening and + closing files, and sequencing the passes. + + The parsing pass is invoked only once, to parse the entire input. A + high level tree representation is then generated from the input, one + function at a time. This tree code is then transformed into RTL + intermediate code, and processed. The files involved in transforming + the trees into RTL are `expr.c', `expmed.c', and `stmt.c'. The order + of trees that are processed, is not necessarily the same order they are + generated from the input, due to deferred inlining, and other + considerations. + + Each time the parsing pass reads a complete function definition or + top-level declaration, it calls either the function + `rest_of_compilation', or the function `rest_of_decl_compilation' in + `toplev.c', which are responsible for all further processing necessary, + ending with output of the assembler language. All other compiler + passes run, in sequence, within `rest_of_compilation'. When that + function returns from compiling a function definition, the storage used + for that function definition's compilation is entirely freed, unless it + is an inline function, or was deferred for some reason (this can occur + in templates, for example). (*note An Inline Function is As Fast As a + Macro: (gcc)Inline.). + + Here is a list of all the passes of the compiler and their source + files. Also included is a description of where debugging dumps can be + requested with `-d' options. + + * Parsing. This pass reads the entire text of a function definition, + constructing a high level tree representation. (Because of the + semantic analysis that takes place during this pass, it does more + than is formally considered to be parsing.) + + The tree representation does not entirely follow C syntax, because + it is intended to support other languages as well. + + Language-specific data type analysis is also done in this pass, + and every tree node that represents an expression has a data type + attached. Variables are represented as declaration nodes. + + The language-independent source files for parsing are `tree.c', + `fold-const.c', and `stor-layout.c'. There are also header files + `tree.h' and `tree.def' which define the format of the tree + representation. + + C preprocessing, for language front ends, that want or require it, + is performed by cpplib, which is covered in separate + documentation. In particular, the internals are covered in *Note + Cpplib internals: (cppinternals)Top. + + The source files to parse C are `c-convert.c', `c-decl.c', + `c-errors.c', `c-lang.c', `c-objc-common.c', `c-parse.in', + `c-aux-info.c', and `c-typeck.c', along with a header file + `c-tree.h' and some files shared with Objective-C and C++. + + The source files for parsing C++ are in `cp/'. They are `parse.y', + `class.c', `cvt.c', `decl.c', `decl2.c', `except.c', `expr.c', + `init.c', `lex.c', `method.c', `ptree.c', `search.c', `spew.c', + `semantics.c', `tree.c', `typeck2.c', and `typeck.c', along with + header files `cp-tree.def', `cp-tree.h', and `decl.h'. + + The special source files for parsing Objective-C are in `objc/'. + They are `objc-act.c', `objc-tree.def', and `objc-act.h'. Certain + C-specific files are used for this as well. + + The files `c-common.c', `c-common.def', `c-format.c', `c-pragma.c', + `c-semantics.c', and `c-lex.c', along with header files + `c-common.h', `c-dump.h', `c-lex.h', and `c-pragma.h', are also + used for all of the above languages. + + * Tree optimization. This is the optimization of the tree + representation, before converting into RTL code. + + Currently, the main optimization performed here is tree-based + inlining. This is implemented in `tree-inline.c' and used by both + C and C++. Note that tree based inlining turns off rtx based + inlining (since it's more powerful, it would be a waste of time to + do rtx based inlining in addition). + + Constant folding and some arithmetic simplifications are also done + during this pass, on the tree representation. The routines that + perform these tasks are located in `fold-const.c'. + + * RTL generation. This is the conversion of syntax tree into RTL + code. + + This is where the bulk of target-parameter-dependent code is found, + since often it is necessary for strategies to apply only when + certain standard kinds of instructions are available. The purpose + of named instruction patterns is to provide this information to + the RTL generation pass. + + Optimization is done in this pass for `if'-conditions that are + comparisons, boolean operations or conditional expressions. Tail + recursion is detected at this time also. Decisions are made about + how best to arrange loops and how to output `switch' statements. + + The source files for RTL generation include `stmt.c', `calls.c', + `expr.c', `explow.c', `expmed.c', `function.c', `optabs.c' and + `emit-rtl.c'. Also, the file `insn-emit.c', generated from the + machine description by the program `genemit', is used in this + pass. The header file `expr.h' is used for communication within + this pass. + + The header files `insn-flags.h' and `insn-codes.h', generated from + the machine description by the programs `genflags' and `gencodes', + tell this pass which standard names are available for use and + which patterns correspond to them. + + Aside from debugging information output, none of the following + passes refers to the tree structure representation of the function + (only part of which is saved). + + The decision of whether the function can and should be expanded + inline in its subsequent callers is made at the end of rtl + generation. The function must meet certain criteria, currently + related to the size of the function and the types and number of + parameters it has. Note that this function may contain loops, + recursive calls to itself (tail-recursive functions can be + inlined!), gotos, in short, all constructs supported by GCC. The + file `integrate.c' contains the code to save a function's rtl for + later inlining and to inline that rtl when the function is called. + The header file `integrate.h' is also used for this purpose. + + The option `-dr' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.rtl' to + the input file name. + + * Sibiling call optimization. This pass performs tail recursion + elimination, and tail and sibling call optimizations. The purpose + of these optimizations is to reduce the overhead of function calls, + whenever possible. + + The source file of this pass is `sibcall.c' + + The option `-di' causes a debugging dump of the RTL code after + this pass is run. This dump file's name is made by appending + `.sibling' to the input file name. + + * Jump optimization. This pass simplifies jumps to the following + instruction, jumps across jumps, and jumps to jumps. It deletes + unreferenced labels and unreachable code, except that unreachable + code that contains a loop is not recognized as unreachable in this + pass. (Such loops are deleted later in the basic block analysis.) + It also converts some code originally written with jumps into + sequences of instructions that directly set values from the + results of comparisons, if the machine has such instructions. + + Jump optimization is performed two or three times. The first time + is immediately following RTL generation. The second time is after + CSE, but only if CSE says repeated jump optimization is needed. + The last time is right before the final pass. That time, + cross-jumping and deletion of no-op move instructions are done + together with the optimizations described above. + + The source file of this pass is `jump.c'. + + The option `-dj' causes a debugging dump of the RTL code after + this pass is run for the first time. This dump file's name is + made by appending `.jump' to the input file name. + + * Register scan. This pass finds the first and last use of each + register, as a guide for common subexpression elimination. Its + source is in `regclass.c'. + + * Jump threading. This pass detects a condition jump that branches + to an identical or inverse test. Such jumps can be `threaded' + through the second conditional test. The source code for this + pass is in `jump.c'. This optimization is only performed if + `-fthread-jumps' is enabled. + + * Static Single Assignment (SSA) based optimization passes. The SSA + conversion passes (to/from) are turned on by the `-fssa' option + (it is also done automatically if you enable an SSA optimization + pass). These passes utilize a form called Static Single + Assignment. In SSA form, each variable (pseudo register) is only + set once, giving you def-use and use-def chains for free, and + enabling a lot more optimization passes to be run in linear time. + Conversion to and from SSA form is handled by functions in `ssa.c'. + + The option `-de' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.ssa' to + the input file name. + * SSA Conditional Constant Propagation. Turned on by the + `-fssa-ccp' option. This pass performs conditional constant + propagation to simplify instructions including conditional + branches. This pass is more aggressive than the constant + propagation done by the CSE and GCSE passes, but operates in + linear time. + + The option `-dW' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending + `.ssaccp' to the input file name. + + * SSA Aggressive Dead Code Elimination. Turned on by the + `-fssa-dce' option. This pass performs elimination of code + considered unnecessary because it has no externally visible + effects on the program. It operates in linear time. + + The option `-dX' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending + `.ssadce' to the input file name. + + * Common subexpression elimination. This pass also does constant + propagation. Its source files are `cse.c', and `cselib.c'. If + constant propagation causes conditional jumps to become + unconditional or to become no-ops, jump optimization is run again + when CSE is finished. + + The option `-ds' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.cse' to + the input file name. + + * Global common subexpression elimination. This pass performs two + different types of GCSE depending on whether you are optimizing + for size or not (LCM based GCSE tends to increase code size for a + gain in speed, while Morel-Renvoise based GCSE does not). When + optimizing for size, GCSE is done using Morel-Renvoise Partial + Redundancy Elimination, with the exception that it does not try to + move invariants out of loops--that is left to the loop + optimization pass. If MR PRE GCSE is done, code hoisting (aka + unification) is also done, as well as load motion. If you are + optimizing for speed, LCM (lazy code motion) based GCSE is done. + LCM is based on the work of Knoop, Ruthing, and Steffen. LCM + based GCSE also does loop invariant code motion. We also perform + load and store motion when optimizing for speed. Regardless of + which type of GCSE is used, the GCSE pass also performs global + constant and copy propagation. + + The source file for this pass is `gcse.c', and the LCM routines + are in `lcm.c'. + + The option `-dG' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.gcse' to + the input file name. + + * Loop optimization. This pass moves constant expressions out of + loops, and optionally does strength-reduction and loop unrolling + as well. Its source files are `loop.c' and `unroll.c', plus the + header `loop.h' used for communication between them. Loop + unrolling uses some functions in `integrate.c' and the header + `integrate.h'. Loop dependency analysis routines are contained in + `dependence.c'. + + The option `-dL' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.loop' to + the input file name. + + * If `-frerun-cse-after-loop' was enabled, a second common + subexpression elimination pass is performed after the loop + optimization pass. Jump threading is also done again at this time + if it was specified. + + The option `-dt' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.cse2' to + the input file name. + + * Data flow analysis (`flow.c'). This pass divides the program into + basic blocks (and in the process deletes unreachable loops); then + it computes which pseudo-registers are live at each point in the + program, and makes the first instruction that uses a value point at + the instruction that computed the value. + + This pass also deletes computations whose results are never used, + and combines memory references with add or subtract instructions + to make autoincrement or autodecrement addressing. + + The option `-df' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.flow' to + the input file name. If stupid register allocation is in use, this + dump file reflects the full results of such allocation. + + * Instruction combination (`combine.c'). This pass attempts to + combine groups of two or three instructions that are related by + data flow into single instructions. It combines the RTL + expressions for the instructions by substitution, simplifies the + result using algebra, and then attempts to match the result + against the machine description. + + The option `-dc' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.combine' + to the input file name. + + * If-conversion is a transformation that transforms control + dependencies into data dependencies (IE it transforms conditional + code into a single control stream). It is implemented in the file + `ifcvt.c'. + + The option `-dE' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.ce' to + the input file name. + + * Register movement (`regmove.c'). This pass looks for cases where + matching constraints would force an instruction to need a reload, + and this reload would be a register-to-register move. It then + attempts to change the registers used by the instruction to avoid + the move instruction. + + The option `-dN' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.regmove' + to the input file name. + + * Instruction scheduling (`sched.c'). This pass looks for + instructions whose output will not be available by the time that + it is used in subsequent instructions. (Memory loads and floating + point instructions often have this behavior on RISC machines). It + re-orders instructions within a basic block to try to separate the + definition and use of items that otherwise would cause pipeline + stalls. + + Instruction scheduling is performed twice. The first time is + immediately after instruction combination and the second is + immediately after reload. + + The option `-dS' causes a debugging dump of the RTL code after this + pass is run for the first time. The dump file's name is made by + appending `.sched' to the input file name. + + * Register class preferencing. The RTL code is scanned to find out + which register class is best for each pseudo register. The source + file is `regclass.c'. + + * Local register allocation (`local-alloc.c'). This pass allocates + hard registers to pseudo registers that are used only within one + basic block. Because the basic block is linear, it can use fast + and powerful techniques to do a very good job. + + The option `-dl' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.lreg' to + the input file name. + + * Global register allocation (`global.c'). This pass allocates hard + registers for the remaining pseudo registers (those whose life + spans are not contained in one basic block). + + * Reloading. This pass renumbers pseudo registers with the hardware + registers numbers they were allocated. Pseudo registers that did + not get hard registers are replaced with stack slots. Then it + finds instructions that are invalid because a value has failed to + end up in a register, or has ended up in a register of the wrong + kind. It fixes up these instructions by reloading the + problematical values temporarily into registers. Additional + instructions are generated to do the copying. + + The reload pass also optionally eliminates the frame pointer and + inserts instructions to save and restore call-clobbered registers + around calls. + + Source files are `reload.c' and `reload1.c', plus the header + `reload.h' used for communication between them. + + The option `-dg' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.greg' to + the input file name. + + * Instruction scheduling is repeated here to try to avoid pipeline + stalls due to memory loads generated for spilled pseudo registers. + + The option `-dR' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.sched2' + to the input file name. + + * Basic block reordering. This pass implements profile guided code + positioning. If profile information is not available, various + types of static analysis are performed to make the predictions + normally coming from the profile feedback (IE execution frequency, + branch probability, etc). It is implemented in the file + `bb-reorder.c', and the various prediction routines are in + `predict.c'. + + The option `-dB' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.bbro' to + the input file name. + + * Delayed branch scheduling. This optional pass attempts to find + instructions that can go into the delay slots of other + instructions, usually jumps and calls. The source file name is + `reorg.c'. + + The option `-dd' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.dbr' to + the input file name. + + * Branch shortening. On many RISC machines, branch instructions + have a limited range. Thus, longer sequences of instructions must + be used for long branches. In this pass, the compiler figures out + what how far each instruction will be from each other instruction, + and therefore whether the usual instructions, or the longer + sequences, must be used for each branch. + + * Conversion from usage of some hard registers to usage of a register + stack may be done at this point. Currently, this is supported only + for the floating-point registers of the Intel 80387 coprocessor. + The source file name is `reg-stack.c'. + + The options `-dk' causes a debugging dump of the RTL code after + this pass. This dump file's name is made by appending `.stack' to + the input file name. + + * Final. This pass outputs the assembler code for the function. It + is also responsible for identifying spurious test and compare + instructions. Machine-specific peephole optimizations are + performed at the same time. The function entry and exit sequences + are generated directly as assembler code in this pass; they never + exist as RTL. + + The source files are `final.c' plus `insn-output.c'; the latter is + generated automatically from the machine description by the tool + `genoutput'. The header file `conditions.h' is used for + communication between these files. + + * Debugging information output. This is run after final because it + must output the stack slot offsets for pseudo registers that did + not get hard registers. Source files are `dbxout.c' for DBX + symbol table format, `sdbout.c' for SDB symbol table format, + `dwarfout.c' for DWARF symbol table format, files `dwarf2out.c' and + `dwarf2asm.c' for DWARF2 symbol table format, and `vmsdbgout.c' + for VMS debug symbol table format. + + Some additional files are used by all or many passes: + + * Every pass uses `machmode.def' and `machmode.h' which define the + machine modes. + + * Several passes use `real.h', which defines the default + representation of floating point constants and how to operate on + them. + + * All the passes that work with RTL use the header files `rtl.h' and + `rtl.def', and subroutines in file `rtl.c'. The tools `gen*' also + use these files to read and work with the machine description RTL. + + * All the tools that read the machine description use support + routines found in `gensupport.c', `errors.c', and `read-rtl.c'. + + * Several passes refer to the header file `insn-config.h' which + contains a few parameters (C macro definitions) generated + automatically from the machine description RTL by the tool + `genconfig'. + + * Several passes use the instruction recognizer, which consists of + `recog.c' and `recog.h', plus the files `insn-recog.c' and + `insn-extract.c' that are generated automatically from the machine + description by the tools `genrecog' and `genextract'. + + * Several passes use the header files `regs.h' which defines the + information recorded about pseudo register usage, and + `basic-block.h' which defines the information recorded about basic + blocks. + + * `hard-reg-set.h' defines the type `HARD_REG_SET', a bit-vector + with a bit for each hard register, and some macros to manipulate + it. This type is just `int' if the machine has few enough hard + registers; otherwise it is an array of `int' and some of the + macros expand into loops. + + * Several passes use instruction attributes. A definition of the + attributes defined for a particular machine is in file + `insn-attr.h', which is generated from the machine description by + the program `genattr'. The file `insn-attrtab.c' contains + subroutines to obtain the attribute values for insns. It is + generated from the machine description by the program `genattrtab'. + +  + File: gccint.info, Node: Trees, Next: RTL, Prev: Passes, Up: Top + + Trees: The intermediate representation used by the C and C++ front ends + *********************************************************************** + + This chapter documents the internal representation used by GCC to + represent C and C++ source programs. When presented with a C or C++ + source program, GCC parses the program, performs semantic analysis + (including the generation of error messages), and then produces the + internal representation described here. This representation contains a + complete representation for the entire translation unit provided as + input to the front end. This representation is then typically processed + by a code-generator in order to produce machine code, but could also be + used in the creation of source browsers, intelligent editors, automatic + documentation generators, interpreters, and any other programs needing + the ability to process C or C++ code. + + This chapter explains the internal representation. In particular, it + documents the internal representation for C and C++ source constructs, + and the macros, functions, and variables that can be used to access + these constructs. The C++ representation is largely a superset of the + representation used in the C front end. There is only one construct + used in C that does not appear in the C++ front end and that is the GNU + "nested function" extension. Many of the macros documented here do not + apply in C because the corresponding language constructs do not appear + in C. + + If you are developing a "back end", be it is a code-generator or some + other tool, that uses this representation, you may occasionally find + that you need to ask questions not easily answered by the functions and + macros available here. If that situation occurs, it is quite likely + that GCC already supports the functionality you desire, but that the + interface is simply not documented here. In that case, you should ask + the GCC maintainers (via mail to ) about documenting + the functionality you require. Similarly, if you find yourself writing + functions that do not deal directly with your back end, but instead + might be useful to other people using the GCC front end, you should + submit your patches for inclusion in GCC. + + * Menu: + + * Deficiencies:: Topics net yet covered in this document. + * Tree overview:: All about `tree's. + * Types:: Fundamental and aggregate types. + * Scopes:: Namespaces and classes. + * Functions:: Overloading, function bodies, and linkage. + * Declarations:: Type declarations and variables. + * Attributes:: Declaration and type attributes. + * Expression trees:: From `typeid' to `throw'. + +  + File: gccint.info, Node: Deficiencies, Next: Tree overview, Up: Trees + + Deficiencies + ============ + + There are many places in which this document is incomplet and + incorrekt. It is, as of yet, only _preliminary_ documentation. + +  + File: gccint.info, Node: Tree overview, Next: Types, Prev: Deficiencies, Up: Trees + + Overview + ======== + + The central data structure used by the internal representation is the + `tree'. These nodes, while all of the C type `tree', are of many + varieties. A `tree' is a pointer type, but the object to which it + points may be of a variety of types. From this point forward, we will + refer to trees in ordinary type, rather than in `this font', except + when talking about the actual C type `tree'. + + You can tell what kind of node a particular tree is by using the + `TREE_CODE' macro. Many, many macros take a trees as input and return + trees as output. However, most macros require a certain kinds of tree + node as input. In other words, there is a type-system for trees, but + it is not reflected in the C type-system. + + For safety, it is useful to configure GCC with `--enable-checking'. + Although this results in a significant performance penalty (since all + tree types are checked at run-time), and is therefore inappropriate in a + release version, it is extremely helpful during the development process. + + Many macros behave as predicates. Many, although not all, of these + predicates end in `_P'. Do not rely on the result type of these macros + being of any particular type. You may, however, rely on the fact that + the type can be compared to `0', so that statements like + if (TEST_P (t) && !TEST_P (y)) + x = 1; + + and + int i = (TEST_P (t) != 0); + + are legal. Macros that return `int' values now may be changed to + return `tree' values, or other pointers in the future. Even those that + continue to return `int' may return multiple nonzero codes where + previously they returned only zero and one. Therefore, you should not + write code like + if (TEST_P (t) == 1) + + as this code is not guaranteed to work correctly in the future. + + You should not take the address of values returned by the macros or + functions described here. In particular, no guarantee is given that the + values are lvalues. + + In general, the names of macros are all in uppercase, while the + names of functions are entirely in lower case. There are rare + exceptions to this rule. You should assume that any macro or function + whose name is made up entirely of uppercase letters may evaluate its + arguments more than once. You may assume that a macro or function + whose name is made up entirely of lowercase letters will evaluate its + arguments only once. + + The `error_mark_node' is a special tree. Its tree code is + `ERROR_MARK', but since there is only ever one node with that code, the + usual practice is to compare the tree against `error_mark_node'. (This + test is just a test for pointer equality.) If an error has occurred + during front-end processing the flag `errorcount' will be set. If the + front end has encountered code it cannot handle, it will issue a + message to the user and set `sorrycount'. When these flags are set, + any macro or function which normally returns a tree of a particular + kind may instead return the `error_mark_node'. Thus, if you intend to + do any processing of erroneous code, you must be prepared to deal with + the `error_mark_node'. + + Occasionally, a particular tree slot (like an operand to an + expression, or a particular field in a declaration) will be referred to + as "reserved for the back end." These slots are used to store RTL when + the tree is converted to RTL for use by the GCC back end. However, if + that process is not taking place (e.g., if the front end is being hooked + up to an intelligent editor), then those slots may be used by the back + end presently in use. + + If you encounter situations that do not match this documentation, + such as tree nodes of types not mentioned here, or macros documented to + return entities of a particular kind that instead return entities of + some different kind, you have found a bug, either in the front end or in + the documentation. Please report these bugs as you would any other bug. + + * Menu: + + * Macros and Functions::Macros and functions that can be used with all trees. + * Identifiers:: The names of things. + * Containers:: Lists and vectors. + +  + File: gccint.info, Node: Macros and Functions, Next: Identifiers, Up: Tree overview + + Trees + ----- + + This section is not here yet. + +  + File: gccint.info, Node: Identifiers, Next: Containers, Prev: Macros and Functions, Up: Tree overview + + Identifiers + ----------- + + An `IDENTIFIER_NODE' represents a slightly more general concept that + the standard C or C++ concept of identifier. In particular, an + `IDENTIFIER_NODE' may contain a `$', or other extraordinary characters. + + There are never two distinct `IDENTIFIER_NODE's representing the + same identifier. Therefore, you may use pointer equality to compare + `IDENTIFIER_NODE's, rather than using a routine like `strcmp'. + + You can use the following macros to access identifiers: + `IDENTIFIER_POINTER' + The string represented by the identifier, represented as a + `char*'. This string is always `NUL'-terminated, and contains no + embedded `NUL' characters. + + `IDENTIFIER_LENGTH' + The length of the string returned by `IDENTIFIER_POINTER', not + including the trailing `NUL'. This value of `IDENTIFIER_LENGTH + (x)' is always the same as `strlen (IDENTIFIER_POINTER (x))'. + + `IDENTIFIER_OPNAME_P' + This predicate holds if the identifier represents the name of an + overloaded operator. In this case, you should not depend on the + contents of either the `IDENTIFIER_POINTER' or the + `IDENTIFIER_LENGTH'. + + `IDENTIFIER_TYPENAME_P' + This predicate holds if the identifier represents the name of a + user-defined conversion operator. In this case, the `TREE_TYPE' of + the `IDENTIFIER_NODE' holds the type to which the conversion + operator converts. + + +  + File: gccint.info, Node: Containers, Prev: Identifiers, Up: Tree overview + + Containers + ---------- + + Two common container data structures can be represented directly with + tree nodes. A `TREE_LIST' is a singly linked list containing two trees + per node. These are the `TREE_PURPOSE' and `TREE_VALUE' of each node. + (Often, the `TREE_PURPOSE' contains some kind of tag, or additional + information, while the `TREE_VALUE' contains the majority of the + payload. In other cases, the `TREE_PURPOSE' is simply `NULL_TREE', + while in still others both the `TREE_PURPOSE' and `TREE_VALUE' are of + equal stature.) Given one `TREE_LIST' node, the next node is found by + following the `TREE_CHAIN'. If the `TREE_CHAIN' is `NULL_TREE', then + you have reached the end of the list. + + A `TREE_VEC' is a simple vector. The `TREE_VEC_LENGTH' is an + integer (not a tree) giving the number of nodes in the vector. The + nodes themselves are accessed using the `TREE_VEC_ELT' macro, which + takes two arguments. The first is the `TREE_VEC' in question; the + second is an integer indicating which element in the vector is desired. + The elements are indexed from zero. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-20 gcc-3.2.3/gcc/doc/gccint.info-20 *** gcc-3.2.2/gcc/doc/gccint.info-20 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-20 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,1110 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Target Attributes, Next: Misc, Prev: Mode Switching, Up: Target Macros + + Defining target-specific uses of `__attribute__' + ================================================ + + Target-specific attributes may be defined for functions, data and + types. These are described using the following target hooks; they also + need to be documented in `extend.texi'. + + - Target Hook: const struct attribute_spec * TARGET_ATTRIBUTE_TABLE + If defined, this target hook points to an array of `struct + attribute_spec' (defined in `tree.h') specifying the machine + specific attributes for this target and some of the restrictions + on the entities to which these attributes are applied and the + arguments they take. + + - Target Hook: int TARGET_COMP_TYPE_ATTRIBUTES (tree TYPE1, tree TYPE2) + If defined, this target hook is a function which returns zero if + the attributes on TYPE1 and TYPE2 are incompatible, one if they + are compatible, and two if they are nearly compatible (which + causes a warning to be generated). If this is not defined, + machine-specific attributes are supposed always to be compatible. + + - Target Hook: void TARGET_SET_DEFAULT_TYPE_ATTRIBUTES (tree TYPE) + If defined, this target hook is a function which assigns default + attributes to newly defined TYPE. + + - Target Hook: tree TARGET_MERGE_TYPE_ATTRIBUTES (tree TYPE1, tree + TYPE2) + Define this target hook if the merging of type attributes needs + special handling. If defined, the result is a list of the combined + `TYPE_ATTRIBUTES' of TYPE1 and TYPE2. It is assumed that + `comptypes' has already been called and returned 1. This function + may call `merge_attributes' to handle machine-independent merging. + + - Target Hook: tree TARGET_MERGE_DECL_ATTRIBUTES (tree OLDDECL, tree + NEWDECL) + Define this target hook if the merging of decl attributes needs + special handling. If defined, the result is a list of the combined + `DECL_ATTRIBUTES' of OLDDECL and NEWDECL. NEWDECL is a duplicate + declaration of OLDDECL. Examples of when this is needed are when + one attribute overrides another, or when an attribute is nullified + by a subsequent definition. This function may call + `merge_attributes' to handle machine-independent merging. + + If the only target-specific handling you require is `dllimport' for + Windows targets, you should define the macro + `TARGET_DLLIMPORT_DECL_ATTRIBUTES'. This links in a function + called `merge_dllimport_decl_attributes' which can then be defined + as the expansion of `TARGET_MERGE_DECL_ATTRIBUTES'. This is done + in `i386/cygwin.h' and `i386/i386.c', for example. + + - Target Hook: void TARGET_INSERT_ATTRIBUTES (tree NODE, tree + *ATTR_PTR) + Define this target hook if you want to be able to add attributes + to a decl when it is being created. This is normally useful for + back ends which wish to implement a pragma by using the attributes + which correspond to the pragma's effect. The NODE argument is the + decl which is being created. The ATTR_PTR argument is a pointer + to the attribute list for this decl. The list itself should not + be modified, since it may be shared with other decls, but + attributes may be chained on the head of the list and `*ATTR_PTR' + modified to point to the new attributes, or a copy of the list may + be made if further changes are needed. + + - Target Hook: bool TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P (tree FNDECL) + This target hook returns `true' if it is ok to inline FNDECL into + the current function, despite its having target-specific + attributes, `false' otherwise. By default, if a function has a + target specific attribute attached to it, it will not be inlined. + +  + File: gccint.info, Node: Misc, Prev: Target Attributes, Up: Target Macros + + Miscellaneous Parameters + ======================== + + Here are several miscellaneous parameters. + + `PREDICATE_CODES' + Define this if you have defined special-purpose predicates in the + file `MACHINE.c'. This macro is called within an initializer of an + array of structures. The first field in the structure is the name + of a predicate and the second field is an array of rtl codes. For + each predicate, list all rtl codes that can be in expressions + matched by the predicate. The list should have a trailing comma. + Here is an example of two entries in the list for a typical RISC + machine: + + #define PREDICATE_CODES \ + {"gen_reg_rtx_operand", {SUBREG, REG}}, \ + {"reg_or_short_cint_operand", {SUBREG, REG, CONST_INT}}, + + Defining this macro does not affect the generated code (however, + incorrect definitions that omit an rtl code that may be matched by + the predicate can cause the compiler to malfunction). Instead, it + allows the table built by `genrecog' to be more compact and + efficient, thus speeding up the compiler. The most important + predicates to include in the list specified by this macro are + those used in the most insn patterns. + + For each predicate function named in `PREDICATE_CODES', a + declaration will be generated in `insn-codes.h'. + + `SPECIAL_MODE_PREDICATES' + Define this if you have special predicates that know special things + about modes. Genrecog will warn about certain forms of + `match_operand' without a mode; if the operand predicate is listed + in `SPECIAL_MODE_PREDICATES', the warning will be suppressed. + + Here is an example from the IA-32 port (`ext_register_operand' + specially checks for `HImode' or `SImode' in preparation for a + byte extraction from `%ah' etc.). + + #define SPECIAL_MODE_PREDICATES \ + "ext_register_operand", + + `CASE_VECTOR_MODE' + An alias for a machine mode name. This is the machine mode that + elements of a jump-table should have. + + `CASE_VECTOR_SHORTEN_MODE (MIN_OFFSET, MAX_OFFSET, BODY)' + Optional: return the preferred mode for an `addr_diff_vec' when + the minimum and maximum offset are known. If you define this, it + enables extra code in branch shortening to deal with + `addr_diff_vec'. To make this work, you also have to define + INSN_ALIGN and make the alignment for `addr_diff_vec' explicit. + The BODY argument is provided so that the offset_unsigned and scale + flags can be updated. + + `CASE_VECTOR_PC_RELATIVE' + Define this macro to be a C expression to indicate when jump-tables + should contain relative addresses. If jump-tables never contain + relative addresses, then you need not define this macro. + + `CASE_DROPS_THROUGH' + Define this if control falls through a `case' insn when the index + value is out of range. This means the specified default-label is + actually ignored by the `case' insn proper. + + `CASE_VALUES_THRESHOLD' + Define this to be the smallest number of different values for + which it is best to use a jump-table instead of a tree of + conditional branches. The default is four for machines with a + `casesi' instruction and five otherwise. This is best for most + machines. + + `WORD_REGISTER_OPERATIONS' + Define this macro if operations between registers with integral + mode smaller than a word are always performed on the entire + register. Most RISC machines have this property and most CISC + machines do not. + + `LOAD_EXTEND_OP (MODE)' + Define this macro to be a C expression indicating when insns that + read memory in MODE, an integral mode narrower than a word, set the + bits outside of MODE to be either the sign-extension or the + zero-extension of the data read. Return `SIGN_EXTEND' for values + of MODE for which the insn sign-extends, `ZERO_EXTEND' for which + it zero-extends, and `NIL' for other modes. + + This macro is not called with MODE non-integral or with a width + greater than or equal to `BITS_PER_WORD', so you may return any + value in this case. Do not define this macro if it would always + return `NIL'. On machines where this macro is defined, you will + normally define it as the constant `SIGN_EXTEND' or `ZERO_EXTEND'. + + `SHORT_IMMEDIATES_SIGN_EXTEND' + Define this macro if loading short immediate values into registers + sign extends. + + `FIXUNS_TRUNC_LIKE_FIX_TRUNC' + Define this macro if the same instructions that convert a floating + point number to a signed fixed point number also convert validly + to an unsigned one. + + `MOVE_MAX' + The maximum number of bytes that a single instruction can move + quickly between memory and registers or between two memory + locations. + + `MAX_MOVE_MAX' + The maximum number of bytes that a single instruction can move + quickly between memory and registers or between two memory + locations. If this is undefined, the default is `MOVE_MAX'. + Otherwise, it is the constant value that is the largest value that + `MOVE_MAX' can have at run-time. + + `SHIFT_COUNT_TRUNCATED' + A C expression that is nonzero if on this machine the number of + bits actually used for the count of a shift operation is equal to + the number of bits needed to represent the size of the object + being shifted. When this macro is nonzero, the compiler will + assume that it is safe to omit a sign-extend, zero-extend, and + certain bitwise `and' instructions that truncates the count of a + shift operation. On machines that have instructions that act on + bit-fields at variable positions, which may include `bit test' + instructions, a nonzero `SHIFT_COUNT_TRUNCATED' also enables + deletion of truncations of the values that serve as arguments to + bit-field instructions. + + If both types of instructions truncate the count (for shifts) and + position (for bit-field operations), or if no variable-position + bit-field instructions exist, you should define this macro. + + However, on some machines, such as the 80386 and the 680x0, + truncation only applies to shift operations and not the (real or + pretended) bit-field operations. Define `SHIFT_COUNT_TRUNCATED' + to be zero on such machines. Instead, add patterns to the `md' + file that include the implied truncation of the shift instructions. + + You need not define this macro if it would always have the value + of zero. + + `TRULY_NOOP_TRUNCATION (OUTPREC, INPREC)' + A C expression which is nonzero if on this machine it is safe to + "convert" an integer of INPREC bits to one of OUTPREC bits (where + OUTPREC is smaller than INPREC) by merely operating on it as if it + had only OUTPREC bits. + + On many machines, this expression can be 1. + + When `TRULY_NOOP_TRUNCATION' returns 1 for a pair of sizes for + modes for which `MODES_TIEABLE_P' is 0, suboptimal code can result. + If this is the case, making `TRULY_NOOP_TRUNCATION' return 0 in + such cases may improve things. + + `STORE_FLAG_VALUE' + A C expression describing the value returned by a comparison + operator with an integral mode and stored by a store-flag + instruction (`sCOND') when the condition is true. This + description must apply to _all_ the `sCOND' patterns and all the + comparison operators whose results have a `MODE_INT' mode. + + A value of 1 or -1 means that the instruction implementing the + comparison operator returns exactly 1 or -1 when the comparison is + true and 0 when the comparison is false. Otherwise, the value + indicates which bits of the result are guaranteed to be 1 when the + comparison is true. This value is interpreted in the mode of the + comparison operation, which is given by the mode of the first + operand in the `sCOND' pattern. Either the low bit or the sign + bit of `STORE_FLAG_VALUE' be on. Presently, only those bits are + used by the compiler. + + If `STORE_FLAG_VALUE' is neither 1 or -1, the compiler will + generate code that depends only on the specified bits. It can also + replace comparison operators with equivalent operations if they + cause the required bits to be set, even if the remaining bits are + undefined. For example, on a machine whose comparison operators + return an `SImode' value and where `STORE_FLAG_VALUE' is defined as + `0x80000000', saying that just the sign bit is relevant, the + expression + + (ne:SI (and:SI X (const_int POWER-OF-2)) (const_int 0)) + + can be converted to + + (ashift:SI X (const_int N)) + + where N is the appropriate shift count to move the bit being + tested into the sign bit. + + There is no way to describe a machine that always sets the + low-order bit for a true value, but does not guarantee the value + of any other bits, but we do not know of any machine that has such + an instruction. If you are trying to port GCC to such a machine, + include an instruction to perform a logical-and of the result with + 1 in the pattern for the comparison operators and let us know at + . + + Often, a machine will have multiple instructions that obtain a + value from a comparison (or the condition codes). Here are rules + to guide the choice of value for `STORE_FLAG_VALUE', and hence the + instructions to be used: + + * Use the shortest sequence that yields a valid definition for + `STORE_FLAG_VALUE'. It is more efficient for the compiler to + "normalize" the value (convert it to, e.g., 1 or 0) than for + the comparison operators to do so because there may be + opportunities to combine the normalization with other + operations. + + * For equal-length sequences, use a value of 1 or -1, with -1 + being slightly preferred on machines with expensive jumps and + 1 preferred on other machines. + + * As a second choice, choose a value of `0x80000001' if + instructions exist that set both the sign and low-order bits + but do not define the others. + + * Otherwise, use a value of `0x80000000'. + + Many machines can produce both the value chosen for + `STORE_FLAG_VALUE' and its negation in the same number of + instructions. On those machines, you should also define a pattern + for those cases, e.g., one matching + + (set A (neg:M (ne:M B C))) + + Some machines can also perform `and' or `plus' operations on + condition code values with less instructions than the corresponding + `sCOND' insn followed by `and' or `plus'. On those machines, + define the appropriate patterns. Use the names `incscc' and + `decscc', respectively, for the patterns which perform `plus' or + `minus' operations on condition code values. See `rs6000.md' for + some examples. The GNU Superoptizer can be used to find such + instruction sequences on other machines. + + You need not define `STORE_FLAG_VALUE' if the machine has no + store-flag instructions. + + `FLOAT_STORE_FLAG_VALUE (MODE)' + A C expression that gives a nonzero `REAL_VALUE_TYPE' value that is + returned when comparison operators with floating-point results are + true. Define this macro on machine that have comparison + operations that return floating-point values. If there are no + such operations, do not define this macro. + + `Pmode' + An alias for the machine mode for pointers. On most machines, + define this to be the integer mode corresponding to the width of a + hardware pointer; `SImode' on 32-bit machine or `DImode' on 64-bit + machines. On some machines you must define this to be one of the + partial integer modes, such as `PSImode'. + + The width of `Pmode' must be at least as large as the value of + `POINTER_SIZE'. If it is not equal, you must define the macro + `POINTERS_EXTEND_UNSIGNED' to specify how pointers are extended to + `Pmode'. + + `FUNCTION_MODE' + An alias for the machine mode used for memory references to + functions being called, in `call' RTL expressions. On most + machines this should be `QImode'. + + `INTEGRATE_THRESHOLD (DECL)' + A C expression for the maximum number of instructions above which + the function DECL should not be inlined. DECL is a + `FUNCTION_DECL' node. + + The default definition of this macro is 64 plus 8 times the number + of arguments that the function accepts. Some people think a larger + threshold should be used on RISC machines. + + `STDC_0_IN_SYSTEM_HEADERS' + In normal operation, the preprocessor expands `__STDC__' to the + constant 1, to signify that GCC conforms to ISO Standard C. On + some hosts, like Solaris, the system compiler uses a different + convention, where `__STDC__' is normally 0, but is 1 if the user + specifies strict conformance to the C Standard. + + Defining `STDC_0_IN_SYSTEM_HEADERS' makes GNU CPP follows the host + convention when processing system header files, but when + processing user files `__STDC__' will always expand to 1. + + `SCCS_DIRECTIVE' + Define this if the preprocessor should ignore `#sccs' directives + and print no error message. + + `NO_IMPLICIT_EXTERN_C' + Define this macro if the system header files support C++ as well + as C. This macro inhibits the usual method of using system header + files in C++, which is to pretend that the file's contents are + enclosed in `extern "C" {...}'. + + `HANDLE_PRAGMA (GETC, UNGETC, NAME)' + This macro is no longer supported. You must use + `REGISTER_TARGET_PRAGMAS' instead. + + `REGISTER_TARGET_PRAGMAS (PFILE)' + Define this macro if you want to implement any target-specific + pragmas. If defined, it is a C expression which makes a series of + calls to `cpp_register_pragma' for each pragma, with PFILE passed + as the first argument to to these functions. The macro may also + do any setup required for the pragmas. + + The primary reason to define this macro is to provide + compatibility with other compilers for the same target. In + general, we discourage definition of target-specific pragmas for + GCC. + + If the pragma can be implemented by attributes then you should + consider defining the target hook `TARGET_INSERT_ATTRIBUTES' as + well. + + Preprocessor macros that appear on pragma lines are not expanded. + All `#pragma' directives that do not match any registered pragma + are silently ignored, unless the user specifies + `-Wunknown-pragmas'. + + - Function: void cpp_register_pragma (cpp_reader *PFILE, const + char *SPACE, const char *NAME, void (*CALLBACK) + (cpp_reader *)) + Each call to `cpp_register_pragma' establishes one pragma. + The CALLBACK routine will be called when the preprocessor + encounters a pragma of the form + + #pragma [SPACE] NAME ... + + SPACE is the case-sensitive namespace of the pragma, or + `NULL' to put the pragma in the global namespace. The + callback routine receives PFILE as its first argument, which + can be passed on to cpplib's functions if necessary. You can + lex tokens after the NAME by calling `c_lex'. Tokens that + are not read by the callback will be silently ignored. The + end of the line is indicated by a token of type `CPP_EOF'. + + For an example use of this routine, see `c4x.h' and the + callback routines defined in `c4x-c.c'. + + Note that the use of `c_lex' is specific to the C and C++ + compilers. It will not work in the Java or Fortran + compilers, or any other language compilers for that matter. + Thus if `c_lex' is going to be called from target-specific + code, it must only be done so when building the C and C++ + compilers. This can be done by defining the variables + `c_target_objs' and `cxx_target_objs' in the target entry in + the `config.gcc' file. These variables should name the + target-specific, language-specific object file which contains + the code that uses `c_lex'. Note it will also be necessary + to add a rule to the makefile fragment pointed to by + `tmake_file' that shows how to build this object file. + + `HANDLE_SYSV_PRAGMA' + Define this macro (to a value of 1) if you want the System V style + pragmas `#pragma pack()' and `#pragma weak [=]' + to be supported by gcc. + + The pack pragma specifies the maximum alignment (in bytes) of + fields within a structure, in much the same way as the + `__aligned__' and `__packed__' `__attribute__'s do. A pack value + of zero resets the behavior to the default. + + The weak pragma only works if `SUPPORTS_WEAK' and + `ASM_WEAKEN_LABEL' are defined. If enabled it allows the creation + of specifically named weak labels, optionally with a value. + + `HANDLE_PRAGMA_PACK_PUSH_POP' + Define this macro (to a value of 1) if you want to support the + Win32 style pragmas `#pragma pack(push,N)' and `#pragma + pack(pop)'. The `pack(push,N)' pragma specifies the maximum + alignment (in bytes) of fields within a structure, in much the + same way as the `__aligned__' and `__packed__' `__attribute__'s + do. A pack value of zero resets the behavior to the default. + Successive invocations of this pragma cause the previous values to + be stacked, so that invocations of `#pragma pack(pop)' will return + to the previous value. + + `DOLLARS_IN_IDENTIFIERS' + Define this macro to control use of the character `$' in identifier + names. 0 means `$' is not allowed by default; 1 means it is + allowed. 1 is the default; there is no need to define this macro + in that case. This macro controls the compiler proper; it does + not affect the preprocessor. + + `NO_DOLLAR_IN_LABEL' + Define this macro if the assembler does not accept the character + `$' in label names. By default constructors and destructors in + G++ have `$' in the identifiers. If this macro is defined, `.' is + used instead. + + `NO_DOT_IN_LABEL' + Define this macro if the assembler does not accept the character + `.' in label names. By default constructors and destructors in G++ + have names that use `.'. If this macro is defined, these names + are rewritten to avoid `.'. + + `DEFAULT_MAIN_RETURN' + Define this macro if the target system expects every program's + `main' function to return a standard "success" value by default + (if no other value is explicitly returned). + + The definition should be a C statement (sans semicolon) to + generate the appropriate rtl instructions. It is used only when + compiling the end of `main'. + + `NEED_ATEXIT' + Define this if the target system lacks the function `atexit' from + the ISO C standard. If this macro is defined, a default definition + will be provided to support C++. If `ON_EXIT' is not defined, a + default `exit' function will also be provided. + + `ON_EXIT' + Define this macro if the target has another way to implement atexit + functionality without replacing `exit'. For instance, SunOS 4 has + a similar `on_exit' library function. + + The definition should be a functional macro which can be used just + like the `atexit' function. + + `EXIT_BODY' + Define this if your `exit' function needs to do something besides + calling an external function `_cleanup' before terminating with + `_exit'. The `EXIT_BODY' macro is only needed if `NEED_ATEXIT' is + defined and `ON_EXIT' is not defined. + + `INSN_SETS_ARE_DELAYED (INSN)' + Define this macro as a C expression that is nonzero if it is safe + for the delay slot scheduler to place instructions in the delay + slot of INSN, even if they appear to use a resource set or + clobbered in INSN. INSN is always a `jump_insn' or an `insn'; GCC + knows that every `call_insn' has this behavior. On machines where + some `insn' or `jump_insn' is really a function call and hence has + this behavior, you should define this macro. + + You need not define this macro if it would always return zero. + + `INSN_REFERENCES_ARE_DELAYED (INSN)' + Define this macro as a C expression that is nonzero if it is safe + for the delay slot scheduler to place instructions in the delay + slot of INSN, even if they appear to set or clobber a resource + referenced in INSN. INSN is always a `jump_insn' or an `insn'. + On machines where some `insn' or `jump_insn' is really a function + call and its operands are registers whose use is actually in the + subroutine it calls, you should define this macro. Doing so + allows the delay slot scheduler to move instructions which copy + arguments into the argument registers into the delay slot of INSN. + + You need not define this macro if it would always return zero. + + `MACHINE_DEPENDENT_REORG (INSN)' + In rare cases, correct code generation requires extra machine + dependent processing between the second jump optimization pass and + delayed branch scheduling. On those machines, define this macro + as a C statement to act on the code starting at INSN. + + `MULTIPLE_SYMBOL_SPACES' + Define this macro if in some cases global symbols from one + translation unit may not be bound to undefined symbols in another + translation unit without user intervention. For instance, under + Microsoft Windows symbols must be explicitly imported from shared + libraries (DLLs). + + `MD_ASM_CLOBBERS (CLOBBERS)' + A C statement that adds to CLOBBERS `STRING_CST' trees for any + hard regs the port wishes to automatically clobber for all asms. + + `MAX_INTEGER_COMPUTATION_MODE' + Define this to the largest integer machine mode which can be used + for operations other than load, store and copy operations. + + You need only define this macro if the target holds values larger + than `word_mode' in general purpose registers. Most targets + should not define this macro. + + `MATH_LIBRARY' + Define this macro as a C string constant for the linker argument + to link in the system math library, or `""' if the target does not + have a separate math library. + + You need only define this macro if the default of `"-lm"' is wrong. + + `LIBRARY_PATH_ENV' + Define this macro as a C string constant for the environment + variable that specifies where the linker should look for libraries. + + You need only define this macro if the default of `"LIBRARY_PATH"' + is wrong. + + `TARGET_HAS_F_SETLKW' + Define this macro if the target supports file locking with fcntl / + F_SETLKW. Note that this functionality is part of POSIX. + Defining `TARGET_HAS_F_SETLKW' will enable the test coverage code + to use file locking when exiting a program, which avoids race + conditions if the program has forked. + + `MAX_CONDITIONAL_EXECUTE' + A C expression for the maximum number of instructions to execute + via conditional execution instructions instead of a branch. A + value of `BRANCH_COST'+1 is the default if the machine does not + use cc0, and 1 if it does use cc0. + + `IFCVT_MODIFY_TESTS' + A C expression to modify the tests in `TRUE_EXPR', and + `FALSE_EXPR' for use in converting insns in `TEST_BB', `THEN_BB', + `ELSE_BB', and `JOIN_BB' basic blocks to conditional execution. + Set either `TRUE_EXPR' or `FALSE_EXPR' to a null pointer if the + tests cannot be converted. + + `IFCVT_MODIFY_INSN' + A C expression to modify the `PATTERN' of an `INSN' that is to be + converted to conditional execution format. + + `IFCVT_MODIFY_FINAL' + A C expression to perform any final machine dependent + modifications in converting code to conditional execution in the + basic blocks `TEST_BB', `THEN_BB', `ELSE_BB', and `JOIN_BB'. + + `IFCVT_MODIFY_CANCEL' + A C expression to cancel any machine dependent modifications in + converting code to conditional execution in the basic blocks + `TEST_BB', `THEN_BB', `ELSE_BB', and `JOIN_BB'. + + - Target Hook: void TARGET_INIT_BUILTINS () + Define this hook if you have any machine-specific built-in + functions that need to be defined. It should be a function that + performs the necessary setup. + + Machine specific built-in functions can be useful to expand + special machine instructions that would otherwise not normally be + generated because they have no equivalent in the source language + (for example, SIMD vector instructions or prefetch instructions). + + To create a built-in function, call the function `builtin_function' + which is defined by the language front end. You can use any type + nodes set up by `build_common_tree_nodes' and + `build_common_tree_nodes_2'; only language front ends that use + those two functions will call `TARGET_INIT_BUILTINS'. + + - Target Hook: rtx TARGET_EXPAND_BUILTIN (tree EXP, rtx TARGET, rtx + SUBTARGET, enum machine_mode MODE, int IGNORE) + Expand a call to a machine specific built-in function that was set + up by `TARGET_INIT_BUILTINS'. EXP is the expression for the + function call; the result should go to TARGET if that is + convenient, and have mode MODE if that is convenient. SUBTARGET + may be used as the target for computing one of EXP's operands. + IGNORE is nonzero if the value is to be ignored. This function + should return the result of the call to the built-in function. + + `MD_CAN_REDIRECT_BRANCH(BRANCH1, BRANCH2)' + Take a branch insn in BRANCH1 and another in BRANCH2. Return true + if redirecting BRANCH1 to the destination of BRANCH2 is possible. + + On some targets, branches may have a limited range. Optimizing the + filling of delay slots can result in branches being redirected, + and this may in turn cause a branch offset to overflow. + + `ALLOCATE_INITIAL_VALUE(HARD_REG)' + When the initial value of a hard register has been copied in a + pseudo register, it is often not necessary to actually allocate + another register to this pseudo register, because the original + hard register or a stack slot it has been saved into can be used. + `ALLOCATE_INITIAL_VALUE', if defined, is called at the start of + register allocation once for each hard register that had its + initial value copied by using `get_func_hard_reg_initial_val' or + `get_hard_reg_initial_val'. Possible values are `NULL_RTX', if + you don't want to do any special allocation, a `REG' rtx--that + would typically be the hard register itself, if it is known not to + be clobbered--or a `MEM'. If you are returning a `MEM', this is + only a hint for the allocator; it might decide to use another + register anyways. You may use `current_function_leaf_function' in + the definition of the macro, functions that use `REG_N_SETS', to + determine if the hard register in question will not be clobbered. + + `TARGET_OBJECT_SUFFIX' + Define this macro to be a C string representing the suffix for + object files on your target machine. If you do not define this + macro, GCC will use `.o' as the suffix for object files. + + `TARGET_EXECUTABLE_SUFFIX' + Define this macro to be a C string representing the suffix to be + automatically added to executable files on your target machine. + If you do not define this macro, GCC will use the null string as + the suffix for executable files. + + `COLLECT_EXPORT_LIST' + If defined, `collect2' will scan the individual object files + specified on its command line and create an export list for the + linker. Define this macro for systems like AIX, where the linker + discards object files that are not referenced from `main' and uses + export lists. + + + - Target Hook: bool TARGET_CANNOT_MODIFY_JUMPS_P (void) + This target hook returns `true' past the point in which new jump + instructions could be created. On machines that require a + register for every jump such as the SHmedia ISA of SH5, this point + would typically be reload, so this target hook should be defined + to a function such as: + + static bool + cannot_modify_jumps_past_reload_p () + { + return (reload_completed || reload_in_progress); + } + +  + File: gccint.info, Node: Host Config, Next: Fragments, Prev: Target Macros, Up: Top + + Host Configuration Headers + ************************** + + Host configuration headers contain macro definitions that describe + the machine and system on which the compiler is running. They are + usually unnecessary. Most of the things GCC needs to know about the + host system can be deduced by the `configure' script. + + If your host does need a special configuration header, it should be + named `xm-MACHINE.h', where MACHINE is a short mnemonic for the + machine. Here are some macros which this header can define. + + `VMS' + Define this macro if the host system is VMS. + + `FATAL_EXIT_CODE' + A C expression for the status code to be returned when the compiler + exits after serious errors. The default is the system-provided + macro `EXIT_FAILURE', or `1' if the system doesn't define that + macro. Define this macro only if these defaults are incorrect. + + `SUCCESS_EXIT_CODE' + A C expression for the status code to be returned when the compiler + exits without serious errors. (Warnings are not serious errors.) + The default is the system-provided macro `EXIT_SUCCESS', or `0' if + the system doesn't define that macro. Define this macro only if + these defaults are incorrect. + + `USE_C_ALLOCA' + Define this macro if GCC should use the C implementation of + `alloca' provided by `libiberty.a'. This only affects how some + parts of the compiler itself allocate memory. It does not change + code generation. + + When GCC is built with a compiler other than itself, the C `alloca' + is always used. This is because most other implementations have + serious bugs. You should define this macro only on a system where + no stack-based `alloca' can possibly work. For instance, if a + system has a small limit on the size of the stack, GCC's builtin + `alloca' will not work reliably. + + `HAVE_DOS_BASED_FILE_SYSTEM' + Define this macro if the host file system obeys the semantics + defined by MS-DOS instead of Unix. DOS file systems are case + insensitive, file specifications may begin with a drive letter, + and both forward slash and backslash (`/' and `\') are directory + separators. If you define this macro, you probably need to define + the next three macros too. + + `PATH_SEPARATOR' + If defined, this macro should expand to a character constant + specifying the separator for elements of search paths. The + default value is a colon (`:'). DOS-based systems usually use + semicolon (`;'). + + `DIR_SEPARATOR' + `DIR_SEPARATOR_2' + If defined, these macros expand to character constants specifying + separators for directory names within a file specification. They + are used somewhat inconsistently throughout the compiler. If your + system behaves like Unix (only forward slash separates pathnames), + define neither of them. If your system behaves like DOS (both + forward and backward slash can be used), define `DIR_SEPARATOR' to + `/' and `DIR_SEPARATOR_2' to `\'. + + `HOST_OBJECT_SUFFIX' + Define this macro to be a C string representing the suffix for + object files on your host machine. If you do not define this + macro, GCC will use `.o' as the suffix for object files. + + `HOST_EXECUTABLE_SUFFIX' + Define this macro to be a C string representing the suffix for + executable files on your host machine. If you do not define this + macro, GCC will use the null string as the suffix for executable + files. + + `HOST_BIT_BUCKET' + A pathname defined by the host operating system, which can be + opened as a file and written to, but all the information written + is discarded. This is commonly known as a "bit bucket" or "null + device". If you do not define this macro, GCC will use + `/dev/null' as the bit bucket. If the host does not support a bit + bucket, define this macro to an invalid filename. + + `COLLECT2_HOST_INITIALIZATION' + If defined, a C statement (sans semicolon) that performs + host-dependent initialization when `collect2' is being initialized. + + `GCC_DRIVER_HOST_INITIALIZATION' + If defined, a C statement (sans semicolon) that performs + host-dependent initialization when a compilation driver is being + initialized. + + `UPDATE_PATH_HOST_CANONICALIZE (PATH)' + If defined, a C statement (sans semicolon) that performs + host-dependent canonicalization when a path used in a compilation + driver or preprocessor is canonicalized. PATH is a malloc-ed path + to be canonicalized. If the C statement does canonicalize PATH + into a different buffer, the old path should be freed and the new + buffer should have been allocated with malloc. + + `DUMPFILE_FORMAT' + Define this macro to be a C string representing the format to use + for constructing the index part of debugging dump file names. The + resultant string must fit in fifteen bytes. The full filename + will be the concatenation of: the prefix of the assembler file + name, the string resulting from applying this format to an index + number, and a string unique to each dump file kind, e.g. `rtl'. + + If you do not define this macro, GCC will use `.%02d.'. You should + define this macro if using the default will create an invalid file + name. + + `SMALL_ARG_MAX' + Define this macro if the host system has a small limit on the total + size of an argument vector. This causes the driver to take more + care not to pass unnecessary arguments to subprocesses. + + In addition, if `configure' generates an incorrect definition of any + of the macros in `auto-host.h', you can override that definition in a + host configuration header. If you need to do this, first see if it is + possible to fix `configure'. + + If you need to define only a few of these macros, and they have + simple definitions, consider using the `xm_defines' variable in your + `config.gcc' entry instead of creating a host configuration header. + *Note System Config::. + +  + File: gccint.info, Node: Fragments, Next: Collect2, Prev: Host Config, Up: Top + + Makefile Fragments + ****************** + + When you configure GCC using the `configure' script, it will + construct the file `Makefile' from the template file `Makefile.in'. + When it does this, it can incorporate makefile fragments from the + `config' directory. These are used to set Makefile parameters that are + not amenable to being calculated by autoconf. The list of fragments to + incorporate is set by `config.gcc'; *Note System Config::. + + Fragments are named either `t-TARGET' or `x-HOST', depending on + whether they are relevant to configuring GCC to produce code for a + particular target, or to configuring GCC to run on a particular host. + Here TARGET and HOST are mnemonics which usually have some relationship + to the canonical system name, but no formal connection. + + If these files do not exist, it means nothing needs to be added for a + given target or host. Most targets need a few `t-TARGET' fragments, + but needing `x-HOST' fragments is rare. + + * Menu: + + * Target Fragment:: Writing `t-TARGET' files. + * Host Fragment:: Writing `x-HOST' files. + +  + File: gccint.info, Node: Target Fragment, Next: Host Fragment, Up: Fragments + + Target Makefile Fragments + ========================= + + Target makefile fragments can set these Makefile variables. + + `LIBGCC2_CFLAGS' + Compiler flags to use when compiling `libgcc2.c'. + + `LIB2FUNCS_EXTRA' + A list of source file names to be compiled or assembled and + inserted into `libgcc.a'. + + `Floating Point Emulation' + To have GCC include software floating point libraries in `libgcc.a' + define `FPBIT' and `DPBIT' along with a few rules as follows: + # We want fine grained libraries, so use the new code + # to build the floating point emulation libraries. + FPBIT = fp-bit.c + DPBIT = dp-bit.c + + + fp-bit.c: $(srcdir)/config/fp-bit.c + echo '#define FLOAT' > fp-bit.c + cat $(srcdir)/config/fp-bit.c >> fp-bit.c + + dp-bit.c: $(srcdir)/config/fp-bit.c + cat $(srcdir)/config/fp-bit.c > dp-bit.c + + You may need to provide additional #defines at the beginning of + `fp-bit.c' and `dp-bit.c' to control target endianness and other + options. + + `CRTSTUFF_T_CFLAGS' + Special flags used when compiling `crtstuff.c'. *Note + Initialization::. + + `CRTSTUFF_T_CFLAGS_S' + Special flags used when compiling `crtstuff.c' for shared linking. + Used if you use `crtbeginS.o' and `crtendS.o' in `EXTRA-PARTS'. + *Note Initialization::. + + `MULTILIB_OPTIONS' + For some targets, invoking GCC in different ways produces objects + that can not be linked together. For example, for some targets GCC + produces both big and little endian code. For these targets, you + must arrange for multiple versions of `libgcc.a' to be compiled, + one for each set of incompatible options. When GCC invokes the + linker, it arranges to link in the right version of `libgcc.a', + based on the command line options used. + + The `MULTILIB_OPTIONS' macro lists the set of options for which + special versions of `libgcc.a' must be built. Write options that + are mutually incompatible side by side, separated by a slash. + Write options that may be used together separated by a space. The + build procedure will build all combinations of compatible options. + + For example, if you set `MULTILIB_OPTIONS' to `m68000/m68020 + msoft-float', `Makefile' will build special versions of `libgcc.a' + using the following sets of options: `-m68000', `-m68020', + `-msoft-float', `-m68000 -msoft-float', and `-m68020 -msoft-float'. + + `MULTILIB_DIRNAMES' + If `MULTILIB_OPTIONS' is used, this variable specifies the + directory names that should be used to hold the various libraries. + Write one element in `MULTILIB_DIRNAMES' for each element in + `MULTILIB_OPTIONS'. If `MULTILIB_DIRNAMES' is not used, the + default value will be `MULTILIB_OPTIONS', with all slashes treated + as spaces. + + For example, if `MULTILIB_OPTIONS' is set to `m68000/m68020 + msoft-float', then the default value of `MULTILIB_DIRNAMES' is + `m68000 m68020 msoft-float'. You may specify a different value if + you desire a different set of directory names. + + `MULTILIB_MATCHES' + Sometimes the same option may be written in two different ways. + If an option is listed in `MULTILIB_OPTIONS', GCC needs to know + about any synonyms. In that case, set `MULTILIB_MATCHES' to a + list of items of the form `option=option' to describe all relevant + synonyms. For example, `m68000=mc68000 m68020=mc68020'. + + `MULTILIB_EXCEPTIONS' + Sometimes when there are multiple sets of `MULTILIB_OPTIONS' being + specified, there are combinations that should not be built. In + that case, set `MULTILIB_EXCEPTIONS' to be all of the switch + exceptions in shell case syntax that should not be built. + + For example, in the PowerPC embedded ABI support, it is not + desirable to build libraries compiled with the `-mcall-aix' option + and either of the `-fleading-underscore' or `-mlittle' options at + the same time. Therefore `MULTILIB_EXCEPTIONS' is set to + *mcall-aix/*fleading-underscore* *mlittle/*mcall-aix* + + `MULTILIB_EXTRA_OPTS' + Sometimes it is desirable that when building multiple versions of + `libgcc.a' certain options should always be passed on to the + compiler. In that case, set `MULTILIB_EXTRA_OPTS' to be the list + of options to be used for all builds. + +  + File: gccint.info, Node: Host Fragment, Prev: Target Fragment, Up: Fragments + + Host Makefile Fragments + ======================= + + The use of `x-HOST' fragments is discouraged. You should do so only + if there is no other mechanism to get the behavior desired. Host + fragments should never forcibly override variables set by the configure + script, as they may have been adjusted by the user. + + Variables provided for host fragments to set include: + + `X_CFLAGS' + `X_CPPFLAGS' + These are extra flags to pass to the C compiler and preprocessor, + respectively. They are used both when building GCC, and when + compiling things with the just-built GCC. + + `XCFLAGS' + These are extra flags to use when building the compiler. They are + not used when compiling `libgcc.a'. However, they _are_ used when + recompiling the compiler with itself in later stages of a + bootstrap. + + `BOOT_LDFLAGS' + Flags to be passed to the linker when recompiling the compiler with + itself in later stages of a bootstrap. You might need to use this + if, for instance, one of the front ends needs more text space than + the linker provides by default. + + `EXTRA_PROGRAMS' + A list of additional programs required to use the compiler on this + host, which should be compiled with GCC and installed alongside + the front ends. If you set this variable, you must also provide + rules to build the extra programs. + + +  + File: gccint.info, Node: Collect2, Next: Header Dirs, Prev: Fragments, Up: Top + + `collect2' + ********** + + GNU CC uses a utility called `collect2' on nearly all systems to + arrange to call various initialization functions at start time. + + The program `collect2' works by linking the program once and looking + through the linker output file for symbols with particular names + indicating they are constructor functions. If it finds any, it creates + a new temporary `.c' file containing a table of them, compiles it, and + links the program a second time including that file. + + The actual calls to the constructors are carried out by a subroutine + called `__main', which is called (automatically) at the beginning of + the body of `main' (provided `main' was compiled with GNU CC). Calling + `__main' is necessary, even when compiling C code, to allow linking C + and C++ object code together. (If you use `-nostdlib', you get an + unresolved reference to `__main', since it's defined in the standard + GCC library. Include `-lgcc' at the end of your compiler command line + to resolve this reference.) + + The program `collect2' is installed as `ld' in the directory where + the passes of the compiler are installed. When `collect2' needs to + find the _real_ `ld', it tries the following file names: + + * `real-ld' in the directories listed in the compiler's search + directories. + + * `real-ld' in the directories listed in the environment variable + `PATH'. + + * The file specified in the `REAL_LD_FILE_NAME' configuration macro, + if specified. + + * `ld' in the compiler's search directories, except that `collect2' + will not execute itself recursively. + + * `ld' in `PATH'. + + "The compiler's search directories" means all the directories where + `gcc' searches for passes of the compiler. This includes directories + that you specify with `-B'. + + Cross-compilers search a little differently: + + * `real-ld' in the compiler's search directories. + + * `TARGET-real-ld' in `PATH'. + + * The file specified in the `REAL_LD_FILE_NAME' configuration macro, + if specified. + + * `ld' in the compiler's search directories. + + * `TARGET-ld' in `PATH'. + + `collect2' explicitly avoids running `ld' using the file name under + which `collect2' itself was invoked. In fact, it remembers up a list + of such names--in case one copy of `collect2' finds another copy (or + version) of `collect2' installed as `ld' in a second place in the + search path. + + `collect2' searches for the utilities `nm' and `strip' using the + same algorithm as above for `ld'. + +  + File: gccint.info, Node: Header Dirs, Next: Funding, Prev: Collect2, Up: Top + + Standard Header File Directories + ******************************** + + `GCC_INCLUDE_DIR' means the same thing for native and cross. It is + where GNU CC stores its private include files, and also where GNU CC + stores the fixed include files. A cross compiled GNU CC runs + `fixincludes' on the header files in `$(tooldir)/include'. (If the + cross compilation header files need to be fixed, they must be installed + before GNU CC is built. If the cross compilation header files are + already suitable for ISO C and GNU CC, nothing special need be done). + + `GPLUSPLUS_INCLUDE_DIR' means the same thing for native and cross. + It is where `g++' looks first for header files. The C++ library + installs only target independent header files in that directory. + + `LOCAL_INCLUDE_DIR' is used only by native compilers. GNU CC + doesn't install anything there. It is normally `/usr/local/include'. + This is where local additions to a packaged system should place header + files. + + `CROSS_INCLUDE_DIR' is used only by cross compilers. GNU CC doesn't + install anything there. + + `TOOL_INCLUDE_DIR' is used for both native and cross compilers. It + is the place for other packages to install header files that GNU CC will + use. For a cross-compiler, this is the equivalent of `/usr/include'. + When you build a cross-compiler, `fixincludes' processes any header + files in this directory. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-21 gcc-3.2.3/gcc/doc/gccint.info-21 *** gcc-3.2.2/gcc/doc/gccint.info-21 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-21 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,847 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Funding, Next: GNU Project, Prev: Header Dirs, Up: Top + + Funding Free Software + ********************* + + If you want to have more free software a few years from now, it makes + sense for you to help encourage people to contribute funds for its + development. The most effective approach known is to encourage + commercial redistributors to donate. + + Users of free software systems can boost the pace of development by + encouraging for-a-fee distributors to donate part of their selling price + to free software developers--the Free Software Foundation, and others. + + The way to convince distributors to do this is to demand it and + expect it from them. So when you compare distributors, judge them + partly by how much they give to free software development. Show + distributors they must compete to be the one who gives the most. + + To make this approach work, you must insist on numbers that you can + compare, such as, "We will donate ten dollars to the Frobnitz project + for each disk sold." Don't be satisfied with a vague promise, such as + "A portion of the profits are donated," since it doesn't give a basis + for comparison. + + Even a precise fraction "of the profits from this disk" is not very + meaningful, since creative accounting and unrelated business decisions + can greatly alter what fraction of the sales price counts as profit. + If the price you pay is $50, ten percent of the profit is probably less + than a dollar; it might be a few cents, or nothing at all. + + Some redistributors do development work themselves. This is useful + too; but to keep everyone honest, you need to inquire how much they do, + and what kind. Some kinds of development make much more long-term + difference than others. For example, maintaining a separate version of + a program contributes very little; maintaining the standard version of a + program for the whole community contributes much. Easy new ports + contribute little, since someone else would surely do them; difficult + ports such as adding a new CPU to the GNU Compiler Collection + contribute more; major new features or packages contribute the most. + + By establishing the idea that supporting further development is "the + proper thing to do" when distributing free software for a fee, we can + assure a steady flow of resources into making more free software. + + Copyright (C) 1994 Free Software Foundation, Inc. + Verbatim copying and redistribution of this section is permitted + without royalty; alteration is not permitted. + +  + File: gccint.info, Node: GNU Project, Next: Copying, Prev: Funding, Up: Top + + The GNU Project and GNU/Linux + ***************************** + + The GNU Project was launched in 1984 to develop a complete Unix-like + operating system which is free software: the GNU system. (GNU is a + recursive acronym for "GNU's Not Unix"; it is pronounced "guh-NEW".) + Variants of the GNU operating system, which use the kernel Linux, are + now widely used; though these systems are often referred to as "Linux", + they are more accurately called GNU/Linux systems. + + For more information, see: + `http://www.gnu.org/' + `http://www.gnu.org/gnu/linux-and-gnu.html' + +  + File: gccint.info, Node: Copying, Next: GNU Free Documentation License, Prev: GNU Project, Up: Top + + GNU GENERAL PUBLIC LICENSE + ************************** + + Version 2, June 1991 + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + ======== + + The licenses for most software are designed to take away your + freedom to share and change it. By contrast, the GNU General Public + License is intended to guarantee your freedom to share and change free + software--to make sure the software is free for all its users. This + General Public License applies to most of the Free Software + Foundation's software and to any other program whose authors commit to + using it. (Some other Free Software Foundation software is covered by + the GNU Library General Public License instead.) You can apply it to + your programs, too. + + When we speak of free software, we are referring to freedom, not + price. Our General Public Licenses are designed to make sure that you + have the freedom to distribute copies of free software (and charge for + this service if you wish), that you receive source code or can get it + if you want it, that you can change the software or use pieces of it in + new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid + anyone to deny you these rights or to ask you to surrender the rights. + These restrictions translate to certain responsibilities for you if you + distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether + gratis or for a fee, you must give the recipients all the rights that + you have. You must make sure that they, too, receive or can get the + source code. And you must show them these terms so they know their + rights. + + We protect your rights with two steps: (1) copyright the software, + and (2) offer you this license which gives you legal permission to copy, + distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain + that everyone understands that there is no warranty for this free + software. If the software is modified by someone else and passed on, we + want its recipients to know that what they have is not the original, so + that any problems introduced by others will not reflect on the original + authors' reputations. + + Finally, any free program is threatened constantly by software + patents. We wish to avoid the danger that redistributors of a free + program will individually obtain patent licenses, in effect making the + program proprietary. To prevent this, we have made it clear that any + patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and + modification follow. + + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + 0. This License applies to any program or other work which contains a + notice placed by the copyright holder saying it may be distributed + under the terms of this General Public License. The "Program", + below, refers to any such program or work, and a "work based on + the Program" means either the Program or any derivative work under + copyright law: that is to say, a work containing the Program or a + portion of it, either verbatim or with modifications and/or + translated into another language. (Hereinafter, translation is + included without limitation in the term "modification".) Each + licensee is addressed as "you". + + Activities other than copying, distribution and modification are + not covered by this License; they are outside its scope. The act + of running the Program is not restricted, and the output from the + Program is covered only if its contents constitute a work based on + the Program (independent of having been made by running the + Program). Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's + source code as you receive it, in any medium, provided that you + conspicuously and appropriately publish on each copy an appropriate + copyright notice and disclaimer of warranty; keep intact all the + notices that refer to this License and to the absence of any + warranty; and give any other recipients of the Program a copy of + this License along with the Program. + + You may charge a fee for the physical act of transferring a copy, + and you may at your option offer warranty protection in exchange + for a fee. + + 2. You may modify your copy or copies of the Program or any portion + of it, thus forming a work based on the Program, and copy and + distribute such modifications or work under the terms of Section 1 + above, provided that you also meet all of these conditions: + + a. You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b. You must cause any work that you distribute or publish, that + in whole or in part contains or is derived from the Program + or any part thereof, to be licensed as a whole at no charge + to all third parties under the terms of this License. + + c. If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display + an announcement including an appropriate copyright notice and + a notice that there is no warranty (or else, saying that you + provide a warranty) and that users may redistribute the + program under these conditions, and telling the user how to + view a copy of this License. (Exception: if the Program + itself is interactive but does not normally print such an + announcement, your work based on the Program is not required + to print an announcement.) + + These requirements apply to the modified work as a whole. If + identifiable sections of that work are not derived from the + Program, and can be reasonably considered independent and separate + works in themselves, then this License, and its terms, do not + apply to those sections when you distribute them as separate + works. But when you distribute the same sections as part of a + whole which is a work based on the Program, the distribution of + the whole must be on the terms of this License, whose permissions + for other licensees extend to the entire whole, and thus to each + and every part regardless of who wrote it. + + Thus, it is not the intent of this section to claim rights or + contest your rights to work written entirely by you; rather, the + intent is to exercise the right to control the distribution of + derivative or collective works based on the Program. + + In addition, mere aggregation of another work not based on the + Program with the Program (or with a work based on the Program) on + a volume of a storage or distribution medium does not bring the + other work under the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, + under Section 2) in object code or executable form under the terms + of Sections 1 and 2 above provided that you also do one of the + following: + + a. Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of + Sections 1 and 2 above on a medium customarily used for + software interchange; or, + + b. Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a + medium customarily used for software interchange; or, + + c. Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with + such an offer, in accord with Subsection b above.) + + The source code for a work means the preferred form of the work for + making modifications to it. For an executable work, complete + source code means all the source code for all modules it contains, + plus any associated interface definition files, plus the scripts + used to control compilation and installation of the executable. + However, as a special exception, the source code distributed need + not include anything that is normally distributed (in either + source or binary form) with the major components (compiler, + kernel, and so on) of the operating system on which the executable + runs, unless that component itself accompanies the executable. + + If distribution of executable or object code is made by offering + access to copy from a designated place, then offering equivalent + access to copy the source code from the same place counts as + distribution of the source code, even though third parties are not + compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program + except as expressly provided under this License. Any attempt + otherwise to copy, modify, sublicense or distribute the Program is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 5. You are not required to accept this License, since you have not + signed it. However, nothing else grants you permission to modify + or distribute the Program or its derivative works. These actions + are prohibited by law if you do not accept this License. + Therefore, by modifying or distributing the Program (or any work + based on the Program), you indicate your acceptance of this + License to do so, and all its terms and conditions for copying, + distributing or modifying the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the + Program), the recipient automatically receives a license from the + original licensor to copy, distribute or modify the Program + subject to these terms and conditions. You may not impose any + further restrictions on the recipients' exercise of the rights + granted herein. You are not responsible for enforcing compliance + by third parties to this License. + + 7. If, as a consequence of a court judgment or allegation of patent + infringement or for any other reason (not limited to patent + issues), conditions are imposed on you (whether by court order, + agreement or otherwise) that contradict the conditions of this + License, they do not excuse you from the conditions of this + License. If you cannot distribute so as to satisfy simultaneously + your obligations under this License and any other pertinent + obligations, then as a consequence you may not distribute the + Program at all. For example, if a patent license would not permit + royalty-free redistribution of the Program by all those who + receive copies directly or indirectly through you, then the only + way you could satisfy both it and this License would be to refrain + entirely from distribution of the Program. + + If any portion of this section is held invalid or unenforceable + under any particular circumstance, the balance of the section is + intended to apply and the section as a whole is intended to apply + in other circumstances. + + It is not the purpose of this section to induce you to infringe any + patents or other property right claims or to contest validity of + any such claims; this section has the sole purpose of protecting + the integrity of the free software distribution system, which is + implemented by public license practices. Many people have made + generous contributions to the wide range of software distributed + through that system in reliance on consistent application of that + system; it is up to the author/donor to decide if he or she is + willing to distribute software through any other system and a + licensee cannot impose that choice. + + This section is intended to make thoroughly clear what is believed + to be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in + certain countries either by patents or by copyrighted interfaces, + the original copyright holder who places the Program under this + License may add an explicit geographical distribution limitation + excluding those countries, so that distribution is permitted only + in or among countries not thus excluded. In such case, this + License incorporates the limitation as if written in the body of + this License. + + 9. The Free Software Foundation may publish revised and/or new + versions of the General Public License from time to time. Such + new versions will be similar in spirit to the present version, but + may differ in detail to address new problems or concerns. + + Each version is given a distinguishing version number. If the + Program specifies a version number of this License which applies + to it and "any later version", you have the option of following + the terms and conditions either of that version or of any later + version published by the Free Software Foundation. If the Program + does not specify a version number of this License, you may choose + any version ever published by the Free Software Foundation. + + 10. If you wish to incorporate parts of the Program into other free + programs whose distribution conditions are different, write to the + author to ask for permission. For software which is copyrighted + by the Free Software Foundation, write to the Free Software + Foundation; we sometimes make exceptions for this. Our decision + will be guided by the two goals of preserving the free status of + all derivatives of our free software and of promoting the sharing + and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO + WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE + LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT + HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT + WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT + NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE + QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE + PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY + SERVICING, REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN + WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY + MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE + LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, + INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR + INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF + DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU + OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY + OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN + ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + ============================================= + + If you develop a new program, and you want it to be of the greatest + possible use to the public, the best way to achieve this is to make it + free software which everyone can redistribute and change under these + terms. + + To do so, attach the following notices to the program. It is safest + to attach them to the start of each source file to most effectively + convey the exclusion of warranty; and each file should have at least + the "copyright" line and a pointer to where the full notice is found. + + ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. + Copyright (C) YEAR NAME OF AUTHOR + + This program 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 2 of the License, or + (at your option) any later version. + + This program 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 this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. + + Also add information on how to contact you by electronic and paper + mail. + + If the program is interactive, make it output a short notice like + this when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) YEAR NAME OF AUTHOR + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details + type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + + The hypothetical commands `show w' and `show c' should show the + appropriate parts of the General Public License. Of course, the + commands you use may be called something other than `show w' and `show + c'; they could even be mouse-clicks or menu items--whatever suits your + program. + + You should also get your employer (if you work as a programmer) or + your school, if any, to sign a "copyright disclaimer" for the program, + if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + SIGNATURE OF TY COON, 1 April 1989 + Ty Coon, President of Vice + + This General Public License does not permit incorporating your + program into proprietary programs. If your program is a subroutine + library, you may consider it more useful to permit linking proprietary + applications with the library. If this is what you want to do, use the + GNU Library General Public License instead of this License. + +  + File: gccint.info, Node: GNU Free Documentation License, Next: Contributors, Prev: Copying, Up: Top + + GNU Free Documentation License + ****************************** + + Version 1.1, March 2000 + Copyright (C) 2000 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + 0. PREAMBLE + + The purpose of this License is to make a manual, textbook, or other + written document "free" in the sense of freedom: to assure everyone + the effective freedom to copy and redistribute it, with or without + modifying it, either commercially or noncommercially. Secondarily, + this License preserves for the author and publisher a way to get + credit for their work, while not being considered responsible for + modifications made by others. + + This License is a kind of "copyleft", which means that derivative + works of the document must themselves be free in the same sense. + It complements the GNU General Public License, which is a copyleft + license designed for free software. + + We have designed this License in order to use it for manuals for + free software, because free software needs free documentation: a + free program should come with manuals providing the same freedoms + that the software does. But this License is not limited to + software manuals; it can be used for any textual work, regardless + of subject matter or whether it is published as a printed book. + We recommend this License principally for works whose purpose is + instruction or reference. + + 1. APPLICABILITY AND DEFINITIONS + + This License applies to any manual or other work that contains a + notice placed by the copyright holder saying it can be distributed + under the terms of this License. The "Document", below, refers to + any such manual or work. Any member of the public is a licensee, + and is addressed as "you". + + A "Modified Version" of the Document means any work containing the + Document or a portion of it, either copied verbatim, or with + modifications and/or translated into another language. + + A "Secondary Section" is a named appendix or a front-matter + section of the Document that deals exclusively with the + relationship of the publishers or authors of the Document to the + Document's overall subject (or to related matters) and contains + nothing that could fall directly within that overall subject. + (For example, if the Document is in part a textbook of + mathematics, a Secondary Section may not explain any mathematics.) + The relationship could be a matter of historical connection with + the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + The "Invariant Sections" are certain Secondary Sections whose + titles are designated, as being those of Invariant Sections, in + the notice that says that the Document is released under this + License. + + The "Cover Texts" are certain short passages of text that are + listed, as Front-Cover Texts or Back-Cover Texts, in the notice + that says that the Document is released under this License. + + A "Transparent" copy of the Document means a machine-readable copy, + represented in a format whose specification is available to the + general public, whose contents can be viewed and edited directly + and straightforwardly with generic text editors or (for images + composed of pixels) generic paint programs or (for drawings) some + widely available drawing editor, and that is suitable for input to + text formatters or for automatic translation to a variety of + formats suitable for input to text formatters. A copy made in an + otherwise Transparent file format whose markup has been designed + to thwart or discourage subsequent modification by readers is not + Transparent. A copy that is not "Transparent" is called "Opaque". + + Examples of suitable formats for Transparent copies include plain + ASCII without markup, Texinfo input format, LaTeX input format, + SGML or XML using a publicly available DTD, and + standard-conforming simple HTML designed for human modification. + Opaque formats include PostScript, PDF, proprietary formats that + can be read and edited only by proprietary word processors, SGML + or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML produced by some word + processors for output purposes only. + + The "Title Page" means, for a printed book, the title page itself, + plus such following pages as are needed to hold, legibly, the + material this License requires to appear in the title page. For + works in formats which do not have any title page as such, "Title + Page" means the text near the most prominent appearance of the + work's title, preceding the beginning of the body of the text. + + 2. VERBATIM COPYING + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the + copyright notices, and the license notice saying this License + applies to the Document are reproduced in all copies, and that you + add no other conditions whatsoever to those of this License. You + may not use technical measures to obstruct or control the reading + or further copying of the copies you make or distribute. However, + you may accept compensation in exchange for copies. If you + distribute a large enough number of copies you must also follow + the conditions in section 3. + + You may also lend copies, under the same conditions stated above, + and you may publicly display copies. + + 3. COPYING IN QUANTITY + + If you publish printed copies of the Document numbering more than + 100, and the Document's license notice requires Cover Texts, you + must enclose the copies in covers that carry, clearly and legibly, + all these Cover Texts: Front-Cover Texts on the front cover, and + Back-Cover Texts on the back cover. Both covers must also clearly + and legibly identify you as the publisher of these copies. The + front cover must present the full title with all words of the + title equally prominent and visible. You may add other material + on the covers in addition. Copying with changes limited to the + covers, as long as they preserve the title of the Document and + satisfy these conditions, can be treated as verbatim copying in + other respects. + + If the required texts for either cover are too voluminous to fit + legibly, you should put the first ones listed (as many as fit + reasonably) on the actual cover, and continue the rest onto + adjacent pages. + + If you publish or distribute Opaque copies of the Document + numbering more than 100, you must either include a + machine-readable Transparent copy along with each Opaque copy, or + state in or with each Opaque copy a publicly-accessible + computer-network location containing a complete Transparent copy + of the Document, free of added material, which the general + network-using public has access to download anonymously at no + charge using public-standard network protocols. If you use the + latter option, you must take reasonably prudent steps, when you + begin distribution of Opaque copies in quantity, to ensure that + this Transparent copy will remain thus accessible at the stated + location until at least one year after the last time you + distribute an Opaque copy (directly or through your agents or + retailers) of that edition to the public. + + It is requested, but not required, that you contact the authors of + the Document well before redistributing any large number of + copies, to give them a chance to provide you with an updated + version of the Document. + + 4. MODIFICATIONS + + You may copy and distribute a Modified Version of the Document + under the conditions of sections 2 and 3 above, provided that you + release the Modified Version under precisely this License, with + the Modified Version filling the role of the Document, thus + licensing distribution and modification of the Modified Version to + whoever possesses a copy of it. In addition, you must do these + things in the Modified Version: + + A. Use in the Title Page (and on the covers, if any) a title + distinct from that of the Document, and from those of + previous versions (which should, if there were any, be listed + in the History section of the Document). You may use the + same title as a previous version if the original publisher of + that version gives permission. + + B. List on the Title Page, as authors, one or more persons or + entities responsible for authorship of the modifications in + the Modified Version, together with at least five of the + principal authors of the Document (all of its principal + authors, if it has less than five). + + C. State on the Title page the name of the publisher of the + Modified Version, as the publisher. + + D. Preserve all the copyright notices of the Document. + + E. Add an appropriate copyright notice for your modifications + adjacent to the other copyright notices. + + F. Include, immediately after the copyright notices, a license + notice giving the public permission to use the Modified + Version under the terms of this License, in the form shown in + the Addendum below. + + G. Preserve in that license notice the full lists of Invariant + Sections and required Cover Texts given in the Document's + license notice. + + H. Include an unaltered copy of this License. + + I. Preserve the section entitled "History", and its title, and + add to it an item stating at least the title, year, new + authors, and publisher of the Modified Version as given on + the Title Page. If there is no section entitled "History" in + the Document, create one stating the title, year, authors, + and publisher of the Document as given on its Title Page, + then add an item describing the Modified Version as stated in + the previous sentence. + + J. Preserve the network location, if any, given in the Document + for public access to a Transparent copy of the Document, and + likewise the network locations given in the Document for + previous versions it was based on. These may be placed in + the "History" section. You may omit a network location for a + work that was published at least four years before the + Document itself, or if the original publisher of the version + it refers to gives permission. + + K. In any section entitled "Acknowledgments" or "Dedications", + preserve the section's title, and preserve in the section all + the substance and tone of each of the contributor + acknowledgments and/or dedications given therein. + + L. Preserve all the Invariant Sections of the Document, + unaltered in their text and in their titles. Section numbers + or the equivalent are not considered part of the section + titles. + + M. Delete any section entitled "Endorsements". Such a section + may not be included in the Modified Version. + + N. Do not retitle any existing section as "Endorsements" or to + conflict in title with any Invariant Section. + + If the Modified Version includes new front-matter sections or + appendices that qualify as Secondary Sections and contain no + material copied from the Document, you may at your option + designate some or all of these sections as invariant. To do this, + add their titles to the list of Invariant Sections in the Modified + Version's license notice. These titles must be distinct from any + other section titles. + + You may add a section entitled "Endorsements", provided it contains + nothing but endorsements of your Modified Version by various + parties--for example, statements of peer review or that the text + has been approved by an organization as the authoritative + definition of a standard. + + You may add a passage of up to five words as a Front-Cover Text, + and a passage of up to 25 words as a Back-Cover Text, to the end + of the list of Cover Texts in the Modified Version. Only one + passage of Front-Cover Text and one of Back-Cover Text may be + added by (or through arrangements made by) any one entity. If the + Document already includes a cover text for the same cover, + previously added by you or by arrangement made by the same entity + you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous + publisher that added the old one. + + The author(s) and publisher(s) of the Document do not by this + License give permission to use their names for publicity for or to + assert or imply endorsement of any Modified Version. + + 5. COMBINING DOCUMENTS + + You may combine the Document with other documents released under + this License, under the terms defined in section 4 above for + modified versions, provided that you include in the combination + all of the Invariant Sections of all of the original documents, + unmodified, and list them all as Invariant Sections of your + combined work in its license notice. + + The combined work need only contain one copy of this License, and + multiple identical Invariant Sections may be replaced with a single + copy. If there are multiple Invariant Sections with the same name + but different contents, make the title of each such section unique + by adding at the end of it, in parentheses, the name of the + original author or publisher of that section if known, or else a + unique number. Make the same adjustment to the section titles in + the list of Invariant Sections in the license notice of the + combined work. + + In the combination, you must combine any sections entitled + "History" in the various original documents, forming one section + entitled "History"; likewise combine any sections entitled + "Acknowledgments", and any sections entitled "Dedications". You + must delete all sections entitled "Endorsements." + + 6. COLLECTIONS OF DOCUMENTS + + You may make a collection consisting of the Document and other + documents released under this License, and replace the individual + copies of this License in the various documents with a single copy + that is included in the collection, provided that you follow the + rules of this License for verbatim copying of each of the + documents in all other respects. + + You may extract a single document from such a collection, and + distribute it individually under this License, provided you insert + a copy of this License into the extracted document, and follow + this License in all other respects regarding verbatim copying of + that document. + + 7. AGGREGATION WITH INDEPENDENT WORKS + + A compilation of the Document or its derivatives with other + separate and independent documents or works, in or on a volume of + a storage or distribution medium, does not as a whole count as a + Modified Version of the Document, provided no compilation + copyright is claimed for the compilation. Such a compilation is + called an "aggregate", and this License does not apply to the + other self-contained works thus compiled with the Document, on + account of their being thus compiled, if they are not themselves + derivative works of the Document. + + If the Cover Text requirement of section 3 is applicable to these + copies of the Document, then if the Document is less than one + quarter of the entire aggregate, the Document's Cover Texts may be + placed on covers that surround only the Document within the + aggregate. Otherwise they must appear on covers around the whole + aggregate. + + 8. TRANSLATION + + Translation is considered a kind of modification, so you may + distribute translations of the Document under the terms of section + 4. Replacing Invariant Sections with translations requires special + permission from their copyright holders, but you may include + translations of some or all Invariant Sections in addition to the + original versions of these Invariant Sections. You may include a + translation of this License provided that you also include the + original English version of this License. In case of a + disagreement between the translation and the original English + version of this License, the original English version will prevail. + + 9. TERMINATION + + You may not copy, modify, sublicense, or distribute the Document + except as expressly provided for under this License. Any other + attempt to copy, modify, sublicense or distribute the Document is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 10. FUTURE REVISIONS OF THIS LICENSE + + The Free Software Foundation may publish new, revised versions of + the GNU Free Documentation License from time to time. Such new + versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. See + `http://www.gnu.org/copyleft/'. + + Each version of the License is given a distinguishing version + number. If the Document specifies that a particular numbered + version of this License "or any later version" applies to it, you + have the option of following the terms and conditions either of + that specified version or of any later version that has been + published (not as a draft) by the Free Software Foundation. If + the Document does not specify a version number of this License, + you may choose any version ever published (not as a draft) by the + Free Software Foundation. + + ADDENDUM: How to use this License for your documents + ==================================================== + + To use this License in a document you have written, include a copy of + the License in the document and put the following copyright and license + notices just after the title page: + + Copyright (C) YEAR YOUR NAME. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 + or any later version published by the Free Software Foundation; + with the Invariant Sections being LIST THEIR TITLES, with the + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. + A copy of the license is included in the section entitled ``GNU + Free Documentation License''. + + If you have no Invariant Sections, write "with no Invariant Sections" + instead of saying which ones are invariant. If you have no Front-Cover + Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being + LIST"; likewise for Back-Cover Texts. + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of + free software license, such as the GNU General Public License, to + permit their use in free software. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-22 gcc-3.2.3/gcc/doc/gccint.info-22 *** gcc-3.2.2/gcc/doc/gccint.info-22 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-22 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,885 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Contributors, Next: Option Index, Prev: GNU Free Documentation License, Up: Top + + Contributors to GCC + ******************* + + The GCC project would like to thank its many contributors. Without + them the project would not have been nearly as successful as it has + been. Any omissions in this list are accidental. Feel free to contact + if you have been left out or some of your + contributions are not listed. Please keep this list in alphabetical + order. + + * Analog Devices helped implement the support for complex data types + and iterators. + + * John David Anglin for threading-related fixes and improvements to + libstdc++-v3, and the HP-UX port. + + * James van Artsdalen wrote the code that makes efficient use of the + Intel 80387 register stack. + + * Alasdair Baird for various bugfixes. + + * Gerald Baumgartner added the signature extension to the C++ front + end. + + * Godmar Back for his Java improvements and encouragement. + + * Scott Bambrough for help porting the Java compiler. + + * Jon Beniston for his Win32 port of Java. + + * Geoff Berry for his Java object serialization work and various + patches. + + * Eric Blake for helping to make GCJ and libgcj conform to the + specifications. + + * Hans-J. Boehm for his garbage collector, IA-64 libffi port, and + other Java work. + + * Neil Booth for work on cpplib, lang hooks, debug hooks and other + miscellaneous clean-ups. + + * Per Bothner for his direction via the steering committee and + various improvements to our infrastructure for supporting new + languages. Chill front end implementation. Initial + implementations of cpplib, fix-header, config.guess, libio, and + past C++ library (libg++) maintainer. Dreaming up, designing and + implementing much of GCJ. + + * Devon Bowen helped port GCC to the Tahoe. + + * Don Bowman for mips-vxworks contributions. + + * Dave Brolley for work on cpplib and Chill. + + * Robert Brown implemented the support for Encore 32000 systems. + + * Christian Bruel for improvements to local store elimination. + + * Herman A.J. ten Brugge for various fixes. + + * Joerg Brunsmann for Java compiler hacking and help with the GCJ + FAQ. + + * Joe Buck for his direction via the steering committee. + + * Craig Burley for leadership of the Fortran effort. + + * Stephan Buys for contributing Doxygen notes for libstdc++. + + * Paolo Carlini for libstdc++ work: lots of efficiency improvements + to the string class, hard detective work on the frustrating + localization issues, and keeping up with the problem reports. + + * John Carr for his alias work, SPARC hacking, infrastructure + improvements, previous contributions to the steering committee, + loop optimizations, etc. + + * Steve Chamberlain for support for the Hitachi SH and H8 processors + and the PicoJava processor, and for GCJ config fixes. + + * Glenn Chambers for help with the GCJ FAQ. + + * John-Marc Chandonia for various libgcj patches. + + * Scott Christley for his Objective-C contributions. + + * Eric Christopher for his Java porting help and clean-ups. + + * Branko Cibej for more warning contributions. + + * The GNU Classpath project for all of their merged runtime code. + + * Nick Clifton for arm, mcore, fr30, v850, m32r work, `--help', and + other random hacking. + + * Michael Cook for libstdc++ cleanup patches to reduce warnings. + + * Ralf Corsepius for SH testing and minor bugfixing. + + * Stan Cox for care and feeding of the x86 port and lots of behind + the scenes hacking. + + * Alex Crain provided changes for the 3b1. + + * Ian Dall for major improvements to the NS32k port. + + * Dario Dariol contributed the four varieties of sample programs + that print a copy of their source. + + * Russell Davidson for fstream and stringstream fixes in libstdc++. + + * Mo DeJong for GCJ and libgcj bug fixes. + + * Gabriel Dos Reis for contributions to g++, contributions and + maintenance of GCC diagnostics infrastructure, libstdc++-v3, + including valarray<>, complex<>, maintaining the numerics library + (including that pesky :-) and keeping up-to-date anything + to do with numbers. + + * Ulrich Drepper for his work on glibc, testing of GCC using glibc, + ISO C99 support, CFG dumping support, etc., plus support of the + C++ runtime libraries including for all kinds of C interface + issues, contributing and maintaining complex<>, sanity checking + and disbursement, configuration architecture, libio maintenance, + and early math work. + + * Richard Earnshaw for his ongoing work with the ARM. + + * David Edelsohn for his direction via the steering committee, + ongoing work with the RS6000/PowerPC port, help cleaning up Haifa + loop changes, and for doing the entire AIX port of libstdc++ with + his bare hands. + + * Kevin Ediger for the floating point formatting of num_put::do_put + in libstdc++. + + * Phil Edwards for libstdc++ work including configuration hackery, + documentation maintainer, chief breaker of the web pages, the + occasional iostream bugfix, and work on shared library symbol + versioning. + + * Paul Eggert for random hacking all over GCC. + + * Mark Elbrecht for various DJGPP improvements, and for libstdc++ + configuration support for locales and fstream-related fixes. + + * Vadim Egorov for libstdc++ fixes in strings, streambufs, and + iostreams. + + * Ben Elliston for his work to move the Objective-C runtime into its + own subdirectory and for his work on autoconf. + + * Marc Espie for OpenBSD support. + + * Doug Evans for much of the global optimization framework, arc, + m32r, and SPARC work. + + * Fred Fish for BeOS support and Ada fixes. + + * Ivan Fontes Garcia for the Portugese translation of the GCJ FAQ. + + * Peter Gerwinski for various bugfixes and the Pascal front end. + + * Kaveh Ghazi for his direction via the steering committee and + amazing work to make `-W -Wall' useful. + + * John Gilmore for a donation to the FSF earmarked improving GNU + Java. + + * Judy Goldberg for c++ contributions. + + * Torbjorn Granlund for various fixes and the c-torture testsuite, + multiply- and divide-by-constant optimization, improved long long + support, improved leaf function register allocation, and his + direction via the steering committee. + + * Anthony Green for his `-Os' contributions and Java front end work. + + * Stu Grossman for gdb hacking, allowing GCJ developers to debug our + code. + + * Michael K. Gschwind contributed the port to the PDP-11. + + * Ron Guilmette implemented the `protoize' and `unprotoize' tools, + the support for Dwarf symbolic debugging information, and much of + the support for System V Release 4. He has also worked heavily on + the Intel 386 and 860 support. + + * Bruno Haible for improvements in the runtime overhead for EH, new + warnings and assorted bugfixes. + + * Andrew Haley for his amazing Java compiler and library efforts. + + * Chris Hanson assisted in making GCC work on HP-UX for the 9000 + series 300. + + * Michael Hayes for various thankless work he's done trying to get + the c30/c40 ports functional. Lots of loop and unroll + improvements and fixes. + + * Kate Hedstrom for staking the g77 folks with an initial testsuite. + + * Richard Henderson for his ongoing SPARC, alpha, and ia32 work, loop + opts, and generally fixing lots of old problems we've ignored for + years, flow rewrite and lots of further stuff, including reviewing + tons of patches. + + * Nobuyuki Hikichi of Software Research Associates, Tokyo, + contributed the support for the Sony NEWS machine. + + * Manfred Hollstein for his ongoing work to keep the m88k alive, lots + of testing an bugfixing, particularly of our configury code. + + * Steve Holmgren for MachTen patches. + + * Jan Hubicka for his x86 port improvements. + + * Christian Iseli for various bugfixes. + + * Kamil Iskra for general m68k hacking. + + * Lee Iverson for random fixes and MIPS testing. + + * Andreas Jaeger for various fixes to the MIPS port + + * Jakub Jelinek for his SPARC work and sibling call optimizations as + well as lots of bug fixes and test cases, and for improving the + Java build system. + + * Janis Johnson for ia64 testing and fixes and for her quality + improvement sidetracks. + + * J. Kean Johnston for OpenServer support. + + * Tim Josling for the sample language treelang based originally on + Richard Kenner's ""toy" language". + + * Nicolai Josuttis for additional libstdc++ documentation. + + * Klaus Kaempf for his ongoing work to make alpha-vms a viable + target. + + * David Kashtan of SRI adapted GCC to VMS. + + * Ryszard Kabatek for many, many libstdc++ bugfixes and + optimizations of strings, especially member functions, and for + auto_ptr fixes. + + * Geoffrey Keating for his ongoing work to make the PPC work for + GNU/Linux and his automatic regression tester. + + * Brendan Kehoe for his ongoing work with g++ and for a lot of early + work in just about every part of libstdc++. + + * Oliver M. Kellogg of Deutsche Aerospace contributed the port to the + MIL-STD-1750A. + + * Richard Kenner of the New York University Ultracomputer Research + Laboratory wrote the machine descriptions for the AMD 29000, the + DEC Alpha, the IBM RT PC, and the IBM RS/6000 as well as the + support for instruction attributes. He also made changes to + better support RISC processors including changes to common + subexpression elimination, strength reduction, function calling + sequence handling, and condition code support, in addition to + generalizing the code for frame pointer elimination and delay slot + scheduling. Richard Kenner was also the head maintainer of GCC + for several years. + + * Mumit Khan for various contributions to the Cygwin and Mingw32 + ports and maintaining binary releases for Windows hosts, and for + massive libstdc++ porting work to Cygwin/Mingw32. + + * Robin Kirkham for cpu32 support. + + * Mark Klein for PA improvements. + + * Thomas Koenig for various bugfixes. + + * Bruce Korb for the new and improved fixincludes code. + + * Benjamin Kosnik for his g++ work and for leading the libstdc++-v3 + effort. + + * Charles LaBrec contributed the support for the Integrated Solutions + 68020 system. + + * Jeff Law for his direction via the steering committee, + coordinating the entire egcs project and GCC 2.95, rolling out + snapshots and releases, handling merges from GCC2, reviewing tons + of patches that might have fallen through the cracks else, and + random but extensive hacking. + + * Marc Lehmann for his direction via the steering committee and + helping with analysis and improvements of x86 performance. + + * Ted Lemon wrote parts of the RTL reader and printer. + + * Kriang Lerdsuwanakij for improvements to demangler and various c++ + fixes. + + * Warren Levy for tremendous work on libgcj (Java Runtime Library) + and random work on the Java front end. + + * Alain Lichnewsky ported GCC to the MIPS CPU. + + * Oskar Liljeblad for hacking on AWT and his many Java bug reports + and patches. + + * Robert Lipe for OpenServer support, new testsuites, testing, etc. + + * Weiwen Liu for testing and various bugfixes. + + * Dave Love for his ongoing work with the Fortran front end and + runtime libraries. + + * Martin von Lo"wis for internal consistency checking infrastructure, + various C++ improvements including namespace support, and tons of + assistance with libstdc++/compiler merges. + + * H.J. Lu for his previous contributions to the steering committee, + many x86 bug reports, prototype patches, and keeping the GNU/Linux + ports working. + + * Greg McGary for random fixes and (someday) bounded pointers. + + * Andrew MacLeod for his ongoing work in building a real EH system, + various code generation improvements, work on the global + optimizer, etc. + + * Vladimir Makarov for hacking some ugly i960 problems, PowerPC + hacking improvements to compile-time performance, overall + knowledge and direction in the area of instruction scheduling, and + design and implementation of the automaton based instruction + scheduler. + + * Bob Manson for his behind the scenes work on dejagnu. + + * Philip Martin for lots of libstdc++ string and vector iterator + fixes and improvements, and string clean up and testsuites. + + * All of the Mauve project contributors, for Java test code. + + * Bryce McKinlay for numerous GCJ and libgcj fixes and improvements. + + * Adam Megacz for his work on the Win32 port of GCJ. + + * Michael Meissner for LRS framework, ia32, m32r, v850, m88k, MIPS, + powerpc, haifa, ECOFF debug support, and other assorted hacking. + + * Jason Merrill for his direction via the steering committee and + leading the g++ effort. + + * David Miller for his direction via the steering committee, lots of + SPARC work, improvements in jump.c and interfacing with the Linux + kernel developers. + + * Gary Miller ported GCC to Charles River Data Systems machines. + + * Alfred Minarik for libstdc++ string and ios bugfixes, and turning + the entire libstdc++ testsuite namespace-compatible. + + * Mark Mitchell for his direction via the steering committee, + mountains of C++ work, load/store hoisting out of loops, alias + analysis improvements, ISO C `restrict' support, and serving as + release manager for GCC 3.x. + + * Alan Modra for various GNU/Linux bits and testing. + + * Toon Moene for his direction via the steering committee, Fortran + maintenance, and his ongoing work to make us make Fortran run fast. + + * Jason Molenda for major help in the care and feeding of all the + services on the gcc.gnu.org (formerly egcs.cygnus.com) + machine--mail, web services, ftp services, etc etc. Doing all + this work on scrap paper and the backs of envelopes would have + been... difficult. + + * Catherine Moore for fixing various ugly problems we have sent her + way, including the haifa bug which was killing the Alpha & PowerPC + Linux kernels. + + * Mike Moreton for his various Java patches. + + * David Mosberger-Tang for various Alpha improvements. + + * Stephen Moshier contributed the floating point emulator that + assists in cross-compilation and permits support for floating + point numbers wider than 64 bits and for ISO C99 support. + + * Bill Moyer for his behind the scenes work on various issues. + + * Philippe De Muyter for his work on the m68k port. + + * Joseph S. Myers for his work on the PDP-11 port, format checking + and ISO C99 support, and continuous emphasis on (and contributions + to) documentation. + + * Nathan Myers for his work on libstdc++-v3: architecture and + authorship through the first three snapshots, including + implementation of locale infrastructure, string, shadow C headers, + and the initial project documentation (DESIGN, CHECKLIST, and so + forth). Later, more work on MT-safe string and shadow headers. + + * Felix Natter for documentation on porting libstdc++. + + * NeXT, Inc. donated the front end that supports the Objective-C + language. + + * Hans-Peter Nilsson for the CRIS and MMIX ports, improvements to + the search engine setup, various documentation fixes and other + small fixes. + + * Geoff Noer for this work on getting cygwin native builds working. + + * David O'Brien for the FreeBSD/alpha, FreeBSD/AMD x86-64, + FreeBSD/ARM, FreeBSD/PowerPC, and FreeBSD/SPARC64 ports and + related infrastructure improvements. + + * Alexandre Oliva for various build infrastructure improvements, + scripts and amazing testing work, including keeping libtool issues + sane and happy. + + * Melissa O'Neill for various NeXT fixes. + + * Rainer Orth for random MIPS work, including improvements to our o32 + ABI support, improvements to dejagnu's MIPS support, Java + configuration clean-ups and porting work, etc. + + * Paul Petersen wrote the machine description for the Alliant FX/8. + + * Alexandre Petit-Bianco for implementing much of the Java compiler + and continued Java maintainership. + + * Matthias Pfaller for major improvements to the NS32k port. + + * Gerald Pfeifer for his direction via the steering committee, + pointing out lots of problems we need to solve, maintenance of the + web pages, and taking care of documentation maintenance in general. + + * Ovidiu Predescu for his work on the Objective-C front end and + runtime libraries. + + * Ken Raeburn for various improvements to checker, MIPS ports and + various cleanups in the compiler. + + * Rolf W. Rasmussen for hacking on AWT. + + * David Reese of Sun Microsystems contributed to the Solaris on + PowerPC port. + + * Joern Rennecke for maintaining the sh port, loop, regmove & reload + hacking. + + * Loren J. Rittle for improvements to libstdc++-v3 including the + FreeBSD port, threading fixes, thread-related configury changes, + critical threading documentation, and solutions to really tricky + I/O problems. + + * Craig Rodrigues for processing tons of bug reports. + + * Gavin Romig-Koch for lots of behind the scenes MIPS work. + + * Ken Rose for fixes to our delay slot filling code. + + * Paul Rubin wrote most of the preprocessor. + + * Chip Salzenberg for libstdc++ patches and improvements to locales, + traits, Makefiles, libio, libtool hackery, and "long long" support. + + * Juha Sarlin for improvements to the H8 code generator. + + * Greg Satz assisted in making GCC work on HP-UX for the 9000 series + 300. + + * Bradley Schatz for his work on the GCJ FAQ. + + * Peter Schauer wrote the code to allow debugging to work on the + Alpha. + + * William Schelter did most of the work on the Intel 80386 support. + + * Bernd Schmidt for various code generation improvements and major + work in the reload pass as well a serving as release manager for + GCC 2.95.3. + + * Peter Schmid for constant testing of libstdc++ - especially + application testing, going above and beyond what was requested for + the release criteria - and libstdc++ header file tweaks. + + * Jason Schroeder for jcf-dump patches. + + * Andreas Schwab for his work on the m68k port. + + * Joel Sherrill for his direction via the steering committee, RTEMS + contributions and RTEMS testing. + + * Nathan Sidwell for many C++ fixes/improvements. + + * Jeffrey Siegal for helping RMS with the original design of GCC, + some code which handles the parse tree and RTL data structures, + constant folding and help with the original VAX & m68k ports. + + * Kenny Simpson for prompting libstdc++ fixes due to defect reports + from the LWG (thereby keeping us in line with updates from the + ISO). + + * Franz Sirl for his ongoing work with making the PPC port stable + for linux. + + * Andrey Slepuhin for assorted AIX hacking. + + * Christopher Smith did the port for Convex machines. + + * Randy Smith finished the Sun FPA support. + + * Scott Snyder for queue, iterator, istream, and string fixes and + libstdc++ testsuite entries. + + * Brad Spencer for contributions to the GLIBCPP_FORCE_NEW technique. + + * Richard Stallman, for writing the original gcc and launching the + GNU project. + + * Jan Stein of the Chalmers Computer Society provided support for + Genix, as well as part of the 32000 machine description. + + * Nigel Stephens for various mips16 related fixes/improvements. + + * Jonathan Stone wrote the machine description for the Pyramid + computer. + + * Graham Stott for various infrastructure improvements. + + * John Stracke for his Java HTTP protocol fixes. + + * Mike Stump for his Elxsi port, g++ contributions over the years + and more recently his vxworks contributions + + * Jeff Sturm for Java porting help, bug fixes, and encouragement. + + * Shigeya Suzuki for this fixes for the bsdi platforms. + + * Ian Lance Taylor for his mips16 work, general configury hacking, + fixincludes, etc. + + * Holger Teutsch provided the support for the Clipper CPU. + + * Gary Thomas for his ongoing work to make the PPC work for + GNU/Linux. + + * Philipp Thomas for random bugfixes throughout the compiler + + * Jason Thorpe for thread support in libstdc++ on NetBSD. + + * Kresten Krab Thorup wrote the run time support for the Objective-C + language and the fantastic Java bytecode interpreter. + + * Michael Tiemann for random bugfixes, the first instruction + scheduler, initial C++ support, function integration, NS32k, SPARC + and M88k machine description work, delay slot scheduling. + + * Andreas Tobler for his work porting libgcj to Darwin. + + * Teemu Torma for thread safe exception handling support. + + * Leonard Tower wrote parts of the parser, RTL generator, and RTL + definitions, and of the VAX machine description. + + * Tom Tromey for internationalization support and for his many Java + contributions and libgcj maintainership. + + * Lassi Tuura for improvements to config.guess to determine HP + processor types. + + * Petter Urkedal for libstdc++ CXXFLAGS, math, and algorithms fixes. + + * Brent Verner for work with the libstdc++ cshadow files and their + associated configure steps. + + * Todd Vierling for contributions for NetBSD ports. + + * Jonathan Wakely for contributing libstdc++ Doxygen notes and XHTML + guidance. + + * Dean Wakerley for converting the install documentation from HTML + to texinfo in time for GCC 3.0. + + * Krister Walfridsson for random bugfixes. + + * Stephen M. Webb for time and effort on making libstdc++ shadow + files work with the tricky Solaris 8+ headers, and for pushing the + build-time header tree. + + * John Wehle for various improvements for the x86 code generator, + related infrastructure improvements to help x86 code generation, + value range propagation and other work, WE32k port. + + * Zack Weinberg for major work on cpplib and various other bugfixes. + + * Matt Welsh for help with Linux Threads support in GCJ. + + * Urban Widmark for help fixing java.io. + + * Mark Wielaard for new Java library code and his work integrating + with Classpath. + + * Dale Wiles helped port GCC to the Tahoe. + + * Bob Wilson from Tensilica, Inc. for the Xtensa port. + + * Jim Wilson for his direction via the steering committee, tackling + hard problems in various places that nobody else wanted to work + on, strength reduction and other loop optimizations. + + * Carlo Wood for various fixes. + + * Tom Wood for work on the m88k port. + + * Masanobu Yuhara of Fujitsu Laboratories implemented the machine + description for the Tron architecture (specifically, the Gmicro). + + * Kevin Zachmann helped ported GCC to the Tahoe. + + * Gilles Zunino for help porting Java to Irix. + + + We'd also like to thank the folks who have contributed time and + energy in testing GCC: + + * Michael Abd-El-Malek + + * Thomas Arend + + * Bonzo Armstrong + + * Steven Ashe + + * Chris Baldwin + + * David Billinghurst + + * Jim Blandy + + * Stephane Bortzmeyer + + * Horst von Brand + + * Frank Braun + + * Rodney Brown + + * Joe Buck + + * Craig Burley + + * Sidney Cadot + + * Bradford Castalia + + * Ralph Doncaster + + * Ulrich Drepper + + * David Edelsohn + + * Richard Emberson + + * Levente Farkas + + * Graham Fawcett + + * Robert A. French + + * Jo"rgen Freyh + + * Mark K. Gardner + + * Charles-Antoine Gauthier + + * Yung Shing Gene + + * Kaveh Ghazi + + * David Gilbert + + * Simon Gornall + + * Fred Gray + + * John Griffin + + * Patrik Hagglund + + * Phil Hargett + + * Amancio Hasty + + * Bryan W. Headley + + * Kate Hedstrom + + * Richard Henderson + + * Kevin B. Hendricks + + * Manfred Hollstein + + * Kamil Iskra + + * Joep Jansen + + * Christian Joensson + + * David Kidd + + * Tobias Kuipers + + * Anand Krishnaswamy + + * Jeff Law + + * Robert Lipe + + * llewelly + + * Damon Love + + * Dave Love + + * H.J. Lu + + * Brad Lucier + + * Mumit Khan + + * Matthias Klose + + * Martin Knoblauch + + * Jesse Macnish + + * David Miller + + * Toon Moene + + * Stefan Morrell + + * Anon A. Mous + + * Matthias Mueller + + * Pekka Nikander + + * Alexandre Oliva + + * Jon Olson + + * Magnus Persson + + * Chris Pollard + + * Richard Polton + + * David Rees + + * Paul Reilly + + * Tom Reilly + + * Loren J. Rittle + + * Torsten Rueger + + * Danny Sadinoff + + * Marc Schifer + + * Peter Schmid + + * David Schuler + + * Vin Shelton + + * Franz Sirl + + * Tim Souder + + * Mike Stump + + * Adam Sulmicki + + * George Talbot + + * Gregory Warnes + + * Carlo Wood + + * David E. Young + + * And many others + + And finally we'd like to thank everyone who uses the compiler, + submits bug reports and generally reminds us why we're doing this work + in the first place. + +  + File: gccint.info, Node: Option Index, Next: Index, Prev: Contributors, Up: Top + + Option Index + ************ + + GCC's command line options are indexed here without any initial `-' + or `--'. Where an option has both positive and negative forms (such as + `-fOPTION' and `-fno-OPTION'), relevant entries in the manual are + indexed under the most appropriate form; it may sometimes be useful to + look up both forms. + + * Menu: + + * dB: Passes. + * dc: Passes. + * dd: Passes. + * dE: Passes. + * de: Passes. + * df: Passes. + * dg: Passes. + * dG: Passes. + * di: Passes. + * dj: Passes. + * dk: Passes. + * dl: Passes. + * dL: Passes. + * dN: Passes. + * dR: Passes. + * dr: Passes. + * dS: Passes. + * ds: Passes. + * dt: Passes. + * dW: Passes. + * dX: Passes. + * frerun-cse-after-loop: Passes. + * fssa: Passes. + * fssa-ccp: Passes. + * fssa-dce: Passes. + * fthread-jumps: Passes. + * msoft-float: Interface. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-23 gcc-3.2.3/gcc/doc/gccint.info-23 *** gcc-3.2.2/gcc/doc/gccint.info-23 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-23 Tue Apr 22 07:07:20 2003 *************** *** 0 **** --- 1,2119 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Index, Prev: Option Index, Up: Top + + Index + ***** + + * Menu: + + * ! in constraint: Multi-Alternative. + * # in constraint: Modifiers. + * # in template: Output Template. + * #pragma: Misc. + * % in constraint: Modifiers. + * % in template: Output Template. + * & in constraint: Modifiers. + * (nil): RTL Objects. + * * in constraint: Modifiers. + * * in template: Output Statement. + * + in constraint: Modifiers. + * /c in RTL dump: Flags. + * /f in RTL dump: Flags. + * /i in RTL dump: Flags. + * /j in RTL dump: Flags. + * /s in RTL dump: Flags. + * /u in RTL dump: Flags. + * /v in RTL dump: Flags. + * 0 in constraint: Simple Constraints. + * < in constraint: Simple Constraints. + * = in constraint: Modifiers. + * > in constraint: Simple Constraints. + * ? in constraint: Multi-Alternative. + * \: Output Template. + * __builtin_args_info: Varargs. + * __builtin_classify_type: Varargs. + * __builtin_next_arg: Varargs. + * __builtin_saveregs: Varargs. + * __CTOR_LIST__: Initialization. + * __DTOR_LIST__: Initialization. + * __main: Collect2. + * abort: Portability. + * abs: Arithmetic. + * abs and attributes: Expressions. + * absM2 instruction pattern: Standard Names. + * absolute value: Arithmetic. + * access to operands: Accessors. + * accessors: Accessors. + * ACCUMULATE_OUTGOING_ARGS: Stack Arguments. + * ACCUMULATE_OUTGOING_ARGS and stack frames: Function Entry. + * ADA_LONG_TYPE_SIZE: Type Layout. + * ADDITIONAL_REGISTER_NAMES: Instruction Output. + * addM3 instruction pattern: Standard Names. + * addr_diff_vec: Side Effects. + * addr_diff_vec, length of: Insn Lengths. + * ADDR_EXPR: Expression trees. + * addr_vec: Side Effects. + * addr_vec, length of: Insn Lengths. + * address constraints: Simple Constraints. + * ADDRESS_COST: Costs. + * address_operand: Simple Constraints. + * addressing modes: Addressing Modes. + * addressof: Regs and Memory. + * ADJUST_FIELD_ALIGN: Storage Layout. + * ADJUST_INSN_LENGTH: Insn Lengths. + * aggregates as return values: Aggregate Return. + * ALL_REGS: Register Classes. + * ALLOCATE_INITIAL_VALUE: Misc. + * allocate_stack instruction pattern: Standard Names. + * ALLOCATE_TRAMPOLINE: Trampolines. + * analysis, data flow: Passes. + * and: Arithmetic. + * and and attributes: Expressions. + * and, canonicalization of: Insn Canonicalizations. + * andM3 instruction pattern: Standard Names. + * APPLY_RESULT_SIZE: Scalar Return. + * ARG_POINTER_CFA_OFFSET: Frame Layout. + * ARG_POINTER_REGNUM: Frame Registers. + * ARG_POINTER_REGNUM and virtual registers: Regs and Memory. + * arg_pointer_rtx: Frame Registers. + * ARGS_GROW_DOWNWARD: Frame Layout. + * argument passing: Interface. + * arguments in registers: Register Arguments. + * arguments on stack: Stack Arguments. + * arithmetic libraries: Interface. + * arithmetic shift: Arithmetic. + * arithmetic simplifications: Passes. + * arithmetic, in RTL: Arithmetic. + * ARITHMETIC_TYPE_P: Types. + * array: Types. + * ARRAY_REF: Expression trees. + * ARRAY_TYPE: Types. + * ashift: Arithmetic. + * ashift and attributes: Expressions. + * ashiftrt: Arithmetic. + * ashiftrt and attributes: Expressions. + * ashlM3 instruction pattern: Standard Names. + * ashrM3 instruction pattern: Standard Names. + * ASM_APP_OFF: File Framework. + * ASM_APP_ON: File Framework. + * ASM_CLOBBERS: Function Bodies. + * ASM_COMMENT_START: File Framework. + * ASM_CV_QUAL: Function Bodies. + * ASM_DECLARE_CLASS_REFERENCE: Label Output. + * ASM_DECLARE_FUNCTION_NAME: Label Output. + * ASM_DECLARE_FUNCTION_SIZE: Label Output. + * ASM_DECLARE_OBJECT_NAME: Label Output. + * ASM_DECLARE_REGISTER_GLOBAL: Label Output. + * ASM_DECLARE_UNRESOLVED_REFERENCE: Label Output. + * ASM_FILE_END: File Framework. + * ASM_FILE_START: File Framework. + * ASM_FINAL_SPEC: Driver. + * ASM_FINISH_DECLARE_OBJECT: Label Output. + * ASM_FORMAT_PRIVATE_NAME: Label Output. + * asm_fprintf: Instruction Output. + * ASM_FPRINTF_EXTENSIONS: Instruction Output. + * ASM_GENERATE_INTERNAL_LABEL: Label Output. + * ASM_GLOBALIZE_LABEL: Label Output. + * asm_input: Side Effects. + * ASM_INPUTS: Function Bodies. + * ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX: Exception Handling. + * ASM_NO_SKIP_IN_TEXT: Alignment Output. + * asm_noperands: Insns. + * asm_operands, RTL sharing: Sharing. + * asm_operands, usage: Assembler. + * ASM_OUTPUT_ADDR_DIFF_ELT: Dispatch Tables. + * ASM_OUTPUT_ADDR_VEC_ELT: Dispatch Tables. + * ASM_OUTPUT_ALIGN: Alignment Output. + * ASM_OUTPUT_ALIGNED_BSS: Uninitialized Data. + * ASM_OUTPUT_ALIGNED_COMMON: Uninitialized Data. + * ASM_OUTPUT_ALIGNED_DECL_COMMON: Uninitialized Data. + * ASM_OUTPUT_ALIGNED_DECL_LOCAL: Uninitialized Data. + * ASM_OUTPUT_ALIGNED_LOCAL: Uninitialized Data. + * ASM_OUTPUT_ALTERNATE_LABEL_NAME: Label Output. + * ASM_OUTPUT_ASCII: Data Output. + * ASM_OUTPUT_BSS: Uninitialized Data. + * ASM_OUTPUT_CASE_END: Dispatch Tables. + * ASM_OUTPUT_CASE_LABEL: Dispatch Tables. + * ASM_OUTPUT_COMMON: Uninitialized Data. + * ASM_OUTPUT_DEBUG_LABEL: Label Output. + * ASM_OUTPUT_DEF: Label Output. + * ASM_OUTPUT_DEF_FROM_DECLS: Label Output. + * ASM_OUTPUT_DEFINE_LABEL_DIFFERENCE_SYMBOL: Label Output. + * ASM_OUTPUT_EXTERNAL: Label Output. + * ASM_OUTPUT_EXTERNAL_LIBCALL: Label Output. + * ASM_OUTPUT_FDESC: Data Output. + * ASM_OUTPUT_IDENT: File Framework. + * ASM_OUTPUT_INTERNAL_LABEL: Label Output. + * ASM_OUTPUT_LABEL: Label Output. + * ASM_OUTPUT_LABEL_REF: Label Output. + * ASM_OUTPUT_LABELREF: Label Output. + * ASM_OUTPUT_LOCAL: Uninitialized Data. + * ASM_OUTPUT_MAX_SKIP_ALIGN: Alignment Output. + * ASM_OUTPUT_MI_THUNK: Function Entry. + * ASM_OUTPUT_OPCODE: Instruction Output. + * ASM_OUTPUT_POOL_EPILOGUE: Data Output. + * ASM_OUTPUT_POOL_PROLOGUE: Data Output. + * ASM_OUTPUT_REG_POP: Instruction Output. + * ASM_OUTPUT_REG_PUSH: Instruction Output. + * ASM_OUTPUT_SHARED_BSS: Uninitialized Data. + * ASM_OUTPUT_SHARED_COMMON: Uninitialized Data. + * ASM_OUTPUT_SHARED_LOCAL: Uninitialized Data. + * ASM_OUTPUT_SKIP: Alignment Output. + * ASM_OUTPUT_SOURCE_FILENAME: File Framework. + * ASM_OUTPUT_SOURCE_LINE: File Framework. + * ASM_OUTPUT_SPECIAL_POOL_ENTRY: Data Output. + * ASM_OUTPUT_SYMBOL_REF: Label Output. + * ASM_OUTPUT_WEAK_ALIAS: Label Output. + * ASM_OUTPUTS: Function Bodies. + * ASM_PREFERRED_EH_DATA_FORMAT: Exception Handling. + * ASM_SPEC: Driver. + * ASM_STABD_OP: DBX Options. + * ASM_STABN_OP: DBX Options. + * ASM_STABS_OP: DBX Options. + * ASM_STMT: Function Bodies. + * ASM_STRING: Function Bodies. + * ASM_WEAKEN_DECL: Label Output. + * ASM_WEAKEN_LABEL: Label Output. + * assemble_name: Label Output. + * assembler format: File Framework. + * assembler instructions in RTL: Assembler. + * ASSEMBLER_DIALECT: Instruction Output. + * assigning attribute values to insns: Tagging Insns. + * assignment operator: Function Basics. + * asterisk in template: Output Statement. + * atof: Cross-compilation. + * attr <1>: Tagging Insns. + * attr: Expressions. + * attr_flag: Expressions. + * attribute expressions: Expressions. + * attribute specifications: Attr Example. + * attribute specifications example: Attr Example. + * attributes: Attributes. + * attributes, defining: Defining Attributes. + * attributes, target-specific: Target Attributes. + * autoincrement addressing, availability: Portability. + * autoincrement/decrement addressing: Simple Constraints. + * autoincrement/decrement analysis: Passes. + * AVOID_CCMODE_COPIES: Values in Registers. + * backslash: Output Template. + * barrier: Insns. + * BASE_REG_CLASS: Register Classes. + * basic block reordering: Passes. + * basic blocks: Passes. + * bCOND instruction pattern: Standard Names. + * bcopy, implicit usage: Library Calls. + * BIGGEST_ALIGNMENT: Storage Layout. + * BIGGEST_FIELD_ALIGNMENT: Storage Layout. + * BImode: Machine Modes. + * BIND_EXPR: Expression trees. + * BINFO_TYPE: Classes. + * bit-fields: Bit-Fields. + * BIT_AND_EXPR: Expression trees. + * BIT_IOR_EXPR: Expression trees. + * BIT_NOT_EXPR: Expression trees. + * BIT_XOR_EXPR: Expression trees. + * BITFIELD_NBYTES_LIMITED: Storage Layout. + * BITS_BIG_ENDIAN: Storage Layout. + * BITS_BIG_ENDIAN, effect on sign_extract: Bit-Fields. + * BITS_PER_UNIT: Storage Layout. + * BITS_PER_WORD: Storage Layout. + * bitwise complement: Arithmetic. + * bitwise exclusive-or: Arithmetic. + * bitwise inclusive-or: Arithmetic. + * bitwise logical-and: Arithmetic. + * BLKmode: Machine Modes. + * BLKmode, and function return values: Calls. + * BOOL_TYPE_SIZE: Type Layout. + * BOOLEAN_TYPE: Types. + * branch shortening: Passes. + * BRANCH_COST: Costs. + * break_out_memory_refs: Addressing Modes. + * BREAK_STMT: Function Bodies. + * BSS_SECTION_ASM_OP: Sections. + * builtin_longjmp instruction pattern: Standard Names. + * BUILTIN_SETJMP_FRAME_VALUE: Frame Layout. + * builtin_setjmp_receiver instruction pattern: Standard Names. + * builtin_setjmp_setup instruction pattern: Standard Names. + * byte_mode: Machine Modes. + * BYTES_BIG_ENDIAN: Storage Layout. + * BYTES_BIG_ENDIAN, effect on subreg: Regs and Memory. + * bzero, implicit usage: Library Calls. + * C statements for assembler output: Output Statement. + * C/C++ Internal Representation: Trees. + * C4X_FLOAT_FORMAT: Storage Layout. + * call <1>: Side Effects. + * call: Flags. + * call instruction pattern: Standard Names. + * call usage: Calls. + * call, in insn_list: Flags. + * call-clobbered register: Register Basics. + * call-saved register: Register Basics. + * call-used register: Register Basics. + * CALL_EXPR: Expression trees. + * call_insn: Insns. + * call_insn and /j: Flags. + * call_insn and /u: Flags. + * CALL_INSN_FUNCTION_USAGE: Insns. + * call_pop instruction pattern: Standard Names. + * CALL_POPS_ARGS: Stack Arguments. + * CALL_REALLY_USED_REGISTERS: Register Basics. + * CALL_USED_REGISTERS: Register Basics. + * call_used_regs: Register Basics. + * call_value instruction pattern: Standard Names. + * call_value_pop instruction pattern: Standard Names. + * CALLER_SAVE_PROFITABLE: Caller Saves. + * calling conventions: Stack and Calling. + * calling functions in RTL: Calls. + * CAN_DEBUG_WITHOUT_FP: Run-time Target. + * CAN_ELIMINATE: Elimination. + * canadian: Configure Terms. + * canonicalization of instructions: Insn Canonicalizations. + * CANONICALIZE_COMPARISON: Condition Code. + * canonicalize_funcptr_for_compare instruction pattern: Standard Names. + * CASE_DROPS_THROUGH: Misc. + * CASE_VALUES_THRESHOLD: Misc. + * CASE_VECTOR_MODE: Misc. + * CASE_VECTOR_PC_RELATIVE: Misc. + * CASE_VECTOR_SHORTEN_MODE: Misc. + * casesi instruction pattern: Standard Names. + * cc0: Regs and Memory. + * cc0, RTL sharing: Sharing. + * cc0_rtx: Regs and Memory. + * CC1_SPEC: Driver. + * CC1PLUS_SPEC: Driver. + * cc_status: Condition Code. + * CC_STATUS_MDEP: Condition Code. + * CC_STATUS_MDEP_INIT: Condition Code. + * CCmode: Machine Modes. + * CDImode: Machine Modes. + * change_address: Standard Names. + * CHAR_TYPE_SIZE: Type Layout. + * CHECK_FLOAT_VALUE: Storage Layout. + * check_stack instruction pattern: Standard Names. + * CHImode: Machine Modes. + * class: Classes. + * class definitions, register: Register Classes. + * class preference constraints: Class Preferences. + * CLASS_LIKELY_SPILLED_P: Register Classes. + * CLASS_MAX_NREGS: Register Classes. + * CLASS_TYPE_P: Types. + * classes of RTX codes: RTL Classes. + * CLASSTYPE_DECLARED_CLASS: Classes. + * CLASSTYPE_HAS_MUTABLE: Classes. + * CLASSTYPE_NON_POD_P: Classes. + * CLEANUP_DECL: Function Bodies. + * CLEANUP_EXPR: Function Bodies. + * CLEANUP_POINT_EXPR: Expression trees. + * CLEANUP_STMT: Function Bodies. + * CLEAR_INSN_CACHE: Trampolines. + * clobber: Side Effects. + * clrstrM instruction pattern: Standard Names. + * cmpM instruction pattern: Standard Names. + * cmpstrM instruction pattern: Standard Names. + * code generation RTL sequences: Expander Definitions. + * code motion: Passes. + * code_label: Insns. + * code_label and /i: Flags. + * CODE_LABEL_NUMBER: Insns. + * codes, RTL expression: RTL Objects. + * COImode: Machine Modes. + * COLLECT2_HOST_INITIALIZATION: Host Config. + * COLLECT_EXPORT_LIST: Misc. + * combiner pass: Regs and Memory. + * common subexpression elimination: Passes. + * compare: Arithmetic. + * compare, canonicalization of: Insn Canonicalizations. + * compiler passes and files: Passes. + * complement, bitwise: Arithmetic. + * COMPLEX_CST: Expression trees. + * COMPLEX_EXPR: Expression trees. + * COMPLEX_TYPE: Types. + * COMPONENT_REF: Expression trees. + * COMPOUND_BODY: Function Bodies. + * COMPOUND_EXPR: Expression trees. + * COMPOUND_LITERAL_EXPR: Expression trees. + * COMPOUND_LITERAL_EXPR_DECL: Expression trees. + * COMPOUND_LITERAL_EXPR_DECL_STMT: Expression trees. + * COMPOUND_STMT: Function Bodies. + * computing the length of an insn: Insn Lengths. + * cond: Comparisons. + * cond and attributes: Expressions. + * cond_exec: Side Effects. + * COND_EXPR: Expression trees. + * condition code register: Regs and Memory. + * condition code status: Condition Code. + * condition codes: Comparisons. + * conditional constant propagation: Passes. + * Conditional Constant Propagation, SSA based: Passes. + * conditional execution: Conditional Execution. + * CONDITIONAL_REGISTER_USAGE: Register Basics. + * conditional_trap instruction pattern: Standard Names. + * conditions, in patterns: Patterns. + * configuration file: Host Config. + * configure terms: Configure Terms. + * CONJ_EXPR: Expression trees. + * CONST0_RTX: Constants. + * const0_rtx: Constants. + * CONST1_RTX: Constants. + * const1_rtx: Constants. + * CONST2_RTX: Constants. + * const2_rtx: Constants. + * CONST_COSTS: Costs. + * CONST_DECL: Declarations. + * const_double: Constants. + * const_double, RTL sharing: Sharing. + * CONST_DOUBLE_CHAIN: Constants. + * CONST_DOUBLE_LOW: Constants. + * CONST_DOUBLE_MEM: Constants. + * CONST_DOUBLE_OK_FOR_LETTER_P: Register Classes. + * const_int: Constants. + * const_int and attribute tests: Expressions. + * const_int and attributes: Expressions. + * const_int, RTL sharing: Sharing. + * CONST_OK_FOR_LETTER_P: Register Classes. + * CONST_OR_PURE_CALL_P: Flags. + * const_string: Constants. + * const_string and attributes: Expressions. + * const_true_rtx: Constants. + * const_vector: Constants. + * const_vector, RTL sharing: Sharing. + * constant attributes: Constant Attributes. + * constant definitions: Constant Definitions. + * constant folding: Passes. + * constant folding and floating point: Cross-compilation. + * constant propagation: Passes. + * CONSTANT_ADDRESS_P: Addressing Modes. + * CONSTANT_AFTER_FUNCTION_P: Data Output. + * CONSTANT_ALIGNMENT: Storage Layout. + * CONSTANT_P: Addressing Modes. + * CONSTANT_POOL_ADDRESS_P: Flags. + * CONSTANT_POOL_BEFORE_FUNCTION: Data Output. + * constants in constraints: Simple Constraints. + * constm1_rtx: Constants. + * constraint modifier characters: Modifiers. + * constraint, matching: Simple Constraints. + * constraints: Constraints. + * constraints, machine specific: Machine Constraints. + * CONSTRUCTOR: Expression trees. + * constructor: Function Basics. + * constructors, automatic calls: Collect2. + * constructors, output of: Initialization. + * container: Containers. + * CONTINUE_STMT: Function Bodies. + * contributors: Contributors. + * controlling register usage: Register Basics. + * controlling the compilation driver: Driver. + * conventions, run-time: Interface. + * conversions: Conversions. + * CONVERT_EXPR: Expression trees. + * copy constructor: Function Basics. + * copy propagation: Passes. + * copy_rtx: Addressing Modes. + * copy_rtx_if_shared: Sharing. + * costs of instructions: Costs. + * COSTS_N_INSNS: Costs. + * CP_INTEGRAL_TYPE: Types. + * cp_namespace_decls: Namespaces. + * CP_TYPE_CONST_NON_VOLATILE_P: Types. + * CP_TYPE_CONST_P: Types. + * CP_TYPE_QUALS: Types. + * CP_TYPE_RESTRICT_P: Types. + * CP_TYPE_VOLATILE_P: Types. + * CPLUSPLUS_CPP_SPEC: Driver. + * CPP_PREDEFINES: Run-time Target. + * cpp_register_pragma: Misc. + * CPP_SPEC: Driver. + * CQImode: Machine Modes. + * cross compilation and floating point: Cross-compilation. + * CRT_CALL_STATIC_FUNCTION: Sections. + * CRTSTUFF_T_CFLAGS: Target Fragment. + * CRTSTUFF_T_CFLAGS_S: Target Fragment. + * CSImode: Machine Modes. + * CTImode: Machine Modes. + * CUMULATIVE_ARGS: Register Arguments. + * current_function_epilogue_delay_list: Function Entry. + * current_function_is_leaf: Leaf Functions. + * current_function_outgoing_args_size: Stack Arguments. + * current_function_pops_args: Function Entry. + * current_function_pretend_args_size: Function Entry. + * current_function_uses_only_leaf_regs: Leaf Functions. + * current_insn_predicate: Conditional Execution. + * cycle_display instruction pattern: Standard Names. + * data flow analysis: Passes. + * data structures: Per-Function Data. + * DATA_ALIGNMENT: Storage Layout. + * data_section: Sections. + * DATA_SECTION_ASM_OP: Sections. + * DBR_OUTPUT_SEQEND: Instruction Output. + * dbr_sequence_length: Instruction Output. + * DBX_BLOCKS_FUNCTION_RELATIVE: DBX Options. + * DBX_CONTIN_CHAR: DBX Options. + * DBX_CONTIN_LENGTH: DBX Options. + * DBX_DEBUGGING_INFO: DBX Options. + * DBX_FUNCTION_FIRST: DBX Options. + * DBX_LBRAC_FIRST: DBX Options. + * DBX_MEMPARM_STABS_LETTER: DBX Options. + * DBX_NO_XREFS: DBX Options. + * DBX_OUTPUT_ENUM: DBX Hooks. + * DBX_OUTPUT_FUNCTION_END: DBX Hooks. + * DBX_OUTPUT_LBRAC: DBX Hooks. + * DBX_OUTPUT_MAIN_SOURCE_DIRECTORY: File Names and DBX. + * DBX_OUTPUT_MAIN_SOURCE_FILE_END: File Names and DBX. + * DBX_OUTPUT_MAIN_SOURCE_FILENAME: File Names and DBX. + * DBX_OUTPUT_NFUN: DBX Hooks. + * DBX_OUTPUT_RBRAC: DBX Hooks. + * DBX_OUTPUT_SOURCE_FILENAME: File Names and DBX. + * DBX_OUTPUT_STANDARD_TYPES: DBX Hooks. + * DBX_REGISTER_NUMBER: All Debuggers. + * DBX_REGPARM_STABS_CODE: DBX Options. + * DBX_REGPARM_STABS_LETTER: DBX Options. + * DBX_STATIC_CONST_VAR_CODE: DBX Options. + * DBX_STATIC_STAB_DATA_SECTION: DBX Options. + * DBX_TYPE_DECL_STABS_CODE: DBX Options. + * DBX_USE_BINCL: DBX Options. + * DBX_WORKING_DIRECTORY: File Names and DBX. + * DCE, SSA based: Passes. + * DCmode: Machine Modes. + * De Morgan's law: Insn Canonicalizations. + * dead code: Passes. + * dead code elimination: Passes. + * dead_or_set_p: define_peephole. + * DEBUG_SYMS_TEXT: DBX Options. + * DEBUGGER_ARG_OFFSET: All Debuggers. + * DEBUGGER_AUTO_OFFSET: All Debuggers. + * debugging information generation: Passes. + * DECL_ALIGN: Declarations. + * DECL_ANTICIPATED: Function Basics. + * DECL_ARGUMENTS: Function Basics. + * DECL_ARRAY_DELETE_OPERATOR_P: Function Basics. + * DECL_ARTIFICIAL <1>: Function Basics. + * DECL_ARTIFICIAL: Declarations. + * DECL_ASSEMBLER_NAME: Function Basics. + * DECL_ATTRIBUTES: Attributes. + * DECL_BASE_CONSTRUCTOR_P: Function Basics. + * DECL_CLASS_SCOPE_P: Declarations. + * DECL_COMPLETE_CONSTRUCTOR_P: Function Basics. + * DECL_COMPLETE_DESTRUCTOR_P: Function Basics. + * DECL_CONST_MEMFUNC_P: Function Basics. + * DECL_CONSTRUCTOR_P: Function Basics. + * DECL_CONTEXT: Namespaces. + * DECL_CONV_FN_P: Function Basics. + * DECL_COPY_CONSTRUCTOR_P: Function Basics. + * DECL_DESTRUCTOR_P: Function Basics. + * DECL_EXTERN_C_FUNCTION_P: Function Basics. + * DECL_EXTERNAL <1>: Function Basics. + * DECL_EXTERNAL: Declarations. + * DECL_FUNCTION_MEMBER_P: Function Basics. + * DECL_FUNCTION_SCOPE_P: Declarations. + * DECL_GLOBAL_CTOR_P: Function Basics. + * DECL_GLOBAL_DTOR_P: Function Basics. + * DECL_INITIAL: Declarations. + * DECL_LINKONCE_P: Function Basics. + * DECL_LOCAL_FUNCTION_P: Function Basics. + * DECL_MAIN_P: Function Basics. + * DECL_NAME <1>: Function Basics. + * DECL_NAME <2>: Declarations. + * DECL_NAME: Namespaces. + * DECL_NAMESPACE_ALIAS: Namespaces. + * DECL_NAMESPACE_SCOPE_P: Declarations. + * DECL_NAMESPACE_STD_P: Namespaces. + * DECL_NON_THUNK_FUNCTION_P: Function Basics. + * DECL_NONCONVERTING_P: Function Basics. + * DECL_NONSTATIC_MEMBER_FUNCTION_P: Function Basics. + * DECL_OVERLOADED_OPERATOR_P: Function Basics. + * DECL_RESULT: Function Basics. + * DECL_SIZE: Declarations. + * DECL_SOURCE_FILE: Declarations. + * DECL_SOURCE_LINE: Declarations. + * DECL_STATIC_FUNCTION_P: Function Basics. + * DECL_STMT: Function Bodies. + * DECL_STMT_DECL: Function Bodies. + * DECL_THUNK_P: Function Basics. + * DECL_VOLATILE_MEMFUNC_P: Function Basics. + * declaration: Declarations. + * declarations, RTL: RTL Declarations. + * decrement_and_branch_until_zero instruction pattern: Standard Names. + * DEFAULT_CALLER_SAVES: Caller Saves. + * DEFAULT_GDB_EXTENSIONS: DBX Options. + * DEFAULT_MAIN_RETURN: Misc. + * DEFAULT_PCC_STRUCT_RETURN: Aggregate Return. + * DEFAULT_RTX_COSTS: Costs. + * DEFAULT_SHORT_ENUMS: Type Layout. + * DEFAULT_SIGNED_CHAR: Type Layout. + * define_asm_attributes: Tagging Insns. + * define_attr: Defining Attributes. + * define_cond_exec: Conditional Execution. + * define_constants: Constant Definitions. + * define_delay: Delay Slots. + * define_expand: Expander Definitions. + * define_function_unit: Function Units. + * define_insn: Patterns. + * define_insn example: Example. + * define_insn_and_split: Insn Splitting. + * define_peephole: define_peephole. + * define_peephole2: define_peephole2. + * define_split: Insn Splitting. + * defining attributes and their values: Defining Attributes. + * defining jump instruction patterns: Jump Patterns. + * defining looping instruction patterns: Looping Patterns. + * defining peephole optimizers: Peephole Definitions. + * defining RTL sequences for code generation: Expander Definitions. + * delay slots, defining: Delay Slots. + * DELAY_SLOTS_FOR_EPILOGUE: Function Entry. + * delayed branch scheduling: Passes. + * Dependent Patterns: Dependent Patterns. + * destructor: Function Basics. + * destructors, output of: Initialization. + * DFmode: Machine Modes. + * digits in constraint: Simple Constraints. + * DImode: Machine Modes. + * DIR_SEPARATOR: Host Config. + * DIR_SEPARATOR_2: Host Config. + * directory options .md: Including Patterns. + * disabling certain registers: Register Basics. + * dispatch table: Dispatch Tables. + * div: Arithmetic. + * div and attributes: Expressions. + * DIVDI3_LIBCALL: Library Calls. + * division: Arithmetic. + * divM3 instruction pattern: Standard Names. + * divmodM4 instruction pattern: Standard Names. + * DIVSI3_LIBCALL: Library Calls. + * DO_BODY: Function Bodies. + * DO_COND: Function Bodies. + * DO_STMT: Function Bodies. + * DOLLARS_IN_IDENTIFIERS: Misc. + * doloop_begin instruction pattern: Standard Names. + * doloop_end instruction pattern: Standard Names. + * DONE: Expander Definitions. + * DONT_REDUCE_ADDR: Costs. + * DOUBLE_TYPE_SIZE: Type Layout. + * driver: Driver. + * DUMPFILE_FORMAT: Host Config. + * DWARF2_ASM_LINE_DEBUG_INFO: SDB and DWARF. + * DWARF2_DEBUGGING_INFO: SDB and DWARF. + * DWARF2_FRAME_INFO: SDB and DWARF. + * DWARF2_GENERATE_TEXT_SECTION_LABEL: SDB and DWARF. + * DWARF2_UNWIND_INFO: Exception Region Output. + * DWARF_CIE_DATA_ALIGNMENT: Exception Region Output. + * DWARF_DEBUGGING_INFO: SDB and DWARF. + * DWARF_FRAME_REGISTERS: Frame Registers. + * DYNAMIC_CHAIN_ADDRESS: Frame Layout. + * E in constraint: Simple Constraints. + * earlyclobber operand: Modifiers. + * EDOM, implicit usage: Library Calls. + * EH_FRAME_IN_DATA_SECTION: Exception Region Output. + * EH_FRAME_SECTION_NAME: Exception Region Output. + * eh_return instruction pattern: Standard Names. + * EH_RETURN_DATA_REGNO: Exception Handling. + * EH_RETURN_HANDLER_RTX: Exception Handling. + * EH_RETURN_STACKADJ_RTX: Exception Handling. + * EH_USES: Function Entry. + * ELIGIBLE_FOR_EPILOGUE_DELAY: Function Entry. + * ELIMINABLE_REGS: Elimination. + * ELSE_CLAUSE: Function Bodies. + * EMIT_MODE_SET: Mode Switching. + * EMPTY_CLASS_EXPR: Function Bodies. + * EMPTY_FIELD_BOUNDARY: Storage Layout. + * ENCODE_SECTION_INFO: Sections. + * ENCODE_SECTION_INFO and address validation: Addressing Modes. + * ENCODE_SECTION_INFO usage: Instruction Output. + * ENDFILE_SPEC: Driver. + * endianness: Portability. + * enum machine_mode: Machine Modes. + * enum reg_class: Register Classes. + * ENUMERAL_TYPE: Types. + * epilogue: Function Entry. + * epilogue instruction pattern: Standard Names. + * EPILOGUE_USES: Function Entry. + * eq: Comparisons. + * eq and attributes: Expressions. + * eq_attr: Expressions. + * EQ_EXPR: Expression trees. + * equal: Comparisons. + * errno, implicit usage: Library Calls. + * escape sequences: Escape Sequences. + * exception handling: Exception Handling. + * exception_receiver instruction pattern: Standard Names. + * exclamation point: Multi-Alternative. + * exclusive-or, bitwise: Arithmetic. + * EXIT_BODY: Misc. + * EXIT_EXPR: Expression trees. + * EXIT_IGNORE_STACK: Function Entry. + * EXPAND_BUILTIN_SAVEREGS: Varargs. + * expander definitions: Expander Definitions. + * expr_list: Insns. + * EXPR_STMT: Function Bodies. + * EXPR_STMT_EXPR: Function Bodies. + * expression: Expression trees. + * expression codes: RTL Objects. + * extendMN2 instruction pattern: Standard Names. + * extensible constraints: Simple Constraints. + * extern int target_flags: Run-time Target. + * EXTRA_CC_MODES: Condition Code. + * EXTRA_CONSTRAINT: Register Classes. + * EXTRA_SECTION_FUNCTIONS: Sections. + * EXTRA_SECTIONS: Sections. + * EXTRA_SPECS: Driver. + * extv instruction pattern: Standard Names. + * extzv instruction pattern: Standard Names. + * F in constraint: Simple Constraints. + * FAIL: Expander Definitions. + * FATAL_EXIT_CODE: Host Config. + * FDL, GNU Free Documentation License: GNU Free Documentation License. + * features, optional, in system conventions: Run-time Target. + * ffs: Arithmetic. + * ffsM2 instruction pattern: Standard Names. + * FIELD_DECL: Declarations. + * FILE_STMT: Function Bodies. + * FILE_STMT_FILENAME: Function Bodies. + * files and passes of the compiler: Passes. + * final pass: Passes. + * FINAL_PRESCAN_INSN: Instruction Output. + * FINAL_PRESCAN_LABEL: Instruction Output. + * FINAL_REG_PARM_STACK_SPACE: Stack Arguments. + * final_scan_insn: Function Entry. + * final_sequence: Instruction Output. + * FINALIZE_PIC: PIC. + * FIND_BASE_TERM: Addressing Modes. + * FINI_SECTION_ASM_OP: Sections. + * FIRST_INSN_ADDRESS: Insn Lengths. + * FIRST_PARM_OFFSET: Frame Layout. + * FIRST_PARM_OFFSET and virtual registers: Regs and Memory. + * FIRST_PSEUDO_REGISTER: Register Basics. + * FIRST_STACK_REG: Stack Registers. + * FIRST_VIRTUAL_REGISTER: Regs and Memory. + * fix: Conversions. + * FIX_TRUNC_EXPR: Expression trees. + * fix_truncMN2 instruction pattern: Standard Names. + * fixed register: Register Basics. + * FIXED_REGISTERS: Register Basics. + * fixed_regs: Register Basics. + * fixMN2 instruction pattern: Standard Names. + * FIXUNS_TRUNC_LIKE_FIX_TRUNC: Misc. + * fixuns_truncMN2 instruction pattern: Standard Names. + * fixunsMN2 instruction pattern: Standard Names. + * flags in RTL expression: Flags. + * float: Conversions. + * FLOAT_EXPR: Expression trees. + * float_extend: Conversions. + * FLOAT_LIB_COMPARE_RETURNS_BOOL (MODE, COMPARISON): Library Calls. + * FLOAT_STORE_FLAG_VALUE: Misc. + * float_truncate: Conversions. + * FLOAT_TYPE_SIZE: Type Layout. + * FLOAT_WORDS_BIG_ENDIAN: Storage Layout. + * FLOAT_WORDS_BIG_ENDIAN, (lack of) effect on subreg: Regs and Memory. + * floating point and cross compilation: Cross-compilation. + * Floating Point Emulation: Target Fragment. + * floatMN2 instruction pattern: Standard Names. + * floatunsMN2 instruction pattern: Standard Names. + * FOR_BODY: Function Bodies. + * FOR_COND: Function Bodies. + * FOR_EXPR: Function Bodies. + * FOR_INIT_STMT: Function Bodies. + * FOR_STMT: Function Bodies. + * FORCE_CODE_SECTION_ALIGN: Sections. + * FORCE_PREFERRED_STACK_BOUNDARY_IN_MAIN: Storage Layout. + * force_reg: Standard Names. + * frame layout: Frame Layout. + * FRAME_GROWS_DOWNWARD: Frame Layout. + * FRAME_GROWS_DOWNWARD and virtual registers: Regs and Memory. + * frame_pointer_needed: Function Entry. + * FRAME_POINTER_REGNUM: Frame Registers. + * FRAME_POINTER_REGNUM and virtual registers: Regs and Memory. + * FRAME_POINTER_REQUIRED: Elimination. + * frame_pointer_rtx: Frame Registers. + * frame_related: Flags. + * frame_related, in insn: Flags. + * frame_related, in mem: Flags. + * frame_related, in reg: Flags. + * frame_related, in symbol_ref: Flags. + * free_machine_status: Per-Function Data. + * ftruncM2 instruction pattern: Standard Names. + * function: Functions. + * function body: Function Bodies. + * function call conventions: Interface. + * function entry and exit: Function Entry. + * function units, for scheduling: Function Units. + * function-call insns: Calls. + * FUNCTION_ARG: Register Arguments. + * FUNCTION_ARG_ADVANCE: Register Arguments. + * FUNCTION_ARG_BOUNDARY: Register Arguments. + * FUNCTION_ARG_CALLEE_COPIES: Register Arguments. + * FUNCTION_ARG_PADDING: Register Arguments. + * FUNCTION_ARG_PARTIAL_NREGS: Register Arguments. + * FUNCTION_ARG_PASS_BY_REFERENCE: Register Arguments. + * FUNCTION_ARG_REG_LITTLE_ENDIAN: Register Arguments. + * FUNCTION_ARG_REGNO_P: Register Arguments. + * FUNCTION_BOUNDARY: Storage Layout. + * FUNCTION_DECL: Functions. + * FUNCTION_INCOMING_ARG: Register Arguments. + * FUNCTION_MODE: Misc. + * FUNCTION_OK_FOR_SIBCALL: Tail Calls. + * FUNCTION_OUTGOING_VALUE: Scalar Return. + * FUNCTION_PROFILER: Profiling. + * FUNCTION_TYPE: Types. + * FUNCTION_VALUE: Scalar Return. + * FUNCTION_VALUE_REGNO_P: Scalar Return. + * functions, leaf: Leaf Functions. + * fundamental type: Types. + * g in constraint: Simple Constraints. + * G in constraint: Simple Constraints. + * GCC and portability: Portability. + * GCC_DRIVER_HOST_INITIALIZATION: Host Config. + * GCOV_TYPE_SIZE: Type Layout. + * ge: Comparisons. + * ge and attributes: Expressions. + * GE_EXPR: Expression trees. + * GEN_ERRNO_RTX: Library Calls. + * gencodes: Passes. + * genconfig: Passes. + * general_operand: RTL Template. + * GENERAL_REGS: Register Classes. + * generating assembler output: Output Statement. + * generating insns: RTL Template. + * genflags: Passes. + * get_attr: Expressions. + * get_attr_length: Insn Lengths. + * GET_CLASS_NARROWEST_MODE: Machine Modes. + * GET_CODE: RTL Objects. + * get_frame_size: Elimination. + * get_insns: Insns. + * get_last_insn: Insns. + * GET_MODE: Machine Modes. + * GET_MODE_ALIGNMENT: Machine Modes. + * GET_MODE_BITSIZE: Machine Modes. + * GET_MODE_CLASS: Machine Modes. + * GET_MODE_MASK: Machine Modes. + * GET_MODE_NAME: Machine Modes. + * GET_MODE_NUNITS: Machine Modes. + * GET_MODE_SIZE: Machine Modes. + * GET_MODE_UNIT_SIZE: Machine Modes. + * GET_MODE_WIDER_MODE: Machine Modes. + * GET_RTX_CLASS: RTL Classes. + * GET_RTX_FORMAT: RTL Classes. + * GET_RTX_LENGTH: RTL Classes. + * geu: Comparisons. + * geu and attributes: Expressions. + * global common subexpression elimination: Passes. + * global register allocation: Passes. + * GLOBAL_INIT_PRIORITY: Function Basics. + * GO_IF_LEGITIMATE_ADDRESS: Addressing Modes. + * GO_IF_MODE_DEPENDENT_ADDRESS: Addressing Modes. + * GOTO_DESTINATION: Function Bodies. + * GOTO_FAKE_P: Function Bodies. + * GOTO_STMT: Function Bodies. + * greater than: Comparisons. + * gt: Comparisons. + * gt and attributes: Expressions. + * GT_EXPR: Expression trees. + * gtu: Comparisons. + * gtu and attributes: Expressions. + * H in constraint: Simple Constraints. + * HANDLE_PRAGMA: Misc. + * HANDLE_PRAGMA_PACK_PUSH_POP: Misc. + * HANDLE_SYSV_PRAGMA: Misc. + * HANDLER: Function Bodies. + * HANDLER_BODY: Function Bodies. + * HANDLER_PARMS: Function Bodies. + * hard registers: Regs and Memory. + * HARD_FRAME_POINTER_REGNUM: Frame Registers. + * HARD_REGNO_CALL_PART_CLOBBERED: Register Basics. + * HARD_REGNO_CALLER_SAVE_MODE: Caller Saves. + * HARD_REGNO_MODE_OK: Values in Registers. + * HARD_REGNO_NREGS: Values in Registers. + * HAS_INIT_SECTION: Macros for Initialization. + * HAVE_DOS_BASED_FILE_SYSTEM: Host Config. + * HAVE_POST_DECREMENT: Addressing Modes. + * HAVE_POST_INCREMENT: Addressing Modes. + * HAVE_POST_MODIFY_DISP: Addressing Modes. + * HAVE_POST_MODIFY_REG: Addressing Modes. + * HAVE_PRE_DECREMENT: Addressing Modes. + * HAVE_PRE_INCREMENT: Addressing Modes. + * HAVE_PRE_MODIFY_DISP: Addressing Modes. + * HAVE_PRE_MODIFY_REG: Addressing Modes. + * HCmode: Machine Modes. + * HFmode: Machine Modes. + * high: Constants. + * HImode: Machine Modes. + * HImode, in insn: Insns. + * host makefile fragment: Host Fragment. + * HOST_BIT_BUCKET: Host Config. + * HOST_EXECUTABLE_SUFFIX: Host Config. + * HOST_OBJECT_SUFFIX: Host Config. + * I in constraint: Simple Constraints. + * i in constraint: Simple Constraints. + * IBM_FLOAT_FORMAT: Storage Layout. + * identifier: Identifiers. + * IDENTIFIER_LENGTH: Identifiers. + * IDENTIFIER_NODE: Identifiers. + * IDENTIFIER_OPNAME_P: Identifiers. + * IDENTIFIER_POINTER: Identifiers. + * IDENTIFIER_TYPENAME_P: Identifiers. + * IEEE_FLOAT_FORMAT: Storage Layout. + * if conversion: Passes. + * IF_COND: Function Bodies. + * IF_STMT: Function Bodies. + * if_then_else: Comparisons. + * if_then_else and attributes: Expressions. + * if_then_else usage: Side Effects. + * IFCVT_MODIFY_CANCEL: Misc. + * IFCVT_MODIFY_FINAL: Misc. + * IFCVT_MODIFY_INSN: Misc. + * IFCVT_MODIFY_TESTS: Misc. + * IMAGPART_EXPR: Expression trees. + * immediate_operand: RTL Template. + * IMMEDIATE_PREFIX: Instruction Output. + * in_data: Sections. + * in_struct: Flags. + * in_struct, in code_label: Flags. + * in_struct, in insn: Flags. + * in_struct, in label_ref: Flags. + * in_struct, in mem: Flags. + * in_struct, in reg: Flags. + * in_struct, in subreg: Flags. + * in_text: Sections. + * include: Including Patterns. + * INCLUDE_DEFAULTS: Driver. + * inclusive-or, bitwise: Arithmetic. + * INCOMING_FRAME_SP_OFFSET: Frame Layout. + * INCOMING_REGNO: Register Basics. + * INCOMING_RETURN_ADDR_RTX: Frame Layout. + * INDEX_REG_CLASS: Register Classes. + * indirect_jump instruction pattern: Standard Names. + * INDIRECT_REF: Expression trees. + * INIT_CUMULATIVE_ARGS: Register Arguments. + * INIT_CUMULATIVE_INCOMING_ARGS: Register Arguments. + * INIT_CUMULATIVE_LIBCALL_ARGS: Register Arguments. + * INIT_ENVIRONMENT: Driver. + * INIT_EXPANDERS: Per-Function Data. + * INIT_EXPR: Expression trees. + * init_machine_status: Per-Function Data. + * INIT_SECTION_ASM_OP <1>: Macros for Initialization. + * INIT_SECTION_ASM_OP: Sections. + * INIT_TARGET_OPTABS: Library Calls. + * INITIAL_ELIMINATION_OFFSET: Elimination. + * INITIAL_FRAME_POINTER_OFFSET: Elimination. + * initialization routines: Initialization. + * INITIALIZE_TRAMPOLINE: Trampolines. + * inline on rtx, automatic: Passes. + * inline on trees, automatic: Passes. + * inlining: Target Attributes. + * insn: Insns. + * insn and /f: Flags. + * insn and /i: Flags. + * insn and /j: Flags. + * insn and /s: Flags. + * insn and /u: Flags. + * insn and /v: Flags. + * insn attributes: Insn Attributes. + * insn canonicalization: Insn Canonicalizations. + * insn includes: Including Patterns. + * insn lengths, computing: Insn Lengths. + * insn splitting: Insn Splitting. + * insn-attr.h: Defining Attributes. + * INSN_ANNULLED_BRANCH_P: Flags. + * INSN_CACHE_DEPTH: Trampolines. + * INSN_CACHE_LINE_WIDTH: Trampolines. + * INSN_CACHE_SIZE: Trampolines. + * INSN_CODE: Insns. + * INSN_DEAD_CODE_P: Flags. + * INSN_DELETED_P: Flags. + * INSN_FROM_TARGET_P: Flags. + * insn_list: Insns. + * insn_list and /c: Flags. + * insn_list and /j: Flags. + * INSN_REFERENCES_ARE_DELAYED: Misc. + * INSN_SETS_ARE_DELAYED: Misc. + * INSN_UID: Insns. + * insns: Insns. + * insns, generating: RTL Template. + * insns, recognizing: RTL Template. + * instruction attributes: Insn Attributes. + * instruction combination: Passes. + * instruction patterns: Patterns. + * instruction recognizer: Passes. + * instruction scheduling: Passes. + * instruction splitting: Insn Splitting. + * insv instruction pattern: Standard Names. + * INT_TYPE_SIZE: Type Layout. + * INTEGER_CST: Expression trees. + * INTEGER_TYPE: Types. + * INTEGRATE_THRESHOLD: Misc. + * integrated: Flags. + * integrated, in insn: Flags. + * integrated, in reg: Flags. + * integrated, in symbol_ref: Flags. + * INTEL_EXTENDED_IEEE_FORMAT: Type Layout. + * Interdependence of Patterns: Dependent Patterns. + * interfacing to GCC output: Interface. + * INTMAX_TYPE: Type Layout. + * introduction: Top. + * INVOKE__main: Macros for Initialization. + * ior: Arithmetic. + * ior and attributes: Expressions. + * ior, canonicalization of: Insn Canonicalizations. + * iorM3 instruction pattern: Standard Names. + * IS_ASM_LOGICAL_LINE_SEPARATOR: Data Output. + * isinf: Cross-compilation. + * isnan: Cross-compilation. + * jump: Flags. + * jump instruction pattern: Standard Names. + * jump instruction patterns: Jump Patterns. + * jump instructions and set: Side Effects. + * jump optimization: Passes. + * jump threading: Passes. + * jump, in call_insn: Flags. + * jump, in insn: Flags. + * jump, in insn_list: Flags. + * jump, in mem: Flags. + * JUMP_ALIGN: Alignment Output. + * jump_insn: Insns. + * JUMP_LABEL: Insns. + * JUMP_TABLES_IN_TEXT_SECTION: Sections. + * LABEL_ALIGN: Alignment Output. + * LABEL_ALIGN_AFTER_BARRIER: Alignment Output. + * LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP: Alignment Output. + * LABEL_ALIGN_MAX_SKIP: Alignment Output. + * LABEL_ALTERNATE_NAME: Insns. + * LABEL_DECL: Declarations. + * LABEL_NUSES: Insns. + * LABEL_OUTSIDE_LOOP_P: Flags. + * LABEL_PRESERVE_P: Flags. + * label_ref: Constants. + * label_ref and /s: Flags. + * label_ref and /v: Flags. + * label_ref, RTL sharing: Sharing. + * LABEL_REF_NONLOCAL_P: Flags. + * LABEL_STMT: Function Bodies. + * LABEL_STMT_LABEL: Function Bodies. + * large return values: Aggregate Return. + * LAST_STACK_REG: Stack Registers. + * LAST_VIRTUAL_REGISTER: Regs and Memory. + * LD_FINI_SWITCH: Macros for Initialization. + * LD_INIT_SWITCH: Macros for Initialization. + * LDD_SUFFIX: Macros for Initialization. + * ldexp: Cross-compilation. + * le: Comparisons. + * le and attributes: Expressions. + * LE_EXPR: Expression trees. + * leaf functions: Leaf Functions. + * leaf_function_p: Standard Names. + * LEAF_REG_REMAP: Leaf Functions. + * LEAF_REGISTERS: Leaf Functions. + * left rotate: Arithmetic. + * left shift: Arithmetic. + * LEGITIMATE_CONSTANT_P: Addressing Modes. + * LEGITIMATE_PIC_OPERAND_P: PIC. + * LEGITIMIZE_ADDRESS: Addressing Modes. + * LEGITIMIZE_RELOAD_ADDRESS: Addressing Modes. + * less than: Comparisons. + * less than or equal: Comparisons. + * leu: Comparisons. + * leu and attributes: Expressions. + * LIB2FUNCS_EXTRA: Target Fragment. + * LIB_SPEC: Driver. + * LIBCALL_VALUE: Scalar Return. + * libgcc.a: Library Calls. + * LIBGCC2_CFLAGS: Target Fragment. + * LIBGCC2_WORDS_BIG_ENDIAN: Storage Layout. + * LIBGCC_NEEDS_DOUBLE: Library Calls. + * LIBGCC_SPEC: Driver. + * library subroutine names: Library Calls. + * LIBRARY_PATH_ENV: Misc. + * LIMIT_RELOAD_CLASS: Register Classes. + * LINK_COMMAND_SPEC: Driver. + * LINK_COST_FREE: Flags. + * LINK_COST_ZERO: Flags. + * LINK_ELIMINATE_DUPLICATE_LDIRECTORIES: Driver. + * LINK_GCC_C_SEQUENCE_SPEC: Driver. + * LINK_LIBGCC_SPECIAL: Driver. + * LINK_LIBGCC_SPECIAL_1: Driver. + * LINK_SPEC: Driver. + * linkage: Function Basics. + * LINKER_DOES_NOT_WORK_WITH_DWARF2: SDB and DWARF. + * list: Containers. + * lo_sum: Arithmetic. + * load address instruction: Simple Constraints. + * LOAD_ARGS_REVERSED: Register Arguments. + * LOAD_EXTEND_OP: Misc. + * load_multiple instruction pattern: Standard Names. + * local register allocation: Passes. + * LOCAL_ALIGNMENT: Storage Layout. + * LOCAL_CLASS_P: Classes. + * LOCAL_INCLUDE_DIR: Driver. + * LOCAL_LABEL_PREFIX: Instruction Output. + * LOCAL_REGNO: Register Basics. + * LOG_LINKS: Insns. + * logical-and, bitwise: Arithmetic. + * LONG_DOUBLE_TYPE_SIZE: Type Layout. + * LONG_LONG_TYPE_SIZE: Type Layout. + * LONG_TYPE_SIZE: Type Layout. + * longjmp and automatic variables: Interface. + * loop optimization: Passes. + * LOOP_ALIGN: Alignment Output. + * LOOP_ALIGN_MAX_SKIP: Alignment Output. + * LOOP_EXPR: Expression trees. + * looping instruction patterns: Looping Patterns. + * LSHIFT_EXPR: Expression trees. + * lshiftrt: Arithmetic. + * lshiftrt and attributes: Expressions. + * lshrM3 instruction pattern: Standard Names. + * lt: Comparisons. + * lt and attributes: Expressions. + * LT_EXPR: Expression trees. + * ltu: Comparisons. + * m in constraint: Simple Constraints. + * machine attributes: Target Attributes. + * machine description macros: Target Macros. + * machine descriptions: Machine Desc. + * machine mode conversions: Conversions. + * machine modes: Machine Modes. + * machine specific constraints: Machine Constraints. + * MACHINE_DEPENDENT_REORG: Misc. + * macros, target description: Target Macros. + * MAKE_DECL_ONE_ONLY (DECL): Label Output. + * make_safe_from: Expander Definitions. + * makefile fragment: Fragments. + * makefile targets: Makefile. + * mark_machine_status: Per-Function Data. + * MASK_RETURN_ADDR: Exception Region Output. + * match_dup <1>: define_peephole2. + * match_dup: RTL Template. + * match_dup and attributes: Insn Lengths. + * match_insn: RTL Template. + * match_insn2: RTL Template. + * match_op_dup: RTL Template. + * match_operand: RTL Template. + * match_operand and attributes: Expressions. + * match_operator: RTL Template. + * match_par_dup: RTL Template. + * match_parallel: RTL Template. + * match_scratch <1>: define_peephole2. + * match_scratch: RTL Template. + * matching constraint: Simple Constraints. + * matching operands: Output Template. + * math libraries: Interface. + * math, in RTL: Arithmetic. + * MATH_LIBRARY: Misc. + * MAX_BITS_PER_WORD: Storage Layout. + * MAX_CHAR_TYPE_SIZE: Type Layout. + * MAX_CONDITIONAL_EXECUTE: Misc. + * MAX_FIXED_MODE_SIZE: Storage Layout. + * MAX_INTEGER_COMPUTATION_MODE: Misc. + * MAX_LONG_DOUBLE_TYPE_SIZE: Type Layout. + * MAX_LONG_TYPE_SIZE: Type Layout. + * MAX_MOVE_MAX: Misc. + * MAX_OFILE_ALIGNMENT: Storage Layout. + * MAX_REGS_PER_ADDRESS: Addressing Modes. + * MAX_WCHAR_TYPE_SIZE: Type Layout. + * maxM3 instruction pattern: Standard Names. + * MAYBE_REG_PARM_STACK_SPACE: Stack Arguments. + * mcount: Profiling. + * MD_ASM_CLOBBERS: Misc. + * MD_CAN_REDIRECT_BRANCH: Misc. + * MD_EXEC_PREFIX: Driver. + * MD_FALLBACK_FRAME_STATE_FOR: Exception Handling. + * MD_STARTFILE_PREFIX: Driver. + * MD_STARTFILE_PREFIX_1: Driver. + * mem: Regs and Memory. + * mem and /f: Flags. + * mem and /j: Flags. + * mem and /s: Flags. + * mem and /u: Flags. + * mem and /v: Flags. + * mem, RTL sharing: Sharing. + * MEM_IN_STRUCT_P: Flags. + * MEM_KEEP_ALIAS_SET_P: Flags. + * MEM_SCALAR_P: Flags. + * MEM_VOLATILE_P: Flags. + * MEMBER_TYPE_FORCES_BLK: Storage Layout. + * memcpy, implicit usage: Library Calls. + * memmove, implicit usage: Library Calls. + * memory reference, nonoffsettable: Simple Constraints. + * memory references in constraints: Simple Constraints. + * MEMORY_MOVE_COST: Costs. + * memset, implicit usage: Library Calls. + * METHOD_TYPE: Types. + * MIN_UNITS_PER_WORD: Storage Layout. + * MINIMUM_ATOMIC_ALIGNMENT: Storage Layout. + * minM3 instruction pattern: Standard Names. + * minus: Arithmetic. + * minus and attributes: Expressions. + * minus, canonicalization of: Insn Canonicalizations. + * MINUS_EXPR: Expression trees. + * mod: Arithmetic. + * mod and attributes: Expressions. + * MODDI3_LIBCALL: Library Calls. + * mode classes: Machine Modes. + * mode switching: Mode Switching. + * MODE_BASE_REG_CLASS: Register Classes. + * MODE_CC: Machine Modes. + * MODE_COMPLEX_FLOAT: Machine Modes. + * MODE_COMPLEX_INT: Machine Modes. + * MODE_FLOAT: Machine Modes. + * MODE_FUNCTION: Machine Modes. + * MODE_INT: Machine Modes. + * MODE_NEEDED: Mode Switching. + * MODE_PARTIAL_INT: Machine Modes. + * MODE_PRIORITY_TO_MODE: Mode Switching. + * MODE_RANDOM: Machine Modes. + * MODES_TIEABLE_P: Values in Registers. + * modifiers in constraints: Modifiers. + * MODIFY_EXPR: Expression trees. + * MODIFY_TARGET_NAME: Driver. + * modM3 instruction pattern: Standard Names. + * MODSI3_LIBCALL: Library Calls. + * MOVE_BY_PIECES_P: Costs. + * MOVE_MAX: Misc. + * MOVE_MAX_PIECES: Costs. + * MOVE_RATIO: Costs. + * movM instruction pattern: Standard Names. + * movMODEcc instruction pattern: Standard Names. + * movstrictM instruction pattern: Standard Names. + * movstrM instruction pattern: Standard Names. + * MULDI3_LIBCALL: Library Calls. + * mulhisi3 instruction pattern: Standard Names. + * mulM3 instruction pattern: Standard Names. + * mulqihi3 instruction pattern: Standard Names. + * MULSI3_LIBCALL: Library Calls. + * mulsidi3 instruction pattern: Standard Names. + * mult: Arithmetic. + * mult and attributes: Expressions. + * mult, canonicalization of: Insn Canonicalizations. + * MULT_EXPR: Expression trees. + * MULTILIB_DEFAULTS: Driver. + * MULTILIB_DIRNAMES: Target Fragment. + * MULTILIB_EXCEPTIONS: Target Fragment. + * MULTILIB_EXTRA_OPTS: Target Fragment. + * MULTILIB_MATCHES: Target Fragment. + * MULTILIB_OPTIONS: Target Fragment. + * multiple alternative constraints: Multi-Alternative. + * MULTIPLE_SYMBOL_SPACES: Misc. + * multiplication: Arithmetic. + * MUST_PASS_IN_STACK: Register Arguments. + * MUST_PASS_IN_STACK, and FUNCTION_ARG: Register Arguments. + * n in constraint: Simple Constraints. + * N_REG_CLASSES: Register Classes. + * name: Identifiers. + * named patterns and conditions: Patterns. + * names, pattern: Standard Names. + * namespace: Namespaces. + * namespace, class, scope: Scopes. + * NAMESPACE_DECL <1>: Declarations. + * NAMESPACE_DECL: Namespaces. + * ne: Comparisons. + * ne and attributes: Expressions. + * NE_EXPR: Expression trees. + * NEED_ATEXIT: Misc. + * neg: Arithmetic. + * neg and attributes: Expressions. + * neg, canonicalization of: Insn Canonicalizations. + * NEGATE_EXPR: Expression trees. + * negM2 instruction pattern: Standard Names. + * nested functions, trampolines for: Trampolines. + * next_cc0_user: Jump Patterns. + * NEXT_INSN: Insns. + * NEXT_OBJC_RUNTIME: Library Calls. + * nil: RTL Objects. + * NO_BUILTIN_PTRDIFF_TYPE: Driver. + * NO_BUILTIN_SIZE_TYPE: Driver. + * NO_BUILTIN_WCHAR_TYPE: Driver. + * NO_BUILTIN_WINT_TYPE: Driver. + * NO_DBX_FUNCTION_END: DBX Hooks. + * NO_DOLLAR_IN_LABEL: Misc. + * NO_DOT_IN_LABEL: Misc. + * NO_FUNCTION_CSE: Costs. + * NO_IMPLICIT_EXTERN_C: Misc. + * no_new_pseudos: Standard Names. + * NO_PROFILE_COUNTERS: Profiling. + * NO_RECURSIVE_FUNCTION_CSE: Costs. + * NO_REGS: Register Classes. + * NON_SAVING_SETJMP: Register Basics. + * nonlocal_goto instruction pattern: Standard Names. + * nonlocal_goto_receiver instruction pattern: Standard Names. + * nonoffsettable memory reference: Simple Constraints. + * nop instruction pattern: Standard Names. + * NOP_EXPR: Expression trees. + * NORMAL_MODE: Mode Switching. + * not: Arithmetic. + * not and attributes: Expressions. + * not equal: Comparisons. + * not, canonicalization of: Insn Canonicalizations. + * note: Insns. + * NOTE_INSN_BLOCK_BEG: Insns. + * NOTE_INSN_BLOCK_END: Insns. + * NOTE_INSN_DELETED: Insns. + * NOTE_INSN_DELETED_LABEL: Insns. + * NOTE_INSN_EH_REGION_BEG: Insns. + * NOTE_INSN_EH_REGION_END: Insns. + * NOTE_INSN_FUNCTION_END: Insns. + * NOTE_INSN_LOOP_BEG: Insns. + * NOTE_INSN_LOOP_CONT: Insns. + * NOTE_INSN_LOOP_END: Insns. + * NOTE_INSN_LOOP_VTOP: Insns. + * NOTE_INSN_SETJMP: Insns. + * NOTE_LINE_NUMBER: Insns. + * NOTE_SOURCE_FILE: Insns. + * NOTICE_UPDATE_CC: Condition Code. + * NUM_MACHINE_MODES: Machine Modes. + * NUM_MODES_FOR_MODE_SWITCHING: Mode Switching. + * o in constraint: Simple Constraints. + * OBJC_GEN_METHOD_LABEL: Label Output. + * OBJC_PROLOGUE: File Framework. + * OBJECT_FORMAT_COFF: Macros for Initialization. + * OBJECT_FORMAT_ROSE: Macros for Initialization. + * OFFSET_TYPE: Types. + * offsettable address: Simple Constraints. + * OImode: Machine Modes. + * ON_EXIT: Misc. + * one_cmplM2 instruction pattern: Standard Names. + * operand access: Accessors. + * operand constraints: Constraints. + * operand substitution: Output Template. + * operands: Patterns. + * OPTIMIZATION_OPTIONS: Run-time Target. + * OPTIMIZE_MODE_SWITCHING: Mode Switching. + * optional hardware or system features: Run-time Target. + * options, directory search: Including Patterns. + * order of register allocation: Allocation Order. + * ORDER_REGS_FOR_LOCAL_ALLOC: Allocation Order. + * Ordering of Patterns: Pattern Ordering. + * other register constraints: Simple Constraints. + * OUTGOING_REG_PARM_STACK_SPACE: Stack Arguments. + * OUTGOING_REGNO: Register Basics. + * output of assembler code: File Framework. + * output statements: Output Statement. + * output templates: Output Template. + * OUTPUT_ADDR_CONST_EXTRA: Data Output. + * output_asm_insn: Output Statement. + * OUTPUT_QUOTED_STRING: File Framework. + * overflow while constant folding: Cross-compilation. + * OVERLOAD: Functions. + * OVERRIDE_OPTIONS: Run-time Target. + * OVL_CURRENT: Functions. + * OVL_NEXT: Functions. + * p in constraint: Simple Constraints. + * PAD_VARARGS_DOWN: Register Arguments. + * parallel: Side Effects. + * parameters, miscellaneous: Misc. + * PARM_BOUNDARY: Storage Layout. + * PARM_DECL: Declarations. + * PARSE_LDD_OUTPUT: Macros for Initialization. + * parsing pass: Passes. + * passes and files of the compiler: Passes. + * passing arguments: Interface. + * PATH_SEPARATOR: Host Config. + * PATTERN: Insns. + * pattern conditions: Patterns. + * pattern names: Standard Names. + * Pattern Ordering: Pattern Ordering. + * patterns: Patterns. + * pc: Regs and Memory. + * pc and attributes: Insn Lengths. + * pc, RTL sharing: Sharing. + * pc_rtx: Regs and Memory. + * PCC_BITFIELD_TYPE_MATTERS: Storage Layout. + * PCC_STATIC_STRUCT_RETURN: Aggregate Return. + * PDImode: Machine Modes. + * peephole optimization: Passes. + * peephole optimization, RTL representation: Side Effects. + * peephole optimizer definitions: Peephole Definitions. + * per-function data: Per-Function Data. + * percent sign: Output Template. + * PIC: PIC. + * PIC_OFFSET_TABLE_REG_CALL_CLOBBERED: PIC. + * PIC_OFFSET_TABLE_REGNUM: PIC. + * plus: Arithmetic. + * plus and attributes: Expressions. + * plus, canonicalization of: Insn Canonicalizations. + * PLUS_EXPR: Expression trees. + * Pmode: Misc. + * pointer: Types. + * POINTER_SIZE: Storage Layout. + * POINTER_TYPE: Types. + * POINTERS_EXTEND_UNSIGNED: Storage Layout. + * portability: Portability. + * position independent code: PIC. + * post_dec: Incdec. + * post_inc: Incdec. + * post_modify: Incdec. + * pragma: Misc. + * pre_dec: Incdec. + * PRE_GCC3_DWARF_FRAME_REGISTERS: Frame Registers. + * pre_inc: Incdec. + * predefined macros: Run-time Target. + * PREDICATE_CODES: Misc. + * predication: Conditional Execution. + * PREFERRED_DEBUGGING_TYPE: All Debuggers. + * PREFERRED_OUTPUT_RELOAD_CLASS: Register Classes. + * PREFERRED_RELOAD_CLASS: Register Classes. + * PREFERRED_STACK_BOUNDARY: Storage Layout. + * prefetch: Side Effects. + * prefetch instruction pattern: Standard Names. + * PRETEND_OUTGOING_VARARGS_NAMED: Varargs. + * prev_active_insn: define_peephole. + * prev_cc0_setter: Jump Patterns. + * PREV_INSN: Insns. + * PRINT_OPERAND: Instruction Output. + * PRINT_OPERAND_ADDRESS: Instruction Output. + * PRINT_OPERAND_PUNCT_VALID_P: Instruction Output. + * probe instruction pattern: Standard Names. + * product: Arithmetic. + * PROFILE_BEFORE_PROLOGUE: Profiling. + * PROFILE_HOOK: Profiling. + * profiling, code generation: Profiling. + * program counter: Regs and Memory. + * prologue: Function Entry. + * prologue instruction pattern: Standard Names. + * PROMOTE_FOR_CALL_ONLY: Storage Layout. + * PROMOTE_FUNCTION_ARGS: Storage Layout. + * PROMOTE_FUNCTION_RETURN: Storage Layout. + * PROMOTE_MODE: Storage Layout. + * PROMOTE_PROTOTYPES: Stack Arguments. + * pseudo registers: Regs and Memory. + * PSImode: Machine Modes. + * PTRDIFF_TYPE: Type Layout. + * PTRMEM_CST: Expression trees. + * PTRMEM_CST_CLASS: Expression trees. + * PTRMEM_CST_MEMBER: Expression trees. + * push address instruction: Simple Constraints. + * PUSH_ARGS: Stack Arguments. + * push_reload: Addressing Modes. + * PUSH_ROUNDING: Stack Arguments. + * PUSH_ROUNDING, interaction with PREFERRED_STACK_BOUNDARY: Storage Layout. + * pushM instruction pattern: Standard Names. + * PUT_CODE: RTL Objects. + * PUT_MODE: Machine Modes. + * PUT_REG_NOTE_KIND: Insns. + * PUT_SDB_...: SDB and DWARF. + * QCmode: Machine Modes. + * QFmode: Machine Modes. + * QImode: Machine Modes. + * QImode, in insn: Insns. + * qualified type: Types. + * question mark: Multi-Alternative. + * quotient: Arithmetic. + * r in constraint: Simple Constraints. + * RDIV_EXPR: Expression trees. + * READONLY_DATA_SECTION: Sections. + * REAL_ARITHMETIC: Cross-compilation. + * REAL_CST: Expression trees. + * REAL_INFINITY: Cross-compilation. + * REAL_NM_FILE_NAME: Macros for Initialization. + * REAL_TYPE: Types. + * REAL_VALUE_ATOF: Cross-compilation. + * REAL_VALUE_FIX: Cross-compilation. + * REAL_VALUE_FROM_INT: Cross-compilation. + * REAL_VALUE_ISINF: Cross-compilation. + * REAL_VALUE_ISNAN: Cross-compilation. + * REAL_VALUE_LDEXP: Cross-compilation. + * REAL_VALUE_NEGATE: Cross-compilation. + * REAL_VALUE_RNDZINT: Cross-compilation. + * REAL_VALUE_TO_DECIMAL: Data Output. + * REAL_VALUE_TO_INT: Cross-compilation. + * REAL_VALUE_TO_TARGET_DOUBLE: Data Output. + * REAL_VALUE_TO_TARGET_LONG_DOUBLE: Data Output. + * REAL_VALUE_TO_TARGET_SINGLE: Data Output. + * REAL_VALUE_TRUNCATE: Cross-compilation. + * REAL_VALUE_TYPE: Cross-compilation. + * REAL_VALUE_UNSIGNED_FIX: Cross-compilation. + * REAL_VALUE_UNSIGNED_RNDZINT: Cross-compilation. + * REAL_VALUES_EQUAL: Cross-compilation. + * REAL_VALUES_LESS: Cross-compilation. + * REALPART_EXPR: Expression trees. + * recog_data.operand: Instruction Output. + * recognizing insns: RTL Template. + * RECORD_TYPE <1>: Classes. + * RECORD_TYPE: Types. + * reference: Types. + * REFERENCE_TYPE: Types. + * reg: Regs and Memory. + * reg and /f: Flags. + * reg and /i: Flags. + * reg and /s: Flags. + * reg and /u: Flags. + * reg and /v: Flags. + * reg, RTL sharing: Sharing. + * REG_ALLOC_ORDER: Allocation Order. + * REG_BR_PRED: Insns. + * REG_BR_PROB: Insns. + * REG_CC_SETTER: Insns. + * REG_CC_USER: Insns. + * REG_CLASS_CONTENTS: Register Classes. + * REG_CLASS_FROM_LETTER: Register Classes. + * REG_CLASS_NAMES: Register Classes. + * REG_DEAD: Insns. + * REG_DEP_ANTI: Insns. + * REG_DEP_OUTPUT: Insns. + * REG_EQUAL: Insns. + * REG_EQUIV: Insns. + * REG_EXEC_COUNT: Insns. + * REG_FRAME_RELATED_EXPR: Insns. + * REG_FUNCTION_VALUE_P: Flags. + * REG_INC: Insns. + * REG_LABEL: Insns. + * REG_LIBCALL: Insns. + * REG_LOOP_TEST_P: Flags. + * REG_MODE_OK_FOR_BASE_P: Addressing Modes. + * reg_names: Instruction Output. + * REG_NO_CONFLICT: Insns. + * REG_NONNEG: Insns. + * REG_NOTE_KIND: Insns. + * REG_NOTES: Insns. + * REG_OK_FOR_BASE_P: Addressing Modes. + * REG_OK_FOR_INDEX_P: Addressing Modes. + * REG_OK_STRICT: Addressing Modes. + * REG_PARM_STACK_SPACE: Stack Arguments. + * REG_PARM_STACK_SPACE, and FUNCTION_ARG: Register Arguments. + * REG_POINTER: Flags. + * REG_RETVAL: Insns. + * REG_UNUSED: Insns. + * REG_USERVAR_P: Flags. + * REG_WAS_0: Insns. + * register allocation: Passes. + * register allocation order: Allocation Order. + * register class definitions: Register Classes. + * register class preference constraints: Class Preferences. + * register class preference pass: Passes. + * register movement: Passes. + * register pairs: Values in Registers. + * Register Transfer Language (RTL): RTL. + * register usage: Registers. + * register use analysis: Passes. + * register-to-stack conversion: Passes. + * REGISTER_MOVE_COST: Costs. + * REGISTER_NAMES: Instruction Output. + * register_operand: RTL Template. + * REGISTER_PREFIX: Instruction Output. + * REGISTER_TARGET_PRAGMAS: Misc. + * registers arguments: Register Arguments. + * registers in constraints: Simple Constraints. + * REGNO_MODE_OK_FOR_BASE_P: Register Classes. + * REGNO_OK_FOR_BASE_P: Register Classes. + * REGNO_OK_FOR_INDEX_P: Register Classes. + * REGNO_REG_CLASS: Register Classes. + * regs_ever_live: Function Entry. + * relative costs: Costs. + * RELATIVE_PREFIX_NOT_LINKDIR: Driver. + * reload pass: Regs and Memory. + * reload_completed: Standard Names. + * reload_in instruction pattern: Standard Names. + * reload_in_progress: Standard Names. + * reload_out instruction pattern: Standard Names. + * reloading: Passes. + * remainder: Arithmetic. + * reordering, block: Passes. + * representation of RTL: RTL. + * rest_of_compilation: Passes. + * rest_of_decl_compilation: Passes. + * restore_stack_block instruction pattern: Standard Names. + * restore_stack_function instruction pattern: Standard Names. + * restore_stack_nonlocal instruction pattern: Standard Names. + * RESULT_DECL: Declarations. + * return: Side Effects. + * return instruction pattern: Standard Names. + * return values in registers: Scalar Return. + * RETURN_ADDR_IN_PREVIOUS_FRAME: Frame Layout. + * RETURN_ADDR_RTX: Frame Layout. + * RETURN_ADDRESS_POINTER_REGNUM: Frame Registers. + * RETURN_EXPR: Function Bodies. + * RETURN_IN_MEMORY: Aggregate Return. + * RETURN_INIT: Function Bodies. + * RETURN_POPS_ARGS: Stack Arguments. + * RETURN_STMT: Function Bodies. + * returning aggregate values: Aggregate Return. + * returning structures and unions: Interface. + * REVERSE_CONDEXEC_PREDICATES_P: Condition Code. + * REVERSE_CONDITION (CODE, MODE): Condition Code. + * REVERSIBLE_CC_MODE: Condition Code. + * right rotate: Arithmetic. + * right shift: Arithmetic. + * rotate: Arithmetic. + * rotatert: Arithmetic. + * rotlM3 instruction pattern: Standard Names. + * rotrM3 instruction pattern: Standard Names. + * ROUND_TYPE_ALIGN: Storage Layout. + * ROUND_TYPE_SIZE: Storage Layout. + * ROUND_TYPE_SIZE_UNIT: Storage Layout. + * RSHIFT_EXPR: Expression trees. + * RTL addition: Arithmetic. + * RTL addition with signed saturation: Arithmetic. + * RTL addition with unsigned saturation: Arithmetic. + * RTL classes: RTL Classes. + * RTL comparison: Arithmetic. + * RTL comparison operations: Comparisons. + * RTL constant expression types: Constants. + * RTL constants: Constants. + * RTL declarations: RTL Declarations. + * RTL difference: Arithmetic. + * RTL expression: RTL Objects. + * RTL expressions for arithmetic: Arithmetic. + * RTL format: RTL Classes. + * RTL format characters: RTL Classes. + * RTL function-call insns: Calls. + * RTL generation: Passes. + * RTL insn template: RTL Template. + * RTL integers: RTL Objects. + * RTL memory expressions: Regs and Memory. + * RTL object types: RTL Objects. + * RTL postdecrement: Incdec. + * RTL postincrement: Incdec. + * RTL predecrement: Incdec. + * RTL preincrement: Incdec. + * RTL register expressions: Regs and Memory. + * RTL representation: RTL. + * RTL side effect expressions: Side Effects. + * RTL strings: RTL Objects. + * RTL structure sharing assumptions: Sharing. + * RTL subtraction: Arithmetic. + * RTL sum: Arithmetic. + * RTL vectors: RTL Objects. + * RTX (See RTL): RTL Objects. + * RTX codes, classes of: RTL Classes. + * RTX_COSTS: Costs. + * RTX_FRAME_RELATED_P: Flags. + * RTX_INTEGRATED_P: Flags. + * RTX_UNCHANGING_P: Flags. + * run-time conventions: Interface. + * run-time target specification: Run-time Target. + * s in constraint: Simple Constraints. + * same_type_p: Types. + * save_stack_block instruction pattern: Standard Names. + * save_stack_function instruction pattern: Standard Names. + * save_stack_nonlocal instruction pattern: Standard Names. + * saveable_obstack: Addressing Modes. + * scalars, returned as values: Scalar Return. + * SCCS_DIRECTIVE: Misc. + * SCHED_GROUP_P: Flags. + * scheduling, delayed branch: Passes. + * scheduling, instruction: Passes. + * SCmode: Machine Modes. + * sCOND instruction pattern: Standard Names. + * SCOPE_BEGIN_P: Function Bodies. + * SCOPE_END_P: Function Bodies. + * SCOPE_NULLIFIED_P: Function Bodies. + * SCOPE_STMT: Function Bodies. + * scratch: Regs and Memory. + * scratch operands: Regs and Memory. + * scratch, RTL sharing: Sharing. + * SDB_ALLOW_FORWARD_REFERENCES: SDB and DWARF. + * SDB_ALLOW_UNKNOWN_REFERENCES: SDB and DWARF. + * SDB_DEBUGGING_INFO: SDB and DWARF. + * SDB_DELIM: SDB and DWARF. + * SDB_GENERATE_FAKE: SDB and DWARF. + * search options: Including Patterns. + * SECONDARY_INPUT_RELOAD_CLASS: Register Classes. + * SECONDARY_MEMORY_NEEDED: Register Classes. + * SECONDARY_MEMORY_NEEDED_MODE: Register Classes. + * SECONDARY_MEMORY_NEEDED_RTX: Register Classes. + * SECONDARY_OUTPUT_RELOAD_CLASS: Register Classes. + * SECONDARY_RELOAD_CLASS: Register Classes. + * SELECT_CC_MODE: Condition Code. + * SELECT_RTX_SECTION: Sections. + * SELECT_SECTION: Sections. + * sequence: Side Effects. + * set: Side Effects. + * SET_ASM_OP: Label Output. + * set_attr: Tagging Insns. + * set_attr_alternative: Tagging Insns. + * SET_DEST: Side Effects. + * SET_IS_RETURN_P: Flags. + * SET_SRC: Side Effects. + * SETUP_FRAME_ADDRESSES: Frame Layout. + * SETUP_INCOMING_VARARGS: Varargs. + * SFmode: Machine Modes. + * SHARED_BSS_SECTION_ASM_OP: Sections. + * SHARED_SECTION_ASM_OP: Sections. + * sharing of RTL components: Sharing. + * shift: Arithmetic. + * SHIFT_COUNT_TRUNCATED: Misc. + * SHORT_IMMEDIATES_SIGN_EXTEND: Misc. + * SHORT_TYPE_SIZE: Type Layout. + * sibcall_epilogue instruction pattern: Standard Names. + * sibling call optimization: Passes. + * SIBLING_CALL_P: Flags. + * sign_extend: Conversions. + * sign_extract: Bit-Fields. + * sign_extract, canonicalization of: Insn Canonicalizations. + * signed division: Arithmetic. + * signed maximum: Arithmetic. + * signed minimum: Arithmetic. + * SImode: Machine Modes. + * simple constraints: Simple Constraints. + * simplifications, arithmetic: Passes. + * Single Static Assignment optimizations: Passes. + * SIZE_TYPE: Type Layout. + * SLOW_BYTE_ACCESS: Costs. + * SLOW_UNALIGNED_ACCESS: Costs. + * SMALL_ARG_MAX: Host Config. + * SMALL_REGISTER_CLASSES: Register Classes. + * SMALL_STACK: Frame Layout. + * smax: Arithmetic. + * smaxM3 instruction pattern: Standard Names. + * smin: Arithmetic. + * sminM3 instruction pattern: Standard Names. + * smulM3_highpart instruction pattern: Standard Names. + * SPECIAL_MODE_PREDICATES: Misc. + * speed of instructions: Costs. + * splitting instructions: Insn Splitting. + * sqrt: Arithmetic. + * sqrtM2 instruction pattern: Standard Names. + * square root: Arithmetic. + * ss_minus: Arithmetic. + * ss_plus: Arithmetic. + * ss_truncate: Conversions. + * SSA Conditional Constant Propagation: Passes. + * SSA DCE: Passes. + * SSA optimizations: Passes. + * stack arguments: Stack Arguments. + * stack frame layout: Frame Layout. + * STACK_BOUNDARY: Storage Layout. + * STACK_CHECK_BUILTIN: Stack Checking. + * STACK_CHECK_FIXED_FRAME_SIZE: Stack Checking. + * STACK_CHECK_MAX_FRAME_SIZE: Stack Checking. + * STACK_CHECK_MAX_VAR_SIZE: Stack Checking. + * STACK_CHECK_PROBE_INTERVAL: Stack Checking. + * STACK_CHECK_PROBE_LOAD: Stack Checking. + * STACK_CHECK_PROTECT: Stack Checking. + * STACK_DYNAMIC_OFFSET: Frame Layout. + * STACK_DYNAMIC_OFFSET and virtual registers: Regs and Memory. + * STACK_GROWS_DOWNWARD: Frame Layout. + * STACK_PARMS_IN_REG_PARM_AREA: Stack Arguments. + * STACK_POINTER_OFFSET: Frame Layout. + * STACK_POINTER_OFFSET and virtual registers: Regs and Memory. + * STACK_POINTER_REGNUM: Frame Registers. + * STACK_POINTER_REGNUM and virtual registers: Regs and Memory. + * stack_pointer_rtx: Frame Registers. + * STACK_PUSH_CODE: Frame Layout. + * STACK_REGS: Stack Registers. + * STACK_SAVEAREA_MODE: Storage Layout. + * STACK_SIZE_MODE: Storage Layout. + * standard pattern names: Standard Names. + * STANDARD_EXEC_PREFIX: Driver. + * STANDARD_INCLUDE_COMPONENT: Driver. + * STANDARD_INCLUDE_DIR: Driver. + * STANDARD_STARTFILE_PREFIX: Driver. + * STARTFILE_SPEC: Driver. + * STARTING_FRAME_OFFSET: Frame Layout. + * STARTING_FRAME_OFFSET and virtual registers: Regs and Memory. + * statements: Function Bodies. + * STATIC_CHAIN: Frame Registers. + * STATIC_CHAIN_INCOMING: Frame Registers. + * STATIC_CHAIN_INCOMING_REGNUM: Frame Registers. + * STATIC_CHAIN_REGNUM: Frame Registers. + * stdarg.h and register arguments: Register Arguments. + * STDC_0_IN_SYSTEM_HEADERS: Misc. + * STMT_EXPR: Expression trees. + * STMT_IS_FULL_EXPR_P: Function Bodies. + * STMT_LINENO: Function Bodies. + * storage layout: Storage Layout. + * STORE_FLAG_VALUE: Misc. + * store_multiple instruction pattern: Standard Names. + * strcpy: Storage Layout. + * strength-reduction: Passes. + * STRICT_ALIGNMENT: Storage Layout. + * STRICT_ARGUMENT_NAMING: Varargs. + * strict_low_part: RTL Declarations. + * strict_memory_address_p: Addressing Modes. + * STRING_CST: Expression trees. + * STRING_POOL_ADDRESS_P: Flags. + * STRIP_NAME_ENCODING: Sections. + * strlenM instruction pattern: Standard Names. + * STRUCT_VALUE: Aggregate Return. + * STRUCT_VALUE_INCOMING: Aggregate Return. + * STRUCT_VALUE_INCOMING_REGNUM: Aggregate Return. + * STRUCT_VALUE_REGNUM: Aggregate Return. + * structure value address: Aggregate Return. + * STRUCTURE_SIZE_BOUNDARY: Storage Layout. + * structures, returning: Interface. + * subM3 instruction pattern: Standard Names. + * SUBOBJECT: Function Bodies. + * SUBOBJECT_CLEANUP: Function Bodies. + * subreg: Regs and Memory. + * subreg and /s: Flags. + * subreg and /u: Flags. + * subreg, in strict_low_part: RTL Declarations. + * subreg, special reload handling: Regs and Memory. + * SUBREG_BYTE: Regs and Memory. + * SUBREG_PROMOTED_UNSIGNED_P: Flags. + * SUBREG_PROMOTED_VAR_P: Flags. + * SUBREG_REG: Regs and Memory. + * SUCCESS_EXIT_CODE: Host Config. + * SUPPORTS_INIT_PRIORITY: Macros for Initialization. + * SUPPORTS_ONE_ONLY: Label Output. + * SUPPORTS_WEAK: Label Output. + * SWITCH_BODY: Function Bodies. + * SWITCH_COND: Function Bodies. + * SWITCH_CURTAILS_COMPILATION: Driver. + * SWITCH_STMT: Function Bodies. + * SWITCH_TAKES_ARG: Driver. + * SWITCHES_NEED_SPACES: Driver. + * symbol_ref: Constants. + * symbol_ref and /f: Flags. + * symbol_ref and /i: Flags. + * symbol_ref and /u: Flags. + * symbol_ref and /v: Flags. + * symbol_ref, RTL sharing: Sharing. + * SYMBOL_REF_FLAG: Flags. + * SYMBOL_REF_FLAG, in ENCODE_SECTION_INFO: Sections. + * SYMBOL_REF_USED: Flags. + * SYMBOL_REF_WEAK: Flags. + * symbolic label: Sharing. + * SYSTEM_INCLUDE_DIR: Driver. + * t-TARGET: Target Fragment. + * tablejump instruction pattern: Standard Names. + * tagging insns: Tagging Insns. + * tail calls: Tail Calls. + * tail recursion optimization: Passes. + * target attributes: Target Attributes. + * target description macros: Target Macros. + * target functions: Target Structure. + * target hooks: Target Structure. + * target makefile fragment: Target Fragment. + * target specifications: Run-time Target. + * target-parameter-dependent code: Passes. + * TARGET_ALLOWS_PROFILING_WITHOUT_FRAME_POINTER: Profiling. + * TARGET_ASM_ALIGNED_DI_OP: Data Output. + * TARGET_ASM_ALIGNED_HI_OP: Data Output. + * TARGET_ASM_ALIGNED_SI_OP: Data Output. + * TARGET_ASM_ALIGNED_TI_OP: Data Output. + * TARGET_ASM_BYTE_OP: Data Output. + * TARGET_ASM_CLOSE_PAREN: Data Output. + * TARGET_ASM_CONSTRUCTOR: Macros for Initialization. + * TARGET_ASM_DESTRUCTOR: Macros for Initialization. + * TARGET_ASM_EH_FRAME_SECTION: Exception Region Output. + * TARGET_ASM_EXCEPTION_SECTION: Exception Region Output. + * TARGET_ASM_FUNCTION_BEGIN_EPILOGUE: Function Entry. + * TARGET_ASM_FUNCTION_END_PROLOGUE: Function Entry. + * TARGET_ASM_FUNCTION_EPILOGUE: Function Entry. + * TARGET_ASM_FUNCTION_EPILOGUE and trampolines: Trampolines. + * TARGET_ASM_FUNCTION_PROLOGUE: Function Entry. + * TARGET_ASM_FUNCTION_PROLOGUE and trampolines: Trampolines. + * TARGET_ASM_INTEGER: Data Output. + * TARGET_ASM_NAMED_SECTION: File Framework. + * TARGET_ASM_OPEN_PAREN: Data Output. + * TARGET_ASM_UNALIGNED_DI_OP: Data Output. + * TARGET_ASM_UNALIGNED_HI_OP: Data Output. + * TARGET_ASM_UNALIGNED_SI_OP: Data Output. + * TARGET_ASM_UNALIGNED_TI_OP: Data Output. + * TARGET_ATTRIBUTE_TABLE: Target Attributes. + * TARGET_BELL: Escape Sequences. + * TARGET_BS: Escape Sequences. + * TARGET_CANNOT_MODIFY_JUMPS_P: Misc. + * TARGET_COMP_TYPE_ATTRIBUTES: Target Attributes. + * TARGET_CR: Escape Sequences. + * TARGET_DLLIMPORT_DECL_ATTRIBUTES: Target Attributes. + * TARGET_EDOM: Library Calls. + * TARGET_ESC: Escape Sequences. + * TARGET_EXECUTABLE_SUFFIX: Misc. + * TARGET_EXPAND_BUILTIN: Misc. + * TARGET_FF: Escape Sequences. + * TARGET_FLOAT_FORMAT: Storage Layout. + * TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P: Target Attributes. + * TARGET_HAS_F_SETLKW: Misc. + * TARGET_HAVE_CTORS_DTORS: Macros for Initialization. + * TARGET_HAVE_NAMED_SECTIONS: File Framework. + * TARGET_INIT_BUILTINS: Misc. + * TARGET_INSERT_ATTRIBUTES: Target Attributes. + * TARGET_MEM_FUNCTIONS: Library Calls. + * TARGET_MERGE_DECL_ATTRIBUTES: Target Attributes. + * TARGET_MERGE_TYPE_ATTRIBUTES: Target Attributes. + * TARGET_MS_BITFIELD_LAYOUT_P: Storage Layout. + * TARGET_NEWLINE: Escape Sequences. + * TARGET_OBJECT_SUFFIX: Misc. + * TARGET_OPTION_TRANSLATE_TABLE: Driver. + * TARGET_OPTIONS: Run-time Target. + * TARGET_PTRMEMFUNC_VBIT_LOCATION: Type Layout. + * TARGET_SCHED_ADJUST_COST: Scheduling. + * TARGET_SCHED_ADJUST_PRIORITY: Scheduling. + * TARGET_SCHED_CYCLE_DISPLAY: Scheduling. + * TARGET_SCHED_FINISH: Scheduling. + * TARGET_SCHED_INIT: Scheduling. + * TARGET_SCHED_ISSUE_RATE: Scheduling. + * TARGET_SCHED_REORDER: Scheduling. + * TARGET_SCHED_REORDER2: Scheduling. + * TARGET_SCHED_VARIABLE_ISSUE: Scheduling. + * TARGET_SECTION_TYPE_FLAGS: File Framework. + * TARGET_SET_DEFAULT_TYPE_ATTRIBUTES: Target Attributes. + * TARGET_SWITCHES: Run-time Target. + * TARGET_TAB: Escape Sequences. + * TARGET_VERSION: Run-time Target. + * TARGET_VT: Escape Sequences. + * TARGET_VTABLE_USES_DESCRIPTORS: Type Layout. + * targetm: Target Structure. + * targets, makefile: Makefile. + * TCmode: Machine Modes. + * TEMPLATE_DECL: Declarations. + * termination routines: Initialization. + * text_section: Sections. + * TEXT_SECTION: Sections. + * TEXT_SECTION_ASM_OP: Sections. + * TFmode: Machine Modes. + * THEN_CLAUSE: Function Bodies. + * THREAD_MODEL_SPEC: Driver. + * THROW_EXPR: Expression trees. + * THUNK_DECL: Declarations. + * THUNK_DELTA: Declarations. + * TImode: Machine Modes. + * TImode, in insn: Insns. + * tm.h macros: Target Macros. + * top level of compiler: Passes. + * TQFmode: Machine Modes. + * TRADITIONAL_RETURN_FLOAT: Scalar Return. + * TRAMPOLINE_ADJUST_ADDRESS: Trampolines. + * TRAMPOLINE_ALIGNMENT: Trampolines. + * TRAMPOLINE_SECTION: Trampolines. + * TRAMPOLINE_SIZE: Trampolines. + * TRAMPOLINE_TEMPLATE: Trampolines. + * trampolines for nested functions: Trampolines. + * TRANSFER_FROM_TRAMPOLINE: Trampolines. + * trap instruction pattern: Standard Names. + * tree <1>: Macros and Functions. + * tree: Tree overview. + * Tree optimization: Passes. + * TREE_CODE: Tree overview. + * tree_int_cst_equal: Expression trees. + * TREE_INT_CST_HIGH: Expression trees. + * TREE_INT_CST_LOW: Expression trees. + * tree_int_cst_lt: Expression trees. + * TREE_LIST: Containers. + * TREE_OPERAND: Expression trees. + * TREE_PUBLIC: Function Basics. + * TREE_PURPOSE: Containers. + * TREE_STRING_LENGTH: Expression trees. + * TREE_STRING_POINTER: Expression trees. + * TREE_TYPE <1>: Expression trees. + * TREE_TYPE <2>: Function Basics. + * TREE_TYPE <3>: Declarations. + * TREE_TYPE: Types. + * TREE_VALUE: Containers. + * TREE_VEC: Containers. + * TREE_VEC_ELT: Containers. + * TREE_VEC_LENGTH: Containers. + * TREE_VIA_PRIVATE: Classes. + * TREE_VIA_PROTECTED: Classes. + * TREE_VIA_PUBLIC: Classes. + * Trees: Trees. + * TRULY_NOOP_TRUNCATION: Misc. + * TRUNC_DIV_EXPR: Expression trees. + * TRUNC_MOD_EXPR: Expression trees. + * truncate: Conversions. + * truncMN2 instruction pattern: Standard Names. + * TRUTH_AND_EXPR: Expression trees. + * TRUTH_ANDIF_EXPR: Expression trees. + * TRUTH_NOT_EXPR: Expression trees. + * TRUTH_OR_EXPR: Expression trees. + * TRUTH_ORIF_EXPR: Expression trees. + * TRUTH_XOR_EXPR: Expression trees. + * TRY_BLOCK: Function Bodies. + * TRY_HANDLERS: Function Bodies. + * TRY_STMTS: Function Bodies. + * tstM instruction pattern: Standard Names. + * type: Types. + * type declaration: Declarations. + * TYPE_ALIGN: Types. + * TYPE_ARG_TYPES: Types. + * TYPE_ATTRIBUTES: Attributes. + * TYPE_BINFO: Classes. + * TYPE_BUILT_IN: Types. + * TYPE_CONTEXT: Types. + * TYPE_DECL: Declarations. + * TYPE_FIELDS <1>: Classes. + * TYPE_FIELDS: Types. + * TYPE_HAS_ARRAY_NEW_OPERATOR: Classes. + * TYPE_HAS_DEFAULT_CONSTRUCTOR: Classes. + * TYPE_HAS_MUTABLE_P: Classes. + * TYPE_HAS_NEW_OPERATOR: Classes. + * TYPE_MAIN_VARIANT: Types. + * TYPE_MAX_VALUE: Types. + * TYPE_METHOD_BASETYPE: Types. + * TYPE_METHODS: Classes. + * TYPE_MIN_VALUE: Types. + * TYPE_NAME: Types. + * TYPE_NOTHROW_P: Function Basics. + * TYPE_OFFSET_BASETYPE: Types. + * TYPE_OVERLOADS_ARRAY_REF: Classes. + * TYPE_OVERLOADS_ARROW: Classes. + * TYPE_OVERLOADS_CALL_EXPR: Classes. + * TYPE_POLYMORPHIC_P: Classes. + * TYPE_PRECISION: Types. + * TYPE_PTR_P: Types. + * TYPE_PTRFN_P: Types. + * TYPE_PTRMEM_P: Types. + * TYPE_PTROB_P: Types. + * TYPE_PTROBV_P: Types. + * TYPE_QUAL_CONST: Types. + * TYPE_QUAL_RESTRICT: Types. + * TYPE_QUAL_VOLATILE: Types. + * TYPE_RAISES_EXCEPTIONS: Function Basics. + * TYPE_SIZE: Types. + * TYPE_UNQUALIFIED: Types. + * TYPE_VFIELD: Classes. + * TYPENAME_TYPE: Types. + * TYPENAME_TYPE_FULLNAME: Types. + * TYPEOF_TYPE: Types. + * udiv: Arithmetic. + * UDIVDI3_LIBCALL: Library Calls. + * udivM3 instruction pattern: Standard Names. + * udivmodM4 instruction pattern: Standard Names. + * UDIVSI3_LIBCALL: Library Calls. + * UINTMAX_TYPE: Type Layout. + * umax: Arithmetic. + * umaxM3 instruction pattern: Standard Names. + * umin: Arithmetic. + * uminM3 instruction pattern: Standard Names. + * umod: Arithmetic. + * UMODDI3_LIBCALL: Library Calls. + * umodM3 instruction pattern: Standard Names. + * UMODSI3_LIBCALL: Library Calls. + * umulhisi3 instruction pattern: Standard Names. + * umulM3_highpart instruction pattern: Standard Names. + * umulqihi3 instruction pattern: Standard Names. + * umulsidi3 instruction pattern: Standard Names. + * unchanging: Flags. + * unchanging, in call_insn: Flags. + * unchanging, in insn: Flags. + * unchanging, in reg and mem: Flags. + * unchanging, in subreg: Flags. + * unchanging, in symbol_ref: Flags. + * UNION_TYPE <1>: Classes. + * UNION_TYPE: Types. + * unions, returning: Interface. + * UNIQUE_SECTION: Sections. + * UNITS_PER_WORD: Storage Layout. + * UNKNOWN_FLOAT_FORMAT: Storage Layout. + * UNKNOWN_TYPE: Types. + * unreachable code: Passes. + * unshare_all_rtl: Sharing. + * unsigned division: Arithmetic. + * unsigned greater than: Comparisons. + * unsigned less than: Comparisons. + * unsigned minimum and maximum: Arithmetic. + * unsigned_fix: Conversions. + * unsigned_float: Conversions. + * unspec: Side Effects. + * unspec_volatile: Side Effects. + * untyped_call instruction pattern: Standard Names. + * untyped_return instruction pattern: Standard Names. + * UPDATE_PATH_HOST_CANONICALIZE (PATH): Host Config. + * us_minus: Arithmetic. + * us_plus: Arithmetic. + * us_truncate: Conversions. + * use: Side Effects. + * USE_C_ALLOCA: Host Config. + * USE_LOAD_POST_DECREMENT: Costs. + * USE_LOAD_POST_INCREMENT: Costs. + * USE_LOAD_PRE_DECREMENT: Costs. + * USE_LOAD_PRE_INCREMENT: Costs. + * USE_STORE_POST_DECREMENT: Costs. + * USE_STORE_POST_INCREMENT: Costs. + * USE_STORE_PRE_DECREMENT: Costs. + * USE_STORE_PRE_INCREMENT: Costs. + * used: Flags. + * used, in symbol_ref: Flags. + * USER_LABEL_PREFIX: Instruction Output. + * USING_DECL: Declarations. + * USING_STMT: Function Bodies. + * V in constraint: Simple Constraints. + * values, returned by functions: Scalar Return. + * VAR_DECL <1>: Expression trees. + * VAR_DECL: Declarations. + * varargs implementation: Varargs. + * variable: Declarations. + * VAX_FLOAT_FORMAT: Storage Layout. + * vec_concat: Vector Operations. + * vec_const: Vector Operations. + * vec_duplicate: Vector Operations. + * vec_merge: Vector Operations. + * vec_select: Vector Operations. + * vector: Containers. + * vector operations: Vector Operations. + * VECTOR_CST: Expression trees. + * VECTOR_MODE_SUPPORTED_P: Storage Layout. + * VIRTUAL_INCOMING_ARGS_REGNUM: Regs and Memory. + * VIRTUAL_OUTGOING_ARGS_REGNUM: Regs and Memory. + * VIRTUAL_STACK_DYNAMIC_REGNUM: Regs and Memory. + * VIRTUAL_STACK_VARS_REGNUM: Regs and Memory. + * VMS: Host Config. + * VMS_DEBUGGING_INFO: VMS Debug. + * VOID_TYPE: Types. + * VOIDmode: Machine Modes. + * volatil: Flags. + * volatil, in insn: Flags. + * volatil, in label_ref: Flags. + * volatil, in mem: Flags. + * volatil, in reg: Flags. + * volatil, in symbol_ref: Flags. + * volatile memory references: Flags. + * voting between constraint alternatives: Class Preferences. + * VTABLE_REF: Expression trees. + * WCHAR_TYPE: Type Layout. + * WCHAR_TYPE_SIZE: Type Layout. + * which_alternative: Output Statement. + * WHILE_BODY: Function Bodies. + * WHILE_COND: Function Bodies. + * WHILE_STMT: Function Bodies. + * WIDEST_HARDWARE_FP_SIZE: Type Layout. + * WINT_TYPE: Type Layout. + * word_mode: Machine Modes. + * WORD_REGISTER_OPERATIONS: Misc. + * WORD_SWITCH_TAKES_ARG: Driver. + * WORDS_BIG_ENDIAN: Storage Layout. + * WORDS_BIG_ENDIAN, effect on subreg: Regs and Memory. + * X in constraint: Simple Constraints. + * x-HOST: Host Fragment. + * XCmode: Machine Modes. + * XCOFF_DEBUGGING_INFO: DBX Options. + * XEXP: Accessors. + * XFmode: Machine Modes. + * XINT: Accessors. + * xm-MACHINE.h: Host Config. + * xor: Arithmetic. + * xor, canonicalization of: Insn Canonicalizations. + * xorM3 instruction pattern: Standard Names. + * XSTR: Accessors. + * XVEC: Accessors. + * XVECEXP: Accessors. + * XVECLEN: Accessors. + * XWINT: Accessors. + * zero_extend: Conversions. + * zero_extendMN2 instruction pattern: Standard Names. + * zero_extract: Bit-Fields. + * zero_extract, canonicalization of: Insn Canonicalizations. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-3 gcc-3.2.3/gcc/doc/gccint.info-3 *** gcc-3.2.2/gcc/doc/gccint.info-3 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-3 Tue Apr 22 07:07:18 2003 *************** *** 0 **** --- 1,896 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Types, Next: Scopes, Prev: Tree overview, Up: Trees + + Types + ===== + + All types have corresponding tree nodes. However, you should not + assume that there is exactly one tree node corresponding to each type. + There are often several nodes each of which correspond to the same type. + + For the most part, different kinds of types have different tree + codes. (For example, pointer types use a `POINTER_TYPE' code while + arrays use an `ARRAY_TYPE' code.) However, pointers to member functions + use the `RECORD_TYPE' code. Therefore, when writing a `switch' + statement that depends on the code associated with a particular type, + you should take care to handle pointers to member functions under the + `RECORD_TYPE' case label. + + In C++, an array type is not qualified; rather the type of the array + elements is qualified. This situation is reflected in the intermediate + representation. The macros described here will always examine the + qualification of the underlying element type when applied to an array + type. (If the element type is itself an array, then the recursion + continues until a non-array type is found, and the qualification of this + type is examined.) So, for example, `CP_TYPE_CONST_P' will hold of the + type `const int ()[7]', denoting an array of seven `int's. + + The following functions and macros deal with cv-qualification of + types: + `CP_TYPE_QUALS' + This macro returns the set of type qualifiers applied to this type. + This value is `TYPE_UNQUALIFIED' if no qualifiers have been + applied. The `TYPE_QUAL_CONST' bit is set if the type is + `const'-qualified. The `TYPE_QUAL_VOLATILE' bit is set if the + type is `volatile'-qualified. The `TYPE_QUAL_RESTRICT' bit is set + if the type is `restrict'-qualified. + + `CP_TYPE_CONST_P' + This macro holds if the type is `const'-qualified. + + `CP_TYPE_VOLATILE_P' + This macro holds if the type is `volatile'-qualified. + + `CP_TYPE_RESTRICT_P' + This macro holds if the type is `restrict'-qualified. + + `CP_TYPE_CONST_NON_VOLATILE_P' + This predicate holds for a type that is `const'-qualified, but + _not_ `volatile'-qualified; other cv-qualifiers are ignored as + well: only the `const'-ness is tested. + + `TYPE_MAIN_VARIANT' + This macro returns the unqualified version of a type. It may be + applied to an unqualified type, but it is not always the identity + function in that case. + + A few other macros and functions are usable with all types: + `TYPE_SIZE' + The number of bits required to represent the type, represented as + an `INTEGER_CST'. For an incomplete type, `TYPE_SIZE' will be + `NULL_TREE'. + + `TYPE_ALIGN' + The alignment of the type, in bits, represented as an `int'. + + `TYPE_NAME' + This macro returns a declaration (in the form of a `TYPE_DECL') for + the type. (Note this macro does _not_ return a `IDENTIFIER_NODE', + as you might expect, given its name!) You can look at the + `DECL_NAME' of the `TYPE_DECL' to obtain the actual name of the + type. The `TYPE_NAME' will be `NULL_TREE' for a type that is not + a built-in type, the result of a typedef, or a named class type. + + `CP_INTEGRAL_TYPE' + This predicate holds if the type is an integral type. Notice that + in C++, enumerations are _not_ integral types. + + `ARITHMETIC_TYPE_P' + This predicate holds if the type is an integral type (in the C++ + sense) or a floating point type. + + `CLASS_TYPE_P' + This predicate holds for a class-type. + + `TYPE_BUILT_IN' + This predicate holds for a built-in type. + + `TYPE_PTRMEM_P' + This predicate holds if the type is a pointer to data member. + + `TYPE_PTR_P' + This predicate holds if the type is a pointer type, and the + pointee is not a data member. + + `TYPE_PTRFN_P' + This predicate holds for a pointer to function type. + + `TYPE_PTROB_P' + This predicate holds for a pointer to object type. Note however + that it does not hold for the generic pointer to object type `void + *'. You may use `TYPE_PTROBV_P' to test for a pointer to object + type as well as `void *'. + + `same_type_p' + This predicate takes two types as input, and holds if they are the + same type. For example, if one type is a `typedef' for the other, + or both are `typedef's for the same type. This predicate also + holds if the two trees given as input are simply copies of one + another; i.e., there is no difference between them at the source + level, but, for whatever reason, a duplicate has been made in the + representation. You should never use `==' (pointer equality) to + compare types; always use `same_type_p' instead. + + Detailed below are the various kinds of types, and the macros that + can be used to access them. Although other kinds of types are used + elsewhere in G++, the types described here are the only ones that you + will encounter while examining the intermediate representation. + + `VOID_TYPE' + Used to represent the `void' type. + + `INTEGER_TYPE' + Used to represent the various integral types, including `char', + `short', `int', `long', and `long long'. This code is not used + for enumeration types, nor for the `bool' type. Note that GCC's + `CHAR_TYPE' node is _not_ used to represent `char'. The + `TYPE_PRECISION' is the number of bits used in the representation, + represented as an `unsigned int'. (Note that in the general case + this is not the same value as `TYPE_SIZE'; suppose that there were + a 24-bit integer type, but that alignment requirements for the ABI + required 32-bit alignment. Then, `TYPE_SIZE' would be an + `INTEGER_CST' for 32, while `TYPE_PRECISION' would be 24.) The + integer type is unsigned if `TREE_UNSIGNED' holds; otherwise, it + is signed. + + The `TYPE_MIN_VALUE' is an `INTEGER_CST' for the smallest integer + that may be represented by this type. Similarly, the + `TYPE_MAX_VALUE' is an `INTEGER_CST' for the largest integer that + may be represented by this type. + + `REAL_TYPE' + Used to represent the `float', `double', and `long double' types. + The number of bits in the floating-point representation is given + by `TYPE_PRECISION', as in the `INTEGER_TYPE' case. + + `COMPLEX_TYPE' + Used to represent GCC built-in `__complex__' data types. The + `TREE_TYPE' is the type of the real and imaginary parts. + + `ENUMERAL_TYPE' + Used to represent an enumeration type. The `TYPE_PRECISION' gives + (as an `int'), the number of bits used to represent the type. If + there are no negative enumeration constants, `TREE_UNSIGNED' will + hold. The minimum and maximum enumeration constants may be + obtained with `TYPE_MIN_VALUE' and `TYPE_MAX_VALUE', respectively; + each of these macros returns an `INTEGER_CST'. + + The actual enumeration constants themselves may be obtained by + looking at the `TYPE_VALUES'. This macro will return a + `TREE_LIST', containing the constants. The `TREE_PURPOSE' of each + node will be an `IDENTIFIER_NODE' giving the name of the constant; + the `TREE_VALUE' will be an `INTEGER_CST' giving the value + assigned to that constant. These constants will appear in the + order in which they were declared. The `TREE_TYPE' of each of + these constants will be the type of enumeration type itself. + + `BOOLEAN_TYPE' + Used to represent the `bool' type. + + `POINTER_TYPE' + Used to represent pointer types, and pointer to data member types. + The `TREE_TYPE' gives the type to which this type points. If the + type is a pointer to data member type, then `TYPE_PTRMEM_P' will + hold. For a pointer to data member type of the form `T X::*', + `TYPE_PTRMEM_CLASS_TYPE' will be the type `X', while + `TYPE_PTRMEM_POINTED_TO_TYPE' will be the type `T'. + + `REFERENCE_TYPE' + Used to represent reference types. The `TREE_TYPE' gives the type + to which this type refers. + + `FUNCTION_TYPE' + Used to represent the type of non-member functions and of static + member functions. The `TREE_TYPE' gives the return type of the + function. The `TYPE_ARG_TYPES' are a `TREE_LIST' of the argument + types. The `TREE_VALUE' of each node in this list is the type of + the corresponding argument; the `TREE_PURPOSE' is an expression + for the default argument value, if any. If the last node in the + list is `void_list_node' (a `TREE_LIST' node whose `TREE_VALUE' is + the `void_type_node'), then functions of this type do not take + variable arguments. Otherwise, they do take a variable number of + arguments. + + Note that in C (but not in C++) a function declared like `void f()' + is an unprototyped function taking a variable number of arguments; + the `TYPE_ARG_TYPES' of such a function will be `NULL'. + + `METHOD_TYPE' + Used to represent the type of a non-static member function. Like a + `FUNCTION_TYPE', the return type is given by the `TREE_TYPE'. The + type of `*this', i.e., the class of which functions of this type + are a member, is given by the `TYPE_METHOD_BASETYPE'. The + `TYPE_ARG_TYPES' is the parameter list, as for a `FUNCTION_TYPE', + and includes the `this' argument. + + `ARRAY_TYPE' + Used to represent array types. The `TREE_TYPE' gives the type of + the elements in the array. If the array-bound is present in the + type, the `TYPE_DOMAIN' is an `INTEGER_TYPE' whose + `TYPE_MIN_VALUE' and `TYPE_MAX_VALUE' will be the lower and upper + bounds of the array, respectively. The `TYPE_MIN_VALUE' will + always be an `INTEGER_CST' for zero, while the `TYPE_MAX_VALUE' + will be one less than the number of elements in the array, i.e., + the highest value which may be used to index an element in the + array. + + `RECORD_TYPE' + Used to represent `struct' and `class' types, as well as pointers + to member functions and similar constructs in other languages. + `TYPE_FIELDS' contains the items contained in this type, each of + which can be a `FIELD_DECL', `VAR_DECL', `CONST_DECL', or + `TYPE_DECL'. You may not make any assumptions about the ordering + of the fields in the type or whether one or more of them overlap. + If `TYPE_PTRMEMFUNC_P' holds, then this type is a pointer-to-member + type. In that case, the `TYPE_PTRMEMFUNC_FN_TYPE' is a + `POINTER_TYPE' pointing to a `METHOD_TYPE'. The `METHOD_TYPE' is + the type of a function pointed to by the pointer-to-member + function. If `TYPE_PTRMEMFUNC_P' does not hold, this type is a + class type. For more information, see *note Classes::. + + `UNION_TYPE' + Used to represent `union' types. Similar to `RECORD_TYPE' except + that all `FIELD_DECL' nodes in `TYPE_FIELD' start at bit position + zero. + + `QUAL_UNION_TYPE' + Used to represent part of a variant record in Ada. Similar to + `UNION_TYPE' except that each `FIELD_DECL' has a `DECL_QUALIFIER' + field, which contains a boolean expression that indicates whether + the field is present in the object. The type will only have one + field, so each field's `DECL_QUALIFIER' is only evaluated if none + of the expressions in the previous fields in `TYPE_FIELDS' are + nonzero. Normally these expressions will reference a field in the + outer object using a `PLACEHOLDER_EXPR'. + + `UNKNOWN_TYPE' + This node is used to represent a type the knowledge of which is + insufficient for a sound processing. + + `OFFSET_TYPE' + This node is used to represent a data member; for example a + pointer-to-data-member is represented by a `POINTER_TYPE' whose + `TREE_TYPE' is an `OFFSET_TYPE'. For a data member `X::m' the + `TYPE_OFFSET_BASETYPE' is `X' and the `TREE_TYPE' is the type of + `m'. + + `TYPENAME_TYPE' + Used to represent a construct of the form `typename T::A'. The + `TYPE_CONTEXT' is `T'; the `TYPE_NAME' is an `IDENTIFIER_NODE' for + `A'. If the type is specified via a template-id, then + `TYPENAME_TYPE_FULLNAME' yields a `TEMPLATE_ID_EXPR'. The + `TREE_TYPE' is non-`NULL' if the node is implicitly generated in + support for the implicit typename extension; in which case the + `TREE_TYPE' is a type node for the base-class. + + `TYPEOF_TYPE' + Used to represent the `__typeof__' extension. The `TYPE_FIELDS' + is the expression the type of which is being represented. + + There are variables whose values represent some of the basic types. + These include: + `void_type_node' + A node for `void'. + + `integer_type_node' + A node for `int'. + + `unsigned_type_node.' + A node for `unsigned int'. + + `char_type_node.' + A node for `char'. + + It may sometimes be useful to compare one of these variables with a type + in hand, using `same_type_p'. + +  + File: gccint.info, Node: Scopes, Next: Functions, Prev: Types, Up: Trees + + Scopes + ====== + + The root of the entire intermediate representation is the variable + `global_namespace'. This is the namespace specified with `::' in C++ + source code. All other namespaces, types, variables, functions, and so + forth can be found starting with this namespace. + + Besides namespaces, the other high-level scoping construct in C++ is + the class. (Throughout this manual the term "class" is used to mean the + types referred to in the ANSI/ISO C++ Standard as classes; these include + types defined with the `class', `struct', and `union' keywords.) + + * Menu: + + * Namespaces:: Member functions, types, etc. + * Classes:: Members, bases, friends, etc. + +  + File: gccint.info, Node: Namespaces, Next: Classes, Up: Scopes + + Namespaces + ---------- + + A namespace is represented by a `NAMESPACE_DECL' node. + + However, except for the fact that it is distinguished as the root of + the representation, the global namespace is no different from any other + namespace. Thus, in what follows, we describe namespaces generally, + rather than the global namespace in particular. + + The following macros and functions can be used on a `NAMESPACE_DECL': + + `DECL_NAME' + This macro is used to obtain the `IDENTIFIER_NODE' corresponding to + the unqualified name of the name of the namespace (*note + Identifiers::). The name of the global namespace is `::', even + though in C++ the global namespace is unnamed. However, you + should use comparison with `global_namespace', rather than + `DECL_NAME' to determine whether or not a namespaces is the global + one. An unnamed namespace will have a `DECL_NAME' equal to + `anonymous_namespace_name'. Within a single translation unit, all + unnamed namespaces will have the same name. + + `DECL_CONTEXT' + This macro returns the enclosing namespace. The `DECL_CONTEXT' for + the `global_namespace' is `NULL_TREE'. + + `DECL_NAMESPACE_ALIAS' + If this declaration is for a namespace alias, then + `DECL_NAMESPACE_ALIAS' is the namespace for which this one is an + alias. + + Do not attempt to use `cp_namespace_decls' for a namespace which is + an alias. Instead, follow `DECL_NAMESPACE_ALIAS' links until you + reach an ordinary, non-alias, namespace, and call + `cp_namespace_decls' there. + + `DECL_NAMESPACE_STD_P' + This predicate holds if the namespace is the special `::std' + namespace. + + `cp_namespace_decls' + This function will return the declarations contained in the + namespace, including types, overloaded functions, other + namespaces, and so forth. If there are no declarations, this + function will return `NULL_TREE'. The declarations are connected + through their `TREE_CHAIN' fields. + + Although most entries on this list will be declarations, + `TREE_LIST' nodes may also appear. In this case, the `TREE_VALUE' + will be an `OVERLOAD'. The value of the `TREE_PURPOSE' is + unspecified; back ends should ignore this value. As with the + other kinds of declarations returned by `cp_namespace_decls', the + `TREE_CHAIN' will point to the next declaration in this list. + + For more information on the kinds of declarations that can occur + on this list, *Note Declarations::. Some declarations will not + appear on this list. In particular, no `FIELD_DECL', + `LABEL_DECL', or `PARM_DECL' nodes will appear here. + + This function cannot be used with namespaces that have + `DECL_NAMESPACE_ALIAS' set. + + +  + File: gccint.info, Node: Classes, Prev: Namespaces, Up: Scopes + + Classes + ------- + + A class type is represented by either a `RECORD_TYPE' or a + `UNION_TYPE'. A class declared with the `union' tag is represented by + a `UNION_TYPE', while classes declared with either the `struct' or the + `class' tag are represented by `RECORD_TYPE's. You can use the + `CLASSTYPE_DECLARED_CLASS' macro to discern whether or not a particular + type is a `class' as opposed to a `struct'. This macro will be true + only for classes declared with the `class' tag. + + Almost all non-function members are available on the `TYPE_FIELDS' + list. Given one member, the next can be found by following the + `TREE_CHAIN'. You should not depend in any way on the order in which + fields appear on this list. All nodes on this list will be `DECL' + nodes. A `FIELD_DECL' is used to represent a non-static data member, a + `VAR_DECL' is used to represent a static data member, and a `TYPE_DECL' + is used to represent a type. Note that the `CONST_DECL' for an + enumeration constant will appear on this list, if the enumeration type + was declared in the class. (Of course, the `TYPE_DECL' for the + enumeration type will appear here as well.) There are no entries for + base classes on this list. In particular, there is no `FIELD_DECL' for + the "base-class portion" of an object. + + The `TYPE_VFIELD' is a compiler-generated field used to point to + virtual function tables. It may or may not appear on the `TYPE_FIELDS' + list. However, back ends should handle the `TYPE_VFIELD' just like all + the entries on the `TYPE_FIELDS' list. + + The function members are available on the `TYPE_METHODS' list. + Again, subsequent members are found by following the `TREE_CHAIN' + field. If a function is overloaded, each of the overloaded functions + appears; no `OVERLOAD' nodes appear on the `TYPE_METHODS' list. + Implicitly declared functions (including default constructors, copy + constructors, assignment operators, and destructors) will appear on + this list as well. + + Every class has an associated "binfo", which can be obtained with + `TYPE_BINFO'. Binfos are used to represent base-classes. The binfo + given by `TYPE_BINFO' is the degenerate case, whereby every class is + considered to be its own base-class. The base classes for a particular + binfo can be obtained with `BINFO_BASETYPES'. These base-classes are + themselves binfos. The class type associated with a binfo is given by + `BINFO_TYPE'. It is always the case that `BINFO_TYPE (TYPE_BINFO (x))' + is the same type as `x', up to qualifiers. However, it is not always + the case that `TYPE_BINFO (BINFO_TYPE (y))' is always the same binfo as + `y'. The reason is that if `y' is a binfo representing a base-class + `B' of a derived class `D', then `BINFO_TYPE (y)' will be `B', and + `TYPE_BINFO (BINFO_TYPE (y))' will be `B' as its own base-class, rather + than as a base-class of `D'. + + The `BINFO_BASETYPES' is a `TREE_VEC' (*note Containers::). Base + types appear in left-to-right order in this vector. You can tell + whether or `public', `protected', or `private' inheritance was used by + using the `TREE_VIA_PUBLIC', `TREE_VIA_PROTECTED', and + `TREE_VIA_PRIVATE' macros. Each of these macros takes a `BINFO' and is + true if and only if the indicated kind of inheritance was used. If + `TREE_VIA_VIRTUAL' holds of a binfo, then its `BINFO_TYPE' was + inherited from virtually. + + The following macros can be used on a tree node representing a + class-type. + + `LOCAL_CLASS_P' + This predicate holds if the class is local class _i.e._ declared + inside a function body. + + `TYPE_POLYMORPHIC_P' + This predicate holds if the class has at least one virtual function + (declared or inherited). + + `TYPE_HAS_DEFAULT_CONSTRUCTOR' + This predicate holds whenever its argument represents a class-type + with default constructor. + + `CLASSTYPE_HAS_MUTABLE' + + `TYPE_HAS_MUTABLE_P' + These predicates hold for a class-type having a mutable data + member. + + `CLASSTYPE_NON_POD_P' + This predicate holds only for class-types that are not PODs. + + `TYPE_HAS_NEW_OPERATOR' + This predicate holds for a class-type that defines `operator new'. + + `TYPE_HAS_ARRAY_NEW_OPERATOR' + This predicate holds for a class-type for which `operator new[]' + is defined. + + `TYPE_OVERLOADS_CALL_EXPR' + This predicate holds for class-type for which the function call + `operator()' is overloaded. + + `TYPE_OVERLOADS_ARRAY_REF' + This predicate holds for a class-type that overloads `operator[]' + + `TYPE_OVERLOADS_ARROW' + This predicate holds for a class-type for which `operator->' is + overloaded. + + +  + File: gccint.info, Node: Declarations, Next: Attributes, Prev: Functions, Up: Trees + + Declarations + ============ + + This section covers the various kinds of declarations that appear in + the internal representation, except for declarations of functions + (represented by `FUNCTION_DECL' nodes), which are described in *Note + Functions::. + + Some macros can be used with any kind of declaration. These include: + `DECL_NAME' + This macro returns an `IDENTIFIER_NODE' giving the name of the + entity. + + `TREE_TYPE' + This macro returns the type of the entity declared. + + `DECL_SOURCE_FILE' + This macro returns the name of the file in which the entity was + declared, as a `char*'. For an entity declared implicitly by the + compiler (like `__builtin_memcpy'), this will be the string + `""'. + + `DECL_SOURCE_LINE' + This macro returns the line number at which the entity was + declared, as an `int'. + + `DECL_ARTIFICIAL' + This predicate holds if the declaration was implicitly generated + by the compiler. For example, this predicate will hold of an + implicitly declared member function, or of the `TYPE_DECL' + implicitly generated for a class type. Recall that in C++ code + like: + struct S {}; + + is roughly equivalent to C code like: + struct S {}; + typedef struct S S; + The implicitly generated `typedef' declaration is represented by a + `TYPE_DECL' for which `DECL_ARTIFICIAL' holds. + + `DECL_NAMESPACE_SCOPE_P' + This predicate holds if the entity was declared at a namespace + scope. + + `DECL_CLASS_SCOPE_P' + This predicate holds if the entity was declared at a class scope. + + `DECL_FUNCTION_SCOPE_P' + This predicate holds if the entity was declared inside a function + body. + + + The various kinds of declarations include: + `LABEL_DECL' + These nodes are used to represent labels in function bodies. For + more information, see *Note Functions::. These nodes only appear + in block scopes. + + `CONST_DECL' + These nodes are used to represent enumeration constants. The + value of the constant is given by `DECL_INITIAL' which will be an + `INTEGER_CST' with the same type as the `TREE_TYPE' of the + `CONST_DECL', i.e., an `ENUMERAL_TYPE'. + + `RESULT_DECL' + These nodes represent the value returned by a function. When a + value is assigned to a `RESULT_DECL', that indicates that the + value should be returned, via bitwise copy, by the function. You + can use `DECL_SIZE' and `DECL_ALIGN' on a `RESULT_DECL', just as + with a `VAR_DECL'. + + `TYPE_DECL' + These nodes represent `typedef' declarations. The `TREE_TYPE' is + the type declared to have the name given by `DECL_NAME'. In some + cases, there is no associated name. + + `VAR_DECL' + These nodes represent variables with namespace or block scope, as + well as static data members. The `DECL_SIZE' and `DECL_ALIGN' are + analogous to `TYPE_SIZE' and `TYPE_ALIGN'. For a declaration, you + should always use the `DECL_SIZE' and `DECL_ALIGN' rather than the + `TYPE_SIZE' and `TYPE_ALIGN' given by the `TREE_TYPE', since + special attributes may have been applied to the variable to give + it a particular size and alignment. You may use the predicates + `DECL_THIS_STATIC' or `DECL_THIS_EXTERN' to test whether the + storage class specifiers `static' or `extern' were used to declare + a variable. + + If this variable is initialized (but does not require a + constructor), the `DECL_INITIAL' will be an expression for the + initializer. The initializer should be evaluated, and a bitwise + copy into the variable performed. If the `DECL_INITIAL' is the + `error_mark_node', there is an initializer, but it is given by an + explicit statement later in the code; no bitwise copy is required. + + GCC provides an extension that allows either automatic variables, + or global variables, to be placed in particular registers. This + extension is being used for a particular `VAR_DECL' if + `DECL_REGISTER' holds for the `VAR_DECL', and if + `DECL_ASSEMBLER_NAME' is not equal to `DECL_NAME'. In that case, + `DECL_ASSEMBLER_NAME' is the name of the register into which the + variable will be placed. + + `PARM_DECL' + Used to represent a parameter to a function. Treat these nodes + similarly to `VAR_DECL' nodes. These nodes only appear in the + `DECL_ARGUMENTS' for a `FUNCTION_DECL'. + + The `DECL_ARG_TYPE' for a `PARM_DECL' is the type that will + actually be used when a value is passed to this function. It may + be a wider type than the `TREE_TYPE' of the parameter; for + example, the ordinary type might be `short' while the + `DECL_ARG_TYPE' is `int'. + + `FIELD_DECL' + These nodes represent non-static data members. The `DECL_SIZE' and + `DECL_ALIGN' behave as for `VAR_DECL' nodes. The + `DECL_FIELD_BITPOS' gives the first bit used for this field, as an + `INTEGER_CST'. These values are indexed from zero, where zero + indicates the first bit in the object. + + If `DECL_C_BIT_FIELD' holds, this field is a bit-field. + + `NAMESPACE_DECL' + *Note Namespaces::. + + `TEMPLATE_DECL' + These nodes are used to represent class, function, and variable + (static data member) templates. The + `DECL_TEMPLATE_SPECIALIZATIONS' are a `TREE_LIST'. The + `TREE_VALUE' of each node in the list is a `TEMPLATE_DECL's or + `FUNCTION_DECL's representing specializations (including + instantiations) of this template. Back ends can safely ignore + `TEMPLATE_DECL's, but should examine `FUNCTION_DECL' nodes on the + specializations list just as they would ordinary `FUNCTION_DECL' + nodes. + + For a class template, the `DECL_TEMPLATE_INSTANTIATIONS' list + contains the instantiations. The `TREE_VALUE' of each node is an + instantiation of the class. The `DECL_TEMPLATE_SPECIALIZATIONS' + contains partial specializations of the class. + + `USING_DECL' + Back ends can safely ignore these nodes. + + +  + File: gccint.info, Node: Functions, Next: Declarations, Prev: Scopes, Up: Trees + + Functions + ========= + + A function is represented by a `FUNCTION_DECL' node. A set of + overloaded functions is sometimes represented by a `OVERLOAD' node. + + An `OVERLOAD' node is not a declaration, so none of the `DECL_' + macros should be used on an `OVERLOAD'. An `OVERLOAD' node is similar + to a `TREE_LIST'. Use `OVL_CURRENT' to get the function associated + with an `OVERLOAD' node; use `OVL_NEXT' to get the next `OVERLOAD' node + in the list of overloaded functions. The macros `OVL_CURRENT' and + `OVL_NEXT' are actually polymorphic; you can use them to work with + `FUNCTION_DECL' nodes as well as with overloads. In the case of a + `FUNCTION_DECL', `OVL_CURRENT' will always return the function itself, + and `OVL_NEXT' will always be `NULL_TREE'. + + To determine the scope of a function, you can use the + `DECL_REAL_CONTEXT' macro. This macro will return the class (either a + `RECORD_TYPE' or a `UNION_TYPE') or namespace (a `NAMESPACE_DECL') of + which the function is a member. For a virtual function, this macro + returns the class in which the function was actually defined, not the + base class in which the virtual declaration occurred. If a friend + function is defined in a class scope, the `DECL_CLASS_CONTEXT' macro + can be used to determine the class in which it was defined. For + example, in + class C { friend void f() {} }; + the `DECL_REAL_CONTEXT' for `f' will be the `global_namespace', but + the `DECL_CLASS_CONTEXT' will be the `RECORD_TYPE' for `C'. + + The `DECL_REAL_CONTEXT' and `DECL_CLASS_CONTEXT' are not available + in C; instead you should simply use `DECL_CONTEXT'. In C, the + `DECL_CONTEXT' for a function maybe another function. This + representation indicates that the GNU nested function extension is in + use. For details on the semantics of nested functions, see the GCC + Manual. The nested function can refer to local variables in its + containing function. Such references are not explicitly marked in the + tree structure; back ends must look at the `DECL_CONTEXT' for the + referenced `VAR_DECL'. If the `DECL_CONTEXT' for the referenced + `VAR_DECL' is not the same as the function currently being processed, + and neither `DECL_EXTERNAL' nor `DECL_STATIC' hold, then the reference + is to a local variable in a containing function, and the back end must + take appropriate action. + + * Menu: + + * Function Basics:: Function names, linkage, and so forth. + * Function Bodies:: The statements that make up a function body. + +  + File: gccint.info, Node: Function Basics, Next: Function Bodies, Up: Functions + + Function Basics + --------------- + + The following macros and functions can be used on a `FUNCTION_DECL': + `DECL_MAIN_P' + This predicate holds for a function that is the program entry point + `::code'. + + `DECL_NAME' + This macro returns the unqualified name of the function, as an + `IDENTIFIER_NODE'. For an instantiation of a function template, + the `DECL_NAME' is the unqualified name of the template, not + something like `f'. The value of `DECL_NAME' is undefined + when used on a constructor, destructor, overloaded operator, or + type-conversion operator, or any function that is implicitly + generated by the compiler. See below for macros that can be used + to distinguish these cases. + + `DECL_ASSEMBLER_NAME' + This macro returns the mangled name of the function, also an + `IDENTIFIER_NODE'. This name does not contain leading underscores + on systems that prefix all identifiers with underscores. The + mangled name is computed in the same way on all platforms; if + special processing is required to deal with the object file format + used on a particular platform, it is the responsibility of the + back end to perform those modifications. (Of course, the back end + should not modify `DECL_ASSEMBLER_NAME' itself.) + + `DECL_EXTERNAL' + This predicate holds if the function is undefined. + + `TREE_PUBLIC' + This predicate holds if the function has external linkage. + + `DECL_LOCAL_FUNCTION_P' + This predicate holds if the function was declared at block scope, + even though it has a global scope. + + `DECL_ANTICIPATED' + This predicate holds if the function is a built-in function but its + prototype is not yet explicitly declared. + + `DECL_EXTERN_C_FUNCTION_P' + This predicate holds if the function is declared as an ``extern + "C"'' function. + + `DECL_LINKONCE_P' + This macro holds if multiple copies of this function may be + emitted in various translation units. It is the responsibility of + the linker to merge the various copies. Template instantiations + are the most common example of functions for which + `DECL_LINKONCE_P' holds; G++ instantiates needed templates in all + translation units which require them, and then relies on the + linker to remove duplicate instantiations. + + FIXME: This macro is not yet implemented. + + `DECL_FUNCTION_MEMBER_P' + This macro holds if the function is a member of a class, rather + than a member of a namespace. + + `DECL_STATIC_FUNCTION_P' + This predicate holds if the function a static member function. + + `DECL_NONSTATIC_MEMBER_FUNCTION_P' + This macro holds for a non-static member function. + + `DECL_CONST_MEMFUNC_P' + This predicate holds for a `const'-member function. + + `DECL_VOLATILE_MEMFUNC_P' + This predicate holds for a `volatile'-member function. + + `DECL_CONSTRUCTOR_P' + This macro holds if the function is a constructor. + + `DECL_NONCONVERTING_P' + This predicate holds if the constructor is a non-converting + constructor. + + `DECL_COMPLETE_CONSTRUCTOR_P' + This predicate holds for a function which is a constructor for an + object of a complete type. + + `DECL_BASE_CONSTRUCTOR_P' + This predicate holds for a function which is a constructor for a + base class sub-object. + + `DECL_COPY_CONSTRUCTOR_P' + This predicate holds for a function which is a copy-constructor. + + `DECL_DESTRUCTOR_P' + This macro holds if the function is a destructor. + + `DECL_COMPLETE_DESTRUCTOR_P' + This predicate holds if the function is the destructor for an + object a complete type. + + `DECL_OVERLOADED_OPERATOR_P' + This macro holds if the function is an overloaded operator. + + `DECL_CONV_FN_P' + This macro holds if the function is a type-conversion operator. + + `DECL_GLOBAL_CTOR_P' + This predicate holds if the function is a file-scope initialization + function. + + `DECL_GLOBAL_DTOR_P' + This predicate holds if the function is a file-scope finalization + function. + + `DECL_THUNK_P' + This predicate holds if the function is a thunk. + + These functions represent stub code that adjusts the `this' pointer + and then jumps to another function. When the jumped-to function + returns, control is transferred directly to the caller, without + returning to the thunk. The first parameter to the thunk is + always the `this' pointer; the thunk should add `THUNK_DELTA' to + this value. (The `THUNK_DELTA' is an `int', not an `INTEGER_CST'.) + + Then, if `THUNK_VCALL_OFFSET' (an `INTEGER_CST') is nonzero the + adjusted `this' pointer must be adjusted again. The complete + calculation is given by the following pseudo-code: + + this += THUNK_DELTA + if (THUNK_VCALL_OFFSET) + this += (*((ptrdiff_t **) this))[THUNK_VCALL_OFFSET] + + Finally, the thunk should jump to the location given by + `DECL_INITIAL'; this will always be an expression for the address + of a function. + + `DECL_NON_THUNK_FUNCTION_P' + This predicate holds if the function is _not_ a thunk function. + + `GLOBAL_INIT_PRIORITY' + If either `DECL_GLOBAL_CTOR_P' or `DECL_GLOBAL_DTOR_P' holds, then + this gives the initialization priority for the function. The + linker will arrange that all functions for which + `DECL_GLOBAL_CTOR_P' holds are run in increasing order of priority + before `main' is called. When the program exits, all functions for + which `DECL_GLOBAL_DTOR_P' holds are run in the reverse order. + + `DECL_ARTIFICIAL' + This macro holds if the function was implicitly generated by the + compiler, rather than explicitly declared. In addition to + implicitly generated class member functions, this macro holds for + the special functions created to implement static initialization + and destruction, to compute run-time type information, and so + forth. + + `DECL_ARGUMENTS' + This macro returns the `PARM_DECL' for the first argument to the + function. Subsequent `PARM_DECL' nodes can be obtained by + following the `TREE_CHAIN' links. + + `DECL_RESULT' + This macro returns the `RESULT_DECL' for the function. + + `TREE_TYPE' + This macro returns the `FUNCTION_TYPE' or `METHOD_TYPE' for the + function. + + `TYPE_RAISES_EXCEPTIONS' + This macro returns the list of exceptions that a (member-)function + can raise. The returned list, if non `NULL', is comprised of nodes + whose `TREE_VALUE' represents a type. + + `TYPE_NOTHROW_P' + This predicate holds when the exception-specification of its + arguments if of the form ``()''. + + `DECL_ARRAY_DELETE_OPERATOR_P' + This predicate holds if the function an overloaded `operator + delete[]'. + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-4 gcc-3.2.3/gcc/doc/gccint.info-4 *** gcc-3.2.2/gcc/doc/gccint.info-4 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-4 Tue Apr 22 07:07:18 2003 *************** *** 0 **** --- 1,1014 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Function Bodies, Prev: Function Basics, Up: Functions + + Function Bodies + --------------- + + A function that has a definition in the current translation unit will + have a non-`NULL' `DECL_INITIAL'. However, back ends should not make + use of the particular value given by `DECL_INITIAL'. + + The `DECL_SAVED_TREE' macro will give the complete body of the + function. This node will usually be a `COMPOUND_STMT' representing the + outermost block of the function, but it may also be a `TRY_BLOCK', a + `RETURN_INIT', or any other valid statement. + + Statements + .......... + + There are tree nodes corresponding to all of the source-level + statement constructs. These are enumerated here, together with a list + of the various macros that can be used to obtain information about + them. There are a few macros that can be used with all statements: + + `STMT_LINENO' + This macro returns the line number for the statement. If the + statement spans multiple lines, this value will be the number of + the first line on which the statement occurs. Although we mention + `CASE_LABEL' below as if it were a statement, they do not allow + the use of `STMT_LINENO'. There is no way to obtain the line + number for a `CASE_LABEL'. + + Statements do not contain information about the file from which + they came; that information is implicit in the `FUNCTION_DECL' + from which the statements originate. + + `STMT_IS_FULL_EXPR_P' + In C++, statements normally constitute "full expressions"; + temporaries created during a statement are destroyed when the + statement is complete. However, G++ sometimes represents + expressions by statements; these statements will not have + `STMT_IS_FULL_EXPR_P' set. Temporaries created during such + statements should be destroyed when the innermost enclosing + statement with `STMT_IS_FULL_EXPR_P' set is exited. + + + Here is the list of the various statement nodes, and the macros used + to access them. This documentation describes the use of these nodes in + non-template functions (including instantiations of template functions). + In template functions, the same nodes are used, but sometimes in + slightly different ways. + + Many of the statements have substatements. For example, a `while' + loop will have a body, which is itself a statement. If the substatement + is `NULL_TREE', it is considered equivalent to a statement consisting + of a single `;', i.e., an expression statement in which the expression + has been omitted. A substatement may in fact be a list of statements, + connected via their `TREE_CHAIN's. So, you should always process the + statement tree by looping over substatements, like this: + void process_stmt (stmt) + tree stmt; + { + while (stmt) + { + switch (TREE_CODE (stmt)) + { + case IF_STMT: + process_stmt (THEN_CLAUSE (stmt)); + /* More processing here. */ + break; + + ... + } + + stmt = TREE_CHAIN (stmt); + } + } + In other words, while the `then' clause of an `if' statement in C++ + can be only one statement (although that one statement may be a + compound statement), the intermediate representation will sometimes use + several statements chained together. + + `ASM_STMT' + Used to represent an inline assembly statement. For an inline + assembly statement like: + asm ("mov x, y"); + The `ASM_STRING' macro will return a `STRING_CST' node for `"mov + x, y"'. If the original statement made use of the + extended-assembly syntax, then `ASM_OUTPUTS', `ASM_INPUTS', and + `ASM_CLOBBERS' will be the outputs, inputs, and clobbers for the + statement, represented as `STRING_CST' nodes. The + extended-assembly syntax looks like: + asm ("fsinx %1,%0" : "=f" (result) : "f" (angle)); + The first string is the `ASM_STRING', containing the instruction + template. The next two strings are the output and inputs, + respectively; this statement has no clobbers. As this example + indicates, "plain" assembly statements are merely a special case + of extended assembly statements; they have no cv-qualifiers, + outputs, inputs, or clobbers. All of the strings will be + `NUL'-terminated, and will contain no embedded `NUL'-characters. + + If the assembly statement is declared `volatile', or if the + statement was not an extended assembly statement, and is therefore + implicitly volatile, then the predicate `ASM_VOLATILE_P' will hold + of the `ASM_STMT'. + + `BREAK_STMT' + Used to represent a `break' statement. There are no additional + fields. + + `CASE_LABEL' + Use to represent a `case' label, range of `case' labels, or a + `default' label. If `CASE_LOW' is `NULL_TREE', then this is a + `default' label. Otherwise, if `CASE_HIGH' is `NULL_TREE', then + this is an ordinary `case' label. In this case, `CASE_LOW' is an + expression giving the value of the label. Both `CASE_LOW' and + `CASE_HIGH' are `INTEGER_CST' nodes. These values will have the + same type as the condition expression in the switch statement. + + Otherwise, if both `CASE_LOW' and `CASE_HIGH' are defined, the + statement is a range of case labels. Such statements originate + with the extension that allows users to write things of the form: + case 2 ... 5: + The first value will be `CASE_LOW', while the second will be + `CASE_HIGH'. + + `CLEANUP_STMT' + Used to represent an action that should take place upon exit from + the enclosing scope. Typically, these actions are calls to + destructors for local objects, but back ends cannot rely on this + fact. If these nodes are in fact representing such destructors, + `CLEANUP_DECL' will be the `VAR_DECL' destroyed. Otherwise, + `CLEANUP_DECL' will be `NULL_TREE'. In any case, the + `CLEANUP_EXPR' is the expression to execute. The cleanups + executed on exit from a scope should be run in the reverse order + of the order in which the associated `CLEANUP_STMT's were + encountered. + + `COMPOUND_STMT' + Used to represent a brace-enclosed block. The first substatement + is given by `COMPOUND_BODY'. Subsequent substatements are found by + following the `TREE_CHAIN' link from one substatement to the next. + The `COMPOUND_BODY' will be `NULL_TREE' if there are no + substatements. + + `CONTINUE_STMT' + Used to represent a `continue' statement. There are no additional + fields. + + `CTOR_STMT' + Used to mark the beginning (if `CTOR_BEGIN_P' holds) or end (if + `CTOR_END_P' holds of the main body of a constructor. See also + `SUBOBJECT' for more information on how to use these nodes. + + `DECL_STMT' + Used to represent a local declaration. The `DECL_STMT_DECL' macro + can be used to obtain the entity declared. This declaration may + be a `LABEL_DECL', indicating that the label declared is a local + label. (As an extension, GCC allows the declaration of labels + with scope.) In C, this declaration may be a `FUNCTION_DECL', + indicating the use of the GCC nested function extension. For more + information, *note Functions::. + + `DO_STMT' + Used to represent a `do' loop. The body of the loop is given by + `DO_BODY' while the termination condition for the loop is given by + `DO_COND'. The condition for a `do'-statement is always an + expression. + + `EMPTY_CLASS_EXPR' + Used to represent a temporary object of a class with no data whose + address is never taken. (All such objects are interchangeable.) + The `TREE_TYPE' represents the type of the object. + + `EXPR_STMT' + Used to represent an expression statement. Use `EXPR_STMT_EXPR' to + obtain the expression. + + `FILE_STMT' + Used to record a change in filename within the body of a function. + Use `FILE_STMT_FILENAME' to obtain the new filename. + + `FOR_STMT' + Used to represent a `for' statement. The `FOR_INIT_STMT' is the + initialization statement for the loop. The `FOR_COND' is the + termination condition. The `FOR_EXPR' is the expression executed + right before the `FOR_COND' on each loop iteration; often, this + expression increments a counter. The body of the loop is given by + `FOR_BODY'. Note that `FOR_INIT_STMT' and `FOR_BODY' return + statements, while `FOR_COND' and `FOR_EXPR' return expressions. + + `GOTO_STMT' + Used to represent a `goto' statement. The `GOTO_DESTINATION' will + usually be a `LABEL_DECL'. However, if the "computed goto" + extension has been used, the `GOTO_DESTINATION' will be an + arbitrary expression indicating the destination. This expression + will always have pointer type. Additionally the `GOTO_FAKE_P' + flag is set whenever the goto statement does not come from source + code, but it is generated implicitly by the compiler. This is + used for branch prediction. + + `HANDLER' + Used to represent a C++ `catch' block. The `HANDLER_TYPE' is the + type of exception that will be caught by this handler; it is equal + (by pointer equality) to `CATCH_ALL_TYPE' if this handler is for + all types. `HANDLER_PARMS' is the `DECL_STMT' for the catch + parameter, and `HANDLER_BODY' is the `COMPOUND_STMT' for the block + itself. + + `IF_STMT' + Used to represent an `if' statement. The `IF_COND' is the + expression. + + If the condition is a `TREE_LIST', then the `TREE_PURPOSE' is a + statement (usually a `DECL_STMT'). Each time the condition is + evaluated, the statement should be executed. Then, the + `TREE_VALUE' should be used as the conditional expression itself. + This representation is used to handle C++ code like this: + + if (int i = 7) ... + + where there is a new local variable (or variables) declared within + the condition. + + The `THEN_CLAUSE' represents the statement given by the `then' + condition, while the `ELSE_CLAUSE' represents the statement given + by the `else' condition. + + `LABEL_STMT' + Used to represent a label. The `LABEL_DECL' declared by this + statement can be obtained with the `LABEL_STMT_LABEL' macro. The + `IDENTIFIER_NODE' giving the name of the label can be obtained from + the `LABEL_DECL' with `DECL_NAME'. + + `RETURN_INIT' + If the function uses the G++ "named return value" extension, + meaning that the function has been defined like: + S f(int) return s {...} + then there will be a `RETURN_INIT'. There is never a named + returned value for a constructor. The first argument to the + `RETURN_INIT' is the name of the object returned; the second + argument is the initializer for the object. The object is + initialized when the `RETURN_INIT' is encountered. The object + referred to is the actual object returned; this extension is a + manual way of doing the "return-value optimization." Therefore, + the object must actually be constructed in the place where the + object will be returned. + + `RETURN_STMT' + Used to represent a `return' statement. The `RETURN_EXPR' is the + expression returned; it will be `NULL_TREE' if the statement was + just + return; + + `SCOPE_STMT' + A scope-statement represents the beginning or end of a scope. If + `SCOPE_BEGIN_P' holds, this statement represents the beginning of a + scope; if `SCOPE_END_P' holds this statement represents the end of + a scope. On exit from a scope, all cleanups from `CLEANUP_STMT's + occurring in the scope must be run, in reverse order to the order + in which they were encountered. If `SCOPE_NULLIFIED_P' or + `SCOPE_NO_CLEANUPS_P' holds of the scope, back ends should behave + as if the `SCOPE_STMT' were not present at all. + + `SUBOBJECT' + In a constructor, these nodes are used to mark the point at which a + subobject of `this' is fully constructed. If, after this point, an + exception is thrown before a `CTOR_STMT' with `CTOR_END_P' set is + encountered, the `SUBOBJECT_CLEANUP' must be executed. The + cleanups must be executed in the reverse order in which they + appear. + + `SWITCH_STMT' + Used to represent a `switch' statement. The `SWITCH_COND' is the + expression on which the switch is occurring. See the documentation + for an `IF_STMT' for more information on the representation used + for the condition. The `SWITCH_BODY' is the body of the switch + statement. The `SWITCH_TYPE' is the original type of switch + expression as given in the source, before any compiler conversions. + + `TRY_BLOCK' + Used to represent a `try' block. The body of the try block is + given by `TRY_STMTS'. Each of the catch blocks is a `HANDLER' + node. The first handler is given by `TRY_HANDLERS'. Subsequent + handlers are obtained by following the `TREE_CHAIN' link from one + handler to the next. The body of the handler is given by + `HANDLER_BODY'. + + If `CLEANUP_P' holds of the `TRY_BLOCK', then the `TRY_HANDLERS' + will not be a `HANDLER' node. Instead, it will be an expression + that should be executed if an exception is thrown in the try + block. It must rethrow the exception after executing that code. + And, if an exception is thrown while the expression is executing, + `terminate' must be called. + + `USING_STMT' + Used to represent a `using' directive. The namespace is given by + `USING_STMT_NAMESPACE', which will be a NAMESPACE_DECL. This node + is needed inside template functions, to implement using directives + during instantiation. + + `WHILE_STMT' + Used to represent a `while' loop. The `WHILE_COND' is the + termination condition for the loop. See the documentation for an + `IF_STMT' for more information on the representation used for the + condition. + + The `WHILE_BODY' is the body of the loop. + + +  + File: gccint.info, Node: Attributes, Next: Expression trees, Prev: Declarations, Up: Trees + + Attributes in trees + =================== + + Attributes, as specified using the `__attribute__' keyword, are + represented internally as a `TREE_LIST'. The `TREE_PURPOSE' is the + name of the attribute, as an `IDENTIFIER_NODE'. The `TREE_VALUE' is a + `TREE_LIST' of the arguments of the attribute, if any, or `NULL_TREE' + if there are no arguments; the arguments are stored as the `TREE_VALUE' + of successive entries in the list, and may be identifiers or + expressions. The `TREE_CHAIN' of the attribute is the next attribute + in a list of attributes applying to the same declaration or type, or + `NULL_TREE' if there are no further attributes in the list. + + Attributes may be attached to declarations and to types; these + attributes may be accessed with the following macros. All attributes + are stored in this way, and many also cause other changes to the + declaration or type or to other internal compiler data structures. + + - Tree Macro: tree DECL_ATTRIBUTES (tree DECL) + This macro returns the attributes on the declaration DECL. + + - Tree Macro: tree TYPE_ATTRIBUTES (tree TYPE) + This macro returns the attributes on the type TYPE. + +  + File: gccint.info, Node: Expression trees, Prev: Attributes, Up: Trees + + Expressions + =========== + + The internal representation for expressions is for the most part + quite straightforward. However, there are a few facts that one must + bear in mind. In particular, the expression "tree" is actually a + directed acyclic graph. (For example there may be many references to + the integer constant zero throughout the source program; many of these + will be represented by the same expression node.) You should not rely + on certain kinds of node being shared, nor should rely on certain kinds + of nodes being unshared. + + The following macros can be used with all expression nodes: + + `TREE_TYPE' + Returns the type of the expression. This value may not be + precisely the same type that would be given the expression in the + original program. + + In what follows, some nodes that one might expect to always have type + `bool' are documented to have either integral or boolean type. At some + point in the future, the C front end may also make use of this same + intermediate representation, and at this point these nodes will + certainly have integral type. The previous sentence is not meant to + imply that the C++ front end does not or will not give these nodes + integral type. + + Below, we list the various kinds of expression nodes. Except where + noted otherwise, the operands to an expression are accessed using the + `TREE_OPERAND' macro. For example, to access the first operand to a + binary plus expression `expr', use: + + TREE_OPERAND (expr, 0) + + As this example indicates, the operands are zero-indexed. + + The table below begins with constants, moves on to unary expressions, + then proceeds to binary expressions, and concludes with various other + kinds of expressions: + + `INTEGER_CST' + These nodes represent integer constants. Note that the type of + these constants is obtained with `TREE_TYPE'; they are not always + of type `int'. In particular, `char' constants are represented + with `INTEGER_CST' nodes. The value of the integer constant `e' is + given by + ((TREE_INT_CST_HIGH (e) << HOST_BITS_PER_WIDE_INT) + + TREE_INST_CST_LOW (e)) + + HOST_BITS_PER_WIDE_INT is at least thirty-two on all platforms. + Both `TREE_INT_CST_HIGH' and `TREE_INT_CST_LOW' return a + `HOST_WIDE_INT'. The value of an `INTEGER_CST' is interpreted as + a signed or unsigned quantity depending on the type of the + constant. In general, the expression given above will overflow, + so it should not be used to calculate the value of the constant. + + The variable `integer_zero_node' is an integer constant with value + zero. Similarly, `integer_one_node' is an integer constant with + value one. The `size_zero_node' and `size_one_node' variables are + analogous, but have type `size_t' rather than `int'. + + The function `tree_int_cst_lt' is a predicate which holds if its + first argument is less than its second. Both constants are + assumed to have the same signedness (i.e., either both should be + signed or both should be unsigned.) The full width of the + constant is used when doing the comparison; the usual rules about + promotions and conversions are ignored. Similarly, + `tree_int_cst_equal' holds if the two constants are equal. The + `tree_int_cst_sgn' function returns the sign of a constant. The + value is `1', `0', or `-1' according on whether the constant is + greater than, equal to, or less than zero. Again, the signedness + of the constant's type is taken into account; an unsigned constant + is never less than zero, no matter what its bit-pattern. + + `REAL_CST' + FIXME: Talk about how to obtain representations of this constant, + do comparisons, and so forth. + + `COMPLEX_CST' + These nodes are used to represent complex number constants, that + is a `__complex__' whose parts are constant nodes. The + `TREE_REALPART' and `TREE_IMAGPART' return the real and the + imaginary parts respectively. + + `VECTOR_CST' + These nodes are used to represent vector constants, whose parts are + constant nodes. Each individual constant node is either an + integer or a double constant node. The first operand is a + `TREE_LIST' of the constant nodes and is accessed through + `TREE_VECTOR_CST_ELTS'. + + `STRING_CST' + These nodes represent string-constants. The `TREE_STRING_LENGTH' + returns the length of the string, as an `int'. The + `TREE_STRING_POINTER' is a `char*' containing the string itself. + The string may not be `NUL'-terminated, and it may contain + embedded `NUL' characters. Therefore, the `TREE_STRING_LENGTH' + includes the trailing `NUL' if it is present. + + For wide string constants, the `TREE_STRING_LENGTH' is the number + of bytes in the string, and the `TREE_STRING_POINTER' points to an + array of the bytes of the string, as represented on the target + system (that is, as integers in the target endianness). Wide and + non-wide string constants are distinguished only by the `TREE_TYPE' + of the `STRING_CST'. + + FIXME: The formats of string constants are not well-defined when + the target system bytes are not the same width as host system + bytes. + + `PTRMEM_CST' + These nodes are used to represent pointer-to-member constants. The + `PTRMEM_CST_CLASS' is the class type (either a `RECORD_TYPE' or + `UNION_TYPE' within which the pointer points), and the + `PTRMEM_CST_MEMBER' is the declaration for the pointed to object. + Note that the `DECL_CONTEXT' for the `PTRMEM_CST_MEMBER' is in + general different from the `PTRMEM_CST_CLASS'. For example, given: + struct B { int i; }; + struct D : public B {}; + int D::*dp = &D::i; + + The `PTRMEM_CST_CLASS' for `&D::i' is `D', even though the + `DECL_CONTEXT' for the `PTRMEM_CST_MEMBER' is `B', since `B::i' is + a member of `B', not `D'. + + `VAR_DECL' + These nodes represent variables, including static data members. + For more information, *note Declarations::. + + `NEGATE_EXPR' + These nodes represent unary negation of the single operand, for + both integer and floating-point types. The type of negation can be + determined by looking at the type of the expression. + + `BIT_NOT_EXPR' + These nodes represent bitwise complement, and will always have + integral type. The only operand is the value to be complemented. + + `TRUTH_NOT_EXPR' + These nodes represent logical negation, and will always have + integral (or boolean) type. The operand is the value being + negated. + + `PREDECREMENT_EXPR' + `PREINCREMENT_EXPR' + `POSTDECREMENT_EXPR' + `POSTINCREMENT_EXPR' + These nodes represent increment and decrement expressions. The + value of the single operand is computed, and the operand + incremented or decremented. In the case of `PREDECREMENT_EXPR' and + `PREINCREMENT_EXPR', the value of the expression is the value + resulting after the increment or decrement; in the case of + `POSTDECREMENT_EXPR' and `POSTINCREMENT_EXPR' is the value before + the increment or decrement occurs. The type of the operand, like + that of the result, will be either integral, boolean, or + floating-point. + + `ADDR_EXPR' + These nodes are used to represent the address of an object. (These + expressions will always have pointer or reference type.) The + operand may be another expression, or it may be a declaration. + + As an extension, GCC allows users to take the address of a label. + In this case, the operand of the `ADDR_EXPR' will be a + `LABEL_DECL'. The type of such an expression is `void*'. + + If the object addressed is not an lvalue, a temporary is created, + and the address of the temporary is used. + + `INDIRECT_REF' + These nodes are used to represent the object pointed to by a + pointer. The operand is the pointer being dereferenced; it will + always have pointer or reference type. + + `FIX_TRUNC_EXPR' + These nodes represent conversion of a floating-point value to an + integer. The single operand will have a floating-point type, + while the the complete expression will have an integral (or + boolean) type. The operand is rounded towards zero. + + `FLOAT_EXPR' + These nodes represent conversion of an integral (or boolean) value + to a floating-point value. The single operand will have integral + type, while the complete expression will have a floating-point + type. + + FIXME: How is the operand supposed to be rounded? Is this + dependent on `-mieee'? + + `COMPLEX_EXPR' + These nodes are used to represent complex numbers constructed from + two expressions of the same (integer or real) type. The first + operand is the real part and the second operand is the imaginary + part. + + `CONJ_EXPR' + These nodes represent the conjugate of their operand. + + `REALPART_EXPR' + + `IMAGPART_EXPR' + These nodes represent respectively the real and the imaginary parts + of complex numbers (their sole argument). + + `NON_LVALUE_EXPR' + These nodes indicate that their one and only operand is not an + lvalue. A back end can treat these identically to the single + operand. + + `NOP_EXPR' + These nodes are used to represent conversions that do not require + any code-generation. For example, conversion of a `char*' to an + `int*' does not require any code be generated; such a conversion is + represented by a `NOP_EXPR'. The single operand is the expression + to be converted. The conversion from a pointer to a reference is + also represented with a `NOP_EXPR'. + + `CONVERT_EXPR' + These nodes are similar to `NOP_EXPR's, but are used in those + situations where code may need to be generated. For example, if an + `int*' is converted to an `int' code may need to be generated on + some platforms. These nodes are never used for C++-specific + conversions, like conversions between pointers to different + classes in an inheritance hierarchy. Any adjustments that need to + be made in such cases are always indicated explicitly. Similarly, + a user-defined conversion is never represented by a + `CONVERT_EXPR'; instead, the function calls are made explicit. + + `THROW_EXPR' + These nodes represent `throw' expressions. The single operand is + an expression for the code that should be executed to throw the + exception. However, there is one implicit action not represented + in that expression; namely the call to `__throw'. This function + takes no arguments. If `setjmp'/`longjmp' exceptions are used, the + function `__sjthrow' is called instead. The normal GCC back end + uses the function `emit_throw' to generate this code; you can + examine this function to see what needs to be done. + + `LSHIFT_EXPR' + `RSHIFT_EXPR' + These nodes represent left and right shifts, respectively. The + first operand is the value to shift; it will always be of integral + type. The second operand is an expression for the number of bits + by which to shift. Right shift should be treated as arithmetic, + i.e., the high-order bits should be zero-filled when the + expression has unsigned type and filled with the sign bit when the + expression has signed type. Note that the result is undefined if + the second operand is larger than the first operand's type size. + + `BIT_IOR_EXPR' + `BIT_XOR_EXPR' + `BIT_AND_EXPR' + These nodes represent bitwise inclusive or, bitwise exclusive or, + and bitwise and, respectively. Both operands will always have + integral type. + + `TRUTH_ANDIF_EXPR' + `TRUTH_ORIF_EXPR' + These nodes represent logical and and logical or, respectively. + These operators are not strict; i.e., the second operand is + evaluated only if the value of the expression is not determined by + evaluation of the first operand. The type of the operands, and + the result type, is always of boolean or integral type. + + `TRUTH_AND_EXPR' + `TRUTH_OR_EXPR' + `TRUTH_XOR_EXPR' + These nodes represent logical and, logical or, and logical + exclusive or. They are strict; both arguments are always + evaluated. There are no corresponding operators in C or C++, but + the front end will sometimes generate these expressions anyhow, if + it can tell that strictness does not matter. + + `PLUS_EXPR' + `MINUS_EXPR' + `MULT_EXPR' + `TRUNC_DIV_EXPR' + `TRUNC_MOD_EXPR' + `RDIV_EXPR' + These nodes represent various binary arithmetic operations. + Respectively, these operations are addition, subtraction (of the + second operand from the first), multiplication, integer division, + integer remainder, and floating-point division. The operands to + the first three of these may have either integral or floating + type, but there will never be case in which one operand is of + floating type and the other is of integral type. + + The result of a `TRUNC_DIV_EXPR' is always rounded towards zero. + The `TRUNC_MOD_EXPR' of two operands `a' and `b' is always `a - + a/b' where the division is as if computed by a `TRUNC_DIV_EXPR'. + + `ARRAY_REF' + These nodes represent array accesses. The first operand is the + array; the second is the index. To calculate the address of the + memory accessed, you must scale the index by the size of the type + of the array elements. The type of these expressions must be the + type of a component of the array. + + `ARRAY_RANGE_REF' + These nodes represent access to a range (or "slice") of an array. + The operands are the same as that for `ARRAY_REF' and have the same + meanings. The type of these expressions must be an array whose + component type is the same as that of the first operand. The + range of that array type determines the amount of data these + expressions access. + + `EXACT_DIV_EXPR' + Document. + + `LT_EXPR' + `LE_EXPR' + `GT_EXPR' + `GE_EXPR' + `EQ_EXPR' + `NE_EXPR' + These nodes represent the less than, less than or equal to, greater + than, greater than or equal to, equal, and not equal comparison + operators. The first and second operand with either be both of + integral type or both of floating type. The result type of these + expressions will always be of integral or boolean type. + + `MODIFY_EXPR' + These nodes represent assignment. The left-hand side is the first + operand; the right-hand side is the second operand. The left-hand + side will be a `VAR_DECL', `INDIRECT_REF', `COMPONENT_REF', or + other lvalue. + + These nodes are used to represent not only assignment with `=' but + also compound assignments (like `+='), by reduction to `=' + assignment. In other words, the representation for `i += 3' looks + just like that for `i = i + 3'. + + `INIT_EXPR' + These nodes are just like `MODIFY_EXPR', but are used only when a + variable is initialized, rather than assigned to subsequently. + + `COMPONENT_REF' + These nodes represent non-static data member accesses. The first + operand is the object (rather than a pointer to it); the second + operand is the `FIELD_DECL' for the data member. + + `COMPOUND_EXPR' + These nodes represent comma-expressions. The first operand is an + expression whose value is computed and thrown away prior to the + evaluation of the second operand. The value of the entire + expression is the value of the second operand. + + `COND_EXPR' + These nodes represent `?:' expressions. The first operand is of + boolean or integral type. If it evaluates to a nonzero value, the + second operand should be evaluated, and returned as the value of + the expression. Otherwise, the third operand is evaluated, and + returned as the value of the expression. As a GNU extension, the + middle operand of the `?:' operator may be omitted in the source, + like this: + + x ? : 3 + + which is equivalent to + + x ? x : 3 + + assuming that `x' is an expression without side-effects. However, + in the case that the first operation causes side effects, the + side-effects occur only once. Consumers of the internal + representation do not need to worry about this oddity; the second + operand will be always be present in the internal representation. + + `CALL_EXPR' + These nodes are used to represent calls to functions, including + non-static member functions. The first operand is a pointer to the + function to call; it is always an expression whose type is a + `POINTER_TYPE'. The second argument is a `TREE_LIST'. The + arguments to the call appear left-to-right in the list. The + `TREE_VALUE' of each list node contains the expression + corresponding to that argument. (The value of `TREE_PURPOSE' for + these nodes is unspecified, and should be ignored.) For non-static + member functions, there will be an operand corresponding to the + `this' pointer. There will always be expressions corresponding to + all of the arguments, even if the function is declared with default + arguments and some arguments are not explicitly provided at the + call sites. + + `STMT_EXPR' + These nodes are used to represent GCC's statement-expression + extension. The statement-expression extension allows code like + this: + int f() { return ({ int j; j = 3; j + 7; }); } + In other words, an sequence of statements may occur where a single + expression would normally appear. The `STMT_EXPR' node represents + such an expression. The `STMT_EXPR_STMT' gives the statement + contained in the expression; this is always a `COMPOUND_STMT'. The + value of the expression is the value of the last sub-statement in + the `COMPOUND_STMT'. More precisely, the value is the value + computed by the last `EXPR_STMT' in the outermost scope of the + `COMPOUND_STMT'. For example, in: + ({ 3; }) + the value is `3' while in: + ({ if (x) { 3; } }) + (represented by a nested `COMPOUND_STMT'), there is no value. If + the `STMT_EXPR' does not yield a value, it's type will be `void'. + + `BIND_EXPR' + These nodes represent local blocks. The first operand is a list of + temporary variables, connected via their `TREE_CHAIN' field. These + will never require cleanups. The scope of these variables is just + the body of the `BIND_EXPR'. The body of the `BIND_EXPR' is the + second operand. + + `LOOP_EXPR' + These nodes represent "infinite" loops. The `LOOP_EXPR_BODY' + represents the body of the loop. It should be executed forever, + unless an `EXIT_EXPR' is encountered. + + `EXIT_EXPR' + These nodes represent conditional exits from the nearest enclosing + `LOOP_EXPR'. The single operand is the condition; if it is + nonzero, then the loop should be exited. An `EXIT_EXPR' will only + appear within a `LOOP_EXPR'. + + `CLEANUP_POINT_EXPR' + These nodes represent full-expressions. The single operand is an + expression to evaluate. Any destructor calls engendered by the + creation of temporaries during the evaluation of that expression + should be performed immediately after the expression is evaluated. + + `CONSTRUCTOR' + These nodes represent the brace-enclosed initializers for a + structure or array. The first operand is reserved for use by the + back end. The second operand is a `TREE_LIST'. If the + `TREE_TYPE' of the `CONSTRUCTOR' is a `RECORD_TYPE' or + `UNION_TYPE', then the `TREE_PURPOSE' of each node in the + `TREE_LIST' will be a `FIELD_DECL' and the `TREE_VALUE' of each + node will be the expression used to initialize that field. You + should not depend on the fields appearing in any particular order, + nor should you assume that all fields will be represented. + Unrepresented fields may be assigned any value. + + If the `TREE_TYPE' of the `CONSTRUCTOR' is an `ARRAY_TYPE', then + the `TREE_PURPOSE' of each element in the `TREE_LIST' will be an + `INTEGER_CST'. This constant indicates which element of the array + (indexed from zero) is being assigned to; again, the `TREE_VALUE' + is the corresponding initializer. If the `TREE_PURPOSE' is + `NULL_TREE', then the initializer is for the next available array + element. + + Conceptually, before any initialization is done, the entire area of + storage is initialized to zero. + + `COMPOUND_LITERAL_EXPR' + These nodes represent ISO C99 compound literals. The + `COMPOUND_LITERAL_EXPR_DECL_STMT' is a `DECL_STMT' containing an + anonymous `VAR_DECL' for the unnamed object represented by the + compound literal; the `DECL_INITIAL' of that `VAR_DECL' is a + `CONSTRUCTOR' representing the brace-enclosed list of initializers + in the compound literal. That anonymous `VAR_DECL' can also be + accessed directly by the `COMPOUND_LITERAL_EXPR_DECL' macro. + + `SAVE_EXPR' + A `SAVE_EXPR' represents an expression (possibly involving + side-effects) that is used more than once. The side-effects should + occur only the first time the expression is evaluated. Subsequent + uses should just reuse the computed value. The first operand to + the `SAVE_EXPR' is the expression to evaluate. The side-effects + should be executed where the `SAVE_EXPR' is first encountered in a + depth-first preorder traversal of the expression tree. + + `TARGET_EXPR' + A `TARGET_EXPR' represents a temporary object. The first operand + is a `VAR_DECL' for the temporary variable. The second operand is + the initializer for the temporary. The initializer is evaluated, + and copied (bitwise) into the temporary. + + Often, a `TARGET_EXPR' occurs on the right-hand side of an + assignment, or as the second operand to a comma-expression which is + itself the right-hand side of an assignment, etc. In this case, + we say that the `TARGET_EXPR' is "normal"; otherwise, we say it is + "orphaned". For a normal `TARGET_EXPR' the temporary variable + should be treated as an alias for the left-hand side of the + assignment, rather than as a new temporary variable. + + The third operand to the `TARGET_EXPR', if present, is a + cleanup-expression (i.e., destructor call) for the temporary. If + this expression is orphaned, then this expression must be executed + when the statement containing this expression is complete. These + cleanups must always be executed in the order opposite to that in + which they were encountered. Note that if a temporary is created + on one branch of a conditional operator (i.e., in the second or + third operand to a `COND_EXPR'), the cleanup must be run only if + that branch is actually executed. + + See `STMT_IS_FULL_EXPR_P' for more information about running these + cleanups. + + `AGGR_INIT_EXPR' + An `AGGR_INIT_EXPR' represents the initialization as the return + value of a function call, or as the result of a constructor. An + `AGGR_INIT_EXPR' will only appear as the second operand of a + `TARGET_EXPR'. The first operand to the `AGGR_INIT_EXPR' is the + address of a function to call, just as in a `CALL_EXPR'. The + second operand are the arguments to pass that function, as a + `TREE_LIST', again in a manner similar to that of a `CALL_EXPR'. + The value of the expression is that returned by the function. + + If `AGGR_INIT_VIA_CTOR_P' holds of the `AGGR_INIT_EXPR', then the + initialization is via a constructor call. The address of the third + operand of the `AGGR_INIT_EXPR', which is always a `VAR_DECL', is + taken, and this value replaces the first argument in the argument + list. In this case, the value of the expression is the `VAR_DECL' + given by the third operand to the `AGGR_INIT_EXPR'; constructors do + not return a value. + + `VTABLE_REF' + A `VTABLE_REF' indicates that the interior expression computes a + value that is a vtable entry. It is used with `-fvtable-gc' to + track the reference through to front end to the middle end, at + which point we transform this to a `REG_VTABLE_REF' note, which + survives the balance of code generation. + + The first operand is the expression that computes the vtable + reference. The second operand is the `VAR_DECL' of the vtable. + The third operand is an `INTEGER_CST' of the byte offset into the + vtable. + + +  + File: gccint.info, Node: RTL, Next: Machine Desc, Prev: Trees, Up: Top + + RTL Representation + ****************** + + Most of the work of the compiler is done on an intermediate + representation called register transfer language. In this language, + the instructions to be output are described, pretty much one by one, in + an algebraic form that describes what the instruction does. + + RTL is inspired by Lisp lists. It has both an internal form, made + up of structures that point at other structures, and a textual form + that is used in the machine description and in printed debugging dumps. + The textual form uses nested parentheses to indicate the pointers in + the internal form. + + * Menu: + + * RTL Objects:: Expressions vs vectors vs strings vs integers. + * RTL Classes:: Categories of RTL expression objects, and their structure. + * Accessors:: Macros to access expression operands or vector elts. + * Flags:: Other flags in an RTL expression. + * Machine Modes:: Describing the size and format of a datum. + * Constants:: Expressions with constant values. + * Regs and Memory:: Expressions representing register contents or memory. + * Arithmetic:: Expressions representing arithmetic on other expressions. + * Comparisons:: Expressions representing comparison of expressions. + * Bit-Fields:: Expressions representing bit-fields in memory or reg. + * Vector Operations:: Expressions involving vector datatypes. + * Conversions:: Extending, truncating, floating or fixing. + * RTL Declarations:: Declaring volatility, constancy, etc. + * Side Effects:: Expressions for storing in registers, etc. + * Incdec:: Embedded side-effects for autoincrement addressing. + * Assembler:: Representing `asm' with operands. + * Insns:: Expression types for entire insns. + * Calls:: RTL representation of function call insns. + * Sharing:: Some expressions are unique; others *must* be copied. + * Reading RTL:: Reading textual RTL from a file. + +  + File: gccint.info, Node: RTL Objects, Next: RTL Classes, Up: RTL + + RTL Object Types + ================ + + RTL uses five kinds of objects: expressions, integers, wide integers, + strings and vectors. Expressions are the most important ones. An RTL + expression ("RTX", for short) is a C structure, but it is usually + referred to with a pointer; a type that is given the typedef name `rtx'. + + An integer is simply an `int'; their written form uses decimal + digits. A wide integer is an integral object whose type is + `HOST_WIDE_INT'; their written form uses decimal digits. + + A string is a sequence of characters. In core it is represented as a + `char *' in usual C fashion, and it is written in C syntax as well. + However, strings in RTL may never be null. If you write an empty + string in a machine description, it is represented in core as a null + pointer rather than as a pointer to a null character. In certain + contexts, these null pointers instead of strings are valid. Within RTL + code, strings are most commonly found inside `symbol_ref' expressions, + but they appear in other contexts in the RTL expressions that make up + machine descriptions. + + In a machine description, strings are normally written with double + quotes, as you would in C. However, strings in machine descriptions may + extend over many lines, which is invalid C, and adjacent string + constants are not concatenated as they are in C. Any string constant + may be surrounded with a single set of parentheses. Sometimes this + makes the machine description easier to read. + + There is also a special syntax for strings, which can be useful when + C code is embedded in a machine description. Wherever a string can + appear, it is also valid to write a C-style brace block. The entire + brace block, including the outermost pair of braces, is considered to be + the string constant. Double quote characters inside the braces are not + special. Therefore, if you write string constants in the C code, you + need not escape each quote character with a backslash. + + A vector contains an arbitrary number of pointers to expressions. + The number of elements in the vector is explicitly present in the + vector. The written form of a vector consists of square brackets + (`[...]') surrounding the elements, in sequence and with whitespace + separating them. Vectors of length zero are not created; null pointers + are used instead. + + Expressions are classified by "expression codes" (also called RTX + codes). The expression code is a name defined in `rtl.def', which is + also (in upper case) a C enumeration constant. The possible expression + codes and their meanings are machine-independent. The code of an RTX + can be extracted with the macro `GET_CODE (X)' and altered with + `PUT_CODE (X, NEWCODE)'. + + The expression code determines how many operands the expression + contains, and what kinds of objects they are. In RTL, unlike Lisp, you + cannot tell by looking at an operand what kind of object it is. + Instead, you must know from its context--from the expression code of + the containing expression. For example, in an expression of code + `subreg', the first operand is to be regarded as an expression and the + second operand as an integer. In an expression of code `plus', there + are two operands, both of which are to be regarded as expressions. In + a `symbol_ref' expression, there is one operand, which is to be + regarded as a string. + + Expressions are written as parentheses containing the name of the + expression type, its flags and machine mode if any, and then the + operands of the expression (separated by spaces). + + Expression code names in the `md' file are written in lower case, + but when they appear in C code they are written in upper case. In this + manual, they are shown as follows: `const_int'. + + In a few contexts a null pointer is valid where an expression is + normally wanted. The written form of this is `(nil)'. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-5 gcc-3.2.3/gcc/doc/gccint.info-5 *** gcc-3.2.2/gcc/doc/gccint.info-5 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-5 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,1205 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: RTL Classes, Next: Accessors, Prev: RTL Objects, Up: RTL + + RTL Classes and Formats + ======================= + + The various expression codes are divided into several "classes", + which are represented by single characters. You can determine the class + of an RTX code with the macro `GET_RTX_CLASS (CODE)'. Currently, + `rtx.def' defines these classes: + + `o' + An RTX code that represents an actual object, such as a register + (`REG') or a memory location (`MEM', `SYMBOL_REF'). Constants and + basic transforms on objects (`ADDRESSOF', `HIGH', `LO_SUM') are + also included. Note that `SUBREG' and `STRICT_LOW_PART' are not + in this class, but in class `x'. + + `<' + An RTX code for a comparison, such as `NE' or `LT'. + + `1' + An RTX code for a unary arithmetic operation, such as `NEG', + `NOT', or `ABS'. This category also includes value extension + (sign or zero) and conversions between integer and floating point. + + `c' + An RTX code for a commutative binary operation, such as `PLUS' or + `AND'. `NE' and `EQ' are comparisons, so they have class `<'. + + `2' + An RTX code for a non-commutative binary operation, such as + `MINUS', `DIV', or `ASHIFTRT'. + + `b' + An RTX code for a bit-field operation. Currently only + `ZERO_EXTRACT' and `SIGN_EXTRACT'. These have three inputs and + are lvalues (so they can be used for insertion as well). *Note + Bit-Fields::. + + `3' + An RTX code for other three input operations. Currently only + `IF_THEN_ELSE'. + + `i' + An RTX code for an entire instruction: `INSN', `JUMP_INSN', and + `CALL_INSN'. *Note Insns::. + + `m' + An RTX code for something that matches in insns, such as + `MATCH_DUP'. These only occur in machine descriptions. + + `a' + An RTX code for an auto-increment addressing mode, such as + `POST_INC'. + + `x' + All other RTX codes. This category includes the remaining codes + used only in machine descriptions (`DEFINE_*', etc.). It also + includes all the codes describing side effects (`SET', `USE', + `CLOBBER', etc.) and the non-insns that may appear on an insn + chain, such as `NOTE', `BARRIER', and `CODE_LABEL'. + + For each expression code, `rtl.def' specifies the number of + contained objects and their kinds using a sequence of characters called + the "format" of the expression code. For example, the format of + `subreg' is `ei'. + + These are the most commonly used format characters: + + `e' + An expression (actually a pointer to an expression). + + `i' + An integer. + + `w' + A wide integer. + + `s' + A string. + + `E' + A vector of expressions. + + A few other format characters are used occasionally: + + `u' + `u' is equivalent to `e' except that it is printed differently in + debugging dumps. It is used for pointers to insns. + + `n' + `n' is equivalent to `i' except that it is printed differently in + debugging dumps. It is used for the line number or code number of + a `note' insn. + + `S' + `S' indicates a string which is optional. In the RTL objects in + core, `S' is equivalent to `s', but when the object is read, from + an `md' file, the string value of this operand may be omitted. An + omitted string is taken to be the null string. + + `V' + `V' indicates a vector which is optional. In the RTL objects in + core, `V' is equivalent to `E', but when the object is read from + an `md' file, the vector value of this operand may be omitted. An + omitted vector is effectively the same as a vector of no elements. + + `0' + `0' means a slot whose contents do not fit any normal category. + `0' slots are not printed at all in dumps, and are often used in + special ways by small parts of the compiler. + + There are macros to get the number of operands and the format of an + expression code: + + `GET_RTX_LENGTH (CODE)' + Number of operands of an RTX of code CODE. + + `GET_RTX_FORMAT (CODE)' + The format of an RTX of code CODE, as a C string. + + Some classes of RTX codes always have the same format. For example, + it is safe to assume that all comparison operations have format `ee'. + + `1' + All codes of this class have format `e'. + + `<' + `c' + `2' + All codes of these classes have format `ee'. + + `b' + `3' + All codes of these classes have format `eee'. + + `i' + All codes of this class have formats that begin with `iuueiee'. + *Note Insns::. Note that not all RTL objects linked onto an insn + chain are of class `i'. + + `o' + `m' + `x' + You can make no assumptions about the format of these codes. + +  + File: gccint.info, Node: Accessors, Next: Flags, Prev: RTL Classes, Up: RTL + + Access to Operands + ================== + + Operands of expressions are accessed using the macros `XEXP', + `XINT', `XWINT' and `XSTR'. Each of these macros takes two arguments: + an expression-pointer (RTX) and an operand number (counting from zero). + Thus, + + XEXP (X, 2) + + accesses operand 2 of expression X, as an expression. + + XINT (X, 2) + + accesses the same operand as an integer. `XSTR', used in the same + fashion, would access it as a string. + + Any operand can be accessed as an integer, as an expression or as a + string. You must choose the correct method of access for the kind of + value actually stored in the operand. You would do this based on the + expression code of the containing expression. That is also how you + would know how many operands there are. + + For example, if X is a `subreg' expression, you know that it has two + operands which can be correctly accessed as `XEXP (X, 0)' and `XINT (X, + 1)'. If you did `XINT (X, 0)', you would get the address of the + expression operand but cast as an integer; that might occasionally be + useful, but it would be cleaner to write `(int) XEXP (X, 0)'. `XEXP + (X, 1)' would also compile without error, and would return the second, + integer operand cast as an expression pointer, which would probably + result in a crash when accessed. Nothing stops you from writing `XEXP + (X, 28)' either, but this will access memory past the end of the + expression with unpredictable results. + + Access to operands which are vectors is more complicated. You can + use the macro `XVEC' to get the vector-pointer itself, or the macros + `XVECEXP' and `XVECLEN' to access the elements and length of a vector. + + `XVEC (EXP, IDX)' + Access the vector-pointer which is operand number IDX in EXP. + + `XVECLEN (EXP, IDX)' + Access the length (number of elements) in the vector which is in + operand number IDX in EXP. This value is an `int'. + + `XVECEXP (EXP, IDX, ELTNUM)' + Access element number ELTNUM in the vector which is in operand + number IDX in EXP. This value is an RTX. + + It is up to you to make sure that ELTNUM is not negative and is + less than `XVECLEN (EXP, IDX)'. + + All the macros defined in this section expand into lvalues and + therefore can be used to assign the operands, lengths and vector + elements as well as to access them. + +  + File: gccint.info, Node: Flags, Next: Machine Modes, Prev: Accessors, Up: RTL + + Flags in an RTL Expression + ========================== + + RTL expressions contain several flags (one-bit bit-fields) that are + used in certain types of expression. Most often they are accessed with + the following macros, which expand into lvalues: + + `CONSTANT_POOL_ADDRESS_P (X)' + Nonzero in a `symbol_ref' if it refers to part of the current + function's constant pool. For most targets these addresses are in + a `.rodata' section entirely separate from the function, but for + some targets the addresses are close to the beginning of the + function. In either case GCC assumes these addresses can be + addressed directly, perhaps with the help of base registers. + Stored in the `unchanging' field and printed as `/u'. + + `CONST_OR_PURE_CALL_P (X)' + In a `call_insn', `note', or an `expr_list' for notes, indicates + that the insn represents a call to a const or pure function. + Stored in the `unchanging' field and printed as `/u'. + + `INSN_ANNULLED_BRANCH_P (X)' + In an `insn' in the delay slot of a branch insn, indicates that an + annulling branch should be used. See the discussion under + `sequence' below. Stored in the `unchanging' field and printed as + `/u'. + + `INSN_DEAD_CODE_P (X)' + In an `insn' during the dead-code elimination pass, nonzero if the + insn is dead. Stored in the `in_struct' field and printed as `/s'. + + `INSN_DELETED_P (X)' + In an `insn', nonzero if the insn has been deleted. Stored in the + `volatil' field and printed as `/v'. + + `INSN_FROM_TARGET_P (X)' + In an `insn' in a delay slot of a branch, indicates that the insn + is from the target of the branch. If the branch insn has + `INSN_ANNULLED_BRANCH_P' set, this insn will only be executed if + the branch is taken. For annulled branches with + `INSN_FROM_TARGET_P' clear, the insn will be executed only if the + branch is not taken. When `INSN_ANNULLED_BRANCH_P' is not set, + this insn will always be executed. Stored in the `in_struct' + field and printed as `/s'. + + `LABEL_OUTSIDE_LOOP_P (X)' + In `label_ref' expressions, nonzero if this is a reference to a + label that is outside the innermost loop containing the reference + to the label. Stored in the `in_struct' field and printed as `/s'. + + `LABEL_PRESERVE_P (X)' + In a `code_label', indicates that the label is referenced by code + or data not visible to the RTL of a given function. Labels + referenced by a non-local goto will have this bit set. Stored in + the `in_struct' field and printed as `/s'. + + `LABEL_REF_NONLOCAL_P (X)' + In `label_ref' and `reg_label' expressions, nonzero if this is a + reference to a non-local label. Stored in the `volatil' field and + printed as `/v'. + + `LINK_COST_FREE (X)' + In the `LOG_LINKS' `insn_list' during scheduling, nonzero when the + cost of executing an instruction through the link is zero, i.e., + the link makes the cost free. Stored in the `call' field and + printed as `/c'. + + `LINK_COST_ZERO (X)' + In the `LOG_LINKS' `insn_list' during scheduling, nonzero when the + cost of executing an instruction through the link varies and is + unchanged, i.e., the link has zero additional cost. Stored in the + `jump' field and printed as `/j'. + + `MEM_IN_STRUCT_P (X)' + In `mem' expressions, nonzero for reference to an entire structure, + union or array, or to a component of one. Zero for references to a + scalar variable or through a pointer to a scalar. If both this + flag and `MEM_SCALAR_P' are clear, then we don't know whether this + `mem' is in a structure or not. Both flags should never be + simultaneously set. Stored in the `in_struct' field and printed + as `/s'. + + `MEM_KEEP_ALIAS_SET_P (X)' + In `mem' expressions, 1 if we should keep the alias set for this + mem unchanged when we access a component. Set to 1, for example, + when we are already in a non-addressable component of an aggregate. + Stored in the `jump' field and printed as `/j'. + + `MEM_SCALAR_P (X)' + In `mem' expressions, nonzero for reference to a scalar known not + to be a member of a structure, union, or array. Zero for such + references and for indirections through pointers, even pointers + pointing to scalar types. If both this flag and `MEM_IN_STRUCT_P' + are clear, then we don't know whether this `mem' is in a structure + or not. Both flags should never be simultaneously set. Stored in + the `frame_related' field and printed as `/f'. + + `MEM_VOLATILE_P (X)' + In `mem' and `asm_operands' expressions, nonzero for volatile + memory references. Stored in the `volatil' field and printed as + `/v'. + + `REG_FUNCTION_VALUE_P (X)' + Nonzero in a `reg' if it is the place in which this function's + value is going to be returned. (This happens only in a hard + register.) Stored in the `integrated' field and printed as `/i'. + + `REG_LOOP_TEST_P (X)' + In `reg' expressions, nonzero if this register's entire life is + contained in the exit test code for some loop. Stored in the + `in_struct' field and printed as `/s'. + + `REG_POINTER (X)' + Nonzero in a `reg' if the register holds a pointer. Stored in the + `frame_related' field and printed as `/f'. + + `REG_USERVAR_P (X)' + In a `reg', nonzero if it corresponds to a variable present in the + user's source code. Zero for temporaries generated internally by + the compiler. Stored in the `volatil' field and printed as `/v'. + + The same hard register may be used also for collecting the values + of functions called by this one, but `REG_FUNCTION_VALUE_P' is zero + in this kind of use. + + `RTX_FRAME_RELATED_P (X)' + Nonzero in an `insn' or `set' which is part of a function prologue + and sets the stack pointer, sets the frame pointer, or saves a + register. This flag should also be set on an instruction that + sets up a temporary register to use in place of the frame pointer. + Stored in the `frame_related' field and printed as `/f'. + + In particular, on RISC targets where there are limits on the sizes + of immediate constants, it is sometimes impossible to reach the + register save area directly from the stack pointer. In that case, + a temporary register is used that is near enough to the register + save area, and the Canonical Frame Address, i.e., DWARF2's logical + frame pointer, register must (temporarily) be changed to be this + temporary register. So, the instruction that sets this temporary + register must be marked as `RTX_FRAME_RELATED_P'. + + If the marked instruction is overly complex (defined in terms of + what `dwarf2out_frame_debug_expr' can handle), you will also have + to create a `REG_FRAME_RELATED_EXPR' note and attach it to the + instruction. This note should contain a simple expression of the + computation performed by this instruction, i.e., one that + `dwarf2out_frame_debug_expr' can handle. + + This flag is required for exception handling support on targets + with RTL prologues. + + `RTX_INTEGRATED_P (X)' + Nonzero in an `insn', `insn_list', or `const' if it resulted from + an in-line function call. Stored in the `integrated' field and + printed as `/i'. + + `RTX_UNCHANGING_P (X)' + Nonzero in a `reg' or `mem' if the memory is set at most once, + anywhere. This does not mean that it is function invariant. + Stored in the `unchanging' field and printed as `/u'. + + `SCHED_GROUP_P (X)' + During instruction scheduling, in an `insn', indicates that the + previous insn must be scheduled together with this insn. This is + used to ensure that certain groups of instructions will not be + split up by the instruction scheduling pass, for example, `use' + insns before a `call_insn' may not be separated from the + `call_insn'. Stored in the `in_struct' field and printed as `/s'. + + `SET_IS_RETURN_P (X)' + For a `set', nonzero if it is for a return. Stored in the `jump' + field and printed as `/j'. + + `SIBLING_CALL_P (X)' + For a `call_insn', nonzero if the insn is a sibling call. Stored + in the `jump' field and printed as `/j'. + + `STRING_POOL_ADDRESS_P (X)' + For a `symbol_ref' expression, nonzero if it addresses this + function's string constant pool. Stored in the `frame_related' + field and printed as `/f'. + + `SUBREG_PROMOTED_UNSIGNED_P (X)' + Nonzero in a `subreg' that has `SUBREG_PROMOTED_VAR_P' nonzero if + the object being referenced is kept zero-extended and zero if it + is kept sign-extended. Stored in the `unchanging' field and + printed as `/u'. + + `SUBREG_PROMOTED_VAR_P (X)' + Nonzero in a `subreg' if it was made when accessing an object that + was promoted to a wider mode in accord with the `PROMOTED_MODE' + machine description macro (*note Storage Layout::). In this case, + the mode of the `subreg' is the declared mode of the object and + the mode of `SUBREG_REG' is the mode of the register that holds + the object. Promoted variables are always either sign- or + zero-extended to the wider mode on every assignment. Stored in + the `in_struct' field and printed as `/s'. + + `SYMBOL_REF_FLAG (X)' + In a `symbol_ref', this is used as a flag for machine-specific + purposes. Stored in the `volatil' field and printed as `/v'. + + `SYMBOL_REF_USED (X)' + In a `symbol_ref', indicates that X has been used. This is + normally only used to ensure that X is only declared external + once. Stored in the `used' field. + + `SYMBOL_REF_WEAK (X)' + In a `symbol_ref', indicates that X has been declared weak. + Stored in the `integrated' field and printed as `/i'. + + These are the fields to which the above macros refer: + + `call' + In the `LOG_LINKS' of an `insn_list' during scheduling, 1 means + that the cost of executing an instruction through the link is zero. + + In an RTL dump, this flag is represented as `/c'. + + `frame_related' + In an `insn' or `set' expression, 1 means that it is part of a + function prologue and sets the stack pointer, sets the frame + pointer, saves a register, or sets up a temporary register to use + in place of the frame pointer. + + In `reg' expressions, 1 means that the register holds a pointer. + + In `symbol_ref' expressions, 1 means that the reference addresses + this function's string constant pool. + + In `mem' expressions, 1 means that the reference is to a scalar. + + In an RTL dump, this flag is represented as `/f'. + + `in_struct' + In `mem' expressions, it is 1 if the memory datum referred to is + all or part of a structure or array; 0 if it is (or might be) a + scalar variable. A reference through a C pointer has 0 because + the pointer might point to a scalar variable. This information + allows the compiler to determine something about possible cases of + aliasing. + + In `reg' expressions, it is 1 if the register has its entire life + contained within the test expression of some loop. + + In `subreg' expressions, 1 means that the `subreg' is accessing an + object that has had its mode promoted from a wider mode. + + In `label_ref' expressions, 1 means that the referenced label is + outside the innermost loop containing the insn in which the + `label_ref' was found. + + In `code_label' expressions, it is 1 if the label may never be + deleted. This is used for labels which are the target of + non-local gotos. Such a label that would have been deleted is + replaced with a `note' of type `NOTE_INSN_DELETED_LABEL'. + + In an `insn' during dead-code elimination, 1 means that the insn is + dead code. + + In an `insn' during reorg for an insn in the delay slot of a + branch, 1 means that this insn is from the target of the branch. + + In an `insn' during instruction scheduling, 1 means that this insn + must be scheduled as part of a group together with the previous + insn. + + In an RTL dump, this flag is represented as `/s'. + + `integrated' + In an `insn', `insn_list', or `const', 1 means the RTL was + produced by procedure integration. + + In `reg' expressions, 1 means the register contains the value to + be returned by the current function. On machines that pass + parameters in registers, the same register number may be used for + parameters as well, but this flag is not set on such uses. + + In `symbol_ref' expressions, 1 means the referenced symbol is weak. + + In an RTL dump, this flag is represented as `/i'. + + `jump' + In a `mem' expression, 1 means we should keep the alias set for + this mem unchanged when we access a component. + + In a `set', 1 means it is for a return. + + In a `call_insn', 1 means it is a sibling call. + + In the `LOG_LINKS' of an `insn_list' during scheduling, 1 means the + cost of executing an instruction through the link varies and is + unchanging. + + In an RTL dump, this flag is represented as `/j'. + + `unchanging' + In `reg' and `mem' expressions, 1 means that the value of the + expression never changes. + + In `subreg' expressions, it is 1 if the `subreg' references an + unsigned object whose mode has been promoted to a wider mode. + + In an `insn', 1 means that this is an annulling branch. + + In a `symbol_ref' expression, 1 means that this symbol addresses + something in the per-function constant pool. + + In a `call_insn', `note', or an `expr_list' of notes, 1 means that + this instruction is a call to a const or pure function. + + In an RTL dump, this flag is represented as `/u'. + + `used' + This flag is used directly (without an access macro) at the end of + RTL generation for a function, to count the number of times an + expression appears in insns. Expressions that appear more than + once are copied, according to the rules for shared structure + (*note Sharing::). + + For a `reg', it is used directly (without an access macro) by the + leaf register renumbering code to ensure that each register is only + renumbered once. + + In a `symbol_ref', it indicates that an external declaration for + the symbol has already been written. + + `volatil' + In a `mem' or `asm_operands' expression, it is 1 if the memory + reference is volatile. Volatile memory references may not be + deleted, reordered or combined. + + In a `symbol_ref' expression, it is used for machine-specific + purposes. + + In a `reg' expression, it is 1 if the value is a user-level + variable. 0 indicates an internal compiler temporary. + + In an `insn', 1 means the insn has been deleted. + + In `label_ref' and `reg_label' expressions, 1 means a reference to + a non-local label. + + In an RTL dump, this flag is represented as `/v'. + +  + File: gccint.info, Node: Machine Modes, Next: Constants, Prev: Flags, Up: RTL + + Machine Modes + ============= + + A machine mode describes a size of data object and the + representation used for it. In the C code, machine modes are + represented by an enumeration type, `enum machine_mode', defined in + `machmode.def'. Each RTL expression has room for a machine mode and so + do certain kinds of tree expressions (declarations and types, to be + precise). + + In debugging dumps and machine descriptions, the machine mode of an + RTL expression is written after the expression code with a colon to + separate them. The letters `mode' which appear at the end of each + machine mode name are omitted. For example, `(reg:SI 38)' is a `reg' + expression with machine mode `SImode'. If the mode is `VOIDmode', it + is not written at all. + + Here is a table of machine modes. The term "byte" below refers to an + object of `BITS_PER_UNIT' bits (*note Storage Layout::). + + `BImode' + "Bit" mode represents a single bit, for predicate registers. + + `QImode' + "Quarter-Integer" mode represents a single byte treated as an + integer. + + `HImode' + "Half-Integer" mode represents a two-byte integer. + + `PSImode' + "Partial Single Integer" mode represents an integer which occupies + four bytes but which doesn't really use all four. On some + machines, this is the right mode to use for pointers. + + `SImode' + "Single Integer" mode represents a four-byte integer. + + `PDImode' + "Partial Double Integer" mode represents an integer which occupies + eight bytes but which doesn't really use all eight. On some + machines, this is the right mode to use for certain pointers. + + `DImode' + "Double Integer" mode represents an eight-byte integer. + + `TImode' + "Tetra Integer" (?) mode represents a sixteen-byte integer. + + `OImode' + "Octa Integer" (?) mode represents a thirty-two-byte integer. + + `QFmode' + "Quarter-Floating" mode represents a quarter-precision (single + byte) floating point number. + + `HFmode' + "Half-Floating" mode represents a half-precision (two byte) + floating point number. + + `TQFmode' + "Three-Quarter-Floating" (?) mode represents a + three-quarter-precision (three byte) floating point number. + + `SFmode' + "Single Floating" mode represents a four byte floating point + number. In the common case, of a processor with IEEE arithmetic + and 8-bit bytes, this is a single-precision IEEE floating point + number; it can also be used for double-precision (on processors + with 16-bit bytes) and single-precision VAX and IBM types. + + `DFmode' + "Double Floating" mode represents an eight byte floating point + number. In the common case, of a processor with IEEE arithmetic + and 8-bit bytes, this is a double-precision IEEE floating point + number. + + `XFmode' + "Extended Floating" mode represents a twelve byte floating point + number. This mode is used for IEEE extended floating point. On + some systems not all bits within these bytes will actually be used. + + `TFmode' + "Tetra Floating" mode represents a sixteen byte floating point + number. This gets used for both the 96-bit extended IEEE + floating-point types padded to 128 bits, and true 128-bit extended + IEEE floating-point types. + + `CCmode' + "Condition Code" mode represents the value of a condition code, + which is a machine-specific set of bits used to represent the + result of a comparison operation. Other machine-specific modes + may also be used for the condition code. These modes are not used + on machines that use `cc0' (see *note Condition Code::). + + `BLKmode' + "Block" mode represents values that are aggregates to which none of + the other modes apply. In RTL, only memory references can have + this mode, and only if they appear in string-move or vector + instructions. On machines which have no such instructions, + `BLKmode' will not appear in RTL. + + `VOIDmode' + Void mode means the absence of a mode or an unspecified mode. For + example, RTL expressions of code `const_int' have mode `VOIDmode' + because they can be taken to have whatever mode the context + requires. In debugging dumps of RTL, `VOIDmode' is expressed by + the absence of any mode. + + `QCmode, HCmode, SCmode, DCmode, XCmode, TCmode' + These modes stand for a complex number represented as a pair of + floating point values. The floating point values are in `QFmode', + `HFmode', `SFmode', `DFmode', `XFmode', and `TFmode', respectively. + + `CQImode, CHImode, CSImode, CDImode, CTImode, COImode' + These modes stand for a complex number represented as a pair of + integer values. The integer values are in `QImode', `HImode', + `SImode', `DImode', `TImode', and `OImode', respectively. + + The machine description defines `Pmode' as a C macro which expands + into the machine mode used for addresses. Normally this is the mode + whose size is `BITS_PER_WORD', `SImode' on 32-bit machines. + + The only modes which a machine description must support are + `QImode', and the modes corresponding to `BITS_PER_WORD', + `FLOAT_TYPE_SIZE' and `DOUBLE_TYPE_SIZE'. The compiler will attempt to + use `DImode' for 8-byte structures and unions, but this can be + prevented by overriding the definition of `MAX_FIXED_MODE_SIZE'. + Alternatively, you can have the compiler use `TImode' for 16-byte + structures and unions. Likewise, you can arrange for the C type `short + int' to avoid using `HImode'. + + Very few explicit references to machine modes remain in the compiler + and these few references will soon be removed. Instead, the machine + modes are divided into mode classes. These are represented by the + enumeration type `enum mode_class' defined in `machmode.h'. The + possible mode classes are: + + `MODE_INT' + Integer modes. By default these are `BImode', `QImode', `HImode', + `SImode', `DImode', `TImode', and `OImode'. + + `MODE_PARTIAL_INT' + The "partial integer" modes, `PQImode', `PHImode', `PSImode' and + `PDImode'. + + `MODE_FLOAT' + Floating point modes. By default these are `QFmode', `HFmode', + `TQFmode', `SFmode', `DFmode', `XFmode' and `TFmode'. + + `MODE_COMPLEX_INT' + Complex integer modes. (These are not currently implemented). + + `MODE_COMPLEX_FLOAT' + Complex floating point modes. By default these are `QCmode', + `HCmode', `SCmode', `DCmode', `XCmode', and `TCmode'. + + `MODE_FUNCTION' + Algol or Pascal function variables including a static chain. + (These are not currently implemented). + + `MODE_CC' + Modes representing condition code values. These are `CCmode' plus + any modes listed in the `EXTRA_CC_MODES' macro. *Note Jump + Patterns::, also see *Note Condition Code::. + + `MODE_RANDOM' + This is a catchall mode class for modes which don't fit into the + above classes. Currently `VOIDmode' and `BLKmode' are in + `MODE_RANDOM'. + + Here are some C macros that relate to machine modes: + + `GET_MODE (X)' + Returns the machine mode of the RTX X. + + `PUT_MODE (X, NEWMODE)' + Alters the machine mode of the RTX X to be NEWMODE. + + `NUM_MACHINE_MODES' + Stands for the number of machine modes available on the target + machine. This is one greater than the largest numeric value of any + machine mode. + + `GET_MODE_NAME (M)' + Returns the name of mode M as a string. + + `GET_MODE_CLASS (M)' + Returns the mode class of mode M. + + `GET_MODE_WIDER_MODE (M)' + Returns the next wider natural mode. For example, the expression + `GET_MODE_WIDER_MODE (QImode)' returns `HImode'. + + `GET_MODE_SIZE (M)' + Returns the size in bytes of a datum of mode M. + + `GET_MODE_BITSIZE (M)' + Returns the size in bits of a datum of mode M. + + `GET_MODE_MASK (M)' + Returns a bitmask containing 1 for all bits in a word that fit + within mode M. This macro can only be used for modes whose + bitsize is less than or equal to `HOST_BITS_PER_INT'. + + `GET_MODE_ALIGNMENT (M)' + Return the required alignment, in bits, for an object of mode M. + + `GET_MODE_UNIT_SIZE (M)' + Returns the size in bytes of the subunits of a datum of mode M. + This is the same as `GET_MODE_SIZE' except in the case of complex + modes. For them, the unit size is the size of the real or + imaginary part. + + `GET_MODE_NUNITS (M)' + Returns the number of units contained in a mode, i.e., + `GET_MODE_SIZE' divided by `GET_MODE_UNIT_SIZE'. + + `GET_CLASS_NARROWEST_MODE (C)' + Returns the narrowest mode in mode class C. + + The global variables `byte_mode' and `word_mode' contain modes whose + classes are `MODE_INT' and whose bitsizes are either `BITS_PER_UNIT' or + `BITS_PER_WORD', respectively. On 32-bit machines, these are `QImode' + and `SImode', respectively. + +  + File: gccint.info, Node: Constants, Next: Regs and Memory, Prev: Machine Modes, Up: RTL + + Constant Expression Types + ========================= + + The simplest RTL expressions are those that represent constant + values. + + `(const_int I)' + This type of expression represents the integer value I. I is + customarily accessed with the macro `INTVAL' as in `INTVAL (EXP)', + which is equivalent to `XWINT (EXP, 0)'. + + There is only one expression object for the integer value zero; it + is the value of the variable `const0_rtx'. Likewise, the only + expression for integer value one is found in `const1_rtx', the only + expression for integer value two is found in `const2_rtx', and the + only expression for integer value negative one is found in + `constm1_rtx'. Any attempt to create an expression of code + `const_int' and value zero, one, two or negative one will return + `const0_rtx', `const1_rtx', `const2_rtx' or `constm1_rtx' as + appropriate. + + Similarly, there is only one object for the integer whose value is + `STORE_FLAG_VALUE'. It is found in `const_true_rtx'. If + `STORE_FLAG_VALUE' is one, `const_true_rtx' and `const1_rtx' will + point to the same object. If `STORE_FLAG_VALUE' is -1, + `const_true_rtx' and `constm1_rtx' will point to the same object. + + `(const_double:M ADDR I0 I1 ...)' + Represents either a floating-point constant of mode M or an + integer constant too large to fit into `HOST_BITS_PER_WIDE_INT' + bits but small enough to fit within twice that number of bits (GCC + does not provide a mechanism to represent even larger constants). + In the latter case, M will be `VOIDmode'. + + `(const_vector:M [X0 X1 ...])' + Represents a vector constant. The square brackets stand for the + vector containing the constant elements. X0, X1 and so on are the + `const_int' or `const_double' elements. + + The number of units in a `const_vector' is obtained with the macro + `CONST_VECTOR_NUNITS' as in `CONST_VECTOR_NUNITS (V)'. + + Individual elements in a vector constant are accessed with the + macro `CONST_VECTOR_ELT' as in `CONST_VECTOR_ELT (V, N)' where V + is the vector constant and N is the element desired. + + ADDR is used to contain the `mem' expression that corresponds to + the location in memory that at which the constant can be found. If + it has not been allocated a memory location, but is on the chain + of all `const_double' expressions in this compilation (maintained + using an undisplayed field), ADDR contains `const0_rtx'. If it is + not on the chain, ADDR contains `cc0_rtx'. ADDR is customarily + accessed with the macro `CONST_DOUBLE_MEM' and the chain field via + `CONST_DOUBLE_CHAIN'. + + If M is `VOIDmode', the bits of the value are stored in I0 and I1. + I0 is customarily accessed with the macro `CONST_DOUBLE_LOW' and + I1 with `CONST_DOUBLE_HIGH'. + + If the constant is floating point (regardless of its precision), + then the number of integers used to store the value depends on the + size of `REAL_VALUE_TYPE' (*note Cross-compilation::). The + integers represent a floating point number, but not precisely in + the target machine's or host machine's floating point format. To + convert them to the precise bit pattern used by the target + machine, use the macro `REAL_VALUE_TO_TARGET_DOUBLE' and friends + (*note Data Output::). + + The macro `CONST0_RTX (MODE)' refers to an expression with value 0 + in mode MODE. If mode MODE is of mode class `MODE_INT', it + returns `const0_rtx'. If mode MODE is of mode class `MODE_FLOAT', + it returns a `CONST_DOUBLE' expression in mode MODE. Otherwise, + it returns a `CONST_VECTOR' expression in mode MODE. Similarly, + the macro `CONST1_RTX (MODE)' refers to an expression with value 1 + in mode MODE and similarly for `CONST2_RTX'. The `CONST1_RTX' and + `CONST2_RTX' macros are undefined for vector modes. + + `(const_string STR)' + Represents a constant string with value STR. Currently this is + used only for insn attributes (*note Insn Attributes::) since + constant strings in C are placed in memory. + + `(symbol_ref:MODE SYMBOL)' + Represents the value of an assembler label for data. SYMBOL is a + string that describes the name of the assembler label. If it + starts with a `*', the label is the rest of SYMBOL not including + the `*'. Otherwise, the label is SYMBOL, usually prefixed with + `_'. + + The `symbol_ref' contains a mode, which is usually `Pmode'. + Usually that is the only mode for which a symbol is directly valid. + + `(label_ref LABEL)' + Represents the value of an assembler label for code. It contains + one operand, an expression, which must be a `code_label' or a + `note' of type `NOTE_INSN_DELETED_LABEL' that appears in the + instruction sequence to identify the place where the label should + go. + + The reason for using a distinct expression type for code label + references is so that jump optimization can distinguish them. + + `(const:M EXP)' + Represents a constant that is the result of an assembly-time + arithmetic computation. The operand, EXP, is an expression that + contains only constants (`const_int', `symbol_ref' and `label_ref' + expressions) combined with `plus' and `minus'. However, not all + combinations are valid, since the assembler cannot do arbitrary + arithmetic on relocatable symbols. + + M should be `Pmode'. + + `(high:M EXP)' + Represents the high-order bits of EXP, usually a `symbol_ref'. + The number of bits is machine-dependent and is normally the number + of bits specified in an instruction that initializes the high + order bits of a register. It is used with `lo_sum' to represent + the typical two-instruction sequence used in RISC machines to + reference a global memory location. + + M should be `Pmode'. + +  + File: gccint.info, Node: Regs and Memory, Next: Arithmetic, Prev: Constants, Up: RTL + + Registers and Memory + ==================== + + Here are the RTL expression types for describing access to machine + registers and to main memory. + + `(reg:M N)' + For small values of the integer N (those that are less than + `FIRST_PSEUDO_REGISTER'), this stands for a reference to machine + register number N: a "hard register". For larger values of N, it + stands for a temporary value or "pseudo register". The compiler's + strategy is to generate code assuming an unlimited number of such + pseudo registers, and later convert them into hard registers or + into memory references. + + M is the machine mode of the reference. It is necessary because + machines can generally refer to each register in more than one + mode. For example, a register may contain a full word but there + may be instructions to refer to it as a half word or as a single + byte, as well as instructions to refer to it as a floating point + number of various precisions. + + Even for a register that the machine can access in only one mode, + the mode must always be specified. + + The symbol `FIRST_PSEUDO_REGISTER' is defined by the machine + description, since the number of hard registers on the machine is + an invariant characteristic of the machine. Note, however, that + not all of the machine registers must be general registers. All + the machine registers that can be used for storage of data are + given hard register numbers, even those that can be used only in + certain instructions or can hold only certain types of data. + + A hard register may be accessed in various modes throughout one + function, but each pseudo register is given a natural mode and is + accessed only in that mode. When it is necessary to describe an + access to a pseudo register using a nonnatural mode, a `subreg' + expression is used. + + A `reg' expression with a machine mode that specifies more than + one word of data may actually stand for several consecutive + registers. If in addition the register number specifies a + hardware register, then it actually represents several consecutive + hardware registers starting with the specified one. + + Each pseudo register number used in a function's RTL code is + represented by a unique `reg' expression. + + Some pseudo register numbers, those within the range of + `FIRST_VIRTUAL_REGISTER' to `LAST_VIRTUAL_REGISTER' only appear + during the RTL generation phase and are eliminated before the + optimization phases. These represent locations in the stack frame + that cannot be determined until RTL generation for the function + has been completed. The following virtual register numbers are + defined: + + `VIRTUAL_INCOMING_ARGS_REGNUM' + This points to the first word of the incoming arguments + passed on the stack. Normally these arguments are placed + there by the caller, but the callee may have pushed some + arguments that were previously passed in registers. + + When RTL generation is complete, this virtual register is + replaced by the sum of the register given by + `ARG_POINTER_REGNUM' and the value of `FIRST_PARM_OFFSET'. + + `VIRTUAL_STACK_VARS_REGNUM' + If `FRAME_GROWS_DOWNWARD' is defined, this points to + immediately above the first variable on the stack. + Otherwise, it points to the first variable on the stack. + + `VIRTUAL_STACK_VARS_REGNUM' is replaced with the sum of the + register given by `FRAME_POINTER_REGNUM' and the value + `STARTING_FRAME_OFFSET'. + + `VIRTUAL_STACK_DYNAMIC_REGNUM' + This points to the location of dynamically allocated memory + on the stack immediately after the stack pointer has been + adjusted by the amount of memory desired. + + This virtual register is replaced by the sum of the register + given by `STACK_POINTER_REGNUM' and the value + `STACK_DYNAMIC_OFFSET'. + + `VIRTUAL_OUTGOING_ARGS_REGNUM' + This points to the location in the stack at which outgoing + arguments should be written when the stack is pre-pushed + (arguments pushed using push insns should always use + `STACK_POINTER_REGNUM'). + + This virtual register is replaced by the sum of the register + given by `STACK_POINTER_REGNUM' and the value + `STACK_POINTER_OFFSET'. + + `(subreg:M REG BYTENUM)' + `subreg' expressions are used to refer to a register in a machine + mode other than its natural one, or to refer to one register of a + multi-part `reg' that actually refers to several registers. + + Each pseudo-register has a natural mode. If it is necessary to + operate on it in a different mode--for example, to perform a + fullword move instruction on a pseudo-register that contains a + single byte--the pseudo-register must be enclosed in a `subreg'. + In such a case, BYTENUM is zero. + + Usually M is at least as narrow as the mode of REG, in which case + it is restricting consideration to only the bits of REG that are + in M. + + Sometimes M is wider than the mode of REG. These `subreg' + expressions are often called "paradoxical". They are used in + cases where we want to refer to an object in a wider mode but do + not care what value the additional bits have. The reload pass + ensures that paradoxical references are only made to hard + registers. + + The other use of `subreg' is to extract the individual registers of + a multi-register value. Machine modes such as `DImode' and + `TImode' can indicate values longer than a word, values which + usually require two or more consecutive registers. To access one + of the registers, use a `subreg' with mode `SImode' and a BYTENUM + offset that says which register. + + Storing in a non-paradoxical `subreg' has undefined results for + bits belonging to the same word as the `subreg'. This laxity makes + it easier to generate efficient code for such instructions. To + represent an instruction that preserves all the bits outside of + those in the `subreg', use `strict_low_part' around the `subreg'. + + The compilation parameter `WORDS_BIG_ENDIAN', if set to 1, says + that byte number zero is part of the most significant word; + otherwise, it is part of the least significant word. + + The compilation parameter `BYTES_BIG_ENDIAN', if set to 1, says + that byte number zero is the most significant byte within a word; + otherwise, it is the least significant byte within a word. + + On a few targets, `FLOAT_WORDS_BIG_ENDIAN' disagrees with + `WORDS_BIG_ENDIAN'. However, most parts of the compiler treat + floating point values as if they had the same endianness as + integer values. This works because they handle them solely as a + collection of integer values, with no particular numerical value. + Only real.c and the runtime libraries care about + `FLOAT_WORDS_BIG_ENDIAN'. + + Between the combiner pass and the reload pass, it is possible to + have a paradoxical `subreg' which contains a `mem' instead of a + `reg' as its first operand. After the reload pass, it is also + possible to have a non-paradoxical `subreg' which contains a + `mem'; this usually occurs when the `mem' is a stack slot which + replaced a pseudo register. + + Note that it is not valid to access a `DFmode' value in `SFmode' + using a `subreg'. On some machines the most significant part of a + `DFmode' value does not have the same format as a single-precision + floating value. + + It is also not valid to access a single word of a multi-word value + in a hard register when less registers can hold the value than + would be expected from its size. For example, some 32-bit + machines have floating-point registers that can hold an entire + `DFmode' value. If register 10 were such a register `(subreg:SI + (reg:DF 10) 1)' would be invalid because there is no way to + convert that reference to a single machine register. The reload + pass prevents `subreg' expressions such as these from being formed. + + The first operand of a `subreg' expression is customarily accessed + with the `SUBREG_REG' macro and the second operand is customarily + accessed with the `SUBREG_BYTE' macro. + + `(scratch:M)' + This represents a scratch register that will be required for the + execution of a single instruction and not used subsequently. It is + converted into a `reg' by either the local register allocator or + the reload pass. + + `scratch' is usually present inside a `clobber' operation (*note + Side Effects::). + + `(cc0)' + This refers to the machine's condition code register. It has no + operands and may not have a machine mode. There are two ways to + use it: + + * To stand for a complete set of condition code flags. This is + best on most machines, where each comparison sets the entire + series of flags. + + With this technique, `(cc0)' may be validly used in only two + contexts: as the destination of an assignment (in test and + compare instructions) and in comparison operators comparing + against zero (`const_int' with value zero; that is to say, + `const0_rtx'). + + * To stand for a single flag that is the result of a single + condition. This is useful on machines that have only a + single flag bit, and in which comparison instructions must + specify the condition to test. + + With this technique, `(cc0)' may be validly used in only two + contexts: as the destination of an assignment (in test and + compare instructions) where the source is a comparison + operator, and as the first operand of `if_then_else' (in a + conditional branch). + + There is only one expression object of code `cc0'; it is the value + of the variable `cc0_rtx'. Any attempt to create an expression of + code `cc0' will return `cc0_rtx'. + + Instructions can set the condition code implicitly. On many + machines, nearly all instructions set the condition code based on + the value that they compute or store. It is not necessary to + record these actions explicitly in the RTL because the machine + description includes a prescription for recognizing the + instructions that do so (by means of the macro + `NOTICE_UPDATE_CC'). *Note Condition Code::. Only instructions + whose sole purpose is to set the condition code, and instructions + that use the condition code, need mention `(cc0)'. + + On some machines, the condition code register is given a register + number and a `reg' is used instead of `(cc0)'. This is usually the + preferable approach if only a small subset of instructions modify + the condition code. Other machines store condition codes in + general registers; in such cases a pseudo register should be used. + + Some machines, such as the Sparc and RS/6000, have two sets of + arithmetic instructions, one that sets and one that does not set + the condition code. This is best handled by normally generating + the instruction that does not set the condition code, and making a + pattern that both performs the arithmetic and sets the condition + code register (which would not be `(cc0)' in this case). For + examples, search for `addcc' and `andcc' in `sparc.md'. + + `(pc)' + This represents the machine's program counter. It has no operands + and may not have a machine mode. `(pc)' may be validly used only + in certain specific contexts in jump instructions. + + There is only one expression object of code `pc'; it is the value + of the variable `pc_rtx'. Any attempt to create an expression of + code `pc' will return `pc_rtx'. + + All instructions that do not jump alter the program counter + implicitly by incrementing it, but there is no need to mention + this in the RTL. + + `(mem:M ADDR ALIAS)' + This RTX represents a reference to main memory at an address + represented by the expression ADDR. M specifies how large a unit + of memory is accessed. ALIAS specifies an alias set for the + reference. In general two items are in different alias sets if + they cannot reference the same memory address. + + `(addressof:M REG)' + This RTX represents a request for the address of register REG. + Its mode is always `Pmode'. If there are any `addressof' + expressions left in the function after CSE, REG is forced into the + stack and the `addressof' expression is replaced with a `plus' + expression for the address of its stack slot. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-6 gcc-3.2.3/gcc/doc/gccint.info-6 *** gcc-3.2.2/gcc/doc/gccint.info-6 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-6 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,921 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Arithmetic, Next: Comparisons, Prev: Regs and Memory, Up: RTL + + RTL Expressions for Arithmetic + ============================== + + Unless otherwise specified, all the operands of arithmetic + expressions must be valid for mode M. An operand is valid for mode M + if it has mode M, or if it is a `const_int' or `const_double' and M is + a mode of class `MODE_INT'. + + For commutative binary operations, constants should be placed in the + second operand. + + `(plus:M X Y)' + Represents the sum of the values represented by X and Y carried + out in machine mode M. + + `(lo_sum:M X Y)' + Like `plus', except that it represents that sum of X and the + low-order bits of Y. The number of low order bits is + machine-dependent but is normally the number of bits in a `Pmode' + item minus the number of bits set by the `high' code (*note + Constants::). + + M should be `Pmode'. + + `(minus:M X Y)' + Like `plus' but represents subtraction. + + `(ss_plus:M X Y)' + Like `plus', but using signed saturation in case of an overflow. + + `(us_plus:M X Y)' + Like `plus', but using unsigned saturation in case of an overflow. + + `(ss_minus:M X Y)' + Like `minus', but using signed saturation in case of an overflow. + + `(us_minus:M X Y)' + Like `minus', but using unsigned saturation in case of an overflow. + + `(compare:M X Y)' + Represents the result of subtracting Y from X for purposes of + comparison. The result is computed without overflow, as if with + infinite precision. + + Of course, machines can't really subtract with infinite precision. + However, they can pretend to do so when only the sign of the + result will be used, which is the case when the result is stored + in the condition code. And that is the _only_ way this kind of + expression may validly be used: as a value to be stored in the + condition codes, either `(cc0)' or a register. *Note + Comparisons::. + + The mode M is not related to the modes of X and Y, but instead is + the mode of the condition code value. If `(cc0)' is used, it is + `VOIDmode'. Otherwise it is some mode in class `MODE_CC', often + `CCmode'. *Note Condition Code::. If M is `VOIDmode' or + `CCmode', the operation returns sufficient information (in an + unspecified format) so that any comparison operator can be applied + to the result of the `COMPARE' operation. For other modes in + class `MODE_CC', the operation only returns a subset of this + information. + + Normally, X and Y must have the same mode. Otherwise, `compare' + is valid only if the mode of X is in class `MODE_INT' and Y is a + `const_int' or `const_double' with mode `VOIDmode'. The mode of X + determines what mode the comparison is to be done in; thus it must + not be `VOIDmode'. + + If one of the operands is a constant, it should be placed in the + second operand and the comparison code adjusted as appropriate. + + A `compare' specifying two `VOIDmode' constants is not valid since + there is no way to know in what mode the comparison is to be + performed; the comparison must either be folded during the + compilation or the first operand must be loaded into a register + while its mode is still known. + + `(neg:M X)' + Represents the negation (subtraction from zero) of the value + represented by X, carried out in mode M. + + `(mult:M X Y)' + Represents the signed product of the values represented by X and Y + carried out in machine mode M. + + Some machines support a multiplication that generates a product + wider than the operands. Write the pattern for this as + + (mult:M (sign_extend:M X) (sign_extend:M Y)) + + where M is wider than the modes of X and Y, which need not be the + same. + + For unsigned widening multiplication, use the same idiom, but with + `zero_extend' instead of `sign_extend'. + + `(div:M X Y)' + Represents the quotient in signed division of X by Y, carried out + in machine mode M. If M is a floating point mode, it represents + the exact quotient; otherwise, the integerized quotient. + + Some machines have division instructions in which the operands and + quotient widths are not all the same; you should represent such + instructions using `truncate' and `sign_extend' as in, + + (truncate:M1 (div:M2 X (sign_extend:M2 Y))) + + `(udiv:M X Y)' + Like `div' but represents unsigned division. + + `(mod:M X Y)' + `(umod:M X Y)' + Like `div' and `udiv' but represent the remainder instead of the + quotient. + + `(smin:M X Y)' + `(smax:M X Y)' + Represents the smaller (for `smin') or larger (for `smax') of X + and Y, interpreted as signed integers in mode M. + + `(umin:M X Y)' + `(umax:M X Y)' + Like `smin' and `smax', but the values are interpreted as unsigned + integers. + + `(not:M X)' + Represents the bitwise complement of the value represented by X, + carried out in mode M, which must be a fixed-point machine mode. + + `(and:M X Y)' + Represents the bitwise logical-and of the values represented by X + and Y, carried out in machine mode M, which must be a fixed-point + machine mode. + + `(ior:M X Y)' + Represents the bitwise inclusive-or of the values represented by X + and Y, carried out in machine mode M, which must be a fixed-point + mode. + + `(xor:M X Y)' + Represents the bitwise exclusive-or of the values represented by X + and Y, carried out in machine mode M, which must be a fixed-point + mode. + + `(ashift:M X C)' + Represents the result of arithmetically shifting X left by C + places. X have mode M, a fixed-point machine mode. C be a + fixed-point mode or be a constant with mode `VOIDmode'; which mode + is determined by the mode called for in the machine description + entry for the left-shift instruction. For example, on the VAX, + the mode of C is `QImode' regardless of M. + + `(lshiftrt:M X C)' + `(ashiftrt:M X C)' + Like `ashift' but for right shift. Unlike the case for left shift, + these two operations are distinct. + + `(rotate:M X C)' + `(rotatert:M X C)' + Similar but represent left and right rotate. If C is a constant, + use `rotate'. + + `(abs:M X)' + Represents the absolute value of X, computed in mode M. + + `(sqrt:M X)' + Represents the square root of X, computed in mode M. Most often M + will be a floating point mode. + + `(ffs:M X)' + Represents one plus the index of the least significant 1-bit in X, + represented as an integer of mode M. (The value is zero if X is + zero.) The mode of X need not be M; depending on the target + machine, various mode combinations may be valid. + +  + File: gccint.info, Node: Comparisons, Next: Bit-Fields, Prev: Arithmetic, Up: RTL + + Comparison Operations + ===================== + + Comparison operators test a relation on two operands and are + considered to represent a machine-dependent nonzero value described by, + but not necessarily equal to, `STORE_FLAG_VALUE' (*note Misc::) if the + relation holds, or zero if it does not. The mode of the comparison + operation is independent of the mode of the data being compared. If + the comparison operation is being tested (e.g., the first operand of an + `if_then_else'), the mode must be `VOIDmode'. If the comparison + operation is producing data to be stored in some variable, the mode + must be in class `MODE_INT'. All comparison operations producing data + must use the same mode, which is machine-specific. + + There are two ways that comparison operations may be used. The + comparison operators may be used to compare the condition codes `(cc0)' + against zero, as in `(eq (cc0) (const_int 0))'. Such a construct + actually refers to the result of the preceding instruction in which the + condition codes were set. The instruction setting the condition code + must be adjacent to the instruction using the condition code; only + `note' insns may separate them. + + Alternatively, a comparison operation may directly compare two data + objects. The mode of the comparison is determined by the operands; they + must both be valid for a common machine mode. A comparison with both + operands constant would be invalid as the machine mode could not be + deduced from it, but such a comparison should never exist in RTL due to + constant folding. + + In the example above, if `(cc0)' were last set to `(compare X Y)', + the comparison operation is identical to `(eq X Y)'. Usually only one + style of comparisons is supported on a particular machine, but the + combine pass will try to merge the operations to produce the `eq' shown + in case it exists in the context of the particular insn involved. + + Inequality comparisons come in two flavors, signed and unsigned. + Thus, there are distinct expression codes `gt' and `gtu' for signed and + unsigned greater-than. These can produce different results for the same + pair of integer values: for example, 1 is signed greater-than -1 but not + unsigned greater-than, because -1 when regarded as unsigned is actually + `0xffffffff' which is greater than 1. + + The signed comparisons are also used for floating point values. + Floating point comparisons are distinguished by the machine modes of + the operands. + + `(eq:M X Y)' + `STORE_FLAG_VALUE' if the values represented by X and Y are equal, + otherwise 0. + + `(ne:M X Y)' + `STORE_FLAG_VALUE' if the values represented by X and Y are not + equal, otherwise 0. + + `(gt:M X Y)' + `STORE_FLAG_VALUE' if the X is greater than Y. If they are + fixed-point, the comparison is done in a signed sense. + + `(gtu:M X Y)' + Like `gt' but does unsigned comparison, on fixed-point numbers + only. + + `(lt:M X Y)' + `(ltu:M X Y)' + Like `gt' and `gtu' but test for "less than". + + `(ge:M X Y)' + `(geu:M X Y)' + Like `gt' and `gtu' but test for "greater than or equal". + + `(le:M X Y)' + `(leu:M X Y)' + Like `gt' and `gtu' but test for "less than or equal". + + `(if_then_else COND THEN ELSE)' + This is not a comparison operation but is listed here because it is + always used in conjunction with a comparison operation. To be + precise, COND is a comparison expression. This expression + represents a choice, according to COND, between the value + represented by THEN and the one represented by ELSE. + + On most machines, `if_then_else' expressions are valid only to + express conditional jumps. + + `(cond [TEST1 VALUE1 TEST2 VALUE2 ...] DEFAULT)' + Similar to `if_then_else', but more general. Each of TEST1, + TEST2, ... is performed in turn. The result of this expression is + the VALUE corresponding to the first nonzero test, or DEFAULT if + none of the tests are nonzero expressions. + + This is currently not valid for instruction patterns and is + supported only for insn attributes. *Note Insn Attributes::. + +  + File: gccint.info, Node: Bit-Fields, Next: Vector Operations, Prev: Comparisons, Up: RTL + + Bit-Fields + ========== + + Special expression codes exist to represent bit-field instructions. + These types of expressions are lvalues in RTL; they may appear on the + left side of an assignment, indicating insertion of a value into the + specified bit-field. + + `(sign_extract:M LOC SIZE POS)' + This represents a reference to a sign-extended bit-field contained + or starting in LOC (a memory or register reference). The bit-field + is SIZE bits wide and starts at bit POS. The compilation option + `BITS_BIG_ENDIAN' says which end of the memory unit POS counts + from. + + If LOC is in memory, its mode must be a single-byte integer mode. + If LOC is in a register, the mode to use is specified by the + operand of the `insv' or `extv' pattern (*note Standard Names::) + and is usually a full-word integer mode, which is the default if + none is specified. + + The mode of POS is machine-specific and is also specified in the + `insv' or `extv' pattern. + + The mode M is the same as the mode that would be used for LOC if + it were a register. + + `(zero_extract:M LOC SIZE POS)' + Like `sign_extract' but refers to an unsigned or zero-extended + bit-field. The same sequence of bits are extracted, but they are + filled to an entire word with zeros instead of by sign-extension. + +  + File: gccint.info, Node: Vector Operations, Next: Conversions, Prev: Bit-Fields, Up: RTL + + Vector Operations + ================= + + All normal RTL expressions can be used with vector modes; they are + interpreted as operating on each part of the vector independently. + Additionally, there are a few new expressions to describe specific + vector operations. + + `(vec_merge:M VEC1 VEC2 ITEMS)' + This describes a merge operation between two vectors. The result + is a vector of mode M; its elements are selected from either VEC1 + or VEC2. Which elements are selected is described by ITEMS, which + is a bit mask represented by a `const_int'; a zero bit indicates + the corresponding element in the result vector is taken from VEC2 + while a set bit indicates it is taken from VEC1. + + `(vec_select:M VEC1 SELECTION)' + This describes an operation that selects parts of a vector. VEC1 + is the source vector, SELECTION is a `parallel' that contains a + `const_int' for each of the subparts of the result vector, giving + the number of the source subpart that should be stored into it. + + `(vec_concat:M VEC1 VEC2)' + Describes a vector concat operation. The result is a + concatenation of the vectors VEC1 and VEC2; its length is the sum + of the lengths of the two inputs. + + `(vec_const:M SUBPARTS)' + This describes a constant vector. SUBPARTS is a `parallel' that + contains a constant for each of the subparts of the vector. + + `(vec_duplicate:M VEC)' + This operation converts a small vector into a larger one by + duplicating the input values. The output vector mode must have + the same submodes as the input vector mode, and the number of + output parts must be an integer multiple of the number of input + parts. + + +  + File: gccint.info, Node: Conversions, Next: RTL Declarations, Prev: Vector Operations, Up: RTL + + Conversions + =========== + + All conversions between machine modes must be represented by + explicit conversion operations. For example, an expression which is + the sum of a byte and a full word cannot be written as `(plus:SI + (reg:QI 34) (reg:SI 80))' because the `plus' operation requires two + operands of the same machine mode. Therefore, the byte-sized operand + is enclosed in a conversion operation, as in + + (plus:SI (sign_extend:SI (reg:QI 34)) (reg:SI 80)) + + The conversion operation is not a mere placeholder, because there + may be more than one way of converting from a given starting mode to + the desired final mode. The conversion operation code says how to do + it. + + For all conversion operations, X must not be `VOIDmode' because the + mode in which to do the conversion would not be known. The conversion + must either be done at compile-time or X must be placed into a register. + + `(sign_extend:M X)' + Represents the result of sign-extending the value X to machine + mode M. M must be a fixed-point mode and X a fixed-point value of + a mode narrower than M. + + `(zero_extend:M X)' + Represents the result of zero-extending the value X to machine + mode M. M must be a fixed-point mode and X a fixed-point value of + a mode narrower than M. + + `(float_extend:M X)' + Represents the result of extending the value X to machine mode M. + M must be a floating point mode and X a floating point value of a + mode narrower than M. + + `(truncate:M X)' + Represents the result of truncating the value X to machine mode M. + M must be a fixed-point mode and X a fixed-point value of a mode + wider than M. + + `(ss_truncate:M X)' + Represents the result of truncating the value X to machine mode M, + using signed saturation in the case of overflow. Both M and the + mode of X must be fixed-point modes. + + `(us_truncate:M X)' + Represents the result of truncating the value X to machine mode M, + using unsigned saturation in the case of overflow. Both M and the + mode of X must be fixed-point modes. + + `(float_truncate:M X)' + Represents the result of truncating the value X to machine mode M. + M must be a floating point mode and X a floating point value of a + mode wider than M. + + `(float:M X)' + Represents the result of converting fixed point value X, regarded + as signed, to floating point mode M. + + `(unsigned_float:M X)' + Represents the result of converting fixed point value X, regarded + as unsigned, to floating point mode M. + + `(fix:M X)' + When M is a fixed point mode, represents the result of converting + floating point value X to mode M, regarded as signed. How + rounding is done is not specified, so this operation may be used + validly in compiling C code only for integer-valued operands. + + `(unsigned_fix:M X)' + Represents the result of converting floating point value X to + fixed point mode M, regarded as unsigned. How rounding is done is + not specified. + + `(fix:M X)' + When M is a floating point mode, represents the result of + converting floating point value X (valid for mode M) to an + integer, still represented in floating point mode M, by rounding + towards zero. + +  + File: gccint.info, Node: RTL Declarations, Next: Side Effects, Prev: Conversions, Up: RTL + + Declarations + ============ + + Declaration expression codes do not represent arithmetic operations + but rather state assertions about their operands. + + `(strict_low_part (subreg:M (reg:N R) 0))' + This expression code is used in only one context: as the + destination operand of a `set' expression. In addition, the + operand of this expression must be a non-paradoxical `subreg' + expression. + + The presence of `strict_low_part' says that the part of the + register which is meaningful in mode N, but is not part of mode M, + is not to be altered. Normally, an assignment to such a subreg is + allowed to have undefined effects on the rest of the register when + M is less than a word. + +  + File: gccint.info, Node: Side Effects, Next: Incdec, Prev: RTL Declarations, Up: RTL + + Side Effect Expressions + ======================= + + The expression codes described so far represent values, not actions. + But machine instructions never produce values; they are meaningful only + for their side effects on the state of the machine. Special expression + codes are used to represent side effects. + + The body of an instruction is always one of these side effect codes; + the codes described above, which represent values, appear only as the + operands of these. + + `(set LVAL X)' + Represents the action of storing the value of X into the place + represented by LVAL. LVAL must be an expression representing a + place that can be stored in: `reg' (or `subreg' or + `strict_low_part'), `mem', `pc', `parallel', or `cc0'. + + If LVAL is a `reg', `subreg' or `mem', it has a machine mode; then + X must be valid for that mode. + + If LVAL is a `reg' whose machine mode is less than the full width + of the register, then it means that the part of the register + specified by the machine mode is given the specified value and the + rest of the register receives an undefined value. Likewise, if + LVAL is a `subreg' whose machine mode is narrower than the mode of + the register, the rest of the register can be changed in an + undefined way. + + If LVAL is a `strict_low_part' of a `subreg', then the part of the + register specified by the machine mode of the `subreg' is given + the value X and the rest of the register is not changed. + + If LVAL is `(cc0)', it has no machine mode, and X may be either a + `compare' expression or a value that may have any mode. The + latter case represents a "test" instruction. The expression `(set + (cc0) (reg:M N))' is equivalent to `(set (cc0) (compare (reg:M N) + (const_int 0)))'. Use the former expression to save space during + the compilation. + + If LVAL is a `parallel', it is used to represent the case of a + function returning a structure in multiple registers. Each element + of the `parallel' is an `expr_list' whose first operand is a `reg' + and whose second operand is a `const_int' representing the offset + (in bytes) into the structure at which the data in that register + corresponds. The first element may be null to indicate that the + structure is also passed partly in memory. + + If LVAL is `(pc)', we have a jump instruction, and the + possibilities for X are very limited. It may be a `label_ref' + expression (unconditional jump). It may be an `if_then_else' + (conditional jump), in which case either the second or the third + operand must be `(pc)' (for the case which does not jump) and the + other of the two must be a `label_ref' (for the case which does + jump). X may also be a `mem' or `(plus:SI (pc) Y)', where Y may + be a `reg' or a `mem'; these unusual patterns are used to + represent jumps through branch tables. + + If LVAL is neither `(cc0)' nor `(pc)', the mode of LVAL must not + be `VOIDmode' and the mode of X must be valid for the mode of LVAL. + + LVAL is customarily accessed with the `SET_DEST' macro and X with + the `SET_SRC' macro. + + `(return)' + As the sole expression in a pattern, represents a return from the + current function, on machines where this can be done with one + instruction, such as VAXen. On machines where a multi-instruction + "epilogue" must be executed in order to return from the function, + returning is done by jumping to a label which precedes the + epilogue, and the `return' expression code is never used. + + Inside an `if_then_else' expression, represents the value to be + placed in `pc' to return to the caller. + + Note that an insn pattern of `(return)' is logically equivalent to + `(set (pc) (return))', but the latter form is never used. + + `(call FUNCTION NARGS)' + Represents a function call. FUNCTION is a `mem' expression whose + address is the address of the function to be called. NARGS is an + expression which can be used for two purposes: on some machines it + represents the number of bytes of stack argument; on others, it + represents the number of argument registers. + + Each machine has a standard machine mode which FUNCTION must have. + The machine description defines macro `FUNCTION_MODE' to expand + into the requisite mode name. The purpose of this mode is to + specify what kind of addressing is allowed, on machines where the + allowed kinds of addressing depend on the machine mode being + addressed. + + `(clobber X)' + Represents the storing or possible storing of an unpredictable, + undescribed value into X, which must be a `reg', `scratch', + `parallel' or `mem' expression. + + One place this is used is in string instructions that store + standard values into particular hard registers. It may not be + worth the trouble to describe the values that are stored, but it + is essential to inform the compiler that the registers will be + altered, lest it attempt to keep data in them across the string + instruction. + + If X is `(mem:BLK (const_int 0))', it means that all memory + locations must be presumed clobbered. If X is a `parallel', it + has the same meaning as a `parallel' in a `set' expression. + + Note that the machine description classifies certain hard + registers as "call-clobbered". All function call instructions are + assumed by default to clobber these registers, so there is no need + to use `clobber' expressions to indicate this fact. Also, each + function call is assumed to have the potential to alter any memory + location, unless the function is declared `const'. + + If the last group of expressions in a `parallel' are each a + `clobber' expression whose arguments are `reg' or `match_scratch' + (*note RTL Template::) expressions, the combiner phase can add the + appropriate `clobber' expressions to an insn it has constructed + when doing so will cause a pattern to be matched. + + This feature can be used, for example, on a machine that whose + multiply and add instructions don't use an MQ register but which + has an add-accumulate instruction that does clobber the MQ + register. Similarly, a combined instruction might require a + temporary register while the constituent instructions might not. + + When a `clobber' expression for a register appears inside a + `parallel' with other side effects, the register allocator + guarantees that the register is unoccupied both before and after + that insn. However, the reload phase may allocate a register used + for one of the inputs unless the `&' constraint is specified for + the selected alternative (*note Modifiers::). You can clobber + either a specific hard register, a pseudo register, or a `scratch' + expression; in the latter two cases, GCC will allocate a hard + register that is available there for use as a temporary. + + For instructions that require a temporary register, you should use + `scratch' instead of a pseudo-register because this will allow the + combiner phase to add the `clobber' when required. You do this by + coding (`clobber' (`match_scratch' ...)). If you do clobber a + pseudo register, use one which appears nowhere else--generate a + new one each time. Otherwise, you may confuse CSE. + + There is one other known use for clobbering a pseudo register in a + `parallel': when one of the input operands of the insn is also + clobbered by the insn. In this case, using the same pseudo + register in the clobber and elsewhere in the insn produces the + expected results. + + `(use X)' + Represents the use of the value of X. It indicates that the value + in X at this point in the program is needed, even though it may + not be apparent why this is so. Therefore, the compiler will not + attempt to delete previous instructions whose only effect is to + store a value in X. X must be a `reg' expression. + + In some situations, it may be tempting to add a `use' of a + register in a `parallel' to describe a situation where the value + of a special register will modify the behavior of the instruction. + An hypothetical example might be a pattern for an addition that can + either wrap around or use saturating addition depending on the + value of a special control register: + + (parallel [(set (reg:SI 2) (unspec:SI [(reg:SI 3) + (reg:SI 4)] 0)) + (use (reg:SI 1))]) + + This will not work, several of the optimizers only look at + expressions locally; it is very likely that if you have multiple + insns with identical inputs to the `unspec', they will be + optimized away even if register 1 changes in between. + + This means that `use' can _only_ be used to describe that the + register is live. You should think twice before adding `use' + statements, more often you will want to use `unspec' instead. The + `use' RTX is most commonly useful to describe that a fixed + register is implicitly used in an insn. It is also safe to use in + patterns where the compiler knows for other reasons that the result + of the whole pattern is variable, such as `movstrM' or `call' + patterns. + + During the reload phase, an insn that has a `use' as pattern can + carry a reg_equal note. These `use' insns will be deleted before + the reload phase exits. + + During the delayed branch scheduling phase, X may be an insn. + This indicates that X previously was located at this place in the + code and its data dependencies need to be taken into account. + These `use' insns will be deleted before the delayed branch + scheduling phase exits. + + `(parallel [X0 X1 ...])' + Represents several side effects performed in parallel. The square + brackets stand for a vector; the operand of `parallel' is a vector + of expressions. X0, X1 and so on are individual side effect + expressions--expressions of code `set', `call', `return', + `clobber' or `use'. + + "In parallel" means that first all the values used in the + individual side-effects are computed, and second all the actual + side-effects are performed. For example, + + (parallel [(set (reg:SI 1) (mem:SI (reg:SI 1))) + (set (mem:SI (reg:SI 1)) (reg:SI 1))]) + + says unambiguously that the values of hard register 1 and the + memory location addressed by it are interchanged. In both places + where `(reg:SI 1)' appears as a memory address it refers to the + value in register 1 _before_ the execution of the insn. + + It follows that it is _incorrect_ to use `parallel' and expect the + result of one `set' to be available for the next one. For + example, people sometimes attempt to represent a jump-if-zero + instruction this way: + + (parallel [(set (cc0) (reg:SI 34)) + (set (pc) (if_then_else + (eq (cc0) (const_int 0)) + (label_ref ...) + (pc)))]) + + But this is incorrect, because it says that the jump condition + depends on the condition code value _before_ this instruction, not + on the new value that is set by this instruction. + + Peephole optimization, which takes place together with final + assembly code output, can produce insns whose patterns consist of + a `parallel' whose elements are the operands needed to output the + resulting assembler code--often `reg', `mem' or constant + expressions. This would not be well-formed RTL at any other stage + in compilation, but it is ok then because no further optimization + remains to be done. However, the definition of the macro + `NOTICE_UPDATE_CC', if any, must deal with such insns if you + define any peephole optimizations. + + `(cond_exec [COND EXPR])' + Represents a conditionally executed expression. The EXPR is + executed only if the COND is nonzero. The COND expression must + not have side-effects, but the EXPR may very well have + side-effects. + + `(sequence [INSNS ...])' + Represents a sequence of insns. Each of the INSNS that appears in + the vector is suitable for appearing in the chain of insns, so it + must be an `insn', `jump_insn', `call_insn', `code_label', + `barrier' or `note'. + + A `sequence' RTX is never placed in an actual insn during RTL + generation. It represents the sequence of insns that result from a + `define_expand' _before_ those insns are passed to `emit_insn' to + insert them in the chain of insns. When actually inserted, the + individual sub-insns are separated out and the `sequence' is + forgotten. + + After delay-slot scheduling is completed, an insn and all the + insns that reside in its delay slots are grouped together into a + `sequence'. The insn requiring the delay slot is the first insn + in the vector; subsequent insns are to be placed in the delay slot. + + `INSN_ANNULLED_BRANCH_P' is set on an insn in a delay slot to + indicate that a branch insn should be used that will conditionally + annul the effect of the insns in the delay slots. In such a case, + `INSN_FROM_TARGET_P' indicates that the insn is from the target of + the branch and should be executed only if the branch is taken; + otherwise the insn should be executed only if the branch is not + taken. *Note Delay Slots::. + + These expression codes appear in place of a side effect, as the body + of an insn, though strictly speaking they do not always describe side + effects as such: + + `(asm_input S)' + Represents literal assembler code as described by the string S. + + `(unspec [OPERANDS ...] INDEX)' + `(unspec_volatile [OPERANDS ...] INDEX)' + Represents a machine-specific operation on OPERANDS. INDEX + selects between multiple machine-specific operations. + `unspec_volatile' is used for volatile operations and operations + that may trap; `unspec' is used for other operations. + + These codes may appear inside a `pattern' of an insn, inside a + `parallel', or inside an expression. + + `(addr_vec:M [LR0 LR1 ...])' + Represents a table of jump addresses. The vector elements LR0, + etc., are `label_ref' expressions. The mode M specifies how much + space is given to each address; normally M would be `Pmode'. + + `(addr_diff_vec:M BASE [LR0 LR1 ...] MIN MAX FLAGS)' + Represents a table of jump addresses expressed as offsets from + BASE. The vector elements LR0, etc., are `label_ref' expressions + and so is BASE. The mode M specifies how much space is given to + each address-difference. MIN and MAX are set up by branch + shortening and hold a label with a minimum and a maximum address, + respectively. FLAGS indicates the relative position of BASE, MIN + and MAX to the containing insn and of MIN and MAX to BASE. See + rtl.def for details. + + `(prefetch:M ADDR RW LOCALITY)' + Represents prefetch of memory at address ADDR. Operand RW is 1 if + the prefetch is for data to be written, 0 otherwise; targets that + do not support write prefetches should treat this as a normal + prefetch. Operand LOCALITY specifies the amount of temporal + locality; 0 if there is none or 1, 2, or 3 for increasing levels + of temporal locality; targets that do not support locality hints + should ignore this. + + This insn is used to minimize cache-miss latency by moving data + into a cache before it is accessed. It should use only + non-faulting data prefetch instructions. + +  + File: gccint.info, Node: Incdec, Next: Assembler, Prev: Side Effects, Up: RTL + + Embedded Side-Effects on Addresses + ================================== + + Six special side-effect expression codes appear as memory addresses. + + `(pre_dec:M X)' + Represents the side effect of decrementing X by a standard amount + and represents also the value that X has after being decremented. + X must be a `reg' or `mem', but most machines allow only a `reg'. + M must be the machine mode for pointers on the machine in use. + The amount X is decremented by is the length in bytes of the + machine mode of the containing memory reference of which this + expression serves as the address. Here is an example of its use: + + (mem:DF (pre_dec:SI (reg:SI 39))) + + This says to decrement pseudo register 39 by the length of a + `DFmode' value and use the result to address a `DFmode' value. + + `(pre_inc:M X)' + Similar, but specifies incrementing X instead of decrementing it. + + `(post_dec:M X)' + Represents the same side effect as `pre_dec' but a different + value. The value represented here is the value X has before being + decremented. + + `(post_inc:M X)' + Similar, but specifies incrementing X instead of decrementing it. + + `(post_modify:M X Y)' + Represents the side effect of setting X to Y and represents X + before X is modified. X must be a `reg' or `mem', but most + machines allow only a `reg'. M must be the machine mode for + pointers on the machine in use. The amount X is decremented by is + the length in bytes of the machine mode of the containing memory + reference of which this expression serves as the address. Note + that this is not currently implemented. + + The expression Y must be one of three forms: + `(plus:M X Z)', `(minus:M X Z)', or `(plus:M X I)', + where Z is an index register and I is a constant. + + Here is an example of its use: + + (mem:SF (post_modify:SI (reg:SI 42) (plus (reg:SI 42) + (reg:SI 48)))) + + This says to modify pseudo register 42 by adding the contents of + pseudo register 48 to it, after the use of what ever 42 points to. + + `(pre_modify:M X EXPR)' + Similar except side effects happen before the use. + + These embedded side effect expressions must be used with care. + Instruction patterns may not use them. Until the `flow' pass of the + compiler, they may occur only to represent pushes onto the stack. The + `flow' pass finds cases where registers are incremented or decremented + in one instruction and used as an address shortly before or after; + these cases are then transformed to use pre- or post-increment or + -decrement. + + If a register used as the operand of these expressions is used in + another address in an insn, the original value of the register is used. + Uses of the register outside of an address are not permitted within the + same insn as a use in an embedded side effect expression because such + insns behave differently on different machines and hence must be treated + as ambiguous and disallowed. + + An instruction that can be represented with an embedded side effect + could also be represented using `parallel' containing an additional + `set' to describe how the address register is altered. This is not + done because machines that allow these operations at all typically + allow them wherever a memory address is called for. Describing them as + additional parallel stores would require doubling the number of entries + in the machine description. + +  + File: gccint.info, Node: Assembler, Next: Insns, Prev: Incdec, Up: RTL + + Assembler Instructions as Expressions + ===================================== + + The RTX code `asm_operands' represents a value produced by a + user-specified assembler instruction. It is used to represent an `asm' + statement with arguments. An `asm' statement with a single output + operand, like this: + + asm ("foo %1,%2,%0" : "=a" (outputvar) : "g" (x + y), "di" (*z)); + + is represented using a single `asm_operands' RTX which represents the + value that is stored in `outputvar': + + (set RTX-FOR-OUTPUTVAR + (asm_operands "foo %1,%2,%0" "a" 0 + [RTX-FOR-ADDITION-RESULT RTX-FOR-*Z] + [(asm_input:M1 "g") + (asm_input:M2 "di")])) + + Here the operands of the `asm_operands' RTX are the assembler template + string, the output-operand's constraint, the index-number of the output + operand among the output operands specified, a vector of input operand + RTX's, and a vector of input-operand modes and constraints. The mode + M1 is the mode of the sum `x+y'; M2 is that of `*z'. + + When an `asm' statement has multiple output values, its insn has + several such `set' RTX's inside of a `parallel'. Each `set' contains a + `asm_operands'; all of these share the same assembler template and + vectors, but each contains the constraint for the respective output + operand. They are also distinguished by the output-operand index + number, which is 0, 1, ... for successive output operands. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-7 gcc-3.2.3/gcc/doc/gccint.info-7 *** gcc-3.2.2/gcc/doc/gccint.info-7 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-7 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,924 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Insns, Next: Calls, Prev: Assembler, Up: RTL + + Insns + ===== + + The RTL representation of the code for a function is a doubly-linked + chain of objects called "insns". Insns are expressions with special + codes that are used for no other purpose. Some insns are actual + instructions; others represent dispatch tables for `switch' statements; + others represent labels to jump to or various sorts of declarative + information. + + In addition to its own specific data, each insn must have a unique + id-number that distinguishes it from all other insns in the current + function (after delayed branch scheduling, copies of an insn with the + same id-number may be present in multiple places in a function, but + these copies will always be identical and will only appear inside a + `sequence'), and chain pointers to the preceding and following insns. + These three fields occupy the same position in every insn, independent + of the expression code of the insn. They could be accessed with `XEXP' + and `XINT', but instead three special macros are always used: + + `INSN_UID (I)' + Accesses the unique id of insn I. + + `PREV_INSN (I)' + Accesses the chain pointer to the insn preceding I. If I is the + first insn, this is a null pointer. + + `NEXT_INSN (I)' + Accesses the chain pointer to the insn following I. If I is the + last insn, this is a null pointer. + + The first insn in the chain is obtained by calling `get_insns'; the + last insn is the result of calling `get_last_insn'. Within the chain + delimited by these insns, the `NEXT_INSN' and `PREV_INSN' pointers must + always correspond: if INSN is not the first insn, + + NEXT_INSN (PREV_INSN (INSN)) == INSN + + is always true and if INSN is not the last insn, + + PREV_INSN (NEXT_INSN (INSN)) == INSN + + is always true. + + After delay slot scheduling, some of the insns in the chain might be + `sequence' expressions, which contain a vector of insns. The value of + `NEXT_INSN' in all but the last of these insns is the next insn in the + vector; the value of `NEXT_INSN' of the last insn in the vector is the + same as the value of `NEXT_INSN' for the `sequence' in which it is + contained. Similar rules apply for `PREV_INSN'. + + This means that the above invariants are not necessarily true for + insns inside `sequence' expressions. Specifically, if INSN is the + first insn in a `sequence', `NEXT_INSN (PREV_INSN (INSN))' is the insn + containing the `sequence' expression, as is the value of `PREV_INSN + (NEXT_INSN (INSN))' if INSN is the last insn in the `sequence' + expression. You can use these expressions to find the containing + `sequence' expression. + + Every insn has one of the following six expression codes: + + `insn' + The expression code `insn' is used for instructions that do not + jump and do not do function calls. `sequence' expressions are + always contained in insns with code `insn' even if one of those + insns should jump or do function calls. + + Insns with code `insn' have four additional fields beyond the three + mandatory ones listed above. These four are described in a table + below. + + `jump_insn' + The expression code `jump_insn' is used for instructions that may + jump (or, more generally, may contain `label_ref' expressions). If + there is an instruction to return from the current function, it is + recorded as a `jump_insn'. + + `jump_insn' insns have the same extra fields as `insn' insns, + accessed in the same way and in addition contain a field + `JUMP_LABEL' which is defined once jump optimization has completed. + + For simple conditional and unconditional jumps, this field contains + the `code_label' to which this insn will (possibly conditionally) + branch. In a more complex jump, `JUMP_LABEL' records one of the + labels that the insn refers to; the only way to find the others is + to scan the entire body of the insn. In an `addr_vec', + `JUMP_LABEL' is `NULL_RTX'. + + Return insns count as jumps, but since they do not refer to any + labels, their `JUMP_LABEL' is `NULL_RTX'. + + `call_insn' + The expression code `call_insn' is used for instructions that may + do function calls. It is important to distinguish these + instructions because they imply that certain registers and memory + locations may be altered unpredictably. + + `call_insn' insns have the same extra fields as `insn' insns, + accessed in the same way and in addition contain a field + `CALL_INSN_FUNCTION_USAGE', which contains a list (chain of + `expr_list' expressions) containing `use' and `clobber' + expressions that denote hard registers and `MEM's used or + clobbered by the called function. + + A `MEM' generally points to a stack slots in which arguments passed + to the libcall by reference (*note FUNCTION_ARG_PASS_BY_REFERENCE: + Register Arguments.) are stored. If the argument is caller-copied + (*note FUNCTION_ARG_CALLEE_COPIES: Register Arguments.), the stack + slot will be mentioned in `CLOBBER' and `USE' entries; if it's + callee-copied, only a `USE' will appear, and the `MEM' may point + to addresses that are not stack slots. These `MEM's are used only + in libcalls, because, unlike regular function calls, `CONST_CALL's + (which libcalls generally are, *note CONST_CALL_P: Flags.) aren't + assumed to read and write all memory, so flow would consider the + stores dead and remove them. Note that, since a libcall must + never return values in memory (*note RETURN_IN_MEMORY: Aggregate + Return.), there will never be a `CLOBBER' for a memory address + holding a return value. + + `CLOBBER'ed registers in this list augment registers specified in + `CALL_USED_REGISTERS' (*note Register Basics::). + + `code_label' + A `code_label' insn represents a label that a jump insn can jump + to. It contains two special fields of data in addition to the + three standard ones. `CODE_LABEL_NUMBER' is used to hold the + "label number", a number that identifies this label uniquely among + all the labels in the compilation (not just in the current + function). Ultimately, the label is represented in the assembler + output as an assembler label, usually of the form `LN' where N is + the label number. + + When a `code_label' appears in an RTL expression, it normally + appears within a `label_ref' which represents the address of the + label, as a number. + + Besides as a `code_label', a label can also be represented as a + `note' of type `NOTE_INSN_DELETED_LABEL'. + + The field `LABEL_NUSES' is only defined once the jump optimization + phase is completed and contains the number of times this label is + referenced in the current function. + + The field `LABEL_ALTERNATE_NAME' is used to associate a name with + a `code_label'. If this field is defined, the alternate name will + be emitted instead of an internally generated label name. + + `barrier' + Barriers are placed in the instruction stream when control cannot + flow past them. They are placed after unconditional jump + instructions to indicate that the jumps are unconditional and + after calls to `volatile' functions, which do not return (e.g., + `exit'). They contain no information beyond the three standard + fields. + + `note' + `note' insns are used to represent additional debugging and + declarative information. They contain two nonstandard fields, an + integer which is accessed with the macro `NOTE_LINE_NUMBER' and a + string accessed with `NOTE_SOURCE_FILE'. + + If `NOTE_LINE_NUMBER' is positive, the note represents the + position of a source line and `NOTE_SOURCE_FILE' is the source + file name that the line came from. These notes control generation + of line number data in the assembler output. + + Otherwise, `NOTE_LINE_NUMBER' is not really a line number but a + code with one of the following values (and `NOTE_SOURCE_FILE' must + contain a null pointer): + + `NOTE_INSN_DELETED' + Such a note is completely ignorable. Some passes of the + compiler delete insns by altering them into notes of this + kind. + + `NOTE_INSN_DELETED_LABEL' + This marks what used to be a `code_label', but was not used + for other purposes than taking its address and was + transformed to mark that no code jumps to it. + + `NOTE_INSN_BLOCK_BEG' + `NOTE_INSN_BLOCK_END' + These types of notes indicate the position of the beginning + and end of a level of scoping of variable names. They + control the output of debugging information. + + `NOTE_INSN_EH_REGION_BEG' + `NOTE_INSN_EH_REGION_END' + These types of notes indicate the position of the beginning + and end of a level of scoping for exception handling. + `NOTE_BLOCK_NUMBER' identifies which `CODE_LABEL' or `note' + of type `NOTE_INSN_DELETED_LABEL' is associated with the + given region. + + `NOTE_INSN_LOOP_BEG' + `NOTE_INSN_LOOP_END' + These types of notes indicate the position of the beginning + and end of a `while' or `for' loop. They enable the loop + optimizer to find loops quickly. + + `NOTE_INSN_LOOP_CONT' + Appears at the place in a loop that `continue' statements + jump to. + + `NOTE_INSN_LOOP_VTOP' + This note indicates the place in a loop where the exit test + begins for those loops in which the exit test has been + duplicated. This position becomes another virtual start of + the loop when considering loop invariants. + + `NOTE_INSN_FUNCTION_END' + Appears near the end of the function body, just before the + label that `return' statements jump to (on machine where a + single instruction does not suffice for returning). This + note may be deleted by jump optimization. + + `NOTE_INSN_SETJMP' + Appears following each call to `setjmp' or a related function. + + These codes are printed symbolically when they appear in debugging + dumps. + + The machine mode of an insn is normally `VOIDmode', but some phases + use the mode for various purposes. + + The common subexpression elimination pass sets the mode of an insn to + `QImode' when it is the first insn in a block that has already been + processed. + + The second Haifa scheduling pass, for targets that can multiple + issue, sets the mode of an insn to `TImode' when it is believed that the + instruction begins an issue group. That is, when the instruction + cannot issue simultaneously with the previous. This may be relied on + by later passes, in particular machine-dependent reorg. + + Here is a table of the extra fields of `insn', `jump_insn' and + `call_insn' insns: + + `PATTERN (I)' + An expression for the side effect performed by this insn. This + must be one of the following codes: `set', `call', `use', + `clobber', `return', `asm_input', `asm_output', `addr_vec', + `addr_diff_vec', `trap_if', `unspec', `unspec_volatile', + `parallel', `cond_exec', or `sequence'. If it is a `parallel', + each element of the `parallel' must be one these codes, except that + `parallel' expressions cannot be nested and `addr_vec' and + `addr_diff_vec' are not permitted inside a `parallel' expression. + + `INSN_CODE (I)' + An integer that says which pattern in the machine description + matches this insn, or -1 if the matching has not yet been + attempted. + + Such matching is never attempted and this field remains -1 on an + insn whose pattern consists of a single `use', `clobber', + `asm_input', `addr_vec' or `addr_diff_vec' expression. + + Matching is also never attempted on insns that result from an `asm' + statement. These contain at least one `asm_operands' expression. + The function `asm_noperands' returns a non-negative value for such + insns. + + In the debugging output, this field is printed as a number + followed by a symbolic representation that locates the pattern in + the `md' file as some small positive or negative offset from a + named pattern. + + `LOG_LINKS (I)' + A list (chain of `insn_list' expressions) giving information about + dependencies between instructions within a basic block. Neither a + jump nor a label may come between the related insns. + + `REG_NOTES (I)' + A list (chain of `expr_list' and `insn_list' expressions) giving + miscellaneous information about the insn. It is often information + pertaining to the registers used in this insn. + + The `LOG_LINKS' field of an insn is a chain of `insn_list' + expressions. Each of these has two operands: the first is an insn, and + the second is another `insn_list' expression (the next one in the + chain). The last `insn_list' in the chain has a null pointer as second + operand. The significant thing about the chain is which insns appear + in it (as first operands of `insn_list' expressions). Their order is + not significant. + + This list is originally set up by the flow analysis pass; it is a + null pointer until then. Flow only adds links for those data + dependencies which can be used for instruction combination. For each + insn, the flow analysis pass adds a link to insns which store into + registers values that are used for the first time in this insn. The + instruction scheduling pass adds extra links so that every dependence + will be represented. Links represent data dependencies, + antidependencies and output dependencies; the machine mode of the link + distinguishes these three types: antidependencies have mode + `REG_DEP_ANTI', output dependencies have mode `REG_DEP_OUTPUT', and + data dependencies have mode `VOIDmode'. + + The `REG_NOTES' field of an insn is a chain similar to the + `LOG_LINKS' field but it includes `expr_list' expressions in addition + to `insn_list' expressions. There are several kinds of register notes, + which are distinguished by the machine mode, which in a register note + is really understood as being an `enum reg_note'. The first operand OP + of the note is data whose meaning depends on the kind of note. + + The macro `REG_NOTE_KIND (X)' returns the kind of register note. + Its counterpart, the macro `PUT_REG_NOTE_KIND (X, NEWKIND)' sets the + register note type of X to be NEWKIND. + + Register notes are of three classes: They may say something about an + input to an insn, they may say something about an output of an insn, or + they may create a linkage between two insns. There are also a set of + values that are only used in `LOG_LINKS'. + + These register notes annotate inputs to an insn: + + `REG_DEAD' + The value in OP dies in this insn; that is to say, altering the + value immediately after this insn would not affect the future + behavior of the program. + + It does not follow that the register OP has no useful value after + this insn since OP is not necessarily modified by this insn. + Rather, no subsequent instruction uses the contents of OP. + + `REG_UNUSED' + The register OP being set by this insn will not be used in a + subsequent insn. This differs from a `REG_DEAD' note, which + indicates that the value in an input will not be used subsequently. + These two notes are independent; both may be present for the same + register. + + `REG_INC' + The register OP is incremented (or decremented; at this level + there is no distinction) by an embedded side effect inside this + insn. This means it appears in a `post_inc', `pre_inc', + `post_dec' or `pre_dec' expression. + + `REG_NONNEG' + The register OP is known to have a nonnegative value when this + insn is reached. This is used so that decrement and branch until + zero instructions, such as the m68k dbra, can be matched. + + The `REG_NONNEG' note is added to insns only if the machine + description has a `decrement_and_branch_until_zero' pattern. + + `REG_NO_CONFLICT' + This insn does not cause a conflict between OP and the item being + set by this insn even though it might appear that it does. In + other words, if the destination register and OP could otherwise be + assigned the same register, this insn does not prevent that + assignment. + + Insns with this note are usually part of a block that begins with a + `clobber' insn specifying a multi-word pseudo register (which will + be the output of the block), a group of insns that each set one + word of the value and have the `REG_NO_CONFLICT' note attached, + and a final insn that copies the output to itself with an attached + `REG_EQUAL' note giving the expression being computed. This block + is encapsulated with `REG_LIBCALL' and `REG_RETVAL' notes on the + first and last insns, respectively. + + `REG_LABEL' + This insn uses OP, a `code_label' or a `note' of type + `NOTE_INSN_DELETED_LABEL', but is not a `jump_insn', or it is a + `jump_insn' that required the label to be held in a register. The + presence of this note allows jump optimization to be aware that OP + is, in fact, being used, and flow optimization to build an + accurate flow graph. + + The following notes describe attributes of outputs of an insn: + + `REG_EQUIV' + `REG_EQUAL' + This note is only valid on an insn that sets only one register and + indicates that that register will be equal to OP at run time; the + scope of this equivalence differs between the two types of notes. + The value which the insn explicitly copies into the register may + look different from OP, but they will be equal at run time. If the + output of the single `set' is a `strict_low_part' expression, the + note refers to the register that is contained in `SUBREG_REG' of + the `subreg' expression. + + For `REG_EQUIV', the register is equivalent to OP throughout the + entire function, and could validly be replaced in all its + occurrences by OP. ("Validly" here refers to the data flow of the + program; simple replacement may make some insns invalid.) For + example, when a constant is loaded into a register that is never + assigned any other value, this kind of note is used. + + When a parameter is copied into a pseudo-register at entry to a + function, a note of this kind records that the register is + equivalent to the stack slot where the parameter was passed. + Although in this case the register may be set by other insns, it + is still valid to replace the register by the stack slot + throughout the function. + + A `REG_EQUIV' note is also used on an instruction which copies a + register parameter into a pseudo-register at entry to a function, + if there is a stack slot where that parameter could be stored. + Although other insns may set the pseudo-register, it is valid for + the compiler to replace the pseudo-register by stack slot + throughout the function, provided the compiler ensures that the + stack slot is properly initialized by making the replacement in + the initial copy instruction as well. This is used on machines + for which the calling convention allocates stack space for + register parameters. See `REG_PARM_STACK_SPACE' in *Note Stack + Arguments::. + + In the case of `REG_EQUAL', the register that is set by this insn + will be equal to OP at run time at the end of this insn but not + necessarily elsewhere in the function. In this case, OP is + typically an arithmetic expression. For example, when a sequence + of insns such as a library call is used to perform an arithmetic + operation, this kind of note is attached to the insn that produces + or copies the final value. + + These two notes are used in different ways by the compiler passes. + `REG_EQUAL' is used by passes prior to register allocation (such as + common subexpression elimination and loop optimization) to tell + them how to think of that value. `REG_EQUIV' notes are used by + register allocation to indicate that there is an available + substitute expression (either a constant or a `mem' expression for + the location of a parameter on the stack) that may be used in + place of a register if insufficient registers are available. + + Except for stack homes for parameters, which are indicated by a + `REG_EQUIV' note and are not useful to the early optimization + passes and pseudo registers that are equivalent to a memory + location throughout their entire life, which is not detected until + later in the compilation, all equivalences are initially indicated + by an attached `REG_EQUAL' note. In the early stages of register + allocation, a `REG_EQUAL' note is changed into a `REG_EQUIV' note + if OP is a constant and the insn represents the only set of its + destination register. + + Thus, compiler passes prior to register allocation need only check + for `REG_EQUAL' notes and passes subsequent to register allocation + need only check for `REG_EQUIV' notes. + + `REG_WAS_0' + The single output of this insn contained zero before this insn. + OP is the insn that set it to zero. You can rely on this note if + it is present and OP has not been deleted or turned into a `note'; + its absence implies nothing. + + These notes describe linkages between insns. They occur in pairs: + one insn has one of a pair of notes that points to a second insn, which + has the inverse note pointing back to the first insn. + + `REG_RETVAL' + This insn copies the value of a multi-insn sequence (for example, a + library call), and OP is the first insn of the sequence (for a + library call, the first insn that was generated to set up the + arguments for the library call). + + Loop optimization uses this note to treat such a sequence as a + single operation for code motion purposes and flow analysis uses + this note to delete such sequences whose results are dead. + + A `REG_EQUAL' note will also usually be attached to this insn to + provide the expression being computed by the sequence. + + These notes will be deleted after reload, since they are no longer + accurate or useful. + + `REG_LIBCALL' + This is the inverse of `REG_RETVAL': it is placed on the first + insn of a multi-insn sequence, and it points to the last one. + + These notes are deleted after reload, since they are no longer + useful or accurate. + + `REG_CC_SETTER' + `REG_CC_USER' + On machines that use `cc0', the insns which set and use `cc0' set + and use `cc0' are adjacent. However, when branch delay slot + filling is done, this may no longer be true. In this case a + `REG_CC_USER' note will be placed on the insn setting `cc0' to + point to the insn using `cc0' and a `REG_CC_SETTER' note will be + placed on the insn using `cc0' to point to the insn setting `cc0'. + + These values are only used in the `LOG_LINKS' field, and indicate + the type of dependency that each link represents. Links which indicate + a data dependence (a read after write dependence) do not use any code, + they simply have mode `VOIDmode', and are printed without any + descriptive text. + + `REG_DEP_ANTI' + This indicates an anti dependence (a write after read dependence). + + `REG_DEP_OUTPUT' + This indicates an output dependence (a write after write + dependence). + + These notes describe information gathered from gcov profile data. + They are stored in the `REG_NOTES' field of an insn as an `expr_list'. + + `REG_EXEC_COUNT' + This is used to indicate the number of times a basic block was + executed according to the profile data. The note is attached to + the first insn in the basic block. + + `REG_BR_PROB' + This is used to specify the ratio of branches to non-branches of a + branch insn according to the profile data. The value is stored as + a value between 0 and REG_BR_PROB_BASE; larger values indicate a + higher probability that the branch will be taken. + + `REG_BR_PRED' + These notes are found in JUMP insns after delayed branch scheduling + has taken place. They indicate both the direction and the + likelihood of the JUMP. The format is a bitmask of ATTR_FLAG_* + values. + + `REG_FRAME_RELATED_EXPR' + This is used on an RTX_FRAME_RELATED_P insn wherein the attached + expression is used in place of the actual insn pattern. This is + done in cases where the pattern is either complex or misleading. + + For convenience, the machine mode in an `insn_list' or `expr_list' + is printed using these symbolic codes in debugging dumps. + + The only difference between the expression codes `insn_list' and + `expr_list' is that the first operand of an `insn_list' is assumed to + be an insn and is printed in debugging dumps as the insn's unique id; + the first operand of an `expr_list' is printed in the ordinary way as + an expression. + +  + File: gccint.info, Node: Calls, Next: Sharing, Prev: Insns, Up: RTL + + RTL Representation of Function-Call Insns + ========================================= + + Insns that call subroutines have the RTL expression code `call_insn'. + These insns must satisfy special rules, and their bodies must use a + special RTL expression code, `call'. + + A `call' expression has two operands, as follows: + + (call (mem:FM ADDR) NBYTES) + + Here NBYTES is an operand that represents the number of bytes of + argument data being passed to the subroutine, FM is a machine mode + (which must equal as the definition of the `FUNCTION_MODE' macro in the + machine description) and ADDR represents the address of the subroutine. + + For a subroutine that returns no value, the `call' expression as + shown above is the entire body of the insn, except that the insn might + also contain `use' or `clobber' expressions. + + For a subroutine that returns a value whose mode is not `BLKmode', + the value is returned in a hard register. If this register's number is + R, then the body of the call insn looks like this: + + (set (reg:M R) + (call (mem:FM ADDR) NBYTES)) + + This RTL expression makes it clear (to the optimizer passes) that the + appropriate register receives a useful value in this insn. + + When a subroutine returns a `BLKmode' value, it is handled by + passing to the subroutine the address of a place to store the value. + So the call insn itself does not "return" any value, and it has the + same RTL form as a call that returns nothing. + + On some machines, the call instruction itself clobbers some register, + for example to contain the return address. `call_insn' insns on these + machines should have a body which is a `parallel' that contains both + the `call' expression and `clobber' expressions that indicate which + registers are destroyed. Similarly, if the call instruction requires + some register other than the stack pointer that is not explicitly + mentioned it its RTL, a `use' subexpression should mention that + register. + + Functions that are called are assumed to modify all registers listed + in the configuration macro `CALL_USED_REGISTERS' (*note Register + Basics::) and, with the exception of `const' functions and library + calls, to modify all of memory. + + Insns containing just `use' expressions directly precede the + `call_insn' insn to indicate which registers contain inputs to the + function. Similarly, if registers other than those in + `CALL_USED_REGISTERS' are clobbered by the called function, insns + containing a single `clobber' follow immediately after the call to + indicate which registers. + +  + File: gccint.info, Node: Sharing, Next: Reading RTL, Prev: Calls, Up: RTL + + Structure Sharing Assumptions + ============================= + + The compiler assumes that certain kinds of RTL expressions are + unique; there do not exist two distinct objects representing the same + value. In other cases, it makes an opposite assumption: that no RTL + expression object of a certain kind appears in more than one place in + the containing structure. + + These assumptions refer to a single function; except for the RTL + objects that describe global variables and external functions, and a + few standard objects such as small integer constants, no RTL objects + are common to two functions. + + * Each pseudo-register has only a single `reg' object to represent + it, and therefore only a single machine mode. + + * For any symbolic label, there is only one `symbol_ref' object + referring to it. + + * All `const_int' expressions with equal values are shared. + + * There is only one `pc' expression. + + * There is only one `cc0' expression. + + * There is only one `const_double' expression with value 0 for each + floating point mode. Likewise for values 1 and 2. + + * There is only one `const_vector' expression with value 0 for each + vector mode, be it an integer or a double constant vector. + + * No `label_ref' or `scratch' appears in more than one place in the + RTL structure; in other words, it is safe to do a tree-walk of all + the insns in the function and assume that each time a `label_ref' + or `scratch' is seen it is distinct from all others that are seen. + + * Only one `mem' object is normally created for each static variable + or stack slot, so these objects are frequently shared in all the + places they appear. However, separate but equal objects for these + variables are occasionally made. + + * When a single `asm' statement has multiple output operands, a + distinct `asm_operands' expression is made for each output operand. + However, these all share the vector which contains the sequence of + input operands. This sharing is used later on to test whether two + `asm_operands' expressions come from the same statement, so all + optimizations must carefully preserve the sharing if they copy the + vector at all. + + * No RTL object appears in more than one place in the RTL structure + except as described above. Many passes of the compiler rely on + this by assuming that they can modify RTL objects in place without + unwanted side-effects on other insns. + + * During initial RTL generation, shared structure is freely + introduced. After all the RTL for a function has been generated, + all shared structure is copied by `unshare_all_rtl' in + `emit-rtl.c', after which the above rules are guaranteed to be + followed. + + * During the combiner pass, shared structure within an insn can exist + temporarily. However, the shared structure is copied before the + combiner is finished with the insn. This is done by calling + `copy_rtx_if_shared', which is a subroutine of `unshare_all_rtl'. + +  + File: gccint.info, Node: Reading RTL, Prev: Sharing, Up: RTL + + Reading RTL + =========== + + To read an RTL object from a file, call `read_rtx'. It takes one + argument, a stdio stream, and returns a single RTL object. This routine + is defined in `read-rtl.c'. It is not available in the compiler + itself, only the various programs that generate the compiler back end + from the machine description. + + People frequently have the idea of using RTL stored as text in a + file as an interface between a language front end and the bulk of GCC. + This idea is not feasible. + + GCC was designed to use RTL internally only. Correct RTL for a given + program is very dependent on the particular target machine. And the RTL + does not contain all the information about the program. + + The proper way to interface GCC to a new language front end is with + the "tree" data structure, described in the files `tree.h' and + `tree.def'. The documentation for this structure (*note Trees::) is + incomplete. + +  + File: gccint.info, Node: Machine Desc, Next: Target Macros, Prev: RTL, Up: Top + + Machine Descriptions + ******************** + + A machine description has two parts: a file of instruction patterns + (`.md' file) and a C header file of macro definitions. + + The `.md' file for a target machine contains a pattern for each + instruction that the target machine supports (or at least each + instruction that is worth telling the compiler about). It may also + contain comments. A semicolon causes the rest of the line to be a + comment, unless the semicolon is inside a quoted string. + + See the next chapter for information on the C header file. + + * Menu: + + * Overview:: How the machine description is used. + * Patterns:: How to write instruction patterns. + * Example:: An explained example of a `define_insn' pattern. + * RTL Template:: The RTL template defines what insns match a pattern. + * Output Template:: The output template says how to make assembler code + from such an insn. + * Output Statement:: For more generality, write C code to output + the assembler code. + * Constraints:: When not all operands are general operands. + * Standard Names:: Names mark patterns to use for code generation. + * Pattern Ordering:: When the order of patterns makes a difference. + * Dependent Patterns:: Having one pattern may make you need another. + * Jump Patterns:: Special considerations for patterns for jump insns. + * Looping Patterns:: How to define patterns for special looping insns. + * Insn Canonicalizations::Canonicalization of Instructions + * Expander Definitions::Generating a sequence of several RTL insns + for a standard operation. + * Insn Splitting:: Splitting Instructions into Multiple Instructions. + * Including Patterns:: Including Patterns in Machine Descriptions. + * Peephole Definitions::Defining machine-specific peephole optimizations. + * Insn Attributes:: Specifying the value of attributes for generated insns. + * Conditional Execution::Generating `define_insn' patterns for + predication. + * Constant Definitions::Defining symbolic constants that can be used in the + md file. + +  + File: gccint.info, Node: Overview, Next: Patterns, Up: Machine Desc + + Overview of How the Machine Description is Used + =============================================== + + There are three main conversions that happen in the compiler: + + 1. The front end reads the source code and builds a parse tree. + + 2. The parse tree is used to generate an RTL insn list based on named + instruction patterns. + + 3. The insn list is matched against the RTL templates to produce + assembler code. + + + For the generate pass, only the names of the insns matter, from + either a named `define_insn' or a `define_expand'. The compiler will + choose the pattern with the right name and apply the operands according + to the documentation later in this chapter, without regard for the RTL + template or operand constraints. Note that the names the compiler looks + for are hard-coded in the compiler--it will ignore unnamed patterns and + patterns with names it doesn't know about, but if you don't provide a + named pattern it needs, it will abort. + + If a `define_insn' is used, the template given is inserted into the + insn list. If a `define_expand' is used, one of three things happens, + based on the condition logic. The condition logic may manually create + new insns for the insn list, say via `emit_insn()', and invoke `DONE'. + For certain named patterns, it may invoke `FAIL' to tell the compiler + to use an alternate way of performing that task. If it invokes neither + `DONE' nor `FAIL', the template given in the pattern is inserted, as if + the `define_expand' were a `define_insn'. + + Once the insn list is generated, various optimization passes convert, + replace, and rearrange the insns in the insn list. This is where the + `define_split' and `define_peephole' patterns get used, for example. + + Finally, the insn list's RTL is matched up with the RTL templates in + the `define_insn' patterns, and those patterns are used to emit the + final assembly code. For this purpose, each named `define_insn' acts + like it's unnamed, since the names are ignored. + +  + File: gccint.info, Node: Patterns, Next: Example, Prev: Overview, Up: Machine Desc + + Everything about Instruction Patterns + ===================================== + + Each instruction pattern contains an incomplete RTL expression, with + pieces to be filled in later, operand constraints that restrict how the + pieces can be filled in, and an output pattern or C code to generate + the assembler output, all wrapped up in a `define_insn' expression. + + A `define_insn' is an RTL expression containing four or five + operands: + + 1. An optional name. The presence of a name indicate that this + instruction pattern can perform a certain standard job for the + RTL-generation pass of the compiler. This pass knows certain + names and will use the instruction patterns with those names, if + the names are defined in the machine description. + + The absence of a name is indicated by writing an empty string + where the name should go. Nameless instruction patterns are never + used for generating RTL code, but they may permit several simpler + insns to be combined later on. + + Names that are not thus known and used in RTL-generation have no + effect; they are equivalent to no name at all. + + For the purpose of debugging the compiler, you may also specify a + name beginning with the `*' character. Such a name is used only + for identifying the instruction in RTL dumps; it is entirely + equivalent to having a nameless pattern for all other purposes. + + 2. The "RTL template" (*note RTL Template::) is a vector of incomplete + RTL expressions which show what the instruction should look like. + It is incomplete because it may contain `match_operand', + `match_operator', and `match_dup' expressions that stand for + operands of the instruction. + + If the vector has only one element, that element is the template + for the instruction pattern. If the vector has multiple elements, + then the instruction pattern is a `parallel' expression containing + the elements described. + + 3. A condition. This is a string which contains a C expression that + is the final test to decide whether an insn body matches this + pattern. + + For a named pattern, the condition (if present) may not depend on + the data in the insn being matched, but only the + target-machine-type flags. The compiler needs to test these + conditions during initialization in order to learn exactly which + named instructions are available in a particular run. + + For nameless patterns, the condition is applied only when matching + an individual insn, and only after the insn has matched the + pattern's recognition template. The insn's operands may be found + in the vector `operands'. For an insn where the condition has + once matched, it can't be used to control register allocation, for + example by excluding certain hard registers or hard register + combinations. + + 4. The "output template": a string that says how to output matching + insns as assembler code. `%' in this string specifies where to + substitute the value of an operand. *Note Output Template::. + + When simple substitution isn't general enough, you can specify a + piece of C code to compute the output. *Note Output Statement::. + + 5. Optionally, a vector containing the values of attributes for insns + matching this pattern. *Note Insn Attributes::. + +  + File: gccint.info, Node: Example, Next: RTL Template, Prev: Patterns, Up: Machine Desc + + Example of `define_insn' + ======================== + + Here is an actual example of an instruction pattern, for the + 68000/68020. + + (define_insn "tstsi" + [(set (cc0) + (match_operand:SI 0 "general_operand" "rm"))] + "" + "* + { + if (TARGET_68020 || ! ADDRESS_REG_P (operands[0])) + return \"tstl %0\"; + return \"cmpl #0,%0\"; + }") + + This can also be written using braced strings: + + (define_insn "tstsi" + [(set (cc0) + (match_operand:SI 0 "general_operand" "rm"))] + "" + { + if (TARGET_68020 || ! ADDRESS_REG_P (operands[0])) + return "tstl %0"; + return "cmpl #0,%0"; + }) + + This is an instruction that sets the condition codes based on the + value of a general operand. It has no condition, so any insn whose RTL + description has the form shown may be handled according to this + pattern. The name `tstsi' means "test a `SImode' value" and tells the + RTL generation pass that, when it is necessary to test such a value, an + insn to do so can be constructed using this pattern. + + The output control string is a piece of C code which chooses which + output template to return based on the kind of operand and the specific + type of CPU for which code is being generated. + + `"rm"' is an operand constraint. Its meaning is explained below. + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-8 gcc-3.2.3/gcc/doc/gccint.info-8 *** gcc-3.2.2/gcc/doc/gccint.info-8 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-8 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,935 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: RTL Template, Next: Output Template, Prev: Example, Up: Machine Desc + + RTL Template + ============ + + The RTL template is used to define which insns match the particular + pattern and how to find their operands. For named patterns, the RTL + template also says how to construct an insn from specified operands. + + Construction involves substituting specified operands into a copy of + the template. Matching involves determining the values that serve as + the operands in the insn being matched. Both of these activities are + controlled by special expression types that direct matching and + substitution of the operands. + + `(match_operand:M N PREDICATE CONSTRAINT)' + This expression is a placeholder for operand number N of the insn. + When constructing an insn, operand number N will be substituted + at this point. When matching an insn, whatever appears at this + position in the insn will be taken as operand number N; but it + must satisfy PREDICATE or this instruction pattern will not match + at all. + + Operand numbers must be chosen consecutively counting from zero in + each instruction pattern. There may be only one `match_operand' + expression in the pattern for each operand number. Usually + operands are numbered in the order of appearance in `match_operand' + expressions. In the case of a `define_expand', any operand numbers + used only in `match_dup' expressions have higher values than all + other operand numbers. + + PREDICATE is a string that is the name of a C function that + accepts two arguments, an expression and a machine mode. During + matching, the function will be called with the putative operand as + the expression and M as the mode argument (if M is not specified, + `VOIDmode' will be used, which normally causes PREDICATE to accept + any mode). If it returns zero, this instruction pattern fails to + match. PREDICATE may be an empty string; then it means no test is + to be done on the operand, so anything which occurs in this + position is valid. + + Most of the time, PREDICATE will reject modes other than M--but + not always. For example, the predicate `address_operand' uses M + as the mode of memory ref that the address should be valid for. + Many predicates accept `const_int' nodes even though their mode is + `VOIDmode'. + + CONSTRAINT controls reloading and the choice of the best register + class to use for a value, as explained later (*note Constraints::). + + People are often unclear on the difference between the constraint + and the predicate. The predicate helps decide whether a given + insn matches the pattern. The constraint plays no role in this + decision; instead, it controls various decisions in the case of an + insn which does match. + + On CISC machines, the most common PREDICATE is + `"general_operand"'. This function checks that the putative + operand is either a constant, a register or a memory reference, + and that it is valid for mode M. + + For an operand that must be a register, PREDICATE should be + `"register_operand"'. Using `"general_operand"' would be valid, + since the reload pass would copy any non-register operands through + registers, but this would make GCC do extra work, it would prevent + invariant operands (such as constant) from being removed from + loops, and it would prevent the register allocator from doing the + best possible job. On RISC machines, it is usually most efficient + to allow PREDICATE to accept only objects that the constraints + allow. + + For an operand that must be a constant, you must be sure to either + use `"immediate_operand"' for PREDICATE, or make the instruction + pattern's extra condition require a constant, or both. You cannot + expect the constraints to do this work! If the constraints allow + only constants, but the predicate allows something else, the + compiler will crash when that case arises. + + `(match_scratch:M N CONSTRAINT)' + This expression is also a placeholder for operand number N and + indicates that operand must be a `scratch' or `reg' expression. + + When matching patterns, this is equivalent to + + (match_operand:M N "scratch_operand" PRED) + + but, when generating RTL, it produces a (`scratch':M) expression. + + If the last few expressions in a `parallel' are `clobber' + expressions whose operands are either a hard register or + `match_scratch', the combiner can add or delete them when + necessary. *Note Side Effects::. + + `(match_dup N)' + This expression is also a placeholder for operand number N. It is + used when the operand needs to appear more than once in the insn. + + In construction, `match_dup' acts just like `match_operand': the + operand is substituted into the insn being constructed. But in + matching, `match_dup' behaves differently. It assumes that operand + number N has already been determined by a `match_operand' + appearing earlier in the recognition template, and it matches only + an identical-looking expression. + + Note that `match_dup' should not be used to tell the compiler that + a particular register is being used for two operands (example: + `add' that adds one register to another; the second register is + both an input operand and the output operand). Use a matching + constraint (*note Simple Constraints::) for those. `match_dup' is + for the cases where one operand is used in two places in the + template, such as an instruction that computes both a quotient and + a remainder, where the opcode takes two input operands but the RTL + template has to refer to each of those twice; once for the + quotient pattern and once for the remainder pattern. + + `(match_operator:M N PREDICATE [OPERANDS...])' + This pattern is a kind of placeholder for a variable RTL expression + code. + + When constructing an insn, it stands for an RTL expression whose + expression code is taken from that of operand N, and whose + operands are constructed from the patterns OPERANDS. + + When matching an expression, it matches an expression if the + function PREDICATE returns nonzero on that expression _and_ the + patterns OPERANDS match the operands of the expression. + + Suppose that the function `commutative_operator' is defined as + follows, to match any expression whose operator is one of the + commutative arithmetic operators of RTL and whose mode is MODE: + + int + commutative_operator (x, mode) + rtx x; + enum machine_mode mode; + { + enum rtx_code code = GET_CODE (x); + if (GET_MODE (x) != mode) + return 0; + return (GET_RTX_CLASS (code) == 'c' + || code == EQ || code == NE); + } + + Then the following pattern will match any RTL expression consisting + of a commutative operator applied to two general operands: + + (match_operator:SI 3 "commutative_operator" + [(match_operand:SI 1 "general_operand" "g") + (match_operand:SI 2 "general_operand" "g")]) + + Here the vector `[OPERANDS...]' contains two patterns because the + expressions to be matched all contain two operands. + + When this pattern does match, the two operands of the commutative + operator are recorded as operands 1 and 2 of the insn. (This is + done by the two instances of `match_operand'.) Operand 3 of the + insn will be the entire commutative expression: use `GET_CODE + (operands[3])' to see which commutative operator was used. + + The machine mode M of `match_operator' works like that of + `match_operand': it is passed as the second argument to the + predicate function, and that function is solely responsible for + deciding whether the expression to be matched "has" that mode. + + When constructing an insn, argument 3 of the gen-function will + specify the operation (i.e. the expression code) for the + expression to be made. It should be an RTL expression, whose + expression code is copied into a new expression whose operands are + arguments 1 and 2 of the gen-function. The subexpressions of + argument 3 are not used; only its expression code matters. + + When `match_operator' is used in a pattern for matching an insn, + it usually best if the operand number of the `match_operator' is + higher than that of the actual operands of the insn. This improves + register allocation because the register allocator often looks at + operands 1 and 2 of insns to see if it can do register tying. + + There is no way to specify constraints in `match_operator'. The + operand of the insn which corresponds to the `match_operator' + never has any constraints because it is never reloaded as a whole. + However, if parts of its OPERANDS are matched by `match_operand' + patterns, those parts may have constraints of their own. + + `(match_op_dup:M N[OPERANDS...])' + Like `match_dup', except that it applies to operators instead of + operands. When constructing an insn, operand number N will be + substituted at this point. But in matching, `match_op_dup' behaves + differently. It assumes that operand number N has already been + determined by a `match_operator' appearing earlier in the + recognition template, and it matches only an identical-looking + expression. + + `(match_parallel N PREDICATE [SUBPAT...])' + This pattern is a placeholder for an insn that consists of a + `parallel' expression with a variable number of elements. This + expression should only appear at the top level of an insn pattern. + + When constructing an insn, operand number N will be substituted at + this point. When matching an insn, it matches if the body of the + insn is a `parallel' expression with at least as many elements as + the vector of SUBPAT expressions in the `match_parallel', if each + SUBPAT matches the corresponding element of the `parallel', _and_ + the function PREDICATE returns nonzero on the `parallel' that is + the body of the insn. It is the responsibility of the predicate + to validate elements of the `parallel' beyond those listed in the + `match_parallel'. + + A typical use of `match_parallel' is to match load and store + multiple expressions, which can contain a variable number of + elements in a `parallel'. For example, + + (define_insn "" + [(match_parallel 0 "load_multiple_operation" + [(set (match_operand:SI 1 "gpc_reg_operand" "=r") + (match_operand:SI 2 "memory_operand" "m")) + (use (reg:SI 179)) + (clobber (reg:SI 179))])] + "" + "loadm 0,0,%1,%2") + + This example comes from `a29k.md'. The function + `load_multiple_operation' is defined in `a29k.c' and checks that + subsequent elements in the `parallel' are the same as the `set' in + the pattern, except that they are referencing subsequent registers + and memory locations. + + An insn that matches this pattern might look like: + + (parallel + [(set (reg:SI 20) (mem:SI (reg:SI 100))) + (use (reg:SI 179)) + (clobber (reg:SI 179)) + (set (reg:SI 21) + (mem:SI (plus:SI (reg:SI 100) + (const_int 4)))) + (set (reg:SI 22) + (mem:SI (plus:SI (reg:SI 100) + (const_int 8))))]) + + `(match_par_dup N [SUBPAT...])' + Like `match_op_dup', but for `match_parallel' instead of + `match_operator'. + + `(match_insn PREDICATE)' + Match a complete insn. Unlike the other `match_*' recognizers, + `match_insn' does not take an operand number. + + The machine mode M of `match_insn' works like that of + `match_operand': it is passed as the second argument to the + predicate function, and that function is solely responsible for + deciding whether the expression to be matched "has" that mode. + + `(match_insn2 N PREDICATE)' + Match a complete insn. + + The machine mode M of `match_insn2' works like that of + `match_operand': it is passed as the second argument to the + predicate function, and that function is solely responsible for + deciding whether the expression to be matched "has" that mode. + + +  + File: gccint.info, Node: Output Template, Next: Output Statement, Prev: RTL Template, Up: Machine Desc + + Output Templates and Operand Substitution + ========================================= + + The "output template" is a string which specifies how to output the + assembler code for an instruction pattern. Most of the template is a + fixed string which is output literally. The character `%' is used to + specify where to substitute an operand; it can also be used to identify + places where different variants of the assembler require different + syntax. + + In the simplest case, a `%' followed by a digit N says to output + operand N at that point in the string. + + `%' followed by a letter and a digit says to output an operand in an + alternate fashion. Four letters have standard, built-in meanings + described below. The machine description macro `PRINT_OPERAND' can + define additional letters with nonstandard meanings. + + `%cDIGIT' can be used to substitute an operand that is a constant + value without the syntax that normally indicates an immediate operand. + + `%nDIGIT' is like `%cDIGIT' except that the value of the constant is + negated before printing. + + `%aDIGIT' can be used to substitute an operand as if it were a + memory reference, with the actual operand treated as the address. This + may be useful when outputting a "load address" instruction, because + often the assembler syntax for such an instruction requires you to + write the operand as if it were a memory reference. + + `%lDIGIT' is used to substitute a `label_ref' into a jump + instruction. + + `%=' outputs a number which is unique to each instruction in the + entire compilation. This is useful for making local labels to be + referred to more than once in a single template that generates multiple + assembler instructions. + + `%' followed by a punctuation character specifies a substitution that + does not use an operand. Only one case is standard: `%%' outputs a `%' + into the assembler code. Other nonstandard cases can be defined in the + `PRINT_OPERAND' macro. You must also define which punctuation + characters are valid with the `PRINT_OPERAND_PUNCT_VALID_P' macro. + + The template may generate multiple assembler instructions. Write + the text for the instructions, with `\;' between them. + + When the RTL contains two operands which are required by constraint + to match each other, the output template must refer only to the + lower-numbered operand. Matching operands are not always identical, + and the rest of the compiler arranges to put the proper RTL expression + for printing into the lower-numbered operand. + + One use of nonstandard letters or punctuation following `%' is to + distinguish between different assembler languages for the same machine; + for example, Motorola syntax versus MIT syntax for the 68000. Motorola + syntax requires periods in most opcode names, while MIT syntax does + not. For example, the opcode `movel' in MIT syntax is `move.l' in + Motorola syntax. The same file of patterns is used for both kinds of + output syntax, but the character sequence `%.' is used in each place + where Motorola syntax wants a period. The `PRINT_OPERAND' macro for + Motorola syntax defines the sequence to output a period; the macro for + MIT syntax defines it to do nothing. + + As a special case, a template consisting of the single character `#' + instructs the compiler to first split the insn, and then output the + resulting instructions separately. This helps eliminate redundancy in + the output templates. If you have a `define_insn' that needs to emit + multiple assembler instructions, and there is an matching `define_split' + already defined, then you can simply use `#' as the output template + instead of writing an output template that emits the multiple assembler + instructions. + + If the macro `ASSEMBLER_DIALECT' is defined, you can use construct + of the form `{option0|option1|option2}' in the templates. These + describe multiple variants of assembler language syntax. *Note + Instruction Output::. + +  + File: gccint.info, Node: Output Statement, Next: Constraints, Prev: Output Template, Up: Machine Desc + + C Statements for Assembler Output + ================================= + + Often a single fixed template string cannot produce correct and + efficient assembler code for all the cases that are recognized by a + single instruction pattern. For example, the opcodes may depend on the + kinds of operands; or some unfortunate combinations of operands may + require extra machine instructions. + + If the output control string starts with a `@', then it is actually + a series of templates, each on a separate line. (Blank lines and + leading spaces and tabs are ignored.) The templates correspond to the + pattern's constraint alternatives (*note Multi-Alternative::). For + example, if a target machine has a two-address add instruction `addr' + to add into a register and another `addm' to add a register to memory, + you might write this pattern: + + (define_insn "addsi3" + [(set (match_operand:SI 0 "general_operand" "=r,m") + (plus:SI (match_operand:SI 1 "general_operand" "0,0") + (match_operand:SI 2 "general_operand" "g,r")))] + "" + "@ + addr %2,%0 + addm %2,%0") + + If the output control string starts with a `*', then it is not an + output template but rather a piece of C program that should compute a + template. It should execute a `return' statement to return the + template-string you want. Most such templates use C string literals, + which require doublequote characters to delimit them. To include these + doublequote characters in the string, prefix each one with `\'. + + If the output control string is written as a brace block instead of a + double-quoted string, it is automatically assumed to be C code. In that + case, it is not necessary to put in a leading asterisk, or to escape the + doublequotes surrounding C string literals. + + The operands may be found in the array `operands', whose C data type + is `rtx []'. + + It is very common to select different ways of generating assembler + code based on whether an immediate operand is within a certain range. + Be careful when doing this, because the result of `INTVAL' is an + integer on the host machine. If the host machine has more bits in an + `int' than the target machine has in the mode in which the constant + will be used, then some of the bits you get from `INTVAL' will be + superfluous. For proper results, you must carefully disregard the + values of those bits. + + It is possible to output an assembler instruction and then go on to + output or compute more of them, using the subroutine `output_asm_insn'. + This receives two arguments: a template-string and a vector of + operands. The vector may be `operands', or it may be another array of + `rtx' that you declare locally and initialize yourself. + + When an insn pattern has multiple alternatives in its constraints, + often the appearance of the assembler code is determined mostly by + which alternative was matched. When this is so, the C code can test + the variable `which_alternative', which is the ordinal number of the + alternative that was actually satisfied (0 for the first, 1 for the + second alternative, etc.). + + For example, suppose there are two opcodes for storing zero, `clrreg' + for registers and `clrmem' for memory locations. Here is how a pattern + could use `which_alternative' to choose between them: + + (define_insn "" + [(set (match_operand:SI 0 "general_operand" "=r,m") + (const_int 0))] + "" + { + return (which_alternative == 0 + ? "clrreg %0" : "clrmem %0"); + }) + + The example above, where the assembler code to generate was _solely_ + determined by the alternative, could also have been specified as + follows, having the output control string start with a `@': + + (define_insn "" + [(set (match_operand:SI 0 "general_operand" "=r,m") + (const_int 0))] + "" + "@ + clrreg %0 + clrmem %0") + +  + File: gccint.info, Node: Constraints, Next: Standard Names, Prev: Output Statement, Up: Machine Desc + + Operand Constraints + =================== + + Each `match_operand' in an instruction pattern can specify a + constraint for the type of operands allowed. Constraints can say + whether an operand may be in a register, and which kinds of register; + whether the operand can be a memory reference, and which kinds of + address; whether the operand may be an immediate constant, and which + possible values it may have. Constraints can also require two operands + to match. + + * Menu: + + * Simple Constraints:: Basic use of constraints. + * Multi-Alternative:: When an insn has two alternative constraint-patterns. + * Class Preferences:: Constraints guide which hard register to put things in. + * Modifiers:: More precise control over effects of constraints. + * Machine Constraints:: Existing constraints for some particular machines. + +  + File: gccint.info, Node: Simple Constraints, Next: Multi-Alternative, Up: Constraints + + Simple Constraints + ------------------ + + The simplest kind of constraint is a string full of letters, each of + which describes one kind of operand that is permitted. Here are the + letters that are allowed: + + whitespace + Whitespace characters are ignored and can be inserted at any + position except the first. This enables each alternative for + different operands to be visually aligned in the machine + description even if they have different number of constraints and + modifiers. + + `m' + A memory operand is allowed, with any kind of address that the + machine supports in general. + + `o' + A memory operand is allowed, but only if the address is + "offsettable". This means that adding a small integer (actually, + the width in bytes of the operand, as determined by its machine + mode) may be added to the address and the result is also a valid + memory address. + + For example, an address which is constant is offsettable; so is an + address that is the sum of a register and a constant (as long as a + slightly larger constant is also within the range of + address-offsets supported by the machine); but an autoincrement or + autodecrement address is not offsettable. More complicated + indirect/indexed addresses may or may not be offsettable depending + on the other addressing modes that the machine supports. + + Note that in an output operand which can be matched by another + operand, the constraint letter `o' is valid only when accompanied + by both `<' (if the target machine has predecrement addressing) + and `>' (if the target machine has preincrement addressing). + + `V' + A memory operand that is not offsettable. In other words, + anything that would fit the `m' constraint but not the `o' + constraint. + + `<' + A memory operand with autodecrement addressing (either + predecrement or postdecrement) is allowed. + + `>' + A memory operand with autoincrement addressing (either + preincrement or postincrement) is allowed. + + `r' + A register operand is allowed provided that it is in a general + register. + + `i' + An immediate integer operand (one with constant value) is allowed. + This includes symbolic constants whose values will be known only at + assembly time. + + `n' + An immediate integer operand with a known numeric value is allowed. + Many systems cannot support assembly-time constants for operands + less than a word wide. Constraints for these operands should use + `n' rather than `i'. + + `I', `J', `K', ... `P' + Other letters in the range `I' through `P' may be defined in a + machine-dependent fashion to permit immediate integer operands with + explicit integer values in specified ranges. For example, on the + 68000, `I' is defined to stand for the range of values 1 to 8. + This is the range permitted as a shift count in the shift + instructions. + + `E' + An immediate floating operand (expression code `const_double') is + allowed, but only if the target floating point format is the same + as that of the host machine (on which the compiler is running). + + `F' + An immediate floating operand (expression code `const_double') is + allowed. + + `G', `H' + `G' and `H' may be defined in a machine-dependent fashion to + permit immediate floating operands in particular ranges of values. + + `s' + An immediate integer operand whose value is not an explicit + integer is allowed. + + This might appear strange; if an insn allows a constant operand + with a value not known at compile time, it certainly must allow + any known value. So why use `s' instead of `i'? Sometimes it + allows better code to be generated. + + For example, on the 68000 in a fullword instruction it is possible + to use an immediate operand; but if the immediate value is between + -128 and 127, better code results from loading the value into a + register and using the register. This is because the load into + the register can be done with a `moveq' instruction. We arrange + for this to happen by defining the letter `K' to mean "any integer + outside the range -128 to 127", and then specifying `Ks' in the + operand constraints. + + `g' + Any register, memory or immediate integer operand is allowed, + except for registers that are not general registers. + + `X' + Any operand whatsoever is allowed, even if it does not satisfy + `general_operand'. This is normally used in the constraint of a + `match_scratch' when certain alternatives will not actually + require a scratch register. + + `0', `1', `2', ... `9' + An operand that matches the specified operand number is allowed. + If a digit is used together with letters within the same + alternative, the digit should come last. + + This number is allowed to be more than a single digit. If multiple + digits are encountered consecutavely, they are interpreted as a + single decimal integer. There is scant chance for ambiguity, + since to-date it has never been desirable that `10' be interpreted + as matching either operand 1 _or_ operand 0. Should this be + desired, one can use multiple alternatives instead. + + This is called a "matching constraint" and what it really means is + that the assembler has only a single operand that fills two roles + considered separate in the RTL insn. For example, an add insn has + two input operands and one output operand in the RTL, but on most + CISC machines an add instruction really has only two operands, one + of them an input-output operand: + + addl #35,r12 + + Matching constraints are used in these circumstances. More + precisely, the two operands that match must include one input-only + operand and one output-only operand. Moreover, the digit must be a + smaller number than the number of the operand that uses it in the + constraint. + + For operands to match in a particular case usually means that they + are identical-looking RTL expressions. But in a few special cases + specific kinds of dissimilarity are allowed. For example, `*x' as + an input operand will match `*x++' as an output operand. For + proper results in such cases, the output template should always + use the output-operand's number when printing the operand. + + `p' + An operand that is a valid memory address is allowed. This is for + "load address" and "push address" instructions. + + `p' in the constraint must be accompanied by `address_operand' as + the predicate in the `match_operand'. This predicate interprets + the mode specified in the `match_operand' as the mode of the memory + reference for which the address would be valid. + + OTHER-LETTERS + Other letters can be defined in machine-dependent fashion to stand + for particular classes of registers or other arbitrary operand + types. `d', `a' and `f' are defined on the 68000/68020 to stand + for data, address and floating point registers. + + The machine description macro `REG_CLASS_FROM_LETTER' has first + cut at the otherwise unused letters. If it evaluates to `NO_REGS', + then `EXTRA_CONSTRAINT' is evaluated. + + A typical use for `EXTRA_CONSTRANT' would be to distinguish certain + types of memory references that affect other insn operands. + + In order to have valid assembler code, each operand must satisfy its + constraint. But a failure to do so does not prevent the pattern from + applying to an insn. Instead, it directs the compiler to modify the + code so that the constraint will be satisfied. Usually this is done by + copying an operand into a register. + + Contrast, therefore, the two instruction patterns that follow: + + (define_insn "" + [(set (match_operand:SI 0 "general_operand" "=r") + (plus:SI (match_dup 0) + (match_operand:SI 1 "general_operand" "r")))] + "" + "...") + + which has two operands, one of which must appear in two places, and + + (define_insn "" + [(set (match_operand:SI 0 "general_operand" "=r") + (plus:SI (match_operand:SI 1 "general_operand" "0") + (match_operand:SI 2 "general_operand" "r")))] + "" + "...") + + which has three operands, two of which are required by a constraint to + be identical. If we are considering an insn of the form + + (insn N PREV NEXT + (set (reg:SI 3) + (plus:SI (reg:SI 6) (reg:SI 109))) + ...) + + the first pattern would not apply at all, because this insn does not + contain two identical subexpressions in the right place. The pattern + would say, "That does not look like an add instruction; try other + patterns." The second pattern would say, "Yes, that's an add + instruction, but there is something wrong with it." It would direct + the reload pass of the compiler to generate additional insns to make + the constraint true. The results might look like this: + + (insn N2 PREV N + (set (reg:SI 3) (reg:SI 6)) + ...) + + (insn N N2 NEXT + (set (reg:SI 3) + (plus:SI (reg:SI 3) (reg:SI 109))) + ...) + + It is up to you to make sure that each operand, in each pattern, has + constraints that can handle any RTL expression that could be present for + that operand. (When multiple alternatives are in use, each pattern + must, for each possible combination of operand expressions, have at + least one alternative which can handle that combination of operands.) + The constraints don't need to _allow_ any possible operand--when this is + the case, they do not constrain--but they must at least point the way to + reloading any possible operand so that it will fit. + + * If the constraint accepts whatever operands the predicate permits, + there is no problem: reloading is never necessary for this operand. + + For example, an operand whose constraints permit everything except + registers is safe provided its predicate rejects registers. + + An operand whose predicate accepts only constant values is safe + provided its constraints include the letter `i'. If any possible + constant value is accepted, then nothing less than `i' will do; if + the predicate is more selective, then the constraints may also be + more selective. + + * Any operand expression can be reloaded by copying it into a + register. So if an operand's constraints allow some kind of + register, it is certain to be safe. It need not permit all + classes of registers; the compiler knows how to copy a register + into another register of the proper class in order to make an + instruction valid. + + * A nonoffsettable memory reference can be reloaded by copying the + address into a register. So if the constraint uses the letter + `o', all memory references are taken care of. + + * A constant operand can be reloaded by allocating space in memory to + hold it as preinitialized data. Then the memory reference can be + used in place of the constant. So if the constraint uses the + letters `o' or `m', constant operands are not a problem. + + * If the constraint permits a constant and a pseudo register used in + an insn was not allocated to a hard register and is equivalent to + a constant, the register will be replaced with the constant. If + the predicate does not permit a constant and the insn is + re-recognized for some reason, the compiler will crash. Thus the + predicate must always recognize any objects allowed by the + constraint. + + If the operand's predicate can recognize registers, but the + constraint does not permit them, it can make the compiler crash. When + this operand happens to be a register, the reload pass will be stymied, + because it does not know how to copy a register temporarily into memory. + + If the predicate accepts a unary operator, the constraint applies to + the operand. For example, the MIPS processor at ISA level 3 supports an + instruction which adds two registers in `SImode' to produce a `DImode' + result, but only if the registers are correctly sign extended. This + predicate for the input operands accepts a `sign_extend' of an `SImode' + register. Write the constraint to indicate the type of register that + is required for the operand of the `sign_extend'. + +  + File: gccint.info, Node: Multi-Alternative, Next: Class Preferences, Prev: Simple Constraints, Up: Constraints + + Multiple Alternative Constraints + -------------------------------- + + Sometimes a single instruction has multiple alternative sets of + possible operands. For example, on the 68000, a logical-or instruction + can combine register or an immediate value into memory, or it can + combine any kind of operand into a register; but it cannot combine one + memory location into another. + + These constraints are represented as multiple alternatives. An + alternative can be described by a series of letters for each operand. + The overall constraint for an operand is made from the letters for this + operand from the first alternative, a comma, the letters for this + operand from the second alternative, a comma, and so on until the last + alternative. Here is how it is done for fullword logical-or on the + 68000: + + (define_insn "iorsi3" + [(set (match_operand:SI 0 "general_operand" "=m,d") + (ior:SI (match_operand:SI 1 "general_operand" "%0,0") + (match_operand:SI 2 "general_operand" "dKs,dmKs")))] + ...) + + The first alternative has `m' (memory) for operand 0, `0' for + operand 1 (meaning it must match operand 0), and `dKs' for operand 2. + The second alternative has `d' (data register) for operand 0, `0' for + operand 1, and `dmKs' for operand 2. The `=' and `%' in the + constraints apply to all the alternatives; their meaning is explained + in the next section (*note Class Preferences::). + + If all the operands fit any one alternative, the instruction is + valid. Otherwise, for each alternative, the compiler counts how many + instructions must be added to copy the operands so that that + alternative applies. The alternative requiring the least copying is + chosen. If two alternatives need the same amount of copying, the one + that comes first is chosen. These choices can be altered with the `?' + and `!' characters: + + `?' + Disparage slightly the alternative that the `?' appears in, as a + choice when no alternative applies exactly. The compiler regards + this alternative as one unit more costly for each `?' that appears + in it. + + `!' + Disparage severely the alternative that the `!' appears in. This + alternative can still be used if it fits without reloading, but if + reloading is needed, some other alternative will be used. + + When an insn pattern has multiple alternatives in its constraints, + often the appearance of the assembler code is determined mostly by which + alternative was matched. When this is so, the C code for writing the + assembler code can use the variable `which_alternative', which is the + ordinal number of the alternative that was actually satisfied (0 for + the first, 1 for the second alternative, etc.). *Note Output + Statement::. + +  + File: gccint.info, Node: Class Preferences, Next: Modifiers, Prev: Multi-Alternative, Up: Constraints + + Register Class Preferences + -------------------------- + + The operand constraints have another function: they enable the + compiler to decide which kind of hardware register a pseudo register is + best allocated to. The compiler examines the constraints that apply to + the insns that use the pseudo register, looking for the + machine-dependent letters such as `d' and `a' that specify classes of + registers. The pseudo register is put in whichever class gets the most + "votes". The constraint letters `g' and `r' also vote: they vote in + favor of a general register. The machine description says which + registers are considered general. + + Of course, on some machines all registers are equivalent, and no + register classes are defined. Then none of this complexity is relevant. + +  + File: gccint.info, Node: Modifiers, Next: Machine Constraints, Prev: Class Preferences, Up: Constraints + + Constraint Modifier Characters + ------------------------------ + + Here are constraint modifier characters. + + `=' + Means that this operand is write-only for this instruction: the + previous value is discarded and replaced by output data. + + `+' + Means that this operand is both read and written by the + instruction. + + When the compiler fixes up the operands to satisfy the constraints, + it needs to know which operands are inputs to the instruction and + which are outputs from it. `=' identifies an output; `+' + identifies an operand that is both input and output; all other + operands are assumed to be input only. + + If you specify `=' or `+' in a constraint, you put it in the first + character of the constraint string. + + `&' + Means (in a particular alternative) that this operand is an + "earlyclobber" operand, which is modified before the instruction is + finished using the input operands. Therefore, this operand may + not lie in a register that is used as an input operand or as part + of any memory address. + + `&' applies only to the alternative in which it is written. In + constraints with multiple alternatives, sometimes one alternative + requires `&' while others do not. See, for example, the `movdf' + insn of the 68000. + + An input operand can be tied to an earlyclobber operand if its only + use as an input occurs before the early result is written. Adding + alternatives of this form often allows GCC to produce better code + when only some of the inputs can be affected by the earlyclobber. + See, for example, the `mulsi3' insn of the ARM. + + `&' does not obviate the need to write `='. + + `%' + Declares the instruction to be commutative for this operand and the + following operand. This means that the compiler may interchange + the two operands if that is the cheapest way to make all operands + fit the constraints. This is often used in patterns for addition + instructions that really have only two operands: the result must + go in one of the arguments. Here for example, is how the 68000 + halfword-add instruction is defined: + + (define_insn "addhi3" + [(set (match_operand:HI 0 "general_operand" "=m,r") + (plus:HI (match_operand:HI 1 "general_operand" "%0,0") + (match_operand:HI 2 "general_operand" "di,g")))] + ...) + + `#' + Says that all following characters, up to the next comma, are to be + ignored as a constraint. They are significant only for choosing + register preferences. + + `*' + Says that the following character should be ignored when choosing + register preferences. `*' has no effect on the meaning of the + constraint as a constraint, and no effect on reloading. + + Here is an example: the 68000 has an instruction to sign-extend a + halfword in a data register, and can also sign-extend a value by + copying it into an address register. While either kind of + register is acceptable, the constraints on an address-register + destination are less strict, so it is best if register allocation + makes an address register its goal. Therefore, `*' is used so + that the `d' constraint letter (for data register) is ignored when + computing register preferences. + + (define_insn "extendhisi2" + [(set (match_operand:SI 0 "general_operand" "=*d,a") + (sign_extend:SI + (match_operand:HI 1 "general_operand" "0,g")))] + ...) + diff -Nrc3pad gcc-3.2.2/gcc/doc/gccint.info-9 gcc-3.2.3/gcc/doc/gccint.info-9 *** gcc-3.2.2/gcc/doc/gccint.info-9 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/doc/gccint.info-9 Tue Apr 22 07:07:19 2003 *************** *** 0 **** --- 1,847 ---- + This is doc/gccint.info, produced by makeinfo version 4.5 from + doc/gccint.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * gccint: (gccint). Internals of the GNU Compiler Collection. + END-INFO-DIR-ENTRY + This file documents the internals of the GNU compilers. + + Published by the Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, + 1999, 2000, 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gccint.info, Node: Machine Constraints, Prev: Modifiers, Up: Constraints + + Constraints for Particular Machines + ----------------------------------- + + Whenever possible, you should use the general-purpose constraint + letters in `asm' arguments, since they will convey meaning more readily + to people reading your code. Failing that, use the constraint letters + that usually have very similar meanings across architectures. The most + commonly used constraints are `m' and `r' (for memory and + general-purpose registers respectively; *note Simple Constraints::), and + `I', usually the letter indicating the most common immediate-constant + format. + + For each machine architecture, the `config/MACHINE/MACHINE.h' file + defines additional constraints. These constraints are used by the + compiler itself for instruction generation, as well as for `asm' + statements; therefore, some of the constraints are not particularly + interesting for `asm'. The constraints are defined through these + macros: + + `REG_CLASS_FROM_LETTER' + Register class constraints (usually lower case). + + `CONST_OK_FOR_LETTER_P' + Immediate constant constraints, for non-floating point constants of + word size or smaller precision (usually upper case). + + `CONST_DOUBLE_OK_FOR_LETTER_P' + Immediate constant constraints, for all floating point constants + and for constants of greater than word size precision (usually + upper case). + + `EXTRA_CONSTRAINT' + Special cases of registers or memory. This macro is not required, + and is only defined for some machines. + + Inspecting these macro definitions in the compiler source for your + machine is the best way to be certain you have the right constraints. + However, here is a summary of the machine-dependent constraints + available on some particular machines. + + _ARM family--`arm.h'_ + + `f' + Floating-point register + + `F' + One of the floating-point constants 0.0, 0.5, 1.0, 2.0, 3.0, + 4.0, 5.0 or 10.0 + + `G' + Floating-point constant that would satisfy the constraint `F' + if it were negated + + `I' + Integer that is valid as an immediate operand in a data + processing instruction. That is, an integer in the range 0 + to 255 rotated by a multiple of 2 + + `J' + Integer in the range -4095 to 4095 + + `K' + Integer that satisfies constraint `I' when inverted (ones + complement) + + `L' + Integer that satisfies constraint `I' when negated (twos + complement) + + `M' + Integer in the range 0 to 32 + + `Q' + A memory reference where the exact address is in a single + register (``m'' is preferable for `asm' statements) + + `R' + An item in the constant pool + + `S' + A symbol in the text segment of the current file + + _AMD 29000 family--`a29k.h'_ + + `l' + Local register 0 + + `b' + Byte Pointer (`BP') register + + `q' + `Q' register + + `h' + Special purpose register + + `A' + First accumulator register + + `a' + Other accumulator register + + `f' + Floating point register + + `I' + Constant greater than 0, less than 0x100 + + `J' + Constant greater than 0, less than 0x10000 + + `K' + Constant whose high 24 bits are on (1) + + `L' + 16-bit constant whose high 8 bits are on (1) + + `M' + 32-bit constant whose high 16 bits are on (1) + + `N' + 32-bit negative constant that fits in 8 bits + + `O' + The constant 0x80000000 or, on the 29050, any 32-bit constant + whose low 16 bits are 0. + + `P' + 16-bit negative constant that fits in 8 bits + + `G' + `H' + A floating point constant (in `asm' statements, use the + machine independent `E' or `F' instead) + + _AVR family--`avr.h'_ + + `l' + Registers from r0 to r15 + + `a' + Registers from r16 to r23 + + `d' + Registers from r16 to r31 + + `w' + Registers from r24 to r31. These registers can be used in + `adiw' command + + `e' + Pointer register (r26-r31) + + `b' + Base pointer register (r28-r31) + + `q' + Stack pointer register (SPH:SPL) + + `t' + Temporary register r0 + + `x' + Register pair X (r27:r26) + + `y' + Register pair Y (r29:r28) + + `z' + Register pair Z (r31:r30) + + `I' + Constant greater than -1, less than 64 + + `J' + Constant greater than -64, less than 1 + + `K' + Constant integer 2 + + `L' + Constant integer 0 + + `M' + Constant that fits in 8 bits + + `N' + Constant integer -1 + + `O' + Constant integer 8, 16, or 24 + + `P' + Constant integer 1 + + `G' + A floating point constant 0.0 + + _IBM RS6000--`rs6000.h'_ + + `b' + Address base register + + `f' + Floating point register + + `h' + `MQ', `CTR', or `LINK' register + + `q' + `MQ' register + + `c' + `CTR' register + + `l' + `LINK' register + + `x' + `CR' register (condition register) number 0 + + `y' + `CR' register (condition register) + + `z' + `FPMEM' stack memory for FPR-GPR transfers + + `I' + Signed 16-bit constant + + `J' + Unsigned 16-bit constant shifted left 16 bits (use `L' + instead for `SImode' constants) + + `K' + Unsigned 16-bit constant + + `L' + Signed 16-bit constant shifted left 16 bits + + `M' + Constant larger than 31 + + `N' + Exact power of 2 + + `O' + Zero + + `P' + Constant whose negation is a signed 16-bit constant + + `G' + Floating point constant that can be loaded into a register + with one instruction per word + + `Q' + Memory operand that is an offset from a register (`m' is + preferable for `asm' statements) + + `R' + AIX TOC entry + + `S' + Constant suitable as a 64-bit mask operand + + `T' + Constant suitable as a 32-bit mask operand + + `U' + System V Release 4 small data area reference + + _Intel 386--`i386.h'_ + + `q' + `a', `b', `c', or `d' register for the i386. For x86-64 it + is equivalent to `r' class. (for 8-bit instructions that do + not use upper halves) + + `Q' + `a', `b', `c', or `d' register. (for 8-bit instructions, that + do use upper halves) + + `R' + Legacy register--equivalent to `r' class in i386 mode. (for + non-8-bit registers used together with 8-bit upper halves in + a single instruction) + + `A' + Specifies the `a' or `d' registers. This is primarily useful + for 64-bit integer values (when in 32-bit mode) intended to + be returned with the `d' register holding the most + significant bits and the `a' register holding the least + significant bits. + + `f' + Floating point register + + `t' + First (top of stack) floating point register + + `u' + Second floating point register + + `a' + `a' register + + `b' + `b' register + + `c' + `c' register + + `d' + `d' register + + `D' + `di' register + + `S' + `si' register + + `x' + `xmm' SSE register + + `y' + MMX register + + `I' + Constant in range 0 to 31 (for 32-bit shifts) + + `J' + Constant in range 0 to 63 (for 64-bit shifts) + + `K' + `0xff' + + `L' + `0xffff' + + `M' + 0, 1, 2, or 3 (shifts for `lea' instruction) + + `N' + Constant in range 0 to 255 (for `out' instruction) + + `Z' + Constant in range 0 to `0xffffffff' or symbolic reference + known to fit specified range. (for using immediates in zero + extending 32-bit to 64-bit x86-64 instructions) + + `e' + Constant in range -2147483648 to 2147483647 or symbolic + reference known to fit specified range. (for using + immediates in 64-bit x86-64 instructions) + + `G' + Standard 80387 floating point constant + + _Intel 960--`i960.h'_ + + `f' + Floating point register (`fp0' to `fp3') + + `l' + Local register (`r0' to `r15') + + `b' + Global register (`g0' to `g15') + + `d' + Any local or global register + + `I' + Integers from 0 to 31 + + `J' + 0 + + `K' + Integers from -31 to 0 + + `G' + Floating point 0 + + `H' + Floating point 1 + + _MIPS--`mips.h'_ + + `d' + General-purpose integer register + + `f' + Floating-point register (if available) + + `h' + `Hi' register + + `l' + `Lo' register + + `x' + `Hi' or `Lo' register + + `y' + General-purpose integer register + + `z' + Floating-point status register + + `I' + Signed 16-bit constant (for arithmetic instructions) + + `J' + Zero + + `K' + Zero-extended 16-bit constant (for logic instructions) + + `L' + Constant with low 16 bits zero (can be loaded with `lui') + + `M' + 32-bit constant which requires two instructions to load (a + constant which is not `I', `K', or `L') + + `N' + Negative 16-bit constant + + `O' + Exact power of two + + `P' + Positive 16-bit constant + + `G' + Floating point zero + + `Q' + Memory reference that can be loaded with more than one + instruction (`m' is preferable for `asm' statements) + + `R' + Memory reference that can be loaded with one instruction (`m' + is preferable for `asm' statements) + + `S' + Memory reference in external OSF/rose PIC format (`m' is + preferable for `asm' statements) + + _Motorola 680x0--`m68k.h'_ + + `a' + Address register + + `d' + Data register + + `f' + 68881 floating-point register, if available + + `x' + Sun FPA (floating-point) register, if available + + `y' + First 16 Sun FPA registers, if available + + `I' + Integer in the range 1 to 8 + + `J' + 16-bit signed number + + `K' + Signed number whose magnitude is greater than 0x80 + + `L' + Integer in the range -8 to -1 + + `M' + Signed number whose magnitude is greater than 0x100 + + `G' + Floating point constant that is not a 68881 constant + + `H' + Floating point constant that can be used by Sun FPA + + _Motorola 68HC11 & 68HC12 families--`m68hc11.h'_ + + `a' + Register 'a' + + `b' + Register 'b' + + `d' + Register 'd' + + `q' + An 8-bit register + + `t' + Temporary soft register _.tmp + + `u' + A soft register _.d1 to _.d31 + + `w' + Stack pointer register + + `x' + Register 'x' + + `y' + Register 'y' + + `z' + Pseudo register 'z' (replaced by 'x' or 'y' at the end) + + `A' + An address register: x, y or z + + `B' + An address register: x or y + + `D' + Register pair (x:d) to form a 32-bit value + + `L' + Constants in the range -65536 to 65535 + + `M' + Constants whose 16-bit low part is zero + + `N' + Constant integer 1 or -1 + + `O' + Constant integer 16 + + `P' + Constants in the range -8 to 2 + + + _SPARC--`sparc.h'_ + + `f' + Floating-point register that can hold 32- or 64-bit values. + + `e' + Floating-point register that can hold 64- or 128-bit values. + + `I' + Signed 13-bit constant + + `J' + Zero + + `K' + 32-bit constant with the low 12 bits clear (a constant that + can be loaded with the `sethi' instruction) + + `L' + A constant in the range supported by `movcc' instructions + + `M' + A constant in the range supported by `movrcc' instructions + + `N' + Same as `K', except that it verifies that bits that are not + in the lower 32-bit range are all zero. Must be used instead + of `K' for modes wider than `SImode' + + `G' + Floating-point zero + + `H' + Signed 13-bit constant, sign-extended to 32 or 64 bits + + `Q' + Floating-point constant whose integral representation can be + moved into an integer register using a single sethi + instruction + + `R' + Floating-point constant whose integral representation can be + moved into an integer register using a single mov instruction + + `S' + Floating-point constant whose integral representation can be + moved into an integer register using a high/lo_sum + instruction sequence + + `T' + Memory address aligned to an 8-byte boundary + + `U' + Even register + + `W' + Memory address for `e' constraint registers. + + + _TMS320C3x/C4x--`c4x.h'_ + + `a' + Auxiliary (address) register (ar0-ar7) + + `b' + Stack pointer register (sp) + + `c' + Standard (32-bit) precision integer register + + `f' + Extended (40-bit) precision register (r0-r11) + + `k' + Block count register (bk) + + `q' + Extended (40-bit) precision low register (r0-r7) + + `t' + Extended (40-bit) precision register (r0-r1) + + `u' + Extended (40-bit) precision register (r2-r3) + + `v' + Repeat count register (rc) + + `x' + Index register (ir0-ir1) + + `y' + Status (condition code) register (st) + + `z' + Data page register (dp) + + `G' + Floating-point zero + + `H' + Immediate 16-bit floating-point constant + + `I' + Signed 16-bit constant + + `J' + Signed 8-bit constant + + `K' + Signed 5-bit constant + + `L' + Unsigned 16-bit constant + + `M' + Unsigned 8-bit constant + + `N' + Ones complement of unsigned 16-bit constant + + `O' + High 16-bit constant (32-bit constant with 16 LSBs zero) + + `Q' + Indirect memory reference with signed 8-bit or index register + displacement + + `R' + Indirect memory reference with unsigned 5-bit displacement + + `S' + Indirect memory reference with 1 bit or index register + displacement + + `T' + Direct memory reference + + `U' + Symbolic address + + + _S/390 and zSeries--`s390.h'_ + + `a' + Address register (general purpose register except r0) + + `d' + Data register (arbitrary general purpose register) + + `f' + Floating-point register + + `I' + Unsigned 8-bit constant (0-255) + + `J' + Unsigned 12-bit constant (0-4095) + + `K' + Signed 16-bit constant (-32768-32767) + + `L' + Unsigned 16-bit constant (0-65535) + + `Q' + Memory reference without index register + + `S' + Symbolic constant suitable for use with the `larl' instruction + + + _Xstormy16--`stormy16.h'_ + + `a' + Register r0. + + `b' + Register r1. + + `c' + Register r2. + + `d' + Register r8. + + `e' + Registers r0 through r7. + + `t' + Registers r0 and r1. + + `y' + The carry register. + + `z' + Registers r8 and r9. + + `I' + A constant between 0 and 3 inclusive. + + `J' + A constant that has exactly one bit set. + + `K' + A constant that has exactly one bit clear. + + `L' + A constant between 0 and 255 inclusive. + + `M' + A constant between -255 and 0 inclusive. + + `N' + A constant between -3 and 0 inclusive. + + `O' + A constant between 1 and 4 inclusive. + + `P' + A constant between -4 and -1 inclusive. + + `Q' + A memory reference that is a stack push. + + `R' + A memory reference that is a stack pop. + + `S' + A memory reference that refers to an constant address of + known value. + + `T' + The register indicated by Rx (not implemented yet). + + `U' + A constant that is not between 2 and 15 inclusive. + + + _Xtensa--`xtensa.h'_ + + `a' + General-purpose 32-bit register + + `b' + One-bit boolean register + + `A' + MAC16 40-bit accumulator register + + `I' + Signed 12-bit integer constant, for use in MOVI instructions + + `J' + Signed 8-bit integer constant, for use in ADDI instructions + + `K' + Integer constant valid for BccI instructions + + `L' + Unsigned constant valid for BccUI instructions + + + diff -Nrc3pad gcc-3.2.2/gcc/doc/gcov.1 gcc-3.2.3/gcc/doc/gcov.1 *** gcc-3.2.2/gcc/doc/gcov.1 Wed Feb 5 03:13:55 2003 --- gcc-3.2.3/gcc/doc/gcov.1 Tue Apr 22 07:07:26 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:55 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:26 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "GCOV 1" ! .TH GCOV 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gcov \- coverage testing tool --- 138,144 ---- .\" ====================================================================== .\" .IX Title "GCOV 1" ! .TH GCOV 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gcov \- coverage testing tool diff -Nrc3pad gcc-3.2.2/gcc/doc/gfdl.7 gcc-3.2.3/gcc/doc/gfdl.7 *** gcc-3.2.2/gcc/doc/gfdl.7 Wed Feb 5 03:13:59 2003 --- gcc-3.2.3/gcc/doc/gfdl.7 Tue Apr 22 07:07:33 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:59 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:33 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "gfdl 7" ! .TH gfdl 7 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gfdl \- \s-1GNU\s0 Free Documentation License --- 138,144 ---- .\" ====================================================================== .\" .IX Title "gfdl 7" ! .TH gfdl 7 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gfdl \- \s-1GNU\s0 Free Documentation License diff -Nrc3pad gcc-3.2.2/gcc/doc/gpl.7 gcc-3.2.3/gcc/doc/gpl.7 *** gcc-3.2.2/gcc/doc/gpl.7 Wed Feb 5 03:13:59 2003 --- gcc-3.2.3/gcc/doc/gpl.7 Tue Apr 22 07:07:34 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:59 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:34 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "gpl 7" ! .TH gpl 7 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gpl \- \s-1GNU\s0 General Public License --- 138,144 ---- .\" ====================================================================== .\" .IX Title "gpl 7" ! .TH gpl 7 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gpl \- \s-1GNU\s0 General Public License diff -Nrc3pad gcc-3.2.2/gcc/doc/include/gcc-common.texi gcc-3.2.3/gcc/doc/include/gcc-common.texi *** gcc-3.2.2/gcc/doc/include/gcc-common.texi Fri Nov 22 17:54:00 2002 --- gcc-3.2.3/gcc/doc/include/gcc-common.texi Wed Feb 5 05:09:13 2003 *************** *** 4,10 **** @c Common values used in the GCC manuals: ! @set version-GCC 3.2.2 @c Common macros to support generating man pages: --- 4,10 ---- @c Common values used in the GCC manuals: ! @set version-GCC 3.2.3 @c Common macros to support generating man pages: diff -Nrc3pad gcc-3.2.2/gcc/doc/passes.texi gcc-3.2.3/gcc/doc/passes.texi *** gcc-3.2.2/gcc/doc/passes.texi Mon Jan 27 10:35:10 2003 --- gcc-3.2.3/gcc/doc/passes.texi Tue Mar 25 14:09:52 2003 *************** The option @option{-dB} causes a debuggi *** 531,547 **** this pass. This dump file's name is made by appending @samp{.bbro} to the input file name. - @cindex cross-jumping - @cindex no-op move instructions - @item - Jump optimization is repeated, this time including cross-jumping - and deletion of no-op move instructions. - - @opindex dJ - The option @option{-dJ} causes a debugging dump of the RTL code after - this pass. This dump file's name is made by appending @samp{.jump2} - to the input file name. - @cindex delayed branch scheduling @cindex scheduling, delayed branch @item --- 531,536 ---- diff -Nrc3pad gcc-3.2.2/gcc/dwarf2out.c gcc-3.2.3/gcc/dwarf2out.c *** gcc-3.2.2/gcc/dwarf2out.c Sun Jun 16 20:54:30 2002 --- gcc-3.2.3/gcc/dwarf2out.c Wed Apr 2 17:21:28 2003 *************** output_call_frame_info (for_eh) *** 1789,1812 **** dw_fde_ref fde; dw_cfi_ref cfi; char l1[20], l2[20], section_start_label[20]; ! int any_lsda_needed = 0; char augmentation[6]; int augmentation_size; int fde_encoding = DW_EH_PE_absptr; int per_encoding = DW_EH_PE_absptr; int lsda_encoding = DW_EH_PE_absptr; ! /* If we don't have any functions we'll want to unwind out of, don't emit any ! EH unwind information. */ if (for_eh) { ! int any_eh_needed = flag_asynchronous_unwind_tables; for (i = 0; i < fde_table_in_use; i++) if (fde_table[i].uses_eh_lsda) ! any_eh_needed = any_lsda_needed = 1; else if (! fde_table[i].nothrow) ! any_eh_needed = 1; if (! any_eh_needed) return; --- 1789,1814 ---- dw_fde_ref fde; dw_cfi_ref cfi; char l1[20], l2[20], section_start_label[20]; ! bool any_lsda_needed = false; char augmentation[6]; int augmentation_size; int fde_encoding = DW_EH_PE_absptr; int per_encoding = DW_EH_PE_absptr; int lsda_encoding = DW_EH_PE_absptr; ! /* If we don't have any functions we'll want to unwind out of, don't ! emit any EH unwind information. Note that if exceptions aren't ! enabled, we won't have collected nothrow information, and if we ! asked for asynchronous tables, we always want this info. */ if (for_eh) { ! bool any_eh_needed = !flag_exceptions || flag_asynchronous_unwind_tables; for (i = 0; i < fde_table_in_use; i++) if (fde_table[i].uses_eh_lsda) ! any_eh_needed = any_lsda_needed = true; else if (! fde_table[i].nothrow) ! any_eh_needed = true; if (! any_eh_needed) return; *************** output_call_frame_info (for_eh) *** 1944,1951 **** fde = &fde_table[i]; /* Don't emit EH unwind info for leaf functions that don't need it. */ ! if (!flag_asynchronous_unwind_tables && for_eh && fde->nothrow ! && ! fde->uses_eh_lsda) continue; ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, FDE_LABEL, for_eh + i * 2); --- 1946,1953 ---- fde = &fde_table[i]; /* Don't emit EH unwind info for leaf functions that don't need it. */ ! if (for_eh && !flag_asynchronous_unwind_tables ! && flag_exceptions && fde->nothrow && !fde->uses_eh_lsda) continue; ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, FDE_LABEL, for_eh + i * 2); *************** mem_loc_descriptor (rtl, mode) *** 7792,7797 **** --- 7794,7804 ---- add_loc_descr (&mem_loc_result, new_loc_descr (DW_OP_deref, 0, 0)); break; + case LO_SUM: + rtl = XEXP (rtl, 1); + + /* ... fall through ... */ + case LABEL_REF: /* Some ports can transform a symbol ref into a label ref, because the symbol ref is too far away and has to be dumped into a constant *************** gen_type_die (type, context_die) *** 11058,11078 **** if (type == NULL_TREE || type == error_mark_node) return; - /* We are going to output a DIE to represent the unqualified version of - this type (i.e. without any const or volatile qualifiers) so get the - main variant (i.e. the unqualified version) of this type now. */ - type = type_main_variant (type); - - if (TREE_ASM_WRITTEN (type)) - return; - if (TYPE_NAME (type) && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL && DECL_ORIGINAL_TYPE (TYPE_NAME (type))) { TREE_ASM_WRITTEN (type) = 1; gen_decl_die (TYPE_NAME (type), context_die); return; } switch (TREE_CODE (type)) { --- 11065,11088 ---- if (type == NULL_TREE || type == error_mark_node) return; if (TYPE_NAME (type) && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL && DECL_ORIGINAL_TYPE (TYPE_NAME (type))) { + if (TREE_ASM_WRITTEN (type)) + return; + TREE_ASM_WRITTEN (type) = 1; gen_decl_die (TYPE_NAME (type), context_die); return; } + + /* We are going to output a DIE to represent the unqualified version of + this type (i.e. without any const or volatile qualifiers) so get the + main variant (i.e. the unqualified version) of this type now. */ + type = type_main_variant (type); + + if (TREE_ASM_WRITTEN (type)) + return; switch (TREE_CODE (type)) { diff -Nrc3pad gcc-3.2.2/gcc/expr.c gcc-3.2.3/gcc/expr.c *** gcc-3.2.2/gcc/expr.c Mon Feb 3 18:01:37 2003 --- gcc-3.2.3/gcc/expr.c Wed Mar 12 22:59:31 2003 *************** store_expr (exp, target, want_value) *** 3917,3922 **** --- 3917,3932 ---- int dont_return_target = 0; int dont_store_target = 0; + if (VOID_TYPE_P (TREE_TYPE (exp))) + { + /* C++ can generate ?: expressions with a throw expression in one + branch and an rvalue in the other. Here, we resolve attempts to + store the throw expression's nonexistant result. */ + if (want_value) + abort (); + expand_expr (exp, const0_rtx, VOIDmode, 0); + return NULL_RTX; + } if (TREE_CODE (exp) == COMPOUND_EXPR) { /* Perform first part of compound expression, then assign from second diff -Nrc3pad gcc-3.2.2/gcc/f/BUGS gcc-3.2.3/gcc/f/BUGS *** gcc-3.2.2/gcc/f/BUGS Wed Feb 5 03:54:22 2003 --- gcc-3.2.3/gcc/f/BUGS Tue Apr 22 09:53:56 2003 *************** _Note:_ This file is automatically gener *** 2,8 **** `bugs0.texi' and `bugs.texi'. `BUGS' is _not_ a source file, although it is normally included within source distributions. ! This file lists known bugs in the GCC-3.2.2 version of the GNU Fortran compiler. Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software Foundation, Inc. You may copy, distribute, and modify it freely as long as you preserve --- 2,8 ---- `bugs0.texi' and `bugs.texi'. `BUGS' is _not_ a source file, although it is normally included within source distributions. ! This file lists known bugs in the GCC-3.2.3 version of the GNU Fortran compiler. Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software Foundation, Inc. You may copy, distribute, and modify it freely as long as you preserve *************** Known Bugs In GNU Fortran *** 12,18 **** ************************* This section identifies bugs that `g77' _users_ might run into in ! the GCC-3.2.2 version of `g77'. This includes bugs that are actually in the `gcc' back end (GBE) or in `libf2c', because those sets of code are at least somewhat under the control of (and necessarily intertwined with) `g77', so it isn't worth separating them out. --- 12,18 ---- ************************* This section identifies bugs that `g77' _users_ might run into in ! the GCC-3.2.3 version of `g77'. This includes bugs that are actually in the `gcc' back end (GBE) or in `libf2c', because those sets of code are at least somewhat under the control of (and necessarily intertwined with) `g77', so it isn't worth separating them out. diff -Nrc3pad gcc-3.2.2/gcc/f/ChangeLog gcc-3.2.3/gcc/f/ChangeLog *** gcc-3.2.2/gcc/f/ChangeLog Wed Feb 5 03:00:13 2003 --- gcc-3.2.3/gcc/f/ChangeLog Tue Apr 22 06:14:59 2003 *************** *** 1,3 **** --- 1,12 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-02-05 Gabriel Dos Reis + + * root.texi: Bump version. + * version.c (ffe_version_string): Update. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/f/NEWS gcc-3.2.3/gcc/f/NEWS *** gcc-3.2.2/gcc/f/NEWS Wed Feb 5 03:54:22 2003 --- gcc-3.2.3/gcc/f/NEWS Tue Apr 22 09:53:56 2003 *************** _Note:_ This file is automatically gener *** 2,8 **** `news0.texi' and `news.texi'. `NEWS' is _not_ a source file, although it is normally included within source distributions. ! This file lists news about the GCC-3.2.2 version (and some other versions) of the GNU Fortran compiler. Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software Foundation, Inc. You may copy, distribute, and modify it freely as long as you preserve --- 2,8 ---- `news0.texi' and `news.texi'. `NEWS' is _not_ a source file, although it is normally included within source distributions. ! This file lists news about the GCC-3.2.3 version (and some other versions) of the GNU Fortran compiler. Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software Foundation, Inc. You may copy, distribute, and modify it freely as long as you preserve diff -Nrc3pad gcc-3.2.2/gcc/f/g77.1 gcc-3.2.3/gcc/f/g77.1 *** gcc-3.2.2/gcc/f/g77.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/f/g77.1 Tue Apr 22 07:07:36 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:13:59 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:35 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "G77 1" ! .TH G77 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" g77 \- \s-1GNU\s0 project Fortran 77 compiler --- 138,144 ---- .\" ====================================================================== .\" .IX Title "G77 1" ! .TH G77 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" g77 \- \s-1GNU\s0 project Fortran 77 compiler diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info gcc-3.2.3/gcc/f/g77.info *** gcc-3.2.2/gcc/f/g77.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,765 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + Indirect: + g77.info-1: 1460 + g77.info-2: 49509 + g77.info-3: 98817 + g77.info-4: 124552 + g77.info-5: 176715 + g77.info-6: 225206 + g77.info-7: 270209 + g77.info-8: 319613 + g77.info-9: 369073 + g77.info-10: 418640 + g77.info-11: 463040 + g77.info-12: 512588 + g77.info-13: 562579 + g77.info-14: 609603 + g77.info-15: 653767 + g77.info-16: 701448 + g77.info-17: 751000 + g77.info-18: 799364 + g77.info-19: 841909 + g77.info-20: 885662 + g77.info-21: 904652 +  + Tag Table: + (Indirect) + Node: Top1460 + Node: Copying3417 + Node: GNU Free Documentation License22620 + Node: Contributors42504 + Node: Funding45783 + Node: Funding GNU Fortran48295 + Node: Getting Started49509 + Node: What is GNU Fortran?51758 + Node: G77 and GCC61646 + Node: Invoking G7762864 + Node: Option Summary64802 + Node: Overall Options69642 + Node: Shorthand Options76383 + Node: Fortran Dialect Options78680 + Node: Warning Options89937 + Node: Debugging Options98817 + Node: Optimize Options100407 + Ref: Optimize Options-Footnote-1106004 + Node: Preprocessor Options106697 + Node: Directory Options107878 + Node: Code Gen Options109190 + Node: Environment Variables124097 + Node: News124552 + Node: Changes176715 + Node: Language202308 + Node: Direction of Language Development204511 + Node: Standard Support210750 + Node: No Passing External Assumed-length211471 + Node: No Passing Dummy Assumed-length211948 + Node: No Pathological Implied-DO212463 + Node: No Useless Implied-DO213150 + Node: Conformance213881 + Node: Notation Used215904 + Node: Terms and Concepts220110 + Node: Syntactic Items220622 + Node: Statements Comments Lines221304 + Node: Scope of Names and Labels223169 + Node: Characters Lines Sequence223599 + Node: Character Set224205 + Node: Lines225206 + Node: Continuation Line227682 + Node: Statements228637 + Node: Statement Labels229593 + Node: Order230285 + Node: INCLUDE231170 + Node: Cpp-style directives233942 + Node: Data Types and Constants234397 + Node: Types237918 + Node: Double Notation239007 + Node: Star Notation240079 + Node: Kind Notation243024 + Node: Constants251444 + Node: Integer Type252960 + Node: Character Type253558 + Node: Expressions254322 + Node: %LOC()254738 + Node: Specification Statements257468 + Node: NAMELIST257925 + Node: DOUBLE COMPLEX258676 + Node: Control Statements258930 + Node: DO WHILE259422 + Node: END DO259727 + Node: Construct Names260734 + Node: CYCLE and EXIT261474 + Node: Functions and Subroutines264238 + Node: %VAL()264884 + Node: %REF()266248 + Node: %DESCR()268076 + Node: Generics and Specifics270209 + Node: REAL() and AIMAG() of Complex277411 + Node: CMPLX() of DOUBLE PRECISION279244 + Node: MIL-STD 1753280970 + Node: f77/f2c Intrinsics281312 + Node: Table of Intrinsic Functions281882 + Node: Abort Intrinsic298594 + Node: Abs Intrinsic298858 + Node: Access Intrinsic299721 + Node: AChar Intrinsic300557 + Node: ACos Intrinsic301079 + Node: AdjustL Intrinsic301540 + Node: AdjustR Intrinsic301865 + Node: AImag Intrinsic302191 + Node: AInt Intrinsic302996 + Node: Alarm Intrinsic303624 + Node: All Intrinsic304456 + Node: Allocated Intrinsic304768 + Node: ALog Intrinsic305097 + Node: ALog10 Intrinsic305487 + Node: AMax0 Intrinsic305885 + Node: AMax1 Intrinsic306370 + Node: AMin0 Intrinsic306823 + Node: AMin1 Intrinsic307307 + Node: AMod Intrinsic307759 + Node: And Intrinsic308185 + Node: ANInt Intrinsic308691 + Node: Any Intrinsic309455 + Node: ASin Intrinsic309762 + Node: Associated Intrinsic310220 + Node: ATan Intrinsic310554 + Node: ATan2 Intrinsic311020 + Node: BesJ0 Intrinsic311571 + Node: BesJ1 Intrinsic312032 + Node: BesJN Intrinsic312493 + Node: BesY0 Intrinsic313024 + Node: BesY1 Intrinsic313486 + Node: BesYN Intrinsic313948 + Node: Bit_Size Intrinsic314483 + Node: BTest Intrinsic315142 + Node: CAbs Intrinsic315862 + Node: CCos Intrinsic316249 + Node: Ceiling Intrinsic316641 + Node: CExp Intrinsic316963 + Node: Char Intrinsic317355 + Node: ChDir Intrinsic (subroutine)318609 + Node: ChMod Intrinsic (subroutine)319613 + Node: CLog Intrinsic320884 + Node: Cmplx Intrinsic321288 + Node: Complex Intrinsic322089 + Node: Conjg Intrinsic323535 + Node: Cos Intrinsic323959 + Node: CosH Intrinsic324422 + Node: Count Intrinsic324797 + Node: CPU_Time Intrinsic325115 + Node: CShift Intrinsic325906 + Node: CSin Intrinsic326228 + Node: CSqRt Intrinsic326620 + Node: CTime Intrinsic (subroutine)327030 + Node: CTime Intrinsic (function)327785 + Node: DAbs Intrinsic328419 + Node: DACos Intrinsic328815 + Node: DASin Intrinsic329206 + Node: DATan Intrinsic329598 + Node: DATan2 Intrinsic329991 + Node: Date_and_Time Intrinsic330446 + Node: DbesJ0 Intrinsic331810 + Node: DbesJ1 Intrinsic332203 + Node: DbesJN Intrinsic332589 + Node: DbesY0 Intrinsic333045 + Node: DbesY1 Intrinsic333431 + Node: DbesYN Intrinsic333817 + Node: Dble Intrinsic334271 + Node: DCos Intrinsic334977 + Node: DCosH Intrinsic335361 + Node: DDiM Intrinsic335751 + Node: DErF Intrinsic336183 + Node: DErFC Intrinsic336552 + Node: DExp Intrinsic336927 + Node: Digits Intrinsic337313 + Node: DiM Intrinsic337630 + Node: DInt Intrinsic338129 + Node: DLog Intrinsic338513 + Node: DLog10 Intrinsic338898 + Node: DMax1 Intrinsic339296 + Node: DMin1 Intrinsic339750 + Node: DMod Intrinsic340202 + Node: DNInt Intrinsic340630 + Node: Dot_Product Intrinsic341029 + Node: DProd Intrinsic341369 + Node: DSign Intrinsic341751 + Node: DSin Intrinsic342190 + Node: DSinH Intrinsic342575 + Node: DSqRt Intrinsic342966 + Node: DTan Intrinsic343357 + Node: DTanH Intrinsic343742 + Node: DTime Intrinsic (subroutine)344146 + Node: EOShift Intrinsic345417 + Node: Epsilon Intrinsic345756 + Node: ErF Intrinsic346080 + Node: ErFC Intrinsic346486 + Node: ETime Intrinsic (subroutine)347046 + Node: ETime Intrinsic (function)348209 + Node: Exit Intrinsic349249 + Node: Exp Intrinsic349758 + Node: Exponent Intrinsic350220 + Node: FDate Intrinsic (subroutine)350559 + Node: FDate Intrinsic (function)351469 + Node: FGet Intrinsic (subroutine)352241 + Node: FGetC Intrinsic (subroutine)353078 + Node: Float Intrinsic353955 + Node: Floor Intrinsic354355 + Node: Flush Intrinsic354671 + Node: FNum Intrinsic355250 + Node: FPut Intrinsic (subroutine)355698 + Node: FPutC Intrinsic (subroutine)356495 + Node: Fraction Intrinsic357342 + Node: FSeek Intrinsic357683 + Node: FStat Intrinsic (subroutine)358408 + Node: FStat Intrinsic (function)359933 + Node: FTell Intrinsic (subroutine)361223 + Node: FTell Intrinsic (function)361896 + Node: GError Intrinsic362413 + Node: GetArg Intrinsic362787 + Node: GetCWD Intrinsic (subroutine)363455 + Node: GetCWD Intrinsic (function)364311 + Node: GetEnv Intrinsic364931 + Node: GetGId Intrinsic365518 + Node: GetLog Intrinsic365824 + Node: GetPId Intrinsic366362 + Node: GetUId Intrinsic366670 + Node: GMTime Intrinsic366975 + Node: HostNm Intrinsic (subroutine)367983 + Node: HostNm Intrinsic (function)369073 + Node: Huge Intrinsic369916 + Node: IAbs Intrinsic370239 + Node: IAChar Intrinsic370630 + Node: IAnd Intrinsic371170 + Node: IArgC Intrinsic371658 + Node: IBClr Intrinsic372034 + Node: IBits Intrinsic372545 + Node: IBSet Intrinsic373259 + Node: IChar Intrinsic373761 + Node: IDate Intrinsic (UNIX)374980 + Node: IDiM Intrinsic375783 + Node: IDInt Intrinsic376232 + Node: IDNInt Intrinsic376625 + Node: IEOr Intrinsic377024 + Node: IErrNo Intrinsic377522 + Node: IFix Intrinsic377849 + Node: Imag Intrinsic378237 + Node: ImagPart Intrinsic379242 + Node: Index Intrinsic380268 + Node: Int Intrinsic380821 + Node: Int2 Intrinsic381536 + Node: Int8 Intrinsic382246 + Node: IOr Intrinsic382956 + Node: IRand Intrinsic383436 + Node: IsaTty Intrinsic384356 + Node: IShft Intrinsic384780 + Node: IShftC Intrinsic385610 + Node: ISign Intrinsic386539 + Node: ITime Intrinsic386989 + Node: Kill Intrinsic (subroutine)387391 + Node: Kind Intrinsic388228 + Node: LBound Intrinsic388553 + Node: Len Intrinsic388870 + Node: Len_Trim Intrinsic389506 + Node: LGe Intrinsic389918 + Node: LGt Intrinsic391331 + Node: Link Intrinsic (subroutine)392236 + Node: LLe Intrinsic393201 + Node: LLt Intrinsic394106 + Node: LnBlnk Intrinsic395000 + Node: Loc Intrinsic395403 + Node: Log Intrinsic395834 + Node: Log10 Intrinsic396425 + Node: Logical Intrinsic396967 + Node: Long Intrinsic397290 + Node: LShift Intrinsic397814 + Node: LStat Intrinsic (subroutine)398850 + Node: LStat Intrinsic (function)400662 + Node: LTime Intrinsic402225 + Node: MatMul Intrinsic403229 + Node: Max Intrinsic403547 + Node: Max0 Intrinsic404098 + Node: Max1 Intrinsic404549 + Node: MaxExponent Intrinsic405033 + Node: MaxLoc Intrinsic405373 + Node: MaxVal Intrinsic405700 + Node: MClock Intrinsic406022 + Node: MClock8 Intrinsic406920 + Node: Merge Intrinsic408108 + Node: Min Intrinsic408424 + Node: Min0 Intrinsic408975 + Node: Min1 Intrinsic409426 + Node: MinExponent Intrinsic409910 + Node: MinLoc Intrinsic410250 + Node: MinVal Intrinsic410577 + Node: Mod Intrinsic410896 + Node: Modulo Intrinsic411419 + Node: MvBits Intrinsic411738 + Node: Nearest Intrinsic412604 + Node: NInt Intrinsic412928 + Node: Not Intrinsic413766 + Node: Or Intrinsic414161 + Node: Pack Intrinsic414659 + Node: PError Intrinsic414969 + Node: Precision Intrinsic415423 + Node: Present Intrinsic415758 + Node: Product Intrinsic416088 + Node: Radix Intrinsic416414 + Node: Rand Intrinsic416731 + Node: Random_Number Intrinsic417618 + Node: Random_Seed Intrinsic417971 + Node: Range Intrinsic418319 + Node: Real Intrinsic418640 + Node: RealPart Intrinsic419646 + Node: Rename Intrinsic (subroutine)420679 + Node: Repeat Intrinsic421651 + Node: Reshape Intrinsic421987 + Node: RRSpacing Intrinsic422316 + Node: RShift Intrinsic422651 + Node: Scale Intrinsic423649 + Node: Scan Intrinsic423965 + Node: Second Intrinsic (function)424289 + Node: Second Intrinsic (subroutine)425120 + Node: Selected_Int_Kind Intrinsic426095 + Node: Selected_Real_Kind Intrinsic426486 + Node: Set_Exponent Intrinsic426873 + Node: Shape Intrinsic427230 + Node: Short Intrinsic427553 + Node: Sign Intrinsic428249 + Node: Signal Intrinsic (subroutine)428849 + Node: Sin Intrinsic431063 + Node: SinH Intrinsic431538 + Node: Sleep Intrinsic431911 + Node: Sngl Intrinsic432253 + Node: Spacing Intrinsic432642 + Node: Spread Intrinsic432966 + Node: SqRt Intrinsic433287 + Node: SRand Intrinsic433891 + Node: Stat Intrinsic (subroutine)434268 + Node: Stat Intrinsic (function)435883 + Node: Sum Intrinsic437247 + Node: SymLnk Intrinsic (subroutine)437579 + Node: System Intrinsic (subroutine)438611 + Node: System_Clock Intrinsic439550 + Node: Tan Intrinsic440674 + Node: TanH Intrinsic441134 + Node: Time Intrinsic (UNIX)441516 + Node: Time8 Intrinsic442501 + Node: Tiny Intrinsic443680 + Node: Transfer Intrinsic443995 + Node: Transpose Intrinsic444326 + Node: Trim Intrinsic444660 + Node: TtyNam Intrinsic (subroutine)444990 + Node: TtyNam Intrinsic (function)445692 + Node: UBound Intrinsic446261 + Node: UMask Intrinsic (subroutine)446606 + Node: Unlink Intrinsic (subroutine)447303 + Node: Unpack Intrinsic448201 + Node: Verify Intrinsic448536 + Node: XOr Intrinsic448855 + Node: ZAbs Intrinsic449371 + Node: ZCos Intrinsic449740 + Node: ZExp Intrinsic450113 + Node: ZLog Intrinsic450486 + Node: ZSin Intrinsic450859 + Node: ZSqRt Intrinsic451233 + Node: Scope and Classes of Names451590 + Node: Underscores in Symbol Names452072 + Node: I/O452319 + Node: Fortran 90 Features453092 + Node: Other Dialects455894 + Node: Source Form457053 + Node: Carriage Returns458268 + Node: Tabs458597 + Node: Short Lines459470 + Node: Long Lines460444 + Node: Ampersands461055 + Node: Trailing Comment461309 + Node: Debug Line462085 + Node: Dollar Signs462754 + Node: Case Sensitivity463040 + Node: VXT Fortran471656 + Node: Double Quote Meaning472839 + Node: Exclamation Point473767 + Node: Fortran 90474810 + Node: Pedantic Compilation475862 + Node: Distensions479826 + Node: Ugly Implicit Argument Conversion480790 + Node: Ugly Assumed-Size Arrays481404 + Node: Ugly Complex Part Extraction483125 + Node: Ugly Null Arguments484747 + Node: Ugly Conversion of Initializers486350 + Node: Ugly Integer Conversions488115 + Node: Ugly Assigned Labels489223 + Node: Compiler491154 + Node: Compiler Limits491792 + Node: Run-time Environment Limits492683 + Node: Timer Wraparounds494625 + Node: Year 2000 (Y2K) Problems495904 + Node: Array Size500410 + Node: Character-variable Length501595 + Node: Year 10000 (Y10K) Problems502104 + Node: Compiler Types502650 + Node: Compiler Constants507361 + Node: Compiler Intrinsics508220 + Node: Intrinsic Groups509147 + Node: Other Intrinsics512588 + Node: ACosD Intrinsic520186 + Node: AIMax0 Intrinsic520467 + Node: AIMin0 Intrinsic520776 + Node: AJMax0 Intrinsic521086 + Node: AJMin0 Intrinsic521396 + Node: ASinD Intrinsic521705 + Node: ATan2D Intrinsic522011 + Node: ATanD Intrinsic522319 + Node: BITest Intrinsic522625 + Node: BJTest Intrinsic522934 + Node: CDAbs Intrinsic523243 + Node: CDCos Intrinsic523616 + Node: CDExp Intrinsic523991 + Node: CDLog Intrinsic524366 + Node: CDSin Intrinsic524741 + Node: CDSqRt Intrinsic525117 + Node: ChDir Intrinsic (function)525510 + Node: ChMod Intrinsic (function)526339 + Node: CosD Intrinsic527453 + Node: DACosD Intrinsic527765 + Node: DASinD Intrinsic528073 + Node: DATan2D Intrinsic528384 + Node: DATanD Intrinsic528698 + Node: Date Intrinsic529007 + Node: DbleQ Intrinsic529726 + Node: DCmplx Intrinsic530030 + Node: DConjg Intrinsic531661 + Node: DCosD Intrinsic532046 + Node: DFloat Intrinsic532352 + Node: DFlotI Intrinsic532724 + Node: DFlotJ Intrinsic533034 + Node: DImag Intrinsic533343 + Node: DReal Intrinsic533720 + Node: DSinD Intrinsic534867 + Node: DTanD Intrinsic535171 + Node: DTime Intrinsic (function)535486 + Node: FGet Intrinsic (function)536716 + Node: FGetC Intrinsic (function)537489 + Node: FloatI Intrinsic538305 + Node: FloatJ Intrinsic538625 + Node: FPut Intrinsic (function)538944 + Node: FPutC Intrinsic (function)539680 + Node: IDate Intrinsic (VXT)540473 + Node: IIAbs Intrinsic541517 + Node: IIAnd Intrinsic541827 + Node: IIBClr Intrinsic542132 + Node: IIBits Intrinsic542441 + Node: IIBSet Intrinsic542751 + Node: IIDiM Intrinsic543060 + Node: IIDInt Intrinsic543366 + Node: IIDNnt Intrinsic543675 + Node: IIEOr Intrinsic543984 + Node: IIFix Intrinsic544289 + Node: IInt Intrinsic544592 + Node: IIOr Intrinsic544891 + Node: IIQint Intrinsic545191 + Node: IIQNnt Intrinsic545499 + Node: IIShftC Intrinsic545810 + Node: IISign Intrinsic546124 + Node: IMax0 Intrinsic546434 + Node: IMax1 Intrinsic546739 + Node: IMin0 Intrinsic547043 + Node: IMin1 Intrinsic547347 + Node: IMod Intrinsic547650 + Node: INInt Intrinsic547950 + Node: INot Intrinsic548252 + Node: IZExt Intrinsic548552 + Node: JIAbs Intrinsic548855 + Node: JIAnd Intrinsic549159 + Node: JIBClr Intrinsic549464 + Node: JIBits Intrinsic549773 + Node: JIBSet Intrinsic550083 + Node: JIDiM Intrinsic550392 + Node: JIDInt Intrinsic550698 + Node: JIDNnt Intrinsic551007 + Node: JIEOr Intrinsic551316 + Node: JIFix Intrinsic551621 + Node: JInt Intrinsic551924 + Node: JIOr Intrinsic552223 + Node: JIQint Intrinsic552523 + Node: JIQNnt Intrinsic552831 + Node: JIShft Intrinsic553141 + Node: JIShftC Intrinsic553452 + Node: JISign Intrinsic553766 + Node: JMax0 Intrinsic554076 + Node: JMax1 Intrinsic554381 + Node: JMin0 Intrinsic554685 + Node: JMin1 Intrinsic554989 + Node: JMod Intrinsic555292 + Node: JNInt Intrinsic555592 + Node: JNot Intrinsic555894 + Node: JZExt Intrinsic556194 + Node: Kill Intrinsic (function)556507 + Node: Link Intrinsic (function)557189 + Node: QAbs Intrinsic558001 + Node: QACos Intrinsic558311 + Node: QACosD Intrinsic558615 + Node: QASin Intrinsic558923 + Node: QASinD Intrinsic559229 + Node: QATan Intrinsic559537 + Node: QATan2 Intrinsic559843 + Node: QATan2D Intrinsic560153 + Node: QATanD Intrinsic560467 + Node: QCos Intrinsic560776 + Node: QCosD Intrinsic561077 + Node: QCosH Intrinsic561380 + Node: QDiM Intrinsic561683 + Node: QExp Intrinsic561982 + Node: QExt Intrinsic562280 + Node: QExtD Intrinsic562579 + Node: QFloat Intrinsic562883 + Node: QInt Intrinsic563190 + Node: QLog Intrinsic563490 + Node: QLog10 Intrinsic563790 + Node: QMax1 Intrinsic564097 + Node: QMin1 Intrinsic564402 + Node: QMod Intrinsic564705 + Node: QNInt Intrinsic565005 + Node: QSin Intrinsic565307 + Node: QSinD Intrinsic565607 + Node: QSinH Intrinsic565910 + Node: QSqRt Intrinsic566214 + Node: QTan Intrinsic566517 + Node: QTanD Intrinsic566817 + Node: QTanH Intrinsic567120 + Node: Rename Intrinsic (function)567436 + Node: Secnds Intrinsic568241 + Node: Signal Intrinsic (function)568840 + Node: SinD Intrinsic571669 + Node: SnglQ Intrinsic571981 + Node: SymLnk Intrinsic (function)572296 + Node: System Intrinsic (function)573164 + Node: TanD Intrinsic574491 + Node: Time Intrinsic (VXT)574808 + Node: UMask Intrinsic (function)575562 + Node: Unlink Intrinsic (function)576170 + Node: ZExt Intrinsic576899 + Node: Other Compilers577187 + Node: Dropping f2c Compatibility579707 + Node: Compilers Other Than f2c582779 + Node: Other Languages584577 + Node: Interoperating with C and C++584842 + Node: C Interfacing Tools585875 + Node: C Access to Type Information586803 + Node: f2c Skeletons and Prototypes587490 + Ref: f2c Skeletons and Prototypes-Footnote-1588937 + Node: C++ Considerations589191 + Node: Startup Code589846 + Node: Debugging and Interfacing594635 + Node: Main Program Unit597322 + Node: Procedures599816 + Node: Functions602474 + Node: Names604092 + Node: Common Blocks607235 + Node: Local Equivalence Areas607499 + Node: Complex Variables608483 + Node: Arrays609603 + Node: Adjustable Arrays612937 + Node: Alternate Entry Points615796 + Node: Alternate Returns622498 + Node: Assigned Statement Labels623399 + Node: Run-time Library Errors625244 + Node: Collected Fortran Wisdom627196 + Node: Advantages Over f2c628632 + Node: Language Extensions629613 + Node: Diagnostic Abilities630787 + Node: Compiler Options631178 + Node: Compiler Speed632226 + Node: Program Speed632936 + Node: Ease of Debugging634521 + Node: Character and Hollerith Constants636951 + Node: Block Data and Libraries637923 + Node: Loops641252 + Node: Working Programs646478 + Node: Not My Type647222 + Node: Variables Assumed To Be Zero649153 + Node: Variables Assumed To Be Saved650207 + Node: Unwanted Variables651577 + Node: Unused Arguments652457 + Node: Surprising Interpretations of Code652920 + Node: Aliasing Assumed To Work653767 + Node: Output Assumed To Flush659964 + Node: Large File Unit Numbers662737 + Node: Floating-point precision664889 + Node: Inconsistent Calling Sequences666150 + Node: Overly Convenient Options667130 + Node: Faster Programs670436 + Node: Aligned Data670882 + Node: Prefer Automatic Uninitialized Variables675759 + Node: Avoid f2c Compatibility677125 + Node: Use Submodel Options677593 + Node: Trouble678597 + Node: But-bugs680059 + Node: Signal 11 and Friends681832 + Node: Cannot Link Fortran Programs683912 + Node: Large Common Blocks685195 + Node: Debugger Problems685621 + Node: NeXTStep Problems686336 + Node: Stack Overflow688162 + Node: Nothing Happens691051 + Node: Strange Behavior at Run Time692665 + Node: Floating-point Errors695154 + Node: Known Bugs701448 + Node: Missing Features708751 + Node: Better Source Model710678 + Node: Fortran 90 Support712447 + Node: Intrinsics in PARAMETER Statements713548 + Node: Arbitrary Concatenation714299 + Node: SELECT CASE on CHARACTER Type714702 + Node: RECURSIVE Keyword714989 + Node: Increasing Precision/Range715416 + Node: Popular Non-standard Types716954 + Node: Full Support for Compiler Types717293 + Node: Array Bounds Expressions717929 + Node: POINTER Statements718376 + Node: Sensible Non-standard Constructs719259 + Node: READONLY Keyword721585 + Node: FLUSH Statement722495 + Node: Expressions in FORMAT Statements722865 + Node: Explicit Assembler Code724040 + Node: Q Edit Descriptor724329 + Node: Old-style PARAMETER Statements724833 + Node: TYPE and ACCEPT I/O Statements725567 + Node: STRUCTURE UNION RECORD MAP726133 + Node: OPEN CLOSE and INQUIRE Keywords726619 + Node: ENCODE and DECODE727599 + Node: AUTOMATIC Statement728694 + Node: Suppressing Space Padding729941 + Node: Fortran Preprocessor731168 + Node: Bit Operations on Floating-point Data731741 + Node: Really Ugly Character Assignments732274 + Node: POSIX Standard732649 + Node: Floating-point Exception Handling732889 + Node: Nonportable Conversions734293 + Node: Large Automatic Arrays734836 + Node: Support for Threads735243 + Node: Enabling Debug Lines735668 + Node: Better Warnings736045 + Node: Gracefully Handle Sensible Bad Code737681 + Node: Non-standard Conversions738425 + Node: Non-standard Intrinsics738768 + Node: Modifying DO Variable739184 + Node: Better Pedantic Compilation739860 + Node: Warn About Implicit Conversions740488 + Node: Invalid Use of Hollerith Constant741075 + Node: Dummy Array Without Dimensioning Dummy741618 + Node: Invalid FORMAT Specifiers742531 + Node: Ambiguous Dialects742932 + Node: Unused Labels743343 + Node: Informational Messages743565 + Node: Uninitialized Variables at Run Time743968 + Node: Portable Unformatted Files744574 + Ref: Portable Unformatted Files-Footnote-1747530 + Node: Better List-directed I/O747558 + Node: Default to Console I/O748463 + Node: Labels Visible to Debugger749111 + Node: Disappointments749512 + Node: Mangling of Names750150 + Node: Multiple Definitions of External Names751000 + Node: Limitation on Implicit Declarations752363 + Node: Non-bugs752647 + Node: Backslash in Constants753772 + Node: Initializing Before Specifying758661 + Node: Context-Sensitive Intrinsicness759803 + Node: Context-Sensitive Constants761699 + Node: Equivalence Versus Equality764655 + Node: Order of Side Effects767698 + Node: Warnings and Errors769426 + Node: Open Questions770824 + Node: Bugs771293 + Node: Bug Criteria772732 + Node: Bug Lists778965 + Node: Bug Reporting779754 + Node: Service793370 + Node: Adding Options793836 + Node: Projects798429 + Node: Efficiency799364 + Node: Better Optimization802261 + Node: Simplify Porting805631 + Node: More Extensions807386 + Node: Machine Model810474 + Node: Internals Documentation811760 + Node: Internals Improvements812067 + Node: Better Diagnostics815611 + Node: Front End816528 + Node: Overview of Sources817315 + Node: Overview of Translation Process824704 + Node: g77stripcard828982 + Node: lex.c831459 + Node: sta.c840999 + Node: sti.c841110 + Node: stq.c841221 + Node: stb.c841332 + Node: expr.c841444 + Node: stc.c841558 + Node: std.c841670 + Node: ste.c841781 + Node: Gotchas (Transforming)841909 + Node: TBD (Transforming)850028 + Node: Philosophy of Code Generation852724 + Node: Two-pass Design858628 + Node: Two-pass Code859785 + Node: Why Two Passes860518 + Node: Challenges Posed866586 + Node: Transforming Statements869070 + Node: Statements Needing Temporaries869920 + Node: Transforming DO WHILE872684 + Node: Transforming Iterative DO873867 + Node: Transforming Block IF874696 + Node: Transforming SELECT CASE876061 + Node: Transforming Expressions879283 + Node: Internal Naming Conventions881272 + Node: Diagnostics884272 + Node: CMPAMBIG885662 + Node: EXPIMP892079 + Node: INTGLOB893315 + Node: LEX895559 + Node: GLOBALS901014 + Node: LINKFAIL903678 + Node: Y2KBAD904302 + Node: Index904652 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-1 gcc-3.2.3/gcc/f/g77.info-1 *** gcc-3.2.2/gcc/f/g77.info-1 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-1 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,1007 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Top, Next: Copying, Up: (DIR) + + Introduction + ************ + + This manual documents how to run, install and port `g77', as well as + its new features and incompatibilities, and how to report bugs. It + corresponds to the GCC-3.2.3 version of `g77'. + + * Menu: + + * Copying:: GNU General Public License says + how you can copy and share GNU Fortran. + * GNU Free Documentation License:: + How you can copy and share this manual. + * Contributors:: People who have contributed to GNU Fortran. + * Funding:: How to help assure continued work for free software. + * Funding GNU Fortran:: How to help assure continued work on GNU Fortran. + + * Getting Started:: Finding your way around this manual. + * What is GNU Fortran?:: How `g77' fits into the universe. + * G77 and GCC:: You can compile Fortran, C, or other programs. + * Invoking G77:: Command options supported by `g77'. + * News:: News about recent releases of `g77'. + * Changes:: User-visible changes to recent releases of `g77'. + * Language:: The GNU Fortran language. + * Compiler:: The GNU Fortran compiler. + * Other Dialects:: Dialects of Fortran supported by `g77'. + * Other Compilers:: Fortran compilers other than `g77'. + * Other Languages:: Languages other than Fortran. + * Debugging and Interfacing:: How `g77' generates code. + * Collected Fortran Wisdom:: How to avoid Trouble. + * Trouble:: If you have trouble with GNU Fortran. + * Open Questions:: Things we'd like to know. + * Bugs:: How, why, and where to report bugs. + * Service:: How to find suppliers of support for GNU Fortran. + + * Adding Options:: Guidance on teaching `g77' about new options. + * Projects:: Projects for `g77' internals hackers. + * Front End:: Design and implementation of the `g77' front end. + + * M: Diagnostics. Diagnostics produced by `g77'. + + * Index:: Index of concepts and symbol names. + +  + File: g77.info, Node: Copying, Next: GNU Free Documentation License, Prev: Top, Up: Top + + GNU GENERAL PUBLIC LICENSE + ************************** + + Version 2, June 1991 + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + ======== + + The licenses for most software are designed to take away your + freedom to share and change it. By contrast, the GNU General Public + License is intended to guarantee your freedom to share and change free + software--to make sure the software is free for all its users. This + General Public License applies to most of the Free Software + Foundation's software and to any other program whose authors commit to + using it. (Some other Free Software Foundation software is covered by + the GNU Library General Public License instead.) You can apply it to + your programs, too. + + When we speak of free software, we are referring to freedom, not + price. Our General Public Licenses are designed to make sure that you + have the freedom to distribute copies of free software (and charge for + this service if you wish), that you receive source code or can get it + if you want it, that you can change the software or use pieces of it in + new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid + anyone to deny you these rights or to ask you to surrender the rights. + These restrictions translate to certain responsibilities for you if you + distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether + gratis or for a fee, you must give the recipients all the rights that + you have. You must make sure that they, too, receive or can get the + source code. And you must show them these terms so they know their + rights. + + We protect your rights with two steps: (1) copyright the software, + and (2) offer you this license which gives you legal permission to copy, + distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain + that everyone understands that there is no warranty for this free + software. If the software is modified by someone else and passed on, we + want its recipients to know that what they have is not the original, so + that any problems introduced by others will not reflect on the original + authors' reputations. + + Finally, any free program is threatened constantly by software + patents. We wish to avoid the danger that redistributors of a free + program will individually obtain patent licenses, in effect making the + program proprietary. To prevent this, we have made it clear that any + patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and + modification follow. + + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + 0. This License applies to any program or other work which contains a + notice placed by the copyright holder saying it may be distributed + under the terms of this General Public License. The "Program", + below, refers to any such program or work, and a "work based on + the Program" means either the Program or any derivative work under + copyright law: that is to say, a work containing the Program or a + portion of it, either verbatim or with modifications and/or + translated into another language. (Hereinafter, translation is + included without limitation in the term "modification".) Each + licensee is addressed as "you". + + Activities other than copying, distribution and modification are + not covered by this License; they are outside its scope. The act + of running the Program is not restricted, and the output from the + Program is covered only if its contents constitute a work based on + the Program (independent of having been made by running the + Program). Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's + source code as you receive it, in any medium, provided that you + conspicuously and appropriately publish on each copy an appropriate + copyright notice and disclaimer of warranty; keep intact all the + notices that refer to this License and to the absence of any + warranty; and give any other recipients of the Program a copy of + this License along with the Program. + + You may charge a fee for the physical act of transferring a copy, + and you may at your option offer warranty protection in exchange + for a fee. + + 2. You may modify your copy or copies of the Program or any portion + of it, thus forming a work based on the Program, and copy and + distribute such modifications or work under the terms of Section 1 + above, provided that you also meet all of these conditions: + + a. You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b. You must cause any work that you distribute or publish, that + in whole or in part contains or is derived from the Program + or any part thereof, to be licensed as a whole at no charge + to all third parties under the terms of this License. + + c. If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display + an announcement including an appropriate copyright notice and + a notice that there is no warranty (or else, saying that you + provide a warranty) and that users may redistribute the + program under these conditions, and telling the user how to + view a copy of this License. (Exception: if the Program + itself is interactive but does not normally print such an + announcement, your work based on the Program is not required + to print an announcement.) + + These requirements apply to the modified work as a whole. If + identifiable sections of that work are not derived from the + Program, and can be reasonably considered independent and separate + works in themselves, then this License, and its terms, do not + apply to those sections when you distribute them as separate + works. But when you distribute the same sections as part of a + whole which is a work based on the Program, the distribution of + the whole must be on the terms of this License, whose permissions + for other licensees extend to the entire whole, and thus to each + and every part regardless of who wrote it. + + Thus, it is not the intent of this section to claim rights or + contest your rights to work written entirely by you; rather, the + intent is to exercise the right to control the distribution of + derivative or collective works based on the Program. + + In addition, mere aggregation of another work not based on the + Program with the Program (or with a work based on the Program) on + a volume of a storage or distribution medium does not bring the + other work under the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, + under Section 2) in object code or executable form under the terms + of Sections 1 and 2 above provided that you also do one of the + following: + + a. Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of + Sections 1 and 2 above on a medium customarily used for + software interchange; or, + + b. Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a + medium customarily used for software interchange; or, + + c. Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with + such an offer, in accord with Subsection b above.) + + The source code for a work means the preferred form of the work for + making modifications to it. For an executable work, complete + source code means all the source code for all modules it contains, + plus any associated interface definition files, plus the scripts + used to control compilation and installation of the executable. + However, as a special exception, the source code distributed need + not include anything that is normally distributed (in either + source or binary form) with the major components (compiler, + kernel, and so on) of the operating system on which the executable + runs, unless that component itself accompanies the executable. + + If distribution of executable or object code is made by offering + access to copy from a designated place, then offering equivalent + access to copy the source code from the same place counts as + distribution of the source code, even though third parties are not + compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program + except as expressly provided under this License. Any attempt + otherwise to copy, modify, sublicense or distribute the Program is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 5. You are not required to accept this License, since you have not + signed it. However, nothing else grants you permission to modify + or distribute the Program or its derivative works. These actions + are prohibited by law if you do not accept this License. + Therefore, by modifying or distributing the Program (or any work + based on the Program), you indicate your acceptance of this + License to do so, and all its terms and conditions for copying, + distributing or modifying the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the + Program), the recipient automatically receives a license from the + original licensor to copy, distribute or modify the Program + subject to these terms and conditions. You may not impose any + further restrictions on the recipients' exercise of the rights + granted herein. You are not responsible for enforcing compliance + by third parties to this License. + + 7. If, as a consequence of a court judgment or allegation of patent + infringement or for any other reason (not limited to patent + issues), conditions are imposed on you (whether by court order, + agreement or otherwise) that contradict the conditions of this + License, they do not excuse you from the conditions of this + License. If you cannot distribute so as to satisfy simultaneously + your obligations under this License and any other pertinent + obligations, then as a consequence you may not distribute the + Program at all. For example, if a patent license would not permit + royalty-free redistribution of the Program by all those who + receive copies directly or indirectly through you, then the only + way you could satisfy both it and this License would be to refrain + entirely from distribution of the Program. + + If any portion of this section is held invalid or unenforceable + under any particular circumstance, the balance of the section is + intended to apply and the section as a whole is intended to apply + in other circumstances. + + It is not the purpose of this section to induce you to infringe any + patents or other property right claims or to contest validity of + any such claims; this section has the sole purpose of protecting + the integrity of the free software distribution system, which is + implemented by public license practices. Many people have made + generous contributions to the wide range of software distributed + through that system in reliance on consistent application of that + system; it is up to the author/donor to decide if he or she is + willing to distribute software through any other system and a + licensee cannot impose that choice. + + This section is intended to make thoroughly clear what is believed + to be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in + certain countries either by patents or by copyrighted interfaces, + the original copyright holder who places the Program under this + License may add an explicit geographical distribution limitation + excluding those countries, so that distribution is permitted only + in or among countries not thus excluded. In such case, this + License incorporates the limitation as if written in the body of + this License. + + 9. The Free Software Foundation may publish revised and/or new + versions of the General Public License from time to time. Such + new versions will be similar in spirit to the present version, but + may differ in detail to address new problems or concerns. + + Each version is given a distinguishing version number. If the + Program specifies a version number of this License which applies + to it and "any later version", you have the option of following + the terms and conditions either of that version or of any later + version published by the Free Software Foundation. If the Program + does not specify a version number of this License, you may choose + any version ever published by the Free Software Foundation. + + 10. If you wish to incorporate parts of the Program into other free + programs whose distribution conditions are different, write to the + author to ask for permission. For software which is copyrighted + by the Free Software Foundation, write to the Free Software + Foundation; we sometimes make exceptions for this. Our decision + will be guided by the two goals of preserving the free status of + all derivatives of our free software and of promoting the sharing + and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO + WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE + LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT + HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT + WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT + NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE + QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE + PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY + SERVICING, REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN + WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY + MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE + LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, + INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR + INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF + DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU + OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY + OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN + ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + ============================================= + + If you develop a new program, and you want it to be of the greatest + possible use to the public, the best way to achieve this is to make it + free software which everyone can redistribute and change under these + terms. + + To do so, attach the following notices to the program. It is safest + to attach them to the start of each source file to most effectively + convey the exclusion of warranty; and each file should have at least + the "copyright" line and a pointer to where the full notice is found. + + ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. + Copyright (C) YEAR NAME OF AUTHOR + + This program 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 2 of the License, or + (at your option) any later version. + + This program 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 this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. + + Also add information on how to contact you by electronic and paper + mail. + + If the program is interactive, make it output a short notice like + this when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) YEAR NAME OF AUTHOR + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details + type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + + The hypothetical commands `show w' and `show c' should show the + appropriate parts of the General Public License. Of course, the + commands you use may be called something other than `show w' and `show + c'; they could even be mouse-clicks or menu items--whatever suits your + program. + + You should also get your employer (if you work as a programmer) or + your school, if any, to sign a "copyright disclaimer" for the program, + if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + SIGNATURE OF TY COON, 1 April 1989 + Ty Coon, President of Vice + + This General Public License does not permit incorporating your + program into proprietary programs. If your program is a subroutine + library, you may consider it more useful to permit linking proprietary + applications with the library. If this is what you want to do, use the + GNU Library General Public License instead of this License. + +  + File: g77.info, Node: GNU Free Documentation License, Next: Contributors, Prev: Copying, Up: Top + + GNU Free Documentation License + ****************************** + + Version 1.1, March 2000 + Copyright (C) 2000 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + 0. PREAMBLE + + The purpose of this License is to make a manual, textbook, or other + written document "free" in the sense of freedom: to assure everyone + the effective freedom to copy and redistribute it, with or without + modifying it, either commercially or noncommercially. Secondarily, + this License preserves for the author and publisher a way to get + credit for their work, while not being considered responsible for + modifications made by others. + + This License is a kind of "copyleft", which means that derivative + works of the document must themselves be free in the same sense. + It complements the GNU General Public License, which is a copyleft + license designed for free software. + + We have designed this License in order to use it for manuals for + free software, because free software needs free documentation: a + free program should come with manuals providing the same freedoms + that the software does. But this License is not limited to + software manuals; it can be used for any textual work, regardless + of subject matter or whether it is published as a printed book. + We recommend this License principally for works whose purpose is + instruction or reference. + + 1. APPLICABILITY AND DEFINITIONS + + This License applies to any manual or other work that contains a + notice placed by the copyright holder saying it can be distributed + under the terms of this License. The "Document", below, refers to + any such manual or work. Any member of the public is a licensee, + and is addressed as "you". + + A "Modified Version" of the Document means any work containing the + Document or a portion of it, either copied verbatim, or with + modifications and/or translated into another language. + + A "Secondary Section" is a named appendix or a front-matter + section of the Document that deals exclusively with the + relationship of the publishers or authors of the Document to the + Document's overall subject (or to related matters) and contains + nothing that could fall directly within that overall subject. + (For example, if the Document is in part a textbook of + mathematics, a Secondary Section may not explain any mathematics.) + The relationship could be a matter of historical connection with + the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + The "Invariant Sections" are certain Secondary Sections whose + titles are designated, as being those of Invariant Sections, in + the notice that says that the Document is released under this + License. + + The "Cover Texts" are certain short passages of text that are + listed, as Front-Cover Texts or Back-Cover Texts, in the notice + that says that the Document is released under this License. + + A "Transparent" copy of the Document means a machine-readable copy, + represented in a format whose specification is available to the + general public, whose contents can be viewed and edited directly + and straightforwardly with generic text editors or (for images + composed of pixels) generic paint programs or (for drawings) some + widely available drawing editor, and that is suitable for input to + text formatters or for automatic translation to a variety of + formats suitable for input to text formatters. A copy made in an + otherwise Transparent file format whose markup has been designed + to thwart or discourage subsequent modification by readers is not + Transparent. A copy that is not "Transparent" is called "Opaque". + + Examples of suitable formats for Transparent copies include plain + ASCII without markup, Texinfo input format, LaTeX input format, + SGML or XML using a publicly available DTD, and + standard-conforming simple HTML designed for human modification. + Opaque formats include PostScript, PDF, proprietary formats that + can be read and edited only by proprietary word processors, SGML + or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML produced by some word + processors for output purposes only. + + The "Title Page" means, for a printed book, the title page itself, + plus such following pages as are needed to hold, legibly, the + material this License requires to appear in the title page. For + works in formats which do not have any title page as such, "Title + Page" means the text near the most prominent appearance of the + work's title, preceding the beginning of the body of the text. + + 2. VERBATIM COPYING + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the + copyright notices, and the license notice saying this License + applies to the Document are reproduced in all copies, and that you + add no other conditions whatsoever to those of this License. You + may not use technical measures to obstruct or control the reading + or further copying of the copies you make or distribute. However, + you may accept compensation in exchange for copies. If you + distribute a large enough number of copies you must also follow + the conditions in section 3. + + You may also lend copies, under the same conditions stated above, + and you may publicly display copies. + + 3. COPYING IN QUANTITY + + If you publish printed copies of the Document numbering more than + 100, and the Document's license notice requires Cover Texts, you + must enclose the copies in covers that carry, clearly and legibly, + all these Cover Texts: Front-Cover Texts on the front cover, and + Back-Cover Texts on the back cover. Both covers must also clearly + and legibly identify you as the publisher of these copies. The + front cover must present the full title with all words of the + title equally prominent and visible. You may add other material + on the covers in addition. Copying with changes limited to the + covers, as long as they preserve the title of the Document and + satisfy these conditions, can be treated as verbatim copying in + other respects. + + If the required texts for either cover are too voluminous to fit + legibly, you should put the first ones listed (as many as fit + reasonably) on the actual cover, and continue the rest onto + adjacent pages. + + If you publish or distribute Opaque copies of the Document + numbering more than 100, you must either include a + machine-readable Transparent copy along with each Opaque copy, or + state in or with each Opaque copy a publicly-accessible + computer-network location containing a complete Transparent copy + of the Document, free of added material, which the general + network-using public has access to download anonymously at no + charge using public-standard network protocols. If you use the + latter option, you must take reasonably prudent steps, when you + begin distribution of Opaque copies in quantity, to ensure that + this Transparent copy will remain thus accessible at the stated + location until at least one year after the last time you + distribute an Opaque copy (directly or through your agents or + retailers) of that edition to the public. + + It is requested, but not required, that you contact the authors of + the Document well before redistributing any large number of + copies, to give them a chance to provide you with an updated + version of the Document. + + 4. MODIFICATIONS + + You may copy and distribute a Modified Version of the Document + under the conditions of sections 2 and 3 above, provided that you + release the Modified Version under precisely this License, with + the Modified Version filling the role of the Document, thus + licensing distribution and modification of the Modified Version to + whoever possesses a copy of it. In addition, you must do these + things in the Modified Version: + + A. Use in the Title Page (and on the covers, if any) a title + distinct from that of the Document, and from those of + previous versions (which should, if there were any, be listed + in the History section of the Document). You may use the + same title as a previous version if the original publisher of + that version gives permission. + + B. List on the Title Page, as authors, one or more persons or + entities responsible for authorship of the modifications in + the Modified Version, together with at least five of the + principal authors of the Document (all of its principal + authors, if it has less than five). + + C. State on the Title page the name of the publisher of the + Modified Version, as the publisher. + + D. Preserve all the copyright notices of the Document. + + E. Add an appropriate copyright notice for your modifications + adjacent to the other copyright notices. + + F. Include, immediately after the copyright notices, a license + notice giving the public permission to use the Modified + Version under the terms of this License, in the form shown in + the Addendum below. + + G. Preserve in that license notice the full lists of Invariant + Sections and required Cover Texts given in the Document's + license notice. + + H. Include an unaltered copy of this License. + + I. Preserve the section entitled "History", and its title, and + add to it an item stating at least the title, year, new + authors, and publisher of the Modified Version as given on + the Title Page. If there is no section entitled "History" in + the Document, create one stating the title, year, authors, + and publisher of the Document as given on its Title Page, + then add an item describing the Modified Version as stated in + the previous sentence. + + J. Preserve the network location, if any, given in the Document + for public access to a Transparent copy of the Document, and + likewise the network locations given in the Document for + previous versions it was based on. These may be placed in + the "History" section. You may omit a network location for a + work that was published at least four years before the + Document itself, or if the original publisher of the version + it refers to gives permission. + + K. In any section entitled "Acknowledgments" or "Dedications", + preserve the section's title, and preserve in the section all + the substance and tone of each of the contributor + acknowledgments and/or dedications given therein. + + L. Preserve all the Invariant Sections of the Document, + unaltered in their text and in their titles. Section numbers + or the equivalent are not considered part of the section + titles. + + M. Delete any section entitled "Endorsements". Such a section + may not be included in the Modified Version. + + N. Do not retitle any existing section as "Endorsements" or to + conflict in title with any Invariant Section. + + If the Modified Version includes new front-matter sections or + appendices that qualify as Secondary Sections and contain no + material copied from the Document, you may at your option + designate some or all of these sections as invariant. To do this, + add their titles to the list of Invariant Sections in the Modified + Version's license notice. These titles must be distinct from any + other section titles. + + You may add a section entitled "Endorsements", provided it contains + nothing but endorsements of your Modified Version by various + parties--for example, statements of peer review or that the text + has been approved by an organization as the authoritative + definition of a standard. + + You may add a passage of up to five words as a Front-Cover Text, + and a passage of up to 25 words as a Back-Cover Text, to the end + of the list of Cover Texts in the Modified Version. Only one + passage of Front-Cover Text and one of Back-Cover Text may be + added by (or through arrangements made by) any one entity. If the + Document already includes a cover text for the same cover, + previously added by you or by arrangement made by the same entity + you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous + publisher that added the old one. + + The author(s) and publisher(s) of the Document do not by this + License give permission to use their names for publicity for or to + assert or imply endorsement of any Modified Version. + + 5. COMBINING DOCUMENTS + + You may combine the Document with other documents released under + this License, under the terms defined in section 4 above for + modified versions, provided that you include in the combination + all of the Invariant Sections of all of the original documents, + unmodified, and list them all as Invariant Sections of your + combined work in its license notice. + + The combined work need only contain one copy of this License, and + multiple identical Invariant Sections may be replaced with a single + copy. If there are multiple Invariant Sections with the same name + but different contents, make the title of each such section unique + by adding at the end of it, in parentheses, the name of the + original author or publisher of that section if known, or else a + unique number. Make the same adjustment to the section titles in + the list of Invariant Sections in the license notice of the + combined work. + + In the combination, you must combine any sections entitled + "History" in the various original documents, forming one section + entitled "History"; likewise combine any sections entitled + "Acknowledgments", and any sections entitled "Dedications". You + must delete all sections entitled "Endorsements." + + 6. COLLECTIONS OF DOCUMENTS + + You may make a collection consisting of the Document and other + documents released under this License, and replace the individual + copies of this License in the various documents with a single copy + that is included in the collection, provided that you follow the + rules of this License for verbatim copying of each of the + documents in all other respects. + + You may extract a single document from such a collection, and + distribute it individually under this License, provided you insert + a copy of this License into the extracted document, and follow + this License in all other respects regarding verbatim copying of + that document. + + 7. AGGREGATION WITH INDEPENDENT WORKS + + A compilation of the Document or its derivatives with other + separate and independent documents or works, in or on a volume of + a storage or distribution medium, does not as a whole count as a + Modified Version of the Document, provided no compilation + copyright is claimed for the compilation. Such a compilation is + called an "aggregate", and this License does not apply to the + other self-contained works thus compiled with the Document, on + account of their being thus compiled, if they are not themselves + derivative works of the Document. + + If the Cover Text requirement of section 3 is applicable to these + copies of the Document, then if the Document is less than one + quarter of the entire aggregate, the Document's Cover Texts may be + placed on covers that surround only the Document within the + aggregate. Otherwise they must appear on covers around the whole + aggregate. + + 8. TRANSLATION + + Translation is considered a kind of modification, so you may + distribute translations of the Document under the terms of section + 4. Replacing Invariant Sections with translations requires special + permission from their copyright holders, but you may include + translations of some or all Invariant Sections in addition to the + original versions of these Invariant Sections. You may include a + translation of this License provided that you also include the + original English version of this License. In case of a + disagreement between the translation and the original English + version of this License, the original English version will prevail. + + 9. TERMINATION + + You may not copy, modify, sublicense, or distribute the Document + except as expressly provided for under this License. Any other + attempt to copy, modify, sublicense or distribute the Document is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 10. FUTURE REVISIONS OF THIS LICENSE + + The Free Software Foundation may publish new, revised versions of + the GNU Free Documentation License from time to time. Such new + versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. See + `http://www.gnu.org/copyleft/'. + + Each version of the License is given a distinguishing version + number. If the Document specifies that a particular numbered + version of this License "or any later version" applies to it, you + have the option of following the terms and conditions either of + that specified version or of any later version that has been + published (not as a draft) by the Free Software Foundation. If + the Document does not specify a version number of this License, + you may choose any version ever published (not as a draft) by the + Free Software Foundation. + + ADDENDUM: How to use this License for your documents + ==================================================== + + To use this License in a document you have written, include a copy of + the License in the document and put the following copyright and license + notices just after the title page: + + Copyright (C) YEAR YOUR NAME. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 + or any later version published by the Free Software Foundation; + with the Invariant Sections being LIST THEIR TITLES, with the + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. + A copy of the license is included in the section entitled ``GNU + Free Documentation License''. + + If you have no Invariant Sections, write "with no Invariant Sections" + instead of saying which ones are invariant. If you have no Front-Cover + Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being + LIST"; likewise for Back-Cover Texts. + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of + free software license, such as the GNU General Public License, to + permit their use in free software. + +  + File: g77.info, Node: Contributors, Next: Funding, Prev: GNU Free Documentation License, Up: Top + + Contributors to GNU Fortran + *************************** + + In addition to James Craig Burley, who wrote the front end, many + people have helped create and improve GNU Fortran. + + * The packaging and compiler portions of GNU Fortran are based + largely on the GNU CC compiler. *Note Contributors to GCC: + (gcc)Contributors, for more information. + + * The run-time library used by GNU Fortran is a repackaged version + of the `libf2c' library (combined from the `libF77' and `libI77' + libraries) provided as part of `f2c', available for free from + `netlib' sites on the Internet. + + * Cygnus Support and The Free Software Foundation contributed + significant money and/or equipment to Craig's efforts. + + * The following individuals served as alpha testers prior to `g77''s + public release. This work consisted of testing, researching, + sometimes debugging, and occasionally providing small amounts of + code and fixes for `g77', plus offering plenty of helpful advice + to Craig: + + Jonathan Corbet + + Dr. Mark Fernyhough + + Takafumi Hayashi (The University of + Aizu)-- + + Kate Hedstrom + + Michel Kern (INRIA and Rice + University)-- + + Dr. A. O. V. Le Blanc + + Dave Love + + Rick Lutowski + + Toon Moene + + Rick Niles + + Derk Reefman + + Wayne K. Schroll + + Bill Thorson + + Pedro A. M. Vazquez + + Ian Watson + + * Dave Love () wrote the libU77 part of the + run-time library. + + * Scott Snyder () provided the patch to add + rudimentary support for `INTEGER*1', `INTEGER*2', and `LOGICAL*1'. + This inspired Craig to add further support, even though the + resulting support would still be incomplete. + + * David Ronis () inspired and + encouraged Craig to rewrite the documentation in texinfo format by + contributing a first pass at a translation of the old + `g77-0.5.16/f/DOC' file. + + * Toon Moene () performed some analysis + of generated code as part of an overall project to improve `g77' + code generation to at least be as good as `f2c' used in + conjunction with `gcc'. So far, this has resulted in the three, + somewhat experimental, options added by `g77' to the `gcc' + compiler and its back end. + + (These, in turn, had made their way into the `egcs' version of the + compiler, and do not exist in `gcc' version 2.8 or versions of + `g77' based on that version of `gcc'.) + + * John Carr () wrote the alias analysis improvements. + + * Thanks to Mary Cortani and the staff at Craftwork Solutions + () for all of their support. + + * Many other individuals have helped debug, test, and improve `g77' + over the past several years, and undoubtedly more people will be + doing so in the future. If you have done so, and would like to + see your name listed in the above list, please ask! The default + is that people wish to remain anonymous. + +  + File: g77.info, Node: Funding, Next: Funding GNU Fortran, Prev: Contributors, Up: Top + + Funding Free Software + ********************* + + If you want to have more free software a few years from now, it makes + sense for you to help encourage people to contribute funds for its + development. The most effective approach known is to encourage + commercial redistributors to donate. + + Users of free software systems can boost the pace of development by + encouraging for-a-fee distributors to donate part of their selling price + to free software developers--the Free Software Foundation, and others. + + The way to convince distributors to do this is to demand it and + expect it from them. So when you compare distributors, judge them + partly by how much they give to free software development. Show + distributors they must compete to be the one who gives the most. + + To make this approach work, you must insist on numbers that you can + compare, such as, "We will donate ten dollars to the Frobnitz project + for each disk sold." Don't be satisfied with a vague promise, such as + "A portion of the profits are donated," since it doesn't give a basis + for comparison. + + Even a precise fraction "of the profits from this disk" is not very + meaningful, since creative accounting and unrelated business decisions + can greatly alter what fraction of the sales price counts as profit. + If the price you pay is $50, ten percent of the profit is probably less + than a dollar; it might be a few cents, or nothing at all. + + Some redistributors do development work themselves. This is useful + too; but to keep everyone honest, you need to inquire how much they do, + and what kind. Some kinds of development make much more long-term + difference than others. For example, maintaining a separate version of + a program contributes very little; maintaining the standard version of a + program for the whole community contributes much. Easy new ports + contribute little, since someone else would surely do them; difficult + ports such as adding a new CPU to the GNU Compiler Collection + contribute more; major new features or packages contribute the most. + + By establishing the idea that supporting further development is "the + proper thing to do" when distributing free software for a fee, we can + assure a steady flow of resources into making more free software. + + Copyright (C) 1994 Free Software Foundation, Inc. + Verbatim copying and redistribution of this section is permitted + without royalty; alteration is not permitted. + +  + File: g77.info, Node: Funding GNU Fortran, Next: Getting Started, Prev: Funding, Up: Top + + Funding GNU Fortran + ******************* + + James Craig Burley (), the original author of + `g77', stopped working on it in September 1999 (He has a web page at + `http://world.std.com/%7Eburley'.) + + GNU Fortran is currently maintained by Toon Moene + (), with the help of countless other + volunteers. + + As with other GNU software, funding is important because it can pay + for needed equipment, personnel, and so on. + + The FSF provides information on the best way to fund ongoing + development of GNU software (such as GNU Fortran) in documents such as + the "GNUS Bulletin". Email for information on funding + the FSF. + + Another important way to support work on GNU Fortran is to volunteer + to help out. + + Email to volunteer for this work. + + However, we strongly expect that there will never be a version 0.6 + of `g77'. Work on this compiler has stopped as of the release of GCC + 3.1, except for bug fixing. `g77' will be succeeded by `g95' - see + `http://g95.sourceforge.net'. + + *Note Funding Free Software: Funding, for more information. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-10 gcc-3.2.3/gcc/f/g77.info-10 *** gcc-3.2.2/gcc/f/g77.info-10 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-10 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1521 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Real Intrinsic, Next: RealPart Intrinsic, Prev: Range Intrinsic, Up: Table of Intrinsic Functions + + Real Intrinsic + .............. + + Real(A) + + Real: `REAL' function. The exact type is `REAL(KIND=1)' when argument + A is any type other than `COMPLEX', or when it is `COMPLEX(KIND=1)'. + When A is any `COMPLEX' type other than `COMPLEX(KIND=1)', this + intrinsic is valid only when used as the argument to `REAL()', as + explained below. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Converts A to `REAL(KIND=1)'. + + Use of `REAL()' with a `COMPLEX' argument (other than + `COMPLEX(KIND=1)') is restricted to the following case: + + REAL(REAL(A)) + + This expression converts the real part of A to `REAL(KIND=1)'. + + *Note RealPart Intrinsic::, for information on a GNU Fortran + intrinsic that extracts the real part of an arbitrary `COMPLEX' value. + + *Note REAL() and AIMAG() of Complex::, for more information. + +  + File: g77.info, Node: RealPart Intrinsic, Next: Rename Intrinsic (subroutine), Prev: Real Intrinsic, Up: Table of Intrinsic Functions + + RealPart Intrinsic + .................. + + RealPart(Z) + + RealPart: `REAL' function, the `KIND=' value of the type being that of + argument Z. + + Z: `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `gnu'. + + Description: + + The real part of Z is returned, without conversion. + + _Note:_ The way to do this in standard Fortran 90 is `REAL(Z)'. + However, when, for example, Z is `COMPLEX(KIND=2)', `REAL(Z)' means + something different for some compilers that are not true Fortran 90 + compilers but offer some extensions standardized by Fortran 90 (such as + the `DOUBLE COMPLEX' type, also known as `COMPLEX(KIND=2)'). + + The advantage of `REALPART()' is that, while not necessarily more or + less portable than `REAL()', it is more likely to cause a compiler that + doesn't support it to produce a diagnostic than generate incorrect code. + + *Note REAL() and AIMAG() of Complex::, for more information. + +  + File: g77.info, Node: Rename Intrinsic (subroutine), Next: Repeat Intrinsic, Prev: RealPart Intrinsic, Up: Table of Intrinsic Functions + + Rename Intrinsic (subroutine) + ............................. + + CALL Rename(PATH1, PATH2, STATUS) + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Renames the file PATH1 to PATH2. A null character (`CHAR(0)') marks + the end of the names in PATH1 and PATH2--otherwise, trailing blanks in + PATH1 and PATH2 are ignored. See `rename(2)'. If the STATUS argument + is supplied, it contains 0 on success or a non-zero error code upon + return. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note Rename + Intrinsic (function)::. + +  + File: g77.info, Node: Repeat Intrinsic, Next: Reshape Intrinsic, Prev: Rename Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Repeat Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Repeat' to use this name for an + external procedure. + +  + File: g77.info, Node: Reshape Intrinsic, Next: RRSpacing Intrinsic, Prev: Repeat Intrinsic, Up: Table of Intrinsic Functions + + Reshape Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Reshape' to use this name for + an external procedure. + +  + File: g77.info, Node: RRSpacing Intrinsic, Next: RShift Intrinsic, Prev: Reshape Intrinsic, Up: Table of Intrinsic Functions + + RRSpacing Intrinsic + ................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL RRSpacing' to use this name + for an external procedure. + +  + File: g77.info, Node: RShift Intrinsic, Next: Scale Intrinsic, Prev: RRSpacing Intrinsic, Up: Table of Intrinsic Functions + + RShift Intrinsic + ................ + + RShift(I, SHIFT) + + RShift: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + SHIFT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Returns I shifted to the right SHIFT bits. + + Although similar to the expression `I/(2**SHIFT)', there are + important differences. For example, the sign of the result is + undefined. + + Currently this intrinsic is defined assuming the underlying + representation of I is as a two's-complement integer. It is unclear at + this point whether that definition will apply when a different + representation is involved. + + *Note RShift Intrinsic::, for the inverse of this function. + + *Note IShft Intrinsic::, for information on a more widely available + right-shifting intrinsic that is also more precisely defined. + +  + File: g77.info, Node: Scale Intrinsic, Next: Scan Intrinsic, Prev: RShift Intrinsic, Up: Table of Intrinsic Functions + + Scale Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Scale' to use this name for an + external procedure. + +  + File: g77.info, Node: Scan Intrinsic, Next: Second Intrinsic (function), Prev: Scale Intrinsic, Up: Table of Intrinsic Functions + + Scan Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Scan' to use this name for an + external procedure. + +  + File: g77.info, Node: Second Intrinsic (function), Next: Second Intrinsic (subroutine), Prev: Scan Intrinsic, Up: Table of Intrinsic Functions + + Second Intrinsic (function) + ........................... + + Second() + + Second: `REAL(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the process's runtime in seconds--the same value as the UNIX + function `etime' returns. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + For information on other intrinsics with the same name: *Note Second + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Second Intrinsic (subroutine), Next: Selected_Int_Kind Intrinsic, Prev: Second Intrinsic (function), Up: Table of Intrinsic Functions + + Second Intrinsic (subroutine) + ............................. + + CALL Second(SECONDS) + + SECONDS: `REAL'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Returns the process's runtime in seconds in SECONDS--the same value + as the UNIX function `etime' returns. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + This routine is known from Cray Fortran. *Note CPU_Time Intrinsic::, + for a standard equivalent. + + For information on other intrinsics with the same name: *Note Second + Intrinsic (function)::. + +  + File: g77.info, Node: Selected_Int_Kind Intrinsic, Next: Selected_Real_Kind Intrinsic, Prev: Second Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Selected_Int_Kind Intrinsic + ........................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Selected_Int_Kind' to use this + name for an external procedure. + +  + File: g77.info, Node: Selected_Real_Kind Intrinsic, Next: Set_Exponent Intrinsic, Prev: Selected_Int_Kind Intrinsic, Up: Table of Intrinsic Functions + + Selected_Real_Kind Intrinsic + ............................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Selected_Real_Kind' to use + this name for an external procedure. + +  + File: g77.info, Node: Set_Exponent Intrinsic, Next: Shape Intrinsic, Prev: Selected_Real_Kind Intrinsic, Up: Table of Intrinsic Functions + + Set_Exponent Intrinsic + ...................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Set_Exponent' to use this name + for an external procedure. + +  + File: g77.info, Node: Shape Intrinsic, Next: Short Intrinsic, Prev: Set_Exponent Intrinsic, Up: Table of Intrinsic Functions + + Shape Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Shape' to use this name for an + external procedure. + +  + File: g77.info, Node: Short Intrinsic, Next: Sign Intrinsic, Prev: Shape Intrinsic, Up: Table of Intrinsic Functions + + Short Intrinsic + ............... + + Short(A) + + Short: `INTEGER(KIND=6)' function. + + A: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns A with the fractional portion of its magnitude truncated and + its sign preserved, converted to type `INTEGER(KIND=6)'. + + If A is type `COMPLEX', its real part is truncated and converted, + and its imaginary part is disgregarded. + + *Note Int Intrinsic::. + + The precise meaning of this intrinsic might change in a future + version of the GNU Fortran language, as more is learned about how it is + used. + +  + File: g77.info, Node: Sign Intrinsic, Next: Signal Intrinsic (subroutine), Prev: Short Intrinsic, Up: Table of Intrinsic Functions + + Sign Intrinsic + .............. + + Sign(A, B) + + Sign: `INTEGER' or `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + A: `INTEGER' or `REAL'; scalar; INTENT(IN). + + B: `INTEGER' or `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `ABS(A)*S', where S is +1 if `B.GE.0', -1 otherwise. + + *Note Abs Intrinsic::, for the function that returns the magnitude + of a value. + +  + File: g77.info, Node: Signal Intrinsic (subroutine), Next: Sin Intrinsic, Prev: Sign Intrinsic, Up: Table of Intrinsic Functions + + Signal Intrinsic (subroutine) + ............................. + + CALL Signal(NUMBER, HANDLER, STATUS) + + NUMBER: `INTEGER'; scalar; INTENT(IN). + + HANDLER: Signal handler (`INTEGER FUNCTION' or `SUBROUTINE') or + dummy/global `INTEGER(KIND=1)' scalar. + + STATUS: `INTEGER(KIND=7)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + If HANDLER is a an `EXTERNAL' routine, arranges for it to be invoked + with a single integer argument (of system-dependent length) when signal + NUMBER occurs. If HANDLER is an integer, it can be used to turn off + handling of signal NUMBER or revert to its default action. See + `signal(2)'. + + Note that HANDLER will be called using C conventions, so the value + of its argument in Fortran terms Fortran terms is obtained by applying + `%LOC()' (or LOC()) to it. + + The value returned by `signal(2)' is written to STATUS, if that + argument is supplied. Otherwise the return value is ignored. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + _Warning:_ Use of the `libf2c' run-time library function `signal_' + directly (such as via `EXTERNAL SIGNAL') requires use of the `%VAL()' + construct to pass an `INTEGER' value (such as `SIG_IGN' or `SIG_DFL') + for the HANDLER argument. + + However, while `CALL SIGNAL(SIGNUM, %VAL(SIG_IGN))' works when + `SIGNAL' is treated as an external procedure (and resolves, at link + time, to `libf2c''s `signal_' routine), this construct is not valid + when `SIGNAL' is recognized as the intrinsic of that name. + + Therefore, for maximum portability and reliability, code such + references to the `SIGNAL' facility as follows: + + INTRINSIC SIGNAL + ... + CALL SIGNAL(SIGNUM, SIG_IGN) + + `g77' will compile such a call correctly, while other compilers will + generally either do so as well or reject the `INTRINSIC SIGNAL' + statement via a diagnostic, allowing you to take appropriate action. + + For information on other intrinsics with the same name: *Note Signal + Intrinsic (function)::. + +  + File: g77.info, Node: Sin Intrinsic, Next: SinH Intrinsic, Prev: Signal Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Sin Intrinsic + ............. + + Sin(X) + + Sin: `REAL' or `COMPLEX' function, the exact type being that of + argument X. + + X: `REAL' or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the sine of X, an angle measured in radians. + + *Note ASin Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: SinH Intrinsic, Next: Sleep Intrinsic, Prev: Sin Intrinsic, Up: Table of Intrinsic Functions + + SinH Intrinsic + .............. + + SinH(X) + + SinH: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the hyperbolic sine of X. + +  + File: g77.info, Node: Sleep Intrinsic, Next: Sngl Intrinsic, Prev: SinH Intrinsic, Up: Table of Intrinsic Functions + + Sleep Intrinsic + ............... + + CALL Sleep(SECONDS) + + SECONDS: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Causes the process to pause for SECONDS seconds. See `sleep(2)'. + +  + File: g77.info, Node: Sngl Intrinsic, Next: Spacing Intrinsic, Prev: Sleep Intrinsic, Up: Table of Intrinsic Functions + + Sngl Intrinsic + .............. + + Sngl(A) + + Sngl: `REAL(KIND=1)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `REAL()' that is specific to one type for A. *Note + Real Intrinsic::. + +  + File: g77.info, Node: Spacing Intrinsic, Next: Spread Intrinsic, Prev: Sngl Intrinsic, Up: Table of Intrinsic Functions + + Spacing Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Spacing' to use this name for + an external procedure. + +  + File: g77.info, Node: Spread Intrinsic, Next: SqRt Intrinsic, Prev: Spacing Intrinsic, Up: Table of Intrinsic Functions + + Spread Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Spread' to use this name for an + external procedure. + +  + File: g77.info, Node: SqRt Intrinsic, Next: SRand Intrinsic, Prev: Spread Intrinsic, Up: Table of Intrinsic Functions + + SqRt Intrinsic + .............. + + SqRt(X) + + SqRt: `REAL' or `COMPLEX' function, the exact type being that of + argument X. + + X: `REAL' or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the square root of X, which must not be negative. + + To calculate and represent the square root of a negative number, + complex arithmetic must be used. For example, `SQRT(COMPLEX(X))'. + + The inverse of this function is `SQRT(X) * SQRT(X)'. + +  + File: g77.info, Node: SRand Intrinsic, Next: Stat Intrinsic (subroutine), Prev: SqRt Intrinsic, Up: Table of Intrinsic Functions + + SRand Intrinsic + ............... + + CALL SRand(SEED) + + SEED: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Reinitialises the generator with the seed in SEED. *Note IRand + Intrinsic::. *Note Rand Intrinsic::. + +  + File: g77.info, Node: Stat Intrinsic (subroutine), Next: Stat Intrinsic (function), Prev: SRand Intrinsic, Up: Table of Intrinsic Functions + + Stat Intrinsic (subroutine) + ........................... + + CALL Stat(FILE, SARRAY, STATUS) + + FILE: `CHARACTER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the given file FILE and places them in the array + SARRAY. A null character (`CHAR(0)') marks the end of the name in + FILE--otherwise, trailing blanks in FILE are ignored. The values in + this array are extracted from the `stat' structure as returned by + `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + If the STATUS argument is supplied, it contains 0 on success or a + non-zero error code upon return. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note Stat + Intrinsic (function)::. + +  + File: g77.info, Node: Stat Intrinsic (function), Next: Sum Intrinsic, Prev: Stat Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Stat Intrinsic (function) + ......................... + + Stat(FILE, SARRAY) + + Stat: `INTEGER(KIND=1)' function. + + FILE: `CHARACTER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the given file FILE and places them in the array + SARRAY. A null character (`CHAR(0)') marks the end of the name in + FILE--otherwise, trailing blanks in FILE are ignored. The values in + this array are extracted from the `stat' structure as returned by + `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + Returns 0 on success or a non-zero error code. + + For information on other intrinsics with the same name: *Note Stat + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Sum Intrinsic, Next: SymLnk Intrinsic (subroutine), Prev: Stat Intrinsic (function), Up: Table of Intrinsic Functions + + Sum Intrinsic + ............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Sum' to use this name for an + external procedure. + +  + File: g77.info, Node: SymLnk Intrinsic (subroutine), Next: System Intrinsic (subroutine), Prev: Sum Intrinsic, Up: Table of Intrinsic Functions + + SymLnk Intrinsic (subroutine) + ............................. + + CALL SymLnk(PATH1, PATH2, STATUS) + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Makes a symbolic link from file PATH1 to PATH2. A null character + (`CHAR(0)') marks the end of the names in PATH1 and PATH2--otherwise, + trailing blanks in PATH1 and PATH2 are ignored. If the STATUS argument + is supplied, it contains 0 on success or a non-zero error code upon + return (`ENOSYS' if the system does not provide `symlink(2)'). + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note SymLnk + Intrinsic (function)::. + +  + File: g77.info, Node: System Intrinsic (subroutine), Next: System_Clock Intrinsic, Prev: SymLnk Intrinsic (subroutine), Up: Table of Intrinsic Functions + + System Intrinsic (subroutine) + ............................. + + CALL System(COMMAND, STATUS) + + COMMAND: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Passes the command COMMAND to a shell (see `system(3)'). If + argument STATUS is present, it contains the value returned by + `system(3)', presumably 0 if the shell command succeeded. Note that + which shell is used to invoke the command is system-dependent and + environment-dependent. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note System + Intrinsic (function)::. + +  + File: g77.info, Node: System_Clock Intrinsic, Next: Tan Intrinsic, Prev: System Intrinsic (subroutine), Up: Table of Intrinsic Functions + + System_Clock Intrinsic + ...................... + + CALL System_Clock(COUNT, RATE, MAX) + + COUNT: `INTEGER(KIND=1)'; scalar; INTENT(OUT). + + RATE: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + MAX: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `f90'. + + Description: + + Returns in COUNT the current value of the system clock; this is the + value returned by the UNIX function `times(2)' in this implementation, + but isn't in general. RATE is the number of clock ticks per second and + MAX is the maximum value this can take, which isn't very useful in this + implementation since it's just the maximum C `unsigned int' value. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + +  + File: g77.info, Node: Tan Intrinsic, Next: TanH Intrinsic, Prev: System_Clock Intrinsic, Up: Table of Intrinsic Functions + + Tan Intrinsic + ............. + + Tan(X) + + Tan: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the tangent of X, an angle measured in radians. + + *Note ATan Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: TanH Intrinsic, Next: Time Intrinsic (UNIX), Prev: Tan Intrinsic, Up: Table of Intrinsic Functions + + TanH Intrinsic + .............. + + TanH(X) + + TanH: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the hyperbolic tangent of X. + +  + File: g77.info, Node: Time Intrinsic (UNIX), Next: Time8 Intrinsic, Prev: TanH Intrinsic, Up: Table of Intrinsic Functions + + Time Intrinsic (UNIX) + ..................... + + Time() + + Time: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the current time encoded as an integer (in the manner of the + UNIX function `time(3)'). This value is suitable for passing to + `CTIME', `GMTIME', and `LTIME'. + + This intrinsic is not fully portable, such as to systems with 32-bit + `INTEGER' types but supporting times wider than 32 bits. Therefore, + the values returned by this intrinsic might be, or become, negative, or + numerically less than previous values, during a single run of the + compiled program. + + *Note Time8 Intrinsic::, for information on a similar intrinsic that + might be portable to more GNU Fortran implementations, though to fewer + Fortran compilers. + + For information on other intrinsics with the same name: *Note Time + Intrinsic (VXT)::. + +  + File: g77.info, Node: Time8 Intrinsic, Next: Tiny Intrinsic, Prev: Time Intrinsic (UNIX), Up: Table of Intrinsic Functions + + Time8 Intrinsic + ............... + + Time8() + + Time8: `INTEGER(KIND=2)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the current time encoded as a long integer (in the manner of + the UNIX function `time(3)'). This value is suitable for passing to + `CTIME', `GMTIME', and `LTIME'. + + _Warning:_ this intrinsic does not increase the range of the timing + values over that returned by `time(3)'. On a system with a 32-bit + `time(3)', `TIME8' will return a 32-bit value, even though converted to + an `INTEGER(KIND=2)' value. That means overflows of the 32-bit value + can still occur. Therefore, the values returned by this intrinsic + might be, or become, negative, or numerically less than previous values, + during a single run of the compiled program. + + No Fortran implementations other than GNU Fortran are known to + support this intrinsic at the time of this writing. *Note Time + Intrinsic (UNIX)::, for information on a similar intrinsic that might + be portable to more Fortran compilers, though to fewer GNU Fortran + implementations. + +  + File: g77.info, Node: Tiny Intrinsic, Next: Transfer Intrinsic, Prev: Time8 Intrinsic, Up: Table of Intrinsic Functions + + Tiny Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Tiny' to use this name for an + external procedure. + +  + File: g77.info, Node: Transfer Intrinsic, Next: Transpose Intrinsic, Prev: Tiny Intrinsic, Up: Table of Intrinsic Functions + + Transfer Intrinsic + .................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Transfer' to use this name for + an external procedure. + +  + File: g77.info, Node: Transpose Intrinsic, Next: Trim Intrinsic, Prev: Transfer Intrinsic, Up: Table of Intrinsic Functions + + Transpose Intrinsic + ................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Transpose' to use this name + for an external procedure. + +  + File: g77.info, Node: Trim Intrinsic, Next: TtyNam Intrinsic (subroutine), Prev: Transpose Intrinsic, Up: Table of Intrinsic Functions + + Trim Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Trim' to use this name for an + external procedure. + +  + File: g77.info, Node: TtyNam Intrinsic (subroutine), Next: TtyNam Intrinsic (function), Prev: Trim Intrinsic, Up: Table of Intrinsic Functions + + TtyNam Intrinsic (subroutine) + ............................. + + CALL TtyNam(UNIT, NAME) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + NAME: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets NAME to the name of the terminal device open on logical unit + UNIT or to a blank string if UNIT is not connected to a terminal. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note TtyNam + Intrinsic (function)::. + +  + File: g77.info, Node: TtyNam Intrinsic (function), Next: UBound Intrinsic, Prev: TtyNam Intrinsic (subroutine), Up: Table of Intrinsic Functions + + TtyNam Intrinsic (function) + ........................... + + TtyNam(UNIT) + + TtyNam: `CHARACTER*(*)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the name of the terminal device open on logical unit UNIT or + a blank string if UNIT is not connected to a terminal. + + For information on other intrinsics with the same name: *Note TtyNam + Intrinsic (subroutine)::. + +  + File: g77.info, Node: UBound Intrinsic, Next: UMask Intrinsic (subroutine), Prev: TtyNam Intrinsic (function), Up: Table of Intrinsic Functions + + UBound Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL UBound' to use this name for an + external procedure. + +  + File: g77.info, Node: UMask Intrinsic (subroutine), Next: Unlink Intrinsic (subroutine), Prev: UBound Intrinsic, Up: Table of Intrinsic Functions + + UMask Intrinsic (subroutine) + ............................ + + CALL UMask(MASK, OLD) + + MASK: `INTEGER'; scalar; INTENT(IN). + + OLD: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets the file creation mask to MASK and returns the old value in + argument OLD if it is supplied. See `umask(2)'. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note UMask + Intrinsic (function)::. + +  + File: g77.info, Node: Unlink Intrinsic (subroutine), Next: Unpack Intrinsic, Prev: UMask Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Unlink Intrinsic (subroutine) + ............................. + + CALL Unlink(FILE, STATUS) + + FILE: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Unlink the file FILE. A null character (`CHAR(0)') marks the end of + the name in FILE--otherwise, trailing blanks in FILE are ignored. If + the STATUS argument is supplied, it contains 0 on success or a non-zero + error code upon return. See `unlink(2)'. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note Unlink + Intrinsic (function)::. + +  + File: g77.info, Node: Unpack Intrinsic, Next: Verify Intrinsic, Prev: Unlink Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Unpack Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Unpack' to use this name for an + external procedure. + +  + File: g77.info, Node: Verify Intrinsic, Next: XOr Intrinsic, Prev: Unpack Intrinsic, Up: Table of Intrinsic Functions + + Verify Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Verify' to use this name for an + external procedure. + +  + File: g77.info, Node: XOr Intrinsic, Next: ZAbs Intrinsic, Prev: Verify Intrinsic, Up: Table of Intrinsic Functions + + XOr Intrinsic + ............. + + XOr(I, J) + + XOr: `INTEGER' or `LOGICAL' function, the exact type being the result + of cross-promoting the types of all the arguments. + + I: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + J: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Returns value resulting from boolean exclusive-OR of pair of bits in + each of I and J. + +  + File: g77.info, Node: ZAbs Intrinsic, Next: ZCos Intrinsic, Prev: XOr Intrinsic, Up: Table of Intrinsic Functions + + ZAbs Intrinsic + .............. + + ZAbs(A) + + ZAbs: `REAL(KIND=2)' function. + + A: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `ABS()' that is specific to one type for A. *Note + Abs Intrinsic::. + +  + File: g77.info, Node: ZCos Intrinsic, Next: ZExp Intrinsic, Prev: ZAbs Intrinsic, Up: Table of Intrinsic Functions + + ZCos Intrinsic + .............. + + ZCos(X) + + ZCos: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `COS()' that is specific to one type for X. *Note + Cos Intrinsic::. + +  + File: g77.info, Node: ZExp Intrinsic, Next: ZLog Intrinsic, Prev: ZCos Intrinsic, Up: Table of Intrinsic Functions + + ZExp Intrinsic + .............. + + ZExp(X) + + ZExp: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `EXP()' that is specific to one type for X. *Note + Exp Intrinsic::. + +  + File: g77.info, Node: ZLog Intrinsic, Next: ZSin Intrinsic, Prev: ZExp Intrinsic, Up: Table of Intrinsic Functions + + ZLog Intrinsic + .............. + + ZLog(X) + + ZLog: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `LOG()' that is specific to one type for X. *Note + Log Intrinsic::. + +  + File: g77.info, Node: ZSin Intrinsic, Next: ZSqRt Intrinsic, Prev: ZLog Intrinsic, Up: Table of Intrinsic Functions + + ZSin Intrinsic + .............. + + ZSin(X) + + ZSin: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `SIN()' that is specific to one type for X. *Note + Sin Intrinsic::. + +  + File: g77.info, Node: ZSqRt Intrinsic, Prev: ZSin Intrinsic, Up: Table of Intrinsic Functions + + ZSqRt Intrinsic + ............... + + ZSqRt(X) + + ZSqRt: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Archaic form of `SQRT()' that is specific to one type for X. *Note + SqRt Intrinsic::. + +  + File: g77.info, Node: Scope and Classes of Names, Next: I/O, Prev: Functions and Subroutines, Up: Language + + Scope and Classes of Symbolic Names + =================================== + + (The following information augments or overrides the information in + Chapter 18 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 18 of that document otherwise serves as the basis + for the relevant aspects of GNU Fortran.) + + * Menu: + + * Underscores in Symbol Names:: + +  + File: g77.info, Node: Underscores in Symbol Names, Up: Scope and Classes of Names + + Underscores in Symbol Names + --------------------------- + + Underscores (`_') are accepted in symbol names after the first + character (which must be a letter). + +  + File: g77.info, Node: I/O, Next: Fortran 90 Features, Prev: Scope and Classes of Names, Up: Language + + I/O + === + + A dollar sign at the end of an output format specification suppresses + the newline at the end of the output. + + Edit descriptors in `FORMAT' statements may contain compile-time + `INTEGER' constant expressions in angle brackets, such as + 10 FORMAT (I) + + The `OPEN' specifier `NAME=' is equivalent to `FILE='. + + These Fortran 90 features are supported: + * The `O' and `Z' edit descriptors are supported for I/O of integers + in octal and hexadecimal formats, respectively. + + * The `FILE=' specifier may be omitted in an `OPEN' statement if + `STATUS='SCRATCH'' is supplied. The `STATUS='REPLACE'' specifier + is supported. + +  + File: g77.info, Node: Fortran 90 Features, Prev: I/O, Up: Language + + Fortran 90 Features + =================== + + For convenience this section collects a list (probably incomplete) of + the Fortran 90 features supported by the GNU Fortran language, even if + they are documented elsewhere. *Note Characters, Lines, and Execution + Sequence: Characters Lines Sequence, for information on additional + fixed source form lexical issues. Further, the free source form is + supported through the `-ffree-form' option. Other Fortran 90 features + can be turned on by the `-ff90' option; see *Note Fortran 90::. For + information on the Fortran 90 intrinsics available, see *Note Table of + Intrinsic Functions::. + + Automatic arrays in procedures + + Character assignments + In character assignments, the variable being assigned may occur on + the right hand side of the assignment. + + Character strings + Strings may have zero length and substrings of character constants + are permitted. Character constants may be enclosed in double + quotes (`"') as well as single quotes. *Note Character Type::. + + Construct names + (Symbolic tags on blocks.) *Note Construct Names::. + + `CYCLE' and `EXIT' + *Note The `CYCLE' and `EXIT' Statements: CYCLE and EXIT. + + `DOUBLE COMPLEX' + *Note `DOUBLE COMPLEX' Statement: DOUBLE COMPLEX. + + `DO WHILE' + *Note DO WHILE::. + + `END' decoration + *Note Statements::. + + `END DO' + *Note END DO::. + + `KIND' + + `IMPLICIT NONE' + + `INCLUDE' statements + *Note INCLUDE::. + + List-directed and namelist I/O on internal files + + Binary, octal and hexadecimal constants + These are supported more generally than required by Fortran 90. + *Note Integer Type::. + + `O' and `Z' edit descriptors + + `NAMELIST' + *Note NAMELIST::. + + `OPEN' specifiers + `STATUS='REPLACE'' is supported. The `FILE=' specifier may be + omitted in an `OPEN' statement if `STATUS='SCRATCH'' is supplied. + + `FORMAT' edit descriptors + The `Z' edit descriptor is supported. + + Relational operators + The operators `<', `<=', `==', `/=', `>' and `>=' may be used + instead of `.LT.', `.LE.', `.EQ.', `.NE.', `.GT.' and `.GE.' + respectively. + + `SELECT CASE' + Not fully implemented. *Note `SELECT CASE' on `CHARACTER' Type: + SELECT CASE on CHARACTER Type. + + Specification statements + A limited subset of the Fortran 90 syntax and semantics for + variable declarations is supported, including `KIND'. *Note Kind + Notation::. (`KIND' is of limited usefulness in the absence of the + `KIND'-related intrinsics, since these intrinsics permit writing + more widely portable code.) An example of supported `KIND' usage + is: + INTEGER (KIND=1) :: FOO=1, BAR=2 + CHARACTER (LEN=3) FOO + `PARAMETER' and `DIMENSION' attributes aren't supported. + +  + File: g77.info, Node: Other Dialects, Next: Other Compilers, Prev: Compiler, Up: Top + + Other Dialects + ************** + + GNU Fortran supports a variety of features that are not considered + part of the GNU Fortran language itself, but are representative of + various dialects of Fortran that `g77' supports in whole or in part. + + Any of the features listed below might be disallowed by `g77' unless + some command-line option is specified. Currently, some of the features + are accepted using the default invocation of `g77', but that might + change in the future. + + _Note: This portion of the documentation definitely needs a lot of + work!_ + + * Menu: + + * Source Form:: Details of fixed-form and free-form source. + * Trailing Comment:: Use of `/*' to start a comment. + * Debug Line:: Use of `D' in column 1. + * Dollar Signs:: Use of `$' in symbolic names. + * Case Sensitivity:: Uppercase and lowercase in source files. + * VXT Fortran:: ...versus the GNU Fortran language. + * Fortran 90:: ...versus the GNU Fortran language. + * Pedantic Compilation:: Enforcing the standard. + * Distensions:: Misfeatures supported by GNU Fortran. + +  + File: g77.info, Node: Source Form, Next: Trailing Comment, Up: Other Dialects + + Source Form + =========== + + GNU Fortran accepts programs written in either fixed form or free + form. + + Fixed form corresponds to ANSI FORTRAN 77 (plus popular extensions, + such as allowing tabs) and Fortran 90's fixed form. + + Free form corresponds to Fortran 90's free form (though possibly not + entirely up-to-date, and without complaining about some things that for + which Fortran 90 requires diagnostics, such as the spaces in the + constant in `R = 3 . 1'). + + The way a Fortran compiler views source files depends entirely on the + implementation choices made for the compiler, since those choices are + explicitly left to the implementation by the published Fortran + standards. GNU Fortran currently tries to be somewhat like a few + popular compilers (`f2c', Digital ("DEC") Fortran, and so on). + + This section describes how `g77' interprets source lines. + + * Menu: + + * Carriage Returns:: Carriage returns ignored. + * Tabs:: Tabs converted to spaces. + * Short Lines:: Short lines padded with spaces (fixed-form only). + * Long Lines:: Long lines truncated. + * Ampersands:: Special Continuation Lines. + +  + File: g77.info, Node: Carriage Returns, Next: Tabs, Up: Source Form + + Carriage Returns + ---------------- + + Carriage returns (`\r') in source lines are ignored. This is + somewhat different from `f2c', which seems to treat them as spaces + outside character/Hollerith constants, and encodes them as `\r' inside + such constants. + +  + File: g77.info, Node: Tabs, Next: Short Lines, Prev: Carriage Returns, Up: Source Form + + Tabs + ---- + + A source line with a character anywhere in it is treated as + entirely significant--however long it is--instead of ending in column + 72 (for fixed-form source) or 132 (for free-form source). This also is + different from `f2c', which encodes tabs as `\t' (the ASCII + character) inside character and Hollerith constants, but nevertheless + seems to treat the column position as if it had been affected by the + canonical tab positioning. + + `g77' effectively translates tabs to the appropriate number of + spaces (a la the default for the UNIX `expand' command) before doing + any other processing, other than (currently) noting whether a tab was + found on a line and using this information to decide how to interpret + the length of the line and continued constants. + +  + File: g77.info, Node: Short Lines, Next: Long Lines, Prev: Tabs, Up: Source Form + + Short Lines + ----------- + + Source lines shorter than the applicable fixed-form length are + treated as if they were padded with spaces to that length. (None of + this is relevant to source files written in free form.) + + This affects only continued character and Hollerith constants, and + is a different interpretation than provided by some other popular + compilers (although a bit more consistent with the traditional + punched-card basis of Fortran and the way the Fortran standard + expressed fixed source form). + + `g77' might someday offer an option to warn about cases where + differences might be seen as a result of this treatment, and perhaps an + option to specify the alternate behavior as well. + + Note that this padding cannot apply to lines that are effectively of + infinite length--such lines are specified using command-line options + like `-ffixed-line-length-none', for example. + +  + File: g77.info, Node: Long Lines, Next: Ampersands, Prev: Short Lines, Up: Source Form + + Long Lines + ---------- + + Source lines longer than the applicable length are truncated to that + length. Currently, `g77' does not warn if the truncated characters are + not spaces, to accommodate existing code written for systems that + treated truncated text as commentary (especially in columns 73 through + 80). + + *Note Options Controlling Fortran Dialect: Fortran Dialect Options, + for information on the `-ffixed-line-length-N' option, which can be + used to set the line length applicable to fixed-form source files. + +  + File: g77.info, Node: Ampersands, Prev: Long Lines, Up: Source Form + + Ampersand Continuation Line + --------------------------- + + A `&' in column 1 of fixed-form source denotes an arbitrary-length + continuation line, imitating the behavior of `f2c'. + +  + File: g77.info, Node: Trailing Comment, Next: Debug Line, Prev: Source Form, Up: Other Dialects + + Trailing Comment + ================ + + `g77' supports use of `/*' to start a trailing comment. In the GNU + Fortran language, `!' is used for this purpose. + + `/*' is not in the GNU Fortran language because the use of `/*' in a + program might suggest to some readers that a block, not trailing, + comment is started (and thus ended by `*/', not end of line), since + that is the meaning of `/*' in C. + + Also, such readers might think they can use `//' to start a trailing + comment as an alternative to `/*', but `//' already denotes + concatenation, and such a "comment" might actually result in a program + that compiles without error (though it would likely behave incorrectly). + +  + File: g77.info, Node: Debug Line, Next: Dollar Signs, Prev: Trailing Comment, Up: Other Dialects + + Debug Line + ========== + + Use of `D' or `d' as the first character (column 1) of a source line + denotes a debug line. + + In turn, a debug line is treated as either a comment line or a + normal line, depending on whether debug lines are enabled. + + When treated as a comment line, a line beginning with `D' or `d' is + treated as if it the first character was `C' or `c', respectively. + When treated as a normal line, such a line is treated as if the first + character was (space). + + (Currently, `g77' provides no means for treating debug lines as + normal lines.) + +  + File: g77.info, Node: Dollar Signs, Next: Case Sensitivity, Prev: Debug Line, Up: Other Dialects + + Dollar Signs in Symbol Names + ============================ + + Dollar signs (`$') are allowed in symbol names (after the first + character) when the `-fdollar-ok' option is specified. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-11 gcc-3.2.3/gcc/f/g77.info-11 *** gcc-3.2.2/gcc/f/g77.info-11 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-11 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1317 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Case Sensitivity, Next: VXT Fortran, Prev: Dollar Signs, Up: Other Dialects + + Case Sensitivity + ================ + + GNU Fortran offers the programmer way too much flexibility in + deciding how source files are to be treated vis-a-vis uppercase and + lowercase characters. There are 66 useful settings that affect case + sensitivity, plus 10 settings that are nearly useless, with the + remaining 116 settings being either redundant or useless. + + None of these settings have any effect on the contents of comments + (the text after a `c' or `C' in Column 1, for example) or of character + or Hollerith constants. Note that things like the `E' in the statement + `CALL FOO(3.2E10)' and the `TO' in `ASSIGN 10 TO LAB' are considered + built-in keywords, and so are affected by these settings. + + Low-level switches are identified in this section as follows: + + A Source Case Conversion: + + 0 Preserve (see Note 1) + + 1 Convert to Upper Case + + 2 Convert to Lower Case + + B Built-in Keyword Matching: + + 0 Match Any Case (per-character basis) + + 1 Match Upper Case Only + + 2 Match Lower Case Only + + 3 Match InitialCaps Only (see tables for spellings) + + C Built-in Intrinsic Matching: + + 0 Match Any Case (per-character basis) + + 1 Match Upper Case Only + + 2 Match Lower Case Only + + 3 Match InitialCaps Only (see tables for spellings) + + D User-defined Symbol Possibilities (warnings only): + + 0 Allow Any Case (per-character basis) + + 1 Allow Upper Case Only + + 2 Allow Lower Case Only + + 3 Allow InitialCaps Only (see Note 2) + + Note 1: `g77' eventually will support `NAMELIST' in a manner that is + consistent with these source switches--in the sense that input will be + expected to meet the same requirements as source code in terms of + matching symbol names and keywords (for the exponent letters). + + Currently, however, `NAMELIST' is supported by `libg2c', which + uppercases `NAMELIST' input and symbol names for matching. This means + not only that `NAMELIST' output currently shows symbol (and keyword) + names in uppercase even if lower-case source conversion (option A2) is + selected, but that `NAMELIST' cannot be adequately supported when + source case preservation (option A0) is selected. + + If A0 is selected, a warning message will be output for each + `NAMELIST' statement to this effect. The behavior of the program is + undefined at run time if two or more symbol names appear in a given + `NAMELIST' such that the names are identical when converted to upper + case (e.g. `NAMELIST /X/ VAR, Var, var'). For complete and total + elegance, perhaps there should be a warning when option A2 is selected, + since the output of NAMELIST is currently in uppercase but will someday + be lowercase (when a `libg77' is written), but that seems to be + overkill for a product in beta test. + + Note 2: Rules for InitialCaps names are: + + - Must be a single uppercase letter, *or* + + - Must start with an uppercase letter and contain at least one + lowercase letter. + + So `A', `Ab', `ABc', `AbC', and `Abc' are valid InitialCaps names, + but `AB', `A2', and `ABC' are not. Note that most, but not all, + built-in names meet these requirements--the exceptions are some of the + two-letter format specifiers, such as `BN' and `BZ'. + + Here are the names of the corresponding command-line options: + + A0: -fsource-case-preserve + A1: -fsource-case-upper + A2: -fsource-case-lower + + B0: -fmatch-case-any + B1: -fmatch-case-upper + B2: -fmatch-case-lower + B3: -fmatch-case-initcap + + C0: -fintrin-case-any + C1: -fintrin-case-upper + C2: -fintrin-case-lower + C3: -fintrin-case-initcap + + D0: -fsymbol-case-any + D1: -fsymbol-case-upper + D2: -fsymbol-case-lower + D3: -fsymbol-case-initcap + + Useful combinations of the above settings, along with abbreviated + option names that set some of these combinations all at once: + + 1: A0-- B0--- C0--- D0--- -fcase-preserve + 2: A0-- B0--- C0--- D-1-- + 3: A0-- B0--- C0--- D--2- + 4: A0-- B0--- C0--- D---3 + 5: A0-- B0--- C-1-- D0--- + 6: A0-- B0--- C-1-- D-1-- + 7: A0-- B0--- C-1-- D--2- + 8: A0-- B0--- C-1-- D---3 + 9: A0-- B0--- C--2- D0--- + 10: A0-- B0--- C--2- D-1-- + 11: A0-- B0--- C--2- D--2- + 12: A0-- B0--- C--2- D---3 + 13: A0-- B0--- C---3 D0--- + 14: A0-- B0--- C---3 D-1-- + 15: A0-- B0--- C---3 D--2- + 16: A0-- B0--- C---3 D---3 + 17: A0-- B-1-- C0--- D0--- + 18: A0-- B-1-- C0--- D-1-- + 19: A0-- B-1-- C0--- D--2- + 20: A0-- B-1-- C0--- D---3 + 21: A0-- B-1-- C-1-- D0--- + 22: A0-- B-1-- C-1-- D-1-- -fcase-strict-upper + 23: A0-- B-1-- C-1-- D--2- + 24: A0-- B-1-- C-1-- D---3 + 25: A0-- B-1-- C--2- D0--- + 26: A0-- B-1-- C--2- D-1-- + 27: A0-- B-1-- C--2- D--2- + 28: A0-- B-1-- C--2- D---3 + 29: A0-- B-1-- C---3 D0--- + 30: A0-- B-1-- C---3 D-1-- + 31: A0-- B-1-- C---3 D--2- + 32: A0-- B-1-- C---3 D---3 + 33: A0-- B--2- C0--- D0--- + 34: A0-- B--2- C0--- D-1-- + 35: A0-- B--2- C0--- D--2- + 36: A0-- B--2- C0--- D---3 + 37: A0-- B--2- C-1-- D0--- + 38: A0-- B--2- C-1-- D-1-- + 39: A0-- B--2- C-1-- D--2- + 40: A0-- B--2- C-1-- D---3 + 41: A0-- B--2- C--2- D0--- + 42: A0-- B--2- C--2- D-1-- + 43: A0-- B--2- C--2- D--2- -fcase-strict-lower + 44: A0-- B--2- C--2- D---3 + 45: A0-- B--2- C---3 D0--- + 46: A0-- B--2- C---3 D-1-- + 47: A0-- B--2- C---3 D--2- + 48: A0-- B--2- C---3 D---3 + 49: A0-- B---3 C0--- D0--- + 50: A0-- B---3 C0--- D-1-- + 51: A0-- B---3 C0--- D--2- + 52: A0-- B---3 C0--- D---3 + 53: A0-- B---3 C-1-- D0--- + 54: A0-- B---3 C-1-- D-1-- + 55: A0-- B---3 C-1-- D--2- + 56: A0-- B---3 C-1-- D---3 + 57: A0-- B---3 C--2- D0--- + 58: A0-- B---3 C--2- D-1-- + 59: A0-- B---3 C--2- D--2- + 60: A0-- B---3 C--2- D---3 + 61: A0-- B---3 C---3 D0--- + 62: A0-- B---3 C---3 D-1-- + 63: A0-- B---3 C---3 D--2- + 64: A0-- B---3 C---3 D---3 -fcase-initcap + 65: A-1- B01-- C01-- D01-- -fcase-upper + 66: A--2 B0-2- C0-2- D0-2- -fcase-lower + + Number 22 is the "strict" ANSI FORTRAN 77 model wherein all input + (except comments, character constants, and Hollerith strings) must be + entered in uppercase. Use `-fcase-strict-upper' to specify this + combination. + + Number 43 is like Number 22 except all input must be lowercase. Use + `-fcase-strict-lower' to specify this combination. + + Number 65 is the "classic" ANSI FORTRAN 77 model as implemented on + many non-UNIX machines whereby all the source is translated to + uppercase. Use `-fcase-upper' to specify this combination. + + Number 66 is the "canonical" UNIX model whereby all the source is + translated to lowercase. Use `-fcase-lower' to specify this + combination. + + There are a few nearly useless combinations: + + 67: A-1- B01-- C01-- D--2- + 68: A-1- B01-- C01-- D---3 + 69: A-1- B01-- C--23 D01-- + 70: A-1- B01-- C--23 D--2- + 71: A-1- B01-- C--23 D---3 + 72: A--2 B01-- C0-2- D-1-- + 73: A--2 B01-- C0-2- D---3 + 74: A--2 B01-- C-1-3 D0-2- + 75: A--2 B01-- C-1-3 D-1-- + 76: A--2 B01-- C-1-3 D---3 + + The above allow some programs to be compiled but with restrictions + that make most useful programs impossible: Numbers 67 and 72 warn about + _any_ user-defined symbol names (such as `SUBROUTINE FOO'); Numbers 68 + and 73 warn about any user-defined symbol names longer than one + character that don't have at least one non-alphabetic character after + the first; Numbers 69 and 74 disallow any references to intrinsics; and + Numbers 70, 71, 75, and 76 are combinations of the restrictions in + 67+69, 68+69, 72+74, and 73+74, respectively. + + All redundant combinations are shown in the above tables anyplace + where more than one setting is shown for a low-level switch. For + example, `B0-2-' means either setting 0 or 2 is valid for switch B. + The "proper" setting in such a case is the one that copies the setting + of switch A--any other setting might slightly reduce the speed of the + compiler, though possibly to an unmeasurable extent. + + All remaining combinations are useless in that they prevent + successful compilation of non-null source files (source files with + something other than comments). + +  + File: g77.info, Node: VXT Fortran, Next: Fortran 90, Prev: Case Sensitivity, Up: Other Dialects + + VXT Fortran + =========== + + `g77' supports certain constructs that have different meanings in + VXT Fortran than they do in the GNU Fortran language. + + Generally, this manual uses the invented term VXT Fortran to refer + VAX FORTRAN (circa v4). That compiler offered many popular features, + though not necessarily those that are specific to the VAX processor + architecture, the VMS operating system, or Digital Equipment + Corporation's Fortran product line. (VAX and VMS probably are + trademarks of Digital Equipment Corporation.) + + An extension offered by a Digital Fortran product that also is + offered by several other Fortran products for different kinds of + systems is probably going to be considered for inclusion in `g77' + someday, and is considered a VXT Fortran feature. + + The `-fvxt' option generally specifies that, where the meaning of a + construct is ambiguous (means one thing in GNU Fortran and another in + VXT Fortran), the VXT Fortran meaning is to be assumed. + + * Menu: + + * Double Quote Meaning:: `"2000' as octal constant. + * Exclamation Point:: `!' in column 6. + +  + File: g77.info, Node: Double Quote Meaning, Next: Exclamation Point, Up: VXT Fortran + + Meaning of Double Quote + ----------------------- + + `g77' treats double-quote (`"') as beginning an octal constant of + `INTEGER(KIND=1)' type when the `-fvxt' option is specified. The form + of this octal constant is + + "OCTAL-DIGITS + + where OCTAL-DIGITS is a nonempty string of characters in the set + `01234567'. + + For example, the `-fvxt' option permits this: + + PRINT *, "20 + END + + The above program would print the value `16'. + + *Note Integer Type::, for information on the preferred construct for + integer constants specified using GNU Fortran's octal notation. + + (In the GNU Fortran language, the double-quote character (`"') + delimits a character constant just as does apostrophe (`''). There is + no way to allow both constructs in the general case, since statements + like `PRINT *,"2000 !comment?"' would be ambiguous.) + +  + File: g77.info, Node: Exclamation Point, Prev: Double Quote Meaning, Up: VXT Fortran + + Meaning of Exclamation Point in Column 6 + ---------------------------------------- + + `g77' treats an exclamation point (`!') in column 6 of a fixed-form + source file as a continuation character rather than as the beginning of + a comment (as it does in any other column) when the `-fvxt' option is + specified. + + The following program, when run, prints a message indicating whether + it is interpreted according to GNU Fortran (and Fortran 90) rules or + VXT Fortran rules: + + C234567 (This line begins in column 1.) + I = 0 + !1 + IF (I.EQ.0) PRINT *, ' I am a VXT Fortran program' + IF (I.EQ.1) PRINT *, ' I am a Fortran 90 program' + IF (I.LT.0 .OR. I.GT.1) PRINT *, ' I am a HAL 9000 computer' + END + + (In the GNU Fortran and Fortran 90 languages, exclamation point is a + valid character and, unlike space () or zero (`0'), marks a line + as a continuation line when it appears in column 6.) + +  + File: g77.info, Node: Fortran 90, Next: Pedantic Compilation, Prev: VXT Fortran, Up: Other Dialects + + Fortran 90 + ========== + + The GNU Fortran language includes a number of features that are part + of Fortran 90, even when the `-ff90' option is not specified. The + features enabled by `-ff90' are intended to be those that, when `-ff90' + is not specified, would have another meaning to `g77'--usually meaning + something invalid in the GNU Fortran language. + + So, the purpose of `-ff90' is not to specify whether `g77' is to + gratuitously reject Fortran 90 constructs. The `-pedantic' option + specified with `-fno-f90' is intended to do that, although its + implementation is certainly incomplete at this point. + + When `-ff90' is specified: + + * The type of `REAL(EXPR)' and `AIMAG(EXPR)', where EXPR is + `COMPLEX' type, is the same type as the real part of EXPR. + + For example, assuming `Z' is type `COMPLEX(KIND=2)', `REAL(Z)' + would return a value of type `REAL(KIND=2)', not of type + `REAL(KIND=1)', since `-ff90' is specified. + +  + File: g77.info, Node: Pedantic Compilation, Next: Distensions, Prev: Fortran 90, Up: Other Dialects + + Pedantic Compilation + ==================== + + The `-fpedantic' command-line option specifies that `g77' is to warn + about code that is not standard-conforming. This is useful for finding + some extensions `g77' accepts that other compilers might not accept. + (Note that the `-pedantic' and `-pedantic-errors' options always imply + `-fpedantic'.) + + With `-fno-f90' in force, ANSI FORTRAN 77 is used as the standard + for conforming code. With `-ff90' in force, Fortran 90 is used. + + The constructs for which `g77' issues diagnostics when `-fpedantic' + and `-fno-f90' are in force are: + + * Automatic arrays, as in + + SUBROUTINE X(N) + REAL A(N) + ... + + where `A' is not listed in any `ENTRY' statement, and thus is not + a dummy argument. + + * The commas in `READ (5), I' and `WRITE (10), J'. + + These commas are disallowed by FORTRAN 77, but, while strictly + superfluous, are syntactically elegant, especially given that + commas are required in statements such as `READ 99, I' and `PRINT + *, J'. Many compilers permit the superfluous commas for this + reason. + + * `DOUBLE COMPLEX', either explicitly or implicitly. + + An explicit use of this type is via a `DOUBLE COMPLEX' or + `IMPLICIT DOUBLE COMPLEX' statement, for examples. + + An example of an implicit use is the expression `C*D', where `C' + is `COMPLEX(KIND=1)' and `D' is `DOUBLE PRECISION'. This + expression is prohibited by ANSI FORTRAN 77 because the rules of + promotion would suggest that it produce a `DOUBLE COMPLEX' + result--a type not provided for by that standard. + + * Automatic conversion of numeric expressions to `INTEGER(KIND=1)' + in contexts such as: + + - Array-reference indexes. + + - Alternate-return values. + + - Computed `GOTO'. + + - `FORMAT' run-time expressions (not yet supported). + + - Dimension lists in specification statements. + + - Numbers for I/O statements (such as `READ (UNIT=3.2), I') + + - Sizes of `CHARACTER' entities in specification statements. + + - Kind types in specification entities (a Fortran 90 feature). + + - Initial, terminal, and incrementation parameters for + implied-`DO' constructs in `DATA' statements. + + * Automatic conversion of `LOGICAL' expressions to `INTEGER' in + contexts such as arithmetic `IF' (where `COMPLEX' expressions are + disallowed anyway). + + * Zero-size array dimensions, as in: + + INTEGER I(10,20,4:2) + + * Zero-length `CHARACTER' entities, as in: + + PRINT *, '' + + * Substring operators applied to character constants and named + constants, as in: + + PRINT *, 'hello'(3:5) + + * Null arguments passed to statement function, as in: + + PRINT *, FOO(,3) + + * Disagreement among program units regarding whether a given `COMMON' + area is `SAVE'd (for targets where program units in a single source + file are "glued" together as they typically are for UNIX + development environments). + + * Disagreement among program units regarding the size of a named + `COMMON' block. + + * Specification statements following first `DATA' statement. + + (In the GNU Fortran language, `DATA I/1/' may be followed by + `INTEGER J', but not `INTEGER I'. The `-fpedantic' option + disallows both of these.) + + * Semicolon as statement separator, as in: + + CALL FOO; CALL BAR + + * Use of `&' in column 1 of fixed-form source (to indicate + continuation). + + * Use of `CHARACTER' constants to initialize numeric entities, and + vice versa. + + * Expressions having two arithmetic operators in a row, such as + `X*-Y'. + + If `-fpedantic' is specified along with `-ff90', the following + constructs result in diagnostics: + + * Use of semicolon as a statement separator on a line that has an + `INCLUDE' directive. + +  + File: g77.info, Node: Distensions, Prev: Pedantic Compilation, Up: Other Dialects + + Distensions + =========== + + The `-fugly-*' command-line options determine whether certain + features supported by VAX FORTRAN and other such compilers, but + considered too ugly to be in code that can be changed to use safer + and/or more portable constructs, are accepted. These are humorously + referred to as "distensions", extensions that just plain look ugly in + the harsh light of day. + + * Menu: + + * Ugly Implicit Argument Conversion:: Disabled via `-fno-ugly-args'. + * Ugly Assumed-Size Arrays:: Enabled via `-fugly-assumed'. + * Ugly Null Arguments:: Enabled via `-fugly-comma'. + * Ugly Complex Part Extraction:: Enabled via `-fugly-complex'. + * Ugly Conversion of Initializers:: Disabled via `-fno-ugly-init'. + * Ugly Integer Conversions:: Enabled via `-fugly-logint'. + * Ugly Assigned Labels:: Enabled via `-fugly-assign'. + +  + File: g77.info, Node: Ugly Implicit Argument Conversion, Next: Ugly Assumed-Size Arrays, Up: Distensions + + Implicit Argument Conversion + ---------------------------- + + The `-fno-ugly-args' option disables passing typeless and Hollerith + constants as actual arguments in procedure invocations. For example: + + CALL FOO(4HABCD) + CALL BAR('123'O) + + These constructs can be too easily used to create non-portable code, + but are not considered as "ugly" as others. Further, they are widely + used in existing Fortran source code in ways that often are quite + portable. Therefore, they are enabled by default. + +  + File: g77.info, Node: Ugly Assumed-Size Arrays, Next: Ugly Null Arguments, Prev: Ugly Implicit Argument Conversion, Up: Distensions + + Ugly Assumed-Size Arrays + ------------------------ + + The `-fugly-assumed' option enables the treatment of any array with + a final dimension specified as `1' as an assumed-size array, as if `*' + had been specified instead. + + For example, `DIMENSION X(1)' is treated as if it had read + `DIMENSION X(*)' if `X' is listed as a dummy argument in a preceding + `SUBROUTINE', `FUNCTION', or `ENTRY' statement in the same program unit. + + Use an explicit lower bound to avoid this interpretation. For + example, `DIMENSION X(1:1)' is never treated as if it had read + `DIMENSION X(*)' or `DIMENSION X(1:*)'. Nor is `DIMENSION X(2-1)' + affected by this option, since that kind of expression is unlikely to + have been intended to designate an assumed-size array. + + This option is used to prevent warnings being issued about apparent + out-of-bounds reference such as `X(2) = 99'. + + It also prevents the array from being used in contexts that disallow + assumed-size arrays, such as `PRINT *,X'. In such cases, a diagnostic + is generated and the source file is not compiled. + + The construct affected by this option is used only in old code that + pre-exists the widespread acceptance of adjustable and assumed-size + arrays in the Fortran community. + + _Note:_ This option does not affect how `DIMENSION X(1)' is treated + if `X' is listed as a dummy argument only _after_ the `DIMENSION' + statement (presumably in an `ENTRY' statement). For example, + `-fugly-assumed' has no effect on the following program unit: + + SUBROUTINE X + REAL A(1) + RETURN + ENTRY Y(A) + PRINT *, A + END + +  + File: g77.info, Node: Ugly Complex Part Extraction, Next: Ugly Conversion of Initializers, Prev: Ugly Null Arguments, Up: Distensions + + Ugly Complex Part Extraction + ---------------------------- + + The `-fugly-complex' option enables use of the `REAL()' and `AIMAG()' + intrinsics with arguments that are `COMPLEX' types other than + `COMPLEX(KIND=1)'. + + With `-ff90' in effect, these intrinsics return the unconverted real + and imaginary parts (respectively) of their argument. + + With `-fno-f90' in effect, these intrinsics convert the real and + imaginary parts to `REAL(KIND=1)', and return the result of that + conversion. + + Due to this ambiguity, the GNU Fortran language defines these + constructs as invalid, except in the specific case where they are + entirely and solely passed as an argument to an invocation of the + `REAL()' intrinsic. For example, + + REAL(REAL(Z)) + + is permitted even when `Z' is `COMPLEX(KIND=2)' and `-fno-ugly-complex' + is in effect, because the meaning is clear. + + `g77' enforces this restriction, unless `-fugly-complex' is + specified, in which case the appropriate interpretation is chosen and + no diagnostic is issued. + + *Note CMPAMBIG::, for information on how to cope with existing code + with unclear expectations of `REAL()' and `AIMAG()' with + `COMPLEX(KIND=2)' arguments. + + *Note RealPart Intrinsic::, for information on the `REALPART()' + intrinsic, used to extract the real part of a complex expression + without conversion. *Note ImagPart Intrinsic::, for information on the + `IMAGPART()' intrinsic, used to extract the imaginary part of a complex + expression without conversion. + +  + File: g77.info, Node: Ugly Null Arguments, Next: Ugly Complex Part Extraction, Prev: Ugly Assumed-Size Arrays, Up: Distensions + + Ugly Null Arguments + ------------------- + + The `-fugly-comma' option enables use of a single trailing comma to + mean "pass an extra trailing null argument" in a list of actual + arguments to an external procedure, and use of an empty list of + arguments to such a procedure to mean "pass a single null argument". + + (Null arguments often are used in some procedure-calling schemes to + indicate omitted arguments.) + + For example, `CALL FOO(,)' means "pass two null arguments", rather + than "pass one null argument". Also, `CALL BAR()' means "pass one null + argument". + + This construct is considered "ugly" because it does not provide an + elegant way to pass a single null argument that is syntactically + distinct from passing no arguments. That is, this construct changes + the meaning of code that makes no use of the construct. + + So, with `-fugly-comma' in force, `CALL FOO()' and `I = JFUNC()' + pass a single null argument, instead of passing no arguments as + required by the Fortran 77 and 90 standards. + + _Note:_ Many systems gracefully allow the case where a procedure + call passes one extra argument that the called procedure does not + expect. + + So, in practice, there might be no difference in the behavior of a + program that does `CALL FOO()' or `I = JFUNC()' and is compiled with + `-fugly-comma' in force as compared to its behavior when compiled with + the default, `-fno-ugly-comma', in force, assuming `FOO' and `JFUNC' do + not expect any arguments to be passed. + +  + File: g77.info, Node: Ugly Conversion of Initializers, Next: Ugly Integer Conversions, Prev: Ugly Complex Part Extraction, Up: Distensions + + Ugly Conversion of Initializers + ------------------------------- + + The constructs disabled by `-fno-ugly-init' are: + + * Use of Hollerith and typeless constants in contexts where they set + initial (compile-time) values for variables, arrays, and named + constants--that is, `DATA' and `PARAMETER' statements, plus + type-declaration statements specifying initial values. + + Here are some sample initializations that are disabled by the + `-fno-ugly-init' option: + + PARAMETER (VAL='9A304FFE'X) + REAL*8 STRING/8HOUTPUT00/ + DATA VAR/4HABCD/ + + * In the same contexts as above, use of character constants to + initialize numeric items and vice versa (one constant per item). + + Here are more sample initializations that are disabled by the + `-fno-ugly-init' option: + + INTEGER IA + CHARACTER BELL + PARAMETER (IA = 'A') + PARAMETER (BELL = 7) + + * Use of Hollerith and typeless constants on the right-hand side of + assignment statements to numeric types, and in other contexts + (such as passing arguments in invocations of intrinsic procedures + and statement functions) that are treated as assignments to known + types (the dummy arguments, in these cases). + + Here are sample statements that are disabled by the + `-fno-ugly-init' option: + + IVAR = 4HABCD + PRINT *, IMAX0(2HAB, 2HBA) + + The above constructs, when used, can tend to result in non-portable + code. But, they are widely used in existing Fortran code in ways that + often are quite portable. Therefore, they are enabled by default. + +  + File: g77.info, Node: Ugly Integer Conversions, Next: Ugly Assigned Labels, Prev: Ugly Conversion of Initializers, Up: Distensions + + Ugly Integer Conversions + ------------------------ + + The constructs enabled via `-fugly-logint' are: + + * Automatic conversion between `INTEGER' and `LOGICAL' as dictated by + context (typically implies nonportable dependencies on how a + particular implementation encodes `.TRUE.' and `.FALSE.'). + + * Use of a `LOGICAL' variable in `ASSIGN' and assigned-`GOTO' + statements. + + The above constructs are disabled by default because use of them + tends to lead to non-portable code. Even existing Fortran code that + uses that often turns out to be non-portable, if not outright buggy. + + Some of this is due to differences among implementations as far as + how `.TRUE.' and `.FALSE.' are encoded as `INTEGER' values--Fortran + code that assumes a particular coding is likely to use one of the above + constructs, and is also likely to not work correctly on implementations + using different encodings. + + *Note Equivalence Versus Equality::, for more information. + +  + File: g77.info, Node: Ugly Assigned Labels, Prev: Ugly Integer Conversions, Up: Distensions + + Ugly Assigned Labels + -------------------- + + The `-fugly-assign' option forces `g77' to use the same storage for + assigned labels as it would for a normal assignment to the same + variable. + + For example, consider the following code fragment: + + I = 3 + ASSIGN 10 TO I + + Normally, for portability and improved diagnostics, `g77' reserves + distinct storage for a "sibling" of `I', used only for `ASSIGN' + statements to that variable (along with the corresponding + assigned-`GOTO' and assigned-`FORMAT'-I/O statements that reference the + variable). + + However, some code (that violates the ANSI FORTRAN 77 standard) + attempts to copy assigned labels among variables involved with `ASSIGN' + statements, as in: + + ASSIGN 10 TO I + ISTATE(5) = I + ... + J = ISTATE(ICUR) + GOTO J + + Such code doesn't work under `g77' unless `-fugly-assign' is specified + on the command-line, ensuring that the value of `I' referenced in the + second line is whatever value `g77' uses to designate statement label + `10', so the value may be copied into the `ISTATE' array, later + retrieved into a variable of the appropriate type (`J'), and used as + the target of an assigned-`GOTO' statement. + + _Note:_ To avoid subtle program bugs, when `-fugly-assign' is + specified, `g77' requires the type of variables specified in + assigned-label contexts _must_ be the same type returned by `%LOC()'. + On many systems, this type is effectively the same as + `INTEGER(KIND=1)', while, on others, it is effectively the same as + `INTEGER(KIND=2)'. + + Do _not_ depend on `g77' actually writing valid pointers to these + variables, however. While `g77' currently chooses that implementation, + it might be changed in the future. + + *Note Assigned Statement Labels (ASSIGN and GOTO): Assigned + Statement Labels, for implementation details on assigned-statement + labels. + +  + File: g77.info, Node: Compiler, Next: Other Dialects, Prev: Language, Up: Top + + The GNU Fortran Compiler + ************************ + + The GNU Fortran compiler, `g77', supports programs written in the + GNU Fortran language and in some other dialects of Fortran. + + Some aspects of how `g77' works are universal regardless of dialect, + and yet are not properly part of the GNU Fortran language itself. + These are described below. + + _Note: This portion of the documentation definitely needs a lot of + work!_ + + * Menu: + + * Compiler Limits:: + * Run-time Environment Limits:: + * Compiler Types:: + * Compiler Constants:: + * Compiler Intrinsics:: + +  + File: g77.info, Node: Compiler Limits, Next: Run-time Environment Limits, Up: Compiler + + Compiler Limits + =============== + + `g77', as with GNU tools in general, imposes few arbitrary + restrictions on lengths of identifiers, number of continuation lines, + number of external symbols in a program, and so on. + + For example, some other Fortran compiler have an option (such as + `-NlX') to increase the limit on the number of continuation lines. + Also, some Fortran compilation systems have an option (such as `-NxX') + to increase the limit on the number of external symbols. + + `g77', `gcc', and GNU `ld' (the GNU linker) have no equivalent + options, since they do not impose arbitrary limits in these areas. + + `g77' does currently limit the number of dimensions in an array to + the same degree as do the Fortran standards--seven (7). This + restriction might be lifted in a future version. + +  + File: g77.info, Node: Run-time Environment Limits, Next: Compiler Types, Prev: Compiler Limits, Up: Compiler + + Run-time Environment Limits + =========================== + + As a portable Fortran implementation, `g77' offers its users direct + access to, and otherwise depends upon, the underlying facilities of the + system used to build `g77', the system on which `g77' itself is used to + compile programs, and the system on which the `g77'-compiled program is + actually run. (For most users, the three systems are of the same + type--combination of operating environment and hardware--often the same + physical system.) + + The run-time environment for a particular system inevitably imposes + some limits on a program's use of various system facilities. These + limits vary from system to system. + + Even when such limits might be well beyond the possibility of being + encountered on a particular system, the `g77' run-time environment has + certain built-in limits, usually, but not always, stemming from + intrinsics with inherently limited interfaces. + + Currently, the `g77' run-time environment does not generally offer a + less-limiting environment by augmenting the underlying system's own + environment. + + Therefore, code written in the GNU Fortran language, while + syntactically and semantically portable, might nevertheless make + non-portable assumptions about the run-time environment--assumptions + that prove to be false for some particular environments. + + The GNU Fortran language, the `g77' compiler and run-time + environment, and the `g77' documentation do not yet offer comprehensive + portable work-arounds for such limits, though programmers should be + able to find their own in specific instances. + + Not all of the limitations are described in this document. Some of + the known limitations include: + + * Menu: + + * Timer Wraparounds:: + * Year 2000 (Y2K) Problems:: + * Array Size:: + * Character-variable Length:: + * Year 10000 (Y10K) Problems:: + +  + File: g77.info, Node: Timer Wraparounds, Next: Year 2000 (Y2K) Problems, Up: Run-time Environment Limits + + Timer Wraparounds + ----------------- + + Intrinsics that return values computed from system timers, whether + elapsed (wall-clock) timers, process CPU timers, or other kinds of + timers, are prone to experiencing wrap-around errors (or returning + wrapped-around values from successive calls) due to insufficient ranges + offered by the underlying system's timers. + + Some of the symptoms of such behaviors include apparently negative + time being computed for a duration, an extremely short amount of time + being computed for a long duration, and an extremely long amount of + time being computed for a short duration. + + See the following for intrinsics known to have potential problems in + these areas on at least some systems: *Note CPU_Time Intrinsic::, *Note + DTime Intrinsic (function)::, *Note DTime Intrinsic (subroutine)::, + *Note ETime Intrinsic (function)::, *Note ETime Intrinsic + (subroutine)::, *Note MClock Intrinsic::, *Note MClock8 Intrinsic::, + *Note Secnds Intrinsic::, *Note Second Intrinsic (function)::, *Note + Second Intrinsic (subroutine)::, *Note System_Clock Intrinsic::, *Note + Time Intrinsic (UNIX)::, *Note Time Intrinsic (VXT)::, *Note Time8 + Intrinsic::. + +  + File: g77.info, Node: Year 2000 (Y2K) Problems, Next: Array Size, Prev: Timer Wraparounds, Up: Run-time Environment Limits + + Year 2000 (Y2K) Problems + ------------------------ + + While the `g77' compiler itself is believed to be Year-2000 (Y2K) + compliant, some intrinsics are not, and, potentially, some underlying + systems are not, perhaps rendering some Y2K-compliant intrinsics + non-compliant when used on those particular systems. + + Fortran code that uses non-Y2K-compliant intrinsics (listed below) + is, itself, almost certainly not compliant, and should be modified to + use Y2K-compliant intrinsics instead. + + Fortran code that uses no non-Y2K-compliant intrinsics, but which + currently is running on a non-Y2K-compliant system, can be made more + Y2K compliant by compiling and linking it for use on a new + Y2K-compliant system, such as a new version of an old, + non-Y2K-compliant, system. + + Currently, information on Y2K and related issues is being maintained + at `http://www.gnu.org/software/year2000-list.html'. + + See the following for intrinsics known to have potential problems in + these areas on at least some systems: *Note Date Intrinsic::, *Note + IDate Intrinsic (VXT)::. + + The `libg2c' library shipped with any `g77' that warns about + invocation of a non-Y2K-compliant intrinsic has renamed the `EXTERNAL' + procedure names of those intrinsics. This is done so that the `libg2c' + implementations of these intrinsics cannot be directly linked to as + `EXTERNAL' names (which normally would avoid the non-Y2K-intrinsic + warning). + + The renamed forms of the `EXTERNAL' names of these renamed procedures + may be linked to by appending the string `_y2kbug' to the name of the + procedure in the source code. For example: + + CHARACTER*20 STR + INTEGER YY, MM, DD + EXTERNAL DATE_Y2KBUG, VXTIDATE_Y2KBUG + CALL DATE_Y2KBUG (STR) + CALL VXTIDATE_Y2KBUG (MM, DD, YY) + + (Note that the `EXTERNAL' statement is not actually required, since + the modified names are not recognized as intrinsics by the current + version of `g77'. But it is shown in this specific case, for purposes + of illustration.) + + The renaming of `EXTERNAL' procedure names of these intrinsics + causes unresolved references at link time. For example, `EXTERNAL + DATE; CALL DATE(STR)' is normally compiled by `g77' as, in C, + `date_(&str, 20);'. This, in turn, links to the `date_' procedure in + the `libE77' portion of `libg2c', which purposely calls a nonexistent + procedure named `G77_date_y2kbuggy_0'. The resulting link-time error + is designed, via this name, to encourage the programmer to look up the + index entries to this portion of the `g77' documentation. + + Generally, we recommend that the `EXTERNAL' method of invoking + procedures in `libg2c' _not_ be used. When used, some of the + correctness checking normally performed by `g77' is skipped. + + In particular, it is probably better to use the `INTRINSIC' method + of invoking non-Y2K-compliant procedures, so anyone compiling the code + can quickly notice the potential Y2K problems (via the warnings + printing by `g77') without having to even look at the code itself. + + If there are problems linking `libg2c' to code compiled by `g77' + that involve the string `y2kbug', and these are not explained above, + that probably indicates that a version of `libg2c' older than `g77' is + being linked to, or that the new library is being linked to code + compiled by an older version of `g77'. + + That's because, as of the version that warns about non-Y2K-compliant + intrinsic invocation, `g77' references the `libg2c' implementations of + those intrinsics using new names, containing the string `y2kbug'. + + So, linking newly-compiled code (invoking one of the intrinsics in + question) to an old library might yield an unresolved reference to + `G77_date_y2kbug_0'. (The old library calls it `G77_date_0'.) + + Similarly, linking previously-compiled code to a new library might + yield an unresolved reference to `G77_vxtidate_0'. (The new library + calls it `G77_vxtidate_y2kbug_0'.) + + The proper fix for the above problems is to obtain the latest + release of `g77' and related products (including `libg2c') and install + them on all systems, then recompile, relink, and install (as + appropriate) all existing Fortran programs. + + (Normally, this sort of renaming is steadfastly avoided. In this + case, however, it seems more important to highlight potential Y2K + problems than to ease the transition of potentially non-Y2K-compliant + code to new versions of `g77' and `libg2c'.) + +  + File: g77.info, Node: Array Size, Next: Character-variable Length, Prev: Year 2000 (Y2K) Problems, Up: Run-time Environment Limits + + Array Size + ---------- + + Currently, `g77' uses the default `INTEGER' type for array indexes, + which limits the sizes of single-dimension arrays on systems offering a + larger address space than can be addressed by that type. (That `g77' + puts all arrays in memory could be considered another limitation--it + could use large temporary files--but that decision is left to the + programmer as an implementation choice by most Fortran implementations.) + + It is not yet clear whether this limitation never, sometimes, or + always applies to the sizes of multiple-dimension arrays as a whole. + + For example, on a system with 64-bit addresses and 32-bit default + `INTEGER', an array with a size greater than can be addressed by a + 32-bit offset can be declared using multiple dimensions. Such an array + is therefore larger than a single-dimension array can be, on the same + system. + + Whether large multiple-dimension arrays are reliably supported + depends mostly on the `gcc' back end (code generator) used by `g77', + and has not yet been fully investigated. + +  + File: g77.info, Node: Character-variable Length, Next: Year 10000 (Y10K) Problems, Prev: Array Size, Up: Run-time Environment Limits + + Character-variable Length + ------------------------- + + Currently, `g77' uses the default `INTEGER' type for the lengths of + `CHARACTER' variables and array elements. + + This means that, for example, a system with a 64-bit address space + and a 32-bit default `INTEGER' type does not, under `g77', support a + `CHARACTER*N' declaration where N is greater than 2147483647. + +  + File: g77.info, Node: Year 10000 (Y10K) Problems, Prev: Character-variable Length, Up: Run-time Environment Limits + + Year 10000 (Y10K) Problems + -------------------------- + + Most intrinsics returning, or computing values based on, date + information are prone to Year-10000 (Y10K) problems, due to supporting + only 4 digits for the year. + + See the following for examples: *Note FDate Intrinsic (function)::, + *Note FDate Intrinsic (subroutine)::, *Note IDate Intrinsic (UNIX)::, + *Note Time Intrinsic (VXT)::, *Note Date_and_Time Intrinsic::. + +  + File: g77.info, Node: Compiler Types, Next: Compiler Constants, Prev: Run-time Environment Limits, Up: Compiler + + Compiler Types + ============== + + Fortran implementations have a fair amount of freedom given them by + the standard as far as how much storage space is used and how much + precision and range is offered by the various types such as + `LOGICAL(KIND=1)', `INTEGER(KIND=1)', `REAL(KIND=1)', `REAL(KIND=2)', + `COMPLEX(KIND=1)', and `CHARACTER'. Further, many compilers offer + so-called `*N' notation, but the interpretation of N varies across + compilers and target architectures. + + The standard requires that `LOGICAL(KIND=1)', `INTEGER(KIND=1)', and + `REAL(KIND=1)' occupy the same amount of storage space, and that + `COMPLEX(KIND=1)' and `REAL(KIND=2)' take twice as much storage space + as `REAL(KIND=1)'. Further, it requires that `COMPLEX(KIND=1)' + entities be ordered such that when a `COMPLEX(KIND=1)' variable is + storage-associated (such as via `EQUIVALENCE') with a two-element + `REAL(KIND=1)' array named `R', `R(1)' corresponds to the real element + and `R(2)' to the imaginary element of the `COMPLEX(KIND=1)' variable. + + (Few requirements as to precision or ranges of any of these are + placed on the implementation, nor is the relationship of storage sizes + of these types to the `CHARACTER' type specified, by the standard.) + + `g77' follows the above requirements, warning when compiling a + program requires placement of items in memory that contradict the + requirements of the target architecture. (For example, a program can + require placement of a `REAL(KIND=2)' on a boundary that is not an even + multiple of its size, but still an even multiple of the size of a + `REAL(KIND=1)' variable. On some target architectures, using the + canonical mapping of Fortran types to underlying architectural types, + such placement is prohibited by the machine definition or the + Application Binary Interface (ABI) in force for the configuration + defined for building `gcc' and `g77'. `g77' warns about such + situations when it encounters them.) + + `g77' follows consistent rules for configuring the mapping between + Fortran types, including the `*N' notation, and the underlying + architectural types as accessed by a similarly-configured applicable + version of the `gcc' compiler. These rules offer a widely portable, + consistent Fortran/C environment, although they might well conflict + with the expectations of users of Fortran compilers designed and + written for particular architectures. + + These rules are based on the configuration that is in force for the + version of `gcc' built in the same release as `g77' (and which was + therefore used to build both the `g77' compiler components and the + `libg2c' run-time library): + + `REAL(KIND=1)' + Same as `float' type. + + `REAL(KIND=2)' + Same as whatever floating-point type that is twice the size of a + `float'--usually, this is a `double'. + + `INTEGER(KIND=1)' + Same as an integral type that is occupies the same amount of + memory storage as `float'--usually, this is either an `int' or a + `long int'. + + `LOGICAL(KIND=1)' + Same `gcc' type as `INTEGER(KIND=1)'. + + `INTEGER(KIND=2)' + Twice the size, and usually nearly twice the range, as + `INTEGER(KIND=1)'--usually, this is either a `long int' or a `long + long int'. + + `LOGICAL(KIND=2)' + Same `gcc' type as `INTEGER(KIND=2)'. + + `INTEGER(KIND=3)' + Same `gcc' type as signed `char'. + + `LOGICAL(KIND=3)' + Same `gcc' type as `INTEGER(KIND=3)'. + + `INTEGER(KIND=6)' + Twice the size, and usually nearly twice the range, as + `INTEGER(KIND=3)'--usually, this is a `short'. + + `LOGICAL(KIND=6)' + Same `gcc' type as `INTEGER(KIND=6)'. + + `COMPLEX(KIND=1)' + Two `REAL(KIND=1)' scalars (one for the real part followed by one + for the imaginary part). + + `COMPLEX(KIND=2)' + Two `REAL(KIND=2)' scalars. + + `NUMERIC-TYPE*N' + (Where NUMERIC-TYPE is any type other than `CHARACTER'.) Same as + whatever `gcc' type occupies N times the storage space of a `gcc' + `char' item. + + `DOUBLE PRECISION' + Same as `REAL(KIND=2)'. + + `DOUBLE COMPLEX' + Same as `COMPLEX(KIND=2)'. + + Note that the above are proposed correspondences and might change in + future versions of `g77'--avoid writing code depending on them. + + Other types supported by `g77' are derived from gcc types such as + `char', `short', `int', `long int', `long long int', `long double', and + so on. That is, whatever types `gcc' already supports, `g77' supports + now or probably will support in a future version. The rules for the + `NUMERIC-TYPE*N' notation apply to these types, and new values for + `NUMERIC-TYPE(KIND=N)' will be assigned in a way that encourages + clarity, consistency, and portability. + +  + File: g77.info, Node: Compiler Constants, Next: Compiler Intrinsics, Prev: Compiler Types, Up: Compiler + + Compiler Constants + ================== + + `g77' strictly assigns types to _all_ constants not documented as + "typeless" (typeless constants including `'1'Z', for example). Many + other Fortran compilers attempt to assign types to typed constants + based on their context. This results in hard-to-find bugs, nonportable + code, and is not in the spirit (though it strictly follows the letter) + of the 77 and 90 standards. + + `g77' might offer, in a future release, explicit constructs by which + a wider variety of typeless constants may be specified, and/or + user-requested warnings indicating places where `g77' might differ from + how other compilers assign types to constants. + + *Note Context-Sensitive Constants::, for more information on this + issue. + +  + File: g77.info, Node: Compiler Intrinsics, Prev: Compiler Constants, Up: Compiler + + Compiler Intrinsics + =================== + + `g77' offers an ever-widening set of intrinsics. Currently these + all are procedures (functions and subroutines). + + Some of these intrinsics are unimplemented, but their names reserved + to reduce future problems with existing code as they are implemented. + Others are implemented as part of the GNU Fortran language, while yet + others are provided for compatibility with other dialects of Fortran + but are not part of the GNU Fortran language. + + To manage these distinctions, `g77' provides intrinsic _groups_, a + facility that is simply an extension of the intrinsic groups provided + by the GNU Fortran language. + + * Menu: + + * Intrinsic Groups:: How intrinsics are grouped for easy management. + * Other Intrinsics:: Intrinsics other than those in the GNU + Fortran language. + +  + File: g77.info, Node: Intrinsic Groups, Next: Other Intrinsics, Up: Compiler Intrinsics + + Intrinsic Groups + ---------------- + + A given specific intrinsic belongs in one or more groups. Each + group is deleted, disabled, hidden, or enabled by default or a + command-line option. The meaning of each term follows. + + Deleted + No intrinsics are recognized as belonging to that group. + + Disabled + Intrinsics are recognized as belonging to the group, but + references to them (other than via the `INTRINSIC' statement) are + disallowed through that group. + + Hidden + Intrinsics in that group are recognized and enabled (if + implemented) _only_ if the first mention of the actual name of an + intrinsic in a program unit is in an `INTRINSIC' statement. + + Enabled + Intrinsics in that group are recognized and enabled (if + implemented). + + The distinction between deleting and disabling a group is illustrated + by the following example. Assume intrinsic `FOO' belongs only to group + `FGR'. If group `FGR' is deleted, the following program unit will + successfully compile, because `FOO()' will be seen as a reference to an + external function named `FOO': + + PRINT *, FOO() + END + + If group `FGR' is disabled, compiling the above program will produce + diagnostics, either because the `FOO' intrinsic is improperly invoked + or, if properly invoked, it is not enabled. To change the above + program so it references an external function `FOO' instead of the + disabled `FOO' intrinsic, add the following line to the top: + + EXTERNAL FOO + + So, deleting a group tells `g77' to pretend as though the intrinsics in + that group do not exist at all, whereas disabling it tells `g77' to + recognize them as (disabled) intrinsics in intrinsic-like contexts. + + Hiding a group is like enabling it, but the intrinsic must be first + named in an `INTRINSIC' statement to be considered a reference to the + intrinsic rather than to an external procedure. This might be the + "safest" way to treat a new group of intrinsics when compiling old + code, because it allows the old code to be generally written as if + those new intrinsics never existed, but to be changed to use them by + inserting `INTRINSIC' statements in the appropriate places. However, + it should be the goal of development to use `EXTERNAL' for all names of + external procedures that might be intrinsic names. + + If an intrinsic is in more than one group, it is enabled if any of + its containing groups are enabled; if not so enabled, it is hidden if + any of its containing groups are hidden; if not so hidden, it is + disabled if any of its containing groups are disabled; if not so + disabled, it is deleted. This extra complication is necessary because + some intrinsics, such as `IBITS', belong to more than one group, and + hence should be enabled if any of the groups to which they belong are + enabled, and so on. + + The groups are: + + `badu77' + UNIX intrinsics having inappropriate forms (usually functions that + have intended side effects). + + `gnu' + Intrinsics the GNU Fortran language supports that are extensions to + the Fortran standards (77 and 90). + + `f2c' + Intrinsics supported by AT&T's `f2c' converter and/or `libf2c'. + + `f90' + Fortran 90 intrinsics. + + `mil' + MIL-STD 1753 intrinsics (`MVBITS', `IAND', `BTEST', and so on). + + `unix' + UNIX intrinsics (`IARGC', `EXIT', `ERF', and so on). + + `vxt' + VAX/VMS FORTRAN (current as of v4) intrinsics. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-12 gcc-3.2.3/gcc/f/g77.info-12 *** gcc-3.2.2/gcc/f/g77.info-12 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-12 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1687 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Other Intrinsics, Prev: Intrinsic Groups, Up: Compiler Intrinsics + + Other Intrinsics + ---------------- + + `g77' supports intrinsics other than those in the GNU Fortran + language proper. This set of intrinsics is described below. + + (Note that the empty lines appearing in the menu below are not + intentional--they result from a bug in the `makeinfo' program.) + + * Menu: + + + * ACosD Intrinsic:: (Reserved for future use.) + + * AIMax0 Intrinsic:: (Reserved for future use.) + * AIMin0 Intrinsic:: (Reserved for future use.) + + * AJMax0 Intrinsic:: (Reserved for future use.) + * AJMin0 Intrinsic:: (Reserved for future use.) + + * ASinD Intrinsic:: (Reserved for future use.) + + * ATan2D Intrinsic:: (Reserved for future use.) + * ATanD Intrinsic:: (Reserved for future use.) + + * BITest Intrinsic:: (Reserved for future use.) + + * BJTest Intrinsic:: (Reserved for future use.) + + * CDAbs Intrinsic:: Absolute value (archaic). + * CDCos Intrinsic:: Cosine (archaic). + * CDExp Intrinsic:: Exponential (archaic). + * CDLog Intrinsic:: Natural logarithm (archaic). + * CDSin Intrinsic:: Sine (archaic). + * CDSqRt Intrinsic:: Square root (archaic). + + * ChDir Intrinsic (function):: Change directory. + + * ChMod Intrinsic (function):: Change file modes. + + * CosD Intrinsic:: (Reserved for future use.) + + * DACosD Intrinsic:: (Reserved for future use.) + + * DASinD Intrinsic:: (Reserved for future use.) + + * DATan2D Intrinsic:: (Reserved for future use.) + * DATanD Intrinsic:: (Reserved for future use.) + * Date Intrinsic:: Get current date as dd-Mon-yy. + + * DbleQ Intrinsic:: (Reserved for future use.) + + * DCmplx Intrinsic:: Construct `COMPLEX(KIND=2)' value. + * DConjg Intrinsic:: Complex conjugate (archaic). + + * DCosD Intrinsic:: (Reserved for future use.) + + * DFloat Intrinsic:: Conversion (archaic). + + * DFlotI Intrinsic:: (Reserved for future use.) + * DFlotJ Intrinsic:: (Reserved for future use.) + + * DImag Intrinsic:: Convert/extract imaginary part of complex (archaic). + + * DReal Intrinsic:: Convert value to type `REAL(KIND=2)'. + + * DSinD Intrinsic:: (Reserved for future use.) + + * DTanD Intrinsic:: (Reserved for future use.) + + * DTime Intrinsic (function):: Get elapsed time since last time. + + * FGet Intrinsic (function):: Read a character from unit 5 stream-wise. + + * FGetC Intrinsic (function):: Read a character stream-wise. + + * FloatI Intrinsic:: (Reserved for future use.) + * FloatJ Intrinsic:: (Reserved for future use.) + + * FPut Intrinsic (function):: Write a character to unit 6 stream-wise. + + * FPutC Intrinsic (function):: Write a character stream-wise. + + * IDate Intrinsic (VXT):: Get local time info (VAX/VMS). + + * IIAbs Intrinsic:: (Reserved for future use.) + * IIAnd Intrinsic:: (Reserved for future use.) + * IIBClr Intrinsic:: (Reserved for future use.) + * IIBits Intrinsic:: (Reserved for future use.) + * IIBSet Intrinsic:: (Reserved for future use.) + * IIDiM Intrinsic:: (Reserved for future use.) + * IIDInt Intrinsic:: (Reserved for future use.) + * IIDNnt Intrinsic:: (Reserved for future use.) + * IIEOr Intrinsic:: (Reserved for future use.) + * IIFix Intrinsic:: (Reserved for future use.) + * IInt Intrinsic:: (Reserved for future use.) + * IIOr Intrinsic:: (Reserved for future use.) + * IIQint Intrinsic:: (Reserved for future use.) + * IIQNnt Intrinsic:: (Reserved for future use.) + * IIShftC Intrinsic:: (Reserved for future use.) + * IISign Intrinsic:: (Reserved for future use.) + + * IMax0 Intrinsic:: (Reserved for future use.) + * IMax1 Intrinsic:: (Reserved for future use.) + * IMin0 Intrinsic:: (Reserved for future use.) + * IMin1 Intrinsic:: (Reserved for future use.) + * IMod Intrinsic:: (Reserved for future use.) + + * INInt Intrinsic:: (Reserved for future use.) + * INot Intrinsic:: (Reserved for future use.) + + * IZExt Intrinsic:: (Reserved for future use.) + * JIAbs Intrinsic:: (Reserved for future use.) + * JIAnd Intrinsic:: (Reserved for future use.) + * JIBClr Intrinsic:: (Reserved for future use.) + * JIBits Intrinsic:: (Reserved for future use.) + * JIBSet Intrinsic:: (Reserved for future use.) + * JIDiM Intrinsic:: (Reserved for future use.) + * JIDInt Intrinsic:: (Reserved for future use.) + * JIDNnt Intrinsic:: (Reserved for future use.) + * JIEOr Intrinsic:: (Reserved for future use.) + * JIFix Intrinsic:: (Reserved for future use.) + * JInt Intrinsic:: (Reserved for future use.) + * JIOr Intrinsic:: (Reserved for future use.) + * JIQint Intrinsic:: (Reserved for future use.) + * JIQNnt Intrinsic:: (Reserved for future use.) + * JIShft Intrinsic:: (Reserved for future use.) + * JIShftC Intrinsic:: (Reserved for future use.) + * JISign Intrinsic:: (Reserved for future use.) + * JMax0 Intrinsic:: (Reserved for future use.) + * JMax1 Intrinsic:: (Reserved for future use.) + * JMin0 Intrinsic:: (Reserved for future use.) + * JMin1 Intrinsic:: (Reserved for future use.) + * JMod Intrinsic:: (Reserved for future use.) + * JNInt Intrinsic:: (Reserved for future use.) + * JNot Intrinsic:: (Reserved for future use.) + * JZExt Intrinsic:: (Reserved for future use.) + + * Kill Intrinsic (function):: Signal a process. + + * Link Intrinsic (function):: Make hard link in file system. + + * QAbs Intrinsic:: (Reserved for future use.) + * QACos Intrinsic:: (Reserved for future use.) + * QACosD Intrinsic:: (Reserved for future use.) + * QASin Intrinsic:: (Reserved for future use.) + * QASinD Intrinsic:: (Reserved for future use.) + * QATan Intrinsic:: (Reserved for future use.) + * QATan2 Intrinsic:: (Reserved for future use.) + * QATan2D Intrinsic:: (Reserved for future use.) + * QATanD Intrinsic:: (Reserved for future use.) + * QCos Intrinsic:: (Reserved for future use.) + * QCosD Intrinsic:: (Reserved for future use.) + * QCosH Intrinsic:: (Reserved for future use.) + * QDiM Intrinsic:: (Reserved for future use.) + * QExp Intrinsic:: (Reserved for future use.) + * QExt Intrinsic:: (Reserved for future use.) + * QExtD Intrinsic:: (Reserved for future use.) + * QFloat Intrinsic:: (Reserved for future use.) + * QInt Intrinsic:: (Reserved for future use.) + * QLog Intrinsic:: (Reserved for future use.) + * QLog10 Intrinsic:: (Reserved for future use.) + * QMax1 Intrinsic:: (Reserved for future use.) + * QMin1 Intrinsic:: (Reserved for future use.) + * QMod Intrinsic:: (Reserved for future use.) + * QNInt Intrinsic:: (Reserved for future use.) + * QSin Intrinsic:: (Reserved for future use.) + * QSinD Intrinsic:: (Reserved for future use.) + * QSinH Intrinsic:: (Reserved for future use.) + * QSqRt Intrinsic:: (Reserved for future use.) + * QTan Intrinsic:: (Reserved for future use.) + * QTanD Intrinsic:: (Reserved for future use.) + * QTanH Intrinsic:: (Reserved for future use.) + + * Rename Intrinsic (function):: Rename file. + + * Secnds Intrinsic:: Get local time offset since midnight. + + * Signal Intrinsic (function):: Muck with signal handling. + + * SinD Intrinsic:: (Reserved for future use.) + + * SnglQ Intrinsic:: (Reserved for future use.) + + * SymLnk Intrinsic (function):: Make symbolic link in file system. + + * System Intrinsic (function):: Invoke shell (system) command. + + * TanD Intrinsic:: (Reserved for future use.) + + * Time Intrinsic (VXT):: Get the time as a character value. + + * UMask Intrinsic (function):: Set file creation permissions mask. + + * Unlink Intrinsic (function):: Unlink file. + + * ZExt Intrinsic:: (Reserved for future use.) + +  + File: g77.info, Node: ACosD Intrinsic, Next: AIMax0 Intrinsic, Up: Other Intrinsics + + ACosD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL ACosD' to use this name for an + external procedure. + +  + File: g77.info, Node: AIMax0 Intrinsic, Next: AIMin0 Intrinsic, Prev: ACosD Intrinsic, Up: Other Intrinsics + + AIMax0 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AIMax0' to use this name for an + external procedure. + +  + File: g77.info, Node: AIMin0 Intrinsic, Next: AJMax0 Intrinsic, Prev: AIMax0 Intrinsic, Up: Other Intrinsics + + AIMin0 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AIMin0' to use this name for an + external procedure. + +  + File: g77.info, Node: AJMax0 Intrinsic, Next: AJMin0 Intrinsic, Prev: AIMin0 Intrinsic, Up: Other Intrinsics + + AJMax0 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AJMax0' to use this name for an + external procedure. + +  + File: g77.info, Node: AJMin0 Intrinsic, Next: ASinD Intrinsic, Prev: AJMax0 Intrinsic, Up: Other Intrinsics + + AJMin0 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AJMin0' to use this name for an + external procedure. + +  + File: g77.info, Node: ASinD Intrinsic, Next: ATan2D Intrinsic, Prev: AJMin0 Intrinsic, Up: Other Intrinsics + + ASinD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL ASinD' to use this name for an + external procedure. + +  + File: g77.info, Node: ATan2D Intrinsic, Next: ATanD Intrinsic, Prev: ASinD Intrinsic, Up: Other Intrinsics + + ATan2D Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL ATan2D' to use this name for an + external procedure. + +  + File: g77.info, Node: ATanD Intrinsic, Next: BITest Intrinsic, Prev: ATan2D Intrinsic, Up: Other Intrinsics + + ATanD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL ATanD' to use this name for an + external procedure. + +  + File: g77.info, Node: BITest Intrinsic, Next: BJTest Intrinsic, Prev: ATanD Intrinsic, Up: Other Intrinsics + + BITest Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL BITest' to use this name for an + external procedure. + +  + File: g77.info, Node: BJTest Intrinsic, Next: CDAbs Intrinsic, Prev: BITest Intrinsic, Up: Other Intrinsics + + BJTest Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL BJTest' to use this name for an + external procedure. + +  + File: g77.info, Node: CDAbs Intrinsic, Next: CDCos Intrinsic, Prev: BJTest Intrinsic, Up: Other Intrinsics + + CDAbs Intrinsic + ............... + + CDAbs(A) + + CDAbs: `REAL(KIND=2)' function. + + A: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `ABS()' that is specific to one type for A. *Note + Abs Intrinsic::. + +  + File: g77.info, Node: CDCos Intrinsic, Next: CDExp Intrinsic, Prev: CDAbs Intrinsic, Up: Other Intrinsics + + CDCos Intrinsic + ............... + + CDCos(X) + + CDCos: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `COS()' that is specific to one type for X. *Note + Cos Intrinsic::. + +  + File: g77.info, Node: CDExp Intrinsic, Next: CDLog Intrinsic, Prev: CDCos Intrinsic, Up: Other Intrinsics + + CDExp Intrinsic + ............... + + CDExp(X) + + CDExp: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `EXP()' that is specific to one type for X. *Note + Exp Intrinsic::. + +  + File: g77.info, Node: CDLog Intrinsic, Next: CDSin Intrinsic, Prev: CDExp Intrinsic, Up: Other Intrinsics + + CDLog Intrinsic + ............... + + CDLog(X) + + CDLog: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `LOG()' that is specific to one type for X. *Note + Log Intrinsic::. + +  + File: g77.info, Node: CDSin Intrinsic, Next: CDSqRt Intrinsic, Prev: CDLog Intrinsic, Up: Other Intrinsics + + CDSin Intrinsic + ............... + + CDSin(X) + + CDSin: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `SIN()' that is specific to one type for X. *Note + Sin Intrinsic::. + +  + File: g77.info, Node: CDSqRt Intrinsic, Next: ChDir Intrinsic (function), Prev: CDSin Intrinsic, Up: Other Intrinsics + + CDSqRt Intrinsic + ................ + + CDSqRt(X) + + CDSqRt: `COMPLEX(KIND=2)' function. + + X: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `SQRT()' that is specific to one type for X. *Note + SqRt Intrinsic::. + +  + File: g77.info, Node: ChDir Intrinsic (function), Next: ChMod Intrinsic (function), Prev: CDSqRt Intrinsic, Up: Other Intrinsics + + ChDir Intrinsic (function) + .......................... + + ChDir(DIR) + + ChDir: `INTEGER(KIND=1)' function. + + DIR: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Sets the current working directory to be DIR. Returns 0 on success + or a non-zero error code. See `chdir(3)'. + + _Caution:_ Using this routine during I/O to a unit connected with a + non-absolute file name can cause subsequent I/O on such a unit to fail + because the I/O library might reopen files by name. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note ChDir + Intrinsic (subroutine)::. + +  + File: g77.info, Node: ChMod Intrinsic (function), Next: CosD Intrinsic, Prev: ChDir Intrinsic (function), Up: Other Intrinsics + + ChMod Intrinsic (function) + .......................... + + ChMod(NAME, MODE) + + ChMod: `INTEGER(KIND=1)' function. + + NAME: `CHARACTER'; scalar; INTENT(IN). + + MODE: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Changes the access mode of file NAME according to the specification + MODE, which is given in the format of `chmod(1)'. A null character + (`CHAR(0)') marks the end of the name in NAME--otherwise, trailing + blanks in NAME are ignored. Currently, NAME must not contain the + single quote character. + + Returns 0 on success or a non-zero error code otherwise. + + Note that this currently works by actually invoking `/bin/chmod' (or + the `chmod' found when the library was configured) and so might fail in + some circumstances and will, anyway, be slow. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note ChMod + Intrinsic (subroutine)::. + +  + File: g77.info, Node: CosD Intrinsic, Next: DACosD Intrinsic, Prev: ChMod Intrinsic (function), Up: Other Intrinsics + + CosD Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL CosD' to use this name for an + external procedure. + +  + File: g77.info, Node: DACosD Intrinsic, Next: DASinD Intrinsic, Prev: CosD Intrinsic, Up: Other Intrinsics + + DACosD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DACosD' to use this name for an + external procedure. + +  + File: g77.info, Node: DASinD Intrinsic, Next: DATan2D Intrinsic, Prev: DACosD Intrinsic, Up: Other Intrinsics + + DASinD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DASinD' to use this name for an + external procedure. + +  + File: g77.info, Node: DATan2D Intrinsic, Next: DATanD Intrinsic, Prev: DASinD Intrinsic, Up: Other Intrinsics + + DATan2D Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DATan2D' to use this name for + an external procedure. + +  + File: g77.info, Node: DATanD Intrinsic, Next: Date Intrinsic, Prev: DATan2D Intrinsic, Up: Other Intrinsics + + DATanD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DATanD' to use this name for an + external procedure. + +  + File: g77.info, Node: Date Intrinsic, Next: DbleQ Intrinsic, Prev: DATanD Intrinsic, Up: Other Intrinsics + + Date Intrinsic + .............. + + CALL Date(DATE) + + DATE: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `vxt'. + + Description: + + Returns DATE in the form `DD-MMM-YY', representing the numeric day + of the month DD, a three-character abbreviation of the month name MMM + and the last two digits of the year YY, e.g. `25-Nov-96'. + + This intrinsic is not recommended, due to the year 2000 approaching. + Therefore, programs making use of this intrinsic might not be Year 2000 + (Y2K) compliant. *Note CTime Intrinsic (subroutine)::, for information + on obtaining more digits for the current (or any) date. + +  + File: g77.info, Node: DbleQ Intrinsic, Next: DCmplx Intrinsic, Prev: Date Intrinsic, Up: Other Intrinsics + + DbleQ Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DbleQ' to use this name for an + external procedure. + +  + File: g77.info, Node: DCmplx Intrinsic, Next: DConjg Intrinsic, Prev: DbleQ Intrinsic, Up: Other Intrinsics + + DCmplx Intrinsic + ................ + + DCmplx(X, Y) + + DCmplx: `COMPLEX(KIND=2)' function. + + X: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Y: `INTEGER' or `REAL'; OPTIONAL (must be omitted if X is `COMPLEX'); + scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + If X is not type `COMPLEX', constructs a value of type + `COMPLEX(KIND=2)' from the real and imaginary values specified by X and + Y, respectively. If Y is omitted, `0D0' is assumed. + + If X is type `COMPLEX', converts it to type `COMPLEX(KIND=2)'. + + Although this intrinsic is not standard Fortran, it is a popular + extension offered by many compilers that support `DOUBLE COMPLEX', + since it offers the easiest way to convert to `DOUBLE COMPLEX' without + using Fortran 90 features (such as the `KIND=' argument to the + `CMPLX()' intrinsic). + + (`CMPLX(0D0, 0D0)' returns a single-precision `COMPLEX' result, as + required by standard FORTRAN 77. That's why so many compilers provide + `DCMPLX()', since `DCMPLX(0D0, 0D0)' returns a `DOUBLE COMPLEX' result. + Still, `DCMPLX()' converts even `REAL*16' arguments to their `REAL*8' + equivalents in most dialects of Fortran, so neither it nor `CMPLX()' + allow easy construction of arbitrary-precision values without + potentially forcing a conversion involving extending or reducing + precision. GNU Fortran provides such an intrinsic, called `COMPLEX()'.) + + *Note Complex Intrinsic::, for information on easily constructing a + `COMPLEX' value of arbitrary precision from `REAL' arguments. + +  + File: g77.info, Node: DConjg Intrinsic, Next: DCosD Intrinsic, Prev: DCmplx Intrinsic, Up: Other Intrinsics + + DConjg Intrinsic + ................ + + DConjg(Z) + + DConjg: `COMPLEX(KIND=2)' function. + + Z: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `CONJG()' that is specific to one type for Z. *Note + Conjg Intrinsic::. + +  + File: g77.info, Node: DCosD Intrinsic, Next: DFloat Intrinsic, Prev: DConjg Intrinsic, Up: Other Intrinsics + + DCosD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DCosD' to use this name for an + external procedure. + +  + File: g77.info, Node: DFloat Intrinsic, Next: DFlotI Intrinsic, Prev: DCosD Intrinsic, Up: Other Intrinsics + + DFloat Intrinsic + ................ + + DFloat(A) + + DFloat: `REAL(KIND=2)' function. + + A: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `REAL()' that is specific to one type for A. *Note + Real Intrinsic::. + +  + File: g77.info, Node: DFlotI Intrinsic, Next: DFlotJ Intrinsic, Prev: DFloat Intrinsic, Up: Other Intrinsics + + DFlotI Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DFlotI' to use this name for an + external procedure. + +  + File: g77.info, Node: DFlotJ Intrinsic, Next: DImag Intrinsic, Prev: DFlotI Intrinsic, Up: Other Intrinsics + + DFlotJ Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DFlotJ' to use this name for an + external procedure. + +  + File: g77.info, Node: DImag Intrinsic, Next: DReal Intrinsic, Prev: DFlotJ Intrinsic, Up: Other Intrinsics + + DImag Intrinsic + ............... + + DImag(Z) + + DImag: `REAL(KIND=2)' function. + + Z: `COMPLEX(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `vxt'. + + Description: + + Archaic form of `AIMAG()' that is specific to one type for Z. *Note + AImag Intrinsic::. + +  + File: g77.info, Node: DReal Intrinsic, Next: DSinD Intrinsic, Prev: DImag Intrinsic, Up: Other Intrinsics + + DReal Intrinsic + ............... + + DReal(A) + + DReal: `REAL(KIND=2)' function. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `vxt'. + + Description: + + Converts A to `REAL(KIND=2)'. + + If A is type `COMPLEX', its real part is converted (if necessary) to + `REAL(KIND=2)', and its imaginary part is disregarded. + + Although this intrinsic is not standard Fortran, it is a popular + extension offered by many compilers that support `DOUBLE COMPLEX', + since it offers the easiest way to extract the real part of a `DOUBLE + COMPLEX' value without using the Fortran 90 `REAL()' intrinsic in a way + that produces a return value inconsistent with the way many FORTRAN 77 + compilers handle `REAL()' of a `DOUBLE COMPLEX' value. + + *Note RealPart Intrinsic::, for information on a GNU Fortran + intrinsic that avoids these areas of confusion. + + *Note Dble Intrinsic::, for information on the standard FORTRAN 77 + replacement for `DREAL()'. + + *Note REAL() and AIMAG() of Complex::, for more information on this + issue. + +  + File: g77.info, Node: DSinD Intrinsic, Next: DTanD Intrinsic, Prev: DReal Intrinsic, Up: Other Intrinsics + + DSinD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DSinD' to use this name for an + external procedure. + +  + File: g77.info, Node: DTanD Intrinsic, Next: DTime Intrinsic (function), Prev: DSinD Intrinsic, Up: Other Intrinsics + + DTanD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL DTanD' to use this name for an + external procedure. + +  + File: g77.info, Node: DTime Intrinsic (function), Next: FGet Intrinsic (function), Prev: DTanD Intrinsic, Up: Other Intrinsics + + DTime Intrinsic (function) + .......................... + + DTime(TARRAY) + + DTime: `REAL(KIND=1)' function. + + TARRAY: `REAL(KIND=1)'; DIMENSION(2); INTENT(OUT). + + Intrinsic groups: `badu77'. + + Description: + + Initially, return the number of seconds of runtime since the start + of the process's execution as the function value, and the user and + system components of this in `TARRAY(1)' and `TARRAY(2)' respectively. + The functions' value is equal to `TARRAY(1) + TARRAY(2)'. + + Subsequent invocations of `DTIME()' return values accumulated since + the previous invocation. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note DTime + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FGet Intrinsic (function), Next: FGetC Intrinsic (function), Prev: DTime Intrinsic (function), Up: Other Intrinsics + + FGet Intrinsic (function) + ......................... + + FGet(C) + + FGet: `INTEGER(KIND=1)' function. + + C: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `badu77'. + + Description: + + Reads a single character into C in stream mode from unit 5 + (by-passing normal formatted input) using `getc(3)'. Returns 0 on + success, -1 on end-of-file, and the error code from `ferror(3)' + otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FGet + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FGetC Intrinsic (function), Next: FloatI Intrinsic, Prev: FGet Intrinsic (function), Up: Other Intrinsics + + FGetC Intrinsic (function) + .......................... + + FGetC(UNIT, C) + + FGetC: `INTEGER(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + C: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `badu77'. + + Description: + + Reads a single character into C in stream mode from unit UNIT + (by-passing normal formatted output) using `getc(3)'. Returns 0 on + success, -1 on end-of-file, and the error code from `ferror(3)' + otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FGetC + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FloatI Intrinsic, Next: FloatJ Intrinsic, Prev: FGetC Intrinsic (function), Up: Other Intrinsics + + FloatI Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL FloatI' to use this name for an + external procedure. + +  + File: g77.info, Node: FloatJ Intrinsic, Next: FPut Intrinsic (function), Prev: FloatI Intrinsic, Up: Other Intrinsics + + FloatJ Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL FloatJ' to use this name for an + external procedure. + +  + File: g77.info, Node: FPut Intrinsic (function), Next: FPutC Intrinsic (function), Prev: FloatJ Intrinsic, Up: Other Intrinsics + + FPut Intrinsic (function) + ......................... + + FPut(C) + + FPut: `INTEGER(KIND=1)' function. + + C: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Writes the single character C in stream mode to unit 6 (by-passing + normal formatted output) using `getc(3)'. Returns 0 on success, the + error code from `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FPut + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FPutC Intrinsic (function), Next: IDate Intrinsic (VXT), Prev: FPut Intrinsic (function), Up: Other Intrinsics + + FPutC Intrinsic (function) + .......................... + + FPutC(UNIT, C) + + FPutC: `INTEGER(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + C: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Writes the single character C in stream mode to unit UNIT + (by-passing normal formatted output) using `putc(3)'. Returns 0 on + success, the error code from `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FPutC + Intrinsic (subroutine)::. + +  + File: g77.info, Node: IDate Intrinsic (VXT), Next: IIAbs Intrinsic, Prev: FPutC Intrinsic (function), Up: Other Intrinsics + + IDate Intrinsic (VXT) + ..................... + + CALL IDate(M, D, Y) + + M: `INTEGER(KIND=1)'; scalar; INTENT(OUT). + + D: `INTEGER(KIND=1)'; scalar; INTENT(OUT). + + Y: `INTEGER(KIND=1)'; scalar; INTENT(OUT). + + Intrinsic groups: `vxt'. + + Description: + + Returns the numerical values of the current local time. The month + (in the range 1-12) is returned in M, the day (in the range 1-7) in D, + and the year in Y (in the range 0-99). + + This intrinsic is not recommended, due to the year 2000 approaching. + Therefore, programs making use of this intrinsic might not be Year 2000 + (Y2K) compliant. For example, the date might appear, to such programs, + to wrap around (change from a larger value to a smaller one) as of the + Year 2000. + + *Note IDate Intrinsic (UNIX)::, for information on obtaining more + digits for the current date. + + For information on other intrinsics with the same name: *Note IDate + Intrinsic (UNIX)::. + +  + File: g77.info, Node: IIAbs Intrinsic, Next: IIAnd Intrinsic, Prev: IDate Intrinsic (VXT), Up: Other Intrinsics + + IIAbs Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIAbs' to use this name for an + external procedure. + +  + File: g77.info, Node: IIAnd Intrinsic, Next: IIBClr Intrinsic, Prev: IIAbs Intrinsic, Up: Other Intrinsics + + IIAnd Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIAnd' to use this name for an + external procedure. + +  + File: g77.info, Node: IIBClr Intrinsic, Next: IIBits Intrinsic, Prev: IIAnd Intrinsic, Up: Other Intrinsics + + IIBClr Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIBClr' to use this name for an + external procedure. + +  + File: g77.info, Node: IIBits Intrinsic, Next: IIBSet Intrinsic, Prev: IIBClr Intrinsic, Up: Other Intrinsics + + IIBits Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIBits' to use this name for an + external procedure. + +  + File: g77.info, Node: IIBSet Intrinsic, Next: IIDiM Intrinsic, Prev: IIBits Intrinsic, Up: Other Intrinsics + + IIBSet Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIBSet' to use this name for an + external procedure. + +  + File: g77.info, Node: IIDiM Intrinsic, Next: IIDInt Intrinsic, Prev: IIBSet Intrinsic, Up: Other Intrinsics + + IIDiM Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIDiM' to use this name for an + external procedure. + +  + File: g77.info, Node: IIDInt Intrinsic, Next: IIDNnt Intrinsic, Prev: IIDiM Intrinsic, Up: Other Intrinsics + + IIDInt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIDInt' to use this name for an + external procedure. + +  + File: g77.info, Node: IIDNnt Intrinsic, Next: IIEOr Intrinsic, Prev: IIDInt Intrinsic, Up: Other Intrinsics + + IIDNnt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIDNnt' to use this name for an + external procedure. + +  + File: g77.info, Node: IIEOr Intrinsic, Next: IIFix Intrinsic, Prev: IIDNnt Intrinsic, Up: Other Intrinsics + + IIEOr Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIEOr' to use this name for an + external procedure. + +  + File: g77.info, Node: IIFix Intrinsic, Next: IInt Intrinsic, Prev: IIEOr Intrinsic, Up: Other Intrinsics + + IIFix Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIFix' to use this name for an + external procedure. + +  + File: g77.info, Node: IInt Intrinsic, Next: IIOr Intrinsic, Prev: IIFix Intrinsic, Up: Other Intrinsics + + IInt Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IInt' to use this name for an + external procedure. + +  + File: g77.info, Node: IIOr Intrinsic, Next: IIQint Intrinsic, Prev: IInt Intrinsic, Up: Other Intrinsics + + IIOr Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIOr' to use this name for an + external procedure. + +  + File: g77.info, Node: IIQint Intrinsic, Next: IIQNnt Intrinsic, Prev: IIOr Intrinsic, Up: Other Intrinsics + + IIQint Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIQint' to use this name for an + external procedure. + +  + File: g77.info, Node: IIQNnt Intrinsic, Next: IIShftC Intrinsic, Prev: IIQint Intrinsic, Up: Other Intrinsics + + IIQNnt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIQNnt' to use this name for an + external procedure. + +  + File: g77.info, Node: IIShftC Intrinsic, Next: IISign Intrinsic, Prev: IIQNnt Intrinsic, Up: Other Intrinsics + + IIShftC Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IIShftC' to use this name for + an external procedure. + +  + File: g77.info, Node: IISign Intrinsic, Next: IMax0 Intrinsic, Prev: IIShftC Intrinsic, Up: Other Intrinsics + + IISign Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IISign' to use this name for an + external procedure. + +  + File: g77.info, Node: IMax0 Intrinsic, Next: IMax1 Intrinsic, Prev: IISign Intrinsic, Up: Other Intrinsics + + IMax0 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IMax0' to use this name for an + external procedure. + +  + File: g77.info, Node: IMax1 Intrinsic, Next: IMin0 Intrinsic, Prev: IMax0 Intrinsic, Up: Other Intrinsics + + IMax1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IMax1' to use this name for an + external procedure. + +  + File: g77.info, Node: IMin0 Intrinsic, Next: IMin1 Intrinsic, Prev: IMax1 Intrinsic, Up: Other Intrinsics + + IMin0 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IMin0' to use this name for an + external procedure. + +  + File: g77.info, Node: IMin1 Intrinsic, Next: IMod Intrinsic, Prev: IMin0 Intrinsic, Up: Other Intrinsics + + IMin1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IMin1' to use this name for an + external procedure. + +  + File: g77.info, Node: IMod Intrinsic, Next: INInt Intrinsic, Prev: IMin1 Intrinsic, Up: Other Intrinsics + + IMod Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IMod' to use this name for an + external procedure. + +  + File: g77.info, Node: INInt Intrinsic, Next: INot Intrinsic, Prev: IMod Intrinsic, Up: Other Intrinsics + + INInt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL INInt' to use this name for an + external procedure. + +  + File: g77.info, Node: INot Intrinsic, Next: IZExt Intrinsic, Prev: INInt Intrinsic, Up: Other Intrinsics + + INot Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL INot' to use this name for an + external procedure. + +  + File: g77.info, Node: IZExt Intrinsic, Next: JIAbs Intrinsic, Prev: INot Intrinsic, Up: Other Intrinsics + + IZExt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL IZExt' to use this name for an + external procedure. + +  + File: g77.info, Node: JIAbs Intrinsic, Next: JIAnd Intrinsic, Prev: IZExt Intrinsic, Up: Other Intrinsics + + JIAbs Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIAbs' to use this name for an + external procedure. + +  + File: g77.info, Node: JIAnd Intrinsic, Next: JIBClr Intrinsic, Prev: JIAbs Intrinsic, Up: Other Intrinsics + + JIAnd Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIAnd' to use this name for an + external procedure. + +  + File: g77.info, Node: JIBClr Intrinsic, Next: JIBits Intrinsic, Prev: JIAnd Intrinsic, Up: Other Intrinsics + + JIBClr Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIBClr' to use this name for an + external procedure. + +  + File: g77.info, Node: JIBits Intrinsic, Next: JIBSet Intrinsic, Prev: JIBClr Intrinsic, Up: Other Intrinsics + + JIBits Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIBits' to use this name for an + external procedure. + +  + File: g77.info, Node: JIBSet Intrinsic, Next: JIDiM Intrinsic, Prev: JIBits Intrinsic, Up: Other Intrinsics + + JIBSet Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIBSet' to use this name for an + external procedure. + +  + File: g77.info, Node: JIDiM Intrinsic, Next: JIDInt Intrinsic, Prev: JIBSet Intrinsic, Up: Other Intrinsics + + JIDiM Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIDiM' to use this name for an + external procedure. + +  + File: g77.info, Node: JIDInt Intrinsic, Next: JIDNnt Intrinsic, Prev: JIDiM Intrinsic, Up: Other Intrinsics + + JIDInt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIDInt' to use this name for an + external procedure. + +  + File: g77.info, Node: JIDNnt Intrinsic, Next: JIEOr Intrinsic, Prev: JIDInt Intrinsic, Up: Other Intrinsics + + JIDNnt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIDNnt' to use this name for an + external procedure. + +  + File: g77.info, Node: JIEOr Intrinsic, Next: JIFix Intrinsic, Prev: JIDNnt Intrinsic, Up: Other Intrinsics + + JIEOr Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIEOr' to use this name for an + external procedure. + +  + File: g77.info, Node: JIFix Intrinsic, Next: JInt Intrinsic, Prev: JIEOr Intrinsic, Up: Other Intrinsics + + JIFix Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIFix' to use this name for an + external procedure. + +  + File: g77.info, Node: JInt Intrinsic, Next: JIOr Intrinsic, Prev: JIFix Intrinsic, Up: Other Intrinsics + + JInt Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JInt' to use this name for an + external procedure. + +  + File: g77.info, Node: JIOr Intrinsic, Next: JIQint Intrinsic, Prev: JInt Intrinsic, Up: Other Intrinsics + + JIOr Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIOr' to use this name for an + external procedure. + +  + File: g77.info, Node: JIQint Intrinsic, Next: JIQNnt Intrinsic, Prev: JIOr Intrinsic, Up: Other Intrinsics + + JIQint Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIQint' to use this name for an + external procedure. + +  + File: g77.info, Node: JIQNnt Intrinsic, Next: JIShft Intrinsic, Prev: JIQint Intrinsic, Up: Other Intrinsics + + JIQNnt Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIQNnt' to use this name for an + external procedure. + +  + File: g77.info, Node: JIShft Intrinsic, Next: JIShftC Intrinsic, Prev: JIQNnt Intrinsic, Up: Other Intrinsics + + JIShft Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIShft' to use this name for an + external procedure. + +  + File: g77.info, Node: JIShftC Intrinsic, Next: JISign Intrinsic, Prev: JIShft Intrinsic, Up: Other Intrinsics + + JIShftC Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JIShftC' to use this name for + an external procedure. + +  + File: g77.info, Node: JISign Intrinsic, Next: JMax0 Intrinsic, Prev: JIShftC Intrinsic, Up: Other Intrinsics + + JISign Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JISign' to use this name for an + external procedure. + +  + File: g77.info, Node: JMax0 Intrinsic, Next: JMax1 Intrinsic, Prev: JISign Intrinsic, Up: Other Intrinsics + + JMax0 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JMax0' to use this name for an + external procedure. + +  + File: g77.info, Node: JMax1 Intrinsic, Next: JMin0 Intrinsic, Prev: JMax0 Intrinsic, Up: Other Intrinsics + + JMax1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JMax1' to use this name for an + external procedure. + +  + File: g77.info, Node: JMin0 Intrinsic, Next: JMin1 Intrinsic, Prev: JMax1 Intrinsic, Up: Other Intrinsics + + JMin0 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JMin0' to use this name for an + external procedure. + +  + File: g77.info, Node: JMin1 Intrinsic, Next: JMod Intrinsic, Prev: JMin0 Intrinsic, Up: Other Intrinsics + + JMin1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JMin1' to use this name for an + external procedure. + +  + File: g77.info, Node: JMod Intrinsic, Next: JNInt Intrinsic, Prev: JMin1 Intrinsic, Up: Other Intrinsics + + JMod Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JMod' to use this name for an + external procedure. + +  + File: g77.info, Node: JNInt Intrinsic, Next: JNot Intrinsic, Prev: JMod Intrinsic, Up: Other Intrinsics + + JNInt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JNInt' to use this name for an + external procedure. + +  + File: g77.info, Node: JNot Intrinsic, Next: JZExt Intrinsic, Prev: JNInt Intrinsic, Up: Other Intrinsics + + JNot Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JNot' to use this name for an + external procedure. + +  + File: g77.info, Node: JZExt Intrinsic, Next: Kill Intrinsic (function), Prev: JNot Intrinsic, Up: Other Intrinsics + + JZExt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL JZExt' to use this name for an + external procedure. + +  + File: g77.info, Node: Kill Intrinsic (function), Next: Link Intrinsic (function), Prev: JZExt Intrinsic, Up: Other Intrinsics + + Kill Intrinsic (function) + ......................... + + Kill(PID, SIGNAL) + + Kill: `INTEGER(KIND=1)' function. + + PID: `INTEGER'; scalar; INTENT(IN). + + SIGNAL: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Sends the signal specified by SIGNAL to the process PID. Returns 0 + on success or a non-zero error code. See `kill(2)'. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note Kill + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Link Intrinsic (function), Next: QAbs Intrinsic, Prev: Kill Intrinsic (function), Up: Other Intrinsics + + Link Intrinsic (function) + ......................... + + Link(PATH1, PATH2) + + Link: `INTEGER(KIND=1)' function. + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Makes a (hard) link from file PATH1 to PATH2. A null character + (`CHAR(0)') marks the end of the names in PATH1 and PATH2--otherwise, + trailing blanks in PATH1 and PATH2 are ignored. Returns 0 on success + or a non-zero error code. See `link(2)'. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note Link + Intrinsic (subroutine)::. + +  + File: g77.info, Node: QAbs Intrinsic, Next: QACos Intrinsic, Prev: Link Intrinsic (function), Up: Other Intrinsics + + QAbs Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QAbs' to use this name for an + external procedure. + +  + File: g77.info, Node: QACos Intrinsic, Next: QACosD Intrinsic, Prev: QAbs Intrinsic, Up: Other Intrinsics + + QACos Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QACos' to use this name for an + external procedure. + +  + File: g77.info, Node: QACosD Intrinsic, Next: QASin Intrinsic, Prev: QACos Intrinsic, Up: Other Intrinsics + + QACosD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QACosD' to use this name for an + external procedure. + +  + File: g77.info, Node: QASin Intrinsic, Next: QASinD Intrinsic, Prev: QACosD Intrinsic, Up: Other Intrinsics + + QASin Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QASin' to use this name for an + external procedure. + +  + File: g77.info, Node: QASinD Intrinsic, Next: QATan Intrinsic, Prev: QASin Intrinsic, Up: Other Intrinsics + + QASinD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QASinD' to use this name for an + external procedure. + +  + File: g77.info, Node: QATan Intrinsic, Next: QATan2 Intrinsic, Prev: QASinD Intrinsic, Up: Other Intrinsics + + QATan Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QATan' to use this name for an + external procedure. + +  + File: g77.info, Node: QATan2 Intrinsic, Next: QATan2D Intrinsic, Prev: QATan Intrinsic, Up: Other Intrinsics + + QATan2 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QATan2' to use this name for an + external procedure. + +  + File: g77.info, Node: QATan2D Intrinsic, Next: QATanD Intrinsic, Prev: QATan2 Intrinsic, Up: Other Intrinsics + + QATan2D Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QATan2D' to use this name for + an external procedure. + +  + File: g77.info, Node: QATanD Intrinsic, Next: QCos Intrinsic, Prev: QATan2D Intrinsic, Up: Other Intrinsics + + QATanD Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QATanD' to use this name for an + external procedure. + +  + File: g77.info, Node: QCos Intrinsic, Next: QCosD Intrinsic, Prev: QATanD Intrinsic, Up: Other Intrinsics + + QCos Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QCos' to use this name for an + external procedure. + +  + File: g77.info, Node: QCosD Intrinsic, Next: QCosH Intrinsic, Prev: QCos Intrinsic, Up: Other Intrinsics + + QCosD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QCosD' to use this name for an + external procedure. + +  + File: g77.info, Node: QCosH Intrinsic, Next: QDiM Intrinsic, Prev: QCosD Intrinsic, Up: Other Intrinsics + + QCosH Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QCosH' to use this name for an + external procedure. + +  + File: g77.info, Node: QDiM Intrinsic, Next: QExp Intrinsic, Prev: QCosH Intrinsic, Up: Other Intrinsics + + QDiM Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QDiM' to use this name for an + external procedure. + +  + File: g77.info, Node: QExp Intrinsic, Next: QExt Intrinsic, Prev: QDiM Intrinsic, Up: Other Intrinsics + + QExp Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QExp' to use this name for an + external procedure. + +  + File: g77.info, Node: QExt Intrinsic, Next: QExtD Intrinsic, Prev: QExp Intrinsic, Up: Other Intrinsics + + QExt Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QExt' to use this name for an + external procedure. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-13 gcc-3.2.3/gcc/f/g77.info-13 *** gcc-3.2.2/gcc/f/g77.info-13 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-13 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1245 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: QExtD Intrinsic, Next: QFloat Intrinsic, Prev: QExt Intrinsic, Up: Other Intrinsics + + QExtD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QExtD' to use this name for an + external procedure. + +  + File: g77.info, Node: QFloat Intrinsic, Next: QInt Intrinsic, Prev: QExtD Intrinsic, Up: Other Intrinsics + + QFloat Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QFloat' to use this name for an + external procedure. + +  + File: g77.info, Node: QInt Intrinsic, Next: QLog Intrinsic, Prev: QFloat Intrinsic, Up: Other Intrinsics + + QInt Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QInt' to use this name for an + external procedure. + +  + File: g77.info, Node: QLog Intrinsic, Next: QLog10 Intrinsic, Prev: QInt Intrinsic, Up: Other Intrinsics + + QLog Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QLog' to use this name for an + external procedure. + +  + File: g77.info, Node: QLog10 Intrinsic, Next: QMax1 Intrinsic, Prev: QLog Intrinsic, Up: Other Intrinsics + + QLog10 Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QLog10' to use this name for an + external procedure. + +  + File: g77.info, Node: QMax1 Intrinsic, Next: QMin1 Intrinsic, Prev: QLog10 Intrinsic, Up: Other Intrinsics + + QMax1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QMax1' to use this name for an + external procedure. + +  + File: g77.info, Node: QMin1 Intrinsic, Next: QMod Intrinsic, Prev: QMax1 Intrinsic, Up: Other Intrinsics + + QMin1 Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QMin1' to use this name for an + external procedure. + +  + File: g77.info, Node: QMod Intrinsic, Next: QNInt Intrinsic, Prev: QMin1 Intrinsic, Up: Other Intrinsics + + QMod Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QMod' to use this name for an + external procedure. + +  + File: g77.info, Node: QNInt Intrinsic, Next: QSin Intrinsic, Prev: QMod Intrinsic, Up: Other Intrinsics + + QNInt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QNInt' to use this name for an + external procedure. + +  + File: g77.info, Node: QSin Intrinsic, Next: QSinD Intrinsic, Prev: QNInt Intrinsic, Up: Other Intrinsics + + QSin Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QSin' to use this name for an + external procedure. + +  + File: g77.info, Node: QSinD Intrinsic, Next: QSinH Intrinsic, Prev: QSin Intrinsic, Up: Other Intrinsics + + QSinD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QSinD' to use this name for an + external procedure. + +  + File: g77.info, Node: QSinH Intrinsic, Next: QSqRt Intrinsic, Prev: QSinD Intrinsic, Up: Other Intrinsics + + QSinH Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QSinH' to use this name for an + external procedure. + +  + File: g77.info, Node: QSqRt Intrinsic, Next: QTan Intrinsic, Prev: QSinH Intrinsic, Up: Other Intrinsics + + QSqRt Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QSqRt' to use this name for an + external procedure. + +  + File: g77.info, Node: QTan Intrinsic, Next: QTanD Intrinsic, Prev: QSqRt Intrinsic, Up: Other Intrinsics + + QTan Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QTan' to use this name for an + external procedure. + +  + File: g77.info, Node: QTanD Intrinsic, Next: QTanH Intrinsic, Prev: QTan Intrinsic, Up: Other Intrinsics + + QTanD Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QTanD' to use this name for an + external procedure. + +  + File: g77.info, Node: QTanH Intrinsic, Next: Rename Intrinsic (function), Prev: QTanD Intrinsic, Up: Other Intrinsics + + QTanH Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL QTanH' to use this name for an + external procedure. + +  + File: g77.info, Node: Rename Intrinsic (function), Next: Secnds Intrinsic, Prev: QTanH Intrinsic, Up: Other Intrinsics + + Rename Intrinsic (function) + ........................... + + Rename(PATH1, PATH2) + + Rename: `INTEGER(KIND=1)' function. + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Renames the file PATH1 to PATH2. A null character (`CHAR(0)') marks + the end of the names in PATH1 and PATH2--otherwise, trailing blanks in + PATH1 and PATH2 are ignored. See `rename(2)'. Returns 0 on success or + a non-zero error code. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note Rename + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Secnds Intrinsic, Next: Signal Intrinsic (function), Prev: Rename Intrinsic (function), Up: Other Intrinsics + + Secnds Intrinsic + ................ + + Secnds(T) + + Secnds: `REAL(KIND=1)' function. + + T: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: `vxt'. + + Description: + + Returns the local time in seconds since midnight minus the value T. + + This values returned by this intrinsic become numerically less than + previous values (they wrap around) during a single run of the compiler + program, under normal circumstances (such as running through the + midnight hour). + +  + File: g77.info, Node: Signal Intrinsic (function), Next: SinD Intrinsic, Prev: Secnds Intrinsic, Up: Other Intrinsics + + Signal Intrinsic (function) + ........................... + + Signal(NUMBER, HANDLER) + + Signal: `INTEGER(KIND=7)' function. + + NUMBER: `INTEGER'; scalar; INTENT(IN). + + HANDLER: Signal handler (`INTEGER FUNCTION' or `SUBROUTINE') or + dummy/global `INTEGER(KIND=1)' scalar. + + Intrinsic groups: `badu77'. + + Description: + + If HANDLER is a an `EXTERNAL' routine, arranges for it to be invoked + with a single integer argument (of system-dependent length) when signal + NUMBER occurs. If HANDLER is an integer, it can be used to turn off + handling of signal NUMBER or revert to its default action. See + `signal(2)'. + + Note that HANDLER will be called using C conventions, so the value + of its argument in Fortran terms is obtained by applying `%LOC()' (or + LOC()) to it. + + The value returned by `signal(2)' is returned. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + _Warning:_ If the returned value is stored in an `INTEGER(KIND=1)' + (default `INTEGER') argument, truncation of the original return value + occurs on some systems (such as Alphas, which have 64-bit pointers but + 32-bit default integers), with no warning issued by `g77' under normal + circumstances. + + Therefore, the following code fragment might silently fail on some + systems: + + INTEGER RTN + EXTERNAL MYHNDL + RTN = SIGNAL(SIGNUM, MYHNDL) + ... + ! Restore original handler: + RTN = SIGNAL(SIGNUM, RTN) + + The reason for the failure is that `RTN' might not hold all the + information on the original handler for the signal, thus restoring an + invalid handler. This bug could manifest itself as a spurious run-time + failure at an arbitrary point later during the program's execution, for + example. + + _Warning:_ Use of the `libf2c' run-time library function `signal_' + directly (such as via `EXTERNAL SIGNAL') requires use of the `%VAL()' + construct to pass an `INTEGER' value (such as `SIG_IGN' or `SIG_DFL') + for the HANDLER argument. + + However, while `RTN = SIGNAL(SIGNUM, %VAL(SIG_IGN))' works when + `SIGNAL' is treated as an external procedure (and resolves, at link + time, to `libf2c''s `signal_' routine), this construct is not valid + when `SIGNAL' is recognized as the intrinsic of that name. + + Therefore, for maximum portability and reliability, code such + references to the `SIGNAL' facility as follows: + + INTRINSIC SIGNAL + ... + RTN = SIGNAL(SIGNUM, SIG_IGN) + + `g77' will compile such a call correctly, while other compilers will + generally either do so as well or reject the `INTRINSIC SIGNAL' + statement via a diagnostic, allowing you to take appropriate action. + + For information on other intrinsics with the same name: *Note Signal + Intrinsic (subroutine)::. + +  + File: g77.info, Node: SinD Intrinsic, Next: SnglQ Intrinsic, Prev: Signal Intrinsic (function), Up: Other Intrinsics + + SinD Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL SinD' to use this name for an + external procedure. + +  + File: g77.info, Node: SnglQ Intrinsic, Next: SymLnk Intrinsic (function), Prev: SinD Intrinsic, Up: Other Intrinsics + + SnglQ Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL SnglQ' to use this name for an + external procedure. + +  + File: g77.info, Node: SymLnk Intrinsic (function), Next: System Intrinsic (function), Prev: SnglQ Intrinsic, Up: Other Intrinsics + + SymLnk Intrinsic (function) + ........................... + + SymLnk(PATH1, PATH2) + + SymLnk: `INTEGER(KIND=1)' function. + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Makes a symbolic link from file PATH1 to PATH2. A null character + (`CHAR(0)') marks the end of the names in PATH1 and PATH2--otherwise, + trailing blanks in PATH1 and PATH2 are ignored. Returns 0 on success + or a non-zero error code (`ENOSYS' if the system does not provide + `symlink(2)'). + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note SymLnk + Intrinsic (subroutine)::. + +  + File: g77.info, Node: System Intrinsic (function), Next: TanD Intrinsic, Prev: SymLnk Intrinsic (function), Up: Other Intrinsics + + System Intrinsic (function) + ........................... + + System(COMMAND) + + System: `INTEGER(KIND=1)' function. + + COMMAND: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Passes the command COMMAND to a shell (see `system(3)'). Returns + the value returned by `system(3)', presumably 0 if the shell command + succeeded. Note that which shell is used to invoke the command is + system-dependent and environment-dependent. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. However, the function form can be valid in + cases where the actual side effects performed by the call are + unimportant to the application. + + For example, on a UNIX system, `SAME = SYSTEM('cmp a b')' does not + perform any side effects likely to be important to the program, so the + programmer would not care if the actual system call (and invocation of + `cmp') was optimized away in a situation where the return value could + be determined otherwise, or was not actually needed (`SAME' not + actually referenced after the sample assignment statement). + + For information on other intrinsics with the same name: *Note System + Intrinsic (subroutine)::. + +  + File: g77.info, Node: TanD Intrinsic, Next: Time Intrinsic (VXT), Prev: System Intrinsic (function), Up: Other Intrinsics + + TanD Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL TanD' to use this name for an + external procedure. + +  + File: g77.info, Node: Time Intrinsic (VXT), Next: UMask Intrinsic (function), Prev: TanD Intrinsic, Up: Other Intrinsics + + Time Intrinsic (VXT) + .................... + + CALL Time(TIME) + + TIME: `CHARACTER*8'; scalar; INTENT(OUT). + + Intrinsic groups: `vxt'. + + Description: + + Returns in TIME a character representation of the current time as + obtained from `ctime(3)'. + + Programs making use of this intrinsic might not be Year 10000 (Y10K) + compliant. For example, the date might appear, to such programs, to + wrap around (change from a larger value to a smaller one) as of the + Year 10000. + + *Note FDate Intrinsic (subroutine)::, for an equivalent routine. + + For information on other intrinsics with the same name: *Note Time + Intrinsic (UNIX)::. + +  + File: g77.info, Node: UMask Intrinsic (function), Next: Unlink Intrinsic (function), Prev: Time Intrinsic (VXT), Up: Other Intrinsics + + UMask Intrinsic (function) + .......................... + + UMask(MASK) + + UMask: `INTEGER(KIND=1)' function. + + MASK: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Sets the file creation mask to MASK and returns the old value. See + `umask(2)'. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note UMask + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Unlink Intrinsic (function), Next: ZExt Intrinsic, Prev: UMask Intrinsic (function), Up: Other Intrinsics + + Unlink Intrinsic (function) + ........................... + + Unlink(FILE) + + Unlink: `INTEGER(KIND=1)' function. + + FILE: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `badu77'. + + Description: + + Unlink the file FILE. A null character (`CHAR(0)') marks the end of + the name in FILE--otherwise, trailing blanks in FILE are ignored. + Returns 0 on success or a non-zero error code. See `unlink(2)'. + + Due to the side effects performed by this intrinsic, the function + form is not recommended. + + For information on other intrinsics with the same name: *Note Unlink + Intrinsic (subroutine)::. + +  + File: g77.info, Node: ZExt Intrinsic, Prev: Unlink Intrinsic (function), Up: Other Intrinsics + + ZExt Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL ZExt' to use this name for an + external procedure. + +  + File: g77.info, Node: Other Compilers, Next: Other Languages, Prev: Other Dialects, Up: Top + + Other Compilers + *************** + + An individual Fortran source file can be compiled to an object + (`*.o') file instead of to the final program executable. This allows + several portions of a program to be compiled at different times and + linked together whenever a new version of the program is needed. + However, it introduces the issue of "object compatibility" across the + various object files (and libraries, or `*.a' files) that are linked + together to produce any particular executable file. + + Object compatibility is an issue when combining, in one program, + Fortran code compiled by more than one compiler (or more than one + configuration of a compiler). If the compilers disagree on how to + transform the names of procedures, there will normally be errors when + linking such programs. Worse, if the compilers agree on naming, but + disagree on issues like how to pass parameters, return arguments, and + lay out `COMMON' areas, the earliest detected errors might be the + incorrect results produced by the program (and that assumes these + errors are detected, which is not always the case). + + Normally, `g77' generates code that is object-compatible with code + generated by a version of `f2c' configured (with, for example, `f2c.h' + definitions) to be generally compatible with `g77' as built by `gcc'. + (Normally, `f2c' will, by default, conform to the appropriate + configuration, but it is possible that older or perhaps even newer + versions of `f2c', or versions having certain configuration changes to + `f2c' internals, will produce object files that are incompatible with + `g77'.) + + For example, a Fortran string subroutine argument will become two + arguments on the C side: a `char *' and an `int' length. + + Much of this compatibility results from the fact that `g77' uses the + same run-time library, `libf2c', used by `f2c', though `g77' gives its + version the name `libg2c' so as to avoid conflicts when linking, + installing them in the same directories, and so on. + + Other compilers might or might not generate code that is + object-compatible with `libg2c' and current `g77', and some might offer + such compatibility only when explicitly selected via a command-line + option to the compiler. + + _Note: This portion of the documentation definitely needs a lot of + work!_ + + * Menu: + + * Dropping f2c Compatibility:: When speed is more important. + * Compilers Other Than f2c:: Interoperation with code from other compilers. + +  + File: g77.info, Node: Dropping f2c Compatibility, Next: Compilers Other Than f2c, Up: Other Compilers + + Dropping `f2c' Compatibility + ============================ + + Specifying `-fno-f2c' allows `g77' to generate, in some cases, + faster code, by not needing to allow to the possibility of linking with + code compiled by `f2c'. + + For example, this affects how `REAL(KIND=1)', `COMPLEX(KIND=1)', and + `COMPLEX(KIND=2)' functions are called. With `-fno-f2c', they are + compiled as returning the appropriate `gcc' type (`float', `__complex__ + float', `__complex__ double', in many configurations). + + With `-ff2c' in force, they are compiled differently (with perhaps + slower run-time performance) to accommodate the restrictions inherent + in `f2c''s use of K&R C as an intermediate language--`REAL(KIND=1)' + functions return C's `double' type, while `COMPLEX' functions return + `void' and use an extra argument pointing to a place for the functions + to return their values. + + It is possible that, in some cases, leaving `-ff2c' in force might + produce faster code than using `-fno-f2c'. Feel free to experiment, + but remember to experiment with changing the way _entire programs and + their Fortran libraries are compiled_ at a time, since this sort of + experimentation affects the interface of code generated for a Fortran + source file--that is, it affects object compatibility. + + Note that `f2c' compatibility is a fairly static target to achieve, + though not necessarily perfectly so, since, like `g77', it is still + being improved. However, specifying `-fno-f2c' causes `g77' to + generate code that will probably be incompatible with code generated by + future versions of `g77' when the same option is in force. You should + make sure you are always able to recompile complete programs from + source code when upgrading to new versions of `g77' or `f2c', + especially when using options such as `-fno-f2c'. + + Therefore, if you are using `g77' to compile libraries and other + object files for possible future use and you don't want to require + recompilation for future use with subsequent versions of `g77', you + might want to stick with `f2c' compatibility for now, and carefully + watch for any announcements about changes to the `f2c'/`libf2c' + interface that might affect existing programs (thus requiring + recompilation). + + It is probable that a future version of `g77' will not, by default, + generate object files compatible with `f2c', and that version probably + would no longer use `libf2c'. If you expect to depend on this + compatibility in the long term, use the options `-ff2c -ff2c-library' + when compiling all of the applicable code. This should cause future + versions of `g77' either to produce compatible code (at the expense of + the availability of some features and performance), or at the very + least, to produce diagnostics. + + (The library `g77' produces will no longer be named `libg2c' when it + is no longer generally compatible with `libf2c'. It will likely be + referred to, and, if installed as a distinct library, named `libg77', + or some other as-yet-unused name.) + +  + File: g77.info, Node: Compilers Other Than f2c, Prev: Dropping f2c Compatibility, Up: Other Compilers + + Compilers Other Than `f2c' + ========================== + + On systems with Fortran compilers other than `f2c' and `g77', code + compiled by `g77' is not expected to work well with code compiled by + the native compiler. (This is true for `f2c'-compiled objects as well.) + Libraries compiled with the native compiler probably will have to be + recompiled with `g77' to be used with `g77'-compiled code. + + Reasons for such incompatibilities include: + + * There might be differences in the way names of Fortran procedures + are translated for use in the system's object-file format. For + example, the statement `CALL FOO' might be compiled by `g77' to + call a procedure the linker `ld' sees given the name `_foo_', + while the apparently corresponding statement `SUBROUTINE FOO' + might be compiled by the native compiler to define the + linker-visible name `_foo', or `_FOO_', and so on. + + * There might be subtle type mismatches which cause subroutine + arguments and function return values to get corrupted. + + This is why simply getting `g77' to transform procedure names the + same way a native compiler does is not usually a good idea--unless + some effort has been made to ensure that, aside from the way the + two compilers transform procedure names, everything else about the + way they generate code for procedure interfaces is identical. + + * Native compilers use libraries of private I/O routines which will + not be available at link time unless you have the native + compiler--and you would have to explicitly ask for them. + + For example, on the Sun you would have to add `-L/usr/lang/SCx.x + -lF77 -lV77' to the link command. + +  + File: g77.info, Node: Other Languages, Next: Debugging and Interfacing, Prev: Other Compilers, Up: Top + + Other Languages + *************** + + _Note: This portion of the documentation definitely needs a lot of + work!_ + + * Menu: + + * Interoperating with C and C++:: + +  + File: g77.info, Node: Interoperating with C and C++, Up: Other Languages + + Tools and advice for interoperating with C and C++ + ================================================== + + The following discussion assumes that you are running `g77' in `f2c' + compatibility mode, i.e. not using `-fno-f2c'. It provides some advice + about quick and simple techniques for linking Fortran and C (or C++), + the most common requirement. For the full story consult the + description of code generation. *Note Debugging and Interfacing::. + + When linking Fortran and C, it's usually best to use `g77' to do the + linking so that the correct libraries are included (including the maths + one). If you're linking with C++ you will want to add `-lstdc++', + `-lg++' or whatever. If you need to use another driver program (or + `ld' directly), you can find out what linkage options `g77' passes by + running `g77 -v'. + + * Menu: + + * C Interfacing Tools:: + * C Access to Type Information:: + * f2c Skeletons and Prototypes:: + * C++ Considerations:: + * Startup Code:: + +  + File: g77.info, Node: C Interfacing Tools, Next: C Access to Type Information, Up: Interoperating with C and C++ + + C Interfacing Tools + ------------------- + + Even if you don't actually use it as a compiler, `f2c' from + `ftp://ftp.netlib.org/f2c/src', can be a useful tool when you're + interfacing (linking) Fortran and C. *Note Generating Skeletons and + Prototypes with `f2c': f2c Skeletons and Prototypes. + + To use `f2c' for this purpose you only need retrieve and build the + `src' directory from the distribution, consult the `README' + instructions there for machine-specifics, and install the `f2c' program + on your path. + + Something else that might be useful is `cfortran.h' from + `ftp://zebra.desy.de/cfortran'. This is a fairly general tool which + can be used to generate interfaces for calling in both directions + between Fortran and C. It can be used in `f2c' mode with + `g77'--consult its documentation for details. + +  + File: g77.info, Node: C Access to Type Information, Next: f2c Skeletons and Prototypes, Prev: C Interfacing Tools, Up: Interoperating with C and C++ + + Accessing Type Information in C + ------------------------------- + + Generally, C code written to link with `g77' code--calling and/or + being called from Fortran--should `#include ' to define the C + versions of the Fortran types. Don't assume Fortran `INTEGER' types + correspond to C `int's, for instance; instead, declare them as + `integer', a type defined by `g2c.h'. `g2c.h' is installed where `gcc' + will find it by default, assuming you use a copy of `gcc' compatible + with `g77', probably built at the same time as `g77'. + +  + File: g77.info, Node: f2c Skeletons and Prototypes, Next: C++ Considerations, Prev: C Access to Type Information, Up: Interoperating with C and C++ + + Generating Skeletons and Prototypes with `f2c' + ---------------------------------------------- + + A simple and foolproof way to write `g77'-callable C routines--e.g. + to interface with an existing library--is to write a file (named, for + example, `fred.f') of dummy Fortran skeletons comprising just the + declaration of the routine(s) and dummy arguments plus `END' statements. + Then run `f2c' on file `fred.f' to produce `fred.c' into which you can + edit useful code, confident the calling sequence is correct, at least. + (There are some errors otherwise commonly made in generating C + interfaces with `f2c' conventions, such as not using `doublereal' as + the return type of a `REAL' `FUNCTION'.) + + `f2c' also can help with calling Fortran from C, using its `-P' + option to generate C prototypes appropriate for calling the Fortran.(1) + If the Fortran code containing any routines to be called from C is in + file `joe.f', use the command `f2c -P joe.f' to generate the file + `joe.P' containing prototype information. `#include' this in the C + which has to call the Fortran routines to make sure you get it right. + + *Note Arrays (DIMENSION): Arrays, for information on the differences + between the way Fortran (including compilers like `g77') and C handle + arrays. + + ---------- Footnotes ---------- + + (1) The files generated like this can also be used for inter-unit + consistency checking of dummy and actual arguments, although the + `ftnchek' tool from `ftp://ftp.netlib.org/fortran' or + `ftp://ftp.dsm.fordham.edu' is probably better for this purpose. + +  + File: g77.info, Node: C++ Considerations, Next: Startup Code, Prev: f2c Skeletons and Prototypes, Up: Interoperating with C and C++ + + C++ Considerations + ------------------ + + `f2c' can be used to generate suitable code for compilation with a + C++ system using the `-C++' option. The important thing about linking + `g77'-compiled code with C++ is that the prototypes for the `g77' + routines must specify C linkage to avoid name mangling. So, use an + `extern "C"' declaration. `f2c''s `-C++' option will take care of this + when generating skeletons or prototype files as above, and also avoid + clashes with C++ reserved words in addition to those in C. + +  + File: g77.info, Node: Startup Code, Prev: C++ Considerations, Up: Interoperating with C and C++ + + Startup Code + ------------ + + Unlike with some runtime systems, it shouldn't be necessary (unless + there are bugs) to use a Fortran main program unit to ensure the + runtime--specifically the I/O system--is initialized. + + However, to use the `g77' intrinsics `GETARG' and `IARGC', either + the `main' routine from the `libg2c' library must be used, or the + `f_setarg' routine (new as of `egcs' version 1.1 and `g77' version + 0.5.23) must be called with the appropriate `argc' and `argv' arguments + prior to the program calling `GETARG' or `IARGC'. + + To provide more flexibility for mixed-language programming involving + `g77' while allowing for shared libraries, as of `egcs' version 1.1 and + `g77' version 0.5.23, `g77''s `main' routine in `libg2c' does the + following, in order: + + 1. Calls `f_setarg' with the incoming `argc' and `argv' arguments, in + the same order as for `main' itself. + + This sets up the command-line environment for `GETARG' and `IARGC'. + + 2. Calls `f_setsig' (with no arguments). + + This sets up the signaling and exception environment. + + 3. Calls `f_init' (with no arguments). + + This initializes the I/O environment, though that should not be + necessary, as all I/O functions in `libf2c' are believed to call + `f_init' automatically, if necessary. + + (A future version of `g77' might skip this explicit step, to speed + up normal exit of a program.) + + 4. Arranges for `f_exit' to be called (with no arguments) when the + program exits. + + This ensures that the I/O environment is properly shut down before + the program exits normally. Otherwise, output buffers might not + be fully flushed, scratch files might not be deleted, and so on. + + The simple way `main' does this is to call `f_exit' itself after + calling `MAIN__' (in the next step). + + However, this does not catch the cases where the program might + call `exit' directly, instead of using the `EXIT' intrinsic + (implemented as `exit_' in `libf2c'). + + So, `main' attempts to use the operating environment's `onexit' or + `atexit' facility, if available, to cause `f_exit' to be called + automatically upon any invocation of `exit'. + + 5. Calls `MAIN__' (with no arguments). + + This starts executing the Fortran main program unit for the + application. (Both `g77' and `f2c' currently compile a main + program unit so that its global name is `MAIN__'.) + + 6. If no `onexit' or `atexit' is provided by the system, calls + `f_exit'. + + 7. Calls `exit' with a zero argument, to signal a successful program + termination. + + 8. Returns a zero value to the caller, to signal a successful program + termination, in case `exit' doesn't exit on the system. + + All of the above names are C `extern' names, i.e. not mangled. + + When using the `main' procedure provided by `g77' without a Fortran + main program unit, you need to provide `MAIN__' as the entry point for + your C code. (Make sure you link the object file that defines that + entry point with the rest of your program.) + + To provide your own `main' procedure in place of `g77''s, make sure + you specify the object file defining that procedure _before_ `-lg2c' on + the `g77' command line. Since the `-lg2c' option is implicitly + provided, this is usually straightforward. (Use the `--verbose' option + to see how and where `g77' implicitly adds `-lg2c' in a command line + that will link the program. Feel free to specify `-lg2c' explicitly, + as appropriate.) + + However, when providing your own `main', make sure you perform the + appropriate tasks in the appropriate order. For example, if your + `main' does not call `f_setarg', make sure the rest of your application + does not call `GETARG' or `IARGC'. + + And, if your `main' fails to ensure that `f_exit' is called upon + program exit, some files might end up incompletely written, some + scratch files might be left lying around, and some existing files being + written might be left with old data not properly truncated at the end. + + Note that, generally, the `g77' operating environment does not + depend on a procedure named `MAIN__' actually being called prior to any + other `g77'-compiled code. That is, `MAIN__' does not, itself, set up + any important operating-environment characteristics upon which other + code might depend. This might change in future versions of `g77', with + appropriate notification in the release notes. + + For more information, consult the source code for the above routines. + These are in `gcc/libf2c/libF77/', named `main.c', `setarg.c', + `setsig.c', `getarg_.c', and `iargc_.c'. + + Also, the file `gcc/gcc/f/com.c' contains the code `g77' uses to + open-code (inline) references to `IARGC'. + +  + File: g77.info, Node: Debugging and Interfacing, Next: Collected Fortran Wisdom, Prev: Other Languages, Up: Top + + Debugging and Interfacing + ************************* + + GNU Fortran currently generates code that is object-compatible with + the `f2c' converter. Also, it avoids limitations in the current GBE, + such as the inability to generate a procedure with multiple entry + points, by generating code that is structured differently (in terms of + procedure names, scopes, arguments, and so on) than might be expected. + + As a result, writing code in other languages that calls on, is + called by, or shares in-memory data with `g77'-compiled code generally + requires some understanding of the way `g77' compiles code for various + constructs. + + Similarly, using a debugger to debug `g77'-compiled code, even if + that debugger supports native Fortran debugging, generally requires + this sort of information. + + This section describes some of the basic information on how `g77' + compiles code for constructs involving interfaces to other languages + and to debuggers. + + _Caution:_ Much or all of this information pertains to only the + current release of `g77', sometimes even to using certain compiler + options with `g77' (such as `-fno-f2c'). Do not write code that + depends on this information without clearly marking said code as + nonportable and subject to review for every new release of `g77'. This + information is provided primarily to make debugging of code generated + by this particular release of `g77' easier for the user, and partly to + make writing (generally nonportable) interface code easier. Both of + these activities require tracking changes in new version of `g77' as + they are installed, because new versions can change the behaviors + described in this section. + + * Menu: + + * Main Program Unit:: How `g77' compiles a main program unit. + * Procedures:: How `g77' constructs parameter lists + for procedures. + * Functions:: Functions returning floating-point or character data. + * Names:: Naming of user-defined variables, procedures, etc. + * Common Blocks:: Accessing common variables while debugging. + * Local Equivalence Areas:: Accessing `EQUIVALENCE' while debugging. + * Complex Variables:: How `g77' performs complex arithmetic. + * Arrays:: Dealing with (possibly multi-dimensional) arrays. + * Adjustable Arrays:: Special consideration for adjustable arrays. + * Alternate Entry Points:: How `g77' implements alternate `ENTRY'. + * Alternate Returns:: How `g77' handles alternate returns. + * Assigned Statement Labels:: How `g77' handles `ASSIGN'. + * Run-time Library Errors:: Meanings of some `IOSTAT=' values. + +  + File: g77.info, Node: Main Program Unit, Next: Procedures, Up: Debugging and Interfacing + + Main Program Unit (PROGRAM) + =========================== + + When `g77' compiles a main program unit, it gives it the public + procedure name `MAIN__'. The `libg2c' library has the actual `main()' + procedure as is typical of C-based environments, and it is this + procedure that performs some initial start-up activity and then calls + `MAIN__'. + + Generally, `g77' and `libg2c' are designed so that you need not + include a main program unit written in Fortran in your program--it can + be written in C or some other language. Especially for I/O handling, + this is the case, although `g77' version 0.5.16 includes a bug fix for + `libg2c' that solved a problem with using the `OPEN' statement as the + first Fortran I/O activity in a program without a Fortran main program + unit. + + However, if you don't intend to use `g77' (or `f2c') to compile your + main program unit--that is, if you intend to compile a `main()' + procedure using some other language--you should carefully examine the + code for `main()' in `libg2c', found in the source file + `gcc/libf2c/libF77/main.c', to see what kinds of things might need to + be done by your `main()' in order to provide the Fortran environment + your Fortran code is expecting. + + For example, `libg2c''s `main()' sets up the information used by the + `IARGC' and `GETARG' intrinsics. Bypassing `libg2c''s `main()' without + providing a substitute for this activity would mean that invoking + `IARGC' and `GETARG' would produce undefined results. + + When debugging, one implication of the fact that `main()', which is + the place where the debugged program "starts" from the debugger's point + of view, is in `libg2c' is that you won't be starting your Fortran + program at a point you recognize as your Fortran code. + + The standard way to get around this problem is to set a break point + (a one-time, or temporary, break point will do) at the entrance to + `MAIN__', and then run the program. A convenient way to do so is to + add the `gdb' command + + tbreak MAIN__ + + to the file `.gdbinit' in the directory in which you're debugging + (using `gdb'). + + After doing this, the debugger will see the current execution point + of the program as at the beginning of the main program unit of your + program. + + Of course, if you really want to set a break point at some other + place in your program and just start the program running, without first + breaking at `MAIN__', that should work fine. + +  + File: g77.info, Node: Procedures, Next: Functions, Prev: Main Program Unit, Up: Debugging and Interfacing + + Procedures (SUBROUTINE and FUNCTION) + ==================================== + + Currently, `g77' passes arguments via reference--specifically, by + passing a pointer to the location in memory of a variable, array, array + element, a temporary location that holds the result of evaluating an + expression, or a temporary or permanent location that holds the value + of a constant. + + Procedures that accept `CHARACTER' arguments are implemented by + `g77' so that each `CHARACTER' argument has two actual arguments. + + The first argument occupies the expected position in the argument + list and has the user-specified name. This argument is a pointer to an + array of characters, passed by the caller. + + The second argument is appended to the end of the user-specified + calling sequence and is named `__g77_length_X', where X is the + user-specified name. This argument is of the C type `ftnlen' (see + `gcc/libf2c/g2c.h.in' for information on that type) and is the number + of characters the caller has allocated in the array pointed to by the + first argument. + + A procedure will ignore the length argument if `X' is not declared + `CHARACTER*(*)', because for other declarations, it knows the length. + Not all callers necessarily "know" this, however, which is why they all + pass the extra argument. + + The contents of the `CHARACTER' argument are specified by the + address passed in the first argument (named after it). The procedure + can read or write these contents as appropriate. + + When more than one `CHARACTER' argument is present in the argument + list, the length arguments are appended in the order the original + arguments appear. So `CALL FOO('HI','THERE')' is implemented in C as + `foo("hi","there",2,5);', ignoring the fact that `g77' does not provide + the trailing null bytes on the constant strings (`f2c' does provide + them, but they are unnecessary in a Fortran environment, and you should + not expect them to be there). + + Note that the above information applies to `CHARACTER' variables and + arrays *only*. It does *not* apply to external `CHARACTER' functions + or to intrinsic `CHARACTER' functions. That is, no second length + argument is passed to `FOO' in this case: + + CHARACTER X + EXTERNAL X + CALL FOO(X) + + Nor does `FOO' expect such an argument in this case: + + SUBROUTINE FOO(X) + CHARACTER X + EXTERNAL X + + Because of this implementation detail, if a program has a bug such + that there is disagreement as to whether an argument is a procedure, + and the type of the argument is `CHARACTER', subtle symptoms might + appear. + +  + File: g77.info, Node: Functions, Next: Names, Prev: Procedures, Up: Debugging and Interfacing + + Functions (FUNCTION and RETURN) + =============================== + + `g77' handles in a special way functions that return the following + types: + + * `CHARACTER' + + * `COMPLEX' + + * `REAL(KIND=1)' + + For `CHARACTER', `g77' implements a subroutine (a C function + returning `void') with two arguments prepended: `__g77_result', which + the caller passes as a pointer to a `char' array expected to hold the + return value, and `__g77_length', which the caller passes as an + `ftnlen' value specifying the length of the return value as declared in + the calling program. For `CHARACTER*(*)', the called function uses + `__g77_length' to determine the size of the array that `__g77_result' + points to; otherwise, it ignores that argument. + + For `COMPLEX', when `-ff2c' is in force, `g77' implements a + subroutine with one argument prepended: `__g77_result', which the + caller passes as a pointer to a variable of the type of the function. + The called function writes the return value into this variable instead + of returning it as a function value. When `-fno-f2c' is in force, + `g77' implements a `COMPLEX' function as `gcc''s `__complex__ float' or + `__complex__ double' function (or an emulation thereof, when + `-femulate-complex' is in effect), returning the result of the function + in the same way as `gcc' would. + + For `REAL(KIND=1)', when `-ff2c' is in force, `g77' implements a + function that actually returns `REAL(KIND=2)' (typically C's `double' + type). When `-fno-f2c' is in force, `REAL(KIND=1)' functions return + `float'. + +  + File: g77.info, Node: Names, Next: Common Blocks, Prev: Functions, Up: Debugging and Interfacing + + Names + ===== + + Fortran permits each implementation to decide how to represent names + as far as how they're seen in other contexts, such as debuggers and + when interfacing to other languages, and especially as far as how + casing is handled. + + External names--names of entities that are public, or "accessible", + to all modules in a program--normally have an underscore (`_') appended + by `g77', to generate code that is compatible with `f2c'. External + names include names of Fortran things like common blocks, external + procedures (subroutines and functions, but not including statement + functions, which are internal procedures), and entry point names. + + However, use of the `-fno-underscoring' option disables this kind of + transformation of external names (though inhibiting the transformation + certainly improves the chances of colliding with incompatible externals + written in other languages--but that might be intentional. + + When `-funderscoring' is in force, any name (external or local) that + already has at least one underscore in it is implemented by `g77' by + appending two underscores. (This second underscore can be disabled via + the `-fno-second-underscore' option.) External names are changed this + way for `f2c' compatibility. Local names are changed this way to avoid + collisions with external names that are different in the source + code--`f2c' does the same thing, but there's no compatibility issue + there except for user expectations while debugging. + + For example: + + Max_Cost = 0 + + Here, a user would, in the debugger, refer to this variable using the + name `max_cost__' (or `MAX_COST__' or `Max_Cost__', as described below). + (We hope to improve `g77' in this regard in the future--don't write + scripts depending on this behavior! Also, consider experimenting with + the `-fno-underscoring' option to try out debugging without having to + massage names by hand like this.) + + `g77' provides a number of command-line options that allow the user + to control how case mapping is handled for source files. The default + is the traditional UNIX model for Fortran compilers--names are mapped + to lower case. Other command-line options can be specified to map + names to upper case, or to leave them exactly as written in the source + file. + + For example: + + Foo = 9.436 + + Here, it is normally the case that the variable assigned will be named + `foo'. This would be the name to enter when using a debugger to access + the variable. + + However, depending on the command-line options specified, the name + implemented by `g77' might instead be `FOO' or even `Foo', thus + affecting how debugging is done. + + Also: + + Call Foo + + This would normally call a procedure that, if it were in a separate C + program, be defined starting with the line: + + void foo_() + + However, `g77' command-line options could be used to change the casing + of names, resulting in the name `FOO_' or `Foo_' being given to the + procedure instead of `foo_', and the `-fno-underscoring' option could + be used to inhibit the appending of the underscore to the name. + +  + File: g77.info, Node: Common Blocks, Next: Local Equivalence Areas, Prev: Names, Up: Debugging and Interfacing + + Common Blocks (COMMON) + ====================== + + `g77' names and lays out `COMMON' areas the same way `f2c' does, for + compatibility with `f2c'. + +  + File: g77.info, Node: Local Equivalence Areas, Next: Complex Variables, Prev: Common Blocks, Up: Debugging and Interfacing + + Local Equivalence Areas (EQUIVALENCE) + ===================================== + + `g77' treats storage-associated areas involving a `COMMON' block as + explained in the section on common blocks. + + A local `EQUIVALENCE' area is a collection of variables and arrays + connected to each other in any way via `EQUIVALENCE', none of which are + listed in a `COMMON' statement. + + (_Note:_ `g77' version 0.5.18 and earlier chose the name for X using + a different method when more than one name was in the list of names of + entities placed at the beginning of the array. Though the + documentation specified that the first name listed in the `EQUIVALENCE' + statements was chosen for X, `g77' in fact chose the name using a + method that was so complicated, it seemed easier to change it to an + alphabetical sort than to describe the previous method in the + documentation.) + +  + File: g77.info, Node: Complex Variables, Next: Arrays, Prev: Local Equivalence Areas, Up: Debugging and Interfacing + + Complex Variables (COMPLEX) + =========================== + + As of 0.5.20, `g77' defaults to handling `COMPLEX' types (and + related intrinsics, constants, functions, and so on) in a manner that + makes direct debugging involving these types in Fortran language mode + difficult. + + Essentially, `g77' implements these types using an internal + construct similar to C's `struct', at least as seen by the `gcc' back + end. + + Currently, the back end, when outputting debugging info with the + compiled code for the assembler to digest, does not detect these + `struct' types as being substitutes for Fortran complex. As a result, + the Fortran language modes of debuggers such as `gdb' see these types + as C `struct' types, which they might or might not support. + + Until this is fixed, switch to C language mode to work with entities + of `COMPLEX' type and then switch back to Fortran language mode + afterward. (In `gdb', this is accomplished via `set lang c' and either + `set lang fortran' or `set lang auto'.) + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-14 gcc-3.2.3/gcc/f/g77.info-14 *** gcc-3.2.2/gcc/f/g77.info-14 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-14 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1066 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Arrays, Next: Adjustable Arrays, Prev: Complex Variables, Up: Debugging and Interfacing + + Arrays (DIMENSION) + ================== + + Fortran uses "column-major ordering" in its arrays. This differs + from other languages, such as C, which use "row-major ordering". The + difference is that, with Fortran, array elements adjacent to each other + in memory differ in the _first_ subscript instead of the last; + `A(5,10,20)' immediately follows `A(4,10,20)', whereas with row-major + ordering it would follow `A(5,10,19)'. + + This consideration affects not only interfacing with and debugging + Fortran code, it can greatly affect how code is designed and written, + especially when code speed and size is a concern. + + Fortran also differs from C, a popular language for interfacing and + to support directly in debuggers, in the way arrays are treated. In C, + arrays are single-dimensional and have interesting relationships to + pointers, neither of which is true for Fortran. As a result, dealing + with Fortran arrays from within an environment limited to C concepts + can be challenging. + + For example, accessing the array element `A(5,10,20)' is easy enough + in Fortran (use `A(5,10,20)'), but in C some difficult machinations are + needed. First, C would treat the A array as a single-dimension array. + Second, C does not understand low bounds for arrays as does Fortran. + Third, C assumes a low bound of zero (0), while Fortran defaults to a + low bound of one (1) and can supports an arbitrary low bound. + Therefore, calculations must be done to determine what the C equivalent + of `A(5,10,20)' would be, and these calculations require knowing the + dimensions of `A'. + + For `DIMENSION A(2:11,21,0:29)', the calculation of the offset of + `A(5,10,20)' would be: + + (5-2) + + (10-1)*(11-2+1) + + (20-0)*(11-2+1)*(21-1+1) + = 4293 + + So the C equivalent in this case would be `a[4293]'. + + When using a debugger directly on Fortran code, the C equivalent + might not work, because some debuggers cannot understand the notion of + low bounds other than zero. However, unlike `f2c', `g77' does inform + the GBE that a multi-dimensional array (like `A' in the above example) + is really multi-dimensional, rather than a single-dimensional array, so + at least the dimensionality of the array is preserved. + + Debuggers that understand Fortran should have no trouble with + non-zero low bounds, but for non-Fortran debuggers, especially C + debuggers, the above example might have a C equivalent of `a[4305]'. + This calculation is arrived at by eliminating the subtraction of the + lower bound in the first parenthesized expression on each line--that + is, for `(5-2)' substitute `(5)', for `(10-1)' substitute `(10)', and + for `(20-0)' substitute `(20)'. Actually, the implication of this can + be that the expression `*(&a[2][1][0] + 4293)' works fine, but that + `a[20][10][5]' produces the equivalent of `*(&a[0][0][0] + 4305)' + because of the missing lower bounds. + + Come to think of it, perhaps the behavior is due to the debugger + internally compensating for the lower bounds by offsetting the base + address of `a', leaving `&a' set lower, in this case, than + `&a[2][1][0]' (the address of its first element as identified by + subscripts equal to the corresponding lower bounds). + + You know, maybe nobody really needs to use arrays. + +  + File: g77.info, Node: Adjustable Arrays, Next: Alternate Entry Points, Prev: Arrays, Up: Debugging and Interfacing + + Adjustable Arrays (DIMENSION) + ============================= + + Adjustable and automatic arrays in Fortran require the implementation + (in this case, the `g77' compiler) to "memorize" the expressions that + dimension the arrays each time the procedure is invoked. This is so + that subsequent changes to variables used in those expressions, made + during execution of the procedure, do not have any effect on the + dimensions of those arrays. + + For example: + + REAL ARRAY(5) + DATA ARRAY/5*2/ + CALL X(ARRAY, 5) + END + SUBROUTINE X(A, N) + DIMENSION A(N) + N = 20 + PRINT *, N, A + END + + Here, the implementation should, when running the program, print + something like: + + 20 2. 2. 2. 2. 2. + + Note that this shows that while the value of `N' was successfully + changed, the size of the `A' array remained at 5 elements. + + To support this, `g77' generates code that executes before any user + code (and before the internally generated computed `GOTO' to handle + alternate entry points, as described below) that evaluates each + (nonconstant) expression in the list of subscripts for an array, and + saves the result of each such evaluation to be used when determining + the size of the array (instead of re-evaluating the expressions). + + So, in the above example, when `X' is first invoked, code is + executed that copies the value of `N' to a temporary. And that same + temporary serves as the actual high bound for the single dimension of + the `A' array (the low bound being the constant 1). Since the user + program cannot (legitimately) change the value of the temporary during + execution of the procedure, the size of the array remains constant + during each invocation. + + For alternate entry points, the code `g77' generates takes into + account the possibility that a dummy adjustable array is not actually + passed to the actual entry point being invoked at that time. In that + case, the public procedure implementing the entry point passes to the + master private procedure implementing all the code for the entry points + a `NULL' pointer where a pointer to that adjustable array would be + expected. The `g77'-generated code doesn't attempt to evaluate any of + the expressions in the subscripts for an array if the pointer to that + array is `NULL' at run time in such cases. (Don't depend on this + particular implementation by writing code that purposely passes `NULL' + pointers where the callee expects adjustable arrays, even if you know + the callee won't reference the arrays--nor should you pass `NULL' + pointers for any dummy arguments used in calculating the bounds of such + arrays or leave undefined any values used for that purpose in + COMMON--because the way `g77' implements these things might change in + the future!) + +  + File: g77.info, Node: Alternate Entry Points, Next: Alternate Returns, Prev: Adjustable Arrays, Up: Debugging and Interfacing + + Alternate Entry Points (ENTRY) + ============================== + + The GBE does not understand the general concept of alternate entry + points as Fortran provides via the ENTRY statement. `g77' gets around + this by using an approach to compiling procedures having at least one + `ENTRY' statement that is almost identical to the approach used by + `f2c'. (An alternate approach could be used that would probably + generate faster, but larger, code that would also be a bit easier to + debug.) + + Information on how `g77' implements `ENTRY' is provided for those + trying to debug such code. The choice of implementation seems unlikely + to affect code (compiled in other languages) that interfaces to such + code. + + `g77' compiles exactly one public procedure for the primary entry + point of a procedure plus each `ENTRY' point it specifies, as usual. + That is, in terms of the public interface, there is no difference + between + + SUBROUTINE X + END + SUBROUTINE Y + END + + and: + + SUBROUTINE X + ENTRY Y + END + + The difference between the above two cases lies in the code compiled + for the `X' and `Y' procedures themselves, plus the fact that, for the + second case, an extra internal procedure is compiled. + + For every Fortran procedure with at least one `ENTRY' statement, + `g77' compiles an extra procedure named `__g77_masterfun_X', where X is + the name of the primary entry point (which, in the above case, using + the standard compiler options, would be `x_' in C). + + This extra procedure is compiled as a private procedure--that is, a + procedure not accessible by name to separately compiled modules. It + contains all the code in the program unit, including the code for the + primary entry point plus for every entry point. (The code for each + public procedure is quite short, and explained later.) + + The extra procedure has some other interesting characteristics. + + The argument list for this procedure is invented by `g77'. It + contains a single integer argument named `__g77_which_entrypoint', + passed by value (as in Fortran's `%VAL()' intrinsic), specifying the + entry point index--0 for the primary entry point, 1 for the first entry + point (the first `ENTRY' statement encountered), 2 for the second entry + point, and so on. + + It also contains, for functions returning `CHARACTER' and (when + `-ff2c' is in effect) `COMPLEX' functions, and for functions returning + different types among the `ENTRY' statements (e.g. `REAL FUNCTION R()' + containing `ENTRY I()'), an argument named `__g77_result' that is + expected at run time to contain a pointer to where to store the result + of the entry point. For `CHARACTER' functions, this storage area is an + array of the appropriate number of characters; for `COMPLEX' functions, + it is the appropriate area for the return type; for + multiple-return-type functions, it is a union of all the supported + return types (which cannot include `CHARACTER', since combining + `CHARACTER' and non-`CHARACTER' return types via `ENTRY' in a single + function is not supported by `g77'). + + For `CHARACTER' functions, the `__g77_result' argument is followed + by yet another argument named `__g77_length' that, at run time, + specifies the caller's expected length of the returned value. Note + that only `CHARACTER*(*)' functions and entry points actually make use + of this argument, even though it is always passed by all callers of + public `CHARACTER' functions (since the caller does not generally know + whether such a function is `CHARACTER*(*)' or whether there are any + other callers that don't have that information). + + The rest of the argument list is the union of all the arguments + specified for all the entry points (in their usual forms, e.g. + `CHARACTER' arguments have extra length arguments, all appended at the + end of this list). This is considered the "master list" of arguments. + + The code for this procedure has, before the code for the first + executable statement, code much like that for the following Fortran + statement: + + GOTO (100000,100001,100002), __g77_which_entrypoint + 100000 ...code for primary entry point... + 100001 ...code immediately following first ENTRY statement... + 100002 ...code immediately following second ENTRY statement... + + (Note that invalid Fortran statement labels and variable names are used + in the above example to highlight the fact that it represents code + generated by the `g77' internals, not code to be written by the user.) + + It is this code that, when the procedure is called, picks which + entry point to start executing. + + Getting back to the public procedures (`x' and `Y' in the original + example), those procedures are fairly simple. Their interfaces are + just like they would be if they were self-contained procedures (without + `ENTRY'), of course, since that is what the callers expect. Their code + consists of simply calling the private procedure, described above, with + the appropriate extra arguments (the entry point index, and perhaps a + pointer to a multiple-type- return variable, local to the public + procedure, that contains all the supported returnable non-character + types). For arguments that are not listed for a given entry point that + are listed for other entry points, and therefore that are in the + "master list" for the private procedure, null pointers (in C, the + `NULL' macro) are passed. Also, for entry points that are part of a + multiple-type- returning function, code is compiled after the call of + the private procedure to extract from the multi-type union the + appropriate result, depending on the type of the entry point in + question, returning that result to the original caller. + + When debugging a procedure containing alternate entry points, you + can either set a break point on the public procedure itself (e.g. a + break point on `X' or `Y') or on the private procedure that contains + most of the pertinent code (e.g. `__g77_masterfun_X'). If you do the + former, you should use the debugger's command to "step into" the called + procedure to get to the actual code; with the latter approach, the + break point leaves you right at the actual code, skipping over the + public entry point and its call to the private procedure (unless you + have set a break point there as well, of course). + + Further, the list of dummy arguments that is visible when the + private procedure is active is going to be the expanded version of the + list for whichever particular entry point is active, as explained + above, and the way in which return values are handled might well be + different from how they would be handled for an equivalent single-entry + function. + +  + File: g77.info, Node: Alternate Returns, Next: Assigned Statement Labels, Prev: Alternate Entry Points, Up: Debugging and Interfacing + + Alternate Returns (SUBROUTINE and RETURN) + ========================================= + + Subroutines with alternate returns (e.g. `SUBROUTINE X(*)' and `CALL + X(*50)') are implemented by `g77' as functions returning the C `int' + type. The actual alternate-return arguments are omitted from the + calling sequence. Instead, the caller uses the return value to do a + rough equivalent of the Fortran computed-`GOTO' statement, as in `GOTO + (50), X()' in the example above (where `X' is quietly declared as an + `INTEGER(KIND=1)' function), and the callee just returns whatever + integer is specified in the `RETURN' statement for the subroutine For + example, `RETURN 1' is implemented as `X = 1' followed by `RETURN' in + C, and `RETURN' by itself is `X = 0' and `RETURN'). + +  + File: g77.info, Node: Assigned Statement Labels, Next: Run-time Library Errors, Prev: Alternate Returns, Up: Debugging and Interfacing + + Assigned Statement Labels (ASSIGN and GOTO) + =========================================== + + For portability to machines where a pointer (such as to a label, + which is how `g77' implements `ASSIGN' and its relatives, the + assigned-`GOTO' and assigned-`FORMAT'-I/O statements) is wider + (bitwise) than an `INTEGER(KIND=1)', `g77' uses a different memory + location to hold the `ASSIGN'ed value of a variable than it does the + numerical value in that variable, unless the variable is wide enough + (can hold enough bits). + + In particular, while `g77' implements + + I = 10 + + as, in C notation, `i = 10;', it implements + + ASSIGN 10 TO I + + as, in GNU's extended C notation (for the label syntax), + `__g77_ASSIGN_I = &&L10;' (where `L10' is just a massaging of the + Fortran label `10' to make the syntax C-like; `g77' doesn't actually + generate the name `L10' or any other name like that, since debuggers + cannot access labels anyway). + + While this currently means that an `ASSIGN' statement does not + overwrite the numeric contents of its target variable, _do not_ write + any code depending on this feature. `g77' has already changed this + implementation across versions and might do so in the future. This + information is provided only to make debugging Fortran programs + compiled with the current version of `g77' somewhat easier. If there's + no debugger-visible variable named `__g77_ASSIGN_I' in a program unit + that does `ASSIGN 10 TO I', that probably means `g77' has decided it + can store the pointer to the label directly into `I' itself. + + *Note Ugly Assigned Labels::, for information on a command-line + option to force `g77' to use the same storage for both normal and + assigned-label uses of a variable. + +  + File: g77.info, Node: Run-time Library Errors, Prev: Assigned Statement Labels, Up: Debugging and Interfacing + + Run-time Library Errors + ======================= + + The `libg2c' library currently has the following table to relate + error code numbers, returned in `IOSTAT=' variables, to messages. This + information should, in future versions of this document, be expanded + upon to include detailed descriptions of each message. + + In line with good coding practices, any of the numbers in the list + below should _not_ be directly written into Fortran code you write. + Instead, make a separate `INCLUDE' file that defines `PARAMETER' names + for them, and use those in your code, so you can more easily change the + actual numbers in the future. + + The information below is culled from the definition of `F_err' in + `f/runtime/libI77/err.c' in the `g77' source tree. + + 100: "error in format" + 101: "illegal unit number" + 102: "formatted io not allowed" + 103: "unformatted io not allowed" + 104: "direct io not allowed" + 105: "sequential io not allowed" + 106: "can't backspace file" + 107: "null file name" + 108: "can't stat file" + 109: "unit not connected" + 110: "off end of record" + 111: "truncation failed in endfile" + 112: "incomprehensible list input" + 113: "out of free space" + 114: "unit not connected" + 115: "read unexpected character" + 116: "bad logical input field" + 117: "bad variable type" + 118: "bad namelist name" + 119: "variable not in namelist" + 120: "no end record" + 121: "variable count incorrect" + 122: "subscript for scalar variable" + 123: "invalid array section" + 124: "substring out of bounds" + 125: "subscript out of bounds" + 126: "can't read file" + 127: "can't write file" + 128: "'new' file exists" + 129: "can't append to file" + 130: "non-positive record number" + 131: "I/O started while already doing I/O" + +  + File: g77.info, Node: Collected Fortran Wisdom, Next: Trouble, Prev: Debugging and Interfacing, Up: Top + + Collected Fortran Wisdom + ************************ + + Most users of `g77' can be divided into two camps: + + * Those writing new Fortran code to be compiled by `g77'. + + * Those using `g77' to compile existing, "legacy" code. + + Users writing new code generally understand most of the necessary + aspects of Fortran to write "mainstream" code, but often need help + deciding how to handle problems, such as the construction of libraries + containing `BLOCK DATA'. + + Users dealing with "legacy" code sometimes don't have much + experience with Fortran, but believe that the code they're compiling + already works when compiled by other compilers (and might not + understand why, as is sometimes the case, it doesn't work when compiled + by `g77'). + + The following information is designed to help users do a better job + coping with existing, "legacy" Fortran code, and with writing new code + as well. + + * Menu: + + * Advantages Over f2c:: If `f2c' is so great, why `g77'? + * Block Data and Libraries:: How `g77' solves a common problem. + * Loops:: Fortran `DO' loops surprise many people. + * Working Programs:: Getting programs to work should be done first. + * Overly Convenient Options:: Temptations to avoid, habits to not form. + * Faster Programs:: Everybody wants these, but at what cost? + +  + File: g77.info, Node: Advantages Over f2c, Next: Block Data and Libraries, Up: Collected Fortran Wisdom + + Advantages Over f2c + =================== + + Without `f2c', `g77' would have taken much longer to do and probably + not been as good for quite a while. Sometimes people who notice how + much `g77' depends on, and documents encouragement to use, `f2c' ask + why `g77' was created if `f2c' already existed. + + This section gives some basic answers to these questions, though it + is not intended to be comprehensive. + + * Menu: + + * Language Extensions:: Features used by Fortran code. + * Diagnostic Abilities:: Abilities to spot problems early. + * Compiler Options:: Features helpful to accommodate legacy code, etc. + * Compiler Speed:: Speed of the compilation process. + * Program Speed:: Speed of the generated, optimized code. + * Ease of Debugging:: Debugging ease-of-use at the source level. + * Character and Hollerith Constants:: A byte saved is a byte earned. + +  + File: g77.info, Node: Language Extensions, Next: Diagnostic Abilities, Up: Advantages Over f2c + + Language Extensions + ------------------- + + `g77' offers several extensions to FORTRAN 77 language that `f2c' + doesn't: + + * Automatic arrays + + * `CYCLE' and `EXIT' + + * Construct names + + * `SELECT CASE' + + * `KIND=' and `LEN=' notation + + * Semicolon as statement separator + + * Constant expressions in `FORMAT' statements (such as + `FORMAT(I)', where `J' is a `PARAMETER' named constant) + + * `MvBits' intrinsic + + * `libU77' (Unix-compatibility) library, with routines known to + compiler as intrinsics (so they work even when compiler options + are used to change the interfaces used by Fortran routines) + + `g77' also implements iterative `DO' loops so that they work even in + the presence of certain "extreme" inputs, unlike `f2c'. *Note Loops::. + + However, `f2c' offers a few that `g77' doesn't, such as: + + * Intrinsics in `PARAMETER' statements + + * Array bounds expressions (such as `REAL M(N(2))') + + * `AUTOMATIC' statement + + It is expected that `g77' will offer some or all of these missing + features at some time in the future. + +  + File: g77.info, Node: Diagnostic Abilities, Next: Compiler Options, Prev: Language Extensions, Up: Advantages Over f2c + + Diagnostic Abilities + -------------------- + + `g77' offers better diagnosis of problems in `FORMAT' statements. + `f2c' doesn't, for example, emit any diagnostic for + `FORMAT(XZFAJG10324)', leaving that to be diagnosed, at run time, by + the `libf2c' run-time library. + +  + File: g77.info, Node: Compiler Options, Next: Compiler Speed, Prev: Diagnostic Abilities, Up: Advantages Over f2c + + Compiler Options + ---------------- + + `g77' offers compiler options that `f2c' doesn't, most of which are + designed to more easily accommodate legacy code: + + * Two that control the automatic appending of extra underscores to + external names + + * One that allows dollar signs (`$') in symbol names + + * A variety that control acceptance of various "ugly" constructs + + * Several that specify acceptable use of upper and lower case in the + source code + + * Many that enable, disable, delete, or hide groups of intrinsics + + * One to specify the length of fixed-form source lines (normally 72) + + * One to specify the the source code is written in Fortran-90-style + free-form + + However, `f2c' offers a few that `g77' doesn't, like an option to + have `REAL' default to `REAL*8'. It is expected that `g77' will offer + all of the missing options pertinent to being a Fortran compiler at + some time in the future. + +  + File: g77.info, Node: Compiler Speed, Next: Program Speed, Prev: Compiler Options, Up: Advantages Over f2c + + Compiler Speed + -------------- + + Saving the steps of writing and then rereading C code is a big reason + why `g77' should be able to compile code much faster than using `f2c' + in conjunction with the equivalent invocation of `gcc'. + + However, due to `g77''s youth, lots of self-checking is still being + performed. As a result, this improvement is as yet unrealized (though + the potential seems to be there for quite a big speedup in the future). + It is possible that, as of version 0.5.18, `g77' is noticeably faster + compiling many Fortran source files than using `f2c' in conjunction + with `gcc'. + +  + File: g77.info, Node: Program Speed, Next: Ease of Debugging, Prev: Compiler Speed, Up: Advantages Over f2c + + Program Speed + ------------- + + `g77' has the potential to better optimize code than `f2c', even + when `gcc' is used to compile the output of `f2c', because `f2c' must + necessarily translate Fortran into a somewhat lower-level language (C) + that cannot preserve all the information that is potentially useful for + optimization, while `g77' can gather, preserve, and transmit that + information directly to the GBE. + + For example, `g77' implements `ASSIGN' and assigned `GOTO' using + direct assignment of pointers to labels and direct jumps to labels, + whereas `f2c' maps the assigned labels to integer values and then uses + a C `switch' statement to encode the assigned `GOTO' statements. + + However, as is typical, theory and reality don't quite match, at + least not in all cases, so it is still the case that `f2c' plus `gcc' + can generate code that is faster than `g77'. + + Version 0.5.18 of `g77' offered default settings and options, via + patches to the `gcc' back end, that allow for better program speed, + though some of these improvements also affected the performance of + programs translated by `f2c' and then compiled by `g77''s version of + `gcc'. + + Version 0.5.20 of `g77' offers further performance improvements, at + least one of which (alias analysis) is not generally applicable to + `f2c' (though `f2c' could presumably be changed to also take advantage + of this new capability of the `gcc' back end, assuming this is made + available in an upcoming release of `gcc'). + +  + File: g77.info, Node: Ease of Debugging, Next: Character and Hollerith Constants, Prev: Program Speed, Up: Advantages Over f2c + + Ease of Debugging + ----------------- + + Because `g77' compiles directly to assembler code like `gcc', + instead of translating to an intermediate language (C) as does `f2c', + support for debugging can be better for `g77' than `f2c'. + + However, although `g77' might be somewhat more "native" in terms of + debugging support than `f2c' plus `gcc', there still are a lot of + things "not quite right". Many of the important ones should be + resolved in the near future. + + For example, `g77' doesn't have to worry about reserved names like + `f2c' does. Given `FOR = WHILE', `f2c' must necessarily translate this + to something _other_ than `for = while;', because C reserves those + words. + + However, `g77' does still uses things like an extra level of + indirection for `ENTRY'-laden procedures--in this case, because the + back end doesn't yet support multiple entry points. + + Another example is that, given + + COMMON A, B + EQUIVALENCE (B, C) + + the `g77' user should be able to access the variables directly, by name, + without having to traverse C-like structures and unions, while `f2c' is + unlikely to ever offer this ability (due to limitations in the C + language). + + However, due to apparent bugs in the back end, `g77' currently + doesn't take advantage of this facility at all--it doesn't emit any + debugging information for `COMMON' and `EQUIVALENCE' areas, other than + information on the array of `char' it creates (and, in the case of + local `EQUIVALENCE', names) for each such area. + + Yet another example is arrays. `g77' represents them to the debugger + using the same "dimensionality" as in the source code, while `f2c' must + necessarily convert them all to one-dimensional arrays to fit into the + confines of the C language. However, the level of support offered by + debuggers for interactive Fortran-style access to arrays as compiled by + `g77' can vary widely. In some cases, it can actually be an advantage + that `f2c' converts everything to widely supported C semantics. + + In fairness, `g77' could do many of the things `f2c' does to get + things working at least as well as `f2c'--for now, the developers + prefer making `g77' work the way they think it is supposed to, and + finding help improving the other products (the back end of `gcc'; + `gdb'; and so on) to get things working properly. + +  + File: g77.info, Node: Character and Hollerith Constants, Prev: Ease of Debugging, Up: Advantages Over f2c + + Character and Hollerith Constants + --------------------------------- + + To avoid the extensive hassle that would be needed to avoid this, + `f2c' uses C character constants to encode character and Hollerith + constants. That means a constant like `'HELLO'' is translated to + `"hello"' in C, which further means that an extra null byte is present + at the end of the constant. This null byte is superfluous. + + `g77' does not generate such null bytes. This represents significant + savings of resources, such as on systems where `/dev/null' or + `/dev/zero' represent bottlenecks in the systems' performance, because + `g77' simply asks for fewer zeros from the operating system than `f2c'. + (Avoiding spurious use of zero bytes, each byte typically have eight + zero bits, also reduces the liabilities in case Microsoft's rumored + patent on the digits 0 and 1 is upheld.) + +  + File: g77.info, Node: Block Data and Libraries, Next: Loops, Prev: Advantages Over f2c, Up: Collected Fortran Wisdom + + Block Data and Libraries + ======================== + + To ensure that block data program units are linked, especially a + concern when they are put into libraries, give each one a name (as in + `BLOCK DATA FOO') and make sure there is an `EXTERNAL FOO' statement in + every program unit that uses any common block initialized by the + corresponding `BLOCK DATA'. `g77' currently compiles a `BLOCK DATA' as + if it were a `SUBROUTINE', that is, it generates an actual procedure + having the appropriate name. The procedure does nothing but return + immediately if it happens to be called. For `EXTERNAL FOO', where + `FOO' is not otherwise referenced in the same program unit, `g77' + assumes there exists a `BLOCK DATA FOO' in the program and ensures that + by generating a reference to it so the linker will make sure it is + present. (Specifically, `g77' outputs in the data section a static + pointer to the external name `FOO'.) + + The implementation `g77' currently uses to make this work is one of + the few things not compatible with `f2c' as currently shipped. `f2c' + currently does nothing with `EXTERNAL FOO' except issue a warning that + `FOO' is not otherwise referenced, and, for `BLOCK DATA FOO', `f2c' + doesn't generate a dummy procedure with the name `FOO'. The upshot is + that you shouldn't mix `f2c' and `g77' in this particular case. If you + use `f2c' to compile `BLOCK DATA FOO', then any `g77'-compiled program + unit that says `EXTERNAL FOO' will result in an unresolved reference + when linked. If you do the opposite, then `FOO' might not be linked in + under various circumstances (such as when `FOO' is in a library, or + you're using a "clever" linker--so clever, it produces a broken program + with little or no warning by omitting initializations of global data + because they are contained in unreferenced procedures). + + The changes you make to your code to make `g77' handle this + situation, however, appear to be a widely portable way to handle it. + That is, many systems permit it (as they should, since the FORTRAN 77 + standard permits `EXTERNAL FOO' when `FOO' is a block data program + unit), and of the ones that might not link `BLOCK DATA FOO' under some + circumstances, most of them appear to do so once `EXTERNAL FOO' is + present in the appropriate program units. + + Here is the recommended approach to modifying a program containing a + program unit such as the following: + + BLOCK DATA FOO + COMMON /VARS/ X, Y, Z + DATA X, Y, Z / 3., 4., 5. / + END + + If the above program unit might be placed in a library module, then + ensure that every program unit in every program that references that + particular `COMMON' area uses the `EXTERNAL' statement to force the + area to be initialized. + + For example, change a program unit that starts with + + INTEGER FUNCTION CURX() + COMMON /VARS/ X, Y, Z + CURX = X + END + + so that it uses the `EXTERNAL' statement, as in: + + INTEGER FUNCTION CURX() + COMMON /VARS/ X, Y, Z + EXTERNAL FOO + CURX = X + END + + That way, `CURX' is compiled by `g77' (and many other compilers) so + that the linker knows it must include `FOO', the `BLOCK DATA' program + unit that sets the initial values for the variables in `VAR', in the + executable program. + +  + File: g77.info, Node: Loops, Next: Working Programs, Prev: Block Data and Libraries, Up: Collected Fortran Wisdom + + Loops + ===== + + The meaning of a `DO' loop in Fortran is precisely specified in the + Fortran standard...and is quite different from what many programmers + might expect. + + In particular, Fortran iterative `DO' loops are implemented as if + the number of trips through the loop is calculated _before_ the loop is + entered. + + The number of trips for a loop is calculated from the START, END, + and INCREMENT values specified in a statement such as: + + DO ITER = START, END, INCREMENT + + The trip count is evaluated using a fairly simple formula based on the + three values following the `=' in the statement, and it is that trip + count that is effectively decremented during each iteration of the loop. + If, at the beginning of an iteration of the loop, the trip count is + zero or negative, the loop terminates. The per-loop-iteration + modifications to ITER are not related to determining whether to + terminate the loop. + + There are two important things to remember about the trip count: + + * It can be _negative_, in which case it is treated as if it was + zero--meaning the loop is not executed at all. + + * The type used to _calculate_ the trip count is the same type as + ITER, but the final calculation, and thus the type of the trip + count itself, always is `INTEGER(KIND=1)'. + + These two items mean that there are loops that cannot be written in + straightforward fashion using the Fortran `DO'. + + For example, on a system with the canonical 32-bit two's-complement + implementation of `INTEGER(KIND=1)', the following loop will not work: + + DO I = -2000000000, 2000000000 + + Although the START and END values are well within the range of + `INTEGER(KIND=1)', the _trip count_ is not. The expected trip count is + 40000000001, which is outside the range of `INTEGER(KIND=1)' on many + systems. + + Instead, the above loop should be constructed this way: + + I = -2000000000 + DO + IF (I .GT. 2000000000) EXIT + ... + I = I + 1 + END DO + + The simple `DO' construct and the `EXIT' statement (used to leave the + innermost loop) are F90 features that `g77' supports. + + Some Fortran compilers have buggy implementations of `DO', in that + they don't follow the standard. They implement `DO' as a + straightforward translation to what, in C, would be a `for' statement. + Instead of creating a temporary variable to hold the trip count as + calculated at run time, these compilers use the iteration variable ITER + to control whether the loop continues at each iteration. + + The bug in such an implementation shows up when the trip count is + within the range of the type of ITER, but the magnitude of `ABS(END) + + ABS(INCR)' exceeds that range. For example: + + DO I = 2147483600, 2147483647 + + A loop started by the above statement will work as implemented by + `g77', but the use, by some compilers, of a more C-like implementation + akin to + + for (i = 2147483600; i <= 2147483647; ++i) + + produces a loop that does not terminate, because `i' can never be + greater than 2147483647, since incrementing it beyond that value + overflows `i', setting it to -2147483648. This is a large, negative + number that still is less than 2147483647. + + Another example of unexpected behavior of `DO' involves using a + nonintegral iteration variable ITER, that is, a `REAL' variable. + Consider the following program: + + DATA BEGIN, END, STEP /.1, .31, .007/ + DO 10 R = BEGIN, END, STEP + IF (R .GT. END) PRINT *, R, ' .GT. ', END, '!!' + PRINT *,R + 10 CONTINUE + PRINT *,'LAST = ',R + IF (R .LE. END) PRINT *, R, ' .LE. ', END, '!!' + END + + A C-like view of `DO' would hold that the two "exclamatory" `PRINT' + statements are never executed. However, this is the output of running + the above program as compiled by `g77' on a GNU/Linux ix86 system: + + .100000001 + .107000001 + .114 + .120999999 + ... + .289000005 + .296000004 + .303000003 + LAST = .310000002 + .310000002 .LE. .310000002!! + + Note that one of the two checks in the program turned up an apparent + violation of the programmer's expectation--yet, the loop is correctly + implemented by `g77', in that it has 30 iterations. This trip count of + 30 is correct when evaluated using the floating-point representations + for the BEGIN, END, and INCR values (.1, .31, .007) on GNU/Linux ix86 + are used. On other systems, an apparently more accurate trip count of + 31 might result, but, nevertheless, `g77' is faithfully following the + Fortran standard, and the result is not what the author of the sample + program above apparently expected. (Such other systems might, for + different values in the `DATA' statement, violate the other + programmer's expectation, for example.) + + Due to this combination of imprecise representation of + floating-point values and the often-misunderstood interpretation of + `DO' by standard-conforming compilers such as `g77', use of `DO' loops + with `REAL' iteration variables is not recommended. Such use can be + caught by specifying `-Wsurprising'. *Note Warning Options::, for more + information on this option. + +  + File: g77.info, Node: Working Programs, Next: Overly Convenient Options, Prev: Loops, Up: Collected Fortran Wisdom + + Working Programs + ================ + + Getting Fortran programs to work in the first place can be quite a + challenge--even when the programs already work on other systems, or + when using other compilers. + + `g77' offers some facilities that might be useful for tracking down + bugs in such programs. + + * Menu: + + * Not My Type:: + * Variables Assumed To Be Zero:: + * Variables Assumed To Be Saved:: + * Unwanted Variables:: + * Unused Arguments:: + * Surprising Interpretations of Code:: + * Aliasing Assumed To Work:: + * Output Assumed To Flush:: + * Large File Unit Numbers:: + * Floating-point precision:: + * Inconsistent Calling Sequences:: + +  + File: g77.info, Node: Not My Type, Next: Variables Assumed To Be Zero, Up: Working Programs + + Not My Type + ----------- + + A fruitful source of bugs in Fortran source code is use, or mis-use, + of Fortran's implicit-typing feature, whereby the type of a variable, + array, or function is determined by the first character of its name. + + Simple cases of this include statements like `LOGX=9.227', without a + statement such as `REAL LOGX'. In this case, `LOGX' is implicitly + given `INTEGER(KIND=1)' type, with the result of the assignment being + that it is given the value `9'. + + More involved cases include a function that is defined starting with + a statement like `DOUBLE PRECISION FUNCTION IPS(...)'. Any caller of + this function that does not also declare `IPS' as type `DOUBLE + PRECISION' (or, in GNU Fortran, `REAL(KIND=2)') is likely to assume it + returns `INTEGER', or some other type, leading to invalid results or + even program crashes. + + The `-Wimplicit' option might catch failures to properly specify the + types of variables, arrays, and functions in the code. + + However, in code that makes heavy use of Fortran's implicit-typing + facility, this option might produce so many warnings about cases that + are working, it would be hard to find the one or two that represent + bugs. This is why so many experienced Fortran programmers strongly + recommend widespread use of the `IMPLICIT NONE' statement, despite it + not being standard FORTRAN 77, to completely turn off implicit typing. + (`g77' supports `IMPLICIT NONE', as do almost all FORTRAN 77 compilers.) + + Note that `-Wimplicit' catches only implicit typing of _names_. It + does not catch implicit typing of expressions such as `X**(2/3)'. Such + expressions can be buggy as well--in fact, `X**(2/3)' is equivalent to + `X**0', due to the way Fortran expressions are given types and then + evaluated. (In this particular case, the programmer probably wanted + `X**(2./3.)'.) + +  + File: g77.info, Node: Variables Assumed To Be Zero, Next: Variables Assumed To Be Saved, Prev: Not My Type, Up: Working Programs + + Variables Assumed To Be Zero + ---------------------------- + + Many Fortran programs were developed on systems that provided + automatic initialization of all, or some, variables and arrays to zero. + As a result, many of these programs depend, sometimes inadvertently, on + this behavior, though to do so violates the Fortran standards. + + You can ask `g77' for this behavior by specifying the + `-finit-local-zero' option when compiling Fortran code. (You might + want to specify `-fno-automatic' as well, to avoid code-size inflation + for non-optimized compilations.) + + Note that a program that works better when compiled with the + `-finit-local-zero' option is almost certainly depending on a + particular system's, or compiler's, tendency to initialize some + variables to zero. It might be worthwhile finding such cases and + fixing them, using techniques such as compiling with the `-O + -Wuninitialized' options using `g77'. + +  + File: g77.info, Node: Variables Assumed To Be Saved, Next: Unwanted Variables, Prev: Variables Assumed To Be Zero, Up: Working Programs + + Variables Assumed To Be Saved + ----------------------------- + + Many Fortran programs were developed on systems that saved the + values of all, or some, variables and arrays across procedure calls. + As a result, many of these programs depend, sometimes inadvertently, on + being able to assign a value to a variable, perform a `RETURN' to a + calling procedure, and, upon subsequent invocation, reference the + previously assigned variable to obtain the value. + + They expect this despite not using the `SAVE' statement to specify + that the value in a variable is expected to survive procedure returns + and calls. Depending on variables and arrays to retain values across + procedure calls without using `SAVE' to require it violates the Fortran + standards. + + You can ask `g77' to assume `SAVE' is specified for all relevant + (local) variables and arrays by using the `-fno-automatic' option. + + Note that a program that works better when compiled with the + `-fno-automatic' option is almost certainly depending on not having to + use the `SAVE' statement as required by the Fortran standard. It might + be worthwhile finding such cases and fixing them, using techniques such + as compiling with the `-O -Wuninitialized' options using `g77'. + +  + File: g77.info, Node: Unwanted Variables, Next: Unused Arguments, Prev: Variables Assumed To Be Saved, Up: Working Programs + + Unwanted Variables + ------------------ + + The `-Wunused' option can find bugs involving implicit typing, + sometimes more easily than using `-Wimplicit' in code that makes heavy + use of implicit typing. An unused variable or array might indicate + that the spelling for its declaration is different from that of its + intended uses. + + Other than cases involving typos, unused variables rarely indicate + actual bugs in a program. However, investigating such cases thoroughly + has, on occasion, led to the discovery of code that had not been + completely written--where the programmer wrote declarations as needed + for the whole algorithm, wrote some or even most of the code for that + algorithm, then got distracted and forgot that the job was not complete. + +  + File: g77.info, Node: Unused Arguments, Next: Surprising Interpretations of Code, Prev: Unwanted Variables, Up: Working Programs + + Unused Arguments + ---------------- + + As with unused variables, It is possible that unused arguments to a + procedure might indicate a bug. Compile with `-W -Wunused' option to + catch cases of unused arguments. + + Note that `-W' also enables warnings regarding overflow of + floating-point constants under certain circumstances. + +  + File: g77.info, Node: Surprising Interpretations of Code, Next: Aliasing Assumed To Work, Prev: Unused Arguments, Up: Working Programs + + Surprising Interpretations of Code + ---------------------------------- + + The `-Wsurprising' option can help find bugs involving expression + evaluation or in the way `DO' loops with non-integral iteration + variables are handled. Cases found by this option might indicate a + difference of interpretation between the author of the code involved, + and a standard-conforming compiler such as `g77'. Such a difference + might produce actual bugs. + + In any case, changing the code to explicitly do what the programmer + might have expected it to do, so `g77' and other compilers are more + likely to follow the programmer's expectations, might be worthwhile, + especially if such changes make the program work better. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-15 gcc-3.2.3/gcc/f/g77.info-15 *** gcc-3.2.2/gcc/f/g77.info-15 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-15 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1087 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Aliasing Assumed To Work, Next: Output Assumed To Flush, Prev: Surprising Interpretations of Code, Up: Working Programs + + Aliasing Assumed To Work + ------------------------ + + The `-falias-check', `-fargument-alias', `-fargument-noalias', and + `-fno-argument-noalias-global' options, introduced in version 0.5.20 and + `g77''s version 2.7.2.2.f.2 of `gcc', were withdrawn as of `g77' + version 0.5.23 due to their not being supported by `gcc' version 2.8. + + These options control the assumptions regarding aliasing + (overlapping) of writes and reads to main memory (core) made by the + `gcc' back end. + + The information below still is useful, but applies to only those + versions of `g77' that support the alias analysis implied by support + for these options. + + These options are effective only when compiling with `-O' + (specifying any level other than `-O0') or with `-falias-check'. + + The default for Fortran code is `-fargument-noalias-global'. (The + default for C code and code written in other C-based languages is + `-fargument-alias'. These defaults apply regardless of whether you use + `g77' or `gcc' to compile your code.) + + Note that, on some systems, compiling with `-fforce-addr' in effect + can produce more optimal code when the default aliasing options are in + effect (and when optimization is enabled). + + If your program is not working when compiled with optimization, it + is possible it is violating the Fortran standards (77 and 90) by + relying on the ability to "safely" modify variables and arrays that are + aliased, via procedure calls, to other variables and arrays, without + using `EQUIVALENCE' to explicitly set up this kind of aliasing. + + (The FORTRAN 77 standard's prohibition of this sort of overlap, + generally referred to therein as "storage assocation", appears in + Sections 15.9.3.6. This prohibition allows implementations, such as + `g77', to, for example, implement the passing of procedures and even + values in `COMMON' via copy operations into local, perhaps more + efficiently accessed temporaries at entry to a procedure, and, where + appropriate, via copy operations back out to their original locations + in memory at exit from that procedure, without having to take into + consideration the order in which the local copies are updated by the + code, among other things.) + + To test this hypothesis, try compiling your program with the + `-fargument-alias' option, which causes the compiler to revert to + assumptions essentially the same as made by versions of `g77' prior to + 0.5.20. + + If the program works using this option, that strongly suggests that + the bug is in your program. Finding and fixing the bug(s) should + result in a program that is more standard-conforming and that can be + compiled by `g77' in a way that results in a faster executable. + + (You might want to try compiling with `-fargument-noalias', a kind + of half-way point, to see if the problem is limited to aliasing between + dummy arguments and `COMMON' variables--this option assumes that such + aliasing is not done, while still allowing aliasing among dummy + arguments.) + + An example of aliasing that is invalid according to the standards is + shown in the following program, which might _not_ produce the expected + results when executed: + + I = 1 + CALL FOO(I, I) + PRINT *, I + END + + SUBROUTINE FOO(J, K) + J = J + K + K = J * K + PRINT *, J, K + END + + The above program attempts to use the temporary aliasing of the `J' + and `K' arguments in `FOO' to effect a pathological behavior--the + simultaneous changing of the values of _both_ `J' and `K' when either + one of them is written. + + The programmer likely expects the program to print these values: + + 2 4 + 4 + + However, since the program is not standard-conforming, an + implementation's behavior when running it is undefined, because + subroutine `FOO' modifies at least one of the arguments, and they are + aliased with each other. (Even if one of the assignment statements was + deleted, the program would still violate these rules. This kind of + on-the-fly aliasing is permitted by the standard only when none of the + aliased items are defined, or written, while the aliasing is in effect.) + + As a practical example, an optimizing compiler might schedule the `J + =' part of the second line of `FOO' _after_ the reading of `J' and `K' + for the `J * K' expression, resulting in the following output: + + 2 2 + 2 + + Essentially, compilers are promised (by the standard and, therefore, + by programmers who write code they claim to be standard-conforming) + that if they cannot detect aliasing via static analysis of a single + program unit's `EQUIVALENCE' and `COMMON' statements, no such aliasing + exists. In such cases, compilers are free to assume that an assignment + to one variable will not change the value of another variable, allowing + it to avoid generating code to re-read the value of the other variable, + to re-schedule reads and writes, and so on, to produce a faster + executable. + + The same promise holds true for arrays (as seen by the called + procedure)--an element of one dummy array cannot be aliased with, or + overlap, any element of another dummy array or be in a `COMMON' area + known to the procedure. + + (These restrictions apply only when the procedure defines, or writes + to, one of the aliased variables or arrays.) + + Unfortunately, there is no way to find _all_ possible cases of + violations of the prohibitions against aliasing in Fortran code. + Static analysis is certainly imperfect, as is run-time analysis, since + neither can catch all violations. (Static analysis can catch all + likely violations, and some that might never actually happen, while + run-time analysis can catch only those violations that actually happen + during a particular run. Neither approach can cope with programs + mixing Fortran code with routines written in other languages, however.) + + Currently, `g77' provides neither static nor run-time facilities to + detect any cases of this problem, although other products might. + Run-time facilities are more likely to be offered by future versions of + `g77', though patches improving `g77' so that it provides either form + of detection are welcome. + +  + File: g77.info, Node: Output Assumed To Flush, Next: Large File Unit Numbers, Prev: Aliasing Assumed To Work, Up: Working Programs + + Output Assumed To Flush + ----------------------- + + For several versions prior to 0.5.20, `g77' configured its version + of the `libf2c' run-time library so that one of its configuration + macros, `ALWAYS_FLUSH', was defined. + + This was done as a result of a belief that many programs expected + output to be flushed to the operating system (under UNIX, via the + `fflush()' library call) with the result that errors, such as disk + full, would be immediately flagged via the relevant `ERR=' and + `IOSTAT=' mechanism. + + Because of the adverse effects this approach had on the performance + of many programs, `g77' no longer configures `libf2c' (now named + `libg2c' in its `g77' incarnation) to always flush output. + + If your program depends on this behavior, either insert the + appropriate `CALL FLUSH' statements, or modify the sources to the + `libg2c', rebuild and reinstall `g77', and relink your programs with + the modified library. + + (Ideally, `libg2c' would offer the choice at run-time, so that a + compile-time option to `g77' or `f2c' could result in generating the + appropriate calls to flushing or non-flushing library routines.) + + Some Fortran programs require output (writes) to be flushed to the + operating system (under UNIX, via the `fflush()' library call) so that + errors, such as disk full, are immediately flagged via the relevant + `ERR=' and `IOSTAT=' mechanism, instead of such errors being flagged + later as subsequent writes occur, forcing the previously written data + to disk, or when the file is closed. + + Essentially, the difference can be viewed as synchronous error + reporting (immediate flagging of errors during writes) versus + asynchronous, or, more precisely, buffered error reporting (detection + of errors might be delayed). + + `libg2c' supports flagging write errors immediately when it is built + with the `ALWAYS_FLUSH' macro defined. This results in a `libg2c' that + runs slower, sometimes quite a bit slower, under certain + circumstances--for example, accessing files via the networked file + system NFS--but the effect can be more reliable, robust file I/O. + + If you know that Fortran programs requiring this level of precision + of error reporting are to be compiled using the version of `g77' you + are building, you might wish to modify the `g77' source tree so that + the version of `libg2c' is built with the `ALWAYS_FLUSH' macro defined, + enabling this behavior. + + To do this, find this line in `gcc/libf2c/f2c.h' in your `g77' + source tree: + + /* #define ALWAYS_FLUSH */ + + Remove the leading `/* ', so the line begins with `#define', and the + trailing ` */'. + + Then build or rebuild `g77' as appropriate. + +  + File: g77.info, Node: Large File Unit Numbers, Next: Floating-point precision, Prev: Output Assumed To Flush, Up: Working Programs + + Large File Unit Numbers + ----------------------- + + If your program crashes at run time with a message including the + text `illegal unit number', that probably is a message from the + run-time library, `libg2c'. + + The message means that your program has attempted to use a file unit + number that is out of the range accepted by `libg2c'. Normally, this + range is 0 through 99, and the high end of the range is controlled by a + `libg2c' source-file macro named `MXUNIT'. + + If you can easily change your program to use unit numbers in the + range 0 through 99, you should do so. + + As distributed, whether as part of `f2c' or `g77', `libf2c' accepts + file unit numbers only in the range 0 through 99. For example, a + statement such as `WRITE (UNIT=100)' causes a run-time crash in + `libf2c', because the unit number, 100, is out of range. + + If you know that Fortran programs at your installation require the + use of unit numbers higher than 99, you can change the value of the + `MXUNIT' macro, which represents the maximum unit number, to an + appropriately higher value. + + To do this, edit the file `gcc/libf2c/libI77/fio.h' in your `g77' + source tree, changing the following line: + + #define MXUNIT 100 + + Change the line so that the value of `MXUNIT' is defined to be at + least one _greater_ than the maximum unit number used by the Fortran + programs on your system. + + (For example, a program that does `WRITE (UNIT=255)' would require + `MXUNIT' set to at least 256 to avoid crashing.) + + Then build or rebuild `g77' as appropriate. + + _Note:_ Changing this macro has _no_ effect on other limits your + system might place on the number of files open at the same time. That + is, the macro might allow a program to do `WRITE (UNIT=100)', but the + library and operating system underlying `libf2c' might disallow it if + many other files have already been opened (via `OPEN' or implicitly via + `READ', `WRITE', and so on). Information on how to increase these + other limits should be found in your system's documentation. + +  + File: g77.info, Node: Floating-point precision, Next: Inconsistent Calling Sequences, Prev: Large File Unit Numbers, Up: Working Programs + + Floating-point precision + ------------------------ + + If your program depends on exact IEEE 754 floating-point handling it + may help on some systems--specifically x86 or m68k hardware--to use the + `-ffloat-store' option or to reset the precision flag on the + floating-point unit. *Note Optimize Options::. + + However, it might be better simply to put the FPU into double + precision mode and not take the performance hit of `-ffloat-store'. On + x86 and m68k GNU systems you can do this with a technique similar to + that for turning on floating-point exceptions (*note Floating-point + Exception Handling::). The control word could be set to double + precision by some code like this one: + #include + { + fpu_control_t cw = (_FPU_DEFAULT & ~_FPU_EXTENDED) | _FPU_DOUBLE; + _FPU_SETCW(cw); + } + (It is not clear whether this has any effect on the operation of the + GNU maths library, but we have no evidence of it causing trouble.) + + Some targets (such as the Alpha) may need special options for full + IEEE conformance. *Note Hardware Models and Configurations: + (gcc)Submodel Options. + +  + File: g77.info, Node: Inconsistent Calling Sequences, Prev: Floating-point precision, Up: Working Programs + + Inconsistent Calling Sequences + ------------------------------ + + Code containing inconsistent calling sequences in the same file is + normally rejected--see *Note GLOBALS::. (Use, say, `ftnchek' to ensure + consistency across source files. *Note Generating Skeletons and + Prototypes with `f2c': f2c Skeletons and Prototypes.) + + Mysterious errors, which may appear to be code generation problems, + can appear specifically on the x86 architecture with some such + inconsistencies. On x86 hardware, floating-point return values of + functions are placed on the floating-point unit's register stack, not + the normal stack. Thus calling a `REAL' or `DOUBLE PRECISION' + `FUNCTION' as some other sort of procedure, or vice versa, scrambles + the floating-point stack. This may break unrelated code executed + later. Similarly if, say, external C routines are written incorrectly. + +  + File: g77.info, Node: Overly Convenient Options, Next: Faster Programs, Prev: Working Programs, Up: Collected Fortran Wisdom + + Overly Convenient Command-line Options + ====================================== + + These options should be used only as a quick-and-dirty way to + determine how well your program will run under different compilation + models without having to change the source. Some are more problematic + than others, depending on how portable and maintainable you want the + program to be (and, of course, whether you are allowed to change it at + all is crucial). + + You should not continue to use these command-line options to compile + a given program, but rather should make changes to the source code: + + `-finit-local-zero' + (This option specifies that any uninitialized local variables and + arrays have default initialization to binary zeros.) + + Many other compilers do this automatically, which means lots of + Fortran code developed with those compilers depends on it. + + It is safer (and probably would produce a faster program) to find + the variables and arrays that need such initialization and provide + it explicitly via `DATA', so that `-finit-local-zero' is not + needed. + + Consider using `-Wuninitialized' (which requires `-O') to find + likely candidates, but do not specify `-finit-local-zero' or + `-fno-automatic', or this technique won't work. + + `-fno-automatic' + (This option specifies that all local variables and arrays are to + be treated as if they were named in `SAVE' statements.) + + Many other compilers do this automatically, which means lots of + Fortran code developed with those compilers depends on it. + + The effect of this is that all non-automatic variables and arrays + are made static, that is, not placed on the stack or in heap + storage. This might cause a buggy program to appear to work + better. If so, rather than relying on this command-line option + (and hoping all compilers provide the equivalent one), add `SAVE' + statements to some or all program unit sources, as appropriate. + Consider using `-Wuninitialized' (which requires `-O') to find + likely candidates, but do not specify `-finit-local-zero' or + `-fno-automatic', or this technique won't work. + + The default is `-fautomatic', which tells `g77' to try and put + variables and arrays on the stack (or in fast registers) where + possible and reasonable. This tends to make programs faster. + + _Note:_ Automatic variables and arrays are not affected by this + option. These are variables and arrays that are _necessarily_ + automatic, either due to explicit statements, or due to the way + they are declared. Examples include local variables and arrays + not given the `SAVE' attribute in procedures declared `RECURSIVE', + and local arrays declared with non-constant bounds (automatic + arrays). Currently, `g77' supports only automatic arrays, not + `RECURSIVE' procedures or other means of explicitly specifying + that variables or arrays are automatic. + + `-fGROUP-intrinsics-hide' + Change the source code to use `EXTERNAL' for any external procedure + that might be the name of an intrinsic. It is easy to find these + using `-fGROUP-intrinsics-disable'. + +  + File: g77.info, Node: Faster Programs, Prev: Overly Convenient Options, Up: Collected Fortran Wisdom + + Faster Programs + =============== + + Aside from the usual `gcc' options, such as `-O', `-ffast-math', and + so on, consider trying some of the following approaches to speed up + your program (once you get it working). + + * Menu: + + * Aligned Data:: + * Prefer Automatic Uninitialized Variables:: + * Avoid f2c Compatibility:: + * Use Submodel Options:: + +  + File: g77.info, Node: Aligned Data, Next: Prefer Automatic Uninitialized Variables, Up: Faster Programs + + Aligned Data + ------------ + + On some systems, such as those with Pentium Pro CPUs, programs that + make heavy use of `REAL(KIND=2)' (`DOUBLE PRECISION') might run much + slower than possible due to the compiler not aligning these 64-bit + values to 64-bit boundaries in memory. (The effect also is present, + though to a lesser extent, on the 586 (Pentium) architecture.) + + The Intel x86 architecture generally ensures that these programs will + work on all its implementations, but particular implementations (such + as Pentium Pro) perform better with more strict alignment. (Such + behavior isn't unique to the Intel x86 architecture.) Other + architectures might _demand_ 64-bit alignment of 64-bit data. + + There are a variety of approaches to use to address this problem: + + * Order your `COMMON' and `EQUIVALENCE' areas such that the + variables and arrays with the widest alignment guidelines come + first. + + For example, on most systems, this would mean placing + `COMPLEX(KIND=2)', `REAL(KIND=2)', and `INTEGER(KIND=2)' entities + first, followed by `REAL(KIND=1)', `INTEGER(KIND=1)', and + `LOGICAL(KIND=1)' entities, then `INTEGER(KIND=6)' entities, and + finally `CHARACTER' and `INTEGER(KIND=3)' entities. + + The reason to use such placement is it makes it more likely that + your data will be aligned properly, without requiring you to do + detailed analysis of each aggregate (`COMMON' and `EQUIVALENCE') + area. + + Specifically, on systems where the above guidelines are + appropriate, placing `CHARACTER' entities before `REAL(KIND=2)' + entities can work just as well, but only if the number of bytes + occupied by the `CHARACTER' entities is divisible by the + recommended alignment for `REAL(KIND=2)'. + + By ordering the placement of entities in aggregate areas according + to the simple guidelines above, you avoid having to carefully + count the number of bytes occupied by each entity to determine + whether the actual alignment of each subsequent entity meets the + alignment guidelines for the type of that entity. + + If you don't ensure correct alignment of `COMMON' elements, the + compiler may be forced by some systems to violate the Fortran + semantics by adding padding to get `DOUBLE PRECISION' data + properly aligned. If the unfortunate practice is employed of + overlaying different types of data in the `COMMON' block, the + different variants of this block may become misaligned with + respect to each other. Even if your platform doesn't require + strict alignment, `COMMON' should be laid out as above for + portability. (Unfortunately the FORTRAN 77 standard didn't + anticipate this possible requirement, which is + compiler-independent on a given platform.) + + * Use the (x86-specific) `-malign-double' option when compiling + programs for the Pentium and Pentium Pro architectures (called 586 + and 686 in the `gcc' configuration subsystem). The warning about + this in the `gcc' manual isn't generally relevant to Fortran, but + using it will force `COMMON' to be padded if necessary to align + `DOUBLE PRECISION' data. + + When `DOUBLE PRECISION' data is forcibly aligned in `COMMON' by + `g77' due to specifying `-malign-double', `g77' issues a warning + about the need to insert padding. + + In this case, each and every program unit that uses the same + `COMMON' area must specify the same layout of variables and their + types for that area and be compiled with `-malign-double' as well. + `g77' will issue warnings in each case, but as long as every + program unit using that area is compiled with the same warnings, + the resulting object files should work when linked together unless + the program makes additional assumptions about `COMMON' area + layouts that are outside the scope of the FORTRAN 77 standard, or + uses `EQUIVALENCE' or different layouts in ways that assume no + padding is ever inserted by the compiler. + + * Ensure that `crt0.o' or `crt1.o' on your system guarantees a 64-bit + aligned stack for `main()'. The recent one from GNU (`glibc2') + will do this on x86 systems, but we don't know of any other x86 + setups where it will be right. Read your system's documentation + to determine if it is appropriate to upgrade to a more recent + version to obtain the optimal alignment. + + Progress is being made on making this work "out of the box" on + future versions of `g77', `gcc', and some of the relevant operating + systems (such as GNU/Linux). + + A package that tests the degree to which a Fortran compiler (such as + `g77') aligns 64-bit floating-point variables and arrays is available + at `ftp://alpha.gnu.org/gnu/g77/align/'. + +  + File: g77.info, Node: Prefer Automatic Uninitialized Variables, Next: Avoid f2c Compatibility, Prev: Aligned Data, Up: Faster Programs + + Prefer Automatic Uninitialized Variables + ---------------------------------------- + + If you're using `-fno-automatic' already, you probably should change + your code to allow compilation with `-fautomatic' (the default), to + allow the program to run faster. + + Similarly, you should be able to use `-fno-init-local-zero' (the + default) instead of `-finit-local-zero'. This is because it is rare + that every variable affected by these options in a given program + actually needs to be so affected. + + For example, `-fno-automatic', which effectively `SAVE's every local + non-automatic variable and array, affects even things like `DO' + iteration variables, which rarely need to be `SAVE'd, and this often + reduces run-time performances. Similarly, `-fno-init-local-zero' + forces such variables to be initialized to zero--when `SAVE'd (such as + when `-fno-automatic'), this by itself generally affects only startup + time for a program, but when not `SAVE'd, it can slow down the + procedure every time it is called. + + *Note Overly Convenient Command-Line Options: Overly Convenient + Options, for information on the `-fno-automatic' and + `-finit-local-zero' options and how to convert their use into selective + changes in your own code. + +  + File: g77.info, Node: Avoid f2c Compatibility, Next: Use Submodel Options, Prev: Prefer Automatic Uninitialized Variables, Up: Faster Programs + + Avoid f2c Compatibility + ----------------------- + + If you aren't linking with any code compiled using `f2c', try using + the `-fno-f2c' option when compiling _all_ the code in your program. + (Note that `libf2c' is _not_ an example of code that is compiled using + `f2c'--it is compiled by a C compiler, typically `gcc'.) + +  + File: g77.info, Node: Use Submodel Options, Prev: Avoid f2c Compatibility, Up: Faster Programs + + Use Submodel Options + -------------------- + + Using an appropriate `-m' option to generate specific code for your + CPU may be worthwhile, though it may mean the executable won't run on + other versions of the CPU that don't support the same instruction set. + *Note Hardware Models and Configurations: (gcc)Submodel Options. For + instance on an x86 system the compiler might have been built--as shown + by `g77 -v'--for the target `i386-pc-linux-gnu', i.e. an `i386' CPU. + In that case to generate code best optimized for a Pentium you could + use the option `-march=pentium'. + + For recent CPUs that don't have explicit support in the released + version of `gcc', it _might_ still be possible to get improvements with + certain `-m' options. + + `-fomit-frame-pointer' can help performance on x86 systems and + others. It will, however, inhibit debugging on the systems on which it + is not turned on anyway by `-O'. + +  + File: g77.info, Node: Trouble, Next: Open Questions, Prev: Collected Fortran Wisdom, Up: Top + + Known Causes of Trouble with GNU Fortran + **************************************** + + This section describes known problems that affect users of GNU + Fortran. Most of these are not GNU Fortran bugs per se--if they were, + we would fix them. But the result for a user might be like the result + of a bug. + + Some of these problems are due to bugs in other software, some are + missing features that are too much work to add, and some are places + where people's opinions differ as to what is best. + + To find out about major bugs discovered in the current release and + possible workarounds for them, see `ftp://alpha.gnu.org/g77.plan'. + + (Note that some of this portion of the manual is lifted directly + from the `gcc' manual, with minor modifications to tailor it to users + of `g77'. Anytime a bug seems to have more to do with the `gcc' + portion of `g77', see *Note Known Causes of Trouble with GCC: + (gcc)Trouble.) + + * Menu: + + * But-bugs:: Bugs really in other programs or elsewhere. + * Known Bugs:: Bugs known to be in this version of `g77'. + * Missing Features:: Features we already know we want to add later. + * Disappointments:: Regrettable things we can't change. + * Non-bugs:: Things we think are right, but some others disagree. + * Warnings and Errors:: Which problems in your code get warnings, + and which get errors. + +  + File: g77.info, Node: But-bugs, Next: Known Bugs, Up: Trouble + + Bugs Not In GNU Fortran + ======================= + + These are bugs to which the maintainers often have to reply, "but + that isn't a bug in `g77'...". Some of these already are fixed in new + versions of other software; some still need to be fixed; some are + problems with how `g77' is installed or is being used; some are the + result of bad hardware that causes software to misbehave in sometimes + bizarre ways; some just cannot be addressed at this time until more is + known about the problem. + + Please don't re-report these bugs to the `g77' maintainers--if you + must remind someone how important it is to you that the problem be + fixed, talk to the people responsible for the other products identified + below, but preferably only after you've tried the latest versions of + those products. The `g77' maintainers have their hands full working on + just fixing and improving `g77', without serving as a clearinghouse for + all bugs that happen to affect `g77' users. + + *Note Collected Fortran Wisdom::, for information on behavior of + Fortran programs, and the programs that compile them, that might be + _thought_ to indicate bugs. + + * Menu: + + * Signal 11 and Friends:: Strange behavior by any software. + * Cannot Link Fortran Programs:: Unresolved references. + * Large Common Blocks:: Problems on older GNU/Linux systems. + * Debugger Problems:: When the debugger crashes. + * NeXTStep Problems:: Misbehaving executables. + * Stack Overflow:: More misbehaving executables. + * Nothing Happens:: Less behaving executables. + * Strange Behavior at Run Time:: Executables misbehaving due to + bugs in your program. + * Floating-point Errors:: The results look wrong, but.... + +  + File: g77.info, Node: Signal 11 and Friends, Next: Cannot Link Fortran Programs, Up: But-bugs + + Signal 11 and Friends + --------------------- + + A whole variety of strange behaviors can occur when the software, or + the way you are using the software, stresses the hardware in a way that + triggers hardware bugs. This might seem hard to believe, but it + happens frequently enough that there exist documents explaining in + detail what the various causes of the problems are, what typical + symptoms look like, and so on. + + Generally these problems are referred to in this document as "signal + 11" crashes, because the Linux kernel, running on the most popular + hardware (the Intel x86 line), often stresses the hardware more than + other popular operating systems. When hardware problems do occur under + GNU/Linux on x86 systems, these often manifest themselves as "signal 11" + problems, as illustrated by the following diagnostic: + + sh# g77 myprog.f + gcc: Internal compiler error: program f771 got fatal signal 11 + sh# + + It is _very_ important to remember that the above message is _not_ + the only one that indicates a hardware problem, nor does it always + indicate a hardware problem. + + In particular, on systems other than those running the Linux kernel, + the message might appear somewhat or very different, as it will if the + error manifests itself while running a program other than the `g77' + compiler. For example, it will appear somewhat different when running + your program, when running Emacs, and so on. + + How to cope with such problems is well beyond the scope of this + manual. + + However, users of Linux-based systems (such as GNU/Linux) should + review `http://www.bitwizard.nl/sig11/', a source of detailed + information on diagnosing hardware problems, by recognizing their + common symptoms. + + Users of other operating systems and hardware might find this + reference useful as well. If you know of similar material for another + hardware/software combination, please let us know so we can consider + including a reference to it in future versions of this manual. + +  + File: g77.info, Node: Cannot Link Fortran Programs, Next: Large Common Blocks, Prev: Signal 11 and Friends, Up: But-bugs + + Cannot Link Fortran Programs + ---------------------------- + + On some systems, perhaps just those with out-of-date (shared?) + libraries, unresolved-reference errors happen when linking + `g77'-compiled programs (which should be done using `g77'). + + If this happens to you, try appending `-lc' to the command you use + to link the program, e.g. `g77 foo.f -lc'. `g77' already specifies + `-lg2c -lm' when it calls the linker, but it cannot also specify `-lc' + because not all systems have a file named `libc.a'. + + It is unclear at this point whether there are legitimately installed + systems where `-lg2c -lm' is insufficient to resolve code produced by + `g77'. + + If your program doesn't link due to unresolved references to names + like `_main', make sure you're using the `g77' command to do the link, + since this command ensures that the necessary libraries are loaded by + specifying `-lg2c -lm' when it invokes the `gcc' command to do the + actual link. (Use the `-v' option to discover more about what actually + happens when you use the `g77' and `gcc' commands.) + + Also, try specifying `-lc' as the last item on the `g77' command + line, in case that helps. + +  + File: g77.info, Node: Large Common Blocks, Next: Debugger Problems, Prev: Cannot Link Fortran Programs, Up: But-bugs + + Large Common Blocks + ------------------- + + On some older GNU/Linux systems, programs with common blocks larger + than 16MB cannot be linked without some kind of error message being + produced. + + This is a bug in older versions of `ld', fixed in more recent + versions of `binutils', such as version 2.6. + +  + File: g77.info, Node: Debugger Problems, Next: NeXTStep Problems, Prev: Large Common Blocks, Up: But-bugs + + Debugger Problems + ----------------- + + There are some known problems when using `gdb' on code compiled by + `g77'. Inadequate investigation as of the release of 0.5.16 results in + not knowing which products are the culprit, but `gdb-4.14' definitely + crashes when, for example, an attempt is made to print the contents of + a `COMPLEX(KIND=2)' dummy array, on at least some GNU/Linux machines, + plus some others. Attempts to access assumed-size arrays are also + known to crash recent versions of `gdb'. (`gdb''s Fortran support was + done for a different compiler and isn't properly compatible with `g77'.) + +  + File: g77.info, Node: NeXTStep Problems, Next: Stack Overflow, Prev: Debugger Problems, Up: But-bugs + + NeXTStep Problems + ----------------- + + Developers of Fortran code on NeXTStep (all architectures) have to + watch out for the following problem when writing programs with large, + statically allocated (i.e. non-stack based) data structures (common + blocks, saved arrays). + + Due to the way the native loader (`/bin/ld') lays out data + structures in virtual memory, it is very easy to create an executable + wherein the `__DATA' segment overlaps (has addresses in common) with + the `UNIX STACK' segment. + + This leads to all sorts of trouble, from the executable simply not + executing, to bus errors. The NeXTStep command line tool `ebadexec' + points to the problem as follows: + + % /bin/ebadexec a.out + /bin/ebadexec: __LINKEDIT segment (truncated address = 0x3de000 + rounded size = 0x2a000) of executable file: a.out overlaps with UNIX + STACK segment (truncated address = 0x400000 rounded size = + 0x3c00000) of executable file: a.out + + (In the above case, it is the `__LINKEDIT' segment that overlaps the + stack segment.) + + This can be cured by assigning the `__DATA' segment (virtual) + addresses beyond the stack segment. A conservative estimate for this + is from address 6000000 (hexadecimal) onwards--this has always worked + for me [Toon Moene]: + + % g77 -segaddr __DATA 6000000 test.f + % ebadexec a.out + ebadexec: file: a.out appears to be executable + % + + Browsing through `gcc/gcc/f/Makefile.in', you will find that the + `f771' program itself also has to be linked with these flags--it has + large statically allocated data structures. (Version 0.5.18 reduces + this somewhat, but probably not enough.) + + (The above item was contributed by Toon Moene + ().) + +  + File: g77.info, Node: Stack Overflow, Next: Nothing Happens, Prev: NeXTStep Problems, Up: But-bugs + + Stack Overflow + -------------- + + `g77' code might fail at runtime (probably with a "segmentation + violation") due to overflowing the stack. This happens most often on + systems with an environment that provides substantially more heap space + (for use when arbitrarily allocating and freeing memory) than stack + space. + + Often this can be cured by increasing or removing your shell's limit + on stack usage, typically using `limit stacksize' (in `csh' and + derivatives) or `ulimit -s' (in `sh' and derivatives). + + Increasing the allowed stack size might, however, require changing + some operating system or system configuration parameters. + + You might be able to work around the problem by compiling with the + `-fno-automatic' option to reduce stack usage, probably at the expense + of speed. + + `g77', on most machines, puts many variables and arrays on the stack + where possible, and can be configured (by changing + `FFECOM_sizeMAXSTACKITEM' in `gcc/gcc/f/com.c') to force smaller-sized + entities into static storage (saving on stack space) or permit + larger-sized entities to be put on the stack (which can improve + run-time performance, as it presents more opportunities for the GBE to + optimize the generated code). + + _Note:_ Putting more variables and arrays on the stack might cause + problems due to system-dependent limits on stack size. Also, the value + of `FFECOM_sizeMAXSTACKITEM' has no effect on automatic variables and + arrays. *Note But-bugs::, for more information. _Note:_ While + `libg2c' places a limit on the range of Fortran file-unit numbers, the + underlying library and operating system might impose different kinds of + limits. For example, some systems limit the number of files + simultaneously open by a running program. Information on how to + increase these limits should be found in your system's documentation. + + However, if your program uses large automatic arrays (for example, + has declarations like `REAL A(N)' where `A' is a local array and `N' is + a dummy or `COMMON' variable that can have a large value), neither use + of `-fno-automatic', nor changing the cut-off point for `g77' for using + the stack, will solve the problem by changing the placement of these + large arrays, as they are _necessarily_ automatic. + + `g77' currently provides no means to specify that automatic arrays + are to be allocated on the heap instead of the stack. So, other than + increasing the stack size, your best bet is to change your source code + to avoid large automatic arrays. Methods for doing this currently are + outside the scope of this document. + + (_Note:_ If your system puts stack and heap space in the same memory + area, such that they are effectively combined, then a stack overflow + probably indicates a program that is either simply too large for the + system, or buggy.) + +  + File: g77.info, Node: Nothing Happens, Next: Strange Behavior at Run Time, Prev: Stack Overflow, Up: But-bugs + + Nothing Happens + --------------- + + It is occasionally reported that a "simple" program, such as a + "Hello, World!" program, does nothing when it is run, even though the + compiler reported no errors, despite the program containing nothing + other than a simple `PRINT' statement. + + This most often happens because the program has been compiled and + linked on a UNIX system and named `test', though other names can lead + to similarly unexpected run-time behavior on various systems. + + Essentially this problem boils down to giving your program a name + that is already known to the shell you are using to identify some other + program, which the shell continues to execute instead of your program + when you invoke it via, for example: + + sh# test + sh# + + Under UNIX and many other system, a simple command name invokes a + searching mechanism that might well not choose the program located in + the current working directory if there is another alternative (such as + the `test' command commonly installed on UNIX systems). + + The reliable way to invoke a program you just linked in the current + directory under UNIX is to specify it using an explicit pathname, as in: + + sh# ./test + Hello, World! + sh# + + Users who encounter this problem should take the time to read up on + how their shell searches for commands, how to set their search path, + and so on. The relevant UNIX commands to learn about include `man', + `info' (on GNU systems), `setenv' (or `set' and `env'), `which', and + `find'. + +  + File: g77.info, Node: Strange Behavior at Run Time, Next: Floating-point Errors, Prev: Nothing Happens, Up: But-bugs + + Strange Behavior at Run Time + ---------------------------- + + `g77' code might fail at runtime with "segmentation violation", "bus + error", or even something as subtle as a procedure call overwriting a + variable or array element that it is not supposed to touch. + + These can be symptoms of a wide variety of actual bugs that occurred + earlier during the program's run, but manifested themselves as + _visible_ problems some time later. + + Overflowing the bounds of an array--usually by writing beyond the + end of it--is one of two kinds of bug that often occurs in Fortran code. + (Compile your code with the `-fbounds-check' option to catch many of + these kinds of errors at program run time.) + + The other kind of bug is a mismatch between the actual arguments + passed to a procedure and the dummy arguments as declared by that + procedure. + + Both of these kinds of bugs, and some others as well, can be + difficult to track down, because the bug can change its behavior, or + even appear to not occur, when using a debugger. + + That is, these bugs can be quite sensitive to data, including data + representing the placement of other data in memory (that is, pointers, + such as the placement of stack frames in memory). + + `g77' now offers the ability to catch and report some of these + problems at compile, link, or run time, such as by generating code to + detect references to beyond the bounds of most arrays (except + assumed-size arrays), and checking for agreement between calling and + called procedures. Future improvements are likely to be made in the + procedure-mismatch area, at least. + + In the meantime, finding and fixing the programming bugs that lead + to these behaviors is, ultimately, the user's responsibility, as + difficult as that task can sometimes be. + + One runtime problem that has been observed might have a simple + solution. If a formatted `WRITE' produces an endless stream of spaces, + check that your program is linked against the correct version of the C + library. The configuration process takes care to account for your + system's normal `libc' not being ANSI-standard, which will otherwise + cause this behaviour. If your system's default library is + ANSI-standard and you subsequently link against a non-ANSI one, there + might be problems such as this one. + + Specifically, on Solaris2 systems, avoid picking up the `BSD' + library from `/usr/ucblib'. + +  + File: g77.info, Node: Floating-point Errors, Prev: Strange Behavior at Run Time, Up: But-bugs + + Floating-point Errors + --------------------- + + Some programs appear to produce inconsistent floating-point results + compiled by `g77' versus by other compilers. + + Often the reason for this behavior is the fact that floating-point + values are represented on almost all Fortran systems by + _approximations_, and these approximations are inexact even for + apparently simple values like 0.1, 0.2, 0.3, 0.4, 0.6, 0.7, 0.8, 0.9, + 1.1, and so on. Most Fortran systems, including all current ports of + `g77', use binary arithmetic to represent these approximations. + + Therefore, the exact value of any floating-point approximation as + manipulated by `g77'-compiled code is representable by adding some + combination of the values 1.0, 0.5, 0.25, 0.125, and so on (just keep + dividing by two) through the precision of the fraction (typically + around 23 bits for `REAL(KIND=1)', 52 for `REAL(KIND=2)'), then + multiplying the sum by a integral power of two (in Fortran, by `2**N') + that typically is between -127 and +128 for `REAL(KIND=1)' and -1023 + and +1024 for `REAL(KIND=2)', then multiplying by -1 if the number is + negative. + + So, a value like 0.2 is exactly represented in decimal--since it is + a fraction, `2/10', with a denominator that is compatible with the base + of the number system (base 10). However, `2/10' cannot be represented + by any finite number of sums of any of 1.0, 0.5, 0.25, and so on, so + 0.2 cannot be exactly represented in binary notation. + + (On the other hand, decimal notation can represent any binary number + in a finite number of digits. Decimal notation cannot do so with + ternary, or base-3, notation, which would represent floating-point + numbers as sums of any of `1/1', `1/3', `1/9', and so on. After all, + no finite number of decimal digits can exactly represent `1/3'. + Fortunately, few systems use ternary notation.) + + Moreover, differences in the way run-time I/O libraries convert + between these approximations and the decimal representation often used + by programmers and the programs they write can result in apparent + differences between results that do not actually exist, or exist to + such a small degree that they usually are not worth worrying about. + + For example, consider the following program: + + PRINT *, 0.2 + END + + When compiled by `g77', the above program might output `0.20000003', + while another compiler might produce a executable that outputs `0.2'. + + This particular difference is due to the fact that, currently, + conversion of floating-point values by the `libg2c' library, used by + `g77', handles only double-precision values. + + Since `0.2' in the program is a single-precision value, it is + converted to double precision (still in binary notation) before being + converted back to decimal. The conversion to binary appends _binary_ + zero digits to the original value--which, again, is an inexact + approximation of 0.2--resulting in an approximation that is much less + exact than is connoted by the use of double precision. + + (The appending of binary zero digits has essentially the same effect + as taking a particular decimal approximation of `1/3', such as + `0.3333333', and appending decimal zeros to it, producing + `0.33333330000000000'. Treating the resulting decimal approximation as + if it really had 18 or so digits of valid precision would make it seem + a very poor approximation of `1/3'.) + + As a result of converting the single-precision approximation to + double precision by appending binary zeros, the conversion of the + resulting double-precision value to decimal produces what looks like an + incorrect result, when in fact the result is _inexact_, and is probably + no less inaccurate or imprecise an approximation of 0.2 than is + produced by other compilers that happen to output the converted value + as "exactly" `0.2'. (Some compilers behave in a way that can make them + appear to retain more accuracy across a conversion of a single-precision + constant to double precision. *Note Context-Sensitive Constants::, to + see why this practice is illusory and even dangerous.) + + Note that a more exact approximation of the constant is computed + when the program is changed to specify a double-precision constant: + + PRINT *, 0.2D0 + END + + Future versions of `g77' and/or `libg2c' might convert + single-precision values directly to decimal, instead of converting them + to double precision first. This would tend to result in output that is + more consistent with that produced by some other Fortran + implementations. + + A useful source of information on floating-point computation is David + Goldberg, `What Every Computer Scientist Should Know About + Floating-Point Arithmetic', Computing Surveys, 23, March 1991, pp. + 5-48. An online version is available at `http://docs.sun.com/', and + there is a supplemented version, in PostScript form, at + `http://www.validgh.com/goldberg/paper.ps'. + + Information related to the IEEE 754 floating-point standard by a + leading light can be found at + `http://http.cs.berkeley.edu/%7Ewkahan/ieee754status/'; see also slides + from the short course referenced from + `http://http.cs.berkeley.edu/%7Efateman/'. + `http://www.linuxsupportline.com/%7Ebillm/' has a brief guide to IEEE + 754, a somewhat x86-GNU/Linux-specific FAQ, and library code for + GNU/Linux x86 systems. + + The supplement to the PostScript-formatted Goldberg document, + referenced above, is available in HTML format. See `Differences Among + IEEE 754 Implementations' by Doug Priest, available online at + `http://www.validgh.com/goldberg/addendum.html'. This document + explores some of the issues surrounding computing of extended (80-bit) + results on processors such as the x86, especially when those results + are arbitrarily truncated to 32-bit or 64-bit values by the compiler as + "spills". + + (_Note:_ `g77' specifically, and `gcc' generally, does arbitrarily + truncate 80-bit results during spills as of this writing. It is not + yet clear whether a future version of the GNU compiler suite will offer + 80-bit spills as an option, or perhaps even as the default behavior.) + + The GNU C library provides routines for controlling the FPU, and + other documentation about this. + + *Note Floating-point precision::, regarding IEEE 754 conformance. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-16 gcc-3.2.3/gcc/f/g77.info-16 *** gcc-3.2.2/gcc/f/g77.info-16 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-16 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1283 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Known Bugs, Next: Missing Features, Prev: But-bugs, Up: Trouble + + Known Bugs In GNU Fortran + ========================= + + This section identifies bugs that `g77' _users_ might run into in + the GCC-3.2.3 version of `g77'. This includes bugs that are actually + in the `gcc' back end (GBE) or in `libf2c', because those sets of code + are at least somewhat under the control of (and necessarily intertwined + with) `g77', so it isn't worth separating them out. + + For information on bugs in _other_ versions of `g77', see *Note News + About GNU Fortran: News. There, lists of bugs fixed in various + versions of `g77' can help determine what bugs existed in prior + versions. + + An online, "live" version of this document (derived directly from + the mainline, development version of `g77' within `gcc') is available + via `http://www.gnu.org/software/gcc/onlinedocs/g77/Trouble.html'. + Follow the "Known Bugs" link. + + The following information was last updated on 2002-02-01: + + * `g77' fails to warn about use of a "live" iterative-DO variable as + an implied-DO variable in a `WRITE' or `PRINT' statement (although + it does warn about this in a `READ' statement). + + * Something about `g77''s straightforward handling of label + references and definitions sometimes prevents the GBE from + unrolling loops. Until this is solved, try inserting or removing + `CONTINUE' statements as the terminal statement, using the `END DO' + form instead, and so on. + + * Some confusion in diagnostics concerning failing `INCLUDE' + statements from within `INCLUDE''d or `#include''d files. + + * `g77' assumes that `INTEGER(KIND=1)' constants range from `-2**31' + to `2**31-1' (the range for two's-complement 32-bit values), + instead of determining their range from the actual range of the + type for the configuration (and, someday, for the constant). + + Further, it generally doesn't implement the handling of constants + very well in that it makes assumptions about the configuration + that it no longer makes regarding variables (types). + + Included with this item is the fact that `g77' doesn't recognize + that, on IEEE-754/854-compliant systems, `0./0.' should produce a + NaN and no warning instead of the value `0.' and a warning. + + * `g77' uses way too much memory and CPU time to process large + aggregate areas having any initialized elements. + + For example, `REAL A(1000000)' followed by `DATA A(1)/1/' takes up + way too much time and space, including the size of the generated + assembler file. + + Version 0.5.18 improves cases like this--specifically, cases of + _sparse_ initialization that leave large, contiguous areas + uninitialized--significantly. However, even with the + improvements, these cases still require too much memory and CPU + time. + + (Version 0.5.18 also improves cases where the initial values are + zero to a much greater degree, so if the above example ends with + `DATA A(1)/0/', the compile-time performance will be about as good + as it will ever get, aside from unrelated improvements to the + compiler.) + + Note that `g77' does display a warning message to notify the user + before the compiler appears to hang. A warning message is issued + when `g77' sees code that provides initial values (e.g. via + `DATA') to an aggregate area (`COMMON' or `EQUIVALENCE', or even a + large enough array or `CHARACTER' variable) that is large enough + to increase `g77''s compile time by roughly a factor of 10. + + This size currently is quite small, since `g77' currently has a + known bug requiring too much memory and time to handle such cases. + In `gcc/gcc/f/data.c', the macro `FFEDATA_sizeTOO_BIG_INIT_' is + defined to the minimum size for the warning to appear. The size + is specified in storage units, which can be bytes, words, or + whatever, on a case-by-case basis. + + After changing this macro definition, you must (of course) rebuild + and reinstall `g77' for the change to take effect. + + Note that, as of version 0.5.18, improvements have reduced the + scope of the problem for _sparse_ initialization of large arrays, + especially those with large, contiguous uninitialized areas. + However, the warning is issued at a point prior to when `g77' + knows whether the initialization is sparse, and delaying the + warning could mean it is produced too late to be helpful. + + Therefore, the macro definition should not be adjusted to reflect + sparse cases. Instead, adjust it to generate the warning when + densely initialized arrays begin to cause responses noticeably + slower than linear performance would suggest. + + * When debugging, after starting up the debugger but before being + able to see the source code for the main program unit, the user + must currently set a breakpoint at `MAIN__' (or `MAIN___' or + `MAIN_' if `MAIN__' doesn't exist) and run the program until it + hits the breakpoint. At that point, the main program unit is + activated and about to execute its first executable statement, but + that's the state in which the debugger should start up, as is the + case for languages like C. + + * Debugging `g77'-compiled code using debuggers other than `gdb' is + likely not to work. + + Getting `g77' and `gdb' to work together is a known + problem--getting `g77' to work properly with other debuggers, for + which source code often is unavailable to `g77' developers, seems + like a much larger, unknown problem, and is a lower priority than + making `g77' and `gdb' work together properly. + + On the other hand, information about problems other debuggers have + with `g77' output might make it easier to properly fix `g77', and + perhaps even improve `gdb', so it is definitely welcome. Such + information might even lead to all relevant products working + together properly sooner. + + * `g77' doesn't work perfectly on 64-bit configurations such as the + Digital Semiconductor ("DEC") Alpha. + + This problem is largely resolved as of version 0.5.23. + + * `g77' currently inserts needless padding for things like `COMMON + A,IPAD' where `A' is `CHARACTER*1' and `IPAD' is `INTEGER(KIND=1)' + on machines like x86, because the back end insists that `IPAD' be + aligned to a 4-byte boundary, but the processor has no such + requirement (though it is usually good for performance). + + The `gcc' back end needs to provide a wider array of + specifications of alignment requirements and preferences for + targets, and front ends like `g77' should take advantage of this + when it becomes available. + + * The `libf2c' routines that perform some run-time arithmetic on + `COMPLEX' operands were modified circa version 0.5.20 of `g77' to + work properly even in the presence of aliased operands. + + While the `g77' and `netlib' versions of `libf2c' differ on how + this is accomplished, the main differences are that we believe the + `g77' version works properly even in the presence of _partially_ + aliased operands. + + However, these modifications have reduced performance on targets + such as x86, due to the extra copies of operands involved. + +  + File: g77.info, Node: Missing Features, Next: Disappointments, Prev: Known Bugs, Up: Trouble + + Missing Features + ================ + + This section lists features we know are missing from `g77', and + which we want to add someday. (There is no priority implied in the + ordering below.) + + * Menu: + + GNU Fortran language: + * Better Source Model:: + * Fortran 90 Support:: + * Intrinsics in PARAMETER Statements:: + * Arbitrary Concatenation:: + * SELECT CASE on CHARACTER Type:: + * RECURSIVE Keyword:: + * Popular Non-standard Types:: + * Full Support for Compiler Types:: + * Array Bounds Expressions:: + * POINTER Statements:: + * Sensible Non-standard Constructs:: + * READONLY Keyword:: + * FLUSH Statement:: + * Expressions in FORMAT Statements:: + * Explicit Assembler Code:: + * Q Edit Descriptor:: + + GNU Fortran dialects: + * Old-style PARAMETER Statements:: + * TYPE and ACCEPT I/O Statements:: + * STRUCTURE UNION RECORD MAP:: + * OPEN CLOSE and INQUIRE Keywords:: + * ENCODE and DECODE:: + * AUTOMATIC Statement:: + * Suppressing Space Padding:: + * Fortran Preprocessor:: + * Bit Operations on Floating-point Data:: + * Really Ugly Character Assignments:: + + New facilities: + * POSIX Standard:: + * Floating-point Exception Handling:: + * Nonportable Conversions:: + * Large Automatic Arrays:: + * Support for Threads:: + * Increasing Precision/Range:: + * Enabling Debug Lines:: + + Better diagnostics: + * Better Warnings:: + * Gracefully Handle Sensible Bad Code:: + * Non-standard Conversions:: + * Non-standard Intrinsics:: + * Modifying DO Variable:: + * Better Pedantic Compilation:: + * Warn About Implicit Conversions:: + * Invalid Use of Hollerith Constant:: + * Dummy Array Without Dimensioning Dummy:: + * Invalid FORMAT Specifiers:: + * Ambiguous Dialects:: + * Unused Labels:: + * Informational Messages:: + + Run-time facilities: + * Uninitialized Variables at Run Time:: + * Portable Unformatted Files:: + * Better List-directed I/O:: + * Default to Console I/O:: + + Debugging: + * Labels Visible to Debugger:: + +  + File: g77.info, Node: Better Source Model, Next: Fortran 90 Support, Up: Missing Features + + Better Source Model + ------------------- + + `g77' needs to provide, as the default source-line model, a "pure + visual" mode, where the interpretation of a source program in this mode + can be accurately determined by a user looking at a traditionally + displayed rendition of the program (assuming the user knows whether the + program is fixed or free form). + + The design should assume the user cannot tell tabs from spaces and + cannot see trailing spaces on lines, but has canonical tab stops and, + for fixed-form source, has the ability to always know exactly where + column 72 is (since the Fortran standard itself requires this for + fixed-form source). + + This would change the default treatment of fixed-form source to not + treat lines with tabs as if they were infinitely long--instead, they + would end at column 72 just as if the tabs were replaced by spaces in + the canonical way. + + As part of this, provide common alternate models (Digital, `f2c', + and so on) via command-line options. This includes allowing + arbitrarily long lines for free-form source as well as fixed-form + source and providing various limits and diagnostics as appropriate. + + Also, `g77' should offer, perhaps even default to, warnings when + characters beyond the last valid column are anything other than spaces. + This would mean code with "sequence numbers" in columns 73 through 80 + would be rejected, and there's a lot of that kind of code around, but + one of the most frequent bugs encountered by new users is accidentally + writing fixed-form source code into and beyond column 73. So, maybe + the users of old code would be able to more easily handle having to + specify, say, a `-Wno-col73to80' option. + +  + File: g77.info, Node: Fortran 90 Support, Next: Intrinsics in PARAMETER Statements, Prev: Better Source Model, Up: Missing Features + + Fortran 90 Support + ------------------ + + `g77' does not support many of the features that distinguish Fortran + 90 (and, now, Fortran 95) from ANSI FORTRAN 77. + + Some Fortran 90 features are supported, because they make sense to + offer even to die-hard users of F77. For example, many of them codify + various ways F77 has been extended to meet users' needs during its + tenure, so `g77' might as well offer them as the primary way to meet + those same needs, even if it offers compatibility with one or more of + the ways those needs were met by other F77 compilers in the industry. + + Still, many important F90 features are not supported, because no + attempt has been made to research each and every feature and assess its + viability in `g77'. In the meantime, users who need those features must + use Fortran 90 compilers anyway, and the best approach to adding some + F90 features to GNU Fortran might well be to fund a comprehensive + project to create GNU Fortran 95. + +  + File: g77.info, Node: Intrinsics in PARAMETER Statements, Next: Arbitrary Concatenation, Prev: Fortran 90 Support, Up: Missing Features + + Intrinsics in `PARAMETER' Statements + ------------------------------------ + + `g77' doesn't allow intrinsics in `PARAMETER' statements. + + Related to this, `g77' doesn't allow non-integral exponentiation in + `PARAMETER' statements, such as `PARAMETER (R=2**.25)'. It is unlikely + `g77' will ever support this feature, as doing it properly requires + complete emulation of a target computer's floating-point facilities when + building `g77' as a cross-compiler. But, if the `gcc' back end is + enhanced to provide such a facility, `g77' will likely use that facility + in implementing this feature soon afterwards. + +  + File: g77.info, Node: Arbitrary Concatenation, Next: SELECT CASE on CHARACTER Type, Prev: Intrinsics in PARAMETER Statements, Up: Missing Features + + Arbitrary Concatenation + ----------------------- + + `g77' doesn't support arbitrary operands for concatenation in + contexts where run-time allocation is required. For example: + + SUBROUTINE X(A) + CHARACTER*(*) A + CALL FOO(A // 'suffix') + +  + File: g77.info, Node: SELECT CASE on CHARACTER Type, Next: RECURSIVE Keyword, Prev: Arbitrary Concatenation, Up: Missing Features + + `SELECT CASE' on `CHARACTER' Type + --------------------------------- + + Character-type selector/cases for `SELECT CASE' currently are not + supported. + +  + File: g77.info, Node: RECURSIVE Keyword, Next: Popular Non-standard Types, Prev: SELECT CASE on CHARACTER Type, Up: Missing Features + + `RECURSIVE' Keyword + ------------------- + + `g77' doesn't support the `RECURSIVE' keyword that F90 compilers do. + Nor does it provide any means for compiling procedures designed to do + recursion. + + All recursive code can be rewritten to not use recursion, but the + result is not pretty. + +  + File: g77.info, Node: Increasing Precision/Range, Next: Enabling Debug Lines, Prev: Support for Threads, Up: Missing Features + + Increasing Precision/Range + -------------------------- + + Some compilers, such as `f2c', have an option (`-r8', `-qrealsize=8' + or similar) that provides automatic treatment of `REAL' entities such + that they have twice the storage size, and a corresponding increase in + the range and precision, of what would normally be the `REAL(KIND=1)' + (default `REAL') type. (This affects `COMPLEX' the same way.) + + They also typically offer another option (`-i8') to increase + `INTEGER' entities so they are twice as large (with roughly twice as + much range). + + (There are potential pitfalls in using these options.) + + `g77' does not yet offer any option that performs these kinds of + transformations. Part of the problem is the lack of detailed + specifications regarding exactly how these options affect the + interpretation of constants, intrinsics, and so on. + + Until `g77' addresses this need, programmers could improve the + portability of their code by modifying it to not require compile-time + options to produce correct results. Some free tools are available + which may help, specifically in Toolpack (which one would expect to be + sound) and the `fortran' section of the Netlib repository. + + Use of preprocessors can provide a fairly portable means to work + around the lack of widely portable methods in the Fortran language + itself (though increasing acceptance of Fortran 90 would alleviate this + problem). + +  + File: g77.info, Node: Popular Non-standard Types, Next: Full Support for Compiler Types, Prev: RECURSIVE Keyword, Up: Missing Features + + Popular Non-standard Types + -------------------------- + + `g77' doesn't fully support `INTEGER*2', `LOGICAL*1', and similar. + In the meantime, version 0.5.18 provides rudimentary support for them. + +  + File: g77.info, Node: Full Support for Compiler Types, Next: Array Bounds Expressions, Prev: Popular Non-standard Types, Up: Missing Features + + Full Support for Compiler Types + ------------------------------- + + `g77' doesn't support `INTEGER', `REAL', and `COMPLEX' equivalents + for _all_ applicable back-end-supported types (`char', `short int', + `int', `long int', `long long int', and `long double'). This means + providing intrinsic support, and maybe constant support (using F90 + syntax) as well, and, for most machines will result in automatic + support of `INTEGER*1', `INTEGER*2', `INTEGER*8', maybe even `REAL*16', + and so on. + +  + File: g77.info, Node: Array Bounds Expressions, Next: POINTER Statements, Prev: Full Support for Compiler Types, Up: Missing Features + + Array Bounds Expressions + ------------------------ + + `g77' doesn't support more general expressions to dimension arrays, + such as array element references, function references, etc. + + For example, `g77' currently does not accept the following: + + SUBROUTINE X(M, N) + INTEGER N(10), M(N(2), N(1)) + +  + File: g77.info, Node: POINTER Statements, Next: Sensible Non-standard Constructs, Prev: Array Bounds Expressions, Up: Missing Features + + POINTER Statements + ------------------ + + `g77' doesn't support pointers or allocatable objects (other than + automatic arrays). This set of features is probably considered just + behind intrinsics in `PARAMETER' statements on the list of large, + important things to add to `g77'. + + In the meantime, consider using the `INTEGER(KIND=7)' declaration to + specify that a variable must be able to hold a pointer. This construct + is not portable to other non-GNU compilers, but it is portable to all + machines GNU Fortran supports when `g77' is used. + + *Note Functions and Subroutines::, for information on `%VAL()', + `%REF()', and `%DESCR()' constructs, which are useful for passing + pointers to procedures written in languages other than Fortran. + +  + File: g77.info, Node: Sensible Non-standard Constructs, Next: READONLY Keyword, Prev: POINTER Statements, Up: Missing Features + + Sensible Non-standard Constructs + -------------------------------- + + `g77' rejects things other compilers accept, like `INTRINSIC + SQRT,SQRT'. As time permits in the future, some of these things that + are easy for humans to read and write and unlikely to be intended to + mean something else will be accepted by `g77' (though `-fpedantic' + should trigger warnings about such non-standard constructs). + + Until `g77' no longer gratuitously rejects sensible code, you might + as well fix your code to be more standard-conforming and portable. + + The kind of case that is important to except from the recommendation + to change your code is one where following good coding rules would + force you to write non-standard code that nevertheless has a clear + meaning. + + For example, when writing an `INCLUDE' file that defines a common + block, it might be appropriate to include a `SAVE' statement for the + common block (such as `SAVE /CBLOCK/'), so that variables defined in + the common block retain their values even when all procedures declaring + the common block become inactive (return to their callers). + + However, putting `SAVE' statements in an `INCLUDE' file would + prevent otherwise standard-conforming code from also specifying the + `SAVE' statement, by itself, to indicate that all local variables and + arrays are to have the `SAVE' attribute. + + For this reason, `g77' already has been changed to allow this + combination, because although the general problem of gratuitously + rejecting unambiguous and "safe" constructs still exists in `g77', this + particular construct was deemed useful enough that it was worth fixing + `g77' for just this case. + + So, while there is no need to change your code to avoid using this + particular construct, there might be other, equally appropriate but + non-standard constructs, that you shouldn't have to stop using just + because `g77' (or any other compiler) gratuitously rejects it. + + Until the general problem is solved, if you have any such construct + you believe is worthwhile using (e.g. not just an arbitrary, redundant + specification of an attribute), please submit a bug report with an + explanation, so we can consider fixing `g77' just for cases like yours. + +  + File: g77.info, Node: READONLY Keyword, Next: FLUSH Statement, Prev: Sensible Non-standard Constructs, Up: Missing Features + + `READONLY' Keyword + ------------------ + + Support for `READONLY', in `OPEN' statements, requires `libg2c' + support, to make sure that `CLOSE(...,STATUS='DELETE')' does not delete + a file opened on a unit with the `READONLY' keyword, and perhaps to + trigger a fatal diagnostic if a `WRITE' or `PRINT' to such a unit is + attempted. + + _Note:_ It is not sufficient for `g77' and `libg2c' (its version of + `libf2c') to assume that `READONLY' does not need some kind of explicit + support at run time, due to UNIX systems not (generally) needing it. + `g77' is not just a UNIX-based compiler! + + Further, mounting of non-UNIX filesystems on UNIX systems (such as + via NFS) might require proper `READONLY' support. + + (Similar issues might be involved with supporting the `SHARED' + keyword.) + +  + File: g77.info, Node: FLUSH Statement, Next: Expressions in FORMAT Statements, Prev: READONLY Keyword, Up: Missing Features + + `FLUSH' Statement + ----------------- + + `g77' could perhaps use a `FLUSH' statement that does what `CALL + FLUSH' does, but that supports `*' as the unit designator (same unit as + for `PRINT') and accepts `ERR=' and/or `IOSTAT=' specifiers. + +  + File: g77.info, Node: Expressions in FORMAT Statements, Next: Explicit Assembler Code, Prev: FLUSH Statement, Up: Missing Features + + Expressions in `FORMAT' Statements + ---------------------------------- + + `g77' doesn't support `FORMAT(I)' and the like. Supporting this + requires a significant redesign or replacement of `libg2c'. + + However, `g77' does support this construct when the expression is + constant (as of version 0.5.22). For example: + + PARAMETER (IWIDTH = 12) + 10 FORMAT (I) + + Otherwise, at least for output (`PRINT' and `WRITE'), Fortran code + making use of this feature can be rewritten to avoid it by constructing + the `FORMAT' string in a `CHARACTER' variable or array, then using that + variable or array in place of the `FORMAT' statement label to do the + original `PRINT' or `WRITE'. + + Many uses of this feature on input can be rewritten this way as + well, but not all can. For example, this can be rewritten: + + READ 20, I + 20 FORMAT (I) + + However, this cannot, in general, be rewritten, especially when + `ERR=' and `END=' constructs are employed: + + READ 30, J, I + 30 FORMAT (I) + +  + File: g77.info, Node: Explicit Assembler Code, Next: Q Edit Descriptor, Prev: Expressions in FORMAT Statements, Up: Missing Features + + Explicit Assembler Code + ----------------------- + + `g77' needs to provide some way, a la `gcc', for `g77' code to + specify explicit assembler code. + +  + File: g77.info, Node: Q Edit Descriptor, Next: Old-style PARAMETER Statements, Prev: Explicit Assembler Code, Up: Missing Features + + Q Edit Descriptor + ----------------- + + The `Q' edit descriptor in `FORMAT's isn't supported. (This is + meant to get the number of characters remaining in an input record.) + Supporting this requires a significant redesign or replacement of + `libg2c'. + + A workaround might be using internal I/O or the stream-based + intrinsics. *Note FGetC Intrinsic (subroutine)::. + +  + File: g77.info, Node: Old-style PARAMETER Statements, Next: TYPE and ACCEPT I/O Statements, Prev: Q Edit Descriptor, Up: Missing Features + + Old-style PARAMETER Statements + ------------------------------ + + `g77' doesn't accept `PARAMETER I=1'. Supporting this obsolete form + of the `PARAMETER' statement would not be particularly hard, as most of + the parsing code is already in place and working. + + Until time/money is spent implementing it, you might as well fix + your code to use the standard form, `PARAMETER (I=1)' (possibly needing + `INTEGER I' preceding the `PARAMETER' statement as well, otherwise, in + the obsolete form of `PARAMETER', the type of the variable is set from + the type of the constant being assigned to it). + +  + File: g77.info, Node: TYPE and ACCEPT I/O Statements, Next: STRUCTURE UNION RECORD MAP, Prev: Old-style PARAMETER Statements, Up: Missing Features + + `TYPE' and `ACCEPT' I/O Statements + ---------------------------------- + + `g77' doesn't support the I/O statements `TYPE' and `ACCEPT'. These + are common extensions that should be easy to support, but also are + fairly easy to work around in user code. + + Generally, any `TYPE fmt,list' I/O statement can be replaced by + `PRINT fmt,list'. And, any `ACCEPT fmt,list' statement can be replaced + by `READ fmt,list'. + +  + File: g77.info, Node: STRUCTURE UNION RECORD MAP, Next: OPEN CLOSE and INQUIRE Keywords, Prev: TYPE and ACCEPT I/O Statements, Up: Missing Features + + `STRUCTURE', `UNION', `RECORD', `MAP' + ------------------------------------- + + `g77' doesn't support `STRUCTURE', `UNION', `RECORD', `MAP'. This + set of extensions is quite a bit lower on the list of large, important + things to add to `g77', partly because it requires a great deal of work + either upgrading or replacing `libg2c'. + +  + File: g77.info, Node: OPEN CLOSE and INQUIRE Keywords, Next: ENCODE and DECODE, Prev: STRUCTURE UNION RECORD MAP, Up: Missing Features + + `OPEN', `CLOSE', and `INQUIRE' Keywords + --------------------------------------- + + `g77' doesn't have support for keywords such as `DISP='DELETE'' in + the `OPEN', `CLOSE', and `INQUIRE' statements. These extensions are + easy to add to `g77' itself, but require much more work on `libg2c'. + + `g77' doesn't support `FORM='PRINT'' or an equivalent to translate + the traditional `carriage control' characters in column 1 of output to + use backspaces, carriage returns and the like. However programs exist + to translate them in output files (or standard output). These are + typically called either `fpr' or `asa'. You can get a version of `asa' + from `ftp://sunsite.unc.edu/pub/Linux/devel/lang/fortran' for GNU + systems which will probably build easily on other systems. + Alternatively, `fpr' is in BSD distributions in various archive sites. + +  + File: g77.info, Node: ENCODE and DECODE, Next: AUTOMATIC Statement, Prev: OPEN CLOSE and INQUIRE Keywords, Up: Missing Features + + `ENCODE' and `DECODE' + --------------------- + + `g77' doesn't support `ENCODE' or `DECODE'. + + These statements are best replaced by READ and WRITE statements + involving internal files (CHARACTER variables and arrays). + + For example, replace a code fragment like + + INTEGER*1 LINE(80) + ... + DECODE (80, 9000, LINE) A, B, C + ... + 9000 FORMAT (1X, 3(F10.5)) + + with: + + CHARACTER*80 LINE + ... + READ (UNIT=LINE, FMT=9000) A, B, C + ... + 9000 FORMAT (1X, 3(F10.5)) + + Similarly, replace a code fragment like + + INTEGER*1 LINE(80) + ... + ENCODE (80, 9000, LINE) A, B, C + ... + 9000 FORMAT (1X, 'OUTPUT IS ', 3(F10.5)) + + with: + + CHARACTER*80 LINE + ... + WRITE (UNIT=LINE, FMT=9000) A, B, C + ... + 9000 FORMAT (1X, 'OUTPUT IS ', 3(F10.5)) + + It is entirely possible that `ENCODE' and `DECODE' will be supported + by a future version of `g77'. + +  + File: g77.info, Node: AUTOMATIC Statement, Next: Suppressing Space Padding, Prev: ENCODE and DECODE, Up: Missing Features + + `AUTOMATIC' Statement + --------------------- + + `g77' doesn't support the `AUTOMATIC' statement that `f2c' does. + + `AUTOMATIC' would identify a variable or array as not being + `SAVE''d, which is normally the default, but which would be especially + useful for code that, _generally_, needed to be compiled with the + `-fno-automatic' option. + + `AUTOMATIC' also would serve as a hint to the compiler that placing + the variable or array--even a very large array-on the stack is + acceptable. + + `AUTOMATIC' would not, by itself, designate the containing procedure + as recursive. + + `AUTOMATIC' should work syntactically like `SAVE', in that + `AUTOMATIC' with no variables listed should apply to all pertinent + variables and arrays (which would not include common blocks or their + members). + + Variables and arrays denoted as `AUTOMATIC' would not be permitted + to be initialized via `DATA' or other specification of any initial + values, requiring explicit initialization, such as via assignment + statements. + + Perhaps `UNSAVE' and `STATIC', as strict semantic opposites to + `SAVE' and `AUTOMATIC', should be provided as well. + +  + File: g77.info, Node: Suppressing Space Padding, Next: Fortran Preprocessor, Prev: AUTOMATIC Statement, Up: Missing Features + + Suppressing Space Padding of Source Lines + ----------------------------------------- + + `g77' should offer VXT-Fortran-style suppression of virtual spaces + at the end of a source line if an appropriate command-line option is + specified. + + This affects cases where a character constant is continued onto the + next line in a fixed-form source file, as in the following example: + + 10 PRINT *,'HOW MANY + 1 SPACES?' + + `g77', and many other compilers, virtually extend the continued line + through column 72 with spaces that become part of the character + constant, but Digital Fortran normally didn't, leaving only one space + between `MANY' and `SPACES?' in the output of the above statement. + + Fairly recently, at least one version of Digital Fortran was + enhanced to provide the other behavior when a command-line option is + specified, apparently due to demand from readers of the USENET group + `comp.lang.fortran' to offer conformance to this widespread practice in + the industry. `g77' should return the favor by offering conformance to + Digital's approach to handling the above example. + +  + File: g77.info, Node: Fortran Preprocessor, Next: Bit Operations on Floating-point Data, Prev: Suppressing Space Padding, Up: Missing Features + + Fortran Preprocessor + -------------------- + + `g77' should offer a preprocessor designed specifically for Fortran + to replace `cpp -traditional'. There are several out there worth + evaluating, at least. + + Such a preprocessor would recognize Hollerith constants, properly + parse comments and character constants, and so on. It might also + recognize, process, and thus preprocess files included via the + `INCLUDE' directive. + +  + File: g77.info, Node: Bit Operations on Floating-point Data, Next: Really Ugly Character Assignments, Prev: Fortran Preprocessor, Up: Missing Features + + Bit Operations on Floating-point Data + ------------------------------------- + + `g77' does not allow `REAL' and other non-integral types for + arguments to intrinsics like `And', `Or', and `Shift'. + + For example, this program is rejected by `g77', because the + intrinsic `Iand' does not accept `REAL' arguments: + + DATA A/7.54/, B/9.112/ + PRINT *, IAND(A, B) + END + +  + File: g77.info, Node: Really Ugly Character Assignments, Next: POSIX Standard, Prev: Bit Operations on Floating-point Data, Up: Missing Features + + Really Ugly Character Assignments + --------------------------------- + + An option such as `-fugly-char' should be provided to allow + + REAL*8 A1 + DATA A1 / '12345678' / + + and: + + REAL*8 A1 + A1 = 'ABCDEFGH' + +  + File: g77.info, Node: POSIX Standard, Next: Floating-point Exception Handling, Prev: Really Ugly Character Assignments, Up: Missing Features + + `POSIX' Standard + ---------------- + + `g77' should support the POSIX standard for Fortran. + +  + File: g77.info, Node: Floating-point Exception Handling, Next: Nonportable Conversions, Prev: POSIX Standard, Up: Missing Features + + Floating-point Exception Handling + --------------------------------- + + The `gcc' backend and, consequently, `g77', currently provides no + general control over whether or not floating-point exceptions are + trapped or ignored. (Ignoring them typically results in NaN values + being propagated in systems that conform to IEEE 754.) The behaviour + is normally inherited from the system-dependent startup code, though + some targets, such as the Alpha, have code generation options which + change the behaviour. + + Most systems provide some C-callable mechanism to change this; this + can be invoked at startup using `gcc''s `constructor' attribute. For + example, just compiling and linking the following C code with your + program will turn on exception trapping for the "common" exceptions on + a GNU system using glibc 2.2 or newer: + + #define _GNU_SOURCE 1 + #include + static void __attribute__ ((constructor)) + trapfpe () + { + /* Enable some exceptions. At startup all exceptions are masked. */ + + feenableexcept (FE_INVALID|FE_DIVBYZERO|FE_OVERFLOW); + } + + A convenient trick is to compile this something like: + gcc -o libtrapfpe.a trapfpe.c + and then use it by adding `-trapfpe' to the `g77' command line when + linking. + +  + File: g77.info, Node: Nonportable Conversions, Next: Large Automatic Arrays, Prev: Floating-point Exception Handling, Up: Missing Features + + Nonportable Conversions + ----------------------- + + `g77' doesn't accept some particularly nonportable, silent data-type + conversions such as `LOGICAL' to `REAL' (as in `A=.FALSE.', where `A' + is type `REAL'), that other compilers might quietly accept. + + Some of these conversions are accepted by `g77' when the + `-fugly-logint' option is specified. Perhaps it should accept more or + all of them. + +  + File: g77.info, Node: Large Automatic Arrays, Next: Support for Threads, Prev: Nonportable Conversions, Up: Missing Features + + Large Automatic Arrays + ---------------------- + + Currently, automatic arrays always are allocated on the stack. For + situations where the stack cannot be made large enough, `g77' should + offer a compiler option that specifies allocation of automatic arrays + in heap storage. + +  + File: g77.info, Node: Support for Threads, Next: Increasing Precision/Range, Prev: Large Automatic Arrays, Up: Missing Features + + Support for Threads + ------------------- + + Neither the code produced by `g77' nor the `libg2c' library are + thread-safe, nor does `g77' have support for parallel processing (other + than the instruction-level parallelism available on some processors). + A package such as PVM might help here. + +  + File: g77.info, Node: Enabling Debug Lines, Next: Better Warnings, Prev: Increasing Precision/Range, Up: Missing Features + + Enabling Debug Lines + -------------------- + + An option such as `-fdebug-lines' should be provided to turn + fixed-form lines beginning with `D' to be treated as if they began with + a space, instead of as if they began with a `C' (as comment lines). + +  + File: g77.info, Node: Better Warnings, Next: Gracefully Handle Sensible Bad Code, Prev: Enabling Debug Lines, Up: Missing Features + + Better Warnings + --------------- + + Because of how `g77' generates code via the back end, it doesn't + always provide warnings the user wants. Consider: + + PROGRAM X + PRINT *, A + END + + Currently, the above is not flagged as a case of using an + uninitialized variable, because `g77' generates a run-time library call + that looks, to the GBE, like it might actually _modify_ `A' at run time. + (And, in fact, depending on the previous run-time library call, it + would!) + + Fixing this requires one of the following: + + * Switch to new library, `libg77', that provides a more "clean" + interface, vis-a-vis input, output, and modified arguments, so the + GBE can tell what's going on. + + This would provide a pretty big performance improvement, at least + theoretically, and, ultimately, in practice, for some types of + code. + + * Have `g77' pass a pointer to a temporary containing a copy of `A', + instead of to `A' itself. The GBE would then complain about the + copy operation involving a potentially uninitialized variable. + + This might also provide a performance boost for some code, because + `A' might then end up living in a register, which could help with + inner loops. + + * Have `g77' use a GBE construct similar to `ADDR_EXPR' but with + extra information on the fact that the item pointed to won't be + modified (a la `const' in C). + + Probably the best solution for now, but not quite trivial to + implement in the general case. + +  + File: g77.info, Node: Gracefully Handle Sensible Bad Code, Next: Non-standard Conversions, Prev: Better Warnings, Up: Missing Features + + Gracefully Handle Sensible Bad Code + ----------------------------------- + + `g77' generally should continue processing for warnings and + recoverable (user) errors whenever possible--that is, it shouldn't + gratuitously make bad or useless code. + + For example: + + INTRINSIC ZABS + CALL FOO(ZABS) + END + + When compiling the above with `-ff2c-intrinsics-disable', `g77' should + indeed complain about passing `ZABS', but it still should compile, + instead of rejecting the entire `CALL' statement. (Some of this is + related to improving the compiler internals to improve how statements + are analyzed.) + +  + File: g77.info, Node: Non-standard Conversions, Next: Non-standard Intrinsics, Prev: Gracefully Handle Sensible Bad Code, Up: Missing Features + + Non-standard Conversions + ------------------------ + + `-Wconversion' and related should flag places where non-standard + conversions are found. Perhaps much of this would be part of `-Wugly*'. + +  + File: g77.info, Node: Non-standard Intrinsics, Next: Modifying DO Variable, Prev: Non-standard Conversions, Up: Missing Features + + Non-standard Intrinsics + ----------------------- + + `g77' needs a new option, like `-Wintrinsics', to warn about use of + non-standard intrinsics without explicit `INTRINSIC' statements for + them. This would help find code that might fail silently when ported + to another compiler. + +  + File: g77.info, Node: Modifying DO Variable, Next: Better Pedantic Compilation, Prev: Non-standard Intrinsics, Up: Missing Features + + Modifying `DO' Variable + ----------------------- + + `g77' should warn about modifying `DO' variables via `EQUIVALENCE'. + (The internal information gathered to produce this warning might also + be useful in setting the internal "doiter" flag for a variable or even + array reference within a loop, since that might produce faster code + someday.) + + For example, this code is invalid, so `g77' should warn about the + invalid assignment to `NOTHER': + + EQUIVALENCE (I, NOTHER) + DO I = 1, 100 + IF (I.EQ. 10) NOTHER = 20 + END DO + +  + File: g77.info, Node: Better Pedantic Compilation, Next: Warn About Implicit Conversions, Prev: Modifying DO Variable, Up: Missing Features + + Better Pedantic Compilation + --------------------------- + + `g77' needs to support `-fpedantic' more thoroughly, and use it only + to generate warnings instead of rejecting constructs outright. Have it + warn: if a variable that dimensions an array is not a dummy or placed + explicitly in `COMMON' (F77 does not allow it to be placed in `COMMON' + via `EQUIVALENCE'); if specification statements follow + statement-function-definition statements; about all sorts of syntactic + extensions. + +  + File: g77.info, Node: Warn About Implicit Conversions, Next: Invalid Use of Hollerith Constant, Prev: Better Pedantic Compilation, Up: Missing Features + + Warn About Implicit Conversions + ------------------------------- + + `g77' needs a `-Wpromotions' option to warn if source code appears + to expect automatic, silent, and somewhat dangerous compiler-assisted + conversion of `REAL(KIND=1)' constants to `REAL(KIND=2)' based on + context. + + For example, it would warn about cases like this: + + DOUBLE PRECISION FOO + PARAMETER (TZPHI = 9.435784839284958) + FOO = TZPHI * 3D0 + +  + File: g77.info, Node: Invalid Use of Hollerith Constant, Next: Dummy Array Without Dimensioning Dummy, Prev: Warn About Implicit Conversions, Up: Missing Features + + Invalid Use of Hollerith Constant + --------------------------------- + + `g77' should disallow statements like `RETURN 2HAB', which are + invalid in both source forms (unlike `RETURN (2HAB)', which probably + still makes no sense but at least can be reliably parsed). Fixed-form + processing rejects it, but not free-form, except in a way that is a bit + difficult to understand. + +  + File: g77.info, Node: Dummy Array Without Dimensioning Dummy, Next: Invalid FORMAT Specifiers, Prev: Invalid Use of Hollerith Constant, Up: Missing Features + + Dummy Array Without Dimensioning Dummy + -------------------------------------- + + `g77' should complain when a list of dummy arguments containing an + adjustable dummy array does not also contain every variable listed in + the dimension list of the adjustable array. + + Currently, `g77' does complain about a variable that dimensions an + array but doesn't appear in any dummy list or `COMMON' area, but this + needs to be extended to catch cases where it doesn't appear in every + dummy list that also lists any arrays it dimensions. + + For example, `g77' should warn about the entry point `ALT' below, + since it includes `ARRAY' but not `ISIZE' in its list of arguments: + + SUBROUTINE PRIMARY(ARRAY, ISIZE) + REAL ARRAY(ISIZE) + ENTRY ALT(ARRAY) + +  + File: g77.info, Node: Invalid FORMAT Specifiers, Next: Ambiguous Dialects, Prev: Dummy Array Without Dimensioning Dummy, Up: Missing Features + + Invalid FORMAT Specifiers + ------------------------- + + `g77' should check `FORMAT' specifiers for validity as it does + `FORMAT' statements. + + For example, a diagnostic would be produced for: + + PRINT 'HI THERE!' !User meant PRINT *, 'HI THERE!' + +  + File: g77.info, Node: Ambiguous Dialects, Next: Unused Labels, Prev: Invalid FORMAT Specifiers, Up: Missing Features + + Ambiguous Dialects + ------------------ + + `g77' needs a set of options such as `-Wugly*', `-Wautomatic', + `-Wvxt', `-Wf90', and so on. These would warn about places in the + user's source where ambiguities are found, helpful in resolving + ambiguities in the program's dialect or dialects. + +  + File: g77.info, Node: Unused Labels, Next: Informational Messages, Prev: Ambiguous Dialects, Up: Missing Features + + Unused Labels + ------------- + + `g77' should warn about unused labels when `-Wunused' is in effect. + +  + File: g77.info, Node: Informational Messages, Next: Uninitialized Variables at Run Time, Prev: Unused Labels, Up: Missing Features + + Informational Messages + ---------------------- + + `g77' needs an option to suppress information messages (notes). + `-w' does this but also suppresses warnings. The default should be to + suppress info messages. + + Perhaps info messages should simply be eliminated. + +  + File: g77.info, Node: Uninitialized Variables at Run Time, Next: Portable Unformatted Files, Prev: Informational Messages, Up: Missing Features + + Uninitialized Variables at Run Time + ----------------------------------- + + `g77' needs an option to initialize everything (not otherwise + explicitly initialized) to "weird" (machine-dependent) values, e.g. + NaNs, bad (non-`NULL') pointers, and largest-magnitude integers, would + help track down references to some kinds of uninitialized variables at + run time. + + Note that use of the options `-O -Wuninitialized' can catch many + such bugs at compile time. + +  + File: g77.info, Node: Portable Unformatted Files, Next: Better List-directed I/O, Prev: Uninitialized Variables at Run Time, Up: Missing Features + + Portable Unformatted Files + -------------------------- + + `g77' has no facility for exchanging unformatted files with systems + using different number formats--even differing only in endianness (byte + order)--or written by other compilers. Some compilers provide + facilities at least for doing byte-swapping during unformatted I/O. + + It is unrealistic to expect to cope with exchanging unformatted files + with arbitrary other compiler runtimes, but the `g77' runtime should at + least be able to read files written by `g77' on systems with different + number formats, particularly if they differ only in byte order. + + In case you do need to write a program to translate to or from `g77' + (`libf2c') unformatted files, they are written as follows: + Sequential + Unformatted sequential records consist of + 1. A number giving the length of the record contents; + + 2. the length of record contents again (for backspace). + + The record length is of C type `long'; this means that it is 8 + bytes on 64-bit systems such as Alpha GNU/Linux and 4 bytes on + other systems, such as x86 GNU/Linux. Consequently such files + cannot be exchanged between 64-bit and 32-bit systems, even with + the same basic number format. + + Direct access + Unformatted direct access files form a byte stream of length + RECORDS*RECL bytes, where RECORDS is the maximum record number + (`REC=RECORDS') written and RECL is the record length in bytes + specified in the `OPEN' statement (`RECL=RECL'). Data appear in + the records as determined by the relevant `WRITE' statement. + Dummy records with arbitrary contents appear in the file in place + of records which haven't been written. + + Thus for exchanging a sequential or direct access unformatted file + between big- and little-endian 32-bit systems using IEEE 754 floating + point it would be sufficient to reverse the bytes in consecutive words + in the file if, and _only_ if, only `REAL*4', `COMPLEX', `INTEGER*4' + and/or `LOGICAL*4' data have been written to it by `g77'. + + If necessary, it is possible to do byte-oriented i/o with `g77''s + `FGETC' and `FPUTC' intrinsics. Byte-swapping can be done in Fortran + by equivalencing larger sized variables to an `INTEGER*1' array or a + set of scalars. + + If you need to exchange binary data between arbitrary system and + compiler variations, we recommend using a portable binary format with + Fortran bindings, such as NCSA's HDF (`http://hdf.ncsa.uiuc.edu/') or + PACT's PDB(1) (`http://www.llnl.gov/def_sci/pact/pact_homepage.html'). + (Unlike, say, CDF or XDR, HDF-like systems write in the native number + formats and only incur overhead when they are read on a system with a + different format.) A future `g77' runtime library should use such + techniques. + + ---------- Footnotes ---------- + + (1) No, not _that_ one. + +  + File: g77.info, Node: Better List-directed I/O, Next: Default to Console I/O, Prev: Portable Unformatted Files, Up: Missing Features + + Better List-directed I/O + ------------------------ + + Values output using list-directed I/O (`PRINT *, R, D') should be + written with a field width, precision, and so on appropriate for the + type (precision) of each value. + + (Currently, no distinction is made between single-precision and + double-precision values by `libf2c'.) + + It is likely this item will require the `libg77' project to be + undertaken. + + In the meantime, use of formatted I/O is recommended. While it + might be of little consolation, `g77' does support + `FORMAT(F.4)', for example, as long as `WIDTH' is defined as a + named constant (via `PARAMETER'). That at least allows some + compile-time specification of the precision of a data type, perhaps + controlled by preprocessing directives. + +  + File: g77.info, Node: Default to Console I/O, Next: Labels Visible to Debugger, Prev: Better List-directed I/O, Up: Missing Features + + Default to Console I/O + ---------------------- + + The default I/O units, specified by `READ FMT', `READ (UNIT=*)', + `WRITE (UNIT=*)', and `PRINT FMT', should not be units 5 (input) and 6 + (output), but, rather, unit numbers not normally available for use in + statements such as `OPEN' and `CLOSE'. + + Changing this would allow a program to connect units 5 and 6 to + files via `OPEN', but still use `READ (UNIT=*)' and `PRINT' to do I/O + to the "console". + + This change probably requires the `libg77' project. + +  + File: g77.info, Node: Labels Visible to Debugger, Prev: Default to Console I/O, Up: Missing Features + + Labels Visible to Debugger + -------------------------- + + `g77' should output debugging information for statements labels, for + use by debuggers that know how to support them. Same with weirder + things like construct names. It is not yet known if any debug formats + or debuggers support these. + +  + File: g77.info, Node: Disappointments, Next: Non-bugs, Prev: Missing Features, Up: Trouble + + Disappointments and Misunderstandings + ===================================== + + These problems are perhaps regrettable, but we don't know any + practical way around them for now. + + * Menu: + + * Mangling of Names:: `SUBROUTINE FOO' is given + external name `foo_'. + * Multiple Definitions of External Names:: No doing both `COMMON /FOO/' + and `SUBROUTINE FOO'. + * Limitation on Implicit Declarations:: No `IMPLICIT CHARACTER*(*)'. + +  + File: g77.info, Node: Mangling of Names, Next: Multiple Definitions of External Names, Up: Disappointments + + Mangling of Names in Source Code + -------------------------------- + + The current external-interface design, which includes naming of + external procedures, COMMON blocks, and the library interface, has + various usability problems, including things like adding underscores + where not really necessary (and preventing easier inter-language + operability) and yet not providing complete namespace freedom for user + C code linked with Fortran apps (due to the naming of functions in the + library, among other things). + + Project GNU should at least get all this "right" for systems it + fully controls, such as the Hurd, and provide defaults and options for + compatibility with existing systems and interoperability with popular + existing compilers. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-17 gcc-3.2.3/gcc/f/g77.info-17 *** gcc-3.2.2/gcc/f/g77.info-17 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-17 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1123 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Multiple Definitions of External Names, Next: Limitation on Implicit Declarations, Prev: Mangling of Names, Up: Disappointments + + Multiple Definitions of External Names + -------------------------------------- + + `g77' doesn't allow a common block and an external procedure or + `BLOCK DATA' to have the same name. Some systems allow this, but `g77' + does not, to be compatible with `f2c'. + + `g77' could special-case the way it handles `BLOCK DATA', since it + is not compatible with `f2c' in this particular area (necessarily, + since `g77' offers an important feature here), but it is likely that + such special-casing would be very annoying to people with programs that + use `EXTERNAL FOO', with no other mention of `FOO' in the same program + unit, to refer to external procedures, since the result would be that + `g77' would treat these references as requests to force-load BLOCK DATA + program units. + + In that case, if `g77' modified names of `BLOCK DATA' so they could + have the same names as `COMMON', users would find that their programs + wouldn't link because the `FOO' procedure didn't have its name + translated the same way. + + (Strictly speaking, `g77' could emit a + null-but-externally-satisfying definition of `FOO' with its name + transformed as if it had been a `BLOCK DATA', but that probably invites + more trouble than it's worth.) + +  + File: g77.info, Node: Limitation on Implicit Declarations, Prev: Multiple Definitions of External Names, Up: Disappointments + + Limitation on Implicit Declarations + ----------------------------------- + + `g77' disallows `IMPLICIT CHARACTER*(*)'. This is not + standard-conforming. + +  + File: g77.info, Node: Non-bugs, Next: Warnings and Errors, Prev: Disappointments, Up: Trouble + + Certain Changes We Don't Want to Make + ===================================== + + This section lists changes that people frequently request, but which + we do not make because we think GNU Fortran is better without them. + + * Menu: + + * Backslash in Constants:: Why `'\\'' is a constant that + is one, not two, characters long. + * Initializing Before Specifying:: Why `DATA VAR/1/' can't precede + `COMMON VAR'. + * Context-Sensitive Intrinsicness:: Why `CALL SQRT' won't work. + * Context-Sensitive Constants:: Why `9.435784839284958' is a + single-precision constant, + and might be interpreted as + `9.435785' or similar. + * Equivalence Versus Equality:: Why `.TRUE. .EQ. .TRUE.' won't work. + * Order of Side Effects:: Why `J = IFUNC() - IFUNC()' might + not behave as expected. + +  + File: g77.info, Node: Backslash in Constants, Next: Initializing Before Specifying, Up: Non-bugs + + Backslash in Constants + ---------------------- + + In the opinion of many experienced Fortran users, `-fno-backslash' + should be the default, not `-fbackslash', as currently set by `g77'. + + First of all, you can always specify `-fno-backslash' to turn off + this processing. + + Despite not being within the spirit (though apparently within the + letter) of the ANSI FORTRAN 77 standard, `g77' defaults to + `-fbackslash' because that is what most UNIX `f77' commands default to, + and apparently lots of code depends on this feature. + + This is a particularly troubling issue. The use of a C construct in + the midst of Fortran code is bad enough, worse when it makes existing + Fortran programs stop working (as happens when programs written for + non-UNIX systems are ported to UNIX systems with compilers that provide + the `-fbackslash' feature as the default--sometimes with no option to + turn it off). + + The author of GNU Fortran wished, for reasons of linguistic purity, + to make `-fno-backslash' the default for GNU Fortran and thus require + users of UNIX `f77' and `f2c' to specify `-fbackslash' to get the UNIX + behavior. + + However, the realization that `g77' is intended as a replacement for + _UNIX_ `f77', caused the author to choose to make `g77' as compatible + with `f77' as feasible, which meant making `-fbackslash' the default. + + The primary focus on compatibility is at the source-code level, and + the question became "What will users expect a replacement for `f77' to + do, by default?" Although at least one UNIX `f77' does not provide + `-fbackslash' as a default, it appears that the majority of them do, + which suggests that the majority of code that is compiled by UNIX `f77' + compilers expects `-fbackslash' to be the default. + + It is probably the case that more code exists that would _not_ work + with `-fbackslash' in force than code that requires it be in force. + + However, most of _that_ code is not being compiled with `f77', and + when it is, new build procedures (shell scripts, makefiles, and so on) + must be set up anyway so that they work under UNIX. That makes a much + more natural and safe opportunity for non-UNIX users to adapt their + build procedures for `g77''s default of `-fbackslash' than would exist + for the majority of UNIX `f77' users who would have to modify existing, + working build procedures to explicitly specify `-fbackslash' if that was + not the default. + + One suggestion has been to configure the default for `-fbackslash' + (and perhaps other options as well) based on the configuration of `g77'. + + This is technically quite straightforward, but will be avoided even + in cases where not configuring defaults to be dependent on a particular + configuration greatly inconveniences some users of legacy code. + + Many users appreciate the GNU compilers because they provide an + environment that is uniform across machines. These users would be + inconvenienced if the compiler treated things like the format of the + source code differently on certain machines. + + Occasionally users write programs intended only for a particular + machine type. On these occasions, the users would benefit if the GNU + Fortran compiler were to support by default the same dialect as the + other compilers on that machine. But such applications are rare. And + users writing a program to run on more than one type of machine cannot + possibly benefit from this kind of compatibility. (This is consistent + with the design goals for `gcc'. To change them for `g77', you must + first change them for `gcc'. Do not ask the maintainers of `g77' to do + this for you, or to disassociate `g77' from the widely understood, if + not widely agreed-upon, goals for GNU compilers in general.) + + This is why GNU Fortran does and will treat backslashes in the same + fashion on all types of machines (by default). *Note Direction of + Language Development::, for more information on this overall philosophy + guiding the development of the GNU Fortran language. + + Of course, users strongly concerned about portability should indicate + explicitly in their build procedures which options are expected by + their source code, or write source code that has as few such + expectations as possible. + + For example, avoid writing code that depends on backslash (`\') + being interpreted either way in particular, such as by starting a + program unit with: + + CHARACTER BACKSL + PARAMETER (BACKSL = '\\') + + Then, use concatenation of `BACKSL' anyplace a backslash is desired. + In this way, users can write programs which have the same meaning in + many Fortran dialects. + + (However, this technique does not work for Hollerith constants--which + is just as well, since the only generally portable uses for Hollerith + constants are in places where character constants can and should be + used instead, for readability.) + +  + File: g77.info, Node: Initializing Before Specifying, Next: Context-Sensitive Intrinsicness, Prev: Backslash in Constants, Up: Non-bugs + + Initializing Before Specifying + ------------------------------ + + `g77' does not allow `DATA VAR/1/' to appear in the source code + before `COMMON VAR', `DIMENSION VAR(10)', `INTEGER VAR', and so on. In + general, `g77' requires initialization of a variable or array to be + specified _after_ all other specifications of attributes (type, size, + placement, and so on) of that variable or array are specified (though + _confirmation_ of data type is permitted). + + It is _possible_ `g77' will someday allow all of this, even though + it is not allowed by the FORTRAN 77 standard. + + Then again, maybe it is better to have `g77' always require + placement of `DATA' so that it can possibly immediately write constants + to the output file, thus saving time and space. + + That is, `DATA A/1000000*1/' should perhaps always be immediately + writable to canonical assembler, unless it's already known to be in a + `COMMON' area following as-yet-uninitialized stuff, and to do this it + cannot be followed by `COMMON A'. + +  + File: g77.info, Node: Context-Sensitive Intrinsicness, Next: Context-Sensitive Constants, Prev: Initializing Before Specifying, Up: Non-bugs + + Context-Sensitive Intrinsicness + ------------------------------- + + `g77' treats procedure references to _possible_ intrinsic names as + always enabling their intrinsic nature, regardless of whether the + _form_ of the reference is valid for that intrinsic. + + For example, `CALL SQRT' is interpreted by `g77' as an invalid + reference to the `SQRT' intrinsic function, because the reference is a + subroutine invocation. + + First, `g77' recognizes the statement `CALL SQRT' as a reference to + a _procedure_ named `SQRT', not to a _variable_ with that name (as it + would for a statement such as `V = SQRT'). + + Next, `g77' establishes that, in the program unit being compiled, + `SQRT' is an intrinsic--not a subroutine that happens to have the same + name as an intrinsic (as would be the case if, for example, `EXTERNAL + SQRT' was present). + + Finally, `g77' recognizes that the _form_ of the reference is + invalid for that particular intrinsic. That is, it recognizes that it + is invalid for an intrinsic _function_, such as `SQRT', to be invoked as + a _subroutine_. + + At that point, `g77' issues a diagnostic. + + Some users claim that it is "obvious" that `CALL SQRT' references an + external subroutine of their own, not an intrinsic function. + + However, `g77' knows about intrinsic subroutines, not just + functions, and is able to support both having the same names, for + example. + + As a result of this, `g77' rejects calls to intrinsics that are not + subroutines, and function invocations of intrinsics that are not + functions, just as it (and most compilers) rejects invocations of + intrinsics with the wrong number (or types) of arguments. + + So, use the `EXTERNAL SQRT' statement in a program unit that calls a + user-written subroutine named `SQRT'. + +  + File: g77.info, Node: Context-Sensitive Constants, Next: Equivalence Versus Equality, Prev: Context-Sensitive Intrinsicness, Up: Non-bugs + + Context-Sensitive Constants + --------------------------- + + `g77' does not use context to determine the types of constants or + named constants (`PARAMETER'), except for (non-standard) typeless + constants such as `'123'O'. + + For example, consider the following statement: + + PRINT *, 9.435784839284958 * 2D0 + + `g77' will interpret the (truncated) constant `9.435784839284958' as a + `REAL(KIND=1)', not `REAL(KIND=2)', constant, because the suffix `D0' + is not specified. + + As a result, the output of the above statement when compiled by + `g77' will appear to have "less precision" than when compiled by other + compilers. + + In these and other cases, some compilers detect the fact that a + single-precision constant is used in a double-precision context and + therefore interpret the single-precision constant as if it was + _explicitly_ specified as a double-precision constant. (This has the + effect of appending _decimal_, not _binary_, zeros to the fractional + part of the number--producing different computational results.) + + The reason this misfeature is dangerous is that a slight, apparently + innocuous change to the source code can change the computational + results. Consider: + + REAL ALMOST, CLOSE + DOUBLE PRECISION FIVE + PARAMETER (ALMOST = 5.000000000001) + FIVE = 5 + CLOSE = 5.000000000001 + PRINT *, 5.000000000001 - FIVE + PRINT *, ALMOST - FIVE + PRINT *, CLOSE - FIVE + END + + Running the above program should result in the same value being printed + three times. With `g77' as the compiler, it does. + + However, compiled by many other compilers, running the above program + would print two or three distinct values, because in two or three of + the statements, the constant `5.000000000001', which on most systems is + exactly equal to `5.' when interpreted as a single-precision constant, + is instead interpreted as a double-precision constant, preserving the + represented precision. However, this "clever" promotion of type does + not extend to variables or, in some compilers, to named constants. + + Since programmers often are encouraged to replace manifest constants + or permanently-assigned variables with named constants (`PARAMETER' in + Fortran), and might need to replace some constants with variables + having the same values for pertinent portions of code, it is important + that compilers treat code so modified in the same way so that the + results of such programs are the same. `g77' helps in this regard by + treating constants just the same as variables in terms of determining + their types in a context-independent way. + + Still, there is a lot of existing Fortran code that has been written + to depend on the way other compilers freely interpret constants' types + based on context, so anything `g77' can do to help flag cases of this + in such code could be very helpful. + +  + File: g77.info, Node: Equivalence Versus Equality, Next: Order of Side Effects, Prev: Context-Sensitive Constants, Up: Non-bugs + + Equivalence Versus Equality + --------------------------- + + Use of `.EQ.' and `.NE.' on `LOGICAL' operands is not supported, + except via `-fugly-logint', which is not recommended except for legacy + code (where the behavior expected by the _code_ is assumed). + + Legacy code should be changed, as resources permit, to use `.EQV.' + and `.NEQV.' instead, as these are permitted by the various Fortran + standards. + + New code should never be written expecting `.EQ.' or `.NE.' to work + if either of its operands is `LOGICAL'. + + The problem with supporting this "feature" is that there is unlikely + to be consensus on how it works, as illustrated by the following sample + program: + + LOGICAL L,M,N + DATA L,M,N /3*.FALSE./ + IF (L.AND.M.EQ.N) PRINT *,'L.AND.M.EQ.N' + END + + The issue raised by the above sample program is: what is the + precedence of `.EQ.' (and `.NE.') when applied to `LOGICAL' operands? + + Some programmers will argue that it is the same as the precedence + for `.EQ.' when applied to numeric (such as `INTEGER') operands. By + this interpretation, the subexpression `M.EQ.N' must be evaluated first + in the above program, resulting in a program that, when run, does not + execute the `PRINT' statement. + + Other programmers will argue that the precedence is the same as the + precedence for `.EQV.', which is restricted by the standards to + `LOGICAL' operands. By this interpretation, the subexpression + `L.AND.M' must be evaluated first, resulting in a program that _does_ + execute the `PRINT' statement. + + Assigning arbitrary semantic interpretations to syntactic expressions + that might legitimately have more than one "obvious" interpretation is + generally unwise. + + The creators of the various Fortran standards have done a good job + in this case, requiring a distinct set of operators (which have their + own distinct precedence) to compare `LOGICAL' operands. This + requirement results in expression syntax with more certain precedence + (without requiring substantial context), making it easier for + programmers to read existing code. `g77' will avoid muddying up + elements of the Fortran language that were well-designed in the first + place. + + (Ask C programmers about the precedence of expressions such as `(a) + & (b)' and `(a) - (b)'--they cannot even tell you, without knowing more + context, whether the `&' and `-' operators are infix (binary) or unary!) + + Most dangerous of all is the fact that, even assuming consensus on + its meaning, an expression like `L.AND.M.EQ.N', if it is the result of + a typographical error, doesn't _look_ like it has such a typo. Even + experienced Fortran programmers would not likely notice that + `L.AND.M.EQV.N' was, in fact, intended. + + So, this is a prime example of a circumstance in which a quality + compiler diagnoses the code, instead of leaving it up to someone + debugging it to know to turn on special compiler options that might + diagnose it. + +  + File: g77.info, Node: Order of Side Effects, Prev: Equivalence Versus Equality, Up: Non-bugs + + Order of Side Effects + --------------------- + + `g77' does not necessarily produce code that, when run, performs + side effects (such as those performed by function invocations) in the + same order as in some other compiler--or even in the same order as + another version, port, or invocation (using different command-line + options) of `g77'. + + It is never safe to depend on the order of evaluation of side + effects. For example, an expression like this may very well behave + differently from one compiler to another: + + J = IFUNC() - IFUNC() + + There is no guarantee that `IFUNC' will be evaluated in any particular + order. Either invocation might happen first. If `IFUNC' returns 5 the + first time it is invoked, and returns 12 the second time, `J' might end + up with the value `7', or it might end up with `-7'. + + Generally, in Fortran, procedures with side-effects intended to be + visible to the caller are best designed as _subroutines_, not functions. + Examples of such side-effects include: + + * The generation of random numbers that are intended to influence + return values. + + * Performing I/O (other than internal I/O to local variables). + + * Updating information in common blocks. + + An example of a side-effect that is not intended to be visible to + the caller is a function that maintains a cache of recently calculated + results, intended solely to speed repeated invocations of the function + with identical arguments. Such a function can be safely used in + expressions, because if the compiler optimizes away one or more calls + to the function, operation of the program is unaffected (aside from + being speeded up). + +  + File: g77.info, Node: Warnings and Errors, Prev: Non-bugs, Up: Trouble + + Warning Messages and Error Messages + =================================== + + The GNU compiler can produce two kinds of diagnostics: errors and + warnings. Each kind has a different purpose: + + _Errors_ report problems that make it impossible to compile your + program. GNU Fortran reports errors with the source file name, + line number, and column within the line where the problem is + apparent. + + _Warnings_ report other unusual conditions in your code that + _might_ indicate a problem, although compilation can (and does) + proceed. Warning messages also report the source file name, line + number, and column information, but include the text `warning:' to + distinguish them from error messages. + + Warnings might indicate danger points where you should check to make + sure that your program really does what you intend; or the use of + obsolete features; or the use of nonstandard features of GNU Fortran. + Many warnings are issued only if you ask for them, with one of the `-W' + options (for instance, `-Wall' requests a variety of useful warnings). + + _Note:_ Currently, the text of the line and a pointer to the column + is printed in most `g77' diagnostics. + + *Note Options to Request or Suppress Warnings: Warning Options, for + more detail on these and related command-line options. + +  + File: g77.info, Node: Open Questions, Next: Bugs, Prev: Trouble, Up: Top + + Open Questions + ************** + + Please consider offering useful answers to these questions! + + * `LOC()' and other intrinsics are probably somewhat misclassified. + Is the a need for more precise classification of intrinsics, and + if so, what are the appropriate groupings? Is there a need to + individually enable/disable/delete/hide intrinsics from the + command line? + +  + File: g77.info, Node: Bugs, Next: Service, Prev: Open Questions, Up: Top + + Reporting Bugs + ************** + + Your bug reports play an essential role in making GNU Fortran + reliable. + + When you encounter a problem, the first thing to do is to see if it + is already known. *Note Trouble::. If it isn't known, then you should + report the problem. + + Reporting a bug might help you by bringing a solution to your + problem, or it might not. (If it does not, look in the service + directory; see *Note Service::.) In any case, the principal function + of a bug report is to help the entire community by making the next + version of GNU Fortran work better. Bug reports are your contribution + to the maintenance of GNU Fortran. + + Since the maintainers are very overloaded, we cannot respond to every + bug report. However, if the bug has not been fixed, we are likely to + send you a patch and ask you to tell us whether it works. + + In order for a bug report to serve its purpose, you must include the + information that makes for fixing the bug. + + * Menu: + + * Criteria: Bug Criteria. Have you really found a bug? + * Where: Bug Lists. Where to send your bug report. + * Reporting: Bug Reporting. How to report a bug effectively. + + *Note Known Causes of Trouble with GNU Fortran: Trouble, for + information on problems we already know about. + + *Note How To Get Help with GNU Fortran: Service, for information on + where to ask for help. + +  + File: g77.info, Node: Bug Criteria, Next: Bug Lists, Up: Bugs + + Have You Found a Bug? + ===================== + + If you are not sure whether you have found a bug, here are some + guidelines: + + * If the compiler gets a fatal signal, for any input whatever, that + is a compiler bug. Reliable compilers never crash--they just + remain obsolete. + + * If the compiler produces invalid assembly code, for any input + whatever, that is a compiler bug, unless the compiler reports + errors (not just warnings) which would ordinarily prevent the + assembler from being run. + + * If the compiler produces valid assembly code that does not + correctly execute the input source code, that is a compiler bug. + + However, you must double-check to make sure, because you might + have run into an incompatibility between GNU Fortran and + traditional Fortran. These incompatibilities might be considered + bugs, but they are inescapable consequences of valuable features. + + Or you might have a program whose behavior is undefined, which + happened by chance to give the desired results with another + Fortran compiler. It is best to check the relevant Fortran + standard thoroughly if it is possible that the program indeed does + something undefined. + + After you have localized the error to a single source line, it + should be easy to check for these things. If your program is + correct and well defined, you have found a compiler bug. + + It might help if, in your submission, you identified the specific + language in the relevant Fortran standard that specifies the + desired behavior, if it isn't likely to be obvious and agreed-upon + by all Fortran users. + + * If the compiler produces an error message for valid input, that is + a compiler bug. + + * If the compiler does not produce an error message for invalid + input, that is a compiler bug. However, you should note that your + idea of "invalid input" might be someone else's idea of "an + extension" or "support for traditional practice". + + * If you are an experienced user of Fortran compilers, your + suggestions for improvement of GNU Fortran are welcome in any case. + + Many, perhaps most, bug reports against `g77' turn out to be bugs in + the user's code. While we find such bug reports educational, they + sometimes take a considerable amount of time to track down or at least + respond to--time we could be spending making `g77', not some user's + code, better. + + Some steps you can take to verify that the bug is not certainly in + the code you're compiling with `g77': + + * Compile your code using the `g77' options `-W -Wall -O'. These + options enable many useful warning; the `-O' option enables flow + analysis that enables the uninitialized-variable warning. + + If you investigate the warnings and find evidence of possible bugs + in your code, fix them first and retry `g77'. + + * Compile your code using the `g77' options `-finit-local-zero', + `-fno-automatic', `-ffloat-store', and various combinations + thereof. + + If your code works with any of these combinations, that is not + proof that the bug isn't in `g77'--a `g77' bug exposed by your + code might simply be avoided, or have a different, more subtle + effect, when different options are used--but it can be a strong + indicator that your code is making unwarranted assumptions about + the Fortran dialect and/or underlying machine it is being compiled + and run on. + + *Note Overly Convenient Command-Line Options: Overly Convenient + Options, for information on the `-fno-automatic' and + `-finit-local-zero' options and how to convert their use into + selective changes in your own code. + + * Validate your code with `ftnchek' or a similar code-checking tool. + `ftnchek' can be found at `ftp://ftp.netlib.org/fortran' or + `ftp://ftp.dsm.fordham.edu'. + + Here are some sample `Makefile' rules using `ftnchek' "project" + files to do cross-file checking and `sfmakedepend' (from + `ftp://ahab.rutgers.edu/pub/perl/sfmakedepend') to maintain + dependencies automatically. These assume the use of GNU `make'. + + # Dummy suffix for ftnchek targets: + .SUFFIXES: .chek + .PHONY: chekall + + # How to compile .f files (for implicit rule): + FC = g77 + # Assume `include' directory: + FFLAGS = -Iinclude -g -O -Wall + + # Flags for ftnchek: + CHEK1 = -array=0 -include=includes -noarray + CHEK2 = -nonovice -usage=1 -notruncation + CHEKFLAGS = $(CHEK1) $(CHEK2) + + # Run ftnchek with all the .prj files except the one corresponding + # to the target's root: + %.chek : %.f ; \ + ftnchek $(filter-out $*.prj,$(PRJS)) $(CHEKFLAGS) \ + -noextern -library $< + + # Derive a project file from a source file: + %.prj : %.f ; \ + ftnchek $(CHEKFLAGS) -noextern -project -library $< + + # The list of objects is assumed to be in variable OBJS. + # Sources corresponding to the objects: + SRCS = $(OBJS:%.o=%.f) + # ftnchek project files: + PRJS = $(OBJS:%.o=%.prj) + + # Build the program + prog: $(OBJS) ; \ + $(FC) -o $ $(OBJS) + + chekall: $(PRJS) ; \ + ftnchek $(CHEKFLAGS) $(PRJS) + + prjs: $(PRJS) + + # For Emacs M-x find-tag: + TAGS: $(SRCS) ; \ + etags $(SRCS) + + # Rebuild dependencies: + depend: ; \ + sfmakedepend -I $(PLTLIBDIR) -I includes -a prj $(SRCS1) + + * Try your code out using other Fortran compilers, such as `f2c'. + If it does not work on at least one other compiler (assuming the + compiler supports the features the code needs), that is a strong + indicator of a bug in the code. + + However, even if your code works on many compilers _except_ `g77', + that does _not_ mean the bug is in `g77'. It might mean the bug + is in your code, and that `g77' simply exposes it more readily + than other compilers. + +  + File: g77.info, Node: Bug Lists, Next: Bug Reporting, Prev: Bug Criteria, Up: Bugs + + Where to Report Bugs + ==================== + + Send bug reports for GNU Fortran to . + + Often people think of posting bug reports to a newsgroup instead of + mailing them. This sometimes appears to work, but it has one problem + which can be crucial: a newsgroup posting does not contain a mail path + back to the sender. Thus, if maintainers need more information, they + might be unable to reach you. For this reason, you should always send + bug reports by mail to the proper mailing list. + + As a last resort, send bug reports on paper to: + + GNU Compiler Bugs + Free Software Foundation + 59 Temple Place - Suite 330 + Boston, MA 02111-1307, USA + +  + File: g77.info, Node: Bug Reporting, Prev: Bug Lists, Up: Bugs + + How to Report Bugs + ================== + + The fundamental principle of reporting bugs usefully is this: + *report all the facts*. If you are not sure whether to state a fact or + leave it out, state it! + + Often people omit facts because they think they know what causes the + problem and they conclude that some details don't matter. Thus, you + might assume that the name of the variable you use in an example does + not matter. Well, probably it doesn't, but one cannot be sure. + Perhaps the bug is a stray memory reference which happens to fetch from + the location where that name is stored in memory; perhaps, if the name + were different, the contents of that location would fool the compiler + into doing the right thing despite the bug. Play it safe and give a + specific, complete example. That is the easiest thing for you to do, + and the most helpful. + + Keep in mind that the purpose of a bug report is to enable someone to + fix the bug if it is not known. It isn't very important what happens if + the bug is already known. Therefore, always write your bug reports on + the assumption that the bug is not known. + + Sometimes people give a few sketchy facts and ask, "Does this ring a + bell?" This cannot help us fix a bug, so it is rarely helpful. We + respond by asking for enough details to enable us to investigate. You + might as well expedite matters by sending them to begin with. + (Besides, there are enough bells ringing around here as it is.) + + Try to make your bug report self-contained. If we have to ask you + for more information, it is best if you include all the previous + information in your response, as well as the information that was + missing. + + Please report each bug in a separate message. This makes it easier + for us to track which bugs have been fixed and to forward your bugs + reports to the appropriate maintainer. + + Do not compress and encode any part of your bug report using programs + such as `uuencode'. If you do so it will slow down the processing of + your bug. If you must submit multiple large files, use `shar', which + allows us to read your message without having to run any decompression + programs. + + (As a special exception for GNU Fortran bug-reporting, at least for + now, if you are sending more than a few lines of code, if your + program's source file format contains "interesting" things like + trailing spaces or strange characters, or if you need to include binary + data files, it is acceptable to put all the files together in a `tar' + archive, and, whether you need to do that, it is acceptable to then + compress the single file (`tar' archive or source file) using `gzip' + and encode it via `uuencode'. Do not use any MIME stuff--the current + maintainer can't decode this. Using `compress' instead of `gzip' is + acceptable, assuming you have licensed the use of the patented + algorithm in `compress' from Unisys.) + + To enable someone to investigate the bug, you should include all + these things: + + * The version of GNU Fortran. You can get this by running `g77' + with the `-v' option. (Ignore any error messages that might be + displayed when the linker is run.) + + Without this, we won't know whether there is any point in looking + for the bug in the current version of GNU Fortran. + + * A complete input file that will reproduce the bug. + + If your source file(s) require preprocessing (for example, their + names have suffixes like `.F', `.fpp', `.FPP', and `.r'), and the + bug is in the compiler proper (`f771') or in a subsequent phase of + processing, run your source file through the C preprocessor by + doing `g77 -E SOURCEFILE > NEWFILE'. Then, include the contents + of NEWFILE in the bug report. (When you do this, use the same + preprocessor options--such as `-I', `-D', and `-U'--that you used + in actual compilation.) + + A single statement is not enough of an example. In order to + compile it, it must be embedded in a complete file of compiler + input. The bug might depend on the details of how this is done. + + Without a real example one can compile, all anyone can do about + your bug report is wish you luck. It would be futile to try to + guess how to provoke the bug. For example, bugs in register + allocation and reloading can depend on every little detail of the + source and include files that trigger them. + + * Note that you should include with your bug report any files + included by the source file (via the `#include' or `INCLUDE' + directive) that you send, and any files they include, and so on. + + It is not necessary to replace the `#include' and `INCLUDE' + directives with the actual files in the version of the source file + that you send, but it might make submitting the bug report easier + in the end. However, be sure to _reproduce_ the bug using the + _exact_ version of the source material you submit, to avoid + wild-goose chases. + + * The command arguments you gave GNU Fortran to compile that example + and observe the bug. For example, did you use `-O'? To guarantee + you won't omit something important, list all the options. + + If we were to try to guess the arguments, we would probably guess + wrong and then we would not encounter the bug. + + * The type of machine you are using, and the operating system name + and version number. (Much of this information is printed by `g77 + -v'--if you include that, send along any additional info you have + that you don't see clearly represented in that output.) + + * The operands you gave to the `configure' command when you installed + the compiler. + + * A complete list of any modifications you have made to the compiler + source. (We don't promise to investigate the bug unless it + happens in an unmodified compiler. But if you've made + modifications and don't tell us, then you are sending us on a + wild-goose chase.) + + Be precise about these changes. A description in English is not + enough--send a context diff for them. + + Adding files of your own (such as a machine description for a + machine we don't support) is a modification of the compiler source. + + * Details of any other deviations from the standard procedure for + installing GNU Fortran. + + * A description of what behavior you observe that you believe is + incorrect. For example, "The compiler gets a fatal signal," or, + "The assembler instruction at line 208 in the output is incorrect." + + Of course, if the bug is that the compiler gets a fatal signal, + then one can't miss it. But if the bug is incorrect output, the + maintainer might not notice unless it is glaringly wrong. None of + us has time to study all the assembler code from a 50-line Fortran + program just on the chance that one instruction might be wrong. + We need _you_ to do this part! + + Even if the problem you experience is a fatal signal, you should + still say so explicitly. Suppose something strange is going on, + such as, your copy of the compiler is out of synch, or you have + encountered a bug in the C library on your system. (This has + happened!) Your copy might crash and the copy here would not. If + you said to expect a crash, then when the compiler here fails to + crash, we would know that the bug was not happening. If you don't + say to expect a crash, then we would not know whether the bug was + happening. We would not be able to draw any conclusion from our + observations. + + If the problem is a diagnostic when building GNU Fortran with some + other compiler, say whether it is a warning or an error. + + Often the observed symptom is incorrect output when your program + is run. Sad to say, this is not enough information unless the + program is short and simple. None of us has time to study a large + program to figure out how it would work if compiled correctly, + much less which line of it was compiled wrong. So you will have + to do that. Tell us which source line it is, and what incorrect + result happens when that line is executed. A person who + understands the program can find this as easily as finding a bug + in the program itself. + + * If you send examples of assembler code output from GNU Fortran, + please use `-g' when you make them. The debugging information + includes source line numbers which are essential for correlating + the output with the input. + + * If you wish to mention something in the GNU Fortran source, refer + to it by context, not by line number. + + The line numbers in the development sources don't match those in + your sources. Your line numbers would convey no convenient + information to the maintainers. + + * Additional information from a debugger might enable someone to + find a problem on a machine which he does not have available. + However, you need to think when you collect this information if + you want it to have any chance of being useful. + + For example, many people send just a backtrace, but that is never + useful by itself. A simple backtrace with arguments conveys little + about GNU Fortran because the compiler is largely data-driven; the + same functions are called over and over for different RTL insns, + doing different things depending on the details of the insn. + + Most of the arguments listed in the backtrace are useless because + they are pointers to RTL list structure. The numeric values of the + pointers, which the debugger prints in the backtrace, have no + significance whatever; all that matters is the contents of the + objects they point to (and most of the contents are other such + pointers). + + In addition, most compiler passes consist of one or more loops that + scan the RTL insn sequence. The most vital piece of information + about such a loop--which insn it has reached--is usually in a + local variable, not in an argument. + + What you need to provide in addition to a backtrace are the values + of the local variables for several stack frames up. When a local + variable or an argument is an RTX, first print its value and then + use the GDB command `pr' to print the RTL expression that it points + to. (If GDB doesn't run on your machine, use your debugger to call + the function `debug_rtx' with the RTX as an argument.) In + general, whenever a variable is a pointer, its value is no use + without the data it points to. + + Here are some things that are not necessary: + + * A description of the envelope of the bug. + + Often people who encounter a bug spend a lot of time investigating + which changes to the input file will make the bug go away and which + changes will not affect it. + + This is often time consuming and not very useful, because the way + we will find the bug is by running a single example under the + debugger with breakpoints, not by pure deduction from a series of + examples. You might as well save your time for something else. + + Of course, if you can find a simpler example to report _instead_ of + the original one, that is a convenience. Errors in the output + will be easier to spot, running under the debugger will take less + time, etc. Most GNU Fortran bugs involve just one function, so + the most straightforward way to simplify an example is to delete + all the function definitions except the one where the bug occurs. + Those earlier in the file may be replaced by external declarations + if the crucial function depends on them. (Exception: inline + functions might affect compilation of functions defined later in + the file.) + + However, simplification is not vital; if you don't want to do this, + report the bug anyway and send the entire test case you used. + + * In particular, some people insert conditionals `#ifdef BUG' around + a statement which, if removed, makes the bug not happen. These + are just clutter; we won't pay any attention to them anyway. + Besides, you should send us preprocessor output, and that can't + have conditionals. + + * A patch for the bug. + + A patch for the bug is useful if it is a good one. But don't omit + the necessary information, such as the test case, on the + assumption that a patch is all we need. We might see problems + with your patch and decide to fix the problem another way, or we + might not understand it at all. + + Sometimes with a program as complicated as GNU Fortran it is very + hard to construct an example that will make the program follow a + certain path through the code. If you don't send the example, we + won't be able to construct one, so we won't be able to verify that + the bug is fixed. + + And if we can't understand what bug you are trying to fix, or why + your patch should be an improvement, we won't install it. A test + case will help us to understand. + + See `http://gcc.gnu.org/contribute.html' for guidelines on how to + make it easy for us to understand and install your patches. + + * A guess about what the bug is or what it depends on. + + Such guesses are usually wrong. Even the maintainer can't guess + right about such things without first using the debugger to find + the facts. + + * A core dump file. + + We have no way of examining a core dump for your type of machine + unless we have an identical system--and if we do have one, we + should be able to reproduce the crash ourselves. + +  + File: g77.info, Node: Service, Next: Adding Options, Prev: Bugs, Up: Top + + How To Get Help with GNU Fortran + ******************************** + + If you need help installing, using or changing GNU Fortran, there + are two ways to find it: + + * Look in the service directory for someone who might help you for a + fee. The service directory is found in the file named `SERVICE' + in the GNU CC distribution. + + * Send a message to . + +  + File: g77.info, Node: Adding Options, Next: Projects, Prev: Service, Up: Top + + Adding Options + ************** + + To add a new command-line option to `g77', first decide what kind of + option you wish to add. Search the `g77' and `gcc' documentation for + one or more options that is most closely like the one you want to add + (in terms of what kind of effect it has, and so on) to help clarify its + nature. + + * _Fortran options_ are options that apply only when compiling + Fortran programs. They are accepted by `g77' and `gcc', but they + apply only when compiling Fortran programs. + + * _Compiler options_ are options that apply when compiling most any + kind of program. + + _Fortran options_ are listed in the file `gcc/gcc/f/lang-options.h', + which is used during the build of `gcc' to build a list of all options + that are accepted by at least one language's compiler. This list goes + into the `documented_lang_options' array in `gcc/toplev.c', which uses + this array to determine whether a particular option should be offered + to the linked-in front end for processing by calling + `lang_option_decode', which, for `g77', is in `gcc/gcc/f/com.c' and just + calls `ffe_decode_option'. + + If the linked-in front end "rejects" a particular option passed to + it, `toplev.c' just ignores the option, because _some_ language's + compiler is willing to accept it. + + This allows commands like `gcc -fno-asm foo.c bar.f' to work, even + though Fortran compilation does not currently support the `-fno-asm' + option; even though the `f771' version of `lang_decode_option' rejects + `-fno-asm', `toplev.c' doesn't produce a diagnostic because some other + language (C) does accept it. + + This also means that commands like `g77 -fno-asm foo.f' yield no + diagnostics, despite the fact that no phase of the command was able to + recognize and process `-fno-asm'--perhaps a warning about this would be + helpful if it were possible. + + Code that processes Fortran options is found in `gcc/gcc/f/top.c', + function `ffe_decode_option'. This code needs to check positive and + negative forms of each option. + + The defaults for Fortran options are set in their global + definitions, also found in `gcc/gcc/f/top.c'. Many of these defaults + are actually macros defined in `gcc/gcc/f/target.h', since they might be + machine-specific. However, since, in practice, GNU compilers should + behave the same way on all configurations (especially when it comes to + language constructs), the practice of setting defaults in `target.h' is + likely to be deprecated and, ultimately, stopped in future versions of + `g77'. + + Accessor macros for Fortran options, used by code in the `g77' FFE, + are defined in `gcc/gcc/f/top.h'. + + _Compiler options_ are listed in `gcc/toplev.c' in the array + `f_options'. An option not listed in `lang_options' is looked up in + `f_options' and handled from there. + + The defaults for compiler options are set in the global definitions + for the corresponding variables, some of which are in `gcc/toplev.c'. + + You can set different defaults for _Fortran-oriented_ or + _Fortran-reticent_ compiler options by changing the source code of + `g77' and rebuilding. How to do this depends on the version of `g77': + + `G77 0.5.24 (EGCS 1.1)' + `G77 0.5.25 (EGCS 1.2 - which became GCC 2.95)' + Change the `lang_init_options' routine in `gcc/gcc/f/com.c'. + + (Note that these versions of `g77' perform internal consistency + checking automatically when the `-fversion' option is specified.) + + `G77 0.5.23' + `G77 0.5.24 (EGCS 1.0)' + Change the way `f771' handles the `-fset-g77-defaults' option, + which is always provided as the first option when called by `g77' + or `gcc'. + + This code is in `ffe_decode_options' in `gcc/gcc/f/top.c'. Have + it change just the variables that you want to default to a + different setting for Fortran compiles compared to compiles of + other languages. + + The `-fset-g77-defaults' option is passed to `f771' automatically + because of the specification information kept in + `gcc/gcc/f/lang-specs.h'. This file tells the `gcc' command how + to recognize, in this case, Fortran source files (those to be + preprocessed, and those that are not), and further, how to invoke + the appropriate programs (including `f771') to process those + source files. + + It is in `gcc/gcc/f/lang-specs.h' that `-fset-g77-defaults', + `-fversion', and other options are passed, as appropriate, even + when the user has not explicitly specified them. Other "internal" + options such as `-quiet' also are passed via this mechanism. + +  + File: g77.info, Node: Projects, Next: Front End, Prev: Adding Options, Up: Top + + Projects + ******** + + If you want to contribute to `g77' by doing research, design, + specification, documentation, coding, or testing, the following + information should give you some ideas. More relevant information + might be available from `ftp://alpha.gnu.org/gnu/g77/projects/'. + + * Menu: + + * Efficiency:: Make `g77' itself compile code faster. + * Better Optimization:: Teach `g77' to generate faster code. + * Simplify Porting:: Make `g77' easier to configure, build, + and install. + * More Extensions:: Features many users won't know to ask for. + * Machine Model:: `g77' should better leverage `gcc'. + * Internals Documentation:: Make maintenance easier. + * Internals Improvements:: Make internals more robust. + * Better Diagnostics:: Make using `g77' on new code easier. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-18 gcc-3.2.3/gcc/f/g77.info-18 *** gcc-3.2.2/gcc/f/g77.info-18 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-18 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,1051 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Efficiency, Next: Better Optimization, Up: Projects + + Improve Efficiency + ================== + + Don't bother doing any performance analysis until most of the + following items are taken care of, because there's no question they + represent serious space/time problems, although some of them show up + only given certain kinds of (popular) input. + + * Improve `malloc' package and its uses to specify more info about + memory pools and, where feasible, use obstacks to implement them. + + * Skip over uninitialized portions of aggregate areas (arrays, + `COMMON' areas, `EQUIVALENCE' areas) so zeros need not be output. + This would reduce memory usage for large initialized aggregate + areas, even ones with only one initialized element. + + As of version 0.5.18, a portion of this item has already been + accomplished. + + * Prescan the statement (in `sta.c') so that the nature of the + statement is determined as much as possible by looking entirely at + its form, and not looking at any context (previous statements, + including types of symbols). This would allow ripping out of the + statement-confirmation, symbol retraction/confirmation, and + diagnostic inhibition mechanisms. Plus, it would result in + much-improved diagnostics. For example, `CALL + some-intrinsic(...)', where the intrinsic is not a subroutine + intrinsic, would result actual error instead of the + unimplemented-statement catch-all. + + * Throughout `g77', don't pass line/column pairs where a simple + `ffewhere' type, which points to the error as much as is desired + by the configuration, will do, and don't pass `ffelexToken' types + where a simple `ffewhere' type will do. Then, allow new default + configuration of `ffewhere' such that the source line text is not + preserved, and leave it to things like Emacs' next-error function + to point to them (now that `next-error' supports column, or, + perhaps, character-offset, numbers). The change in calling + sequences should improve performance somewhat, as should not + having to save source lines. (Whether this whole item will + improve performance is questionable, but it should improve + maintainability.) + + * Handle `DATA (A(I),I=1,1000000)/1000000*2/' more efficiently, + especially as regards the assembly output. Some of this might + require improving the back end, but lots of improvement in + space/time required in `g77' itself can be fairly easily obtained + without touching the back end. Maybe type-conversion, where + necessary, can be speeded up as well in cases like the one shown + (converting the `2' into `2.'). + + * If analysis shows it to be worthwhile, optimize `lex.c'. + + * Consider redesigning `lex.c' to not need any feedback during + tokenization, by keeping track of enough parse state on its own. + +  + File: g77.info, Node: Better Optimization, Next: Simplify Porting, Prev: Efficiency, Up: Projects + + Better Optimization + =================== + + Much of this work should be put off until after `g77' has all the + features necessary for its widespread acceptance as a useful F77 + compiler. However, perhaps this work can be done in parallel during + the feature-adding work. + + * Do the equivalent of the trick of putting `extern inline' in front + of every function definition in `libg2c' and #include'ing the + resulting file in `f2c'+`gcc'--that is, inline all + run-time-library functions that are at all worth inlining. (Some + of this has already been done, such as for integral + exponentiation.) + + * When doing `CHAR_VAR = CHAR_FUNC(...)', and it's clear that types + line up and `CHAR_VAR' is addressable or not a `VAR_DECL', make + `CHAR_VAR', not a temporary, be the receiver for `CHAR_FUNC'. + (This is now done for `COMPLEX' variables.) + + * Design and implement Fortran-specific optimizations that don't + really belong in the back end, or where the front end needs to + give the back end more info than it currently does. + + * Design and implement a new run-time library interface, with the + code going into `libgcc' so no special linking is required to link + Fortran programs using standard language features. This library + would speed up lots of things, from I/O (using precompiled formats, + doing just one, or, at most, very few, calls for arrays or array + sections, and so on) to general computing (array/section + implementations of various intrinsics, implementation of commonly + performed loops that aren't likely to be optimally compiled + otherwise, etc.). + + Among the important things the library would do are: + + * Be a one-stop-shop-type library, hence shareable and usable + by all, in that what are now library-build-time options in + `libg2c' would be moved at least to the `g77' compile phase, + if not to finer grains (such as choosing how list-directed + I/O formatting is done by default at `OPEN' time, for + preconnected units via options or even statements in the main + program unit, maybe even on a per-I/O basis with appropriate + pragma-like devices). + + * Probably requiring the new library design, change interface to + normally have `COMPLEX' functions return their values in the way + `gcc' would if they were declared `__complex__ float', rather than + using the mechanism currently used by `CHARACTER' functions + (whereby the functions are compiled as returning void and their + first arg is a pointer to where to store the result). (Don't + append underscores to external names for `COMPLEX' functions in + some cases once `g77' uses `gcc' rather than `f2c' calling + conventions.) + + * Do something useful with `doiter' references where possible. For + example, `CALL FOO(I)' cannot modify `I' if within a `DO' loop + that uses `I' as the iteration variable, and the back end might + find that info useful in determining whether it needs to read `I' + back into a register after the call. (It normally has to do that, + unless it knows `FOO' never modifies its passed-by-reference + argument, which is rarely the case for Fortran-77 code.) + +  + File: g77.info, Node: Simplify Porting, Next: More Extensions, Prev: Better Optimization, Up: Projects + + Simplify Porting + ================ + + Making `g77' easier to configure, port, build, and install, either + as a single-system compiler or as a cross-compiler, would be very + useful. + + * A new library (replacing `libg2c') should improve portability as + well as produce more optimal code. Further, `g77' and the new + library should conspire to simplify naming of externals, such as + by removing unnecessarily added underscores, and to + reduce/eliminate the possibility of naming conflicts, while making + debugger more straightforward. + + Also, it should make multi-language applications more feasible, + such as by providing Fortran intrinsics that get Fortran unit + numbers given C `FILE *' descriptors. + + * Possibly related to a new library, `g77' should produce the + equivalent of a `gcc' `main(argc, argv)' function when it compiles + a main program unit, instead of compiling something that must be + called by a library implementation of `main()'. + + This would do many useful things such as provide more flexibility + in terms of setting up exception handling, not requiring + programmers to start their debugging sessions with `breakpoint + MAIN__' followed by `run', and so on. + + * The GBE needs to understand the difference between alignment + requirements and desires. For example, on Intel x86 machines, + `g77' currently imposes overly strict alignment requirements, due + to the back end, but it would be useful for Fortran and C + programmers to be able to override these _recommendations_ as long + as they don't violate the actual processor _requirements_. + +  + File: g77.info, Node: More Extensions, Next: Machine Model, Prev: Simplify Porting, Up: Projects + + More Extensions + =============== + + These extensions are not the sort of things users ask for "by name", + but they might improve the usability of `g77', and Fortran in general, + in the long run. Some of these items really pertain to improving `g77' + internals so that some popular extensions can be more easily supported. + + * Look through all the documentation on the GNU Fortran language, + dialects, compiler, missing features, bugs, and so on. Many + mentions of incomplete or missing features are sprinkled + throughout. It is not worth repeating them here. + + * Consider adding a `NUMERIC' type to designate typeless numeric + constants, named and unnamed. The idea is to provide a + forward-looking, effective replacement for things like the + old-style `PARAMETER' statement when people really need + typelessness in a maintainable, portable, clearly documented way. + Maybe `TYPELESS' would include `CHARACTER', `POINTER', and + whatever else might come along. (This is not really a call for + polymorphism per se, just an ability to express limited, syntactic + polymorphism.) + + * Support `OPEN(...,KEY=(...),...)'. + + * Support arbitrary file unit numbers, instead of limiting them to 0 + through `MXUNIT-1'. (This is a `libg2c' issue.) + + * `OPEN(NOSPANBLOCKS,...)' is treated as + `OPEN(UNIT=NOSPANBLOCKS,...)', so a later `UNIT=' in the first + example is invalid. Make sure this is what users of this feature + would expect. + + * Currently `g77' disallows `READ(1'10)' since it is an obnoxious + syntax, but supporting it might be pretty easy if needed. More + details are needed, such as whether general expressions separated + by an apostrophe are supported, or maybe the record number can be + a general expression, and so on. + + * Support `STRUCTURE', `UNION', `MAP', and `RECORD' fully. + Currently there is no support at all for `%FILL' in `STRUCTURE' + and related syntax, whereas the rest of the stuff has at least + some parsing support. This requires either major changes to + `libg2c' or its replacement. + + * F90 and `g77' probably disagree about label scoping relative to + `INTERFACE' and `END INTERFACE', and their contained procedure + interface bodies (blocks?). + + * `ENTRY' doesn't support F90 `RESULT()' yet, since that was added + after S8.112. + + * Empty-statement handling (10 ;;CONTINUE;;) probably isn't + consistent with the final form of the standard (it was vague at + S8.112). + + * It seems to be an "open" question whether a file, immediately + after being `OPEN'ed,is positioned at the beginning, the end, or + wherever--it might be nice to offer an option of opening to + "undefined" status, requiring an explicit absolute-positioning + operation to be performed before any other (besides `CLOSE') to + assist in making applications port to systems (some IBM?) that + `OPEN' to the end of a file or some such thing. + +  + File: g77.info, Node: Machine Model, Next: Internals Documentation, Prev: More Extensions, Up: Projects + + Machine Model + ============= + + This items pertain to generalizing `g77''s view of the machine model + to more fully accept whatever the GBE provides it via its configuration. + + * Switch to using `REAL_VALUE_TYPE' to represent floating-point + constants exclusively so the target float format need not be + required. This means changing the way `g77' handles + initialization of aggregate areas having more than one type, such + as `REAL' and `INTEGER', because currently it initializes them as + if they were arrays of `char' and uses the bit patterns of the + constants of the various types in them to determine what to stuff + in elements of the arrays. + + * Rely more and more on back-end info and capabilities, especially + in the area of constants (where having the `g77' front-end's IL + just store the appropriate tree nodes containing constants might + be best). + + * Suite of C and Fortran programs that a user/administrator can run + on a machine to help determine the configuration for `g77' before + building and help determine if the compiler works (especially with + whatever libraries are installed) after building. + +  + File: g77.info, Node: Internals Documentation, Next: Internals Improvements, Prev: Machine Model, Up: Projects + + Internals Documentation + ======================= + + Better info on how `g77' works and how to port it is needed. + + *Note Front End::, which contains some information on `g77' + internals. + +  + File: g77.info, Node: Internals Improvements, Next: Better Diagnostics, Prev: Internals Documentation, Up: Projects + + Internals Improvements + ====================== + + Some more items that would make `g77' more reliable and easier to + maintain: + + * Generally make expression handling focus more on critical syntax + stuff, leaving semantics to callers. For example, anything a + caller can check, semantically, let it do so, rather than having + `expr.c' do it. (Exceptions might include things like diagnosing + `FOO(I--K:)=BAR' where `FOO' is a `PARAMETER'--if it seems + important to preserve the left-to-right-in-source order of + production of diagnostics.) + + * Come up with better naming conventions for `-D' to establish + requirements to achieve desired implementation dialect via + `proj.h'. + + * Clean up used tokens and `ffewhere's in `ffeglobal_terminate_1'. + + * Replace `sta.c' `outpooldisp' mechanism with `malloc_pool_use'. + + * Check for `opANY' in more places in `com.c', `std.c', and `ste.c', + and get rid of the `opCONVERT(opANY)' kludge (after determining if + there is indeed no real need for it). + + * Utility to read and check `bad.def' messages and their references + in the code, to make sure calls are consistent with message + templates. + + * Search and fix `&ffe...' and similar so that `ffe...ptr...' macros + are available instead (a good argument for wishing this could have + written all this stuff in C++, perhaps). On the other hand, it's + questionable whether this sort of improvement is really necessary, + given the availability of tools such as Emacs and Perl, which make + finding any address-taking of structure members easy enough? + + * Some modules truly export the member names of their structures + (and the structures themselves), maybe fix this, and fix other + modules that just appear to as well (by appending `_', though it'd + be ugly and probably not worth the time). + + * Implement C macros `RETURNS(value)' and `SETS(something,value)' in + `proj.h' and use them throughout `g77' source code (especially in + the definitions of access macros in `.h' files) so they can be + tailored to catch code writing into a `RETURNS()' or reading from + a `SETS()'. + + * Decorate throughout with `const' and other such stuff. + + * All F90 notational derivations in the source code are still based + on the S8.112 version of the draft standard. Probably should + update to the official standard, or put documentation of the rules + as used in the code...uh...in the code. + + * Some `ffebld_new' calls (those outside of `ffeexpr.c' or inside + but invoked via paths not involving `ffeexpr_lhs' or + `ffeexpr_rhs') might be creating things in improper pools, leading + to such things staying around too long or (doubtful, but possible + and dangerous) not long enough. + + * Some `ffebld_list_new' (or whatever) calls might not be matched by + `ffebld_list_bottom' (or whatever) calls, which might someday + matter. (It definitely is not a problem just yet.) + + * Probably not doing clean things when we fail to `EQUIVALENCE' + something due to alignment/mismatch or other problems--they end up + without `ffestorag' objects, so maybe the backend (and other parts + of the front end) can notice that and handle like an `opANY' (do + what it wants, just don't complain or crash). Most of this seems + to have been addressed by now, but a code review wouldn't hurt. + +  + File: g77.info, Node: Better Diagnostics, Prev: Internals Improvements, Up: Projects + + Better Diagnostics + ================== + + These are things users might not ask about, or that need to be + looked into, before worrying about. Also here are items that involve + reducing unnecessary diagnostic clutter. + + * When `FUNCTION' and `ENTRY' point types disagree (`CHARACTER' + lengths, type classes, and so on), `ANY'-ize the offending `ENTRY' + point and any _new_ dummies it specifies. + + * Speed up and improve error handling for data when repeat-count is + specified. For example, don't output 20 unnecessary messages + after the first necessary one for: + + INTEGER X(20) + CONTINUE + DATA (X(I), J= 1, 20) /20*5/ + END + + (The `CONTINUE' statement ensures the `DATA' statement is + processed in the context of executable, not specification, + statements.) + +  + File: g77.info, Node: Front End, Next: Diagnostics, Prev: Projects, Up: Top + + Front End + ********* + + This chapter describes some aspects of the design and implementation + of the `g77' front end. + + To find about things that are "To Be Determined" or "To Be Done", + search for the string TBD. If you want to help by working on one or + more of these items, email . If you're planning to do + more than just research issues and offer comments, see + `http://www.gnu.org/software/contribute.html' for steps you might need + to take first. + + * Menu: + + * Overview of Sources:: + * Overview of Translation Process:: + * Philosophy of Code Generation:: + * Two-pass Design:: + * Challenges Posed:: + * Transforming Statements:: + * Transforming Expressions:: + * Internal Naming Conventions:: + +  + File: g77.info, Node: Overview of Sources, Next: Overview of Translation Process, Up: Front End + + Overview of Sources + =================== + + The current directory layout includes the following: + + `{No value for `srcdir'}/gcc/' + Non-g77 files in gcc + + `{No value for `srcdir'}/gcc/f/' + GNU Fortran front end sources + + `{No value for `srcdir'}/libf2c/' + `libg2c' configuration and `g2c.h' file generation + + `{No value for `srcdir'}/libf2c/libF77/' + General support and math portion of `libg2c' + + `{No value for `srcdir'}/libf2c/libI77/' + I/O portion of `libg2c' + + `{No value for `srcdir'}/libf2c/libU77/' + Additional interfaces to Unix `libc' for `libg2c' + + Components of note in `g77' are described below. + + `f/' as a whole contains the source for `g77', while `libf2c/' + contains a portion of the separate program `f2c'. Note that the + `libf2c' code is not part of the program `g77', just distributed with + it. + + `f/' contains text files that document the Fortran compiler, source + files for the GNU Fortran Front End (FFE), and some other stuff. The + `g77' compiler code is placed in `f/' because it, along with its + contents, is designed to be a subdirectory of a `gcc' source directory, + `gcc/', which is structured so that language-specific front ends can be + "dropped in" as subdirectories. The C++ front end (`g++'), is an + example of this--it resides in the `cp/' subdirectory. Note that the C + front end (also referred to as `gcc') is an exception to this, as its + source files reside in the `gcc/' directory itself. + + `libf2c/' contains the run-time libraries for the `f2c' program, + also used by `g77'. These libraries normally referred to collectively + as `libf2c'. When built as part of `g77', `libf2c' is installed under + the name `libg2c' to avoid conflict with any existing version of + `libf2c', and thus is often referred to as `libg2c' when the `g77' + version is specifically being referred to. + + The `netlib' version of `libf2c/' contains two distinct libraries, + `libF77' and `libI77', each in their own subdirectories. In `g77', + this distinction is not made, beyond maintaining the subdirectory + structure in the source-code tree. + + `libf2c/' is not part of the program `g77', just distributed with it. + It contains files not present in the official (`netlib') version of + `libf2c', and also contains some minor changes made from `libf2c', to + fix some bugs, and to facilitate automatic configuration, building, and + installation of `libf2c' (as `libg2c') for use by `g77' users. See + `libf2c/README' for more information, including licensing conditions + governing distribution of programs containing code from `libg2c'. + + `libg2c', `g77''s version of `libf2c', adds Dave Love's + implementation of `libU77', in the `libf2c/libU77/' directory. This + library is distributed under the GNU Library General Public License + (LGPL)--see the file `libf2c/libU77/COPYING.LIB' for more information, + as this license governs distribution conditions for programs containing + code from this portion of the library. + + Files of note in `f/' and `libf2c/' are described below: + + `f/BUGS' + Lists some important bugs known to be in g77. Or use Info (or GNU + Emacs Info mode) to read the "Actual Bugs" node of the `g77' + documentation: + + info -f f/g77.info -n "Actual Bugs" + + `f/ChangeLog' + Lists recent changes to `g77' internals. + + `libf2c/ChangeLog' + Lists recent changes to `libg2c' internals. + + `f/NEWS' + Contains the per-release changes. These include the user-visible + changes described in the node "Changes" in the `g77' + documentation, plus internal changes of import. Or use: + + info -f f/g77.info -n News + + `f/g77.info*' + The `g77' documentation, in Info format, produced by building + `g77'. + + All users of `g77' (not just installers) should read this, using + the `more' command if neither the `info' command, nor GNU Emacs + (with its Info mode), are available, or if users aren't yet + accustomed to using these tools. All of these files are readable + as "plain text" files, though they're easier to navigate using + Info readers such as `info' and GNU Emacs Info mode. + + If you want to explore the FFE code, which lives entirely in `f/', + here are a few clues. The file `g77spec.c' contains the `g77'-specific + source code for the `g77' command only--this just forms a variant of the + `gcc' command, so, just as the `gcc' command itself does not contain + the C front end, the `g77' command does not contain the Fortran front + end (FFE). The FFE code ends up in an executable named `f771', which + does the actual compiling, so it contains the FFE plus the `gcc' back + end (GBE), the latter to do most of the optimization, and the code + generation. + + The file `parse.c' is the source file for `yyparse()', which is + invoked by the GBE to start the compilation process, for `f771'. + + The file `top.c' contains the top-level FFE function `ffe_file' and + it (along with top.h) define all `ffe_[a-z].*', `ffe[A-Z].*', and + `FFE_[A-Za-z].*' symbols. + + The file `fini.c' is a `main()' program that is used when building + the FFE to generate C header and source files for recognizing keywords. + The files `malloc.c' and `malloc.h' comprise a memory manager that + defines all `malloc_[a-z].*', `malloc[A-Z].*', and `MALLOC_[A-Za-z].*' + symbols. + + All other modules named XYZ are comprised of all files named + `XYZ*.EXT' and define all `ffeXYZ_[a-z].*', `ffeXYZ[A-Z].*', and + `FFEXYZ_[A-Za-z].*' symbols. If you understand all this, + congratulations--it's easier for me to remember how it works than to + type in these regular expressions. But it does make it easy to find + where a symbol is defined. For example, the symbol + `ffexyz_set_something' would be defined in `xyz.h' and implemented + there (if it's a macro) or in `xyz.c'. + + The "porting" files of note currently are: + + `proj.c' + `proj.h' + This defines the "language" used by all the other source files, + the language being Standard C plus some useful things like + `ARRAY_SIZE' and such. + + `target.c' + `target.h' + These describe the target machine in terms of what data types are + supported, how they are denoted (to what C type does an + `INTEGER*8' map, for example), how to convert between them, and so + on. Over time, versions of `g77' rely less on this file and more + on run-time configuration based on GBE info in `com.c'. + + `com.c' + `com.h' + These are the primary interface to the GBE. + + `ste.c' + `ste.h' + This contains code for implementing recognized executable + statements in the GBE. + + `src.c' + `src.h' + These contain information on the format(s) of source files (such + as whether they are never to be processed as case-insensitive with + regard to Fortran keywords). + + If you want to debug the `f771' executable, for example if it + crashes, note that the global variables `lineno' and `input_filename' + are usually set to reflect the current line being read by the lexer + during the first-pass analysis of a program unit and to reflect the + current line being processed during the second-pass compilation of a + program unit. + + If an invocation of the function `ffestd_exec_end' is on the stack, + the compiler is in the second pass, otherwise it is in the first. + + (This information might help you reduce a test case and/or work + around a bug in `g77' until a fix is available.) + +  + File: g77.info, Node: Overview of Translation Process, Next: Philosophy of Code Generation, Prev: Overview of Sources, Up: Front End + + Overview of Translation Process + =============================== + + The order of phases translating source code to the form accepted by + the GBE is: + + 1. Stripping punched-card sources (`g77stripcard.c') + + 2. Lexing (`lex.c') + + 3. Stand-alone statement identification (`sta.c') + + 4. INCLUDE handling (`sti.c') + + 5. Order-dependent statement identification (`stq.c') + + 6. Parsing (`stb.c' and `expr.c') + + 7. Constructing (`stc.c') + + 8. Collecting (`std.c') + + 9. Expanding (`ste.c') + + To get a rough idea of how a particularly twisted Fortran statement + gets treated by the passes, consider: + + FORMAT(I2 4H)=(J/ + & I3) + + The job of `lex.c' is to know enough about Fortran syntax rules to + break the statement up into distinct lexemes without requiring any + feedback from subsequent phases: + + `FORMAT' + `(' + `I24H' + `)' + `=' + `(' + `J' + `/' + `I3' + `)' + + The job of `sta.c' is to figure out the kind of statement, or, at + least, statement form, that sequence of lexemes represent. + + The sooner it can do this (in terms of using the smallest number of + lexemes, starting with the first for each statement), the better, + because that leaves diagnostics for problems beyond the recognition of + the statement form to subsequent phases, which can usually better + describe the nature of the problem. + + In this case, the `=' at "level zero" (not nested within parentheses) + tells `sta.c' that this is an _assignment-form_, not `FORMAT', + statement. + + An assignment-form statement might be a statement-function + definition or an executable assignment statement. + + To make that determination, `sta.c' looks at the first two lexemes. + + Since the second lexeme is `(', the first must represent an array + for this to be an assignment statement, else it's a statement function. + + Either way, `sta.c' hands off the statement to `stq.c' (via `sti.c', + which expands INCLUDE files). `stq.c' figures out what a statement + that is, on its own, ambiguous, must actually be based on the context + established by previous statements. + + So, `stq.c' watches the statement stream for executable statements, + END statements, and so on, so it knows whether `A(B)=C' is (intended + as) a statement-function definition or an assignment statement. + + After establishing the context-aware statement info, `stq.c' passes + the original sample statement on to `stb.c' (either its + statement-function parser or its assignment-statement parser). + + `stb.c' forms a statement-specific record containing the pertinent + information. That information includes a source expression and, for an + assignment statement, a destination expression. Expressions are parsed + by `expr.c'. + + This record is passed to `stc.c', which copes with the implications + of the statement within the context established by previous statements. + + For example, if it's the first statement in the file or after an + `END' statement, `stc.c' recognizes that, first of all, a main program + unit is now being lexed (and tells that to `std.c' before telling it + about the current statement). + + `stc.c' attaches whatever information it can, usually derived from + the context established by the preceding statements, and passes the + information to `std.c'. + + `std.c' saves this information away, since the GBE cannot cope with + information that might be incomplete at this stage. + + For example, `I3' might later be determined to be an argument to an + alternate `ENTRY' point. + + When `std.c' is told about the end of an external (top-level) + program unit, it passes all the information it has saved away on + statements in that program unit to `ste.c'. + + `ste.c' "expands" each statement, in sequence, by constructing the + appropriate GBE information and calling the appropriate GBE routines. + + Details on the transformational phases follow. Keep in mind that + Fortran numbering is used, so the first character on a line is column 1, + decimal numbering is used, and so on. + + * Menu: + + * g77stripcard:: + * lex.c:: + * sta.c:: + * sti.c:: + * stq.c:: + * stb.c:: + * expr.c:: + * stc.c:: + * std.c:: + * ste.c:: + + * Gotchas (Transforming):: + * TBD (Transforming):: + +  + File: g77.info, Node: g77stripcard, Next: lex.c, Up: Overview of Translation Process + + g77stripcard + ------------ + + The `g77stripcard' program handles removing content beyond column 72 + (adjustable via a command-line option), optionally warning about that + content being something other than trailing whitespace or Fortran + commentary. + + This program is needed because `lex.c' doesn't pay attention to + maximum line lengths at all, to make it easier to maintain, as well as + faster (for sources that don't depend on the maximum column length + vis-a-vis trailing non-blank non-commentary content). + + Just how this program will be run--whether automatically for old + source (perhaps as the default for `.f' files?)--is not yet determined. + + In the meantime, it might as well be implemented as a typical UNIX + pipe. + + It should accept a `-fline-length-N' option, with the default line + length set to 72. + + When the text it strips off the end of a line is not blank (not + spaces and tabs), it should insert an additional comment line + (beginning with `!', so it works for both fixed-form and free-form + files) containing the text, following the stripped line. The inserted + comment should have a prefix of some kind, TBD, that distinguishes the + comment as representing stripped text. Users could use that to `sed' + out such lines, if they wished--it seems silly to provide a + command-line option to delete information when it can be so easily + filtered out by another program. + + (This inserted comment should be designed to "fit in" well with + whatever the Fortran community is using these days for preprocessor, + translator, and other such products, like OpenMP. What that's all + about, and how `g77' can elegantly fit its special comment conventions + into it all, is TBD as well. We don't want to reinvent the wheel here, + but if there turn out to be too many conflicting conventions, we might + have to invent one that looks nothing like the others, but which offers + their host products a better infrastructure in which to fit and coexist + peacefully.) + + `g77stripcard' probably shouldn't do any tab expansion or other + fancy stuff. People can use `expand' or other pre-filtering if they + like. The idea here is to keep each stage quite simple, while providing + excellent performance for "normal" code. + + (Code with junk beyond column 73 is not really "normal", as it comes + from a card-punch heritage, and will be increasingly hard for + tomorrow's Fortran programmers to read.) + +  + File: g77.info, Node: lex.c, Next: sta.c, Prev: g77stripcard, Up: Overview of Translation Process + + lex.c + ----- + + To help make the lexer simple, fast, and easy to maintain, while + also having `g77' generally encourage Fortran programmers to write + simple, maintainable, portable code by maximizing the performance of + compiling that kind of code: + + * There'll be just one lexer, for both fixed-form and free-form + source. + + * It'll care about the form only when handling the first 7 columns of + text, stuff like spaces between strings of alphanumerics, and how + lines are continued. + + Some other distinctions will be handled by subsequent phases, so + at least one of them will have to know which form is involved. + + For example, `I = 2 . 4' is acceptable in fixed form, and works in + free form as well given the implementation `g77' presently uses. + But the standard requires a diagnostic for it in free form, so the + parser has to be able to recognize that the lexemes aren't + contiguous (information the lexer _does_ have to provide) and that + free-form source is being parsed, so it can provide the diagnostic. + + The `g77' lexer doesn't try to gather `2 . 4' into a single lexeme. + Otherwise, it'd have to know a whole lot more about how to parse + Fortran, or subsequent phases (mainly parsing) would have two + paths through lots of critical code--one to handle the lexeme `2', + `.', and `4' in sequence, another to handle the lexeme `2.4'. + + * It won't worry about line lengths (beyond the first 7 columns for + fixed-form source). + + That is, once it starts parsing the "statement" part of a line + (column 7 for fixed-form, column 1 for free-form), it'll keep + going until it finds a newline, rather than ignoring everything + past a particular column (72 or 132). + + The implication here is that there shouldn't _be_ anything past + that last column, other than whitespace or commentary, because + users using typical editors (or viewing output as typically + printed) won't necessarily know just where the last column is. + + Code that has "garbage" beyond the last column (almost certainly + only fixed-form code with a punched-card legacy, such as code + using columns 73-80 for "sequence numbers") will have to be run + through `g77stripcard' first. + + Also, keeping track of the maximum column position while also + watching out for the end of a line _and_ while reading from a file + just makes things slower. Since a file must be read, and watching + for the end of the line is necessary (unless the typical input + file was preprocessed to include the necessary number of trailing + spaces), dropping the tracking of the maximum column position is + the only way to reduce the complexity of the pertinent code while + maintaining high performance. + + * ASCII encoding is assumed for the input file. + + Code written in other character sets will have to be converted + first. + + * Tabs (ASCII code 9) will be converted to spaces via the + straightforward approach. + + Specifically, a tab is converted to between one and eight spaces + as necessary to reach column N, where dividing `(N - 1)' by eight + results in a remainder of zero. + + That saves having to pass most source files through `expand'. + + * Linefeeds (ASCII code 10) mark the ends of lines. + + * A carriage return (ASCII code 13) is accept if it immediately + precedes a linefeed, in which case it is ignored. + + Otherwise, it is rejected (with a diagnostic). + + * Any other characters other than the above that are not part of the + GNU Fortran Character Set (*note Character Set::) are rejected + with a diagnostic. + + This includes backspaces, form feeds, and the like. + + (It might make sense to allow a form feed in column 1 as long as + that's the only character on a line. It certainly wouldn't seem + to cost much in terms of performance.) + + * The end of the input stream (EOF) ends the current line. + + * The distinction between uppercase and lowercase letters will be + preserved. + + It will be up to subsequent phases to decide to fold case. + + Current plans are to permit any casing for Fortran (reserved) + keywords while preserving casing for user-defined names. (This + might not be made the default for `.f' files, though.) + + Preserving case seems necessary to provide more direct access to + facilities outside of `g77', such as to C or Pascal code. + + Names of intrinsics will probably be matchable in any case, + + (How `external SiN; r = sin(x)' would be handled is TBD. I think + old `g77' might already handle that pretty elegantly, but whether + we can cope with allowing the same fragment to reference a + _different_ procedure, even with the same interface, via `s = + SiN(r)', needs to be determined. If it can't, we need to make + sure that when code introduces a user-defined name, any intrinsic + matching that name using a case-insensitive comparison is "turned + off".) + + * Backslashes in `CHARACTER' and Hollerith constants are not allowed. + + This avoids the confusion introduced by some Fortran compiler + vendors providing C-like interpretation of backslashes, while + others provide straight-through interpretation. + + Some kind of lexical construct (TBD) will be provided to allow + flagging of a `CHARACTER' (but probably not a Hollerith) constant + that permits backslashes. It'll necessarily be a prefix, such as: + + PRINT *, C'This line has a backspace \b here.' + PRINT *, F'This line has a straight backslash \ here.' + + Further, command-line options might be provided to specify that + one prefix or the other is to be assumed as the default for + `CHARACTER' constants. + + However, it seems more helpful for `g77' to provide a program that + converts prefix all constants (or just those containing + backslashes) with the desired designation, so printouts of code + can be read without knowing the compile-time options used when + compiling it. + + If such a program is provided (let's name it `g77slash' for now), + then a command-line option to `g77' should not be provided. + (Though, given that it'll be easy to implement, it might be hard + to resist user requests for it "to compile faster than if we have + to invoke another filter".) + + This program would take a command-line option to specify the + default interpretation of slashes, affecting which prefix it uses + for constants. + + `g77slash' probably should automatically convert Hollerith + constants that contain slashes to the appropriate `CHARACTER' + constants. Then `g77' wouldn't have to define a prefix syntax for + Hollerith constants specifying whether they want C-style or + straight-through backslashes. + + * To allow for form-neutral INCLUDE files without requiring them to + be preprocessed, the fixed-form lexer should offer an extension + (if possible) allowing a trailing `&' to be ignored, especially if + after column 72, as it would be using the traditional Unix Fortran + source model (which ignores _everything_ after column 72). + + The above implements nearly exactly what is specified by *Note + Character Set::, and *Note Lines::, except it also provides automatic + conversion of tabs and ignoring of newline-related carriage returns, as + well as accommodating form-neutral INCLUDE files. + + It also implements the "pure visual" model, by which is meant that a + user viewing his code in a typical text editor (assuming it's not + preprocessed via `g77stripcard' or similar) doesn't need any special + knowledge of whether spaces on the screen are really tabs, whether + lines end immediately after the last visible non-space character or + after a number of spaces and tabs that follow it, or whether the last + line in the file is ended by a newline. + + Most editors don't make these distinctions, the ANSI FORTRAN 77 + standard doesn't require them to, and it permits a standard-conforming + compiler to define a method for transforming source code to "standard + form" however it wants. + + So, GNU Fortran defines it such that users have the best chance of + having the code be interpreted the way it looks on the screen of the + typical editor. + + (Fancy editors should _never_ be required to correctly read code + written in classic two-dimensional-plaintext form. By correct reading + I mean ability to read it, book-like, without mistaking text ignored by + the compiler for program code and vice versa, and without having to + count beyond the first several columns. The vague meaning of ASCII + TAB, among other things, complicates this somewhat, but as long as + "everyone", including the editor, other tools, and printer, agrees + about the every-eighth-column convention, the GNU Fortran "pure visual" + model meets these requirements. Any language or user-visible source + form requiring special tagging of tabs, the ends of lines after + spaces/tabs, and so on, fails to meet this fairly straightforward + specification. Fortunately, Fortran _itself_ does not mandate such a + failure, though most vendor-supplied defaults for their Fortran + compilers _do_ fail to meet this specification for readability.) + + Further, this model provides a clean interface to whatever + preprocessors or code-generators are used to produce input to this + phase of `g77'. Mainly, they need not worry about long lines. + +  + File: g77.info, Node: sta.c, Next: sti.c, Prev: lex.c, Up: Overview of Translation Process + + sta.c + ----- + +  + File: g77.info, Node: sti.c, Next: stq.c, Prev: sta.c, Up: Overview of Translation Process + + sti.c + ----- + +  + File: g77.info, Node: stq.c, Next: stb.c, Prev: sti.c, Up: Overview of Translation Process + + stq.c + ----- + +  + File: g77.info, Node: stb.c, Next: expr.c, Prev: stq.c, Up: Overview of Translation Process + + stb.c + ----- + +  + File: g77.info, Node: expr.c, Next: stc.c, Prev: stb.c, Up: Overview of Translation Process + + expr.c + ------ + +  + File: g77.info, Node: stc.c, Next: std.c, Prev: expr.c, Up: Overview of Translation Process + + stc.c + ----- + +  + File: g77.info, Node: std.c, Next: ste.c, Prev: stc.c, Up: Overview of Translation Process + + std.c + ----- + +  + File: g77.info, Node: ste.c, Next: Gotchas (Transforming), Prev: std.c, Up: Overview of Translation Process + + ste.c + ----- + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-19 gcc-3.2.3/gcc/f/g77.info-19 *** gcc-3.2.2/gcc/f/g77.info-19 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-19 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,1209 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Gotchas (Transforming), Next: TBD (Transforming), Prev: ste.c, Up: Overview of Translation Process + + Gotchas (Transforming) + ---------------------- + + This section is not about transforming "gotchas" into something else. + It is about the weirder aspects of transforming Fortran, however that's + defined, into a more modern, canonical form. + + Multi-character Lexemes + ....................... + + Each lexeme carries with it a pointer to where it appears in the + source. + + To provide the ability for diagnostics to point to column numbers, + in addition to line numbers and names, lexemes that represent more than + one (significant) character in the source code need, generally, to + provide pointers to where each _character_ appears in the source. + + This provides the ability to properly identify the precise location + of the problem in code like + + SUBROUTINE X + END + BLOCK DATA X + END + + which, in fixed-form source, would result in single lexemes + consisting of the strings `SUBROUTINEX' and `BLOCKDATAX'. (The problem + is that `X' is defined twice, so a pointer to the `X' in the second + definition, as well as a follow-up pointer to the corresponding pointer + in the first, would be preferable to pointing to the beginnings of the + statements.) + + This need also arises when parsing (and diagnosing) `FORMAT' + statements. + + Further, it arises when diagnosing `FMT=' specifiers that contain + constants (or partial constants, or even propagated constants!) in I/O + statements, as in: + + PRINT '(I2, 3HAB)', J + + (A pointer to the beginning of the prematurely-terminated Hollerith + constant, and/or to the close parenthese, is preferable to a pointer to + the open-parenthese or the apostrophe that precedes it.) + + Multi-character lexemes, which would seem to naturally include at + least digit strings, alphanumeric strings, `CHARACTER' constants, and + Hollerith constants, therefore need to provide location information on + each character. (Maybe Hollerith constants don't, but it's unnecessary + to except them.) + + The question then arises, what about _other_ multi-character lexemes, + such as `**' and `//', and Fortran 90's `(/', `/)', `::', and so on? + + Turns out there's a need to identify the location of the second + character of these two-character lexemes. For example, in `I(/J) = K', + the slash needs to be diagnosed as the problem, not the open parenthese. + Similarly, it is preferable to diagnose the second slash in `I = J // + K' rather than the first, given the implicit typing rules, which would + result in the compiler disallowing the attempted concatenation of two + integers. (Though, since that's more of a semantic issue, it's not + _that_ much preferable.) + + Even sequences that could be parsed as digit strings could use + location info, for example, to diagnose the `9' in the octal constant + `O'129''. (This probably will be parsed as a character string, to be + consistent with the parsing of `Z'129A''.) + + To avoid the hassle of recording the location of the second + character, while also preserving the general rule that each significant + character is distinctly pointed to by the lexeme that contains it, it's + best to simply not have any fixed-size lexemes larger than one + character. + + This new design is expected to make checking for two `*' lexemes in + a row much easier than the old design, so this is not much of a + sacrifice. It probably makes the lexer much easier to implement than + it makes the parser harder. + + Space-padding Lexemes + ..................... + + Certain lexemes need to be padded with virtual spaces when the end + of the line (or file) is encountered. + + This is necessary in fixed form, to handle lines that don't extend + to column 72, assuming that's the line length in effect. + + Bizarre Free-form Hollerith Constants + ..................................... + + Last I checked, the Fortran 90 standard actually required the + compiler to silently accept something like + + FORMAT ( 1 2 Htwelve chars ) + + as a valid `FORMAT' statement specifying a twelve-character + Hollerith constant. + + The implication here is that, since the new lexer is a zero-feedback + one, it won't know that the special case of a `FORMAT' statement being + parsed requires apparently distinct lexemes `1' and `2' to be treated as + a single lexeme. + + (This is a horrible misfeature of the Fortran 90 language. It's one + of many such misfeatures that almost make me want to not support them, + and forge ahead with designing a new "GNU Fortran" language that has + the features, but not the misfeatures, of Fortran 90, and provide + utility programs to do the conversion automatically.) + + So, the lexer must gather distinct chunks of decimal strings into a + single lexeme in contexts where a single decimal lexeme might start a + Hollerith constant. + + (Which probably means it might as well do that all the time for all + multi-character lexemes, even in free-form mode, leaving it to + subsequent phases to pull them apart as they see fit.) + + Compare the treatment of this to how + + CHARACTER * 4 5 HEY + + and + + CHARACTER * 12 HEY + + must be treated--the former must be diagnosed, due to the separation + between lexemes, the latter must be accepted as a proper declaration. + + Hollerith Constants + ................... + + Recognizing a Hollerith constant--specifically, that an `H' or `h' + after a digit string begins such a constant--requires some knowledge of + context. + + Hollerith constants (such as `2HAB') can appear after: + + * `(' + + * `,' + + * `=' + + * `+', `-', `/' + + * `*', except as noted below + + Hollerith constants don't appear after: + + * `CHARACTER*', which can be treated generally as any `*' that is + the second lexeme of a statement + + Confusing Function Keyword + .......................... + + While + + REAL FUNCTION FOO () + + must be a `FUNCTION' statement and + + REAL FUNCTION FOO (5) + + must be a type-definition statement, + + REAL FUNCTION FOO (NAMES) + + where NAMES is a comma-separated list of names, can be one or the + other. + + The only way to disambiguate that statement (short of mandating + free-form source or a short maximum length for name for external + procedures) is based on the context of the statement. + + In particular, the statement is known to be within an + already-started program unit (but not at the outer level of the + `CONTAINS' block), it is a type-declaration statement. + + Otherwise, the statement is a `FUNCTION' statement, in that it + begins a function program unit (external, or, within `CONTAINS', + nested). + + Weird READ + .......... + + The statement + + READ (N) + + is equivalent to either + + READ (UNIT=(N)) + + or + + READ (FMT=(N)) + + depending on which would be valid in context. + + Specifically, if `N' is type `INTEGER', `READ (FMT=(N))' would not + be valid, because parentheses may not be used around `N', whereas they + may around it in `READ (UNIT=(N))'. + + Further, if `N' is type `CHARACTER', the opposite is true--`READ + (UNIT=(N))' is not valid, but `READ (FMT=(N))' is. + + Strictly speaking, if anything follows + + READ (N) + + in the statement, whether the first lexeme after the close + parenthese is a comma could be used to disambiguate the two cases, + without looking at the type of `N', because the comma is required for + the `READ (FMT=(N))' interpretation and disallowed for the `READ + (UNIT=(N))' interpretation. + + However, in practice, many Fortran compilers allow the comma for the + `READ (UNIT=(N))' interpretation anyway (in that they generally allow a + leading comma before an I/O list in an I/O statement), and much code + takes advantage of this allowance. + + (This is quite a reasonable allowance, since the juxtaposition of a + comma-separated list immediately after an I/O control-specification + list, which is also comma-separated, without an intervening comma, + looks sufficiently "wrong" to programmers that they can't resist the + itch to insert the comma. `READ (I, J), K, L' simply looks cleaner than + `READ (I, J) K, L'.) + + So, type-based disambiguation is needed unless strict adherence to + the standard is always assumed, and we're not going to assume that. + +  + File: g77.info, Node: TBD (Transforming), Prev: Gotchas (Transforming), Up: Overview of Translation Process + + TBD (Transforming) + ------------------ + + Continue researching gotchas, designing the transformational process, + and implementing it. + + Specific issues to resolve: + + * Just where should (if it was implemented) `USE' processing take + place? + + This gets into the whole issue of how `g77' should handle the + concept of modules. I think GNAT already takes on this issue, but + don't know more than that. Jim Giles has written extensively on + `comp.lang.fortran' about his opinions on module handling, as have + others. Jim's views should be taken into account. + + Actually, Richard M. Stallman (RMS) also has written up some + guidelines for implementing such things, but I'm not sure where I + read them. Perhaps the old list. + + If someone could dig references to these up and get them to me, + that would be much appreciated! Even though modules are not on + the short-term list for implementation, it'd be helpful to know + _now_ how to avoid making them harder to implement them _later_. + + * Should the `g77' command become just a script that invokes all the + various preprocessing that might be needed, thus making it seem + slower than necessary for legacy code that people are unwilling to + convert, or should we provide a separate script for that, thus + encouraging people to convert their code once and for all? + + At least, a separate script to behave as old `g77' did, perhaps + named `g77old', might ease the transition, as might a + corresponding one that converts source codes named `g77oldnew'. + + These scripts would take all the pertinent options `g77' used to + take and run the appropriate filters, passing the results to `g77' + or just making new sources out of them (in a subdirectory, leaving + the user to do the dirty deed of moving or copying them over the + old sources). + + * Do other Fortran compilers provide a prefix syntax to govern the + treatment of backslashes in `CHARACTER' (or Hollerith) constants? + + Knowing what other compilers provide would help. + + * Is it okay to drop support for the `-fintrin-case-initcap', + `-fmatch-case-initcap', `-fsymbol-case-initcap', and + `-fcase-initcap' options? + + I've asked for input on this. Not + having to support these makes it easier to write the new front end, + and might also avoid complicated its design. + + The consensus to date (1999-11-17) has been to drop this support. + Can't recall anybody saying they're using it, in fact. + +  + File: g77.info, Node: Philosophy of Code Generation, Next: Two-pass Design, Prev: Overview of Translation Process, Up: Front End + + Philosophy of Code Generation + ============================= + + Don't poke the bear. + + The `g77' front end generates code via the `gcc' back end. + + The `gcc' back end (GBE) is a large, complex labyrinth of intricate + code written in a combination of the C language and specialized + languages internal to `gcc'. + + While the _code_ that implements the GBE is written in a combination + of languages, the GBE itself is, to the front end for a language like + Fortran, best viewed as a _compiler_ that compiles its own, unique, + language. + + The GBE's "source", then, is written in this language, which + consists primarily of a combination of calls to GBE functions and + "tree" nodes (which are, themselves, created by calling GBE functions). + + So, the `g77' generates code by, in effect, translating the Fortran + code it reads into a form "written" in the "language" of the `gcc' back + end. + + This language will heretofore be referred to as "GBEL", for GNU Back + End Language. + + GBEL is an evolving language, not fully specified in any published + form as of this writing. It offers many facilities, but its "core" + facilities are those that corresponding most directly to those needed + to support `gcc' (compiling code written in GNU C). + + The `g77' Fortran Front End (FFE) is designed and implemented to + navigate the currents and eddies of ongoing GBEL and `gcc' development + while also delivering on the potential of an integrated FFE (as + compared to using a converter like `f2c' and feeding the output into + `gcc'). + + Goals of the FFE's code-generation strategy include: + + * High likelihood of generation of correct code, or, failing that, + producing a fatal diagnostic or crashing. + + * Generation of highly optimized code, as directed by the user via + GBE-specific (versus `g77'-specific) constructs, such as + command-line options. + + * Fast overall (FFE plus GBE) compilation. + + * Preservation of source-level debugging information. + + The strategies historically, and currently, used by the FFE to + achieve these goals include: + + * Use of GBEL constructs that most faithfully encapsulate the + semantics of Fortran. + + * Avoidance of GBEL constructs that are so rarely used, or limited + to use in specialized situations not related to Fortran, that + their reliability and performance has not yet been established as + sufficient for use by the FFE. + + * Flexible design, to readily accommodate changes to specific + code-generation strategies, perhaps governed by command-line + options. + + "Don't poke the bear" somewhat summarizes the above strategies. The + GBE is the bear. The FFE is designed and implemented to avoid poking it + in ways that are likely to just annoy it. The FFE usually either + tackles it head-on, or avoids treating it in ways dissimilar to how the + `gcc' front end treats it. + + For example, the FFE uses the native array facility in the back end + instead of the lower-level pointer-arithmetic facility used by `gcc' + when compiling `f2c' output). Theoretically, this presents more + opportunities for optimization, faster compile times, and the + production of more faithful debugging information. These benefits were + not, however, immediately realized, mainly because `gcc' itself makes + little or no use of the native array facility. + + Complex arithmetic is a case study of the evolution of this strategy. + When originally implemented, the GBEL had just evolved its own native + complex-arithmetic facility, so the FFE took advantage of that. + + When porting `g77' to 64-bit systems, it was discovered that the GBE + didn't really implement its native complex-arithmetic facility properly. + + The short-term solution was to rewrite the FFE to instead use the + lower-level facilities that'd be used by `gcc'-compiled code (assuming + that code, itself, didn't use the native complex type provided, as an + extension, by `gcc'), since these were known to work, and, in any case, + if shown to not work, would likely be rapidly fixed (since they'd + likely not work for vanilla C code in similar circumstances). + + However, the rewrite accommodated the original, native approach as + well by offering a command-line option to select it over the emulated + approach. This allowed users, and especially GBE maintainers, to try + out fixes to complex-arithmetic support in the GBE while `g77' + continued to default to compiling more code correctly, albeit producing + (typically) slower executables. + + As of April 1999, it appeared that the last few bugs in the GBE's + support of its native complex-arithmetic facility were worked out. The + FFE was changed back to default to using that native facility, leaving + emulation as an option. + + Later during the release cycle (which was called EGCS 1.2, but soon + became GCC 2.95), bugs in the native facility were found. Reactions + among various people included "the last thing we should do is change + the default back", "we must change the default back", and "let's figure + out whether we can narrow down the bugs to few enough cases to allow + the now-months-long-tested default to remain the same". The latter + viewpoint won that particular time. The bugs exposed other concerns + regarding ABI compliance when the ABI specified treatment of complex + data as different from treatment of what Fortran and GNU C consider the + equivalent aggregation (structure) of real (or float) pairs. + + Other Fortran constructs--arrays, character strings, complex + division, `COMMON' and `EQUIVALENCE' aggregates, and so on--involve + issues similar to those pertaining to complex arithmetic. + + So, it is possible that the history of how the FFE handled complex + arithmetic will be repeated, probably in modified form (and hopefully + over shorter timeframes), for some of these other facilities. + +  + File: g77.info, Node: Two-pass Design, Next: Challenges Posed, Prev: Philosophy of Code Generation, Up: Front End + + Two-pass Design + =============== + + The FFE does not tell the GBE anything about a program unit until + after the last statement in that unit has been parsed. (A program unit + is a Fortran concept that corresponds, in the C world, mostly closely + to functions definitions in ISO C. That is, a program unit in Fortran + is like a top-level function in C. Nested functions, found among the + extensions offered by GNU C, correspond roughly to Fortran's statement + functions.) + + So, while parsing the code in a program unit, the FFE saves up all + the information on statements, expressions, names, and so on, until it + has seen the last statement. + + At that point, the FFE revisits the saved information (in what + amounts to a second "pass" over the program unit) to perform the actual + translation of the program unit into GBEL, ultimating in the generation + of assembly code for it. + + Some lookahead is performed during this second pass, so the FFE + could be viewed as a "two-plus-pass" design. + + * Menu: + + * Two-pass Code:: + * Why Two Passes:: + +  + File: g77.info, Node: Two-pass Code, Next: Why Two Passes, Up: Two-pass Design + + Two-pass Code + ------------- + + Most of the code that turns the first pass (parsing) into a second + pass for code generation is in `gcc/gcc/f/std.c'. + + It has external functions, called mainly by siblings in + `gcc/gcc/f/stc.c', that record the information on statements and + expressions in the order they are seen in the source code. These + functions save that information. + + It also has an external function that revisits that information, + calling the siblings in `gcc/gcc/f/ste.c', which handles the actual + code generation (by generating GBEL code, that is, by calling GBE + routines to represent and specify expressions, statements, and so on). + +  + File: g77.info, Node: Why Two Passes, Prev: Two-pass Code, Up: Two-pass Design + + Why Two Passes + -------------- + + The need for two passes was not immediately evident during the + design and implementation of the code in the FFE that was to produce + GBEL. Only after a few kludges, to handle things like + incorrectly-guessed `ASSIGN' label nature, had been implemented, did + enough evidence pile up to make it clear that `std.c' had to be + introduced to intercept, save, then revisit as part of a second pass, + the digested contents of a program unit. + + Other such missteps have occurred during the evolution of the FFE, + because of the different goals of the FFE and the GBE. + + Because the GBE's original, and still primary, goal was to directly + support the GNU C language, the GBEL, and the GBE itself, requires more + complexity on the part of most front ends than it requires of `gcc''s. + + For example, the GBEL offers an interface that permits the `gcc' + front end to implement most, or all, of the language features it + supports, without the front end having to make use of non-user-defined + variables. (It's almost certainly the case that all of K&R C, and + probably ANSI C as well, is handled by the `gcc' front end without + declaring such variables.) + + The FFE, on the other hand, must resort to a variety of "tricks" to + achieve its goals. + + Consider the following C code: + + int + foo (int a, int b) + { + int c = 0; + + if ((c = bar (c)) == 0) + goto done; + + quux (c << 1); + + done: + return c; + } + + Note what kinds of objects are declared, or defined, before their + use, and before any actual code generation involving them would + normally take place: + + * Return type of function + + * Entry point(s) of function + + * Dummy arguments + + * Variables + + * Initial values for variables + + Whereas, the following items can, and do, suddenly appear "out of + the blue" in C: + + * Label references + + * Function references + + Not surprisingly, the GBE faithfully permits the latter set of items + to be "discovered" partway through GBEL "programs", just as they are + permitted to in C. + + Yet, the GBE has tended, at least in the past, to be reticent to + fully support similar "late" discovery of items in the former set. + + This makes Fortran a poor fit for the "safe" subset of GBEL. + Consider: + + FUNCTION X (A, ARRAY, ID1) + CHARACTER*(*) A + DOUBLE PRECISION X, Y, Z, TMP, EE, PI + REAL ARRAY(ID1*ID2) + COMMON ID2 + EXTERNAL FRED + + ASSIGN 100 TO J + CALL FOO (I) + IF (I .EQ. 0) PRINT *, A(0) + GOTO 200 + + ENTRY Y (Z) + ASSIGN 101 TO J + 200 PRINT *, A(1) + READ *, TMP + GOTO J + 100 X = TMP * EE + RETURN + 101 Y = TMP * PI + CALL FRED + DATA EE, PI /2.71D0, 3.14D0/ + END + + Here are some observations about the above code, which, while + somewhat contrived, conforms to the FORTRAN 77 and Fortran 90 standards: + + * The return type of function `X' is not known until the `DOUBLE + PRECISION' line has been parsed. + + * Whether `A' is a function or a variable is not known until the + `PRINT *, A(0)' statement has been parsed. + + * The bounds of the array of argument `ARRAY' depend on a + computation involving the subsequent argument `ID1' and the + blank-common member `ID2'. + + * Whether `Y' and `Z' are local variables, additional function entry + points, or dummy arguments to additional entry points is not known + until the `ENTRY' statement is parsed. + + * Similarly, whether `TMP' is a local variable is not known until + the `READ *, TMP' statement is parsed. + + * The initial values for `EE' and `PI' are not known until after the + `DATA' statement is parsed. + + * Whether `FRED' is a function returning type `REAL' or a subroutine + (which can be thought of as returning type `void' _or_, to support + alternate returns in a simple way, type `int') is not known until + the `CALL FRED' statement is parsed. + + * Whether `100' is a `FORMAT' label or the label of an executable + statement is not known until the `X =' statement is parsed. + (These two types of labels get _very_ different treatment, + especially when `ASSIGN''ed.) + + * That `J' is a local variable is not known until the first `ASSIGN' + statement is parsed. (This happens _after_ executable code has + been seen.) + + Very few of these "discoveries" can be accommodated by the GBE as it + has evolved over the years. The GBEL doesn't support several of them, + and those it might appear to support don't always work properly, + especially in combination with other GBEL and GBE features, as + implemented in the GBE. + + (Had the GBE and its GBEL originally evolved to support `g77', the + shoe would be on the other foot, so to speak--most, if not all, of the + above would be directly supported by the GBEL, and a few C constructs + would probably not, as they are in reality, be supported. Both this + mythical, and today's real, GBE caters to its GBEL by, sometimes, + scrambling around, cleaning up after itself--after discovering that + assumptions it made earlier during code generation are incorrect. + That's not a great design, since it indicates significant code paths + that might be rarely tested but used in some key production + environments.) + + So, the FFE handles these discrepancies--between the order in which + it discovers facts about the code it is compiling, and the order in + which the GBEL and GBE support such discoveries--by performing what + amounts to two passes over each program unit. + + (A few ambiguities can remain at that point, such as whether, given + `EXTERNAL BAZ' and no other reference to `BAZ' in the program unit, it + is a subroutine, a function, or a block-data--which, in C-speak, + governs its declared return type. Fortunately, these distinctions are + easily finessed for the procedure, library, and object-file interfaces + supported by `g77'.) + +  + File: g77.info, Node: Challenges Posed, Next: Transforming Statements, Prev: Two-pass Design, Up: Front End + + Challenges Posed + ================ + + Consider the following Fortran code, which uses various extensions + (including some to Fortran 90): + + SUBROUTINE X(A) + CHARACTER*(*) A + COMPLEX CFUNC + INTEGER*2 CLOCKS(200) + INTEGER IFUNC + + CALL SYSTEM_CLOCK (CLOCKS (IFUNC (CFUNC ('('//A//')')))) + + The above poses the following challenges to any Fortran compiler + that uses run-time interfaces, and a run-time library, roughly similar + to those used by `g77': + + * Assuming the library routine that supports `SYSTEM_CLOCK' expects + to set an `INTEGER*4' variable via its `COUNT' argument, the + compiler must make available to it a temporary variable of that + type. + + * Further, after the `SYSTEM_CLOCK' library routine returns, the + compiler must ensure that the temporary variable it wrote is + copied into the appropriate element of the `CLOCKS' array. (This + assumes the compiler doesn't just reject the code, which it should + if it is compiling under some kind of a "strict" option.) + + * To determine the correct index into the `CLOCKS' array, (putting + aside the fact that the index, in this particular case, need not + be computed until after the `SYSTEM_CLOCK' library routine + returns), the compiler must ensure that the `IFUNC' function is + called. + + That requires evaluating its argument, which requires, for `g77' + (assuming `-ff2c' is in force), reserving a temporary variable of + type `COMPLEX' for use as a repository for the return value being + computed by `CFUNC'. + + * Before invoking `CFUNC', is argument must be evaluated, which + requires allocating, at run time, a temporary large enough to hold + the result of the concatenation, as well as actually performing + the concatenation. + + * The large temporary needed during invocation of `CFUNC' should, + ideally, be deallocated (or, at least, left to the GBE to dispose + of, as it sees fit) as soon as `CFUNC' returns, which means before + `IFUNC' is called (as it might need a lot of dynamically allocated + memory). + + `g77' currently doesn't support all of the above, but, so that it + might someday, it has evolved to handle at least some of the above + requirements. + + Meeting the above requirements is made more challenging by + conforming to the requirements of the GBEL/GBE combination. + +  + File: g77.info, Node: Transforming Statements, Next: Transforming Expressions, Prev: Challenges Posed, Up: Front End + + Transforming Statements + ======================= + + Most Fortran statements are given their own block, and, for + temporary variables they might need, their own scope. (A block is what + distinguishes `{ foo (); }' from just `foo ();' in C. A scope is + included with every such block, providing a distinct name space for + local variables.) + + Label definitions for the statement precede this block, so `10 PRINT + *, I' is handled more like `fl10: { ... }' than `{ fl10: ... }' (where + `fl10' is just a notation meaning "Fortran Label 10" for the purposes + of this document). + + * Menu: + + * Statements Needing Temporaries:: + * Transforming DO WHILE:: + * Transforming Iterative DO:: + * Transforming Block IF:: + * Transforming SELECT CASE:: + +  + File: g77.info, Node: Statements Needing Temporaries, Next: Transforming DO WHILE, Up: Transforming Statements + + Statements Needing Temporaries + ------------------------------ + + Any temporaries needed during, but not beyond, execution of a + Fortran statement, are made local to the scope of that statement's + block. + + This allows the GBE to share storage for these temporaries among the + various statements without the FFE having to manage that itself. + + (The GBE could, of course, decide to optimize management of these + temporaries. For example, it could, theoretically, schedule some of + the computations involving these temporaries to occur in parallel. + More practically, it might leave the storage for some temporaries + "live" beyond their scopes, to reduce the number of manipulations of + the stack pointer at run time.) + + Temporaries needed across distinct statement boundaries usually are + associated with Fortran blocks (such as `DO'/`END DO'). (Also, there + might be temporaries not associated with blocks at all--these would be + in the scope of the entire program unit.) + + Each Fortran block _should_ get its own block/scope in the GBE. + This is best, because it allows temporaries to be more naturally + handled. However, it might pose problems when handling labels (in + particular, when they're the targets of `GOTO's outside the Fortran + block), and generally just hassling with replicating parts of the `gcc' + front end (because the FFE needs to support an arbitrary number of + nested back-end blocks if each Fortran block gets one). + + So, there might still be a need for top-level temporaries, whose + "owning" scope is that of the containing procedure. + + Also, there seems to be problems declaring new variables after + generating code (within a block) in the back end, leading to, e.g., + `label not defined before binding contour' or similar messages, when + compiling with `-fstack-check' or when compiling for certain targets. + + Because of that, and because sometimes these temporaries are not + discovered until in the middle of of generating code for an expression + statement (as in the case of the optimization for `X**I'), it seems + best to always pre-scan all the expressions that'll be expanded for a + block before generating any of the code for that block. + + This pre-scan then handles discovering and declaring, to the back + end, the temporaries needed for that block. + + It's also important to treat distinct items in an I/O list as + distinct statements deserving their own blocks. That's because there's + a requirement that each I/O item be fully processed before the next one, + which matters in cases like `READ (*,*), I, A(I)'--the element of `A' + read in the second item _must_ be determined from the value of `I' read + in the first item. + +  + File: g77.info, Node: Transforming DO WHILE, Next: Transforming Iterative DO, Prev: Statements Needing Temporaries, Up: Transforming Statements + + Transforming DO WHILE + --------------------- + + `DO WHILE(expr)' _must_ be implemented so that temporaries needed to + evaluate `expr' are generated just for the test, each time. + + Consider how `DO WHILE (A//B .NE. 'END'); ...; END DO' is + transformed: + + for (;;) + { + int temp0; + + { + char temp1[large]; + + libg77_catenate (temp1, a, b); + temp0 = libg77_ne (temp1, 'END'); + } + + if (! temp0) + break; + + ... + } + + In this case, it seems like a time/space tradeoff between allocating + and deallocating `temp1' for each iteration and allocating it just once + for the entire loop. + + However, if `temp1' is allocated just once for the entire loop, it + could be the wrong size for subsequent iterations of that loop in cases + like `DO WHILE (A(I:J)//B .NE. 'END')', because the body of the loop + might modify `I' or `J'. + + So, the above implementation is used, though a more optimal one can + be used in specific circumstances. + +  + File: g77.info, Node: Transforming Iterative DO, Next: Transforming Block IF, Prev: Transforming DO WHILE, Up: Transforming Statements + + Transforming Iterative DO + ------------------------- + + An iterative `DO' loop (one that specifies an iteration variable) is + required by the Fortran standards to be implemented as though an + iteration count is computed before entering the loop body, and that + iteration count used to determine the number of times the loop body is + to be performed (assuming the loop isn't cut short via `GOTO' or + `EXIT'). + + The FFE handles this by allocating a temporary variable to contain + the computed number of iterations. Since this variable must be in a + scope that includes the entire loop, a GBEL block is created for that + loop, and the variable declared as belonging to the scope of that block. + +  + File: g77.info, Node: Transforming Block IF, Next: Transforming SELECT CASE, Prev: Transforming Iterative DO, Up: Transforming Statements + + Transforming Block IF + --------------------- + + Consider: + + SUBROUTINE X(A,B,C) + CHARACTER*(*) A, B, C + LOGICAL LFUNC + + IF (LFUNC (A//B)) THEN + CALL SUBR1 + ELSE IF (LFUNC (A//C)) THEN + CALL SUBR2 + ELSE + CALL SUBR3 + END + + The arguments to the two calls to `LFUNC' require dynamic allocation + (at run time), but are not required during execution of the `CALL' + statements. + + So, the scopes of those temporaries must be within blocks inside the + block corresponding to the Fortran `IF' block. + + This cannot be represented "naturally" in vanilla C, nor in GBEL. + The `if', `elseif', `else', and `endif' constructs provided by both + languages must, for a given `if' block, share the same C/GBE block. + + Therefore, any temporaries needed during evaluation of `expr' while + executing `ELSE IF(expr)' must either have been predeclared at the top + of the corresponding `IF' block, or declared within a new block for + that `ELSE IF'--a block that, since it cannot contain the `else' or + `else if' itself (due to the above requirement), actually implements + the rest of the `IF' block's `ELSE IF' and `ELSE' statements within an + inner block. + + The FFE takes the latter approach. + +  + File: g77.info, Node: Transforming SELECT CASE, Prev: Transforming Block IF, Up: Transforming Statements + + Transforming SELECT CASE + ------------------------ + + `SELECT CASE' poses a few interesting problems for code generation, + if efficiency and frugal stack management are important. + + Consider `SELECT CASE (I('PREFIX'//A))', where `A' is + `CHARACTER*(*)'. In a case like this--basically, in any case where + largish temporaries are needed to evaluate the expression--those + temporaries should not be "live" during execution of any of the `CASE' + blocks. + + So, evaluation of the expression is best done within its own block, + which in turn is within the `SELECT CASE' block itself (which contains + the code for the CASE blocks as well, though each within their own + block). + + Otherwise, we'd have the rough equivalent of this pseudo-code: + + { + char temp[large]; + + libg77_catenate (temp, 'prefix', a); + + switch (i (temp)) + { + case 0: + ... + } + } + + And that would leave temp[large] in scope during the CASE blocks + (although a clever back end *could* see that it isn't referenced in + them, and thus free that temp before executing the blocks). + + So this approach is used instead: + + { + int temp0; + + { + char temp1[large]; + + libg77_catenate (temp1, 'prefix', a); + temp0 = i (temp1); + } + + switch (temp0) + { + case 0: + ... + } + } + + Note how `temp1' goes out of scope before starting the switch, thus + making it easy for a back end to free it. + + The problem _that_ solution has, however, is with `SELECT + CASE('prefix'//A)' (which is currently not supported). + + Unless the GBEL is extended to support arbitrarily long character + strings in its `case' facility, the FFE has to implement `SELECT CASE' + on `CHARACTER' (probably excepting `CHARACTER*1') using a cascade of + `if', `elseif', `else', and `endif' constructs in GBEL. + + To prevent the (potentially large) temporary, needed to hold the + selected expression itself (`'prefix'//A'), from being in scope during + execution of the `CASE' blocks, two approaches are available: + + * Pre-evaluate all the `CASE' tests, producing an integer ordinal + that is used, a la `temp0' in the earlier example, as if `SELECT + CASE(temp0)' had been written. + + Each corresponding `CASE' is replaced with `CASE(I)', where I is + the ordinal for that case, determined while, or before, generating + the cascade of `if'-related constructs to cope with `CHARACTER' + selection. + + * Make `temp0' above just large enough to hold the longest `CASE' + string that'll actually be compared against the expression (in + this case, `'prefix'//A'). + + Since that length must be constant (because `CASE' expressions are + all constant), it won't be so large, and, further, `temp1' need + not be dynamically allocated, since normal `CHARACTER' assignment + can be used into the fixed-length `temp0'. + + Both of these solutions require `SELECT CASE' implementation to be + changed so all the corresponding `CASE' statements are seen during the + actual code generation for `SELECT CASE'. + +  + File: g77.info, Node: Transforming Expressions, Next: Internal Naming Conventions, Prev: Transforming Statements, Up: Front End + + Transforming Expressions + ======================== + + The interactions between statements, expressions, and subexpressions + at program run time can be viewed as: + + ACTION(EXPR) + + Here, ACTION is the series of steps performed to effect the + statement, and EXPR is the expression whose value is used by ACTION. + + Expanding the above shows a typical order of events at run time: + + Evaluate EXPR + Perform ACTION, using result of evaluation of EXPR + Clean up after evaluating EXPR + + So, if evaluating EXPR requires allocating memory, that memory can + be freed before performing ACTION only if it is not needed to hold the + result of evaluating EXPR. Otherwise, it must be freed no sooner than + after ACTION has been performed. + + The above are recursive definitions, in the sense that they apply to + subexpressions of EXPR. + + That is, evaluating EXPR involves evaluating all of its + subexpressions, performing the ACTION that computes the result value of + EXPR, then cleaning up after evaluating those subexpressions. + + The recursive nature of this evaluation is implemented via + recursive-descent transformation of the top-level statements, their + expressions, _their_ subexpressions, and so on. + + However, that recursive-descent transformation is, due to the nature + of the GBEL, focused primarily on generating a _single_ stream of code + to be executed at run time. + + Yet, from the above, it's clear that multiple streams of code must + effectively be simultaneously generated during the recursive-descent + analysis of statements. + + The primary stream implements the primary ACTION items, while at + least two other streams implement the evaluation and clean-up items. + + Requirements imposed by expressions include: + + * Whether the caller needs to have a temporary ready to hold the + value of the expression. + + * Other stuff??? + +  + File: g77.info, Node: Internal Naming Conventions, Prev: Transforming Expressions, Up: Front End + + Internal Naming Conventions + =========================== + + Names exported by FFE modules have the following + (regular-expression) forms. Note that all names beginning `ffeMOD' or + `FFEMOD', where MOD is lowercase or uppercase alphanumerics, + respectively, are exported by the module `ffeMOD', with the source code + doing the exporting in `MOD.h'. (Usually, the source code for the + implementation is in `MOD.c'.) + + Identifiers that don't fit the following forms are not considered + exported, even if they are according to the C language. (For example, + they might be made available to other modules solely for use within + expansions of exported macros, not for use within any source code in + those other modules.) + + `ffeMOD' + The single typedef exported by the module. + + `FFEUMOD_[A-Z][A-Z0-9_]*' + (Where UMOD is the uppercase for of MOD.) + + A `#define' or `enum' constant of the type `ffeMOD'. + + `ffeMOD[A-Z][A-Z][a-z0-9]*' + A typedef exported by the module. + + The portion of the identifier after `ffeMOD' is referred to as + `ctype', a capitalized (mixed-case) form of `type'. + + `FFEUMOD_TYPE[A-Z][A-Z0-9_]*[A-Z0-9]?' + (Where UMOD is the uppercase for of MOD.) + + A `#define' or `enum' constant of the type `ffeMODTYPE', where + TYPE is the lowercase form of CTYPE in an exported typedef. + + `ffeMOD_VALUE' + A function that does or returns something, as described by VALUE + (see below). + + `ffeMOD_VALUE_INPUT' + A function that does or returns something based primarily on the + thing described by INPUT (see below). + + Below are names used for VALUE and INPUT, along with their + definitions. + + `col' + A column number within a line (first column is number 1). + + `file' + An encapsulation of a file's name. + + `find' + Looks up an instance of some type that matches specified criteria, + and returns that, even if it has to create a new instance or crash + trying to find it (as appropriate). + + `initialize' + Initializes, usually a module. No type. + + `int' + A generic integer of type `int'. + + `is' + A generic integer that contains a true (non-zero) or false (zero) + value. + + `len' + A generic integer that contains the length of something. + + `line' + A line number within a source file, or a global line number. + + `lookup' + Looks up an instance of some type that matches specified criteria, + and returns that, or returns nil. + + `name' + A `text' that points to a name of something. + + `new' + Makes a new instance of the indicated type. Might return an + existing one if appropriate--if so, similar to `find' without + crashing. + + `pt' + Pointer to a particular character (line, column pairs) in the + input file (source code being compiled). + + `run' + Performs some herculean task. No type. + + `terminate' + Terminates, usually a module. No type. + + `text' + A `char *' that points to generic text. + +  + File: g77.info, Node: Diagnostics, Next: Index, Prev: Front End, Up: Top + + Diagnostics + *********** + + Some diagnostics produced by `g77' require sufficient explanation + that the explanations are given below, and the diagnostics themselves + identify the appropriate explanation. + + Identification uses the GNU Info format--specifically, the `info' + command that displays the explanation is given within square brackets + in the diagnostic. For example: + + foo.f:5: Invalid statement [info -f g77 M FOOEY] + + More details about the above diagnostic is found in the `g77' Info + documentation, menu item `M', submenu item `FOOEY', which is displayed + by typing the UNIX command `info -f g77 M FOOEY'. + + Other Info readers, such as EMACS, may be just as easily used to + display the pertinent node. In the above example, `g77' is the Info + document name, `M' is the top-level menu item to select, and, in that + node (named `Diagnostics', the name of this chapter, which is the very + text you're reading now), `FOOEY' is the menu item to select. + + * Menu: + + * CMPAMBIG:: Ambiguous use of intrinsic. + * EXPIMP:: Intrinsic used explicitly and implicitly. + * INTGLOB:: Intrinsic also used as name of global. + * LEX:: Various lexer messages + * GLOBALS:: Disagreements about globals. + * LINKFAIL:: When linking `f771' fails. + * Y2KBAD:: Use of non-Y2K-compliant intrinsic. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-2 gcc-3.2.3/gcc/f/g77.info-2 *** gcc-3.2.2/gcc/f/g77.info-2 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-2 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,1234 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Getting Started, Next: What is GNU Fortran?, Prev: Funding GNU Fortran, Up: Top + + Getting Started + *************** + + If you don't need help getting started reading the portions of this + manual that are most important to you, you should skip this portion of + the manual. + + If you are new to compilers, especially Fortran compilers, or new to + how compilers are structured under UNIX and UNIX-like systems, you'll + want to see *Note What is GNU Fortran?::. + + If you are new to GNU compilers, or have used only one GNU compiler + in the past and not had to delve into how it lets you manage various + versions and configurations of `gcc', you should see *Note G77 and + GCC::. + + Everyone except experienced `g77' users should see *Note Invoking + G77::. + + If you're acquainted with previous versions of `g77', you should see + *Note News About GNU Fortran: News. Further, if you've actually used + previous versions of `g77', especially if you've written or modified + Fortran code to be compiled by previous versions of `g77', you should + see *Note Changes::. + + If you intend to write or otherwise compile code that is not already + strictly conforming ANSI FORTRAN 77--and this is probably everyone--you + should see *Note Language::. + + If you run into trouble getting Fortran code to compile, link, run, + or work properly, you might find answers if you see *Note Debugging and + Interfacing::, see *Note Collected Fortran Wisdom::, and see *Note + Trouble::. You might also find that the problems you are encountering + are bugs in `g77'--see *Note Bugs::, for information on reporting them, + after reading the other material. + + If you need further help with `g77', or with freely redistributable + software in general, see *Note Service::. + + If you would like to help the `g77' project, see *Note Funding GNU + Fortran::, for information on helping financially, and see *Note + Projects::, for information on helping in other ways. + + If you're generally curious about the future of `g77', see *Note + Projects::. If you're curious about its past, see *Note Contributors::, + and see *Note Funding GNU Fortran::. + + To see a few of the questions maintainers of `g77' have, and that + you might be able to answer, see *Note Open Questions::. + +  + File: g77.info, Node: What is GNU Fortran?, Next: G77 and GCC, Prev: Getting Started, Up: Top + + What is GNU Fortran? + ******************** + + GNU Fortran, or `g77', is designed initially as a free replacement + for, or alternative to, the UNIX `f77' command. (Similarly, `gcc' is + designed as a replacement for the UNIX `cc' command.) + + `g77' also is designed to fit in well with the other fine GNU + compilers and tools. + + Sometimes these design goals conflict--in such cases, resolution + often is made in favor of fitting in well with Project GNU. These + cases are usually identified in the appropriate sections of this manual. + + As compilers, `g77', `gcc', and `f77' share the following + characteristics: + + * They read a user's program, stored in a file and containing + instructions written in the appropriate language (Fortran, C, and + so on). This file contains "source code". + + * They translate the user's program into instructions a computer can + carry out more quickly than it takes to translate the instructions + in the first place. These instructions are called "machine + code"--code designed to be efficiently translated and processed by + a machine such as a computer. Humans usually aren't as good + writing machine code as they are at writing Fortran or C, because + it is easy to make tiny mistakes writing machine code. When + writing Fortran or C, it is easy to make big mistakes. + + * They provide information in the generated machine code that can + make it easier to find bugs in the program (using a debugging + tool, called a "debugger", such as `gdb'). + + * They locate and gather machine code already generated to perform + actions requested by statements in the user's program. This + machine code is organized into "libraries" and is located and + gathered during the "link" phase of the compilation process. + (Linking often is thought of as a separate step, because it can be + directly invoked via the `ld' command. However, the `g77' and + `gcc' commands, as with most compiler commands, automatically + perform the linking step by calling on `ld' directly, unless asked + to not do so by the user.) + + * They attempt to diagnose cases where the user's program contains + incorrect usages of the language. The "diagnostics" produced by + the compiler indicate the problem and the location in the user's + source file where the problem was first noticed. The user can use + this information to locate and fix the problem. (Sometimes an + incorrect usage of the language leads to a situation where the + compiler can no longer make any sense of what follows--while a + human might be able to--and thus ends up complaining about many + "problems" it encounters that, in fact, stem from just one + problem, usually the first one reported.) + + * They attempt to diagnose cases where the user's program contains a + correct usage of the language, but instructs the computer to do + something questionable. These diagnostics often are in the form + of "warnings", instead of the "errors" that indicate incorrect + usage of the language. + + How these actions are performed is generally under the control of + the user. Using command-line options, the user can specify how + persnickety the compiler is to be regarding the program (whether to + diagnose questionable usage of the language), how much time to spend + making the generated machine code run faster, and so on. + + `g77' consists of several components: + + * A modified version of the `gcc' command, which also might be + installed as the system's `cc' command. (In many cases, `cc' + refers to the system's "native" C compiler, which might be a + non-GNU compiler, or an older version of `gcc' considered more + stable or that is used to build the operating system kernel.) + + * The `g77' command itself, which also might be installed as the + system's `f77' command. + + * The `libg2c' run-time library. This library contains the machine + code needed to support capabilities of the Fortran language that + are not directly provided by the machine code generated by the + `g77' compilation phase. + + `libg2c' is just the unique name `g77' gives to its version of + `libf2c' to distinguish it from any copy of `libf2c' installed + from `f2c' (or versions of `g77' that built `libf2c' under that + same name) on the system. + + The maintainer of `libf2c' currently is . + + * The compiler itself, internally named `f771'. + + Note that `f771' does not generate machine code directly--it + generates "assembly code" that is a more readable form of machine + code, leaving the conversion to actual machine code to an + "assembler", usually named `as'. + + `gcc' is often thought of as "the C compiler" only, but it does more + than that. Based on command-line options and the names given for files + on the command line, `gcc' determines which actions to perform, + including preprocessing, compiling (in a variety of possible + languages), assembling, and linking. + + For example, the command `gcc foo.c' "drives" the file `foo.c' + through the preprocessor `cpp', then the C compiler (internally named + `cc1'), then the assembler (usually `as'), then the linker (`ld'), + producing an executable program named `a.out' (on UNIX systems). + + As another example, the command `gcc foo.cc' would do much the same + as `gcc foo.c', but instead of using the C compiler named `cc1', `gcc' + would use the C++ compiler (named `cc1plus'). + + In a GNU Fortran installation, `gcc' recognizes Fortran source files + by name just like it does C and C++ source files. It knows to use the + Fortran compiler named `f771', instead of `cc1' or `cc1plus', to + compile Fortran files. + + Non-Fortran-related operation of `gcc' is generally unaffected by + installing the GNU Fortran version of `gcc'. However, without the + installed version of `gcc' being the GNU Fortran version, `gcc' will + not be able to compile and link Fortran programs--and since `g77' uses + `gcc' to do most of the actual work, neither will `g77'! + + The `g77' command is essentially just a front-end for the `gcc' + command. Fortran users will normally use `g77' instead of `gcc', + because `g77' knows how to specify the libraries needed to link with + Fortran programs (`libg2c' and `lm'). `g77' can still compile and link + programs and source files written in other languages, just like `gcc'. + + The command `g77 -v' is a quick way to display lots of version + information for the various programs used to compile a typical + preprocessed Fortran source file--this produces much more output than + `gcc -v' currently does. (If it produces an error message near the end + of the output--diagnostics from the linker, usually `ld'--you might + have an out-of-date `libf2c' that improperly handles complex + arithmetic.) In the output of this command, the line beginning `GNU + Fortran Front End' identifies the version number of GNU Fortran; + immediately preceding that line is a line identifying the version of + `gcc' with which that version of `g77' was built. + + The `libf2c' library is distributed with GNU Fortran for the + convenience of its users, but is not part of GNU Fortran. It contains + the procedures needed by Fortran programs while they are running. + + For example, while code generated by `g77' is likely to do + additions, subtractions, and multiplications "in line"--in the actual + compiled code--it is not likely to do trigonometric functions this way. + + Instead, operations like trigonometric functions are compiled by the + `f771' compiler (invoked by `g77' when compiling Fortran code) into + machine code that, when run, calls on functions in `libg2c', so + `libg2c' must be linked with almost every useful program having any + component compiled by GNU Fortran. (As mentioned above, the `g77' + command takes care of all this for you.) + + The `f771' program represents most of what is unique to GNU Fortran. + While much of the `libg2c' component comes from the `libf2c' component + of `f2c', a free Fortran-to-C converter distributed by Bellcore (AT&T), + plus `libU77', provided by Dave Love, and the `g77' command is just a + small front-end to `gcc', `f771' is a combination of two rather large + chunks of code. + + One chunk is the so-called "GNU Back End", or GBE, which knows how + to generate fast code for a wide variety of processors. The same GBE + is used by the C, C++, and Fortran compiler programs `cc1', `cc1plus', + and `f771', plus others. Often the GBE is referred to as the "gcc back + end" or even just "gcc"--in this manual, the term GBE is used whenever + the distinction is important. + + The other chunk of `f771' is the majority of what is unique about + GNU Fortran--the code that knows how to interpret Fortran programs to + determine what they are intending to do, and then communicate that + knowledge to the GBE for actual compilation of those programs. This + chunk is called the "Fortran Front End" (FFE). The `cc1' and `cc1plus' + programs have their own front ends, for the C and C++ languages, + respectively. These fronts ends are responsible for diagnosing + incorrect usage of their respective languages by the programs the + process, and are responsible for most of the warnings about + questionable constructs as well. (The GBE handles producing some + warnings, like those concerning possible references to undefined + variables.) + + Because so much is shared among the compilers for various languages, + much of the behavior and many of the user-selectable options for these + compilers are similar. For example, diagnostics (error messages and + warnings) are similar in appearance; command-line options like `-Wall' + have generally similar effects; and the quality of generated code (in + terms of speed and size) is roughly similar (since that work is done by + the shared GBE). + +  + File: g77.info, Node: G77 and GCC, Next: Invoking G77, Prev: What is GNU Fortran?, Up: Top + + Compile Fortran, C, or Other Programs + ************************************* + + A GNU Fortran installation includes a modified version of the `gcc' + command. + + In a non-Fortran installation, `gcc' recognizes C, C++, and + Objective-C source files. + + In a GNU Fortran installation, `gcc' also recognizes Fortran source + files and accepts Fortran-specific command-line options, plus some + command-line options that are designed to cater to Fortran users but + apply to other languages as well. + + *Note Compile C; C++; Objective-C; Ada; Fortran; or Java: (gcc)G++ + and GCC, for information on the way different languages are handled by + the GNU CC compiler (`gcc'). + + Also provided as part of GNU Fortran is the `g77' command. The + `g77' command is designed to make compiling and linking Fortran + programs somewhat easier than when using the `gcc' command for these + tasks. It does this by analyzing the command line somewhat and + changing it appropriately before submitting it to the `gcc' command. + + Use the `-v' option with `g77' to see what is going on--the first + line of output is the invocation of the `gcc' command. + +  + File: g77.info, Node: Invoking G77, Next: News, Prev: G77 and GCC, Up: Top + + GNU Fortran Command Options + *************************** + + The `g77' command supports all the options supported by the `gcc' + command. *Note GCC Command Options: (gcc)Invoking GCC, for information + on the non-Fortran-specific aspects of the `gcc' command (and, + therefore, the `g77' command). + + All `gcc' and `g77' options are accepted both by `g77' and by `gcc' + (as well as any other drivers built at the same time, such as `g++'), + since adding `g77' to the `gcc' distribution enables acceptance of + `g77' options by all of the relevant drivers. + + In some cases, options have positive and negative forms; the + negative form of `-ffoo' would be `-fno-foo'. This manual documents + only one of these two forms, whichever one is not the default. + + * Menu: + + * Option Summary:: Brief list of all `g77' options, + without explanations. + * Overall Options:: Controlling the kind of output: + an executable, object files, assembler files, + or preprocessed source. + * Shorthand Options:: Options that are shorthand for other options. + * Fortran Dialect Options:: Controlling the variant of Fortran language + compiled. + * Warning Options:: How picky should the compiler be? + * Debugging Options:: Symbol tables, measurements, and debugging dumps. + * Optimize Options:: How much optimization? + * Preprocessor Options:: Controlling header files and macro definitions. + Also, getting dependency information for Make. + * Directory Options:: Where to find header files and libraries. + Where to find the compiler executable files. + * Code Gen Options:: Specifying conventions for function calls, data layout + and register usage. + * Environment Variables:: Env vars that affect GNU Fortran. + +  + File: g77.info, Node: Option Summary, Next: Overall Options, Up: Invoking G77 + + Option Summary + ============== + + Here is a summary of all the options specific to GNU Fortran, grouped + by type. Explanations are in the following sections. + + _Overall Options_ + *Note Options Controlling the Kind of Output: Overall Options. + -fversion -fset-g77-defaults -fno-silent + + _Shorthand Options_ + *Note Shorthand Options::. + -ff66 -fno-f66 -ff77 -fno-f77 -fno-ugly + + _Fortran Language Options_ + *Note Options Controlling Fortran Dialect: Fortran Dialect Options. + -ffree-form -fno-fixed-form -ff90 + -fvxt -fdollar-ok -fno-backslash + -fno-ugly-args -fno-ugly-assign -fno-ugly-assumed + -fugly-comma -fugly-complex -fugly-init -fugly-logint + -fonetrip -ftypeless-boz + -fintrin-case-initcap -fintrin-case-upper + -fintrin-case-lower -fintrin-case-any + -fmatch-case-initcap -fmatch-case-upper + -fmatch-case-lower -fmatch-case-any + -fsource-case-upper -fsource-case-lower + -fsource-case-preserve + -fsymbol-case-initcap -fsymbol-case-upper + -fsymbol-case-lower -fsymbol-case-any + -fcase-strict-upper -fcase-strict-lower + -fcase-initcap -fcase-upper -fcase-lower -fcase-preserve + -ff2c-intrinsics-delete -ff2c-intrinsics-hide + -ff2c-intrinsics-disable -ff2c-intrinsics-enable + -fbadu77-intrinsics-delete -fbadu77-intrinsics-hide + -fbadu77-intrinsics-disable -fbadu77-intrinsics-enable + -ff90-intrinsics-delete -ff90-intrinsics-hide + -ff90-intrinsics-disable -ff90-intrinsics-enable + -fgnu-intrinsics-delete -fgnu-intrinsics-hide + -fgnu-intrinsics-disable -fgnu-intrinsics-enable + -fmil-intrinsics-delete -fmil-intrinsics-hide + -fmil-intrinsics-disable -fmil-intrinsics-enable + -funix-intrinsics-delete -funix-intrinsics-hide + -funix-intrinsics-disable -funix-intrinsics-enable + -fvxt-intrinsics-delete -fvxt-intrinsics-hide + -fvxt-intrinsics-disable -fvxt-intrinsics-enable + -ffixed-line-length-N -ffixed-line-length-none + + _Warning Options_ + *Note Options to Request or Suppress Warnings: Warning Options. + -fsyntax-only -pedantic -pedantic-errors -fpedantic + -w -Wno-globals -Wimplicit -Wunused -Wuninitialized + -Wall -Wsurprising + -Werror -W + + _Debugging Options_ + *Note Options for Debugging Your Program or GCC: Debugging Options. + -g + + _Optimization Options_ + *Note Options that Control Optimization: Optimize Options. + -malign-double + -ffloat-store -fforce-mem -fforce-addr -fno-inline + -ffast-math -fstrength-reduce -frerun-cse-after-loop + -funsafe-math-optimizations -fno-trapping-math + -fexpensive-optimizations -fdelayed-branch + -fschedule-insns -fschedule-insn2 -fcaller-saves + -funroll-loops -funroll-all-loops + -fno-move-all-movables -fno-reduce-all-givs + -fno-rerun-loop-opt + + _Directory Options_ + *Note Options for Directory Search: Directory Options. + -IDIR -I- + + _Code Generation Options_ + *Note Options for Code Generation Conventions: Code Gen Options. + -fno-automatic -finit-local-zero -fno-f2c + -ff2c-library -fno-underscoring -fno-ident + -fpcc-struct-return -freg-struct-return + -fshort-double -fno-common -fpack-struct + -fzeros -fno-second-underscore + -femulate-complex + -falias-check -fargument-alias + -fargument-noalias -fno-argument-noalias-global + -fno-globals -fflatten-arrays + -fbounds-check -ffortran-bounds-check + + + * Menu: + + * Overall Options:: Controlling the kind of output: + an executable, object files, assembler files, + or preprocessed source. + * Shorthand Options:: Options that are shorthand for other options. + * Fortran Dialect Options:: Controlling the variant of Fortran language + compiled. + * Warning Options:: How picky should the compiler be? + * Debugging Options:: Symbol tables, measurements, and debugging dumps. + * Optimize Options:: How much optimization? + * Preprocessor Options:: Controlling header files and macro definitions. + Also, getting dependency information for Make. + * Directory Options:: Where to find header files and libraries. + Where to find the compiler executable files. + * Code Gen Options:: Specifying conventions for function calls, data layout + and register usage. + +  + File: g77.info, Node: Overall Options, Next: Shorthand Options, Prev: Option Summary, Up: Invoking G77 + + Options Controlling the Kind of Output + ====================================== + + Compilation can involve as many as four stages: preprocessing, code + generation (often what is really meant by the term "compilation"), + assembly, and linking, always in that order. The first three stages + apply to an individual source file, and end by producing an object + file; linking combines all the object files (those newly compiled, and + those specified as input) into an executable file. + + For any given input file, the file name suffix determines what kind + of program is contained in the file--that is, the language in which the + program is written is generally indicated by the suffix. Suffixes + specific to GNU Fortran are listed below. *Note Options Controlling + the Kind of Output: (gcc)Overall Options, for information on suffixes + recognized by GNU CC. + + `FILE.f' + + `FILE.for' + + `FILE.FOR' + Fortran source code that should not be preprocessed. + + Such source code cannot contain any preprocessor directives, such + as `#include', `#define', `#if', and so on. + + You can force `.f' files to be preprocessed by `cpp' by using `-x + f77-cpp-input'. *Note LEX::. + + `FILE.F' + + `FILE.fpp' + + `FILE.FPP' + Fortran source code that must be preprocessed (by the C + preprocessor `cpp', which is part of GNU CC). + + Note that preprocessing is not extended to the contents of files + included by the `INCLUDE' directive--the `#include' preprocessor + directive must be used instead. + + `FILE.r' + Ratfor source code, which must be preprocessed by the `ratfor' + command, which is available separately (as it is not yet part of + the GNU Fortran distribution). One version in Fortran, adapted + for use with `g77' is at `ftp://members.aol.com/n8tm/rat7.uue' (of + uncertain copyright status). Another, public domain version in C + is at `http://sepwww.stanford.edu/sep/prof/ratfor.shar.2'. + + UNIX users typically use the `FILE.f' and `FILE.F' nomenclature. + Users of other operating systems, especially those that cannot + distinguish upper-case letters from lower-case letters in their file + names, typically use the `FILE.for' and `FILE.fpp' nomenclature. + + Use of the preprocessor `cpp' allows use of C-like constructs such + as `#define' and `#include', but can lead to unexpected, even mistaken, + results due to Fortran's source file format. It is recommended that + use of the C preprocessor be limited to `#include' and, in conjunction + with `#define', only `#if' and related directives, thus avoiding + in-line macro expansion entirely. This recommendation applies + especially when using the traditional fixed source form. With free + source form, fewer unexpected transformations are likely to happen, but + use of constructs such as Hollerith and character constants can + nevertheless present problems, especially when these are continued + across multiple source lines. These problems result, primarily, from + differences between the way such constants are interpreted by the C + preprocessor and by a Fortran compiler. + + Another example of a problem that results from using the C + preprocessor is that a Fortran comment line that happens to contain any + characters "interesting" to the C preprocessor, such as a backslash at + the end of the line, is not recognized by the preprocessor as a comment + line, so instead of being passed through "raw", the line is edited + according to the rules for the preprocessor. For example, the + backslash at the end of the line is removed, along with the subsequent + newline, resulting in the next line being effectively commented + out--unfortunate if that line is a non-comment line of important code! + + _Note:_ The `-traditional' and `-undef' flags are supplied to `cpp' + by default, to help avoid unpleasant surprises. *Note Options + Controlling the Preprocessor: (gcc)Preprocessor Options. This means + that ANSI C preprocessor features (such as the `#' operator) aren't + available, and only variables in the C reserved namespace (generally, + names with a leading underscore) are liable to substitution by C + predefines. Thus, if you want to do system-specific tests, use, for + example, `#ifdef __linux__' rather than `#ifdef linux'. Use the `-v' + option to see exactly how the preprocessor is invoked. + + Unfortunately, the `-traditional' flag will not avoid an error from + anything that `cpp' sees as an unterminated C comment, such as: + C Some Fortran compilers accept /* as starting + C an inline comment. + *Note Trailing Comment::. + + The following options that affect overall processing are recognized + by the `g77' and `gcc' commands in a GNU Fortran installation: + + `-fversion' + Ensure that the `g77' version of the compiler phase is reported, + if run, and, starting in `egcs' version 1.1, that internal + consistency checks in the `f771' program are run. + + This option is supplied automatically when `-v' or `--verbose' is + specified as a command-line option for `g77' or `gcc' and when the + resulting commands compile Fortran source files. + + In GCC 3.1, this is changed back to the behaviour `gcc' displays + for `.c' files. + + `-fset-g77-defaults' + _Version info:_ This option was obsolete as of `egcs' version 1.1. + The effect is instead achieved by the `lang_init_options' routine + in `gcc/gcc/f/com.c'. + + Set up whatever `gcc' options are to apply to Fortran + compilations, and avoid running internal consistency checks that + might take some time. + + This option is supplied automatically when compiling Fortran code + via the `g77' or `gcc' command. The description of this option is + provided so that users seeing it in the output of, say, `g77 -v' + understand why it is there. + + Also, developers who run `f771' directly might want to specify it + by hand to get the same defaults as they would running `f771' via + `g77' or `gcc' However, such developers should, after linking a + new `f771' executable, invoke it without this option once, e.g. + via `./f771 -quiet < /dev/null', to ensure that they have not + introduced any internal inconsistencies (such as in the table of + intrinsics) before proceeding--`g77' will crash with a diagnostic + if it detects an inconsistency. + + `-fno-silent' + Print (to `stderr') the names of the program units as they are + compiled, in a form similar to that used by popular UNIX `f77' + implementations and `f2c' + + *Note Options Controlling the Kind of Output: (gcc)Overall Options, + for information on more options that control the overall operation of + the `gcc' command (and, by extension, the `g77' command). + +  + File: g77.info, Node: Shorthand Options, Next: Fortran Dialect Options, Prev: Overall Options, Up: Invoking G77 + + Shorthand Options + ================= + + The following options serve as "shorthand" for other options + accepted by the compiler: + + `-fugly' + _Note:_ This option is no longer supported. The information, + below, is provided to aid in the conversion of old scripts. + + Specify that certain "ugly" constructs are to be quietly accepted. + Same as: + + -fugly-args -fugly-assign -fugly-assumed + -fugly-comma -fugly-complex -fugly-init + -fugly-logint + + These constructs are considered inappropriate to use in new or + well-maintained portable Fortran code, but widely used in old code. + *Note Distensions::, for more information. + + `-fno-ugly' + Specify that all "ugly" constructs are to be noisily rejected. + Same as: + + -fno-ugly-args -fno-ugly-assign -fno-ugly-assumed + -fno-ugly-comma -fno-ugly-complex -fno-ugly-init + -fno-ugly-logint + + *Note Distensions::, for more information. + + `-ff66' + Specify that the program is written in idiomatic FORTRAN 66. Same + as `-fonetrip -fugly-assumed'. + + The `-fno-f66' option is the inverse of `-ff66'. As such, it is + the same as `-fno-onetrip -fno-ugly-assumed'. + + The meaning of this option is likely to be refined as future + versions of `g77' provide more compatibility with other existing + and obsolete Fortran implementations. + + `-ff77' + Specify that the program is written in idiomatic UNIX FORTRAN 77 + and/or the dialect accepted by the `f2c' product. Same as + `-fbackslash -fno-typeless-boz'. + + The meaning of this option is likely to be refined as future + versions of `g77' provide more compatibility with other existing + and obsolete Fortran implementations. + + `-fno-f77' + The `-fno-f77' option is _not_ the inverse of `-ff77'. It + specifies that the program is not written in idiomatic UNIX + FORTRAN 77 or `f2c' but in a more widely portable dialect. + `-fno-f77' is the same as `-fno-backslash'. + + The meaning of this option is likely to be refined as future + versions of `g77' provide more compatibility with other existing + and obsolete Fortran implementations. + +  + File: g77.info, Node: Fortran Dialect Options, Next: Warning Options, Prev: Shorthand Options, Up: Invoking G77 + + Options Controlling Fortran Dialect + =================================== + + The following options control the dialect of Fortran that the + compiler accepts: + + `-ffree-form' + + `-fno-fixed-form' + Specify that the source file is written in free form (introduced + in Fortran 90) instead of the more-traditional fixed form. + + `-ff90' + Allow certain Fortran-90 constructs. + + This option controls whether certain Fortran 90 constructs are + recognized. (Other Fortran 90 constructs might or might not be + recognized depending on other options such as `-fvxt', + `-ff90-intrinsics-enable', and the current level of support for + Fortran 90.) + + *Note Fortran 90::, for more information. + + `-fvxt' + Specify the treatment of certain constructs that have different + meanings depending on whether the code is written in GNU Fortran + (based on FORTRAN 77 and akin to Fortran 90) or VXT Fortran (more + like VAX FORTRAN). + + The default is `-fno-vxt'. `-fvxt' specifies that the VXT Fortran + interpretations for those constructs are to be chosen. + + *Note VXT Fortran::, for more information. + + `-fdollar-ok' + Allow `$' as a valid character in a symbol name. + + `-fno-backslash' + Specify that `\' is not to be specially interpreted in character + and Hollerith constants a la C and many UNIX Fortran compilers. + + For example, with `-fbackslash' in effect, `A\nB' specifies three + characters, with the second one being newline. With + `-fno-backslash', it specifies four characters, `A', `\', `n', and + `B'. + + Note that `g77' implements a fairly general form of backslash + processing that is incompatible with the narrower forms supported + by some other compilers. For example, `'A\003B'' is a + three-character string in `g77' whereas other compilers that + support backslash might not support the three-octal-digit form, + and thus treat that string as longer than three characters. + + *Note Backslash in Constants::, for information on why + `-fbackslash' is the default instead of `-fno-backslash'. + + `-fno-ugly-args' + Disallow passing Hollerith and typeless constants as actual + arguments (for example, `CALL FOO(4HABCD)'). + + *Note Ugly Implicit Argument Conversion::, for more information. + + `-fugly-assign' + Use the same storage for a given variable regardless of whether it + is used to hold an assigned-statement label (as in `ASSIGN 10 TO + I') or used to hold numeric data (as in `I = 3'). + + *Note Ugly Assigned Labels::, for more information. + + `-fugly-assumed' + Assume any dummy array with a final dimension specified as `1' is + really an assumed-size array, as if `*' had been specified for the + final dimension instead of `1'. + + For example, `DIMENSION X(1)' is treated as if it had read + `DIMENSION X(*)'. + + *Note Ugly Assumed-Size Arrays::, for more information. + + `-fugly-comma' + In an external-procedure invocation, treat a trailing comma in the + argument list as specification of a trailing null argument, and + treat an empty argument list as specification of a single null + argument. + + For example, `CALL FOO(,)' is treated as `CALL FOO(%VAL(0), + %VAL(0))'. That is, _two_ null arguments are specified by the + procedure call when `-fugly-comma' is in force. And `F = FUNC()' + is treated as `F = FUNC(%VAL(0))'. + + The default behavior, `-fno-ugly-comma', is to ignore a single + trailing comma in an argument list. So, by default, `CALL + FOO(X,)' is treated exactly the same as `CALL FOO(X)'. + + *Note Ugly Null Arguments::, for more information. + + `-fugly-complex' + Do not complain about `REAL(EXPR)' or `AIMAG(EXPR)' when EXPR is a + `COMPLEX' type other than `COMPLEX(KIND=1)'--usually this is used + to permit `COMPLEX(KIND=2)' (`DOUBLE COMPLEX') operands. + + The `-ff90' option controls the interpretation of this construct. + + *Note Ugly Complex Part Extraction::, for more information. + + `-fno-ugly-init' + Disallow use of Hollerith and typeless constants as initial values + (in `PARAMETER' and `DATA' statements), and use of character + constants to initialize numeric types and vice versa. + + For example, `DATA I/'F'/, CHRVAR/65/, J/4HABCD/' is disallowed by + `-fno-ugly-init'. + + *Note Ugly Conversion of Initializers::, for more information. + + `-fugly-logint' + Treat `INTEGER' and `LOGICAL' variables and expressions as + potential stand-ins for each other. + + For example, automatic conversion between `INTEGER' and `LOGICAL' + is enabled, for many contexts, via this option. + + *Note Ugly Integer Conversions::, for more information. + + `-fonetrip' + Executable iterative `DO' loops are to be executed at least once + each time they are reached. + + ANSI FORTRAN 77 and more recent versions of the Fortran standard + specify that the body of an iterative `DO' loop is not executed if + the number of iterations calculated from the parameters of the + loop is less than 1. (For example, `DO 10 I = 1, 0'.) Such a + loop is called a "zero-trip loop". + + Prior to ANSI FORTRAN 77, many compilers implemented `DO' loops + such that the body of a loop would be executed at least once, even + if the iteration count was zero. Fortran code written assuming + this behavior is said to require "one-trip loops". For example, + some code written to the FORTRAN 66 standard expects this behavior + from its `DO' loops, although that standard did not specify this + behavior. + + The `-fonetrip' option specifies that the source file(s) being + compiled require one-trip loops. + + This option affects only those loops specified by the (iterative) + `DO' statement and by implied-`DO' lists in I/O statements. Loops + specified by implied-`DO' lists in `DATA' and specification + (non-executable) statements are not affected. + + `-ftypeless-boz' + Specifies that prefix-radix non-decimal constants, such as + `Z'ABCD'', are typeless instead of `INTEGER(KIND=1)'. + + You can test for yourself whether a particular compiler treats the + prefix form as `INTEGER(KIND=1)' or typeless by running the + following program: + + EQUIVALENCE (I, R) + R = Z'ABCD1234' + J = Z'ABCD1234' + IF (J .EQ. I) PRINT *, 'Prefix form is TYPELESS' + IF (J .NE. I) PRINT *, 'Prefix form is INTEGER' + END + + Reports indicate that many compilers process this form as + `INTEGER(KIND=1)', though a few as typeless, and at least one + based on a command-line option specifying some kind of + compatibility. + + `-fintrin-case-initcap' + + `-fintrin-case-upper' + + `-fintrin-case-lower' + + `-fintrin-case-any' + Specify expected case for intrinsic names. `-fintrin-case-lower' + is the default. + + `-fmatch-case-initcap' + + `-fmatch-case-upper' + + `-fmatch-case-lower' + + `-fmatch-case-any' + Specify expected case for keywords. `-fmatch-case-lower' is the + default. + + `-fsource-case-upper' + + `-fsource-case-lower' + + `-fsource-case-preserve' + Specify whether source text other than character and Hollerith + constants is to be translated to uppercase, to lowercase, or + preserved as is. `-fsource-case-lower' is the default. + + `-fsymbol-case-initcap' + + `-fsymbol-case-upper' + + `-fsymbol-case-lower' + + `-fsymbol-case-any' + Specify valid cases for user-defined symbol names. + `-fsymbol-case-any' is the default. + + `-fcase-strict-upper' + Same as `-fintrin-case-upper -fmatch-case-upper + -fsource-case-preserve -fsymbol-case-upper'. (Requires all + pertinent source to be in uppercase.) + + `-fcase-strict-lower' + Same as `-fintrin-case-lower -fmatch-case-lower + -fsource-case-preserve -fsymbol-case-lower'. (Requires all + pertinent source to be in lowercase.) + + `-fcase-initcap' + Same as `-fintrin-case-initcap -fmatch-case-initcap + -fsource-case-preserve -fsymbol-case-initcap'. (Requires all + pertinent source to be in initial capitals, as in `Print + *,SqRt(Value)'.) + + `-fcase-upper' + Same as `-fintrin-case-any -fmatch-case-any -fsource-case-upper + -fsymbol-case-any'. (Maps all pertinent source to uppercase.) + + `-fcase-lower' + Same as `-fintrin-case-any -fmatch-case-any -fsource-case-lower + -fsymbol-case-any'. (Maps all pertinent source to lowercase.) + + `-fcase-preserve' + Same as `-fintrin-case-any -fmatch-case-any -fsource-case-preserve + -fsymbol-case-any'. (Preserves all case in user-defined symbols, + while allowing any-case matching of intrinsics and keywords. For + example, `call Foo(i,I)' would pass two _different_ variables + named `i' and `I' to a procedure named `Foo'.) + + `-fbadu77-intrinsics-delete' + + `-fbadu77-intrinsics-hide' + + `-fbadu77-intrinsics-disable' + + `-fbadu77-intrinsics-enable' + Specify status of UNIX intrinsics having inappropriate forms. + `-fbadu77-intrinsics-enable' is the default. *Note Intrinsic + Groups::. + + `-ff2c-intrinsics-delete' + + `-ff2c-intrinsics-hide' + + `-ff2c-intrinsics-disable' + + `-ff2c-intrinsics-enable' + Specify status of f2c-specific intrinsics. + `-ff2c-intrinsics-enable' is the default. *Note Intrinsic + Groups::. + + `-ff90-intrinsics-delete' + + `-ff90-intrinsics-hide' + + `-ff90-intrinsics-disable' + + `-ff90-intrinsics-enable' + Specify status of F90-specific intrinsics. + `-ff90-intrinsics-enable' is the default. *Note Intrinsic + Groups::. + + `-fgnu-intrinsics-delete' + + `-fgnu-intrinsics-hide' + + `-fgnu-intrinsics-disable' + + `-fgnu-intrinsics-enable' + Specify status of Digital's COMPLEX-related intrinsics. + `-fgnu-intrinsics-enable' is the default. *Note Intrinsic + Groups::. + + `-fmil-intrinsics-delete' + + `-fmil-intrinsics-hide' + + `-fmil-intrinsics-disable' + + `-fmil-intrinsics-enable' + Specify status of MIL-STD-1753-specific intrinsics. + `-fmil-intrinsics-enable' is the default. *Note Intrinsic + Groups::. + + `-funix-intrinsics-delete' + + `-funix-intrinsics-hide' + + `-funix-intrinsics-disable' + + `-funix-intrinsics-enable' + Specify status of UNIX intrinsics. `-funix-intrinsics-enable' is + the default. *Note Intrinsic Groups::. + + `-fvxt-intrinsics-delete' + + `-fvxt-intrinsics-hide' + + `-fvxt-intrinsics-disable' + + `-fvxt-intrinsics-enable' + Specify status of VXT intrinsics. `-fvxt-intrinsics-enable' is + the default. *Note Intrinsic Groups::. + + `-ffixed-line-length-N' + Set column after which characters are ignored in typical fixed-form + lines in the source file, and through which spaces are assumed (as + if padded to that length) after the ends of short fixed-form lines. + + Popular values for N include 72 (the standard and the default), 80 + (card image), and 132 (corresponds to "extended-source" options in + some popular compilers). N may be `none', meaning that the entire + line is meaningful and that continued character constants never + have implicit spaces appended to them to fill out the line. + `-ffixed-line-length-0' means the same thing as + `-ffixed-line-length-none'. + + *Note Source Form::, for more information. + +  + File: g77.info, Node: Warning Options, Next: Debugging Options, Prev: Fortran Dialect Options, Up: Invoking G77 + + Options to Request or Suppress Warnings + ======================================= + + Warnings are diagnostic messages that report constructions which are + not inherently erroneous but which are risky or suggest there might + have been an error. + + You can request many specific warnings with options beginning `-W', + for example `-Wimplicit' to request warnings on implicit declarations. + Each of these specific warning options also has a negative form + beginning `-Wno-' to turn off warnings; for example, `-Wno-implicit'. + This manual lists only one of the two forms, whichever is not the + default. + + These options control the amount and kinds of warnings produced by + GNU Fortran: + + `-fsyntax-only' + Check the code for syntax errors, but don't do anything beyond + that. + + `-pedantic' + Issue warnings for uses of extensions to ANSI FORTRAN 77. + `-pedantic' also applies to C-language constructs where they occur + in GNU Fortran source files, such as use of `\e' in a character + constant within a directive like `#include'. + + Valid ANSI FORTRAN 77 programs should compile properly with or + without this option. However, without this option, certain GNU + extensions and traditional Fortran features are supported as well. + With this option, many of them are rejected. + + Some users try to use `-pedantic' to check programs for strict ANSI + conformance. They soon find that it does not do quite what they + want--it finds some non-ANSI practices, but not all. However, + improvements to `g77' in this area are welcome. + + `-pedantic-errors' + Like `-pedantic', except that errors are produced rather than + warnings. + + `-fpedantic' + Like `-pedantic', but applies only to Fortran constructs. + + `-w' + Inhibit all warning messages. + + `-Wno-globals' + Inhibit warnings about use of a name as both a global name (a + subroutine, function, or block data program unit, or a common + block) and implicitly as the name of an intrinsic in a source file. + + Also inhibit warnings about inconsistent invocations and/or + definitions of global procedures (function and subroutines). Such + inconsistencies include different numbers of arguments and + different types of arguments. + + `-Wimplicit' + Warn whenever a variable, array, or function is implicitly + declared. Has an effect similar to using the `IMPLICIT NONE' + statement in every program unit. (Some Fortran compilers provide + this feature by an option named `-u' or `/WARNINGS=DECLARATIONS'.) + + `-Wunused' + Warn whenever a variable is unused aside from its declaration. + + `-Wuninitialized' + Warn whenever an automatic variable is used without first being + initialized. + + These warnings are possible only in optimizing compilation, + because they require data-flow information that is computed only + when optimizing. If you don't specify `-O', you simply won't get + these warnings. + + These warnings occur only for variables that are candidates for + register allocation. Therefore, they do not occur for a variable + whose address is taken, or whose size is other than 1, 2, 4 or 8 + bytes. Also, they do not occur for arrays, even when they are in + registers. + + Note that there might be no warning about a variable that is used + only to compute a value that itself is never used, because such + computations may be deleted by data-flow analysis before the + warnings are printed. + + These warnings are made optional because GNU Fortran is not smart + enough to see all the reasons why the code might be correct + despite appearing to have an error. Here is one example of how + this can happen: + + SUBROUTINE DISPAT(J) + IF (J.EQ.1) I=1 + IF (J.EQ.2) I=4 + IF (J.EQ.3) I=5 + CALL FOO(I) + END + + If the value of `J' is always 1, 2 or 3, then `I' is always + initialized, but GNU Fortran doesn't know this. Here is another + common case: + + SUBROUTINE MAYBE(FLAG) + LOGICAL FLAG + IF (FLAG) VALUE = 9.4 + ... + IF (FLAG) PRINT *, VALUE + END + + This has no bug because `VALUE' is used only if it is set. + + `-Wall' + The `-Wunused' and `-Wuninitialized' options combined. These are + all the options which pertain to usage that we recommend avoiding + and that we believe is easy to avoid. (As more warnings are added + to `g77' some might be added to the list enabled by `-Wall'.) + + The remaining `-W...' options are not implied by `-Wall' because + they warn about constructions that we consider reasonable to use, on + occasion, in clean programs. + + `-Wsurprising' + Warn about "suspicious" constructs that are interpreted by the + compiler in a way that might well be surprising to someone reading + the code. These differences can result in subtle, + compiler-dependent (even machine-dependent) behavioral differences. + The constructs warned about include: + + * Expressions having two arithmetic operators in a row, such as + `X*-Y'. Such a construct is nonstandard, and can produce + unexpected results in more complicated situations such as + `X**-Y*Z'. `g77' along with many other compilers, interprets + this example differently than many programmers, and a few + other compilers. Specifically, `g77' interprets `X**-Y*Z' as + `(X**(-Y))*Z', while others might think it should be + interpreted as `X**(-(Y*Z))'. + + A revealing example is the constant expression `2**-2*1.', + which `g77' evaluates to .25, while others might evaluate it + to 0., the difference resulting from the way precedence + affects type promotion. + + (The `-fpedantic' option also warns about expressions having + two arithmetic operators in a row.) + + * Expressions with a unary minus followed by an operand and then + a binary operator other than plus or minus. For example, + `-2**2' produces a warning, because the precedence is + `-(2**2)', yielding -4, not `(-2)**2', which yields 4, and + which might represent what a programmer expects. + + An example of an expression producing different results in a + surprising way is `-I*S', where I holds the value + `-2147483648' and S holds `0.5'. On many systems, negating I + results in the same value, not a positive number, because it + is already the lower bound of what an `INTEGER(KIND=1)' + variable can hold. So, the expression evaluates to a + positive number, while the "expected" interpretation, + `(-I)*S', would evaluate to a negative number. + + Even cases such as `-I*J' produce warnings, even though, in + most configurations and situations, there is no computational + difference between the results of the two + interpretations--the purpose of this warning is to warn about + differing interpretations and encourage a better style of + coding, not to identify only those places where bugs might + exist in the user's code. + + * `DO' loops with `DO' variables that are not of integral + type--that is, using `REAL' variables as loop control + variables. Although such loops can be written to work in the + "obvious" way, the way `g77' is required by the Fortran + standard to interpret such code is likely to be quite + different from the way many programmers expect. (This is + true of all `DO' loops, but the differences are pronounced + for non-integral loop control variables.) + + *Note Loops::, for more information. + + `-Werror' + Make all warnings into errors. + + `-W' + Turns on "extra warnings" and, if optimization is specified via + `-O', the `-Wuninitialized' option. (This might change in future + versions of `g77' + + "Extra warnings" are issued for: + + * Unused parameters to a procedure (when `-Wunused' also is + specified). + + * Overflows involving floating-point constants (not available + for certain configurations). + + *Note Options to Request or Suppress Warnings: (gcc)Warning Options, + for information on more options offered by the GBE shared by `g77' + `gcc' and other GNU compilers. + + Some of these have no effect when compiling programs written in + Fortran: + + `-Wcomment' + + `-Wformat' + + `-Wparentheses' + + `-Wswitch' + + `-Wtraditional' + + `-Wshadow' + + `-Wid-clash-LEN' + + `-Wlarger-than-LEN' + + `-Wconversion' + + `-Waggregate-return' + + `-Wredundant-decls' + These options all could have some relevant meaning for GNU Fortran + programs, but are not yet supported. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-20 gcc-3.2.3/gcc/f/g77.info-20 *** gcc-3.2.2/gcc/f/g77.info-20 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-20 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,511 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: CMPAMBIG, Next: EXPIMP, Up: Diagnostics + + `CMPAMBIG' + ========== + + Ambiguous use of intrinsic INTRINSIC ... + + The type of the argument to the invocation of the INTRINSIC + intrinsic is a `COMPLEX' type other than `COMPLEX(KIND=1)'. Typically, + it is `COMPLEX(KIND=2)', also known as `DOUBLE COMPLEX'. + + The interpretation of this invocation depends on the particular + dialect of Fortran for which the code was written. Some dialects + convert the real part of the argument to `REAL(KIND=1)', thus losing + precision; other dialects, and Fortran 90, do no such conversion. + + So, GNU Fortran rejects such invocations except under certain + circumstances, to avoid making an incorrect assumption that results in + generating the wrong code. + + To determine the dialect of the program unit, perhaps even whether + that particular invocation is properly coded, determine how the result + of the intrinsic is used. + + The result of INTRINSIC is expected (by the original programmer) to + be `REAL(KIND=1)' (the non-Fortran-90 interpretation) if: + + * It is passed as an argument to a procedure that explicitly or + implicitly declares that argument `REAL(KIND=1)'. + + For example, a procedure with no `DOUBLE PRECISION' or `IMPLICIT + DOUBLE PRECISION' statement specifying the dummy argument + corresponding to an actual argument of `REAL(Z)', where `Z' is + declared `DOUBLE COMPLEX', strongly suggests that the programmer + expected `REAL(Z)' to return `REAL(KIND=1)' instead of + `REAL(KIND=2)'. + + * It is used in a context that would otherwise not include any + `REAL(KIND=2)' but where treating the INTRINSIC invocation as + `REAL(KIND=2)' would result in unnecessary promotions and + (typically) more expensive operations on the wider type. + + For example: + + DOUBLE COMPLEX Z + ... + R(1) = T * REAL(Z) + + The above example suggests the programmer expected the real part + of `Z' to be converted to `REAL(KIND=1)' before being multiplied + by `T' (presumed, along with `R' above, to be type `REAL(KIND=1)'). + + Otherwise, the conversion would have to be delayed until after the + multiplication, requiring not only an extra conversion (of `T' to + `REAL(KIND=2)'), but a (typically) more expensive multiplication + (a double-precision multiplication instead of a single-precision + one). + + The result of INTRINSIC is expected (by the original programmer) to + be `REAL(KIND=2)' (the Fortran 90 interpretation) if: + + * It is passed as an argument to a procedure that explicitly or + implicitly declares that argument `REAL(KIND=2)'. + + For example, a procedure specifying a `DOUBLE PRECISION' dummy + argument corresponding to an actual argument of `REAL(Z)', where + `Z' is declared `DOUBLE COMPLEX', strongly suggests that the + programmer expected `REAL(Z)' to return `REAL(KIND=2)' instead of + `REAL(KIND=1)'. + + * It is used in an expression context that includes other + `REAL(KIND=2)' operands, or is assigned to a `REAL(KIND=2)' + variable or array element. + + For example: + + DOUBLE COMPLEX Z + DOUBLE PRECISION R, T + ... + R(1) = T * REAL(Z) + + The above example suggests the programmer expected the real part + of `Z' to _not_ be converted to `REAL(KIND=1)' by the `REAL()' + intrinsic. + + Otherwise, the conversion would have to be immediately followed by + a conversion back to `REAL(KIND=2)', losing the original, full + precision of the real part of `Z', before being multiplied by `T'. + + Once you have determined whether a particular invocation of INTRINSIC + expects the Fortran 90 interpretation, you can: + + * Change it to `DBLE(EXPR)' (if INTRINSIC is `REAL') or + `DIMAG(EXPR)' (if INTRINSIC is `AIMAG') if it expected the Fortran + 90 interpretation. + + This assumes EXPR is `COMPLEX(KIND=2)'--if it is some other type, + such as `COMPLEX*32', you should use the appropriate intrinsic, + such as the one to convert to `REAL*16' (perhaps `DBLEQ()' in + place of `DBLE()', and `QIMAG()' in place of `DIMAG()'). + + * Change it to `REAL(INTRINSIC(EXPR))', otherwise. This converts to + `REAL(KIND=1)' in all working Fortran compilers. + + If you don't want to change the code, and you are certain that all + ambiguous invocations of INTRINSIC in the source file have the same + expectation regarding interpretation, you can: + + * Compile with the `g77' option `-ff90', to enable the Fortran 90 + interpretation. + + * Compile with the `g77' options `-fno-f90 -fugly-complex', to + enable the non-Fortran-90 interpretations. + + *Note REAL() and AIMAG() of Complex::, for more information on this + issue. + + Note: If the above suggestions don't produce enough evidence as to + whether a particular program expects the Fortran 90 interpretation of + this ambiguous invocation of INTRINSIC, there is one more thing you can + try. + + If you have access to most or all the compilers used on the program + to create successfully tested and deployed executables, read the + documentation for, and _also_ test out, each compiler to determine how + it treats the INTRINSIC intrinsic in this case. (If all the compilers + don't agree on an interpretation, there might be lurking bugs in the + deployed versions of the program.) + + The following sample program might help: + + PROGRAM JCB003 + C + C Written by James Craig Burley 1997-02-23. + C + C Determine how compilers handle non-standard REAL + C and AIMAG on DOUBLE COMPLEX operands. + C + DOUBLE COMPLEX Z + REAL R + Z = (3.3D0, 4.4D0) + R = Z + CALL DUMDUM(Z, R) + R = REAL(Z) - R + IF (R .NE. 0.) PRINT *, 'REAL() is Fortran 90' + IF (R .EQ. 0.) PRINT *, 'REAL() is not Fortran 90' + R = 4.4D0 + CALL DUMDUM(Z, R) + R = AIMAG(Z) - R + IF (R .NE. 0.) PRINT *, 'AIMAG() is Fortran 90' + IF (R .EQ. 0.) PRINT *, 'AIMAG() is not Fortran 90' + END + C + C Just to make sure compiler doesn't use naive flow + C analysis to optimize away careful work above, + C which might invalidate results.... + C + SUBROUTINE DUMDUM(Z, R) + DOUBLE COMPLEX Z + REAL R + END + + If the above program prints contradictory results on a particular + compiler, run away! + +  + File: g77.info, Node: EXPIMP, Next: INTGLOB, Prev: CMPAMBIG, Up: Diagnostics + + `EXPIMP' + ======== + + Intrinsic INTRINSIC referenced ... + + The INTRINSIC is explicitly declared in one program unit in the + source file and implicitly used as an intrinsic in another program unit + in the same source file. + + This diagnostic is designed to catch cases where a program might + depend on using the name INTRINSIC as an intrinsic in one program unit + and as a global name (such as the name of a subroutine or function) in + another, but `g77' recognizes the name as an intrinsic in both cases. + + After verifying that the program unit making implicit use of the + intrinsic is indeed written expecting the intrinsic, add an `INTRINSIC + INTRINSIC' statement to that program unit to prevent this warning. + + This and related warnings are disabled by using the `-Wno-globals' + option when compiling. + + Note that this warning is not issued for standard intrinsics. + Standard intrinsics include those described in the FORTRAN 77 standard + and, if `-ff90' is specified, those described in the Fortran 90 + standard. Such intrinsics are not as likely to be confused with user + procedures as intrinsics provided as extensions to the standard by + `g77'. + +  + File: g77.info, Node: INTGLOB, Next: LEX, Prev: EXPIMP, Up: Diagnostics + + `INTGLOB' + ========= + + Same name `INTRINSIC' given ... + + The name INTRINSIC is used for a global entity (a common block or a + program unit) in one program unit and implicitly used as an intrinsic + in another program unit. + + This diagnostic is designed to catch cases where a program intends + to use a name entirely as a global name, but `g77' recognizes the name + as an intrinsic in the program unit that references the name, a + situation that would likely produce incorrect code. + + For example: + + INTEGER FUNCTION TIME() + ... + END + ... + PROGRAM SAMP + INTEGER TIME + PRINT *, 'Time is ', TIME() + END + + The above example defines a program unit named `TIME', but the + reference to `TIME' in the main program unit `SAMP' is normally treated + by `g77' as a reference to the intrinsic `TIME()' (unless a + command-line option that prevents such treatment has been specified). + + As a result, the program `SAMP' will _not_ invoke the `TIME' + function in the same source file. + + Since `g77' recognizes `libU77' procedures as intrinsics, and since + some existing code uses the same names for its own procedures as used + by some `libU77' procedures, this situation is expected to arise often + enough to make this sort of warning worth issuing. + + After verifying that the program unit making implicit use of the + intrinsic is indeed written expecting the intrinsic, add an `INTRINSIC + INTRINSIC' statement to that program unit to prevent this warning. + + Or, if you believe the program unit is designed to invoke the + program-defined procedure instead of the intrinsic (as recognized by + `g77'), add an `EXTERNAL INTRINSIC' statement to the program unit that + references the name to prevent this warning. + + This and related warnings are disabled by using the `-Wno-globals' + option when compiling. + + Note that this warning is not issued for standard intrinsics. + Standard intrinsics include those described in the FORTRAN 77 standard + and, if `-ff90' is specified, those described in the Fortran 90 + standard. Such intrinsics are not as likely to be confused with user + procedures as intrinsics provided as extensions to the standard by + `g77'. + +  + File: g77.info, Node: LEX, Next: GLOBALS, Prev: INTGLOB, Up: Diagnostics + + `LEX' + ===== + + Unrecognized character ... + Invalid first character ... + Line too long ... + Non-numeric character ... + Continuation indicator ... + Label at ... invalid with continuation line indicator ... + Character constant ... + Continuation line ... + Statement at ... begins with invalid token + + Although the diagnostics identify specific problems, they can be + produced when general problems such as the following occur: + + * The source file contains something other than Fortran code. + + If the code in the file does not look like many of the examples + elsewhere in this document, it might not be Fortran code. (Note + that Fortran code often is written in lower case letters, while + the examples in this document use upper case letters, for + stylistic reasons.) + + For example, if the file contains lots of strange-looking + characters, it might be APL source code; if it contains lots of + parentheses, it might be Lisp source code; if it contains lots of + bugs, it might be C++ source code. + + * The source file contains free-form Fortran code, but `-ffree-form' + was not specified on the command line to compile it. + + Free form is a newer form for Fortran code. The older, classic + form is called fixed form. + + Fixed-form code is visually fairly distinctive, because numerical + labels and comments are all that appear in the first five columns + of a line, the sixth column is reserved to denote continuation + lines, and actual statements start at or beyond column 7. Spaces + generally are not significant, so if you see statements such as + `REALX,Y' and `DO10I=1,100', you are looking at fixed-form code. + Comment lines are indicated by the letter `C' or the symbol `*' in + column 1. (Some code uses `!' or `/*' to begin in-line comments, + which many compilers support.) + + Free-form code is distinguished from fixed-form source primarily + by the fact that statements may start anywhere. (If lots of + statements start in columns 1 through 6, that's a strong indicator + of free-form source.) Consecutive keywords must be separated by + spaces, so `REALX,Y' is not valid, while `REAL X,Y' is. There are + no comment lines per se, but `!' starts a comment anywhere in a + line (other than within a character or Hollerith constant). + + *Note Source Form::, for more information. + + * The source file is in fixed form and has been edited without + sensitivity to the column requirements. + + Statements in fixed-form code must be entirely contained within + columns 7 through 72 on a given line. Starting them "early" is + more likely to result in diagnostics than finishing them "late", + though both kinds of errors are often caught at compile time. + + For example, if the following code fragment is edited by following + the commented instructions literally, the result, shown afterward, + would produce a diagnostic when compiled: + + C On XYZZY systems, remove "C" on next line: + C CALL XYZZY_RESET + + The result of editing the above line might be: + + C On XYZZY systems, remove "C" on next line: + CALL XYZZY_RESET + + However, that leaves the first `C' in the `CALL' statement in + column 6, making it a comment line, which is not really what the + author intended, and which is likely to result in one of the + above-listed diagnostics. + + _Replacing_ the `C' in column 1 with a space is the proper change + to make, to ensure the `CALL' keyword starts in or after column 7. + + Another common mistake like this is to forget that fixed-form + source lines are significant through only column 72, and that, + normally, any text beyond column 72 is ignored or is diagnosed at + compile time. + + *Note Source Form::, for more information. + + * The source file requires preprocessing, and the preprocessing is + not being specified at compile time. + + A source file containing lines beginning with `#define', + `#include', `#if', and so on is likely one that requires + preprocessing. + + If the file's suffix is `.f', `.for', or `.FOR', the file normally + will be compiled _without_ preprocessing by `g77'. + + Change the file's suffix from `.f' to `.F' (or, on systems with + case-insensitive file names, to `.fpp' or `.FPP'), from `.for' to + `.fpp', or from `.FOR' to `.FPP'. `g77' compiles files with such + names _with_ preprocessing. + + Or, learn how to use `gcc''s `-x' option to specify the language + `f77-cpp-input' for Fortran files that require preprocessing. + *Note Options Controlling the Kind of Output: (gcc)Overall Options. + + * The source file is preprocessed, and the results of preprocessing + result in syntactic errors that are not necessarily obvious to + someone examining the source file itself. + + Examples of errors resulting from preprocessor macro expansion + include exceeding the line-length limit, improperly starting, + terminating, or incorporating the apostrophe or double-quote in a + character constant, improperly forming a Hollerith constant, and + so on. + + *Note Options Controlling the Kind of Output: Overall Options, for + suggestions about how to use, and not use, preprocessing for + Fortran code. + +  + File: g77.info, Node: GLOBALS, Next: LINKFAIL, Prev: LEX, Up: Diagnostics + + `GLOBALS' + ========= + + Global name NAME defined at ... already defined... + Global name NAME at ... has different type... + Too many arguments passed to NAME at ... + Too few arguments passed to NAME at ... + Argument #N of NAME is ... + + These messages all identify disagreements about the global procedure + named NAME among different program units (usually including NAME + itself). + + Whether a particular disagreement is reported as a warning or an + error can depend on the relative order of the disagreeing portions of + the source file. + + Disagreements between a procedure invocation and the _subsequent_ + procedure itself are, usually, diagnosed as errors when the procedure + itself _precedes_ the invocation. Other disagreements are diagnosed + via warnings. + + This distinction, between warnings and errors, is due primarily to + the present tendency of the `gcc' back end to inline only those + procedure invocations that are _preceded_ by the corresponding + procedure definitions. If the `gcc' back end is changed to inline + "forward references", in which invocations precede definitions, the + `g77' front end will be changed to treat both orderings as errors, + accordingly. + + The sorts of disagreements that are diagnosed by `g77' include + whether a procedure is a subroutine or function; if it is a function, + the type of the return value of the procedure; the number of arguments + the procedure accepts; and the type of each argument. + + Disagreements regarding global names among program units in a + Fortran program _should_ be fixed in the code itself. However, if that + is not immediately practical, and the code has been working for some + time, it is possible it will work when compiled with the `-fno-globals' + option. + + The `-fno-globals' option causes these diagnostics to all be warnings + and disables all inlining of references to global procedures (to avoid + subsequent compiler crashes and bad-code generation). Use of the + `-Wno-globals' option as well as `-fno-globals' suppresses all of these + diagnostics. (`-Wno-globals' by itself disables only the warnings, not + the errors.) + + After using `-fno-globals' to work around these problems, it is wise + to stop using that option and address them by fixing the Fortran code, + because such problems, while they might not actually result in bugs on + some systems, indicate that the code is not as portable as it could be. + In particular, the code might appear to work on a particular system, + but have bugs that affect the reliability of the data without + exhibiting any other outward manifestations of the bugs. + +  + File: g77.info, Node: LINKFAIL, Next: Y2KBAD, Prev: GLOBALS, Up: Diagnostics + + `LINKFAIL' + ========== + + On AIX 4.1, `g77' might not build with the native (non-GNU) tools due + to a linker bug in coping with the `-bbigtoc' option which leads to a + `Relocation overflow' error. The GNU linker is not recommended on + current AIX versions, though; it was developed under a now-unsupported + version. This bug is said to be fixed by `update PTF U455193 for APAR + IX75823'. + + Compiling with `-mminimal-toc' might solve this problem, e.g. by + adding + BOOT_CFLAGS='-mminimal-toc -O2 -g' + to the `make bootstrap' command line. + +  + File: g77.info, Node: Y2KBAD, Prev: LINKFAIL, Up: Diagnostics + + `Y2KBAD' + ======== + + Intrinsic `NAME', invoked at (^), known to be non-Y2K-compliant... + + This diagnostic indicates that the specific intrinsic invoked by the + name NAME is known to have an interface that is not Year-2000 (Y2K) + compliant. + + *Note Year 2000 (Y2K) Problems::. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-21 gcc-3.2.3/gcc/f/g77.info-21 *** gcc-3.2.2/gcc/f/g77.info-21 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-21 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,2269 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Index, Prev: Diagnostics, Up: Top + + Index + ***** + + * Menu: + + * ! <1>: LEX. + * ! <2>: Exclamation Point. + * ! <3>: Trailing Comment. + * ! <4>: Character Set. + * !: Statements Comments Lines. + * ": Character Set. + * # <1>: Cpp-style directives. + * #: Character Set. + * #define: Overall Options. + * #if: Overall Options. + * #include: Overall Options. + * #include directive: Bug Reporting. + * $: Dollar Signs. + * %: Character Set. + * %DESCR() construct: %DESCR(). + * %LOC() construct: %LOC(). + * %REF() construct: %REF(). + * %VAL() construct: %VAL(). + * &: Character Set. + * *: LEX. + * *N notation <1>: Compiler Types. + * *N notation: Star Notation. + * --driver option <1>: Changes. + * --driver option: News. + * -falias-check option <1>: Aliasing Assumed To Work. + * -falias-check option: Code Gen Options. + * -fargument-alias option <1>: Aliasing Assumed To Work. + * -fargument-alias option: Code Gen Options. + * -fargument-noalias option <1>: Aliasing Assumed To Work. + * -fargument-noalias option: Code Gen Options. + * -fbadu77-intrinsics-delete option: Fortran Dialect Options. + * -fbadu77-intrinsics-disable option: Fortran Dialect Options. + * -fbadu77-intrinsics-enable option: Fortran Dialect Options. + * -fbadu77-intrinsics-hide option: Fortran Dialect Options. + * -fbounds-check option: Code Gen Options. + * -fcaller-saves option: Optimize Options. + * -fcase-initcap option: Fortran Dialect Options. + * -fcase-lower option: Fortran Dialect Options. + * -fcase-preserve option: Fortran Dialect Options. + * -fcase-strict-lower option: Fortran Dialect Options. + * -fcase-strict-upper option: Fortran Dialect Options. + * -fcase-upper option: Fortran Dialect Options. + * -fdelayed-branch option: Optimize Options. + * -fdollar-ok option: Fortran Dialect Options. + * -femulate-complex option: Code Gen Options. + * -fexpensive-optimizations option: Optimize Options. + * -ff2c-intrinsics-delete option: Fortran Dialect Options. + * -ff2c-intrinsics-disable option: Fortran Dialect Options. + * -ff2c-intrinsics-enable option: Fortran Dialect Options. + * -ff2c-intrinsics-hide option: Fortran Dialect Options. + * -ff2c-library option: Code Gen Options. + * -ff66 option: Shorthand Options. + * -ff77 option: Shorthand Options. + * -ff90: Fortran 90 Features. + * -ff90 option: Fortran Dialect Options. + * -ff90-intrinsics-delete option: Fortran Dialect Options. + * -ff90-intrinsics-disable option: Fortran Dialect Options. + * -ff90-intrinsics-enable option: Fortran Dialect Options. + * -ff90-intrinsics-hide option: Fortran Dialect Options. + * -ffast-math option: Optimize Options. + * -ffixed-line-length-N option: Fortran Dialect Options. + * -fflatten-arrays option: Code Gen Options. + * -ffloat-store option: Optimize Options. + * -fforce-addr option: Optimize Options. + * -fforce-mem option: Optimize Options. + * -ffortran-bounds-check option: Code Gen Options. + * -ffree-form: Fortran 90 Features. + * -ffree-form option: Fortran Dialect Options. + * -fgnu-intrinsics-delete option: Fortran Dialect Options. + * -fgnu-intrinsics-disable option: Fortran Dialect Options. + * -fgnu-intrinsics-enable option: Fortran Dialect Options. + * -fgnu-intrinsics-hide option: Fortran Dialect Options. + * -fGROUP-intrinsics-hide option: Overly Convenient Options. + * -finit-local-zero option <1>: Overly Convenient Options. + * -finit-local-zero option: Code Gen Options. + * -fintrin-case-any option: Fortran Dialect Options. + * -fintrin-case-initcap option: Fortran Dialect Options. + * -fintrin-case-lower option: Fortran Dialect Options. + * -fintrin-case-upper option: Fortran Dialect Options. + * -fmatch-case-any option: Fortran Dialect Options. + * -fmatch-case-initcap option: Fortran Dialect Options. + * -fmatch-case-lower option: Fortran Dialect Options. + * -fmatch-case-upper option: Fortran Dialect Options. + * -fmil-intrinsics-delete option: Fortran Dialect Options. + * -fmil-intrinsics-disable option: Fortran Dialect Options. + * -fmil-intrinsics-enable option: Fortran Dialect Options. + * -fmil-intrinsics-hide option: Fortran Dialect Options. + * -fno-argument-noalias-global option <1>: Aliasing Assumed To Work. + * -fno-argument-noalias-global option: Code Gen Options. + * -fno-automatic option <1>: Overly Convenient Options. + * -fno-automatic option: Code Gen Options. + * -fno-backslash option: Fortran Dialect Options. + * -fno-common option: Code Gen Options. + * -fno-f2c option <1>: Avoid f2c Compatibility. + * -fno-f2c option: Code Gen Options. + * -fno-f77 option: Shorthand Options. + * -fno-fixed-form option: Fortran Dialect Options. + * -fno-globals option: Code Gen Options. + * -fno-ident option: Code Gen Options. + * -fno-inline option: Optimize Options. + * -fno-move-all-movables option: Optimize Options. + * -fno-reduce-all-givs option: Optimize Options. + * -fno-rerun-loop-opt option: Optimize Options. + * -fno-second-underscore: f2c Skeletons and Prototypes. + * -fno-second-underscore option <1>: Names. + * -fno-second-underscore option: Code Gen Options. + * -fno-silent option: Overall Options. + * -fno-trapping-math option: Optimize Options. + * -fno-ugly option: Shorthand Options. + * -fno-ugly-args option: Fortran Dialect Options. + * -fno-ugly-init option: Fortran Dialect Options. + * -fno-underscoring option <1>: Names. + * -fno-underscoring option: Code Gen Options. + * -fonetrip option: Fortran Dialect Options. + * -fpack-struct option: Code Gen Options. + * -fpcc-struct-return option: Code Gen Options. + * -fpedantic option: Warning Options. + * -fPIC option: News. + * -freg-struct-return option: Code Gen Options. + * -frerun-cse-after-loop option: Optimize Options. + * -fschedule-insns option: Optimize Options. + * -fschedule-insns2 option: Optimize Options. + * -fset-g77-defaults option: Overall Options. + * -fshort-double option: Code Gen Options. + * -fsource-case-lower option: Fortran Dialect Options. + * -fsource-case-preserve option: Fortran Dialect Options. + * -fsource-case-upper option: Fortran Dialect Options. + * -fstrength-reduce option: Optimize Options. + * -fsymbol-case-any option: Fortran Dialect Options. + * -fsymbol-case-initcap option: Fortran Dialect Options. + * -fsymbol-case-lower option: Fortran Dialect Options. + * -fsymbol-case-upper option: Fortran Dialect Options. + * -fsyntax-only option: Warning Options. + * -ftypeless-boz option: Fortran Dialect Options. + * -fugly option: Shorthand Options. + * -fugly-assign option: Fortran Dialect Options. + * -fugly-assumed option: Fortran Dialect Options. + * -fugly-comma option: Fortran Dialect Options. + * -fugly-complex option: Fortran Dialect Options. + * -fugly-logint option: Fortran Dialect Options. + * -funix-intrinsics-delete option: Fortran Dialect Options. + * -funix-intrinsics-disable option: Fortran Dialect Options. + * -funix-intrinsics-enable option: Fortran Dialect Options. + * -funix-intrinsics-hide option: Fortran Dialect Options. + * -funroll-all-loops option: Optimize Options. + * -funroll-loops option: Optimize Options. + * -funsafe-math-optimizations option: Optimize Options. + * -fversion option: Overall Options. + * -fvxt option: Fortran Dialect Options. + * -fvxt-intrinsics-delete option: Fortran Dialect Options. + * -fvxt-intrinsics-disable option: Fortran Dialect Options. + * -fvxt-intrinsics-enable option: Fortran Dialect Options. + * -fvxt-intrinsics-hide option: Fortran Dialect Options. + * -fzeros option: Code Gen Options. + * -g option: Debugging Options. + * -I- option: Directory Options. + * -i8: Increasing Precision/Range. + * -Idir option: Directory Options. + * -malign-double <1>: Changes. + * -malign-double: News. + * -malign-double option <1>: Aligned Data. + * -malign-double option: Optimize Options. + * -Nl option: Compiler Limits. + * -Nx option: Compiler Limits. + * -O2: News. + * -pedantic option: Warning Options. + * -pedantic-errors option: Warning Options. + * -qrealsize=8: Increasing Precision/Range. + * -r8: Increasing Precision/Range. + * -u option: Warning Options. + * -v option: G77 and GCC. + * -W option: Warning Options. + * -w option: Warning Options. + * -Waggregate-return option: Warning Options. + * -Wall option: Warning Options. + * -Wcomment option: Warning Options. + * -Wconversion option: Warning Options. + * -Werror option: Warning Options. + * -Wformat option: Warning Options. + * -Wid-clash-LEN option: Warning Options. + * -Wimplicit option: Warning Options. + * -Wlarger-than-LEN option: Warning Options. + * -Wno-globals option: Warning Options. + * -Wparentheses option: Warning Options. + * -Wredundant-decls option: Warning Options. + * -Wshadow option: Warning Options. + * -Wsurprising option: Warning Options. + * -Wswitch option: Warning Options. + * -Wtraditional option: Warning Options. + * -Wuninitialized option: Warning Options. + * -Wunused option: Warning Options. + * -x f77-cpp-input option: LEX. + * .EQV., with integer operands: Equivalence Versus Equality. + * .F filename suffix: Overall Options. + * .f filename suffix: Overall Options. + * .FOR filename suffix: Overall Options. + * .for filename suffix: Overall Options. + * .FPP filename suffix: Overall Options. + * .fpp filename suffix: Overall Options. + * .gdbinit: Main Program Unit. + * .r filename suffix: Overall Options. + * /* <1>: Trailing Comment. + * /*: Overall Options. + * /WARNINGS=DECLARATIONS switch: Warning Options. + * 80-bit spills: Floating-point Errors. + * ; <1>: Character Set. + * ;: Statements Comments Lines. + * <: Character Set. + * <> edit descriptor: I/O. + * >: Character Set. + * ?: Character Set. + * \: Character Set. + * _: Character Set. + * Abort intrinsic: Abort Intrinsic. + * Abs intrinsic: Abs Intrinsic. + * ACCEPT statement: TYPE and ACCEPT I/O Statements. + * Access intrinsic: Access Intrinsic. + * AChar intrinsic: AChar Intrinsic. + * ACos intrinsic: ACos Intrinsic. + * ACosD intrinsic: ACosD Intrinsic. + * adding options: Adding Options. + * adjustable arrays: Adjustable Arrays. + * AdjustL intrinsic: AdjustL Intrinsic. + * AdjustR intrinsic: AdjustR Intrinsic. + * AImag intrinsic <1>: AImag Intrinsic. + * AImag intrinsic: REAL() and AIMAG() of Complex. + * AIMax0 intrinsic: AIMax0 Intrinsic. + * AIMin0 intrinsic: AIMin0 Intrinsic. + * AInt intrinsic: AInt Intrinsic. + * AJMax0 intrinsic: AJMax0 Intrinsic. + * AJMin0 intrinsic: AJMin0 Intrinsic. + * Alarm intrinsic: Alarm Intrinsic. + * aliasing <1>: Known Bugs. + * aliasing: Aliasing Assumed To Work. + * aligned data: Aligned Data. + * aligned stack: Aligned Data. + * alignment <1>: Aligned Data. + * alignment <2>: Changes. + * alignment: News. + * alignment testing: Aligned Data. + * All intrinsic: All Intrinsic. + * all warnings: Warning Options. + * Allocated intrinsic: Allocated Intrinsic. + * ALog intrinsic: ALog Intrinsic. + * ALog10 intrinsic: ALog10 Intrinsic. + * Alpha, support: Known Bugs. + * alternate entry points: Alternate Entry Points. + * alternate returns: Alternate Returns. + * ALWAYS_FLUSH: Output Assumed To Flush. + * AMax0 intrinsic: AMax0 Intrinsic. + * AMax1 intrinsic: AMax1 Intrinsic. + * AMin0 intrinsic: AMin0 Intrinsic. + * AMin1 intrinsic: AMin1 Intrinsic. + * AMod intrinsic: AMod Intrinsic. + * ampersand: Character Set. + * ampersand continuation line: Ampersands. + * And intrinsic <1>: Bit Operations on Floating-point Data. + * And intrinsic: And Intrinsic. + * ANInt intrinsic: ANInt Intrinsic. + * ANS carriage control: OPEN CLOSE and INQUIRE Keywords. + * ANSI FORTRAN 77 standard: Language. + * ANSI FORTRAN 77 support: Standard Support. + * anti-aliasing: Aliasing Assumed To Work. + * Any intrinsic: Any Intrinsic. + * arguments, null: Ugly Null Arguments. + * arguments, omitting: Ugly Null Arguments. + * arguments, unused <1>: Unused Arguments. + * arguments, unused: Warning Options. + * array bounds checking: Code Gen Options. + * array bounds, adjustable: Array Bounds Expressions. + * array elements, in adjustable array bounds: Array Bounds Expressions. + * array ordering: Arrays. + * array performance: Code Gen Options. + * array size: Array Size. + * arrays: Arrays. + * arrays, adjustable: Adjustable Arrays. + * arrays, assumed-size: Ugly Assumed-Size Arrays. + * arrays, automatic <1>: Large Automatic Arrays. + * arrays, automatic <2>: Stack Overflow. + * arrays, automatic <3>: Overly Convenient Options. + * arrays, automatic: Adjustable Arrays. + * arrays, dimensioning <1>: Adjustable Arrays. + * arrays, dimensioning: Array Size. + * arrays, flattening: Code Gen Options. + * as command: What is GNU Fortran?. + * ASin intrinsic: ASin Intrinsic. + * ASinD intrinsic: ASinD Intrinsic. + * assembler: What is GNU Fortran?. + * assembly code: What is GNU Fortran?. + * assembly code, invalid: Bug Criteria. + * ASSIGN statement <1>: Assigned Statement Labels. + * ASSIGN statement: Ugly Assigned Labels. + * assigned labels: Ugly Assigned Labels. + * assigned statement labels: Assigned Statement Labels. + * Associated intrinsic: Associated Intrinsic. + * association, storage: Aliasing Assumed To Work. + * assumed-size arrays: Ugly Assumed-Size Arrays. + * asterisk: LEX. + * ATan intrinsic: ATan Intrinsic. + * ATan2 intrinsic: ATan2 Intrinsic. + * ATan2D intrinsic: ATan2D Intrinsic. + * ATanD intrinsic: ATanD Intrinsic. + * automatic arrays <1>: Large Automatic Arrays. + * automatic arrays <2>: Stack Overflow. + * automatic arrays <3>: Overly Convenient Options. + * automatic arrays: Adjustable Arrays. + * AUTOMATIC statement: AUTOMATIC Statement. + * automatic variables: AUTOMATIC Statement. + * back end, gcc <1>: Philosophy of Code Generation. + * back end, gcc: What is GNU Fortran?. + * backslash <1>: Backslash in Constants. + * backslash <2>: Character Set. + * backslash: Fortran Dialect Options. + * backtrace for bug reports: Bug Reporting. + * badu77 intrinsics: Fortran Dialect Options. + * badu77 intrinsics group: Intrinsic Groups. + * basic concepts: What is GNU Fortran?. + * Bear-poking: Philosophy of Code Generation. + * beginners: Getting Started. + * BesJ0 intrinsic: BesJ0 Intrinsic. + * BesJ1 intrinsic: BesJ1 Intrinsic. + * BesJN intrinsic: BesJN Intrinsic. + * BesY0 intrinsic: BesY0 Intrinsic. + * BesY1 intrinsic: BesY1 Intrinsic. + * BesYN intrinsic: BesYN Intrinsic. + * binary data: Portable Unformatted Files. + * Bit_Size intrinsic: Bit_Size Intrinsic. + * BITest intrinsic: BITest Intrinsic. + * BJTest intrinsic: BJTest Intrinsic. + * blank <1>: Lines. + * blank: Character Set. + * block data: Multiple Definitions of External Names. + * block data and libraries: Block Data and Libraries. + * BLOCK DATA statement <1>: Multiple Definitions of External Names. + * BLOCK DATA statement: Block Data and Libraries. + * bounds checking: Code Gen Options. + * BTest intrinsic: BTest Intrinsic. + * bug criteria: Bug Criteria. + * bug report mailing lists: Bug Lists. + * bugs: Bugs. + * bugs, finding: What is GNU Fortran?. + * bugs, known: Trouble. + * bus error <1>: Strange Behavior at Run Time. + * bus error: NeXTStep Problems. + * but-bugs: But-bugs. + * byte ordering: Portable Unformatted Files. + * C library: Strange Behavior at Run Time. + * C preprocessor: Overall Options. + * C routines calling Fortran: Debugging and Interfacing. + * C++: C++ Considerations. + * C++, linking with: Interoperating with C and C++. + * C, linking with: Interoperating with C and C++. + * CAbs intrinsic: CAbs Intrinsic. + * calling C routines: Debugging and Interfacing. + * card image: Fortran Dialect Options. + * carriage control: OPEN CLOSE and INQUIRE Keywords. + * carriage returns: Carriage Returns. + * case sensitivity: Case Sensitivity. + * cc1 program: What is GNU Fortran?. + * cc1plus program: What is GNU Fortran?. + * CCos intrinsic: CCos Intrinsic. + * CDAbs intrinsic: CDAbs Intrinsic. + * CDCos intrinsic: CDCos Intrinsic. + * CDExp intrinsic: CDExp Intrinsic. + * CDLog intrinsic: CDLog Intrinsic. + * CDSin intrinsic: CDSin Intrinsic. + * CDSqRt intrinsic: CDSqRt Intrinsic. + * Ceiling intrinsic: Ceiling Intrinsic. + * CExp intrinsic: CExp Intrinsic. + * cfortran.h: C Interfacing Tools. + * changes, user-visible: Changes. + * Char intrinsic: Char Intrinsic. + * character assignments: Fortran 90 Features. + * character constants <1>: Character and Hollerith Constants. + * character constants <2>: Ugly Conversion of Initializers. + * character constants <3>: Double Quote Meaning. + * character constants: Fortran Dialect Options. + * character set: Fortran Dialect Options. + * CHARACTER*(*): Arbitrary Concatenation. + * CHARACTER, null: Character Type. + * character-variable length: Character-variable Length. + * characters: Character Set. + * characters, comma: Ugly Null Arguments. + * characters, comment <1>: LEX. + * characters, comment <2>: Exclamation Point. + * characters, comment <3>: Trailing Comment. + * characters, comment: Statements Comments Lines. + * characters, continuation <1>: LEX. + * characters, continuation <2>: Exclamation Point. + * characters, continuation: Statements Comments Lines. + * ChDir intrinsic <1>: ChDir Intrinsic (function). + * ChDir intrinsic: ChDir Intrinsic (subroutine). + * checking subscripts: Code Gen Options. + * checking substrings: Code Gen Options. + * checks, of internal consistency: Overall Options. + * ChMod intrinsic <1>: ChMod Intrinsic (function). + * ChMod intrinsic: ChMod Intrinsic (subroutine). + * CLog intrinsic: CLog Intrinsic. + * close angle: Character Set. + * close bracket: Character Set. + * CLOSE statement: OPEN CLOSE and INQUIRE Keywords. + * Cmplx intrinsic <1>: Cmplx Intrinsic. + * Cmplx intrinsic: CMPLX() of DOUBLE PRECISION. + * code generation, conventions: Code Gen Options. + * code generation, improving: Better Optimization. + * code generator <1>: Philosophy of Code Generation. + * code generator: What is GNU Fortran?. + * code, assembly: What is GNU Fortran?. + * code, displaying main source: Known Bugs. + * code, in-line: What is GNU Fortran?. + * code, legacy: Collected Fortran Wisdom. + * code, machine: What is GNU Fortran?. + * code, source <1>: Case Sensitivity. + * code, source <2>: Source Form. + * code, source <3>: Lines. + * code, source: What is GNU Fortran?. + * code, user: Cannot Link Fortran Programs. + * code, writing: Collected Fortran Wisdom. + * column-major ordering: Arrays. + * columns 73 through 80: Better Source Model. + * comma, trailing: Ugly Null Arguments. + * command options: Invoking G77. + * commands, as: What is GNU Fortran?. + * commands, g77 <1>: G77 and GCC. + * commands, g77: What is GNU Fortran?. + * commands, gcc <1>: G77 and GCC. + * commands, gcc: What is GNU Fortran?. + * commands, gdb: What is GNU Fortran?. + * commands, ld: What is GNU Fortran?. + * comment <1>: LEX. + * comment <2>: Trailing Comment. + * comment: Statements Comments Lines. + * comment character: Exclamation Point. + * comment line, debug <1>: Enabling Debug Lines. + * comment line, debug: Debug Line. + * common blocks <1>: Mangling of Names. + * common blocks <2>: Known Bugs. + * common blocks: Common Blocks. + * common blocks, large: Large Common Blocks. + * COMMON layout: Aligned Data. + * COMMON statement <1>: Multiple Definitions of External Names. + * COMMON statement: Common Blocks. + * comparing logical expressions: Equivalence Versus Equality. + * compatibility, f2c <1>: Avoid f2c Compatibility. + * compatibility, f2c <2>: Block Data and Libraries. + * compatibility, f2c <3>: Code Gen Options. + * compatibility, f2c <4>: Shorthand Options. + * compatibility, f2c: Overall Options. + * compatibility, f77: Shorthand Options. + * compatibility, FORTRAN 66 <1>: Fortran Dialect Options. + * compatibility, FORTRAN 66: Shorthand Options. + * compatibility, FORTRAN 77: Standard Support. + * compatibility, Fortran 90: Fortran 90. + * compilation, in-line <1>: GLOBALS. + * compilation, in-line <2>: Code Gen Options. + * compilation, in-line: Optimize Options. + * compilation, pedantic: Pedantic Compilation. + * compilation, status: Overall Options. + * compiler bugs, reporting: Bug Reporting. + * compiler limits: Compiler Limits. + * compiler memory usage: Known Bugs. + * compiler speed: Known Bugs. + * compilers: What is GNU Fortran?. + * compiling programs: G77 and GCC. + * Complex intrinsic: Complex Intrinsic. + * COMPLEX intrinsics: Fortran Dialect Options. + * complex performance: Known Bugs. + * COMPLEX statement: Complex Variables. + * complex values: Ugly Complex Part Extraction. + * complex variables: Complex Variables. + * COMPLEX(KIND=1) type: Compiler Types. + * COMPLEX(KIND=2) type: Compiler Types. + * components of g77: What is GNU Fortran?. + * concatenation: Arbitrary Concatenation. + * concepts, basic: What is GNU Fortran?. + * conformance, IEEE 754 <1>: Floating-point precision. + * conformance, IEEE 754: Optimize Options. + * Conjg intrinsic: Conjg Intrinsic. + * consistency checks: Overall Options. + * constants <1>: Compiler Constants. + * constants: Constants. + * constants, character <1>: Character and Hollerith Constants. + * constants, character <2>: Ugly Conversion of Initializers. + * constants, character: Double Quote Meaning. + * constants, context-sensitive: Context-Sensitive Constants. + * constants, Hollerith <1>: Character and Hollerith Constants. + * constants, Hollerith <2>: Ugly Conversion of Initializers. + * constants, Hollerith: Ugly Implicit Argument Conversion. + * constants, integer: Known Bugs. + * constants, octal: Double Quote Meaning. + * constants, prefix-radix: Fortran Dialect Options. + * constants, types: Fortran Dialect Options. + * construct names: Construct Names. + * context-sensitive constants: Context-Sensitive Constants. + * context-sensitive intrinsics: Context-Sensitive Intrinsicness. + * continuation character <1>: LEX. + * continuation character <2>: Exclamation Point. + * continuation character: Statements Comments Lines. + * continuation line, ampersand: Ampersands. + * continuation line, number of: Continuation Line. + * contributors: Contributors. + * conversions, nonportable: Nonportable Conversions. + * core dump: Bug Criteria. + * Cos intrinsic: Cos Intrinsic. + * CosD intrinsic: CosD Intrinsic. + * CosH intrinsic: CosH Intrinsic. + * Count intrinsic: Count Intrinsic. + * cpp preprocessor: Overall Options. + * cpp program <1>: LEX. + * cpp program <2>: Bug Reporting. + * cpp program <3>: Preprocessor Options. + * cpp program <4>: Overall Options. + * cpp program: What is GNU Fortran?. + * CPU_Time intrinsic: CPU_Time Intrinsic. + * Cray pointers: POINTER Statements. + * credits: Contributors. + * CShift intrinsic: CShift Intrinsic. + * CSin intrinsic: CSin Intrinsic. + * CSqRt intrinsic: CSqRt Intrinsic. + * CTime intrinsic <1>: CTime Intrinsic (function). + * CTime intrinsic: CTime Intrinsic (subroutine). + * CYCLE statement: CYCLE and EXIT. + * DAbs intrinsic: DAbs Intrinsic. + * DACos intrinsic: DACos Intrinsic. + * DACosD intrinsic: DACosD Intrinsic. + * DASin intrinsic: DASin Intrinsic. + * DASinD intrinsic: DASinD Intrinsic. + * DATA statement <1>: Known Bugs. + * DATA statement: Code Gen Options. + * data types: Compiler Types. + * data, aligned: Aligned Data. + * data, overwritten: Strange Behavior at Run Time. + * DATan intrinsic: DATan Intrinsic. + * DATan2 intrinsic: DATan2 Intrinsic. + * DATan2D intrinsic: DATan2D Intrinsic. + * DATanD intrinsic: DATanD Intrinsic. + * Date intrinsic: Date Intrinsic. + * Date_and_Time intrinsic: Date_and_Time Intrinsic. + * date_y2kbuggy_0: Year 2000 (Y2K) Problems. + * DbesJ0 intrinsic: DbesJ0 Intrinsic. + * DbesJ1 intrinsic: DbesJ1 Intrinsic. + * DbesJN intrinsic: DbesJN Intrinsic. + * DbesY0 intrinsic: DbesY0 Intrinsic. + * DbesY1 intrinsic: DbesY1 Intrinsic. + * DbesYN intrinsic: DbesYN Intrinsic. + * Dble intrinsic: Dble Intrinsic. + * DbleQ intrinsic: DbleQ Intrinsic. + * DCmplx intrinsic: DCmplx Intrinsic. + * DConjg intrinsic: DConjg Intrinsic. + * DCos intrinsic: DCos Intrinsic. + * DCosD intrinsic: DCosD Intrinsic. + * DCosH intrinsic: DCosH Intrinsic. + * DDiM intrinsic: DDiM Intrinsic. + * debug line <1>: Enabling Debug Lines. + * debug line: Debug Line. + * debug_rtx: Bug Reporting. + * debugger <1>: Known Bugs. + * debugger: What is GNU Fortran?. + * debugging <1>: Names. + * debugging <2>: Main Program Unit. + * debugging: Debugging and Interfacing. + * debugging information options: Debugging Options. + * debugging main source code: Known Bugs. + * DECODE statement: ENCODE and DECODE. + * deleted intrinsics: Intrinsic Groups. + * DErF intrinsic: DErF Intrinsic. + * DErFC intrinsic: DErFC Intrinsic. + * DExp intrinsic: DExp Intrinsic. + * DFloat intrinsic: DFloat Intrinsic. + * DFlotI intrinsic: DFlotI Intrinsic. + * DFlotJ intrinsic: DFlotJ Intrinsic. + * diagnostics: Diagnostics. + * diagnostics, incorrect: What is GNU Fortran?. + * dialect options: Fortran Dialect Options. + * Digital Fortran features: Fortran Dialect Options. + * Digits intrinsic: Digits Intrinsic. + * DiM intrinsic: DiM Intrinsic. + * DImag intrinsic: DImag Intrinsic. + * DIMENSION statement <1>: Array Bounds Expressions. + * DIMENSION statement <2>: Adjustable Arrays. + * DIMENSION statement: Arrays. + * DIMENSION X(1): Ugly Assumed-Size Arrays. + * dimensioning arrays: Adjustable Arrays. + * DInt intrinsic: DInt Intrinsic. + * direction of language development: Direction of Language Development. + * directive, #include: Bug Reporting. + * directive, INCLUDE <1>: Bug Reporting. + * directive, INCLUDE <2>: Directory Options. + * directive, INCLUDE: Preprocessor Options. + * directory, options: Directory Options. + * directory, search paths for inclusion: Directory Options. + * disabled intrinsics: Intrinsic Groups. + * disk full: Output Assumed To Flush. + * displaying main source code: Known Bugs. + * disposition of files: OPEN CLOSE and INQUIRE Keywords. + * distensions: Distensions. + * DLog intrinsic: DLog Intrinsic. + * DLog10 intrinsic: DLog10 Intrinsic. + * DMax1 intrinsic: DMax1 Intrinsic. + * DMin1 intrinsic: DMin1 Intrinsic. + * DMod intrinsic: DMod Intrinsic. + * DNInt intrinsic: DNInt Intrinsic. + * DNRM2: News. + * DO: DO WHILE. + * DO loops, one-trip: Fortran Dialect Options. + * DO loops, zero-trip: Fortran Dialect Options. + * DO statement <1>: Loops. + * DO statement: Warning Options. + * DO WHILE <1>: DO WHILE. + * DO WHILE: Optimize Options. + * dollar sign <1>: Dollar Signs. + * dollar sign <2>: I/O. + * dollar sign: Fortran Dialect Options. + * Dot_Product intrinsic: Dot_Product Intrinsic. + * DOUBLE COMPLEX: DOUBLE COMPLEX. + * DOUBLE COMPLEX type: Compiler Types. + * DOUBLE PRECISION type: Compiler Types. + * double quote: Character Set. + * double quoted character constants <1>: Fortran 90 Features. + * double quoted character constants: Character Type. + * double quotes: Double Quote Meaning. + * double-precision performance <1>: Changes. + * double-precision performance: News. + * DProd intrinsic: DProd Intrinsic. + * DReal intrinsic: DReal Intrinsic. + * driver, gcc command as: What is GNU Fortran?. + * DSign intrinsic: DSign Intrinsic. + * DSin intrinsic: DSin Intrinsic. + * DSinD intrinsic: DSinD Intrinsic. + * DSinH intrinsic: DSinH Intrinsic. + * DSqRt intrinsic: DSqRt Intrinsic. + * DTan intrinsic: DTan Intrinsic. + * DTanD intrinsic: DTanD Intrinsic. + * DTanH intrinsic: DTanH Intrinsic. + * DTime intrinsic <1>: DTime Intrinsic (function). + * DTime intrinsic: DTime Intrinsic (subroutine). + * dummies, unused: Warning Options. + * edit descriptor, <>: I/O. + * edit descriptor, O: I/O. + * edit descriptor, Q: Q Edit Descriptor. + * edit descriptor, Z <1>: Fortran 90 Features. + * edit descriptor, Z: I/O. + * effecting IMPLICIT NONE: Warning Options. + * efficiency: Efficiency. + * ELF support: News. + * empty CHARACTER strings: Character Type. + * enabled intrinsics: Intrinsic Groups. + * ENCODE statement: ENCODE and DECODE. + * END DO: END DO. + * entry points: Alternate Entry Points. + * ENTRY statement: Alternate Entry Points. + * environment variables: Environment Variables. + * EOShift intrinsic: EOShift Intrinsic. + * Epsilon intrinsic: Epsilon Intrinsic. + * equivalence areas <1>: Known Bugs. + * equivalence areas: Local Equivalence Areas. + * EQUIVALENCE statement: Local Equivalence Areas. + * ErF intrinsic: ErF Intrinsic. + * ErFC intrinsic: ErFC Intrinsic. + * error messages <1>: Warnings and Errors. + * error messages: Run-time Library Errors. + * error messages, incorrect: What is GNU Fortran?. + * error values: Run-time Library Errors. + * errors, linker: Large Common Blocks. + * ETime intrinsic <1>: ETime Intrinsic (function). + * ETime intrinsic: ETime Intrinsic (subroutine). + * exceptions, floating-point: Floating-point Exception Handling. + * exclamation point <1>: LEX. + * exclamation point <2>: Exclamation Point. + * exclamation point <3>: Trailing Comment. + * exclamation point <4>: Character Set. + * exclamation point: Statements Comments Lines. + * executable file: What is GNU Fortran?. + * Exit intrinsic: Exit Intrinsic. + * EXIT statement: CYCLE and EXIT. + * Exp intrinsic: Exp Intrinsic. + * Exponent intrinsic: Exponent Intrinsic. + * extended-source option: Fortran Dialect Options. + * extensions, file name: Overall Options. + * extensions, from Fortran 90: Fortran 90 Features. + * extensions, more: More Extensions. + * extensions, VXT: VXT Fortran. + * external names: Mangling of Names. + * extra warnings: Warning Options. + * f2c: Increasing Precision/Range. + * f2c compatibility <1>: Avoid f2c Compatibility. + * f2c compatibility <2>: Block Data and Libraries. + * f2c compatibility <3>: Debugging and Interfacing. + * f2c compatibility <4>: Code Gen Options. + * f2c compatibility <5>: Shorthand Options. + * f2c compatibility: Overall Options. + * f2c intrinsics: Fortran Dialect Options. + * f2c intrinsics group: Intrinsic Groups. + * f77 compatibility: Shorthand Options. + * f77 support: Backslash in Constants. + * f771, program: What is GNU Fortran?. + * f90 intrinsics group: Intrinsic Groups. + * fatal signal: Bug Criteria. + * FDate intrinsic <1>: FDate Intrinsic (function). + * FDate intrinsic: FDate Intrinsic (subroutine). + * FDL, GNU Free Documentation License: GNU Free Documentation License. + * features, language: Direction of Language Development. + * features, ugly <1>: Distensions. + * features, ugly: Shorthand Options. + * FFE <1>: Front End. + * FFE: What is GNU Fortran?. + * fflush(): Output Assumed To Flush. + * FGet intrinsic <1>: FGet Intrinsic (function). + * FGet intrinsic: FGet Intrinsic (subroutine). + * FGetC intrinsic <1>: FGetC Intrinsic (function). + * FGetC intrinsic: FGetC Intrinsic (subroutine). + * file format not recognized: What is GNU Fortran?. + * file formats: Portable Unformatted Files. + * file name extension: Overall Options. + * file name suffix: Overall Options. + * file type: Overall Options. + * file, source <1>: Source Form. + * file, source <2>: Lines. + * file, source: What is GNU Fortran?. + * files, executable: What is GNU Fortran?. + * fixed form <1>: Source Form. + * fixed form <2>: Lines. + * fixed form: Fortran Dialect Options. + * Float intrinsic: Float Intrinsic. + * FloatI intrinsic: FloatI Intrinsic. + * floating-point errors: Floating-point Errors. + * floating-point, errors: Inconsistent Calling Sequences. + * floating-point, exceptions: Floating-point Exception Handling. + * floating-point, precision <1>: Floating-point precision. + * floating-point, precision: Optimize Options. + * FloatJ intrinsic: FloatJ Intrinsic. + * Floor intrinsic: Floor Intrinsic. + * Flush intrinsic: Flush Intrinsic. + * flushing output: Output Assumed To Flush. + * FNum intrinsic: FNum Intrinsic. + * FORM='PRINT': OPEN CLOSE and INQUIRE Keywords. + * FORMAT descriptors <1>: Fortran 90 Features. + * FORMAT descriptors: I/O. + * FORMAT statement <1>: Q Edit Descriptor. + * FORMAT statement: Expressions in FORMAT Statements. + * FORTRAN 66 <1>: Fortran Dialect Options. + * FORTRAN 66: Shorthand Options. + * FORTRAN 77 compatibility: Standard Support. + * Fortran 90: Fortran 90 Features. + * Fortran 90, compatibility: Fortran 90. + * Fortran 90, features: Fortran Dialect Options. + * Fortran 90, intrinsics: Fortran Dialect Options. + * Fortran 90, support: Fortran 90 Support. + * Fortran preprocessor: Overall Options. + * forward references: GLOBALS. + * FPE handling: Floating-point Exception Handling. + * FPut intrinsic <1>: FPut Intrinsic (function). + * FPut intrinsic: FPut Intrinsic (subroutine). + * FPutC intrinsic <1>: FPutC Intrinsic (function). + * FPutC intrinsic: FPutC Intrinsic (subroutine). + * Fraction intrinsic: Fraction Intrinsic. + * free form <1>: Source Form. + * free form <2>: Lines. + * free form: Fortran Dialect Options. + * front end, g77 <1>: Front End. + * front end, g77: What is GNU Fortran?. + * FSeek intrinsic: FSeek Intrinsic. + * FSF, funding the: Funding GNU Fortran. + * FStat intrinsic <1>: FStat Intrinsic (function). + * FStat intrinsic: FStat Intrinsic (subroutine). + * FTell intrinsic <1>: FTell Intrinsic (function). + * FTell intrinsic: FTell Intrinsic (subroutine). + * function references, in adjustable array bounds: Array Bounds Expressions. + * FUNCTION statement <1>: Functions. + * FUNCTION statement: Procedures. + * functions: Functions. + * functions, mistyped: Not My Type. + * funding improvements: Funding GNU Fortran. + * funding the FSF: Funding GNU Fortran. + * g77 options, --driver <1>: Changes. + * g77 options, --driver: News. + * g77 options, -v: G77 and GCC. + * g77, command <1>: G77 and GCC. + * g77, command: What is GNU Fortran?. + * g77, components of: What is GNU Fortran?. + * g77, front end <1>: Front End. + * g77, front end: What is GNU Fortran?. + * g77, modifying: Overall Options. + * G77_date_y2kbuggy_0: Year 2000 (Y2K) Problems. + * G77_vxtidate_y2kbuggy_0: Year 2000 (Y2K) Problems. + * GBE <1>: Philosophy of Code Generation. + * GBE: What is GNU Fortran?. + * GBEL: Philosophy of Code Generation. + * gcc, back end <1>: Philosophy of Code Generation. + * gcc, back end: What is GNU Fortran?. + * gcc, command <1>: G77 and GCC. + * gcc, command: What is GNU Fortran?. + * gcc, command as driver: What is GNU Fortran?. + * gcc, not recognizing Fortran source: What is GNU Fortran?. + * gdb, command: What is GNU Fortran?. + * gdb, support: Debugger Problems. + * generic intrinsics: Generics and Specifics. + * GError intrinsic: GError Intrinsic. + * GetArg intrinsic <1>: Main Program Unit. + * GetArg intrinsic: GetArg Intrinsic. + * GetCWD intrinsic <1>: GetCWD Intrinsic (function). + * GetCWD intrinsic: GetCWD Intrinsic (subroutine). + * GetEnv intrinsic: GetEnv Intrinsic. + * GetGId intrinsic: GetGId Intrinsic. + * GetLog intrinsic: GetLog Intrinsic. + * GetPId intrinsic: GetPId Intrinsic. + * getting started: Getting Started. + * GetUId intrinsic: GetUId Intrinsic. + * global names, warning <1>: Code Gen Options. + * global names, warning: Warning Options. + * GMTime intrinsic: GMTime Intrinsic. + * GNU Back End (GBE) <1>: Philosophy of Code Generation. + * GNU Back End (GBE): What is GNU Fortran?. + * GNU Back End Language (GBEL): Philosophy of Code Generation. + * GNU Fortran command options: Invoking G77. + * GNU Fortran Front End (FFE) <1>: Front End. + * GNU Fortran Front End (FFE): What is GNU Fortran?. + * gnu intrinsics group: Intrinsic Groups. + * GOTO statement: Assigned Statement Labels. + * groups of intrinsics: Intrinsic Groups. + * hardware errors: Signal 11 and Friends. + * hash mark: Character Set. + * HDF: Portable Unformatted Files. + * hidden intrinsics: Intrinsic Groups. + * Hollerith constants <1>: Character and Hollerith Constants. + * Hollerith constants <2>: Ugly Conversion of Initializers. + * Hollerith constants <3>: Ugly Implicit Argument Conversion. + * Hollerith constants: Fortran Dialect Options. + * horizontal tab: Tabs. + * HostNm intrinsic <1>: HostNm Intrinsic (function). + * HostNm intrinsic: HostNm Intrinsic (subroutine). + * Huge intrinsic: Huge Intrinsic. + * I/O, errors: Run-time Library Errors. + * I/O, flushing: Output Assumed To Flush. + * IAbs intrinsic: IAbs Intrinsic. + * IAChar intrinsic: IAChar Intrinsic. + * IAnd intrinsic: IAnd Intrinsic. + * IArgC intrinsic <1>: Main Program Unit. + * IArgC intrinsic: IArgC Intrinsic. + * IBClr intrinsic: IBClr Intrinsic. + * IBits intrinsic: IBits Intrinsic. + * IBSet intrinsic: IBSet Intrinsic. + * IChar intrinsic: IChar Intrinsic. + * IDate intrinsic <1>: IDate Intrinsic (VXT). + * IDate intrinsic: IDate Intrinsic (UNIX). + * IDiM intrinsic: IDiM Intrinsic. + * IDInt intrinsic: IDInt Intrinsic. + * IDNInt intrinsic: IDNInt Intrinsic. + * IEEE 754 conformance <1>: Floating-point precision. + * IEEE 754 conformance: Optimize Options. + * IEOr intrinsic: IEOr Intrinsic. + * IErrNo intrinsic: IErrNo Intrinsic. + * IFix intrinsic: IFix Intrinsic. + * IIAbs intrinsic: IIAbs Intrinsic. + * IIAnd intrinsic: IIAnd Intrinsic. + * IIBClr intrinsic: IIBClr Intrinsic. + * IIBits intrinsic: IIBits Intrinsic. + * IIBSet intrinsic: IIBSet Intrinsic. + * IIDiM intrinsic: IIDiM Intrinsic. + * IIDInt intrinsic: IIDInt Intrinsic. + * IIDNnt intrinsic: IIDNnt Intrinsic. + * IIEOr intrinsic: IIEOr Intrinsic. + * IIFix intrinsic: IIFix Intrinsic. + * IInt intrinsic: IInt Intrinsic. + * IIOr intrinsic: IIOr Intrinsic. + * IIQint intrinsic: IIQint Intrinsic. + * IIQNnt intrinsic: IIQNnt Intrinsic. + * IIShftC intrinsic: IIShftC Intrinsic. + * IISign intrinsic: IISign Intrinsic. + * illegal unit number: Large File Unit Numbers. + * Imag intrinsic: Imag Intrinsic. + * imaginary part <1>: Complex Variables. + * imaginary part: Ugly Complex Part Extraction. + * ImagPart intrinsic: ImagPart Intrinsic. + * IMax0 intrinsic: IMax0 Intrinsic. + * IMax1 intrinsic: IMax1 Intrinsic. + * IMin0 intrinsic: IMin0 Intrinsic. + * IMin1 intrinsic: IMin1 Intrinsic. + * IMod intrinsic: IMod Intrinsic. + * IMPLICIT CHARACTER*(*) statement: Limitation on Implicit Declarations. + * implicit declaration, warning: Warning Options. + * IMPLICIT NONE, similar effect: Warning Options. + * implicit typing: Not My Type. + * improvements, funding: Funding GNU Fortran. + * in-line code <1>: GLOBALS. + * in-line code <2>: Code Gen Options. + * in-line code <3>: Optimize Options. + * in-line code: What is GNU Fortran?. + * INCLUDE directive <1>: Bug Reporting. + * INCLUDE directive <2>: INCLUDE. + * INCLUDE directive <3>: Directory Options. + * INCLUDE directive: Preprocessor Options. + * included files: Bug Reporting. + * inclusion, directory search paths for: Directory Options. + * inconsistent floating-point results: Floating-point Errors. + * incorrect diagnostics: What is GNU Fortran?. + * incorrect error messages: What is GNU Fortran?. + * incorrect use of language: What is GNU Fortran?. + * increasing maximum unit number: Large File Unit Numbers. + * increasing precision: Increasing Precision/Range. + * increasing range: Increasing Precision/Range. + * Index intrinsic: Index Intrinsic. + * indexed (iterative) DO: Optimize Options. + * infinite spaces printed: Strange Behavior at Run Time. + * INInt intrinsic: INInt Intrinsic. + * initialization, bug: Known Bugs. + * initialization, of local variables: Code Gen Options. + * initialization, run-time: Startup Code. + * initialization, statement placement: Initializing Before Specifying. + * INot intrinsic: INot Intrinsic. + * INQUIRE statement: OPEN CLOSE and INQUIRE Keywords. + * installation trouble: Trouble. + * Int intrinsic: Int Intrinsic. + * Int2 intrinsic: Int2 Intrinsic. + * Int8 intrinsic: Int8 Intrinsic. + * integer constants: Known Bugs. + * INTEGER(KIND=1) type: Compiler Types. + * INTEGER(KIND=2) type: Compiler Types. + * INTEGER(KIND=3) type: Compiler Types. + * INTEGER(KIND=6) type: Compiler Types. + * INTEGER*2 support: Popular Non-standard Types. + * INTEGER*8 support: Full Support for Compiler Types. + * Intel x86: News. + * interfacing: Debugging and Interfacing. + * internal consistency checks: Overall Options. + * intrinsics, Abort: Abort Intrinsic. + * intrinsics, Abs: Abs Intrinsic. + * intrinsics, Access: Access Intrinsic. + * intrinsics, AChar: AChar Intrinsic. + * intrinsics, ACos: ACos Intrinsic. + * intrinsics, ACosD: ACosD Intrinsic. + * intrinsics, AdjustL: AdjustL Intrinsic. + * intrinsics, AdjustR: AdjustR Intrinsic. + * intrinsics, AImag <1>: AImag Intrinsic. + * intrinsics, AImag: REAL() and AIMAG() of Complex. + * intrinsics, AIMax0: AIMax0 Intrinsic. + * intrinsics, AIMin0: AIMin0 Intrinsic. + * intrinsics, AInt: AInt Intrinsic. + * intrinsics, AJMax0: AJMax0 Intrinsic. + * intrinsics, AJMin0: AJMin0 Intrinsic. + * intrinsics, Alarm: Alarm Intrinsic. + * intrinsics, All: All Intrinsic. + * intrinsics, Allocated: Allocated Intrinsic. + * intrinsics, ALog: ALog Intrinsic. + * intrinsics, ALog10: ALog10 Intrinsic. + * intrinsics, AMax0: AMax0 Intrinsic. + * intrinsics, AMax1: AMax1 Intrinsic. + * intrinsics, AMin0: AMin0 Intrinsic. + * intrinsics, AMin1: AMin1 Intrinsic. + * intrinsics, AMod: AMod Intrinsic. + * intrinsics, And <1>: Bit Operations on Floating-point Data. + * intrinsics, And: And Intrinsic. + * intrinsics, ANInt: ANInt Intrinsic. + * intrinsics, Any: Any Intrinsic. + * intrinsics, ASin: ASin Intrinsic. + * intrinsics, ASinD: ASinD Intrinsic. + * intrinsics, Associated: Associated Intrinsic. + * intrinsics, ATan: ATan Intrinsic. + * intrinsics, ATan2: ATan2 Intrinsic. + * intrinsics, ATan2D: ATan2D Intrinsic. + * intrinsics, ATanD: ATanD Intrinsic. + * intrinsics, badu77: Fortran Dialect Options. + * intrinsics, BesJ0: BesJ0 Intrinsic. + * intrinsics, BesJ1: BesJ1 Intrinsic. + * intrinsics, BesJN: BesJN Intrinsic. + * intrinsics, BesY0: BesY0 Intrinsic. + * intrinsics, BesY1: BesY1 Intrinsic. + * intrinsics, BesYN: BesYN Intrinsic. + * intrinsics, Bit_Size: Bit_Size Intrinsic. + * intrinsics, BITest: BITest Intrinsic. + * intrinsics, BJTest: BJTest Intrinsic. + * intrinsics, BTest: BTest Intrinsic. + * intrinsics, CAbs: CAbs Intrinsic. + * intrinsics, CCos: CCos Intrinsic. + * intrinsics, CDAbs: CDAbs Intrinsic. + * intrinsics, CDCos: CDCos Intrinsic. + * intrinsics, CDExp: CDExp Intrinsic. + * intrinsics, CDLog: CDLog Intrinsic. + * intrinsics, CDSin: CDSin Intrinsic. + * intrinsics, CDSqRt: CDSqRt Intrinsic. + * intrinsics, Ceiling: Ceiling Intrinsic. + * intrinsics, CExp: CExp Intrinsic. + * intrinsics, Char: Char Intrinsic. + * intrinsics, ChDir <1>: ChDir Intrinsic (function). + * intrinsics, ChDir: ChDir Intrinsic (subroutine). + * intrinsics, ChMod <1>: ChMod Intrinsic (function). + * intrinsics, ChMod: ChMod Intrinsic (subroutine). + * intrinsics, CLog: CLog Intrinsic. + * intrinsics, Cmplx <1>: Cmplx Intrinsic. + * intrinsics, Cmplx: CMPLX() of DOUBLE PRECISION. + * intrinsics, Complex: Complex Intrinsic. + * intrinsics, COMPLEX: Fortran Dialect Options. + * intrinsics, Conjg: Conjg Intrinsic. + * intrinsics, context-sensitive: Context-Sensitive Intrinsicness. + * intrinsics, Cos: Cos Intrinsic. + * intrinsics, CosD: CosD Intrinsic. + * intrinsics, CosH: CosH Intrinsic. + * intrinsics, Count: Count Intrinsic. + * intrinsics, CPU_Time: CPU_Time Intrinsic. + * intrinsics, CShift: CShift Intrinsic. + * intrinsics, CSin: CSin Intrinsic. + * intrinsics, CSqRt: CSqRt Intrinsic. + * intrinsics, CTime <1>: CTime Intrinsic (function). + * intrinsics, CTime: CTime Intrinsic (subroutine). + * intrinsics, DAbs: DAbs Intrinsic. + * intrinsics, DACos: DACos Intrinsic. + * intrinsics, DACosD: DACosD Intrinsic. + * intrinsics, DASin: DASin Intrinsic. + * intrinsics, DASinD: DASinD Intrinsic. + * intrinsics, DATan: DATan Intrinsic. + * intrinsics, DATan2: DATan2 Intrinsic. + * intrinsics, DATan2D: DATan2D Intrinsic. + * intrinsics, DATanD: DATanD Intrinsic. + * intrinsics, Date: Date Intrinsic. + * intrinsics, Date_and_Time: Date_and_Time Intrinsic. + * intrinsics, DbesJ0: DbesJ0 Intrinsic. + * intrinsics, DbesJ1: DbesJ1 Intrinsic. + * intrinsics, DbesJN: DbesJN Intrinsic. + * intrinsics, DbesY0: DbesY0 Intrinsic. + * intrinsics, DbesY1: DbesY1 Intrinsic. + * intrinsics, DbesYN: DbesYN Intrinsic. + * intrinsics, Dble: Dble Intrinsic. + * intrinsics, DbleQ: DbleQ Intrinsic. + * intrinsics, DCmplx: DCmplx Intrinsic. + * intrinsics, DConjg: DConjg Intrinsic. + * intrinsics, DCos: DCos Intrinsic. + * intrinsics, DCosD: DCosD Intrinsic. + * intrinsics, DCosH: DCosH Intrinsic. + * intrinsics, DDiM: DDiM Intrinsic. + * intrinsics, deleted: Intrinsic Groups. + * intrinsics, DErF: DErF Intrinsic. + * intrinsics, DErFC: DErFC Intrinsic. + * intrinsics, DExp: DExp Intrinsic. + * intrinsics, DFloat: DFloat Intrinsic. + * intrinsics, DFlotI: DFlotI Intrinsic. + * intrinsics, DFlotJ: DFlotJ Intrinsic. + * intrinsics, Digits: Digits Intrinsic. + * intrinsics, DiM: DiM Intrinsic. + * intrinsics, DImag: DImag Intrinsic. + * intrinsics, DInt: DInt Intrinsic. + * intrinsics, disabled: Intrinsic Groups. + * intrinsics, DLog: DLog Intrinsic. + * intrinsics, DLog10: DLog10 Intrinsic. + * intrinsics, DMax1: DMax1 Intrinsic. + * intrinsics, DMin1: DMin1 Intrinsic. + * intrinsics, DMod: DMod Intrinsic. + * intrinsics, DNInt: DNInt Intrinsic. + * intrinsics, Dot_Product: Dot_Product Intrinsic. + * intrinsics, DProd: DProd Intrinsic. + * intrinsics, DReal: DReal Intrinsic. + * intrinsics, DSign: DSign Intrinsic. + * intrinsics, DSin: DSin Intrinsic. + * intrinsics, DSinD: DSinD Intrinsic. + * intrinsics, DSinH: DSinH Intrinsic. + * intrinsics, DSqRt: DSqRt Intrinsic. + * intrinsics, DTan: DTan Intrinsic. + * intrinsics, DTanD: DTanD Intrinsic. + * intrinsics, DTanH: DTanH Intrinsic. + * intrinsics, DTime <1>: DTime Intrinsic (function). + * intrinsics, DTime: DTime Intrinsic (subroutine). + * intrinsics, enabled: Intrinsic Groups. + * intrinsics, EOShift: EOShift Intrinsic. + * intrinsics, Epsilon: Epsilon Intrinsic. + * intrinsics, ErF: ErF Intrinsic. + * intrinsics, ErFC: ErFC Intrinsic. + * intrinsics, ETime <1>: ETime Intrinsic (function). + * intrinsics, ETime: ETime Intrinsic (subroutine). + * intrinsics, Exit: Exit Intrinsic. + * intrinsics, Exp: Exp Intrinsic. + * intrinsics, Exponent: Exponent Intrinsic. + * intrinsics, f2c: Fortran Dialect Options. + * intrinsics, FDate <1>: FDate Intrinsic (function). + * intrinsics, FDate: FDate Intrinsic (subroutine). + * intrinsics, FGet <1>: FGet Intrinsic (function). + * intrinsics, FGet: FGet Intrinsic (subroutine). + * intrinsics, FGetC <1>: FGetC Intrinsic (function). + * intrinsics, FGetC: FGetC Intrinsic (subroutine). + * intrinsics, Float: Float Intrinsic. + * intrinsics, FloatI: FloatI Intrinsic. + * intrinsics, FloatJ: FloatJ Intrinsic. + * intrinsics, Floor: Floor Intrinsic. + * intrinsics, Flush: Flush Intrinsic. + * intrinsics, FNum: FNum Intrinsic. + * intrinsics, Fortran 90: Fortran Dialect Options. + * intrinsics, FPut <1>: FPut Intrinsic (function). + * intrinsics, FPut: FPut Intrinsic (subroutine). + * intrinsics, FPutC <1>: FPutC Intrinsic (function). + * intrinsics, FPutC: FPutC Intrinsic (subroutine). + * intrinsics, Fraction: Fraction Intrinsic. + * intrinsics, FSeek: FSeek Intrinsic. + * intrinsics, FStat <1>: FStat Intrinsic (function). + * intrinsics, FStat: FStat Intrinsic (subroutine). + * intrinsics, FTell <1>: FTell Intrinsic (function). + * intrinsics, FTell: FTell Intrinsic (subroutine). + * intrinsics, generic: Generics and Specifics. + * intrinsics, GError: GError Intrinsic. + * intrinsics, GetArg <1>: Main Program Unit. + * intrinsics, GetArg: GetArg Intrinsic. + * intrinsics, GetCWD <1>: GetCWD Intrinsic (function). + * intrinsics, GetCWD: GetCWD Intrinsic (subroutine). + * intrinsics, GetEnv: GetEnv Intrinsic. + * intrinsics, GetGId: GetGId Intrinsic. + * intrinsics, GetLog: GetLog Intrinsic. + * intrinsics, GetPId: GetPId Intrinsic. + * intrinsics, GetUId: GetUId Intrinsic. + * intrinsics, GMTime: GMTime Intrinsic. + * intrinsics, groups: Intrinsic Groups. + * intrinsics, groups of: Intrinsic Groups. + * intrinsics, hidden: Intrinsic Groups. + * intrinsics, HostNm <1>: HostNm Intrinsic (function). + * intrinsics, HostNm: HostNm Intrinsic (subroutine). + * intrinsics, Huge: Huge Intrinsic. + * intrinsics, IAbs: IAbs Intrinsic. + * intrinsics, IAChar: IAChar Intrinsic. + * intrinsics, IAnd: IAnd Intrinsic. + * intrinsics, IArgC <1>: Main Program Unit. + * intrinsics, IArgC: IArgC Intrinsic. + * intrinsics, IBClr: IBClr Intrinsic. + * intrinsics, IBits: IBits Intrinsic. + * intrinsics, IBSet: IBSet Intrinsic. + * intrinsics, IChar: IChar Intrinsic. + * intrinsics, IDate <1>: IDate Intrinsic (VXT). + * intrinsics, IDate: IDate Intrinsic (UNIX). + * intrinsics, IDiM: IDiM Intrinsic. + * intrinsics, IDInt: IDInt Intrinsic. + * intrinsics, IDNInt: IDNInt Intrinsic. + * intrinsics, IEOr: IEOr Intrinsic. + * intrinsics, IErrNo: IErrNo Intrinsic. + * intrinsics, IFix: IFix Intrinsic. + * intrinsics, IIAbs: IIAbs Intrinsic. + * intrinsics, IIAnd: IIAnd Intrinsic. + * intrinsics, IIBClr: IIBClr Intrinsic. + * intrinsics, IIBits: IIBits Intrinsic. + * intrinsics, IIBSet: IIBSet Intrinsic. + * intrinsics, IIDiM: IIDiM Intrinsic. + * intrinsics, IIDInt: IIDInt Intrinsic. + * intrinsics, IIDNnt: IIDNnt Intrinsic. + * intrinsics, IIEOr: IIEOr Intrinsic. + * intrinsics, IIFix: IIFix Intrinsic. + * intrinsics, IInt: IInt Intrinsic. + * intrinsics, IIOr: IIOr Intrinsic. + * intrinsics, IIQint: IIQint Intrinsic. + * intrinsics, IIQNnt: IIQNnt Intrinsic. + * intrinsics, IIShftC: IIShftC Intrinsic. + * intrinsics, IISign: IISign Intrinsic. + * intrinsics, Imag: Imag Intrinsic. + * intrinsics, ImagPart: ImagPart Intrinsic. + * intrinsics, IMax0: IMax0 Intrinsic. + * intrinsics, IMax1: IMax1 Intrinsic. + * intrinsics, IMin0: IMin0 Intrinsic. + * intrinsics, IMin1: IMin1 Intrinsic. + * intrinsics, IMod: IMod Intrinsic. + * intrinsics, Index: Index Intrinsic. + * intrinsics, INInt: INInt Intrinsic. + * intrinsics, INot: INot Intrinsic. + * intrinsics, Int: Int Intrinsic. + * intrinsics, Int2: Int2 Intrinsic. + * intrinsics, Int8: Int8 Intrinsic. + * intrinsics, IOr: IOr Intrinsic. + * intrinsics, IRand: IRand Intrinsic. + * intrinsics, IsaTty: IsaTty Intrinsic. + * intrinsics, IShft: IShft Intrinsic. + * intrinsics, IShftC: IShftC Intrinsic. + * intrinsics, ISign: ISign Intrinsic. + * intrinsics, ITime: ITime Intrinsic. + * intrinsics, IZExt: IZExt Intrinsic. + * intrinsics, JIAbs: JIAbs Intrinsic. + * intrinsics, JIAnd: JIAnd Intrinsic. + * intrinsics, JIBClr: JIBClr Intrinsic. + * intrinsics, JIBits: JIBits Intrinsic. + * intrinsics, JIBSet: JIBSet Intrinsic. + * intrinsics, JIDiM: JIDiM Intrinsic. + * intrinsics, JIDInt: JIDInt Intrinsic. + * intrinsics, JIDNnt: JIDNnt Intrinsic. + * intrinsics, JIEOr: JIEOr Intrinsic. + * intrinsics, JIFix: JIFix Intrinsic. + * intrinsics, JInt: JInt Intrinsic. + * intrinsics, JIOr: JIOr Intrinsic. + * intrinsics, JIQint: JIQint Intrinsic. + * intrinsics, JIQNnt: JIQNnt Intrinsic. + * intrinsics, JIShft: JIShft Intrinsic. + * intrinsics, JIShftC: JIShftC Intrinsic. + * intrinsics, JISign: JISign Intrinsic. + * intrinsics, JMax0: JMax0 Intrinsic. + * intrinsics, JMax1: JMax1 Intrinsic. + * intrinsics, JMin0: JMin0 Intrinsic. + * intrinsics, JMin1: JMin1 Intrinsic. + * intrinsics, JMod: JMod Intrinsic. + * intrinsics, JNInt: JNInt Intrinsic. + * intrinsics, JNot: JNot Intrinsic. + * intrinsics, JZExt: JZExt Intrinsic. + * intrinsics, Kill <1>: Kill Intrinsic (function). + * intrinsics, Kill: Kill Intrinsic (subroutine). + * intrinsics, Kind: Kind Intrinsic. + * intrinsics, LBound: LBound Intrinsic. + * intrinsics, Len: Len Intrinsic. + * intrinsics, Len_Trim: Len_Trim Intrinsic. + * intrinsics, LGe: LGe Intrinsic. + * intrinsics, LGt: LGt Intrinsic. + * intrinsics, Link <1>: Link Intrinsic (function). + * intrinsics, Link: Link Intrinsic (subroutine). + * intrinsics, LLe: LLe Intrinsic. + * intrinsics, LLt: LLt Intrinsic. + * intrinsics, LnBlnk: LnBlnk Intrinsic. + * intrinsics, Loc: Loc Intrinsic. + * intrinsics, Log: Log Intrinsic. + * intrinsics, Log10: Log10 Intrinsic. + * intrinsics, Logical: Logical Intrinsic. + * intrinsics, Long: Long Intrinsic. + * intrinsics, LShift: LShift Intrinsic. + * intrinsics, LStat <1>: LStat Intrinsic (function). + * intrinsics, LStat: LStat Intrinsic (subroutine). + * intrinsics, LTime: LTime Intrinsic. + * intrinsics, MatMul: MatMul Intrinsic. + * intrinsics, Max: Max Intrinsic. + * intrinsics, Max0: Max0 Intrinsic. + * intrinsics, Max1: Max1 Intrinsic. + * intrinsics, MaxExponent: MaxExponent Intrinsic. + * intrinsics, MaxLoc: MaxLoc Intrinsic. + * intrinsics, MaxVal: MaxVal Intrinsic. + * intrinsics, MClock: MClock Intrinsic. + * intrinsics, MClock8: MClock8 Intrinsic. + * intrinsics, Merge: Merge Intrinsic. + * intrinsics, MIL-STD 1753: Fortran Dialect Options. + * intrinsics, Min: Min Intrinsic. + * intrinsics, Min0: Min0 Intrinsic. + * intrinsics, Min1: Min1 Intrinsic. + * intrinsics, MinExponent: MinExponent Intrinsic. + * intrinsics, MinLoc: MinLoc Intrinsic. + * intrinsics, MinVal: MinVal Intrinsic. + * intrinsics, Mod: Mod Intrinsic. + * intrinsics, Modulo: Modulo Intrinsic. + * intrinsics, MvBits: MvBits Intrinsic. + * intrinsics, Nearest: Nearest Intrinsic. + * intrinsics, NInt: NInt Intrinsic. + * intrinsics, Not: Not Intrinsic. + * intrinsics, Or <1>: Bit Operations on Floating-point Data. + * intrinsics, Or: Or Intrinsic. + * intrinsics, others: Other Intrinsics. + * intrinsics, Pack: Pack Intrinsic. + * intrinsics, PError: PError Intrinsic. + * intrinsics, Precision: Precision Intrinsic. + * intrinsics, Present: Present Intrinsic. + * intrinsics, Product: Product Intrinsic. + * intrinsics, QAbs: QAbs Intrinsic. + * intrinsics, QACos: QACos Intrinsic. + * intrinsics, QACosD: QACosD Intrinsic. + * intrinsics, QASin: QASin Intrinsic. + * intrinsics, QASinD: QASinD Intrinsic. + * intrinsics, QATan: QATan Intrinsic. + * intrinsics, QATan2: QATan2 Intrinsic. + * intrinsics, QATan2D: QATan2D Intrinsic. + * intrinsics, QATanD: QATanD Intrinsic. + * intrinsics, QCos: QCos Intrinsic. + * intrinsics, QCosD: QCosD Intrinsic. + * intrinsics, QCosH: QCosH Intrinsic. + * intrinsics, QDiM: QDiM Intrinsic. + * intrinsics, QExp: QExp Intrinsic. + * intrinsics, QExt: QExt Intrinsic. + * intrinsics, QExtD: QExtD Intrinsic. + * intrinsics, QFloat: QFloat Intrinsic. + * intrinsics, QInt: QInt Intrinsic. + * intrinsics, QLog: QLog Intrinsic. + * intrinsics, QLog10: QLog10 Intrinsic. + * intrinsics, QMax1: QMax1 Intrinsic. + * intrinsics, QMin1: QMin1 Intrinsic. + * intrinsics, QMod: QMod Intrinsic. + * intrinsics, QNInt: QNInt Intrinsic. + * intrinsics, QSin: QSin Intrinsic. + * intrinsics, QSinD: QSinD Intrinsic. + * intrinsics, QSinH: QSinH Intrinsic. + * intrinsics, QSqRt: QSqRt Intrinsic. + * intrinsics, QTan: QTan Intrinsic. + * intrinsics, QTanD: QTanD Intrinsic. + * intrinsics, QTanH: QTanH Intrinsic. + * intrinsics, Radix: Radix Intrinsic. + * intrinsics, Rand: Rand Intrinsic. + * intrinsics, Random_Number: Random_Number Intrinsic. + * intrinsics, Random_Seed: Random_Seed Intrinsic. + * intrinsics, Range: Range Intrinsic. + * intrinsics, Real <1>: Real Intrinsic. + * intrinsics, Real: REAL() and AIMAG() of Complex. + * intrinsics, RealPart: RealPart Intrinsic. + * intrinsics, Rename <1>: Rename Intrinsic (function). + * intrinsics, Rename: Rename Intrinsic (subroutine). + * intrinsics, Repeat: Repeat Intrinsic. + * intrinsics, Reshape: Reshape Intrinsic. + * intrinsics, RRSpacing: RRSpacing Intrinsic. + * intrinsics, RShift: RShift Intrinsic. + * intrinsics, Scale: Scale Intrinsic. + * intrinsics, Scan: Scan Intrinsic. + * intrinsics, Secnds: Secnds Intrinsic. + * intrinsics, Second <1>: Second Intrinsic (subroutine). + * intrinsics, Second: Second Intrinsic (function). + * intrinsics, Selected_Int_Kind: Selected_Int_Kind Intrinsic. + * intrinsics, Selected_Real_Kind: Selected_Real_Kind Intrinsic. + * intrinsics, Set_Exponent: Set_Exponent Intrinsic. + * intrinsics, Shape: Shape Intrinsic. + * intrinsics, Shift: Bit Operations on Floating-point Data. + * intrinsics, Short: Short Intrinsic. + * intrinsics, Sign: Sign Intrinsic. + * intrinsics, Signal <1>: Signal Intrinsic (function). + * intrinsics, Signal: Signal Intrinsic (subroutine). + * intrinsics, Sin: Sin Intrinsic. + * intrinsics, SinD: SinD Intrinsic. + * intrinsics, SinH: SinH Intrinsic. + * intrinsics, Sleep: Sleep Intrinsic. + * intrinsics, Sngl: Sngl Intrinsic. + * intrinsics, SnglQ: SnglQ Intrinsic. + * intrinsics, Spacing: Spacing Intrinsic. + * intrinsics, Spread: Spread Intrinsic. + * intrinsics, SqRt: SqRt Intrinsic. + * intrinsics, SRand: SRand Intrinsic. + * intrinsics, Stat <1>: Stat Intrinsic (function). + * intrinsics, Stat: Stat Intrinsic (subroutine). + * intrinsics, Sum: Sum Intrinsic. + * intrinsics, SymLnk <1>: SymLnk Intrinsic (function). + * intrinsics, SymLnk: SymLnk Intrinsic (subroutine). + * intrinsics, System <1>: System Intrinsic (function). + * intrinsics, System: System Intrinsic (subroutine). + * intrinsics, System_Clock: System_Clock Intrinsic. + * intrinsics, table of: Table of Intrinsic Functions. + * intrinsics, Tan: Tan Intrinsic. + * intrinsics, TanD: TanD Intrinsic. + * intrinsics, TanH: TanH Intrinsic. + * intrinsics, Time <1>: Time Intrinsic (VXT). + * intrinsics, Time: Time Intrinsic (UNIX). + * intrinsics, Time8: Time8 Intrinsic. + * intrinsics, Tiny: Tiny Intrinsic. + * intrinsics, Transfer: Transfer Intrinsic. + * intrinsics, Transpose: Transpose Intrinsic. + * intrinsics, Trim: Trim Intrinsic. + * intrinsics, TtyNam <1>: TtyNam Intrinsic (function). + * intrinsics, TtyNam: TtyNam Intrinsic (subroutine). + * intrinsics, UBound: UBound Intrinsic. + * intrinsics, UMask <1>: UMask Intrinsic (function). + * intrinsics, UMask: UMask Intrinsic (subroutine). + * intrinsics, UNIX: Fortran Dialect Options. + * intrinsics, Unlink <1>: Unlink Intrinsic (function). + * intrinsics, Unlink: Unlink Intrinsic (subroutine). + * intrinsics, Unpack: Unpack Intrinsic. + * intrinsics, Verify: Verify Intrinsic. + * intrinsics, VXT: Fortran Dialect Options. + * intrinsics, XOr: XOr Intrinsic. + * intrinsics, ZAbs: ZAbs Intrinsic. + * intrinsics, ZCos: ZCos Intrinsic. + * intrinsics, ZExp: ZExp Intrinsic. + * intrinsics, ZExt: ZExt Intrinsic. + * intrinsics, ZLog: ZLog Intrinsic. + * intrinsics, ZSin: ZSin Intrinsic. + * intrinsics, ZSqRt: ZSqRt Intrinsic. + * Introduction: Top. + * invalid assembly code: Bug Criteria. + * invalid input: Bug Criteria. + * IOr intrinsic: IOr Intrinsic. + * IOSTAT=: Run-time Library Errors. + * IRand intrinsic: IRand Intrinsic. + * IsaTty intrinsic: IsaTty Intrinsic. + * IShft intrinsic: IShft Intrinsic. + * IShftC intrinsic: IShftC Intrinsic. + * ISign intrinsic: ISign Intrinsic. + * iterative DO: Optimize Options. + * ITime intrinsic: ITime Intrinsic. + * ix86 floating-point: Floating-point precision. + * ix86 FPU stack: Inconsistent Calling Sequences. + * IZExt intrinsic: IZExt Intrinsic. + * JCB002 program: Generics and Specifics. + * JCB003 program: CMPAMBIG. + * JIAbs intrinsic: JIAbs Intrinsic. + * JIAnd intrinsic: JIAnd Intrinsic. + * JIBClr intrinsic: JIBClr Intrinsic. + * JIBits intrinsic: JIBits Intrinsic. + * JIBSet intrinsic: JIBSet Intrinsic. + * JIDiM intrinsic: JIDiM Intrinsic. + * JIDInt intrinsic: JIDInt Intrinsic. + * JIDNnt intrinsic: JIDNnt Intrinsic. + * JIEOr intrinsic: JIEOr Intrinsic. + * JIFix intrinsic: JIFix Intrinsic. + * JInt intrinsic: JInt Intrinsic. + * JIOr intrinsic: JIOr Intrinsic. + * JIQint intrinsic: JIQint Intrinsic. + * JIQNnt intrinsic: JIQNnt Intrinsic. + * JIShft intrinsic: JIShft Intrinsic. + * JIShftC intrinsic: JIShftC Intrinsic. + * JISign intrinsic: JISign Intrinsic. + * JMax0 intrinsic: JMax0 Intrinsic. + * JMax1 intrinsic: JMax1 Intrinsic. + * JMin0 intrinsic: JMin0 Intrinsic. + * JMin1 intrinsic: JMin1 Intrinsic. + * JMod intrinsic: JMod Intrinsic. + * JNInt intrinsic: JNInt Intrinsic. + * JNot intrinsic: JNot Intrinsic. + * JZExt intrinsic: JZExt Intrinsic. + * keywords, RECURSIVE: RECURSIVE Keyword. + * Kill intrinsic <1>: Kill Intrinsic (function). + * Kill intrinsic: Kill Intrinsic (subroutine). + * Kind intrinsic: Kind Intrinsic. + * KIND= notation: Kind Notation. + * known causes of trouble: Trouble. + * lack of recursion: RECURSIVE Keyword. + * language, dialect options: Fortran Dialect Options. + * language, features: Direction of Language Development. + * language, incorrect use of: What is GNU Fortran?. + * large aggregate areas: Known Bugs. + * large common blocks: Large Common Blocks. + * layout of COMMON blocks: Aligned Data. + * LBound intrinsic: LBound Intrinsic. + * ld command: What is GNU Fortran?. + * ld, can't find _main: Cannot Link Fortran Programs. + * ld, can't find strange names: Cannot Link Fortran Programs. + * ld, error linking user code: Cannot Link Fortran Programs. + * ld, errors: Large Common Blocks. + * left angle: Character Set. + * left bracket: Character Set. + * legacy code: Collected Fortran Wisdom. + * Len intrinsic: Len Intrinsic. + * Len_Trim intrinsic: Len_Trim Intrinsic. + * length of source lines: Fortran Dialect Options. + * letters, lowercase: Case Sensitivity. + * letters, uppercase: Case Sensitivity. + * LGe intrinsic: LGe Intrinsic. + * LGt intrinsic: LGt Intrinsic. + * libc, non-ANSI or non-default: Strange Behavior at Run Time. + * libf2c library: What is GNU Fortran?. + * libg2c library: What is GNU Fortran?. + * libraries: What is GNU Fortran?. + * libraries, containing BLOCK DATA: Block Data and Libraries. + * libraries, libf2c: What is GNU Fortran?. + * libraries, libg2c: What is GNU Fortran?. + * limits, array dimensions: Compiler Limits. + * limits, array size: Array Size. + * limits, compiler: Compiler Limits. + * limits, continuation lines <1>: Compiler Limits. + * limits, continuation lines: Continuation Line. + * limits, lengths of names <1>: Compiler Limits. + * limits, lengths of names: Syntactic Items. + * limits, lengths of source lines: Fortran Dialect Options. + * limits, multi-dimension arrays: Array Size. + * limits, on character-variable length: Character-variable Length. + * limits, rank: Compiler Limits. + * limits, run-time library: Run-time Environment Limits. + * limits, timings <1>: Secnds Intrinsic. + * limits, timings <2>: DTime Intrinsic (function). + * limits, timings <3>: Time8 Intrinsic. + * limits, timings <4>: Time Intrinsic (UNIX). + * limits, timings <5>: System_Clock Intrinsic. + * limits, timings <6>: Second Intrinsic (subroutine). + * limits, timings <7>: Second Intrinsic (function). + * limits, timings <8>: MClock8 Intrinsic. + * limits, timings <9>: MClock Intrinsic. + * limits, timings <10>: ETime Intrinsic (function). + * limits, timings <11>: ETime Intrinsic (subroutine). + * limits, timings <12>: DTime Intrinsic (subroutine). + * limits, timings: CPU_Time Intrinsic. + * limits, Y10K <1>: Time Intrinsic (VXT). + * limits, Y10K <2>: IDate Intrinsic (UNIX). + * limits, Y10K <3>: FDate Intrinsic (function). + * limits, Y10K <4>: FDate Intrinsic (subroutine). + * limits, Y10K: Date_and_Time Intrinsic. + * limits, Y2K: IDate Intrinsic (VXT). + * lines: Lines. + * lines, continuation: Continuation Line. + * lines, length: Fortran Dialect Options. + * lines, long: Long Lines. + * lines, short: Short Lines. + * Link intrinsic <1>: Link Intrinsic (function). + * Link intrinsic: Link Intrinsic (subroutine). + * linking: What is GNU Fortran?. + * linking against non-standard library: Strange Behavior at Run Time. + * linking error for user code: Cannot Link Fortran Programs. + * linking error, user code: Cannot Link Fortran Programs. + * linking with C: Interoperating with C and C++. + * linking, errors: Large Common Blocks. + * LLe intrinsic: LLe Intrinsic. + * LLt intrinsic: LLt Intrinsic. + * LnBlnk intrinsic: LnBlnk Intrinsic. + * Loc intrinsic: Loc Intrinsic. + * local equivalence areas: Local Equivalence Areas. + * Log intrinsic: Log Intrinsic. + * Log10 intrinsic: Log10 Intrinsic. + * logical expressions, comparing: Equivalence Versus Equality. + * Logical intrinsic: Logical Intrinsic. + * LOGICAL(KIND=1) type: Compiler Types. + * LOGICAL(KIND=2) type: Compiler Types. + * LOGICAL(KIND=3) type: Compiler Types. + * LOGICAL(KIND=6) type: Compiler Types. + * LOGICAL*1 support: Popular Non-standard Types. + * Long intrinsic: Long Intrinsic. + * long source lines: Long Lines. + * long time: Timer Wraparounds. + * loops, optimizing: Optimize Options. + * loops, speeding up: Optimize Options. + * loops, unrolling: Optimize Options. + * lowercase letters: Case Sensitivity. + * LShift intrinsic: LShift Intrinsic. + * LStat intrinsic <1>: LStat Intrinsic (function). + * LStat intrinsic: LStat Intrinsic (subroutine). + * LTime intrinsic: LTime Intrinsic. + * machine code: What is GNU Fortran?. + * macro options: Shorthand Options. + * main program unit, debugging: Main Program Unit. + * main(): Main Program Unit. + * MAIN__(): Main Program Unit. + * Makefile example: Bug Criteria. + * MAP statement: STRUCTURE UNION RECORD MAP. + * MatMul intrinsic: MatMul Intrinsic. + * Max intrinsic: Max Intrinsic. + * Max0 intrinsic: Max0 Intrinsic. + * Max1 intrinsic: Max1 Intrinsic. + * MaxExponent intrinsic: MaxExponent Intrinsic. + * maximum number of dimensions: Compiler Limits. + * maximum rank: Compiler Limits. + * maximum unit number: Large File Unit Numbers. + * MaxLoc intrinsic: MaxLoc Intrinsic. + * MaxVal intrinsic: MaxVal Intrinsic. + * MClock intrinsic: MClock Intrinsic. + * MClock8 intrinsic: MClock8 Intrinsic. + * memory usage, of compiler: Known Bugs. + * Merge intrinsic: Merge Intrinsic. + * messages, run-time: Run-time Library Errors. + * messages, warning: Warning Options. + * messages, warning and error: Warnings and Errors. + * mil intrinsics group: Intrinsic Groups. + * MIL-STD 1753 <1>: MIL-STD 1753. + * MIL-STD 1753 <2>: END DO. + * MIL-STD 1753 <3>: DO WHILE. + * MIL-STD 1753: Fortran Dialect Options. + * Min intrinsic: Min Intrinsic. + * Min0 intrinsic: Min0 Intrinsic. + * Min1 intrinsic: Min1 Intrinsic. + * MinExponent intrinsic: MinExponent Intrinsic. + * MinLoc intrinsic: MinLoc Intrinsic. + * MinVal intrinsic: MinVal Intrinsic. + * mistakes: What is GNU Fortran?. + * mistyped functions: Not My Type. + * mistyped variables: Not My Type. + * Mod intrinsic: Mod Intrinsic. + * modifying g77: Overall Options. + * Modulo intrinsic: Modulo Intrinsic. + * multi-dimension arrays: Array Size. + * MvBits intrinsic: MvBits Intrinsic. + * MXUNIT: Large File Unit Numbers. + * name space: Mangling of Names. + * NAMELIST statement: NAMELIST. + * naming conflicts: Multiple Definitions of External Names. + * naming issues: Mangling of Names. + * naming programs: Nothing Happens. + * NaN values: Floating-point Exception Handling. + * Nearest intrinsic: Nearest Intrinsic. + * negative forms of options: Invoking G77. + * negative time: Timer Wraparounds. + * Netlib <1>: Increasing Precision/Range. + * Netlib: C Interfacing Tools. + * network file system: Output Assumed To Flush. + * new users: Getting Started. + * newbies: Getting Started. + * NeXTStep problems: NeXTStep Problems. + * NFS: Output Assumed To Flush. + * NInt intrinsic: NInt Intrinsic. + * nonportable conversions: Nonportable Conversions. + * Not intrinsic: Not Intrinsic. + * nothing happens: Nothing Happens. + * null arguments: Ugly Null Arguments. + * null byte, trailing: Character and Hollerith Constants. + * null CHARACTER strings: Character Type. + * number of continuation lines: Continuation Line. + * number of dimensions, maximum: Compiler Limits. + * number of trips: Loops. + * O edit descriptor: I/O. + * octal constants: Double Quote Meaning. + * omitting arguments: Ugly Null Arguments. + * one-trip DO loops: Fortran Dialect Options. + * open angle: Character Set. + * open bracket: Character Set. + * OPEN statement: OPEN CLOSE and INQUIRE Keywords. + * optimization, better: Better Optimization. + * optimization, for Pentium: Aligned Data. + * optimize options: Optimize Options. + * options, --driver <1>: Changes. + * options, --driver: News. + * options, -falias-check <1>: Aliasing Assumed To Work. + * options, -falias-check: Code Gen Options. + * options, -fargument-alias <1>: Aliasing Assumed To Work. + * options, -fargument-alias: Code Gen Options. + * options, -fargument-noalias <1>: Aliasing Assumed To Work. + * options, -fargument-noalias: Code Gen Options. + * options, -fbadu77-intrinsics-delete: Fortran Dialect Options. + * options, -fbadu77-intrinsics-disable: Fortran Dialect Options. + * options, -fbadu77-intrinsics-enable: Fortran Dialect Options. + * options, -fbadu77-intrinsics-hide: Fortran Dialect Options. + * options, -fcaller-saves: Optimize Options. + * options, -fcase-initcap: Fortran Dialect Options. + * options, -fcase-lower: Fortran Dialect Options. + * options, -fcase-preserve: Fortran Dialect Options. + * options, -fcase-strict-lower: Fortran Dialect Options. + * options, -fcase-strict-upper: Fortran Dialect Options. + * options, -fcase-upper: Fortran Dialect Options. + * options, -fdelayed-branch: Optimize Options. + * options, -fdollar-ok: Fortran Dialect Options. + * options, -femulate-complex: Code Gen Options. + * options, -fexpensive-optimizations: Optimize Options. + * options, -ff2c-intrinsics-delete: Fortran Dialect Options. + * options, -ff2c-intrinsics-disable: Fortran Dialect Options. + * options, -ff2c-intrinsics-enable: Fortran Dialect Options. + * options, -ff2c-intrinsics-hide: Fortran Dialect Options. + * options, -ff2c-library: Code Gen Options. + * options, -ff66: Shorthand Options. + * options, -ff77: Shorthand Options. + * options, -ff90: Fortran Dialect Options. + * options, -ff90-intrinsics-delete: Fortran Dialect Options. + * options, -ff90-intrinsics-disable: Fortran Dialect Options. + * options, -ff90-intrinsics-enable: Fortran Dialect Options. + * options, -ff90-intrinsics-hide: Fortran Dialect Options. + * options, -ffast-math: Optimize Options. + * options, -ffixed-line-length-N: Fortran Dialect Options. + * options, -ffloat-store: Optimize Options. + * options, -fforce-addr: Optimize Options. + * options, -fforce-mem: Optimize Options. + * options, -ffree-form: Fortran Dialect Options. + * options, -fgnu-intrinsics-delete: Fortran Dialect Options. + * options, -fgnu-intrinsics-disable: Fortran Dialect Options. + * options, -fgnu-intrinsics-enable: Fortran Dialect Options. + * options, -fgnu-intrinsics-hide: Fortran Dialect Options. + * options, -fGROUP-intrinsics-hide: Overly Convenient Options. + * options, -finit-local-zero <1>: Overly Convenient Options. + * options, -finit-local-zero: Code Gen Options. + * options, -fintrin-case-any: Fortran Dialect Options. + * options, -fintrin-case-initcap: Fortran Dialect Options. + * options, -fintrin-case-lower: Fortran Dialect Options. + * options, -fintrin-case-upper: Fortran Dialect Options. + * options, -fmatch-case-any: Fortran Dialect Options. + * options, -fmatch-case-initcap: Fortran Dialect Options. + * options, -fmatch-case-lower: Fortran Dialect Options. + * options, -fmatch-case-upper: Fortran Dialect Options. + * options, -fmil-intrinsics-delete: Fortran Dialect Options. + * options, -fmil-intrinsics-disable: Fortran Dialect Options. + * options, -fmil-intrinsics-enable: Fortran Dialect Options. + * options, -fmil-intrinsics-hide: Fortran Dialect Options. + * options, -fno-argument-noalias-global <1>: Aliasing Assumed To Work. + * options, -fno-argument-noalias-global: Code Gen Options. + * options, -fno-automatic <1>: Overly Convenient Options. + * options, -fno-automatic: Code Gen Options. + * options, -fno-backslash: Fortran Dialect Options. + * options, -fno-common: Code Gen Options. + * options, -fno-f2c <1>: Avoid f2c Compatibility. + * options, -fno-f2c: Code Gen Options. + * options, -fno-f77: Shorthand Options. + * options, -fno-fixed-form: Fortran Dialect Options. + * options, -fno-globals: Code Gen Options. + * options, -fno-ident: Code Gen Options. + * options, -fno-inline: Optimize Options. + * options, -fno-move-all-movables: Optimize Options. + * options, -fno-reduce-all-givs: Optimize Options. + * options, -fno-rerun-loop-opt: Optimize Options. + * options, -fno-second-underscore: Code Gen Options. + * options, -fno-silent: Overall Options. + * options, -fno-trapping-math: Optimize Options. + * options, -fno-ugly: Shorthand Options. + * options, -fno-ugly-args: Fortran Dialect Options. + * options, -fno-ugly-init: Fortran Dialect Options. + * options, -fno-underscoring <1>: Names. + * options, -fno-underscoring: Code Gen Options. + * options, -fonetrip: Fortran Dialect Options. + * options, -fpack-struct: Code Gen Options. + * options, -fpcc-struct-return: Code Gen Options. + * options, -fpedantic: Warning Options. + * options, -fPIC: News. + * options, -freg-struct-return: Code Gen Options. + * options, -frerun-cse-after-loop: Optimize Options. + * options, -fschedule-insns: Optimize Options. + * options, -fschedule-insns2: Optimize Options. + * options, -fset-g77-defaults: Overall Options. + * options, -fshort-double: Code Gen Options. + * options, -fsource-case-lower: Fortran Dialect Options. + * options, -fsource-case-preserve: Fortran Dialect Options. + * options, -fsource-case-upper: Fortran Dialect Options. + * options, -fstrength-reduce: Optimize Options. + * options, -fsymbol-case-any: Fortran Dialect Options. + * options, -fsymbol-case-initcap: Fortran Dialect Options. + * options, -fsymbol-case-lower: Fortran Dialect Options. + * options, -fsymbol-case-upper: Fortran Dialect Options. + * options, -fsyntax-only: Warning Options. + * options, -ftypeless-boz: Fortran Dialect Options. + * options, -fugly: Shorthand Options. + * options, -fugly-assign: Fortran Dialect Options. + * options, -fugly-assumed: Fortran Dialect Options. + * options, -fugly-comma: Fortran Dialect Options. + * options, -fugly-complex: Fortran Dialect Options. + * options, -fugly-logint: Fortran Dialect Options. + * options, -funix-intrinsics-delete: Fortran Dialect Options. + * options, -funix-intrinsics-disable: Fortran Dialect Options. + * options, -funix-intrinsics-enable: Fortran Dialect Options. + * options, -funix-intrinsics-hide: Fortran Dialect Options. + * options, -funroll-all-loops: Optimize Options. + * options, -funroll-loops: Optimize Options. + * options, -funsafe-math-optimizations: Optimize Options. + * options, -fversion: Overall Options. + * options, -fvxt: Fortran Dialect Options. + * options, -fvxt-intrinsics-delete: Fortran Dialect Options. + * options, -fvxt-intrinsics-disable: Fortran Dialect Options. + * options, -fvxt-intrinsics-enable: Fortran Dialect Options. + * options, -fvxt-intrinsics-hide: Fortran Dialect Options. + * options, -fzeros: Code Gen Options. + * options, -g: Debugging Options. + * options, -I-: Directory Options. + * options, -Idir: Directory Options. + * options, -malign-double <1>: Aligned Data. + * options, -malign-double: Optimize Options. + * options, -Nl: Compiler Limits. + * options, -Nx: Compiler Limits. + * options, -pedantic: Warning Options. + * options, -pedantic-errors: Warning Options. + * options, -v: G77 and GCC. + * options, -W: Warning Options. + * options, -w: Warning Options. + * options, -Waggregate-return: Warning Options. + * options, -Wall: Warning Options. + * options, -Wcomment: Warning Options. + * options, -Wconversion: Warning Options. + * options, -Werror: Warning Options. + * options, -Wformat: Warning Options. + * options, -Wid-clash-LEN: Warning Options. + * options, -Wimplicit: Warning Options. + * options, -Wlarger-than-LEN: Warning Options. + * options, -Wno-globals: Warning Options. + * options, -Wparentheses: Warning Options. + * options, -Wredundant-decls: Warning Options. + * options, -Wshadow: Warning Options. + * options, -Wsurprising: Warning Options. + * options, -Wswitch: Warning Options. + * options, -Wtraditional: Warning Options. + * options, -Wuninitialized: Warning Options. + * options, -Wunused: Warning Options. + * options, -x f77-cpp-input: LEX. + * options, adding: Adding Options. + * options, code generation: Code Gen Options. + * options, debugging: Debugging Options. + * options, dialect: Fortran Dialect Options. + * options, directory search: Directory Options. + * options, GNU Fortran command: Invoking G77. + * options, macro: Shorthand Options. + * options, negative forms: Invoking G77. + * options, optimization: Optimize Options. + * options, overall: Overall Options. + * options, overly convenient: Overly Convenient Options. + * options, preprocessor: Preprocessor Options. + * options, shorthand: Shorthand Options. + * options, warnings: Warning Options. + * Or intrinsic <1>: Bit Operations on Floating-point Data. + * Or intrinsic: Or Intrinsic. + * order of evaluation, side effects: Order of Side Effects. + * ordering, array: Arrays. + * other intrinsics: Other Intrinsics. + * output, flushing: Output Assumed To Flush. + * overall options: Overall Options. + * overflow: Warning Options. + * overlapping arguments: Aliasing Assumed To Work. + * overlays: Aliasing Assumed To Work. + * overly convenient options: Overly Convenient Options. + * overwritten data: Strange Behavior at Run Time. + * Pack intrinsic: Pack Intrinsic. + * padding: Known Bugs. + * parallel processing: Support for Threads. + * PARAMETER statement <1>: Old-style PARAMETER Statements. + * PARAMETER statement: Intrinsics in PARAMETER Statements. + * parameters, unused: Warning Options. + * paths, search: Directory Options. + * PDB: Portable Unformatted Files. + * pedantic compilation: Pedantic Compilation. + * Pentium optimizations: Aligned Data. + * percent sign: Character Set. + * PError intrinsic: PError Intrinsic. + * placing initialization statements: Initializing Before Specifying. + * POINTER statement: POINTER Statements. + * pointers <1>: Ugly Assigned Labels. + * pointers: Kind Notation. + * Poking the bear: Philosophy of Code Generation. + * porting, simplify: Simplify Porting. + * pound sign: Character Set. + * Precision intrinsic: Precision Intrinsic. + * precision, increasing: Increasing Precision/Range. + * prefix-radix constants: Fortran Dialect Options. + * preprocessor <1>: LEX. + * preprocessor <2>: Bug Reporting. + * preprocessor <3>: Cpp-style directives. + * preprocessor <4>: Overall Options. + * preprocessor: What is GNU Fortran?. + * preprocessor options: Preprocessor Options. + * Present intrinsic: Present Intrinsic. + * printing compilation status: Overall Options. + * printing main source: Known Bugs. + * printing version information <1>: Overall Options. + * printing version information: What is GNU Fortran?. + * procedures: Procedures. + * Product intrinsic: Product Intrinsic. + * PROGRAM statement: Main Program Unit. + * programs, cc1: What is GNU Fortran?. + * programs, cc1plus: What is GNU Fortran?. + * programs, compiling: G77 and GCC. + * programs, cpp <1>: LEX. + * programs, cpp <2>: Bug Reporting. + * programs, cpp <3>: Preprocessor Options. + * programs, cpp <4>: Overall Options. + * programs, cpp: What is GNU Fortran?. + * programs, f771: What is GNU Fortran?. + * programs, ratfor: Overall Options. + * programs, speeding up: Faster Programs. + * programs, test: Nothing Happens. + * projects: Projects. + * Q edit descriptor: Q Edit Descriptor. + * QAbs intrinsic: QAbs Intrinsic. + * QACos intrinsic: QACos Intrinsic. + * QACosD intrinsic: QACosD Intrinsic. + * QASin intrinsic: QASin Intrinsic. + * QASinD intrinsic: QASinD Intrinsic. + * QATan intrinsic: QATan Intrinsic. + * QATan2 intrinsic: QATan2 Intrinsic. + * QATan2D intrinsic: QATan2D Intrinsic. + * QATanD intrinsic: QATanD Intrinsic. + * QCos intrinsic: QCos Intrinsic. + * QCosD intrinsic: QCosD Intrinsic. + * QCosH intrinsic: QCosH Intrinsic. + * QDiM intrinsic: QDiM Intrinsic. + * QExp intrinsic: QExp Intrinsic. + * QExt intrinsic: QExt Intrinsic. + * QExtD intrinsic: QExtD Intrinsic. + * QFloat intrinsic: QFloat Intrinsic. + * QInt intrinsic: QInt Intrinsic. + * QLog intrinsic: QLog Intrinsic. + * QLog10 intrinsic: QLog10 Intrinsic. + * QMax1 intrinsic: QMax1 Intrinsic. + * QMin1 intrinsic: QMin1 Intrinsic. + * QMod intrinsic: QMod Intrinsic. + * QNInt intrinsic: QNInt Intrinsic. + * QSin intrinsic: QSin Intrinsic. + * QSinD intrinsic: QSinD Intrinsic. + * QSinH intrinsic: QSinH Intrinsic. + * QSqRt intrinsic: QSqRt Intrinsic. + * QTan intrinsic: QTan Intrinsic. + * QTanD intrinsic: QTanD Intrinsic. + * QTanH intrinsic: QTanH Intrinsic. + * question mark: Character Set. + * questionable instructions: What is GNU Fortran?. + * Radix intrinsic: Radix Intrinsic. + * Rand intrinsic: Rand Intrinsic. + * Random_Number intrinsic: Random_Number Intrinsic. + * Random_Seed intrinsic: Random_Seed Intrinsic. + * range checking: Code Gen Options. + * Range intrinsic: Range Intrinsic. + * range, increasing: Increasing Precision/Range. + * rank, maximum: Compiler Limits. + * ratfor: Overall Options. + * Ratfor preprocessor: Overall Options. + * READONLY: READONLY Keyword. + * reads and writes, scheduling: Aliasing Assumed To Work. + * Real intrinsic <1>: Real Intrinsic. + * Real intrinsic: REAL() and AIMAG() of Complex. + * real part: Ugly Complex Part Extraction. + * REAL(KIND=1) type: Compiler Types. + * REAL(KIND=2) type: Compiler Types. + * REAL*16 support: Full Support for Compiler Types. + * RealPart intrinsic: RealPart Intrinsic. + * recent versions <1>: Changes. + * recent versions: News. + * RECORD statement: STRUCTURE UNION RECORD MAP. + * recursion, lack of: RECURSIVE Keyword. + * RECURSIVE keyword: RECURSIVE Keyword. + * reference works: Language. + * Rename intrinsic <1>: Rename Intrinsic (function). + * Rename intrinsic: Rename Intrinsic (subroutine). + * Repeat intrinsic: Repeat Intrinsic. + * reporting bugs: Bugs. + * reporting compilation status: Overall Options. + * Reshape intrinsic: Reshape Intrinsic. + * results, inconsistent: Floating-point Errors. + * RETURN statement <1>: Alternate Returns. + * RETURN statement: Functions. + * return type of functions: Functions. + * right angle: Character Set. + * right bracket: Character Set. + * rounding errors: Floating-point Errors. + * row-major ordering: Arrays. + * RRSpacing intrinsic: RRSpacing Intrinsic. + * RShift intrinsic: RShift Intrinsic. + * run-time, dynamic allocation: Arbitrary Concatenation. + * run-time, initialization: Startup Code. + * run-time, library: What is GNU Fortran?. + * run-time, options: Code Gen Options. + * SAVE statement: Code Gen Options. + * saved variables: Variables Assumed To Be Saved. + * Scale intrinsic: Scale Intrinsic. + * Scan intrinsic: Scan Intrinsic. + * scheduling of reads and writes: Aliasing Assumed To Work. + * scope <1>: Scope and Classes of Names. + * scope: Scope of Names and Labels. + * search path: Directory Options. + * search paths, for included files: Directory Options. + * Secnds intrinsic: Secnds Intrinsic. + * Second intrinsic <1>: Second Intrinsic (subroutine). + * Second intrinsic: Second Intrinsic (function). + * segmentation violation <1>: Strange Behavior at Run Time. + * segmentation violation <2>: Stack Overflow. + * segmentation violation: NeXTStep Problems. + * Selected_Int_Kind intrinsic: Selected_Int_Kind Intrinsic. + * Selected_Real_Kind intrinsic: Selected_Real_Kind Intrinsic. + * semicolon <1>: Character Set. + * semicolon: Statements Comments Lines. + * sequence numbers: Better Source Model. + * Set_Exponent intrinsic: Set_Exponent Intrinsic. + * Shape intrinsic: Shape Intrinsic. + * SHARED: READONLY Keyword. + * Shift intrinsic: Bit Operations on Floating-point Data. + * Short intrinsic: Short Intrinsic. + * short source lines: Short Lines. + * short time: Timer Wraparounds. + * shorthand options: Shorthand Options. + * side effects, order of evaluation: Order of Side Effects. + * Sign intrinsic: Sign Intrinsic. + * signal 11: Signal 11 and Friends. + * Signal intrinsic <1>: Signal Intrinsic (function). + * Signal intrinsic: Signal Intrinsic (subroutine). + * signature of procedures: Procedures. + * simplify porting: Simplify Porting. + * Sin intrinsic: Sin Intrinsic. + * SinD intrinsic: SinD Intrinsic. + * SinH intrinsic: SinH Intrinsic. + * Sleep intrinsic: Sleep Intrinsic. + * Sngl intrinsic: Sngl Intrinsic. + * SnglQ intrinsic: SnglQ Intrinsic. + * Solaris: Strange Behavior at Run Time. + * source code <1>: Case Sensitivity. + * source code <2>: Source Form. + * source code <3>: Lines. + * source code: What is GNU Fortran?. + * source file: What is GNU Fortran?. + * source file format <1>: Case Sensitivity. + * source file format <2>: Source Form. + * source file format <3>: Lines. + * source file format: Fortran Dialect Options. + * source format <1>: Source Form. + * source format: Lines. + * source lines, long: Long Lines. + * source lines, short: Short Lines. + * space <1>: Lines. + * space: Character Set. + * space, endless printing of: Strange Behavior at Run Time. + * space, padding with: Short Lines. + * Spacing intrinsic: Spacing Intrinsic. + * SPC <1>: Lines. + * SPC: Character Set. + * speed, of compiler: Known Bugs. + * speed, of loops: Optimize Options. + * speed, of programs: Faster Programs. + * spills of floating-point results: Floating-point Errors. + * Spread intrinsic: Spread Intrinsic. + * SqRt intrinsic: SqRt Intrinsic. + * SRand intrinsic: SRand Intrinsic. + * stack, 387 coprocessor: News. + * stack, aligned: Aligned Data. + * stack, overflow: Stack Overflow. + * standard, ANSI FORTRAN 77: Language. + * standard, support for: Standard Support. + * startup code: Startup Code. + * Stat intrinsic <1>: Stat Intrinsic (function). + * Stat intrinsic: Stat Intrinsic (subroutine). + * statement labels, assigned: Assigned Statement Labels. + * statements, ACCEPT: TYPE and ACCEPT I/O Statements. + * statements, ASSIGN <1>: Assigned Statement Labels. + * statements, ASSIGN: Ugly Assigned Labels. + * statements, AUTOMATIC: AUTOMATIC Statement. + * statements, BLOCK DATA <1>: Multiple Definitions of External Names. + * statements, BLOCK DATA: Block Data and Libraries. + * statements, CLOSE: OPEN CLOSE and INQUIRE Keywords. + * statements, COMMON <1>: Multiple Definitions of External Names. + * statements, COMMON: Common Blocks. + * statements, COMPLEX: Complex Variables. + * statements, CYCLE: CYCLE and EXIT. + * statements, DATA <1>: Known Bugs. + * statements, DATA: Code Gen Options. + * statements, DECODE: ENCODE and DECODE. + * statements, DIMENSION <1>: Array Bounds Expressions. + * statements, DIMENSION <2>: Adjustable Arrays. + * statements, DIMENSION: Arrays. + * statements, DO <1>: Loops. + * statements, DO: Warning Options. + * statements, ENCODE: ENCODE and DECODE. + * statements, ENTRY: Alternate Entry Points. + * statements, EQUIVALENCE: Local Equivalence Areas. + * statements, EXIT: CYCLE and EXIT. + * statements, FORMAT: Expressions in FORMAT Statements. + * statements, FUNCTION <1>: Functions. + * statements, FUNCTION: Procedures. + * statements, GOTO: Assigned Statement Labels. + * statements, IMPLICIT CHARACTER*(*): Limitation on Implicit Declarations. + * statements, INQUIRE: OPEN CLOSE and INQUIRE Keywords. + * statements, MAP: STRUCTURE UNION RECORD MAP. + * statements, NAMELIST: NAMELIST. + * statements, OPEN: OPEN CLOSE and INQUIRE Keywords. + * statements, PARAMETER <1>: Old-style PARAMETER Statements. + * statements, PARAMETER: Intrinsics in PARAMETER Statements. + * statements, POINTER: POINTER Statements. + * statements, PROGRAM: Main Program Unit. + * statements, RECORD: STRUCTURE UNION RECORD MAP. + * statements, RETURN <1>: Alternate Returns. + * statements, RETURN: Functions. + * statements, SAVE: Code Gen Options. + * statements, separated by semicolon: Statements Comments Lines. + * statements, STRUCTURE: STRUCTURE UNION RECORD MAP. + * statements, SUBROUTINE <1>: Alternate Returns. + * statements, SUBROUTINE: Procedures. + * statements, TYPE: TYPE and ACCEPT I/O Statements. + * statements, UNION: STRUCTURE UNION RECORD MAP. + * STATIC: AUTOMATIC Statement. + * static variables: Variables Assumed To Be Saved. + * status, compilation: Overall Options. + * storage association: Aliasing Assumed To Work. + * strings, empty: Character Type. + * STRUCTURE statement: STRUCTURE UNION RECORD MAP. + * structures: Known Bugs. + * submodels: Use Submodel Options. + * SUBROUTINE statement <1>: Alternate Returns. + * SUBROUTINE statement: Procedures. + * subroutines: Alternate Returns. + * subscript checking: Code Gen Options. + * substring checking: Code Gen Options. + * suffixes, file name: Overall Options. + * Sum intrinsic: Sum Intrinsic. + * support, Alpha: Known Bugs. + * support, ELF: News. + * support, f77: Backslash in Constants. + * support, FORTRAN 77: Standard Support. + * support, Fortran 90: Fortran 90 Support. + * support, gdb: Debugger Problems. + * suppressing warnings: Warning Options. + * symbol names <1>: Names. + * symbol names: Fortran Dialect Options. + * symbol names, scope and classes: Scope and Classes of Names. + * symbol names, transforming: Code Gen Options. + * symbol names, underscores: Code Gen Options. + * SymLnk intrinsic <1>: SymLnk Intrinsic (function). + * SymLnk intrinsic: SymLnk Intrinsic (subroutine). + * synchronous write errors: Output Assumed To Flush. + * syntax checking: Warning Options. + * System intrinsic <1>: System Intrinsic (function). + * System intrinsic: System Intrinsic (subroutine). + * System_Clock intrinsic: System_Clock Intrinsic. + * tab character: Tabs. + * table of intrinsics: Table of Intrinsic Functions. + * Tan intrinsic: Tan Intrinsic. + * TanD intrinsic: TanD Intrinsic. + * TanH intrinsic: TanH Intrinsic. + * test programs: Nothing Happens. + * testing alignment: Aligned Data. + * textbooks: Language. + * threads: Support for Threads. + * Time intrinsic <1>: Time Intrinsic (VXT). + * Time intrinsic: Time Intrinsic (UNIX). + * Time8 intrinsic: Time8 Intrinsic. + * Tiny intrinsic: Tiny Intrinsic. + * Toolpack: Increasing Precision/Range. + * trailing comma: Ugly Null Arguments. + * trailing comment <1>: LEX. + * trailing comment <2>: Trailing Comment. + * trailing comment: Statements Comments Lines. + * trailing null byte: Character and Hollerith Constants. + * Transfer intrinsic: Transfer Intrinsic. + * transforming symbol names <1>: Names. + * transforming symbol names: Code Gen Options. + * translation of user programs: What is GNU Fortran?. + * Transpose intrinsic: Transpose Intrinsic. + * Trim intrinsic: Trim Intrinsic. + * trips, number of: Loops. + * truncation, of floating-point values: Floating-point Errors. + * truncation, of long lines: Long Lines. + * TtyNam intrinsic <1>: TtyNam Intrinsic (function). + * TtyNam intrinsic: TtyNam Intrinsic (subroutine). + * TYPE statement: TYPE and ACCEPT I/O Statements. + * types, COMPLEX(KIND=1): Compiler Types. + * types, COMPLEX(KIND=2): Compiler Types. + * types, constants <1>: Compiler Constants. + * types, constants <2>: Constants. + * types, constants: Fortran Dialect Options. + * types, DOUBLE COMPLEX: Compiler Types. + * types, DOUBLE PRECISION: Compiler Types. + * types, file: Overall Options. + * types, Fortran/C: C Access to Type Information. + * types, INTEGER(KIND=1): Compiler Types. + * types, INTEGER(KIND=2): Compiler Types. + * types, INTEGER(KIND=3): Compiler Types. + * types, INTEGER(KIND=6): Compiler Types. + * types, INTEGER*2: Popular Non-standard Types. + * types, INTEGER*8: Full Support for Compiler Types. + * types, LOGICAL(KIND=1): Compiler Types. + * types, LOGICAL(KIND=2): Compiler Types. + * types, LOGICAL(KIND=3): Compiler Types. + * types, LOGICAL(KIND=6): Compiler Types. + * types, LOGICAL*1: Popular Non-standard Types. + * types, of data: Compiler Types. + * types, REAL(KIND=1): Compiler Types. + * types, REAL(KIND=2): Compiler Types. + * types, REAL*16: Full Support for Compiler Types. + * UBound intrinsic: UBound Intrinsic. + * ugly features <1>: Distensions. + * ugly features: Shorthand Options. + * UMask intrinsic <1>: UMask Intrinsic (function). + * UMask intrinsic: UMask Intrinsic (subroutine). + * undefined behavior: Bug Criteria. + * undefined function value: Bug Criteria. + * undefined reference (_main): Cannot Link Fortran Programs. + * underscore <1>: Mangling of Names. + * underscore <2>: Underscores in Symbol Names. + * underscore <3>: Character Set. + * underscore: Code Gen Options. + * unformatted files: Portable Unformatted Files. + * uninitialized variables <1>: Variables Assumed To Be Zero. + * uninitialized variables <2>: Code Gen Options. + * uninitialized variables: Warning Options. + * UNION statement: STRUCTURE UNION RECORD MAP. + * unit numbers: Large File Unit Numbers. + * UNIX f77: Shorthand Options. + * UNIX intrinsics: Fortran Dialect Options. + * Unlink intrinsic <1>: Unlink Intrinsic (function). + * Unlink intrinsic: Unlink Intrinsic (subroutine). + * Unpack intrinsic: Unpack Intrinsic. + * unrecognized file format: What is GNU Fortran?. + * unresolved reference (various): Cannot Link Fortran Programs. + * unrolling loops: Optimize Options. + * UNSAVE: AUTOMATIC Statement. + * unsupported warnings: Warning Options. + * unused arguments <1>: Unused Arguments. + * unused arguments: Warning Options. + * unused dummies: Warning Options. + * unused parameters: Warning Options. + * unused variables: Warning Options. + * uppercase letters: Case Sensitivity. + * user-visible changes: Changes. + * variables, assumed to be zero: Variables Assumed To Be Zero. + * variables, automatic: AUTOMATIC Statement. + * variables, initialization of: Code Gen Options. + * variables, mistyped: Not My Type. + * variables, retaining values across calls: Variables Assumed To Be Saved. + * variables, uninitialized <1>: Code Gen Options. + * variables, uninitialized: Warning Options. + * variables, unused: Warning Options. + * Verify intrinsic: Verify Intrinsic. + * version information, printing <1>: Overall Options. + * version information, printing: What is GNU Fortran?. + * versions, recent <1>: Changes. + * versions, recent: News. + * VXT extensions <1>: VXT Fortran. + * VXT extensions: Fortran Dialect Options. + * VXT intrinsics: Fortran Dialect Options. + * vxtidate_y2kbuggy_0: Year 2000 (Y2K) Problems. + * warnings: What is GNU Fortran?. + * warnings vs errors: Warnings and Errors. + * warnings, all: Warning Options. + * warnings, extra: Warning Options. + * warnings, global names <1>: Code Gen Options. + * warnings, global names: Warning Options. + * warnings, implicit declaration: Warning Options. + * warnings, suppressing: Warning Options. + * warnings, unsupported: Warning Options. + * wisdom: Collected Fortran Wisdom. + * wraparound: Run-time Environment Limits. + * wraparound, timings <1>: Secnds Intrinsic. + * wraparound, timings <2>: DTime Intrinsic (function). + * wraparound, timings <3>: Time8 Intrinsic. + * wraparound, timings <4>: Time Intrinsic (UNIX). + * wraparound, timings <5>: System_Clock Intrinsic. + * wraparound, timings <6>: Second Intrinsic (subroutine). + * wraparound, timings <7>: Second Intrinsic (function). + * wraparound, timings <8>: MClock8 Intrinsic. + * wraparound, timings <9>: MClock Intrinsic. + * wraparound, timings <10>: ETime Intrinsic (function). + * wraparound, timings <11>: ETime Intrinsic (subroutine). + * wraparound, timings <12>: DTime Intrinsic (subroutine). + * wraparound, timings: CPU_Time Intrinsic. + * wraparound, Y10K <1>: Time Intrinsic (VXT). + * wraparound, Y10K <2>: IDate Intrinsic (UNIX). + * wraparound, Y10K <3>: FDate Intrinsic (function). + * wraparound, Y10K <4>: FDate Intrinsic (subroutine). + * wraparound, Y10K: Date_and_Time Intrinsic. + * wraparound, Y2K: IDate Intrinsic (VXT). + * writes, flushing: Output Assumed To Flush. + * writing code: Collected Fortran Wisdom. + * x86 floating-point: Floating-point precision. + * x86 FPU stack: Inconsistent Calling Sequences. + * XOr intrinsic: XOr Intrinsic. + * Y10K compliance <1>: Time Intrinsic (VXT). + * Y10K compliance <2>: Year 10000 (Y10K) Problems. + * Y10K compliance <3>: IDate Intrinsic (UNIX). + * Y10K compliance <4>: FDate Intrinsic (function). + * Y10K compliance <5>: FDate Intrinsic (subroutine). + * Y10K compliance: Date_and_Time Intrinsic. + * Y2K compliance <1>: Y2KBAD. + * Y2K compliance <2>: IDate Intrinsic (VXT). + * Y2K compliance <3>: Date Intrinsic. + * Y2K compliance: Year 2000 (Y2K) Problems. + * y2kbuggy: Year 2000 (Y2K) Problems. + * Year 10000 compliance <1>: Time Intrinsic (VXT). + * Year 10000 compliance <2>: Year 10000 (Y10K) Problems. + * Year 10000 compliance <3>: IDate Intrinsic (UNIX). + * Year 10000 compliance <4>: FDate Intrinsic (function). + * Year 10000 compliance <5>: FDate Intrinsic (subroutine). + * Year 10000 compliance: Date_and_Time Intrinsic. + * Year 2000 compliance <1>: Y2KBAD. + * Year 2000 compliance <2>: IDate Intrinsic (VXT). + * Year 2000 compliance <3>: Date Intrinsic. + * Year 2000 compliance: Year 2000 (Y2K) Problems. + * Z edit descriptor <1>: Fortran 90 Features. + * Z edit descriptor: I/O. + * ZAbs intrinsic: ZAbs Intrinsic. + * ZCos intrinsic: ZCos Intrinsic. + * zero byte, trailing: Character and Hollerith Constants. + * zero-initialized variables: Variables Assumed To Be Zero. + * zero-length CHARACTER: Character Type. + * zero-trip DO loops: Fortran Dialect Options. + * ZExp intrinsic: ZExp Intrinsic. + * ZExt intrinsic: ZExt Intrinsic. + * ZLog intrinsic: ZLog Intrinsic. + * ZSin intrinsic: ZSin Intrinsic. + * ZSqRt intrinsic: ZSqRt Intrinsic. + + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-3 gcc-3.2.3/gcc/f/g77.info-3 *** gcc-3.2.2/gcc/f/g77.info-3 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-3 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,656 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Debugging Options, Next: Optimize Options, Prev: Warning Options, Up: Invoking G77 + + Options for Debugging Your Program or GNU Fortran + ================================================= + + GNU Fortran has various special options that are used for debugging + either your program or `g77' + + `-g' + Produce debugging information in the operating system's native + format (stabs, COFF, XCOFF, or DWARF). GDB can work with this + debugging information. + + A sample debugging session looks like this (note the use of the + breakpoint): + $ cat gdb.f + PROGRAM PROG + DIMENSION A(10) + DATA A /1.,2.,3.,4.,5.,6.,7.,8.,9.,10./ + A(5) = 4. + PRINT*,A + END + $ g77 -g -O gdb.f + $ gdb a.out + ... + (gdb) break MAIN__ + Breakpoint 1 at 0x8048e96: file gdb.f, line 4. + (gdb) run + Starting program: /home/toon/g77-bugs/./a.out + Breakpoint 1, MAIN__ () at gdb.f:4 + 4 A(5) = 4. + Current language: auto; currently fortran + (gdb) print a(5) + $1 = 5 + (gdb) step + 5 PRINT*,A + (gdb) print a(5) + $2 = 4 + ... + One could also add the setting of the breakpoint and the first run + command to the file `.gdbinit' in the current directory, to + simplify the debugging session. + + *Note Options for Debugging Your Program or GCC: (gcc)Debugging + Options, for more information on debugging options. + +  + File: g77.info, Node: Optimize Options, Next: Preprocessor Options, Prev: Debugging Options, Up: Invoking G77 + + Options That Control Optimization + ================================= + + Most Fortran users will want to use no optimization when developing + and testing programs, and use `-O' or `-O2' when compiling programs for + late-cycle testing and for production use. However, note that certain + diagnostics--such as for uninitialized variables--depend on the flow + analysis done by `-O', i.e. you must use `-O' or `-O2' to get such + diagnostics. + + The following flags have particular applicability when compiling + Fortran programs: + + `-malign-double' + (Intel x86 architecture only.) + + Noticeably improves performance of `g77' programs making heavy use + of `REAL(KIND=2)' (`DOUBLE PRECISION') data on some systems. In + particular, systems using Pentium, Pentium Pro, 586, and 686 + implementations of the i386 architecture execute programs faster + when `REAL(KIND=2)' (`DOUBLE PRECISION') data are aligned on + 64-bit boundaries in memory. + + This option can, at least, make benchmark results more consistent + across various system configurations, versions of the program, and + data sets. + + _Note:_ The warning in the `gcc' documentation about this option + does not apply, generally speaking, to Fortran code compiled by + `g77' + + *Note Aligned Data::, for more information on alignment issues. + + _Also also note:_ The negative form of `-malign-double' is + `-mno-align-double', not `-benign-double'. + + `-ffloat-store' + Might help a Fortran program that depends on exact IEEE + conformance on some machines, but might slow down a program that + doesn't. + + This option is effective when the floating-point unit is set to + work in IEEE 854 `extended precision'--as it typically is on x86 + and m68k GNU systems--rather than IEEE 754 double precision. + `-ffloat-store' tries to remove the extra precision by spilling + data from floating-point registers into memory and this typically + involves a big performance hit. However, it doesn't affect + intermediate results, so that it is only partially effective. + `Excess precision' is avoided in code like: + a = b + c + d = a * e + but not in code like: + d = (b + c) * e + + For another, potentially better, way of controlling the precision, + see *Note Floating-point precision::. + + `-fforce-mem' + + `-fforce-addr' + Might improve optimization of loops. + + `-fno-inline' + Don't compile statement functions inline. Might reduce the size + of a program unit--which might be at expense of some speed (though + it should compile faster). Note that if you are not optimizing, + no functions can be expanded inline. + + `-ffast-math' + Might allow some programs designed to not be too dependent on IEEE + behavior for floating-point to run faster, or die trying. Sets + `-funsafe-math-optimizations', and `-fno-trapping-math'. + + `-funsafe-math-optimizations' + Allow optimizations that may be give incorrect results for certain + IEEE inputs. + + `-fno-trapping-math' + Allow the compiler to assume that floating-point arithmetic will + not generate traps on any inputs. This is useful, for example, + when running a program using IEEE "non-stop" floating-point + arithmetic. + + `-fstrength-reduce' + Might make some loops run faster. + + `-frerun-cse-after-loop' + + `-fexpensive-optimizations' + + `-fdelayed-branch' + + `-fschedule-insns' + + `-fschedule-insns2' + + `-fcaller-saves' + Might improve performance on some code. + + `-funroll-loops' + Typically improves performance on code using iterative `DO' loops + by unrolling them and is probably generally appropriate for + Fortran, though it is not turned on at any optimization level. + Note that outer loop unrolling isn't done specifically; decisions + about whether to unroll a loop are made on the basis of its + instruction count. + + Also, no `loop discovery'(1) is done, so only loops written with + `DO' benefit from loop optimizations, including--but not limited + to--unrolling. Loops written with `IF' and `GOTO' are not + currently recognized as such. This option unrolls only iterative + `DO' loops, not `DO WHILE' loops. + + `-funroll-all-loops' + Probably improves performance on code using `DO WHILE' loops by + unrolling them in addition to iterative `DO' loops. In the absence + of `DO WHILE', this option is equivalent to `-funroll-loops' but + possibly slower. + + `-fno-move-all-movables' + + `-fno-reduce-all-givs' + + `-fno-rerun-loop-opt' + In general, the optimizations enabled with these options will lead + to faster code being generated by GNU Fortran; hence they are + enabled by default when issuing the `g77' command. + + `-fmove-all-movables' and `-freduce-all-givs' will enable loop + optimization to move all loop-invariant index computations in + nested loops over multi-rank array dummy arguments out of these + loops. + + `-frerun-loop-opt' will move offset calculations resulting from + the fact that Fortran arrays by default have a lower bound of 1 + out of the loops. + + These three options are intended to be removed someday, once loop + optimization is sufficiently advanced to perform all those + transformations without help from these options. + + *Note Options That Control Optimization: (gcc)Optimize Options, for + more information on options to optimize the generated machine code. + + ---------- Footnotes ---------- + + (1) "loop discovery" refers to the process by which a compiler, or + indeed any reader of a program, determines which portions of the + program are more likely to be executed repeatedly as it is being run. + Such discovery typically is done early when compiling using + optimization techniques, so the "discovered" loops get more + attention--and more run-time resources, such as registers--from the + compiler. It is easy to "discover" loops that are constructed out of + looping constructs in the language (such as Fortran's `DO'). For some + programs, "discovering" loops constructed out of lower-level constructs + (such as `IF' and `GOTO') can lead to generation of more optimal code + than otherwise. + +  + File: g77.info, Node: Preprocessor Options, Next: Directory Options, Prev: Optimize Options, Up: Invoking G77 + + Options Controlling the Preprocessor + ==================================== + + These options control the C preprocessor, which is run on each C + source file before actual compilation. + + *Note Options Controlling the Preprocessor: (gcc)Preprocessor + Options, for information on C preprocessor options. + + Some of these options also affect how `g77' processes the `INCLUDE' + directive. Since this directive is processed even when preprocessing + is not requested, it is not described in this section. *Note Options + for Directory Search: Directory Options, for information on how `g77' + processes the `INCLUDE' directive. + + However, the `INCLUDE' directive does not apply preprocessing to the + contents of the included file itself. + + Therefore, any file that contains preprocessor directives (such as + `#include', `#define', and `#if') must be included via the `#include' + directive, not via the `INCLUDE' directive. Therefore, any file + containing preprocessor directives, if included, is necessarily + included by a file that itself contains preprocessor directives. + +  + File: g77.info, Node: Directory Options, Next: Code Gen Options, Prev: Preprocessor Options, Up: Invoking G77 + + Options for Directory Search + ============================ + + These options affect how the `cpp' preprocessor searches for files + specified via the `#include' directive. Therefore, when compiling + Fortran programs, they are meaningful when the preprocessor is used. + + Some of these options also affect how `g77' searches for files + specified via the `INCLUDE' directive, although files included by that + directive are not, themselves, preprocessed. These options are: + + `-I-' + + `-IDIR' + These affect interpretation of the `INCLUDE' directive (as well as + of the `#include' directive of the `cpp' preprocessor). + + Note that `-IDIR' must be specified _without_ any spaces between + `-I' and the directory name--that is, `-Ifoo/bar' is valid, but + `-I foo/bar' is rejected by the `g77' compiler (though the + preprocessor supports the latter form). Also note that the + general behavior of `-I' and `INCLUDE' is pretty much the same as + of `-I' with `#include' in the `cpp' preprocessor, with regard to + looking for `header.gcc' files and other such things. + + *Note Options for Directory Search: (gcc)Directory Options, for + information on the `-I' option. + +  + File: g77.info, Node: Code Gen Options, Next: Environment Variables, Prev: Directory Options, Up: Invoking G77 + + Options for Code Generation Conventions + ======================================= + + These machine-independent options control the interface conventions + used in code generation. + + Most of them have both positive and negative forms; the negative form + of `-ffoo' would be `-fno-foo'. In the table below, only one of the + forms is listed--the one which is not the default. You can figure out + the other form by either removing `no-' or adding it. + + `-fno-automatic' + Treat each program unit as if the `SAVE' statement was specified + for every local variable and array referenced in it. Does not + affect common blocks. (Some Fortran compilers provide this option + under the name `-static'.) + + `-finit-local-zero' + Specify that variables and arrays that are local to a program unit + (not in a common block and not passed as an argument) are to be + initialized to binary zeros. + + Since there is a run-time penalty for initialization of variables + that are not given the `SAVE' attribute, it might be a good idea + to also use `-fno-automatic' with `-finit-local-zero'. + + `-fno-f2c' + Do not generate code designed to be compatible with code generated + by `f2c' use the GNU calling conventions instead. + + The `f2c' calling conventions require functions that return type + `REAL(KIND=1)' to actually return the C type `double', and + functions that return type `COMPLEX' to return the values via an + extra argument in the calling sequence that points to where to + store the return value. Under the GNU calling conventions, such + functions simply return their results as they would in GNU + C--`REAL(KIND=1)' functions return the C type `float', and + `COMPLEX' functions return the GNU C type `complex' (or its + `struct' equivalent). + + This does not affect the generation of code that interfaces with + the `libg2c' library. + + However, because the `libg2c' library uses `f2c' calling + conventions, `g77' rejects attempts to pass intrinsics implemented + by routines in this library as actual arguments when `-fno-f2c' is + used, to avoid bugs when they are actually called by code + expecting the GNU calling conventions to work. + + For example, `INTRINSIC ABS;CALL FOO(ABS)' is rejected when + `-fno-f2c' is in force. (Future versions of the `g77' run-time + library might offer routines that provide GNU-callable versions of + the routines that implement the `f2c' intrinsics that may be + passed as actual arguments, so that valid programs need not be + rejected when `-fno-f2c' is used.) + + *Caution:* If `-fno-f2c' is used when compiling any source file + used in a program, it must be used when compiling _all_ Fortran + source files used in that program. + + `-ff2c-library' + Specify that use of `libg2c' (or the original `libf2c') is + required. This is the default for the current version of `g77' + + Currently it is not valid to specify `-fno-f2c-library'. This + option is provided so users can specify it in shell scripts that + build programs and libraries that require the `libf2c' library, + even when being compiled by future versions of `g77' that might + otherwise default to generating code for an incompatible library. + + `-fno-underscoring' + Do not transform names of entities specified in the Fortran source + file by appending underscores to them. + + With `-funderscoring' in effect, `g77' appends two underscores to + names with underscores and one underscore to external names with + no underscores. (`g77' also appends two underscores to internal + names with underscores to avoid naming collisions with external + names. The `-fno-second-underscore' option disables appending of + the second underscore in all cases.) + + This is done to ensure compatibility with code produced by many + UNIX Fortran compilers, including `f2c' which perform the same + transformations. + + Use of `-fno-underscoring' is not recommended unless you are + experimenting with issues such as integration of (GNU) Fortran into + existing system environments (vis-a-vis existing libraries, tools, + and so on). + + For example, with `-funderscoring', and assuming other defaults + like `-fcase-lower' and that `j()' and `max_count()' are external + functions while `my_var' and `lvar' are local variables, a + statement like + + I = J() + MAX_COUNT (MY_VAR, LVAR) + + is implemented as something akin to: + + i = j_() + max_count__(&my_var__, &lvar); + + With `-fno-underscoring', the same statement is implemented as: + + i = j() + max_count(&my_var, &lvar); + + Use of `-fno-underscoring' allows direct specification of + user-defined names while debugging and when interfacing `g77' code + with other languages. + + Note that just because the names match does _not_ mean that the + interface implemented by `g77' for an external name matches the + interface implemented by some other language for that same name. + That is, getting code produced by `g77' to link to code produced + by some other compiler using this or any other method can be only a + small part of the overall solution--getting the code generated by + both compilers to agree on issues other than naming can require + significant effort, and, unlike naming disagreements, linkers + normally cannot detect disagreements in these other areas. + + Also, note that with `-fno-underscoring', the lack of appended + underscores introduces the very real possibility that a + user-defined external name will conflict with a name in a system + library, which could make finding unresolved-reference bugs quite + difficult in some cases--they might occur at program run time, and + show up only as buggy behavior at run time. + + In future versions of `g77' we hope to improve naming and linking + issues so that debugging always involves using the names as they + appear in the source, even if the names as seen by the linker are + mangled to prevent accidental linking between procedures with + incompatible interfaces. + + `-fno-second-underscore' + Do not append a second underscore to names of entities specified + in the Fortran source file. + + This option has no effect if `-fno-underscoring' is in effect. + + Otherwise, with this option, an external name such as `MAX_COUNT' + is implemented as a reference to the link-time external symbol + `max_count_', instead of `max_count__'. + + `-fno-ident' + Ignore the `#ident' directive. + + `-fzeros' + Treat initial values of zero as if they were any other value. + + As of version 0.5.18, `g77' normally treats `DATA' and other + statements that are used to specify initial values of zero for + variables and arrays as if no values were actually specified, in + the sense that no diagnostics regarding multiple initializations + are produced. + + This is done to speed up compiling of programs that initialize + large arrays to zeros. + + Use `-fzeros' to revert to the simpler, slower behavior that can + catch multiple initializations by keeping track of all + initializations, zero or otherwise. + + _Caution:_ Future versions of `g77' might disregard this option + (and its negative form, the default) or interpret it somewhat + differently. The interpretation changes will affect only + non-standard programs; standard-conforming programs should not be + affected. + + `-femulate-complex' + Implement `COMPLEX' arithmetic via emulation, instead of using the + facilities of the `gcc' back end that provide direct support of + `complex' arithmetic. + + (`gcc' had some bugs in its back-end support for `complex' + arithmetic, due primarily to the support not being completed as of + version 2.8.1 and `egcs' 1.1.2.) + + Use `-femulate-complex' if you suspect code-generation bugs, or + experience compiler crashes, that might result from `g77' using + the `COMPLEX' support in the `gcc' back end. If using that option + fixes the bugs or crashes you are seeing, that indicates a likely + `g77' bugs (though, all compiler crashes are considered bugs), so, + please report it. (Note that the known bugs, now believed fixed, + produced compiler crashes rather than causing the generation of + incorrect code.) + + Use of this option should not affect how Fortran code compiled by + `g77' works in terms of its interfaces to other code, e.g. that + compiled by `f2c' + + As of GCC version 3.0, this option is not necessary anymore. + + _Caution:_ Future versions of `g77' might ignore both forms of + this option. + + `-falias-check' + + `-fargument-alias' + + `-fargument-noalias' + + `-fno-argument-noalias-global' + _Version info:_ These options are not supported by versions of + `g77' based on `gcc' version 2.8. + + These options specify to what degree aliasing (overlap) is + permitted between arguments (passed as pointers) and `COMMON' + (external, or public) storage. + + The default for Fortran code, as mandated by the FORTRAN 77 and + Fortran 90 standards, is `-fargument-noalias-global'. The default + for code written in the C language family is `-fargument-alias'. + + Note that, on some systems, compiling with `-fforce-addr' in + effect can produce more optimal code when the default aliasing + options are in effect (and when optimization is enabled). + + *Note Aliasing Assumed To Work::, for detailed information on the + implications of compiling Fortran code that depends on the ability + to alias dummy arguments. + + `-fno-globals' + Disable diagnostics about inter-procedural analysis problems, such + as disagreements about the type of a function or a procedure's + argument, that might cause a compiler crash when attempting to + inline a reference to a procedure within a program unit. (The + diagnostics themselves are still produced, but as warnings, unless + `-Wno-globals' is specified, in which case no relevant diagnostics + are produced.) + + Further, this option disables such inlining, to avoid compiler + crashes resulting from incorrect code that would otherwise be + diagnosed. + + As such, this option might be quite useful when compiling + existing, "working" code that happens to have a few bugs that do + not generally show themselves, but which `g77' diagnoses. + + Use of this option therefore has the effect of instructing `g77' + to behave more like it did up through version 0.5.19.1, when it + paid little or no attention to disagreements between program units + about a procedure's type and argument information, and when it + performed no inlining of procedures (except statement functions). + + Without this option, `g77' defaults to performing the potentially + inlining procedures as it started doing in version 0.5.20, but as + of version 0.5.21, it also diagnoses disagreements that might + cause such inlining to crash the compiler as (fatal) errors, and + warns about similar disagreements that are currently believed to + not likely to result in the compiler later crashing or producing + incorrect code. + + `-fflatten-arrays' + Use back end's C-like constructs (pointer plus offset) instead of + its `ARRAY_REF' construct to handle all array references. + + _Note:_ This option is not supported. It is intended for use only + by `g77' developers, to evaluate code-generation issues. It might + be removed at any time. + + `-fbounds-check' + `-ffortran-bounds-check' + Enable generation of run-time checks for array subscripts and + substring start and end points against the (locally) declared + minimum and maximum values. + + The current implementation uses the `libf2c' library routine + `s_rnge' to print the diagnostic. + + However, whereas `f2c' generates a single check per reference for + a multi-dimensional array, of the computed offset against the + valid offset range (0 through the size of the array), `g77' + generates a single check per _subscript_ expression. This catches + some cases of potential bugs that `f2c' does not, such as + references to below the beginning of an assumed-size array. + + `g77' also generates checks for `CHARACTER' substring references, + something `f2c' currently does not do. + + Use the new `-ffortran-bounds-check' option to specify + bounds-checking for only the Fortran code you are compiling, not + necessarily for code written in other languages. + + _Note:_ To provide more detailed information on the offending + subscript, `g77' provides the `libg2c' run-time library routine + `s_rnge' with somewhat differently-formatted information. Here's + a sample diagnostic: + + Subscript out of range on file line 4, procedure rnge.f/bf. + Attempt to access the -6-th element of variable b[subscript-2-of-2]. + Aborted + + The above message indicates that the offending source line is line + 4 of the file `rnge.f', within the program unit (or statement + function) named `bf'. The offended array is named `b'. The + offended array dimension is the second for a two-dimensional array, + and the offending, computed subscript expression was `-6'. + + For a `CHARACTER' substring reference, the second line has this + appearance: + + Attempt to access the 11-th element of variable a[start-substring]. + + This indicates that the offended `CHARACTER' variable or array is + named `a', the offended substring position is the starting + (leftmost) position, and the offending substring expression is + `11'. + + (Though the verbage of `s_rnge' is not ideal for the purpose of + the `g77' compiler, the above information should provide adequate + diagnostic abilities to it users.) + + *Note Options for Code Generation Conventions: (gcc)Code Gen + Options, for information on more options offered by the GBE shared by + `g77' `gcc' and other GNU compilers. + + Some of these do _not_ work when compiling programs written in + Fortran: + + `-fpcc-struct-return' + + `-freg-struct-return' + You should not use these except strictly the same way as you used + them to build the version of `libg2c' with which you will be + linking all code compiled by `g77' with the same option. + + `-fshort-double' + This probably either has no effect on Fortran programs, or makes + them act loopy. + + `-fno-common' + Do not use this when compiling Fortran programs, or there will be + Trouble. + + `-fpack-struct' + This probably will break any calls to the `libg2c' library, at the + very least, even if it is built with the same option. + +  + File: g77.info, Node: Environment Variables, Prev: Code Gen Options, Up: Invoking G77 + + Environment Variables Affecting GNU Fortran + =========================================== + + GNU Fortran currently does not make use of any environment variables + to control its operation above and beyond those that affect the + operation of `gcc'. + + *Note Environment Variables Affecting GCC: (gcc)Environment + Variables, for information on environment variables. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-4 gcc-3.2.3/gcc/f/g77.info-4 *** gcc-3.2.2/gcc/f/g77.info-4 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-4 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,1288 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: News, Next: Changes, Prev: Invoking G77, Up: Top + + News About GNU Fortran + ********************** + + Changes made to recent versions of GNU Fortran are listed below, + with the most recent version first. + + The changes are generally listed in order: + + 1. Code-generation and run-time-library bug-fixes + + 2. Compiler and run-time-library crashes involving valid code that + have been fixed + + 3. New features + + 4. Fixes and enhancements to existing features + + 5. New diagnostics + + 6. Internal improvements + + 7. Miscellany + + This order is not strict--for example, some items involve a + combination of these elements. + + Note that two variants of `g77' are tracked below. The `egcs' + variant is described vis-a-vis previous versions of `egcs' and/or an + official FSF version, as appropriate. Note that all such variants are + obsolete _as of July 1999_ - the information is retained here only for + its historical value. + + Therefore, `egcs' versions sometimes have multiple listings to help + clarify how they differ from other versions, though this can make + getting a complete picture of what a particular `egcs' version contains + somewhat more difficult. + + For information on bugs in the GCC-3.2.3 version of `g77', see *Note + Known Bugs In GNU Fortran: Known Bugs. + + An online, "live" version of this document (derived directly from + the mainline, development version of `g77' within `gcc') is available at + `http://www.gnu.org/software/gcc/onlinedocs/g77/News.html'. + + The following information was last updated on 2002-10-28: + + In `GCC' 3.2 versus `GCC' 3.1: + ============================== + + * Problem Reports fixed (in chronological order of submission): + `8308' + gcc-3.x does not compile files with suffix .r (RATFOR) [Fixed + in 3.2.1] + + In `GCC' 3.1 (formerly known as g77-0.5.27) versus `GCC' 3.0: + ============================================================= + + * Problem Reports fixed (in chronological order of submission): + `947' + Data statement initialization with subscript of kind INTEGER*2 + + `3743' + Reference to intrinsic `ISHFT' invalid + + `3807' + Function BESJN(integer,double) problems + + `3957' + g77 -pipe -xf77-cpp-input sends output to stdout + + `4279' + g77 -h" gives bogus output + + `4730' + ICE on valid input using CALL EXIT(%VAL(...)) + + `4752' + g77 -v -c -xf77-version /dev/null -xnone causes ice + + `4885' + BACKSPACE example that doesn't work as of gcc/g77-3.0.x + + `5122' + g77 rejects accepted use of INTEGER*2 as type of DATA + statement loop index + + `5397' + ICE on compiling source with 540 000 000 REAL array + + `5473' + ICE on BESJN(integer*8,real) + + `5837' + bug in loop unrolling + + * `g77' now has its man page generated from the texinfo + documentation, to guarantee that it remains up to date. + + * `g77' used to reject the following program on 32-bit targets: + PROGRAM PROG + DIMENSION A(140 000 000) + END + with the message: + prog.f: In program `prog': + prog.f:2: + DIMENSION A(140 000 000) + ^ + Array `a' at (^) is too large to handle + because 140 000 000 REALs is larger than the largest bit-extent + that can be expressed in 32 bits. However, bit-sizes never play a + role after offsets have been converted to byte addresses. + Therefore this check has been removed, and the limit is now 2 + Gbyte of memory (around 530 000 000 REALs). Note: On GNU/Linux + systems one has to compile programs that occupy more than 1 Gbyte + statically, i.e. `g77 -static ...'. + + * Based on work done by Juergen Pfeifer () + libf2c is now a shared library. One can still link in all objects + with the program by specifying the `-static' option. + + * Robert Anderson () thought up a two line + change that enables g77 to compile such code as: + SUBROUTINE SUB(A, N) + DIMENSION N(2) + DIMENSION A(N(1),N(2)) + A(1,1) = 1. + END + Note the use of array elements in the bounds of the adjustable + array A. + + * George Helffrich () implemented a change + in substring index checking (when specifying `-fbounds-check') + that permits the use of zero length substrings of the form + `string(1:0)'. + + * Based on code developed by Pedro Vazquez + (), the `libf2c' library is now + able to read and write files larger than 2 Gbyte on 32-bit target + machines, if the operating system supports this. + + In 0.5.26, `GCC' 3.0 versus `GCC' 2.95: + ======================================= + + * When a REWIND was issued after a WRITE statement on an unformatted + file, the implicit truncation was performed by copying the + truncated file to /tmp and copying the result back. This has been + fixed by using the `ftruncate' OS function. Thanks go to the + GAMESS developers for bringing this to our attention. + + * Using options `-g', `-ggdb' or `-gdwarf[-2]' (where appropriate + for your target) now also enables debugging information for COMMON + BLOCK and EQUIVALENCE items to be emitted. Thanks go to Andrew + Vaught () and George Helffrich + () for fixing this longstanding + problem. + + * It is not necessary anymore to use the option `-femulate-complex' + to compile Fortran code using COMPLEX arithmetic, even on 64-bit + machines (like the Alpha). This will improve code generation. + + * INTRINSIC arithmetic functions are now treated as routines that do + not depend on anything but their argument(s). This enables + further instruction scheduling, because it is known that they + cannot read or modify arbitrary locations. + + * Upgrade to `libf2c' as of 2000-12-05. + + This fixes a bug where a namelist containing initialization of + LOGICAL items and a variable starting with T or F would be read + incorrectly. + + * The `TtyNam' intrinsics now set NAME to all spaces (at run time) + if the system has no `ttyname' implementation available. + + * Upgrade to `libf2c' as of 1999-06-28. + + This fixes a bug whereby input to a `NAMELIST' read involving a + repeat count, such as `K(5)=10*3', was not properly handled by + `libf2c'. The first item was written to `K(5)', but the remaining + nine were written elsewhere (still within the array), not + necessarily starting at `K(6)'. + + In 0.5.25, `GCC' 2.95 (`EGCS' 1.2) versus `EGCS' 1.1.2: + ======================================================= + + * `g77' no longer generates bad code for assignments, or other + conversions, of `REAL' or `COMPLEX' constant expressions to type + `INTEGER(KIND=2)' (often referred to as `INTEGER*8'). + + For example, `INTEGER*8 J; J = 4E10' now works as documented. + + * `g77' no longer truncates `INTEGER(KIND=2)' (usually `INTEGER*8') + subscript expressions when evaluating array references on systems + with pointers widers than `INTEGER(KIND=1)' (such as Alphas). + + * `g77' no longer generates bad code for an assignment to a + `COMPLEX' variable or array that partially overlaps one or more of + the sources of the same assignment (a very rare construction). It + now assigns through a temporary, in cases where such partial + overlap is deemed possible. + + * `libg2c' (`libf2c') no longer loses track of the file being worked + on during a `BACKSPACE' operation. + + * `libg2c' (`libf2c') fixes a bug whereby input to a `NAMELIST' read + involving a repeat count, such as `K(5)=10*3', was not properly + handled by `libf2c'. The first item was written to `K(5)', but + the remaining nine were written elsewhere (still within the array), + not necessarily starting at `K(6)'. + + * Automatic arrays now seem to be working on HP-UX systems. + + * The `Date' intrinsic now returns the correct result on big-endian + systems. + + * Fix `g77' so it no longer crashes when compiling I/O statements + using keywords that define `INTEGER' values, such as `IOSTAT=J', + where J is other than default `INTEGER' (such as `INTEGER*2'). + Instead, it issues a diagnostic. + + * Fix `g77' so it properly handles `DATA A/RPT*VAL/', where RPT is + not default `INTEGER', such as `INTEGER*2', instead of producing a + spurious diagnostic. Also fix `DATA (A(I),I=1,N)', where `N' is + not default `INTEGER' to work instead of crashing `g77'. + + * The `-ax' option is now obeyed when compiling Fortran programs. + (It is passed to the `f771' driver.) + + * The new `-fbounds-check' option causes `g77' to compile run-time + bounds checks of array subscripts, as well as of substring start + and end points. + + * `libg2c' now supports building as multilibbed library, which + provides better support for systems that require options such as + `-mieee' to work properly. + + * Source file names with the suffixes `.FOR' and `.FPP' now are + recognized by `g77' as if they ended in `.for' and `.fpp', + respectively. + + * The order of arguments to the _subroutine_ forms of the `CTime', + `DTime', `ETime', and `TtyNam' intrinsics has been swapped. The + argument serving as the returned value for the corresponding + function forms now is the _second_ argument, making these + consistent with the other subroutine forms of `libU77' intrinsics. + + * `g77' now warns about a reference to an intrinsic that has an + interface that is not Year 2000 (Y2K) compliant. Also, `libg2c' + has been changed to increase the likelihood of catching references + to the implementations of these intrinsics using the `EXTERNAL' + mechanism (which would avoid the new warnings). + + *Note Year 2000 (Y2K) Problems::, for more information. + + * `g77' now warns about a reference to a function when the + corresponding _subsequent_ function program unit disagrees with + the reference concerning the type of the function. + + * `-fno-emulate-complex' is now the default option. This should + result in improved performance of code that uses the `COMPLEX' + data type. + + * The `-malign-double' option now reliably aligns _all_ + double-precision variables and arrays on Intel x86 targets. + + * Even without the `-malign-double' option, `g77' reliably aligns + local double-precision variables that are not in `EQUIVALENCE' + areas and not `SAVE''d. + + * `g77' now open-codes ("inlines") division of `COMPLEX' operands + instead of generating a run-time call to the `libf2c' routines + `c_div' or `z_div', unless the `-Os' option is specified. + + * `g77' no longer generates code to maintain `errno', a C-language + concept, when performing operations such as the `SqRt' intrinsic. + + * `g77' developers can temporarily use the `-fflatten-arrays' option + to compare how the compiler handles code generation using C-like + constructs as compared to the Fortran-like method constructs + normally used. + + * A substantial portion of the `g77' front end's code-generation + component was rewritten. It now generates code using facilities + more robustly supported by the `gcc' back end. One effect of this + rewrite is that some codes no longer produce a spurious "label LAB + used before containing binding contour" message. + + * Support for the `-fugly' option has been removed. + + * Improve documentation and indexing, including information on Year + 2000 (Y2K) compliance, and providing more information on internals + of the front end. + + * Upgrade to `libf2c' as of 1999-05-10. + + In 0.5.24 versus 0.5.23: + ======================== + + There is no `g77' version 0.5.24 at this time, or planned. 0.5.24 + is the version number designated for bug fixes and, perhaps, some new + features added, to 0.5.23. Version 0.5.23 requires `gcc' 2.8.1, as + 0.5.24 was planned to require. + + Due to `EGCS' becoming `GCC' (which is now an acronym for "GNU + Compiler Collection"), and `EGCS' 1.2 becoming officially designated + `GCC' 2.95, there seems to be no need for an actual 0.5.24 release. + + To reduce the confusion already resulting from use of 0.5.24 to + designate `g77' versions within `EGCS' versions 1.0 and 1.1, as well as + in versions of `g77' documentation and notices during that period, + "mainline" `g77' version numbering resumes at 0.5.25 with `GCC' 2.95 + (`EGCS' 1.2), skipping over 0.5.24 as a placeholder version number. + + To repeat, there is no `g77' 0.5.24, but there is now a 0.5.25. + Please remain calm and return to your keypunch units. + + In `EGCS' 1.1.2 versus `EGCS' 1.1.1: + ==================================== + + * Fix the `IDate' intrinsic (VXT) (in `libg2c') so the returned year + is in the documented, non-Y2K-compliant range of 0-99, instead of + being returned as 100 in the year 2000. + + *Note IDate Intrinsic (VXT)::, for more information. + + * Fix the `Date_and_Time' intrinsic (in `libg2c') to return the + milliseconds value properly in VALUES(8). + + * Fix the `LStat' intrinsic (in `libg2c') to return device-ID + information properly in SARRAY(7). + + * Improve documentation. + + In `EGCS' 1.1.1 versus `EGCS' 1.1: + ================================== + + * Fix `libg2c' so it performs an implicit `ENDFILE' operation (as + appropriate) whenever a `REWIND' is done. + + (This bug was introduced in 0.5.23 and `egcs' 1.1 in `g77''s + version of `libf2c'.) + + * Fix `libg2c' so it no longer crashes with a spurious diagnostic + upon doing any I/O following a direct formatted write. + + (This bug was introduced in 0.5.23 and `egcs' 1.1 in `g77''s + version of `libf2c'.) + + * Fix `g77' so it no longer crashes compiling references to the + `Rand' intrinsic on some systems. + + * Fix `g77' portion of installation process so it works better on + some systems (those with shells requiring `else true' clauses on + `if' constructs for the completion code to be set properly). + + In `EGCS' 1.1 versus `EGCS' 1.0.3: + ================================== + + * Fix bugs in the `libU77' intrinsic `HostNm' that wrote one byte + beyond the end of its `CHARACTER' argument, and in the `libU77' + intrinsics `GMTime' and `LTime' that overwrote their arguments. + + * Assumed arrays with negative bounds (such as `REAL A(-1:*)') no + longer elicit spurious diagnostics from `g77', even on systems + with pointers having different sizes than integers. + + This bug is not known to have existed in any recent version of + `gcc'. It was introduced in an early release of `egcs'. + + * Valid combinations of `EXTERNAL', passing that external as a dummy + argument without explicitly giving it a type, and, in a subsequent + program unit, referencing that external as an external function + with a different type no longer crash `g77'. + + * `CASE DEFAULT' no longer crashes `g77'. + + * The `-Wunused' option no longer issues a spurious warning about + the "master" procedure generated by `g77' for procedures + containing `ENTRY' statements. + + * Support `FORMAT(I)' when EXPR is a compile-time constant + `INTEGER' expression. + + * Fix `g77' `-g' option so procedures that use `ENTRY' can be + stepped through, line by line, in `gdb'. + + * Allow any `REAL' argument to intrinsics `Second' and `CPU_Time'. + + * Use `tempnam', if available, to open scratch files (as in + `OPEN(STATUS='SCRATCH')') so that the `TMPDIR' environment + variable, if present, is used. + + * `g77''s version of `libf2c' separates out the setting of global + state (such as command-line arguments and signal handling) from + `main.o' into distinct, new library archive members. + + This should make it easier to write portable applications that + have their own (non-Fortran) `main()' routine properly set up the + `libf2c' environment, even when `libf2c' (now `libg2c') is a + shared library. + + * `g77' no longer installs the `f77' command and `f77.1' man page in + the `/usr' or `/usr/local' hierarchy, even if the `f77-install-ok' + file exists in the source or build directory. See the + installation documentation for more information. + + * `g77' no longer installs the `libf2c.a' library and `f2c.h' + include file in the `/usr' or `/usr/local' hierarchy, even if the + `f2c-install-ok' or `f2c-exists-ok' files exist in the source or + build directory. See the installation documentation for more + information. + + * The `libf2c.a' library produced by `g77' has been renamed to + `libg2c.a'. It is installed only in the `gcc' "private" directory + hierarchy, `gcc-lib'. This allows system administrators and users + to choose which version of the `libf2c' library from `netlib' they + wish to use on a case-by-case basis. See the installation + documentation for more information. + + * The `f2c.h' include (header) file produced by `g77' has been + renamed to `g2c.h'. It is installed only in the `gcc' "private" + directory hierarchy, `gcc-lib'. This allows system administrators + and users to choose which version of the include file from + `netlib' they wish to use on a case-by-case basis. See the + installation documentation for more information. + + * The `g77' command now expects the run-time library to be named + `libg2c.a' instead of `libf2c.a', to ensure that a version other + than the one built and installed as part of the same `g77' version + is picked up. + + * During the configuration and build process, `g77' creates + subdirectories it needs only as it needs them. Other cleaning up + of the configuration and build process has been performed as well. + + * `install-info' now used to update the directory of Info + documentation to contain an entry for `g77' (during installation). + + * Some diagnostics have been changed from warnings to errors, to + prevent inadvertent use of the resulting, probably buggy, programs. + These mostly include diagnostics about use of unsupported features + in the `OPEN', `INQUIRE', `READ', and `WRITE' statements, and + about truncations of various sorts of constants. + + * Improve compilation of `FORMAT' expressions so that a null byte is + appended to the last operand if it is a constant. This provides a + cleaner run-time diagnostic as provided by `libf2c' for statements + like `PRINT '(I1', 42'. + + * Improve documentation and indexing. + + * The upgrade to `libf2c' as of 1998-06-18 should fix a variety of + problems, including those involving some uses of the `T' format + specifier, and perhaps some build (porting) problems as well. + + In `EGCS' 1.1 versus `g77' 0.5.23: + ================================== + + * Fix a code-generation bug that afflicted Intel x86 targets when + `-O2' was specified compiling, for example, an old version of the + `DNRM2' routine. + + The x87 coprocessor stack was being mismanaged in cases involving + assigned `GOTO' and `ASSIGN'. + + * `g77' no longer produces incorrect code and initial values for + `EQUIVALENCE' and `COMMON' aggregates that, due to "unnatural" + ordering of members vis-a-vis their types, require initial padding. + + * Fix `g77' crash compiling code containing the construct + `CMPLX(0.)' or similar. + + * `g77' no longer crashes when compiling code containing + specification statements such as `INTEGER(KIND=7) PTR'. + + * `g77' no longer crashes when compiling code such as `J = SIGNAL(1, + 2)'. + + * `g77' now treats `%LOC(EXPR)' and `LOC(EXPR)' as "ordinary" + expressions when they are used as arguments in procedure calls. + This change applies only to global (filewide) analysis, making it + consistent with how `g77' actually generates code for these cases. + + Previously, `g77' treated these expressions as denoting special + "pointer" arguments for the purposes of filewide analysis. + + * Fix `g77' crash (or apparently infinite run-time) when compiling + certain complicated expressions involving `COMPLEX' arithmetic + (especially multiplication). + + * Align static double-precision variables and arrays on Intel x86 + targets regardless of whether `-malign-double' is specified. + + Generally, this affects only local variables and arrays having the + `SAVE' attribute or given initial values via `DATA'. + + * The `g77' driver now ensures that `-lg2c' is specified in the link + phase prior to any occurrence of `-lm'. This prevents + accidentally linking to a routine in the SunOS4 `-lm' library when + the generated code wants to link to the one in `libf2c' (`libg2c'). + + * `g77' emits more debugging information when `-g' is used. + + This new information allows, for example, `which __g77_length_a' + to be used in `gdb' to determine the type of the phantom length + argument supplied with `CHARACTER' variables. + + This information pertains to internally-generated type, variable, + and other information, not to the longstanding deficiencies + vis-a-vis `COMMON' and `EQUIVALENCE'. + + * The F90 `Date_and_Time' intrinsic now is supported. + + * The F90 `System_Clock' intrinsic allows the optional arguments + (except for the `Count' argument) to be omitted. + + * Upgrade to `libf2c' as of 1998-06-18. + + * Improve documentation and indexing. + + In 0.5.23 versus 0.5.22: + ======================== + + * This release contains several regressions against version 0.5.22 + of `g77', due to using the "vanilla" `gcc' back end instead of + patching it to fix a few bugs and improve performance in a few + cases. + + Features that have been dropped from this version of `g77' due to + their being implemented via `g77'-specific patches to the `gcc' + back end in previous releases include: + + - Support for `__restrict__' keyword, the options + `-fargument-alias', `-fargument-noalias', and + `-fargument-noalias-global', and the corresponding + alias-analysis code. + + (`egcs' has the alias-analysis code, but not the + `__restrict__' keyword. `egcs' `g77' users benefit from the + alias-analysis code despite the lack of the `__restrict__' + keyword, which is a C-language construct.) + + - Support for the GNU compiler options `-fmove-all-movables', + `-freduce-all-givs', and `-frerun-loop-opt'. + + (`egcs' supports these options. `g77' users of `egcs' + benefit from them even if they are not explicitly specified, + because the defaults are optimized for `g77' users.) + + - Support for the `-W' option warning about integer division by + zero. + + - The Intel x86-specific option `-malign-double' applying to + stack-allocated data as well as statically-allocate data. + + Note that the `gcc/f/gbe/' subdirectory has been removed from this + distribution as a result of `g77' no longer including patches for + the `gcc' back end. + + * Fix bugs in the `libU77' intrinsic `HostNm' that wrote one byte + beyond the end of its `CHARACTER' argument, and in the `libU77' + intrinsics `GMTime' and `LTime' that overwrote their arguments. + + * Support `gcc' version 2.8, and remove support for prior versions + of `gcc'. + + * Remove support for the `--driver' option, as `g77' now does all + the driving, just like `gcc'. + + * `CASE DEFAULT' no longer crashes `g77'. + + * Valid combinations of `EXTERNAL', passing that external as a dummy + argument without explicitly giving it a type, and, in a subsequent + program unit, referencing that external as an external function + with a different type no longer crash `g77'. + + * `g77' no longer installs the `f77' command and `f77.1' man page in + the `/usr' or `/usr/local' hierarchy, even if the `f77-install-ok' + file exists in the source or build directory. See the + installation documentation for more information. + + * `g77' no longer installs the `libf2c.a' library and `f2c.h' + include file in the `/usr' or `/usr/local' hierarchy, even if the + `f2c-install-ok' or `f2c-exists-ok' files exist in the source or + build directory. See the installation documentation for more + information. + + * The `libf2c.a' library produced by `g77' has been renamed to + `libg2c.a'. It is installed only in the `gcc' "private" directory + hierarchy, `gcc-lib'. This allows system administrators and users + to choose which version of the `libf2c' library from `netlib' they + wish to use on a case-by-case basis. See the installation + documentation for more information. + + * The `f2c.h' include (header) file produced by `g77' has been + renamed to `g2c.h'. It is installed only in the `gcc' "private" + directory hierarchy, `gcc-lib'. This allows system administrators + and users to choose which version of the include file from + `netlib' they wish to use on a case-by-case basis. See the + installation documentation for more information. + + * The `g77' command now expects the run-time library to be named + `libg2c.a' instead of `libf2c.a', to ensure that a version other + than the one built and installed as part of the same `g77' version + is picked up. + + * The `-Wunused' option no longer issues a spurious warning about + the "master" procedure generated by `g77' for procedures + containing `ENTRY' statements. + + * `g77''s version of `libf2c' separates out the setting of global + state (such as command-line arguments and signal handling) from + `main.o' into distinct, new library archive members. + + This should make it easier to write portable applications that + have their own (non-Fortran) `main()' routine properly set up the + `libf2c' environment, even when `libf2c' (now `libg2c') is a + shared library. + + * During the configuration and build process, `g77' creates + subdirectories it needs only as it needs them, thus avoiding + unnecessary creation of, for example, `stage1/f/runtime' when + doing a non-bootstrap build. Other cleaning up of the + configuration and build process has been performed as well. + + * `install-info' now used to update the directory of Info + documentation to contain an entry for `g77' (during installation). + + * Some diagnostics have been changed from warnings to errors, to + prevent inadvertent use of the resulting, probably buggy, programs. + These mostly include diagnostics about use of unsupported features + in the `OPEN', `INQUIRE', `READ', and `WRITE' statements, and + about truncations of various sorts of constants. + + * Improve documentation and indexing. + + * Upgrade to `libf2c' as of 1998-04-20. + + This should fix a variety of problems, including those involving + some uses of the `T' format specifier, and perhaps some build + (porting) problems as well. + + In 0.5.22 versus 0.5.21: + ======================== + + * Fix code generation for iterative `DO' loops that have one or more + references to the iteration variable, or to aliases of it, in + their control expressions. For example, `DO 10 J=2,J' now is + compiled correctly. + + * Fix a code-generation bug that afflicted Intel x86 targets when + `-O2' was specified compiling, for example, an old version of the + `DNRM2' routine. + + The x87 coprocessor stack was being mismanaged in cases involving + assigned `GOTO' and `ASSIGN'. + + * Fix `DTime' intrinsic so as not to truncate results to integer + values (on some systems). + + * Fix `Signal' intrinsic so it offers portable support for 64-bit + systems (such as Digital Alphas running GNU/Linux). + + * Fix run-time crash involving `NAMELIST' on 64-bit machines such as + Alphas. + + * Fix `g77' version of `libf2c' so it no longer produces a spurious + `I/O recursion' diagnostic at run time when an I/O operation (such + as `READ *,I') is interrupted in a manner that causes the program + to be terminated via the `f_exit' routine (such as via `C-c'). + + * Fix `g77' crash triggered by `CASE' statement with an omitted + lower or upper bound. + + * Fix `g77' crash compiling references to `CPU_Time' intrinsic. + + * Fix `g77' crash (or apparently infinite run-time) when compiling + certain complicated expressions involving `COMPLEX' arithmetic + (especially multiplication). + + * Fix `g77' crash on statements such as `PRINT *, + (REAL(Z(I)),I=1,2)', where `Z' is `DOUBLE COMPLEX'. + + * Fix a `g++' crash. + + * Support `FORMAT(I)' when EXPR is a compile-time constant + `INTEGER' expression. + + * Fix `g77' `-g' option so procedures that use `ENTRY' can be + stepped through, line by line, in `gdb'. + + * Fix a profiling-related bug in `gcc' back end for Intel x86 + architecture. + + * Allow any `REAL' argument to intrinsics `Second' and `CPU_Time'. + + * Allow any numeric argument to intrinsics `Int2' and `Int8'. + + * Use `tempnam', if available, to open scratch files (as in + `OPEN(STATUS='SCRATCH')') so that the `TMPDIR' environment + variable, if present, is used. + + * Rename the `gcc' keyword `restrict' to `__restrict__', to avoid + rejecting valid, existing, C programs. Support for `restrict' is + now more like support for `complex'. + + * Fix `-fpedantic' to not reject procedure invocations such as + `I=J()' and `CALL FOO()'. + + * Fix `-fugly-comma' to affect invocations of only external + procedures. Restore rejection of gratuitous trailing omitted + arguments to intrinsics, as in `I=MAX(3,4,,)'. + + * Fix compiler so it accepts `-fgnu-intrinsics-*' and + `-fbadu77-intrinsics-*' options. + + * Improve diagnostic messages from `libf2c' so it is more likely + that the printing of the active format string is limited to the + string, with no trailing garbage being printed. + + (Unlike `f2c', `g77' did not append a null byte to its compiled + form of every format string specified via a `FORMAT' statement. + However, `f2c' would exhibit the problem anyway for a statement + like `PRINT '(I)garbage', 1' by printing `(I)garbage' as the + format string.) + + * Improve compilation of `FORMAT' expressions so that a null byte is + appended to the last operand if it is a constant. This provides a + cleaner run-time diagnostic as provided by `libf2c' for statements + like `PRINT '(I1', 42'. + + * Fix various crashes involving code with diagnosed errors. + + * Fix cross-compilation bug when configuring `libf2c'. + + * Improve diagnostics. + + * Improve documentation and indexing. + + * Upgrade to `libf2c' as of 1997-09-23. This fixes a formatted-I/O + bug that afflicted 64-bit systems with 32-bit integers (such as + Digital Alpha running GNU/Linux). + + In `EGCS' 1.0.2 versus `EGCS' 1.0.1: + ==================================== + + * Fix `g77' crash triggered by `CASE' statement with an omitted + lower or upper bound. + + * Fix `g77' crash on statements such as `PRINT *, + (REAL(Z(I)),I=1,2)', where `Z' is `DOUBLE COMPLEX'. + + * Fix `-fPIC' (such as compiling for ELF targets) on the Intel x86 + architecture target so invalid assembler code is no longer + produced. + + * Fix `-fpedantic' to not reject procedure invocations such as + `I=J()' and `CALL FOO()'. + + * Fix `-fugly-comma' to affect invocations of only external + procedures. Restore rejection of gratuitous trailing omitted + arguments to intrinsics, as in `I=MAX(3,4,,)'. + + * Fix compiler so it accepts `-fgnu-intrinsics-*' and + `-fbadu77-intrinsics-*' options. + + In `EGCS' 1.0.1 versus `EGCS' 1.0: + ================================== + + * Fix run-time crash involving `NAMELIST' on 64-bit machines such as + Alphas. + + In `EGCS' 1.0 versus `g77' 0.5.21: + ================================== + + * Version 1.0 of `egcs' contains several regressions against version + 0.5.21 of `g77', due to using the "vanilla" `gcc' back end instead + of patching it to fix a few bugs and improve performance in a few + cases. + + Features that have been dropped from this version of `g77' due to + their being implemented via `g77'-specific patches to the `gcc' + back end in previous releases include: + + - Support for the C-language `restrict' keyword. + + - Support for the `-W' option warning about integer division by + zero. + + - The Intel x86-specific option `-malign-double' applying to + stack-allocated data as well as statically-allocate data. + + Note that the `gcc/f/gbe/' subdirectory has been removed from this + distribution as a result of `g77' being fully integrated with the + `egcs' variant of the `gcc' back end. + + * Fix code generation for iterative `DO' loops that have one or more + references to the iteration variable, or to aliases of it, in + their control expressions. For example, `DO 10 J=2,J' now is + compiled correctly. + + * Fix `DTime' intrinsic so as not to truncate results to integer + values (on some systems). + + * Some Fortran code, miscompiled by `g77' built on `gcc' version + 2.8.1 on m68k-next-nextstep3 configurations when using the `-O2' + option, is now compiled correctly. It is believed that a C + function known to miscompile on that configuration when using the + `-O2 -funroll-loops' options also is now compiled correctly. + + * Remove support for non-`egcs' versions of `gcc'. + + * Remove support for the `--driver' option, as `g77' now does all + the driving, just like `gcc'. + + * Allow any numeric argument to intrinsics `Int2' and `Int8'. + + * Improve diagnostic messages from `libf2c' so it is more likely + that the printing of the active format string is limited to the + string, with no trailing garbage being printed. + + (Unlike `f2c', `g77' did not append a null byte to its compiled + form of every format string specified via a `FORMAT' statement. + However, `f2c' would exhibit the problem anyway for a statement + like `PRINT '(I)garbage', 1' by printing `(I)garbage' as the + format string.) + + * Upgrade to `libf2c' as of 1997-09-23. This fixes a formatted-I/O + bug that afflicted 64-bit systems with 32-bit integers (such as + Digital Alpha running GNU/Linux). + + In 0.5.21: + ========== + + * Fix a code-generation bug introduced by 0.5.20 caused by loop + unrolling (by specifying `-funroll-loops' or similar). This bug + afflicted all code compiled by version 2.7.2.2.f.2 of `gcc' (C, + C++, Fortran, and so on). + + * Fix a code-generation bug manifested when combining local + `EQUIVALENCE' with a `DATA' statement that follows the first + executable statement (or is treated as an executable-context + statement as a result of using the `-fpedantic' option). + + * Fix a compiler crash that occurred when an integer division by a + constant zero is detected. Instead, when the `-W' option is + specified, the `gcc' back end issues a warning about such a case. + This bug afflicted all code compiled by version 2.7.2.2.f.2 of + `gcc' (C, C++, Fortran, and so on). + + * Fix a compiler crash that occurred in some cases of procedure + inlining. (Such cases became more frequent in 0.5.20.) + + * Fix a compiler crash resulting from using `DATA' or similar to + initialize a `COMPLEX' variable or array to zero. + + * Fix compiler crashes involving use of `AND', `OR', or `XOR' + intrinsics. + + * Fix compiler bug triggered when using a `COMMON' or `EQUIVALENCE' + variable as the target of an `ASSIGN' or assigned-`GOTO' statement. + + * Fix compiler crashes due to using the name of a some non-standard + intrinsics (such as `FTell' or `FPutC') as such and as the name of + a procedure or common block. Such dual use of a name in a program + is allowed by the standard. + + * Place automatic arrays on the stack, even if `SAVE' or the + `-fno-automatic' option is in effect. This avoids a compiler + crash in some cases. + + * The `-malign-double' option now reliably aligns `DOUBLE PRECISION' + optimally on Pentium and Pentium Pro architectures (586 and 686 in + `gcc'). + + * New option `-Wno-globals' disables warnings about "suspicious" use + of a name both as a global name and as the implicit name of an + intrinsic, and warnings about disagreements over the number or + natures of arguments passed to global procedures, or the natures + of the procedures themselves. + + The default is to issue such warnings, which are new as of this + version of `g77'. + + * New option `-fno-globals' disables diagnostics about potentially + fatal disagreements analysis problems, such as disagreements over + the number or natures of arguments passed to global procedures, or + the natures of those procedures themselves. + + The default is to issue such diagnostics and flag the compilation + as unsuccessful. With this option, the diagnostics are issued as + warnings, or, if `-Wno-globals' is specified, are not issued at + all. + + This option also disables inlining of global procedures, to avoid + compiler crashes resulting from coding errors that these + diagnostics normally would identify. + + * Diagnose cases where a reference to a procedure disagrees with the + type of that procedure, or where disagreements about the number or + nature of arguments exist. This avoids a compiler crash. + + * Fix parsing bug whereby `g77' rejected a second initialization + specification immediately following the first's closing `/' without + an intervening comma in a `DATA' statement, and the second + specification was an implied-DO list. + + * Improve performance of the `gcc' back end so certain complicated + expressions involving `COMPLEX' arithmetic (especially + multiplication) don't appear to take forever to compile. + + * Fix a couple of profiling-related bugs in `gcc' back end. + + * Integrate GNU Ada's (GNAT's) changes to the back end, which + consist almost entirely of bug fixes. These fixes are circa + version 3.10p of GNAT. + + * Include some other `gcc' fixes that seem useful in `g77''s version + of `gcc'. (See `gcc/ChangeLog' for details--compare it to that + file in the vanilla `gcc-2.7.2.3.tar.gz' distribution.) + + * Fix `libU77' routines that accept file and other names to strip + trailing blanks from them, for consistency with other + implementations. Blanks may be forcibly appended to such names by + appending a single null character (`CHAR(0)') to the significant + trailing blanks. + + * Fix `CHMOD' intrinsic to work with file names that have embedded + blanks, commas, and so on. + + * Fix `SIGNAL' intrinsic so it accepts an optional third `Status' + argument. + + * Fix `IDATE()' intrinsic subroutine (VXT form) so it accepts + arguments in the correct order. Documentation fixed accordingly, + and for `GMTIME()' and `LTIME()' as well. + + * Make many changes to `libU77' intrinsics to support existing code + more directly. + + Such changes include allowing both subroutine and function forms + of many routines, changing `MCLOCK()' and `TIME()' to return + `INTEGER(KIND=1)' values, introducing `MCLOCK8()' and `TIME8()' to + return `INTEGER(KIND=2)' values, and placing functions that are + intended to perform side effects in a new intrinsic group, + `badu77'. + + * Improve `libU77' so it is more portable. + + * Add options `-fbadu77-intrinsics-delete', + `-fbadu77-intrinsics-hide', and so on. + + * Fix crashes involving diagnosed or invalid code. + + * `g77' and `gcc' now do a somewhat better job detecting and + diagnosing arrays that are too large to handle before these cause + diagnostics during the assembler or linker phase, a compiler + crash, or generation of incorrect code. + + * Make some fixes to alias analysis code. + + * Add support for `restrict' keyword in `gcc' front end. + + * Support `gcc' version 2.7.2.3 (modified by `g77' into version + 2.7.2.3.f.1), and remove support for prior versions of `gcc'. + + * Incorporate GNAT's patches to the `gcc' back end into `g77''s, so + GNAT users do not need to apply GNAT's patches to build both GNAT + and `g77' from the same source tree. + + * Modify `make' rules and related code so that generation of Info + documentation doesn't require compilation using `gcc'. Now, any + ANSI C compiler should be adequate to produce the `g77' + documentation (in particular, the tables of intrinsics) from + scratch. + + * Add `INT2' and `INT8' intrinsics. + + * Add `CPU_TIME' intrinsic. + + * Add `ALARM' intrinsic. + + * `CTIME' intrinsic now accepts any `INTEGER' argument, not just + `INTEGER(KIND=2)'. + + * Warn when explicit type declaration disagrees with the type of an + intrinsic invocation. + + * Support `*f771' entry in `gcc' `specs' file. + + * Fix typo in `make' rule `g77-cross', used only for cross-compiling. + + * Fix `libf2c' build procedure to re-archive library if previous + attempt to archive was interrupted. + + * Change `gcc' to unroll loops only during the last invocation (of + as many as two invocations) of loop optimization. + + * Improve handling of `-fno-f2c' so that code that attempts to pass + an intrinsic as an actual argument, such as `CALL FOO(ABS)', is + rejected due to the fact that the run-time-library routine is, + effectively, compiled with `-ff2c' in effect. + + * Fix `g77' driver to recognize `-fsyntax-only' as an option that + inhibits linking, just like `-c' or `-S', and to recognize and + properly handle the `-nostdlib', `-M', `-MM', `-nodefaultlibs', + and `-Xlinker' options. + + * Upgrade to `libf2c' as of 1997-08-16. + + * Modify `libf2c' to consistently and clearly diagnose recursive I/O + (at run time). + + * `g77' driver now prints version information (such as produced by + `g77 -v') to `stderr' instead of `stdout'. + + * The `.r' suffix now designates a Ratfor source file, to be + preprocessed via the `ratfor' command, available separately. + + * Fix some aspects of how `gcc' determines what kind of system is + being configured and what kinds are supported. For example, GNU + Linux/Alpha ELF systems now are directly supported. + + * Improve diagnostics. + + * Improve documentation and indexing. + + * Include all pertinent files for `libf2c' that come from + `netlib.bell-labs.com'; give any such files that aren't quite + accurate in `g77''s version of `libf2c' the suffix `.netlib'. + + * Reserve `INTEGER(KIND=0)' for future use. + + In 0.5.20: + ========== + + * The `-fno-typeless-boz' option is now the default. + + This option specifies that non-decimal-radix constants using the + prefixed-radix form (such as `Z'1234'') are to be interpreted as + `INTEGER(KIND=1)' constants. Specify `-ftypeless-boz' to cause + such constants to be interpreted as typeless. + + (Version 0.5.19 introduced `-fno-typeless-boz' and its inverse.) + + *Note Options Controlling Fortran Dialect: Fortran Dialect Options, + for information on the `-ftypeless-boz' option. + + * Options `-ff90-intrinsics-enable' and `-fvxt-intrinsics-enable' + now are the defaults. + + Some programs might use names that clash with intrinsic names + defined (and now enabled) by these options or by the new `libU77' + intrinsics. Users of such programs might need to compile them + differently (using, for example, `-ff90-intrinsics-disable') or, + better yet, insert appropriate `EXTERNAL' statements specifying + that these names are not intended to be names of intrinsics. + + * The `ALWAYS_FLUSH' macro is no longer defined when building + `libf2c', which should result in improved I/O performance, + especially over NFS. + + _Note:_ If you have code that depends on the behavior of `libf2c' + when built with `ALWAYS_FLUSH' defined, you will have to modify + `libf2c' accordingly before building it from this and future + versions of `g77'. + + *Note Output Assumed To Flush::, for more information. + + * Dave Love's implementation of `libU77' has been added to the + version of `libf2c' distributed with and built as part of `g77'. + `g77' now knows about the routines in this library as intrinsics. + + * New option `-fvxt' specifies that the source file is written in + VXT Fortran, instead of GNU Fortran. + + *Note VXT Fortran::, for more information on the constructs + recognized when the `-fvxt' option is specified. + + * The `-fvxt-not-f90' option has been deleted, along with its + inverse, `-ff90-not-vxt'. + + If you used one of these deleted options, you should re-read the + pertinent documentation to determine which options, if any, are + appropriate for compiling your code with this version of `g77'. + + *Note Other Dialects::, for more information. + + * The `-fugly' option now issues a warning, as it likely will be + removed in a future version. + + (Enabling all the `-fugly-*' options is unlikely to be feasible, + or sensible, in the future, so users should learn to specify only + those `-fugly-*' options they really need for a particular source + file.) + + * The `-fugly-assumed' option, introduced in version 0.5.19, has + been changed to better accommodate old and new code. + + *Note Ugly Assumed-Size Arrays::, for more information. + + * Make a number of fixes to the `g77' front end and the `gcc' back + end to better support Alpha (AXP) machines. This includes + providing at least one bug-fix to the `gcc' back end for Alphas. + + * Related to supporting Alpha (AXP) machines, the `LOC()' intrinsic + and `%LOC()' construct now return values of `INTEGER(KIND=0)' type, + as defined by the GNU Fortran language. + + This type is wide enough (holds the same number of bits) as the + character-pointer type on the machine. + + On most machines, this won't make a difference, whereas, on Alphas + and other systems with 64-bit pointers, the `INTEGER(KIND=0)' type + is equivalent to `INTEGER(KIND=2)' (often referred to as + `INTEGER*8') instead of the more common `INTEGER(KIND=1)' (often + referred to as `INTEGER*4'). + + * Emulate `COMPLEX' arithmetic in the `g77' front end, to avoid bugs + in `complex' support in the `gcc' back end. New option + `-fno-emulate-complex' causes `g77' to revert the 0.5.19 behavior. + + * Fix bug whereby `REAL A(1)', for example, caused a compiler crash + if `-fugly-assumed' was in effect and A was a local (automatic) + array. That case is no longer affected by the new handling of + `-fugly-assumed'. + + * Fix `g77' command driver so that `g77 -o foo.f' no longer deletes + `foo.f' before issuing other diagnostics, and so the `-x' option + is properly handled. + + * Enable inlining of subroutines and functions by the `gcc' back end. + This works as it does for `gcc' itself--program units may be + inlined for invocations that follow them in the same program unit, + as long as the appropriate compile-time options are specified. + + * Dummy arguments are no longer assumed to potentially alias + (overlap) other dummy arguments or `COMMON' areas when any of + these are defined (assigned to) by Fortran code. + + This can result in faster and/or smaller programs when compiling + with optimization enabled, though on some systems this effect is + observed only when `-fforce-addr' also is specified. + + New options `-falias-check', `-fargument-alias', + `-fargument-noalias', and `-fno-argument-noalias-global' control + the way `g77' handles potential aliasing. + + *Note Aliasing Assumed To Work::, for detailed information on why + the new defaults might result in some programs no longer working + the way they did when compiled by previous versions of `g77'. + + * The `CONJG()' and `DCONJG()' intrinsics now are compiled in-line. + + * The bug-fix for 0.5.19.1 has been re-done. The `g77' compiler has + been changed back to assume `libf2c' has no aliasing problems in + its implementations of the `COMPLEX' (and `DOUBLE COMPLEX') + intrinsics. The `libf2c' has been changed to have no such + problems. + + As a result, 0.5.20 is expected to offer improved performance over + 0.5.19.1, perhaps as good as 0.5.19 in most or all cases, due to + this change alone. + + _Note:_ This change requires version 0.5.20 of `libf2c', at least, + when linking code produced by any versions of `g77' other than + 0.5.19.1. Use `g77 -v' to determine the version numbers of the + `libF77', `libI77', and `libU77' components of the `libf2c' + library. (If these version numbers are not printed--in + particular, if the linker complains about unresolved references to + names like `g77__fvers__'--that strongly suggests your + installation has an obsolete version of `libf2c'.) + + * New option `-fugly-assign' specifies that the same memory + locations are to be used to hold the values assigned by both + statements `I = 3' and `ASSIGN 10 TO I', for example. (Normally, + `g77' uses a separate memory location to hold assigned statement + labels.) + + *Note Ugly Assigned Labels::, for more information. + + * `FORMAT' and `ENTRY' statements now are allowed to precede + `IMPLICIT NONE' statements. + + * Produce diagnostic for unsupported `SELECT CASE' on `CHARACTER' + type, instead of crashing, at compile time. + + * Fix crashes involving diagnosed or invalid code. + + * Change approach to building `libf2c' archive (`libf2c.a') so that + members are added to it only when truly necessary, so the user + that installs an already-built `g77' doesn't need to have write + access to the build tree (whereas the user doing the build might + not have access to install new software on the system). + + * Support `gcc' version 2.7.2.2 (modified by `g77' into version + 2.7.2.2.f.2), and remove support for prior versions of `gcc'. + + * Upgrade to `libf2c' as of 1997-02-08, and fix up some of the build + procedures. + + * Improve general build procedures for `g77', fixing minor bugs + (such as deletion of any file named `f771' in the parent directory + of `gcc/'). + + * Enable full support of `INTEGER(KIND=2)' (often referred to as + `INTEGER*8') available in `libf2c' and `f2c.h' so that `f2c' users + may make full use of its features via the `g77' version of `f2c.h' + and the `INTEGER(KIND=2)' support routines in the `g77' version of + `libf2c'. + + * Improve `g77' driver and `libf2c' so that `g77 -v' yields version + information on the library. + + * The `SNGL' and `FLOAT' intrinsics now are specific intrinsics, + instead of synonyms for the generic intrinsic `REAL'. + + * New intrinsics have been added. These are `REALPART', `IMAGPART', + `COMPLEX', `LONG', and `SHORT'. + + * A new group of intrinsics, `gnu', has been added to contain the + new `REALPART', `IMAGPART', and `COMPLEX' intrinsics. An old + group, `dcp', has been removed. + + * Complain about industry-wide ambiguous references `REAL(EXPR)' and + `AIMAG(EXPR)', where EXPR is `DOUBLE COMPLEX' (or any complex type + other than `COMPLEX'), unless `-ff90' option specifies Fortran 90 + interpretation or new `-fugly-complex' option, in conjunction with + `-fnot-f90', specifies `f2c' interpretation. + + * Make improvements to diagnostics. + + * Speed up compiler a bit. + + * Improvements to documentation and indexing, including a new + chapter containing information on one, later more, diagnostics + that users are directed to pull up automatically via a message in + the diagnostic itself. + + (Hence the menu item `M' for the node `Diagnostics' in the + top-level menu of the Info documentation.) + + In previous versions: + ===================== + + Information on previous versions is archived in `gcc/gcc/f/news.texi' + following the test of the `DOC-OLDNEWS' macro. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-5 gcc-3.2.3/gcc/f/g77.info-5 *** gcc-3.2.2/gcc/f/g77.info-5 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-5 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,1256 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Changes, Next: Language, Prev: News, Up: Top + + User-visible Changes + ******************** + + This chapter describes changes to `g77' that are visible to the + programmers who actually write and maintain Fortran code they compile + with `g77'. Information on changes to installation procedures, changes + to the documentation, and bug fixes is not provided here, unless it is + likely to affect how users use `g77'. *Note News About GNU Fortran: + News, for information on such changes to `g77'. + + Note that two variants of `g77' are tracked below. The `egcs' + variant is described vis-a-vis previous versions of `egcs' and/or an + official FSF version, as appropriate. Note that all such variants are + obsolete _as of July 1999_ - the information is retained here only for + its historical value. + + Therefore, `egcs' versions sometimes have multiple listings to help + clarify how they differ from other versions, though this can make + getting a complete picture of what a particular `egcs' version contains + somewhat more difficult. + + For information on bugs in the GCC-3.2.3 version of `g77', see *Note + Known Bugs In GNU Fortran: Known Bugs. + + The following information was last updated on 2002-10-28: + + In `GCC' 3.2 versus `GCC' 3.1: + ============================== + + * Problem Reports fixed (in chronological order of submission): + `8308' + gcc-3.x does not compile files with suffix .r (RATFOR) [Fixed + in 3.2.1] + + In `GCC' 3.1 (formerly known as g77-0.5.27) versus `GCC' 3.0: + ============================================================= + + * Problem Reports fixed (in chronological order of submission): + `947' + Data statement initialization with subscript of kind INTEGER*2 + + `3743' + Reference to intrinsic `ISHFT' invalid + + `3807' + Function BESJN(integer,double) problems + + `3957' + g77 -pipe -xf77-cpp-input sends output to stdout + + `4279' + g77 -h" gives bogus output + + `4730' + ICE on valid input using CALL EXIT(%VAL(...)) + + `4752' + g77 -v -c -xf77-version /dev/null -xnone causes ice + + `4885' + BACKSPACE example that doesn't work as of gcc/g77-3.0.x + + `5122' + g77 rejects accepted use of INTEGER*2 as type of DATA + statement loop index + + `5397' + ICE on compiling source with 540 000 000 REAL array + + `5473' + ICE on BESJN(integer*8,real) + + `5837' + bug in loop unrolling + + * `g77' now has its man page generated from the texinfo + documentation, to guarantee that it remains up to date. + + * `g77' used to reject the following program on 32-bit targets: + PROGRAM PROG + DIMENSION A(140 000 000) + END + with the message: + prog.f: In program `prog': + prog.f:2: + DIMENSION A(140 000 000) + ^ + Array `a' at (^) is too large to handle + because 140 000 000 REALs is larger than the largest bit-extent + that can be expressed in 32 bits. However, bit-sizes never play a + role after offsets have been converted to byte addresses. + Therefore this check has been removed, and the limit is now 2 + Gbyte of memory (around 530 000 000 REALs). Note: On GNU/Linux + systems one has to compile programs that occupy more than 1 Gbyte + statically, i.e. `g77 -static ...'. + + * Based on work done by Juergen Pfeifer () + libf2c is now a shared library. One can still link in all objects + with the program by specifying the `-static' option. + + * Robert Anderson () thought up a two line + change that enables g77 to compile such code as: + SUBROUTINE SUB(A, N) + DIMENSION N(2) + DIMENSION A(N(1),N(2)) + A(1,1) = 1. + END + Note the use of array elements in the bounds of the adjustable + array A. + + * George Helffrich () implemented a change + in substring index checking (when specifying `-fbounds-check') + that permits the use of zero length substrings of the form + `string(1:0)'. + + * Based on code developed by Pedro Vazquez + (), the `libf2c' library is now + able to read and write files larger than 2 Gbyte on 32-bit target + machines, if the operating system supports this. + + In 0.5.26, `GCC' 3.0 versus `GCC' 2.95: + ======================================= + + * When a REWIND was issued after a WRITE statement on an unformatted + file, the implicit truncation was performed by copying the + truncated file to /tmp and copying the result back. This has been + fixed by using the `ftruncate' OS function. Thanks go to the + GAMESS developers for bringing this to our attention. + + * Using options `-g', `-ggdb' or `-gdwarf[-2]' (where appropriate + for your target) now also enables debugging information for COMMON + BLOCK and EQUIVALENCE items to be emitted. Thanks go to Andrew + Vaught () and George Helffrich + () for fixing this longstanding + problem. + + * It is not necessary anymore to use the option `-femulate-complex' + to compile Fortran code using COMPLEX arithmetic, even on 64-bit + machines (like the Alpha). This will improve code generation. + + * INTRINSIC arithmetic functions are now treated as routines that do + not depend on anything but their argument(s). This enables + further instruction scheduling, because it is known that they + cannot read or modify arbitrary locations. + + + In 0.5.25, `GCC' 2.95 (`EGCS' 1.2) versus `EGCS' 1.1.2: + ======================================================= + + * The new `-fbounds-check' option causes `g77' to compile run-time + bounds checks of array subscripts, as well as of substring start + and end points. + + * `libg2c' now supports building as multilibbed library, which + provides better support for systems that require options such as + `-mieee' to work properly. + + * Source file names with the suffixes `.FOR' and `.FPP' now are + recognized by `g77' as if they ended in `.for' and `.fpp', + respectively. + + * The order of arguments to the _subroutine_ forms of the `CTime', + `DTime', `ETime', and `TtyNam' intrinsics has been swapped. The + argument serving as the returned value for the corresponding + function forms now is the _second_ argument, making these + consistent with the other subroutine forms of `libU77' intrinsics. + + * `g77' now warns about a reference to an intrinsic that has an + interface that is not Year 2000 (Y2K) compliant. Also, `libg2c' + has been changed to increase the likelihood of catching references + to the implementations of these intrinsics using the `EXTERNAL' + mechanism (which would avoid the new warnings). + + *Note Year 2000 (Y2K) Problems::, for more information. + + * `-fno-emulate-complex' is now the default option. This should + result in improved performance of code that uses the `COMPLEX' + data type. + + * The `-malign-double' option now reliably aligns _all_ + double-precision variables and arrays on Intel x86 targets. + + * `g77' no longer generates code to maintain `errno', a C-language + concept, when performing operations such as the `SqRt' intrinsic. + + * Support for the `-fugly' option has been removed. + + + In 0.5.24 versus 0.5.23: + ======================== + + There is no `g77' version 0.5.24 at this time, or planned. 0.5.24 + is the version number designated for bug fixes and, perhaps, some new + features added, to 0.5.23. Version 0.5.23 requires `gcc' 2.8.1, as + 0.5.24 was planned to require. + + Due to `EGCS' becoming `GCC' (which is now an acronym for "GNU + Compiler Collection"), and `EGCS' 1.2 becoming officially designated + `GCC' 2.95, there seems to be no need for an actual 0.5.24 release. + + To reduce the confusion already resulting from use of 0.5.24 to + designate `g77' versions within `EGCS' versions 1.0 and 1.1, as well as + in versions of `g77' documentation and notices during that period, + "mainline" `g77' version numbering resumes at 0.5.25 with `GCC' 2.95 + (`EGCS' 1.2), skipping over 0.5.24 as a placeholder version number. + + To repeat, there is no `g77' 0.5.24, but there is now a 0.5.25. + Please remain calm and return to your keypunch units. + + In `EGCS' 1.1.2 versus `EGCS' 1.1.1: + ==================================== + + In `EGCS' 1.1.1 versus `EGCS' 1.1: + ================================== + + In `EGCS' 1.1 versus `EGCS' 1.0.3: + ================================== + + * Support `FORMAT(I)' when EXPR is a compile-time constant + `INTEGER' expression. + + * Fix `g77' `-g' option so procedures that use `ENTRY' can be + stepped through, line by line, in `gdb'. + + * Allow any `REAL' argument to intrinsics `Second' and `CPU_Time'. + + * Use `tempnam', if available, to open scratch files (as in + `OPEN(STATUS='SCRATCH')') so that the `TMPDIR' environment + variable, if present, is used. + + * `g77''s version of `libf2c' separates out the setting of global + state (such as command-line arguments and signal handling) from + `main.o' into distinct, new library archive members. + + This should make it easier to write portable applications that + have their own (non-Fortran) `main()' routine properly set up the + `libf2c' environment, even when `libf2c' (now `libg2c') is a + shared library. + + * The `g77' command now expects the run-time library to be named + `libg2c.a' instead of `libf2c.a', to ensure that a version other + than the one built and installed as part of the same `g77' version + is picked up. + + * Some diagnostics have been changed from warnings to errors, to + prevent inadvertent use of the resulting, probably buggy, programs. + These mostly include diagnostics about use of unsupported features + in the `OPEN', `INQUIRE', `READ', and `WRITE' statements, and + about truncations of various sorts of constants. + + + In `EGCS' 1.1 versus `g77' 0.5.23: + ================================== + + * `g77' now treats `%LOC(EXPR)' and `LOC(EXPR)' as "ordinary" + expressions when they are used as arguments in procedure calls. + This change applies only to global (filewide) analysis, making it + consistent with how `g77' actually generates code for these cases. + + Previously, `g77' treated these expressions as denoting special + "pointer" arguments for the purposes of filewide analysis. + + * Align static double-precision variables and arrays on Intel x86 + targets regardless of whether `-malign-double' is specified. + + Generally, this affects only local variables and arrays having the + `SAVE' attribute or given initial values via `DATA'. + + * The `g77' driver now ensures that `-lg2c' is specified in the link + phase prior to any occurrence of `-lm'. This prevents + accidentally linking to a routine in the SunOS4 `-lm' library when + the generated code wants to link to the one in `libf2c' (`libg2c'). + + * `g77' emits more debugging information when `-g' is used. + + This new information allows, for example, `which __g77_length_a' + to be used in `gdb' to determine the type of the phantom length + argument supplied with `CHARACTER' variables. + + This information pertains to internally-generated type, variable, + and other information, not to the longstanding deficiencies + vis-a-vis `COMMON' and `EQUIVALENCE'. + + * The F90 `Date_and_Time' intrinsic now is supported. + + * The F90 `System_Clock' intrinsic allows the optional arguments + (except for the `Count' argument) to be omitted. + + + In 0.5.23 versus 0.5.22: + ======================== + + * This release contains several regressions against version 0.5.22 + of `g77', due to using the "vanilla" `gcc' back end instead of + patching it to fix a few bugs and improve performance in a few + cases. + + Features that have been dropped from this version of `g77' due to + their being implemented via `g77'-specific patches to the `gcc' + back end in previous releases include: + + - Support for `__restrict__' keyword, the options + `-fargument-alias', `-fargument-noalias', and + `-fargument-noalias-global', and the corresponding + alias-analysis code. + + (`egcs' has the alias-analysis code, but not the + `__restrict__' keyword. `egcs' `g77' users benefit from the + alias-analysis code despite the lack of the `__restrict__' + keyword, which is a C-language construct.) + + - Support for the GNU compiler options `-fmove-all-movables', + `-freduce-all-givs', and `-frerun-loop-opt'. + + (`egcs' supports these options. `g77' users of `egcs' + benefit from them even if they are not explicitly specified, + because the defaults are optimized for `g77' users.) + + - Support for the `-W' option warning about integer division by + zero. + + - The Intel x86-specific option `-malign-double' applying to + stack-allocated data as well as statically-allocate data. + + * Support `gcc' version 2.8, and remove support for prior versions + of `gcc'. + + * Remove support for the `--driver' option, as `g77' now does all + the driving, just like `gcc'. + + * The `g77' command now expects the run-time library to be named + `libg2c.a' instead of `libf2c.a', to ensure that a version other + than the one built and installed as part of the same `g77' version + is picked up. + + * `g77''s version of `libf2c' separates out the setting of global + state (such as command-line arguments and signal handling) from + `main.o' into distinct, new library archive members. + + This should make it easier to write portable applications that + have their own (non-Fortran) `main()' routine properly set up the + `libf2c' environment, even when `libf2c' (now `libg2c') is a + shared library. + + * Some diagnostics have been changed from warnings to errors, to + prevent inadvertent use of the resulting, probably buggy, programs. + These mostly include diagnostics about use of unsupported features + in the `OPEN', `INQUIRE', `READ', and `WRITE' statements, and + about truncations of various sorts of constants. + + + In 0.5.22 versus 0.5.21: + ======================== + + * Fix `Signal' intrinsic so it offers portable support for 64-bit + systems (such as Digital Alphas running GNU/Linux). + + * Support `FORMAT(I)' when EXPR is a compile-time constant + `INTEGER' expression. + + * Fix `g77' `-g' option so procedures that use `ENTRY' can be + stepped through, line by line, in `gdb'. + + * Allow any `REAL' argument to intrinsics `Second' and `CPU_Time'. + + * Allow any numeric argument to intrinsics `Int2' and `Int8'. + + * Use `tempnam', if available, to open scratch files (as in + `OPEN(STATUS='SCRATCH')') so that the `TMPDIR' environment + variable, if present, is used. + + * Rename the `gcc' keyword `restrict' to `__restrict__', to avoid + rejecting valid, existing, C programs. Support for `restrict' is + now more like support for `complex'. + + * Fix `-fugly-comma' to affect invocations of only external + procedures. Restore rejection of gratuitous trailing omitted + arguments to intrinsics, as in `I=MAX(3,4,,)'. + + * Fix compiler so it accepts `-fgnu-intrinsics-*' and + `-fbadu77-intrinsics-*' options. + + + In `EGCS' 1.0.2 versus `EGCS' 1.0.1: + ==================================== + + * Fix compiler so it accepts `-fgnu-intrinsics-*' and + `-fbadu77-intrinsics-*' options. + + In `EGCS' 1.0.1 versus `EGCS' 1.0: + ================================== + + In `EGCS' 1.0 versus `g77' 0.5.21: + ================================== + + * Version 1.0 of `egcs' contains several regressions against version + 0.5.21 of `g77', due to using the "vanilla" `gcc' back end instead + of patching it to fix a few bugs and improve performance in a few + cases. + + Features that have been dropped from this version of `g77' due to + their being implemented via `g77'-specific patches to the `gcc' + back end in previous releases include: + + - Support for the C-language `restrict' keyword. + + - Support for the `-W' option warning about integer division by + zero. + + - The Intel x86-specific option `-malign-double' applying to + stack-allocated data as well as statically-allocate data. + + * Remove support for the `--driver' option, as `g77' now does all + the driving, just like `gcc'. + + * Allow any numeric argument to intrinsics `Int2' and `Int8'. + + + In 0.5.21: + ========== + + * When the `-W' option is specified, `gcc', `g77', and other GNU + compilers that incorporate the `gcc' back end as modified by + `g77', issue a warning about integer division by constant zero. + + * New option `-Wno-globals' disables warnings about "suspicious" use + of a name both as a global name and as the implicit name of an + intrinsic, and warnings about disagreements over the number or + natures of arguments passed to global procedures, or the natures + of the procedures themselves. + + The default is to issue such warnings, which are new as of this + version of `g77'. + + * New option `-fno-globals' disables diagnostics about potentially + fatal disagreements analysis problems, such as disagreements over + the number or natures of arguments passed to global procedures, or + the natures of those procedures themselves. + + The default is to issue such diagnostics and flag the compilation + as unsuccessful. With this option, the diagnostics are issued as + warnings, or, if `-Wno-globals' is specified, are not issued at + all. + + This option also disables inlining of global procedures, to avoid + compiler crashes resulting from coding errors that these + diagnostics normally would identify. + + * Fix `libU77' routines that accept file and other names to strip + trailing blanks from them, for consistency with other + implementations. Blanks may be forcibly appended to such names by + appending a single null character (`CHAR(0)') to the significant + trailing blanks. + + * Fix `CHMOD' intrinsic to work with file names that have embedded + blanks, commas, and so on. + + * Fix `SIGNAL' intrinsic so it accepts an optional third `Status' + argument. + + * Make many changes to `libU77' intrinsics to support existing code + more directly. + + Such changes include allowing both subroutine and function forms + of many routines, changing `MCLOCK()' and `TIME()' to return + `INTEGER(KIND=1)' values, introducing `MCLOCK8()' and `TIME8()' to + return `INTEGER(KIND=2)' values, and placing functions that are + intended to perform side effects in a new intrinsic group, + `badu77'. + + * Add options `-fbadu77-intrinsics-delete', + `-fbadu77-intrinsics-hide', and so on. + + * Add `INT2' and `INT8' intrinsics. + + * Add `CPU_TIME' intrinsic. + + * Add `ALARM' intrinsic. + + * `CTIME' intrinsic now accepts any `INTEGER' argument, not just + `INTEGER(KIND=2)'. + + * `g77' driver now prints version information (such as produced by + `g77 -v') to `stderr' instead of `stdout'. + + * The `.r' suffix now designates a Ratfor source file, to be + preprocessed via the `ratfor' command, available separately. + + + In 0.5.20: + ========== + + * The `-fno-typeless-boz' option is now the default. + + This option specifies that non-decimal-radix constants using the + prefixed-radix form (such as `Z'1234'') are to be interpreted as + `INTEGER(KIND=1)' constants. Specify `-ftypeless-boz' to cause + such constants to be interpreted as typeless. + + (Version 0.5.19 introduced `-fno-typeless-boz' and its inverse.) + + *Note Options Controlling Fortran Dialect: Fortran Dialect Options, + for information on the `-ftypeless-boz' option. + + * Options `-ff90-intrinsics-enable' and `-fvxt-intrinsics-enable' + now are the defaults. + + Some programs might use names that clash with intrinsic names + defined (and now enabled) by these options or by the new `libU77' + intrinsics. Users of such programs might need to compile them + differently (using, for example, `-ff90-intrinsics-disable') or, + better yet, insert appropriate `EXTERNAL' statements specifying + that these names are not intended to be names of intrinsics. + + * The `ALWAYS_FLUSH' macro is no longer defined when building + `libf2c', which should result in improved I/O performance, + especially over NFS. + + _Note:_ If you have code that depends on the behavior of `libf2c' + when built with `ALWAYS_FLUSH' defined, you will have to modify + `libf2c' accordingly before building it from this and future + versions of `g77'. + + *Note Output Assumed To Flush::, for more information. + + * Dave Love's implementation of `libU77' has been added to the + version of `libf2c' distributed with and built as part of `g77'. + `g77' now knows about the routines in this library as intrinsics. + + * New option `-fvxt' specifies that the source file is written in + VXT Fortran, instead of GNU Fortran. + + *Note VXT Fortran::, for more information on the constructs + recognized when the `-fvxt' option is specified. + + * The `-fvxt-not-f90' option has been deleted, along with its + inverse, `-ff90-not-vxt'. + + If you used one of these deleted options, you should re-read the + pertinent documentation to determine which options, if any, are + appropriate for compiling your code with this version of `g77'. + + *Note Other Dialects::, for more information. + + * The `-fugly' option now issues a warning, as it likely will be + removed in a future version. + + (Enabling all the `-fugly-*' options is unlikely to be feasible, + or sensible, in the future, so users should learn to specify only + those `-fugly-*' options they really need for a particular source + file.) + + * The `-fugly-assumed' option, introduced in version 0.5.19, has + been changed to better accommodate old and new code. + + *Note Ugly Assumed-Size Arrays::, for more information. + + * Related to supporting Alpha (AXP) machines, the `LOC()' intrinsic + and `%LOC()' construct now return values of `INTEGER(KIND=0)' type, + as defined by the GNU Fortran language. + + This type is wide enough (holds the same number of bits) as the + character-pointer type on the machine. + + On most machines, this won't make a difference, whereas, on Alphas + and other systems with 64-bit pointers, the `INTEGER(KIND=0)' type + is equivalent to `INTEGER(KIND=2)' (often referred to as + `INTEGER*8') instead of the more common `INTEGER(KIND=1)' (often + referred to as `INTEGER*4'). + + * Emulate `COMPLEX' arithmetic in the `g77' front end, to avoid bugs + in `complex' support in the `gcc' back end. New option + `-fno-emulate-complex' causes `g77' to revert the 0.5.19 behavior. + + * Dummy arguments are no longer assumed to potentially alias + (overlap) other dummy arguments or `COMMON' areas when any of + these are defined (assigned to) by Fortran code. + + This can result in faster and/or smaller programs when compiling + with optimization enabled, though on some systems this effect is + observed only when `-fforce-addr' also is specified. + + New options `-falias-check', `-fargument-alias', + `-fargument-noalias', and `-fno-argument-noalias-global' control + the way `g77' handles potential aliasing. + + *Note Aliasing Assumed To Work::, for detailed information on why + the new defaults might result in some programs no longer working + the way they did when compiled by previous versions of `g77'. + + * New option `-fugly-assign' specifies that the same memory + locations are to be used to hold the values assigned by both + statements `I = 3' and `ASSIGN 10 TO I', for example. (Normally, + `g77' uses a separate memory location to hold assigned statement + labels.) + + *Note Ugly Assigned Labels::, for more information. + + * `FORMAT' and `ENTRY' statements now are allowed to precede + `IMPLICIT NONE' statements. + + * Enable full support of `INTEGER(KIND=2)' (often referred to as + `INTEGER*8') available in `libf2c' and `f2c.h' so that `f2c' users + may make full use of its features via the `g77' version of `f2c.h' + and the `INTEGER(KIND=2)' support routines in the `g77' version of + `libf2c'. + + * Improve `g77' driver and `libf2c' so that `g77 -v' yields version + information on the library. + + * The `SNGL' and `FLOAT' intrinsics now are specific intrinsics, + instead of synonyms for the generic intrinsic `REAL'. + + * New intrinsics have been added. These are `REALPART', `IMAGPART', + `COMPLEX', `LONG', and `SHORT'. + + * A new group of intrinsics, `gnu', has been added to contain the + new `REALPART', `IMAGPART', and `COMPLEX' intrinsics. An old + group, `dcp', has been removed. + + * Complain about industry-wide ambiguous references `REAL(EXPR)' and + `AIMAG(EXPR)', where EXPR is `DOUBLE COMPLEX' (or any complex type + other than `COMPLEX'), unless `-ff90' option specifies Fortran 90 + interpretation or new `-fugly-complex' option, in conjunction with + `-fnot-f90', specifies `f2c' interpretation. + + + In previous versions: + ===================== + + Information on previous versions is archived in `gcc/gcc/f/news.texi' + following the test of the `DOC-OLDNEWS' macro. + +  + File: g77.info, Node: Language, Next: Compiler, Prev: Changes, Up: Top + + The GNU Fortran Language + ************************ + + GNU Fortran supports a variety of extensions to, and dialects of, + the Fortran language. Its primary base is the ANSI FORTRAN 77 + standard, currently available on the network at + `http://www.fortran.com/fortran/F77_std/rjcnf0001.html' or as + monolithic text at + `http://www.fortran.com/fortran/F77_std/f77_std.html'. It offers some + extensions that are popular among users of UNIX `f77' and `f2c' + compilers, some that are popular among users of other compilers (such + as Digital products), some that are popular among users of the newer + Fortran 90 standard, and some that are introduced by GNU Fortran. + + (If you need a text on Fortran, a few freely available electronic + references have pointers from `http://www.fortran.com/fortran/Books/'. + There is a `cooperative net project', `User Notes on Fortran + Programming' at `ftp://vms.huji.ac.il/fortran/' and mirrors elsewhere; + some of this material might not apply specifically to `g77'.) + + Part of what defines a particular implementation of a Fortran + system, such as `g77', is the particular characteristics of how it + supports types, constants, and so on. Much of this is left up to the + implementation by the various Fortran standards and accepted practice + in the industry. + + The GNU Fortran _language_ is described below. Much of the material + is organized along the same lines as the ANSI FORTRAN 77 standard + itself. + + *Note Other Dialects::, for information on features `g77' supports + that are not part of the GNU Fortran language. + + _Note_: This portion of the documentation definitely needs a lot of + work! + + * Menu: + + Relationship to the ANSI FORTRAN 77 standard: + * Direction of Language Development:: Where GNU Fortran is headed. + * Standard Support:: Degree of support for the standard. + + Extensions to the ANSI FORTRAN 77 standard: + * Conformance:: + * Notation Used:: + * Terms and Concepts:: + * Characters Lines Sequence:: + * Data Types and Constants:: + * Expressions:: + * Specification Statements:: + * Control Statements:: + * Functions and Subroutines:: + * Scope and Classes of Names:: + * I/O:: + * Fortran 90 Features:: + +  + File: g77.info, Node: Direction of Language Development, Next: Standard Support, Up: Language + + Direction of Language Development + ================================= + + The purpose of the following description of the GNU Fortran language + is to promote wide portability of GNU Fortran programs. + + GNU Fortran is an evolving language, due to the fact that `g77' + itself is in beta test. Some current features of the language might + later be redefined as dialects of Fortran supported by `g77' when + better ways to express these features are added to `g77', for example. + Such features would still be supported by `g77', but would be available + only when one or more command-line options were used. + + The GNU Fortran _language_ is distinct from the GNU Fortran + _compilation system_ (`g77'). + + For example, `g77' supports various dialects of Fortran--in a sense, + these are languages other than GNU Fortran--though its primary purpose + is to support the GNU Fortran language, which also is described in its + documentation and by its implementation. + + On the other hand, non-GNU compilers might offer support for the GNU + Fortran language, and are encouraged to do so. + + Currently, the GNU Fortran language is a fairly fuzzy object. It + represents something of a cross between what `g77' accepts when + compiling using the prevailing defaults and what this document + describes as being part of the language. + + Future versions of `g77' are expected to clarify the definition of + the language in the documentation. Often, this will mean adding new + features to the language, in the form of both new documentation and new + support in `g77'. However, it might occasionally mean removing a + feature from the language itself to "dialect" status. In such a case, + the documentation would be adjusted to reflect the change, and `g77' + itself would likely be changed to require one or more command-line + options to continue supporting the feature. + + The development of the GNU Fortran language is intended to strike a + balance between: + + * Serving as a mostly-upwards-compatible language from the de facto + UNIX Fortran dialect as supported by `f77'. + + * Offering new, well-designed language features. Attributes of such + features include not making existing code any harder to read (for + those who might be unaware that the new features are not in use) + and not making state-of-the-art compilers take longer to issue + diagnostics, among others. + + * Supporting existing, well-written code without gratuitously + rejecting non-standard constructs, regardless of the origin of the + code (its dialect). + + * Offering default behavior and command-line options to reduce and, + where reasonable, eliminate the need for programmers to make any + modifications to code that already works in existing production + environments. + + * Diagnosing constructs that have different meanings in different + systems, languages, and dialects, while offering clear, less + ambiguous ways to express each of the different meanings so + programmers can change their code appropriately. + + One of the biggest practical challenges for the developers of the + GNU Fortran language is meeting the sometimes contradictory demands of + the above items. + + For example, a feature might be widely used in one popular + environment, but the exact same code that utilizes that feature might + not work as expected--perhaps it might mean something entirely + different--in another popular environment. + + Traditionally, Fortran compilers--even portable ones--have solved + this problem by simply offering the appropriate feature to users of the + respective systems. This approach treats users of various Fortran + systems and dialects as remote "islands", or camps, of programmers, and + assume that these camps rarely come into contact with each other (or, + especially, with each other's code). + + Project GNU takes a radically different approach to software and + language design, in that it assumes that users of GNU software do not + necessarily care what kind of underlying system they are using, + regardless of whether they are using software (at the user-interface + level) or writing it (for example, writing Fortran or C code). + + As such, GNU users rarely need consider just what kind of underlying + hardware (or, in many cases, operating system) they are using at any + particular time. They can use and write software designed for a + general-purpose, widely portable, heterogenous environment--the GNU + environment. + + In line with this philosophy, GNU Fortran must evolve into a product + that is widely ported and portable not only in the sense that it can be + successfully built, installed, and run by users, but in the larger + sense that its users can use it in the same way, and expect largely the + same behaviors from it, regardless of the kind of system they are using + at any particular time. + + This approach constrains the solutions `g77' can use to resolve + conflicts between various camps of Fortran users. If these two camps + disagree about what a particular construct should mean, `g77' cannot + simply be changed to treat that particular construct as having one + meaning without comment (such as a warning), lest the users expecting + it to have the other meaning are unpleasantly surprised that their code + misbehaves when executed. + + The use of the ASCII backslash character in character constants is + an excellent (and still somewhat unresolved) example of this kind of + controversy. *Note Backslash in Constants::. Other examples are + likely to arise in the future, as `g77' developers strive to improve + its ability to accept an ever-wider variety of existing Fortran code + without requiring significant modifications to said code. + + Development of GNU Fortran is further constrained by the desire to + avoid requiring programmers to change their code. This is important + because it allows programmers, administrators, and others to more + faithfully evaluate and validate `g77' (as an overall product and as + new versions are distributed) without having to support multiple + versions of their programs so that they continue to work the same way + on their existing systems (non-GNU perhaps, but possibly also earlier + versions of `g77'). + +  + File: g77.info, Node: Standard Support, Next: Conformance, Prev: Direction of Language Development, Up: Language + + ANSI FORTRAN 77 Standard Support + ================================ + + GNU Fortran supports ANSI FORTRAN 77 with the following caveats. In + summary, the only ANSI FORTRAN 77 features `g77' doesn't support are + those that are probably rarely used in actual code, some of which are + explicitly disallowed by the Fortran 90 standard. + + * Menu: + + * No Passing External Assumed-length:: CHAR*(*) CFUNC restriction. + * No Passing Dummy Assumed-length:: CHAR*(*) CFUNC restriction. + * No Pathological Implied-DO:: No `((..., I=...), I=...)'. + * No Useless Implied-DO:: No `(A, I=1, 1)'. + +  + File: g77.info, Node: No Passing External Assumed-length, Next: No Passing Dummy Assumed-length, Up: Standard Support + + No Passing External Assumed-length + ---------------------------------- + + `g77' disallows passing of an external procedure as an actual + argument if the procedure's type is declared `CHARACTER*(*)'. For + example: + + CHARACTER*(*) CFUNC + EXTERNAL CFUNC + CALL FOO(CFUNC) + END + + It isn't clear whether the standard considers this conforming. + +  + File: g77.info, Node: No Passing Dummy Assumed-length, Next: No Pathological Implied-DO, Prev: No Passing External Assumed-length, Up: Standard Support + + No Passing Dummy Assumed-length + ------------------------------- + + `g77' disallows passing of a dummy procedure as an actual argument + if the procedure's type is declared `CHARACTER*(*)'. + + SUBROUTINE BAR(CFUNC) + CHARACTER*(*) CFUNC + EXTERNAL CFUNC + CALL FOO(CFUNC) + END + + It isn't clear whether the standard considers this conforming. + +  + File: g77.info, Node: No Pathological Implied-DO, Next: No Useless Implied-DO, Prev: No Passing Dummy Assumed-length, Up: Standard Support + + No Pathological Implied-DO + -------------------------- + + The `DO' variable for an implied-`DO' construct in a `DATA' + statement may not be used as the `DO' variable for an outer + implied-`DO' construct. For example, this fragment is disallowed by + `g77': + + DATA ((A(I, I), I= 1, 10), I= 1, 10) /.../ + + This also is disallowed by Fortran 90, as it offers no additional + capabilities and would have a variety of possible meanings. + + Note that it is _very_ unlikely that any production Fortran code + tries to use this unsupported construct. + +  + File: g77.info, Node: No Useless Implied-DO, Prev: No Pathological Implied-DO, Up: Standard Support + + No Useless Implied-DO + --------------------- + + An array element initializer in an implied-`DO' construct in a + `DATA' statement must contain at least one reference to the `DO' + variables of each outer implied-`DO' construct. For example, this + fragment is disallowed by `g77': + + DATA (A, I= 1, 1) /1./ + + This also is disallowed by Fortran 90, as FORTRAN 77's more permissive + requirements offer no additional capabilities. However, `g77' doesn't + necessarily diagnose all cases where this requirement is not met. + + Note that it is _very_ unlikely that any production Fortran code + tries to use this unsupported construct. + +  + File: g77.info, Node: Conformance, Next: Notation Used, Prev: Standard Support, Up: Language + + Conformance + =========== + + (The following information augments or overrides the information in + Section 1.4 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 1 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + The definition of the GNU Fortran language is akin to that of the + ANSI FORTRAN 77 language in that it does not generally require + conforming implementations to diagnose cases where programs do not + conform to the language. + + However, `g77' as a compiler is being developed in a way that is + intended to enable it to diagnose such cases in an easy-to-understand + manner. + + A program that conforms to the GNU Fortran language should, when + compiled, linked, and executed using a properly installed `g77' system, + perform as described by the GNU Fortran language definition. Reasons + for different behavior include, among others: + + * Use of resources (memory--heap, stack, and so on; disk space; CPU + time; etc.) exceeds those of the system. + + * Range and/or precision of calculations required by the program + exceeds that of the system. + + * Excessive reliance on behaviors that are system-dependent + (non-portable Fortran code). + + * Bugs in the program. + + * Bug in `g77'. + + * Bugs in the system. + + Despite these "loopholes", the availability of a clear specification + of the language of programs submitted to `g77', as this document is + intended to provide, is considered an important aspect of providing a + robust, clean, predictable Fortran implementation. + + The definition of the GNU Fortran language, while having no special + legal status, can therefore be viewed as a sort of contract, or + agreement. This agreement says, in essence, "if you write a program in + this language, and run it in an environment (such as a `g77' system) + that supports this language, the program should behave in a largely + predictable way". + +  + File: g77.info, Node: Notation Used, Next: Terms and Concepts, Prev: Conformance, Up: Language + + Notation Used in This Chapter + ============================= + + (The following information augments or overrides the information in + Section 1.5 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 1 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + In this chapter, "must" denotes a requirement, "may" denotes + permission, and "must not" and "may not" denote prohibition. Terms + such as "might", "should", and "can" generally add little or nothing in + the way of weight to the GNU Fortran language itself, but are used to + explain or illustrate the language. + + For example: + + ``The `FROBNITZ' statement must precede all executable + statements in a program unit, and may not specify any dummy + arguments. It may specify local or common variables and arrays. + Its use should be limited to portions of the program designed to + be non-portable and system-specific, because it might cause the + containing program unit to behave quite differently on different + systems.'' + + Insofar as the GNU Fortran language is specified, the requirements + and permissions denoted by the above sample statement are limited to + the placement of the statement and the kinds of things it may specify. + The rest of the statement--the content regarding non-portable portions + of the program and the differing behavior of program units containing + the `FROBNITZ' statement--does not pertain the GNU Fortran language + itself. That content offers advice and warnings about the `FROBNITZ' + statement. + + _Remember:_ The GNU Fortran language definition specifies both what + constitutes a valid GNU Fortran program and how, given such a program, + a valid GNU Fortran implementation is to interpret that program. + + It is _not_ incumbent upon a valid GNU Fortran implementation to + behave in any particular way, any consistent way, or any predictable + way when it is asked to interpret input that is _not_ a valid GNU + Fortran program. + + Such input is said to have "undefined" behavior when interpreted by + a valid GNU Fortran implementation, though an implementation may choose + to specify behaviors for some cases of inputs that are not valid GNU + Fortran programs. + + Other notation used herein is that of the GNU texinfo format, which + is used to generate printed hardcopy, on-line hypertext (Info), and + on-line HTML versions, all from a single source document. This + notation is used as follows: + + * Keywords defined by the GNU Fortran language are shown in + uppercase, as in: `COMMON', `INTEGER', and `BLOCK DATA'. + + Note that, in practice, many Fortran programs are written in + lowercase--uppercase is used in this manual as a means to readily + distinguish keywords and sample Fortran-related text from the + prose in this document. + + * Portions of actual sample program, input, or output text look like + this: `Actual program text'. + + Generally, uppercase is used for all Fortran-specific and + Fortran-related text, though this does not always include literal + text within Fortran code. + + For example: `PRINT *, 'My name is Bob''. + + * A metasyntactic variable--that is, a name used in this document to + serve as a placeholder for whatever text is used by the user or + programmer--appears as shown in the following example: + + "The `INTEGER IVAR' statement specifies that IVAR is a variable or + array of type `INTEGER'." + + In the above example, any valid text may be substituted for the + metasyntactic variable IVAR to make the statement apply to a + specific instance, as long as the same text is substituted for + _both_ occurrences of IVAR. + + * Ellipses ("...") are used to indicate further text that is either + unimportant or expanded upon further, elsewhere. + + * Names of data types are in the style of Fortran 90, in most cases. + + *Note Kind Notation::, for information on the relationship between + Fortran 90 nomenclature (such as `INTEGER(KIND=1)') and the more + traditional, less portably concise nomenclature (such as + `INTEGER*4'). + +  + File: g77.info, Node: Terms and Concepts, Next: Characters Lines Sequence, Prev: Notation Used, Up: Language + + Fortran Terms and Concepts + ========================== + + (The following information augments or overrides the information in + Chapter 2 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 2 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + * Menu: + + * Syntactic Items:: + * Statements Comments Lines:: + * Scope of Names and Labels:: + +  + File: g77.info, Node: Syntactic Items, Next: Statements Comments Lines, Up: Terms and Concepts + + Syntactic Items + --------------- + + (Corresponds to Section 2.2 of ANSI X3.9-1978 FORTRAN 77.) + + In GNU Fortran, a symbolic name is at least one character long, and + has no arbitrary upper limit on length. However, names of entities + requiring external linkage (such as external functions, external + subroutines, and `COMMON' areas) might be restricted to some arbitrary + length by the system. Such a restriction is no more constrained than + that of one through six characters. + + Underscores (`_') are accepted in symbol names after the first + character (which must be a letter). + +  + File: g77.info, Node: Statements Comments Lines, Next: Scope of Names and Labels, Prev: Syntactic Items, Up: Terms and Concepts + + Statements, Comments, and Lines + ------------------------------- + + (Corresponds to Section 2.3 of ANSI X3.9-1978 FORTRAN 77.) + + Use of an exclamation point (`!') to begin a trailing comment (a + comment that extends to the end of the same source line) is permitted + under the following conditions: + + * The exclamation point does not appear in column 6. Otherwise, it + is treated as an indicator of a continuation line. + + * The exclamation point appears outside a character or Hollerith + constant. Otherwise, the exclamation point is considered part of + the constant. + + * The exclamation point appears to the left of any other possible + trailing comment. That is, a trailing comment may contain + exclamation points in their commentary text. + + Use of a semicolon (`;') as a statement separator is permitted under + the following conditions: + + * The semicolon appears outside a character or Hollerith constant. + Otherwise, the semicolon is considered part of the constant. + + * The semicolon appears to the left of a trailing comment. + Otherwise, the semicolon is considered part of that comment. + + * Neither a logical `IF' statement nor a non-construct `WHERE' + statement (a Fortran 90 feature) may be followed (in the same, + possibly continued, line) by a semicolon used as a statement + separator. + + This restriction avoids the confusion that can result when reading + a line such as: + + IF (VALIDP) CALL FOO; CALL BAR + + Some readers might think the `CALL BAR' is executed only if + `VALIDP' is `.TRUE.', while others might assume its execution is + unconditional. + + (At present, `g77' does not diagnose code that violates this + restriction.) + +  + File: g77.info, Node: Scope of Names and Labels, Prev: Statements Comments Lines, Up: Terms and Concepts + + Scope of Symbolic Names and Statement Labels + -------------------------------------------- + + (Corresponds to Section 2.9 of ANSI X3.9-1978 FORTRAN 77.) + + Included in the list of entities that have a scope of a program unit + are construct names (a Fortran 90 feature). *Note Construct Names::, + for more information. + +  + File: g77.info, Node: Characters Lines Sequence, Next: Data Types and Constants, Prev: Terms and Concepts, Up: Language + + Characters, Lines, and Execution Sequence + ========================================= + + (The following information augments or overrides the information in + Chapter 3 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 3 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + * Menu: + + * Character Set:: + * Lines:: + * Continuation Line:: + * Statements:: + * Statement Labels:: + * Order:: + * INCLUDE:: + * Cpp-style directives:: + +  + File: g77.info, Node: Character Set, Next: Lines, Up: Characters Lines Sequence + + GNU Fortran Character Set + ------------------------- + + (Corresponds to Section 3.1 of ANSI X3.9-1978 FORTRAN 77.) + + Letters include uppercase letters (the twenty-six characters of the + English alphabet) and lowercase letters (their lowercase equivalent). + Generally, lowercase letters may be used in place of uppercase letters, + though in character and Hollerith constants, they are distinct. + + Special characters include: + + * Semicolon (`;') + + * Exclamation point (`!') + + * Double quote (`"') + + * Backslash (`\') + + * Question mark (`?') + + * Hash mark (`#') + + * Ampersand (`&') + + * Percent sign (`%') + + * Underscore (`_') + + * Open angle (`<') + + * Close angle (`>') + + * The FORTRAN 77 special characters (, `=', `+', `-', `*', `/', + `(', `)', `,', `.', `$', `'', and `:') + + Note that this document refers to as "space", while X3.9-1978 + FORTRAN 77 refers to it as "blank". + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-6 gcc-3.2.3/gcc/f/g77.info-6 *** gcc-3.2.2/gcc/f/g77.info-6 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-6 Tue Apr 22 07:07:23 2003 *************** *** 0 **** --- 1,1203 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Lines, Next: Continuation Line, Prev: Character Set, Up: Characters Lines Sequence + + Lines + ----- + + (Corresponds to Section 3.2 of ANSI X3.9-1978 FORTRAN 77.) + + The way a Fortran compiler views source files depends entirely on the + implementation choices made for the compiler, since those choices are + explicitly left to the implementation by the published Fortran + standards. + + The GNU Fortran language mandates a view applicable to UNIX-like + text files--files that are made up of an arbitrary number of lines, + each with an arbitrary number of characters (sometimes called + stream-based files). + + This view does not apply to types of files that are specified as + having a particular number of characters on every single line (sometimes + referred to as record-based files). + + Because a "line in a program unit is a sequence of 72 characters", + to quote X3.9-1978, the GNU Fortran language specifies that a + stream-based text file is translated to GNU Fortran lines as follows: + + * A newline in the file is the character that represents the end of + a line of text to the underlying system. For example, on + ASCII-based systems, a newline is the character, which has + ASCII value 10 (decimal). + + * Each newline in the file serves to end the line of text that + precedes it (and that does not contain a newline). + + * The end-of-file marker (`EOF') also serves to end the line of text + that precedes it (and that does not contain a newline). + + * Any line of text that is shorter than 72 characters is padded to + that length with spaces (called "blanks" in the standard). + + * Any line of text that is longer than 72 characters is truncated to + that length, but the truncated remainder must consist entirely of + spaces. + + * Characters other than newline and the GNU Fortran character set + are invalid. + + For the purposes of the remainder of this description of the GNU + Fortran language, the translation described above has already taken + place, unless otherwise specified. + + The result of the above translation is that the source file appears, + in terms of the remainder of this description of the GNU Fortran + language, as if it had an arbitrary number of 72-character lines, each + character being among the GNU Fortran character set. + + For example, if the source file itself has two newlines in a row, + the second newline becomes, after the above translation, a single line + containing 72 spaces. + +  + File: g77.info, Node: Continuation Line, Next: Statements, Prev: Lines, Up: Characters Lines Sequence + + Continuation Line + ----------------- + + (Corresponds to Section 3.2.3 of ANSI X3.9-1978 FORTRAN 77.) + + A continuation line is any line that both + + * Contains a continuation character, and + + * Contains only spaces in columns 1 through 5 + + A continuation character is any character of the GNU Fortran + character set other than space () or zero (`0') in column 6, or a + digit (`0' through `9') in column 7 through 72 of a line that has only + spaces to the left of that digit. + + The continuation character is ignored as far as the content of the + statement is concerned. + + The GNU Fortran language places no limit on the number of + continuation lines in a statement. In practice, the limit depends on a + variety of factors, such as available memory, statement content, and so + on, but no GNU Fortran system may impose an arbitrary limit. + +  + File: g77.info, Node: Statements, Next: Statement Labels, Prev: Continuation Line, Up: Characters Lines Sequence + + Statements + ---------- + + (Corresponds to Section 3.3 of ANSI X3.9-1978 FORTRAN 77.) + + Statements may be written using an arbitrary number of continuation + lines. + + Statements may be separated using the semicolon (`;'), except that + the logical `IF' and non-construct `WHERE' statements may not be + separated from subsequent statements using only a semicolon as + statement separator. + + The `END PROGRAM', `END SUBROUTINE', `END FUNCTION', and `END BLOCK + DATA' statements are alternatives to the `END' statement. These + alternatives may be written as normal statements--they are not subject + to the restrictions of the `END' statement. + + However, no statement other than `END' may have an initial line that + appears to be an `END' statement--even `END PROGRAM', for example, must + not be written as: + + END + &PROGRAM + +  + File: g77.info, Node: Statement Labels, Next: Order, Prev: Statements, Up: Characters Lines Sequence + + Statement Labels + ---------------- + + (Corresponds to Section 3.4 of ANSI X3.9-1978 FORTRAN 77.) + + A statement separated from its predecessor via a semicolon may be + labeled as follows: + + * The semicolon is followed by the label for the statement, which in + turn follows the label. + + * The label must be no more than five digits in length. + + * The first digit of the label for the statement is not the first + non-space character on a line. Otherwise, that character is + treated as a continuation character. + + A statement may have only one label defined for it. + +  + File: g77.info, Node: Order, Next: INCLUDE, Prev: Statement Labels, Up: Characters Lines Sequence + + Order of Statements and Lines + ----------------------------- + + (Corresponds to Section 3.5 of ANSI X3.9-1978 FORTRAN 77.) + + Generally, `DATA' statements may precede executable statements. + However, specification statements pertaining to any entities + initialized by a `DATA' statement must precede that `DATA' statement. + For example, after `DATA I/1/', `INTEGER I' is not permitted, but + `INTEGER J' is permitted. + + The last line of a program unit may be an `END' statement, or may be: + + * An `END PROGRAM' statement, if the program unit is a main program. + + * An `END SUBROUTINE' statement, if the program unit is a subroutine. + + * An `END FUNCTION' statement, if the program unit is a function. + + * An `END BLOCK DATA' statement, if the program unit is a block data. + +  + File: g77.info, Node: INCLUDE, Next: Cpp-style directives, Prev: Order, Up: Characters Lines Sequence + + Including Source Text + --------------------- + + Additional source text may be included in the processing of the + source file via the `INCLUDE' directive: + + INCLUDE FILENAME + + The source text to be included is identified by FILENAME, which is a + literal GNU Fortran character constant. The meaning and interpretation + of FILENAME depends on the implementation, but typically is a filename. + + (`g77' treats it as a filename that it searches for in the current + directory and/or directories specified via the `-I' command-line + option.) + + The effect of the `INCLUDE' directive is as if the included text + directly replaced the directive in the source file prior to + interpretation of the program. Included text may itself use `INCLUDE'. + The depth of nested `INCLUDE' references depends on the implementation, + but typically is a positive integer. + + This virtual replacement treats the statements and `INCLUDE' + directives in the included text as syntactically distinct from those in + the including text. + + Therefore, the first non-comment line of the included text must not + be a continuation line. The included text must therefore have, after + the non-comment lines, either an initial line (statement), an `INCLUDE' + directive, or nothing (the end of the included text). + + Similarly, the including text may end the `INCLUDE' directive with a + semicolon or the end of the line, but it cannot follow an `INCLUDE' + directive at the end of its line with a continuation line. Thus, the + last statement in an included text may not be continued. + + Any statements between two `INCLUDE' directives on the same line are + treated as if they appeared in between the respective included texts. + For example: + + INCLUDE 'A'; PRINT *, 'B'; INCLUDE 'C'; END PROGRAM + + If the text included by `INCLUDE 'A'' constitutes a `PRINT *, 'A'' + statement and the text included by `INCLUDE 'C'' constitutes a `PRINT + *, 'C'' statement, then the output of the above sample program would be + + A + B + C + + (with suitable allowances for how an implementation defines its + handling of output). + + Included text must not include itself directly or indirectly, + regardless of whether the FILENAME used to reference the text is the + same. + + Note that `INCLUDE' is _not_ a statement. As such, it is neither a + non-executable or executable statement. However, if the text it + includes constitutes one or more executable statements, then the + placement of `INCLUDE' is subject to effectively the same restrictions + as those on executable statements. + + An `INCLUDE' directive may be continued across multiple lines as if + it were a statement. This permits long names to be used for FILENAME. + +  + File: g77.info, Node: Cpp-style directives, Prev: INCLUDE, Up: Characters Lines Sequence + + Cpp-style directives + -------------------- + + `cpp' output-style `#' directives (*note C Preprocessor Output: + (cpp)C Preprocessor Output.) are recognized by the compiler even when + the preprocessor isn't run on the input (as it is when compiling `.F' + files). (Note the distinction between these `cpp' `#' _output_ + directives and `#line' _input_ directives.) + +  + File: g77.info, Node: Data Types and Constants, Next: Expressions, Prev: Characters Lines Sequence, Up: Language + + Data Types and Constants + ======================== + + (The following information augments or overrides the information in + Chapter 4 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 4 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + To more concisely express the appropriate types for entities, this + document uses the more concise Fortran 90 nomenclature such as + `INTEGER(KIND=1)' instead of the more traditional, but less portably + concise, byte-size-based nomenclature such as `INTEGER*4', wherever + reasonable. + + When referring to generic types--in contexts where the specific + precision and range of a type are not important--this document uses the + generic type names `INTEGER', `LOGICAL', `REAL', `COMPLEX', and + `CHARACTER'. + + In some cases, the context requires specification of a particular + type. This document uses the `KIND=' notation to accomplish this + throughout, sometimes supplying the more traditional notation for + clarification, though the traditional notation might not work the same + way on all GNU Fortran implementations. + + Use of `KIND=' makes this document more concise because `g77' is + able to define values for `KIND=' that have the same meanings on all + systems, due to the way the Fortran 90 standard specifies these values + are to be used. + + (In particular, that standard permits an implementation to + arbitrarily assign nonnegative values. There are four distinct sets of + assignments: one to the `CHARACTER' type; one to the `INTEGER' type; + one to the `LOGICAL' type; and the fourth to both the `REAL' and + `COMPLEX' types. Implementations are free to assign these values in + any order, leave gaps in the ordering of assignments, and assign more + than one value to a representation.) + + This makes `KIND=' values superior to the values used in + non-standard statements such as `INTEGER*4', because the meanings of + the values in those statements vary from machine to machine, compiler + to compiler, even operating system to operating system. + + However, use of `KIND=' is _not_ generally recommended when writing + portable code (unless, for example, the code is going to be compiled + only via `g77', which is a widely ported compiler). GNU Fortran does + not yet have adequate language constructs to permit use of `KIND=' in a + fashion that would make the code portable to Fortran 90 + implementations; and, this construct is known to _not_ be accepted by + many popular FORTRAN 77 implementations, so it cannot be used in code + that is to be ported to those. + + The distinction here is that this document is able to use specific + values for `KIND=' to concisely document the types of various + operations and operands. + + A Fortran program should use the FORTRAN 77 designations for the + appropriate GNU Fortran types--such as `INTEGER' for `INTEGER(KIND=1)', + `REAL' for `REAL(KIND=1)', and `DOUBLE COMPLEX' for + `COMPLEX(KIND=2)'--and, where no such designations exist, make use of + appropriate techniques (preprocessor macros, parameters, and so on) to + specify the types in a fashion that may be easily adjusted to suit each + particular implementation to which the program is ported. (These types + generally won't need to be adjusted for ports of `g77'.) + + Further details regarding GNU Fortran data types and constants are + provided below. + + * Menu: + + * Types:: + * Constants:: + * Integer Type:: + * Character Type:: + +  + File: g77.info, Node: Types, Next: Constants, Up: Data Types and Constants + + Data Types + ---------- + + (Corresponds to Section 4.1 of ANSI X3.9-1978 FORTRAN 77.) + + GNU Fortran supports these types: + + 1. Integer (generic type `INTEGER') + + 2. Real (generic type `REAL') + + 3. Double precision + + 4. Complex (generic type `COMPLEX') + + 5. Logical (generic type `LOGICAL') + + 6. Character (generic type `CHARACTER') + + 7. Double Complex + + (The types numbered 1 through 6 above are standard FORTRAN 77 types.) + + The generic types shown above are referred to in this document using + only their generic type names. Such references usually indicate that + any specific type (kind) of that generic type is valid. + + For example, a context described in this document as accepting the + `COMPLEX' type also is likely to accept the `DOUBLE COMPLEX' type. + + The GNU Fortran language supports three ways to specify a specific + kind of a generic type. + + * Menu: + + * Double Notation:: As in `DOUBLE COMPLEX'. + * Star Notation:: As in `INTEGER*4'. + * Kind Notation:: As in `INTEGER(KIND=1)'. + +  + File: g77.info, Node: Double Notation, Next: Star Notation, Up: Types + + Double Notation + ............... + + The GNU Fortran language supports two uses of the keyword `DOUBLE' + to specify a specific kind of type: + + * `DOUBLE PRECISION', equivalent to `REAL(KIND=2)' + + * `DOUBLE COMPLEX', equivalent to `COMPLEX(KIND=2)' + + Use one of the above forms where a type name is valid. + + While use of this notation is popular, it doesn't scale well in a + language or dialect rich in intrinsic types, as is the case for the GNU + Fortran language (especially planned future versions of it). + + After all, one rarely sees type names such as `DOUBLE INTEGER', + `QUADRUPLE REAL', or `QUARTER INTEGER'. Instead, `INTEGER*8', + `REAL*16', and `INTEGER*1' often are substituted for these, + respectively, even though they do not always have the same meanings on + all systems. (And, the fact that `DOUBLE REAL' does not exist as such + is an inconsistency.) + + Therefore, this document uses "double notation" only on occasion for + the benefit of those readers who are accustomed to it. + +  + File: g77.info, Node: Star Notation, Next: Kind Notation, Prev: Double Notation, Up: Types + + Star Notation + ............. + + The following notation specifies the storage size for a type: + + GENERIC-TYPE*N + + GENERIC-TYPE must be a generic type--one of `INTEGER', `REAL', + `COMPLEX', `LOGICAL', or `CHARACTER'. N must be one or more digits + comprising a decimal integer number greater than zero. + + Use the above form where a type name is valid. + + The `*N' notation specifies that the amount of storage occupied by + variables and array elements of that type is N times the storage + occupied by a `CHARACTER*1' variable. + + This notation might indicate a different degree of precision and/or + range for such variables and array elements, and the functions that + return values of types using this notation. It does not limit the + precision or range of values of that type in any particular way--use + explicit code to do that. + + Further, the GNU Fortran language requires no particular values for + N to be supported by an implementation via the `*N' notation. `g77' + supports `INTEGER*1' (as `INTEGER(KIND=3)') on all systems, for example, + but not all implementations are required to do so, and `g77' is known + to not support `REAL*1' on most (or all) systems. + + As a result, except for GENERIC-TYPE of `CHARACTER', uses of this + notation should be limited to isolated portions of a program that are + intended to handle system-specific tasks and are expected to be + non-portable. + + (Standard FORTRAN 77 supports the `*N' notation for only + `CHARACTER', where it signifies not only the amount of storage + occupied, but the number of characters in entities of that type. + However, almost all Fortran compilers have supported this notation for + generic types, though with a variety of meanings for N.) + + Specifications of types using the `*N' notation always are + interpreted as specifications of the appropriate types described in + this document using the `KIND=N' notation, described below. + + While use of this notation is popular, it doesn't serve well in the + context of a widely portable dialect of Fortran, such as the GNU + Fortran language. + + For example, even on one particular machine, two or more popular + Fortran compilers might well disagree on the size of a type declared + `INTEGER*2' or `REAL*16'. Certainly there is known to be disagreement + over such things among Fortran compilers on _different_ systems. + + Further, this notation offers no elegant way to specify sizes that + are not even multiples of the "byte size" typically designated by + `INTEGER*1'. Use of "absurd" values (such as `INTEGER*1000') would + certainly be possible, but would perhaps be stretching the original + intent of this notation beyond the breaking point in terms of + widespread readability of documentation and code making use of it. + + Therefore, this document uses "star notation" only on occasion for + the benefit of those readers who are accustomed to it. + +  + File: g77.info, Node: Kind Notation, Prev: Star Notation, Up: Types + + Kind Notation + ............. + + The following notation specifies the kind-type selector of a type: + + GENERIC-TYPE(KIND=N) + + Use the above form where a type name is valid. + + GENERIC-TYPE must be a generic type--one of `INTEGER', `REAL', + `COMPLEX', `LOGICAL', or `CHARACTER'. N must be an integer + initialization expression that is a positive, nonzero value. + + Programmers are discouraged from writing these values directly into + their code. Future versions of the GNU Fortran language will offer + facilities that will make the writing of code portable to `g77' _and_ + Fortran 90 implementations simpler. + + However, writing code that ports to existing FORTRAN 77 + implementations depends on avoiding the `KIND=' construct. + + The `KIND=' construct is thus useful in the context of GNU Fortran + for two reasons: + + * It provides a means to specify a type in a fashion that is + portable across all GNU Fortran implementations (though not other + FORTRAN 77 and Fortran 90 implementations). + + * It provides a sort of Rosetta stone for this document to use to + concisely describe the types of various operations and operands. + + The values of N in the GNU Fortran language are assigned using a + scheme that: + + * Attempts to maximize the ability of readers of this document to + quickly familiarize themselves with assignments for popular types + + * Provides a unique value for each specific desired meaning + + * Provides a means to automatically assign new values so they have a + "natural" relationship to existing values, if appropriate, or, if + no such relationship exists, will not interfere with future values + assigned on the basis of such relationships + + * Avoids using values that are similar to values used in the + existing, popular `*N' notation, to prevent readers from expecting + that these implied correspondences work on all GNU Fortran + implementations + + The assignment system accomplishes this by assigning to each + "fundamental meaning" of a specific type a unique prime number. + Combinations of fundamental meanings--for example, a type that is two + times the size of some other type--are assigned values of N that are + the products of the values for those fundamental meanings. + + A prime value of N is never given more than one fundamental meaning, + to avoid situations where some code or system cannot reasonably provide + those meanings in the form of a single type. + + The values of N assigned so far are: + + `KIND=0' + This value is reserved for future use. + + The planned future use is for this value to designate, explicitly, + context-sensitive kind-type selection. For example, the + expression `1D0 * 0.1_0' would be equivalent to `1D0 * 0.1D0'. + + `KIND=1' + This corresponds to the default types for `REAL', `INTEGER', + `LOGICAL', `COMPLEX', and `CHARACTER', as appropriate. + + These are the "default" types described in the Fortran 90 standard, + though that standard does not assign any particular `KIND=' value + to these types. + + (Typically, these are `REAL*4', `INTEGER*4', `LOGICAL*4', and + `COMPLEX*8'.) + + `KIND=2' + This corresponds to types that occupy twice as much storage as the + default types. `REAL(KIND=2)' is `DOUBLE PRECISION' (typically + `REAL*8'), `COMPLEX(KIND=2)' is `DOUBLE COMPLEX' (typically + `COMPLEX*16'), + + These are the "double precision" types described in the Fortran 90 + standard, though that standard does not assign any particular + `KIND=' value to these types. + + N of 4 thus corresponds to types that occupy four times as much + storage as the default types, N of 8 to types that occupy eight + times as much storage, and so on. + + The `INTEGER(KIND=2)' and `LOGICAL(KIND=2)' types are not + necessarily supported by every GNU Fortran implementation. + + `KIND=3' + This corresponds to types that occupy as much storage as the + default `CHARACTER' type, which is the same effective type as + `CHARACTER(KIND=1)' (making that type effectively the same as + `CHARACTER(KIND=3)'). + + (Typically, these are `INTEGER*1' and `LOGICAL*1'.) + + N of 6 thus corresponds to types that occupy twice as much storage + as the N=3 types, N of 12 to types that occupy four times as much + storage, and so on. + + These are not necessarily supported by every GNU Fortran + implementation. + + `KIND=5' + This corresponds to types that occupy half the storage as the + default (N=1) types. + + (Typically, these are `INTEGER*2' and `LOGICAL*2'.) + + N of 25 thus corresponds to types that occupy one-quarter as much + storage as the default types. + + These are not necessarily supported by every GNU Fortran + implementation. + + `KIND=7' + This is valid only as `INTEGER(KIND=7)' and denotes the `INTEGER' + type that has the smallest storage size that holds a pointer on + the system. + + A pointer representable by this type is capable of uniquely + addressing a `CHARACTER*1' variable, array, array element, or + substring. + + (Typically this is equivalent to `INTEGER*4' or, on 64-bit + systems, `INTEGER*8'. In a compatible C implementation, it + typically would be the same size and semantics of the C type `void + *'.) + + Note that these are _proposed_ correspondences and might change in + future versions of `g77'--avoid writing code depending on them while + `g77', and therefore the GNU Fortran language it defines, is in beta + testing. + + Values not specified in the above list are reserved to future + versions of the GNU Fortran language. + + Implementation-dependent meanings will be assigned new, unique prime + numbers so as to not interfere with other implementation-dependent + meanings, and offer the possibility of increasing the portability of + code depending on such types by offering support for them in other GNU + Fortran implementations. + + Other meanings that might be given unique values are: + + * Types that make use of only half their storage size for + representing precision and range. + + For example, some compilers offer options that cause `INTEGER' + types to occupy the amount of storage that would be needed for + `INTEGER(KIND=2)' types, but the range remains that of + `INTEGER(KIND=1)'. + + * The IEEE single floating-point type. + + * Types with a specific bit pattern (endianness), such as the + little-endian form of `INTEGER(KIND=1)'. These could permit, + conceptually, use of portable code and implementations on data + files written by existing systems. + + Future _prime_ numbers should be given meanings in as incremental a + fashion as possible, to allow for flexibility and expressiveness in + combining types. + + For example, instead of defining a prime number for little-endian + IEEE doubles, one prime number might be assigned the meaning + "little-endian", another the meaning "IEEE double", and the value of N + for a little-endian IEEE double would thus naturally be the product of + those two respective assigned values. (It could even be reasonable to + have IEEE values result from the products of prime values denoting + exponent and fraction sizes and meanings, hidden bit usage, + availability and representations of special values such as subnormals, + infinities, and Not-A-Numbers (NaNs), and so on.) + + This assignment mechanism, while not inherently required for future + versions of the GNU Fortran language, is worth using because it could + ease management of the "space" of supported types much easier in the + long run. + + The above approach suggests a mechanism for specifying inheritance + of intrinsic (built-in) types for an entire, widely portable product + line. It is certainly reasonable that, unlike programmers of other + languages offering inheritance mechanisms that employ verbose names for + classes and subclasses, along with graphical browsers to elucidate the + relationships, Fortran programmers would employ a mechanism that works + by multiplying prime numbers together and finding the prime factors of + such products. + + Most of the advantages for the above scheme have been explained + above. One disadvantage is that it could lead to the defining, by the + GNU Fortran language, of some fairly large prime numbers. This could + lead to the GNU Fortran language being declared "munitions" by the + United States Department of Defense. + +  + File: g77.info, Node: Constants, Next: Integer Type, Prev: Types, Up: Data Types and Constants + + Constants + --------- + + (Corresponds to Section 4.2 of ANSI X3.9-1978 FORTRAN 77.) + + A "typeless constant" has one of the following forms: + + 'BINARY-DIGITS'B + 'OCTAL-DIGITS'O + 'HEXADECIMAL-DIGITS'Z + 'HEXADECIMAL-DIGITS'X + + BINARY-DIGITS, OCTAL-DIGITS, and HEXADECIMAL-DIGITS are nonempty + strings of characters in the set `01', `01234567', and + `0123456789ABCDEFabcdef', respectively. (The value for `A' (and `a') + is 10, for `B' and `b' is 11, and so on.) + + A prefix-radix constant, such as `Z'ABCD'', can optionally be + treated as typeless. *Note Options Controlling Fortran Dialect: + Fortran Dialect Options, for information on the `-ftypeless-boz' option. + + Typeless constants have values that depend on the context in which + they are used. + + All other constants, called "typed constants", are + interpreted--converted to internal form--according to their inherent + type. Thus, context is _never_ a determining factor for the type, and + hence the interpretation, of a typed constant. (All constants in the + ANSI FORTRAN 77 language are typed constants.) + + For example, `1' is always type `INTEGER(KIND=1)' in GNU Fortran + (called default INTEGER in Fortran 90), `9.435784839284958' is always + type `REAL(KIND=1)' (even if the additional precision specified is + lost, and even when used in a `REAL(KIND=2)' context), `1E0' is always + type `REAL(KIND=2)', and `1D0' is always type `REAL(KIND=2)'. + +  + File: g77.info, Node: Integer Type, Next: Character Type, Prev: Constants, Up: Data Types and Constants + + Integer Type + ------------ + + (Corresponds to Section 4.3 of ANSI X3.9-1978 FORTRAN 77.) + + An integer constant also may have one of the following forms: + + B'BINARY-DIGITS' + O'OCTAL-DIGITS' + Z'HEXADECIMAL-DIGITS' + X'HEXADECIMAL-DIGITS' + + BINARY-DIGITS, OCTAL-DIGITS, and HEXADECIMAL-DIGITS are nonempty + strings of characters in the set `01', `01234567', and + `0123456789ABCDEFabcdef', respectively. (The value for `A' (and `a') + is 10, for `B' and `b' is 11, and so on.) + +  + File: g77.info, Node: Character Type, Prev: Integer Type, Up: Data Types and Constants + + Character Type + -------------- + + (Corresponds to Section 4.8 of ANSI X3.9-1978 FORTRAN 77.) + + A character constant may be delimited by a pair of double quotes + (`"') instead of apostrophes. In this case, an apostrophe within the + constant represents a single apostrophe, while a double quote is + represented in the source text of the constant by two consecutive double + quotes with no intervening spaces. + + A character constant may be empty (have a length of zero). + + A character constant may include a substring specification, The + value of such a constant is the value of the substring--for example, + the value of `'hello'(3:5)' is the same as the value of `'llo''. + +  + File: g77.info, Node: Expressions, Next: Specification Statements, Prev: Data Types and Constants, Up: Language + + Expressions + =========== + + (The following information augments or overrides the information in + Chapter 6 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 6 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + * Menu: + + * %LOC():: + +  + File: g77.info, Node: %LOC(), Up: Expressions + + The `%LOC()' Construct + ---------------------- + + %LOC(ARG) + + The `%LOC()' construct is an expression that yields the value of the + location of its argument, ARG, in memory. The size of the type of the + expression depends on the system--typically, it is equivalent to either + `INTEGER(KIND=1)' or `INTEGER(KIND=2)', though it is actually type + `INTEGER(KIND=7)'. + + The argument to `%LOC()' must be suitable as the left-hand side of + an assignment statement. That is, it may not be a general expression + involving operators such as addition, subtraction, and so on, nor may + it be a constant. + + Use of `%LOC()' is recommended only for code that is accessing + facilities outside of GNU Fortran, such as operating system or + windowing facilities. It is best to constrain such uses to isolated + portions of a program--portions that deal specifically and exclusively + with low-level, system-dependent facilities. Such portions might well + provide a portable interface for use by the program as a whole, but are + themselves not portable, and should be thoroughly tested each time they + are rebuilt using a new compiler or version of a compiler. + + Do not depend on `%LOC()' returning a pointer that can be safely + used to _define_ (change) the argument. While this might work in some + circumstances, it is hard to predict whether it will continue to work + when a program (that works using this unsafe behavior) is recompiled + using different command-line options or a different version of `g77'. + + Generally, `%LOC()' is safe when used as an argument to a procedure + that makes use of the value of the corresponding dummy argument only + during its activation, and only when such use is restricted to + referencing (reading) the value of the argument to `%LOC()'. + + _Implementation Note:_ Currently, `g77' passes arguments (those not + passed using a construct such as `%VAL()') by reference or descriptor, + depending on the type of the actual argument. Thus, given `INTEGER I', + `CALL FOO(I)' would seem to mean the same thing as `CALL + FOO(%VAL(%LOC(I)))', and in fact might compile to identical code. + + However, `CALL FOO(%VAL(%LOC(I)))' emphatically means "pass, by + value, the address of `I' in memory". While `CALL FOO(I)' might use + that same approach in a particular version of `g77', another version or + compiler might choose a different implementation, such as + copy-in/copy-out, to effect the desired behavior--and which will + therefore not necessarily compile to the same code as would `CALL + FOO(%VAL(%LOC(I)))' using the same version or compiler. + + *Note Debugging and Interfacing::, for detailed information on how + this particular version of `g77' implements various constructs. + +  + File: g77.info, Node: Specification Statements, Next: Control Statements, Prev: Expressions, Up: Language + + Specification Statements + ======================== + + (The following information augments or overrides the information in + Chapter 8 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 8 of that document otherwise serves as the basis for + the relevant aspects of GNU Fortran.) + + * Menu: + + * NAMELIST:: + * DOUBLE COMPLEX:: + +  + File: g77.info, Node: NAMELIST, Next: DOUBLE COMPLEX, Up: Specification Statements + + `NAMELIST' Statement + -------------------- + + The `NAMELIST' statement, and related I/O constructs, are supported + by the GNU Fortran language in essentially the same way as they are by + `f2c'. + + This follows Fortran 90 with the restriction that on `NAMELIST' + input, subscripts must have the form + SUBSCRIPT [ `:' SUBSCRIPT [ `:' STRIDE]] + i.e. + &xx x(1:3,8:10:2)=1,2,3,4,5,6/ + is allowed, but not, say, + &xx x(:3,8::2)=1,2,3,4,5,6/ + + As an extension of the Fortran 90 form, `$' and `$END' may be used + in place of `&' and `/' in `NAMELIST' input, so that + $&xx x(1:3,8:10:2)=1,2,3,4,5,6 $end + could be used instead of the example above. + +  + File: g77.info, Node: DOUBLE COMPLEX, Prev: NAMELIST, Up: Specification Statements + + `DOUBLE COMPLEX' Statement + -------------------------- + + `DOUBLE COMPLEX' is a type-statement (and type) that specifies the + type `COMPLEX(KIND=2)' in GNU Fortran. + +  + File: g77.info, Node: Control Statements, Next: Functions and Subroutines, Prev: Specification Statements, Up: Language + + Control Statements + ================== + + (The following information augments or overrides the information in + Chapter 11 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 11 of that document otherwise serves as the basis + for the relevant aspects of GNU Fortran.) + + * Menu: + + * DO WHILE:: + * END DO:: + * Construct Names:: + * CYCLE and EXIT:: + +  + File: g77.info, Node: DO WHILE, Next: END DO, Up: Control Statements + + DO WHILE + -------- + + The `DO WHILE' statement, a feature of both the MIL-STD 1753 and + Fortran 90 standards, is provided by the GNU Fortran language. The + Fortran 90 "do forever" statement comprising just `DO' is also + supported. + +  + File: g77.info, Node: END DO, Next: Construct Names, Prev: DO WHILE, Up: Control Statements + + END DO + ------ + + The `END DO' statement is provided by the GNU Fortran language. + + This statement is used in one of two ways: + + * The Fortran 90 meaning, in which it specifies the termination + point of a single `DO' loop started with a `DO' statement that + specifies no termination label. + + * The MIL-STD 1753 meaning, in which it specifies the termination + point of one or more `DO' loops, all of which start with a `DO' + statement that specify the label defined for the `END DO' + statement. + + This kind of `END DO' statement is merely a synonym for + `CONTINUE', except it is permitted only when the statement is + labeled and a target of one or more labeled `DO' loops. + + It is expected that this use of `END DO' will be removed from the + GNU Fortran language in the future, though it is likely that it + will long be supported by `g77' as a dialect form. + +  + File: g77.info, Node: Construct Names, Next: CYCLE and EXIT, Prev: END DO, Up: Control Statements + + Construct Names + --------------- + + The GNU Fortran language supports construct names as defined by the + Fortran 90 standard. These names are local to the program unit and are + defined as follows: + + CONSTRUCT-NAME: BLOCK-STATEMENT + + Here, CONSTRUCT-NAME is the construct name itself; its definition is + connoted by the single colon (`:'); and BLOCK-STATEMENT is an `IF', + `DO', or `SELECT CASE' statement that begins a block. + + A block that is given a construct name must also specify the same + construct name in its termination statement: + + END BLOCK CONSTRUCT-NAME + + Here, BLOCK must be `IF', `DO', or `SELECT', as appropriate. + +  + File: g77.info, Node: CYCLE and EXIT, Prev: Construct Names, Up: Control Statements + + The `CYCLE' and `EXIT' Statements + --------------------------------- + + The `CYCLE' and `EXIT' statements specify that the remaining + statements in the current iteration of a particular active (enclosing) + `DO' loop are to be skipped. + + `CYCLE' specifies that these statements are skipped, but the `END + DO' statement that marks the end of the `DO' loop be executed--that is, + the next iteration, if any, is to be started. If the statement marking + the end of the `DO' loop is not `END DO'--in other words, if the loop + is not a block `DO'--the `CYCLE' statement does not execute that + statement, but does start the next iteration (if any). + + `EXIT' specifies that the loop specified by the `DO' construct is + terminated. + + The `DO' loop affected by `CYCLE' and `EXIT' is the innermost + enclosing `DO' loop when the following forms are used: + + CYCLE + EXIT + + Otherwise, the following forms specify the construct name of the + pertinent `DO' loop: + + CYCLE CONSTRUCT-NAME + EXIT CONSTRUCT-NAME + + `CYCLE' and `EXIT' can be viewed as glorified `GO TO' statements. + However, they cannot be easily thought of as `GO TO' statements in + obscure cases involving FORTRAN 77 loops. For example: + + DO 10 I = 1, 5 + DO 10 J = 1, 5 + IF (J .EQ. 5) EXIT + DO 10 K = 1, 5 + IF (K .EQ. 3) CYCLE + 10 PRINT *, 'I=', I, ' J=', J, ' K=', K + 20 CONTINUE + + In particular, neither the `EXIT' nor `CYCLE' statements above are + equivalent to a `GO TO' statement to either label `10' or `20'. + + To understand the effect of `CYCLE' and `EXIT' in the above + fragment, it is helpful to first translate it to its equivalent using + only block `DO' loops: + + DO I = 1, 5 + DO J = 1, 5 + IF (J .EQ. 5) EXIT + DO K = 1, 5 + IF (K .EQ. 3) CYCLE + 10 PRINT *, 'I=', I, ' J=', J, ' K=', K + END DO + END DO + END DO + 20 CONTINUE + + Adding new labels allows translation of `CYCLE' and `EXIT' to `GO + TO' so they may be more easily understood by programmers accustomed to + FORTRAN coding: + + DO I = 1, 5 + DO J = 1, 5 + IF (J .EQ. 5) GOTO 18 + DO K = 1, 5 + IF (K .EQ. 3) GO TO 12 + 10 PRINT *, 'I=', I, ' J=', J, ' K=', K + 12 END DO + END DO + 18 END DO + 20 CONTINUE + + Thus, the `CYCLE' statement in the innermost loop skips over the + `PRINT' statement as it begins the next iteration of the loop, while + the `EXIT' statement in the middle loop ends that loop but _not_ the + outermost loop. + +  + File: g77.info, Node: Functions and Subroutines, Next: Scope and Classes of Names, Prev: Control Statements, Up: Language + + Functions and Subroutines + ========================= + + (The following information augments or overrides the information in + Chapter 15 of ANSI X3.9-1978 FORTRAN 77 in specifying the GNU Fortran + language. Chapter 15 of that document otherwise serves as the basis + for the relevant aspects of GNU Fortran.) + + * Menu: + + * %VAL():: + * %REF():: + * %DESCR():: + * Generics and Specifics:: + * REAL() and AIMAG() of Complex:: + * CMPLX() of DOUBLE PRECISION:: + * MIL-STD 1753:: + * f77/f2c Intrinsics:: + * Table of Intrinsic Functions:: + +  + File: g77.info, Node: %VAL(), Next: %REF(), Up: Functions and Subroutines + + The `%VAL()' Construct + ---------------------- + + %VAL(ARG) + + The `%VAL()' construct specifies that an argument, ARG, is to be + passed by value, instead of by reference or descriptor. + + `%VAL()' is restricted to actual arguments in invocations of + external procedures. + + Use of `%VAL()' is recommended only for code that is accessing + facilities outside of GNU Fortran, such as operating system or + windowing facilities. It is best to constrain such uses to isolated + portions of a program--portions the deal specifically and exclusively + with low-level, system-dependent facilities. Such portions might well + provide a portable interface for use by the program as a whole, but are + themselves not portable, and should be thoroughly tested each time they + are rebuilt using a new compiler or version of a compiler. + + _Implementation Note:_ Currently, `g77' passes all arguments either + by reference or by descriptor. + + Thus, use of `%VAL()' tends to be restricted to cases where the + called procedure is written in a language other than Fortran that + supports call-by-value semantics. (C is an example of such a language.) + + *Note Procedures (SUBROUTINE and FUNCTION): Procedures, for detailed + information on how this particular version of `g77' passes arguments to + procedures. + +  + File: g77.info, Node: %REF(), Next: %DESCR(), Prev: %VAL(), Up: Functions and Subroutines + + The `%REF()' Construct + ---------------------- + + %REF(ARG) + + The `%REF()' construct specifies that an argument, ARG, is to be + passed by reference, instead of by value or descriptor. + + `%REF()' is restricted to actual arguments in invocations of + external procedures. + + Use of `%REF()' is recommended only for code that is accessing + facilities outside of GNU Fortran, such as operating system or + windowing facilities. It is best to constrain such uses to isolated + portions of a program--portions the deal specifically and exclusively + with low-level, system-dependent facilities. Such portions might well + provide a portable interface for use by the program as a whole, but are + themselves not portable, and should be thoroughly tested each time they + are rebuilt using a new compiler or version of a compiler. + + Do not depend on `%REF()' supplying a pointer to the procedure being + invoked. While that is a likely implementation choice, other + implementation choices are available that preserve Fortran + pass-by-reference semantics without passing a pointer to the argument, + ARG. (For example, a copy-in/copy-out implementation.) + + _Implementation Note:_ Currently, `g77' passes all arguments (other + than variables and arrays of type `CHARACTER') by reference. Future + versions of, or dialects supported by, `g77' might not pass `CHARACTER' + functions by reference. + + Thus, use of `%REF()' tends to be restricted to cases where ARG is + type `CHARACTER' but the called procedure accesses it via a means other + than the method used for Fortran `CHARACTER' arguments. + + *Note Procedures (SUBROUTINE and FUNCTION): Procedures, for detailed + information on how this particular version of `g77' passes arguments to + procedures. + +  + File: g77.info, Node: %DESCR(), Next: Generics and Specifics, Prev: %REF(), Up: Functions and Subroutines + + The `%DESCR()' Construct + ------------------------ + + %DESCR(ARG) + + The `%DESCR()' construct specifies that an argument, ARG, is to be + passed by descriptor, instead of by value or reference. + + `%DESCR()' is restricted to actual arguments in invocations of + external procedures. + + Use of `%DESCR()' is recommended only for code that is accessing + facilities outside of GNU Fortran, such as operating system or + windowing facilities. It is best to constrain such uses to isolated + portions of a program--portions the deal specifically and exclusively + with low-level, system-dependent facilities. Such portions might well + provide a portable interface for use by the program as a whole, but are + themselves not portable, and should be thoroughly tested each time they + are rebuilt using a new compiler or version of a compiler. + + Do not depend on `%DESCR()' supplying a pointer and/or a length + passed by value to the procedure being invoked. While that is a likely + implementation choice, other implementation choices are available that + preserve the pass-by-reference semantics without passing a pointer to + the argument, ARG. (For example, a copy-in/copy-out implementation.) + And, future versions of `g77' might change the way descriptors are + implemented, such as passing a single argument pointing to a record + containing the pointer/length information instead of passing that same + information via two arguments as it currently does. + + _Implementation Note:_ Currently, `g77' passes all variables and + arrays of type `CHARACTER' by descriptor. Future versions of, or + dialects supported by, `g77' might pass `CHARACTER' functions by + descriptor as well. + + Thus, use of `%DESCR()' tends to be restricted to cases where ARG is + not type `CHARACTER' but the called procedure accesses it via a means + similar to the method used for Fortran `CHARACTER' arguments. + + *Note Procedures (SUBROUTINE and FUNCTION): Procedures, for detailed + information on how this particular version of `g77' passes arguments to + procedures. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-7 gcc-3.2.3/gcc/f/g77.info-7 *** gcc-3.2.2/gcc/f/g77.info-7 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-7 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1678 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: Generics and Specifics, Next: REAL() and AIMAG() of Complex, Prev: %DESCR(), Up: Functions and Subroutines + + Generics and Specifics + ---------------------- + + The ANSI FORTRAN 77 language defines generic and specific intrinsics. + In short, the distinctions are: + + * _Specific_ intrinsics have specific types for their arguments and + a specific return type. + + * _Generic_ intrinsics are treated, on a case-by-case basis in the + program's source code, as one of several possible specific + intrinsics. + + Typically, a generic intrinsic has a return type that is + determined by the type of one or more of its arguments. + + The GNU Fortran language generalizes these concepts somewhat, + especially by providing intrinsic subroutines and generic intrinsics + that are treated as either a specific intrinsic subroutine or a + specific intrinsic function (e.g. `SECOND'). + + However, GNU Fortran avoids generalizing this concept to the point + where existing code would be accepted as meaning something possibly + different than what was intended. + + For example, `ABS' is a generic intrinsic, so all working code + written using `ABS' of an `INTEGER' argument expects an `INTEGER' + return value. Similarly, all such code expects that `ABS' of an + `INTEGER*2' argument returns an `INTEGER*2' return value. + + Yet, `IABS' is a _specific_ intrinsic that accepts only an + `INTEGER(KIND=1)' argument. Code that passes something other than an + `INTEGER(KIND=1)' argument to `IABS' is not valid GNU Fortran code, + because it is not clear what the author intended. + + For example, if `J' is `INTEGER(KIND=6)', `IABS(J)' is not defined + by the GNU Fortran language, because the programmer might have used + that construct to mean any of the following, subtly different, things: + + * Convert `J' to `INTEGER(KIND=1)' first (as if `IABS(INT(J))' had + been written). + + * Convert the result of the intrinsic to `INTEGER(KIND=1)' (as if + `INT(ABS(J))' had been written). + + * No conversion (as if `ABS(J)' had been written). + + The distinctions matter especially when types and values wider than + `INTEGER(KIND=1)' (such as `INTEGER(KIND=2)'), or when operations + performing more "arithmetic" than absolute-value, are involved. + + The following sample program is not a valid GNU Fortran program, but + might be accepted by other compilers. If so, the output is likely to + be revealing in terms of how a given compiler treats intrinsics (that + normally are specific) when they are given arguments that do not + conform to their stated requirements: + + PROGRAM JCB002 + C Version 1: + C Modified 1999-02-15 (Burley) to delete my email address. + C Modified 1997-05-21 (Burley) to accommodate compilers that implement + C INT(I1-I2) as INT(I1)-INT(I2) given INTEGER*2 I1,I2. + C + C Version 0: + C Written by James Craig Burley 1997-02-20. + C + C Purpose: + C Determine how compilers handle non-standard IDIM + C on INTEGER*2 operands, which presumably can be + C extrapolated into understanding how the compiler + C generally treats specific intrinsics that are passed + C arguments not of the correct types. + C + C If your compiler implements INTEGER*2 and INTEGER + C as the same type, change all INTEGER*2 below to + C INTEGER*1. + C + INTEGER*2 I0, I4 + INTEGER I1, I2, I3 + INTEGER*2 ISMALL, ILARGE + INTEGER*2 ITOOLG, ITWO + INTEGER*2 ITMP + LOGICAL L2, L3, L4 + C + C Find smallest INTEGER*2 number. + C + ISMALL=0 + 10 I0 = ISMALL-1 + IF ((I0 .GE. ISMALL) .OR. (I0+1 .NE. ISMALL)) GOTO 20 + ISMALL = I0 + GOTO 10 + 20 CONTINUE + C + C Find largest INTEGER*2 number. + C + ILARGE=0 + 30 I0 = ILARGE+1 + IF ((I0 .LE. ILARGE) .OR. (I0-1 .NE. ILARGE)) GOTO 40 + ILARGE = I0 + GOTO 30 + 40 CONTINUE + C + C Multiplying by two adds stress to the situation. + C + ITWO = 2 + C + C Need a number that, added to -2, is too wide to fit in I*2. + C + ITOOLG = ISMALL + C + C Use IDIM the straightforward way. + C + I1 = IDIM (ILARGE, ISMALL) * ITWO + ITOOLG + C + C Calculate result for first interpretation. + C + I2 = (INT (ILARGE) - INT (ISMALL)) * ITWO + ITOOLG + C + C Calculate result for second interpretation. + C + ITMP = ILARGE - ISMALL + I3 = (INT (ITMP)) * ITWO + ITOOLG + C + C Calculate result for third interpretation. + C + I4 = (ILARGE - ISMALL) * ITWO + ITOOLG + C + C Print results. + C + PRINT *, 'ILARGE=', ILARGE + PRINT *, 'ITWO=', ITWO + PRINT *, 'ITOOLG=', ITOOLG + PRINT *, 'ISMALL=', ISMALL + PRINT *, 'I1=', I1 + PRINT *, 'I2=', I2 + PRINT *, 'I3=', I3 + PRINT *, 'I4=', I4 + PRINT * + L2 = (I1 .EQ. I2) + L3 = (I1 .EQ. I3) + L4 = (I1 .EQ. I4) + IF (L2 .AND. .NOT.L3 .AND. .NOT.L4) THEN + PRINT *, 'Interp 1: IDIM(I*2,I*2) => IDIM(INT(I*2),INT(I*2))' + STOP + END IF + IF (L3 .AND. .NOT.L2 .AND. .NOT.L4) THEN + PRINT *, 'Interp 2: IDIM(I*2,I*2) => INT(DIM(I*2,I*2))' + STOP + END IF + IF (L4 .AND. .NOT.L2 .AND. .NOT.L3) THEN + PRINT *, 'Interp 3: IDIM(I*2,I*2) => DIM(I*2,I*2)' + STOP + END IF + PRINT *, 'Results need careful analysis.' + END + + No future version of the GNU Fortran language will likely permit + specific intrinsic invocations with wrong-typed arguments (such as + `IDIM' in the above example), since it has been determined that + disagreements exist among many production compilers on the + interpretation of such invocations. These disagreements strongly + suggest that Fortran programmers, and certainly existing Fortran + programs, disagree about the meaning of such invocations. + + The first version of `JCB002' didn't accommodate some compilers' + treatment of `INT(I1-I2)' where `I1' and `I2' are `INTEGER*2'. In such + a case, these compilers apparently convert both operands to `INTEGER*4' + and then do an `INTEGER*4' subtraction, instead of doing an `INTEGER*2' + subtraction on the original values in `I1' and `I2'. + + However, the results of the careful analyses done on the outputs of + programs compiled by these various compilers show that they all + implement either `Interp 1' or `Interp 2' above. + + Specifically, it is believed that the new version of `JCB002' above + will confirm that: + + * Digital Semiconductor ("DEC") Alpha OSF/1, HP-UX 10.0.1, AIX 3.2.5 + `f77' compilers all implement `Interp 1'. + + * IRIX 5.3 `f77' compiler implements `Interp 2'. + + * Solaris 2.5, SunOS 4.1.3, DECstation ULTRIX 4.3, and IRIX 6.1 + `f77' compilers all implement `Interp 3'. + + If you get different results than the above for the stated + compilers, or have results for other compilers that might be worth + adding to the above list, please let us know the details (compiler + product, version, machine, results, and so on). + +  + File: g77.info, Node: REAL() and AIMAG() of Complex, Next: CMPLX() of DOUBLE PRECISION, Prev: Generics and Specifics, Up: Functions and Subroutines + + `REAL()' and `AIMAG()' of Complex + --------------------------------- + + The GNU Fortran language disallows `REAL(EXPR)' and `AIMAG(EXPR)', + where EXPR is any `COMPLEX' type other than `COMPLEX(KIND=1)', except + when they are used in the following way: + + REAL(REAL(EXPR)) + REAL(AIMAG(EXPR)) + + The above forms explicitly specify that the desired effect is to + convert the real or imaginary part of EXPR, which might be some `REAL' + type other than `REAL(KIND=1)', to type `REAL(KIND=1)', and have that + serve as the value of the expression. + + The GNU Fortran language offers clearly named intrinsics to extract + the real and imaginary parts of a complex entity without any conversion: + + REALPART(EXPR) + IMAGPART(EXPR) + + To express the above using typical extended FORTRAN 77, use the + following constructs (when EXPR is `COMPLEX(KIND=2)'): + + DBLE(EXPR) + DIMAG(EXPR) + + The FORTRAN 77 language offers no way to explicitly specify the real + and imaginary parts of a complex expression of arbitrary type, + apparently as a result of requiring support for only one `COMPLEX' type + (`COMPLEX(KIND=1)'). The concepts of converting an expression to type + `REAL(KIND=1)' and of extracting the real part of a complex expression + were thus "smooshed" by FORTRAN 77 into a single intrinsic, since they + happened to have the exact same effect in that language (due to having + only one `COMPLEX' type). + + _Note:_ When `-ff90' is in effect, `g77' treats `REAL(EXPR)', where + EXPR is of type `COMPLEX', as `REALPART(EXPR)', whereas with + `-fugly-complex -fno-f90' in effect, it is treated as + `REAL(REALPART(EXPR))'. + + *Note Ugly Complex Part Extraction::, for more information. + +  + File: g77.info, Node: CMPLX() of DOUBLE PRECISION, Next: MIL-STD 1753, Prev: REAL() and AIMAG() of Complex, Up: Functions and Subroutines + + `CMPLX()' of `DOUBLE PRECISION' + ------------------------------- + + In accordance with Fortran 90 and at least some (perhaps all) other + compilers, the GNU Fortran language defines `CMPLX()' as always + returning a result that is type `COMPLEX(KIND=1)'. + + This means `CMPLX(D1,D2)', where `D1' and `D2' are `REAL(KIND=2)' + (`DOUBLE PRECISION'), is treated as: + + CMPLX(SNGL(D1), SNGL(D2)) + + (It was necessary for Fortran 90 to specify this behavior for + `DOUBLE PRECISION' arguments, since that is the behavior mandated by + FORTRAN 77.) + + The GNU Fortran language also provides the `DCMPLX()' intrinsic, + which is provided by some FORTRAN 77 compilers to construct a `DOUBLE + COMPLEX' entity from of `DOUBLE PRECISION' operands. However, this + solution does not scale well when more `COMPLEX' types (having various + precisions and ranges) are offered by Fortran implementations. + + Fortran 90 extends the `CMPLX()' intrinsic by adding an extra + argument used to specify the desired kind of complex result. However, + this solution is somewhat awkward to use, and `g77' currently does not + support it. + + The GNU Fortran language provides a simple way to build a complex + value out of two numbers, with the precise type of the value determined + by the types of the two numbers (via the usual type-promotion + mechanism): + + COMPLEX(REAL, IMAG) + + When REAL and IMAG are the same `REAL' types, `COMPLEX()' performs + no conversion other than to put them together to form a complex result + of the same (complex version of real) type. + + *Note Complex Intrinsic::, for more information. + +  + File: g77.info, Node: MIL-STD 1753, Next: f77/f2c Intrinsics, Prev: CMPLX() of DOUBLE PRECISION, Up: Functions and Subroutines + + MIL-STD 1753 Support + -------------------- + + The GNU Fortran language includes the MIL-STD 1753 intrinsics + `BTEST', `IAND', `IBCLR', `IBITS', `IBSET', `IEOR', `IOR', `ISHFT', + `ISHFTC', `MVBITS', and `NOT'. + +  + File: g77.info, Node: f77/f2c Intrinsics, Next: Table of Intrinsic Functions, Prev: MIL-STD 1753, Up: Functions and Subroutines + + `f77'/`f2c' Intrinsics + ---------------------- + + The bit-manipulation intrinsics supported by traditional `f77' and + by `f2c' are available in the GNU Fortran language. These include + `AND', `LSHIFT', `OR', `RSHIFT', and `XOR'. + + Also supported are the intrinsics `CDABS', `CDCOS', `CDEXP', + `CDLOG', `CDSIN', `CDSQRT', `DCMPLX', `DCONJG', `DFLOAT', `DIMAG', + `DREAL', and `IMAG', `ZABS', `ZCOS', `ZEXP', `ZLOG', `ZSIN', and + `ZSQRT'. + +  + File: g77.info, Node: Table of Intrinsic Functions, Prev: f77/f2c Intrinsics, Up: Functions and Subroutines + + Table of Intrinsic Functions + ---------------------------- + + (Corresponds to Section 15.10 of ANSI X3.9-1978 FORTRAN 77.) + + The GNU Fortran language adds various functions, subroutines, types, + and arguments to the set of intrinsic functions in ANSI FORTRAN 77. + The complete set of intrinsics supported by the GNU Fortran language is + described below. + + Note that a name is not treated as that of an intrinsic if it is + specified in an `EXTERNAL' statement in the same program unit; if a + command-line option is used to disable the groups to which the + intrinsic belongs; or if the intrinsic is not named in an `INTRINSIC' + statement and a command-line option is used to hide the groups to which + the intrinsic belongs. + + So, it is recommended that any reference in a program unit to an + intrinsic procedure that is not a standard FORTRAN 77 intrinsic be + accompanied by an appropriate `INTRINSIC' statement in that program + unit. This sort of defensive programming makes it more likely that an + implementation will issue a diagnostic rather than generate incorrect + code for such a reference. + + The terminology used below is based on that of the Fortran 90 + standard, so that the text may be more concise and accurate: + + * `OPTIONAL' means the argument may be omitted. + + * `A-1, A-2, ..., A-n' means more than one argument (generally named + `A') may be specified. + + * `scalar' means the argument must not be an array (must be a + variable or array element, or perhaps a constant if expressions + are permitted). + + * `DIMENSION(4)' means the argument must be an array having 4 + elements. + + * `INTENT(IN)' means the argument must be an expression (such as a + constant or a variable that is defined upon invocation of the + intrinsic). + + * `INTENT(OUT)' means the argument must be definable by the + invocation of the intrinsic (that is, must not be a constant nor + an expression involving operators other than array reference and + substring reference). + + * `INTENT(INOUT)' means the argument must be defined prior to, and + definable by, invocation of the intrinsic (a combination of the + requirements of `INTENT(IN)' and `INTENT(OUT)'. + + * *Note Kind Notation::, for an explanation of `KIND'. + + (Note that the empty lines appearing in the menu below are not + intentional--they result from a bug in the GNU `makeinfo' program...a + program that, if it did not exist, would leave this document in far + worse shape!) + + * Menu: + + + * Abort Intrinsic:: Abort the program. + + * Abs Intrinsic:: Absolute value. + + * Access Intrinsic:: Check file accessibility. + + * AChar Intrinsic:: ASCII character from code. + + * ACos Intrinsic:: Arc cosine. + + * AdjustL Intrinsic:: (Reserved for future use.) + * AdjustR Intrinsic:: (Reserved for future use.) + + * AImag Intrinsic:: Convert/extract imaginary part of complex. + + * AInt Intrinsic:: Truncate to whole number. + + * Alarm Intrinsic:: Execute a routine after a given delay. + + * All Intrinsic:: (Reserved for future use.) + * Allocated Intrinsic:: (Reserved for future use.) + + * ALog Intrinsic:: Natural logarithm (archaic). + * ALog10 Intrinsic:: Common logarithm (archaic). + * AMax0 Intrinsic:: Maximum value (archaic). + * AMax1 Intrinsic:: Maximum value (archaic). + * AMin0 Intrinsic:: Minimum value (archaic). + * AMin1 Intrinsic:: Minimum value (archaic). + * AMod Intrinsic:: Remainder (archaic). + + * And Intrinsic:: Boolean AND. + + * ANInt Intrinsic:: Round to nearest whole number. + + * Any Intrinsic:: (Reserved for future use.) + + * ASin Intrinsic:: Arc sine. + + * Associated Intrinsic:: (Reserved for future use.) + + * ATan Intrinsic:: Arc tangent. + * ATan2 Intrinsic:: Arc tangent. + + * BesJ0 Intrinsic:: Bessel function. + * BesJ1 Intrinsic:: Bessel function. + * BesJN Intrinsic:: Bessel function. + * BesY0 Intrinsic:: Bessel function. + * BesY1 Intrinsic:: Bessel function. + * BesYN Intrinsic:: Bessel function. + + * Bit_Size Intrinsic:: Number of bits in argument's type. + + * BTest Intrinsic:: Test bit. + + * CAbs Intrinsic:: Absolute value (archaic). + * CCos Intrinsic:: Cosine (archaic). + + * Ceiling Intrinsic:: (Reserved for future use.) + + * CExp Intrinsic:: Exponential (archaic). + * Char Intrinsic:: Character from code. + + * ChDir Intrinsic (subroutine):: Change directory. + + * ChMod Intrinsic (subroutine):: Change file modes. + + * CLog Intrinsic:: Natural logarithm (archaic). + * Cmplx Intrinsic:: Construct `COMPLEX(KIND=1)' value. + + * Complex Intrinsic:: Build complex value from real and + imaginary parts. + + * Conjg Intrinsic:: Complex conjugate. + * Cos Intrinsic:: Cosine. + + * CosH Intrinsic:: Hyperbolic cosine. + + * Count Intrinsic:: (Reserved for future use.) + * CPU_Time Intrinsic:: Get current CPU time. + * CShift Intrinsic:: (Reserved for future use.) + + * CSin Intrinsic:: Sine (archaic). + * CSqRt Intrinsic:: Square root (archaic). + + * CTime Intrinsic (subroutine):: Convert time to Day Mon dd hh:mm:ss yyyy. + * CTime Intrinsic (function):: Convert time to Day Mon dd hh:mm:ss yyyy. + + * DAbs Intrinsic:: Absolute value (archaic). + * DACos Intrinsic:: Arc cosine (archaic). + + * DASin Intrinsic:: Arc sine (archaic). + + * DATan Intrinsic:: Arc tangent (archaic). + * DATan2 Intrinsic:: Arc tangent (archaic). + + * Date_and_Time Intrinsic:: Get the current date and time. + + * DbesJ0 Intrinsic:: Bessel function (archaic). + * DbesJ1 Intrinsic:: Bessel function (archaic). + * DbesJN Intrinsic:: Bessel function (archaic). + * DbesY0 Intrinsic:: Bessel function (archaic). + * DbesY1 Intrinsic:: Bessel function (archaic). + * DbesYN Intrinsic:: Bessel function (archaic). + + * Dble Intrinsic:: Convert to double precision. + + * DCos Intrinsic:: Cosine (archaic). + + * DCosH Intrinsic:: Hyperbolic cosine (archaic). + * DDiM Intrinsic:: Difference magnitude (archaic). + + * DErF Intrinsic:: Error function (archaic). + * DErFC Intrinsic:: Complementary error function (archaic). + + * DExp Intrinsic:: Exponential (archaic). + + * Digits Intrinsic:: (Reserved for future use.) + + * DiM Intrinsic:: Difference magnitude (non-negative subtract). + + * DInt Intrinsic:: Truncate to whole number (archaic). + * DLog Intrinsic:: Natural logarithm (archaic). + * DLog10 Intrinsic:: Common logarithm (archaic). + * DMax1 Intrinsic:: Maximum value (archaic). + * DMin1 Intrinsic:: Minimum value (archaic). + * DMod Intrinsic:: Remainder (archaic). + * DNInt Intrinsic:: Round to nearest whole number (archaic). + + * Dot_Product Intrinsic:: (Reserved for future use.) + + * DProd Intrinsic:: Double-precision product. + + * DSign Intrinsic:: Apply sign to magnitude (archaic). + * DSin Intrinsic:: Sine (archaic). + + * DSinH Intrinsic:: Hyperbolic sine (archaic). + * DSqRt Intrinsic:: Square root (archaic). + * DTan Intrinsic:: Tangent (archaic). + + * DTanH Intrinsic:: Hyperbolic tangent (archaic). + + * DTime Intrinsic (subroutine):: Get elapsed time since last time. + + * EOShift Intrinsic:: (Reserved for future use.) + * Epsilon Intrinsic:: (Reserved for future use.) + + * ErF Intrinsic:: Error function. + * ErFC Intrinsic:: Complementary error function. + * ETime Intrinsic (subroutine):: Get elapsed time for process. + * ETime Intrinsic (function):: Get elapsed time for process. + * Exit Intrinsic:: Terminate the program. + + * Exp Intrinsic:: Exponential. + + * Exponent Intrinsic:: (Reserved for future use.) + + * FDate Intrinsic (subroutine):: Get current time as Day Mon dd hh:mm:ss yyyy. + * FDate Intrinsic (function):: Get current time as Day Mon dd hh:mm:ss yyyy. + * FGet Intrinsic (subroutine):: Read a character from unit 5 stream-wise. + + * FGetC Intrinsic (subroutine):: Read a character stream-wise. + + * Float Intrinsic:: Conversion (archaic). + + * Floor Intrinsic:: (Reserved for future use.) + + * Flush Intrinsic:: Flush buffered output. + * FNum Intrinsic:: Get file descriptor from Fortran unit number. + * FPut Intrinsic (subroutine):: Write a character to unit 6 stream-wise. + + * FPutC Intrinsic (subroutine):: Write a character stream-wise. + + * Fraction Intrinsic:: (Reserved for future use.) + + * FSeek Intrinsic:: Position file (low-level). + * FStat Intrinsic (subroutine):: Get file information. + * FStat Intrinsic (function):: Get file information. + * FTell Intrinsic (subroutine):: Get file position (low-level). + * FTell Intrinsic (function):: Get file position (low-level). + * GError Intrinsic:: Get error message for last error. + * GetArg Intrinsic:: Obtain command-line argument. + * GetCWD Intrinsic (subroutine):: Get current working directory. + * GetCWD Intrinsic (function):: Get current working directory. + * GetEnv Intrinsic:: Get environment variable. + * GetGId Intrinsic:: Get process group id. + * GetLog Intrinsic:: Get login name. + * GetPId Intrinsic:: Get process id. + * GetUId Intrinsic:: Get process user id. + * GMTime Intrinsic:: Convert time to GMT time info. + * HostNm Intrinsic (subroutine):: Get host name. + * HostNm Intrinsic (function):: Get host name. + + * Huge Intrinsic:: (Reserved for future use.) + + * IAbs Intrinsic:: Absolute value (archaic). + + * IAChar Intrinsic:: ASCII code for character. + + * IAnd Intrinsic:: Boolean AND. + + * IArgC Intrinsic:: Obtain count of command-line arguments. + + * IBClr Intrinsic:: Clear a bit. + * IBits Intrinsic:: Extract a bit subfield of a variable. + * IBSet Intrinsic:: Set a bit. + + * IChar Intrinsic:: Code for character. + + * IDate Intrinsic (UNIX):: Get local time info. + + * IDiM Intrinsic:: Difference magnitude (archaic). + * IDInt Intrinsic:: Convert to `INTEGER' value truncated + to whole number (archaic). + * IDNInt Intrinsic:: Convert to `INTEGER' value rounded + to nearest whole number (archaic). + + * IEOr Intrinsic:: Boolean XOR. + + * IErrNo Intrinsic:: Get error number for last error. + + * IFix Intrinsic:: Conversion (archaic). + + * Imag Intrinsic:: Extract imaginary part of complex. + + * ImagPart Intrinsic:: Extract imaginary part of complex. + + * Index Intrinsic:: Locate a CHARACTER substring. + + * Int Intrinsic:: Convert to `INTEGER' value truncated + to whole number. + + * Int2 Intrinsic:: Convert to `INTEGER(KIND=6)' value + truncated to whole number. + * Int8 Intrinsic:: Convert to `INTEGER(KIND=2)' value + truncated to whole number. + + * IOr Intrinsic:: Boolean OR. + + * IRand Intrinsic:: Random number. + * IsaTty Intrinsic:: Is unit connected to a terminal? + + * IShft Intrinsic:: Logical bit shift. + * IShftC Intrinsic:: Circular bit shift. + + * ISign Intrinsic:: Apply sign to magnitude (archaic). + + * ITime Intrinsic:: Get local time of day. + + * Kill Intrinsic (subroutine):: Signal a process. + + * Kind Intrinsic:: (Reserved for future use.) + * LBound Intrinsic:: (Reserved for future use.) + + * Len Intrinsic:: Length of character entity. + + * Len_Trim Intrinsic:: Get last non-blank character in string. + + * LGe Intrinsic:: Lexically greater than or equal. + * LGt Intrinsic:: Lexically greater than. + + * Link Intrinsic (subroutine):: Make hard link in file system. + + * LLe Intrinsic:: Lexically less than or equal. + * LLt Intrinsic:: Lexically less than. + + * LnBlnk Intrinsic:: Get last non-blank character in string. + * Loc Intrinsic:: Address of entity in core. + + * Log Intrinsic:: Natural logarithm. + * Log10 Intrinsic:: Common logarithm. + + * Logical Intrinsic:: (Reserved for future use.) + + * Long Intrinsic:: Conversion to `INTEGER(KIND=1)' (archaic). + + * LShift Intrinsic:: Left-shift bits. + + * LStat Intrinsic (subroutine):: Get file information. + * LStat Intrinsic (function):: Get file information. + * LTime Intrinsic:: Convert time to local time info. + + * MatMul Intrinsic:: (Reserved for future use.) + + * Max Intrinsic:: Maximum value. + * Max0 Intrinsic:: Maximum value (archaic). + * Max1 Intrinsic:: Maximum value (archaic). + + * MaxExponent Intrinsic:: (Reserved for future use.) + * MaxLoc Intrinsic:: (Reserved for future use.) + * MaxVal Intrinsic:: (Reserved for future use.) + + * MClock Intrinsic:: Get number of clock ticks for process. + * MClock8 Intrinsic:: Get number of clock ticks for process. + + * Merge Intrinsic:: (Reserved for future use.) + + * Min Intrinsic:: Minimum value. + * Min0 Intrinsic:: Minimum value (archaic). + * Min1 Intrinsic:: Minimum value (archaic). + + * MinExponent Intrinsic:: (Reserved for future use.) + * MinLoc Intrinsic:: (Reserved for future use.) + * MinVal Intrinsic:: (Reserved for future use.) + + * Mod Intrinsic:: Remainder. + + * Modulo Intrinsic:: (Reserved for future use.) + + * MvBits Intrinsic:: Moving a bit field. + + * Nearest Intrinsic:: (Reserved for future use.) + + * NInt Intrinsic:: Convert to `INTEGER' value rounded + to nearest whole number. + + * Not Intrinsic:: Boolean NOT. + + * Or Intrinsic:: Boolean OR. + + * Pack Intrinsic:: (Reserved for future use.) + + * PError Intrinsic:: Print error message for last error. + + * Precision Intrinsic:: (Reserved for future use.) + * Present Intrinsic:: (Reserved for future use.) + * Product Intrinsic:: (Reserved for future use.) + + * Radix Intrinsic:: (Reserved for future use.) + + * Rand Intrinsic:: Random number. + + * Random_Number Intrinsic:: (Reserved for future use.) + * Random_Seed Intrinsic:: (Reserved for future use.) + * Range Intrinsic:: (Reserved for future use.) + + * Real Intrinsic:: Convert value to type `REAL(KIND=1)'. + + * RealPart Intrinsic:: Extract real part of complex. + + * Rename Intrinsic (subroutine):: Rename file. + + * Repeat Intrinsic:: (Reserved for future use.) + * Reshape Intrinsic:: (Reserved for future use.) + * RRSpacing Intrinsic:: (Reserved for future use.) + + * RShift Intrinsic:: Right-shift bits. + + * Scale Intrinsic:: (Reserved for future use.) + * Scan Intrinsic:: (Reserved for future use.) + + * Second Intrinsic (function):: Get CPU time for process in seconds. + * Second Intrinsic (subroutine):: Get CPU time for process + in seconds. + + * Selected_Int_Kind Intrinsic:: (Reserved for future use.) + * Selected_Real_Kind Intrinsic:: (Reserved for future use.) + * Set_Exponent Intrinsic:: (Reserved for future use.) + * Shape Intrinsic:: (Reserved for future use.) + + * Short Intrinsic:: Convert to `INTEGER(KIND=6)' value + truncated to whole number. + + * Sign Intrinsic:: Apply sign to magnitude. + + * Signal Intrinsic (subroutine):: Muck with signal handling. + + * Sin Intrinsic:: Sine. + + * SinH Intrinsic:: Hyperbolic sine. + + * Sleep Intrinsic:: Sleep for a specified time. + + * Sngl Intrinsic:: Convert (archaic). + + * Spacing Intrinsic:: (Reserved for future use.) + * Spread Intrinsic:: (Reserved for future use.) + + * SqRt Intrinsic:: Square root. + + * SRand Intrinsic:: Random seed. + * Stat Intrinsic (subroutine):: Get file information. + * Stat Intrinsic (function):: Get file information. + + * Sum Intrinsic:: (Reserved for future use.) + + * SymLnk Intrinsic (subroutine):: Make symbolic link in file system. + + * System Intrinsic (subroutine):: Invoke shell (system) command. + + * System_Clock Intrinsic:: Get current system clock value. + + * Tan Intrinsic:: Tangent. + + * TanH Intrinsic:: Hyperbolic tangent. + + * Time Intrinsic (UNIX):: Get current time as time value. + + * Time8 Intrinsic:: Get current time as time value. + + * Tiny Intrinsic:: (Reserved for future use.) + * Transfer Intrinsic:: (Reserved for future use.) + * Transpose Intrinsic:: (Reserved for future use.) + * Trim Intrinsic:: (Reserved for future use.) + + * TtyNam Intrinsic (subroutine):: Get name of terminal device for unit. + * TtyNam Intrinsic (function):: Get name of terminal device for unit. + + * UBound Intrinsic:: (Reserved for future use.) + + * UMask Intrinsic (subroutine):: Set file creation permissions mask. + + * Unlink Intrinsic (subroutine):: Unlink file. + + * Unpack Intrinsic:: (Reserved for future use.) + * Verify Intrinsic:: (Reserved for future use.) + + * XOr Intrinsic:: Boolean XOR. + * ZAbs Intrinsic:: Absolute value (archaic). + * ZCos Intrinsic:: Cosine (archaic). + * ZExp Intrinsic:: Exponential (archaic). + + * ZLog Intrinsic:: Natural logarithm (archaic). + * ZSin Intrinsic:: Sine (archaic). + * ZSqRt Intrinsic:: Square root (archaic). + +  + File: g77.info, Node: Abort Intrinsic, Next: Abs Intrinsic, Up: Table of Intrinsic Functions + + Abort Intrinsic + ............... + + CALL Abort() + + Intrinsic groups: `unix'. + + Description: + + Prints a message and potentially causes a core dump via `abort(3)'. + +  + File: g77.info, Node: Abs Intrinsic, Next: Access Intrinsic, Prev: Abort Intrinsic, Up: Table of Intrinsic Functions + + Abs Intrinsic + ............. + + Abs(A) + + Abs: `INTEGER' or `REAL' function. The exact type depends on that of + argument A--if A is `COMPLEX', this function's type is `REAL' with the + same `KIND=' value as the type of A. Otherwise, this function's type + is the same as that of A. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the absolute value of A. + + If A is type `COMPLEX', the absolute value is computed as: + + SQRT(REALPART(A)**2+IMAGPART(A)**2) + + Otherwise, it is computed by negating A if it is negative, or returning + A. + + *Note Sign Intrinsic::, for how to explicitly compute the positive + or negative form of the absolute value of an expression. + +  + File: g77.info, Node: Access Intrinsic, Next: AChar Intrinsic, Prev: Abs Intrinsic, Up: Table of Intrinsic Functions + + Access Intrinsic + ................ + + Access(NAME, MODE) + + Access: `INTEGER(KIND=1)' function. + + NAME: `CHARACTER'; scalar; INTENT(IN). + + MODE: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Checks file NAME for accessibility in the mode specified by MODE and + returns 0 if the file is accessible in that mode, otherwise an error + code if the file is inaccessible or MODE is invalid. See `access(2)'. + A null character (`CHAR(0)') marks the end of the name in + NAME--otherwise, trailing blanks in NAME are ignored. MODE may be a + concatenation of any of the following characters: + + `r' + Read permission + + `w' + Write permission + + `x' + Execute permission + + `SPC' + Existence + +  + File: g77.info, Node: AChar Intrinsic, Next: ACos Intrinsic, Prev: Access Intrinsic, Up: Table of Intrinsic Functions + + AChar Intrinsic + ............... + + AChar(I) + + AChar: `CHARACTER*1' function. + + I: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `f90'. + + Description: + + Returns the ASCII character corresponding to the code specified by I. + + *Note IAChar Intrinsic::, for the inverse of this function. + + *Note Char Intrinsic::, for the function corresponding to the + system's native character set. + +  + File: g77.info, Node: ACos Intrinsic, Next: AdjustL Intrinsic, Prev: AChar Intrinsic, Up: Table of Intrinsic Functions + + ACos Intrinsic + .............. + + ACos(X) + + ACos: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the arc-cosine (inverse cosine) of X in radians. + + *Note Cos Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: AdjustL Intrinsic, Next: AdjustR Intrinsic, Prev: ACos Intrinsic, Up: Table of Intrinsic Functions + + AdjustL Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AdjustL' to use this name for + an external procedure. + +  + File: g77.info, Node: AdjustR Intrinsic, Next: AImag Intrinsic, Prev: AdjustL Intrinsic, Up: Table of Intrinsic Functions + + AdjustR Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL AdjustR' to use this name for + an external procedure. + +  + File: g77.info, Node: AImag Intrinsic, Next: AInt Intrinsic, Prev: AdjustR Intrinsic, Up: Table of Intrinsic Functions + + AImag Intrinsic + ............... + + AImag(Z) + + AImag: `REAL' function. This intrinsic is valid when argument Z is + `COMPLEX(KIND=1)'. When Z is any other `COMPLEX' type, this intrinsic + is valid only when used as the argument to `REAL()', as explained below. + + Z: `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the (possibly converted) imaginary part of Z. + + Use of `AIMAG()' with an argument of a type other than + `COMPLEX(KIND=1)' is restricted to the following case: + + REAL(AIMAG(Z)) + + This expression converts the imaginary part of Z to `REAL(KIND=1)'. + + *Note REAL() and AIMAG() of Complex::, for more information. + +  + File: g77.info, Node: AInt Intrinsic, Next: Alarm Intrinsic, Prev: AImag Intrinsic, Up: Table of Intrinsic Functions + + AInt Intrinsic + .............. + + AInt(A) + + AInt: `REAL' function, the `KIND=' value of the type being that of + argument A. + + A: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns A with the fractional portion of its magnitude truncated and + its sign preserved. (Also called "truncation towards zero".) + + *Note ANInt Intrinsic::, for how to round to nearest whole number. + + *Note Int Intrinsic::, for how to truncate and then convert number + to `INTEGER'. + +  + File: g77.info, Node: Alarm Intrinsic, Next: All Intrinsic, Prev: AInt Intrinsic, Up: Table of Intrinsic Functions + + Alarm Intrinsic + ............... + + CALL Alarm(SECONDS, HANDLER, STATUS) + + SECONDS: `INTEGER'; scalar; INTENT(IN). + + HANDLER: Signal handler (`INTEGER FUNCTION' or `SUBROUTINE') or + dummy/global `INTEGER(KIND=1)' scalar. + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Causes external subroutine HANDLER to be executed after a delay of + SECONDS seconds by using `alarm(1)' to set up a signal and `signal(2)' + to catch it. If STATUS is supplied, it will be returned with the + number of seconds remaining until any previously scheduled alarm was + due to be delivered, or zero if there was no previously scheduled alarm. + *Note Signal Intrinsic (subroutine)::. + +  + File: g77.info, Node: All Intrinsic, Next: Allocated Intrinsic, Prev: Alarm Intrinsic, Up: Table of Intrinsic Functions + + All Intrinsic + ............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL All' to use this name for an + external procedure. + +  + File: g77.info, Node: Allocated Intrinsic, Next: ALog Intrinsic, Prev: All Intrinsic, Up: Table of Intrinsic Functions + + Allocated Intrinsic + ................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Allocated' to use this name + for an external procedure. + +  + File: g77.info, Node: ALog Intrinsic, Next: ALog10 Intrinsic, Prev: Allocated Intrinsic, Up: Table of Intrinsic Functions + + ALog Intrinsic + .............. + + ALog(X) + + ALog: `REAL(KIND=1)' function. + + X: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `LOG()' that is specific to one type for X. *Note + Log Intrinsic::. + +  + File: g77.info, Node: ALog10 Intrinsic, Next: AMax0 Intrinsic, Prev: ALog Intrinsic, Up: Table of Intrinsic Functions + + ALog10 Intrinsic + ................ + + ALog10(X) + + ALog10: `REAL(KIND=1)' function. + + X: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `LOG10()' that is specific to one type for X. *Note + Log10 Intrinsic::. + +  + File: g77.info, Node: AMax0 Intrinsic, Next: AMax1 Intrinsic, Prev: ALog10 Intrinsic, Up: Table of Intrinsic Functions + + AMax0 Intrinsic + ............... + + AMax0(A-1, A-2, ..., A-n) + + AMax0: `REAL(KIND=1)' function. + + A: `INTEGER(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MAX()' that is specific to one type for A and a + different return type. *Note Max Intrinsic::. + +  + File: g77.info, Node: AMax1 Intrinsic, Next: AMin0 Intrinsic, Prev: AMax0 Intrinsic, Up: Table of Intrinsic Functions + + AMax1 Intrinsic + ............... + + AMax1(A-1, A-2, ..., A-n) + + AMax1: `REAL(KIND=1)' function. + + A: `REAL(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MAX()' that is specific to one type for A. *Note + Max Intrinsic::. + +  + File: g77.info, Node: AMin0 Intrinsic, Next: AMin1 Intrinsic, Prev: AMax1 Intrinsic, Up: Table of Intrinsic Functions + + AMin0 Intrinsic + ............... + + AMin0(A-1, A-2, ..., A-n) + + AMin0: `REAL(KIND=1)' function. + + A: `INTEGER(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MIN()' that is specific to one type for A and a + different return type. *Note Min Intrinsic::. + +  + File: g77.info, Node: AMin1 Intrinsic, Next: AMod Intrinsic, Prev: AMin0 Intrinsic, Up: Table of Intrinsic Functions + + AMin1 Intrinsic + ............... + + AMin1(A-1, A-2, ..., A-n) + + AMin1: `REAL(KIND=1)' function. + + A: `REAL(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MIN()' that is specific to one type for A. *Note + Min Intrinsic::. + +  + File: g77.info, Node: AMod Intrinsic, Next: And Intrinsic, Prev: AMin1 Intrinsic, Up: Table of Intrinsic Functions + + AMod Intrinsic + .............. + + AMod(A, P) + + AMod: `REAL(KIND=1)' function. + + A: `REAL(KIND=1)'; scalar; INTENT(IN). + + P: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MOD()' that is specific to one type for A. *Note + Mod Intrinsic::. + +  + File: g77.info, Node: And Intrinsic, Next: ANInt Intrinsic, Prev: AMod Intrinsic, Up: Table of Intrinsic Functions + + And Intrinsic + ............. + + And(I, J) + + And: `INTEGER' or `LOGICAL' function, the exact type being the result + of cross-promoting the types of all the arguments. + + I: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + J: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Returns value resulting from boolean AND of pair of bits in each of + I and J. + +  + File: g77.info, Node: ANInt Intrinsic, Next: Any Intrinsic, Prev: And Intrinsic, Up: Table of Intrinsic Functions + + ANInt Intrinsic + ............... + + ANInt(A) + + ANInt: `REAL' function, the `KIND=' value of the type being that of + argument A. + + A: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns A with the fractional portion of its magnitude eliminated by + rounding to the nearest whole number and with its sign preserved. + + A fractional portion exactly equal to `.5' is rounded to the whole + number that is larger in magnitude. (Also called "Fortran round".) + + *Note AInt Intrinsic::, for how to truncate to whole number. + + *Note NInt Intrinsic::, for how to round and then convert number to + `INTEGER'. + +  + File: g77.info, Node: Any Intrinsic, Next: ASin Intrinsic, Prev: ANInt Intrinsic, Up: Table of Intrinsic Functions + + Any Intrinsic + ............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Any' to use this name for an + external procedure. + +  + File: g77.info, Node: ASin Intrinsic, Next: Associated Intrinsic, Prev: Any Intrinsic, Up: Table of Intrinsic Functions + + ASin Intrinsic + .............. + + ASin(X) + + ASin: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the arc-sine (inverse sine) of X in radians. + + *Note Sin Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: Associated Intrinsic, Next: ATan Intrinsic, Prev: ASin Intrinsic, Up: Table of Intrinsic Functions + + Associated Intrinsic + .................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Associated' to use this name + for an external procedure. + +  + File: g77.info, Node: ATan Intrinsic, Next: ATan2 Intrinsic, Prev: Associated Intrinsic, Up: Table of Intrinsic Functions + + ATan Intrinsic + .............. + + ATan(X) + + ATan: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the arc-tangent (inverse tangent) of X in radians. + + *Note Tan Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: ATan2 Intrinsic, Next: BesJ0 Intrinsic, Prev: ATan Intrinsic, Up: Table of Intrinsic Functions + + ATan2 Intrinsic + ............... + + ATan2(Y, X) + + ATan2: `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + Y: `REAL'; scalar; INTENT(IN). + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the arc-tangent (inverse tangent) of the complex number (Y, + X) in radians. + + *Note Tan Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: BesJ0 Intrinsic, Next: BesJ1 Intrinsic, Prev: ATan2 Intrinsic, Up: Table of Intrinsic Functions + + BesJ0 Intrinsic + ............... + + BesJ0(X) + + BesJ0: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the first kind of order 0 of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: BesJ1 Intrinsic, Next: BesJN Intrinsic, Prev: BesJ0 Intrinsic, Up: Table of Intrinsic Functions + + BesJ1 Intrinsic + ............... + + BesJ1(X) + + BesJ1: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the first kind of order 1 of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: BesJN Intrinsic, Next: BesY0 Intrinsic, Prev: BesJ1 Intrinsic, Up: Table of Intrinsic Functions + + BesJN Intrinsic + ............... + + BesJN(N, X) + + BesJN: `REAL' function, the `KIND=' value of the type being that of + argument X. + + N: `INTEGER' not wider than the default kind; scalar; INTENT(IN). + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the first kind of order N of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: BesY0 Intrinsic, Next: BesY1 Intrinsic, Prev: BesJN Intrinsic, Up: Table of Intrinsic Functions + + BesY0 Intrinsic + ............... + + BesY0(X) + + BesY0: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the second kind of order 0 of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: BesY1 Intrinsic, Next: BesYN Intrinsic, Prev: BesY0 Intrinsic, Up: Table of Intrinsic Functions + + BesY1 Intrinsic + ............... + + BesY1(X) + + BesY1: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the second kind of order 1 of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: BesYN Intrinsic, Next: Bit_Size Intrinsic, Prev: BesY1 Intrinsic, Up: Table of Intrinsic Functions + + BesYN Intrinsic + ............... + + BesYN(N, X) + + BesYN: `REAL' function, the `KIND=' value of the type being that of + argument X. + + N: `INTEGER' not wider than the default kind; scalar; INTENT(IN). + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Calculates the Bessel function of the second kind of order N of X. + See `bessel(3m)', on whose implementation the function depends. + +  + File: g77.info, Node: Bit_Size Intrinsic, Next: BTest Intrinsic, Prev: BesYN Intrinsic, Up: Table of Intrinsic Functions + + Bit_Size Intrinsic + .................. + + Bit_Size(I) + + Bit_Size: `INTEGER' function, the `KIND=' value of the type being that + of argument I. + + I: `INTEGER'; scalar. + + Intrinsic groups: `f90'. + + Description: + + Returns the number of bits (integer precision plus sign bit) + represented by the type for I. + + *Note BTest Intrinsic::, for how to test the value of a bit in a + variable or array. + + *Note IBSet Intrinsic::, for how to set a bit in a variable to 1. + + *Note IBClr Intrinsic::, for how to set a bit in a variable to 0. + +  + File: g77.info, Node: BTest Intrinsic, Next: CAbs Intrinsic, Prev: Bit_Size Intrinsic, Up: Table of Intrinsic Functions + + BTest Intrinsic + ............... + + BTest(I, POS) + + BTest: `LOGICAL(KIND=1)' function. + + I: `INTEGER'; scalar; INTENT(IN). + + POS: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns `.TRUE.' if bit POS in I is 1, `.FALSE.' otherwise. + + (Bit 0 is the low-order (rightmost) bit, adding the value 2**0, or 1, + to the number if set to 1; bit 1 is the next-higher-order bit, adding + 2**1, or 2; bit 2 adds 2**2, or 4; and so on.) + + *Note Bit_Size Intrinsic::, for how to obtain the number of bits in + a type. The leftmost bit of I is `BIT_SIZE(I-1)'. + +  + File: g77.info, Node: CAbs Intrinsic, Next: CCos Intrinsic, Prev: BTest Intrinsic, Up: Table of Intrinsic Functions + + CAbs Intrinsic + .............. + + CAbs(A) + + CAbs: `REAL(KIND=1)' function. + + A: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ABS()' that is specific to one type for A. *Note + Abs Intrinsic::. + +  + File: g77.info, Node: CCos Intrinsic, Next: Ceiling Intrinsic, Prev: CAbs Intrinsic, Up: Table of Intrinsic Functions + + CCos Intrinsic + .............. + + CCos(X) + + CCos: `COMPLEX(KIND=1)' function. + + X: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `COS()' that is specific to one type for X. *Note + Cos Intrinsic::. + +  + File: g77.info, Node: Ceiling Intrinsic, Next: CExp Intrinsic, Prev: CCos Intrinsic, Up: Table of Intrinsic Functions + + Ceiling Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Ceiling' to use this name for + an external procedure. + +  + File: g77.info, Node: CExp Intrinsic, Next: Char Intrinsic, Prev: Ceiling Intrinsic, Up: Table of Intrinsic Functions + + CExp Intrinsic + .............. + + CExp(X) + + CExp: `COMPLEX(KIND=1)' function. + + X: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `EXP()' that is specific to one type for X. *Note + Exp Intrinsic::. + +  + File: g77.info, Node: Char Intrinsic, Next: ChDir Intrinsic (subroutine), Prev: CExp Intrinsic, Up: Table of Intrinsic Functions + + Char Intrinsic + .............. + + Char(I) + + Char: `CHARACTER*1' function. + + I: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the character corresponding to the code specified by I, + using the system's native character set. + + Because the system's native character set is used, the + correspondence between character and their codes is not necessarily the + same between GNU Fortran implementations. + + Note that no intrinsic exists to convert a numerical value to a + printable character string. For example, there is no intrinsic that, + given an `INTEGER' or `REAL' argument with the value `154', returns the + `CHARACTER' result `'154''. + + Instead, you can use internal-file I/O to do this kind of conversion. + For example: + + INTEGER VALUE + CHARACTER*10 STRING + VALUE = 154 + WRITE (STRING, '(I10)'), VALUE + PRINT *, STRING + END + + The above program, when run, prints: + + 154 + + *Note IChar Intrinsic::, for the inverse of the `CHAR' function. + + *Note AChar Intrinsic::, for the function corresponding to the ASCII + character set. + +  + File: g77.info, Node: ChDir Intrinsic (subroutine), Next: ChMod Intrinsic (subroutine), Prev: Char Intrinsic, Up: Table of Intrinsic Functions + + ChDir Intrinsic (subroutine) + ............................ + + CALL ChDir(DIR, STATUS) + + DIR: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets the current working directory to be DIR. If the STATUS + argument is supplied, it contains 0 on success or a non-zero error code + otherwise upon return. See `chdir(3)'. + + _Caution:_ Using this routine during I/O to a unit connected with a + non-absolute file name can cause subsequent I/O on such a unit to fail + because the I/O library might reopen files by name. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note ChDir + Intrinsic (function)::. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-8 gcc-3.2.3/gcc/f/g77.info-8 *** gcc-3.2.2/gcc/f/g77.info-8 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-8 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1995 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: ChMod Intrinsic (subroutine), Next: CLog Intrinsic, Prev: ChDir Intrinsic (subroutine), Up: Table of Intrinsic Functions + + ChMod Intrinsic (subroutine) + ............................ + + CALL ChMod(NAME, MODE, STATUS) + + NAME: `CHARACTER'; scalar; INTENT(IN). + + MODE: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Changes the access mode of file NAME according to the specification + MODE, which is given in the format of `chmod(1)'. A null character + (`CHAR(0)') marks the end of the name in NAME--otherwise, trailing + blanks in NAME are ignored. Currently, NAME must not contain the + single quote character. + + If the STATUS argument is supplied, it contains 0 on success or a + non-zero error code upon return. + + Note that this currently works by actually invoking `/bin/chmod' (or + the `chmod' found when the library was configured) and so might fail in + some circumstances and will, anyway, be slow. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note ChMod + Intrinsic (function)::. + +  + File: g77.info, Node: CLog Intrinsic, Next: Cmplx Intrinsic, Prev: ChMod Intrinsic (subroutine), Up: Table of Intrinsic Functions + + CLog Intrinsic + .............. + + CLog(X) + + CLog: `COMPLEX(KIND=1)' function. + + X: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `LOG()' that is specific to one type for X. *Note + Log Intrinsic::. + +  + File: g77.info, Node: Cmplx Intrinsic, Next: Complex Intrinsic, Prev: CLog Intrinsic, Up: Table of Intrinsic Functions + + Cmplx Intrinsic + ............... + + Cmplx(X, Y) + + Cmplx: `COMPLEX(KIND=1)' function. + + X: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Y: `INTEGER' or `REAL'; OPTIONAL (must be omitted if X is `COMPLEX'); + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + If X is not type `COMPLEX', constructs a value of type + `COMPLEX(KIND=1)' from the real and imaginary values specified by X and + Y, respectively. If Y is omitted, `0.' is assumed. + + If X is type `COMPLEX', converts it to type `COMPLEX(KIND=1)'. + + *Note Complex Intrinsic::, for information on easily constructing a + `COMPLEX' value of arbitrary precision from `REAL' arguments. + +  + File: g77.info, Node: Complex Intrinsic, Next: Conjg Intrinsic, Prev: Cmplx Intrinsic, Up: Table of Intrinsic Functions + + Complex Intrinsic + ................. + + Complex(REAL, IMAG) + + Complex: `COMPLEX' function, the exact type being the result of + cross-promoting the types of all the arguments. + + REAL: `INTEGER' or `REAL'; scalar; INTENT(IN). + + IMAG: `INTEGER' or `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `gnu'. + + Description: + + Returns a `COMPLEX' value that has `Real' and `Imag' as its real and + imaginary parts, respectively. + + If REAL and IMAG are the same type, and that type is not `INTEGER', + no data conversion is performed, and the type of the resulting value + has the same kind value as the types of REAL and IMAG. + + If REAL and IMAG are not the same type, the usual type-promotion + rules are applied to both, converting either or both to the appropriate + `REAL' type. The type of the resulting value has the same kind value + as the type to which both REAL and IMAG were converted, in this case. + + If REAL and IMAG are both `INTEGER', they are both converted to + `REAL(KIND=1)', and the result of the `COMPLEX()' invocation is type + `COMPLEX(KIND=1)'. + + _Note:_ The way to do this in standard Fortran 90 is too hairy to + describe here, but it is important to note that `CMPLX(D1,D2)' returns + a `COMPLEX(KIND=1)' result even if `D1' and `D2' are type + `REAL(KIND=2)'. Hence the availability of `COMPLEX()' in GNU Fortran. + +  + File: g77.info, Node: Conjg Intrinsic, Next: Cos Intrinsic, Prev: Complex Intrinsic, Up: Table of Intrinsic Functions + + Conjg Intrinsic + ............... + + Conjg(Z) + + Conjg: `COMPLEX' function, the `KIND=' value of the type being that of + argument Z. + + Z: `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the complex conjugate: + + COMPLEX(REALPART(Z), -IMAGPART(Z)) + +  + File: g77.info, Node: Cos Intrinsic, Next: CosH Intrinsic, Prev: Conjg Intrinsic, Up: Table of Intrinsic Functions + + Cos Intrinsic + ............. + + Cos(X) + + Cos: `REAL' or `COMPLEX' function, the exact type being that of + argument X. + + X: `REAL' or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the cosine of X, an angle measured in radians. + + *Note ACos Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: CosH Intrinsic, Next: Count Intrinsic, Prev: Cos Intrinsic, Up: Table of Intrinsic Functions + + CosH Intrinsic + .............. + + CosH(X) + + CosH: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the hyperbolic cosine of X. + +  + File: g77.info, Node: Count Intrinsic, Next: CPU_Time Intrinsic, Prev: CosH Intrinsic, Up: Table of Intrinsic Functions + + Count Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Count' to use this name for an + external procedure. + +  + File: g77.info, Node: CPU_Time Intrinsic, Next: CShift Intrinsic, Prev: Count Intrinsic, Up: Table of Intrinsic Functions + + CPU_Time Intrinsic + .................. + + CALL CPU_Time(SECONDS) + + SECONDS: `REAL'; scalar; INTENT(OUT). + + Intrinsic groups: `f90'. + + Description: + + Returns in SECONDS the current value of the system time. This + implementation of the Fortran 95 intrinsic is just an alias for + `second' *Note Second Intrinsic (subroutine)::. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + +  + File: g77.info, Node: CShift Intrinsic, Next: CSin Intrinsic, Prev: CPU_Time Intrinsic, Up: Table of Intrinsic Functions + + CShift Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL CShift' to use this name for an + external procedure. + +  + File: g77.info, Node: CSin Intrinsic, Next: CSqRt Intrinsic, Prev: CShift Intrinsic, Up: Table of Intrinsic Functions + + CSin Intrinsic + .............. + + CSin(X) + + CSin: `COMPLEX(KIND=1)' function. + + X: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SIN()' that is specific to one type for X. *Note + Sin Intrinsic::. + +  + File: g77.info, Node: CSqRt Intrinsic, Next: CTime Intrinsic (subroutine), Prev: CSin Intrinsic, Up: Table of Intrinsic Functions + + CSqRt Intrinsic + ............... + + CSqRt(X) + + CSqRt: `COMPLEX(KIND=1)' function. + + X: `COMPLEX(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SQRT()' that is specific to one type for X. *Note + SqRt Intrinsic::. + +  + File: g77.info, Node: CTime Intrinsic (subroutine), Next: CTime Intrinsic (function), Prev: CSqRt Intrinsic, Up: Table of Intrinsic Functions + + CTime Intrinsic (subroutine) + ............................ + + CALL CTime(STIME, RESULT) + + STIME: `INTEGER'; scalar; INTENT(IN). + + RESULT: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Converts STIME, a system time value, such as returned by `TIME8()', + to a string of the form `Sat Aug 19 18:13:14 1995', and returns that + string in RESULT. + + *Note Time8 Intrinsic::. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note CTime + Intrinsic (function)::. + +  + File: g77.info, Node: CTime Intrinsic (function), Next: DAbs Intrinsic, Prev: CTime Intrinsic (subroutine), Up: Table of Intrinsic Functions + + CTime Intrinsic (function) + .......................... + + CTime(STIME) + + CTime: `CHARACTER*(*)' function. + + STIME: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Converts STIME, a system time value, such as returned by `TIME8()', + to a string of the form `Sat Aug 19 18:13:14 1995', and returns that + string as the function value. + + *Note Time8 Intrinsic::. + + For information on other intrinsics with the same name: *Note CTime + Intrinsic (subroutine)::. + +  + File: g77.info, Node: DAbs Intrinsic, Next: DACos Intrinsic, Prev: CTime Intrinsic (function), Up: Table of Intrinsic Functions + + DAbs Intrinsic + .............. + + DAbs(A) + + DAbs: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ABS()' that is specific to one type for A. *Note + Abs Intrinsic::. + +  + File: g77.info, Node: DACos Intrinsic, Next: DASin Intrinsic, Prev: DAbs Intrinsic, Up: Table of Intrinsic Functions + + DACos Intrinsic + ............... + + DACos(X) + + DACos: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ACOS()' that is specific to one type for X. *Note + ACos Intrinsic::. + +  + File: g77.info, Node: DASin Intrinsic, Next: DATan Intrinsic, Prev: DACos Intrinsic, Up: Table of Intrinsic Functions + + DASin Intrinsic + ............... + + DASin(X) + + DASin: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ASIN()' that is specific to one type for X. *Note + ASin Intrinsic::. + +  + File: g77.info, Node: DATan Intrinsic, Next: DATan2 Intrinsic, Prev: DASin Intrinsic, Up: Table of Intrinsic Functions + + DATan Intrinsic + ............... + + DATan(X) + + DATan: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ATAN()' that is specific to one type for X. *Note + ATan Intrinsic::. + +  + File: g77.info, Node: DATan2 Intrinsic, Next: Date_and_Time Intrinsic, Prev: DATan Intrinsic, Up: Table of Intrinsic Functions + + DATan2 Intrinsic + ................ + + DATan2(Y, X) + + DATan2: `REAL(KIND=2)' function. + + Y: `REAL(KIND=2)'; scalar; INTENT(IN). + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ATAN2()' that is specific to one type for Y and X. + *Note ATan2 Intrinsic::. + +  + File: g77.info, Node: Date_and_Time Intrinsic, Next: DbesJ0 Intrinsic, Prev: DATan2 Intrinsic, Up: Table of Intrinsic Functions + + Date_and_Time Intrinsic + ....................... + + CALL Date_and_Time(DATE, TIME, ZONE, VALUES) + + DATE: `CHARACTER'; scalar; INTENT(OUT). + + TIME: `CHARACTER'; OPTIONAL; scalar; INTENT(OUT). + + ZONE: `CHARACTER'; OPTIONAL; scalar; INTENT(OUT). + + VALUES: `INTEGER(KIND=1)'; OPTIONAL; DIMENSION(8); INTENT(OUT). + + Intrinsic groups: `f90'. + + Description: + + Returns: + DATE + The date in the form CCYYMMDD: century, year, month and day; + + TIME + The time in the form `HHMMSS.SS': hours, minutes, seconds and + milliseconds; + + ZONE + The difference between local time and UTC (GMT) in the form SHHMM: + sign, hours and minutes, e.g. `-0500' (winter in New York); + + VALUES + The year, month of the year, day of the month, time difference in + minutes from UTC, hour of the day, minutes of the hour, seconds of + the minute, and milliseconds of the second in successive values of + the array. + + Programs making use of this intrinsic might not be Year 10000 (Y10K) + compliant. For example, the date might appear, to such programs, to + wrap around (change from a larger value to a smaller one) as of the + Year 10000. + + On systems where a millisecond timer isn't available, the millisecond + value is returned as zero. + +  + File: g77.info, Node: DbesJ0 Intrinsic, Next: DbesJ1 Intrinsic, Prev: Date_and_Time Intrinsic, Up: Table of Intrinsic Functions + + DbesJ0 Intrinsic + ................ + + DbesJ0(X) + + DbesJ0: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESJ0()' that is specific to one type for X. *Note + BesJ0 Intrinsic::. + +  + File: g77.info, Node: DbesJ1 Intrinsic, Next: DbesJN Intrinsic, Prev: DbesJ0 Intrinsic, Up: Table of Intrinsic Functions + + DbesJ1 Intrinsic + ................ + + DbesJ1(X) + + DbesJ1: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESJ1()' that is specific to one type for X. *Note + BesJ1 Intrinsic::. + +  + File: g77.info, Node: DbesJN Intrinsic, Next: DbesY0 Intrinsic, Prev: DbesJ1 Intrinsic, Up: Table of Intrinsic Functions + + DbesJN Intrinsic + ................ + + DbesJN(N, X) + + DbesJN: `REAL(KIND=2)' function. + + N: `INTEGER' not wider than the default kind; scalar; INTENT(IN). + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESJN()' that is specific to one type for X. *Note + BesJN Intrinsic::. + +  + File: g77.info, Node: DbesY0 Intrinsic, Next: DbesY1 Intrinsic, Prev: DbesJN Intrinsic, Up: Table of Intrinsic Functions + + DbesY0 Intrinsic + ................ + + DbesY0(X) + + DbesY0: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESY0()' that is specific to one type for X. *Note + BesY0 Intrinsic::. + +  + File: g77.info, Node: DbesY1 Intrinsic, Next: DbesYN Intrinsic, Prev: DbesY0 Intrinsic, Up: Table of Intrinsic Functions + + DbesY1 Intrinsic + ................ + + DbesY1(X) + + DbesY1: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESY1()' that is specific to one type for X. *Note + BesY1 Intrinsic::. + +  + File: g77.info, Node: DbesYN Intrinsic, Next: Dble Intrinsic, Prev: DbesY1 Intrinsic, Up: Table of Intrinsic Functions + + DbesYN Intrinsic + ................ + + DbesYN(N, X) + + DbesYN: `REAL(KIND=2)' function. + + N: `INTEGER' not wider than the default kind; scalar; INTENT(IN). + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `BESYN()' that is specific to one type for X. *Note + BesYN Intrinsic::. + +  + File: g77.info, Node: Dble Intrinsic, Next: DCos Intrinsic, Prev: DbesYN Intrinsic, Up: Table of Intrinsic Functions + + Dble Intrinsic + .............. + + Dble(A) + + Dble: `REAL(KIND=2)' function. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns A converted to double precision (`REAL(KIND=2)'). If A is + `COMPLEX', the real part of A is used for the conversion and the + imaginary part disregarded. + + *Note Sngl Intrinsic::, for the function that converts to single + precision. + + *Note Int Intrinsic::, for the function that converts to `INTEGER'. + + *Note Complex Intrinsic::, for the function that converts to + `COMPLEX'. + +  + File: g77.info, Node: DCos Intrinsic, Next: DCosH Intrinsic, Prev: Dble Intrinsic, Up: Table of Intrinsic Functions + + DCos Intrinsic + .............. + + DCos(X) + + DCos: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `COS()' that is specific to one type for X. *Note + Cos Intrinsic::. + +  + File: g77.info, Node: DCosH Intrinsic, Next: DDiM Intrinsic, Prev: DCos Intrinsic, Up: Table of Intrinsic Functions + + DCosH Intrinsic + ............... + + DCosH(X) + + DCosH: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `COSH()' that is specific to one type for X. *Note + CosH Intrinsic::. + +  + File: g77.info, Node: DDiM Intrinsic, Next: DErF Intrinsic, Prev: DCosH Intrinsic, Up: Table of Intrinsic Functions + + DDiM Intrinsic + .............. + + DDiM(X, Y) + + DDiM: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Y: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `DIM()' that is specific to one type for X and Y. + *Note DiM Intrinsic::. + +  + File: g77.info, Node: DErF Intrinsic, Next: DErFC Intrinsic, Prev: DDiM Intrinsic, Up: Table of Intrinsic Functions + + DErF Intrinsic + .............. + + DErF(X) + + DErF: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `ERF()' that is specific to one type for X. *Note + ErF Intrinsic::. + +  + File: g77.info, Node: DErFC Intrinsic, Next: DExp Intrinsic, Prev: DErF Intrinsic, Up: Table of Intrinsic Functions + + DErFC Intrinsic + ............... + + DErFC(X) + + DErFC: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `ERFC()' that is specific to one type for X. *Note + ErFC Intrinsic::. + +  + File: g77.info, Node: DExp Intrinsic, Next: Digits Intrinsic, Prev: DErFC Intrinsic, Up: Table of Intrinsic Functions + + DExp Intrinsic + .............. + + DExp(X) + + DExp: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `EXP()' that is specific to one type for X. *Note + Exp Intrinsic::. + +  + File: g77.info, Node: Digits Intrinsic, Next: DiM Intrinsic, Prev: DExp Intrinsic, Up: Table of Intrinsic Functions + + Digits Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Digits' to use this name for an + external procedure. + +  + File: g77.info, Node: DiM Intrinsic, Next: DInt Intrinsic, Prev: Digits Intrinsic, Up: Table of Intrinsic Functions + + DiM Intrinsic + ............. + + DiM(X, Y) + + DiM: `INTEGER' or `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + X: `INTEGER' or `REAL'; scalar; INTENT(IN). + + Y: `INTEGER' or `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `X-Y' if X is greater than Y; otherwise returns zero. + +  + File: g77.info, Node: DInt Intrinsic, Next: DLog Intrinsic, Prev: DiM Intrinsic, Up: Table of Intrinsic Functions + + DInt Intrinsic + .............. + + DInt(A) + + DInt: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `AINT()' that is specific to one type for A. *Note + AInt Intrinsic::. + +  + File: g77.info, Node: DLog Intrinsic, Next: DLog10 Intrinsic, Prev: DInt Intrinsic, Up: Table of Intrinsic Functions + + DLog Intrinsic + .............. + + DLog(X) + + DLog: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `LOG()' that is specific to one type for X. *Note + Log Intrinsic::. + +  + File: g77.info, Node: DLog10 Intrinsic, Next: DMax1 Intrinsic, Prev: DLog Intrinsic, Up: Table of Intrinsic Functions + + DLog10 Intrinsic + ................ + + DLog10(X) + + DLog10: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `LOG10()' that is specific to one type for X. *Note + Log10 Intrinsic::. + +  + File: g77.info, Node: DMax1 Intrinsic, Next: DMin1 Intrinsic, Prev: DLog10 Intrinsic, Up: Table of Intrinsic Functions + + DMax1 Intrinsic + ............... + + DMax1(A-1, A-2, ..., A-n) + + DMax1: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MAX()' that is specific to one type for A. *Note + Max Intrinsic::. + +  + File: g77.info, Node: DMin1 Intrinsic, Next: DMod Intrinsic, Prev: DMax1 Intrinsic, Up: Table of Intrinsic Functions + + DMin1 Intrinsic + ............... + + DMin1(A-1, A-2, ..., A-n) + + DMin1: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MIN()' that is specific to one type for A. *Note + Min Intrinsic::. + +  + File: g77.info, Node: DMod Intrinsic, Next: DNInt Intrinsic, Prev: DMin1 Intrinsic, Up: Table of Intrinsic Functions + + DMod Intrinsic + .............. + + DMod(A, P) + + DMod: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + P: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MOD()' that is specific to one type for A. *Note + Mod Intrinsic::. + +  + File: g77.info, Node: DNInt Intrinsic, Next: Dot_Product Intrinsic, Prev: DMod Intrinsic, Up: Table of Intrinsic Functions + + DNInt Intrinsic + ............... + + DNInt(A) + + DNInt: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ANINT()' that is specific to one type for A. *Note + ANInt Intrinsic::. + +  + File: g77.info, Node: Dot_Product Intrinsic, Next: DProd Intrinsic, Prev: DNInt Intrinsic, Up: Table of Intrinsic Functions + + Dot_Product Intrinsic + ..................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Dot_Product' to use this name + for an external procedure. + +  + File: g77.info, Node: DProd Intrinsic, Next: DSign Intrinsic, Prev: Dot_Product Intrinsic, Up: Table of Intrinsic Functions + + DProd Intrinsic + ............... + + DProd(X, Y) + + DProd: `REAL(KIND=2)' function. + + X: `REAL(KIND=1)'; scalar; INTENT(IN). + + Y: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `DBLE(X)*DBLE(Y)'. + +  + File: g77.info, Node: DSign Intrinsic, Next: DSin Intrinsic, Prev: DProd Intrinsic, Up: Table of Intrinsic Functions + + DSign Intrinsic + ............... + + DSign(A, B) + + DSign: `REAL(KIND=2)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + B: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SIGN()' that is specific to one type for A and B. + *Note Sign Intrinsic::. + +  + File: g77.info, Node: DSin Intrinsic, Next: DSinH Intrinsic, Prev: DSign Intrinsic, Up: Table of Intrinsic Functions + + DSin Intrinsic + .............. + + DSin(X) + + DSin: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SIN()' that is specific to one type for X. *Note + Sin Intrinsic::. + +  + File: g77.info, Node: DSinH Intrinsic, Next: DSqRt Intrinsic, Prev: DSin Intrinsic, Up: Table of Intrinsic Functions + + DSinH Intrinsic + ............... + + DSinH(X) + + DSinH: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SINH()' that is specific to one type for X. *Note + SinH Intrinsic::. + +  + File: g77.info, Node: DSqRt Intrinsic, Next: DTan Intrinsic, Prev: DSinH Intrinsic, Up: Table of Intrinsic Functions + + DSqRt Intrinsic + ............... + + DSqRt(X) + + DSqRt: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SQRT()' that is specific to one type for X. *Note + SqRt Intrinsic::. + +  + File: g77.info, Node: DTan Intrinsic, Next: DTanH Intrinsic, Prev: DSqRt Intrinsic, Up: Table of Intrinsic Functions + + DTan Intrinsic + .............. + + DTan(X) + + DTan: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `TAN()' that is specific to one type for X. *Note + Tan Intrinsic::. + +  + File: g77.info, Node: DTanH Intrinsic, Next: DTime Intrinsic (subroutine), Prev: DTan Intrinsic, Up: Table of Intrinsic Functions + + DTanH Intrinsic + ............... + + DTanH(X) + + DTanH: `REAL(KIND=2)' function. + + X: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `TANH()' that is specific to one type for X. *Note + TanH Intrinsic::. + +  + File: g77.info, Node: DTime Intrinsic (subroutine), Next: EOShift Intrinsic, Prev: DTanH Intrinsic, Up: Table of Intrinsic Functions + + DTime Intrinsic (subroutine) + ............................ + + CALL DTime(TARRAY, RESULT) + + TARRAY: `REAL(KIND=1)'; DIMENSION(2); INTENT(OUT). + + RESULT: `REAL(KIND=1)'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Initially, return the number of seconds of runtime since the start + of the process's execution in RESULT, and the user and system + components of this in `TARRAY(1)' and `TARRAY(2)' respectively. The + value of RESULT is equal to `TARRAY(1) + TARRAY(2)'. + + Subsequent invocations of `DTIME()' set values based on accumulations + since the previous invocation. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note DTime + Intrinsic (function)::. + +  + File: g77.info, Node: EOShift Intrinsic, Next: Epsilon Intrinsic, Prev: DTime Intrinsic (subroutine), Up: Table of Intrinsic Functions + + EOShift Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL EOShift' to use this name for + an external procedure. + +  + File: g77.info, Node: Epsilon Intrinsic, Next: ErF Intrinsic, Prev: EOShift Intrinsic, Up: Table of Intrinsic Functions + + Epsilon Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Epsilon' to use this name for + an external procedure. + +  + File: g77.info, Node: ErF Intrinsic, Next: ErFC Intrinsic, Prev: Epsilon Intrinsic, Up: Table of Intrinsic Functions + + ErF Intrinsic + ............. + + ErF(X) + + ErF: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the error function of X. See `erf(3m)', which provides the + implementation. + +  + File: g77.info, Node: ErFC Intrinsic, Next: ETime Intrinsic (subroutine), Prev: ErF Intrinsic, Up: Table of Intrinsic Functions + + ErFC Intrinsic + .............. + + ErFC(X) + + ErFC: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the complementary error function of X: `ERFC(R) = 1 - + ERF(R)' (except that the result might be more accurate than explicitly + evaluating that formulae would give). See `erfc(3m)', which provides + the implementation. + +  + File: g77.info, Node: ETime Intrinsic (subroutine), Next: ETime Intrinsic (function), Prev: ErFC Intrinsic, Up: Table of Intrinsic Functions + + ETime Intrinsic (subroutine) + ............................ + + CALL ETime(TARRAY, RESULT) + + TARRAY: `REAL(KIND=1)'; DIMENSION(2); INTENT(OUT). + + RESULT: `REAL(KIND=1)'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Return the number of seconds of runtime since the start of the + process's execution in RESULT, and the user and system components of + this in `TARRAY(1)' and `TARRAY(2)' respectively. The value of RESULT + is equal to `TARRAY(1) + TARRAY(2)'. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note ETime + Intrinsic (function)::. + +  + File: g77.info, Node: ETime Intrinsic (function), Next: Exit Intrinsic, Prev: ETime Intrinsic (subroutine), Up: Table of Intrinsic Functions + + ETime Intrinsic (function) + .......................... + + ETime(TARRAY) + + ETime: `REAL(KIND=1)' function. + + TARRAY: `REAL(KIND=1)'; DIMENSION(2); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Return the number of seconds of runtime since the start of the + process's execution as the function value, and the user and system + components of this in `TARRAY(1)' and `TARRAY(2)' respectively. The + functions' value is equal to `TARRAY(1) + TARRAY(2)'. + + On some systems, the underlying timings are represented using types + with sufficiently small limits that overflows (wraparounds) are + possible, such as 32-bit types. Therefore, the values returned by this + intrinsic might be, or become, negative, or numerically less than + previous values, during a single run of the compiled program. + + For information on other intrinsics with the same name: *Note ETime + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Exit Intrinsic, Next: Exp Intrinsic, Prev: ETime Intrinsic (function), Up: Table of Intrinsic Functions + + Exit Intrinsic + .............. + + CALL Exit(STATUS) + + STATUS: `INTEGER' not wider than the default kind; OPTIONAL; scalar; + INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Exit the program with status STATUS after closing open Fortran I/O + units and otherwise behaving as `exit(2)'. If STATUS is omitted the + canonical `success' value will be returned to the system. + +  + File: g77.info, Node: Exp Intrinsic, Next: Exponent Intrinsic, Prev: Exit Intrinsic, Up: Table of Intrinsic Functions + + Exp Intrinsic + ............. + + Exp(X) + + Exp: `REAL' or `COMPLEX' function, the exact type being that of + argument X. + + X: `REAL' or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `E**X', where E is approximately 2.7182818. + + *Note Log Intrinsic::, for the inverse of this function. + +  + File: g77.info, Node: Exponent Intrinsic, Next: FDate Intrinsic (subroutine), Prev: Exp Intrinsic, Up: Table of Intrinsic Functions + + Exponent Intrinsic + .................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Exponent' to use this name for + an external procedure. + +  + File: g77.info, Node: FDate Intrinsic (subroutine), Next: FDate Intrinsic (function), Prev: Exponent Intrinsic, Up: Table of Intrinsic Functions + + FDate Intrinsic (subroutine) + ............................ + + CALL FDate(DATE) + + DATE: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Returns the current date (using the same format as `CTIME()') in + DATE. + + Equivalent to: + + CALL CTIME(DATE, TIME8()) + + Programs making use of this intrinsic might not be Year 10000 (Y10K) + compliant. For example, the date might appear, to such programs, to + wrap around (change from a larger value to a smaller one) as of the + Year 10000. + + *Note CTime Intrinsic (subroutine)::. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note FDate + Intrinsic (function)::. + +  + File: g77.info, Node: FDate Intrinsic (function), Next: FGet Intrinsic (subroutine), Prev: FDate Intrinsic (subroutine), Up: Table of Intrinsic Functions + + FDate Intrinsic (function) + .......................... + + FDate() + + FDate: `CHARACTER*(*)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the current date (using the same format as `CTIME()'). + + Equivalent to: + + CTIME(TIME8()) + + Programs making use of this intrinsic might not be Year 10000 (Y10K) + compliant. For example, the date might appear, to such programs, to + wrap around (change from a larger value to a smaller one) as of the + Year 10000. + + *Note CTime Intrinsic (function)::. + + For information on other intrinsics with the same name: *Note FDate + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FGet Intrinsic (subroutine), Next: FGetC Intrinsic (subroutine), Prev: FDate Intrinsic (function), Up: Table of Intrinsic Functions + + FGet Intrinsic (subroutine) + ........................... + + CALL FGet(C, STATUS) + + C: `CHARACTER'; scalar; INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Reads a single character into C in stream mode from unit 5 + (by-passing normal formatted output) using `getc(3)'. Returns in + STATUS 0 on success, -1 on end-of-file, and the error code from + `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FGet + Intrinsic (function)::. + +  + File: g77.info, Node: FGetC Intrinsic (subroutine), Next: Float Intrinsic, Prev: FGet Intrinsic (subroutine), Up: Table of Intrinsic Functions + + FGetC Intrinsic (subroutine) + ............................ + + CALL FGetC(UNIT, C, STATUS) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + C: `CHARACTER'; scalar; INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Reads a single character into C in stream mode from unit UNIT + (by-passing normal formatted output) using `getc(3)'. Returns in + STATUS 0 on success, -1 on end-of-file, and the error code from + `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FGetC + Intrinsic (function)::. + +  + File: g77.info, Node: Float Intrinsic, Next: Floor Intrinsic, Prev: FGetC Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Float Intrinsic + ............... + + Float(A) + + Float: `REAL(KIND=1)' function. + + A: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `REAL()' that is specific to one type for A. *Note + Real Intrinsic::. + +  + File: g77.info, Node: Floor Intrinsic, Next: Flush Intrinsic, Prev: Float Intrinsic, Up: Table of Intrinsic Functions + + Floor Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Floor' to use this name for an + external procedure. + +  + File: g77.info, Node: Flush Intrinsic, Next: FNum Intrinsic, Prev: Floor Intrinsic, Up: Table of Intrinsic Functions + + Flush Intrinsic + ............... + + CALL Flush(UNIT) + + UNIT: `INTEGER'; OPTIONAL; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Flushes Fortran unit(s) currently open for output. Without the + optional argument, all such units are flushed, otherwise just the unit + specified by UNIT. + + Some non-GNU implementations of Fortran provide this intrinsic as a + library procedure that might or might not support the (optional) UNIT + argument. + +  + File: g77.info, Node: FNum Intrinsic, Next: FPut Intrinsic (subroutine), Prev: Flush Intrinsic, Up: Table of Intrinsic Functions + + FNum Intrinsic + .............. + + FNum(UNIT) + + FNum: `INTEGER(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the Unix file descriptor number corresponding to the open + Fortran I/O unit UNIT. This could be passed to an interface to C I/O + routines. + +  + File: g77.info, Node: FPut Intrinsic (subroutine), Next: FPutC Intrinsic (subroutine), Prev: FNum Intrinsic, Up: Table of Intrinsic Functions + + FPut Intrinsic (subroutine) + ........................... + + CALL FPut(C, STATUS) + + C: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Writes the single character C in stream mode to unit 6 (by-passing + normal formatted output) using `putc(3)'. Returns in STATUS 0 on + success, the error code from `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FPut + Intrinsic (function)::. + +  + File: g77.info, Node: FPutC Intrinsic (subroutine), Next: Fraction Intrinsic, Prev: FPut Intrinsic (subroutine), Up: Table of Intrinsic Functions + + FPutC Intrinsic (subroutine) + ............................ + + CALL FPutC(UNIT, C, STATUS) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + C: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Writes the single character UNIT in stream mode to unit 6 + (by-passing normal formatted output) using `putc(3)'. Returns in C 0 + on success, the error code from `ferror(3)' otherwise. + + Stream I/O should not be mixed with normal record-oriented + (formatted or unformatted) I/O on the same unit; the results are + unpredictable. + + For information on other intrinsics with the same name: *Note FPutC + Intrinsic (function)::. + +  + File: g77.info, Node: Fraction Intrinsic, Next: FSeek Intrinsic, Prev: FPutC Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Fraction Intrinsic + .................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Fraction' to use this name for + an external procedure. + +  + File: g77.info, Node: FSeek Intrinsic, Next: FStat Intrinsic (subroutine), Prev: Fraction Intrinsic, Up: Table of Intrinsic Functions + + FSeek Intrinsic + ............... + + CALL FSeek(UNIT, OFFSET, WHENCE, ERRLAB) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + OFFSET: `INTEGER'; scalar; INTENT(IN). + + WHENCE: `INTEGER'; scalar; INTENT(IN). + + ERRLAB: `*LABEL', where LABEL is the label of an executable statement; + OPTIONAL. + + Intrinsic groups: `unix'. + + Description: + + Attempts to move Fortran unit UNIT to the specified OFFSET: absolute + offset if WHENCE=0; relative to the current offset if WHENCE=1; + relative to the end of the file if WHENCE=2. It branches to label + ERRLAB if UNIT is not open or if the call otherwise fails. + +  + File: g77.info, Node: FStat Intrinsic (subroutine), Next: FStat Intrinsic (function), Prev: FSeek Intrinsic, Up: Table of Intrinsic Functions + + FStat Intrinsic (subroutine) + ............................ + + CALL FStat(UNIT, SARRAY, STATUS) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the file open on Fortran I/O unit UNIT and places + them in the array SARRAY. The values in this array are extracted from + the `stat' structure as returned by `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + If the STATUS argument is supplied, it contains 0 on success or a + non-zero error code upon return. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note FStat + Intrinsic (function)::. + +  + File: g77.info, Node: FStat Intrinsic (function), Next: FTell Intrinsic (subroutine), Prev: FStat Intrinsic (subroutine), Up: Table of Intrinsic Functions + + FStat Intrinsic (function) + .......................... + + FStat(UNIT, SARRAY) + + FStat: `INTEGER(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the file open on Fortran I/O unit UNIT and places + them in the array SARRAY. The values in this array are extracted from + the `stat' structure as returned by `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + Returns 0 on success or a non-zero error code. + + For information on other intrinsics with the same name: *Note FStat + Intrinsic (subroutine)::. + +  + File: g77.info, Node: FTell Intrinsic (subroutine), Next: FTell Intrinsic (function), Prev: FStat Intrinsic (function), Up: Table of Intrinsic Functions + + FTell Intrinsic (subroutine) + ............................ + + CALL FTell(UNIT, OFFSET) + + UNIT: `INTEGER'; scalar; INTENT(IN). + + OFFSET: `INTEGER(KIND=1)'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets OFFSET to the current offset of Fortran unit UNIT (or to -1 if + UNIT is not open). + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine. + + For information on other intrinsics with the same name: *Note FTell + Intrinsic (function)::. + +  + File: g77.info, Node: FTell Intrinsic (function), Next: GError Intrinsic, Prev: FTell Intrinsic (subroutine), Up: Table of Intrinsic Functions + + FTell Intrinsic (function) + .......................... + + FTell(UNIT) + + FTell: `INTEGER(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the current offset of Fortran unit UNIT (or -1 if UNIT is + not open). + + For information on other intrinsics with the same name: *Note FTell + Intrinsic (subroutine)::. + +  + File: g77.info, Node: GError Intrinsic, Next: GetArg Intrinsic, Prev: FTell Intrinsic (function), Up: Table of Intrinsic Functions + + GError Intrinsic + ................ + + CALL GError(MESSAGE) + + MESSAGE: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Returns the system error message corresponding to the last system + error (C `errno'). + +  + File: g77.info, Node: GetArg Intrinsic, Next: GetCWD Intrinsic (subroutine), Prev: GError Intrinsic, Up: Table of Intrinsic Functions + + GetArg Intrinsic + ................ + + CALL GetArg(POS, VALUE) + + POS: `INTEGER' not wider than the default kind; scalar; INTENT(IN). + + VALUE: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets VALUE to the POS-th command-line argument (or to all blanks if + there are fewer than VALUE command-line arguments); `CALL GETARG(0, + VALUE)' sets VALUE to the name of the program (on systems that support + this feature). + + *Note IArgC Intrinsic::, for information on how to get the number of + arguments. + +  + File: g77.info, Node: GetCWD Intrinsic (subroutine), Next: GetCWD Intrinsic (function), Prev: GetArg Intrinsic, Up: Table of Intrinsic Functions + + GetCWD Intrinsic (subroutine) + ............................. + + CALL GetCWD(NAME, STATUS) + + NAME: `CHARACTER'; scalar; INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Places the current working directory in NAME. If the STATUS + argument is supplied, it contains 0 success or a non-zero error code + upon return (`ENOSYS' if the system does not provide `getcwd(3)' or + `getwd(3)'). + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note GetCWD + Intrinsic (function)::. + +  + File: g77.info, Node: GetCWD Intrinsic (function), Next: GetEnv Intrinsic, Prev: GetCWD Intrinsic (subroutine), Up: Table of Intrinsic Functions + + GetCWD Intrinsic (function) + ........................... + + GetCWD(NAME) + + GetCWD: `INTEGER(KIND=1)' function. + + NAME: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Places the current working directory in NAME. Returns 0 on success, + otherwise a non-zero error code (`ENOSYS' if the system does not + provide `getcwd(3)' or `getwd(3)'). + + For information on other intrinsics with the same name: *Note GetCWD + Intrinsic (subroutine)::. + +  + File: g77.info, Node: GetEnv Intrinsic, Next: GetGId Intrinsic, Prev: GetCWD Intrinsic (function), Up: Table of Intrinsic Functions + + GetEnv Intrinsic + ................ + + CALL GetEnv(NAME, VALUE) + + NAME: `CHARACTER'; scalar; INTENT(IN). + + VALUE: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sets VALUE to the value of environment variable given by the value + of NAME (`$name' in shell terms) or to blanks if `$name' has not been + set. A null character (`CHAR(0)') marks the end of the name in + NAME--otherwise, trailing blanks in NAME are ignored. + +  + File: g77.info, Node: GetGId Intrinsic, Next: GetLog Intrinsic, Prev: GetEnv Intrinsic, Up: Table of Intrinsic Functions + + GetGId Intrinsic + ................ + + GetGId() + + GetGId: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the group id for the current process. + +  + File: g77.info, Node: GetLog Intrinsic, Next: GetPId Intrinsic, Prev: GetGId Intrinsic, Up: Table of Intrinsic Functions + + GetLog Intrinsic + ................ + + CALL GetLog(LOGIN) + + LOGIN: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Returns the login name for the process in LOGIN. + + _Caution:_ On some systems, the `getlogin(3)' function, which this + intrinsic calls at run time, is either not implemented or returns a + null pointer. In the latter case, this intrinsic returns blanks in + LOGIN. + +  + File: g77.info, Node: GetPId Intrinsic, Next: GetUId Intrinsic, Prev: GetLog Intrinsic, Up: Table of Intrinsic Functions + + GetPId Intrinsic + ................ + + GetPId() + + GetPId: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the process id for the current process. + +  + File: g77.info, Node: GetUId Intrinsic, Next: GMTime Intrinsic, Prev: GetPId Intrinsic, Up: Table of Intrinsic Functions + + GetUId Intrinsic + ................ + + GetUId() + + GetUId: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the user id for the current process. + +  + File: g77.info, Node: GMTime Intrinsic, Next: HostNm Intrinsic (subroutine), Prev: GetUId Intrinsic, Up: Table of Intrinsic Functions + + GMTime Intrinsic + ................ + + CALL GMTime(STIME, TARRAY) + + STIME: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + TARRAY: `INTEGER(KIND=1)'; DIMENSION(9); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Given a system time value STIME, fills TARRAY with values extracted + from it appropriate to the GMT time zone using `gmtime(3)'. + + The array elements are as follows: + + 1. Seconds after the minute, range 0-59 or 0-61 to allow for leap + seconds + + 2. Minutes after the hour, range 0-59 + + 3. Hours past midnight, range 0-23 + + 4. Day of month, range 0-31 + + 5. Number of months since January, range 0-12 + + 6. Years since 1900 + + 7. Number of days since Sunday, range 0-6 + + 8. Days since January 1 + + 9. Daylight savings indicator: positive if daylight savings is in + effect, zero if not, and negative if the information isn't + available. + +  + File: g77.info, Node: HostNm Intrinsic (subroutine), Next: HostNm Intrinsic (function), Prev: GMTime Intrinsic, Up: Table of Intrinsic Functions + + HostNm Intrinsic (subroutine) + ............................. + + CALL HostNm(NAME, STATUS) + + NAME: `CHARACTER'; scalar; INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Fills NAME with the system's host name returned by `gethostname(2)'. + If the STATUS argument is supplied, it contains 0 on success or a + non-zero error code upon return (`ENOSYS' if the system does not + provide `gethostname(2)'). + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + On some systems (specifically SCO) it might be necessary to link the + "socket" library if you call this routine. Typically this means adding + `-lg2c -lsocket -lm' to the `g77' command line when linking the program. + + For information on other intrinsics with the same name: *Note HostNm + Intrinsic (function)::. + diff -Nrc3pad gcc-3.2.2/gcc/f/g77.info-9 gcc-3.2.3/gcc/f/g77.info-9 *** gcc-3.2.2/gcc/f/g77.info-9 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/f/g77.info-9 Tue Apr 22 07:07:24 2003 *************** *** 0 **** --- 1,1883 ---- + This is g77.info, produced by makeinfo version 4.5 from g77.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * g77: (g77). The GNU Fortran compiler. + END-INFO-DIR-ENTRY + This file documents the use and the internals of the GNU Fortran + (`g77') compiler. It corresponds to the GCC-3.2.3 version of `g77'. + + Published by the Free Software Foundation 59 Temple Place - Suite 330 + Boston, MA 02111-1307 USA + + Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002 Free Software + Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License" and "Funding Free + Software", the Front-Cover texts being (a) (see below), and with the + Back-Cover Texts being (b) (see below). A copy of the license is + included in the section entitled "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + + Contributed by James Craig Burley (). Inspired by + a first pass at translating `g77-0.5.16/f/DOC' that was contributed to + Craig by David Ronis (). + +  + File: g77.info, Node: HostNm Intrinsic (function), Next: Huge Intrinsic, Prev: HostNm Intrinsic (subroutine), Up: Table of Intrinsic Functions + + HostNm Intrinsic (function) + ........................... + + HostNm(NAME) + + HostNm: `INTEGER(KIND=1)' function. + + NAME: `CHARACTER'; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Fills NAME with the system's host name returned by `gethostname(2)', + returning 0 on success or a non-zero error code (`ENOSYS' if the system + does not provide `gethostname(2)'). + + On some systems (specifically SCO) it might be necessary to link the + "socket" library if you call this routine. Typically this means adding + `-lg2c -lsocket -lm' to the `g77' command line when linking the program. + + For information on other intrinsics with the same name: *Note HostNm + Intrinsic (subroutine)::. + +  + File: g77.info, Node: Huge Intrinsic, Next: IAbs Intrinsic, Prev: HostNm Intrinsic (function), Up: Table of Intrinsic Functions + + Huge Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Huge' to use this name for an + external procedure. + +  + File: g77.info, Node: IAbs Intrinsic, Next: IAChar Intrinsic, Prev: Huge Intrinsic, Up: Table of Intrinsic Functions + + IAbs Intrinsic + .............. + + IAbs(A) + + IAbs: `INTEGER(KIND=1)' function. + + A: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `ABS()' that is specific to one type for A. *Note + Abs Intrinsic::. + +  + File: g77.info, Node: IAChar Intrinsic, Next: IAnd Intrinsic, Prev: IAbs Intrinsic, Up: Table of Intrinsic Functions + + IAChar Intrinsic + ................ + + IAChar(C) + + IAChar: `INTEGER(KIND=1)' function. + + C: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `f2c', `f90'. + + Description: + + Returns the code for the ASCII character in the first character + position of C. + + *Note AChar Intrinsic::, for the inverse of this function. + + *Note IChar Intrinsic::, for the function corresponding to the + system's native character set. + +  + File: g77.info, Node: IAnd Intrinsic, Next: IArgC Intrinsic, Prev: IAChar Intrinsic, Up: Table of Intrinsic Functions + + IAnd Intrinsic + .............. + + IAnd(I, J) + + IAnd: `INTEGER' function, the exact type being the result of + cross-promoting the types of all the arguments. + + I: `INTEGER'; scalar; INTENT(IN). + + J: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns value resulting from boolean AND of pair of bits in each of + I and J. + +  + File: g77.info, Node: IArgC Intrinsic, Next: IBClr Intrinsic, Prev: IAnd Intrinsic, Up: Table of Intrinsic Functions + + IArgC Intrinsic + ............... + + IArgC() + + IArgC: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the number of command-line arguments. + + This count does not include the specification of the program name + itself. + +  + File: g77.info, Node: IBClr Intrinsic, Next: IBits Intrinsic, Prev: IArgC Intrinsic, Up: Table of Intrinsic Functions + + IBClr Intrinsic + ............... + + IBClr(I, POS) + + IBClr: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + POS: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns the value of I with bit POS cleared (set to zero). *Note + BTest Intrinsic::, for information on bit positions. + +  + File: g77.info, Node: IBits Intrinsic, Next: IBSet Intrinsic, Prev: IBClr Intrinsic, Up: Table of Intrinsic Functions + + IBits Intrinsic + ............... + + IBits(I, POS, LEN) + + IBits: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + POS: `INTEGER'; scalar; INTENT(IN). + + LEN: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Extracts a subfield of length LEN from I, starting from bit position + POS and extending left for LEN bits. The result is right-justified and + the remaining bits are zeroed. The value of `POS+LEN' must be less + than or equal to the value `BIT_SIZE(I)'. *Note Bit_Size Intrinsic::. + +  + File: g77.info, Node: IBSet Intrinsic, Next: IChar Intrinsic, Prev: IBits Intrinsic, Up: Table of Intrinsic Functions + + IBSet Intrinsic + ............... + + IBSet(I, POS) + + IBSet: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + POS: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns the value of I with bit POS set (to one). *Note BTest + Intrinsic::, for information on bit positions. + +  + File: g77.info, Node: IChar Intrinsic, Next: IDate Intrinsic (UNIX), Prev: IBSet Intrinsic, Up: Table of Intrinsic Functions + + IChar Intrinsic + ............... + + IChar(C) + + IChar: `INTEGER(KIND=1)' function. + + C: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the code for the character in the first character position + of C. + + Because the system's native character set is used, the + correspondence between character and their codes is not necessarily the + same between GNU Fortran implementations. + + Note that no intrinsic exists to convert a printable character + string to a numerical value. For example, there is no intrinsic that, + given the `CHARACTER' value `'154'', returns an `INTEGER' or `REAL' + value with the value `154'. + + Instead, you can use internal-file I/O to do this kind of conversion. + For example: + + INTEGER VALUE + CHARACTER*10 STRING + STRING = '154' + READ (STRING, '(I10)'), VALUE + PRINT *, VALUE + END + + The above program, when run, prints: + + 154 + + *Note Char Intrinsic::, for the inverse of the `ICHAR' function. + + *Note IAChar Intrinsic::, for the function corresponding to the + ASCII character set. + +  + File: g77.info, Node: IDate Intrinsic (UNIX), Next: IDiM Intrinsic, Prev: IChar Intrinsic, Up: Table of Intrinsic Functions + + IDate Intrinsic (UNIX) + ...................... + + CALL IDate(TARRAY) + + TARRAY: `INTEGER(KIND=1)'; DIMENSION(3); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Fills TARRAY with the numerical values at the current local time of + day, month (in the range 1-12), and year in elements 1, 2, and 3, + respectively. The year has four significant digits. + + Programs making use of this intrinsic might not be Year 10000 (Y10K) + compliant. For example, the date might appear, to such programs, to + wrap around (change from a larger value to a smaller one) as of the + Year 10000. + + For information on other intrinsics with the same name: *Note IDate + Intrinsic (VXT)::. + +  + File: g77.info, Node: IDiM Intrinsic, Next: IDInt Intrinsic, Prev: IDate Intrinsic (UNIX), Up: Table of Intrinsic Functions + + IDiM Intrinsic + .............. + + IDiM(X, Y) + + IDiM: `INTEGER(KIND=1)' function. + + X: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + Y: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `DIM()' that is specific to one type for X and Y. + *Note DiM Intrinsic::. + +  + File: g77.info, Node: IDInt Intrinsic, Next: IDNInt Intrinsic, Prev: IDiM Intrinsic, Up: Table of Intrinsic Functions + + IDInt Intrinsic + ............... + + IDInt(A) + + IDInt: `INTEGER(KIND=1)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `INT()' that is specific to one type for A. *Note + Int Intrinsic::. + +  + File: g77.info, Node: IDNInt Intrinsic, Next: IEOr Intrinsic, Prev: IDInt Intrinsic, Up: Table of Intrinsic Functions + + IDNInt Intrinsic + ................ + + IDNInt(A) + + IDNInt: `INTEGER(KIND=1)' function. + + A: `REAL(KIND=2)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `NINT()' that is specific to one type for A. *Note + NInt Intrinsic::. + +  + File: g77.info, Node: IEOr Intrinsic, Next: IErrNo Intrinsic, Prev: IDNInt Intrinsic, Up: Table of Intrinsic Functions + + IEOr Intrinsic + .............. + + IEOr(I, J) + + IEOr: `INTEGER' function, the exact type being the result of + cross-promoting the types of all the arguments. + + I: `INTEGER'; scalar; INTENT(IN). + + J: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns value resulting from boolean exclusive-OR of pair of bits in + each of I and J. + +  + File: g77.info, Node: IErrNo Intrinsic, Next: IFix Intrinsic, Prev: IEOr Intrinsic, Up: Table of Intrinsic Functions + + IErrNo Intrinsic + ................ + + IErrNo() + + IErrNo: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the last system error number (corresponding to the C + `errno'). + +  + File: g77.info, Node: IFix Intrinsic, Next: Imag Intrinsic, Prev: IErrNo Intrinsic, Up: Table of Intrinsic Functions + + IFix Intrinsic + .............. + + IFix(A) + + IFix: `INTEGER(KIND=1)' function. + + A: `REAL(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `INT()' that is specific to one type for A. *Note + Int Intrinsic::. + +  + File: g77.info, Node: Imag Intrinsic, Next: ImagPart Intrinsic, Prev: IFix Intrinsic, Up: Table of Intrinsic Functions + + Imag Intrinsic + .............. + + Imag(Z) + + Imag: `REAL' function, the `KIND=' value of the type being that of + argument Z. + + Z: `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + The imaginary part of Z is returned, without conversion. + + _Note:_ The way to do this in standard Fortran 90 is `AIMAG(Z)'. + However, when, for example, Z is `DOUBLE COMPLEX', `AIMAG(Z)' means + something different for some compilers that are not true Fortran 90 + compilers but offer some extensions standardized by Fortran 90 (such as + the `DOUBLE COMPLEX' type, also known as `COMPLEX(KIND=2)'). + + The advantage of `IMAG()' is that, while not necessarily more or + less portable than `AIMAG()', it is more likely to cause a compiler + that doesn't support it to produce a diagnostic than generate incorrect + code. + + *Note REAL() and AIMAG() of Complex::, for more information. + +  + File: g77.info, Node: ImagPart Intrinsic, Next: Index Intrinsic, Prev: Imag Intrinsic, Up: Table of Intrinsic Functions + + ImagPart Intrinsic + .................. + + ImagPart(Z) + + ImagPart: `REAL' function, the `KIND=' value of the type being that of + argument Z. + + Z: `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `gnu'. + + Description: + + The imaginary part of Z is returned, without conversion. + + _Note:_ The way to do this in standard Fortran 90 is `AIMAG(Z)'. + However, when, for example, Z is `DOUBLE COMPLEX', `AIMAG(Z)' means + something different for some compilers that are not true Fortran 90 + compilers but offer some extensions standardized by Fortran 90 (such as + the `DOUBLE COMPLEX' type, also known as `COMPLEX(KIND=2)'). + + The advantage of `IMAGPART()' is that, while not necessarily more or + less portable than `AIMAG()', it is more likely to cause a compiler + that doesn't support it to produce a diagnostic than generate incorrect + code. + + *Note REAL() and AIMAG() of Complex::, for more information. + +  + File: g77.info, Node: Index Intrinsic, Next: Int Intrinsic, Prev: ImagPart Intrinsic, Up: Table of Intrinsic Functions + + Index Intrinsic + ............... + + Index(STRING, SUBSTRING) + + Index: `INTEGER(KIND=1)' function. + + STRING: `CHARACTER'; scalar; INTENT(IN). + + SUBSTRING: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the position of the start of the first occurrence of string + SUBSTRING as a substring in STRING, counting from one. If SUBSTRING + doesn't occur in STRING, zero is returned. + +  + File: g77.info, Node: Int Intrinsic, Next: Int2 Intrinsic, Prev: Index Intrinsic, Up: Table of Intrinsic Functions + + Int Intrinsic + ............. + + Int(A) + + Int: `INTEGER(KIND=1)' function. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns A with the fractional portion of its magnitude truncated and + its sign preserved, converted to type `INTEGER(KIND=1)'. + + If A is type `COMPLEX', its real part is truncated and converted, + and its imaginary part is disregarded. + + *Note NInt Intrinsic::, for how to convert, rounded to nearest whole + number. + + *Note AInt Intrinsic::, for how to truncate to whole number without + converting. + +  + File: g77.info, Node: Int2 Intrinsic, Next: Int8 Intrinsic, Prev: Int Intrinsic, Up: Table of Intrinsic Functions + + Int2 Intrinsic + .............. + + Int2(A) + + Int2: `INTEGER(KIND=6)' function. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `gnu'. + + Description: + + Returns A with the fractional portion of its magnitude truncated and + its sign preserved, converted to type `INTEGER(KIND=6)'. + + If A is type `COMPLEX', its real part is truncated and converted, + and its imaginary part is disgregarded. + + *Note Int Intrinsic::. + + The precise meaning of this intrinsic might change in a future + version of the GNU Fortran language, as more is learned about how it is + used. + +  + File: g77.info, Node: Int8 Intrinsic, Next: IOr Intrinsic, Prev: Int2 Intrinsic, Up: Table of Intrinsic Functions + + Int8 Intrinsic + .............. + + Int8(A) + + Int8: `INTEGER(KIND=2)' function. + + A: `INTEGER', `REAL', or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: `gnu'. + + Description: + + Returns A with the fractional portion of its magnitude truncated and + its sign preserved, converted to type `INTEGER(KIND=2)'. + + If A is type `COMPLEX', its real part is truncated and converted, + and its imaginary part is disgregarded. + + *Note Int Intrinsic::. + + The precise meaning of this intrinsic might change in a future + version of the GNU Fortran language, as more is learned about how it is + used. + +  + File: g77.info, Node: IOr Intrinsic, Next: IRand Intrinsic, Prev: Int8 Intrinsic, Up: Table of Intrinsic Functions + + IOr Intrinsic + ............. + + IOr(I, J) + + IOr: `INTEGER' function, the exact type being the result of + cross-promoting the types of all the arguments. + + I: `INTEGER'; scalar; INTENT(IN). + + J: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns value resulting from boolean OR of pair of bits in each of I + and J. + +  + File: g77.info, Node: IRand Intrinsic, Next: IsaTty Intrinsic, Prev: IOr Intrinsic, Up: Table of Intrinsic Functions + + IRand Intrinsic + ............... + + IRand(FLAG) + + IRand: `INTEGER(KIND=1)' function. + + FLAG: `INTEGER'; OPTIONAL; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns a uniform quasi-random number up to a system-dependent limit. + If FLAG is 0, the next number in sequence is returned; if FLAG is 1, + the generator is restarted by calling the UNIX function `srand(0)'; if + FLAG has any other value, it is used as a new seed with `srand()'. + + *Note SRand Intrinsic::. + + _Note:_ As typically implemented (by the routine of the same name in + the C library), this random number generator is a very poor one, though + the BSD and GNU libraries provide a much better implementation than the + `traditional' one. On a different system you almost certainly want to + use something better. + +  + File: g77.info, Node: IsaTty Intrinsic, Next: IShft Intrinsic, Prev: IRand Intrinsic, Up: Table of Intrinsic Functions + + IsaTty Intrinsic + ................ + + IsaTty(UNIT) + + IsaTty: `LOGICAL(KIND=1)' function. + + UNIT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns `.TRUE.' if and only if the Fortran I/O unit specified by + UNIT is connected to a terminal device. See `isatty(3)'. + +  + File: g77.info, Node: IShft Intrinsic, Next: IShftC Intrinsic, Prev: IsaTty Intrinsic, Up: Table of Intrinsic Functions + + IShft Intrinsic + ............... + + IShft(I, SHIFT) + + IShft: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + SHIFT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + All bits representing I are shifted SHIFT places. `SHIFT.GT.0' + indicates a left shift, `SHIFT.EQ.0' indicates no shift and + `SHIFT.LT.0' indicates a right shift. If the absolute value of the + shift count is greater than `BIT_SIZE(I)', the result is undefined. + Bits shifted out from the left end or the right end are lost. Zeros + are shifted in from the opposite end. + + *Note IShftC Intrinsic::, for the circular-shift equivalent. + +  + File: g77.info, Node: IShftC Intrinsic, Next: ISign Intrinsic, Prev: IShft Intrinsic, Up: Table of Intrinsic Functions + + IShftC Intrinsic + ................ + + IShftC(I, SHIFT, SIZE) + + IShftC: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + SHIFT: `INTEGER'; scalar; INTENT(IN). + + SIZE: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + The rightmost SIZE bits of the argument I are shifted circularly + SHIFT places, i.e. the bits shifted out of one end are shifted into the + opposite end. No bits are lost. The unshifted bits of the result are + the same as the unshifted bits of I. The absolute value of the + argument SHIFT must be less than or equal to SIZE. The value of SIZE + must be greater than or equal to one and less than or equal to + `BIT_SIZE(I)'. + + *Note IShft Intrinsic::, for the logical shift equivalent. + +  + File: g77.info, Node: ISign Intrinsic, Next: ITime Intrinsic, Prev: IShftC Intrinsic, Up: Table of Intrinsic Functions + + ISign Intrinsic + ............... + + ISign(A, B) + + ISign: `INTEGER(KIND=1)' function. + + A: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + B: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `SIGN()' that is specific to one type for A and B. + *Note Sign Intrinsic::. + +  + File: g77.info, Node: ITime Intrinsic, Next: Kill Intrinsic (subroutine), Prev: ISign Intrinsic, Up: Table of Intrinsic Functions + + ITime Intrinsic + ............... + + CALL ITime(TARRAY) + + TARRAY: `INTEGER(KIND=1)'; DIMENSION(3); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Returns the current local time hour, minutes, and seconds in elements + 1, 2, and 3 of TARRAY, respectively. + +  + File: g77.info, Node: Kill Intrinsic (subroutine), Next: Kind Intrinsic, Prev: ITime Intrinsic, Up: Table of Intrinsic Functions + + Kill Intrinsic (subroutine) + ........................... + + CALL Kill(PID, SIGNAL, STATUS) + + PID: `INTEGER'; scalar; INTENT(IN). + + SIGNAL: `INTEGER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Sends the signal specified by SIGNAL to the process PID. If the + STATUS argument is supplied, it contains 0 on success or a non-zero + error code upon return. See `kill(2)'. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note Kill + Intrinsic (function)::. + +  + File: g77.info, Node: Kind Intrinsic, Next: LBound Intrinsic, Prev: Kill Intrinsic (subroutine), Up: Table of Intrinsic Functions + + Kind Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Kind' to use this name for an + external procedure. + +  + File: g77.info, Node: LBound Intrinsic, Next: Len Intrinsic, Prev: Kind Intrinsic, Up: Table of Intrinsic Functions + + LBound Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL LBound' to use this name for an + external procedure. + +  + File: g77.info, Node: Len Intrinsic, Next: Len_Trim Intrinsic, Prev: LBound Intrinsic, Up: Table of Intrinsic Functions + + Len Intrinsic + ............. + + Len(STRING) + + Len: `INTEGER(KIND=1)' function. + + STRING: `CHARACTER'; scalar. + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the length of STRING. + + If STRING is an array, the length of an element of STRING is + returned. + + Note that STRING need not be defined when this intrinsic is invoked, + since only the length, not the content, of STRING is needed. + + *Note Bit_Size Intrinsic::, for the function that determines the + size of its argument in bits. + +  + File: g77.info, Node: Len_Trim Intrinsic, Next: LGe Intrinsic, Prev: Len Intrinsic, Up: Table of Intrinsic Functions + + Len_Trim Intrinsic + .................. + + Len_Trim(STRING) + + Len_Trim: `INTEGER(KIND=1)' function. + + STRING: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `f90'. + + Description: + + Returns the index of the last non-blank character in STRING. + `LNBLNK' and `LEN_TRIM' are equivalent. + +  + File: g77.info, Node: LGe Intrinsic, Next: LGt Intrinsic, Prev: Len_Trim Intrinsic, Up: Table of Intrinsic Functions + + LGe Intrinsic + ............. + + LGe(STRING_A, STRING_B) + + LGe: `LOGICAL(KIND=1)' function. + + STRING_A: `CHARACTER'; scalar; INTENT(IN). + + STRING_B: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `.TRUE.' if `STRING_A.GE.STRING_B', `.FALSE.' otherwise. + STRING_A and STRING_B are interpreted as containing ASCII character + codes. If either value contains a character not in the ASCII character + set, the result is processor dependent. + + If the STRING_A and STRING_B are not the same length, the shorter is + compared as if spaces were appended to it to form a value that has the + same length as the longer. + + The lexical comparison intrinsics `LGe', `LGt', `LLe', and `LLt' + differ from the corresponding intrinsic operators `.GE.', `.GT.', + `.LE.', `.LT.'. Because the ASCII collating sequence is assumed, the + following expressions always return `.TRUE.': + + LGE ('0', ' ') + LGE ('A', '0') + LGE ('a', 'A') + + The following related expressions do _not_ always return `.TRUE.', + as they are not necessarily evaluated assuming the arguments use ASCII + encoding: + + '0' .GE. ' ' + 'A' .GE. '0' + 'a' .GE. 'A' + + The same difference exists between `LGt' and `.GT.'; between `LLe' + and `.LE.'; and between `LLt' and `.LT.'. + +  + File: g77.info, Node: LGt Intrinsic, Next: Link Intrinsic (subroutine), Prev: LGe Intrinsic, Up: Table of Intrinsic Functions + + LGt Intrinsic + ............. + + LGt(STRING_A, STRING_B) + + LGt: `LOGICAL(KIND=1)' function. + + STRING_A: `CHARACTER'; scalar; INTENT(IN). + + STRING_B: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `.TRUE.' if `STRING_A.GT.STRING_B', `.FALSE.' otherwise. + STRING_A and STRING_B are interpreted as containing ASCII character + codes. If either value contains a character not in the ASCII character + set, the result is processor dependent. + + If the STRING_A and STRING_B are not the same length, the shorter is + compared as if spaces were appended to it to form a value that has the + same length as the longer. + + *Note LGe Intrinsic::, for information on the distinction between + the `LGT' intrinsic and the `.GT.' operator. + +  + File: g77.info, Node: Link Intrinsic (subroutine), Next: LLe Intrinsic, Prev: LGt Intrinsic, Up: Table of Intrinsic Functions + + Link Intrinsic (subroutine) + ........................... + + CALL Link(PATH1, PATH2, STATUS) + + PATH1: `CHARACTER'; scalar; INTENT(IN). + + PATH2: `CHARACTER'; scalar; INTENT(IN). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Makes a (hard) link from file PATH1 to PATH2. A null character + (`CHAR(0)') marks the end of the names in PATH1 and PATH2--otherwise, + trailing blanks in PATH1 and PATH2 are ignored. If the STATUS argument + is supplied, it contains 0 on success or a non-zero error code upon + return. See `link(2)'. + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note Link + Intrinsic (function)::. + +  + File: g77.info, Node: LLe Intrinsic, Next: LLt Intrinsic, Prev: Link Intrinsic (subroutine), Up: Table of Intrinsic Functions + + LLe Intrinsic + ............. + + LLe(STRING_A, STRING_B) + + LLe: `LOGICAL(KIND=1)' function. + + STRING_A: `CHARACTER'; scalar; INTENT(IN). + + STRING_B: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `.TRUE.' if `STRING_A.LE.STRING_B', `.FALSE.' otherwise. + STRING_A and STRING_B are interpreted as containing ASCII character + codes. If either value contains a character not in the ASCII character + set, the result is processor dependent. + + If the STRING_A and STRING_B are not the same length, the shorter is + compared as if spaces were appended to it to form a value that has the + same length as the longer. + + *Note LGe Intrinsic::, for information on the distinction between + the `LLE' intrinsic and the `.LE.' operator. + +  + File: g77.info, Node: LLt Intrinsic, Next: LnBlnk Intrinsic, Prev: LLe Intrinsic, Up: Table of Intrinsic Functions + + LLt Intrinsic + ............. + + LLt(STRING_A, STRING_B) + + LLt: `LOGICAL(KIND=1)' function. + + STRING_A: `CHARACTER'; scalar; INTENT(IN). + + STRING_B: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns `.TRUE.' if `STRING_A.LT.STRING_B', `.FALSE.' otherwise. + STRING_A and STRING_B are interpreted as containing ASCII character + codes. If either value contains a character not in the ASCII character + set, the result is processor dependent. + + If the STRING_A and STRING_B are not the same length, the shorter is + compared as if spaces were appended to it to form a value that has the + same length as the longer. + + *Note LGe Intrinsic::, for information on the distinction between + the `LLT' intrinsic and the `.LT.' operator. + +  + File: g77.info, Node: LnBlnk Intrinsic, Next: Loc Intrinsic, Prev: LLt Intrinsic, Up: Table of Intrinsic Functions + + LnBlnk Intrinsic + ................ + + LnBlnk(STRING) + + LnBlnk: `INTEGER(KIND=1)' function. + + STRING: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns the index of the last non-blank character in STRING. + `LNBLNK' and `LEN_TRIM' are equivalent. + +  + File: g77.info, Node: Loc Intrinsic, Next: Log Intrinsic, Prev: LnBlnk Intrinsic, Up: Table of Intrinsic Functions + + Loc Intrinsic + ............. + + Loc(ENTITY) + + Loc: `INTEGER(KIND=7)' function. + + ENTITY: Any type; cannot be a constant or expression. + + Intrinsic groups: `unix'. + + Description: + + The `LOC()' intrinsic works the same way as the `%LOC()' construct. + *Note The `%LOC()' Construct: %LOC(), for more information. + +  + File: g77.info, Node: Log Intrinsic, Next: Log10 Intrinsic, Prev: Loc Intrinsic, Up: Table of Intrinsic Functions + + Log Intrinsic + ............. + + Log(X) + + Log: `REAL' or `COMPLEX' function, the exact type being that of + argument X. + + X: `REAL' or `COMPLEX'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the natural logarithm of X, which must be greater than zero + or, if type `COMPLEX', must not be zero. + + *Note Exp Intrinsic::, for the inverse of this function. + + *Note Log10 Intrinsic::, for the `common' (base-10) logarithm + function. + +  + File: g77.info, Node: Log10 Intrinsic, Next: Logical Intrinsic, Prev: Log Intrinsic, Up: Table of Intrinsic Functions + + Log10 Intrinsic + ............... + + Log10(X) + + Log10: `REAL' function, the `KIND=' value of the type being that of + argument X. + + X: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the common logarithm (base 10) of X, which must be greater + than zero. + + The inverse of this function is `10. ** LOG10(X)'. + + *Note Log Intrinsic::, for the natural logarithm function. + +  + File: g77.info, Node: Logical Intrinsic, Next: Long Intrinsic, Prev: Log10 Intrinsic, Up: Table of Intrinsic Functions + + Logical Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Logical' to use this name for + an external procedure. + +  + File: g77.info, Node: Long Intrinsic, Next: LShift Intrinsic, Prev: Logical Intrinsic, Up: Table of Intrinsic Functions + + Long Intrinsic + .............. + + Long(A) + + Long: `INTEGER(KIND=1)' function. + + A: `INTEGER(KIND=6)'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Archaic form of `INT()' that is specific to one type for A. *Note + Int Intrinsic::. + + The precise meaning of this intrinsic might change in a future + version of the GNU Fortran language, as more is learned about how it is + used. + +  + File: g77.info, Node: LShift Intrinsic, Next: LStat Intrinsic (subroutine), Prev: Long Intrinsic, Up: Table of Intrinsic Functions + + LShift Intrinsic + ................ + + LShift(I, SHIFT) + + LShift: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + SHIFT: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Returns I shifted to the left SHIFT bits. + + Although similar to the expression `I*(2**SHIFT)', there are + important differences. For example, the sign of the result is not + necessarily the same as the sign of I. + + Currently this intrinsic is defined assuming the underlying + representation of I is as a two's-complement integer. It is unclear at + this point whether that definition will apply when a different + representation is involved. + + *Note LShift Intrinsic::, for the inverse of this function. + + *Note IShft Intrinsic::, for information on a more widely available + left-shifting intrinsic that is also more precisely defined. + +  + File: g77.info, Node: LStat Intrinsic (subroutine), Next: LStat Intrinsic (function), Prev: LShift Intrinsic, Up: Table of Intrinsic Functions + + LStat Intrinsic (subroutine) + ............................ + + CALL LStat(FILE, SARRAY, STATUS) + + FILE: `CHARACTER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + STATUS: `INTEGER(KIND=1)'; OPTIONAL; scalar; INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the given file FILE and places them in the array + SARRAY. A null character (`CHAR(0)') marks the end of the name in + FILE--otherwise, trailing blanks in FILE are ignored. If FILE is a + symbolic link it returns data on the link itself, so the routine is + available only on systems that support symbolic links. The values in + this array are extracted from the `stat' structure as returned by + `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + If the STATUS argument is supplied, it contains 0 on success or a + non-zero error code upon return (`ENOSYS' if the system does not + provide `lstat(2)'). + + Some non-GNU implementations of Fortran provide this intrinsic as + only a function, not as a subroutine, or do not support the (optional) + STATUS argument. + + For information on other intrinsics with the same name: *Note LStat + Intrinsic (function)::. + +  + File: g77.info, Node: LStat Intrinsic (function), Next: LTime Intrinsic, Prev: LStat Intrinsic (subroutine), Up: Table of Intrinsic Functions + + LStat Intrinsic (function) + .......................... + + LStat(FILE, SARRAY) + + LStat: `INTEGER(KIND=1)' function. + + FILE: `CHARACTER'; scalar; INTENT(IN). + + SARRAY: `INTEGER(KIND=1)'; DIMENSION(13); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Obtains data about the given file FILE and places them in the array + SARRAY. A null character (`CHAR(0)') marks the end of the name in + FILE--otherwise, trailing blanks in FILE are ignored. If FILE is a + symbolic link it returns data on the link itself, so the routine is + available only on systems that support symbolic links. The values in + this array are extracted from the `stat' structure as returned by + `fstat(2)' q.v., as follows: + + 1. Device ID + + 2. Inode number + + 3. File mode + + 4. Number of links + + 5. Owner's uid + + 6. Owner's gid + + 7. ID of device containing directory entry for file (0 if not + available) + + 8. File size (bytes) + + 9. Last access time + + 10. Last modification time + + 11. Last file status change time + + 12. Preferred I/O block size (-1 if not available) + + 13. Number of blocks allocated (-1 if not available) + + Not all these elements are relevant on all systems. If an element + is not relevant, it is returned as 0. + + Returns 0 on success or a non-zero error code (`ENOSYS' if the + system does not provide `lstat(2)'). + + For information on other intrinsics with the same name: *Note LStat + Intrinsic (subroutine)::. + +  + File: g77.info, Node: LTime Intrinsic, Next: MatMul Intrinsic, Prev: LStat Intrinsic (function), Up: Table of Intrinsic Functions + + LTime Intrinsic + ............... + + CALL LTime(STIME, TARRAY) + + STIME: `INTEGER(KIND=1)'; scalar; INTENT(IN). + + TARRAY: `INTEGER(KIND=1)'; DIMENSION(9); INTENT(OUT). + + Intrinsic groups: `unix'. + + Description: + + Given a system time value STIME, fills TARRAY with values extracted + from it appropriate to the GMT time zone using `localtime(3)'. + + The array elements are as follows: + + 1. Seconds after the minute, range 0-59 or 0-61 to allow for leap + seconds + + 2. Minutes after the hour, range 0-59 + + 3. Hours past midnight, range 0-23 + + 4. Day of month, range 0-31 + + 5. Number of months since January, range 0-12 + + 6. Years since 1900 + + 7. Number of days since Sunday, range 0-6 + + 8. Days since January 1 + + 9. Daylight savings indicator: positive if daylight savings is in + effect, zero if not, and negative if the information isn't + available. + +  + File: g77.info, Node: MatMul Intrinsic, Next: Max Intrinsic, Prev: LTime Intrinsic, Up: Table of Intrinsic Functions + + MatMul Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MatMul' to use this name for an + external procedure. + +  + File: g77.info, Node: Max Intrinsic, Next: Max0 Intrinsic, Prev: MatMul Intrinsic, Up: Table of Intrinsic Functions + + Max Intrinsic + ............. + + Max(A-1, A-2, ..., A-n) + + Max: `INTEGER' or `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + A: `INTEGER' or `REAL'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the argument with the largest value. + + *Note Min Intrinsic::, for the opposite function. + +  + File: g77.info, Node: Max0 Intrinsic, Next: Max1 Intrinsic, Prev: Max Intrinsic, Up: Table of Intrinsic Functions + + Max0 Intrinsic + .............. + + Max0(A-1, A-2, ..., A-n) + + Max0: `INTEGER(KIND=1)' function. + + A: `INTEGER(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MAX()' that is specific to one type for A. *Note + Max Intrinsic::. + +  + File: g77.info, Node: Max1 Intrinsic, Next: MaxExponent Intrinsic, Prev: Max0 Intrinsic, Up: Table of Intrinsic Functions + + Max1 Intrinsic + .............. + + Max1(A-1, A-2, ..., A-n) + + Max1: `INTEGER(KIND=1)' function. + + A: `REAL(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MAX()' that is specific to one type for A and a + different return type. *Note Max Intrinsic::. + +  + File: g77.info, Node: MaxExponent Intrinsic, Next: MaxLoc Intrinsic, Prev: Max1 Intrinsic, Up: Table of Intrinsic Functions + + MaxExponent Intrinsic + ..................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MaxExponent' to use this name + for an external procedure. + +  + File: g77.info, Node: MaxLoc Intrinsic, Next: MaxVal Intrinsic, Prev: MaxExponent Intrinsic, Up: Table of Intrinsic Functions + + MaxLoc Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MaxLoc' to use this name for an + external procedure. + +  + File: g77.info, Node: MaxVal Intrinsic, Next: MClock Intrinsic, Prev: MaxLoc Intrinsic, Up: Table of Intrinsic Functions + + MaxVal Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MaxVal' to use this name for an + external procedure. + +  + File: g77.info, Node: MClock Intrinsic, Next: MClock8 Intrinsic, Prev: MaxVal Intrinsic, Up: Table of Intrinsic Functions + + MClock Intrinsic + ................ + + MClock() + + MClock: `INTEGER(KIND=1)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the number of clock ticks since the start of the process. + Supported on systems with `clock(3)' (q.v.). + + This intrinsic is not fully portable, such as to systems with 32-bit + `INTEGER' types but supporting times wider than 32 bits. Therefore, + the values returned by this intrinsic might be, or become, negative, or + numerically less than previous values, during a single run of the + compiled program. + + *Note MClock8 Intrinsic::, for information on a similar intrinsic + that might be portable to more GNU Fortran implementations, though to + fewer Fortran compilers. + + If the system does not support `clock(3)', -1 is returned. + +  + File: g77.info, Node: MClock8 Intrinsic, Next: Merge Intrinsic, Prev: MClock Intrinsic, Up: Table of Intrinsic Functions + + MClock8 Intrinsic + ................. + + MClock8() + + MClock8: `INTEGER(KIND=2)' function. + + Intrinsic groups: `unix'. + + Description: + + Returns the number of clock ticks since the start of the process. + Supported on systems with `clock(3)' (q.v.). + + _Warning:_ this intrinsic does not increase the range of the timing + values over that returned by `clock(3)'. On a system with a 32-bit + `clock(3)', `MCLOCK8' will return a 32-bit value, even though converted + to an `INTEGER(KIND=2)' value. That means overflows of the 32-bit + value can still occur. Therefore, the values returned by this intrinsic + might be, or become, negative, or numerically less than previous values, + during a single run of the compiled program. + + No Fortran implementations other than GNU Fortran are known to + support this intrinsic at the time of this writing. *Note MClock + Intrinsic::, for information on a similar intrinsic that might be + portable to more Fortran compilers, though to fewer GNU Fortran + implementations. + + If the system does not support `clock(3)', -1 is returned. + +  + File: g77.info, Node: Merge Intrinsic, Next: Min Intrinsic, Prev: MClock8 Intrinsic, Up: Table of Intrinsic Functions + + Merge Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Merge' to use this name for an + external procedure. + +  + File: g77.info, Node: Min Intrinsic, Next: Min0 Intrinsic, Prev: Merge Intrinsic, Up: Table of Intrinsic Functions + + Min Intrinsic + ............. + + Min(A-1, A-2, ..., A-n) + + Min: `INTEGER' or `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + A: `INTEGER' or `REAL'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns the argument with the smallest value. + + *Note Max Intrinsic::, for the opposite function. + +  + File: g77.info, Node: Min0 Intrinsic, Next: Min1 Intrinsic, Prev: Min Intrinsic, Up: Table of Intrinsic Functions + + Min0 Intrinsic + .............. + + Min0(A-1, A-2, ..., A-n) + + Min0: `INTEGER(KIND=1)' function. + + A: `INTEGER(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MIN()' that is specific to one type for A. *Note + Min Intrinsic::. + +  + File: g77.info, Node: Min1 Intrinsic, Next: MinExponent Intrinsic, Prev: Min0 Intrinsic, Up: Table of Intrinsic Functions + + Min1 Intrinsic + .............. + + Min1(A-1, A-2, ..., A-n) + + Min1: `INTEGER(KIND=1)' function. + + A: `REAL(KIND=1)'; at least two such arguments must be provided; + scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Archaic form of `MIN()' that is specific to one type for A and a + different return type. *Note Min Intrinsic::. + +  + File: g77.info, Node: MinExponent Intrinsic, Next: MinLoc Intrinsic, Prev: Min1 Intrinsic, Up: Table of Intrinsic Functions + + MinExponent Intrinsic + ..................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MinExponent' to use this name + for an external procedure. + +  + File: g77.info, Node: MinLoc Intrinsic, Next: MinVal Intrinsic, Prev: MinExponent Intrinsic, Up: Table of Intrinsic Functions + + MinLoc Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MinLoc' to use this name for an + external procedure. + +  + File: g77.info, Node: MinVal Intrinsic, Next: Mod Intrinsic, Prev: MinLoc Intrinsic, Up: Table of Intrinsic Functions + + MinVal Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL MinVal' to use this name for an + external procedure. + +  + File: g77.info, Node: Mod Intrinsic, Next: Modulo Intrinsic, Prev: MinVal Intrinsic, Up: Table of Intrinsic Functions + + Mod Intrinsic + ............. + + Mod(A, P) + + Mod: `INTEGER' or `REAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + A: `INTEGER' or `REAL'; scalar; INTENT(IN). + + P: `INTEGER' or `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns remainder calculated as: + + A - (INT(A / P) * P) + + P must not be zero. + +  + File: g77.info, Node: Modulo Intrinsic, Next: MvBits Intrinsic, Prev: Mod Intrinsic, Up: Table of Intrinsic Functions + + Modulo Intrinsic + ................ + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Modulo' to use this name for an + external procedure. + +  + File: g77.info, Node: MvBits Intrinsic, Next: Nearest Intrinsic, Prev: Modulo Intrinsic, Up: Table of Intrinsic Functions + + MvBits Intrinsic + ................ + + CALL MvBits(FROM, FROMPOS, LEN, TO, TOPOS) + + FROM: `INTEGER'; scalar; INTENT(IN). + + FROMPOS: `INTEGER'; scalar; INTENT(IN). + + LEN: `INTEGER'; scalar; INTENT(IN). + + TO: `INTEGER' with same `KIND=' value as for FROM; scalar; + INTENT(INOUT). + + TOPOS: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Moves LEN bits from positions FROMPOS through `FROMPOS+LEN-1' of + FROM to positions TOPOS through `FROMPOS+LEN-1' of TO. The portion of + argument TO not affected by the movement of bits is unchanged. + Arguments FROM and TO are permitted to be the same numeric storage + unit. The values of `FROMPOS+LEN' and `TOPOS+LEN' must be less than or + equal to `BIT_SIZE(FROM)'. + +  + File: g77.info, Node: Nearest Intrinsic, Next: NInt Intrinsic, Prev: MvBits Intrinsic, Up: Table of Intrinsic Functions + + Nearest Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Nearest' to use this name for + an external procedure. + +  + File: g77.info, Node: NInt Intrinsic, Next: Not Intrinsic, Prev: Nearest Intrinsic, Up: Table of Intrinsic Functions + + NInt Intrinsic + .............. + + NInt(A) + + NInt: `INTEGER(KIND=1)' function. + + A: `REAL'; scalar; INTENT(IN). + + Intrinsic groups: (standard FORTRAN 77). + + Description: + + Returns A with the fractional portion of its magnitude eliminated by + rounding to the nearest whole number and with its sign preserved, + converted to type `INTEGER(KIND=1)'. + + If A is type `COMPLEX', its real part is rounded and converted. + + A fractional portion exactly equal to `.5' is rounded to the whole + number that is larger in magnitude. (Also called "Fortran round".) + + *Note Int Intrinsic::, for how to convert, truncate to whole number. + + *Note ANInt Intrinsic::, for how to round to nearest whole number + without converting. + +  + File: g77.info, Node: Not Intrinsic, Next: Or Intrinsic, Prev: NInt Intrinsic, Up: Table of Intrinsic Functions + + Not Intrinsic + ............. + + Not(I) + + Not: `INTEGER' function, the `KIND=' value of the type being that of + argument I. + + I: `INTEGER'; scalar; INTENT(IN). + + Intrinsic groups: `mil', `f90', `vxt'. + + Description: + + Returns value resulting from boolean NOT of each bit in I. + +  + File: g77.info, Node: Or Intrinsic, Next: Pack Intrinsic, Prev: Not Intrinsic, Up: Table of Intrinsic Functions + + Or Intrinsic + ............ + + Or(I, J) + + Or: `INTEGER' or `LOGICAL' function, the exact type being the result of + cross-promoting the types of all the arguments. + + I: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + J: `INTEGER' or `LOGICAL'; scalar; INTENT(IN). + + Intrinsic groups: `f2c'. + + Description: + + Returns value resulting from boolean OR of pair of bits in each of I + and J. + +  + File: g77.info, Node: Pack Intrinsic, Next: PError Intrinsic, Prev: Or Intrinsic, Up: Table of Intrinsic Functions + + Pack Intrinsic + .............. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Pack' to use this name for an + external procedure. + +  + File: g77.info, Node: PError Intrinsic, Next: Precision Intrinsic, Prev: Pack Intrinsic, Up: Table of Intrinsic Functions + + PError Intrinsic + ................ + + CALL PError(STRING) + + STRING: `CHARACTER'; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Prints (on the C `stderr' stream) a newline-terminated error message + corresponding to the last system error. This is prefixed by STRING, a + colon and a space. See `perror(3)'. + +  + File: g77.info, Node: Precision Intrinsic, Next: Present Intrinsic, Prev: PError Intrinsic, Up: Table of Intrinsic Functions + + Precision Intrinsic + ................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Precision' to use this name + for an external procedure. + +  + File: g77.info, Node: Present Intrinsic, Next: Product Intrinsic, Prev: Precision Intrinsic, Up: Table of Intrinsic Functions + + Present Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Present' to use this name for + an external procedure. + +  + File: g77.info, Node: Product Intrinsic, Next: Radix Intrinsic, Prev: Present Intrinsic, Up: Table of Intrinsic Functions + + Product Intrinsic + ................. + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Product' to use this name for + an external procedure. + +  + File: g77.info, Node: Radix Intrinsic, Next: Rand Intrinsic, Prev: Product Intrinsic, Up: Table of Intrinsic Functions + + Radix Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Radix' to use this name for an + external procedure. + +  + File: g77.info, Node: Rand Intrinsic, Next: Random_Number Intrinsic, Prev: Radix Intrinsic, Up: Table of Intrinsic Functions + + Rand Intrinsic + .............. + + Rand(FLAG) + + Rand: `REAL(KIND=1)' function. + + FLAG: `INTEGER'; OPTIONAL; scalar; INTENT(IN). + + Intrinsic groups: `unix'. + + Description: + + Returns a uniform quasi-random number between 0 and 1. If FLAG is + 0, the next number in sequence is returned; if FLAG is 1, the generator + is restarted by calling `srand(0)'; if FLAG has any other value, it is + used as a new seed with `srand'. + + *Note SRand Intrinsic::. + + _Note:_ As typically implemented (by the routine of the same name in + the C library), this random number generator is a very poor one, though + the BSD and GNU libraries provide a much better implementation than the + `traditional' one. On a different system you almost certainly want to + use something better. + +  + File: g77.info, Node: Random_Number Intrinsic, Next: Random_Seed Intrinsic, Prev: Rand Intrinsic, Up: Table of Intrinsic Functions + + Random_Number Intrinsic + ....................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Random_Number' to use this + name for an external procedure. + +  + File: g77.info, Node: Random_Seed Intrinsic, Next: Range Intrinsic, Prev: Random_Number Intrinsic, Up: Table of Intrinsic Functions + + Random_Seed Intrinsic + ..................... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Random_Seed' to use this name + for an external procedure. + +  + File: g77.info, Node: Range Intrinsic, Next: Real Intrinsic, Prev: Random_Seed Intrinsic, Up: Table of Intrinsic Functions + + Range Intrinsic + ............... + + This intrinsic is not yet implemented. The name is, however, + reserved as an intrinsic. Use `EXTERNAL Range' to use this name for an + external procedure. + diff -Nrc3pad gcc-3.2.2/gcc/f/root.texi gcc-3.2.3/gcc/f/root.texi *** gcc-3.2.2/gcc/f/root.texi Fri Nov 22 17:54:01 2002 --- gcc-3.2.3/gcc/f/root.texi Wed Feb 5 05:09:14 2003 *************** *** 3,9 **** @c (e.g. a release branch in the CVS repository for gcc), @c clear this and set the version information correctly. @clear DEVELOPMENT ! @set version-gcc 3.2.2 @set email-general gcc@@gcc.gnu.org @set email-help gcc-help@@gcc.gnu.org --- 3,9 ---- @c (e.g. a release branch in the CVS repository for gcc), @c clear this and set the version information correctly. @clear DEVELOPMENT ! @set version-gcc 3.2.3 @set email-general gcc@@gcc.gnu.org @set email-help gcc-help@@gcc.gnu.org diff -Nrc3pad gcc-3.2.2/gcc/f/version.c gcc-3.2.3/gcc/f/version.c *** gcc-3.2.2/gcc/f/version.c Wed Feb 5 03:03:02 2003 --- gcc-3.2.3/gcc/f/version.c Tue Apr 22 06:16:09 2003 *************** *** 1,4 **** #include "ansidecl.h" #include "f/version.h" ! const char *const ffe_version_string = "3.2.2 20030205 (release)"; --- 1,4 ---- #include "ansidecl.h" #include "f/version.h" ! const char *const ffe_version_string = "3.2.3 20030422 (release)"; diff -Nrc3pad gcc-3.2.2/gcc/fixinc/fixinc.interix gcc-3.2.3/gcc/fixinc/fixinc.interix *** gcc-3.2.2/gcc/fixinc/fixinc.interix Fri May 11 17:03:02 2001 --- gcc-3.2.3/gcc/fixinc/fixinc.interix Sat Mar 29 21:15:48 2003 *************** *** 1,165 **** #!/bin/sh rm -f include/stddef.h exit - # - # fixinc.interix -- Install modified versions of Interix system include - # files. - # - # Based on fixinc.sco script by Ian Lance Taylor (ian@airs.com)). - # With modifications by Douglas Rupp (drupp@cs.washington.edu) - # - # Copyright (C) 1999 Free Software Foundation, Inc. - # - # This file is part of GNU CC. - # - # GNU CC 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 2, or (at your option) - # any later version. - # - # GNU CC 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 GNU CC; see the file COPYING. If not, write to - # the Free Software Foundation, 59 Temple Place - Suite 330, - # Boston, MA 02111-1307, USA. - # - # ?????? fixup comment - # This script munges the native include files provided with Windows NT - # 3.5 SDK systems so as to provide a reasonable namespace when - # compiling with gcc. The header files by default do not - # provide many essential definitions and declarations if - # __STDC__ is 1. This script modifies the header files to check - # for __STRICT_ANSI__ being defined instead. Once munged, the - # resulting new system include files are placed in a directory - # that GNU C will search *before* searching the Include - # directory. - # - # See README-fixinc for more information. - - # Fail if no arg to specify a directory for the output. - if [ x$1 = x ] - then echo fixincludes: no output directory specified - exit 1 - fi - - # Directory in which to store the results. - LIB=${1} - - # Make sure it exists. - if [ ! -d $LIB ]; then - mkdir $LIB || exit 1 - fi - - ORIG_DIR=`${PWDCMD-pwd}` - - # Make LIB absolute if it is relative. - # Don't do this if not necessary, since may screw up automounters. - case $LIB in - /*) - ;; - *) - cd $LIB; LIB=`${PWDCMD-pwd}` - ;; - esac - - echo 'Building fixincludes in ' ${LIB} - - # Determine whether this filesystem has symbolic links. - if ln -s X $LIB/ShouldNotExist 2>/dev/null; then - rm -f $LIB/ShouldNotExist - LINKS=true - else - LINKS=false - fi - - echo 'Making directories:' - # Directory containing the original header files. - shift - if [ $# -eq 0 ] ; then - set /usr/include - fi - - INLIST="$@" - - for INPUT in ${INLIST} ; do - cd ${ORIG_DIR} - cd ${INPUT} - - if $LINKS; then - files=`ls -LR | sed -n s/:$//p` - else - files=`find . -type d -print | sed '/^\.$/d'` - fi - - if [ "x$files" = x ]; then - echo No files found in $INPUT\; skipped - continue - fi - - for file in $files; do - rm -rf $LIB/$file - if [ ! -d $LIB/$file ] - then mkdir $LIB/$file - fi - done - - # treetops gets an alternating list - # of old directories to copy - # and the new directories to copy to. - treetops="${INPUT} ${LIB}" - - set - $treetops - while [ $# != 0 ]; do - # $1 is an old directory to copy, and $2 is the new directory to copy to. - echo "Finding header files in $1:" - cd ${INPUT} - cd $1 - files=`find . -name '*.[hH]' -type f -print` - echo "Checking header files in $1; transforming into directory $2:" - for file in $files; do - echo " " $file - if [ -r $file ]; then - cp $file $2/$file >/dev/null 2>&1 || echo "Can't copy $file" - chmod +w,a+r $2/$file - - # The following have been removed from the sed command below - # because it is more useful to leave these things in. - # The only reason to remove them was for -pedantic, - # which isn't much of a reason. -- rms. - # ??? above/below - # /^[ ]*#[ ]*ident/d - # s/!__STDC__/!defined (__STRICT_ANSI__)/g - - sed -e '/#[ ]*include.*[<"][A-Za-z]:\\/ s,\\,/,g' \ - -e '/#[ ]*include.*[<"][A-Za-z]:\// s,\([A-Za-z]\):/,//\1/,' \ - -e '\,#[ ]*include.*[<"]//[A-Za-z]/, y,abcdefghijklmnopqrstuvwxyz,ABCDEFGHIJKLMNOPQRSTUVWXYZ,' \ - -e '\,#[ ]*INCLUDE.*[<"]//[A-Za-z]/, s,INCLUDE,include,' \ - $2/$file > $2/$file.sed - - mv $2/$file.sed $2/$file - if cmp $file $2/$file >/dev/null 2>&1; then - rm $2/$file - else - echo Fixed $file - flip -u $2/$file - fi - fi - done - shift; shift - done - - echo 'Removing unneeded directories:' - # (Rmdir leaf to root, and if the rmdir fails, who cares....) - cd $LIB - files=`find . -type d -print | sort -r` - for file in $files; do - rmdir $LIB/$file > /dev/null 2>&1 - done - - done # for include directory list - - exit 0 --- 1,3 ---- diff -Nrc3pad gcc-3.2.2/gcc/fixinc/fixincl.x gcc-3.2.3/gcc/fixinc/fixincl.x *** gcc-3.2.2/gcc/fixinc/fixincl.x Mon Apr 29 19:31:17 2002 --- gcc-3.2.3/gcc/fixinc/fixincl.x Tue Apr 22 06:56:18 2003 *************** *** 5,11 **** * files which are fixed to work correctly with ANSI C and placed in a * directory that GNU C will search. * ! * This file contains 142 fixup descriptions. * * See README for more information. * --- 5,11 ---- * files which are fixed to work correctly with ANSI C and placed in a * directory that GNU C will search. * ! * This file contains 151 fixup descriptions. * * See README for more information. * *************** static const char* apzAab_Fd_Zero_Select *** 248,253 **** --- 248,285 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Aab_Solaris_Sys_Varargs_H fix + */ + tSCC zAab_Solaris_Sys_Varargs_HName[] = + "AAB_solaris_sys_varargs_h"; + + /* + * File name selection pattern + */ + tSCC zAab_Solaris_Sys_Varargs_HList[] = + "|sys/varargs.h|"; + /* + * Machine/OS name selection pattern + */ + tSCC* apzAab_Solaris_Sys_Varargs_HMachs[] = { + "*-*-solaris*", + (const char*)NULL }; + #define AAB_SOLARIS_SYS_VARARGS_H_TEST_CT 0 + #define aAab_Solaris_Sys_Varargs_HTests (tTestDesc*)NULL + + /* + * Fix Command Arguments for Aab_Solaris_Sys_Varargs_H + */ + static const char* apzAab_Solaris_Sys_Varargs_HPatch[] = { + "#ifdef __STDC__\n\ + #include \n\ + #else\n\ + #include \n\ + #endif\n", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Aab_Sun_Memcpy fix */ tSCC zAab_Sun_MemcpyName[] = *************** extern int memcmp();\n\n\ *** 297,334 **** /* * * * * * * * * * * * * * * * * * * * * * * * * * * - * Description of Aab_Solaris_Sys_Varargs_H fix - */ - tSCC zAab_Solaris_Sys_Varargs_HName[] = - "AAB_solaris_sys_varargs_h"; - - /* - * File name selection pattern - */ - tSCC zAab_Solaris_Sys_Varargs_HList[] = - "|sys/varargs.h|"; - /* - * Machine/OS name selection pattern - */ - tSCC* apzAab_Solaris_Sys_Varargs_HMachs[] = { - "*-*-solaris*", - (const char*)NULL }; - #define AAB_SOLARIS_SYS_VARARGS_H_TEST_CT 0 - #define aAab_Solaris_Sys_Varargs_HTests (tTestDesc*)NULL - - /* - * Fix Command Arguments for Aab_Solaris_Sys_Varargs_H - */ - static const char* apzAab_Solaris_Sys_Varargs_HPatch[] = { - "#ifdef __STDC__\n\ - #include \n\ - #else\n\ - #include \n\ - #endif\n", - (char*)NULL }; - - /* * * * * * * * * * * * * * * * * * * * * * * * * * - * * Description of Aab_Svr4_Replace_Byteorder fix */ tSCC zAab_Svr4_Replace_ByteorderName[] = --- 329,334 ---- *************** static const char* apzAlpha___AssertPatc *** 776,781 **** --- 776,818 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Alpha___Extern_Prefix fix + */ + tSCC zAlpha___Extern_PrefixName[] = + "alpha___extern_prefix"; + + /* + * File name selection pattern + */ + tSCC zAlpha___Extern_PrefixList[] = + "|sys/stat.h|"; + /* + * Machine/OS name selection pattern + */ + tSCC* apzAlpha___Extern_PrefixMachs[] = { + "alpha*-dec-osf5*", + (const char*)NULL }; + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zAlpha___Extern_PrefixSelect0[] = + "#[ \t]*if[ \t]*defined\\(__DECC\\)"; + + #define ALPHA___EXTERN_PREFIX_TEST_CT 1 + static tTestDesc aAlpha___Extern_PrefixTests[] = { + { TT_EGREP, zAlpha___Extern_PrefixSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Alpha___Extern_Prefix + */ + static const char* apzAlpha___Extern_PrefixPatch[] = { + "format", + "%0 || defined(__PRAGMA_EXTERN_PREFIX)", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Alpha_Assert fix */ tSCC zAlpha_AssertName[] = *************** static const char* apzHpux11_Cpp_Pow_Inl *** 1868,1873 **** --- 1905,2026 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Hpux10_Ctype_Declarations1 fix + */ + tSCC zHpux10_Ctype_Declarations1Name[] = + "hpux10_ctype_declarations1"; + + /* + * File name selection pattern + */ + tSCC zHpux10_Ctype_Declarations1List[] = + "|ctype.h|"; + /* + * Machine/OS name selection pattern + */ + #define apzHpux10_Ctype_Declarations1Machs (const char**)NULL + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zHpux10_Ctype_Declarations1Select0[] = + "^#[ \t]*define _toupper\\(__c\\)[ \t]*__toupper\\(__c\\)"; + + /* + * content bypass pattern - skip fix if pattern found + */ + tSCC zHpux10_Ctype_Declarations1Bypass0[] = + "^[ \t]*extern[ \t]*int[ \t]*__tolower[ \t]*\\("; + + #define HPUX10_CTYPE_DECLARATIONS1_TEST_CT 2 + static tTestDesc aHpux10_Ctype_Declarations1Tests[] = { + { TT_NEGREP, zHpux10_Ctype_Declarations1Bypass0, (regex_t*)NULL }, + { TT_EGREP, zHpux10_Ctype_Declarations1Select0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Hpux10_Ctype_Declarations1 + */ + static const char* apzHpux10_Ctype_Declarations1Patch[] = { + "format", + "#ifdef _PROTOTYPES\n\ + extern int __tolower(int);\n\ + extern int __toupper(int);\n\ + #else /* NOT _PROTOTYPES */\n\ + extern int __tolower();\n\ + extern int __toupper();\n\ + #endif /* _PROTOTYPES */\n\n\ + %0\n", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * + * Description of Hpux10_Ctype_Declarations2 fix + */ + tSCC zHpux10_Ctype_Declarations2Name[] = + "hpux10_ctype_declarations2"; + + /* + * File name selection pattern + */ + tSCC zHpux10_Ctype_Declarations2List[] = + "|ctype.h|"; + /* + * Machine/OS name selection pattern + */ + #define apzHpux10_Ctype_Declarations2Machs (const char**)NULL + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zHpux10_Ctype_Declarations2Select0[] = + "^# if defined\\(_SB_CTYPE_MACROS\\) && \\!defined\\(__lint\\)"; + + /* + * content bypass pattern - skip fix if pattern found + */ + tSCC zHpux10_Ctype_Declarations2Bypass0[] = + "^[ \t]*extern[ \t]*int[ \t]*_isalnum[ \t]*\\("; + + #define HPUX10_CTYPE_DECLARATIONS2_TEST_CT 2 + static tTestDesc aHpux10_Ctype_Declarations2Tests[] = { + { TT_NEGREP, zHpux10_Ctype_Declarations2Bypass0, (regex_t*)NULL }, + { TT_EGREP, zHpux10_Ctype_Declarations2Select0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Hpux10_Ctype_Declarations2 + */ + static const char* apzHpux10_Ctype_Declarations2Patch[] = { + "format", + "%0\n\n\ + #ifdef _PROTOTYPES\n\ + extern int _isalnum(int);\n\ + extern int _isalpha(int);\n\ + extern int _iscntrl(int);\n\ + extern int _isdigit(int);\n\ + extern int _isgraph(int);\n\ + extern int _islower(int);\n\ + extern int _isprint(int);\n\ + extern int _ispunct(int);\n\ + extern int _isspace(int);\n\ + extern int _isupper(int);\n\ + extern int _isxdigit(int);\n\ + # else /* not _PROTOTYPES */\n\ + extern int _isalnum();\n\ + extern int _isalpha();\n\ + extern int _iscntrl();\n\ + extern int _isdigit();\n\ + extern int _isgraph();\n\ + extern int _islower();\n\ + extern int _isprint();\n\ + extern int _ispunct();\n\ + extern int _isspace();\n\ + extern int _isupper();\n\ + extern int _isxdigit();\n\ + #endif /* _PROTOTYPES */\n", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Hpux11_Fabsf fix */ tSCC zHpux11_FabsfName[] = *************** static const char* apzHpux8_Bogus_Inline *** 2055,2060 **** --- 2208,2290 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Hpux_Ctype_Macros fix + */ + tSCC zHpux_Ctype_MacrosName[] = + "hpux_ctype_macros"; + + /* + * File name selection pattern + */ + tSCC zHpux_Ctype_MacrosList[] = + "|ctype.h|"; + /* + * Machine/OS name selection pattern + */ + #define apzHpux_Ctype_MacrosMachs (const char**)NULL + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zHpux_Ctype_MacrosSelect0[] = + "((: |\\()__SB_masks \\? )(__SB_masks\\[__(alnum|c)\\] & _IS)"; + + #define HPUX_CTYPE_MACROS_TEST_CT 1 + static tTestDesc aHpux_Ctype_MacrosTests[] = { + { TT_EGREP, zHpux_Ctype_MacrosSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Hpux_Ctype_Macros + */ + static const char* apzHpux_Ctype_MacrosPatch[] = { + "format", + "%1(int)%3", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * + * Description of Hpux_Long_Double fix + */ + tSCC zHpux_Long_DoubleName[] = + "hpux_long_double"; + + /* + * File name selection pattern + */ + tSCC zHpux_Long_DoubleList[] = + "|stdlib.h|"; + /* + * Machine/OS name selection pattern + */ + #define apzHpux_Long_DoubleMachs (const char**)NULL + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zHpux_Long_DoubleSelect0[] = + "extern[ \t]long_double[ \t]strtold"; + + /* + * content bypass pattern - skip fix if pattern found + */ + tSCC zHpux_Long_DoubleBypass0[] = + "long_double_t"; + + #define HPUX_LONG_DOUBLE_TEST_CT 2 + static tTestDesc aHpux_Long_DoubleTests[] = { + { TT_NEGREP, zHpux_Long_DoubleBypass0, (regex_t*)NULL }, + { TT_EGREP, zHpux_Long_DoubleSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Hpux_Long_Double + */ + static const char* apzHpux_Long_DoublePatch[] = { "sed", + "-e", "/^#[ \t]*ifndef _LONG_DOUBLE/,/\\/\\* _LONG_DOUBLE \\*\\//D", + "-e", "s/long_double/long double/g", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Hpux_Maxint fix */ tSCC zHpux_MaxintName[] = *************** static const char* apzIrix_Limits_ConstP *** 2350,2355 **** --- 2580,2667 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Irix___Restrict fix + */ + tSCC zIrix___RestrictName[] = + "irix___restrict"; + + /* + * File name selection pattern + */ + tSCC zIrix___RestrictList[] = + "|internal/sgimacros.h|"; + /* + * Machine/OS name selection pattern + */ + tSCC* apzIrix___RestrictMachs[] = { + "mips-sgi-irix6.5", + (const char*)NULL }; + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zIrix___RestrictSelect0[] = + "(#ifdef __c99\n\ + )(#[ \t]*define __restrict restrict)"; + + #define IRIX___RESTRICT_TEST_CT 1 + static tTestDesc aIrix___RestrictTests[] = { + { TT_EGREP, zIrix___RestrictSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Irix___Restrict + */ + static const char* apzIrix___RestrictPatch[] = { + "format", + "%1# ifndef __cplusplus\n\ + %2\n\ + # endif", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * + * Description of Irix_Socklen_T fix + */ + tSCC zIrix_Socklen_TName[] = + "irix_socklen_t"; + + /* + * File name selection pattern + */ + tSCC zIrix_Socklen_TList[] = + "|sys/socket.h|"; + /* + * Machine/OS name selection pattern + */ + tSCC* apzIrix_Socklen_TMachs[] = { + "mips-sgi-irix6.5", + (const char*)NULL }; + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zIrix_Socklen_TSelect0[] = + "(#define _SOCKLEN_T\n\ + )(typedef u_int32_t socklen_t;)"; + + #define IRIX_SOCKLEN_T_TEST_CT 1 + static tTestDesc aIrix_Socklen_TTests[] = { + { TT_EGREP, zIrix_Socklen_TSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Irix_Socklen_T + */ + static const char* apzIrix_Socklen_TPatch[] = { + "format", + "%1#if _NO_XOPEN4 && _NO_XOPEN5\n\ + typedef int socklen_t;\n\ + #else\n\ + %2\n\ + #endif /* _NO_XOPEN4 && _NO_XOPEN5 */", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Irix_Stdio_Va_List fix */ tSCC zIrix_Stdio_Va_ListName[] = *************** static const char* apzIrix_Stdio_Va_List *** 2385,2390 **** --- 2697,2741 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * + * Description of Irix_Wcsftime fix + */ + tSCC zIrix_WcsftimeName[] = + "irix_wcsftime"; + + /* + * File name selection pattern + */ + tSCC zIrix_WcsftimeList[] = + "|internal/wchar_core.h|"; + /* + * Machine/OS name selection pattern + */ + tSCC* apzIrix_WcsftimeMachs[] = { + "mips-sgi-irix6.5", + (const char*)NULL }; + + /* + * content selection pattern - do fix if pattern found + */ + tSCC zIrix_WcsftimeSelect0[] = + "#if _NO_XOPEN5\n\ + (extern size_t[ \t]+wcsftime.*const char *.*)"; + + #define IRIX_WCSFTIME_TEST_CT 1 + static tTestDesc aIrix_WcsftimeTests[] = { + { TT_EGREP, zIrix_WcsftimeSelect0, (regex_t*)NULL }, }; + + /* + * Fix Command Arguments for Irix_Wcsftime + */ + static const char* apzIrix_WcsftimePatch[] = { + "format", + "#if _NO_XOPEN5 && !defined(__c99)\n\ + %1", + (char*)NULL }; + + /* * * * * * * * * * * * * * * * * * * * * * * * * * + * * Description of Isc_Fmod fix */ tSCC zIsc_FmodName[] = *************** static const char* apzSco_UtimePatch[] = *** 3654,3688 **** /* * * * * * * * * * * * * * * * * * * * * * * * * * * ! * Description of Solaris_Mutex_Init fix */ ! tSCC zSolaris_Mutex_InitName[] = ! "solaris_mutex_init"; /* * File name selection pattern */ ! tSCC zSolaris_Mutex_InitList[] = "|pthread.h|"; /* * Machine/OS name selection pattern */ ! #define apzSolaris_Mutex_InitMachs (const char**)NULL /* * content selection pattern - do fix if pattern found */ ! tSCC zSolaris_Mutex_InitSelect0[] = "@\\(#\\)pthread.h[ \t]+1.[0-9]+[ \t]+[0-9/]+ SMI"; ! #define SOLARIS_MUTEX_INIT_TEST_CT 1 ! static tTestDesc aSolaris_Mutex_InitTests[] = { ! { TT_EGREP, zSolaris_Mutex_InitSelect0, (regex_t*)NULL }, }; /* ! * Fix Command Arguments for Solaris_Mutex_Init */ ! static const char* apzSolaris_Mutex_InitPatch[] = { "format", "#if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG)\n\ %0\n\ --- 4005,4074 ---- /* * * * * * * * * * * * * * * * * * * * * * * * * * * ! * Description of Solaris_Mutex_Init_1 fix */ ! tSCC zSolaris_Mutex_Init_1Name[] = ! "solaris_mutex_init_1"; /* * File name selection pattern */ ! tSCC zSolaris_Mutex_Init_1List[] = "|pthread.h|"; /* * Machine/OS name selection pattern */ ! #define apzSolaris_Mutex_Init_1Machs (const char**)NULL /* * content selection pattern - do fix if pattern found */ ! tSCC zSolaris_Mutex_Init_1Select0[] = ! "@\\(#\\)pthread.h[ \t]+1.1[0-9][ \t]+9[567]/[0-9/]+ SMI"; ! ! #define SOLARIS_MUTEX_INIT_1_TEST_CT 1 ! static tTestDesc aSolaris_Mutex_Init_1Tests[] = { ! { TT_EGREP, zSolaris_Mutex_Init_1Select0, (regex_t*)NULL }, }; ! ! /* ! * Fix Command Arguments for Solaris_Mutex_Init_1 ! */ ! static const char* apzSolaris_Mutex_Init_1Patch[] = { "sed", ! "-e", "/define[ \t]*PTHREAD_MUTEX_INI/s/{0, 0,/{{{0}, 0}, {{{0}}},/\n\ ! /define[ \t]*PTHREAD_COND_INI/s/{0,/{{{0},0},/", ! (char*)NULL }; ! ! /* * * * * * * * * * * * * * * * * * * * * * * * * * ! * ! * Description of Solaris_Mutex_Init_2 fix ! */ ! tSCC zSolaris_Mutex_Init_2Name[] = ! "solaris_mutex_init_2"; ! ! /* ! * File name selection pattern ! */ ! tSCC zSolaris_Mutex_Init_2List[] = ! "|pthread.h|"; ! /* ! * Machine/OS name selection pattern ! */ ! #define apzSolaris_Mutex_Init_2Machs (const char**)NULL ! ! /* ! * content selection pattern - do fix if pattern found ! */ ! tSCC zSolaris_Mutex_Init_2Select0[] = "@\\(#\\)pthread.h[ \t]+1.[0-9]+[ \t]+[0-9/]+ SMI"; ! #define SOLARIS_MUTEX_INIT_2_TEST_CT 1 ! static tTestDesc aSolaris_Mutex_Init_2Tests[] = { ! { TT_EGREP, zSolaris_Mutex_Init_2Select0, (regex_t*)NULL }, }; /* ! * Fix Command Arguments for Solaris_Mutex_Init_2 */ ! static const char* apzSolaris_Mutex_Init_2Patch[] = { "format", "#if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG)\n\ %0\n\ *************** static const char* apzX11_SprintfPatch[] *** 5581,5589 **** * * List of all fixes */ ! #define REGEX_COUNT 151 #define MACH_LIST_SIZE_LIMIT 279 ! #define FIX_COUNT 142 /* * Enumerate the fixes --- 5967,5975 ---- * * List of all fixes */ ! #define REGEX_COUNT 163 #define MACH_LIST_SIZE_LIMIT 279 ! #define FIX_COUNT 151 /* * Enumerate the fixes *************** typedef enum { *** 5593,5600 **** AAB_FD_ZERO_ASM_POSIX_TYPES_H_FIXIDX, AAB_FD_ZERO_GNU_TYPES_H_FIXIDX, AAB_FD_ZERO_SELECTBITS_H_FIXIDX, - AAB_SUN_MEMCPY_FIXIDX, AAB_SOLARIS_SYS_VARARGS_H_FIXIDX, AAB_SVR4_REPLACE_BYTEORDER_FIXIDX, AAB_ULTRIX_ANSI_COMPAT_FIXIDX, AAB_ULTRIX_LIMITS_FIXIDX, --- 5979,5986 ---- AAB_FD_ZERO_ASM_POSIX_TYPES_H_FIXIDX, AAB_FD_ZERO_GNU_TYPES_H_FIXIDX, AAB_FD_ZERO_SELECTBITS_H_FIXIDX, AAB_SOLARIS_SYS_VARARGS_H_FIXIDX, + AAB_SUN_MEMCPY_FIXIDX, AAB_SVR4_REPLACE_BYTEORDER_FIXIDX, AAB_ULTRIX_ANSI_COMPAT_FIXIDX, AAB_ULTRIX_LIMITS_FIXIDX, *************** typedef enum { *** 5605,5610 **** --- 5991,5997 ---- AIX_SYSWAIT_FIXIDX, AIX_VOLATILE_FIXIDX, ALPHA___ASSERT_FIXIDX, + ALPHA___EXTERN_PREFIX_FIXIDX, ALPHA_ASSERT_FIXIDX, ALPHA_GETOPT_FIXIDX, ALPHA_PARENS_FIXIDX, *************** typedef enum { *** 5634,5644 **** --- 6021,6035 ---- HP_SYSFILE_FIXIDX, HPUX10_CPP_POW_INLINE_FIXIDX, HPUX11_CPP_POW_INLINE_FIXIDX, + HPUX10_CTYPE_DECLARATIONS1_FIXIDX, + HPUX10_CTYPE_DECLARATIONS2_FIXIDX, HPUX11_FABSF_FIXIDX, HPUX11_SIZE_T_FIXIDX, HPUX11_UINT32_C_FIXIDX, HPUX11_VSNPRINTF_FIXIDX, HPUX8_BOGUS_INLINES_FIXIDX, + HPUX_CTYPE_MACROS_FIXIDX, + HPUX_LONG_DOUBLE_FIXIDX, HPUX_MAXINT_FIXIDX, HPUX_SYSTIME_FIXIDX, INT_ABORT_FREE_AND_EXIT_FIXIDX, *************** typedef enum { *** 5647,5653 **** --- 6038,6047 ---- IP_MISSING_SEMI_FIXIDX, IRIX_ASM_APOSTROPHE_FIXIDX, IRIX_LIMITS_CONST_FIXIDX, + IRIX___RESTRICT_FIXIDX, + IRIX_SOCKLEN_T_FIXIDX, IRIX_STDIO_VA_LIST_FIXIDX, + IRIX_WCSFTIME_FIXIDX, ISC_FMOD_FIXIDX, ISC_OMITS_WITH_STDC_FIXIDX, KANDR_CONCAT_FIXIDX, *************** typedef enum { *** 5681,5687 **** RS6000_PARAM_FIXIDX, SCO_STATIC_FUNC_FIXIDX, SCO_UTIME_FIXIDX, ! SOLARIS_MUTEX_INIT_FIXIDX, SOLARIS_STDIO_TAG_FIXIDX, SOLARIS_WIDEC_FIXIDX, STATSSWTCH_FIXIDX, --- 6075,6082 ---- RS6000_PARAM_FIXIDX, SCO_STATIC_FUNC_FIXIDX, SCO_UTIME_FIXIDX, ! SOLARIS_MUTEX_INIT_1_FIXIDX, ! SOLARIS_MUTEX_INIT_2_FIXIDX, SOLARIS_STDIO_TAG_FIXIDX, SOLARIS_WIDEC_FIXIDX, STATSSWTCH_FIXIDX, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 5754,5769 **** AAB_FD_ZERO_SELECTBITS_H_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, aAab_Fd_Zero_Selectbits_HTests, apzAab_Fd_Zero_Selectbits_HPatch, 0 }, - { zAab_Sun_MemcpyName, zAab_Sun_MemcpyList, - apzAab_Sun_MemcpyMachs, - AAB_SUN_MEMCPY_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, - aAab_Sun_MemcpyTests, apzAab_Sun_MemcpyPatch, 0 }, - { zAab_Solaris_Sys_Varargs_HName, zAab_Solaris_Sys_Varargs_HList, apzAab_Solaris_Sys_Varargs_HMachs, AAB_SOLARIS_SYS_VARARGS_H_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, aAab_Solaris_Sys_Varargs_HTests, apzAab_Solaris_Sys_Varargs_HPatch, 0 }, { zAab_Svr4_Replace_ByteorderName, zAab_Svr4_Replace_ByteorderList, apzAab_Svr4_Replace_ByteorderMachs, AAB_SVR4_REPLACE_BYTEORDER_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, --- 6149,6164 ---- AAB_FD_ZERO_SELECTBITS_H_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, aAab_Fd_Zero_Selectbits_HTests, apzAab_Fd_Zero_Selectbits_HPatch, 0 }, { zAab_Solaris_Sys_Varargs_HName, zAab_Solaris_Sys_Varargs_HList, apzAab_Solaris_Sys_Varargs_HMachs, AAB_SOLARIS_SYS_VARARGS_H_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, aAab_Solaris_Sys_Varargs_HTests, apzAab_Solaris_Sys_Varargs_HPatch, 0 }, + { zAab_Sun_MemcpyName, zAab_Sun_MemcpyList, + apzAab_Sun_MemcpyMachs, + AAB_SUN_MEMCPY_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, + aAab_Sun_MemcpyTests, apzAab_Sun_MemcpyPatch, 0 }, + { zAab_Svr4_Replace_ByteorderName, zAab_Svr4_Replace_ByteorderList, apzAab_Svr4_Replace_ByteorderMachs, AAB_SVR4_REPLACE_BYTEORDER_TEST_CT, FD_MACH_ONLY | FD_REPLACEMENT, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 5814,5819 **** --- 6209,6219 ---- ALPHA___ASSERT_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aAlpha___AssertTests, apzAlpha___AssertPatch, 0 }, + { zAlpha___Extern_PrefixName, zAlpha___Extern_PrefixList, + apzAlpha___Extern_PrefixMachs, + ALPHA___EXTERN_PREFIX_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aAlpha___Extern_PrefixTests, apzAlpha___Extern_PrefixPatch, 0 }, + { zAlpha_AssertName, zAlpha_AssertList, apzAlpha_AssertMachs, ALPHA_ASSERT_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 5959,5964 **** --- 6359,6374 ---- HPUX11_CPP_POW_INLINE_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aHpux11_Cpp_Pow_InlineTests, apzHpux11_Cpp_Pow_InlinePatch, 0 }, + { zHpux10_Ctype_Declarations1Name, zHpux10_Ctype_Declarations1List, + apzHpux10_Ctype_Declarations1Machs, + HPUX10_CTYPE_DECLARATIONS1_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aHpux10_Ctype_Declarations1Tests, apzHpux10_Ctype_Declarations1Patch, 0 }, + + { zHpux10_Ctype_Declarations2Name, zHpux10_Ctype_Declarations2List, + apzHpux10_Ctype_Declarations2Machs, + HPUX10_CTYPE_DECLARATIONS2_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aHpux10_Ctype_Declarations2Tests, apzHpux10_Ctype_Declarations2Patch, 0 }, + { zHpux11_FabsfName, zHpux11_FabsfList, apzHpux11_FabsfMachs, HPUX11_FABSF_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 5984,5989 **** --- 6394,6409 ---- HPUX8_BOGUS_INLINES_TEST_CT, FD_MACH_ONLY, aHpux8_Bogus_InlinesTests, apzHpux8_Bogus_InlinesPatch, 0 }, + { zHpux_Ctype_MacrosName, zHpux_Ctype_MacrosList, + apzHpux_Ctype_MacrosMachs, + HPUX_CTYPE_MACROS_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aHpux_Ctype_MacrosTests, apzHpux_Ctype_MacrosPatch, 0 }, + + { zHpux_Long_DoubleName, zHpux_Long_DoubleList, + apzHpux_Long_DoubleMachs, + HPUX_LONG_DOUBLE_TEST_CT, FD_MACH_ONLY, + aHpux_Long_DoubleTests, apzHpux_Long_DoublePatch, 0 }, + { zHpux_MaxintName, zHpux_MaxintList, apzHpux_MaxintMachs, HPUX_MAXINT_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 6024,6034 **** --- 6444,6469 ---- IRIX_LIMITS_CONST_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aIrix_Limits_ConstTests, apzIrix_Limits_ConstPatch, 0 }, + { zIrix___RestrictName, zIrix___RestrictList, + apzIrix___RestrictMachs, + IRIX___RESTRICT_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aIrix___RestrictTests, apzIrix___RestrictPatch, 0 }, + + { zIrix_Socklen_TName, zIrix_Socklen_TList, + apzIrix_Socklen_TMachs, + IRIX_SOCKLEN_T_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aIrix_Socklen_TTests, apzIrix_Socklen_TPatch, 0 }, + { zIrix_Stdio_Va_ListName, zIrix_Stdio_Va_ListList, apzIrix_Stdio_Va_ListMachs, IRIX_STDIO_VA_LIST_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aIrix_Stdio_Va_ListTests, apzIrix_Stdio_Va_ListPatch, 0 }, + { zIrix_WcsftimeName, zIrix_WcsftimeList, + apzIrix_WcsftimeMachs, + IRIX_WCSFTIME_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, + aIrix_WcsftimeTests, apzIrix_WcsftimePatch, 0 }, + { zIsc_FmodName, zIsc_FmodList, apzIsc_FmodMachs, ISC_FMOD_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, *************** tFixDesc fixDescList[ FIX_COUNT ] = { *** 6194,6203 **** SCO_UTIME_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aSco_UtimeTests, apzSco_UtimePatch, 0 }, ! { zSolaris_Mutex_InitName, zSolaris_Mutex_InitList, ! apzSolaris_Mutex_InitMachs, ! SOLARIS_MUTEX_INIT_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, ! aSolaris_Mutex_InitTests, apzSolaris_Mutex_InitPatch, 0 }, { zSolaris_Stdio_TagName, zSolaris_Stdio_TagList, apzSolaris_Stdio_TagMachs, --- 6629,6643 ---- SCO_UTIME_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, aSco_UtimeTests, apzSco_UtimePatch, 0 }, ! { zSolaris_Mutex_Init_1Name, zSolaris_Mutex_Init_1List, ! apzSolaris_Mutex_Init_1Machs, ! SOLARIS_MUTEX_INIT_1_TEST_CT, FD_MACH_ONLY, ! aSolaris_Mutex_Init_1Tests, apzSolaris_Mutex_Init_1Patch, 0 }, ! ! { zSolaris_Mutex_Init_2Name, zSolaris_Mutex_Init_2List, ! apzSolaris_Mutex_Init_2Machs, ! SOLARIS_MUTEX_INIT_2_TEST_CT, FD_MACH_ONLY | FD_SUBROUTINE, ! aSolaris_Mutex_Init_2Tests, apzSolaris_Mutex_Init_2Patch, 0 }, { zSolaris_Stdio_TagName, zSolaris_Stdio_TagList, apzSolaris_Stdio_TagMachs, diff -Nrc3pad gcc-3.2.2/gcc/fixinc/inclhack.def gcc-3.2.3/gcc/fixinc/inclhack.def *** gcc-3.2.2/gcc/fixinc/inclhack.def Mon Apr 29 19:31:17 2002 --- gcc-3.2.3/gcc/fixinc/inclhack.def Sat Mar 29 21:33:54 2003 *************** fix = { *** 221,226 **** --- 221,243 ---- /* + * Solaris is a DDK (aka kernel-land) header providing + * the same interface as . No idea why they couldn't have just + * used the standard header. + */ + fix = { + hackname = AAB_solaris_sys_varargs_h; + files = "sys/varargs.h"; + mach = '*-*-solaris*'; + replace = "#ifdef __STDC__\n" + "#include \n" + "#else\n" + "#include \n" + "#endif\n"; + }; + + + /* * Fix non-ANSI memcpy declaration that conflicts with gcc's builtin * declaration on Sun OS 4.x. We must only fix this on Sun OS 4.x, because * many other systems have similar text but correct versions of the file. *************** extern int memcmp(); *** 260,282 **** /* - * Solaris is a DDK (aka kernel-land) header providing - * the same interface as . No idea why they couldn't have just - * used the standard header. - */ - fix = { - hackname = AAB_solaris_sys_varargs_h; - files = "sys/varargs.h"; - mach = '*-*-solaris*'; - replace = "#ifdef __STDC__\n" - "#include \n" - "#else\n" - "#include \n" - "#endif\n"; - }; - - - /* * Completely replace with a file that includes gcc's * stdarg.h or varargs.h files as appropriate. */ --- 277,282 ---- *************** fix = { *** 603,608 **** --- 603,624 ---- /* + * Obey __PRAGMA_EXTERN_PREFIX for Tru64 UNIX V5 . + */ + fix = { + hackname = alpha___extern_prefix; + files = sys/stat.h; + select = "#[ \t]*if[ \t]*defined\\(__DECC\\)"; + + mach = "alpha*-dec-osf5*"; + c_fix = format; + c_fix_arg = "%0 || defined(__PRAGMA_EXTERN_PREFIX)"; + + test_text = "# if defined(__DECC)"; + }; + + + /* * Fix assert macro in assert.h on Alpha OSF/1. * The superfluous int cast breaks C++. */ *************** fix = { *** 1146,1151 **** --- 1162,1230 ---- /* + * Fix hpux 10.X missing ctype declarations 1 + */ + fix = { + hackname = hpux10_ctype_declarations1; + files = ctype.h; + select = "^#[ \t]*define _toupper\\(__c\\)[ \t]*__toupper\\(__c\\)"; + bypass = "^[ \t]*extern[ \t]*int[ \t]*__tolower[ \t]*\\("; + c_fix = format; + c_fix_arg = "#ifdef _PROTOTYPES\n" + "extern int __tolower(int);\n" + "extern int __toupper(int);\n" + "#else /* NOT _PROTOTYPES */\n" + "extern int __tolower();\n" + "extern int __toupper();\n" + "#endif /* _PROTOTYPES */\n\n" + "%0\n"; + + test_text = "# define _toupper(__c) __toupper(__c)\n"; + }; + + + /* + * Fix hpux 10.X missing ctype declarations 2 + */ + fix = { + hackname = hpux10_ctype_declarations2; + files = ctype.h; + select = "^# if defined\\(_SB_CTYPE_MACROS\\) && \\!defined\\(__lint\\)"; + bypass = "^[ \t]*extern[ \t]*int[ \t]*_isalnum[ \t]*\\("; + c_fix = format; + c_fix_arg = "%0\n\n" + "#ifdef _PROTOTYPES\n" + " extern int _isalnum(int);\n" + " extern int _isalpha(int);\n" + " extern int _iscntrl(int);\n" + " extern int _isdigit(int);\n" + " extern int _isgraph(int);\n" + " extern int _islower(int);\n" + " extern int _isprint(int);\n" + " extern int _ispunct(int);\n" + " extern int _isspace(int);\n" + " extern int _isupper(int);\n" + " extern int _isxdigit(int);\n" + "# else /* not _PROTOTYPES */\n" + " extern int _isalnum();\n" + " extern int _isalpha();\n" + " extern int _iscntrl();\n" + " extern int _isdigit();\n" + " extern int _isgraph();\n" + " extern int _islower();\n" + " extern int _isprint();\n" + " extern int _ispunct();\n" + " extern int _isspace();\n" + " extern int _isupper();\n" + " extern int _isxdigit();\n" + "#endif /* _PROTOTYPES */\n"; + + test_text = "# if defined(_SB_CTYPE_MACROS) && !defined(__lint)\n" + " extern unsigned int *__SB_masks;\n"; + }; + + + /* * Keep HP-UX 11 from stomping on C++ math namespace * with defines for fabsf. */ *************** fix = { *** 1245,1250 **** --- 1324,1366 ---- /* + * Fix hpux broken ctype macros + */ + fix = { + hackname = hpux_ctype_macros; + files = ctype.h; + select = '((: |\()__SB_masks \? )' + '(__SB_masks\[__(alnum|c)\] & _IS)'; + c_fix = format; + c_fix_arg = "%1(int)%3"; + + test_text = ": __SB_masks ? __SB_masks[__alnum] & _ISCNTRL\n" + "# define isalpha(__c) (__SB_masks ? __SB_masks[__c] & _IS\n"; + }; + + + /* + * HP-UX long_double + */ + fix = { + hackname = hpux_long_double; + files = stdlib.h; + select = "extern[ \t]long_double[ \t]strtold"; + bypass = "long_double_t"; + sed = "/^#[ \t]*ifndef _LONG_DOUBLE/,/\\/\\* _LONG_DOUBLE \\*\\//D"; + sed = "s/long_double/long double/g"; + + test_text = "# ifndef _LONG_DOUBLE\n" + "# define _LONG_DOUBLE\n" + " typedef struct {\n" + " unsigned int word1, word2, word3, word4;\n" + " } long_double;\n" + "# endif /* _LONG_DOUBLE */\n" + "extern long_double strtold(const char *, char **);\n"; + }; + + + /* * HPUX 10.x sys/param.h defines MAXINT which clashes with values.h */ fix = { *************** fix = { *** 1386,1391 **** --- 1502,1549 ---- /* + * IRIX 6.5.1[89] unconditionally defines + * __restrict as restrict iff __c99. This is wrong for C++, which + * needs many C99 features, but only supports __restrict. + */ + fix = { + hackname = irix___restrict; + files = internal/sgimacros.h; + select = "(#ifdef __c99\n)(#[ \t]*define __restrict restrict)"; + + mach = "mips-sgi-irix6.5"; + c_fix = format; + c_fix_arg = "%1" + "# ifndef __cplusplus\n%2\n# endif"; + + test_text = "#ifdef __c99\n# define __restrict restrict"; + }; + + /* + * IRIX 6.5.1[78] has a broken definition of socklen_t. + * Various socket function prototypes use different types instead, + * depending on the API in use (BSD, XPG4/5), but the socklen_t + * definition doesn't reflect this (SGI Bug Id 864477, fixed in + * IRIX 6.5.19). + */ + fix = { + hackname = irix_socklen_t; + files = sys/socket.h; + select = "(#define _SOCKLEN_T\n)(typedef u_int32_t socklen_t;)"; + + mach = "mips-sgi-irix6.5"; + c_fix = format; + c_fix_arg = "%1" + "#if _NO_XOPEN4 && _NO_XOPEN5\n" + "typedef int socklen_t;\n" + "#else\n" + "%2\n" + "#endif /* _NO_XOPEN4 && _NO_XOPEN5 */"; + + test_text = "#define _SOCKLEN_T\ntypedef u_int32_t socklen_t;"; + }; + + /* * IRIX 5.x's stdio.h declares some functions that take a va_list as * taking char *. However, GCC uses void * for va_list, so * calling vfprintf with a va_list fails in C++. */ *************** fix = { *** 1402,1407 **** --- 1560,1582 ---- /* + * IRIX 6.5.19 provides the XPG4 variant of + * wcsftime by default. ISO C99 requires the XPG5 variant instead. + */ + fix = { + hackname = irix_wcsftime; + files = internal/wchar_core.h; + select = "#if _NO_XOPEN5\n(extern size_t[ \t]+wcsftime.*const char \*.*)"; + + mach = "mips-sgi-irix6.5"; + c_fix = format; + c_fix_arg = "#if _NO_XOPEN5 && !defined(__c99)\n%1"; + + test_text = "#if _NO_XOPEN5\n" + "extern size_t wcsftime(wchar_t *, __SGI_LIBC_NAMESPACE_QUALIFIER size_t, const char *, const struct tm *);"; + }; + + /* * Fixing ISC fmod declaration */ fix = { *************** fix = { *** 2050,2055 **** --- 2225,2250 ---- /* + * Sun Solaris 2.5.1, 2.6 defines PTHREAD_{MUTEX|COND}_INITIALIZER + * incorrectly, so we replace them with versions that correspond to + * the definition. We also explicitly name this fix "1" and the next + * fix "2" because this one does not deal with the last field. This + * fix needs to run before the next. + */ + fix = { + hackname = solaris_mutex_init_1; + select = '@\(#\)pthread.h' "[ \t]+1.1[0-9][ \t]+9[567]/[0-9/]+ SMI"; + files = pthread.h; + sed = "/define[ \t]*PTHREAD_MUTEX_INI/s/{0, 0,/{{{0}, 0}, {{{0}}},/\n" + "/define[ \t]*PTHREAD_COND_INI/s/{0,/{{{0},0},/"; + test_text = + '#ident "@(#)pthread.h 1.16 97/05/05 SMI"'"\n" + "#define PTHREAD_MUTEX_INITIALIZER\t{0, 0, 0}\n" + "#define PTHREAD_COND_INITIALIZER\t{0, 0} /* */\n"; + }; + + + /* * Sun Solaris defines PTHREAD_MUTEX_INITIALIZER with a trailing * "0" for the last field of the pthread_mutex_t structure, which is * of type upad64_t, which itself is typedef'd to int64_t, but with *************** fix = { *** 2057,2063 **** * initializer to "{0}" instead */ fix = { ! hackname = solaris_mutex_init; select = '@\(#\)pthread.h' "[ \t]+1.[0-9]+[ \t]+[0-9/]+ SMI"; files = pthread.h; c_fix = format; --- 2252,2258 ---- * initializer to "{0}" instead */ fix = { ! hackname = solaris_mutex_init_2; select = '@\(#\)pthread.h' "[ \t]+1.[0-9]+[ \t]+[0-9/]+ SMI"; files = pthread.h; c_fix = format; diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/ctype.h gcc-3.2.3/gcc/fixinc/tests/base/ctype.h *** gcc-3.2.2/gcc/fixinc/tests/base/ctype.h Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/fixinc/tests/base/ctype.h Thu Feb 13 00:04:34 2003 *************** *** 0 **** --- 1,65 ---- + /* DO NOT EDIT THIS FILE. + + It has been auto-edited by fixincludes from: + + "fixinc/tests/inc/ctype.h" + + This had to be done to correct non-standard usages in the + original, manufacturer supplied header file. */ + + + + #if defined( HPUX10_CTYPE_DECLARATIONS1_CHECK ) + #ifdef _PROTOTYPES + extern int __tolower(int); + extern int __toupper(int); + #else /* NOT _PROTOTYPES */ + extern int __tolower(); + extern int __toupper(); + #endif /* _PROTOTYPES */ + + # define _toupper(__c) __toupper(__c) + + + #endif /* HPUX10_CTYPE_DECLARATIONS1_CHECK */ + + + #if defined( HPUX10_CTYPE_DECLARATIONS2_CHECK ) + # if defined(_SB_CTYPE_MACROS) && !defined(__lint) + + #ifdef _PROTOTYPES + extern int _isalnum(int); + extern int _isalpha(int); + extern int _iscntrl(int); + extern int _isdigit(int); + extern int _isgraph(int); + extern int _islower(int); + extern int _isprint(int); + extern int _ispunct(int); + extern int _isspace(int); + extern int _isupper(int); + extern int _isxdigit(int); + # else /* not _PROTOTYPES */ + extern int _isalnum(); + extern int _isalpha(); + extern int _iscntrl(); + extern int _isdigit(); + extern int _isgraph(); + extern int _islower(); + extern int _isprint(); + extern int _ispunct(); + extern int _isspace(); + extern int _isupper(); + extern int _isxdigit(); + #endif /* _PROTOTYPES */ + + extern unsigned int *__SB_masks; + + #endif /* HPUX10_CTYPE_DECLARATIONS2_CHECK */ + + + #if defined( HPUX_CTYPE_MACROS_CHECK ) + : __SB_masks ? (int)__SB_masks[__alnum] & _ISCNTRL + # define isalpha(__c) (__SB_masks ? (int)__SB_masks[__c] & _IS + + #endif /* HPUX_CTYPE_MACROS_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/internal/sgimacros.h gcc-3.2.3/gcc/fixinc/tests/base/internal/sgimacros.h *** gcc-3.2.2/gcc/fixinc/tests/base/internal/sgimacros.h Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/fixinc/tests/base/internal/sgimacros.h Thu Mar 27 20:08:16 2003 *************** *** 0 **** --- 1,17 ---- + /* DO NOT EDIT THIS FILE. + + It has been auto-edited by fixincludes from: + + "fixinc/tests/inc/internal/sgimacros.h" + + This had to be done to correct non-standard usages in the + original, manufacturer supplied header file. */ + + + + #if defined( IRIX___RESTRICT_CHECK ) + #ifdef __c99 + # ifndef __cplusplus + # define __restrict restrict + # endif + #endif /* IRIX___RESTRICT_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/internal/wchar_core.h gcc-3.2.3/gcc/fixinc/tests/base/internal/wchar_core.h *** gcc-3.2.2/gcc/fixinc/tests/base/internal/wchar_core.h Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/fixinc/tests/base/internal/wchar_core.h Thu Mar 27 20:08:16 2003 *************** *** 0 **** --- 1,15 ---- + /* DO NOT EDIT THIS FILE. + + It has been auto-edited by fixincludes from: + + "fixinc/tests/inc/internal/wchar_core.h" + + This had to be done to correct non-standard usages in the + original, manufacturer supplied header file. */ + + + + #if defined( IRIX_WCSFTIME_CHECK ) + #if _NO_XOPEN5 && !defined(__c99) + extern size_t wcsftime(wchar_t *, __SGI_LIBC_NAMESPACE_QUALIFIER size_t, const char *, const struct tm *); + #endif /* IRIX_WCSFTIME_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/pthread.h gcc-3.2.3/gcc/fixinc/tests/base/pthread.h *** gcc-3.2.2/gcc/fixinc/tests/base/pthread.h Tue Jul 17 03:59:16 2001 --- gcc-3.2.3/gcc/fixinc/tests/base/pthread.h Sat Mar 29 21:33:54 2003 *************** extern int __page_size; *** 20,26 **** #endif /* PTHREAD_PAGE_SIZE_CHECK */ ! #if defined( SOLARIS_MUTEX_INIT_CHECK ) #ident "@(#)pthread.h 1.26 98/04/12 SMI" #if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG) #define PTHREAD_MUTEX_INITIALIZER {{{0},0}, {{{0}}}, 0} --- 20,42 ---- #endif /* PTHREAD_PAGE_SIZE_CHECK */ ! #if defined( SOLARIS_MUTEX_INIT_1_CHECK ) ! #ident "@(#)pthread.h 1.16 97/05/05 SMI" ! #if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG) ! #define PTHREAD_MUTEX_INITIALIZER {{{0}, 0}, {{{0}}}, 0} ! #else ! #define PTHREAD_MUTEX_INITIALIZER {{{0}, 0}, {{{0}}}, {0}} ! #endif ! #if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG) ! #define PTHREAD_COND_INITIALIZER {{{0},0}, 0} /* */ ! #else ! #define PTHREAD_COND_INITIALIZER {{{0},0}, {0}} /* */ ! #endif ! ! #endif /* SOLARIS_MUTEX_INIT_1_CHECK */ ! ! ! #if defined( SOLARIS_MUTEX_INIT_2_CHECK ) #ident "@(#)pthread.h 1.26 98/04/12 SMI" #if __STDC__ - 0 == 0 && !defined(_NO_LONGLONG) #define PTHREAD_MUTEX_INITIALIZER {{{0},0}, {{{0}}}, 0} *************** extern int __page_size; *** 33,36 **** #define PTHREAD_COND_INITIALIZER {{{0}, 0}, {0}} /* DEFAULTCV */ #endif #define PTHREAD_RWLOCK_INITIALIZER {0, 0, 0, {0, 0, 0}, {0, 0}, {0, 0}} ! #endif /* SOLARIS_MUTEX_INIT_CHECK */ --- 49,52 ---- #define PTHREAD_COND_INITIALIZER {{{0}, 0}, {0}} /* DEFAULTCV */ #endif #define PTHREAD_RWLOCK_INITIALIZER {0, 0, 0, {0, 0, 0}, {0, 0}, {0, 0}} ! #endif /* SOLARIS_MUTEX_INIT_2_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/stdlib.h gcc-3.2.3/gcc/fixinc/tests/base/stdlib.h *** gcc-3.2.2/gcc/fixinc/tests/base/stdlib.h Tue Jul 17 03:59:16 2001 --- gcc-3.2.3/gcc/fixinc/tests/base/stdlib.h Thu Feb 13 00:04:34 2003 *************** *** 16,21 **** --- 16,27 ---- #endif /* ARM_WCHAR_CHECK */ + #if defined( HPUX_LONG_DOUBLE_CHECK ) + extern long double strtold(const char *, char **); + + #endif /* HPUX_LONG_DOUBLE_CHECK */ + + #if defined( INT_ABORT_FREE_AND_EXIT_CHECK ) extern void abort(int); extern void free(void*); diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/sys/socket.h gcc-3.2.3/gcc/fixinc/tests/base/sys/socket.h *** gcc-3.2.2/gcc/fixinc/tests/base/sys/socket.h Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/fixinc/tests/base/sys/socket.h Mon Feb 24 01:41:13 2003 *************** *** 0 **** --- 1,19 ---- + /* DO NOT EDIT THIS FILE. + + It has been auto-edited by fixincludes from: + + "fixinc/tests/inc/sys/socket.h" + + This had to be done to correct non-standard usages in the + original, manufacturer supplied header file. */ + + + + #if defined( IRIX_SOCKLEN_T_CHECK ) + #define _SOCKLEN_T + #if _NO_XOPEN4 && _NO_XOPEN5 + typedef int socklen_t; + #else + typedef u_int32_t socklen_t; + #endif /* _NO_XOPEN4 && _NO_XOPEN5 */ + #endif /* IRIX_SOCKLEN_T_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fixinc/tests/base/sys/stat.h gcc-3.2.3/gcc/fixinc/tests/base/sys/stat.h *** gcc-3.2.2/gcc/fixinc/tests/base/sys/stat.h Wed Jul 19 14:18:31 2000 --- gcc-3.2.3/gcc/fixinc/tests/base/sys/stat.h Mon Feb 24 18:46:24 2003 *************** *** 9,14 **** --- 9,19 ---- + #if defined( ALPHA___EXTERN_PREFIX_CHECK ) + # if defined(__DECC) || defined(__PRAGMA_EXTERN_PREFIX) + #endif /* ALPHA___EXTERN_PREFIX_CHECK */ + + #if defined( M88K_BAD_S_IF_CHECK ) #define S_ISREG(m) (((m) & S_IFMT) == S_IFREG) /* is regular? */ #endif /* M88K_BAD_S_IF_CHECK */ diff -Nrc3pad gcc-3.2.2/gcc/fold-const.c gcc-3.2.3/gcc/fold-const.c *** gcc-3.2.2/gcc/fold-const.c Wed Dec 4 19:28:25 2002 --- gcc-3.2.3/gcc/fold-const.c Sat Mar 29 10:29:27 2003 *************** static tree unextend PARAMS ((tree, int *** 102,107 **** --- 102,108 ---- static tree fold_truthop PARAMS ((enum tree_code, tree, tree, tree)); static tree optimize_minmax_comparison PARAMS ((tree)); static tree extract_muldiv PARAMS ((tree, tree, enum tree_code, tree)); + static tree extract_muldiv_1 PARAMS ((tree, tree, enum tree_code, tree)); static tree strip_compound_expr PARAMS ((tree, tree)); static int multiple_of_p PARAMS ((tree, tree, tree)); static tree constant_boolean_node PARAMS ((int, tree)); *************** extract_muldiv (t, c, code, wide_type) *** 4485,4490 **** --- 4486,4516 ---- enum tree_code code; tree wide_type; { + /* To avoid exponential search depth, refuse to allow recursion past + three levels. Beyond that (1) it's highly unlikely that we'll find + something interesting and (2) we've probably processed it before + when we built the inner expression. */ + + static int depth; + tree ret; + + if (depth > 3) + return NULL; + + depth++; + ret = extract_muldiv_1 (t, c, code, wide_type); + depth--; + + return ret; + } + + static tree + extract_muldiv_1 (t, c, code, wide_type) + tree t; + tree c; + enum tree_code code; + tree wide_type; + { tree type = TREE_TYPE (t); enum tree_code tcode = TREE_CODE (t); tree ctype = (wide_type != 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type)) *************** extract_muldiv (t, c, code, wide_type) *** 4532,4538 **** /* ...and its type is larger than ctype, then we cannot pass through this truncation. */ || (GET_MODE_SIZE (TYPE_MODE (ctype)) ! < GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))))) break; /* Pass the constant down and see if we can make a simplification. If --- 4558,4569 ---- /* ...and its type is larger than ctype, then we cannot pass through this truncation. */ || (GET_MODE_SIZE (TYPE_MODE (ctype)) ! < GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))) ! /* ... or signedness changes for division or modulus, ! then we cannot pass through this conversion. */ ! || (code != MULT_EXPR ! && (TREE_UNSIGNED (ctype) ! != TREE_UNSIGNED (TREE_TYPE (op0)))))) break; /* Pass the constant down and see if we can make a simplification. If diff -Nrc3pad gcc-3.2.2/gcc/function.c gcc-3.2.3/gcc/function.c *** gcc-3.2.2/gcc/function.c Mon Jan 27 20:31:57 2003 --- gcc-3.2.3/gcc/function.c Fri Mar 7 07:58:38 2003 *************** assign_parms (fndecl) *** 4581,4586 **** --- 4581,4592 ---- if (nregs > 0) { + #if defined (REG_PARM_STACK_SPACE) && !defined (MAYBE_REG_PARM_STACK_SPACE) + /* When REG_PARM_STACK_SPACE is nonzero, stack space for + split parameters was allocated by our caller, so we + won't be pushing it in the prolog. */ + if (REG_PARM_STACK_SPACE (fndecl) == 0) + #endif current_function_pretend_args_size = (((nregs * UNITS_PER_WORD) + (PARM_BOUNDARY / BITS_PER_UNIT) - 1) / (PARM_BOUNDARY / BITS_PER_UNIT) diff -Nrc3pad gcc-3.2.2/gcc/gcse.c gcc-3.2.3/gcc/gcse.c *** gcc-3.2.2/gcc/gcse.c Mon Apr 22 18:14:28 2002 --- gcc-3.2.3/gcc/gcse.c Tue Feb 25 09:22:32 2003 *************** static void store_motion PARAMS ((void) *** 700,705 **** --- 700,706 ---- static void free_insn_expr_list_list PARAMS ((rtx *)); static void clear_modify_mem_tables PARAMS ((void)); static void free_modify_mem_tables PARAMS ((void)); + static void local_cprop_find_used_regs PARAMS ((rtx *, void *)); /* Entry point for global common subexpression elimination. F is the first instruction in the function. */ *************** cprop_insn (bb, insn, alter_jumps) *** 4165,4177 **** return 0; reg_use_count = 0; ! note_uses (&PATTERN (insn), find_used_regs, NULL); note = find_reg_equal_equiv_note (insn); /* We may win even when propagating constants into notes. */ if (note) ! find_used_regs (&XEXP (note, 0), NULL); for (reg_used = ®_use_table[0]; reg_use_count > 0; reg_used++, reg_use_count--) --- 4166,4178 ---- return 0; reg_use_count = 0; ! note_uses (&PATTERN (insn), local_cprop_find_used_regs, NULL); note = find_reg_equal_equiv_note (insn); /* We may win even when propagating constants into notes. */ if (note) ! local_cprop_find_used_regs (&XEXP (note, 0), NULL); for (reg_used = ®_use_table[0]; reg_use_count > 0; reg_used++, reg_use_count--) *************** cprop_insn (bb, insn, alter_jumps) *** 4280,4285 **** --- 4281,4334 ---- return changed; } + + /* Like find_used_regs, but avoid recording uses that appear in + input-output contexts such as zero_extract or pre_dec. This + restricts the cases we consider to those for which local cprop + can legitimately make replacements. */ + + static void + local_cprop_find_used_regs (xptr, data) + rtx *xptr; + void *data; + { + rtx x = *xptr; + + if (x == 0) + return; + + switch (GET_CODE (x)) + { + case ZERO_EXTRACT: + case SIGN_EXTRACT: + case STRICT_LOW_PART: + return; + + case PRE_DEC: + case PRE_INC: + case POST_DEC: + case POST_INC: + case PRE_MODIFY: + case POST_MODIFY: + /* Can only legitimately appear this early in the context of + stack pushes for function arguments, but handle all of the + codes nonetheless. */ + return; + + case SUBREG: + /* Setting a subreg of a register larger than word_mode leaves + the non-written words unchanged. */ + if (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (x))) > BITS_PER_WORD) + return; + break; + + default: + break; + } + + find_used_regs (xptr, data); + } + /* Forward propagate copies. This includes copies and constants. Return non-zero if a change was made. */ diff -Nrc3pad gcc-3.2.2/gcc/ifcvt.c gcc-3.2.3/gcc/ifcvt.c *** gcc-3.2.2/gcc/ifcvt.c Thu Jul 18 17:45:52 2002 --- gcc-3.2.3/gcc/ifcvt.c Sun Mar 23 20:18:55 2003 *************** find_if_block (test_bb, then_edge, else_ *** 2045,2051 **** /* The THEN block of an IF-THEN combo must have zero or one successors. */ if (then_succ != NULL_EDGE && (then_succ->succ_next != NULL_EDGE ! || (then_succ->flags & EDGE_COMPLEX))) return FALSE; /* If the THEN block has no successors, conditional execution can still --- 2045,2052 ---- /* The THEN block of an IF-THEN combo must have zero or one successors. */ if (then_succ != NULL_EDGE && (then_succ->succ_next != NULL_EDGE ! || (then_succ->flags & EDGE_COMPLEX) ! || (flow2_completed && tablejump_p (then_bb->end)))) return FALSE; /* If the THEN block has no successors, conditional execution can still *************** find_if_block (test_bb, then_edge, else_ *** 2092,2098 **** && then_succ->dest == else_succ->dest && else_bb->pred->pred_next == NULL_EDGE && else_succ->succ_next == NULL_EDGE ! && ! (else_succ->flags & EDGE_COMPLEX)) join_bb = else_succ->dest; /* Otherwise it is not an IF-THEN or IF-THEN-ELSE combination. */ --- 2093,2100 ---- && then_succ->dest == else_succ->dest && else_bb->pred->pred_next == NULL_EDGE && else_succ->succ_next == NULL_EDGE ! && ! (else_succ->flags & EDGE_COMPLEX) ! && ! (flow2_completed && tablejump_p (else_bb->end))) join_bb = else_succ->dest; /* Otherwise it is not an IF-THEN or IF-THEN-ELSE combination. */ *************** dead_or_predicable (test_bb, merge_bb, o *** 2519,2529 **** --- 2521,2548 ---- if (GET_CODE (end) == JUMP_INSN) { + rtx tmp, insn, label; + if (head == end) { head = end = NULL_RTX; goto no_body; } + + /* If there is a jump table following merge_bb, fail + if there are any insn between head and PREV_INSN (end) + references it. */ + if ((label = JUMP_LABEL (end)) != NULL_RTX + && (tmp = NEXT_INSN (label)) != NULL_RTX + && GET_CODE (tmp) == JUMP_INSN + && (GET_CODE (PATTERN (tmp)) == ADDR_VEC + || GET_CODE (PATTERN (tmp)) == ADDR_DIFF_VEC)) + { + for (insn = head; insn != PREV_INSN (end); insn = NEXT_INSN (insn)) + if (find_reg_note (insn, REG_LABEL, label)) + return FALSE; + } + end = PREV_INSN (end); } diff -Nrc3pad gcc-3.2.2/gcc/intl/ChangeLog gcc-3.2.3/gcc/intl/ChangeLog *** gcc-3.2.2/gcc/intl/ChangeLog Wed Feb 5 03:00:34 2003 --- gcc-3.2.3/gcc/intl/ChangeLog Tue Apr 22 06:15:02 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/java/ChangeLog gcc-3.2.3/gcc/java/ChangeLog *** gcc-3.2.2/gcc/java/ChangeLog Wed Feb 5 03:00:30 2003 --- gcc-3.2.3/gcc/java/ChangeLog Tue Apr 22 06:15:07 2003 *************** *** 1,3 **** --- 1,20 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-03-17 Kaveh R. Ghazi + + Backport: + 2002-12-05 Ranjit Mathew + Andrew Haley + + * parse.y (source_end_java_method): Remove custom encoding of line + numbers for a function decl before passing it to the back end. + + 2003-02-05 Gabriel Dos Reis + + * gcj.texi: Bump version. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/java/gcj.1 gcc-3.2.3/gcc/java/gcj.1 *** gcc-3.2.2/gcc/java/gcj.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/java/gcj.1 Tue Apr 22 07:07:36 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:00 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:36 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "GCJ 1" ! .TH GCJ 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gcj \- Ahead-of-time compiler for the Java language --- 138,144 ---- .\" ====================================================================== .\" .IX Title "GCJ 1" ! .TH GCJ 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gcj \- Ahead-of-time compiler for the Java language diff -Nrc3pad gcc-3.2.2/gcc/java/gcj.info gcc-3.2.3/gcc/java/gcj.info *** gcc-3.2.2/gcc/java/gcj.info Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/java/gcj.info Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,89 ---- + This is gcj.info, produced by makeinfo version 4.5 from gcj.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Gcj: (gcj). Ahead-of-time compiler for the Java language + END-INFO-DIR-ENTRY + + INFO-DIR-SECTION Individual utilities + START-INFO-DIR-ENTRY + * gcjh: (gcj)Invoking gcjh. + Generate header files from Java class files + * jv-scan: (gcj)Invoking jv-scan. + Print information about Java source files + * jcf-dump: (gcj)Invoking jcf-dump. + Print information about Java class files + * gij: (gcj)Invoking gij. GNU interpreter for Java bytecode + * jv-convert: (gcj)Invoking jv-convert. + Convert file from one encoding to another + * rmic: (gcj)Invoking rmic. + Generate stubs for Remote Method Invocation. + * rmiregistry: (gcj)Invoking rmiregistry. + The remote object registry. + END-INFO-DIR-ENTRY + + Copyright (C) 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License", the Front-Cover + texts being (a) (see below), and with the Back-Cover Texts being (b) + (see below). A copy of the license is included in the section entitled + "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + Indirect: + gcj.info-1: 1742 + gcj.info-2: 49300 +  + Tag Table: + (Indirect) + Node: Top1742 + Node: Copying2826 + Node: GNU Free Documentation License22029 + Node: Invoking gcj41913 + Node: Input and output files42564 + Node: Input Options43927 + Node: Encodings47068 + Node: Warnings48269 + Node: Code Generation49300 + Ref: Code Generation-Footnote-152820 + Node: Configure-time Options53129 + Node: Compatibility54547 + Node: Invoking gcjh55839 + Node: Invoking jv-scan57895 + Node: Invoking jcf-dump58793 + Node: Invoking gij59564 + Node: Invoking jv-convert61446 + Node: Invoking rmic62516 + Node: Invoking rmiregistry63891 + Node: About CNI64302 + Node: Basic concepts65585 + Node: Packages68568 + Node: Primitive types70880 + Node: Interfaces72528 + Node: Objects and Classes73437 + Node: Class Initialization75598 + Node: Object allocation77832 + Node: Arrays78807 + Node: Methods81394 + Node: Strings84145 + Node: Mixing with C++85613 + Node: Exception Handling87496 + Node: Synchronization89131 + Node: Invocation91111 + Node: Reflection95180 + Node: Resources95632 +  + End Tag Table diff -Nrc3pad gcc-3.2.2/gcc/java/gcj.info-1 gcc-3.2.3/gcc/java/gcj.info-1 *** gcc-3.2.2/gcc/java/gcj.info-1 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/java/gcj.info-1 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,1012 ---- + This is gcj.info, produced by makeinfo version 4.5 from gcj.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Gcj: (gcj). Ahead-of-time compiler for the Java language + END-INFO-DIR-ENTRY + + INFO-DIR-SECTION Individual utilities + START-INFO-DIR-ENTRY + * gcjh: (gcj)Invoking gcjh. + Generate header files from Java class files + * jv-scan: (gcj)Invoking jv-scan. + Print information about Java source files + * jcf-dump: (gcj)Invoking jcf-dump. + Print information about Java class files + * gij: (gcj)Invoking gij. GNU interpreter for Java bytecode + * jv-convert: (gcj)Invoking jv-convert. + Convert file from one encoding to another + * rmic: (gcj)Invoking rmic. + Generate stubs for Remote Method Invocation. + * rmiregistry: (gcj)Invoking rmiregistry. + The remote object registry. + END-INFO-DIR-ENTRY + + Copyright (C) 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License", the Front-Cover + texts being (a) (see below), and with the Back-Cover Texts being (b) + (see below). A copy of the license is included in the section entitled + "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcj.info, Node: Top, Next: Copying, Up: (dir) + + Introduction + ************ + + This manual describes how to use `gcj', the GNU compiler for the + Java programming language. `gcj' can generate both `.class' files and + object files, and it can read both Java source code and `.class' files. + + * Menu: + + * Copying:: The GNU General Public License + * GNU Free Documentation License:: + How you can share and copy this manual + * Invoking gcj:: Compiler options supported by `gcj' + * Compatibility:: Compatibility between gcj and other tools for Java + * Invoking gcjh:: Generate header files from class files + * Invoking jv-scan:: Print information about source files + * Invoking jcf-dump:: Print information about class files + * Invoking gij:: Interpreting Java bytecodes + * Invoking jv-convert:: Converting from one encoding to another + * Invoking rmic:: Generate stubs for Remote Method Invocation. + * Invoking rmiregistry:: The remote object registry. + * About CNI:: Description of the Cygnus Native Interface + * Resources:: Where to look for more information + +  + File: gcj.info, Node: Copying, Next: GNU Free Documentation License, Prev: Top, Up: Top + + GNU GENERAL PUBLIC LICENSE + ************************** + + Version 2, June 1991 + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + ======== + + The licenses for most software are designed to take away your + freedom to share and change it. By contrast, the GNU General Public + License is intended to guarantee your freedom to share and change free + software--to make sure the software is free for all its users. This + General Public License applies to most of the Free Software + Foundation's software and to any other program whose authors commit to + using it. (Some other Free Software Foundation software is covered by + the GNU Library General Public License instead.) You can apply it to + your programs, too. + + When we speak of free software, we are referring to freedom, not + price. Our General Public Licenses are designed to make sure that you + have the freedom to distribute copies of free software (and charge for + this service if you wish), that you receive source code or can get it + if you want it, that you can change the software or use pieces of it in + new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid + anyone to deny you these rights or to ask you to surrender the rights. + These restrictions translate to certain responsibilities for you if you + distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether + gratis or for a fee, you must give the recipients all the rights that + you have. You must make sure that they, too, receive or can get the + source code. And you must show them these terms so they know their + rights. + + We protect your rights with two steps: (1) copyright the software, + and (2) offer you this license which gives you legal permission to copy, + distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain + that everyone understands that there is no warranty for this free + software. If the software is modified by someone else and passed on, we + want its recipients to know that what they have is not the original, so + that any problems introduced by others will not reflect on the original + authors' reputations. + + Finally, any free program is threatened constantly by software + patents. We wish to avoid the danger that redistributors of a free + program will individually obtain patent licenses, in effect making the + program proprietary. To prevent this, we have made it clear that any + patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and + modification follow. + + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + 0. This License applies to any program or other work which contains a + notice placed by the copyright holder saying it may be distributed + under the terms of this General Public License. The "Program", + below, refers to any such program or work, and a "work based on + the Program" means either the Program or any derivative work under + copyright law: that is to say, a work containing the Program or a + portion of it, either verbatim or with modifications and/or + translated into another language. (Hereinafter, translation is + included without limitation in the term "modification".) Each + licensee is addressed as "you". + + Activities other than copying, distribution and modification are + not covered by this License; they are outside its scope. The act + of running the Program is not restricted, and the output from the + Program is covered only if its contents constitute a work based on + the Program (independent of having been made by running the + Program). Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's + source code as you receive it, in any medium, provided that you + conspicuously and appropriately publish on each copy an appropriate + copyright notice and disclaimer of warranty; keep intact all the + notices that refer to this License and to the absence of any + warranty; and give any other recipients of the Program a copy of + this License along with the Program. + + You may charge a fee for the physical act of transferring a copy, + and you may at your option offer warranty protection in exchange + for a fee. + + 2. You may modify your copy or copies of the Program or any portion + of it, thus forming a work based on the Program, and copy and + distribute such modifications or work under the terms of Section 1 + above, provided that you also meet all of these conditions: + + a. You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b. You must cause any work that you distribute or publish, that + in whole or in part contains or is derived from the Program + or any part thereof, to be licensed as a whole at no charge + to all third parties under the terms of this License. + + c. If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display + an announcement including an appropriate copyright notice and + a notice that there is no warranty (or else, saying that you + provide a warranty) and that users may redistribute the + program under these conditions, and telling the user how to + view a copy of this License. (Exception: if the Program + itself is interactive but does not normally print such an + announcement, your work based on the Program is not required + to print an announcement.) + + These requirements apply to the modified work as a whole. If + identifiable sections of that work are not derived from the + Program, and can be reasonably considered independent and separate + works in themselves, then this License, and its terms, do not + apply to those sections when you distribute them as separate + works. But when you distribute the same sections as part of a + whole which is a work based on the Program, the distribution of + the whole must be on the terms of this License, whose permissions + for other licensees extend to the entire whole, and thus to each + and every part regardless of who wrote it. + + Thus, it is not the intent of this section to claim rights or + contest your rights to work written entirely by you; rather, the + intent is to exercise the right to control the distribution of + derivative or collective works based on the Program. + + In addition, mere aggregation of another work not based on the + Program with the Program (or with a work based on the Program) on + a volume of a storage or distribution medium does not bring the + other work under the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, + under Section 2) in object code or executable form under the terms + of Sections 1 and 2 above provided that you also do one of the + following: + + a. Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of + Sections 1 and 2 above on a medium customarily used for + software interchange; or, + + b. Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a + medium customarily used for software interchange; or, + + c. Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with + such an offer, in accord with Subsection b above.) + + The source code for a work means the preferred form of the work for + making modifications to it. For an executable work, complete + source code means all the source code for all modules it contains, + plus any associated interface definition files, plus the scripts + used to control compilation and installation of the executable. + However, as a special exception, the source code distributed need + not include anything that is normally distributed (in either + source or binary form) with the major components (compiler, + kernel, and so on) of the operating system on which the executable + runs, unless that component itself accompanies the executable. + + If distribution of executable or object code is made by offering + access to copy from a designated place, then offering equivalent + access to copy the source code from the same place counts as + distribution of the source code, even though third parties are not + compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program + except as expressly provided under this License. Any attempt + otherwise to copy, modify, sublicense or distribute the Program is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 5. You are not required to accept this License, since you have not + signed it. However, nothing else grants you permission to modify + or distribute the Program or its derivative works. These actions + are prohibited by law if you do not accept this License. + Therefore, by modifying or distributing the Program (or any work + based on the Program), you indicate your acceptance of this + License to do so, and all its terms and conditions for copying, + distributing or modifying the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the + Program), the recipient automatically receives a license from the + original licensor to copy, distribute or modify the Program + subject to these terms and conditions. You may not impose any + further restrictions on the recipients' exercise of the rights + granted herein. You are not responsible for enforcing compliance + by third parties to this License. + + 7. If, as a consequence of a court judgment or allegation of patent + infringement or for any other reason (not limited to patent + issues), conditions are imposed on you (whether by court order, + agreement or otherwise) that contradict the conditions of this + License, they do not excuse you from the conditions of this + License. If you cannot distribute so as to satisfy simultaneously + your obligations under this License and any other pertinent + obligations, then as a consequence you may not distribute the + Program at all. For example, if a patent license would not permit + royalty-free redistribution of the Program by all those who + receive copies directly or indirectly through you, then the only + way you could satisfy both it and this License would be to refrain + entirely from distribution of the Program. + + If any portion of this section is held invalid or unenforceable + under any particular circumstance, the balance of the section is + intended to apply and the section as a whole is intended to apply + in other circumstances. + + It is not the purpose of this section to induce you to infringe any + patents or other property right claims or to contest validity of + any such claims; this section has the sole purpose of protecting + the integrity of the free software distribution system, which is + implemented by public license practices. Many people have made + generous contributions to the wide range of software distributed + through that system in reliance on consistent application of that + system; it is up to the author/donor to decide if he or she is + willing to distribute software through any other system and a + licensee cannot impose that choice. + + This section is intended to make thoroughly clear what is believed + to be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in + certain countries either by patents or by copyrighted interfaces, + the original copyright holder who places the Program under this + License may add an explicit geographical distribution limitation + excluding those countries, so that distribution is permitted only + in or among countries not thus excluded. In such case, this + License incorporates the limitation as if written in the body of + this License. + + 9. The Free Software Foundation may publish revised and/or new + versions of the General Public License from time to time. Such + new versions will be similar in spirit to the present version, but + may differ in detail to address new problems or concerns. + + Each version is given a distinguishing version number. If the + Program specifies a version number of this License which applies + to it and "any later version", you have the option of following + the terms and conditions either of that version or of any later + version published by the Free Software Foundation. If the Program + does not specify a version number of this License, you may choose + any version ever published by the Free Software Foundation. + + 10. If you wish to incorporate parts of the Program into other free + programs whose distribution conditions are different, write to the + author to ask for permission. For software which is copyrighted + by the Free Software Foundation, write to the Free Software + Foundation; we sometimes make exceptions for this. Our decision + will be guided by the two goals of preserving the free status of + all derivatives of our free software and of promoting the sharing + and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO + WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE + LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT + HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT + WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT + NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE + QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE + PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY + SERVICING, REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN + WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY + MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE + LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, + INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR + INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF + DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU + OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY + OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN + ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + ============================================= + + If you develop a new program, and you want it to be of the greatest + possible use to the public, the best way to achieve this is to make it + free software which everyone can redistribute and change under these + terms. + + To do so, attach the following notices to the program. It is safest + to attach them to the start of each source file to most effectively + convey the exclusion of warranty; and each file should have at least + the "copyright" line and a pointer to where the full notice is found. + + ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. + Copyright (C) YEAR NAME OF AUTHOR + + This program 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 2 of the License, or + (at your option) any later version. + + This program 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 this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. + + Also add information on how to contact you by electronic and paper + mail. + + If the program is interactive, make it output a short notice like + this when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) YEAR NAME OF AUTHOR + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details + type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + + The hypothetical commands `show w' and `show c' should show the + appropriate parts of the General Public License. Of course, the + commands you use may be called something other than `show w' and `show + c'; they could even be mouse-clicks or menu items--whatever suits your + program. + + You should also get your employer (if you work as a programmer) or + your school, if any, to sign a "copyright disclaimer" for the program, + if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + SIGNATURE OF TY COON, 1 April 1989 + Ty Coon, President of Vice + + This General Public License does not permit incorporating your + program into proprietary programs. If your program is a subroutine + library, you may consider it more useful to permit linking proprietary + applications with the library. If this is what you want to do, use the + GNU Library General Public License instead of this License. + +  + File: gcj.info, Node: GNU Free Documentation License, Next: Invoking gcj, Prev: Copying, Up: Top + + GNU Free Documentation License + ****************************** + + Version 1.1, March 2000 + Copyright (C) 2000 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA + + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + 0. PREAMBLE + + The purpose of this License is to make a manual, textbook, or other + written document "free" in the sense of freedom: to assure everyone + the effective freedom to copy and redistribute it, with or without + modifying it, either commercially or noncommercially. Secondarily, + this License preserves for the author and publisher a way to get + credit for their work, while not being considered responsible for + modifications made by others. + + This License is a kind of "copyleft", which means that derivative + works of the document must themselves be free in the same sense. + It complements the GNU General Public License, which is a copyleft + license designed for free software. + + We have designed this License in order to use it for manuals for + free software, because free software needs free documentation: a + free program should come with manuals providing the same freedoms + that the software does. But this License is not limited to + software manuals; it can be used for any textual work, regardless + of subject matter or whether it is published as a printed book. + We recommend this License principally for works whose purpose is + instruction or reference. + + 1. APPLICABILITY AND DEFINITIONS + + This License applies to any manual or other work that contains a + notice placed by the copyright holder saying it can be distributed + under the terms of this License. The "Document", below, refers to + any such manual or work. Any member of the public is a licensee, + and is addressed as "you". + + A "Modified Version" of the Document means any work containing the + Document or a portion of it, either copied verbatim, or with + modifications and/or translated into another language. + + A "Secondary Section" is a named appendix or a front-matter + section of the Document that deals exclusively with the + relationship of the publishers or authors of the Document to the + Document's overall subject (or to related matters) and contains + nothing that could fall directly within that overall subject. + (For example, if the Document is in part a textbook of + mathematics, a Secondary Section may not explain any mathematics.) + The relationship could be a matter of historical connection with + the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + The "Invariant Sections" are certain Secondary Sections whose + titles are designated, as being those of Invariant Sections, in + the notice that says that the Document is released under this + License. + + The "Cover Texts" are certain short passages of text that are + listed, as Front-Cover Texts or Back-Cover Texts, in the notice + that says that the Document is released under this License. + + A "Transparent" copy of the Document means a machine-readable copy, + represented in a format whose specification is available to the + general public, whose contents can be viewed and edited directly + and straightforwardly with generic text editors or (for images + composed of pixels) generic paint programs or (for drawings) some + widely available drawing editor, and that is suitable for input to + text formatters or for automatic translation to a variety of + formats suitable for input to text formatters. A copy made in an + otherwise Transparent file format whose markup has been designed + to thwart or discourage subsequent modification by readers is not + Transparent. A copy that is not "Transparent" is called "Opaque". + + Examples of suitable formats for Transparent copies include plain + ASCII without markup, Texinfo input format, LaTeX input format, + SGML or XML using a publicly available DTD, and + standard-conforming simple HTML designed for human modification. + Opaque formats include PostScript, PDF, proprietary formats that + can be read and edited only by proprietary word processors, SGML + or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML produced by some word + processors for output purposes only. + + The "Title Page" means, for a printed book, the title page itself, + plus such following pages as are needed to hold, legibly, the + material this License requires to appear in the title page. For + works in formats which do not have any title page as such, "Title + Page" means the text near the most prominent appearance of the + work's title, preceding the beginning of the body of the text. + + 2. VERBATIM COPYING + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the + copyright notices, and the license notice saying this License + applies to the Document are reproduced in all copies, and that you + add no other conditions whatsoever to those of this License. You + may not use technical measures to obstruct or control the reading + or further copying of the copies you make or distribute. However, + you may accept compensation in exchange for copies. If you + distribute a large enough number of copies you must also follow + the conditions in section 3. + + You may also lend copies, under the same conditions stated above, + and you may publicly display copies. + + 3. COPYING IN QUANTITY + + If you publish printed copies of the Document numbering more than + 100, and the Document's license notice requires Cover Texts, you + must enclose the copies in covers that carry, clearly and legibly, + all these Cover Texts: Front-Cover Texts on the front cover, and + Back-Cover Texts on the back cover. Both covers must also clearly + and legibly identify you as the publisher of these copies. The + front cover must present the full title with all words of the + title equally prominent and visible. You may add other material + on the covers in addition. Copying with changes limited to the + covers, as long as they preserve the title of the Document and + satisfy these conditions, can be treated as verbatim copying in + other respects. + + If the required texts for either cover are too voluminous to fit + legibly, you should put the first ones listed (as many as fit + reasonably) on the actual cover, and continue the rest onto + adjacent pages. + + If you publish or distribute Opaque copies of the Document + numbering more than 100, you must either include a + machine-readable Transparent copy along with each Opaque copy, or + state in or with each Opaque copy a publicly-accessible + computer-network location containing a complete Transparent copy + of the Document, free of added material, which the general + network-using public has access to download anonymously at no + charge using public-standard network protocols. If you use the + latter option, you must take reasonably prudent steps, when you + begin distribution of Opaque copies in quantity, to ensure that + this Transparent copy will remain thus accessible at the stated + location until at least one year after the last time you + distribute an Opaque copy (directly or through your agents or + retailers) of that edition to the public. + + It is requested, but not required, that you contact the authors of + the Document well before redistributing any large number of + copies, to give them a chance to provide you with an updated + version of the Document. + + 4. MODIFICATIONS + + You may copy and distribute a Modified Version of the Document + under the conditions of sections 2 and 3 above, provided that you + release the Modified Version under precisely this License, with + the Modified Version filling the role of the Document, thus + licensing distribution and modification of the Modified Version to + whoever possesses a copy of it. In addition, you must do these + things in the Modified Version: + + A. Use in the Title Page (and on the covers, if any) a title + distinct from that of the Document, and from those of + previous versions (which should, if there were any, be listed + in the History section of the Document). You may use the + same title as a previous version if the original publisher of + that version gives permission. + + B. List on the Title Page, as authors, one or more persons or + entities responsible for authorship of the modifications in + the Modified Version, together with at least five of the + principal authors of the Document (all of its principal + authors, if it has less than five). + + C. State on the Title page the name of the publisher of the + Modified Version, as the publisher. + + D. Preserve all the copyright notices of the Document. + + E. Add an appropriate copyright notice for your modifications + adjacent to the other copyright notices. + + F. Include, immediately after the copyright notices, a license + notice giving the public permission to use the Modified + Version under the terms of this License, in the form shown in + the Addendum below. + + G. Preserve in that license notice the full lists of Invariant + Sections and required Cover Texts given in the Document's + license notice. + + H. Include an unaltered copy of this License. + + I. Preserve the section entitled "History", and its title, and + add to it an item stating at least the title, year, new + authors, and publisher of the Modified Version as given on + the Title Page. If there is no section entitled "History" in + the Document, create one stating the title, year, authors, + and publisher of the Document as given on its Title Page, + then add an item describing the Modified Version as stated in + the previous sentence. + + J. Preserve the network location, if any, given in the Document + for public access to a Transparent copy of the Document, and + likewise the network locations given in the Document for + previous versions it was based on. These may be placed in + the "History" section. You may omit a network location for a + work that was published at least four years before the + Document itself, or if the original publisher of the version + it refers to gives permission. + + K. In any section entitled "Acknowledgments" or "Dedications", + preserve the section's title, and preserve in the section all + the substance and tone of each of the contributor + acknowledgments and/or dedications given therein. + + L. Preserve all the Invariant Sections of the Document, + unaltered in their text and in their titles. Section numbers + or the equivalent are not considered part of the section + titles. + + M. Delete any section entitled "Endorsements". Such a section + may not be included in the Modified Version. + + N. Do not retitle any existing section as "Endorsements" or to + conflict in title with any Invariant Section. + + If the Modified Version includes new front-matter sections or + appendices that qualify as Secondary Sections and contain no + material copied from the Document, you may at your option + designate some or all of these sections as invariant. To do this, + add their titles to the list of Invariant Sections in the Modified + Version's license notice. These titles must be distinct from any + other section titles. + + You may add a section entitled "Endorsements", provided it contains + nothing but endorsements of your Modified Version by various + parties--for example, statements of peer review or that the text + has been approved by an organization as the authoritative + definition of a standard. + + You may add a passage of up to five words as a Front-Cover Text, + and a passage of up to 25 words as a Back-Cover Text, to the end + of the list of Cover Texts in the Modified Version. Only one + passage of Front-Cover Text and one of Back-Cover Text may be + added by (or through arrangements made by) any one entity. If the + Document already includes a cover text for the same cover, + previously added by you or by arrangement made by the same entity + you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous + publisher that added the old one. + + The author(s) and publisher(s) of the Document do not by this + License give permission to use their names for publicity for or to + assert or imply endorsement of any Modified Version. + + 5. COMBINING DOCUMENTS + + You may combine the Document with other documents released under + this License, under the terms defined in section 4 above for + modified versions, provided that you include in the combination + all of the Invariant Sections of all of the original documents, + unmodified, and list them all as Invariant Sections of your + combined work in its license notice. + + The combined work need only contain one copy of this License, and + multiple identical Invariant Sections may be replaced with a single + copy. If there are multiple Invariant Sections with the same name + but different contents, make the title of each such section unique + by adding at the end of it, in parentheses, the name of the + original author or publisher of that section if known, or else a + unique number. Make the same adjustment to the section titles in + the list of Invariant Sections in the license notice of the + combined work. + + In the combination, you must combine any sections entitled + "History" in the various original documents, forming one section + entitled "History"; likewise combine any sections entitled + "Acknowledgments", and any sections entitled "Dedications". You + must delete all sections entitled "Endorsements." + + 6. COLLECTIONS OF DOCUMENTS + + You may make a collection consisting of the Document and other + documents released under this License, and replace the individual + copies of this License in the various documents with a single copy + that is included in the collection, provided that you follow the + rules of this License for verbatim copying of each of the + documents in all other respects. + + You may extract a single document from such a collection, and + distribute it individually under this License, provided you insert + a copy of this License into the extracted document, and follow + this License in all other respects regarding verbatim copying of + that document. + + 7. AGGREGATION WITH INDEPENDENT WORKS + + A compilation of the Document or its derivatives with other + separate and independent documents or works, in or on a volume of + a storage or distribution medium, does not as a whole count as a + Modified Version of the Document, provided no compilation + copyright is claimed for the compilation. Such a compilation is + called an "aggregate", and this License does not apply to the + other self-contained works thus compiled with the Document, on + account of their being thus compiled, if they are not themselves + derivative works of the Document. + + If the Cover Text requirement of section 3 is applicable to these + copies of the Document, then if the Document is less than one + quarter of the entire aggregate, the Document's Cover Texts may be + placed on covers that surround only the Document within the + aggregate. Otherwise they must appear on covers around the whole + aggregate. + + 8. TRANSLATION + + Translation is considered a kind of modification, so you may + distribute translations of the Document under the terms of section + 4. Replacing Invariant Sections with translations requires special + permission from their copyright holders, but you may include + translations of some or all Invariant Sections in addition to the + original versions of these Invariant Sections. You may include a + translation of this License provided that you also include the + original English version of this License. In case of a + disagreement between the translation and the original English + version of this License, the original English version will prevail. + + 9. TERMINATION + + You may not copy, modify, sublicense, or distribute the Document + except as expressly provided for under this License. Any other + attempt to copy, modify, sublicense or distribute the Document is + void, and will automatically terminate your rights under this + License. However, parties who have received copies, or rights, + from you under this License will not have their licenses + terminated so long as such parties remain in full compliance. + + 10. FUTURE REVISIONS OF THIS LICENSE + + The Free Software Foundation may publish new, revised versions of + the GNU Free Documentation License from time to time. Such new + versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. See + `http://www.gnu.org/copyleft/'. + + Each version of the License is given a distinguishing version + number. If the Document specifies that a particular numbered + version of this License "or any later version" applies to it, you + have the option of following the terms and conditions either of + that specified version or of any later version that has been + published (not as a draft) by the Free Software Foundation. If + the Document does not specify a version number of this License, + you may choose any version ever published (not as a draft) by the + Free Software Foundation. + + ADDENDUM: How to use this License for your documents + ==================================================== + + To use this License in a document you have written, include a copy of + the License in the document and put the following copyright and license + notices just after the title page: + + Copyright (C) YEAR YOUR NAME. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 + or any later version published by the Free Software Foundation; + with the Invariant Sections being LIST THEIR TITLES, with the + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. + A copy of the license is included in the section entitled ``GNU + Free Documentation License''. + + If you have no Invariant Sections, write "with no Invariant Sections" + instead of saying which ones are invariant. If you have no Front-Cover + Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being + LIST"; likewise for Back-Cover Texts. + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of + free software license, such as the GNU General Public License, to + permit their use in free software. + +  + File: gcj.info, Node: Invoking gcj, Next: Compatibility, Prev: GNU Free Documentation License, Up: Top + + Invoking gcj + ************ + + As `gcj' is just another front end to `gcc', it supports many of the + same options as gcc. *Note Option Summary: (gcc)Option Summary. This + manual only documents the options specific to `gcj'. + + * Menu: + + * Input and output files:: + * Input Options:: How gcj finds files + * Encodings:: Options controlling source file encoding + * Warnings:: Options controlling warnings specific to gcj + * Code Generation:: Options controlling the output of gcj + * Configure-time Options:: Options you won't use + +  + File: gcj.info, Node: Input and output files, Next: Input Options, Up: Invoking gcj + + Input and output files + ====================== + + A `gcj' command is like a `gcc' command, in that it consists of a + number of options and file names. The following kinds of input file + names are supported: + + `FILE.java' + Java source files. + + `FILE.class' + Java bytecode files. + + `FILE.zip' + `FILE.jar' + An archive containing one or more `.class' files, all of which are + compiled. The archive may be compressed. + + `@FILE' + A file containing a whitespace-separated list of input file names. + (Currently, these must all be `.java' source files, but that may + change.) Each named file is compiled, just as if it had been on + the command line. + + `LIBRARY.a' + `LIBRARY.so' + `-lLIBNAME' + Libraries to use when linking. See the `gcc' manual. + + You can specify more than one input file on the `gcj' command line, + in which case they will all be compiled. If you specify a `-o FILENAME' + option, all the input files will be compiled together, producing a + single output file, named FILENAME. This is allowed even when using + `-S' or `-c', but not when using `-C' or `--resource'. (This is an + extension beyond the what plain `gcc' allows.) (If more than one input + file is specified, all must currently be `.java' files, though we hope + to fix this.) + +  + File: gcj.info, Node: Input Options, Next: Encodings, Prev: Input and output files, Up: Invoking gcj + + Input Options + ============= + + `gcj' has options to control where it looks to find files it needs. + For instance, `gcj' might need to load a class that is referenced by + the file it has been asked to compile. Like other compilers for the + Java language, `gcj' has a notion of a "class path". There are several + options and environment variables which can be used to manipulate the + class path. When `gcj' looks for a given class, it searches the class + path looking for matching `.class' or `.java' file. `gcj' comes with a + built-in class path which points at the installed `libgcj.jar', a file + which contains all the standard classes. + + In the below, a directory or path component can refer either to an + actual directory on the filesystem, or to a `.zip' or `.jar' file, + which `gcj' will search as if it is a directory. + + `-IDIR' + All directories specified by `-I' are kept in order and prepended + to the class path constructed from all the other options. Unless + compatibility with tools like `javac' is imported, we recommend + always using `-I' instead of the other options for manipulating the + class path. + + `--classpath=PATH' + This sets the class path to PATH, a colon-separated list of paths + (on Windows-based systems, a semicolon-separate list of paths). + This does not override the builtin ("boot") search path. + + `--CLASSPATH=PATH' + Deprecated synonym for `--classpath'. + + `--bootclasspath=PATH' + Where to find the standard builtin classes, such as + `java.lang.String'. + + `--extdirs=PATH' + For each directory in the PATH, place the contents of that + directory at the end of the class path. + + `CLASSPATH' + This is an environment variable which holds a list of paths. + + The final class path is constructed like so: + + * First come all directories specified via `-I'. + + * If `--classpath' is specified, its value is appended. Otherwise, + if the `CLASSPATH' environment variable is specified, then its + value is appended. Otherwise, the current directory (`"."') is + appended. + + * If `--bootclasspath' was specified, append its value. Otherwise, + append the built-in system directory, `libgcj.jar'. + + * Finaly, if `--extdirs' was specified, append the contents of the + specified directories at the end of the class path. Otherwise, + append the contents of the built-in extdirs at + `$(prefix)/share/java/ext'. + + The classfile built by `gcj' for the class `java.lang.Object' (and + placed in `libgcj.jar') contains a special zero length attribute + `gnu.gcj.gcj-compiled'. The compiler looks for this attribute when + loading `java.lang.Object' and will report an error if it isn't found, + unless it compiles to bytecode (the option + `-fforce-classes-archive-check' can be used to override this behavior + in this particular case.) + + `-fforce-classes-archive-check' + This forces the compiler to always check for the special zero + length attribute `gnu.gcj.gcj-compiled' in `java.lang.Object' and + issue an error if it isn't found. + +  + File: gcj.info, Node: Encodings, Next: Warnings, Prev: Input Options, Up: Invoking gcj + + Encodings + ========= + + The Java programming language uses Unicode throughout. In an effort + to integrate well with other locales, `gcj' allows `.java' files to be + written using almost any encoding. `gcj' knows how to convert these + encodings into its internal encoding at compile time. + + You can use the `--encoding=NAME' option to specify an encoding (of + a particular character set) to use for source files. If this is not + specified, the default encoding comes from your current locale. If + your host system has insufficient locale support, then `gcj' assumes + the default encoding to be the `UTF-8' encoding of Unicode. + + To implement `--encoding', `gcj' simply uses the host platform's + `iconv' conversion routine. This means that in practice `gcj' is + limited by the capabilities of the host platform. + + The names allowed for the argument `--encoding' vary from platform + to platform (since they are not standardized anywhere). However, `gcj' + implements the encoding named `UTF-8' internally, so if you choose to + use this for your source files you can be assured that it will work on + every host. + +  + File: gcj.info, Node: Warnings, Next: Code Generation, Prev: Encodings, Up: Invoking gcj + + Warnings + ======== + + `gcj' implements several warnings. As with other generic `gcc' + warnings, if an option of the form `-Wfoo' enables a warning, then + `-Wno-foo' will disable it. Here we've chosen to document the form of + the warning which will have an effect - the default being the opposite + of what is listed. + + `-Wredundant-modifiers' + With this flag, `gcj' will warn about redundant modifiers. For + instance, it will warn if an interface method is declared `public'. + + `-Wextraneous-semicolon' + This causes `gcj' to warn about empty statements. Empty statements + have been deprecated. + + `-Wno-out-of-date' + This option will cause `gcj' not to warn when a source file is + newer than its matching class file. By default `gcj' will warn + about this. + + `-Wunused' + This is the same as `gcc''s `-Wunused'. + + `-Wall' + This is the same as `-Wredundant-modifiers -Wextraneous-semicolon + -Wunused'. + diff -Nrc3pad gcc-3.2.2/gcc/java/gcj.info-2 gcc-3.2.3/gcc/java/gcj.info-2 *** gcc-3.2.2/gcc/java/gcj.info-2 Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/java/gcj.info-2 Tue Apr 22 07:07:25 2003 *************** *** 0 **** --- 1,1416 ---- + This is gcj.info, produced by makeinfo version 4.5 from gcj.texi. + + INFO-DIR-SECTION Programming + START-INFO-DIR-ENTRY + * Gcj: (gcj). Ahead-of-time compiler for the Java language + END-INFO-DIR-ENTRY + + INFO-DIR-SECTION Individual utilities + START-INFO-DIR-ENTRY + * gcjh: (gcj)Invoking gcjh. + Generate header files from Java class files + * jv-scan: (gcj)Invoking jv-scan. + Print information about Java source files + * jcf-dump: (gcj)Invoking jcf-dump. + Print information about Java class files + * gij: (gcj)Invoking gij. GNU interpreter for Java bytecode + * jv-convert: (gcj)Invoking jv-convert. + Convert file from one encoding to another + * rmic: (gcj)Invoking rmic. + Generate stubs for Remote Method Invocation. + * rmiregistry: (gcj)Invoking rmiregistry. + The remote object registry. + END-INFO-DIR-ENTRY + + Copyright (C) 2001, 2002 Free Software Foundation, Inc. + + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.1 or + any later version published by the Free Software Foundation; with the + Invariant Sections being "GNU General Public License", the Front-Cover + texts being (a) (see below), and with the Back-Cover Texts being (b) + (see below). A copy of the license is included in the section entitled + "GNU Free Documentation License". + + (a) The FSF's Front-Cover Text is: + + A GNU Manual + + (b) The FSF's Back-Cover Text is: + + You have freedom to copy and modify this GNU Manual, like GNU + software. Copies published by the Free Software Foundation raise + funds for GNU development. + +  + File: gcj.info, Node: Code Generation, Next: Configure-time Options, Prev: Warnings, Up: Invoking gcj + + Code Generation + =============== + + In addition to the many `gcc' options controlling code generation, + `gcj' has several options specific to itself. + + `--main=CLASSNAME' + This option is used when linking to specify the name of the class + whose `main' method should be invoked when the resulting + executable is run. (1) + + `-DNAME[=VALUE]' + This option can only be used with `--main'. It defines a system + property named NAME with value VALUE. If VALUE is not specified + then it defaults to the empty string. These system properties are + initialized at the program's startup and can be retrieved at + runtime using the `java.lang.System.getProperty' method. + + `-C' + This option is used to tell `gcj' to generate bytecode (`.class' + files) rather than object code. + + `--resource RESOURCE-NAME' + This option is used to tell `gcj' to compile the contents of a + given file to object code so it may be accessed at runtime with + the core protocol handler as `core:/RESOURCE-NAME'. Note that + RESOURCE-NAME is the name of the resource as found at runtime; for + instance, it could be used in a call to `ResourceBundle.getBundle'. + The actual file name to be compiled this way must be specified + separately. + + `-d DIRECTORY' + When used with `-C', this causes all generated `.class' files to + be put in the appropriate subdirectory of DIRECTORY. By default + they will be put in subdirectories of the current working + directory. + + `-fno-bounds-check' + By default, `gcj' generates code which checks the bounds of all + array indexing operations. With this option, these checks are + omitted, which can improve performance for code that uses arrays + extensively. Note that this can result in unpredictable behavior + if the code in question actually does violate array bounds + constraints. It is safe to use this option if you are sure that + your code will never throw an `ArrayIndexOutOfBoundsException'. + + `-fno-store-check' + Don't generate array store checks. When storing objects into + arrays, a runtime check is normally generated in order to ensure + that the object is assignment compatible with the component type + of the array (which may not be known at compile-time). With this + option, these checks are omitted. This can improve performance + for code which stores objects into arrays frequently. It is safe + to use this option if you are sure your code will never throw an + `ArrayStoreException'. + + `-fjni' + With `gcj' there are two options for writing native methods: CNI + and JNI. By default `gcj' assumes you are using CNI. If you are + compiling a class with native methods, and these methods are + implemented using JNI, then you must use `-fjni'. This option + causes `gcj' to generate stubs which will invoke the underlying JNI + methods. + + `-fno-optimize-static-class-initialization' + When the optimization level is greather or equal to `-O2', `gcj' + will try to optimize the way calls into the runtime are made to + initialize static classes upon their first use (this optimization + isn't carried out if `-C' was specified.) When compiling to native + code, `-fno-optimize-static-class-initialization' will turn this + optimization off, regardless of the optimization level in use. + + ---------- Footnotes ---------- + + (1) The linker by default looks for a global function named `main'. + Since Java does not have global functions, and a collection of Java + classes may have more than one class with a `main' method, you need to + let the linker know which of those `main' methods it should invoke when + starting the application. + +  + File: gcj.info, Node: Configure-time Options, Prev: Code Generation, Up: Invoking gcj + + Configure-time Options + ====================== + + Some `gcj' code generations options affect the resulting ABI, and so + can only be meaningfully given when `libgcj', the runtime package, is + configured. `libgcj' puts the appropriate options from this group into + a `spec' file which is read by `gcj'. These options are listed here + for completeness; if you are using `libgcj' then you won't want to + touch these options. + + `-fuse-boehm-gc' + This enables the use of the Boehm GC bitmap marking code. In + particular this causes `gcj' to put an object marking descriptor + into each vtable. + + `-fhash-synchronization' + By default, synchronization data (the data used for `synchronize', + `wait', and `notify') is pointed to by a word in each object. + With this option `gcj' assumes that this information is stored in a + hash table and not in the object itself. + + `-fuse-divide-subroutine' + On some systems, a library routine is called to perform integer + division. This is required to get exception handling correct when + dividing by zero. + + `-fcheck-references' + On some systems it's necessary to insert inline checks whenever + accessing an object via a reference. On other systems you won't + need this because null pointer accesses are caught automatically + by the processor. + +  + File: gcj.info, Node: Compatibility, Next: Invoking gcjh, Prev: Invoking gcj, Up: Top + + Compatibility with the Java Platform + ************************************ + + As we believe it is important that the Java platform not be + fragmented, `gcj' and `libgcj' try to conform to the relevant Java + specifications. However, limited manpower and incomplete and unclear + documentation work against us. So, there are caveats to using `gcj'. + + This list of compatibility issues is by no means complete. + + * `gcj' implements the JDK 1.1 language. It supports inner classes, + though these are known to still be buggy. It does not yet support + the Java 2 `strictfp' keyword (it recognizes the keyword but + ignores it). + + * `libgcj' is largely compatible with the JDK 1.2 libraries. + However, `libgcj' is missing many packages, most notably + `java.awt'. There are also individual missing classes and methods. + We currently do not have a list showing differences between + `libgcj' and the Java 2 platform. + + * Sometimes the `libgcj' implementation of a method or class differs + from the JDK implementation. This is not always a bug. Still, if + it affects you, it probably makes sense to report it so that we + can discuss the appropriate response. + +  + File: gcj.info, Node: Invoking gcjh, Next: Invoking jv-scan, Prev: Compatibility, Up: Top + + Invoking gcjh + ************* + + The `gcjh' program is used to generate header files from class + files. It can generate both CNI and JNI header files, as well as stub + implementation files which can be used as a basis for implementing the + required native methods. + + `-stubs' + This causes `gcjh' to generate stub files instead of header files. + By default the stub file will be named after the class, with a + suffix of `.cc'. In JNI mode, the default output file will have + the suffix `.c'. + + `-jni' + This tells `gcjh' to generate a JNI header or stub. By default, + CNI headers are generated. + + `-add TEXT' + Inserts TEXT into the class body. This is ignored in JNI mode. + + `-append TEXT' + Inserts TEXT into the header file after the class declaration. + This is ignored in JNI mode. + + `-friend TEXT' + Inserts TEXT into the class as a `friend' declaration. This is + ignored in JNI mode. + + `-prepend TEXT' + Inserts TEXT into the header file before the class declaration. + This is ignored in JNI mode. + + `--classpath=PATH' + `--CLASSPATH=PATH' + `-IDIRECTORY' + `-d DIRECTORY' + `-o FILE' + These options are all identical to the corresponding `gcj' options. + + `-o FILE' + Sets the output file name. This cannot be used if there is more + than one class on the command line. + + `-td DIRECTORY' + Sets the name of the directory to use for temporary files. + + `-M' + Print all dependencies to stdout; suppress ordinary output. + + `-MM' + Print non-system dependencies to stdout; suppress ordinary output. + + `-MD' + Print all dependencies to stdout. + + `-MMD' + Print non-system dependencies to stdout. + + `--help' + Print help about `gcjh' and exit. No further processing is done. + + `--version' + Print version information for `gcjh' and exit. No further + processing is done. + + `-v, --verbose' + Print extra information while running. + + All remaining options are considered to be names of classes. + +  + File: gcj.info, Node: Invoking jv-scan, Next: Invoking jcf-dump, Prev: Invoking gcjh, Up: Top + + Invoking jv-scan + **************** + + The `jv-scan' program can be used to print information about a Java + source file (`.java' file). + + `--complexity' + This prints a complexity measure, related to cyclomatic + complexity, for each input file. + + `--encoding=NAME' + This works like the corresponding `gcj' option. + + `--print-main' + This prints the name of the class in this file containing a `main' + method. + + `--list-class' + This lists the names of all classes defined in the input files. + + `--list-filename' + If `--list-class' is given, this option causes `jv-scan' to also + print the name of the file in which each class was found. + + `-o FILE' + Print output to the named file. + + `--help' + Print help, then exit. + + `--version' + Print version number, then exit. + +  + File: gcj.info, Node: Invoking jcf-dump, Next: Invoking gij, Prev: Invoking jv-scan, Up: Top + + Invoking jcf-dump + ***************** + + This is a class file examiner, similar to `javap'. It will print + information about a number of classes, which are specifed by class name + or file name. + + `-c' + Disassemble method bodies. By default method bodies are not + printed. + + `--javap' + Generate output in `javap' format. The implementation of this + feature is very incomplete. + + `--classpath=PATH' + `--CLASSPATH=PATH' + `-IDIRECTORY' + `-o FILE' + These options as the same as the corresponding `gcj' options. + + `--help' + Print help, then exit. + + `--version' + Print version number, then exit. + + `-v, --verbose' + Print extra information while running. + +  + File: gcj.info, Node: Invoking gij, Next: Invoking jv-convert, Prev: Invoking jcf-dump, Up: Top + + Invoking gij + ************ + + `gij' is a Java bytecode interpreter included with `libgcj'. `gij' + is not available on every platform; porting it requires a small amount + of assembly programming which has not been done for all the targets + supported by `gcj'. + + The primary argument to `gij' is the name of a class or, with + `-jar', a jar file. Options before this argument are interpreted by + `gij'; remaining options are passed to the interpreted program. + + If a class name is specified and this class does not have a `main' + method with the appropriate signature (a `static void' method with a + `String[]' as its sole argument), then `gij' will print an error and + exit. + + If a jar file is specified then `gij' will use information in it to + determine which class' `main' method will be invoked. + + `gij' will invoke the `main' method with all the remaining + command-line options. + + Note that `gij' is not limited to interpreting code. Because + `libgcj' includes a class loader which can dynamically load shared + objects, it is possible to give `gij' the name of a class which has + been compiled and put into a shared library on the class path. + + `-DNAME[=VALUE]' + This defines a system property named NAME with value VALUE. If + VALUE is not specified then it defaults to the empty string. + These system properties are initialized at the program's startup + and can be retrieved at runtime using the + `java.lang.System.getProperty' method. + + `-ms=NUMBER' + This sets the initial heap size. + + `-mx=NUMBER' + This sets the maximum heap size. + + `-jar' + This indicates that the name passed to `gij' should be interpreted + as the name of a jar file, not a class. + + `--help' + Print help, then exit. + + `--version' + Print version number, then exit. + +  + File: gcj.info, Node: Invoking jv-convert, Next: Invoking rmic, Prev: Invoking gij, Up: Top + + Invoking jv-convert + ******************* + + `jv-convert' [`OPTION'] ... [INPUTFILE [OUTPUTFILE]] + + `jv-convert' is a utility included with `libgcj' which converts a + file from one encoding to another. It is similar to the Unix `iconv' + utility. + + The encodings supported by `jv-convert' are platform-dependent. + Currently there is no way to get a list of all supported encodings. + + `--encoding NAME' + `--from NAME' + Use NAME as the input encoding. The default is the current + locale's encoding. + + `--to NAME' + Use NAME as the output encoding. The default is the `JavaSrc' + encoding; this is ASCII with `\u' escapes for non-ASCII characters. + + `-i FILE' + Read from FILE. The default is to read from standard input. + + `-o FILE' + Write to FILE. The default is to write to standard output. + + `--reverse' + Swap the input and output encodings. + + `--help' + Print a help message, then exit. + + `--version' + Print version information, then exit. + +  + File: gcj.info, Node: Invoking rmic, Next: Invoking rmiregistry, Prev: Invoking jv-convert, Up: Top + + Invoking rmic + ************* + + `rmic' [`OPTION'] ... CLASS ... + + `rmic' is a utility included with `libgcj' which generates stubs for + remote objects. + + Note that this program isn't yet fully compatible with the JDK + `rmic'. Some options, such as `-classpath', are recognized but + currently ignored. We have left these options undocumented for now. + + Long options can also be given with a GNU-style leading `--'. For + instance, `--help' is accepted. + + `-keep' + `-keepgenerated' + By default, `rmic' deletes intermediate files. Either of these + options causes it not to delete such files. + + `-v1.1' + Cause `rmic' to create stubs and skeletons for the 1.1 protocol + version. + + `-vcompat' + Cause `rmic' to create stubs and skeletons compatible with both + the 1.1 and 1.2 protocol versions. This is the default. + + `-v1.2' + Cause `rmic' to create stubs and skeletons for the 1.2 protocol + version. + + `-nocompile' + Don't compile the generated files. + + `-verbose' + Print information about what `rmic' is doing. + + `-d DIRECTORY' + Put output files in DIRECTORY. By default the files are put in + the current working directory. + + `-help' + Print a help message, then exit. + + `-version' + Print version information, then exit. + +  + File: gcj.info, Node: Invoking rmiregistry, Next: About CNI, Prev: Invoking rmic, Up: Top + + Invoking rmiregistry + ******************** + + `rmiregistry' [`OPTION'] ... [PORT] + + `rmiregistry' starts a remote object registry on the current host. + If no port number is specified, then port 1099 is used. + + `--help' + Print a help message, then exit. + + `--version' + Print version information, then exit. + +  + File: gcj.info, Node: About CNI, Next: Resources, Prev: Invoking rmiregistry, Up: Top + + About CNI + ********* + + This documents CNI, the Cygnus Native Interface, which is is a + convenient way to write Java native methods using C++. This is a more + efficient, more convenient, but less portable alternative to the + standard JNI (Java Native Interface). + + * Menu: + + * Basic concepts:: Introduction to using CNI. + * Packages:: How packages are mapped to C++. + * Primitive types:: Handling Java types in C++. + * Interfaces:: How Java interfaces map to C++. + * Objects and Classes:: C++ and Java classes. + * Class Initialization:: How objects are initialized. + * Object allocation:: How to create Java objects in C++. + * Arrays:: Dealing with Java arrays in C++. + * Methods:: Java methods in C++. + * Strings:: Information about Java Strings. + * Mixing with C++:: How CNI can interoperate with C++. + * Exception Handling:: How exceptions are handled. + * Synchronization:: Synchronizing between Java and C++. + * Invocation:: Starting the Java runtime from C++. + * Reflection:: Using reflection from C++. + +  + File: gcj.info, Node: Basic concepts, Next: Packages, Up: About CNI + + Basic concepts + ============== + + In terms of languages features, Java is mostly a subset of C++. + Java has a few important extensions, plus a powerful standard class + library, but on the whole that does not change the basic similarity. + Java is a hybrid object-oriented language, with a few native types, in + addition to class types. It is class-based, where a class may have + static as well as per-object fields, and static as well as instance + methods. Non-static methods may be virtual, and may be overloaded. + Overloading is resolved at compile time by matching the actual argument + types against the parameter types. Virtual methods are implemented + using indirect calls through a dispatch table (virtual function table). + Objects are allocated on the heap, and initialized using a constructor + method. Classes are organized in a package hierarchy. + + All of the listed attributes are also true of C++, though C++ has + extra features (for example in C++ objects may be allocated not just on + the heap, but also statically or in a local stack frame). Because + `gcj' uses the same compiler technology as G++ (the GNU C++ compiler), + it is possible to make the intersection of the two languages use the + same ABI (object representation and calling conventions). The key idea + in CNI is that Java objects are C++ objects, and all Java classes are + C++ classes (but not the other way around). So the most important task + in integrating Java and C++ is to remove gratuitous incompatibilities. + + You write CNI code as a regular C++ source file. (You do have to use + a Java/CNI-aware C++ compiler, specifically a recent version of G++.) + + A CNI C++ source file must have: + + #include + + and then must include one header file for each Java class it uses, e.g.: + + #include + #include + #include + + These header files are automatically generated by `gcjh'. + + CNI provides some functions and macros to make using Java objects and + primitive types from C++ easier. In general, these CNI functions and + macros start with the `Jv' prefix, for example the function + `JvNewObjectArray'. This convention is used to avoid conflicts with + other libraries. Internal functions in CNI start with the prefix + `_Jv_'. You should not call these; if you find a need to, let us know + and we will try to come up with an alternate solution. (This manual + lists `_Jv_AllocBytes' as an example; CNI should instead provide a + `JvAllocBytes' function.) + + Limitations + ----------- + + Whilst a Java class is just a C++ class that doesn't mean that you + are freed from the shackles of Java, a CNI C++ class must adhere to the + rules of the Java programming language. + + For example: it is not possible to declare a method in a CNI class + that will take a C string (`char*') as an argument, or to declare a + member variable of some non-Java datatype. + +  + File: gcj.info, Node: Packages, Next: Primitive types, Prev: Basic concepts, Up: About CNI + + Packages + ======== + + The only global names in Java are class names, and packages. A + "package" can contain zero or more classes, and also zero or more + sub-packages. Every class belongs to either an unnamed package or a + package that has a hierarchical and globally unique name. + + A Java package is mapped to a C++ "namespace". The Java class + `java.lang.String' is in the package `java.lang', which is a + sub-package of `java'. The C++ equivalent is the class + `java::lang::String', which is in the namespace `java::lang' which is + in the namespace `java'. + + Here is how you could express this: + + (// Declare the class(es), possibly in a header file: + namespace java { + namespace lang { + class Object; + class String; + ... + } + } + + class java::lang::String : public java::lang::Object + { + ... + }; + + The `gcjh' tool automatically generates the nessary namespace + declarations. + + Leaving out package names + ------------------------- + + Always using the fully-qualified name of a java class can be + tiresomely verbose. Using the full qualified name also ties the code + to a single package making code changes necessary should the class move + from one package to another. The Java `package' declaration specifies + that the following class declarations are in the named package, without + having to explicitly name the full package qualifiers. The `package' + declaration can be followed by zero or more `import' declarations, which + allows either a single class or all the classes in a package to be + named by a simple identifier. C++ provides something similar with the + `using' declaration and directive. + + In Java: + + import PACKAGE-NAME.CLASS-NAME; + + allows the program text to refer to CLASS-NAME as a shorthand for the + fully qualified name: `PACKAGE-NAME.CLASS-NAME'. + + To achieve the same effect C++, you have to do this: + + using PACKAGE-NAME::CLASS-NAME; + + Java can also cause imports on demand, like this: + + import PACKAGE-NAME.*; + + Doing this allows any class from the package PACKAGE-NAME to be refered + to only by its class-name within the program text. + + The same effect can be achieved in C++ like this: + + using namespace PACKAGE-NAME; + +  + File: gcj.info, Node: Primitive types, Next: Interfaces, Prev: Packages, Up: About CNI + + Primitive types + =============== + + Java provides 8 "primitives" types which represent integers, floats, + characters and booleans (and also the void type). C++ has its own very + similar concrete types. Such types in C++ however are not always + implemented in the same way (an int might be 16, 32 or 64 bits for + example) so CNI provides a special C++ type for each primitive Java + type: + + *Java type* *C/C++ typename* *Description* + `char' `jchar' 16 bit Unicode character + `boolean' `jboolean' logical (true or false) values + `byte' `jbyte' 8-bit signed integer + `short' `jshort' 16 bit signed integer + `int' `jint' 32 bit signed integer + `long' `jlong' 64 bit signed integer + `float' `jfloat' 32 bit IEEE floating point number + `double' `jdouble' 64 bit IEEE floating point number + `void' `void' no value + + When refering to a Java type You should always use these C++ + typenames (e.g.: `jint') to avoid disappointment. + + Reference types associated with primitive types + ----------------------------------------------- + + In Java each primitive type has an associated reference type, e.g.: + `boolean' has an associated `java.lang.Boolean' class. In order to + make working with such classes easier GCJ provides the macro + `JvPrimClass': + + - macro: JvPrimClass type + Return a pointer to the `Class' object corresponding to the type + supplied. + + JvPrimClass(void) => java.lang.Void.TYPE + + +  + File: gcj.info, Node: Interfaces, Next: Objects and Classes, Prev: Primitive types, Up: About CNI + + Interfaces + ========== + + A Java class can "implement" zero or more "interfaces", in addition + to inheriting from a single base class. + + CNI allows CNI code to implement methods of interfaces. You can + also call methods through interface references, with some limitations. + + CNI doesn't understand interface inheritance at all yet. So, you + can only call an interface method when the declared type of the field + being called matches the interface which declares that method. The + workaround is to cast the interface reference to the right + superinterface. + + For example if you have: + + interface A + { + void a(); + } + + interface B extends A + { + void b(); + } + + and declare a variable of type `B' in C++, you can't call `a()' + unless you cast it to an `A' first. + +  + File: gcj.info, Node: Objects and Classes, Next: Class Initialization, Prev: Interfaces, Up: About CNI + + Objects and Classes + =================== + + Classes + ------- + + All Java classes are derived from `java.lang.Object'. C++ does not + have a unique root class, but we use the C++ class `java::lang::Object' + as the C++ version of the `java.lang.Object' Java class. All other + Java classes are mapped into corresponding C++ classes derived from + `java::lang::Object'. + + Interface inheritance (the `implements' keyword) is currently not + reflected in the C++ mapping. + + Object fields + ------------- + + Each object contains an object header, followed by the instance + fields of the class, in order. The object header consists of a single + pointer to a dispatch or virtual function table. (There may be extra + fields _in front of_ the object, for example for memory management, but + this is invisible to the application, and the reference to the object + points to the dispatch table pointer.) + + The fields are laid out in the same order, alignment, and size as in + C++. Specifically, 8-bite and 16-bit native types (`byte', `short', + `char', and `boolean') are _not_ widened to 32 bits. Note that the + Java VM does extend 8-bit and 16-bit types to 32 bits when on the VM + stack or temporary registers. + + If you include the `gcjh'-generated header for a class, you can + access fields of Java classes in the _natural_ way. For example, given + the following Java class: + + public class Int + { + public int i; + public Integer (int i) { this.i = i; } + public static zero = new Integer(0); + } + + you can write: + + #include ; + #include ; + + Int* + mult (Int *p, jint k) + { + if (k == 0) + return Int::zero; // Static member access. + return new Int(p->i * k); + } + + Access specifiers + ----------------- + + CNI does not strictly enforce the Java access specifiers, because + Java permissions cannot be directly mapped into C++ permission. + Private Java fields and methods are mapped to private C++ fields and + methods, but other fields and methods are mapped to public fields and + methods. + +  + File: gcj.info, Node: Class Initialization, Next: Object allocation, Prev: Objects and Classes, Up: About CNI + + Class Initialization + ==================== + + Java requires that each class be automatically initialized at the + time of the first active use. Initializing a class involves + initializing the static fields, running code in class initializer + methods, and initializing base classes. There may also be some + implementation specific actions, such as allocating `String' objects + corresponding to string literals in the code. + + The GCJ compiler inserts calls to `JvInitClass' at appropriate + places to ensure that a class is initialized when required. The C++ + compiler does not insert these calls automatically--it is the + programmer's responsibility to make sure classes are initialized. + However, this is fairly painless because of the conventions assumed by + the Java system. + + First, `libgcj' will make sure a class is initialized before an + instance of that object is created. This is one of the + responsibilities of the `new' operation. This is taken care of both in + Java code, and in C++ code. (When the G++ compiler sees a `new' of a + Java class, it will call a routine in `libgcj' to allocate the object, + and that routine will take care of initializing the class.) It follows + that you can access an instance field, or call an instance (non-static) + method and be safe in the knowledge that the class and all of its base + classes have been initialized. + + Invoking a static method is also safe. This is because the Java + compiler adds code to the start of a static method to make sure the + class is initialized. However, the C++ compiler does not add this + extra code. Hence, if you write a native static method using CNI, you + are responsible for calling `JvInitClass' before doing anything else in + the method (unless you are sure it is safe to leave it out). + + Accessing a static field also requires the class of the field to be + initialized. The Java compiler will generate code to call + `Jv_InitClass' before getting or setting the field. However, the C++ + compiler will not generate this extra code, so it is your + responsibility to make sure the class is initialized before you access + a static field from C++. + +  + File: gcj.info, Node: Object allocation, Next: Arrays, Prev: Class Initialization, Up: About CNI + + Object allocation + ================= + + New Java objects are allocated using a "class instance creation + expression", e.g.: + + new TYPE ( ... ) + + The same syntax is used in C++. The main difference is that C++ + objects have to be explicitly deleted; in Java they are automatically + deleted by the garbage collector. Using CNI, you can allocate a new + Java object using standard C++ syntax and the C++ compiler will allocate + memory from the garbage collector. If you have overloaded + constructors, the compiler will choose the correct one using standard + C++ overload resolution rules. + + For example: + + java::util::Hashtable *ht = new java::util::Hashtable(120); + + - Function: void* _Jv_AllocBytes (jsize SIZE) + Allocates SIZE bytes from the heap. The memory is not scanned by + the garbage collector but it freed if no references to it are + discovered. + +  + File: gcj.info, Node: Arrays, Next: Methods, Prev: Object allocation, Up: About CNI + + Arrays + ====== + + While in many ways Java is similar to C and C++, it is quite + different in its treatment of arrays. C arrays are based on the idea + of pointer arithmetic, which would be incompatible with Java's security + requirements. Java arrays are true objects (array types inherit from + `java.lang.Object'). An array-valued variable is one that contains a + reference (pointer) to an array object. + + Referencing a Java array in C++ code is done using the `JArray' + template, which as defined as follows: + + class __JArray : public java::lang::Object + { + public: + int length; + }; + + template + class JArray : public __JArray + { + T data[0]; + public: + T& operator[](jint i) { return data[i]; } + }; + + There are a number of `typedef's which correspond to `typedef's from + the JNI. Each is the type of an array holding objects of the relevant + type: + + typedef __JArray *jarray; + typedef JArray *jobjectArray; + typedef JArray *jbooleanArray; + typedef JArray *jbyteArray; + typedef JArray *jcharArray; + typedef JArray *jshortArray; + typedef JArray *jintArray; + typedef JArray *jlongArray; + typedef JArray *jfloatArray; + typedef JArray *jdoubleArray; + + - Method on template: T* elements (JArray ARRAY) + This template function can be used to get a pointer to the + elements of the `array'. For instance, you can fetch a pointer to + the integers that make up an `int[]' like so: + + extern jintArray foo; + jint *intp = elements (foo); + + The name of this function may change in the future. + + - Function: jobjectArray JvNewObjectArray (jsize LENGTH, jclass KLASS, + jobject INIT) + Here `klass' is the type of elements of the array and `init' is + the initial value put into every slot in the array. + + Creating arrays + --------------- + + For each primitive type there is a function which can be used to + create a new array of that type. The name of the function is of the + form: + + JvNewTYPEArray + + For example: + + JvNewBooleanArray + + can be used to create an array of Java primitive boolean types. + + The following function definition is the template for all such + functions: + + - Function: jbooleanArray JvNewBooleanArray (jint LENGTH) + Create's an array LENGTH indices long. + + - Function: jsize JvGetArrayLength (jarray ARRAY) + Returns the length of the ARRAY. + +  + File: gcj.info, Node: Methods, Next: Strings, Prev: Arrays, Up: About CNI + + Methods + ======= + + Java methods are mapped directly into C++ methods. The header files + generated by `gcjh' include the appropriate method definitions. + Basically, the generated methods have the same names and + _corresponding_ types as the Java methods, and are called in the + natural manner. + + Overloading + ----------- + + Both Java and C++ provide method overloading, where multiple methods + in a class have the same name, and the correct one is chosen (at + compile time) depending on the argument types. The rules for choosing + the correct method are (as expected) more complicated in C++ than in + Java, but given a set of overloaded methods generated by `gcjh' the C++ + compiler will choose the expected one. + + Common assemblers and linkers are not aware of C++ overloading, so + the standard implementation strategy is to encode the parameter types + of a method into its assembly-level name. This encoding is called + "mangling", and the encoded name is the "mangled name". The same + mechanism is used to implement Java overloading. For C++/Java + interoperability, it is important that both the Java and C++ compilers + use the _same_ encoding scheme. + + Static methods + -------------- + + Static Java methods are invoked in CNI using the standard C++ + syntax, using the `::' operator rather than the `.' operator. + + For example: + + jint i = java::lang::Math::round((jfloat) 2.3); + + C++ method definition syntax is used to define a static native method. + For example: + + #include + java::lang::Integer* + java::lang::Integer::getInteger(jstring str) + { + ... + } + + Object Constructors + ------------------- + + Constructors are called implicitly as part of object allocation + using the `new' operator. + + For example: + + java::lang::Integer *x = new java::lang::Integer(234); + + Java does not allow a constructor to be a native method. This + limitation can be coded round however because a constructor can _call_ + a native method. + + Instance methods + ---------------- + + Calling a Java instance method from a C++ CNI method is done using + the standard C++ syntax, e.g.: + + // First create the Java object. + java::lang::Integer *x = new java::lang::Integer(234); + // Now call a method. + jint prim_value = x->intValue(); + if (x->longValue == 0) + ... + + Defining a Java native instance method is also done the natural way: + + #include + + jdouble + java::lang:Integer::doubleValue() + { + return (jdouble) value; + } + + Interface methods + ----------------- + + In Java you can call a method using an interface reference. This is + supported, but not completly. *Note Interfaces::. + +  + File: gcj.info, Node: Strings, Next: Mixing with C++, Prev: Methods, Up: About CNI + + Strings + ======= + + CNI provides a number of utility functions for working with Java + Java `String' objects. The names and interfaces are analogous to those + of JNI. + + - Function: jstring JvNewString (const char* CHARS, jsize LEN) + Returns a Java `String' object with characters from the C string + CHARS up to the index LEN in that array. + + - Function: jstring JvNewStringLatin1 (const char* BYTES, jsize LEN) + Returns a Java `String' made up of LEN bytes from BYTES. + + - Function: jstring JvNewStringLatin1 (const char* BYTES) + As above but the length of the `String' is `strlen(BYTES)'. + + - Function: jstring JvNewStringUTF (const char* BYTES) + Returns a `String' which is made up of the UTF encoded characters + present in the C string BYTES. + + - Function: jchar* JvGetStringChars (jstring STR) + Returns a pointer to an array of characters making up the `String' + STR. + + - Function: int JvGetStringUTFLength (jstring STR) + Returns the number of bytes required to encode the contents of the + `String' STR in UTF-8. + + - Function: jsize JvGetStringUTFRegion (jstring STR, jsize START, + jsize LEN, char* BUF) + Puts the UTF-8 encoding of a region of the `String' STR into the + buffer `buf'. The region to fetch is marked by START and LEN. + + Note that BUF is a buffer, not a C string. It is _not_ null + terminated. + +  + File: gcj.info, Node: Mixing with C++, Next: Exception Handling, Prev: Strings, Up: About CNI + + Interoperating with C/C++ + ========================= + + Because CNI is designed to represent Java classes and methods it + cannot be mixed readily with C/C++ types. + + One important restriction is that Java classes cannot have non-Java + type instance or static variables and cannot have methods which take + non-Java types as arguments or return non-Java types. + + None of the following is possible with CNI: + + + class ::MyClass : public java::lang::Object + { + char* variable; // char* is not a valid Java type. + } + + + uint + ::SomeClass::someMethod (char *arg) + { + . + . + . + } // `uint' is not a valid Java type, neither is `char*' + + Of course, it is ok to use C/C++ types within the scope of a method: + + jint + ::SomeClass::otherMethod (jstring str) + { + char *arg = ... + . + . + . + } + + But this restriction can cause a problem so CNI includes the + `gnu.gcj.RawData' class. The `RawData' class is a "non-scanned + reference" type. In other words variables declared of type `RawData' + can contain any data and are not checked by the compiler in any way. + + This means that you can put C/C++ data structures (including classes) + in your CNI classes, as long as you use the appropriate cast. + + Here are some examples: + + + class ::MyClass : public java::lang::Object + { + gnu.gcj.RawData string; + + MyClass (); + gnu.gcj.RawData getText (); + void printText (); + } + + ::MyClass::MyClass () + { + char* text = ... + string = text; + } + + gnu.gcj.RawData + ::MyClass::getText () + { + return string; + } + + void + ::MyClass::printText () + { + printf("%s\n", (char*) string); + } + +  + File: gcj.info, Node: Exception Handling, Next: Synchronization, Prev: Mixing with C++, Up: About CNI + + Exception Handling + ================== + + While C++ and Java share a common exception handling framework, + things are not yet perfectly integrated. The main issue is that the + run-time type information facilities of the two languages are not + integrated. + + Still, things work fairly well. You can throw a Java exception from + C++ using the ordinary `throw' construct, and this exception can be + caught by Java code. Similarly, you can catch an exception thrown from + Java using the C++ `catch' construct. + + Here is an example: + + if (i >= count) + throw new java::lang::IndexOutOfBoundsException(); + + Normally, G++ will automatically detect when you are writing C++ + code that uses Java exceptions, and handle them appropriately. + However, if C++ code only needs to execute destructors when Java + exceptions are thrown through it, GCC will guess incorrectly. Sample + problematic code: + + struct S { ~S(); }; + + extern void bar(); // Is implemented in Java and may throw exceptions. + + void foo() + { + S s; + bar(); + } + + The usual effect of an incorrect guess is a link failure, + complaining of a missing routine called `__gxx_personality_v0'. + + You can inform the compiler that Java exceptions are to be used in a + translation unit, irrespective of what it might think, by writing + `#pragma GCC java_exceptions' at the head of the file. This `#pragma' + must appear before any functions that throw or catch exceptions, or run + destructors when exceptions are thrown through them. + +  + File: gcj.info, Node: Synchronization, Next: Invocation, Prev: Exception Handling, Up: About CNI + + Synchronization + =============== + + Each Java object has an implicit monitor. The Java VM uses the + instruction `monitorenter' to acquire and lock a monitor, and + `monitorexit' to release it. + + The corresponding CNI macros are `JvMonitorEnter' and + `JvMonitorExit' (JNI has similar methods `MonitorEnter' and + `MonitorExit'). + + The Java source language does not provide direct access to these + primitives. Instead, there is a `synchronized' statement that does an + implicit `monitorenter' before entry to the block, and does a + `monitorexit' on exit from the block. Note that the lock has to be + released even when the block is abnormally terminated by an exception, + which means there is an implicit `try finally' surrounding + synchronization locks. + + From C++, it makes sense to use a destructor to release a lock. CNI + defines the following utility class: + + class JvSynchronize() { + jobject obj; + JvSynchronize(jobject o) { obj = o; JvMonitorEnter(o); } + ~JvSynchronize() { JvMonitorExit(obj); } + }; + + So this Java code: + + synchronized (OBJ) + { + CODE + } + + might become this C++ code: + + { + JvSynchronize dummy (OBJ); + CODE; + } + + Java also has methods with the `synchronized' attribute. This is + equivalent to wrapping the entire method body in a `synchronized' + statement. (Alternatively, an implementation could require the caller + to do the synchronization. This is not practical for a compiler, + because each virtual method call would have to test at run-time if + synchronization is needed.) Since in `gcj' the `synchronized' + attribute is handled by the method implementation, it is up to the + programmer of a synchronized native method to handle the synchronization + (in the C++ implementation of the method). In otherwords, you need to + manually add `JvSynchronize' in a `native synchornized' method. + +  + File: gcj.info, Node: Invocation, Next: Reflection, Prev: Synchronization, Up: About CNI + + Invocation + ========== + + CNI permits C++ applications to make calls into Java classes, in + addition to allowing Java code to call into C++. Several functions, + known as the "invocation API", are provided to support this. + + - Function: jint JvCreateJavaVM (void* VM_ARGS) + Initializes the Java runtime. This function performs essential + initialization of the threads interface, garbage collector, + exception handling and other key aspects of the runtime. It must + be called once by an application with a non-Java `main()' + function, before any other Java or CNI calls are made. It is + safe, but not recommended, to call `JvCreateJavaVM()' more than + once provided it is only called from a single thread. The VMARGS + parameter can be used to specify initialization parameters for the + Java runtime. It may be `NULL'. This function returns `0' upon + success, or `-1' if the runtime is already initialized. + + _Note:_ In GCJ 3.1, the `vm_args' parameter is ignored. It may be + used in a future release. + + - Function: java::lang::Thread* JvAttachCurrentThread (jstring NAME, + java::lang::ThreadGroup* GROUP) + Registers an existing thread with the Java runtime. This must be + called once from each thread, before that thread makes any other + Java or CNI calls. It must be called after `JvCreateJavaVM'. NAME + specifies a name for the thread. It may be `NULL', in which case a + name will be generated. GROUP is the ThreadGroup in which this + thread will be a member. If it is `NULL', the thread will be a + member of the main thread group. The return value is the Java + `Thread' object that represents the thread. It is safe to call + `JvAttachCurrentThread()' more than once from the same thread. If + the thread is already attached, the call is ignored and the current + thread object is returned. + + - Function: jint JvDetachCurrentThread () + Unregisters a thread from the Java runtime. This should be called + by threads that were attached using `JvAttachCurrentThread()', + after they have finished making calls to Java code. This ensures + that any resources associated with the thread become eligible for + garbage collection. This function returns `0' upon success, or + `-1' if the current thread is not attached. + + Handling uncaught exceptions + ---------------------------- + + If an exception is thrown from Java code called using the invocation + API, and no handler for the exception can be found, the runtime will + abort the application. In order to make the application more robust, it + is recommended that code which uses the invocation API be wrapped by a + top-level try/catch block that catches all Java exceptions. + + Example + ------- + + The following code demonstrates the use of the invocation API. In + this example, the C++ application initializes the Java runtime and + attaches itself. The `java.lang.System' class is initialized in order to + access its `out' field, and a Java string is printed. Finally, the + thread is detached from the runtime once it has finished making Java + calls. Everything is wrapped with a try/catch block to provide a + default handler for any uncaught exceptions. + + The example can be compiled with `c++ test.cc -lgcj'. + + // test.cc + #include + #include + #include + #include + + int main(int argc, char *argv) + { + using namespace java::lang; + + try + { + JvCreateJavaVM(NULL); + JvAttachCurrentThread(NULL, NULL); + + String *message = JvNewStringLatin1("Hello from C++"); + JvInitClass(&System.class$); + System::out->println(message); + + JvDetachCurrentThread(); + } + catch (Throwable *t) + { + System::err->println(JvNewStringLatin1("Unhandled Java exception:")); + t->printStackTrace(); + } + } + +  + File: gcj.info, Node: Reflection, Prev: Invocation, Up: About CNI + + Reflection + ========== + + Reflection is possible with CNI code, it functions similarly to how + it functions with JNI. + + The types `jfieldID' and `jmethodID' are as in JNI. + + The functions: + + * `JvFromReflectedField', + + * `JvFromReflectedMethod', + + * `JvToReflectedField' + + * `JvToFromReflectedMethod' + + will be added shortly, as will other functions corresponding to JNI. + +  + File: gcj.info, Node: Resources, Prev: About CNI, Up: Top + + Resources + ********* + + While writing `gcj' and `libgcj' we have, of course, relied heavily + on documentation from Sun Microsystems. In particular we have used The + Java Language Specification (both first and second editions), the Java + Class Libraries (volumes one and two), and the Java Virtual Machine + Specification. In addition we've used the online documentation at + `http://java.sun.com/'. + + The current `gcj' home page is `http://gcc.gnu.org/java/'. + + For more information on gcc, see `http://gcc.gnu.org/'. + + Some `libgcj' testing is done using the Mauve test suite. This is a + free software Java class library test suite which is being written + because the JCK is not free. See `http://sources.redhat.com/mauve/' + for more information. + + diff -Nrc3pad gcc-3.2.2/gcc/java/gcj.texi gcc-3.2.3/gcc/java/gcj.texi *** gcc-3.2.2/gcc/java/gcj.texi Fri Nov 22 17:54:01 2002 --- gcc-3.2.3/gcc/java/gcj.texi Wed Feb 5 05:09:15 2003 *************** *** 11,17 **** @set copyrights-gcj 2001, 2002 @c Versions ! @set version-gcc 3.2.2 @set which-gcj GCC-@value{version-gcc} @macro gcctabopt{body} --- 11,17 ---- @set copyrights-gcj 2001, 2002 @c Versions ! @set version-gcc 3.2.3 @set which-gcj GCC-@value{version-gcc} @macro gcctabopt{body} diff -Nrc3pad gcc-3.2.2/gcc/java/gcjh.1 gcc-3.2.3/gcc/java/gcjh.1 *** gcc-3.2.2/gcc/java/gcjh.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/java/gcjh.1 Tue Apr 22 07:07:37 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:00 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:36 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "GCJH 1" ! .TH GCJH 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gcjh \- generate header files from Java class files --- 138,144 ---- .\" ====================================================================== .\" .IX Title "GCJH 1" ! .TH GCJH 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gcjh \- generate header files from Java class files diff -Nrc3pad gcc-3.2.2/gcc/java/gij.1 gcc-3.2.3/gcc/java/gij.1 *** gcc-3.2.2/gcc/java/gij.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/java/gij.1 Tue Apr 22 07:07:38 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:00 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:38 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "GIJ 1" ! .TH GIJ 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" gij \- \s-1GNU\s0 interpreter for Java bytecode --- 138,144 ---- .\" ====================================================================== .\" .IX Title "GIJ 1" ! .TH GIJ 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" gij \- \s-1GNU\s0 interpreter for Java bytecode diff -Nrc3pad gcc-3.2.2/gcc/java/jcf-dump.1 gcc-3.2.3/gcc/java/jcf-dump.1 *** gcc-3.2.2/gcc/java/jcf-dump.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/java/jcf-dump.1 Tue Apr 22 07:07:37 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:00 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:37 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "JCF-DUMP 1" ! .TH JCF-DUMP 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" jcf-dump \- print information about Java class files --- 138,144 ---- .\" ====================================================================== .\" .IX Title "JCF-DUMP 1" ! .TH JCF-DUMP 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" jcf-dump \- print information about Java class files diff -Nrc3pad gcc-3.2.2/gcc/java/jv-convert.1 gcc-3.2.3/gcc/java/jv-convert.1 *** gcc-3.2.2/gcc/java/jv-convert.1 Wed Feb 5 03:14:01 2003 --- gcc-3.2.3/gcc/java/jv-convert.1 Tue Apr 22 07:07:38 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:01 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:38 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "JV-CONVERT 1" ! .TH JV-CONVERT 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" jv-convert \- Convert file from one encoding to another --- 138,144 ---- .\" ====================================================================== .\" .IX Title "JV-CONVERT 1" ! .TH JV-CONVERT 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" jv-convert \- Convert file from one encoding to another diff -Nrc3pad gcc-3.2.2/gcc/java/jv-scan.1 gcc-3.2.3/gcc/java/jv-scan.1 *** gcc-3.2.2/gcc/java/jv-scan.1 Wed Feb 5 03:14:00 2003 --- gcc-3.2.3/gcc/java/jv-scan.1 Tue Apr 22 07:07:37 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:00 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:37 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "JV-SCAN 1" ! .TH JV-SCAN 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" jv-scan \- print information about Java source file --- 138,144 ---- .\" ====================================================================== .\" .IX Title "JV-SCAN 1" ! .TH JV-SCAN 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" jv-scan \- print information about Java source file diff -Nrc3pad gcc-3.2.2/gcc/java/parse-scan.c gcc-3.2.3/gcc/java/parse-scan.c *** gcc-3.2.2/gcc/java/parse-scan.c Wed Feb 5 03:22:12 2003 --- gcc-3.2.3/gcc/java/parse-scan.c Tue Apr 22 08:18:55 2003 *************** *** 1,118 **** ! /* A Bison parser, made from /home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y ! by GNU bison 1.33. */ ! #define YYBISON 1 /* Identify Bison output. */ - # define PLUS_TK 257 - # define MINUS_TK 258 - # define MULT_TK 259 - # define DIV_TK 260 - # define REM_TK 261 - # define LS_TK 262 - # define SRS_TK 263 - # define ZRS_TK 264 - # define AND_TK 265 - # define XOR_TK 266 - # define OR_TK 267 - # define BOOL_AND_TK 268 - # define BOOL_OR_TK 269 - # define EQ_TK 270 - # define NEQ_TK 271 - # define GT_TK 272 - # define GTE_TK 273 - # define LT_TK 274 - # define LTE_TK 275 - # define PLUS_ASSIGN_TK 276 - # define MINUS_ASSIGN_TK 277 - # define MULT_ASSIGN_TK 278 - # define DIV_ASSIGN_TK 279 - # define REM_ASSIGN_TK 280 - # define LS_ASSIGN_TK 281 - # define SRS_ASSIGN_TK 282 - # define ZRS_ASSIGN_TK 283 - # define AND_ASSIGN_TK 284 - # define XOR_ASSIGN_TK 285 - # define OR_ASSIGN_TK 286 - # define PUBLIC_TK 287 - # define PRIVATE_TK 288 - # define PROTECTED_TK 289 - # define STATIC_TK 290 - # define FINAL_TK 291 - # define SYNCHRONIZED_TK 292 - # define VOLATILE_TK 293 - # define TRANSIENT_TK 294 - # define NATIVE_TK 295 - # define PAD_TK 296 - # define ABSTRACT_TK 297 - # define MODIFIER_TK 298 - # define STRICT_TK 299 - # define DECR_TK 300 - # define INCR_TK 301 - # define DEFAULT_TK 302 - # define IF_TK 303 - # define THROW_TK 304 - # define BOOLEAN_TK 305 - # define DO_TK 306 - # define IMPLEMENTS_TK 307 - # define THROWS_TK 308 - # define BREAK_TK 309 - # define IMPORT_TK 310 - # define ELSE_TK 311 - # define INSTANCEOF_TK 312 - # define RETURN_TK 313 - # define VOID_TK 314 - # define CATCH_TK 315 - # define INTERFACE_TK 316 - # define CASE_TK 317 - # define EXTENDS_TK 318 - # define FINALLY_TK 319 - # define SUPER_TK 320 - # define WHILE_TK 321 - # define CLASS_TK 322 - # define SWITCH_TK 323 - # define CONST_TK 324 - # define TRY_TK 325 - # define FOR_TK 326 - # define NEW_TK 327 - # define CONTINUE_TK 328 - # define GOTO_TK 329 - # define PACKAGE_TK 330 - # define THIS_TK 331 - # define BYTE_TK 332 - # define SHORT_TK 333 - # define INT_TK 334 - # define LONG_TK 335 - # define CHAR_TK 336 - # define INTEGRAL_TK 337 - # define FLOAT_TK 338 - # define DOUBLE_TK 339 - # define FP_TK 340 - # define ID_TK 341 - # define REL_QM_TK 342 - # define REL_CL_TK 343 - # define NOT_TK 344 - # define NEG_TK 345 - # define ASSIGN_ANY_TK 346 - # define ASSIGN_TK 347 - # define OP_TK 348 - # define CP_TK 349 - # define OCB_TK 350 - # define CCB_TK 351 - # define OSB_TK 352 - # define CSB_TK 353 - # define SC_TK 354 - # define C_TK 355 - # define DOT_TK 356 - # define STRING_LIT_TK 357 - # define CHAR_LIT_TK 358 - # define INT_LIT_TK 359 - # define FP_LIT_TK 360 - # define TRUE_TK 361 - # define FALSE_TK 362 - # define BOOL_LIT_TK 363 - # define NULL_TK 364 ! #line 37 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" #define JC1_LITE --- 1,282 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 ! ! /* Skeleton name. */ ! #define YYSKELETON_NAME "yacc.c" ! ! /* Pure parsers. */ ! #define YYPURE 1 ! ! /* Using locations. */ ! #define YYLSP_NEEDED 0 ! ! ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! PLUS_TK = 258, ! MINUS_TK = 259, ! MULT_TK = 260, ! DIV_TK = 261, ! REM_TK = 262, ! LS_TK = 263, ! SRS_TK = 264, ! ZRS_TK = 265, ! AND_TK = 266, ! XOR_TK = 267, ! OR_TK = 268, ! BOOL_AND_TK = 269, ! BOOL_OR_TK = 270, ! EQ_TK = 271, ! NEQ_TK = 272, ! GT_TK = 273, ! GTE_TK = 274, ! LT_TK = 275, ! LTE_TK = 276, ! PLUS_ASSIGN_TK = 277, ! MINUS_ASSIGN_TK = 278, ! MULT_ASSIGN_TK = 279, ! DIV_ASSIGN_TK = 280, ! REM_ASSIGN_TK = 281, ! LS_ASSIGN_TK = 282, ! SRS_ASSIGN_TK = 283, ! ZRS_ASSIGN_TK = 284, ! AND_ASSIGN_TK = 285, ! XOR_ASSIGN_TK = 286, ! OR_ASSIGN_TK = 287, ! PUBLIC_TK = 288, ! PRIVATE_TK = 289, ! PROTECTED_TK = 290, ! STATIC_TK = 291, ! FINAL_TK = 292, ! SYNCHRONIZED_TK = 293, ! VOLATILE_TK = 294, ! TRANSIENT_TK = 295, ! NATIVE_TK = 296, ! PAD_TK = 297, ! ABSTRACT_TK = 298, ! MODIFIER_TK = 299, ! STRICT_TK = 300, ! DECR_TK = 301, ! INCR_TK = 302, ! DEFAULT_TK = 303, ! IF_TK = 304, ! THROW_TK = 305, ! BOOLEAN_TK = 306, ! DO_TK = 307, ! IMPLEMENTS_TK = 308, ! THROWS_TK = 309, ! BREAK_TK = 310, ! IMPORT_TK = 311, ! ELSE_TK = 312, ! INSTANCEOF_TK = 313, ! RETURN_TK = 314, ! VOID_TK = 315, ! CATCH_TK = 316, ! INTERFACE_TK = 317, ! CASE_TK = 318, ! EXTENDS_TK = 319, ! FINALLY_TK = 320, ! SUPER_TK = 321, ! WHILE_TK = 322, ! CLASS_TK = 323, ! SWITCH_TK = 324, ! CONST_TK = 325, ! TRY_TK = 326, ! FOR_TK = 327, ! NEW_TK = 328, ! CONTINUE_TK = 329, ! GOTO_TK = 330, ! PACKAGE_TK = 331, ! THIS_TK = 332, ! BYTE_TK = 333, ! SHORT_TK = 334, ! INT_TK = 335, ! LONG_TK = 336, ! CHAR_TK = 337, ! INTEGRAL_TK = 338, ! FLOAT_TK = 339, ! DOUBLE_TK = 340, ! FP_TK = 341, ! ID_TK = 342, ! REL_QM_TK = 343, ! REL_CL_TK = 344, ! NOT_TK = 345, ! NEG_TK = 346, ! ASSIGN_ANY_TK = 347, ! ASSIGN_TK = 348, ! OP_TK = 349, ! CP_TK = 350, ! OCB_TK = 351, ! CCB_TK = 352, ! OSB_TK = 353, ! CSB_TK = 354, ! SC_TK = 355, ! C_TK = 356, ! DOT_TK = 357, ! STRING_LIT_TK = 358, ! CHAR_LIT_TK = 359, ! INT_LIT_TK = 360, ! FP_LIT_TK = 361, ! TRUE_TK = 362, ! FALSE_TK = 363, ! BOOL_LIT_TK = 364, ! NULL_TK = 365 ! }; ! #endif ! #define PLUS_TK 258 ! #define MINUS_TK 259 ! #define MULT_TK 260 ! #define DIV_TK 261 ! #define REM_TK 262 ! #define LS_TK 263 ! #define SRS_TK 264 ! #define ZRS_TK 265 ! #define AND_TK 266 ! #define XOR_TK 267 ! #define OR_TK 268 ! #define BOOL_AND_TK 269 ! #define BOOL_OR_TK 270 ! #define EQ_TK 271 ! #define NEQ_TK 272 ! #define GT_TK 273 ! #define GTE_TK 274 ! #define LT_TK 275 ! #define LTE_TK 276 ! #define PLUS_ASSIGN_TK 277 ! #define MINUS_ASSIGN_TK 278 ! #define MULT_ASSIGN_TK 279 ! #define DIV_ASSIGN_TK 280 ! #define REM_ASSIGN_TK 281 ! #define LS_ASSIGN_TK 282 ! #define SRS_ASSIGN_TK 283 ! #define ZRS_ASSIGN_TK 284 ! #define AND_ASSIGN_TK 285 ! #define XOR_ASSIGN_TK 286 ! #define OR_ASSIGN_TK 287 ! #define PUBLIC_TK 288 ! #define PRIVATE_TK 289 ! #define PROTECTED_TK 290 ! #define STATIC_TK 291 ! #define FINAL_TK 292 ! #define SYNCHRONIZED_TK 293 ! #define VOLATILE_TK 294 ! #define TRANSIENT_TK 295 ! #define NATIVE_TK 296 ! #define PAD_TK 297 ! #define ABSTRACT_TK 298 ! #define MODIFIER_TK 299 ! #define STRICT_TK 300 ! #define DECR_TK 301 ! #define INCR_TK 302 ! #define DEFAULT_TK 303 ! #define IF_TK 304 ! #define THROW_TK 305 ! #define BOOLEAN_TK 306 ! #define DO_TK 307 ! #define IMPLEMENTS_TK 308 ! #define THROWS_TK 309 ! #define BREAK_TK 310 ! #define IMPORT_TK 311 ! #define ELSE_TK 312 ! #define INSTANCEOF_TK 313 ! #define RETURN_TK 314 ! #define VOID_TK 315 ! #define CATCH_TK 316 ! #define INTERFACE_TK 317 ! #define CASE_TK 318 ! #define EXTENDS_TK 319 ! #define FINALLY_TK 320 ! #define SUPER_TK 321 ! #define WHILE_TK 322 ! #define CLASS_TK 323 ! #define SWITCH_TK 324 ! #define CONST_TK 325 ! #define TRY_TK 326 ! #define FOR_TK 327 ! #define NEW_TK 328 ! #define CONTINUE_TK 329 ! #define GOTO_TK 330 ! #define PACKAGE_TK 331 ! #define THIS_TK 332 ! #define BYTE_TK 333 ! #define SHORT_TK 334 ! #define INT_TK 335 ! #define LONG_TK 336 ! #define CHAR_TK 337 ! #define INTEGRAL_TK 338 ! #define FLOAT_TK 339 ! #define DOUBLE_TK 340 ! #define FP_TK 341 ! #define ID_TK 342 ! #define REL_QM_TK 343 ! #define REL_CL_TK 344 ! #define NOT_TK 345 ! #define NEG_TK 346 ! #define ASSIGN_ANY_TK 347 ! #define ASSIGN_TK 348 ! #define OP_TK 349 ! #define CP_TK 350 ! #define OCB_TK 351 ! #define CCB_TK 352 ! #define OSB_TK 353 ! #define CSB_TK 354 ! #define SC_TK 355 ! #define C_TK 356 ! #define DOT_TK 357 ! #define STRING_LIT_TK 358 ! #define CHAR_LIT_TK 359 ! #define INT_LIT_TK 360 ! #define FP_LIT_TK 361 ! #define TRUE_TK 362 ! #define FALSE_TK 363 ! #define BOOL_LIT_TK 364 ! #define NULL_TK 365 ! ! ! /* Copy the first part of user declarations. */ ! #line 37 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" #define JC1_LITE *************** void report PARAMS ((void)); *** 188,220 **** #include "lex.h" #include "parse.h" ! #line 113 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! #ifndef YYSTYPE ! typedef union { char *node; struct method_declarator *declarator; int value; /* For modifiers */ ! } yystype; ! # define YYSTYPE yystype #endif ! #line 119 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" #include "lex.c" ! #ifndef YYDEBUG ! # define YYDEBUG 1 #endif ! #define YYFINAL 606 ! #define YYFLAG -32768 ! #define YYNTBASE 111 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 364 ? yytranslate[x] : 262) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, --- 352,513 ---- #include "lex.h" #include "parse.h" ! ! /* Enabling traces. */ ! #ifndef YYDEBUG ! # define YYDEBUG 1 ! #endif ! ! /* Enabling verbose error messages. */ ! #ifdef YYERROR_VERBOSE ! # undef YYERROR_VERBOSE ! # define YYERROR_VERBOSE 1 ! #else ! # define YYERROR_VERBOSE 0 ! #endif ! ! #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) ! #line 113 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! typedef union YYSTYPE { char *node; struct method_declarator *declarator; int value; /* For modifiers */ ! } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 377 "ps2505.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif ! ! ! ! /* Copy the second part of user declarations. */ ! #line 119 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" #include "lex.c" ! ! ! /* Line 214 of yacc.c. */ ! #line 392 "ps2505.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! ! #endif ! ! #if defined (__STDC__) || defined (__cplusplus) ! typedef signed char yysigned_char; ! #else ! typedef short yysigned_char; #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 28 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 3238 + /* YYNTOKENS -- Number of terminals. */ + #define YYNTOKENS 111 + /* YYNNTS -- Number of nonterminals. */ + #define YYNNTS 152 + /* YYNRULES -- Number of rules. */ + #define YYNRULES 351 + /* YYNRULES -- Number of states. */ + #define YYNSTATES 606 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 365 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, *************** static const char yytranslate[] = *** 241,470 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, ! 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, ! 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, ! 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, ! 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, ! 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, ! 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, ! 106, 107, 108, 109, 110 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 2, 4, 6, 8, 10, 12, 14, 16, ! 18, 20, 22, 24, 26, 28, 30, 32, 34, 37, ! 40, 42, 44, 46, 50, 52, 53, 55, 57, 59, ! 62, 65, 68, 72, 74, 77, 79, 82, 86, 88, ! 90, 94, 100, 102, 104, 106, 108, 111, 112, 120, ! 121, 128, 129, 132, 133, 136, 138, 142, 145, 149, ! 151, 154, 156, 158, 160, 162, 164, 166, 168, 170, ! 172, 176, 181, 183, 187, 189, 193, 195, 199, 201, ! 203, 206, 210, 214, 219, 224, 228, 233, 237, 239, ! 243, 246, 250, 251, 254, 256, 260, 262, 264, 267, ! 269, 273, 278, 283, 289, 293, 298, 301, 305, 309, ! 314, 319, 325, 333, 340, 342, 344, 345, 350, 351, ! 357, 358, 364, 365, 372, 375, 379, 382, 386, 388, ! 391, 393, 395, 397, 399, 401, 404, 407, 411, 415, ! 420, 422, 426, 429, 433, 435, 438, 440, 442, 444, ! 447, 450, 454, 456, 458, 460, 462, 464, 466, 468, ! 470, 472, 474, 476, 478, 480, 482, 484, 486, 488, ! 490, 492, 494, 496, 498, 500, 503, 506, 509, 512, ! 514, 516, 518, 520, 522, 524, 526, 532, 540, 548, ! 554, 557, 561, 565, 570, 572, 575, 578, 580, 583, ! 587, 590, 595, 598, 601, 603, 611, 619, 626, 634, ! 641, 644, 647, 648, 650, 652, 653, 655, 657, 661, ! 664, 668, 671, 675, 678, 682, 686, 692, 698, 700, ! 704, 708, 713, 715, 718, 724, 727, 729, 731, 733, ! 735, 739, 741, 743, 745, 747, 749, 753, 757, 761, ! 765, 769, 775, 780, 782, 787, 793, 799, 806, 807, ! 814, 815, 823, 827, 831, 833, 837, 841, 845, 849, ! 854, 859, 864, 869, 871, 874, 878, 881, 885, 889, ! 893, 897, 902, 908, 915, 921, 928, 933, 938, 940, ! 942, 944, 946, 949, 952, 954, 956, 959, 962, 964, ! 967, 970, 972, 975, 978, 980, 986, 991, 996, 1002, ! 1004, 1008, 1012, 1016, 1018, 1022, 1026, 1028, 1032, 1036, ! 1040, 1042, 1046, 1050, 1054, 1058, 1062, 1064, 1068, 1072, ! 1074, 1078, 1080, 1084, 1086, 1090, 1092, 1096, 1098, 1102, ! 1104, 1110, 1112, 1114, 1118, 1120, 1122, 1124, 1126, 1128, ! 1130 }; static const short yyrhs[] = { ! 124, 0, 105, 0, 106, 0, 109, 0, 104, 0, ! 103, 0, 110, 0, 114, 0, 115, 0, 83, 0, ! 86, 0, 51, 0, 116, 0, 119, 0, 120, 0, ! 116, 0, 116, 0, 114, 233, 0, 120, 233, 0, ! 121, 0, 122, 0, 123, 0, 120, 102, 123, 0, ! 87, 0, 0, 127, 0, 125, 0, 126, 0, 127, ! 125, 0, 127, 126, 0, 125, 126, 0, 127, 125, ! 126, 0, 128, 0, 125, 128, 0, 131, 0, 126, ! 131, 0, 76, 120, 100, 0, 129, 0, 130, 0, ! 56, 120, 100, 0, 56, 120, 102, 5, 100, 0, ! 133, 0, 163, 0, 184, 0, 44, 0, 132, 44, ! 0, 0, 132, 68, 123, 136, 137, 134, 139, 0, ! 0, 68, 123, 136, 137, 135, 139, 0, 0, 64, ! 117, 0, 0, 53, 138, 0, 118, 0, 138, 101, ! 118, 0, 96, 97, 0, 96, 140, 97, 0, 141, ! 0, 140, 141, 0, 142, 0, 156, 0, 158, 0, ! 176, 0, 143, 0, 148, 0, 133, 0, 163, 0, ! 184, 0, 113, 144, 100, 0, 132, 113, 144, 100, ! 0, 145, 0, 144, 101, 145, 0, 146, 0, 146, ! 93, 147, 0, 123, 0, 146, 98, 99, 0, 260, ! 0, 174, 0, 149, 155, 0, 113, 150, 153, 0, ! 60, 150, 153, 0, 132, 113, 150, 153, 0, 132, ! 60, 150, 153, 0, 123, 94, 95, 0, 123, 94, ! 151, 95, 0, 150, 98, 99, 0, 152, 0, 151, ! 101, 152, 0, 113, 146, 0, 132, 113, 146, 0, ! 0, 54, 154, 0, 117, 0, 154, 101, 117, 0, ! 176, 0, 100, 0, 157, 176, 0, 44, 0, 159, ! 153, 160, 0, 132, 159, 153, 160, 0, 159, 153, ! 160, 100, 0, 132, 159, 153, 160, 100, 0, 121, ! 94, 95, 0, 121, 94, 151, 95, 0, 96, 97, ! 0, 96, 161, 97, 0, 96, 177, 97, 0, 96, ! 161, 177, 97, 0, 162, 94, 95, 100, 0, 162, ! 94, 229, 95, 100, 0, 120, 102, 66, 94, 229, ! 95, 100, 0, 120, 102, 66, 94, 95, 100, 0, ! 77, 0, 66, 0, 0, 62, 123, 164, 169, 0, ! 0, 132, 62, 123, 165, 169, 0, 0, 62, 123, ! 168, 166, 169, 0, 0, 132, 62, 123, 168, 167, ! 169, 0, 64, 118, 0, 168, 101, 118, 0, 96, ! 97, 0, 96, 170, 97, 0, 171, 0, 170, 171, ! 0, 172, 0, 173, 0, 133, 0, 163, 0, 143, ! 0, 149, 100, 0, 96, 97, 0, 96, 175, 97, ! 0, 96, 101, 97, 0, 96, 175, 101, 97, 0, ! 147, 0, 175, 101, 147, 0, 96, 97, 0, 96, ! 177, 97, 0, 178, 0, 177, 178, 0, 179, 0, ! 181, 0, 133, 0, 180, 100, 0, 113, 144, 0, ! 132, 113, 144, 0, 183, 0, 186, 0, 190, 0, ! 191, 0, 200, 0, 204, 0, 183, 0, 187, 0, ! 192, 0, 201, 0, 205, 0, 176, 0, 184, 0, ! 188, 0, 193, 0, 203, 0, 211, 0, 212, 0, ! 213, 0, 215, 0, 214, 0, 217, 0, 100, 0, ! 123, 89, 0, 185, 181, 0, 185, 182, 0, 189, ! 100, 0, 257, 0, 241, 0, 242, 0, 238, 0, ! 239, 0, 235, 0, 224, 0, 49, 94, 260, 95, ! 181, 0, 49, 94, 260, 95, 182, 57, 181, 0, ! 49, 94, 260, 95, 182, 57, 182, 0, 69, 94, ! 260, 95, 194, 0, 96, 97, 0, 96, 197, 97, ! 0, 96, 195, 97, 0, 96, 195, 197, 97, 0, ! 196, 0, 195, 196, 0, 197, 177, 0, 198, 0, ! 197, 198, 0, 63, 261, 89, 0, 48, 89, 0, ! 67, 94, 260, 95, 0, 199, 181, 0, 199, 182, ! 0, 52, 0, 202, 181, 67, 94, 260, 95, 100, ! 0, 207, 100, 260, 100, 209, 95, 181, 0, 207, ! 100, 100, 209, 95, 181, 0, 207, 100, 260, 100, ! 209, 95, 182, 0, 207, 100, 100, 209, 95, 182, ! 0, 72, 94, 0, 206, 208, 0, 0, 210, 0, ! 180, 0, 0, 210, 0, 189, 0, 210, 101, 189, ! 0, 55, 100, 0, 55, 123, 100, 0, 74, 100, ! 0, 74, 123, 100, 0, 59, 100, 0, 59, 260, ! 100, 0, 50, 260, 100, 0, 216, 94, 260, 95, ! 176, 0, 216, 94, 260, 95, 1, 0, 44, 0, ! 71, 176, 218, 0, 71, 176, 220, 0, 71, 176, ! 218, 220, 0, 219, 0, 218, 219, 0, 61, 94, ! 152, 95, 176, 0, 65, 176, 0, 222, 0, 230, ! 0, 112, 0, 77, 0, 94, 260, 95, 0, 224, ! 0, 234, 0, 235, 0, 236, 0, 223, 0, 120, ! 102, 77, 0, 120, 102, 68, 0, 119, 102, 68, ! 0, 114, 102, 68, 0, 60, 102, 68, 0, 73, ! 117, 94, 229, 95, 0, 73, 117, 94, 95, 0, ! 225, 0, 228, 123, 94, 95, 0, 228, 123, 94, ! 95, 139, 0, 228, 123, 94, 229, 95, 0, 228, ! 123, 94, 229, 95, 139, 0, 0, 73, 117, 94, ! 95, 226, 139, 0, 0, 73, 117, 94, 229, 95, ! 227, 139, 0, 120, 102, 73, 0, 221, 102, 73, ! 0, 260, 0, 229, 101, 260, 0, 229, 101, 1, ! 0, 73, 114, 231, 0, 73, 116, 231, 0, 73, ! 114, 231, 233, 0, 73, 116, 231, 233, 0, 73, ! 116, 233, 174, 0, 73, 114, 233, 174, 0, 232, ! 0, 231, 232, 0, 98, 260, 99, 0, 98, 99, ! 0, 233, 98, 99, 0, 221, 102, 123, 0, 66, ! 102, 123, 0, 120, 94, 95, 0, 120, 94, 229, ! 95, 0, 221, 102, 123, 94, 95, 0, 221, 102, ! 123, 94, 229, 95, 0, 66, 102, 123, 94, 95, ! 0, 66, 102, 123, 94, 229, 95, 0, 120, 98, ! 260, 99, 0, 222, 98, 260, 99, 0, 221, 0, ! 120, 0, 238, 0, 239, 0, 237, 47, 0, 237, ! 46, 0, 241, 0, 242, 0, 3, 240, 0, 4, ! 240, 0, 243, 0, 47, 240, 0, 46, 240, 0, ! 237, 0, 90, 240, 0, 91, 240, 0, 244, 0, ! 94, 114, 233, 95, 240, 0, 94, 114, 95, 240, ! 0, 94, 260, 95, 243, 0, 94, 120, 233, 95, ! 243, 0, 240, 0, 245, 5, 240, 0, 245, 6, ! 240, 0, 245, 7, 240, 0, 245, 0, 246, 3, ! 245, 0, 246, 4, 245, 0, 246, 0, 247, 8, ! 246, 0, 247, 9, 246, 0, 247, 10, 246, 0, ! 247, 0, 248, 20, 247, 0, 248, 18, 247, 0, ! 248, 21, 247, 0, 248, 19, 247, 0, 248, 58, ! 115, 0, 248, 0, 249, 16, 248, 0, 249, 17, ! 248, 0, 249, 0, 250, 11, 249, 0, 250, 0, ! 251, 12, 250, 0, 251, 0, 252, 13, 251, 0, ! 252, 0, 253, 14, 252, 0, 253, 0, 254, 15, ! 253, 0, 254, 0, 254, 88, 260, 89, 255, 0, ! 255, 0, 257, 0, 258, 259, 256, 0, 120, 0, ! 234, 0, 236, 0, 92, 0, 93, 0, 256, 0, ! 260, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 189, 194, 196, 197, 198, 199, 200, 204, 206, ! 209, 215, 220, 227, 229, 232, 236, 240, 244, 250, ! 258, 260, 263, 267, 274, 279, 280, 281, 282, 283, ! 284, 285, 286, 289, 291, 294, 296, 299, 304, 306, ! 309, 313, 317, 319, 320, 326, 335, 346, 346, 353, ! 353, 358, 359, 362, 363, 366, 369, 373, 376, 380, ! 382, 385, 387, 388, 389, 392, 394, 395, 396, 397, ! 401, 404, 408, 411, 414, 416, 419, 422, 426, 428, ! 432, 436, 439, 440, 442, 449, 456, 462, 465, 467, ! 473, 489, 505, 506, 509, 512, 516, 518, 522, 526, ! 536, 538, 541, 543, 549, 552, 556, 558, 559, 560, ! 564, 566, 569, 571, 575, 577, 582, 582, 586, 586, ! 589, 589, 592, 592, 597, 599, 602, 605, 609, 611, ! 614, 616, 617, 618, 621, 625, 630, 632, 633, 634, ! 637, 639, 643, 645, 648, 650, 653, 655, 656, 659, ! 663, 666, 670, 672, 673, 674, 675, 676, 679, 681, ! 682, 683, 684, 687, 689, 690, 691, 692, 693, 694, ! 695, 696, 697, 698, 701, 705, 710, 714, 720, 724, ! 726, 727, 728, 729, 730, 731, 734, 738, 743, 748, ! 752, 754, 755, 756, 759, 761, 764, 769, 771, 774, ! 776, 779, 783, 787, 791, 795, 800, 802, 805, 807, ! 810, 814, 817, 818, 819, 822, 823, 826, 828, 831, ! 833, 838, 840, 843, 845, 848, 852, 854, 857, 862, ! 864, 865, 868, 870, 873, 877, 882, 884, 887, 889, ! 890, 891, 892, 893, 894, 895, 899, 903, 906, 908, ! 910, 914, 916, 917, 918, 919, 920, 921, 924, 924, ! 928, 928, 933, 936, 939, 941, 942, 945, 947, 948, ! 949, 952, 953, 956, 958, 961, 965, 968, 972, 974, ! 980, 983, 985, 986, 987, 988, 991, 994, 997, 999, ! 1001, 1002, 1005, 1009, 1013, 1015, 1016, 1017, 1018, 1021, ! 1025, 1029, 1031, 1032, 1033, 1036, 1038, 1039, 1040, 1043, ! 1045, 1046, 1047, 1050, 1052, 1053, 1056, 1058, 1059, 1060, ! 1063, 1065, 1066, 1067, 1068, 1069, 1072, 1074, 1075, 1078, ! 1080, 1083, 1085, 1088, 1090, 1093, 1095, 1099, 1101, 1105, ! 1107, 1111, 1113, 1116, 1120, 1123, 1124, 1127, 1129, 1132, ! 1136 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "PLUS_TK", "MINUS_TK", "MULT_TK", "DIV_TK", "REM_TK", "LS_TK", "SRS_TK", "ZRS_TK", "AND_TK", "XOR_TK", "OR_TK", "BOOL_AND_TK", "BOOL_OR_TK", "EQ_TK", "NEQ_TK", "GT_TK", "GTE_TK", "LT_TK", "LTE_TK", "PLUS_ASSIGN_TK", "MINUS_ASSIGN_TK", --- 534,763 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, ! 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, ! 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, ! 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, ! 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, ! 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, ! 105, 106, 107, 108, 109, 110 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned short yyprhs[] = { ! 0, 0, 3, 5, 7, 9, 11, 13, 15, 17, ! 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, ! 40, 43, 45, 47, 49, 53, 55, 56, 58, 60, ! 62, 65, 68, 71, 75, 77, 80, 82, 85, 89, ! 91, 93, 97, 103, 105, 107, 109, 111, 114, 115, ! 123, 124, 131, 132, 135, 136, 139, 141, 145, 148, ! 152, 154, 157, 159, 161, 163, 165, 167, 169, 171, ! 173, 175, 179, 184, 186, 190, 192, 196, 198, 202, ! 204, 206, 209, 213, 217, 222, 227, 231, 236, 240, ! 242, 246, 249, 253, 254, 257, 259, 263, 265, 267, ! 270, 272, 276, 281, 286, 292, 296, 301, 304, 308, ! 312, 317, 322, 328, 336, 343, 345, 347, 348, 353, ! 354, 360, 361, 367, 368, 375, 378, 382, 385, 389, ! 391, 394, 396, 398, 400, 402, 404, 407, 410, 414, ! 418, 423, 425, 429, 432, 436, 438, 441, 443, 445, ! 447, 450, 453, 457, 459, 461, 463, 465, 467, 469, ! 471, 473, 475, 477, 479, 481, 483, 485, 487, 489, ! 491, 493, 495, 497, 499, 501, 503, 506, 509, 512, ! 515, 517, 519, 521, 523, 525, 527, 529, 535, 543, ! 551, 557, 560, 564, 568, 573, 575, 578, 581, 583, ! 586, 590, 593, 598, 601, 604, 606, 614, 622, 629, ! 637, 644, 647, 650, 651, 653, 655, 656, 658, 660, ! 664, 667, 671, 674, 678, 681, 685, 689, 695, 701, ! 703, 707, 711, 716, 718, 721, 727, 730, 732, 734, ! 736, 738, 742, 744, 746, 748, 750, 752, 756, 760, ! 764, 768, 772, 778, 783, 785, 790, 796, 802, 809, ! 810, 817, 818, 826, 830, 834, 836, 840, 844, 848, ! 852, 857, 862, 867, 872, 874, 877, 881, 884, 888, ! 892, 896, 900, 905, 911, 918, 924, 931, 936, 941, ! 943, 945, 947, 949, 952, 955, 957, 959, 962, 965, ! 967, 970, 973, 975, 978, 981, 983, 989, 994, 999, ! 1005, 1007, 1011, 1015, 1019, 1021, 1025, 1029, 1031, 1035, ! 1039, 1043, 1045, 1049, 1053, 1057, 1061, 1065, 1067, 1071, ! 1075, 1077, 1081, 1083, 1087, 1089, 1093, 1095, 1099, 1101, ! 1105, 1107, 1113, 1115, 1117, 1121, 1123, 1125, 1127, 1129, ! 1131, 1133 }; + + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const short yyrhs[] = { ! 112, 0, -1, 125, -1, 105, -1, 106, -1, 109, ! -1, 104, -1, 103, -1, 110, -1, 115, -1, 116, ! -1, 83, -1, 86, -1, 51, -1, 117, -1, 120, ! -1, 121, -1, 117, -1, 117, -1, 115, 234, -1, ! 121, 234, -1, 122, -1, 123, -1, 124, -1, 121, ! 102, 124, -1, 87, -1, -1, 128, -1, 126, -1, ! 127, -1, 128, 126, -1, 128, 127, -1, 126, 127, ! -1, 128, 126, 127, -1, 129, -1, 126, 129, -1, ! 132, -1, 127, 132, -1, 76, 121, 100, -1, 130, ! -1, 131, -1, 56, 121, 100, -1, 56, 121, 102, ! 5, 100, -1, 134, -1, 164, -1, 185, -1, 44, ! -1, 133, 44, -1, -1, 133, 68, 124, 137, 138, ! 135, 140, -1, -1, 68, 124, 137, 138, 136, 140, ! -1, -1, 64, 118, -1, -1, 53, 139, -1, 119, ! -1, 139, 101, 119, -1, 96, 97, -1, 96, 141, ! 97, -1, 142, -1, 141, 142, -1, 143, -1, 157, ! -1, 159, -1, 177, -1, 144, -1, 149, -1, 134, ! -1, 164, -1, 185, -1, 114, 145, 100, -1, 133, ! 114, 145, 100, -1, 146, -1, 145, 101, 146, -1, ! 147, -1, 147, 93, 148, -1, 124, -1, 147, 98, ! 99, -1, 261, -1, 175, -1, 150, 156, -1, 114, ! 151, 154, -1, 60, 151, 154, -1, 133, 114, 151, ! 154, -1, 133, 60, 151, 154, -1, 124, 94, 95, ! -1, 124, 94, 152, 95, -1, 151, 98, 99, -1, ! 153, -1, 152, 101, 153, -1, 114, 147, -1, 133, ! 114, 147, -1, -1, 54, 155, -1, 118, -1, 155, ! 101, 118, -1, 177, -1, 100, -1, 158, 177, -1, ! 44, -1, 160, 154, 161, -1, 133, 160, 154, 161, ! -1, 160, 154, 161, 100, -1, 133, 160, 154, 161, ! 100, -1, 122, 94, 95, -1, 122, 94, 152, 95, ! -1, 96, 97, -1, 96, 162, 97, -1, 96, 178, ! 97, -1, 96, 162, 178, 97, -1, 163, 94, 95, ! 100, -1, 163, 94, 230, 95, 100, -1, 121, 102, ! 66, 94, 230, 95, 100, -1, 121, 102, 66, 94, ! 95, 100, -1, 77, -1, 66, -1, -1, 62, 124, ! 165, 170, -1, -1, 133, 62, 124, 166, 170, -1, ! -1, 62, 124, 169, 167, 170, -1, -1, 133, 62, ! 124, 169, 168, 170, -1, 64, 119, -1, 169, 101, ! 119, -1, 96, 97, -1, 96, 171, 97, -1, 172, ! -1, 171, 172, -1, 173, -1, 174, -1, 134, -1, ! 164, -1, 144, -1, 150, 100, -1, 96, 97, -1, ! 96, 176, 97, -1, 96, 101, 97, -1, 96, 176, ! 101, 97, -1, 148, -1, 176, 101, 148, -1, 96, ! 97, -1, 96, 178, 97, -1, 179, -1, 178, 179, ! -1, 180, -1, 182, -1, 134, -1, 181, 100, -1, ! 114, 145, -1, 133, 114, 145, -1, 184, -1, 187, ! -1, 191, -1, 192, -1, 201, -1, 205, -1, 184, ! -1, 188, -1, 193, -1, 202, -1, 206, -1, 177, ! -1, 185, -1, 189, -1, 194, -1, 204, -1, 212, ! -1, 213, -1, 214, -1, 216, -1, 215, -1, 218, ! -1, 100, -1, 124, 89, -1, 186, 182, -1, 186, ! 183, -1, 190, 100, -1, 258, -1, 242, -1, 243, ! -1, 239, -1, 240, -1, 236, -1, 225, -1, 49, ! 94, 261, 95, 182, -1, 49, 94, 261, 95, 183, ! 57, 182, -1, 49, 94, 261, 95, 183, 57, 183, ! -1, 69, 94, 261, 95, 195, -1, 96, 97, -1, ! 96, 198, 97, -1, 96, 196, 97, -1, 96, 196, ! 198, 97, -1, 197, -1, 196, 197, -1, 198, 178, ! -1, 199, -1, 198, 199, -1, 63, 262, 89, -1, ! 48, 89, -1, 67, 94, 261, 95, -1, 200, 182, ! -1, 200, 183, -1, 52, -1, 203, 182, 67, 94, ! 261, 95, 100, -1, 208, 100, 261, 100, 210, 95, ! 182, -1, 208, 100, 100, 210, 95, 182, -1, 208, ! 100, 261, 100, 210, 95, 183, -1, 208, 100, 100, ! 210, 95, 183, -1, 72, 94, -1, 207, 209, -1, ! -1, 211, -1, 181, -1, -1, 211, -1, 190, -1, ! 211, 101, 190, -1, 55, 100, -1, 55, 124, 100, ! -1, 74, 100, -1, 74, 124, 100, -1, 59, 100, ! -1, 59, 261, 100, -1, 50, 261, 100, -1, 217, ! 94, 261, 95, 177, -1, 217, 94, 261, 95, 1, ! -1, 44, -1, 71, 177, 219, -1, 71, 177, 221, ! -1, 71, 177, 219, 221, -1, 220, -1, 219, 220, ! -1, 61, 94, 153, 95, 177, -1, 65, 177, -1, ! 223, -1, 231, -1, 113, -1, 77, -1, 94, 261, ! 95, -1, 225, -1, 235, -1, 236, -1, 237, -1, ! 224, -1, 121, 102, 77, -1, 121, 102, 68, -1, ! 120, 102, 68, -1, 115, 102, 68, -1, 60, 102, ! 68, -1, 73, 118, 94, 230, 95, -1, 73, 118, ! 94, 95, -1, 226, -1, 229, 124, 94, 95, -1, ! 229, 124, 94, 95, 140, -1, 229, 124, 94, 230, ! 95, -1, 229, 124, 94, 230, 95, 140, -1, -1, ! 73, 118, 94, 95, 227, 140, -1, -1, 73, 118, ! 94, 230, 95, 228, 140, -1, 121, 102, 73, -1, ! 222, 102, 73, -1, 261, -1, 230, 101, 261, -1, ! 230, 101, 1, -1, 73, 115, 232, -1, 73, 117, ! 232, -1, 73, 115, 232, 234, -1, 73, 117, 232, ! 234, -1, 73, 117, 234, 175, -1, 73, 115, 234, ! 175, -1, 233, -1, 232, 233, -1, 98, 261, 99, ! -1, 98, 99, -1, 234, 98, 99, -1, 222, 102, ! 124, -1, 66, 102, 124, -1, 121, 94, 95, -1, ! 121, 94, 230, 95, -1, 222, 102, 124, 94, 95, ! -1, 222, 102, 124, 94, 230, 95, -1, 66, 102, ! 124, 94, 95, -1, 66, 102, 124, 94, 230, 95, ! -1, 121, 98, 261, 99, -1, 223, 98, 261, 99, ! -1, 222, -1, 121, -1, 239, -1, 240, -1, 238, ! 47, -1, 238, 46, -1, 242, -1, 243, -1, 3, ! 241, -1, 4, 241, -1, 244, -1, 47, 241, -1, ! 46, 241, -1, 238, -1, 90, 241, -1, 91, 241, ! -1, 245, -1, 94, 115, 234, 95, 241, -1, 94, ! 115, 95, 241, -1, 94, 261, 95, 244, -1, 94, ! 121, 234, 95, 244, -1, 241, -1, 246, 5, 241, ! -1, 246, 6, 241, -1, 246, 7, 241, -1, 246, ! -1, 247, 3, 246, -1, 247, 4, 246, -1, 247, ! -1, 248, 8, 247, -1, 248, 9, 247, -1, 248, ! 10, 247, -1, 248, -1, 249, 20, 248, -1, 249, ! 18, 248, -1, 249, 21, 248, -1, 249, 19, 248, ! -1, 249, 58, 116, -1, 249, -1, 250, 16, 249, ! -1, 250, 17, 249, -1, 250, -1, 251, 11, 250, ! -1, 251, -1, 252, 12, 251, -1, 252, -1, 253, ! 13, 252, -1, 253, -1, 254, 14, 253, -1, 254, ! -1, 255, 15, 254, -1, 255, -1, 255, 88, 261, ! 89, 256, -1, 256, -1, 258, -1, 259, 260, 257, ! -1, 121, -1, 235, -1, 237, -1, 92, -1, 93, ! -1, 257, -1, 261, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned short yyrline[] = { ! 0, 190, 190, 195, 196, 197, 198, 199, 200, 205, ! 206, 210, 215, 220, 228, 229, 233, 237, 241, 245, ! 250, 259, 260, 264, 268, 275, 279, 280, 281, 282, ! 283, 284, 285, 286, 290, 291, 295, 296, 300, 305, ! 306, 310, 314, 318, 319, 320, 327, 335, 348, 347, ! 354, 353, 358, 359, 362, 363, 367, 369, 374, 376, ! 381, 382, 386, 387, 388, 389, 393, 394, 395, 396, ! 397, 402, 404, 410, 411, 415, 416, 420, 422, 427, ! 428, 433, 437, 439, 440, 442, 450, 456, 462, 466, ! 467, 474, 489, 505, 506, 510, 512, 517, 518, 523, ! 527, 537, 538, 541, 543, 550, 552, 557, 558, 559, ! 560, 565, 566, 569, 571, 576, 577, 584, 583, 587, ! 586, 590, 589, 593, 592, 598, 599, 603, 605, 610, ! 611, 615, 616, 617, 618, 622, 626, 631, 632, 633, ! 634, 638, 639, 644, 645, 649, 650, 654, 655, 656, ! 660, 664, 666, 671, 672, 673, 674, 675, 676, 680, ! 681, 682, 683, 684, 688, 689, 690, 691, 692, 693, ! 694, 695, 696, 697, 698, 702, 706, 711, 715, 721, ! 725, 726, 727, 728, 729, 730, 731, 735, 739, 744, ! 749, 753, 754, 755, 756, 760, 761, 765, 770, 771, ! 775, 776, 780, 784, 788, 792, 796, 801, 802, 806, ! 807, 811, 815, 817, 818, 819, 822, 823, 827, 828, ! 832, 833, 839, 840, 844, 845, 849, 853, 854, 858, ! 863, 864, 865, 869, 870, 874, 878, 883, 884, 888, ! 889, 890, 891, 892, 893, 894, 895, 899, 904, 906, ! 908, 910, 915, 916, 917, 918, 919, 920, 921, 926, ! 925, 929, 928, 934, 936, 940, 941, 942, 946, 947, ! 948, 949, 952, 953, 957, 958, 962, 966, 968, 973, ! 974, 981, 983, 985, 986, 987, 988, 992, 994, 998, ! 999, 1001, 1002, 1006, 1010, 1014, 1015, 1016, 1017, 1018, ! 1022, 1026, 1030, 1031, 1032, 1033, 1037, 1038, 1039, 1040, ! 1044, 1045, 1046, 1047, 1051, 1052, 1053, 1057, 1058, 1059, ! 1060, 1064, 1065, 1066, 1067, 1068, 1069, 1073, 1074, 1075, ! 1079, 1080, 1084, 1085, 1089, 1090, 1094, 1095, 1100, 1101, ! 1106, 1107, 1112, 1113, 1117, 1121, 1123, 1124, 1128, 1129, ! 1133, 1137 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "PLUS_TK", "MINUS_TK", "MULT_TK", "DIV_TK", "REM_TK", "LS_TK", "SRS_TK", "ZRS_TK", "AND_TK", "XOR_TK", "OR_TK", "BOOL_AND_TK", "BOOL_OR_TK", "EQ_TK", "NEQ_TK", "GT_TK", "GTE_TK", "LT_TK", "LTE_TK", "PLUS_ASSIGN_TK", "MINUS_ASSIGN_TK", *************** static const char *const yytname[] = *** 484,491 **** "NEG_TK", "ASSIGN_ANY_TK", "ASSIGN_TK", "OP_TK", "CP_TK", "OCB_TK", "CCB_TK", "OSB_TK", "CSB_TK", "SC_TK", "C_TK", "DOT_TK", "STRING_LIT_TK", "CHAR_LIT_TK", "INT_LIT_TK", "FP_LIT_TK", "TRUE_TK", ! "FALSE_TK", "BOOL_LIT_TK", "NULL_TK", "goal", "literal", "type", ! "primitive_type", "reference_type", "class_or_interface_type", "class_type", "interface_type", "array_type", "name", "simple_name", "qualified_name", "identifier", "compilation_unit", "import_declarations", "type_declarations", "package_declaration", --- 777,784 ---- "NEG_TK", "ASSIGN_ANY_TK", "ASSIGN_TK", "OP_TK", "CP_TK", "OCB_TK", "CCB_TK", "OSB_TK", "CSB_TK", "SC_TK", "C_TK", "DOT_TK", "STRING_LIT_TK", "CHAR_LIT_TK", "INT_LIT_TK", "FP_LIT_TK", "TRUE_TK", ! "FALSE_TK", "BOOL_LIT_TK", "NULL_TK", "$accept", "goal", "literal", ! "type", "primitive_type", "reference_type", "class_or_interface_type", "class_type", "interface_type", "array_type", "name", "simple_name", "qualified_name", "identifier", "compilation_unit", "import_declarations", "type_declarations", "package_declaration", *************** static const char *const yytname[] = *** 538,1298 **** }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 111, 112, 112, 112, 112, 112, 112, 113, 113, ! 114, 114, 114, 115, 115, 116, 117, 118, 119, 119, ! 120, 120, 121, 122, 123, 124, 124, 124, 124, 124, ! 124, 124, 124, 125, 125, 126, 126, 127, 128, 128, ! 129, 130, 131, 131, 131, 132, 132, 134, 133, 135, ! 133, 136, 136, 137, 137, 138, 138, 139, 139, 140, ! 140, 141, 141, 141, 141, 142, 142, 142, 142, 142, ! 143, 143, 144, 144, 145, 145, 146, 146, 147, 147, ! 148, 149, 149, 149, 149, 150, 150, 150, 151, 151, ! 152, 152, 153, 153, 154, 154, 155, 155, 156, 157, ! 158, 158, 158, 158, 159, 159, 160, 160, 160, 160, ! 161, 161, 161, 161, 162, 162, 164, 163, 165, 163, ! 166, 163, 167, 163, 168, 168, 169, 169, 170, 170, ! 171, 171, 171, 171, 172, 173, 174, 174, 174, 174, ! 175, 175, 176, 176, 177, 177, 178, 178, 178, 179, ! 180, 180, 181, 181, 181, 181, 181, 181, 182, 182, ! 182, 182, 182, 183, 183, 183, 183, 183, 183, 183, ! 183, 183, 183, 183, 184, 185, 186, 187, 188, 189, ! 189, 189, 189, 189, 189, 189, 190, 191, 192, 193, ! 194, 194, 194, 194, 195, 195, 196, 197, 197, 198, ! 198, 199, 200, 201, 202, 203, 204, 204, 205, 205, ! 206, 207, 208, 208, 208, 209, 209, 210, 210, 211, ! 211, 212, 212, 213, 213, 214, 215, 215, 216, 217, ! 217, 217, 218, 218, 219, 220, 221, 221, 222, 222, ! 222, 222, 222, 222, 222, 222, 222, 223, 223, 223, ! 223, 224, 224, 224, 224, 224, 224, 224, 226, 225, ! 227, 225, 228, 228, 229, 229, 229, 230, 230, 230, ! 230, 230, 230, 231, 231, 232, 233, 233, 234, 234, ! 235, 235, 235, 235, 235, 235, 236, 236, 237, 237, ! 237, 237, 238, 239, 240, 240, 240, 240, 240, 241, ! 242, 243, 243, 243, 243, 244, 244, 244, 244, 245, ! 245, 245, 245, 246, 246, 246, 247, 247, 247, 247, ! 248, 248, 248, 248, 248, 248, 249, 249, 249, 250, ! 250, 251, 251, 252, 252, 253, 253, 254, 254, 255, ! 255, 256, 256, 257, 258, 258, 258, 259, 259, 260, ! 261 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, ! 1, 1, 1, 3, 1, 0, 1, 1, 1, 2, ! 2, 2, 3, 1, 2, 1, 2, 3, 1, 1, ! 3, 5, 1, 1, 1, 1, 2, 0, 7, 0, ! 6, 0, 2, 0, 2, 1, 3, 2, 3, 1, ! 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 3, 4, 1, 3, 1, 3, 1, 3, 1, 1, ! 2, 3, 3, 4, 4, 3, 4, 3, 1, 3, ! 2, 3, 0, 2, 1, 3, 1, 1, 2, 1, ! 3, 4, 4, 5, 3, 4, 2, 3, 3, 4, ! 4, 5, 7, 6, 1, 1, 0, 4, 0, 5, ! 0, 5, 0, 6, 2, 3, 2, 3, 1, 2, ! 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, ! 1, 3, 2, 3, 1, 2, 1, 1, 1, 2, ! 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, ! 1, 1, 1, 1, 1, 1, 5, 7, 7, 5, ! 2, 3, 3, 4, 1, 2, 2, 1, 2, 3, ! 2, 4, 2, 2, 1, 7, 7, 6, 7, 6, ! 2, 2, 0, 1, 1, 0, 1, 1, 3, 2, ! 3, 2, 3, 2, 3, 3, 5, 5, 1, 3, ! 3, 4, 1, 2, 5, 2, 1, 1, 1, 1, ! 3, 1, 1, 1, 1, 1, 3, 3, 3, 3, ! 3, 5, 4, 1, 4, 5, 5, 6, 0, 6, ! 0, 7, 3, 3, 1, 3, 3, 3, 3, 4, ! 4, 4, 4, 1, 2, 3, 2, 3, 3, 3, ! 3, 4, 5, 6, 5, 6, 4, 4, 1, 1, ! 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, ! 2, 1, 2, 2, 1, 5, 4, 4, 5, 1, ! 3, 3, 3, 1, 3, 3, 1, 3, 3, 3, ! 1, 3, 3, 3, 3, 3, 1, 3, 3, 1, ! 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, ! 5, 1, 1, 3, 1, 1, 1, 1, 1, 1, ! 1 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 25, 45, 0, 0, 0, 0, 174, 1, 27, 28, ! 26, 33, 38, 39, 35, 0, 42, 43, 44, 24, ! 0, 20, 21, 22, 116, 51, 0, 31, 34, 36, ! 29, 30, 46, 0, 0, 40, 0, 0, 0, 120, ! 0, 53, 37, 0, 32, 118, 51, 0, 23, 17, ! 124, 15, 0, 117, 0, 0, 16, 52, 0, 49, ! 0, 122, 53, 41, 12, 0, 10, 11, 126, 0, ! 8, 9, 13, 14, 15, 0, 132, 134, 0, 133, ! 0, 128, 130, 131, 125, 121, 55, 54, 0, 119, ! 0, 47, 0, 92, 76, 0, 72, 74, 92, 0, ! 18, 19, 0, 0, 135, 127, 129, 0, 0, 50, ! 123, 0, 0, 0, 0, 82, 70, 0, 0, 0, ! 81, 276, 0, 92, 0, 92, 56, 45, 0, 57, ! 20, 0, 67, 0, 59, 61, 65, 66, 0, 62, ! 0, 63, 92, 68, 64, 69, 48, 85, 0, 0, ! 0, 88, 94, 93, 87, 76, 73, 0, 0, 0, ! 0, 0, 0, 0, 239, 0, 0, 0, 0, 6, ! 5, 2, 3, 4, 7, 238, 0, 0, 289, 75, ! 79, 288, 236, 245, 241, 253, 0, 237, 242, 243, ! 244, 301, 290, 291, 309, 294, 295, 298, 304, 313, ! 316, 320, 326, 329, 331, 333, 335, 337, 339, 341, ! 349, 342, 0, 78, 77, 277, 84, 71, 83, 45, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 142, 0, 8, 14, 289, 22, 0, 148, 163, ! 0, 144, 146, 0, 147, 152, 164, 0, 153, 165, ! 0, 154, 155, 166, 0, 156, 0, 167, 157, 212, ! 0, 168, 169, 170, 172, 171, 0, 173, 241, 243, ! 0, 182, 183, 180, 181, 179, 0, 92, 58, 60, ! 97, 80, 96, 98, 0, 90, 0, 86, 0, 0, ! 289, 242, 244, 296, 297, 300, 299, 0, 0, 0, ! 16, 0, 302, 303, 0, 289, 0, 136, 0, 140, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 293, ! 292, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 347, 348, 0, 0, 0, 219, 0, 223, ! 0, 0, 0, 0, 210, 221, 0, 0, 150, 175, ! 0, 143, 145, 149, 228, 176, 178, 202, 0, 0, ! 214, 217, 211, 213, 0, 0, 104, 0, 0, 0, ! 100, 91, 89, 95, 250, 279, 0, 267, 273, 0, ! 268, 0, 0, 0, 18, 19, 240, 138, 137, 0, ! 249, 248, 280, 0, 264, 0, 247, 262, 246, 263, ! 278, 0, 0, 310, 311, 312, 314, 315, 317, 318, ! 319, 322, 324, 321, 323, 0, 325, 327, 328, 330, ! 332, 334, 336, 338, 0, 343, 0, 225, 220, 224, ! 0, 0, 0, 0, 229, 232, 230, 222, 240, 151, ! 0, 0, 215, 0, 0, 105, 101, 115, 239, 106, ! 289, 0, 0, 0, 102, 0, 0, 274, 269, 272, ! 270, 271, 252, 0, 306, 0, 0, 307, 139, 141, ! 281, 0, 286, 0, 287, 254, 0, 0, 0, 201, ! 0, 0, 235, 233, 231, 0, 218, 0, 216, 215, ! 0, 103, 0, 107, 0, 0, 108, 284, 0, 275, ! 0, 251, 305, 308, 266, 265, 282, 0, 255, 256, ! 340, 0, 186, 0, 152, 0, 159, 160, 0, 161, ! 162, 0, 0, 189, 0, 0, 0, 0, 227, 226, ! 0, 109, 0, 0, 285, 259, 0, 283, 257, 0, ! 0, 177, 203, 0, 0, 0, 190, 0, 194, 0, ! 197, 0, 0, 207, 0, 0, 110, 0, 261, 0, ! 187, 215, 0, 200, 350, 0, 192, 195, 0, 191, ! 196, 198, 234, 205, 206, 0, 0, 111, 0, 0, ! 215, 199, 193, 113, 0, 0, 0, 0, 112, 0, ! 209, 0, 188, 208, 0, 0, 0 }; static const short yydefgoto[] = { ! 604, 175, 232, 176, 71, 72, 57, 50, 177, 178, ! 21, 22, 23, 7, 8, 9, 10, 11, 12, 13, ! 14, 237, 238, 111, 88, 41, 59, 87, 109, 133, ! 134, 135, 77, 95, 96, 97, 179, 137, 78, 93, ! 150, 151, 115, 153, 281, 139, 140, 141, 142, 380, ! 461, 462, 17, 38, 60, 55, 90, 39, 53, 80, ! 81, 82, 83, 180, 310, 239, 580, 241, 242, 243, ! 244, 523, 245, 246, 247, 248, 526, 249, 250, 251, ! 252, 527, 253, 533, 557, 558, 559, 560, 254, 255, ! 529, 256, 257, 258, 530, 259, 260, 372, 497, 498, ! 261, 262, 263, 264, 265, 266, 267, 444, 445, 446, ! 181, 182, 183, 184, 185, 510, 546, 186, 403, 187, ! 387, 388, 101, 188, 189, 190, 191, 192, 193, 194, ! 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, ! 205, 206, 207, 208, 209, 210, 211, 212, 344, 404, ! 575 }; static const short yypact[] = { ! 248,-32768, -49, -49, -49, -49,-32768,-32768, 283, 102, ! 283,-32768,-32768,-32768,-32768, 157,-32768,-32768,-32768,-32768, ! 374,-32768,-32768,-32768, -18, 80, 379, 102,-32768,-32768, ! 283, 102,-32768, -49, -49,-32768, 14, -49, 53, 59, ! -49, 116,-32768, -49, 102, -18, 80, 81,-32768,-32768, ! -32768, 98, 639,-32768, -49, 53,-32768,-32768, -49,-32768, ! 53, 59, 116,-32768,-32768, -49,-32768,-32768,-32768, -49, ! 154,-32768,-32768,-32768, 39, 898,-32768,-32768, 169,-32768, ! 827,-32768,-32768,-32768,-32768,-32768,-32768, 156, 190,-32768, ! 53,-32768, 183, -20, 183, 91,-32768, -10, -20, 192, ! 198, 198, -49, -49,-32768,-32768,-32768, -49, 263,-32768, ! -32768, 190, 343, -49, 209,-32768,-32768, -49, 1582, 234, ! -32768,-32768, 268, -20, 300, -20,-32768, 266, 2455,-32768, ! 291, 898,-32768, 546,-32768,-32768,-32768,-32768, 112,-32768, ! 284,-32768, 336,-32768,-32768,-32768,-32768,-32768, -49, 467, ! 87,-32768,-32768, 333,-32768,-32768,-32768, 2254, 2254, 2254, ! 2254, 339, 342, 243,-32768, 2254, 2254, 2254, 1453,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 136, 351, 486,-32768, ! -32768, 354, 384,-32768,-32768,-32768, -49,-32768, 373,-32768, ! 377, 378,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 216, ! 485, 345, 185, 478, 502, 508, 510, 512, -8,-32768, ! -32768,-32768, 473,-32768,-32768,-32768,-32768,-32768,-32768, 440, ! 443, 2254,-32768, -46, 1633, 447, 452, 284, 454, 93, ! 2254,-32768, -49, 136, 351, 370, 463, 429,-32768,-32768, ! 2522,-32768,-32768, 455,-32768,-32768,-32768, 2924,-32768,-32768, ! 459,-32768,-32768,-32768, 2924,-32768, 2924,-32768,-32768, 3042, ! 462,-32768,-32768,-32768,-32768,-32768, 474,-32768, 170, 205, ! 378, 524, 548,-32768,-32768,-32768, 449, 336,-32768,-32768, ! -32768,-32768,-32768,-32768, 487, 476, -49,-32768, 477, -49, ! 271,-32768,-32768,-32768,-32768,-32768,-32768, 513, -49, 491, ! 491, 497,-32768,-32768, 286, 486, 507,-32768, 514,-32768, ! 158, 539, 541, 1694, 1745, 141, 9, 2254, 516,-32768, ! -32768, 2254, 2254, 2254, 2254, 2254, 2254, 2254, 2254, 2254, ! 2254, 2254, 2254, 243, 2254, 2254, 2254, 2254, 2254, 2254, ! 2254, 2254,-32768,-32768, 2254, 2254, 522,-32768, 523,-32768, ! 525, 2254, 2254, 332,-32768,-32768, 526, 532, 530,-32768, ! -49,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 569, 467, ! -32768,-32768,-32768, 538, 1806, 2254,-32768, 214, 487, 2589, ! 549, 476,-32768,-32768,-32768, 554, 1745, 491,-32768, 406, ! 491, 406, 1857, 2254, 44, 222, 1257,-32768,-32768, 1521, ! -32768,-32768,-32768, 239,-32768, 551,-32768,-32768,-32768,-32768, ! 559, 556, 1918,-32768,-32768,-32768, 216, 216, 485, 485, ! 485, 345, 345, 345, 345, 154,-32768, 185, 185, 478, ! 502, 508, 510, 512, 568,-32768, 563,-32768,-32768,-32768, ! 566, 570, 573, 284, 332,-32768,-32768,-32768,-32768, 530, ! 576, 1050, 1050, 564, 578,-32768, 571, 342, 580,-32768, ! 715, 2656, 581, 2723,-32768, 1969, 583,-32768, 198,-32768, ! 198,-32768, 584, 277,-32768, 2254, 1257,-32768,-32768,-32768, ! -32768, 1402,-32768, 2030,-32768, 190, 294, 2254, 2991,-32768, ! 589, 477,-32768,-32768,-32768, 2254,-32768, 582, 538, 1050, ! 24,-32768, 309,-32768, 2790, 2081,-32768,-32768, 341,-32768, ! 190, 592,-32768,-32768,-32768,-32768,-32768, 344,-32768, 190, ! -32768, 597,-32768, 637, 643, 2991,-32768,-32768, 2991,-32768, ! -32768, 596, -21,-32768, 609, 610, 2924, 615,-32768,-32768, ! 617,-32768, 613, 353,-32768,-32768, 190,-32768,-32768, 2254, ! 2924,-32768,-32768, 2142, 626, 2254,-32768, -11,-32768, 2321, ! -32768, 284, 616,-32768, 2924, 2193,-32768, 619,-32768, 625, ! -32768, 1050, 623,-32768,-32768, 635,-32768,-32768, 2388,-32768, ! 2857,-32768,-32768,-32768,-32768, 627, 376,-32768, 2991, 633, ! 1050,-32768,-32768,-32768, 630, 675, 2991, 638,-32768, 2991, ! -32768, 2991,-32768,-32768, 734, 735,-32768 }; static const short yypgoto[] = { ! -32768,-32768, -1, 375, 404, 54, -102, 19, 23, 82, ! -27,-32768, -3,-32768, 728, 167,-32768, 144,-32768,-32768, ! 253, 5, 796,-32768,-32768, 694, 679,-32768, -87,-32768, ! 618,-32768, -65, -99, 629, -139, -166,-32768, 20, -43, ! 471, -280, -53,-32768,-32768,-32768,-32768,-32768, 622, 371, ! -32768,-32768, 63,-32768,-32768,-32768,-32768, 703, 3,-32768, ! 676,-32768,-32768, 128,-32768, -69, -125, -228,-32768, 499, ! 181, -298, -478, 258, -472,-32768,-32768,-32768, -253,-32768, ! -32768,-32768,-32768,-32768,-32768, 202, 204, -511, -433,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, -423,-32768, -481, 503, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 319, 321, ! -32768,-32768,-32768, 88,-32768,-32768,-32768,-32768, -233,-32768, ! 466, 56, -26, 1059, 193, 1090, 251, 381, 439, -137, ! 544, 614, -379,-32768, 275, 203, 288, 270, 431, 433, ! 430, 435, 432,-32768, 298, 434, 732,-32768,-32768, 855, ! -32768 }; ! ! #define YYLAST 3152 ! ! static const short yytable[] = { ! 24, 25, 309, 240, 124, 15, 371, 340, 382, 285, ! 524, 152, 362, 15, 15, 15, 525, 477, 537, 47, ! 293, 294, 295, 296, 146, 538, 98, 554, 302, 303, ! 45, 46, 15, 48, 113, 15, 15, 554, 19, 144, ! 48, 19, 555, 136, 100, 120, 37, 524, 581, 15, ! 524, 69, 555, 525, 347, 528, 525, 75, 85, 123, ! 125, 301, 92, 89, 144, 531, 94, 581, 136, 282, ! 216, 283, 218, 84, 103, 73, 556, 86, 114, 69, ! 341, 130, 409, 118, 20, 75, 576, 26, 119, 284, ! 589, 49, 528, 110, 56, 528, 19, 513, 73, 92, ! 94, 19, 531, 73, 130, 531, 130, 69, 49, 597, ! 524, 148, 49, 131, 155, 79, 525, 149, 524, 51, ! 128, 524, 51, 524, 525, 236, 126, 525, 138, 525, ! 103, 73, 69, 358, 74, 73, 51, 99, 131, 475, ! 51, 43, 122, 79, 40, 155, 1, 381, 286, 52, ! 100, 234, 28, 138, 73, 528, 73, 74, 353, 473, ! 54, 49, 74, 528, 3, 531, 528, 56, 528, 58, ! 4, 143, 73, 531, 28, 27, 531, 31, 531, 486, ! 19, 63, 287, 318, 413, 414, 415, 383, 288, 51, ! 74, 116, 117, 355, 74, 51, 143, 44, 496, 371, ! 43, 32, 6, 329, 330, 331, 332, 100, 128, 406, ! 235, 534, 280, 74, 407, 74, 268, 300, 408, 33, ! 348, 321, 322, 323, 378, 34, 356, 551, 19, 155, ! 552, 74, 508, 479, 99, 362, 360, 236, 311, 290, ! 290, 290, 290, 333, 236, 51, 371, 290, 290, 305, ! 517, 236, 99, 236, 463, 398, 474, 107, 18, 399, ! 73, 449, 29, 234, 369, -185, 18, 18, 18, 104, ! -185, -185, 543, 389, 391, 148, 362, 112, 394, 395, ! 29, 149, 234, 155, 29, 18, 108, 148, 18, 18, ! 595, 121, 1, 149, 64, 385, 122, 29, 600, 73, ! -184, 602, 18, 603, 2, -184, -184, 127, 154, 455, ! 3, 73, 48, 410, 64, 288, 4, 476, 371, 74, ! 122, 269, 235, 65, 5, 3, 66, 1, 268, 67, ! 19, 4, 586, 214, 480, 268, 504, 371, 512, 2, ! 481, 235, 268, 56, 268, 3, 66, 268, 6, 67, ! 19, 4, 362, 326, 327, 328, 73, 155, 74, 128, ! 129, 468, -99, 6, 470, 313, 145, 215, 360, 314, ! 74, 51, 511, 315, 492, 540, 236, 406, 481, 270, ! 128, 393, 407, 6, 99, 276, 408, 1, 311, 519, ! 113, 145, 73, 442, 64, 481, 19, 443, 518, 100, ! 217, 117, 234, 290, 290, 290, 290, 290, 290, 290, ! 290, 290, 290, 290, 290, 74, 290, 290, 290, 290, ! 290, 290, 290, 545, 319, 320, 66, 70, 365, 67, ! 19, 539, 548, 269, 289, 367, 544, 368, 147, 547, ! 269, 297, 481, 467, 298, 481, 467, 269, 567, 269, ! 70, 74, 269, 312, 481, 70, 316, -15, 236, 568, ! 236, 460, -344, -344, 313, -345, -345, 268, 314, -346, ! -346, 594, 315, 32, 35, 290, 36, 481, 290, 42, ! 64, 43, 317, 70, 234, 236, 234, 70, 324, 325, ! 148, 270, 582, 1, 334, 335, 149, 34, 270, 48, ! 64, 236, 168, 233, 122, 270, 70, 270, 70, 271, ! 270, 32, 66, 336, 73, 67, 19, 469, 64, 471, ! 337, 1, 236, 338, 70, 236, 339, 234, 64, 418, ! 419, 420, 66, 236, -228, 67, 19, 345, 299, 268, ! 268, 351, 304, 235, 376, 235, 352, 236, 354, 268, ! 66, 268, 359, 67, 19, 363, 236, 290, 290, 366, ! 66, 236, 374, 67, 19, 342, 343, 272, 375, 290, ! -290, -290, 269, 74, 119, 236, 268, 236, -344, -344, ! 313, 384, 234, 379, 314, 236, 235, 268, 315, 386, ! 127, 392, 268, 236, -291, -291, 236, 64, 236, 416, ! 417, 234, 396, 234, 427, 428, 65, 400, 3, 401, ! 412, 397, 70, 268, 4, 233, 268, 421, 422, 423, ! 424, 271, 437, 438, 268, 439, 447, 448, 271, 66, ! 270, 117, 67, 19, 233, 271, 450, 271, 268, 451, ! 271, 235, 128, 278, 269, 269, 6, 268, 465, 464, ! 482, 70, 268, 483, 269, 484, 269, 487, 488, 268, ! 235, 489, 235, 70, 499, 490, 268, 491, 268, 522, ! 495, 501, 273, 500, -114, 505, 268, 536, 268, 272, ! -258, 269, 509, 1, 268, 532, 272, 268, -260, 268, ! 64, 549, 269, 272, 550, 272, 553, 269, 272, 65, ! -158, 3, 270, 270, 561, 562, 365, 4, 425, 367, ! 564, 565, 270, 566, 270, 573, 583, 563, 269, 587, ! 588, 269, 66, 590, 591, 67, 19, 593, 596, 269, ! 598, 570, 599, 601, 605, 606, 68, 426, 30, 270, ! 62, 91, 274, 269, 70, 584, 156, 377, 61, 456, ! 270, 279, 269, 277, 233, 270, 106, 269, 370, 577, ! 271, 578, 373, 493, 269, 494, 390, 429, 431, 522, ! 430, 269, 433, 269, 432, 0, 270, 563, 435, 270, ! 570, 269, 584, 269, 273, 520, 0, 270, 0, 269, ! 0, 273, 269, 0, 269, 0, 16, 0, 273, 0, ! 273, 270, -15, 273, 16, 16, 16, -344, -344, 313, ! 270, 0, 0, 314, 0, 270, 0, 502, 272, 0, ! 0, 0, 270, 16, 0, 0, 16, 16, 0, 270, ! 0, 270, 271, 271, 0, 0, 233, 0, 233, 270, ! 16, 270, 271, 0, 271, 0, 0, 270, 76, 0, ! 270, 0, 270, 0, 274, 0, 0, 0, 0, 0, ! 275, 274, 0, 0, 0, 0, 70, 0, 274, 271, ! 274, 1, 0, 274, 0, 0, 76, 0, 64, 233, ! 271, 0, 0, 0, 0, 271, 0, 65, 0, 3, ! 272, 272, 0, 0, 0, 4, 0, 0, 0, 0, ! 272, 0, 272, 0, 132, 0, 271, 0, 0, 271, ! 66, 0, 0, 67, 19, 0, 0, 271, 0, 0, ! 0, 0, 0, 273, 105, 0, 0, 272, 0, 132, ! 0, 271, 0, 0, 233, 0, 0, 0, 272, 0, ! 271, 0, 32, 272, 0, 271, 0, 0, 0, 64, ! 0, 0, 271, 233, 0, 233, 0, 0, 102, 271, ! 33, 271, 0, 0, 272, 0, 34, 272, 0, 271, ! 0, 271, 275, 213, 0, 272, 0, 271, 0, 275, ! 271, 66, 271, 0, 67, 19, 275, 0, 275, 272, ! 0, 275, 0, 274, 0, 273, 273, 0, 272, 0, ! 0, 0, 0, 272, 0, 273, 0, 273, 0, 0, ! 272, 0, 0, 0, 0, 0, 0, 272, 0, 272, ! 0, 0, 306, 213, 0, 0, 0, 272, 0, 272, ! 0, 0, 273, 0, 0, 272, 0, 0, 272, 0, ! 272, 0, 0, 273, 0, 0, 0, 0, 273, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 274, 274, 0, 0, 273, ! 0, 0, 273, 0, 0, 274, 346, 274, 0, 350, ! 273, 0, 0, 0, 0, 357, 0, 0, 0, 0, ! 0, 0, 0, 0, 273, 0, 159, 160, 0, 0, ! 0, 64, 274, 273, 0, 0, 0, 0, 273, 0, ! 161, 275, 0, 274, 0, 273, 162, 0, 274, 0, ! 0, 0, 273, 163, 273, 0, 0, 164, 0, 0, ! 0, 0, 273, 66, 273, 0, 67, 19, 0, 274, ! 273, 0, 274, 273, 230, 273, 0, 0, 0, 0, ! 274, 0, 0, 169, 170, 171, 172, 0, 0, 173, ! 174, 0, 0, 0, 274, 0, 0, 0, 0, 405, ! 0, 0, 411, 274, 0, 0, 0, 0, 274, 0, ! 0, 0, 0, 275, 275, 274, 0, 0, 0, 0, ! 0, 0, 274, 275, 274, 275, 434, 0, 0, 0, ! 436, 0, 274, 0, 274, 0, 440, 441, 0, 0, ! 274, 0, 0, 274, 0, 274, 291, 291, 291, 291, ! 275, 0, 0, 0, 291, 291, 0, 0, 0, 453, ! 454, 275, 0, 0, 0, 0, 275, 0, 0, 0, ! 0, 466, 0, 0, 0, 0, 0, 292, 292, 292, ! 292, 0, 0, 0, 213, 292, 292, 275, 0, 0, ! 275, 0, 0, 0, 0, 0, 0, 0, 275, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 275, 0, 0, 0, 0, 0, 0, 0, ! 0, 275, 0, 0, 0, 0, 275, 0, 0, 0, ! 0, 0, 0, 275, 0, 0, 0, 0, 64, 0, ! 275, 0, 275, 0, 0, 0, 0, 161, 0, 0, ! 275, 0, 275, 162, 0, 0, 0, 0, 275, 0, ! 163, 275, 0, 275, 164, 0, 515, 0, 0, 0, ! 66, 0, 0, 67, 19, 0, 0, 165, 166, 0, ! 535, 167, 0, 0, 0, 0, 0, 0, 0, 0, ! 169, 170, 171, 172, 0, 0, 173, 174, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 291, 291, 291, 291, 291, 291, 291, 291, 291, 291, ! 291, 291, 0, 291, 291, 291, 291, 291, 291, 291, ! 0, 0, 0, 514, 569, 157, 158, 0, 572, 0, ! 574, 292, 292, 292, 292, 292, 292, 292, 292, 292, ! 292, 292, 292, 0, 292, 292, 292, 292, 292, 292, ! 292, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 159, 160, ! 0, 0, 291, 64, 0, 291, 157, 158, 0, 0, ! 0, 0, 161, 0, 0, 0, 0, 0, 162, 0, ! 0, 0, 0, 0, 0, 163, 0, 0, 0, 164, ! 0, 0, 0, 292, 0, 66, 292, 0, 67, 19, ! 0, 0, 165, 166, 0, 0, 167, 0, 0, 159, ! 160, 0, 0, 0, 64, 169, 170, 171, 172, 0, ! 0, 173, 174, 161, 0, 0, 0, 0, 0, 162, ! 0, 0, 0, 0, 157, 158, 163, 0, 0, 0, ! 164, 0, 0, 0, 291, 291, 66, 0, 0, 67, ! 19, 0, 0, 165, 166, 0, 291, 167, 0, 168, ! 307, 0, 0, 0, 308, 0, 169, 170, 171, 172, ! 0, 0, 173, 174, 0, 292, 292, 159, 160, 0, ! 0, 0, 64, 0, 0, 0, 0, 292, 0, 0, ! 0, 161, 0, 0, 0, 157, 158, 162, 0, 0, ! 0, 0, 0, 0, 163, 0, 0, 0, 164, 0, ! 0, 0, 0, 0, 66, 0, 0, 67, 19, 0, ! 0, 165, 166, 0, 0, 167, 0, 168, 478, 0, ! 0, 0, 0, 0, 169, 170, 171, 172, 159, 160, ! 173, 174, 0, 64, 0, 0, 157, 158, 0, 0, ! 0, 0, 161, 0, 0, 0, 0, 0, 162, 0, ! 0, 0, 0, 0, 0, 163, 0, 0, 0, 164, ! 0, 0, 0, 0, 0, 66, 0, 0, 67, 19, ! 0, 0, 165, 166, 0, 0, 167, 0, 168, 159, ! 160, 0, 0, 0, 64, 169, 170, 171, 172, 0, ! 0, 173, 174, 161, 0, 0, 0, 157, 158, 162, ! 0, 0, 0, 0, 0, 0, 163, 0, 0, 0, ! 164, 0, 0, 0, 0, 0, 66, 0, 0, 67, ! 19, 0, 0, 165, 166, 0, 0, 167, 0, 0, ! 0, 0, 0, 349, 0, 0, 169, 170, 171, 172, ! 159, 160, 173, 174, 0, 64, 0, 0, 157, 158, ! 0, 0, 0, 0, 161, 0, 0, 0, 0, 0, ! 162, 0, 0, 0, 0, 0, 0, 163, 0, 0, ! 0, 164, 0, 0, 0, 0, 0, 66, 0, 0, ! 67, 19, 0, 0, 165, 166, 0, 0, 167, 402, ! 0, 159, 160, 0, 0, 0, 64, 169, 170, 171, ! 172, 0, 0, 173, 174, 161, 0, 0, 0, 157, ! 158, 162, 0, 0, 0, 0, 0, 0, 163, 0, ! 0, 0, 164, 0, 0, 0, 0, 0, 66, 0, ! 0, 67, 19, 0, 0, 165, 166, 0, 0, 167, ! 0, 0, 0, 0, 121, 0, 0, 0, 169, 170, ! 171, 172, 159, 160, 173, 174, 0, 64, 0, 0, ! 157, 158, 0, 0, 0, 0, 161, 0, 0, 0, ! 0, 0, 162, 0, 0, 0, 0, 0, 0, 163, ! 0, 0, 0, 164, 0, 0, 0, 0, 0, 66, ! 0, 0, 67, 19, 0, 0, 165, 166, 0, 0, ! 167, 0, 0, 159, 160, 0, 452, 0, 64, 169, ! 170, 171, 172, 0, 0, 173, 174, 161, 0, 0, ! 0, 157, 158, 162, 0, 0, 0, 0, 0, 0, ! 163, 0, 0, 0, 164, 0, 0, 0, 0, 0, ! 66, 0, 0, 67, 19, 0, 0, 165, 166, 0, ! 0, 167, 472, 0, 0, 0, 0, 0, 0, 0, ! 169, 170, 171, 172, 159, 160, 173, 174, 0, 64, ! 0, 0, 157, 158, 0, 0, 0, 0, 161, 0, ! 0, 0, 0, 0, 162, 0, 0, 0, 0, 0, ! 0, 163, 0, 0, 0, 164, 0, 0, 0, 0, ! 0, 66, 0, 0, 67, 19, 0, 0, 165, 166, ! 0, 0, 167, 485, 0, 159, 160, 0, 0, 0, ! 64, 169, 170, 171, 172, 0, 0, 173, 174, 161, ! 0, 0, 0, 157, 158, 162, 0, 0, 0, 0, ! 0, 0, 163, 0, 0, 0, 164, 0, 0, 0, ! 0, 0, 66, 0, 0, 67, 19, 0, 0, 165, ! 166, 0, 0, 167, 507, 0, 0, 0, 0, 0, ! 0, 0, 169, 170, 171, 172, 159, 160, 173, 174, ! 0, 64, 0, 0, 157, 158, 0, 0, 0, 0, ! 161, 0, 0, 0, 0, 0, 162, 0, 0, 0, ! 0, 0, 0, 163, 0, 0, 0, 164, 0, 0, ! 0, 0, 0, 66, 0, 0, 67, 19, 0, 0, ! 165, 166, 0, 0, 167, 516, 0, 159, 160, 0, ! 0, 0, 64, 169, 170, 171, 172, 0, 0, 173, ! 174, 161, 0, 0, 0, 157, 158, 162, 0, 0, ! 0, 0, 0, 0, 163, 0, 0, 0, 164, 0, ! 0, 0, 0, 0, 66, 0, 0, 67, 19, 0, ! 0, 165, 166, 0, 0, 167, 542, 0, 0, 0, ! 0, 0, 0, 0, 169, 170, 171, 172, 159, 160, ! 173, 174, 0, 64, 0, 0, 157, 158, 0, 0, ! 0, 0, 161, 0, 0, 0, 0, 0, 162, 0, ! 0, 0, 0, 0, 0, 163, 0, 0, 0, 164, ! 0, 0, 0, 0, 0, 66, 0, 0, 67, 19, ! 0, 0, 165, 166, 0, 0, 167, 0, 0, 159, ! 160, 0, 571, 0, 64, 169, 170, 171, 172, 0, ! 0, 173, 174, 161, 0, 0, 0, 157, 158, 162, 0, 0, 0, 0, 0, 0, 163, 0, 0, 0, ! 164, 0, 0, 0, 0, 0, 66, 0, 0, 67, ! 19, 0, 0, 165, 166, 0, 0, 167, 585, 0, ! 0, 0, 0, 0, 0, 0, 169, 170, 171, 172, ! 159, 160, 173, 174, 0, 64, 0, 0, 0, 0, ! 0, 0, 0, 0, 161, 0, 0, 0, 0, 0, ! 162, 0, 0, 0, 0, 0, 0, 163, 0, 0, ! 0, 164, 0, 0, 0, 0, 0, 66, 0, 0, ! 67, 19, 0, 0, 165, 166, 0, 0, 167, 0, ! 0, 0, 0, 0, 0, 0, 0, 169, 170, 171, ! 172, 0, 0, 173, 174, 219, 0, 159, 160, 554, ! 220, 221, 64, 222, 0, 0, 223, 0, 0, 0, ! 224, 161, 0, 0, 555, 0, 0, 162, 225, 4, ! 226, 0, 227, 228, 163, 229, 0, 0, 164, 0, ! 0, 0, 0, 0, 66, 0, 0, 67, 19, 0, ! 0, 0, 0, 0, 0, 230, 0, 128, 579, 0, ! 0, 6, 0, 0, 169, 170, 171, 172, 0, 0, ! 173, 174, 219, 0, 159, 160, 554, 220, 221, 64, ! 222, 0, 0, 223, 0, 0, 0, 224, 161, 0, ! 0, 555, 0, 0, 162, 225, 4, 226, 0, 227, ! 228, 163, 229, 0, 0, 164, 0, 0, 0, 0, ! 0, 66, 0, 0, 67, 19, 0, 0, 0, 0, ! 0, 0, 230, 0, 128, 592, 0, 0, 6, 0, ! 0, 169, 170, 171, 172, 0, 0, 173, 174, 219, ! 0, 159, 160, 0, 220, 221, 64, 222, 0, 0, ! 223, 0, 0, 0, 224, 161, 0, 0, 0, 0, ! 0, 162, 225, 4, 226, 0, 227, 228, 163, 229, ! 0, 0, 164, 0, 0, 0, 0, 0, 66, 0, ! 0, 67, 19, 0, 0, 0, 0, 0, 0, 230, ! 0, 128, 231, 0, 0, 6, 0, 0, 169, 170, ! 171, 172, 0, 0, 173, 174, 219, 0, 159, 160, ! 0, 220, 221, 64, 222, 0, 0, 223, 0, 0, ! 0, 224, 161, 0, 0, 0, 0, 0, 162, 225, ! 4, 226, 0, 227, 228, 163, 229, 0, 0, 164, ! 0, 0, 0, 0, 0, 66, 0, 0, 67, 19, ! 0, 0, 0, 0, 0, 0, 230, 0, 128, 361, ! 0, 0, 6, 0, 0, 169, 170, 171, 172, 0, ! 0, 173, 174, 219, 0, 159, 160, 0, 220, 221, ! 64, 222, 0, 0, 223, 0, 0, 0, 224, 161, ! 0, 0, 0, 0, 0, 457, 225, 4, 226, 0, ! 227, 228, 163, 229, 0, 0, 458, 0, 0, 0, ! 0, 0, 66, 0, 0, 67, 19, 0, 0, 0, ! 0, 0, 0, 230, 0, 128, 459, 0, 0, 6, ! 0, 0, 169, 170, 171, 172, 0, 0, 173, 174, ! 219, 0, 159, 160, 0, 220, 221, 64, 222, 0, ! 0, 223, 0, 0, 0, 224, 161, 0, 0, 0, ! 0, 0, 162, 225, 4, 226, 0, 227, 228, 163, ! 229, 0, 0, 164, 0, 0, 0, 0, 0, 66, ! 0, 0, 67, 19, 0, 0, 0, 0, 0, 0, ! 230, 0, 128, 503, 0, 0, 6, 0, 0, 169, ! 170, 171, 172, 0, 0, 173, 174, 219, 0, 159, ! 160, 0, 220, 221, 64, 222, 0, 0, 223, 0, ! 0, 0, 224, 161, 0, 0, 0, 0, 0, 162, ! 225, 4, 226, 0, 227, 228, 163, 229, 0, 0, ! 164, 0, 0, 0, 0, 0, 66, 0, 0, 67, ! 19, 0, 0, 0, 0, 0, 0, 230, 0, 128, ! 506, 0, 0, 6, 0, 0, 169, 170, 171, 172, ! 0, 0, 173, 174, 219, 0, 159, 160, 0, 220, ! 221, 64, 222, 0, 0, 223, 0, 0, 0, 224, ! 161, 0, 0, 0, 0, 0, 162, 225, 4, 226, ! 0, 227, 228, 163, 229, 0, 0, 164, 0, 0, ! 0, 0, 0, 66, 0, 0, 67, 19, 0, 0, ! 0, 0, 0, 0, 230, 0, 128, 541, 0, 0, ! 6, 0, 0, 169, 170, 171, 172, 0, 0, 173, ! 174, 219, 0, 159, 160, 0, 220, 221, 64, 222, ! 0, 0, 223, 0, 0, 0, 224, 161, 0, 0, ! 0, 0, 0, 162, 225, 4, 226, 0, 227, 228, ! 163, 229, 0, 0, 164, 0, 0, 0, 0, 0, ! 66, 0, 0, 67, 19, 0, 0, 0, 0, 0, ! 0, 230, 0, 128, 0, 0, 0, 6, 0, 0, ! 169, 170, 171, 172, 0, 0, 173, 174, 364, 0, ! 159, 160, 0, 220, 221, 64, 222, 0, 0, 223, ! 0, 0, 0, 224, 161, 0, 0, 0, 0, 0, ! 162, 225, 0, 226, 0, 227, 228, 163, 229, 0, ! 0, 164, 0, 0, 0, 0, 0, 66, 0, 0, ! 67, 19, 0, 0, 0, 0, 0, 0, 230, 0, ! 128, 0, 0, 0, 6, 0, 0, 169, 170, 171, ! 172, 0, 0, 173, 174, 364, 0, 159, 160, 0, ! 521, 221, 64, 222, 0, 0, 223, 0, 0, 0, ! 224, 161, 0, 0, 0, 0, 0, 162, 225, 0, ! 226, 0, 227, 228, 163, 229, 0, 0, 164, 0, ! 0, 0, 0, 0, 66, 0, 0, 67, 19, 0, ! 0, 0, 0, 0, 0, 230, 1, 128, 159, 160, ! 0, 6, 0, 64, 169, 170, 171, 172, 0, 0, ! 173, 174, 161, 0, 0, 0, 0, 0, 162, 0, ! 0, 0, 0, 0, 0, 163, 0, 0, 0, 164, ! 0, 0, 0, 0, 0, 66, 0, 0, 67, 19, ! 0, 0, 0, 0, 0, 0, 230, 0, 0, 0, ! 0, 0, 0, 0, 0, 169, 170, 171, 172, 0, ! 0, 173, 174 }; static const short yycheck[] = { ! 3, 4, 168, 128, 103, 0, 259, 15, 288, 148, ! 488, 113, 240, 8, 9, 10, 488, 396, 499, 5, ! 157, 158, 159, 160, 111, 1, 69, 48, 165, 166, ! 33, 34, 27, 36, 54, 30, 31, 48, 87, 108, ! 43, 87, 63, 108, 70, 98, 64, 525, 559, 44, ! 528, 52, 63, 525, 100, 488, 528, 52, 55, 102, ! 103, 163, 65, 60, 133, 488, 69, 578, 133, 138, ! 123, 140, 125, 54, 75, 52, 97, 58, 98, 80, ! 88, 108, 73, 93, 2, 80, 97, 5, 98, 142, ! 571, 37, 525, 90, 40, 528, 87, 476, 75, 102, ! 103, 87, 525, 80, 131, 528, 133, 108, 54, 590, ! 588, 112, 58, 108, 117, 52, 588, 112, 596, 37, ! 96, 599, 40, 601, 596, 128, 107, 599, 108, 601, ! 131, 108, 133, 232, 52, 112, 54, 98, 133, 95, ! 58, 102, 98, 80, 64, 148, 44, 286, 149, 96, ! 176, 128, 8, 133, 131, 588, 133, 75, 227, 392, ! 101, 107, 80, 596, 62, 588, 599, 113, 601, 53, ! 68, 108, 149, 596, 30, 8, 599, 10, 601, 412, ! 87, 100, 95, 186, 321, 322, 323, 289, 101, 107, ! 108, 100, 101, 100, 112, 113, 133, 30, 451, 452, ! 102, 44, 100, 18, 19, 20, 21, 233, 96, 68, ! 128, 491, 100, 131, 73, 133, 128, 163, 77, 62, ! 223, 5, 6, 7, 277, 68, 229, 525, 87, 232, ! 528, 149, 465, 399, 98, 463, 237, 240, 102, 157, ! 158, 159, 160, 58, 247, 163, 499, 165, 166, 167, ! 483, 254, 98, 256, 379, 97, 393, 101, 0, 101, ! 237, 360, 9, 240, 259, 95, 8, 9, 10, 100, ! 100, 101, 505, 299, 300, 276, 504, 94, 304, 305, ! 27, 276, 259, 286, 31, 27, 96, 288, 30, 31, ! 588, 99, 44, 288, 51, 298, 98, 44, 596, 276, ! 95, 599, 44, 601, 56, 100, 101, 44, 99, 95, ! 62, 288, 315, 316, 51, 101, 68, 95, 571, 237, ! 98, 128, 240, 60, 76, 62, 83, 44, 240, 86, ! 87, 68, 565, 99, 95, 247, 461, 590, 475, 56, ! 101, 259, 254, 289, 256, 62, 83, 259, 100, 86, ! 87, 68, 580, 8, 9, 10, 333, 360, 276, 96, ! 97, 387, 96, 100, 390, 94, 108, 99, 369, 98, ! 288, 289, 95, 102, 443, 66, 379, 68, 101, 128, ! 96, 95, 73, 100, 98, 94, 77, 44, 102, 95, ! 54, 133, 369, 61, 51, 101, 87, 65, 485, 425, ! 100, 101, 379, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, ! 338, 339, 340, 510, 46, 47, 83, 52, 247, 86, ! 87, 500, 519, 240, 101, 254, 95, 256, 95, 95, ! 247, 102, 101, 387, 102, 101, 390, 254, 95, 256, ! 75, 369, 259, 102, 101, 80, 102, 87, 461, 546, ! 463, 379, 92, 93, 94, 92, 93, 379, 98, 92, ! 93, 95, 102, 44, 100, 393, 102, 101, 396, 100, ! 51, 102, 98, 108, 461, 488, 463, 112, 3, 4, ! 491, 240, 561, 44, 16, 17, 491, 68, 247, 502, ! 51, 504, 96, 128, 98, 254, 131, 256, 133, 128, ! 259, 44, 83, 11, 491, 86, 87, 389, 51, 391, ! 12, 44, 525, 13, 149, 528, 14, 504, 51, 326, ! 327, 328, 83, 536, 94, 86, 87, 94, 163, 451, ! 452, 94, 167, 461, 95, 463, 94, 550, 94, 461, ! 83, 463, 89, 86, 87, 100, 559, 475, 476, 100, ! 83, 564, 100, 86, 87, 92, 93, 128, 94, 487, ! 46, 47, 379, 491, 98, 578, 488, 580, 92, 93, ! 94, 68, 559, 96, 98, 588, 504, 499, 102, 98, ! 44, 94, 504, 596, 46, 47, 599, 51, 601, 324, ! 325, 578, 95, 580, 334, 335, 60, 68, 62, 68, ! 94, 97, 237, 525, 68, 240, 528, 329, 330, 331, ! 332, 240, 100, 100, 536, 100, 100, 95, 247, 83, ! 379, 101, 86, 87, 259, 254, 67, 256, 550, 101, ! 259, 559, 96, 97, 451, 452, 100, 559, 94, 100, ! 99, 276, 564, 94, 461, 99, 463, 89, 95, 571, ! 578, 95, 580, 288, 100, 95, 578, 94, 580, 488, ! 94, 100, 128, 95, 94, 94, 588, 95, 590, 240, ! 96, 488, 99, 44, 596, 96, 247, 599, 96, 601, ! 51, 94, 499, 254, 57, 256, 100, 504, 259, 60, ! 57, 62, 451, 452, 95, 95, 525, 68, 333, 528, ! 95, 94, 461, 100, 463, 89, 100, 536, 525, 100, ! 95, 528, 83, 100, 89, 86, 87, 100, 95, 536, ! 100, 550, 57, 95, 0, 0, 97, 333, 10, 488, ! 46, 62, 128, 550, 369, 564, 117, 276, 45, 378, ! 499, 133, 559, 131, 379, 504, 80, 564, 259, 557, ! 379, 557, 259, 444, 571, 444, 300, 336, 338, 588, ! 337, 578, 340, 580, 339, -1, 525, 596, 344, 528, ! 599, 588, 601, 590, 240, 487, -1, 536, -1, 596, ! -1, 247, 599, -1, 601, -1, 0, -1, 254, -1, ! 256, 550, 87, 259, 8, 9, 10, 92, 93, 94, ! 559, -1, -1, 98, -1, 564, -1, 102, 379, -1, ! -1, -1, 571, 27, -1, -1, 30, 31, -1, 578, ! -1, 580, 451, 452, -1, -1, 461, -1, 463, 588, ! 44, 590, 461, -1, 463, -1, -1, 596, 52, -1, ! 599, -1, 601, -1, 240, -1, -1, -1, -1, -1, ! 128, 247, -1, -1, -1, -1, 491, -1, 254, 488, ! 256, 44, -1, 259, -1, -1, 80, -1, 51, 504, ! 499, -1, -1, -1, -1, 504, -1, 60, -1, 62, ! 451, 452, -1, -1, -1, 68, -1, -1, -1, -1, ! 461, -1, 463, -1, 108, -1, 525, -1, -1, 528, ! 83, -1, -1, 86, 87, -1, -1, 536, -1, -1, ! -1, -1, -1, 379, 97, -1, -1, 488, -1, 133, ! -1, 550, -1, -1, 559, -1, -1, -1, 499, -1, ! 559, -1, 44, 504, -1, 564, -1, -1, -1, 51, ! -1, -1, 571, 578, -1, 580, -1, -1, 60, 578, ! 62, 580, -1, -1, 525, -1, 68, 528, -1, 588, ! -1, 590, 240, 118, -1, 536, -1, 596, -1, 247, ! 599, 83, 601, -1, 86, 87, 254, -1, 256, 550, ! -1, 259, -1, 379, -1, 451, 452, -1, 559, -1, ! -1, -1, -1, 564, -1, 461, -1, 463, -1, -1, ! 571, -1, -1, -1, -1, -1, -1, 578, -1, 580, ! -1, -1, 167, 168, -1, -1, -1, 588, -1, 590, ! -1, -1, 488, -1, -1, 596, -1, -1, 599, -1, ! 601, -1, -1, 499, -1, -1, -1, -1, 504, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 451, 452, -1, -1, 525, ! -1, -1, 528, -1, -1, 461, 221, 463, -1, 224, ! 536, -1, -1, -1, -1, 230, -1, -1, -1, -1, ! -1, -1, -1, -1, 550, -1, 46, 47, -1, -1, ! -1, 51, 488, 559, -1, -1, -1, -1, 564, -1, ! 60, 379, -1, 499, -1, 571, 66, -1, 504, -1, ! -1, -1, 578, 73, 580, -1, -1, 77, -1, -1, ! -1, -1, 588, 83, 590, -1, 86, 87, -1, 525, ! 596, -1, 528, 599, 94, 601, -1, -1, -1, -1, ! 536, -1, -1, 103, 104, 105, 106, -1, -1, 109, ! 110, -1, -1, -1, 550, -1, -1, -1, -1, 314, ! -1, -1, 317, 559, -1, -1, -1, -1, 564, -1, ! -1, -1, -1, 451, 452, 571, -1, -1, -1, -1, ! -1, -1, 578, 461, 580, 463, 341, -1, -1, -1, ! 345, -1, 588, -1, 590, -1, 351, 352, -1, -1, ! 596, -1, -1, 599, -1, 601, 157, 158, 159, 160, ! 488, -1, -1, -1, 165, 166, -1, -1, -1, 374, ! 375, 499, -1, -1, -1, -1, 504, -1, -1, -1, ! -1, 386, -1, -1, -1, -1, -1, 157, 158, 159, ! 160, -1, -1, -1, 399, 165, 166, 525, -1, -1, ! 528, -1, -1, -1, -1, -1, -1, -1, 536, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 550, -1, -1, -1, -1, -1, -1, -1, ! -1, 559, -1, -1, -1, -1, 564, -1, -1, -1, ! -1, -1, -1, 571, -1, -1, -1, -1, 51, -1, ! 578, -1, 580, -1, -1, -1, -1, 60, -1, -1, ! 588, -1, 590, 66, -1, -1, -1, -1, 596, -1, ! 73, 599, -1, 601, 77, -1, 481, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, ! 495, 94, -1, -1, -1, -1, -1, -1, -1, -1, ! 103, 104, 105, 106, -1, -1, 109, 110, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, ! 331, 332, -1, 334, 335, 336, 337, 338, 339, 340, ! -1, -1, -1, 1, 549, 3, 4, -1, 553, -1, ! 555, 321, 322, 323, 324, 325, 326, 327, 328, 329, ! 330, 331, 332, -1, 334, 335, 336, 337, 338, 339, ! 340, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 46, 47, ! -1, -1, 393, 51, -1, 396, 3, 4, -1, -1, ! -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, ! -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, ! -1, -1, -1, 393, -1, 83, 396, -1, 86, 87, ! -1, -1, 90, 91, -1, -1, 94, -1, -1, 46, ! 47, -1, -1, -1, 51, 103, 104, 105, 106, -1, ! -1, 109, 110, 60, -1, -1, -1, -1, -1, 66, ! -1, -1, -1, -1, 3, 4, 73, -1, -1, -1, ! 77, -1, -1, -1, 475, 476, 83, -1, -1, 86, ! 87, -1, -1, 90, 91, -1, 487, 94, -1, 96, ! 97, -1, -1, -1, 101, -1, 103, 104, 105, 106, ! -1, -1, 109, 110, -1, 475, 476, 46, 47, -1, ! -1, -1, 51, -1, -1, -1, -1, 487, -1, -1, ! -1, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, ! -1, 90, 91, -1, -1, 94, -1, 96, 97, -1, ! -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, ! -1, -1, 90, 91, -1, -1, 94, -1, 96, 46, ! 47, -1, -1, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, ! 87, -1, -1, 90, 91, -1, -1, 94, -1, -1, ! -1, -1, -1, 100, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, --- 831,1656 ---- }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, ! 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, ! 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, ! 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, ! 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, ! 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, ! 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, ! 365 }; + # endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned short yyr1[] = { ! 0, 111, 112, 113, 113, 113, 113, 113, 113, 114, ! 114, 115, 115, 115, 116, 116, 117, 118, 119, 120, ! 120, 121, 121, 122, 123, 124, 125, 125, 125, 125, ! 125, 125, 125, 125, 126, 126, 127, 127, 128, 129, ! 129, 130, 131, 132, 132, 132, 133, 133, 135, 134, ! 136, 134, 137, 137, 138, 138, 139, 139, 140, 140, ! 141, 141, 142, 142, 142, 142, 143, 143, 143, 143, ! 143, 144, 144, 145, 145, 146, 146, 147, 147, 148, ! 148, 149, 150, 150, 150, 150, 151, 151, 151, 152, ! 152, 153, 153, 154, 154, 155, 155, 156, 156, 157, ! 158, 159, 159, 159, 159, 160, 160, 161, 161, 161, ! 161, 162, 162, 162, 162, 163, 163, 165, 164, 166, ! 164, 167, 164, 168, 164, 169, 169, 170, 170, 171, ! 171, 172, 172, 172, 172, 173, 174, 175, 175, 175, ! 175, 176, 176, 177, 177, 178, 178, 179, 179, 179, ! 180, 181, 181, 182, 182, 182, 182, 182, 182, 183, ! 183, 183, 183, 183, 184, 184, 184, 184, 184, 184, ! 184, 184, 184, 184, 184, 185, 186, 187, 188, 189, ! 190, 190, 190, 190, 190, 190, 190, 191, 192, 193, ! 194, 195, 195, 195, 195, 196, 196, 197, 198, 198, ! 199, 199, 200, 201, 202, 203, 204, 205, 205, 206, ! 206, 207, 208, 209, 209, 209, 210, 210, 211, 211, ! 212, 212, 213, 213, 214, 214, 215, 216, 216, 217, ! 218, 218, 218, 219, 219, 220, 221, 222, 222, 223, ! 223, 223, 223, 223, 223, 223, 223, 223, 224, 224, ! 224, 224, 225, 225, 225, 225, 225, 225, 225, 227, ! 226, 228, 226, 229, 229, 230, 230, 230, 231, 231, ! 231, 231, 231, 231, 232, 232, 233, 234, 234, 235, ! 235, 236, 236, 236, 236, 236, 236, 237, 237, 238, ! 238, 238, 238, 239, 240, 241, 241, 241, 241, 241, ! 242, 243, 244, 244, 244, 244, 245, 245, 245, 245, ! 246, 246, 246, 246, 247, 247, 247, 248, 248, 248, ! 248, 249, 249, 249, 249, 249, 249, 250, 250, 250, ! 251, 251, 252, 252, 253, 253, 254, 254, 255, 255, ! 256, 256, 257, 257, 258, 259, 259, 259, 260, 260, ! 261, 262 ! }; ! ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = ! { ! 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, ! 2, 1, 1, 1, 3, 1, 0, 1, 1, 1, ! 2, 2, 2, 3, 1, 2, 1, 2, 3, 1, ! 1, 3, 5, 1, 1, 1, 1, 2, 0, 7, ! 0, 6, 0, 2, 0, 2, 1, 3, 2, 3, ! 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 3, 4, 1, 3, 1, 3, 1, 3, 1, ! 1, 2, 3, 3, 4, 4, 3, 4, 3, 1, ! 3, 2, 3, 0, 2, 1, 3, 1, 1, 2, ! 1, 3, 4, 4, 5, 3, 4, 2, 3, 3, ! 4, 4, 5, 7, 6, 1, 1, 0, 4, 0, ! 5, 0, 5, 0, 6, 2, 3, 2, 3, 1, ! 2, 1, 1, 1, 1, 1, 2, 2, 3, 3, ! 4, 1, 3, 2, 3, 1, 2, 1, 1, 1, ! 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, ! 1, 1, 1, 1, 1, 1, 1, 5, 7, 7, ! 5, 2, 3, 3, 4, 1, 2, 2, 1, 2, ! 3, 2, 4, 2, 2, 1, 7, 7, 6, 7, ! 6, 2, 2, 0, 1, 1, 0, 1, 1, 3, ! 2, 3, 2, 3, 2, 3, 3, 5, 5, 1, ! 3, 3, 4, 1, 2, 5, 2, 1, 1, 1, ! 1, 3, 1, 1, 1, 1, 1, 3, 3, 3, ! 3, 3, 5, 4, 1, 4, 5, 5, 6, 0, ! 6, 0, 7, 3, 3, 1, 3, 3, 3, 3, ! 4, 4, 4, 4, 1, 2, 3, 2, 3, 3, ! 3, 3, 4, 5, 6, 5, 6, 4, 4, 1, ! 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, ! 2, 2, 1, 2, 2, 1, 5, 4, 4, 5, ! 1, 3, 3, 3, 1, 3, 3, 1, 3, 3, ! 3, 1, 3, 3, 3, 3, 3, 1, 3, 3, ! 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, ! 1, 5, 1, 1, 3, 1, 1, 1, 1, 1, ! 1, 1 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned short yydefact[] = { ! 26, 46, 0, 0, 0, 0, 175, 0, 2, 28, ! 29, 27, 34, 39, 40, 36, 0, 43, 44, 45, ! 25, 0, 21, 22, 23, 117, 52, 0, 1, 32, ! 35, 37, 30, 31, 47, 0, 0, 41, 0, 0, ! 0, 121, 0, 54, 38, 0, 33, 119, 52, 0, ! 24, 18, 125, 16, 0, 118, 0, 0, 17, 53, ! 0, 50, 0, 123, 54, 42, 13, 0, 11, 12, ! 127, 0, 9, 10, 14, 15, 16, 0, 133, 135, ! 0, 134, 0, 129, 131, 132, 126, 122, 56, 55, ! 0, 120, 0, 48, 0, 93, 77, 0, 73, 75, ! 93, 0, 19, 20, 0, 0, 136, 128, 130, 0, ! 0, 51, 124, 0, 0, 0, 0, 83, 71, 0, ! 0, 0, 82, 277, 0, 93, 0, 93, 57, 46, ! 0, 58, 21, 0, 68, 0, 60, 62, 66, 67, ! 0, 63, 0, 64, 93, 69, 65, 70, 49, 86, ! 0, 0, 0, 89, 95, 94, 88, 77, 74, 0, ! 0, 0, 0, 0, 0, 0, 240, 0, 0, 0, ! 0, 7, 6, 3, 4, 5, 8, 239, 0, 0, ! 290, 76, 80, 289, 237, 246, 242, 254, 0, 238, ! 243, 244, 245, 302, 291, 292, 310, 295, 296, 299, ! 305, 314, 317, 321, 327, 330, 332, 334, 336, 338, ! 340, 342, 350, 343, 0, 79, 78, 278, 85, 72, ! 84, 46, 0, 0, 205, 0, 0, 0, 0, 0, ! 0, 0, 0, 143, 0, 9, 15, 290, 23, 0, ! 149, 164, 0, 145, 147, 0, 148, 153, 165, 0, ! 154, 166, 0, 155, 156, 167, 0, 157, 0, 168, ! 158, 213, 0, 169, 170, 171, 173, 172, 0, 174, ! 242, 244, 0, 183, 184, 181, 182, 180, 0, 93, ! 59, 61, 98, 81, 97, 99, 0, 91, 0, 87, ! 0, 0, 290, 243, 245, 297, 298, 301, 300, 0, ! 0, 0, 17, 0, 303, 304, 0, 290, 0, 137, ! 0, 141, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 294, 293, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 348, 349, 0, 0, 0, 220, ! 0, 224, 0, 0, 0, 0, 211, 222, 0, 0, ! 151, 176, 0, 144, 146, 150, 229, 177, 179, 203, ! 0, 0, 215, 218, 212, 214, 0, 0, 105, 0, ! 0, 0, 101, 92, 90, 96, 251, 280, 0, 268, ! 274, 0, 269, 0, 0, 0, 19, 20, 241, 139, ! 138, 0, 250, 249, 281, 0, 265, 0, 248, 263, ! 247, 264, 279, 0, 0, 311, 312, 313, 315, 316, ! 318, 319, 320, 323, 325, 322, 324, 0, 326, 328, ! 329, 331, 333, 335, 337, 339, 0, 344, 0, 226, ! 221, 225, 0, 0, 0, 0, 230, 233, 231, 223, ! 241, 152, 0, 0, 216, 0, 0, 106, 102, 116, ! 240, 107, 290, 0, 0, 0, 103, 0, 0, 275, ! 270, 273, 271, 272, 253, 0, 307, 0, 0, 308, ! 140, 142, 282, 0, 287, 0, 288, 255, 0, 0, ! 0, 202, 0, 0, 236, 234, 232, 0, 219, 0, ! 217, 216, 0, 104, 0, 108, 0, 0, 109, 285, ! 0, 276, 0, 252, 306, 309, 267, 266, 283, 0, ! 256, 257, 341, 0, 187, 0, 153, 0, 160, 161, ! 0, 162, 163, 0, 0, 190, 0, 0, 0, 0, ! 228, 227, 0, 110, 0, 0, 286, 260, 0, 284, ! 258, 0, 0, 178, 204, 0, 0, 0, 191, 0, ! 195, 0, 198, 0, 0, 208, 0, 0, 111, 0, ! 262, 0, 188, 216, 0, 201, 351, 0, 193, 196, ! 0, 192, 197, 199, 235, 206, 207, 0, 0, 112, ! 0, 0, 216, 200, 194, 114, 0, 0, 0, 0, ! 113, 0, 210, 0, 189, 209 }; + /* YYDEFGOTO[NTERM-NUM]. */ static const short yydefgoto[] = { ! -1, 7, 177, 234, 178, 73, 74, 59, 52, 179, ! 180, 22, 23, 24, 8, 9, 10, 11, 12, 13, ! 14, 15, 239, 240, 113, 90, 43, 61, 89, 111, ! 135, 136, 137, 79, 97, 98, 99, 181, 139, 80, ! 95, 152, 153, 117, 155, 283, 141, 142, 143, 144, ! 382, 463, 464, 18, 40, 62, 57, 92, 41, 55, ! 82, 83, 84, 85, 182, 312, 241, 582, 243, 244, ! 245, 246, 525, 247, 248, 249, 250, 528, 251, 252, ! 253, 254, 529, 255, 535, 559, 560, 561, 562, 256, ! 257, 531, 258, 259, 260, 532, 261, 262, 374, 499, ! 500, 263, 264, 265, 266, 267, 268, 269, 446, 447, ! 448, 183, 184, 185, 186, 187, 512, 548, 188, 405, ! 189, 389, 390, 103, 190, 191, 192, 193, 194, 195, ! 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, ! 206, 207, 208, 209, 210, 211, 212, 213, 214, 346, ! 406, 577 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -489 static const short yypact[] = { ! 55, -489, -68, -68, -68, -68, -489, 61, -489, -22, ! 100, -22, -489, -489, -489, -489, 104, -489, -489, -489, ! -489, 191, -489, -489, -489, 77, 114, 203, -489, 100, ! -489, -489, -22, 100, -489, -68, -68, -489, 4, -68, ! -25, 87, -68, 65, -489, -68, 100, 77, 114, 121, ! -489, -489, -489, 97, 303, -489, -68, -25, -489, -489, ! -68, -489, -25, 87, 65, -489, -489, -68, -489, -489, ! -489, -68, 116, -489, -489, -489, 190, 451, -489, -489, ! 132, -489, 431, -489, -489, -489, -489, -489, -489, 136, ! 149, -489, -25, -489, 196, -39, 196, 6, -489, 36, ! -39, 223, 204, 204, -68, -68, -489, -489, -489, -68, ! 542, -489, -489, 149, 224, -68, 263, -489, -489, -68, ! 1668, 270, -489, -489, 285, -39, 159, -39, -489, 229, ! 2541, -489, 340, 451, -489, 674, -489, -489, -489, -489, ! 238, -489, 343, -489, 394, -489, -489, -489, -489, -489, ! -68, 84, 139, -489, -489, 296, -489, -489, -489, 2340, ! 2340, 2340, 2340, 356, 368, 143, -489, 2340, 2340, 2340, ! 1541, -489, -489, -489, -489, -489, -489, -489, 237, 371, ! 645, -489, -489, 392, 383, -489, -489, -489, -68, -489, ! 188, -489, 300, 379, -489, -489, -489, -489, -489, -489, ! -489, 461, 475, 488, 425, 490, 489, 500, 502, 509, ! 9, -489, -489, -489, 429, -489, -489, -489, -489, -489, ! -489, 442, 445, 2340, -489, 89, 1719, 449, 452, 343, ! 454, 119, 2340, -489, -68, 237, 371, 283, 436, 265, ! -489, -489, 2608, -489, -489, 450, -489, -489, -489, 3010, ! -489, -489, 457, -489, -489, -489, 3010, -489, 3010, -489, ! -489, 3128, 464, -489, -489, -489, -489, -489, 458, -489, ! 169, 217, 379, 521, 526, -489, -489, -489, 245, 394, ! -489, -489, -489, -489, -489, -489, 473, 483, -68, -489, ! 344, -68, 338, -489, -489, -489, -489, -489, -489, 514, ! -68, 494, 494, 505, -489, -489, 118, 645, 506, -489, ! 510, -489, 256, 538, 540, 1780, 1831, 493, 96, 2340, ! 515, -489, -489, 2340, 2340, 2340, 2340, 2340, 2340, 2340, ! 2340, 2340, 2340, 2340, 2340, 143, 2340, 2340, 2340, 2340, ! 2340, 2340, 2340, 2340, -489, -489, 2340, 2340, 511, -489, ! 512, -489, 513, 2340, 2340, 318, -489, -489, 519, 525, ! 520, -489, -68, -489, -489, -489, -489, -489, -489, -489, ! 555, 84, -489, -489, -489, 523, 1892, 2340, -489, 157, ! 473, 2675, 527, 483, -489, -489, -489, 539, 1831, 494, ! -489, 378, 494, 378, 1943, 2340, -77, 59, 1073, -489, ! -489, 1607, -489, -489, -489, 225, -489, 532, -489, -489, ! -489, -489, 543, 535, 2004, -489, -489, -489, 461, 461, ! 475, 475, 475, 488, 488, 488, 488, 116, -489, 425, ! 425, 490, 489, 500, 502, 509, 552, -489, 549, -489, ! -489, -489, 550, 553, 556, 343, 318, -489, -489, -489, ! -489, 520, 557, 1150, 1150, 559, 560, -489, 563, 368, ! 558, -489, 609, 2742, 566, 2809, -489, 2055, 567, -489, ! 204, -489, 204, -489, 561, 255, -489, 2340, 1073, -489, ! -489, -489, -489, 1476, -489, 2116, -489, 149, 301, 2340, ! 3077, -489, 573, 344, -489, -489, -489, 2340, -489, 576, ! 523, 1150, 7, -489, 314, -489, 2876, 2167, -489, -489, ! 346, -489, 149, 577, -489, -489, -489, -489, -489, 355, ! -489, 149, -489, 578, -489, 618, 619, 3077, -489, -489, ! 3077, -489, -489, 579, 17, -489, 582, 587, 3010, 589, ! -489, -489, 591, -489, 592, 360, -489, -489, 149, -489, ! -489, 2340, 3010, -489, -489, 2228, 608, 2340, -489, 18, ! -489, 2407, -489, 343, 598, -489, 3010, 2279, -489, 600, ! -489, 613, -489, 1150, 612, -489, -489, 620, -489, -489, ! 2474, -489, 2943, -489, -489, -489, -489, 614, 370, -489, ! 3077, 621, 1150, -489, -489, -489, 615, 656, 3077, 622, ! -489, 3077, -489, 3077, -489, -489 }; + /* YYPGOTO[NTERM-NUM]. */ static const short yypgoto[] = { ! -489, -489, -489, 194, 375, 384, -19, -111, 0, 23, ! 82, -82, -489, -3, -489, 710, 166, -489, 54, -489, ! -489, 253, 16, 695, -489, -489, 678, 658, -489, -84, ! -489, 594, -489, -60, -95, 611, -139, -163, -489, -52, ! 152, 455, -285, -70, -489, -489, -489, -489, -489, 599, ! 364, -489, -489, -15, -489, -489, -489, -489, 688, -45, ! -489, 666, -489, -489, 99, -489, -104, -127, -240, -489, ! 479, 327, -458, -438, 778, -417, -489, -489, -489, -218, ! -489, -489, -489, -489, -489, -489, 192, 205, -468, -408, ! -489, -489, -489, -489, -489, -489, -489, -303, -489, -488, ! 491, -489, -489, -489, -489, -489, -489, -489, -489, 304, ! 307, -489, -489, -489, 88, -489, -489, -489, -489, -306, ! -489, 456, -313, -28, 1131, 193, 1179, 374, 432, 537, ! 43, 642, 776, -384, -489, 264, 226, 199, 260, 424, ! 426, 423, 427, 434, -489, 278, 435, 821, -489, -489, ! 942, -489 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -348 static const short yytable[] = { ! 25, 26, 364, 242, 154, 384, 146, 311, 540, 49, ! 126, 287, 87, 539, 479, 115, 16, 91, 477, 20, ! 51, 124, 1, 58, 342, 16, 16, 16, 132, 148, ! 122, 146, 47, 48, 2, 50, 284, 51, 285, 81, ! 3, 51, 50, 373, 102, 16, 4, 112, 16, 16, ! 138, 132, 526, 132, 303, 218, 86, 220, 140, 116, ! 88, 28, 16, 30, 94, 556, 556, 81, 96, 553, ! 77, 54, 554, 527, 286, 138, 469, 75, 6, 469, ! 557, 557, 530, 140, 21, 591, 30, 27, 475, 526, ! 51, 20, 526, 583, 515, 145, 58, 343, 77, 1, ! 75, 94, 96, 130, 599, 75, 118, 119, 488, 128, ! 527, 2, 583, 527, 558, 578, 157, 3, 60, 530, ! 145, 53, 530, 4, 53, 355, 133, 238, 34, 120, ! 151, 5, 597, 75, 121, 66, 76, 75, 53, 360, ! 602, 39, 53, 604, 1, 605, 302, 157, 34, 383, ! 102, 133, 526, 236, 478, 6, 75, 124, 75, 76, ! 526, 510, 3, 526, 76, 526, 35, 68, 4, 411, ! 69, 20, 36, 527, 75, 29, 20, 33, 42, 519, ! 385, 527, 530, 20, 527, 320, 527, 533, 56, 349, ! 530, 53, 76, 530, 66, 530, 76, 53, 46, 45, ! 6, 545, 295, 296, 297, 298, 20, 102, 536, 380, ! 304, 305, 237, 395, 101, 76, 101, 76, 270, 357, ! 313, 65, 350, 100, 533, 364, 68, 533, 358, 69, ! 20, 157, 106, 76, 289, 498, 373, 109, 481, 238, ! 290, 292, 292, 292, 292, 110, 238, 53, 71, 292, ! 292, 307, 457, 238, 465, 238, 125, 127, 290, 219, ! 119, 588, 75, 31, -186, 236, 364, 451, 1, -186, ! -186, 105, 58, 391, 393, 66, 71, 371, 396, 397, ! -346, -346, 31, 373, 236, 157, 31, 533, 101, 1, ! 114, 37, 45, 38, 151, 533, 66, 387, 533, 31, ! 533, 75, 124, 44, 71, 45, 151, 68, 150, 34, ! 69, 20, -185, 75, 50, 412, 66, -185, -185, 149, ! 482, 76, 123, 271, 237, -100, 483, 105, 68, 71, ! 270, 69, 20, 36, 130, 101, 506, 270, 282, 313, ! 378, 494, 364, 237, 270, 288, 270, 1, 68, 270, ! 513, 69, 20, 400, 66, 373, 483, 401, 75, 157, ! 76, 470, 156, 67, 472, 3, 415, 416, 417, 216, ! -16, 4, 76, 53, 373, -345, -345, 315, 238, 444, ! 542, 316, 408, 445, 217, 317, 68, 409, 1, 69, ! 20, 410, -347, -347, 75, 66, 521, 291, 541, 102, ! 70, 20, 483, 520, 236, 292, 292, 292, 292, 292, ! 292, 292, 292, 292, 292, 292, 292, 76, 292, 292, ! 292, 292, 292, 292, 292, 321, 322, 68, 547, 72, ! 69, 20, 315, 362, 278, 271, 316, 550, 476, 130, ! 317, 546, 271, 331, 332, 333, 334, 483, 115, 271, ! 549, 271, 72, 76, 271, 569, 483, 72, 299, 584, ! 238, 483, 238, 462, 570, 596, 323, 324, 325, 270, ! 300, 483, 150, 314, 170, 1, 124, 292, 326, 327, ! 292, 319, 66, 335, 150, 72, 236, 238, 236, 72, ! 471, 67, 473, 3, 318, 34, 328, 329, 330, 4, ! 338, 50, 66, 238, 272, 235, 336, 337, 72, 151, ! 72, 104, 339, 35, 68, 340, 75, 69, 20, 36, ! 514, 344, 345, 341, 238, 361, 72, 238, 107, 236, ! 423, 424, 425, 426, 68, 238, -229, 69, 20, 347, ! 301, 270, 270, 353, 306, 237, 354, 237, 356, 238, ! 365, 270, 377, 270, 420, 421, 422, 368, 238, 292, ! 292, 408, 273, 238, 376, 362, 409, -291, -291, 381, ! 410, 292, -292, -292, 271, 76, 367, 238, 270, 238, ! 20, 121, 386, 369, 236, 370, 129, 238, 237, 270, ! 418, 419, 388, 66, 270, 238, 429, 430, 238, 394, ! 238, 398, 67, 236, 3, 236, 402, 399, 403, 414, ! 4, 439, 440, 441, 72, 270, 272, 235, 270, 449, ! 450, 119, 452, 272, 453, 68, 270, 466, 69, 20, ! 272, 484, 272, 467, 486, 272, 235, 485, 130, 131, ! 270, 489, 6, 237, 490, 491, 271, 271, 492, 270, ! 493, 497, -115, 72, 270, 502, 271, -259, 271, 501, ! 507, 270, 237, 503, 237, 72, 511, 274, 270, 534, ! 270, 538, 551, -261, 273, 552, -159, 563, 270, 555, ! 270, 273, 564, 271, 566, 567, 270, 150, 273, 270, ! 273, 270, 568, 273, 271, 17, -16, 575, 585, 271, ! 589, -345, -345, 315, 17, 17, 17, 316, 590, 593, ! 427, 504, 592, 601, 595, 600, 598, 603, 129, 428, ! 271, 32, 93, 271, 17, 66, 64, 17, 17, 281, ! 158, 271, 279, 379, 67, 63, 3, -345, -345, 315, ! 372, 17, 4, 316, 458, 271, 72, 317, 108, 78, ! 495, 579, 375, 496, 271, 272, 235, 68, 392, 271, ! 69, 20, 431, 433, 580, 432, 271, 522, 434, 0, ! 130, 280, 275, 271, 6, 271, 435, 78, 19, 274, ! 0, 437, 0, 271, 0, 271, 274, 19, 19, 19, ! 0, 271, 0, 274, 271, 274, 271, 0, 274, 0, ! 0, 0, 0, 0, 0, 134, 0, 19, 0, 0, ! 19, 19, 0, 273, 0, 0, 0, 524, 0, 0, ! 0, 0, 0, 0, 19, 0, 0, 272, 272, 0, ! 134, 0, 0, 0, 0, 0, 0, 272, 235, 272, ! 235, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 367, 0, 0, 369, 0, 0, ! 0, 0, 0, 0, 272, 565, 0, 0, 72, 0, ! 0, 0, 0, 0, 0, 272, 0, 0, 0, 572, ! 272, 235, 0, 0, 275, 273, 273, 0, 147, 0, ! 0, 275, 0, 586, 0, 273, 0, 273, 275, 0, ! 275, 272, 0, 275, 272, 0, 276, 0, 0, 0, ! 0, 0, 272, 147, 0, 0, 0, 524, 274, 0, ! 0, 0, 273, 0, 0, 565, 272, 0, 572, 0, ! 586, 0, 0, 273, 0, 272, 235, 0, 273, 0, ! 272, 0, 0, 0, 0, 0, 0, 272, 0, 0, ! 0, 277, 0, 0, 272, 235, 272, 235, 0, 273, ! 0, 0, 273, 0, 272, 0, 272, 0, 0, 0, ! 273, 0, 272, 0, 0, 272, 0, 272, 0, 0, ! 0, 0, 0, 0, 273, 0, 0, 0, 0, 0, ! 274, 274, 0, 273, 0, 0, 0, 0, 273, 0, ! 274, 0, 274, 0, 0, 273, 0, 0, 0, 0, ! 0, 0, 273, 0, 273, 0, 0, 0, 276, 0, ! 0, 0, 273, 275, 273, 276, 0, 274, 0, 0, ! 273, 0, 276, 273, 276, 273, 0, 276, 274, 0, ! 0, 0, 0, 274, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 215, 277, 274, 0, 0, 274, 0, 0, ! 277, 0, 0, 0, 0, 274, 0, 277, 0, 277, ! 0, 0, 277, 0, 0, 0, 0, 0, 0, 274, ! 0, 0, 0, 0, 0, 275, 275, 0, 274, 0, ! 0, 0, 0, 274, 0, 275, 0, 275, 0, 0, ! 274, 308, 215, 0, 0, 0, 0, 274, 0, 274, ! 0, 0, 0, 0, 66, 0, 0, 274, 0, 274, ! 0, 0, 275, 163, 0, 274, 0, 0, 274, 164, ! 274, 0, 0, 275, 0, 0, 165, 0, 275, 0, ! 166, 0, 0, 0, 0, 0, 68, 276, 0, 69, ! 20, 0, 0, 167, 168, 348, 0, 169, 352, 275, ! 0, 0, 275, 0, 359, 0, 171, 172, 173, 174, ! 275, 0, 175, 176, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 275, 0, 161, 162, 0, 0, ! 0, 66, 277, 275, 0, 0, 0, 0, 275, 0, ! 163, 0, 0, 0, 0, 275, 164, 0, 0, 0, ! 0, 0, 275, 165, 275, 0, 0, 166, 0, 276, ! 276, 0, 275, 68, 275, 0, 69, 20, 0, 276, ! 275, 276, 0, 275, 232, 275, 0, 0, 0, 0, ! 0, 0, 0, 171, 172, 173, 174, 0, 407, 175, ! 176, 413, 0, 0, 0, 0, 276, 0, 0, 0, ! 0, 0, 0, 0, 277, 277, 0, 276, 0, 0, ! 0, 0, 276, 0, 277, 436, 277, 0, 0, 438, ! 293, 293, 293, 293, 0, 442, 443, 0, 293, 293, ! 0, 0, 0, 276, 0, 0, 276, 0, 0, 0, ! 0, 277, 0, 0, 276, 0, 0, 0, 455, 456, ! 0, 0, 277, 0, 0, 0, 0, 277, 276, 0, ! 468, 0, 0, 0, 0, 0, 0, 276, 294, 294, ! 294, 294, 276, 215, 0, 0, 294, 294, 277, 276, ! 0, 277, 0, 0, 0, 0, 276, 0, 276, 277, ! 0, 0, 0, 0, 0, 0, 276, 0, 276, 0, ! 0, 0, 0, 277, 276, 0, 0, 276, 0, 276, ! 0, 0, 277, 0, 0, 0, 0, 277, 0, 0, ! 0, 0, 0, 0, 277, 0, 0, 0, 0, 0, ! 0, 277, 0, 277, 0, 0, 0, 0, 0, 0, ! 0, 277, 0, 277, 0, 0, 0, 0, 0, 277, ! 0, 0, 277, 0, 277, 517, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 537, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 293, 293, 293, 293, 293, 293, ! 293, 293, 293, 293, 293, 293, 0, 293, 293, 293, ! 293, 293, 293, 293, 0, 0, 0, 516, 0, 159, ! 160, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 571, 0, 0, 0, 574, 0, 576, ! 0, 0, 294, 294, 294, 294, 294, 294, 294, 294, ! 294, 294, 294, 294, 0, 294, 294, 294, 294, 294, ! 294, 294, 161, 162, 0, 0, 293, 66, 0, 293, 0, 0, 0, 0, 0, 0, 163, 0, 0, 0, ! 0, 0, 164, 0, 159, 160, 0, 0, 0, 165, ! 0, 0, 0, 166, 0, 0, 0, 0, 0, 68, ! 0, 0, 69, 20, 0, 0, 167, 168, 0, 0, ! 169, 0, 0, 0, 294, 0, 0, 294, 0, 171, ! 172, 173, 174, 0, 0, 175, 176, 161, 162, 0, ! 0, 0, 66, 0, 0, 0, 0, 0, 0, 0, ! 0, 163, 0, 0, 0, 0, 0, 164, 293, 293, ! 159, 160, 0, 0, 165, 0, 0, 0, 166, 0, ! 293, 0, 0, 0, 68, 0, 0, 69, 20, 0, ! 0, 167, 168, 0, 0, 169, 0, 170, 309, 0, ! 0, 0, 310, 0, 171, 172, 173, 174, 0, 0, ! 175, 176, 0, 161, 162, 0, 294, 294, 66, 0, ! 0, 0, 0, 0, 0, 0, 0, 163, 294, 0, ! 0, 159, 160, 164, 0, 0, 0, 0, 0, 0, ! 165, 0, 0, 0, 166, 0, 0, 0, 0, 0, ! 68, 0, 0, 69, 20, 0, 0, 167, 168, 0, ! 0, 169, 0, 170, 480, 0, 0, 0, 0, 0, ! 171, 172, 173, 174, 161, 162, 175, 176, 0, 66, ! 0, 0, 159, 160, 0, 0, 0, 0, 163, 0, ! 0, 0, 0, 0, 164, 0, 0, 0, 0, 0, ! 0, 165, 0, 0, 0, 166, 0, 0, 0, 0, ! 0, 68, 0, 0, 69, 20, 0, 0, 167, 168, ! 0, 0, 169, 0, 170, 161, 162, 0, 0, 0, ! 66, 171, 172, 173, 174, 0, 0, 175, 176, 163, ! 0, 0, 0, 159, 160, 164, 0, 0, 0, 0, ! 0, 0, 165, 0, 0, 0, 166, 0, 0, 0, ! 0, 0, 68, 0, 0, 69, 20, 0, 0, 167, ! 168, 0, 0, 169, 0, 0, 0, 0, 0, 351, ! 0, 0, 171, 172, 173, 174, 161, 162, 175, 176, ! 0, 66, 0, 0, 159, 160, 0, 0, 0, 0, ! 163, 0, 0, 0, 0, 0, 164, 0, 0, 0, ! 0, 0, 0, 165, 0, 0, 0, 166, 0, 0, ! 0, 0, 0, 68, 0, 0, 69, 20, 0, 0, ! 167, 168, 0, 0, 169, 404, 0, 161, 162, 0, ! 0, 0, 66, 171, 172, 173, 174, 0, 0, 175, ! 176, 163, 0, 0, 0, 159, 160, 164, 0, 0, ! 0, 0, 0, 0, 165, 0, 0, 0, 166, 0, ! 0, 0, 0, 0, 68, 0, 0, 69, 20, 0, ! 0, 167, 168, 0, 0, 169, 0, 0, 0, 0, ! 123, 0, 0, 0, 171, 172, 173, 174, 161, 162, ! 175, 176, 0, 66, 0, 0, 159, 160, 0, 0, ! 0, 0, 163, 0, 0, 0, 0, 0, 164, 0, ! 0, 0, 0, 0, 0, 165, 0, 0, 0, 166, ! 0, 0, 0, 0, 0, 68, 0, 0, 69, 20, ! 0, 0, 167, 168, 0, 0, 169, 0, 0, 161, ! 162, 0, 454, 0, 66, 171, 172, 173, 174, 0, ! 0, 175, 176, 163, 0, 0, 0, 159, 160, 164, ! 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, ! 166, 0, 0, 0, 0, 0, 68, 0, 0, 69, ! 20, 0, 0, 167, 168, 0, 0, 169, 474, 0, ! 0, 0, 0, 0, 0, 0, 171, 172, 173, 174, ! 161, 162, 175, 176, 0, 66, 0, 0, 159, 160, ! 0, 0, 0, 0, 163, 0, 0, 0, 0, 0, ! 164, 0, 0, 0, 0, 0, 0, 165, 0, 0, ! 0, 166, 0, 0, 0, 0, 0, 68, 0, 0, ! 69, 20, 0, 0, 167, 168, 0, 0, 169, 487, ! 0, 161, 162, 0, 0, 0, 66, 171, 172, 173, ! 174, 0, 0, 175, 176, 163, 0, 0, 0, 159, ! 160, 164, 0, 0, 0, 0, 0, 0, 165, 0, ! 0, 0, 166, 0, 0, 0, 0, 0, 68, 0, ! 0, 69, 20, 0, 0, 167, 168, 0, 0, 169, ! 509, 0, 0, 0, 0, 0, 0, 0, 171, 172, ! 173, 174, 161, 162, 175, 176, 0, 66, 0, 0, ! 159, 160, 0, 0, 0, 0, 163, 0, 0, 0, ! 0, 0, 164, 0, 0, 0, 0, 0, 0, 165, ! 0, 0, 0, 166, 0, 0, 0, 0, 0, 68, ! 0, 0, 69, 20, 0, 0, 167, 168, 0, 0, ! 169, 518, 0, 161, 162, 0, 0, 0, 66, 171, ! 172, 173, 174, 0, 0, 175, 176, 163, 0, 0, ! 0, 159, 160, 164, 0, 0, 0, 0, 0, 0, ! 165, 0, 0, 0, 166, 0, 0, 0, 0, 0, ! 68, 0, 0, 69, 20, 0, 0, 167, 168, 0, ! 0, 169, 544, 0, 0, 0, 0, 0, 0, 0, ! 171, 172, 173, 174, 161, 162, 175, 176, 0, 66, ! 0, 0, 159, 160, 0, 0, 0, 0, 163, 0, ! 0, 0, 0, 0, 164, 0, 0, 0, 0, 0, ! 0, 165, 0, 0, 0, 166, 0, 0, 0, 0, ! 0, 68, 0, 0, 69, 20, 0, 0, 167, 168, ! 0, 0, 169, 0, 0, 161, 162, 0, 573, 0, ! 66, 171, 172, 173, 174, 0, 0, 175, 176, 163, ! 0, 0, 0, 159, 160, 164, 0, 0, 0, 0, ! 0, 0, 165, 0, 0, 0, 166, 0, 0, 0, ! 0, 0, 68, 0, 0, 69, 20, 0, 0, 167, ! 168, 0, 0, 169, 587, 0, 0, 0, 0, 0, ! 0, 0, 171, 172, 173, 174, 161, 162, 175, 176, ! 0, 66, 0, 0, 0, 0, 0, 0, 0, 0, ! 163, 0, 0, 0, 0, 0, 164, 0, 0, 0, ! 0, 0, 0, 165, 0, 0, 0, 166, 0, 0, ! 0, 0, 0, 68, 0, 0, 69, 20, 0, 0, ! 167, 168, 0, 0, 169, 0, 0, 0, 0, 0, ! 0, 0, 0, 171, 172, 173, 174, 0, 0, 175, ! 176, 221, 0, 161, 162, 556, 222, 223, 66, 224, ! 0, 0, 225, 0, 0, 0, 226, 163, 0, 0, ! 557, 0, 0, 164, 227, 4, 228, 0, 229, 230, ! 165, 231, 0, 0, 166, 0, 0, 0, 0, 0, ! 68, 0, 0, 69, 20, 0, 0, 0, 0, 0, ! 0, 232, 0, 130, 581, 0, 0, 6, 0, 0, ! 171, 172, 173, 174, 0, 0, 175, 176, 221, 0, ! 161, 162, 556, 222, 223, 66, 224, 0, 0, 225, ! 0, 0, 0, 226, 163, 0, 0, 557, 0, 0, ! 164, 227, 4, 228, 0, 229, 230, 165, 231, 0, ! 0, 166, 0, 0, 0, 0, 0, 68, 0, 0, ! 69, 20, 0, 0, 0, 0, 0, 0, 232, 0, ! 130, 594, 0, 0, 6, 0, 0, 171, 172, 173, ! 174, 0, 0, 175, 176, 221, 0, 161, 162, 0, ! 222, 223, 66, 224, 0, 0, 225, 0, 0, 0, ! 226, 163, 0, 0, 0, 0, 0, 164, 227, 4, ! 228, 0, 229, 230, 165, 231, 0, 0, 166, 0, ! 0, 0, 0, 0, 68, 0, 0, 69, 20, 0, ! 0, 0, 0, 0, 0, 232, 0, 130, 233, 0, ! 0, 6, 0, 0, 171, 172, 173, 174, 0, 0, ! 175, 176, 221, 0, 161, 162, 0, 222, 223, 66, ! 224, 0, 0, 225, 0, 0, 0, 226, 163, 0, ! 0, 0, 0, 0, 164, 227, 4, 228, 0, 229, ! 230, 165, 231, 0, 0, 166, 0, 0, 0, 0, ! 0, 68, 0, 0, 69, 20, 0, 0, 0, 0, ! 0, 0, 232, 0, 130, 363, 0, 0, 6, 0, ! 0, 171, 172, 173, 174, 0, 0, 175, 176, 221, ! 0, 161, 162, 0, 222, 223, 66, 224, 0, 0, ! 225, 0, 0, 0, 226, 163, 0, 0, 0, 0, ! 0, 459, 227, 4, 228, 0, 229, 230, 165, 231, ! 0, 0, 460, 0, 0, 0, 0, 0, 68, 0, ! 0, 69, 20, 0, 0, 0, 0, 0, 0, 232, ! 0, 130, 461, 0, 0, 6, 0, 0, 171, 172, ! 173, 174, 0, 0, 175, 176, 221, 0, 161, 162, ! 0, 222, 223, 66, 224, 0, 0, 225, 0, 0, ! 0, 226, 163, 0, 0, 0, 0, 0, 164, 227, ! 4, 228, 0, 229, 230, 165, 231, 0, 0, 166, ! 0, 0, 0, 0, 0, 68, 0, 0, 69, 20, ! 0, 0, 0, 0, 0, 0, 232, 0, 130, 505, ! 0, 0, 6, 0, 0, 171, 172, 173, 174, 0, ! 0, 175, 176, 221, 0, 161, 162, 0, 222, 223, ! 66, 224, 0, 0, 225, 0, 0, 0, 226, 163, ! 0, 0, 0, 0, 0, 164, 227, 4, 228, 0, ! 229, 230, 165, 231, 0, 0, 166, 0, 0, 0, ! 0, 0, 68, 0, 0, 69, 20, 0, 0, 0, ! 0, 0, 0, 232, 0, 130, 508, 0, 0, 6, ! 0, 0, 171, 172, 173, 174, 0, 0, 175, 176, ! 221, 0, 161, 162, 0, 222, 223, 66, 224, 0, ! 0, 225, 0, 0, 0, 226, 163, 0, 0, 0, ! 0, 0, 164, 227, 4, 228, 0, 229, 230, 165, ! 231, 0, 0, 166, 0, 0, 0, 0, 0, 68, ! 0, 0, 69, 20, 0, 0, 0, 0, 0, 0, ! 232, 0, 130, 543, 0, 0, 6, 0, 0, 171, ! 172, 173, 174, 0, 0, 175, 176, 221, 0, 161, ! 162, 0, 222, 223, 66, 224, 0, 0, 225, 0, ! 0, 0, 226, 163, 0, 0, 0, 0, 0, 164, ! 227, 4, 228, 0, 229, 230, 165, 231, 0, 0, ! 166, 0, 0, 0, 0, 0, 68, 0, 0, 69, ! 20, 0, 0, 0, 0, 0, 0, 232, 0, 130, ! 0, 0, 0, 6, 0, 0, 171, 172, 173, 174, ! 0, 0, 175, 176, 366, 0, 161, 162, 0, 222, ! 223, 66, 224, 0, 0, 225, 0, 0, 0, 226, ! 163, 0, 0, 0, 0, 0, 164, 227, 0, 228, ! 0, 229, 230, 165, 231, 0, 0, 166, 0, 0, ! 0, 0, 0, 68, 0, 0, 69, 20, 0, 0, ! 0, 0, 0, 0, 232, 0, 130, 0, 0, 0, ! 6, 0, 0, 171, 172, 173, 174, 0, 0, 175, ! 176, 366, 0, 161, 162, 0, 523, 223, 66, 224, ! 0, 0, 225, 0, 0, 0, 226, 163, 0, 0, ! 0, 0, 0, 164, 227, 0, 228, 0, 229, 230, ! 165, 231, 0, 0, 166, 0, 0, 0, 0, 0, ! 68, 0, 0, 69, 20, 0, 0, 0, 0, 0, ! 0, 232, 1, 130, 161, 162, 0, 6, 0, 66, ! 171, 172, 173, 174, 0, 0, 175, 176, 163, 0, ! 0, 0, 0, 0, 164, 0, 0, 0, 0, 0, ! 0, 165, 0, 0, 0, 166, 0, 0, 0, 0, ! 0, 68, 0, 0, 69, 20, 0, 0, 0, 0, ! 0, 0, 232, 0, 0, 0, 0, 0, 0, 0, ! 0, 171, 172, 173, 174, 0, 0, 175, 176 }; static const short yycheck[] = { ! 3, 4, 242, 130, 115, 290, 110, 170, 1, 5, ! 105, 150, 57, 501, 398, 54, 0, 62, 95, 87, ! 39, 98, 44, 42, 15, 9, 10, 11, 110, 113, ! 100, 135, 35, 36, 56, 38, 140, 56, 142, 54, ! 62, 60, 45, 261, 72, 29, 68, 92, 32, 33, ! 110, 133, 490, 135, 165, 125, 56, 127, 110, 98, ! 60, 0, 46, 9, 67, 48, 48, 82, 71, 527, ! 54, 96, 530, 490, 144, 135, 389, 54, 100, 392, ! 63, 63, 490, 135, 2, 573, 32, 5, 394, 527, ! 109, 87, 530, 561, 478, 110, 115, 88, 82, 44, ! 77, 104, 105, 96, 592, 82, 100, 101, 414, 109, ! 527, 56, 580, 530, 97, 97, 119, 62, 53, 527, ! 135, 39, 530, 68, 42, 229, 110, 130, 44, 93, ! 114, 76, 590, 110, 98, 51, 54, 114, 56, 234, ! 598, 64, 60, 601, 44, 603, 165, 150, 44, 288, ! 178, 135, 590, 130, 95, 100, 133, 98, 135, 77, ! 598, 467, 62, 601, 82, 603, 62, 83, 68, 73, ! 86, 87, 68, 590, 151, 9, 87, 11, 64, 485, ! 291, 598, 590, 87, 601, 188, 603, 490, 101, 100, ! 598, 109, 110, 601, 51, 603, 114, 115, 32, 102, ! 100, 507, 159, 160, 161, 162, 87, 235, 493, 279, ! 167, 168, 130, 95, 98, 133, 98, 135, 130, 100, ! 102, 100, 225, 71, 527, 465, 83, 530, 231, 86, ! 87, 234, 100, 151, 95, 453, 454, 101, 401, 242, ! 101, 159, 160, 161, 162, 96, 249, 165, 54, 167, ! 168, 169, 95, 256, 381, 258, 104, 105, 101, 100, ! 101, 567, 239, 10, 95, 242, 506, 362, 44, 100, ! 101, 77, 291, 301, 302, 51, 82, 261, 306, 307, ! 92, 93, 29, 501, 261, 288, 33, 590, 98, 44, ! 94, 100, 102, 102, 278, 598, 51, 300, 601, 46, ! 603, 278, 98, 100, 110, 102, 290, 83, 114, 44, ! 86, 87, 95, 290, 317, 318, 51, 100, 101, 95, ! 95, 239, 99, 130, 242, 96, 101, 133, 83, 135, ! 242, 86, 87, 68, 96, 98, 463, 249, 100, 102, ! 95, 445, 582, 261, 256, 151, 258, 44, 83, 261, ! 95, 86, 87, 97, 51, 573, 101, 101, 335, 362, ! 278, 389, 99, 60, 392, 62, 323, 324, 325, 99, ! 87, 68, 290, 291, 592, 92, 93, 94, 381, 61, ! 66, 98, 68, 65, 99, 102, 83, 73, 44, 86, ! 87, 77, 92, 93, 371, 51, 95, 101, 502, 427, ! 97, 87, 101, 487, 381, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, ! 338, 339, 340, 341, 342, 46, 47, 83, 512, 54, ! 86, 87, 94, 239, 94, 242, 98, 521, 395, 96, ! 102, 95, 249, 18, 19, 20, 21, 101, 54, 256, ! 95, 258, 77, 371, 261, 95, 101, 82, 102, 563, ! 463, 101, 465, 381, 548, 95, 5, 6, 7, 381, ! 102, 101, 278, 102, 96, 44, 98, 395, 3, 4, ! 398, 98, 51, 58, 290, 110, 463, 490, 465, 114, ! 391, 60, 393, 62, 102, 44, 8, 9, 10, 68, ! 11, 504, 51, 506, 130, 130, 16, 17, 133, 493, ! 135, 60, 12, 62, 83, 13, 493, 86, 87, 68, ! 477, 92, 93, 14, 527, 89, 151, 530, 97, 506, ! 331, 332, 333, 334, 83, 538, 94, 86, 87, 94, ! 165, 453, 454, 94, 169, 463, 94, 465, 94, 552, ! 100, 463, 94, 465, 328, 329, 330, 100, 561, 477, ! 478, 68, 130, 566, 100, 371, 73, 46, 47, 96, ! 77, 489, 46, 47, 381, 493, 249, 580, 490, 582, ! 87, 98, 68, 256, 561, 258, 44, 590, 506, 501, ! 326, 327, 98, 51, 506, 598, 336, 337, 601, 94, ! 603, 95, 60, 580, 62, 582, 68, 97, 68, 94, ! 68, 100, 100, 100, 239, 527, 242, 242, 530, 100, ! 95, 101, 67, 249, 101, 83, 538, 100, 86, 87, ! 256, 99, 258, 94, 99, 261, 261, 94, 96, 97, ! 552, 89, 100, 561, 95, 95, 453, 454, 95, 561, ! 94, 94, 94, 278, 566, 95, 463, 96, 465, 100, ! 94, 573, 580, 100, 582, 290, 99, 130, 580, 96, ! 582, 95, 94, 96, 242, 57, 57, 95, 590, 100, ! 592, 249, 95, 490, 95, 94, 598, 493, 256, 601, ! 258, 603, 100, 261, 501, 0, 87, 89, 100, 506, ! 100, 92, 93, 94, 9, 10, 11, 98, 95, 89, ! 335, 102, 100, 57, 100, 100, 95, 95, 44, 335, ! 527, 11, 64, 530, 29, 51, 48, 32, 33, 135, ! 119, 538, 133, 278, 60, 47, 62, 92, 93, 94, ! 261, 46, 68, 98, 380, 552, 371, 102, 82, 54, ! 446, 559, 261, 446, 561, 381, 381, 83, 302, 566, ! 86, 87, 338, 340, 559, 339, 573, 489, 341, -1, ! 96, 97, 130, 580, 100, 582, 342, 82, 0, 242, ! -1, 346, -1, 590, -1, 592, 249, 9, 10, 11, ! -1, 598, -1, 256, 601, 258, 603, -1, 261, -1, ! -1, -1, -1, -1, -1, 110, -1, 29, -1, -1, ! 32, 33, -1, 381, -1, -1, -1, 490, -1, -1, ! -1, -1, -1, -1, 46, -1, -1, 453, 454, -1, ! 135, -1, -1, -1, -1, -1, -1, 463, 463, 465, ! 465, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 527, -1, -1, 530, -1, -1, ! -1, -1, -1, -1, 490, 538, -1, -1, 493, -1, ! -1, -1, -1, -1, -1, 501, -1, -1, -1, 552, ! 506, 506, -1, -1, 242, 453, 454, -1, 110, -1, ! -1, 249, -1, 566, -1, 463, -1, 465, 256, -1, ! 258, 527, -1, 261, 530, -1, 130, -1, -1, -1, ! -1, -1, 538, 135, -1, -1, -1, 590, 381, -1, ! -1, -1, 490, -1, -1, 598, 552, -1, 601, -1, ! 603, -1, -1, 501, -1, 561, 561, -1, 506, -1, ! 566, -1, -1, -1, -1, -1, -1, 573, -1, -1, ! -1, 130, -1, -1, 580, 580, 582, 582, -1, 527, ! -1, -1, 530, -1, 590, -1, 592, -1, -1, -1, ! 538, -1, 598, -1, -1, 601, -1, 603, -1, -1, ! -1, -1, -1, -1, 552, -1, -1, -1, -1, -1, ! 453, 454, -1, 561, -1, -1, -1, -1, 566, -1, ! 463, -1, 465, -1, -1, 573, -1, -1, -1, -1, ! -1, -1, 580, -1, 582, -1, -1, -1, 242, -1, ! -1, -1, 590, 381, 592, 249, -1, 490, -1, -1, ! 598, -1, 256, 601, 258, 603, -1, 261, 501, -1, ! -1, -1, -1, 506, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 120, 242, 527, -1, -1, 530, -1, -1, ! 249, -1, -1, -1, -1, 538, -1, 256, -1, 258, ! -1, -1, 261, -1, -1, -1, -1, -1, -1, 552, ! -1, -1, -1, -1, -1, 453, 454, -1, 561, -1, ! -1, -1, -1, 566, -1, 463, -1, 465, -1, -1, ! 573, 169, 170, -1, -1, -1, -1, 580, -1, 582, ! -1, -1, -1, -1, 51, -1, -1, 590, -1, 592, ! -1, -1, 490, 60, -1, 598, -1, -1, 601, 66, ! 603, -1, -1, 501, -1, -1, 73, -1, 506, -1, ! 77, -1, -1, -1, -1, -1, 83, 381, -1, 86, ! 87, -1, -1, 90, 91, 223, -1, 94, 226, 527, ! -1, -1, 530, -1, 232, -1, 103, 104, 105, 106, ! 538, -1, 109, 110, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 552, -1, 46, 47, -1, -1, ! -1, 51, 381, 561, -1, -1, -1, -1, 566, -1, ! 60, -1, -1, -1, -1, 573, 66, -1, -1, -1, ! -1, -1, 580, 73, 582, -1, -1, 77, -1, 453, ! 454, -1, 590, 83, 592, -1, 86, 87, -1, 463, ! 598, 465, -1, 601, 94, 603, -1, -1, -1, -1, ! -1, -1, -1, 103, 104, 105, 106, -1, 316, 109, ! 110, 319, -1, -1, -1, -1, 490, -1, -1, -1, ! -1, -1, -1, -1, 453, 454, -1, 501, -1, -1, ! -1, -1, 506, -1, 463, 343, 465, -1, -1, 347, ! 159, 160, 161, 162, -1, 353, 354, -1, 167, 168, ! -1, -1, -1, 527, -1, -1, 530, -1, -1, -1, ! -1, 490, -1, -1, 538, -1, -1, -1, 376, 377, ! -1, -1, 501, -1, -1, -1, -1, 506, 552, -1, ! 388, -1, -1, -1, -1, -1, -1, 561, 159, 160, ! 161, 162, 566, 401, -1, -1, 167, 168, 527, 573, ! -1, 530, -1, -1, -1, -1, 580, -1, 582, 538, ! -1, -1, -1, -1, -1, -1, 590, -1, 592, -1, ! -1, -1, -1, 552, 598, -1, -1, 601, -1, 603, ! -1, -1, 561, -1, -1, -1, -1, 566, -1, -1, ! -1, -1, -1, -1, 573, -1, -1, -1, -1, -1, ! -1, 580, -1, 582, -1, -1, -1, -1, -1, -1, ! -1, 590, -1, 592, -1, -1, -1, -1, -1, 598, ! -1, -1, 601, -1, 603, 483, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, 497, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 323, 324, 325, 326, 327, 328, ! 329, 330, 331, 332, 333, 334, -1, 336, 337, 338, ! 339, 340, 341, 342, -1, -1, -1, 1, -1, 3, ! 4, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 551, -1, -1, -1, 555, -1, 557, ! -1, -1, 323, 324, 325, 326, 327, 328, 329, 330, ! 331, 332, 333, 334, -1, 336, 337, 338, 339, 340, ! 341, 342, 46, 47, -1, -1, 395, 51, -1, 398, ! -1, -1, -1, -1, -1, -1, 60, -1, -1, -1, ! -1, -1, 66, -1, 3, 4, -1, -1, -1, 73, ! -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, ! -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, ! 94, -1, -1, -1, 395, -1, -1, 398, -1, 103, ! 104, 105, 106, -1, -1, 109, 110, 46, 47, -1, ! -1, -1, 51, -1, -1, -1, -1, -1, -1, -1, ! -1, 60, -1, -1, -1, -1, -1, 66, 477, 478, ! 3, 4, -1, -1, 73, -1, -1, -1, 77, -1, ! 489, -1, -1, -1, 83, -1, -1, 86, 87, -1, ! -1, 90, 91, -1, -1, 94, -1, 96, 97, -1, ! -1, -1, 101, -1, 103, 104, 105, 106, -1, -1, ! 109, 110, -1, 46, 47, -1, 477, 478, 51, -1, ! -1, -1, -1, -1, -1, -1, -1, 60, 489, -1, ! -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, ! 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, ! -1, 94, -1, 96, 97, -1, -1, -1, -1, -1, ! 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, ! -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, ! -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, ! -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, ! -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, ! -1, -1, 94, -1, 96, 46, 47, -1, -1, -1, ! 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, ! -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, ! -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, ! -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, ! 91, -1, -1, 94, -1, -1, -1, -1, -1, 100, ! -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, ! -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, ! 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, ! -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, ! -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, ! 90, 91, -1, -1, 94, 95, -1, 46, 47, -1, ! -1, -1, 51, 103, 104, 105, 106, -1, -1, 109, ! 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, ! -1, 90, 91, -1, -1, 94, -1, -1, -1, -1, ! 99, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, ! -1, -1, 90, 91, -1, -1, 94, -1, -1, 46, ! 47, -1, 100, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, ! 87, -1, -1, 90, 91, -1, -1, 94, 95, -1, ! -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, *************** static const short yycheck[] = *** 1303,1315 **** 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, 94, ! -1, -1, -1, -1, 99, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, ! 94, -1, -1, 46, 47, -1, 100, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, --- 1661,1673 ---- 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, 94, ! 95, -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, ! 94, 95, -1, 46, 47, -1, -1, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, *************** static const short yycheck[] = *** 1320,1370 **** -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, ! -1, -1, 94, 95, -1, 46, 47, -1, -1, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, 94, 95, -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, ! -1, 51, -1, -1, 3, 4, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, ! 90, 91, -1, -1, 94, 95, -1, 46, 47, -1, ! -1, -1, 51, 103, 104, 105, 106, -1, -1, 109, ! 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, ! -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, ! -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, ! -1, 90, 91, -1, -1, 94, 95, -1, -1, -1, ! -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, ! 109, 110, -1, 51, -1, -1, 3, 4, -1, -1, ! -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, ! -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, ! -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, ! -1, -1, 90, 91, -1, -1, 94, -1, -1, 46, ! 47, -1, 100, -1, 51, 103, 104, 105, 106, -1, ! -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, ! -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, ! 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, ! 87, -1, -1, 90, 91, -1, -1, 94, 95, -1, ! -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, ! 46, 47, 109, 110, -1, 51, -1, -1, -1, -1, ! -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, ! 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, ! 86, 87, -1, -1, 90, 91, -1, -1, 94, -1, ! -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, ! 106, -1, -1, 109, 110, 44, -1, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, ! 59, 60, -1, -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, ! 109, 110, 44, -1, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, ! -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, --- 1678,1719 ---- -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, ! -1, -1, 94, -1, -1, 46, 47, -1, 100, -1, 51, 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, -1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, 94, 95, -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, ! -1, 51, -1, -1, -1, -1, -1, -1, -1, -1, 60, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, ! 90, 91, -1, -1, 94, -1, -1, -1, -1, -1, ! -1, -1, -1, 103, 104, 105, 106, -1, -1, 109, ! 110, 44, -1, 46, 47, 48, 49, 50, 51, 52, ! -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, ! 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, ! 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, ! 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, ! -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, ! 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, ! 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, ! -1, -1, -1, 59, 60, -1, -1, 63, -1, -1, ! 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, ! 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, ! 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, ! 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, ! 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, ! -1, -1, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, *************** static const short yycheck[] = *** 1401,1573 **** 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, ! 97, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, ! 60, -1, -1, -1, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, ! -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, ! -1, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, ! -1, 94, -1, 96, -1, -1, -1, 100, -1, -1, ! 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, ! 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, ! -1, -1, -1, 59, 60, -1, -1, -1, -1, -1, ! 66, 67, -1, 69, -1, 71, 72, 73, 74, -1, ! -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, ! 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, ! 96, -1, -1, -1, 100, -1, -1, 103, 104, 105, ! 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, ! 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, ! 59, 60, -1, -1, -1, -1, -1, 66, 67, -1, ! 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, ! -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, ! -1, -1, -1, -1, -1, 94, 44, 96, 46, 47, ! -1, 100, -1, 51, 103, 104, 105, 106, -1, -1, ! 109, 110, 60, -1, -1, -1, -1, -1, 66, -1, ! -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, ! -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, ! -1, -1, -1, -1, -1, -1, 94, -1, -1, -1, ! -1, -1, -1, -1, -1, 103, 104, 105, 106, -1, ! -1, 109, 110 }; - #define YYPURE 1 ! /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ ! #line 3 "/usr/share/bison/bison.simple" ! ! /* Skeleton output parser for bison, ! ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software ! Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* This is the parser code that is written into each bison parser when ! the %semantic_parser declaration is not specified in the grammar. ! It was written by Richard Stallman by simplifying the hairy parser ! used when %semantic_parser is specified. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! #ifdef __cplusplus ! # define YYSTD(x) std::x ! #else ! # define YYSTD(x) x ! #endif ! ! #ifndef YYPARSE_RETURN_TYPE ! #define YYPARSE_RETURN_TYPE int ! #endif ! ! #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 1750,1844 ---- 67, 68, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, ! -1, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, ! 60, -1, -1, -1, -1, -1, 66, 67, -1, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, ! -1, -1, -1, -1, 94, -1, 96, -1, -1, -1, 100, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110, 44, -1, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, ! -1, -1, -1, 66, 67, -1, 69, -1, 71, 72, 73, 74, -1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, ! -1, 94, 44, 96, 46, 47, -1, 100, -1, 51, ! 103, 104, 105, 106, -1, -1, 109, 110, 60, -1, ! -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, ! -1, 73, -1, -1, -1, 77, -1, -1, -1, -1, ! -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, ! -1, -1, 94, -1, -1, -1, -1, -1, -1, -1, ! -1, 103, 104, 105, 106, -1, -1, 109, 110 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned short yystos[] = { ! 0, 44, 56, 62, 68, 76, 100, 112, 125, 126, ! 127, 128, 129, 130, 131, 132, 133, 134, 164, 185, ! 87, 121, 122, 123, 124, 124, 124, 121, 0, 127, ! 129, 132, 126, 127, 44, 62, 68, 100, 102, 64, ! 165, 169, 64, 137, 100, 102, 127, 124, 124, 5, ! 124, 117, 119, 121, 96, 170, 101, 167, 117, 118, ! 53, 138, 166, 169, 137, 100, 51, 60, 83, 86, ! 97, 114, 115, 116, 117, 120, 121, 133, 134, 144, ! 150, 164, 171, 172, 173, 174, 119, 170, 119, 139, ! 136, 170, 168, 138, 124, 151, 124, 145, 146, 147, ! 151, 98, 234, 234, 60, 114, 100, 97, 172, 101, ! 96, 140, 170, 135, 94, 54, 98, 154, 100, 101, ! 93, 98, 154, 99, 98, 151, 145, 151, 119, 44, ! 96, 97, 122, 133, 134, 141, 142, 143, 144, 149, ! 150, 157, 158, 159, 160, 164, 177, 185, 140, 95, ! 114, 133, 152, 153, 118, 155, 99, 124, 146, 3, ! 4, 46, 47, 60, 66, 73, 77, 90, 91, 94, ! 96, 103, 104, 105, 106, 109, 110, 113, 115, 120, ! 121, 148, 175, 222, 223, 224, 225, 226, 229, 231, ! 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, ! 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, ! 255, 256, 257, 258, 259, 261, 99, 99, 154, 100, ! 154, 44, 49, 50, 52, 55, 59, 67, 69, 71, ! 72, 74, 94, 97, 114, 115, 120, 121, 124, 133, ! 134, 177, 178, 179, 180, 181, 182, 184, 185, 186, ! 187, 189, 190, 191, 192, 194, 200, 201, 203, 204, ! 205, 207, 208, 212, 213, 214, 215, 216, 217, 218, ! 225, 236, 238, 239, 240, 242, 243, 258, 94, 160, ! 97, 142, 100, 156, 177, 177, 154, 147, 114, 95, ! 101, 101, 121, 235, 237, 241, 241, 241, 241, 102, ! 102, 115, 117, 118, 241, 241, 115, 121, 261, 97, ! 101, 148, 176, 102, 102, 94, 98, 102, 102, 98, ! 124, 46, 47, 5, 6, 7, 3, 4, 8, 9, ! 10, 18, 19, 20, 21, 58, 16, 17, 11, 12, ! 13, 14, 15, 88, 92, 93, 260, 94, 261, 100, ! 124, 100, 261, 94, 94, 177, 94, 100, 124, 261, ! 145, 89, 114, 97, 179, 100, 44, 182, 100, 182, ! 182, 133, 181, 190, 209, 211, 100, 94, 95, 152, ! 154, 96, 161, 147, 153, 118, 68, 124, 98, 232, ! 233, 234, 232, 234, 94, 95, 234, 234, 95, 97, ! 97, 101, 68, 68, 95, 230, 261, 261, 68, 73, ! 77, 73, 124, 261, 94, 241, 241, 241, 246, 246, ! 247, 247, 247, 248, 248, 248, 248, 115, 116, 249, ! 249, 250, 251, 252, 253, 254, 261, 257, 261, 100, ! 100, 100, 261, 261, 61, 65, 219, 220, 221, 100, ! 95, 145, 67, 101, 100, 261, 261, 95, 161, 66, ! 77, 97, 121, 162, 163, 178, 100, 94, 261, 233, ! 234, 175, 234, 175, 95, 230, 241, 95, 95, 244, ! 97, 148, 95, 101, 99, 94, 99, 95, 230, 89, ! 95, 95, 95, 94, 177, 220, 221, 94, 190, 210, ! 211, 100, 95, 100, 102, 97, 178, 94, 97, 95, ! 230, 99, 227, 95, 241, 244, 1, 261, 95, 230, ! 140, 95, 256, 49, 182, 183, 184, 186, 188, 193, ! 200, 202, 206, 208, 96, 195, 153, 261, 95, 210, ! 1, 177, 66, 97, 95, 230, 95, 140, 228, 95, ! 140, 94, 57, 183, 183, 100, 48, 63, 97, 196, ! 197, 198, 199, 95, 95, 182, 95, 94, 100, 95, ! 140, 261, 182, 100, 261, 89, 261, 262, 97, 197, ! 198, 97, 178, 199, 177, 100, 182, 95, 230, 100, ! 95, 210, 100, 89, 97, 100, 95, 183, 95, 210, ! 100, 57, 183, 95, 183, 183 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 1575,1588 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 1846,1854 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 1591,1619 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 1857,1890 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 1621,1672 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 1892,1922 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! #else ! # define YYLEX yylex (&yylval) ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 1674,1688 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 1924,2016 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 1702,1736 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ ! /* This is the most reliable way to avoid incompatibilities ! in available built-in functions on various systems. */ ! static void ! # if defined (__STDC__) || defined (__cplusplus) ! yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) ! # else ! yymemcpy (yyto, yyfrom, yycount) ! char *yyto; ! const char *yyfrom; ! YYSIZE_T yycount; ! # endif ! { ! register const char *yyf = yyfrom; ! register char *yyt = yyto; ! register YYSIZE_T yyi = yycount; ! ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 2030,2039 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 1780,1857 **** } # endif # endif - #endif - - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); ! # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif ! /* YY_DECL_VARIABLES -- depending whether we use a pure parser, ! variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ ! int yynerrs; ! #if YYLSP_NEEDED ! # define YY_DECL_VARIABLES \ ! YY_DECL_NON_LSP_VARIABLES \ ! \ ! /* Location data for the lookahead symbol. */ \ ! YYLTYPE yylloc; #else ! # define YY_DECL_VARIABLES \ ! YY_DECL_NON_LSP_VARIABLES #endif - /* If nonreentrant, generate the variables here. */ - #if !YYPURE - YY_DECL_VARIABLES - #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ register int yystate; register int yyn; --- 2083,2208 ---- } # endif # endif + #endif /* !YYERROR_VERBOSE */ ! ! #if YYDEBUG ! /*--------------------------------. ! | Print this symbol on YYOUTPUT. | ! `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); # endif + } + else + YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); + + switch (yytype) + { + default: + break; + } + YYFPRINTF (yyoutput, ")"); + } + + #endif /* ! YYDEBUG */ + /*-----------------------------------------------. + | Release the memory associated to this symbol. | + `-----------------------------------------------*/ + + #if defined (__STDC__) || defined (__cplusplus) + static void + yydestruct (int yytype, YYSTYPE *yyvaluep) + #else + static void + yydestruct (yytype, yyvaluep) + int yytype; + YYSTYPE *yyvaluep; #endif + { + /* Pacify ``unused variable'' warnings. */ + (void) yyvaluep; ! switch (yytype) ! { ! default: ! break; ! } ! } ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); ! # else ! int yyparse (); ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void); #else ! int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! ! /*----------. ! | yyparse. | ! `----------*/ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! ! #endif ! #endif { ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ ! int yynerrs; register int yystate; register int yyn; *************** yyparse (YYPARSE_PARAM_ARG) *** 1859,1865 **** /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 2210,2216 ---- /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 1869,1875 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 2220,2226 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 1879,1909 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 2230,2248 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 1920,1928 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 2259,2265 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 1937,1943 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 2274,2280 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 1950,1982 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 2287,2315 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 1985,2011 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 2318,2341 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 2013,2019 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 2343,2348 ---- *************** yybackup: *** 2026,2113 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 2355,2409 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 2138,2324 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { - int yyi; - - YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", - yyn, yyrline[yyn]); - - /* Print the symbols being reduced, and their result. */ - for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) - YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); - YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); - } - #endif - - switch (yyn) { - - case 10: - #line 211 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" - { /* use preset global here. FIXME */ yyval.node = xstrdup ("int"); ! ; ! break;} ! case 11: ! #line 216 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { /* use preset global here. FIXME */ yyval.node = xstrdup ("double"); ! ; ! break;} ! case 12: ! #line 221 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { /* use preset global here. FIXME */ yyval.node = xstrdup ("boolean"); ! ; ! break;} ! case 18: ! #line 246 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { while (bracket_count-- > 0) yyval.node = concat ("[", yyvsp[-1].node, NULL); ! ; ! break;} ! case 19: ! #line 251 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { while (bracket_count-- > 0) yyval.node = concat ("[", yyvsp[-1].node, NULL); ! ; ! break;} ! case 23: ! #line 269 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { yyval.node = concat (yyvsp[-2].node, ".", yyvsp[0].node, NULL); ! ; ! break;} ! case 37: ! #line 301 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { package_name = yyvsp[-1].node; ; ! break;} ! case 45: ! #line 328 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { if (yyvsp[0].value == PUBLIC_TK) modifier_value++; if (yyvsp[0].value == STATIC_TK) modifier_value++; USE_ABSORBER; ! ; ! break;} ! case 46: ! #line 336 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { if (yyvsp[0].value == PUBLIC_TK) modifier_value++; if (yyvsp[0].value == STATIC_TK) modifier_value++; USE_ABSORBER; ! ; ! break;} ! case 47: ! #line 348 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration(yyvsp[-2].node); modifier_value = 0; ! ; ! break;} ! case 49: ! #line 354 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration(yyvsp[-2].node); ; ! break;} ! case 55: ! #line 368 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 56: ! #line 370 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 57: ! #line 375 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { pop_class_context (); ; ! break;} ! case 58: ! #line 377 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { pop_class_context (); ; ! break;} ! case 70: ! #line 403 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 71: ! #line 405 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { modifier_value = 0; ; ! break;} ! case 76: ! #line 421 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { bracket_count = 0; USE_ABSORBER; ; ! break;} ! case 77: ! #line 423 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++bracket_count; ; ! break;} ! case 81: ! #line 438 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 83: ! #line 441 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { modifier_value = 0; ; ! break;} ! case 84: ! #line 443 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_main_declaration (yyvsp[-1].declarator); modifier_value = 0; ! ; ! break;} ! case 85: ! #line 451 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { struct method_declarator *d; NEW_METHOD_DECLARATOR (d, yyvsp[-2].node, NULL); yyval.declarator = d; ! ; ! break;} ! case 86: ! #line 457 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { struct method_declarator *d; NEW_METHOD_DECLARATOR (d, yyvsp[-3].node, yyvsp[-1].node); yyval.declarator = d; ! ; ! break;} ! case 89: ! #line 468 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { yyval.node = concat (yyvsp[-2].node, ",", yyvsp[0].node, NULL); ! ; ! break;} ! case 90: ! #line 475 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; if (bracket_count) { --- 2434,2623 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) ! { ! case 11: ! #line 211 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" { /* use preset global here. FIXME */ yyval.node = xstrdup ("int"); ! ;} ! break; ! ! case 12: ! #line 216 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { /* use preset global here. FIXME */ yyval.node = xstrdup ("double"); ! ;} ! break; ! ! case 13: ! #line 221 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { /* use preset global here. FIXME */ yyval.node = xstrdup ("boolean"); ! ;} ! break; ! ! case 19: ! #line 246 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { while (bracket_count-- > 0) yyval.node = concat ("[", yyvsp[-1].node, NULL); ! ;} ! break; ! ! case 20: ! #line 251 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { while (bracket_count-- > 0) yyval.node = concat ("[", yyvsp[-1].node, NULL); ! ;} ! break; ! ! case 24: ! #line 269 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { yyval.node = concat (yyvsp[-2].node, ".", yyvsp[0].node, NULL); ! ;} ! break; ! ! case 38: ! #line 301 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { package_name = yyvsp[-1].node; ;} ! break; ! ! case 46: ! #line 328 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { if (yyvsp[0].value == PUBLIC_TK) modifier_value++; if (yyvsp[0].value == STATIC_TK) modifier_value++; USE_ABSORBER; ! ;} ! break; ! ! case 47: ! #line 336 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { if (yyvsp[0].value == PUBLIC_TK) modifier_value++; if (yyvsp[0].value == STATIC_TK) modifier_value++; USE_ABSORBER; ! ;} ! break; ! ! case 48: ! #line 348 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { report_class_declaration(yyvsp[-2].node); modifier_value = 0; ! ;} ! break; ! ! case 50: ! #line 354 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { report_class_declaration(yyvsp[-2].node); ;} ! break; ! ! case 56: ! #line 368 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; ;} ! break; ! ! case 57: ! #line 370 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; ;} ! break; ! ! case 58: ! #line 375 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { pop_class_context (); ;} ! break; ! ! case 59: ! #line 377 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { pop_class_context (); ;} ! break; ! ! case 71: ! #line 403 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; ;} ! break; ! ! case 72: ! #line 405 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { modifier_value = 0; ;} ! break; ! ! case 77: ! #line 421 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { bracket_count = 0; USE_ABSORBER; ;} ! break; ! ! case 78: ! #line 423 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { ++bracket_count; ;} ! break; ! ! case 82: ! #line 438 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; ;} ! break; ! ! case 84: ! #line 441 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { modifier_value = 0; ;} ! break; ! ! case 85: ! #line 443 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { report_main_declaration (yyvsp[-1].declarator); modifier_value = 0; ! ;} ! break; ! ! case 86: ! #line 451 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { struct method_declarator *d; NEW_METHOD_DECLARATOR (d, yyvsp[-2].node, NULL); yyval.declarator = d; ! ;} ! break; ! ! case 87: ! #line 457 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { struct method_declarator *d; NEW_METHOD_DECLARATOR (d, yyvsp[-3].node, yyvsp[-1].node); yyval.declarator = d; ! ;} ! break; ! ! case 90: ! #line 468 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { yyval.node = concat (yyvsp[-2].node, ",", yyvsp[0].node, NULL); ! ;} ! break; ! ! case 91: ! #line 475 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; if (bracket_count) { *************** case 90: *** 2331,2341 **** } else yyval.node = yyvsp[-1].node; ! ; ! break;} ! case 91: ! #line 490 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { if (bracket_count) { int i; --- 2630,2641 ---- } else yyval.node = yyvsp[-1].node; ! ;} ! break; ! ! case 92: ! #line 490 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { if (bracket_count) { int i; *************** case 91: *** 2347,2588 **** } else yyval.node = yyvsp[-1].node; ! ; ! break;} ! case 94: ! #line 511 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 95: ! #line 513 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 99: ! #line 528 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 101: ! #line 539 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { modifier_value = 0; ; ! break;} ! case 103: ! #line 544 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { modifier_value = 0; ; ! break;} ! case 104: ! #line 551 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 105: ! #line 553 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 112: ! #line 570 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 113: ! #line 572 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 116: ! #line 584 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (yyvsp[0].node); modifier_value = 0; ; ! break;} ! case 118: ! #line 587 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (yyvsp[0].node); modifier_value = 0; ; ! break;} ! case 120: ! #line 590 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (yyvsp[-1].node); modifier_value = 0; ; ! break;} ! case 122: ! #line 593 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (yyvsp[-1].node); modifier_value = 0; ; ! break;} ! case 126: ! #line 604 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { pop_class_context (); ; ! break;} ! case 127: ! #line 606 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { pop_class_context (); ; ! break;} ! case 150: ! #line 665 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 151: ! #line 667 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { modifier_value = 0; ; ! break;} ! case 175: ! #line 707 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 186: ! #line 735 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 187: ! #line 740 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 188: ! #line 745 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 196: ! #line 765 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 201: ! #line 780 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 205: ! #line 797 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 211: ! #line 815 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 222: ! #line 840 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 225: ! #line 849 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 228: ! #line 859 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 234: ! #line 874 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 235: ! #line 878 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 246: ! #line 900 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 247: ! #line 905 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 248: ! #line 907 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 249: ! #line 909 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 250: ! #line 911 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 258: ! #line 926 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (NULL); ; ! break;} ! case 260: ! #line 929 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { report_class_declaration (NULL); ; ! break;} ! case 262: ! #line 935 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 276: ! #line 967 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { bracket_count = 1; ; ! break;} ! case 277: ! #line 969 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { bracket_count++; ; ! break;} ! case 280: ! #line 982 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ++complexity; ; ! break;} ! case 281: ! #line 984 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ++complexity; ; ! break;} ! case 282: ! #line 985 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 283: ! #line 986 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 284: ! #line 987 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 285: ! #line 988 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 286: ! #line 993 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 289: ! #line 1000 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! case 336: ! #line 1096 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 338: ! #line 1102 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 340: ! #line 1108 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { ++complexity; ; ! break;} ! case 344: ! #line 1122 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" ! { USE_ABSORBER; ; ! break;} ! } ! #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 2647,2929 ---- } else yyval.node = yyvsp[-1].node; ! ;} ! break; ! case 95: ! #line 511 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" ! { USE_ABSORBER; ;} ! break; + case 96: + #line 513 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 100: + #line 528 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 102: + #line 539 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { modifier_value = 0; ;} + break; + + case 104: + #line 544 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { modifier_value = 0; ;} + break; + + case 105: + #line 551 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 106: + #line 553 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 113: + #line 570 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 114: + #line 572 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 117: + #line 584 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (yyvsp[0].node); modifier_value = 0; ;} + break; + + case 119: + #line 587 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (yyvsp[0].node); modifier_value = 0; ;} + break; + + case 121: + #line 590 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (yyvsp[-1].node); modifier_value = 0; ;} + break; + + case 123: + #line 593 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (yyvsp[-1].node); modifier_value = 0; ;} + break; + + case 127: + #line 604 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { pop_class_context (); ;} + break; + + case 128: + #line 606 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { pop_class_context (); ;} + break; + + case 151: + #line 665 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 152: + #line 667 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { modifier_value = 0; ;} + break; + + case 176: + #line 707 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 187: + #line 735 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 188: + #line 740 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 189: + #line 745 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 197: + #line 765 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 202: + #line 780 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 206: + #line 797 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 212: + #line 815 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 223: + #line 840 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 226: + #line 849 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 229: + #line 859 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 235: + #line 874 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 236: + #line 878 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 247: + #line 900 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 248: + #line 905 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 249: + #line 907 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 250: + #line 909 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 251: + #line 911 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 259: + #line 926 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (NULL); ;} + break; + + case 261: + #line 929 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { report_class_declaration (NULL); ;} + break; + + case 263: + #line 935 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 277: + #line 967 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { bracket_count = 1; ;} + break; + + case 278: + #line 969 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { bracket_count++; ;} + break; + + case 281: + #line 982 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ++complexity; ;} + break; + + case 282: + #line 984 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ++complexity; ;} + break; + + case 283: + #line 985 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 284: + #line 986 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 285: + #line 987 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 286: + #line 988 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 287: + #line 993 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 290: + #line 1000 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + case 337: + #line 1096 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 339: + #line 1102 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 341: + #line 1108 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { ++complexity; ;} + break; + + case 345: + #line 1122 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" + { USE_ABSORBER; ;} + break; + + + } + + /* Line 991 of yacc.c. */ + #line 2917 "ps2505.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 344: *** 2590,2600 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 2931,2941 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 2607,2619 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 2948,2960 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 2622,2636 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 2963,2977 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 2638,2644 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 2979,2985 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 2650,2751 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 2991,3082 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 2753,2761 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 3084,3090 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 2775,2787 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 3104,3118 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 2790,2796 **** #endif return yyresult; } ! #line 1140 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse-scan.y" /* Create a new parser context */ --- 3121,3129 ---- #endif return yyresult; } ! ! ! #line 1140 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse-scan.y" /* Create a new parser context */ *************** yyerror (msg) *** 2939,2941 **** --- 3272,3276 ---- fprintf (stderr, "%s: %d: %s\n", input_filename, lineno, msg); exit (1); } + + diff -Nrc3pad gcc-3.2.2/gcc/java/parse.c gcc-3.2.3/gcc/java/parse.c *** gcc-3.2.2/gcc/java/parse.c Wed Feb 5 03:21:22 2003 --- gcc-3.2.3/gcc/java/parse.c Tue Apr 22 08:16:52 2003 *************** *** 1,125 **** ! /* A Bison parser, made from /home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y ! by GNU bison 1.33. */ ! #define YYBISON 1 /* Identify Bison output. */ #define yyparse java_parse ! #define yylex java_lex #define yyerror java_error ! #define yylval java_lval ! #define yychar java_char #define yydebug java_debug #define yynerrs java_nerrs - # define PLUS_TK 257 - # define MINUS_TK 258 - # define MULT_TK 259 - # define DIV_TK 260 - # define REM_TK 261 - # define LS_TK 262 - # define SRS_TK 263 - # define ZRS_TK 264 - # define AND_TK 265 - # define XOR_TK 266 - # define OR_TK 267 - # define BOOL_AND_TK 268 - # define BOOL_OR_TK 269 - # define EQ_TK 270 - # define NEQ_TK 271 - # define GT_TK 272 - # define GTE_TK 273 - # define LT_TK 274 - # define LTE_TK 275 - # define PLUS_ASSIGN_TK 276 - # define MINUS_ASSIGN_TK 277 - # define MULT_ASSIGN_TK 278 - # define DIV_ASSIGN_TK 279 - # define REM_ASSIGN_TK 280 - # define LS_ASSIGN_TK 281 - # define SRS_ASSIGN_TK 282 - # define ZRS_ASSIGN_TK 283 - # define AND_ASSIGN_TK 284 - # define XOR_ASSIGN_TK 285 - # define OR_ASSIGN_TK 286 - # define PUBLIC_TK 287 - # define PRIVATE_TK 288 - # define PROTECTED_TK 289 - # define STATIC_TK 290 - # define FINAL_TK 291 - # define SYNCHRONIZED_TK 292 - # define VOLATILE_TK 293 - # define TRANSIENT_TK 294 - # define NATIVE_TK 295 - # define PAD_TK 296 - # define ABSTRACT_TK 297 - # define STRICT_TK 298 - # define MODIFIER_TK 299 - # define DECR_TK 300 - # define INCR_TK 301 - # define DEFAULT_TK 302 - # define IF_TK 303 - # define THROW_TK 304 - # define BOOLEAN_TK 305 - # define DO_TK 306 - # define IMPLEMENTS_TK 307 - # define THROWS_TK 308 - # define BREAK_TK 309 - # define IMPORT_TK 310 - # define ELSE_TK 311 - # define INSTANCEOF_TK 312 - # define RETURN_TK 313 - # define VOID_TK 314 - # define CATCH_TK 315 - # define INTERFACE_TK 316 - # define CASE_TK 317 - # define EXTENDS_TK 318 - # define FINALLY_TK 319 - # define SUPER_TK 320 - # define WHILE_TK 321 - # define CLASS_TK 322 - # define SWITCH_TK 323 - # define CONST_TK 324 - # define TRY_TK 325 - # define FOR_TK 326 - # define NEW_TK 327 - # define CONTINUE_TK 328 - # define GOTO_TK 329 - # define PACKAGE_TK 330 - # define THIS_TK 331 - # define BYTE_TK 332 - # define SHORT_TK 333 - # define INT_TK 334 - # define LONG_TK 335 - # define CHAR_TK 336 - # define INTEGRAL_TK 337 - # define FLOAT_TK 338 - # define DOUBLE_TK 339 - # define FP_TK 340 - # define ID_TK 341 - # define REL_QM_TK 342 - # define REL_CL_TK 343 - # define NOT_TK 344 - # define NEG_TK 345 - # define ASSIGN_ANY_TK 346 - # define ASSIGN_TK 347 - # define OP_TK 348 - # define CP_TK 349 - # define OCB_TK 350 - # define CCB_TK 351 - # define OSB_TK 352 - # define CSB_TK 353 - # define SC_TK 354 - # define C_TK 355 - # define DOT_TK 356 - # define STRING_LIT_TK 357 - # define CHAR_LIT_TK 358 - # define INT_LIT_TK 359 - # define FP_LIT_TK 360 - # define TRUE_TK 361 - # define FALSE_TK 362 - # define BOOL_LIT_TK 363 - # define NULL_TK 364 ! #line 48 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" #include "config.h" #include "system.h" --- 1,291 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 + /* Skeleton name. */ + #define YYSKELETON_NAME "yacc.c" + + /* Pure parsers. */ + #define YYPURE 1 + + /* Using locations. */ + #define YYLSP_NEEDED 0 + + /* If NAME_PREFIX is specified substitute the variables and functions + names. */ #define yyparse java_parse ! #define yylex java_lex #define yyerror java_error ! #define yylval java_lval ! #define yychar java_char #define yydebug java_debug #define yynerrs java_nerrs ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! PLUS_TK = 258, ! MINUS_TK = 259, ! MULT_TK = 260, ! DIV_TK = 261, ! REM_TK = 262, ! LS_TK = 263, ! SRS_TK = 264, ! ZRS_TK = 265, ! AND_TK = 266, ! XOR_TK = 267, ! OR_TK = 268, ! BOOL_AND_TK = 269, ! BOOL_OR_TK = 270, ! EQ_TK = 271, ! NEQ_TK = 272, ! GT_TK = 273, ! GTE_TK = 274, ! LT_TK = 275, ! LTE_TK = 276, ! PLUS_ASSIGN_TK = 277, ! MINUS_ASSIGN_TK = 278, ! MULT_ASSIGN_TK = 279, ! DIV_ASSIGN_TK = 280, ! REM_ASSIGN_TK = 281, ! LS_ASSIGN_TK = 282, ! SRS_ASSIGN_TK = 283, ! ZRS_ASSIGN_TK = 284, ! AND_ASSIGN_TK = 285, ! XOR_ASSIGN_TK = 286, ! OR_ASSIGN_TK = 287, ! PUBLIC_TK = 288, ! PRIVATE_TK = 289, ! PROTECTED_TK = 290, ! STATIC_TK = 291, ! FINAL_TK = 292, ! SYNCHRONIZED_TK = 293, ! VOLATILE_TK = 294, ! TRANSIENT_TK = 295, ! NATIVE_TK = 296, ! PAD_TK = 297, ! ABSTRACT_TK = 298, ! STRICT_TK = 299, ! MODIFIER_TK = 300, ! DECR_TK = 301, ! INCR_TK = 302, ! DEFAULT_TK = 303, ! IF_TK = 304, ! THROW_TK = 305, ! BOOLEAN_TK = 306, ! DO_TK = 307, ! IMPLEMENTS_TK = 308, ! THROWS_TK = 309, ! BREAK_TK = 310, ! IMPORT_TK = 311, ! ELSE_TK = 312, ! INSTANCEOF_TK = 313, ! RETURN_TK = 314, ! VOID_TK = 315, ! CATCH_TK = 316, ! INTERFACE_TK = 317, ! CASE_TK = 318, ! EXTENDS_TK = 319, ! FINALLY_TK = 320, ! SUPER_TK = 321, ! WHILE_TK = 322, ! CLASS_TK = 323, ! SWITCH_TK = 324, ! CONST_TK = 325, ! TRY_TK = 326, ! FOR_TK = 327, ! NEW_TK = 328, ! CONTINUE_TK = 329, ! GOTO_TK = 330, ! PACKAGE_TK = 331, ! THIS_TK = 332, ! BYTE_TK = 333, ! SHORT_TK = 334, ! INT_TK = 335, ! LONG_TK = 336, ! CHAR_TK = 337, ! INTEGRAL_TK = 338, ! FLOAT_TK = 339, ! DOUBLE_TK = 340, ! FP_TK = 341, ! ID_TK = 342, ! REL_QM_TK = 343, ! REL_CL_TK = 344, ! NOT_TK = 345, ! NEG_TK = 346, ! ASSIGN_ANY_TK = 347, ! ASSIGN_TK = 348, ! OP_TK = 349, ! CP_TK = 350, ! OCB_TK = 351, ! CCB_TK = 352, ! OSB_TK = 353, ! CSB_TK = 354, ! SC_TK = 355, ! C_TK = 356, ! DOT_TK = 357, ! STRING_LIT_TK = 358, ! CHAR_LIT_TK = 359, ! INT_LIT_TK = 360, ! FP_LIT_TK = 361, ! TRUE_TK = 362, ! FALSE_TK = 363, ! BOOL_LIT_TK = 364, ! NULL_TK = 365 ! }; ! #endif ! #define PLUS_TK 258 ! #define MINUS_TK 259 ! #define MULT_TK 260 ! #define DIV_TK 261 ! #define REM_TK 262 ! #define LS_TK 263 ! #define SRS_TK 264 ! #define ZRS_TK 265 ! #define AND_TK 266 ! #define XOR_TK 267 ! #define OR_TK 268 ! #define BOOL_AND_TK 269 ! #define BOOL_OR_TK 270 ! #define EQ_TK 271 ! #define NEQ_TK 272 ! #define GT_TK 273 ! #define GTE_TK 274 ! #define LT_TK 275 ! #define LTE_TK 276 ! #define PLUS_ASSIGN_TK 277 ! #define MINUS_ASSIGN_TK 278 ! #define MULT_ASSIGN_TK 279 ! #define DIV_ASSIGN_TK 280 ! #define REM_ASSIGN_TK 281 ! #define LS_ASSIGN_TK 282 ! #define SRS_ASSIGN_TK 283 ! #define ZRS_ASSIGN_TK 284 ! #define AND_ASSIGN_TK 285 ! #define XOR_ASSIGN_TK 286 ! #define OR_ASSIGN_TK 287 ! #define PUBLIC_TK 288 ! #define PRIVATE_TK 289 ! #define PROTECTED_TK 290 ! #define STATIC_TK 291 ! #define FINAL_TK 292 ! #define SYNCHRONIZED_TK 293 ! #define VOLATILE_TK 294 ! #define TRANSIENT_TK 295 ! #define NATIVE_TK 296 ! #define PAD_TK 297 ! #define ABSTRACT_TK 298 ! #define STRICT_TK 299 ! #define MODIFIER_TK 300 ! #define DECR_TK 301 ! #define INCR_TK 302 ! #define DEFAULT_TK 303 ! #define IF_TK 304 ! #define THROW_TK 305 ! #define BOOLEAN_TK 306 ! #define DO_TK 307 ! #define IMPLEMENTS_TK 308 ! #define THROWS_TK 309 ! #define BREAK_TK 310 ! #define IMPORT_TK 311 ! #define ELSE_TK 312 ! #define INSTANCEOF_TK 313 ! #define RETURN_TK 314 ! #define VOID_TK 315 ! #define CATCH_TK 316 ! #define INTERFACE_TK 317 ! #define CASE_TK 318 ! #define EXTENDS_TK 319 ! #define FINALLY_TK 320 ! #define SUPER_TK 321 ! #define WHILE_TK 322 ! #define CLASS_TK 323 ! #define SWITCH_TK 324 ! #define CONST_TK 325 ! #define TRY_TK 326 ! #define FOR_TK 327 ! #define NEW_TK 328 ! #define CONTINUE_TK 329 ! #define GOTO_TK 330 ! #define PACKAGE_TK 331 ! #define THIS_TK 332 ! #define BYTE_TK 333 ! #define SHORT_TK 334 ! #define INT_TK 335 ! #define LONG_TK 336 ! #define CHAR_TK 337 ! #define INTEGRAL_TK 338 ! #define FLOAT_TK 339 ! #define DOUBLE_TK 340 ! #define FP_TK 341 ! #define ID_TK 342 ! #define REL_QM_TK 343 ! #define REL_CL_TK 344 ! #define NOT_TK 345 ! #define NEG_TK 346 ! #define ASSIGN_ANY_TK 347 ! #define ASSIGN_TK 348 ! #define OP_TK 349 ! #define CP_TK 350 ! #define OCB_TK 351 ! #define CCB_TK 352 ! #define OSB_TK 353 ! #define CSB_TK 354 ! #define SC_TK 355 ! #define C_TK 356 ! #define DOT_TK 357 ! #define STRING_LIT_TK 358 ! #define CHAR_LIT_TK 359 ! #define INT_LIT_TK 360 ! #define FP_LIT_TK 361 ! #define TRUE_TK 362 ! #define FALSE_TK 363 ! #define BOOL_LIT_TK 364 ! #define NULL_TK 365 ! ! ! ! ! /* Copy the first part of user declarations. */ ! #line 48 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" #include "config.h" #include "system.h" *************** static tree src_parse_roots[1]; *** 517,525 **** } while (0) ! #line 446 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! #ifndef YYSTYPE ! typedef union { tree node; int sub_token; struct { --- 683,705 ---- } while (0) ! ! /* Enabling traces. */ ! #ifndef YYDEBUG ! # define YYDEBUG 1 ! #endif ! ! /* Enabling verbose error messages. */ ! #ifdef YYERROR_VERBOSE ! # undef YYERROR_VERBOSE ! # define YYERROR_VERBOSE 1 ! #else ! # define YYERROR_VERBOSE 0 ! #endif ! ! #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) ! #line 446 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! typedef union YYSTYPE { tree node; int sub_token; struct { *************** typedef union { *** 527,553 **** int location; } operator; int value; ! } yystype; ! # define YYSTYPE yystype #endif ! #line 456 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" #include "lex.c" ! #ifndef YYDEBUG ! # define YYDEBUG 1 #endif ! #define YYFINAL 778 ! #define YYFLAG -32768 ! #define YYNTBASE 111 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 364 ? yytranslate[x] : 274) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, --- 707,848 ---- int location; } operator; int value; ! } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 712 "p2378.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif ! ! ! ! /* Copy the second part of user declarations. */ ! #line 456 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" #include "lex.c" ! ! ! /* Line 214 of yacc.c. */ ! #line 727 "p2378.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! #endif + #if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; + #else + typedef short yysigned_char; + #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 3 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 5469 ! /* YYNTOKENS -- Number of terminals. */ ! #define YYNTOKENS 111 ! /* YYNNTS -- Number of nonterminals. */ ! #define YYNNTS 164 ! /* YYNRULES -- Number of rules. */ ! #define YYNRULES 506 ! /* YYNRULES -- Number of states. */ ! #define YYNSTATES 778 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 365 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, *************** static const char yytranslate[] = *** 574,892 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, ! 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, ! 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, ! 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, ! 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, ! 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, ! 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, ! 106, 107, 108, 109, 110 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 1, 4, 6, 8, 10, 12, 14, 16, ! 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, ! 39, 42, 44, 46, 48, 52, 54, 55, 57, 59, ! 61, 64, 67, 70, 74, 76, 79, 81, 84, 88, ! 91, 95, 97, 99, 103, 106, 110, 116, 121, 127, ! 129, 131, 133, 135, 137, 140, 141, 149, 150, 157, ! 161, 164, 168, 173, 174, 177, 181, 184, 185, 188, ! 191, 193, 197, 201, 204, 208, 210, 213, 215, 217, ! 219, 221, 223, 225, 227, 229, 231, 235, 240, 242, ! 246, 250, 252, 256, 260, 265, 267, 271, 274, 278, ! 282, 284, 286, 287, 291, 294, 298, 302, 307, 312, ! 315, 319, 322, 326, 329, 333, 338, 342, 346, 350, ! 352, 356, 360, 363, 367, 370, 374, 376, 377, 380, ! 383, 385, 389, 393, 395, 397, 400, 402, 403, 407, ! 410, 414, 418, 423, 426, 430, 434, 439, 441, 446, ! 452, 460, 467, 469, 471, 472, 477, 478, 484, 485, ! 491, 492, 499, 503, 508, 511, 515, 518, 522, 525, ! 529, 531, 534, 536, 538, 540, 542, 544, 547, 550, ! 553, 557, 561, 566, 568, 572, 576, 579, 583, 585, ! 587, 589, 592, 594, 596, 598, 601, 604, 608, 610, ! 612, 614, 616, 618, 620, 622, 624, 626, 628, 630, ! 632, 634, 636, 638, 640, 642, 644, 646, 648, 650, ! 652, 654, 657, 660, 663, 666, 669, 672, 675, 678, ! 682, 687, 692, 698, 703, 709, 716, 724, 731, 733, ! 735, 737, 739, 741, 743, 745, 751, 754, 758, 763, ! 771, 779, 780, 784, 789, 792, 796, 802, 805, 809, ! 813, 818, 820, 823, 826, 828, 831, 835, 838, 841, ! 845, 848, 853, 856, 859, 863, 868, 871, 873, 881, ! 889, 896, 900, 906, 911, 919, 926, 929, 932, 936, ! 939, 940, 942, 944, 947, 948, 950, 952, 956, 960, ! 963, 967, 970, 974, 977, 981, 984, 988, 991, 995, ! 998, 1002, 1006, 1009, 1013, 1019, 1025, 1028, 1033, 1037, ! 1039, 1043, 1047, 1052, 1055, 1057, 1060, 1063, 1068, 1071, ! 1075, 1080, 1083, 1086, 1088, 1090, 1092, 1094, 1098, 1100, ! 1102, 1104, 1106, 1108, 1112, 1116, 1120, 1124, 1128, 1132, ! 1136, 1140, 1144, 1150, 1155, 1157, 1162, 1168, 1174, 1181, ! 1185, 1189, 1194, 1200, 1203, 1207, 1208, 1216, 1217, 1224, ! 1228, 1232, 1234, 1238, 1242, 1246, 1250, 1255, 1260, 1265, ! 1270, 1274, 1278, 1280, 1283, 1287, 1291, 1294, 1297, 1301, ! 1305, 1309, 1313, 1316, 1320, 1325, 1331, 1338, 1344, 1351, ! 1356, 1361, 1366, 1371, 1375, 1380, 1384, 1389, 1391, 1393, ! 1395, 1397, 1400, 1403, 1405, 1407, 1410, 1412, 1415, 1417, ! 1420, 1423, 1426, 1429, 1432, 1435, 1437, 1440, 1443, 1445, ! 1448, 1451, 1457, 1462, 1467, 1473, 1478, 1481, 1487, 1492, ! 1498, 1500, 1504, 1508, 1512, 1516, 1520, 1524, 1526, 1530, ! 1534, 1538, 1542, 1544, 1548, 1552, 1556, 1560, 1564, 1568, ! 1570, 1574, 1578, 1582, 1586, 1590, 1594, 1598, 1602, 1606, ! 1610, 1612, 1616, 1620, 1624, 1628, 1630, 1634, 1638, 1640, ! 1644, 1648, 1650, 1654, 1658, 1660, 1664, 1668, 1670, 1674, ! 1678, 1680, 1686, 1691, 1695, 1701, 1703, 1705, 1709, 1713, ! 1715, 1717, 1719, 1721, 1723, 1725 }; static const short yyrhs[] = { ! -1, 112, 125, 0, 105, 0, 106, 0, 109, 0, ! 104, 0, 103, 0, 110, 0, 115, 0, 116, 0, ! 83, 0, 86, 0, 51, 0, 117, 0, 120, 0, ! 121, 0, 117, 0, 117, 0, 115, 244, 0, 121, ! 244, 0, 122, 0, 123, 0, 124, 0, 121, 102, ! 124, 0, 87, 0, 0, 128, 0, 126, 0, 127, ! 0, 128, 126, 0, 128, 127, 0, 126, 127, 0, ! 128, 126, 127, 0, 129, 0, 126, 129, 0, 132, ! 0, 127, 132, 0, 76, 121, 100, 0, 76, 1, ! 0, 76, 121, 1, 0, 130, 0, 131, 0, 56, ! 121, 100, 0, 56, 1, 0, 56, 121, 1, 0, ! 56, 121, 102, 5, 100, 0, 56, 121, 102, 1, ! 0, 56, 121, 102, 5, 1, 0, 134, 0, 169, ! 0, 192, 0, 1, 0, 45, 0, 133, 45, 0, ! 0, 133, 68, 124, 137, 138, 135, 140, 0, 0, ! 68, 124, 137, 138, 136, 140, 0, 133, 68, 1, ! 0, 68, 1, 0, 68, 124, 1, 0, 133, 68, ! 124, 1, 0, 0, 64, 118, 0, 64, 118, 1, ! 0, 64, 1, 0, 0, 53, 139, 0, 53, 1, ! 0, 119, 0, 139, 101, 119, 0, 139, 101, 1, ! 0, 96, 97, 0, 96, 141, 97, 0, 142, 0, ! 141, 142, 0, 143, 0, 159, 0, 161, 0, 182, ! 0, 144, 0, 149, 0, 134, 0, 169, 0, 192, ! 0, 114, 145, 100, 0, 133, 114, 145, 100, 0, ! 146, 0, 145, 101, 146, 0, 145, 101, 1, 0, ! 147, 0, 147, 93, 148, 0, 147, 93, 1, 0, ! 147, 93, 148, 1, 0, 124, 0, 147, 98, 99, ! 0, 124, 1, 0, 147, 98, 1, 0, 147, 99, ! 1, 0, 272, 0, 180, 0, 0, 151, 150, 158, ! 0, 151, 1, 0, 114, 152, 156, 0, 60, 152, ! 156, 0, 133, 114, 152, 156, 0, 133, 60, 152, ! 156, 0, 114, 1, 0, 133, 114, 1, 0, 60, ! 1, 0, 133, 60, 1, 0, 133, 1, 0, 124, ! 94, 95, 0, 124, 94, 153, 95, 0, 152, 98, ! 99, 0, 124, 94, 1, 0, 152, 98, 1, 0, ! 154, 0, 153, 101, 154, 0, 153, 101, 1, 0, ! 114, 147, 0, 155, 114, 147, 0, 114, 1, 0, ! 155, 114, 1, 0, 133, 0, 0, 54, 157, 0, ! 54, 1, 0, 118, 0, 157, 101, 118, 0, 157, ! 101, 1, 0, 182, 0, 100, 0, 160, 182, 0, ! 133, 0, 0, 163, 162, 165, 0, 164, 156, 0, ! 133, 164, 156, 0, 122, 94, 95, 0, 122, 94, ! 153, 95, 0, 183, 166, 0, 183, 167, 166, 0, ! 183, 185, 166, 0, 183, 167, 185, 166, 0, 184, ! 0, 168, 94, 95, 100, 0, 168, 94, 240, 95, ! 100, 0, 121, 102, 66, 94, 240, 95, 100, 0, ! 121, 102, 66, 94, 95, 100, 0, 77, 0, 66, ! 0, 0, 62, 124, 170, 175, 0, 0, 133, 62, ! 124, 171, 175, 0, 0, 62, 124, 174, 172, 175, ! 0, 0, 133, 62, 124, 174, 173, 175, 0, 62, ! 124, 1, 0, 133, 62, 124, 1, 0, 64, 119, ! 0, 174, 101, 119, 0, 64, 1, 0, 174, 101, ! 1, 0, 96, 97, 0, 96, 176, 97, 0, 177, ! 0, 176, 177, 0, 178, 0, 179, 0, 134, 0, ! 169, 0, 144, 0, 151, 100, 0, 151, 1, 0, ! 96, 97, 0, 96, 101, 97, 0, 96, 181, 97, ! 0, 96, 181, 101, 97, 0, 148, 0, 181, 101, ! 148, 0, 181, 101, 1, 0, 96, 97, 0, 183, ! 185, 184, 0, 96, 0, 97, 0, 186, 0, 185, ! 186, 0, 187, 0, 189, 0, 134, 0, 188, 100, ! 0, 114, 145, 0, 155, 114, 145, 0, 191, 0, ! 194, 0, 198, 0, 199, 0, 210, 0, 214, 0, ! 191, 0, 195, 0, 200, 0, 211, 0, 215, 0, ! 182, 0, 192, 0, 196, 0, 201, 0, 213, 0, ! 221, 0, 222, 0, 223, 0, 225, 0, 224, 0, ! 227, 0, 100, 0, 124, 89, 0, 193, 189, 0, ! 124, 1, 0, 193, 190, 0, 197, 100, 0, 1, ! 100, 0, 1, 96, 0, 1, 97, 0, 168, 94, ! 1, 0, 168, 94, 95, 1, 0, 168, 94, 240, ! 1, 0, 168, 94, 240, 95, 1, 0, 121, 102, ! 66, 1, 0, 121, 102, 66, 94, 1, 0, 121, ! 102, 66, 94, 240, 1, 0, 121, 102, 66, 94, ! 240, 95, 1, 0, 121, 102, 66, 94, 95, 1, ! 0, 269, 0, 253, 0, 254, 0, 249, 0, 250, ! 0, 246, 0, 235, 0, 49, 94, 272, 95, 189, ! 0, 49, 1, 0, 49, 94, 1, 0, 49, 94, ! 272, 1, 0, 49, 94, 272, 95, 190, 57, 189, ! 0, 49, 94, 272, 95, 190, 57, 190, 0, 0, ! 203, 202, 204, 0, 69, 94, 272, 95, 0, 69, ! 1, 0, 69, 94, 1, 0, 69, 94, 272, 95, ! 1, 0, 96, 97, 0, 96, 207, 97, 0, 96, ! 205, 97, 0, 96, 205, 207, 97, 0, 206, 0, ! 205, 206, 0, 207, 185, 0, 208, 0, 207, 208, ! 0, 63, 273, 89, 0, 48, 89, 0, 63, 1, ! 0, 63, 273, 1, 0, 48, 1, 0, 67, 94, ! 272, 95, 0, 209, 189, 0, 67, 1, 0, 67, ! 94, 1, 0, 67, 94, 272, 1, 0, 209, 190, ! 0, 52, 0, 212, 189, 67, 94, 272, 95, 100, ! 0, 217, 100, 272, 100, 219, 95, 189, 0, 217, ! 100, 100, 219, 95, 189, 0, 217, 100, 1, 0, ! 217, 100, 272, 100, 1, 0, 217, 100, 100, 1, ! 0, 217, 100, 272, 100, 219, 95, 190, 0, 217, ! 100, 100, 219, 95, 190, 0, 72, 94, 0, 72, ! 1, 0, 72, 94, 1, 0, 216, 218, 0, 0, ! 220, 0, 188, 0, 220, 1, 0, 0, 220, 0, ! 197, 0, 220, 101, 197, 0, 220, 101, 1, 0, ! 55, 100, 0, 55, 124, 100, 0, 55, 1, 0, ! 55, 124, 1, 0, 74, 100, 0, 74, 124, 100, ! 0, 74, 1, 0, 74, 124, 1, 0, 59, 100, ! 0, 59, 272, 100, 0, 59, 1, 0, 59, 272, ! 1, 0, 50, 272, 100, 0, 50, 1, 0, 50, ! 272, 1, 0, 226, 94, 272, 95, 182, 0, 226, ! 94, 272, 95, 1, 0, 226, 1, 0, 226, 94, ! 1, 95, 0, 226, 94, 1, 0, 133, 0, 71, ! 182, 228, 0, 71, 182, 231, 0, 71, 182, 228, ! 231, 0, 71, 1, 0, 229, 0, 228, 229, 0, ! 230, 182, 0, 61, 94, 154, 95, 0, 61, 1, ! 0, 61, 94, 1, 0, 61, 94, 1, 95, 0, ! 65, 182, 0, 65, 1, 0, 233, 0, 241, 0, ! 113, 0, 77, 0, 94, 272, 95, 0, 235, 0, ! 245, 0, 246, 0, 247, 0, 234, 0, 121, 102, ! 77, 0, 94, 272, 1, 0, 121, 102, 1, 0, ! 115, 102, 1, 0, 60, 102, 1, 0, 121, 102, ! 68, 0, 120, 102, 68, 0, 115, 102, 68, 0, ! 60, 102, 68, 0, 73, 118, 94, 240, 95, 0, ! 73, 118, 94, 95, 0, 236, 0, 239, 124, 94, ! 95, 0, 239, 124, 94, 95, 140, 0, 239, 124, ! 94, 240, 95, 0, 239, 124, 94, 240, 95, 140, ! 0, 73, 1, 100, 0, 73, 118, 1, 0, 73, ! 118, 94, 1, 0, 73, 118, 94, 240, 1, 0, ! 239, 1, 0, 239, 124, 1, 0, 0, 73, 118, ! 94, 240, 95, 237, 140, 0, 0, 73, 118, 94, ! 95, 238, 140, 0, 121, 102, 73, 0, 232, 102, ! 73, 0, 272, 0, 240, 101, 272, 0, 240, 101, ! 1, 0, 73, 115, 242, 0, 73, 117, 242, 0, ! 73, 115, 242, 244, 0, 73, 117, 242, 244, 0, ! 73, 117, 244, 180, 0, 73, 115, 244, 180, 0, ! 73, 1, 99, 0, 73, 1, 98, 0, 243, 0, ! 242, 243, 0, 98, 272, 99, 0, 98, 272, 1, ! 0, 98, 1, 0, 98, 99, 0, 244, 98, 99, ! 0, 244, 98, 1, 0, 232, 102, 124, 0, 66, ! 102, 124, 0, 66, 1, 0, 121, 94, 95, 0, ! 121, 94, 240, 95, 0, 232, 102, 124, 94, 95, ! 0, 232, 102, 124, 94, 240, 95, 0, 66, 102, ! 124, 94, 95, 0, 66, 102, 124, 94, 240, 95, ! 0, 66, 102, 1, 95, 0, 66, 102, 1, 102, ! 0, 121, 98, 272, 99, 0, 233, 98, 272, 99, ! 0, 121, 98, 1, 0, 121, 98, 272, 1, 0, ! 233, 98, 1, 0, 233, 98, 272, 1, 0, 232, ! 0, 121, 0, 249, 0, 250, 0, 248, 47, 0, ! 248, 46, 0, 253, 0, 254, 0, 3, 252, 0, ! 255, 0, 3, 1, 0, 251, 0, 4, 251, 0, ! 4, 1, 0, 47, 252, 0, 47, 1, 0, 46, ! 252, 0, 46, 1, 0, 248, 0, 90, 252, 0, ! 91, 252, 0, 256, 0, 90, 1, 0, 91, 1, ! 0, 94, 115, 244, 95, 252, 0, 94, 115, 95, ! 252, 0, 94, 272, 95, 255, 0, 94, 121, 244, ! 95, 255, 0, 94, 115, 98, 1, 0, 94, 1, ! 0, 94, 115, 244, 95, 1, 0, 94, 115, 95, ! 1, 0, 94, 121, 244, 95, 1, 0, 252, 0, ! 257, 5, 252, 0, 257, 6, 252, 0, 257, 7, ! 252, 0, 257, 5, 1, 0, 257, 6, 1, 0, ! 257, 7, 1, 0, 257, 0, 258, 3, 257, 0, ! 258, 4, 257, 0, 258, 3, 1, 0, 258, 4, ! 1, 0, 258, 0, 259, 8, 258, 0, 259, 9, ! 258, 0, 259, 10, 258, 0, 259, 8, 1, 0, ! 259, 9, 1, 0, 259, 10, 1, 0, 259, 0, ! 260, 20, 259, 0, 260, 18, 259, 0, 260, 21, ! 259, 0, 260, 19, 259, 0, 260, 58, 116, 0, ! 260, 20, 1, 0, 260, 18, 1, 0, 260, 21, ! 1, 0, 260, 19, 1, 0, 260, 58, 1, 0, ! 260, 0, 261, 16, 260, 0, 261, 17, 260, 0, ! 261, 16, 1, 0, 261, 17, 1, 0, 261, 0, ! 262, 11, 261, 0, 262, 11, 1, 0, 262, 0, ! 263, 12, 262, 0, 263, 12, 1, 0, 263, 0, ! 264, 13, 263, 0, 264, 13, 1, 0, 264, 0, ! 265, 14, 264, 0, 265, 14, 1, 0, 265, 0, ! 266, 15, 265, 0, 266, 15, 1, 0, 266, 0, ! 266, 88, 272, 89, 267, 0, 266, 88, 89, 1, ! 0, 266, 88, 1, 0, 266, 88, 272, 89, 1, ! 0, 267, 0, 269, 0, 270, 271, 268, 0, 270, ! 271, 1, 0, 121, 0, 245, 0, 247, 0, 92, ! 0, 93, 0, 268, 0, 272, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 605, 605, 635, 637, 638, 639, 640, 641, 645, ! 647, 650, 652, 653, 656, 658, 661, 665, 669, 673, ! 682, 693, 695, 698, 702, 707, 712, 714, 715, 716, ! 717, 718, 719, 720, 723, 728, 734, 736, 739, 745, ! 747, 751, 753, 756, 783, 785, 789, 808, 810, 814, ! 817, 819, 820, 830, 835, 850, 850, 855, 855, 859, ! 861, 863, 868, 872, 874, 876, 878, 882, 884, 886, ! 893, 899, 904, 908, 917, 927, 929, 932, 934, 935, ! 936, 946, 948, 949, 951, 953, 957, 960, 970, 973, ! 975, 979, 982, 989, 995, 1003, 1005, 1007, 1009, 1019, ! 1023, 1025, 1029, 1029, 1041, 1045, 1048, 1050, 1052, 1054, ! 1059, 1061, 1063, 1065, 1072, 1078, 1080, 1089, 1091, 1095, ! 1100, 1105, 1109, 1114, 1119, 1124, 1131, 1141, 1143, 1145, ! 1149, 1152, 1154, 1158, 1160, 1164, 1173, 1189, 1189, 1199, ! 1202, 1206, 1212, 1216, 1225, 1227, 1229, 1233, 1238, 1245, ! 1253, 1255, 1259, 1266, 1276, 1276, 1281, 1281, 1285, 1285, ! 1289, 1289, 1293, 1295, 1299, 1305, 1310, 1312, 1316, 1319, ! 1323, 1325, 1328, 1330, 1331, 1333, 1337, 1341, 1347, 1352, ! 1355, 1357, 1359, 1363, 1369, 1373, 1378, 1387, 1391, 1396, ! 1410, 1412, 1415, 1417, 1419, 1426, 1430, 1433, 1437, 1439, ! 1440, 1441, 1442, 1443, 1447, 1449, 1450, 1451, 1452, 1456, ! 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, ! 1470, 1488, 1499, 1502, 1506, 1513, 1523, 1528, 1533, 1538, ! 1540, 1545, 1547, 1552, 1554, 1556, 1558, 1560, 1564, 1566, ! 1567, 1568, 1569, 1570, 1571, 1574, 1580, 1582, 1584, 1588, ! 1593, 1598, 1598, 1614, 1620, 1622, 1624, 1631, 1634, 1636, ! 1638, 1642, 1644, 1647, 1651, 1653, 1656, 1663, 1669, 1671, ! 1673, 1677, 1685, 1688, 1690, 1692, 1696, 1701, 1710, 1715, ! 1722, 1729, 1731, 1733, 1737, 1740, 1749, 1756, 1758, 1762, ! 1775, 1777, 1783, 1789, 1793, 1795, 1799, 1802, 1804, 1808, ! 1811, 1813, 1815, 1819, 1822, 1824, 1826, 1830, 1833, 1835, ! 1837, 1841, 1847, 1849, 1853, 1860, 1862, 1864, 1866, 1870, ! 1882, 1885, 1887, 1892, 1896, 1898, 1905, 1914, 1931, 1933, ! 1938, 1942, 1945, 1950, 1952, 1955, 1957, 1959, 1961, 1962, ! 1963, 1964, 1965, 1969, 1974, 1976, 1978, 1980, 1984, 1987, ! 1989, 1991, 1998, 2001, 2003, 2007, 2013, 2014, 2020, 2021, ! 2023, 2025, 2027, 2029, 2031, 2040, 2040, 2074, 2074, 2091, ! 2094, 2098, 2104, 2109, 2113, 2116, 2118, 2120, 2124, 2135, ! 2144, 2146, 2150, 2153, 2157, 2168, 2170, 2178, 2205, 2207, ! 2211, 2216, 2222, 2226, 2229, 2231, 2242, 2253, 2258, 2267, ! 2269, 2273, 2276, 2278, 2283, 2288, 2293, 2300, 2302, 2303, ! 2304, 2307, 2312, 2317, 2319, 2320, 2322, 2323, 2327, 2333, ! 2335, 2339, 2342, 2346, 2349, 2353, 2355, 2357, 2359, 2360, ! 2362, 2366, 2375, 2377, 2379, 2393, 2395, 2400, 2402, 2404, ! 2408, 2410, 2415, 2420, 2425, 2427, 2429, 2433, 2435, 2440, ! 2445, 2447, 2451, 2453, 2458, 2463, 2468, 2470, 2472, 2476, ! 2478, 2483, 2488, 2493, 2498, 2500, 2502, 2504, 2506, 2508, ! 2512, 2514, 2519, 2524, 2526, 2530, 2532, 2537, 2541, 2543, ! 2548, 2552, 2554, 2559, 2563, 2565, 2570, 2574, 2576, 2581, ! 2585, 2587, 2592, 2598, 2600, 2604, 2606, 2609, 2612, 2619, ! 2621, 2622, 2625, 2627, 2630, 2634 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "PLUS_TK", "MINUS_TK", "MULT_TK", "DIV_TK", "REM_TK", "LS_TK", "SRS_TK", "ZRS_TK", "AND_TK", "XOR_TK", "OR_TK", "BOOL_AND_TK", "BOOL_OR_TK", "EQ_TK", "NEQ_TK", "GT_TK", "GTE_TK", "LT_TK", "LTE_TK", "PLUS_ASSIGN_TK", "MINUS_ASSIGN_TK", --- 869,1187 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, ! 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, ! 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, ! 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, ! 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, ! 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, ! 105, 106, 107, 108, 109, 110 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned short yyprhs[] = { ! 0, 0, 3, 4, 7, 9, 11, 13, 15, 17, ! 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, ! 39, 42, 45, 47, 49, 51, 55, 57, 58, 60, ! 62, 64, 67, 70, 73, 77, 79, 82, 84, 87, ! 91, 94, 98, 100, 102, 106, 109, 113, 119, 124, ! 130, 132, 134, 136, 138, 140, 143, 144, 152, 153, ! 160, 164, 167, 171, 176, 177, 180, 184, 187, 188, ! 191, 194, 196, 200, 204, 207, 211, 213, 216, 218, ! 220, 222, 224, 226, 228, 230, 232, 234, 238, 243, ! 245, 249, 253, 255, 259, 263, 268, 270, 274, 277, ! 281, 285, 287, 289, 290, 294, 297, 301, 305, 310, ! 315, 318, 322, 325, 329, 332, 336, 341, 345, 349, ! 353, 355, 359, 363, 366, 370, 373, 377, 379, 380, ! 383, 386, 388, 392, 396, 398, 400, 403, 405, 406, ! 410, 413, 417, 421, 426, 429, 433, 437, 442, 444, ! 449, 455, 463, 470, 472, 474, 475, 480, 481, 487, ! 488, 494, 495, 502, 506, 511, 514, 518, 521, 525, ! 528, 532, 534, 537, 539, 541, 543, 545, 547, 550, ! 553, 556, 560, 564, 569, 571, 575, 579, 582, 586, ! 588, 590, 592, 595, 597, 599, 601, 604, 607, 611, ! 613, 615, 617, 619, 621, 623, 625, 627, 629, 631, ! 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, ! 653, 655, 657, 660, 663, 666, 669, 672, 675, 678, ! 681, 685, 690, 695, 701, 706, 712, 719, 727, 734, ! 736, 738, 740, 742, 744, 746, 748, 754, 757, 761, ! 766, 774, 782, 783, 787, 792, 795, 799, 805, 808, ! 812, 816, 821, 823, 826, 829, 831, 834, 838, 841, ! 844, 848, 851, 856, 859, 862, 866, 871, 874, 876, ! 884, 892, 899, 903, 909, 914, 922, 929, 932, 935, ! 939, 942, 943, 945, 947, 950, 951, 953, 955, 959, ! 963, 966, 970, 973, 977, 980, 984, 987, 991, 994, ! 998, 1001, 1005, 1009, 1012, 1016, 1022, 1028, 1031, 1036, ! 1040, 1042, 1046, 1050, 1055, 1058, 1060, 1063, 1066, 1071, ! 1074, 1078, 1083, 1086, 1089, 1091, 1093, 1095, 1097, 1101, ! 1103, 1105, 1107, 1109, 1111, 1115, 1119, 1123, 1127, 1131, ! 1135, 1139, 1143, 1147, 1153, 1158, 1160, 1165, 1171, 1177, ! 1184, 1188, 1192, 1197, 1203, 1206, 1210, 1211, 1219, 1220, ! 1227, 1231, 1235, 1237, 1241, 1245, 1249, 1253, 1258, 1263, ! 1268, 1273, 1277, 1281, 1283, 1286, 1290, 1294, 1297, 1300, ! 1304, 1308, 1312, 1316, 1319, 1323, 1328, 1334, 1341, 1347, ! 1354, 1359, 1364, 1369, 1374, 1378, 1383, 1387, 1392, 1394, ! 1396, 1398, 1400, 1403, 1406, 1408, 1410, 1413, 1415, 1418, ! 1420, 1423, 1426, 1429, 1432, 1435, 1438, 1440, 1443, 1446, ! 1448, 1451, 1454, 1460, 1465, 1470, 1476, 1481, 1484, 1490, ! 1495, 1501, 1503, 1507, 1511, 1515, 1519, 1523, 1527, 1529, ! 1533, 1537, 1541, 1545, 1547, 1551, 1555, 1559, 1563, 1567, ! 1571, 1573, 1577, 1581, 1585, 1589, 1593, 1597, 1601, 1605, ! 1609, 1613, 1615, 1619, 1623, 1627, 1631, 1633, 1637, 1641, ! 1643, 1647, 1651, 1653, 1657, 1661, 1663, 1667, 1671, 1673, ! 1677, 1681, 1683, 1689, 1694, 1698, 1704, 1706, 1708, 1712, ! 1716, 1718, 1720, 1722, 1724, 1726, 1728 }; + + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const short yyrhs[] = { ! 112, 0, -1, -1, 113, 126, -1, 105, -1, 106, ! -1, 109, -1, 104, -1, 103, -1, 110, -1, 116, ! -1, 117, -1, 83, -1, 86, -1, 51, -1, 118, ! -1, 121, -1, 122, -1, 118, -1, 118, -1, 116, ! 245, -1, 122, 245, -1, 123, -1, 124, -1, 125, ! -1, 122, 102, 125, -1, 87, -1, -1, 129, -1, ! 127, -1, 128, -1, 129, 127, -1, 129, 128, -1, ! 127, 128, -1, 129, 127, 128, -1, 130, -1, 127, ! 130, -1, 133, -1, 128, 133, -1, 76, 122, 100, ! -1, 76, 1, -1, 76, 122, 1, -1, 131, -1, ! 132, -1, 56, 122, 100, -1, 56, 1, -1, 56, ! 122, 1, -1, 56, 122, 102, 5, 100, -1, 56, ! 122, 102, 1, -1, 56, 122, 102, 5, 1, -1, ! 135, -1, 170, -1, 193, -1, 1, -1, 45, -1, ! 134, 45, -1, -1, 134, 68, 125, 138, 139, 136, ! 141, -1, -1, 68, 125, 138, 139, 137, 141, -1, ! 134, 68, 1, -1, 68, 1, -1, 68, 125, 1, ! -1, 134, 68, 125, 1, -1, -1, 64, 119, -1, ! 64, 119, 1, -1, 64, 1, -1, -1, 53, 140, ! -1, 53, 1, -1, 120, -1, 140, 101, 120, -1, ! 140, 101, 1, -1, 96, 97, -1, 96, 142, 97, ! -1, 143, -1, 142, 143, -1, 144, -1, 160, -1, ! 162, -1, 183, -1, 145, -1, 150, -1, 135, -1, ! 170, -1, 193, -1, 115, 146, 100, -1, 134, 115, ! 146, 100, -1, 147, -1, 146, 101, 147, -1, 146, ! 101, 1, -1, 148, -1, 148, 93, 149, -1, 148, ! 93, 1, -1, 148, 93, 149, 1, -1, 125, -1, ! 148, 98, 99, -1, 125, 1, -1, 148, 98, 1, ! -1, 148, 99, 1, -1, 273, -1, 181, -1, -1, ! 152, 151, 159, -1, 152, 1, -1, 115, 153, 157, ! -1, 60, 153, 157, -1, 134, 115, 153, 157, -1, ! 134, 60, 153, 157, -1, 115, 1, -1, 134, 115, ! 1, -1, 60, 1, -1, 134, 60, 1, -1, 134, ! 1, -1, 125, 94, 95, -1, 125, 94, 154, 95, ! -1, 153, 98, 99, -1, 125, 94, 1, -1, 153, ! 98, 1, -1, 155, -1, 154, 101, 155, -1, 154, ! 101, 1, -1, 115, 148, -1, 156, 115, 148, -1, ! 115, 1, -1, 156, 115, 1, -1, 134, -1, -1, ! 54, 158, -1, 54, 1, -1, 119, -1, 158, 101, ! 119, -1, 158, 101, 1, -1, 183, -1, 100, -1, ! 161, 183, -1, 134, -1, -1, 164, 163, 166, -1, ! 165, 157, -1, 134, 165, 157, -1, 123, 94, 95, ! -1, 123, 94, 154, 95, -1, 184, 167, -1, 184, ! 168, 167, -1, 184, 186, 167, -1, 184, 168, 186, ! 167, -1, 185, -1, 169, 94, 95, 100, -1, 169, ! 94, 241, 95, 100, -1, 122, 102, 66, 94, 241, ! 95, 100, -1, 122, 102, 66, 94, 95, 100, -1, ! 77, -1, 66, -1, -1, 62, 125, 171, 176, -1, ! -1, 134, 62, 125, 172, 176, -1, -1, 62, 125, ! 175, 173, 176, -1, -1, 134, 62, 125, 175, 174, ! 176, -1, 62, 125, 1, -1, 134, 62, 125, 1, ! -1, 64, 120, -1, 175, 101, 120, -1, 64, 1, ! -1, 175, 101, 1, -1, 96, 97, -1, 96, 177, ! 97, -1, 178, -1, 177, 178, -1, 179, -1, 180, ! -1, 135, -1, 170, -1, 145, -1, 152, 100, -1, ! 152, 1, -1, 96, 97, -1, 96, 101, 97, -1, ! 96, 182, 97, -1, 96, 182, 101, 97, -1, 149, ! -1, 182, 101, 149, -1, 182, 101, 1, -1, 96, ! 97, -1, 184, 186, 185, -1, 96, -1, 97, -1, ! 187, -1, 186, 187, -1, 188, -1, 190, -1, 135, ! -1, 189, 100, -1, 115, 146, -1, 156, 115, 146, ! -1, 192, -1, 195, -1, 199, -1, 200, -1, 211, ! -1, 215, -1, 192, -1, 196, -1, 201, -1, 212, ! -1, 216, -1, 183, -1, 193, -1, 197, -1, 202, ! -1, 214, -1, 222, -1, 223, -1, 224, -1, 226, ! -1, 225, -1, 228, -1, 100, -1, 125, 89, -1, ! 194, 190, -1, 125, 1, -1, 194, 191, -1, 198, ! 100, -1, 1, 100, -1, 1, 96, -1, 1, 97, ! -1, 169, 94, 1, -1, 169, 94, 95, 1, -1, ! 169, 94, 241, 1, -1, 169, 94, 241, 95, 1, ! -1, 122, 102, 66, 1, -1, 122, 102, 66, 94, ! 1, -1, 122, 102, 66, 94, 241, 1, -1, 122, ! 102, 66, 94, 241, 95, 1, -1, 122, 102, 66, ! 94, 95, 1, -1, 270, -1, 254, -1, 255, -1, ! 250, -1, 251, -1, 247, -1, 236, -1, 49, 94, ! 273, 95, 190, -1, 49, 1, -1, 49, 94, 1, ! -1, 49, 94, 273, 1, -1, 49, 94, 273, 95, ! 191, 57, 190, -1, 49, 94, 273, 95, 191, 57, ! 191, -1, -1, 204, 203, 205, -1, 69, 94, 273, ! 95, -1, 69, 1, -1, 69, 94, 1, -1, 69, ! 94, 273, 95, 1, -1, 96, 97, -1, 96, 208, ! 97, -1, 96, 206, 97, -1, 96, 206, 208, 97, ! -1, 207, -1, 206, 207, -1, 208, 186, -1, 209, ! -1, 208, 209, -1, 63, 274, 89, -1, 48, 89, ! -1, 63, 1, -1, 63, 274, 1, -1, 48, 1, ! -1, 67, 94, 273, 95, -1, 210, 190, -1, 67, ! 1, -1, 67, 94, 1, -1, 67, 94, 273, 1, ! -1, 210, 191, -1, 52, -1, 213, 190, 67, 94, ! 273, 95, 100, -1, 218, 100, 273, 100, 220, 95, ! 190, -1, 218, 100, 100, 220, 95, 190, -1, 218, ! 100, 1, -1, 218, 100, 273, 100, 1, -1, 218, ! 100, 100, 1, -1, 218, 100, 273, 100, 220, 95, ! 191, -1, 218, 100, 100, 220, 95, 191, -1, 72, ! 94, -1, 72, 1, -1, 72, 94, 1, -1, 217, ! 219, -1, -1, 221, -1, 189, -1, 221, 1, -1, ! -1, 221, -1, 198, -1, 221, 101, 198, -1, 221, ! 101, 1, -1, 55, 100, -1, 55, 125, 100, -1, ! 55, 1, -1, 55, 125, 1, -1, 74, 100, -1, ! 74, 125, 100, -1, 74, 1, -1, 74, 125, 1, ! -1, 59, 100, -1, 59, 273, 100, -1, 59, 1, ! -1, 59, 273, 1, -1, 50, 273, 100, -1, 50, ! 1, -1, 50, 273, 1, -1, 227, 94, 273, 95, ! 183, -1, 227, 94, 273, 95, 1, -1, 227, 1, ! -1, 227, 94, 1, 95, -1, 227, 94, 1, -1, ! 134, -1, 71, 183, 229, -1, 71, 183, 232, -1, ! 71, 183, 229, 232, -1, 71, 1, -1, 230, -1, ! 229, 230, -1, 231, 183, -1, 61, 94, 155, 95, ! -1, 61, 1, -1, 61, 94, 1, -1, 61, 94, ! 1, 95, -1, 65, 183, -1, 65, 1, -1, 234, ! -1, 242, -1, 114, -1, 77, -1, 94, 273, 95, ! -1, 236, -1, 246, -1, 247, -1, 248, -1, 235, ! -1, 122, 102, 77, -1, 94, 273, 1, -1, 122, ! 102, 1, -1, 116, 102, 1, -1, 60, 102, 1, ! -1, 122, 102, 68, -1, 121, 102, 68, -1, 116, ! 102, 68, -1, 60, 102, 68, -1, 73, 119, 94, ! 241, 95, -1, 73, 119, 94, 95, -1, 237, -1, ! 240, 125, 94, 95, -1, 240, 125, 94, 95, 141, ! -1, 240, 125, 94, 241, 95, -1, 240, 125, 94, ! 241, 95, 141, -1, 73, 1, 100, -1, 73, 119, ! 1, -1, 73, 119, 94, 1, -1, 73, 119, 94, ! 241, 1, -1, 240, 1, -1, 240, 125, 1, -1, ! -1, 73, 119, 94, 241, 95, 238, 141, -1, -1, ! 73, 119, 94, 95, 239, 141, -1, 122, 102, 73, ! -1, 233, 102, 73, -1, 273, -1, 241, 101, 273, ! -1, 241, 101, 1, -1, 73, 116, 243, -1, 73, ! 118, 243, -1, 73, 116, 243, 245, -1, 73, 118, ! 243, 245, -1, 73, 118, 245, 181, -1, 73, 116, ! 245, 181, -1, 73, 1, 99, -1, 73, 1, 98, ! -1, 244, -1, 243, 244, -1, 98, 273, 99, -1, ! 98, 273, 1, -1, 98, 1, -1, 98, 99, -1, ! 245, 98, 99, -1, 245, 98, 1, -1, 233, 102, ! 125, -1, 66, 102, 125, -1, 66, 1, -1, 122, ! 94, 95, -1, 122, 94, 241, 95, -1, 233, 102, ! 125, 94, 95, -1, 233, 102, 125, 94, 241, 95, ! -1, 66, 102, 125, 94, 95, -1, 66, 102, 125, ! 94, 241, 95, -1, 66, 102, 1, 95, -1, 66, ! 102, 1, 102, -1, 122, 98, 273, 99, -1, 234, ! 98, 273, 99, -1, 122, 98, 1, -1, 122, 98, ! 273, 1, -1, 234, 98, 1, -1, 234, 98, 273, ! 1, -1, 233, -1, 122, -1, 250, -1, 251, -1, ! 249, 47, -1, 249, 46, -1, 254, -1, 255, -1, ! 3, 253, -1, 256, -1, 3, 1, -1, 252, -1, ! 4, 252, -1, 4, 1, -1, 47, 253, -1, 47, ! 1, -1, 46, 253, -1, 46, 1, -1, 249, -1, ! 90, 253, -1, 91, 253, -1, 257, -1, 90, 1, ! -1, 91, 1, -1, 94, 116, 245, 95, 253, -1, ! 94, 116, 95, 253, -1, 94, 273, 95, 256, -1, ! 94, 122, 245, 95, 256, -1, 94, 116, 98, 1, ! -1, 94, 1, -1, 94, 116, 245, 95, 1, -1, ! 94, 116, 95, 1, -1, 94, 122, 245, 95, 1, ! -1, 253, -1, 258, 5, 253, -1, 258, 6, 253, ! -1, 258, 7, 253, -1, 258, 5, 1, -1, 258, ! 6, 1, -1, 258, 7, 1, -1, 258, -1, 259, ! 3, 258, -1, 259, 4, 258, -1, 259, 3, 1, ! -1, 259, 4, 1, -1, 259, -1, 260, 8, 259, ! -1, 260, 9, 259, -1, 260, 10, 259, -1, 260, ! 8, 1, -1, 260, 9, 1, -1, 260, 10, 1, ! -1, 260, -1, 261, 20, 260, -1, 261, 18, 260, ! -1, 261, 21, 260, -1, 261, 19, 260, -1, 261, ! 58, 117, -1, 261, 20, 1, -1, 261, 18, 1, ! -1, 261, 21, 1, -1, 261, 19, 1, -1, 261, ! 58, 1, -1, 261, -1, 262, 16, 261, -1, 262, ! 17, 261, -1, 262, 16, 1, -1, 262, 17, 1, ! -1, 262, -1, 263, 11, 262, -1, 263, 11, 1, ! -1, 263, -1, 264, 12, 263, -1, 264, 12, 1, ! -1, 264, -1, 265, 13, 264, -1, 265, 13, 1, ! -1, 265, -1, 266, 14, 265, -1, 266, 14, 1, ! -1, 266, -1, 267, 15, 266, -1, 267, 15, 1, ! -1, 267, -1, 267, 88, 273, 89, 268, -1, 267, ! 88, 89, 1, -1, 267, 88, 1, -1, 267, 88, ! 273, 89, 1, -1, 268, -1, 270, -1, 271, 272, ! 269, -1, 271, 272, 1, -1, 122, -1, 246, -1, ! 248, -1, 92, -1, 93, -1, 269, -1, 273, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned short yyrline[] = { ! 0, 606, 606, 606, 636, 637, 638, 639, 640, 641, ! 646, 647, 651, 652, 653, 657, 658, 662, 666, 670, ! 674, 682, 694, 695, 699, 703, 708, 713, 714, 715, ! 716, 717, 718, 719, 720, 724, 728, 735, 736, 740, ! 745, 747, 752, 753, 757, 783, 785, 790, 808, 810, ! 815, 817, 819, 820, 831, 835, 852, 851, 856, 855, ! 859, 861, 863, 868, 873, 874, 876, 878, 883, 884, ! 886, 894, 899, 904, 909, 917, 928, 929, 933, 934, ! 935, 936, 947, 948, 949, 951, 953, 958, 960, 972, ! 973, 975, 980, 982, 989, 995, 1004, 1005, 1007, 1009, ! 1019, 1024, 1025, 1031, 1030, 1041, 1046, 1048, 1050, 1052, ! 1054, 1059, 1061, 1063, 1065, 1073, 1078, 1080, 1089, 1091, ! 1096, 1100, 1105, 1110, 1114, 1119, 1124, 1132, 1142, 1143, ! 1145, 1150, 1152, 1154, 1159, 1160, 1165, 1174, 1191, 1190, ! 1200, 1202, 1207, 1212, 1220, 1225, 1227, 1229, 1234, 1239, ! 1245, 1253, 1255, 1260, 1266, 1278, 1277, 1282, 1281, 1286, ! 1285, 1290, 1289, 1293, 1295, 1300, 1305, 1310, 1312, 1317, ! 1319, 1324, 1325, 1329, 1330, 1331, 1333, 1338, 1342, 1347, ! 1353, 1355, 1357, 1359, 1364, 1369, 1373, 1379, 1387, 1392, ! 1397, 1411, 1412, 1416, 1417, 1419, 1427, 1431, 1433, 1438, ! 1439, 1440, 1441, 1442, 1443, 1448, 1449, 1450, 1451, 1452, ! 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, ! 1467, 1471, 1489, 1500, 1502, 1507, 1514, 1523, 1528, 1533, ! 1538, 1540, 1545, 1547, 1552, 1554, 1556, 1558, 1560, 1565, ! 1566, 1567, 1568, 1569, 1570, 1571, 1575, 1580, 1582, 1584, ! 1589, 1594, 1600, 1599, 1615, 1620, 1622, 1624, 1632, 1634, ! 1636, 1638, 1643, 1644, 1648, 1652, 1653, 1657, 1663, 1669, ! 1671, 1673, 1678, 1686, 1688, 1690, 1692, 1697, 1702, 1711, ! 1716, 1722, 1729, 1731, 1733, 1738, 1740, 1750, 1756, 1758, ! 1763, 1776, 1777, 1783, 1789, 1794, 1795, 1800, 1802, 1804, ! 1809, 1811, 1813, 1815, 1820, 1822, 1824, 1826, 1831, 1833, ! 1835, 1837, 1842, 1847, 1849, 1854, 1860, 1862, 1864, 1866, ! 1871, 1883, 1885, 1887, 1892, 1897, 1898, 1906, 1915, 1931, ! 1933, 1938, 1943, 1945, 1951, 1952, 1956, 1957, 1959, 1961, ! 1962, 1963, 1964, 1965, 1969, 1974, 1976, 1978, 1980, 1985, ! 1987, 1989, 1991, 1999, 2001, 2003, 2007, 2013, 2014, 2020, ! 2021, 2023, 2025, 2027, 2029, 2031, 2042, 2041, 2075, 2074, ! 2092, 2094, 2099, 2104, 2109, 2114, 2116, 2118, 2120, 2124, ! 2135, 2144, 2146, 2151, 2153, 2158, 2168, 2170, 2179, 2205, ! 2207, 2212, 2216, 2222, 2227, 2229, 2231, 2242, 2253, 2258, ! 2267, 2269, 2274, 2276, 2278, 2283, 2288, 2293, 2301, 2302, ! 2303, 2304, 2308, 2313, 2318, 2319, 2320, 2322, 2323, 2328, ! 2333, 2335, 2340, 2342, 2347, 2349, 2354, 2355, 2357, 2359, ! 2360, 2362, 2367, 2375, 2377, 2379, 2393, 2395, 2400, 2402, ! 2404, 2409, 2410, 2415, 2420, 2425, 2427, 2429, 2434, 2435, ! 2440, 2445, 2447, 2452, 2453, 2458, 2463, 2468, 2470, 2472, ! 2477, 2478, 2483, 2488, 2493, 2498, 2500, 2502, 2504, 2506, ! 2508, 2513, 2514, 2519, 2524, 2526, 2531, 2532, 2537, 2542, ! 2543, 2548, 2553, 2554, 2559, 2564, 2565, 2570, 2575, 2576, ! 2581, 2586, 2587, 2592, 2598, 2600, 2605, 2606, 2610, 2612, ! 2620, 2621, 2622, 2626, 2627, 2631, 2635 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "PLUS_TK", "MINUS_TK", "MULT_TK", "DIV_TK", "REM_TK", "LS_TK", "SRS_TK", "ZRS_TK", "AND_TK", "XOR_TK", "OR_TK", "BOOL_AND_TK", "BOOL_OR_TK", "EQ_TK", "NEQ_TK", "GT_TK", "GTE_TK", "LT_TK", "LTE_TK", "PLUS_ASSIGN_TK", "MINUS_ASSIGN_TK", *************** static const char *const yytname[] = *** 906,930 **** "NEG_TK", "ASSIGN_ANY_TK", "ASSIGN_TK", "OP_TK", "CP_TK", "OCB_TK", "CCB_TK", "OSB_TK", "CSB_TK", "SC_TK", "C_TK", "DOT_TK", "STRING_LIT_TK", "CHAR_LIT_TK", "INT_LIT_TK", "FP_LIT_TK", "TRUE_TK", ! "FALSE_TK", "BOOL_LIT_TK", "NULL_TK", "goal", "@1", "literal", "type", ! "primitive_type", "reference_type", "class_or_interface_type", ! "class_type", "interface_type", "array_type", "name", "simple_name", ! "qualified_name", "identifier", "compilation_unit", ! "import_declarations", "type_declarations", "package_declaration", ! "import_declaration", "single_type_import_declaration", ! "type_import_on_demand_declaration", "type_declaration", "modifiers", ! "class_declaration", "@2", "@3", "super", "interfaces", ! "interface_type_list", "class_body", "class_body_declarations", ! "class_body_declaration", "class_member_declaration", ! "field_declaration", "variable_declarators", "variable_declarator", ! "variable_declarator_id", "variable_initializer", "method_declaration", ! "@4", "method_header", "method_declarator", "formal_parameter_list", ! "formal_parameter", "final", "throws", "class_type_list", "method_body", ! "static_initializer", "static", "constructor_declaration", "@5", ! "constructor_header", "constructor_declarator", "constructor_body", ! "constructor_block_end", "explicit_constructor_invocation", ! "this_or_super", "interface_declaration", "@6", "@7", "@8", "@9", ! "extends_interfaces", "interface_body", "interface_member_declarations", "interface_member_declaration", "constant_declaration", "abstract_method_declaration", "array_initializer", "variable_initializers", "block", "block_begin", "block_end", --- 1201,1226 ---- "NEG_TK", "ASSIGN_ANY_TK", "ASSIGN_TK", "OP_TK", "CP_TK", "OCB_TK", "CCB_TK", "OSB_TK", "CSB_TK", "SC_TK", "C_TK", "DOT_TK", "STRING_LIT_TK", "CHAR_LIT_TK", "INT_LIT_TK", "FP_LIT_TK", "TRUE_TK", ! "FALSE_TK", "BOOL_LIT_TK", "NULL_TK", "$accept", "goal", "@1", ! "literal", "type", "primitive_type", "reference_type", ! "class_or_interface_type", "class_type", "interface_type", "array_type", ! "name", "simple_name", "qualified_name", "identifier", ! "compilation_unit", "import_declarations", "type_declarations", ! "package_declaration", "import_declaration", ! "single_type_import_declaration", "type_import_on_demand_declaration", ! "type_declaration", "modifiers", "class_declaration", "@2", "@3", ! "super", "interfaces", "interface_type_list", "class_body", ! "class_body_declarations", "class_body_declaration", ! "class_member_declaration", "field_declaration", "variable_declarators", ! "variable_declarator", "variable_declarator_id", "variable_initializer", ! "method_declaration", "@4", "method_header", "method_declarator", ! "formal_parameter_list", "formal_parameter", "final", "throws", ! "class_type_list", "method_body", "static_initializer", "static", ! "constructor_declaration", "@5", "constructor_header", ! "constructor_declarator", "constructor_body", "constructor_block_end", ! "explicit_constructor_invocation", "this_or_super", ! "interface_declaration", "@6", "@7", "@8", "@9", "extends_interfaces", ! "interface_body", "interface_member_declarations", "interface_member_declaration", "constant_declaration", "abstract_method_declaration", "array_initializer", "variable_initializers", "block", "block_begin", "block_end", *************** static const char *const yytname[] = *** 963,2027 **** }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 112, 111, 113, 113, 113, 113, 113, 113, 114, ! 114, 115, 115, 115, 116, 116, 117, 118, 119, 120, ! 120, 121, 121, 122, 123, 124, 125, 125, 125, 125, ! 125, 125, 125, 125, 126, 126, 127, 127, 128, 128, ! 128, 129, 129, 130, 130, 130, 131, 131, 131, 132, ! 132, 132, 132, 133, 133, 135, 134, 136, 134, 134, ! 134, 134, 134, 137, 137, 137, 137, 138, 138, 138, ! 139, 139, 139, 140, 140, 141, 141, 142, 142, 142, ! 142, 143, 143, 143, 143, 143, 144, 144, 145, 145, ! 145, 146, 146, 146, 146, 147, 147, 147, 147, 147, ! 148, 148, 150, 149, 149, 151, 151, 151, 151, 151, ! 151, 151, 151, 151, 152, 152, 152, 152, 152, 153, ! 153, 153, 154, 154, 154, 154, 155, 156, 156, 156, ! 157, 157, 157, 158, 158, 159, 160, 162, 161, 163, ! 163, 164, 164, 165, 165, 165, 165, 166, 167, 167, ! 167, 167, 168, 168, 170, 169, 171, 169, 172, 169, ! 173, 169, 169, 169, 174, 174, 174, 174, 175, 175, ! 176, 176, 177, 177, 177, 177, 178, 179, 179, 180, ! 180, 180, 180, 181, 181, 181, 182, 182, 183, 184, ! 185, 185, 186, 186, 186, 187, 188, 188, 189, 189, ! 189, 189, 189, 189, 190, 190, 190, 190, 190, 191, ! 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, ! 192, 193, 194, 194, 195, 196, 196, 196, 196, 196, ! 196, 196, 196, 196, 196, 196, 196, 196, 197, 197, ! 197, 197, 197, 197, 197, 198, 198, 198, 198, 199, ! 200, 202, 201, 203, 203, 203, 203, 204, 204, 204, ! 204, 205, 205, 206, 207, 207, 208, 208, 208, 208, ! 208, 209, 210, 210, 210, 210, 211, 212, 213, 214, ! 214, 214, 214, 214, 215, 215, 216, 216, 216, 217, ! 218, 218, 218, 218, 219, 219, 220, 220, 220, 221, ! 221, 221, 221, 222, 222, 222, 222, 223, 223, 223, ! 223, 224, 224, 224, 225, 225, 225, 225, 225, 226, ! 227, 227, 227, 227, 228, 228, 229, 230, 230, 230, ! 230, 231, 231, 232, 232, 233, 233, 233, 233, 233, ! 233, 233, 233, 233, 233, 233, 233, 233, 234, 234, ! 234, 234, 235, 235, 235, 235, 235, 235, 235, 235, ! 235, 235, 235, 235, 235, 237, 236, 238, 236, 239, ! 239, 240, 240, 240, 241, 241, 241, 241, 241, 241, ! 241, 241, 242, 242, 243, 243, 243, 244, 244, 244, ! 245, 245, 245, 246, 246, 246, 246, 246, 246, 246, ! 246, 247, 247, 247, 247, 247, 247, 248, 248, 248, ! 248, 249, 250, 251, 251, 251, 251, 251, 252, 252, ! 252, 253, 253, 254, 254, 255, 255, 255, 255, 255, ! 255, 256, 256, 256, 256, 256, 256, 256, 256, 256, ! 257, 257, 257, 257, 257, 257, 257, 258, 258, 258, ! 258, 258, 259, 259, 259, 259, 259, 259, 259, 260, ! 260, 260, 260, 260, 260, 260, 260, 260, 260, 260, ! 261, 261, 261, 261, 261, 262, 262, 262, 263, 263, ! 263, 264, 264, 264, 265, 265, 265, 266, 266, 266, ! 267, 267, 267, 267, 267, 268, 268, 269, 269, 270, ! 270, 270, 271, 271, 272, 273 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, ! 2, 1, 1, 1, 3, 1, 0, 1, 1, 1, ! 2, 2, 2, 3, 1, 2, 1, 2, 3, 2, ! 3, 1, 1, 3, 2, 3, 5, 4, 5, 1, ! 1, 1, 1, 1, 2, 0, 7, 0, 6, 3, ! 2, 3, 4, 0, 2, 3, 2, 0, 2, 2, ! 1, 3, 3, 2, 3, 1, 2, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 3, 4, 1, 3, ! 3, 1, 3, 3, 4, 1, 3, 2, 3, 3, ! 1, 1, 0, 3, 2, 3, 3, 4, 4, 2, ! 3, 2, 3, 2, 3, 4, 3, 3, 3, 1, ! 3, 3, 2, 3, 2, 3, 1, 0, 2, 2, ! 1, 3, 3, 1, 1, 2, 1, 0, 3, 2, ! 3, 3, 4, 2, 3, 3, 4, 1, 4, 5, ! 7, 6, 1, 1, 0, 4, 0, 5, 0, 5, ! 0, 6, 3, 4, 2, 3, 2, 3, 2, 3, ! 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, ! 3, 3, 4, 1, 3, 3, 2, 3, 1, 1, ! 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, ! 4, 4, 5, 4, 5, 6, 7, 6, 1, 1, ! 1, 1, 1, 1, 1, 5, 2, 3, 4, 7, ! 7, 0, 3, 4, 2, 3, 5, 2, 3, 3, ! 4, 1, 2, 2, 1, 2, 3, 2, 2, 3, ! 2, 4, 2, 2, 3, 4, 2, 1, 7, 7, ! 6, 3, 5, 4, 7, 6, 2, 2, 3, 2, ! 0, 1, 1, 2, 0, 1, 1, 3, 3, 2, ! 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, ! 3, 3, 2, 3, 5, 5, 2, 4, 3, 1, ! 3, 3, 4, 2, 1, 2, 2, 4, 2, 3, ! 4, 2, 2, 1, 1, 1, 1, 3, 1, 1, ! 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 5, 4, 1, 4, 5, 5, 6, 3, ! 3, 4, 5, 2, 3, 0, 7, 0, 6, 3, ! 3, 1, 3, 3, 3, 3, 4, 4, 4, 4, ! 3, 3, 1, 2, 3, 3, 2, 2, 3, 3, ! 3, 3, 2, 3, 4, 5, 6, 5, 6, 4, ! 4, 4, 4, 3, 4, 3, 4, 1, 1, 1, ! 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, ! 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, ! 2, 5, 4, 4, 5, 4, 2, 5, 4, 5, ! 1, 3, 3, 3, 3, 3, 3, 1, 3, 3, ! 3, 3, 1, 3, 3, 3, 3, 3, 3, 1, ! 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 1, 3, 3, 3, 3, 1, 3, 3, 1, 3, ! 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, ! 1, 5, 4, 3, 5, 1, 1, 3, 3, 1, ! 1, 1, 1, 1, 1, 1 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 1, 0, 52, 53, 0, 0, 0, 0, 220, 2, ! 0, 0, 0, 34, 41, 42, 36, 0, 49, 50, ! 51, 44, 25, 0, 21, 22, 23, 0, 60, 0, ! 39, 0, 0, 35, 37, 0, 0, 54, 0, 0, ! 45, 43, 0, 162, 0, 0, 158, 61, 0, 67, ! 40, 38, 0, 0, 0, 59, 0, 47, 0, 24, ! 166, 18, 164, 16, 0, 155, 0, 0, 66, 17, ! 0, 0, 57, 163, 0, 160, 62, 67, 48, 46, ! 13, 0, 11, 12, 168, 0, 9, 10, 14, 15, ! 16, 0, 174, 176, 0, 175, 0, 170, 172, 173, ! 167, 165, 159, 65, 69, 70, 68, 0, 157, 0, ! 55, 111, 0, 127, 109, 0, 0, 88, 91, 127, ! 0, 19, 20, 113, 0, 0, 178, 177, 169, 171, ! 0, 0, 58, 161, 0, 0, 0, 0, 106, 97, ! 86, 0, 0, 0, 0, 105, 387, 0, 112, 127, ! 110, 0, 127, 72, 71, 188, 73, 21, 0, 83, ! 0, 75, 77, 81, 82, 0, 78, 0, 79, 137, ! 127, 84, 80, 0, 85, 56, 117, 114, 0, 126, ! 0, 119, 0, 129, 130, 128, 118, 116, 90, 0, ! 89, 93, 0, 0, 0, 0, 0, 0, 0, 336, ! 0, 0, 0, 0, 7, 6, 3, 4, 5, 8, ! 335, 0, 0, 408, 0, 101, 407, 333, 342, 338, ! 354, 0, 334, 339, 340, 341, 425, 409, 410, 418, ! 440, 413, 414, 416, 428, 447, 452, 459, 470, 475, ! 478, 481, 484, 487, 490, 495, 504, 496, 0, 100, ! 98, 96, 99, 389, 388, 108, 87, 107, 186, 0, ! 127, 74, 76, 104, 0, 135, 0, 139, 0, 0, ! 0, 277, 0, 0, 0, 0, 0, 0, 0, 0, ! 336, 0, 0, 9, 15, 408, 0, 126, 194, 0, ! 0, 209, 0, 190, 192, 0, 193, 198, 210, 0, ! 199, 211, 0, 200, 201, 212, 251, 0, 202, 0, ! 213, 203, 290, 0, 214, 215, 216, 218, 217, 0, ! 219, 244, 243, 0, 241, 242, 239, 240, 238, 124, ! 122, 115, 0, 0, 0, 417, 408, 339, 341, 415, ! 420, 419, 424, 423, 422, 421, 0, 392, 0, 0, ! 0, 17, 0, 429, 426, 430, 427, 436, 0, 408, ! 0, 179, 0, 183, 0, 0, 0, 0, 0, 0, ! 94, 0, 0, 363, 0, 412, 411, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 502, 503, ! 0, 141, 0, 140, 134, 103, 133, 188, 138, 0, ! 227, 228, 226, 246, 0, 312, 0, 301, 299, 0, ! 309, 307, 0, 273, 0, 254, 0, 323, 0, 287, ! 0, 305, 303, 0, 0, 196, 0, 223, 221, 0, ! 0, 189, 187, 191, 195, 408, 319, 222, 225, 0, ! 272, 0, 408, 292, 296, 289, 0, 0, 316, 0, ! 121, 120, 125, 123, 132, 131, 347, 351, 0, 391, ! 381, 380, 359, 0, 374, 382, 0, 375, 0, 360, ! 0, 0, 0, 19, 20, 344, 337, 180, 181, 0, ! 346, 350, 349, 393, 0, 371, 403, 0, 345, 348, ! 369, 343, 370, 390, 405, 0, 364, 0, 444, 441, ! 445, 442, 446, 443, 450, 448, 451, 449, 456, 453, ! 457, 454, 458, 455, 466, 461, 468, 463, 465, 460, ! 467, 462, 469, 0, 464, 473, 471, 474, 472, 477, ! 476, 480, 479, 483, 482, 486, 485, 489, 488, 493, ! 0, 0, 498, 497, 142, 408, 143, 0, 0, 147, ! 0, 247, 0, 313, 311, 302, 300, 310, 308, 274, ! 0, 255, 0, 0, 0, 320, 324, 0, 321, 288, ! 306, 304, 337, 0, 197, 229, 0, 0, 0, 252, ! 0, 293, 0, 281, 0, 0, 318, 0, 399, 400, ! 0, 386, 0, 383, 376, 379, 377, 378, 361, 353, ! 0, 438, 432, 435, 0, 0, 433, 185, 182, 184, ! 394, 0, 404, 401, 0, 406, 402, 355, 0, 492, ! 0, 0, 144, 0, 0, 145, 248, 0, 275, 271, ! 0, 328, 0, 332, 331, 325, 322, 326, 233, 0, ! 230, 231, 0, 0, 0, 257, 0, 261, 0, 264, ! 0, 298, 297, 283, 0, 295, 0, 317, 0, 397, ! 0, 385, 384, 0, 362, 352, 437, 431, 439, 434, ! 373, 372, 395, 0, 356, 357, 494, 491, 0, 146, ! 0, 0, 0, 245, 0, 198, 0, 205, 206, 0, ! 207, 208, 0, 256, 329, 0, 234, 0, 0, 232, ! 270, 267, 268, 505, 0, 259, 262, 0, 258, 0, ! 265, 0, 0, 282, 0, 315, 314, 398, 368, 0, ! 396, 358, 0, 148, 0, 0, 0, 224, 276, 0, ! 330, 327, 237, 235, 0, 269, 266, 260, 0, 280, ! 0, 366, 0, 0, 149, 0, 249, 0, 0, 236, ! 278, 279, 151, 0, 0, 0, 0, 150, 0, 0, ! 0, 0, 285, 0, 250, 284, 0, 0, 0 }; static const short yydefgoto[] = { ! 776, 1, 210, 282, 211, 87, 88, 70, 62, 212, ! 213, 24, 25, 26, 9, 10, 11, 12, 13, 14, ! 15, 16, 446, 288, 134, 107, 49, 72, 106, 132, ! 160, 161, 162, 93, 116, 117, 118, 214, 164, 264, ! 94, 113, 180, 181, 289, 138, 185, 405, 166, 167, ! 168, 266, 169, 170, 408, 556, 557, 290, 19, 45, ! 74, 67, 109, 46, 65, 96, 97, 98, 99, 215, ! 364, 291, 173, 559, 719, 293, 294, 295, 296, 694, ! 297, 298, 299, 300, 697, 301, 302, 303, 304, 698, ! 305, 449, 306, 589, 656, 657, 658, 659, 307, 308, ! 700, 309, 310, 311, 701, 312, 313, 455, 664, 665, ! 314, 315, 316, 317, 318, 319, 320, 575, 576, 577, ! 578, 216, 217, 218, 219, 220, 729, 673, 221, 494, ! 222, 474, 475, 122, 223, 224, 225, 226, 227, 228, ! 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, ! 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, ! 400, 495, 714 }; static const short yypact[] = { ! -32768, 603,-32768,-32768, 367, -76, 436, 439,-32768,-32768, ! 666, 434, 810,-32768,-32768,-32768,-32768, 696,-32768,-32768, ! -32768,-32768,-32768, 13,-32768,-32768,-32768, 356,-32768, 349, ! -32768, 17, 582,-32768,-32768, 836, 590,-32768, -76, 459, ! -32768,-32768, 219,-32768, 463, -63, -48,-32768, 472, 38, ! -32768,-32768, -76, 686, 363,-32768, 357,-32768, 23,-32768, ! -32768,-32768,-32768, 115, 1586,-32768, 502, -63,-32768,-32768, ! 365, 505,-32768,-32768, -63, -48,-32768, 38,-32768,-32768, ! -32768, 515,-32768,-32768,-32768, 518, 136,-32768,-32768,-32768, ! 422, 1120,-32768,-32768, 50,-32768, 1593,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 151, 196,-32768, -63, ! -32768,-32768, 301, -29,-32768, 137, -55,-32768, 595, -29, ! 393, 400, 400,-32768, 520, 528,-32768,-32768,-32768,-32768, ! 530, 1277,-32768,-32768, 196, 729, 531, 58,-32768,-32768, ! -32768, 537, 1530, 172, 506,-32768,-32768, 202,-32768, -29, ! -32768, 348, -29,-32768,-32768, 418,-32768, 445, 640,-32768, ! 1355,-32768,-32768,-32768,-32768, 87,-32768, 517,-32768,-32768, ! 527,-32768,-32768, 1976,-32768,-32768,-32768,-32768, 541, 553, ! 478,-32768, 471,-32768,-32768, 538,-32768,-32768,-32768, 158, ! -32768,-32768, 2784, 1188, 2845, 2896, 540, 18, 485,-32768, ! 2957, 3008, 3069, 4998,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 449, 572, 967, 21,-32768, 575, 600,-32768,-32768, ! -32768, 543,-32768, 563,-32768, 697, 755,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768, 843, 775, 959, 993, 891, ! 694, 702, 727, 731, 11,-32768,-32768,-32768, 734,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 901, ! 527,-32768,-32768,-32768, 536,-32768, 647,-32768, 787, 249, ! 3120,-32768, 99, 2173, 16, 268, 277, 78, 328, 217, ! 656, 5283, -76, 449, 572, 960, 948, 406,-32768, 471, ! 659,-32768, 1907,-32768,-32768, 662,-32768,-32768,-32768, 2045, ! -32768,-32768, 670,-32768,-32768,-32768,-32768, 2045,-32768, 2045, ! -32768,-32768, 5334, 684,-32768,-32768,-32768,-32768,-32768, 332, ! -32768, 674, 815, 755, 869, 878,-32768,-32768,-32768,-32768, ! 849,-32768, 746, 564, 585,-32768, 679,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 26,-32768, 586, 883, ! 742, 742, 352,-32768,-32768,-32768,-32768,-32768, 661, 967, ! 199,-32768, 690,-32768, 716, 27, 739, 5059, 2224, 803, ! -32768, -44, 3181,-32768, 369,-32768,-32768, 3232, 3293, 3344, ! 3405, 3456, 3517, 3568, 3629, 3680, 3741, 3792, 3853, 574, ! 3904, 3965, 4016, 4077, 4128, 4189, 4240, 2285,-32768,-32768, ! 4301,-32768, 493,-32768,-32768,-32768,-32768,-32768,-32768, 1907, ! -32768,-32768,-32768,-32768, 4352,-32768, 65,-32768,-32768, 84, ! -32768,-32768, 92,-32768, 4413,-32768, 4464,-32768, 757,-32768, ! 1469,-32768,-32768, 104, 212, 758, 732,-32768,-32768, -76, ! 2336,-32768,-32768,-32768,-32768, 1043, 553,-32768,-32768, 760, ! -32768, 796, 990,-32768,-32768,-32768, 35, 2397,-32768, 4525, ! -32768,-32768,-32768, 849,-32768,-32768,-32768,-32768, 246, 776, ! -32768,-32768,-32768, 2448, 742,-32768, -35, 742, -35,-32768, ! 2509, 4576, 220, -18, 195,-32768, 5359,-32768,-32768, 748, ! -32768,-32768,-32768,-32768, 568,-32768,-32768, 232,-32768,-32768, ! -32768,-32768,-32768, 781,-32768, 238,-32768, 5110,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768, 843,-32768, 843,-32768, 775, ! -32768, 775,-32768, 775,-32768, 959,-32768, 959,-32768, 959, ! -32768, 959,-32768, 136,-32768,-32768, 993,-32768, 993,-32768, ! 891,-32768, 694,-32768, 702,-32768, 727,-32768, 731,-32768, ! 885, 790,-32768,-32768,-32768, 1008,-32768, 1907, 795,-32768, ! 1907,-32768, 215,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 241,-32768, 801, 411, 89, 757,-32768, 517,-32768,-32768, ! -32768,-32768,-32768, 416, 758,-32768, 890, 159, 1,-32768, ! 806,-32768, 4973,-32768, 4861, 805, 825, 848,-32768,-32768, ! 5171,-32768, 240,-32768, 400,-32768, 400,-32768,-32768, 842, ! 166,-32768,-32768,-32768, 4637, 1021,-32768,-32768,-32768,-32768, ! -32768, 4688,-32768,-32768, 5222,-32768,-32768, 196, 624,-32768, ! 4749, 846,-32768, 1907, 2560,-32768,-32768, 2112,-32768,-32768, ! 105,-32768, 876,-32768,-32768,-32768,-32768,-32768,-32768, 2621, ! -32768,-32768, 944, 19, 4800,-32768, 428,-32768, 1684,-32768, ! 5283,-32768,-32768,-32768, 861, 863, 4912,-32768, 224,-32768, ! 634,-32768,-32768, 196,-32768, 874,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 643,-32768, 196,-32768,-32768, 424,-32768, ! 176, 167, 443,-32768, 920, 922, 2112,-32768,-32768, 2112, ! -32768,-32768, 892,-32768, 895, 909,-32768, 984, 169,-32768, ! -32768,-32768,-32768,-32768, 245,-32768,-32768, 1759,-32768, 1833, ! -32768, 915, 2045,-32768, 924,-32768,-32768,-32768,-32768, 196, ! -32768,-32768, 2672,-32768, 180, 4352, 2045,-32768,-32768, 2733, ! -32768,-32768,-32768,-32768, 1014,-32768,-32768,-32768, 917,-32768, ! 2045,-32768, 181, 171,-32768, 320,-32768, 4861, 923,-32768, ! -32768,-32768,-32768, 211, 2112, 925, 4912,-32768, 974, 2112, ! 937, 2112,-32768, 2112,-32768,-32768, 1038, 1044,-32768 }; static const short yypgoto[] = { ! -32768,-32768,-32768, -57, -49, 660, 10, -128, 353, 308, ! -4, 552,-32768, 124,-32768, 1033, 689,-32768, 440,-32768, ! -32768, 898, 20, 611,-32768,-32768, 992, 979,-32768, -133, ! -32768, 907,-32768, 339, -121, 933, -162, -190,-32768,-32768, ! 354, -28, 816, -326, -125, -81,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 921,-32768, -149,-32768, 676, 305,-32768, ! -32768,-32768,-32768, 1032, -2,-32768, 994,-32768,-32768, 88, ! -32768, -119, 823, 799, -164, -287,-32768, 785, -195, 207, ! -473, 477, -422,-32768,-32768,-32768, -310,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768, 447, 461, -430, -410,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, -302,-32768, -629, 793, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 524,-32768, ! 545,-32768,-32768,-32768, 236,-32768,-32768,-32768,-32768, -405, ! -32768, 771, 157, -36, 1112, 307, 1317, 397, 476, 619, ! 930, -53, 630, 709, -463,-32768, 580, 615, 763, 584, ! 736, 745, 735, 737, 743,-32768, 510, 744, 893,-32768, ! -32768, -59,-32768 }; ! ! #define YYLAST 5469 ! ! static const short yytable[] = { ! 23, 175, 454, 31, 151, 443, 461, 85, 184, 292, ! 182, 22, 172, 363, 40, 86, 330, 347, 50, 347, ! 710, 17, 370, 616, 78, 136, 396, 466, 490, 502, ! 17, 17, 17, 64, 125, 587, 591, 724, 145, 85, ! 63, 172, 86, 22, 63, 140, 141, 86, 265, 653, ! 121, 126, 17, 66, 61, 17, 17, 119, 69, 186, ! 90, 203, 63, 147, 654, 102, 563, 63, 255, 137, ! 352, 257, 108, 17, 85, 610, 61, 614, 178, 427, ! 147, 61, 86, 249, 91, 565, 86, 90, 263, 267, ! 643, 71, 90, 567, 467, 491, 149, 152, 655, 397, ! 417, 125, 628, 85, 447, 580, 703, 133, 711, 86, ! -153, 86, 450, 41, 451, 42, 91, 51, 348, 52, ! 348, -92, -92, 79, 283, 333, 63, 90, 765, 27, ! 29, 90, 63, 86, 182, -291, 592, 770, 139, 339, ! 61, 343, 345, 360, 249, 406, 69, 354, 356, 350, ! 127, 158, 679, 358, 90, 179, 90, 187, 428, 139, ! 651, 435, 54, 56, 695, 564, 59, 674, 651, 285, ! 743, 463, 743, 250, 155, 121, 59, 650, 90, 403, ! 158, 709, 742, -102, 566, 155, 22, -102, 336, 336, ! 336, 336, 568, 287, 63, 670, 336, 336, 359, 418, ! 485, -253, 178, 253, 581, 112, 465, 182, 351, 115, ! 86, 416, 759, 485, 422, 696, 636, 52, 431, 683, ! 57, 613, 434, 695, 58, 725, 695, 699, 720, 691, ! -95, 135, 439, 622, 120, -95, -95, -95, -95, 625, ! 86, 671, 638, 283, 708, 560, 745, 121, 112, 115, ! 413, -95, 130, -95, 652, 90, -95, -95, -95, -95, ! 621, 675, 734, 283, 744, 189, 763, 621, 621, 423, ! 621, 251, 621, 443, 696, 178, 733, 696, 425, 179, ! 754, 762, 662, 86, 454, 90, 699, 720, 285, 699, ! 615, 695, 131, 147, 486, 445, 695, 286, 695, 619, ! 695, 254, 189, 445, 22, 445, 22, 582, 452, 497, ! 637, 767, 287, 505, 476, 478, 705, 432, 584, 146, ! 155, 636, 483, 484, 509, 511, 513, 753, 90, 429, ! 63, 623, 179, 458, 746, 702, 639, 626, 551, 672, ! 533, 598, 696, 414, 69, 374, 443, 696, 599, 696, ! 47, 696, 179, 479, 699, 562, 454, 43, 76, 699, ! 283, 699, 424, 699, 73, 570, 103, 572, 21, 95, ! 506, 426, 89, 336, 336, 336, 336, 336, 336, 336, ! 336, 336, 336, 336, 336, 90, 336, 336, 336, 336, ! 336, 336, 336, 633, 702, 135, 419, 702, 595, 89, ! 597, 95, -63, 433, 89, 555, 189, -319, 632, 321, ! -63, 635, 641, 48, 602, 764, 286, 648, -64, 101, ! 44, 48, 430, 286, 105, 648, 459, 44, 612, 287, ! 249, 286, 443, 286, -29, 2, 171, 28, 604, 89, ! 30, 606, 693, 89, 413, -63, 480, 454, 256, 141, ! 33, 37, -154, -63, 22, 644, 454, 189, 647, -156, ! 55, -64, 702, 507, 60, 171, 89, 702, 89, 702, ! 163, 702, 469, 68, 39, 33, 653, 336, 20, 3, ! 322, 284, 336, 154, 689, 165, 349, 20, 20, 20, ! 89, 654, 146, 59, 684, 503, 5, 121, 147, 163, ! -319, 447, 6, 100, 450, 642, 104, 252, 283, 20, ! 649, 283, 20, 20, 165, 258, 111, 182, 732, 114, ! 120, 148, 80, 22, 52, 715, 22, 749, 321, 150, ! 20, 153, 183, 286, 8, 321, 80, 735, 188, 259, ! 728, 756, 329, 321, 373, 321, 22, 120, 321, 726, ! 22, 365, 731, 285, 82, 761, 285, 83, 22, 22, ! 59, 677, 681, 189, 605, 462, 607, 89, 82, 693, ! 323, 83, 22, 331, 749, 532, 756, 287, 761, 332, ! 287, 136, -32, 2, 283, 178, 464, 468, 554, 22, ! -31, 2, 22, 86, 332, 713, 751, 89, 37, 322, ! 284, 721, 22, -26, 2, 22, 322, 22, 174, 283, ! 336, 336, 18, 155, 322, 22, 322, 22, 22, 322, ! 284, 18, 18, 18, 22, 80, 336, 3, 22, 285, ! 22, 603, 155, 445, 603, 3, 404, 174, 90, 334, ! 89, 123, 346, 18, 5, 321, 18, 18, 3, 324, ! 6, 22, 5, 287, 285, -500, -500, 82, 6, 4, ! 83, 22, 179, 620, 18, 5, -28, 2, 283, 621, ! 283, 6, 22, 22, 366, 92, 755, 371, 287, 7, ! 758, 286, 8, 157, 286, 37, -33, 2, 142, 323, ! 8, 80, 445, 143, 144, 445, 323, 89, 372, 32, ! 124, 36, 38, 8, 323, 392, 323, 92, 39, 323, ! 157, 3, 157, 285, 393, 285, 322, 284, 445, 685, ! -338, -338, 4, 82, 53, 621, 83, 22, 5, 727, ! 176, 3, 445, 498, 6, 621, -136, 287, 730, 287, ! 394, 37, 159, 407, 621, 395, 445, 460, 5, 617, ! -152, 192, 193, 440, 6, 59, 481, 286, 38, 482, ! 445, 286, 444, 365, 39, 445, 8, 445, 324, 445, ! 448, 159, -338, 367, 3, 324, -338, 368, 380, 381, ! 80, 369, 286, 324, 457, 324, 8, 487, 324, -501, ! -501, 3, 325, 321, 194, 195, 321, 80, 583, 80, ! 499, 375, 376, 326, 498, 500, 323, 492, 196, 501, ! -27, 2, 82, 488, 197, 83, 22, 489, 573, 22, ! 286, 198, 574, 286, 177, 199, 398, 399, 321, 82, ! 321, 82, 83, 22, 83, 22, -30, 2, 200, 201, ! 473, 286, 202, 286, 203, 618, 286, 498, 377, 378, ! 379, 204, 205, 206, 207, 3, 588, 208, 209, 141, ! 286, -340, -340, 590, 322, 284, 4, 322, 284, 321, ! 600, 499, 5, 321, 286, 624, 500, 704, 6, 630, ! 501, 3, 327, 410, 411, 324, 629, 412, 286, 634, ! 22, 650, 4, 286, 321, 286, 640, 286, 5, 322, ! 660, 322, 321, 737, 6, 666, 738, 390, 391, 34, ! 8, 325, 688, -340, 499, -409, -409, -340, 325, 500, ! 667, 3, 326, 501, -410, -410, 325, 80, 325, 326, ! 34, 325, 321, 22, 34, 321, 8, 326, -367, 326, ! 322, 284, 326, 668, 322, 709, 3, 143, 144, 437, ! 89, 34, 80, 321, 323, 321, 722, 323, 321, 82, ! 515, 517, 83, 22, 592, 322, 284, 382, 383, 384, ! -365, 768, 321, 322, 536, 538, 772, 736, 774, -204, ! 775, 470, 471, 472, 82, 742, 321, 83, 22, 323, ! 740, 323, 739, 321, -23, -23, 401, 519, 521, 523, ! 321, 327, 321, 322, 741, 321, 322, 321, 327, 321, ! 748, 385, 386, 387, 388, 759, 327, 760, 327, 750, ! 769, 327, 678, 766, 322, 284, 322, 284, 325, 322, ! 323, 771, 773, 324, 323, -23, 324, 438, 777, 326, ! -23, -23, -23, 322, 778, 35, -23, -16, 77, 534, ! -23, 389, -499, -499, 367, 323, 110, 322, 368, -499, ! -499, 367, 436, 323, 322, 368, 328, 262, 324, 369, ! 324, 322, 80, 322, 190, 402, 322, -16, 322, 260, ! 322, 196, -499, -499, 367, 558, 75, 197, 368, 409, ! 129, 442, 369, 323, 198, -16, 323, 453, 199, 645, ! -499, -499, 367, 716, 82, 456, 368, 83, 22, 324, ! 631, 200, 201, 324, 323, 202, 323, 717, 327, 323, ! 646, 123, 477, 341, 204, 205, 206, 207, 540, 544, ! 208, 209, 546, 323, 324, -499, -499, 367, 542, 548, ! 687, 368, 324, 0, 553, 436, 0, 323, 525, 527, ! 529, 531, 0, 0, 323, 0, 0, 0, 0, 0, ! 0, 323, 0, 323, 0, 37, 323, 0, 323, 0, ! 323, 80, 324, 0, 0, 324, 325, 0, 0, 325, ! 124, 0, 38, 0, 0, 328, 0, 326, 39, 340, ! 326, 192, 328, 324, 0, 324, 0, 0, 324, 0, ! 328, 0, 328, 82, 0, 328, 83, 22, 0, 0, ! 0, 325, 324, 325, 0, 0, 0, 0, 0, 0, ! 0, 0, 326, 0, 326, 0, 324, 0, 0, 0, ! 0, 0, 0, 324, 194, 195, 0, 0, 0, 80, ! 324, 0, 324, 0, 0, 324, 0, 324, 196, 324, ! 0, 0, 325, 0, 197, 0, 325, 0, 0, 0, ! 0, 198, 0, 326, 0, 199, 327, 326, 0, 327, ! 0, 82, 0, 0, 83, 22, 0, 325, 200, 201, ! 0, 0, 202, 0, 0, 325, 0, 0, 326, 0, ! 0, 204, 205, 206, 207, 0, 326, 208, 209, 0, ! 0, 327, 328, 327, 337, 337, 337, 337, 0, 0, ! 0, 0, 337, 337, 0, 325, 0, 0, 325, 0, ! 0, 0, 3, 0, 0, 0, 326, 0, 80, 326, ! 0, 0, 0, 0, 0, 0, 325, 81, 325, 5, ! 0, 325, 327, 0, 0, 6, 327, 326, 0, 326, ! 0, 0, 326, 0, 0, 325, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 326, 327, 0, 325, ! 0, 0, 0, 155, 156, 327, 325, 8, 0, 0, ! 326, 0, 0, 325, 0, 325, 0, 326, 325, 0, ! 325, 0, 325, 0, 326, 0, 326, 0, 0, 326, ! 3, 326, 0, 326, 0, 327, 80, 0, 327, 0, ! 0, 0, 0, 0, 0, 81, 0, 5, 0, 0, ! 0, 0, 0, 6, 0, 0, 327, 0, 327, 0, ! 0, 327, 0, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 327, 0, 0, 0, 0, ! 328, 155, 261, 328, 0, 8, 0, 0, 0, 327, ! 0, 0, 0, 0, 0, 0, 327, 0, 0, 0, ! 579, 0, 0, 327, 0, 327, 0, 0, 327, 0, ! 327, 0, 327, 0, 0, 328, 0, 328, 0, 337, ! 337, 337, 337, 337, 337, 337, 337, 337, 337, 337, ! 337, 0, 337, 337, 337, 337, 337, 337, 337, 338, ! 338, 338, 338, 0, -286, -286, -286, 338, 338, 0, ! -286, 0, 0, 0, 0, 0, 328, 0, 0, -286, ! 328, 191, 0, 192, 193, -286, 0, 0, 0, 0, ! 0, 0, -286, 0, 0, 0, -286, 0, 0, 0, ! 0, 328, -286, 0, 0, -286, -286, 0, 0, 328, ! 0, 0, 0, -286, 0, 0, 0, 0, 0, -286, ! 0, 0, -286, -286, -286, -286, 194, 195, -286, -286, ! 0, 80, 0, 0, 0, 0, 0, 0, 0, 328, ! 196, 0, 328, 337, 0, 0, 197, 0, 337, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 328, 0, 328, 82, 0, 328, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 0, 203, 0, 0, 328, ! 0, 3, 0, 204, 205, 206, 207, 80, 3, 208, ! 209, 0, 0, 328, 80, 0, 81, 0, 5, 0, ! 328, 0, 0, 81, 6, 5, 0, 328, 0, 328, ! 0, 6, 328, 0, 328, 0, 328, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 84, 0, 268, 0, 0, 0, 0, ! 128, 0, 0, 0, 338, 338, 338, 338, 338, 338, ! 338, 338, 338, 338, 338, 338, 0, 338, 338, 338, ! 338, 338, 338, 338, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 337, 337, 0, 3, ! 194, 195, 653, 269, 270, 80, 271, 0, 0, 272, ! 0, 0, 337, 273, 196, 0, 0, 654, 0, 0, ! 274, 275, 6, 276, 0, 277, 278, 198, 279, 0, ! 268, 280, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 0, 0, 0, 0, 281, 0, ! 155, 718, 0, 0, 8, 0, 0, 204, 205, 206, ! 207, 0, 0, 208, 209, 0, 0, 0, 338, 0, ! 0, 0, 0, 338, 3, 194, 195, 653, 269, 270, ! 80, 271, 0, 0, 272, 0, 0, 0, 273, 196, ! 0, 0, 654, 0, 0, 274, 275, 6, 276, 0, ! 277, 278, 198, 279, 268, 0, 280, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 0, ! 0, 0, 0, 281, 0, 155, 747, 0, 0, 8, ! 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, ! 0, 0, 0, 0, 0, 0, 0, 0, 3, 194, ! 195, -263, 269, 270, 80, 271, 0, 0, 272, 0, ! 0, 0, 273, 196, 0, 0, -263, 0, 0, 274, ! 275, 6, 276, 0, 277, 278, 198, 279, 268, 0, ! 280, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 0, 0, 0, 0, 281, 0, 155, ! -263, 338, 338, 8, 0, 0, 204, 205, 206, 207, ! 0, 0, 208, 209, 0, 0, 0, 338, 0, 0, ! 0, 0, 3, 194, 195, 0, 269, 270, 80, 271, ! 0, 0, 272, 0, 0, 0, 273, 196, 0, 0, ! 0, 0, 0, 274, 275, 6, 276, 268, 277, 278, ! 198, 279, 0, 0, 280, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 0, 0, 0, ! 0, 281, 0, 155, 441, 0, 0, 8, 0, 0, ! 204, 205, 206, 207, 0, 0, 208, 209, 0, 0, ! 0, 3, 194, 195, 0, 269, 270, 80, 271, 0, ! 0, 272, 0, 0, 0, 273, 196, 0, 0, 0, ! 0, 0, 274, 275, 6, 276, 268, 277, 278, 198, ! 279, 0, 0, 280, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 0, 0, 0, 0, ! 281, 0, 155, 0, 0, 0, 8, 0, 0, 204, ! 205, 206, 207, 0, 0, 208, 209, 0, 0, 0, ! 3, 194, 195, 0, 269, 270, 80, 271, 0, 0, ! 272, 0, 0, 0, 273, 196, 0, 0, 0, 0, ! 0, 274, 275, 268, 276, 0, 277, 278, 198, 279, ! 0, 0, 280, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 0, 0, 0, 0, 281, ! 0, 155, 0, 0, 0, 8, 0, 0, 204, 205, ! 206, 207, 0, 0, 208, 209, 0, 3, 194, 195, ! 0, 692, 270, 80, 271, 0, 0, 272, 0, 0, ! 0, 273, 196, 0, 420, 0, 192, 193, 274, 275, ! 0, 276, 0, 277, 278, 198, 279, 0, 0, 280, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 0, 0, 0, 0, 281, 0, 155, 0, ! 0, 0, 8, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 496, 0, 192, 193, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 0, ! 194, 195, 0, 421, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 549, 0, 192, 193, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 200, 201, 0, 0, 202, 0, ! 0, 0, 0, 146, 0, 0, 0, 204, 205, 206, ! 207, 194, 195, 208, 209, 0, 80, 585, 0, 192, ! 193, 0, 0, 0, 0, 196, 0, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 550, 200, 201, 0, 0, 202, ! 0, 0, 194, 195, 0, 0, 0, 80, 204, 205, ! 206, 207, 0, 0, 208, 209, 196, 0, 593, 0, ! 192, 193, 197, 0, 0, 0, 0, 0, 0, 198, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 200, 201, 0, 0, ! 202, 586, 0, 0, 0, 0, 0, 0, 0, 204, ! 205, 206, 207, 194, 195, 208, 209, 0, 80, 601, ! 0, 192, 193, 0, 0, 0, 0, 196, 0, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, ! 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 200, 201, 0, ! 0, 202, 0, 0, 194, 195, 0, 594, 0, 80, ! 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, ! 608, 0, 192, 193, 197, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 82, 0, 0, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 0, 0, 0, 146, 0, 0, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 585, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 609, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 706, 0, 192, 193, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 690, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 706, 0, 192, 193, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 200, 201, 0, 0, 202, 707, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 593, 0, 192, 193, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 200, 201, 0, 0, 202, 752, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 335, 0, 192, 193, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 0, ! 194, 195, 0, 757, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 342, 0, 192, 193, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 200, 201, 0, 0, 202, 0, ! 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, ! 207, 194, 195, 208, 209, 0, 80, 344, 0, 192, ! 193, 0, 0, 0, 0, 196, 0, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 200, 201, 0, 0, 202, ! 0, 0, 194, 195, 0, 0, 0, 80, 204, 205, ! 206, 207, 0, 0, 208, 209, 196, 0, 353, 0, ! 192, 193, 197, 0, 0, 0, 0, 0, 0, 198, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 200, 201, 0, 0, ! 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, ! 205, 206, 207, 194, 195, 208, 209, 0, 80, 355, ! 0, 192, 193, 0, 0, 0, 0, 196, 0, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, ! 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 200, 201, 0, ! 0, 202, 0, 0, 194, 195, 0, 0, 0, 80, ! 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, ! 357, 0, 192, 193, 197, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 82, 0, 0, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 415, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 504, 0, 192, 193, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 508, 0, 192, 193, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 510, 0, 192, 193, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 512, 0, 192, 193, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 0, ! 194, 195, 0, 0, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 514, 0, 192, 193, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 200, 201, 0, 0, 202, 0, ! 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, ! 207, 194, 195, 208, 209, 0, 80, 516, 0, 192, ! 193, 0, 0, 0, 0, 196, 0, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 200, 201, 0, 0, 202, ! 0, 0, 194, 195, 0, 0, 0, 80, 204, 205, ! 206, 207, 0, 0, 208, 209, 196, 0, 518, 0, ! 192, 193, 197, 0, 0, 0, 0, 0, 0, 198, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 200, 201, 0, 0, ! 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, ! 205, 206, 207, 194, 195, 208, 209, 0, 80, 520, ! 0, 192, 193, 0, 0, 0, 0, 196, 0, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, ! 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 200, 201, 0, ! 0, 202, 0, 0, 194, 195, 0, 0, 0, 80, ! 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, ! 522, 0, 192, 193, 197, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 82, 0, 0, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 524, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 526, 0, 192, 193, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 528, 0, 192, 193, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 530, 0, 192, 193, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 535, 0, 192, 193, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 0, ! 194, 195, 0, 0, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 537, 0, 192, 193, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 200, 201, 0, 0, 202, 0, ! 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, ! 207, 194, 195, 208, 209, 0, 80, 539, 0, 192, ! 193, 0, 0, 0, 0, 196, 0, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 200, 201, 0, 0, 202, ! 0, 0, 194, 195, 0, 0, 0, 80, 204, 205, ! 206, 207, 0, 0, 208, 209, 196, 0, 541, 0, ! 192, 193, 197, 0, 0, 0, 0, 0, 0, 198, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 200, 201, 0, 0, ! 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, ! 205, 206, 207, 194, 195, 208, 209, 0, 80, 543, ! 0, 192, 193, 0, 0, 0, 0, 196, 0, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, ! 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 200, 201, 0, ! 0, 202, 0, 0, 194, 195, 0, 0, 0, 80, ! 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, ! 545, 0, 192, 193, 197, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 82, 0, 0, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 547, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 552, 0, 192, 193, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 561, 0, 192, 193, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 569, 0, 192, 193, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 571, 0, 192, 193, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 0, ! 194, 195, 0, 0, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 596, 0, 192, 193, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 82, 0, 0, ! 83, 22, 0, 0, 200, 201, 0, 0, 202, 0, ! 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, ! 207, 194, 195, 208, 209, 0, 80, 611, 0, 192, ! 193, 0, 0, 0, 0, 196, 0, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 82, 0, ! 0, 83, 22, 0, 0, 200, 201, 0, 0, 202, ! 0, 0, 194, 195, 0, 0, 0, 80, 204, 205, ! 206, 207, 0, 0, 208, 209, 196, 0, 676, 0, ! 192, 193, 197, 0, 0, 0, 0, 0, 0, 198, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 82, ! 0, 0, 83, 22, 0, 0, 200, 201, 0, 0, ! 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, ! 205, 206, 207, 194, 195, 208, 209, 0, 80, 680, ! 0, 192, 193, 0, 0, 0, 0, 196, 0, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, ! 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, ! 82, 0, 0, 83, 22, 0, 0, 200, 201, 0, ! 0, 202, 0, 0, 194, 195, 0, 0, 0, 80, ! 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, ! 686, 0, 192, 193, 197, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 82, 0, 0, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 712, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 663, 0, 0, 0, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 723, 0, 0, 0, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 0, 0, 0, 0, 281, -294, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 661, 0, 0, 0, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 192, 193, 0, 0, 0, 281, -294, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 0, 0, 0, 0, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 194, 195, 198, 0, 0, 80, ! 199, 0, 0, 0, 0, 0, 82, 0, 196, 83, ! 22, 0, 192, 193, 197, 0, 0, 281, 0, 0, ! 0, 198, 0, 0, 0, 199, 204, 205, 206, 207, ! 0, 82, 208, 209, 83, 22, 0, 0, 200, 201, ! 0, 0, 202, 0, 203, 361, 0, 0, 0, 362, ! 0, 204, 205, 206, 207, 194, 195, 208, 209, 0, ! 80, 0, 0, 192, 193, 0, 0, 0, 0, 196, ! 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, ! 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 82, 0, 0, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 493, 0, 194, 195, 0, 0, ! 0, 80, 204, 205, 206, 207, 0, 0, 208, 209, ! 196, 0, 0, 0, 192, 193, 197, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 82, 0, 0, 83, 22, 0, 0, ! 200, 201, 0, 0, 202, 627, 0, 0, 0, 0, ! 0, 0, 0, 204, 205, 206, 207, 194, 195, 208, ! 209, 0, 80, 0, 0, 192, 193, 0, 0, 0, ! 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 82, 0, 0, 83, 22, 0, ! 0, 200, 201, 0, 0, 202, 669, 0, 194, 195, ! 0, 0, 0, 80, 204, 205, 206, 207, 0, 0, ! 208, 209, 196, 0, 0, 0, 192, 193, 197, 0, ! 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 82, 0, 0, 83, 22, ! 0, 0, 200, 201, 0, 0, 202, 682, 0, 0, ! 0, 0, 0, 0, 0, 204, 205, 206, 207, 194, ! 195, 208, 209, 0, 80, 0, 0, 0, 0, 0, ! 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 82, 0, 0, 83, ! 22, 0, 0, 200, 201, 0, 0, 202, 0, 3, ! 194, 195, 0, 0, 0, 80, 204, 205, 206, 207, ! 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, ! 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, ! 80, 199, 0, 0, 0, 0, 0, 82, 0, 196, ! 83, 22, 0, 0, 0, 197, 0, 0, 281, 0, ! 0, 0, 198, 0, 0, 0, 199, 204, 205, 206, ! 207, 0, 82, 208, 209, 83, 22, 0, 0, 200, ! 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, ! 0, 0, 204, 205, 206, 207, 0, 0, 208, 209 }; static const short yycheck[] = { ! 4, 134, 312, 7, 125, 292, 332, 64, 136, 173, ! 135, 87, 131, 203, 1, 64, 178, 1, 1, 1, ! 1, 1, 1, 486, 1, 54, 15, 1, 1, 73, ! 10, 11, 12, 96, 91, 440, 1, 666, 119, 96, ! 44, 160, 91, 87, 48, 100, 101, 96, 167, 48, ! 86, 1, 32, 101, 44, 35, 36, 85, 48, 1, ! 64, 96, 66, 98, 63, 67, 1, 71, 149, 98, ! 198, 152, 74, 53, 131, 480, 66, 95, 135, 1, ! 98, 71, 131, 142, 64, 1, 135, 91, 1, 170, ! 1, 53, 96, 1, 68, 68, 124, 125, 97, 88, ! 1, 158, 507, 160, 299, 1, 1, 109, 89, 158, ! 94, 160, 307, 100, 309, 102, 96, 100, 102, 102, ! 102, 100, 101, 100, 173, 182, 130, 131, 757, 5, ! 6, 135, 136, 182, 259, 100, 101, 766, 1, 192, ! 130, 194, 195, 202, 203, 264, 136, 200, 201, 198, ! 100, 131, 615, 202, 158, 135, 160, 99, 277, 1, ! 1, 282, 38, 39, 637, 100, 42, 1, 1, 173, ! 1, 333, 1, 1, 96, 211, 52, 1, 182, 260, ! 160, 1, 1, 96, 100, 96, 87, 100, 192, 193, ! 194, 195, 100, 173, 198, 600, 200, 201, 202, 100, ! 1, 96, 259, 1, 100, 81, 334, 332, 198, 85, ! 259, 270, 1, 1, 273, 637, 1, 102, 1, 624, ! 1, 1, 281, 696, 5, 1, 699, 637, 658, 634, ! 93, 94, 289, 1, 98, 98, 99, 100, 101, 1, ! 289, 1, 1, 292, 649, 409, 1, 283, 124, 125, ! 1, 93, 101, 95, 95, 259, 98, 99, 100, 101, ! 101, 95, 95, 312, 95, 141, 95, 101, 101, 1, ! 101, 99, 101, 560, 696, 332, 100, 699, 1, 259, ! 100, 100, 592, 332, 594, 289, 696, 717, 292, 699, ! 95, 764, 96, 98, 95, 299, 769, 173, 771, 489, ! 773, 99, 178, 307, 87, 309, 87, 95, 312, 368, ! 95, 100, 292, 372, 350, 351, 642, 100, 439, 99, ! 96, 1, 358, 359, 377, 378, 379, 732, 332, 1, ! 334, 99, 312, 1, 89, 637, 95, 99, 397, 99, ! 389, 95, 764, 94, 334, 221, 633, 769, 102, 771, ! 1, 773, 332, 1, 764, 414, 666, 1, 1, 769, ! 409, 771, 94, 773, 1, 424, 1, 426, 1, 64, ! 1, 94, 64, 377, 378, 379, 380, 381, 382, 383, ! 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, ! 394, 395, 396, 557, 696, 94, 272, 699, 457, 91, ! 459, 96, 53, 279, 96, 409, 282, 1, 557, 173, ! 53, 560, 1, 64, 473, 95, 292, 1, 53, 66, ! 64, 64, 94, 299, 71, 1, 94, 64, 481, 409, ! 489, 307, 719, 309, 0, 1, 131, 1, 474, 131, ! 1, 477, 637, 135, 1, 96, 94, 757, 100, 101, ! 10, 45, 96, 96, 87, 574, 766, 333, 577, 96, ! 1, 96, 764, 94, 1, 160, 158, 769, 160, 771, ! 131, 773, 348, 1, 68, 35, 48, 481, 1, 45, ! 173, 173, 486, 130, 633, 131, 1, 10, 11, 12, ! 182, 63, 99, 369, 627, 371, 62, 533, 98, 160, ! 94, 696, 68, 1, 699, 94, 1, 1, 557, 32, ! 94, 560, 35, 36, 160, 97, 1, 642, 94, 1, ! 98, 1, 51, 87, 102, 97, 87, 722, 292, 1, ! 53, 1, 1, 409, 100, 299, 51, 94, 1, 94, ! 673, 736, 1, 307, 1, 309, 87, 98, 312, 668, ! 87, 102, 685, 557, 83, 750, 560, 86, 87, 87, ! 436, 614, 621, 439, 476, 1, 478, 259, 83, 764, ! 173, 86, 87, 95, 769, 1, 771, 557, 773, 101, ! 560, 54, 0, 1, 633, 642, 1, 1, 95, 87, ! 0, 1, 87, 642, 101, 654, 729, 289, 45, 292, ! 292, 660, 87, 0, 1, 87, 299, 87, 131, 658, ! 614, 615, 1, 96, 307, 87, 309, 87, 87, 312, ! 312, 10, 11, 12, 87, 51, 630, 45, 87, 633, ! 87, 474, 96, 637, 477, 45, 100, 160, 642, 101, ! 332, 1, 102, 32, 62, 409, 35, 36, 45, 173, ! 68, 87, 62, 633, 658, 92, 93, 83, 68, 56, ! 86, 87, 642, 95, 53, 62, 0, 1, 717, 101, ! 719, 68, 87, 87, 102, 64, 735, 102, 658, 76, ! 739, 557, 100, 131, 560, 45, 0, 1, 93, 292, ! 100, 51, 696, 98, 99, 699, 299, 389, 98, 10, ! 60, 12, 62, 100, 307, 11, 309, 96, 68, 312, ! 158, 45, 160, 717, 12, 719, 409, 409, 722, 95, ! 46, 47, 56, 83, 35, 101, 86, 87, 62, 95, ! 1, 45, 736, 1, 68, 101, 96, 717, 95, 719, ! 13, 45, 131, 96, 101, 14, 750, 1, 62, 1, ! 94, 3, 4, 94, 68, 631, 95, 633, 62, 98, ! 764, 637, 100, 102, 68, 769, 100, 771, 292, 773, ! 100, 160, 98, 94, 45, 299, 102, 98, 3, 4, ! 51, 102, 658, 307, 100, 309, 100, 97, 312, 92, ! 93, 45, 173, 557, 46, 47, 560, 51, 66, 51, ! 68, 46, 47, 173, 1, 73, 409, 68, 60, 77, ! 0, 1, 83, 97, 66, 86, 87, 101, 61, 87, ! 696, 73, 65, 699, 95, 77, 92, 93, 592, 83, ! 594, 83, 86, 87, 86, 87, 0, 1, 90, 91, ! 98, 717, 94, 719, 96, 97, 722, 1, 5, 6, ! 7, 103, 104, 105, 106, 45, 96, 109, 110, 101, ! 736, 46, 47, 67, 557, 557, 56, 560, 560, 633, ! 94, 68, 62, 637, 750, 94, 73, 1, 68, 89, ! 77, 45, 173, 96, 97, 409, 1, 100, 764, 94, ! 87, 1, 56, 769, 658, 771, 95, 773, 62, 592, ! 94, 594, 666, 696, 68, 100, 699, 16, 17, 11, ! 100, 292, 66, 98, 68, 46, 47, 102, 299, 73, ! 95, 45, 292, 77, 46, 47, 307, 51, 309, 299, ! 32, 312, 696, 87, 36, 699, 100, 307, 96, 309, ! 633, 633, 312, 95, 637, 1, 45, 98, 99, 1, ! 642, 53, 51, 717, 557, 719, 95, 560, 722, 83, ! 380, 381, 86, 87, 101, 658, 658, 8, 9, 10, ! 96, 764, 736, 666, 390, 391, 769, 57, 771, 57, ! 773, 98, 99, 100, 83, 1, 750, 86, 87, 592, ! 95, 594, 100, 757, 46, 47, 95, 382, 383, 384, ! 764, 292, 766, 696, 95, 769, 699, 771, 299, 773, ! 95, 18, 19, 20, 21, 1, 307, 100, 309, 95, ! 95, 312, 1, 100, 717, 717, 719, 719, 409, 722, ! 633, 57, 95, 557, 637, 87, 560, 89, 0, 409, ! 92, 93, 94, 736, 0, 12, 98, 87, 56, 389, ! 102, 58, 92, 93, 94, 658, 77, 750, 98, 92, ! 93, 94, 102, 666, 757, 98, 173, 160, 592, 102, ! 594, 764, 51, 766, 141, 259, 769, 87, 771, 158, ! 773, 60, 92, 93, 94, 409, 54, 66, 98, 266, ! 96, 292, 102, 696, 73, 87, 699, 312, 77, 575, ! 92, 93, 94, 656, 83, 312, 98, 86, 87, 633, ! 102, 90, 91, 637, 717, 94, 719, 656, 409, 722, ! 575, 1, 351, 193, 103, 104, 105, 106, 392, 394, ! 109, 110, 395, 736, 658, 92, 93, 94, 393, 396, ! 630, 98, 666, -1, 400, 102, -1, 750, 385, 386, ! 387, 388, -1, -1, 757, -1, -1, -1, -1, -1, ! -1, 764, -1, 766, -1, 45, 769, -1, 771, -1, ! 773, 51, 696, -1, -1, 699, 557, -1, -1, 560, ! 60, -1, 62, -1, -1, 292, -1, 557, 68, 1, ! 560, 3, 299, 717, -1, 719, -1, -1, 722, -1, ! 307, -1, 309, 83, -1, 312, 86, 87, -1, -1, ! -1, 592, 736, 594, -1, -1, -1, -1, -1, -1, ! -1, -1, 592, -1, 594, -1, 750, -1, -1, -1, ! -1, -1, -1, 757, 46, 47, -1, -1, -1, 51, ! 764, -1, 766, -1, -1, 769, -1, 771, 60, 773, ! -1, -1, 633, -1, 66, -1, 637, -1, -1, -1, ! -1, 73, -1, 633, -1, 77, 557, 637, -1, 560, ! -1, 83, -1, -1, 86, 87, -1, 658, 90, 91, ! -1, -1, 94, -1, -1, 666, -1, -1, 658, -1, ! -1, 103, 104, 105, 106, -1, 666, 109, 110, -1, ! -1, 592, 409, 594, 192, 193, 194, 195, -1, -1, ! -1, -1, 200, 201, -1, 696, -1, -1, 699, -1, ! -1, -1, 45, -1, -1, -1, 696, -1, 51, 699, ! -1, -1, -1, -1, -1, -1, 717, 60, 719, 62, ! -1, 722, 633, -1, -1, 68, 637, 717, -1, 719, ! -1, -1, 722, -1, -1, 736, -1, -1, -1, -1, ! 83, -1, -1, 86, 87, -1, 736, 658, -1, 750, ! -1, -1, -1, 96, 97, 666, 757, 100, -1, -1, ! 750, -1, -1, 764, -1, 766, -1, 757, 769, -1, ! 771, -1, 773, -1, 764, -1, 766, -1, -1, 769, ! 45, 771, -1, 773, -1, 696, 51, -1, 699, -1, -1, -1, -1, -1, -1, 60, -1, 62, -1, -1, ! -1, -1, -1, 68, -1, -1, 717, -1, 719, -1, ! -1, 722, -1, -1, -1, -1, -1, -1, 83, -1, ! -1, 86, 87, -1, -1, 736, -1, -1, -1, -1, ! 557, 96, 97, 560, -1, 100, -1, -1, -1, 750, ! -1, -1, -1, -1, -1, -1, 757, -1, -1, -1, ! 1, -1, -1, 764, -1, 766, -1, -1, 769, -1, ! 771, -1, 773, -1, -1, 592, -1, 594, -1, 377, ! 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, ! 388, -1, 390, 391, 392, 393, 394, 395, 396, 192, ! 193, 194, 195, -1, 45, 46, 47, 200, 201, -1, ! 51, -1, -1, -1, -1, -1, 633, -1, -1, 60, ! 637, 1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, ! -1, 658, 83, -1, -1, 86, 87, -1, -1, 666, -1, -1, -1, 94, -1, -1, -1, -1, -1, 100, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, ! -1, 51, -1, -1, -1, -1, -1, -1, -1, 696, ! 60, -1, 699, 481, -1, -1, 66, -1, 486, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, ! 717, -1, 719, 83, -1, 722, 86, 87, -1, -1, ! 90, 91, -1, -1, 94, -1, 96, -1, -1, 736, ! -1, 45, -1, 103, 104, 105, 106, 51, 45, 109, ! 110, -1, -1, 750, 51, -1, 60, -1, 62, -1, ! 757, -1, -1, 60, 68, 62, -1, 764, -1, 766, ! -1, 68, 769, -1, 771, -1, 773, -1, -1, 83, ! -1, -1, 86, 87, -1, -1, 83, -1, -1, 86, ! 87, -1, -1, 97, -1, 1, -1, -1, -1, -1, ! 97, -1, -1, -1, 377, 378, 379, 380, 381, 382, ! 383, 384, 385, 386, 387, 388, -1, 390, 391, 392, ! 393, 394, 395, 396, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 614, 615, -1, 45, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, ! -1, -1, 630, 59, 60, -1, -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, 1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, ! 106, -1, -1, 109, 110, -1, -1, -1, 481, -1, ! -1, -1, -1, 486, 45, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, 1, -1, 77, -1, -1, -1, --- 1259,2349 ---- }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, ! 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, ! 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, ! 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, ! 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, ! 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, ! 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, ! 365 }; + # endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned short yyr1[] = { ! 0, 111, 113, 112, 114, 114, 114, 114, 114, 114, ! 115, 115, 116, 116, 116, 117, 117, 118, 119, 120, ! 121, 121, 122, 122, 123, 124, 125, 126, 126, 126, ! 126, 126, 126, 126, 126, 127, 127, 128, 128, 129, ! 129, 129, 130, 130, 131, 131, 131, 132, 132, 132, ! 133, 133, 133, 133, 134, 134, 136, 135, 137, 135, ! 135, 135, 135, 135, 138, 138, 138, 138, 139, 139, ! 139, 140, 140, 140, 141, 141, 142, 142, 143, 143, ! 143, 143, 144, 144, 144, 144, 144, 145, 145, 146, ! 146, 146, 147, 147, 147, 147, 148, 148, 148, 148, ! 148, 149, 149, 151, 150, 150, 152, 152, 152, 152, ! 152, 152, 152, 152, 152, 153, 153, 153, 153, 153, ! 154, 154, 154, 155, 155, 155, 155, 156, 157, 157, ! 157, 158, 158, 158, 159, 159, 160, 161, 163, 162, ! 164, 164, 165, 165, 166, 166, 166, 166, 167, 168, ! 168, 168, 168, 169, 169, 171, 170, 172, 170, 173, ! 170, 174, 170, 170, 170, 175, 175, 175, 175, 176, ! 176, 177, 177, 178, 178, 178, 178, 179, 180, 180, ! 181, 181, 181, 181, 182, 182, 182, 183, 183, 184, ! 185, 186, 186, 187, 187, 187, 188, 189, 189, 190, ! 190, 190, 190, 190, 190, 191, 191, 191, 191, 191, ! 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, ! 192, 193, 194, 195, 195, 196, 197, 197, 197, 197, ! 197, 197, 197, 197, 197, 197, 197, 197, 197, 198, ! 198, 198, 198, 198, 198, 198, 199, 199, 199, 199, ! 200, 201, 203, 202, 204, 204, 204, 204, 205, 205, ! 205, 205, 206, 206, 207, 208, 208, 209, 209, 209, ! 209, 209, 210, 211, 211, 211, 211, 212, 213, 214, ! 215, 215, 215, 215, 215, 216, 216, 217, 217, 217, ! 218, 219, 219, 219, 219, 220, 220, 221, 221, 221, ! 222, 222, 222, 222, 223, 223, 223, 223, 224, 224, ! 224, 224, 225, 225, 225, 226, 226, 226, 226, 226, ! 227, 228, 228, 228, 228, 229, 229, 230, 231, 231, ! 231, 231, 232, 232, 233, 233, 234, 234, 234, 234, ! 234, 234, 234, 234, 234, 234, 234, 234, 234, 235, ! 235, 235, 235, 236, 236, 236, 236, 236, 236, 236, ! 236, 236, 236, 236, 236, 236, 238, 237, 239, 237, ! 240, 240, 241, 241, 241, 242, 242, 242, 242, 242, ! 242, 242, 242, 243, 243, 244, 244, 244, 245, 245, ! 245, 246, 246, 246, 247, 247, 247, 247, 247, 247, ! 247, 247, 248, 248, 248, 248, 248, 248, 249, 249, ! 249, 249, 250, 251, 252, 252, 252, 252, 252, 253, ! 253, 253, 254, 254, 255, 255, 256, 256, 256, 256, ! 256, 256, 257, 257, 257, 257, 257, 257, 257, 257, ! 257, 258, 258, 258, 258, 258, 258, 258, 259, 259, ! 259, 259, 259, 260, 260, 260, 260, 260, 260, 260, ! 261, 261, 261, 261, 261, 261, 261, 261, 261, 261, ! 261, 262, 262, 262, 262, 262, 263, 263, 263, 264, ! 264, 264, 265, 265, 265, 266, 266, 266, 267, 267, ! 267, 268, 268, 268, 268, 268, 269, 269, 270, 270, ! 271, 271, 271, 272, 272, 273, 274 ! }; ! ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = ! { ! 0, 2, 0, 2, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 2, 2, 1, 1, 1, 3, 1, 0, 1, 1, ! 1, 2, 2, 2, 3, 1, 2, 1, 2, 3, ! 2, 3, 1, 1, 3, 2, 3, 5, 4, 5, ! 1, 1, 1, 1, 1, 2, 0, 7, 0, 6, ! 3, 2, 3, 4, 0, 2, 3, 2, 0, 2, ! 2, 1, 3, 3, 2, 3, 1, 2, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 3, 4, 1, ! 3, 3, 1, 3, 3, 4, 1, 3, 2, 3, ! 3, 1, 1, 0, 3, 2, 3, 3, 4, 4, ! 2, 3, 2, 3, 2, 3, 4, 3, 3, 3, ! 1, 3, 3, 2, 3, 2, 3, 1, 0, 2, ! 2, 1, 3, 3, 1, 1, 2, 1, 0, 3, ! 2, 3, 3, 4, 2, 3, 3, 4, 1, 4, ! 5, 7, 6, 1, 1, 0, 4, 0, 5, 0, ! 5, 0, 6, 3, 4, 2, 3, 2, 3, 2, ! 3, 1, 2, 1, 1, 1, 1, 1, 2, 2, ! 2, 3, 3, 4, 1, 3, 3, 2, 3, 1, ! 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, ! 3, 4, 4, 5, 4, 5, 6, 7, 6, 1, ! 1, 1, 1, 1, 1, 1, 5, 2, 3, 4, ! 7, 7, 0, 3, 4, 2, 3, 5, 2, 3, ! 3, 4, 1, 2, 2, 1, 2, 3, 2, 2, ! 3, 2, 4, 2, 2, 3, 4, 2, 1, 7, ! 7, 6, 3, 5, 4, 7, 6, 2, 2, 3, ! 2, 0, 1, 1, 2, 0, 1, 1, 3, 3, ! 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, ! 2, 3, 3, 2, 3, 5, 5, 2, 4, 3, ! 1, 3, 3, 4, 2, 1, 2, 2, 4, 2, ! 3, 4, 2, 2, 1, 1, 1, 1, 3, 1, ! 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 5, 4, 1, 4, 5, 5, 6, ! 3, 3, 4, 5, 2, 3, 0, 7, 0, 6, ! 3, 3, 1, 3, 3, 3, 3, 4, 4, 4, ! 4, 3, 3, 1, 2, 3, 3, 2, 2, 3, ! 3, 3, 3, 2, 3, 4, 5, 6, 5, 6, ! 4, 4, 4, 4, 3, 4, 3, 4, 1, 1, ! 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, ! 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, ! 2, 2, 5, 4, 4, 5, 4, 2, 5, 4, ! 5, 1, 3, 3, 3, 3, 3, 3, 1, 3, ! 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, ! 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 1, 3, 3, 3, 3, 1, 3, 3, 1, ! 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, ! 3, 1, 5, 4, 3, 5, 1, 1, 3, 3, ! 1, 1, 1, 1, 1, 1, 1 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned short yydefact[] = { ! 2, 0, 0, 1, 53, 54, 0, 0, 0, 0, ! 221, 3, 0, 0, 0, 35, 42, 43, 37, 0, ! 50, 51, 52, 45, 26, 0, 22, 23, 24, 0, ! 61, 0, 40, 0, 0, 36, 38, 0, 0, 55, ! 0, 0, 46, 44, 0, 163, 0, 0, 159, 62, ! 0, 68, 41, 39, 0, 0, 0, 60, 0, 48, ! 0, 25, 167, 19, 165, 17, 0, 156, 0, 0, ! 67, 18, 0, 0, 58, 164, 0, 161, 63, 68, ! 49, 47, 14, 0, 12, 13, 169, 0, 10, 11, ! 15, 16, 17, 0, 175, 177, 0, 176, 0, 171, ! 173, 174, 168, 166, 160, 66, 70, 71, 69, 0, ! 158, 0, 56, 112, 0, 128, 110, 0, 0, 89, ! 92, 128, 0, 20, 21, 114, 0, 0, 179, 178, ! 170, 172, 0, 0, 59, 162, 0, 0, 0, 0, ! 107, 98, 87, 0, 0, 0, 0, 106, 388, 0, ! 113, 128, 111, 0, 128, 73, 72, 189, 74, 22, ! 0, 84, 0, 76, 78, 82, 83, 0, 79, 0, ! 80, 138, 128, 85, 81, 0, 86, 57, 118, 115, ! 0, 127, 0, 120, 0, 130, 131, 129, 119, 117, ! 91, 0, 90, 94, 0, 0, 0, 0, 0, 0, ! 0, 337, 0, 0, 0, 0, 8, 7, 4, 5, ! 6, 9, 336, 0, 0, 409, 0, 102, 408, 334, ! 343, 339, 355, 0, 335, 340, 341, 342, 426, 410, ! 411, 419, 441, 414, 415, 417, 429, 448, 453, 460, ! 471, 476, 479, 482, 485, 488, 491, 496, 505, 497, ! 0, 101, 99, 97, 100, 390, 389, 109, 88, 108, ! 187, 0, 128, 75, 77, 105, 0, 136, 0, 140, ! 0, 0, 0, 278, 0, 0, 0, 0, 0, 0, ! 0, 0, 337, 0, 0, 10, 16, 409, 0, 127, ! 195, 0, 0, 210, 0, 191, 193, 0, 194, 199, ! 211, 0, 200, 212, 0, 201, 202, 213, 252, 0, ! 203, 0, 214, 204, 291, 0, 215, 216, 217, 219, ! 218, 0, 220, 245, 244, 0, 242, 243, 240, 241, ! 239, 125, 123, 116, 0, 0, 0, 418, 409, 340, ! 342, 416, 421, 420, 425, 424, 423, 422, 0, 393, ! 0, 0, 0, 18, 0, 430, 427, 431, 428, 437, ! 0, 409, 0, 180, 0, 184, 0, 0, 0, 0, ! 0, 0, 95, 0, 0, 364, 0, 413, 412, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 503, 504, 0, 142, 0, 141, 135, 104, 134, 189, ! 139, 0, 228, 229, 227, 247, 0, 313, 0, 302, ! 300, 0, 310, 308, 0, 274, 0, 255, 0, 324, ! 0, 288, 0, 306, 304, 0, 0, 197, 0, 224, ! 222, 0, 0, 190, 188, 192, 196, 409, 320, 223, ! 226, 0, 273, 0, 409, 293, 297, 290, 0, 0, ! 317, 0, 122, 121, 126, 124, 133, 132, 348, 352, ! 0, 392, 382, 381, 360, 0, 375, 383, 0, 376, ! 0, 361, 0, 0, 0, 20, 21, 345, 338, 181, ! 182, 0, 347, 351, 350, 394, 0, 372, 404, 0, ! 346, 349, 370, 344, 371, 391, 406, 0, 365, 0, ! 445, 442, 446, 443, 447, 444, 451, 449, 452, 450, ! 457, 454, 458, 455, 459, 456, 467, 462, 469, 464, ! 466, 461, 468, 463, 470, 0, 465, 474, 472, 475, ! 473, 478, 477, 481, 480, 484, 483, 487, 486, 490, ! 489, 494, 0, 0, 499, 498, 143, 409, 144, 0, ! 0, 148, 0, 248, 0, 314, 312, 303, 301, 311, ! 309, 275, 0, 256, 0, 0, 0, 321, 325, 0, ! 322, 289, 307, 305, 338, 0, 198, 230, 0, 0, ! 0, 253, 0, 294, 0, 282, 0, 0, 319, 0, ! 400, 401, 0, 387, 0, 384, 377, 380, 378, 379, ! 362, 354, 0, 439, 433, 436, 0, 0, 434, 186, ! 183, 185, 395, 0, 405, 402, 0, 407, 403, 356, ! 0, 493, 0, 0, 145, 0, 0, 146, 249, 0, ! 276, 272, 0, 329, 0, 333, 332, 326, 323, 327, ! 234, 0, 231, 232, 0, 0, 0, 258, 0, 262, ! 0, 265, 0, 299, 298, 284, 0, 296, 0, 318, ! 0, 398, 0, 386, 385, 0, 363, 353, 438, 432, ! 440, 435, 374, 373, 396, 0, 357, 358, 495, 492, ! 0, 147, 0, 0, 0, 246, 0, 199, 0, 206, ! 207, 0, 208, 209, 0, 257, 330, 0, 235, 0, ! 0, 233, 271, 268, 269, 506, 0, 260, 263, 0, ! 259, 0, 266, 0, 0, 283, 0, 316, 315, 399, ! 369, 0, 397, 359, 0, 149, 0, 0, 0, 225, ! 277, 0, 331, 328, 238, 236, 0, 270, 267, 261, ! 0, 281, 0, 367, 0, 0, 150, 0, 250, 0, ! 0, 237, 279, 280, 152, 0, 0, 0, 0, 151, ! 0, 0, 0, 0, 286, 0, 251, 285 }; + /* YYDEFGOTO[NTERM-NUM]. */ static const short yydefgoto[] = { ! -1, 1, 2, 212, 284, 213, 89, 90, 72, 64, ! 214, 215, 26, 27, 28, 11, 12, 13, 14, 15, ! 16, 17, 18, 448, 290, 136, 109, 51, 74, 108, ! 134, 162, 163, 164, 95, 118, 119, 120, 216, 166, ! 266, 96, 115, 182, 183, 291, 140, 187, 407, 168, ! 169, 170, 268, 171, 172, 410, 558, 559, 292, 21, ! 47, 76, 69, 111, 48, 67, 98, 99, 100, 101, ! 217, 366, 293, 175, 561, 721, 295, 296, 297, 298, ! 696, 299, 300, 301, 302, 699, 303, 304, 305, 306, ! 700, 307, 451, 308, 591, 658, 659, 660, 661, 309, ! 310, 702, 311, 312, 313, 703, 314, 315, 457, 666, ! 667, 316, 317, 318, 319, 320, 321, 322, 577, 578, ! 579, 580, 218, 219, 220, 221, 222, 731, 675, 223, ! 496, 224, 476, 477, 124, 225, 226, 227, 228, 229, ! 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, ! 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, ! 250, 402, 497, 716 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -650 static const short yypact[] = { ! -650, 33, 200, -650, -650, -650, 353, -42, 478, 491, ! -650, -650, 224, 349, 407, -650, -650, -650, -650, 601, ! -650, -650, -650, -650, -650, 15, -650, -650, -650, 358, ! -650, 214, -650, 21, 459, -650, -650, 444, 513, -650, ! -42, 502, -650, -650, 460, -650, 531, -27, 170, -650, ! 540, 283, -650, -650, -42, 590, 424, -650, 420, -650, ! 36, -650, -650, -650, -650, 300, 901, -650, 541, -27, ! -650, -650, 414, 549, -650, -650, -27, 170, -650, 283, ! -650, -650, -650, 585, -650, -650, -650, 586, 322, -650, ! -650, -650, 400, 1120, -650, -650, 71, -650, 1586, -650, ! -650, -650, -650, -650, -650, -650, -650, -650, 370, 330, ! -650, -27, -650, -650, 382, -28, -650, 137, -11, -650, ! 425, -28, 426, 438, 438, -650, 620, 633, -650, -650, ! -650, -650, 655, 1277, -650, -650, 330, 616, 684, 60, ! -650, -650, -650, 687, 1530, 87, 575, -650, -650, 93, ! -650, -28, -650, 243, -28, -650, -650, 495, -650, 510, ! 821, -650, 1355, -650, -650, -650, -650, 50, -650, 545, ! -650, -650, 632, -650, -650, 1976, -650, -650, -650, -650, ! 693, 612, 473, -650, 776, -650, -650, 609, -650, -650, ! -650, 84, -650, -650, 2784, 1188, 2845, 2896, 651, 35, ! 556, -650, 2957, 3008, 3069, 4998, -650, -650, -650, -650, ! -650, -650, -650, 573, 668, 921, 67, -650, 717, 624, ! -650, -650, -650, 697, -650, 756, -650, 867, 755, -650, ! -650, -650, -650, -650, -650, -650, -650, 942, 964, 970, ! 797, 966, 767, 801, 811, 812, 10, -650, -650, -650, ! 919, -650, -650, -650, -650, -650, -650, -650, -650, -650, ! -650, 959, 632, -650, -650, -650, 654, -650, 740, -650, ! 819, 180, 3120, -650, 121, 2173, 26, 226, 303, 316, ! 341, 141, 762, 5283, -42, 573, 668, 883, 636, 537, ! -650, 776, 783, -650, 1907, -650, -650, 761, -650, -650, ! -650, 2045, -650, -650, 780, -650, -650, -650, -650, 2045, ! -650, 2045, -650, -650, 5334, 791, -650, -650, -650, -650, ! -650, 445, -650, 372, 832, 755, 985, 991, -650, -650, ! -650, -650, 960, -650, 676, 700, 711, -650, 646, -650, ! -650, -650, -650, -650, -650, -650, -650, -650, 13, -650, ! 718, 949, 798, 798, 452, -650, -650, -650, -650, -650, ! 709, 921, 53, -650, 816, -650, 823, 23, 830, 5059, ! 2224, 587, -650, -8, 3181, -650, 485, -650, -650, 3232, ! 3293, 3344, 3405, 3456, 3517, 3568, 3629, 3680, 3741, 3792, ! 3853, 690, 3904, 3965, 4016, 4077, 4128, 4189, 4240, 2285, ! -650, -650, 4301, -650, 592, -650, -650, -650, -650, -650, ! -650, 1907, -650, -650, -650, -650, 4352, -650, 172, -650, ! -650, 211, -650, -650, 219, -650, 4413, -650, 4464, -650, ! 860, -650, 1469, -650, -650, 225, 212, 822, 658, -650, ! -650, -42, 2336, -650, -650, -650, -650, 958, 612, -650, ! -650, 831, -650, 866, 990, -650, -650, -650, 117, 2397, ! -650, 4525, -650, -650, -650, 960, -650, -650, -650, -650, ! 204, 842, -650, -650, -650, 2448, 798, -650, 660, 798, ! 660, -650, 2509, 4576, 107, 203, 439, -650, 5359, -650, ! -650, 748, -650, -650, -650, -650, 775, -650, -650, 222, ! -650, -650, -650, -650, -650, 844, -650, 249, -650, 5110, ! -650, -650, -650, -650, -650, -650, -650, 942, -650, 942, ! -650, 964, -650, 964, -650, 964, -650, 970, -650, 970, ! -650, 970, -650, 970, -650, 322, -650, -650, 797, -650, ! 797, -650, 966, -650, 767, -650, 801, -650, 811, -650, ! 812, -650, 944, 854, -650, -650, -650, 1008, -650, 1907, ! 857, -650, 1907, -650, 276, -650, -650, -650, -650, -650, ! -650, -650, 333, -650, 861, 500, 328, 860, -650, 545, ! -650, -650, -650, -650, -650, 504, 822, -650, 961, 138, ! -20, -650, 870, -650, 4973, -650, 4861, 871, 879, 895, ! -650, -650, 5171, -650, 265, -650, 438, -650, 438, -650, ! -650, 896, 151, -650, -650, -650, 4637, 1021, -650, -650, ! -650, -650, -650, 4688, -650, -650, 5222, -650, -650, 330, ! 789, -650, 4749, 713, -650, 1907, 2560, -650, -650, 2112, ! -650, -650, 346, -650, 746, -650, -650, -650, -650, -650, ! -650, 2621, -650, -650, 998, 58, 4800, -650, 603, -650, ! 1684, -650, 5283, -650, -650, -650, 922, 934, 4912, -650, ! 352, -650, 805, -650, -650, 330, -650, 924, -650, -650, ! -650, -650, -650, -650, -650, 808, -650, 330, -650, -650, ! 508, -650, 241, 156, 514, -650, 987, 996, 2112, -650, ! -650, 2112, -650, -650, 965, -650, 972, 974, -650, 1073, ! 159, -650, -650, -650, -650, -650, 433, -650, -650, 1759, ! -650, 1833, -650, 980, 2045, -650, 984, -650, -650, -650, ! -650, 330, -650, -650, 2672, -650, 258, 4352, 2045, -650, ! -650, 2733, -650, -650, -650, -650, 1084, -650, -650, -650, ! 986, -650, 2045, -650, 263, 186, -650, 356, -650, 4861, ! 997, -650, -650, -650, -650, 269, 2112, 1004, 4912, -650, ! 1046, 2112, 1010, 2112, -650, 2112, -650, -650 }; + /* YYPGOTO[NTERM-NUM]. */ static const short yypgoto[] = { ! -650, -650, -650, -650, -59, -51, 726, 3, -120, 493, ! 306, -6, 470, -650, 122, -650, 1106, 752, -650, 325, ! -650, -650, 837, 18, 517, -650, -650, 1064, 1044, -650, ! -135, -650, 967, -650, -104, -123, 989, -171, -197, -650, ! -650, -67, 760, 874, -328, -127, -58, -650, -650, -650, ! -650, -650, -650, -650, 968, -650, 174, -650, 725, 329, ! -650, -650, -650, -650, 1081, -12, -650, 1040, -650, -650, ! 332, -650, -121, 872, 845, -158, -289, -650, 827, -288, ! 139, -601, 610, -440, -650, -650, -650, -312, -650, -650, ! -650, -650, -650, -650, -650, -650, 486, 487, -614, -405, ! -650, -650, -650, -650, -650, -650, -650, -202, -650, -649, ! 829, -650, -650, -650, -650, -650, -650, -650, -650, 569, ! -650, 571, -650, -650, -650, 234, -650, -650, -650, -650, ! -407, -650, 796, 229, -38, 1110, 305, 1315, 395, 474, ! 617, 955, -90, 628, 707, -477, -650, 679, 705, 607, ! 648, 757, 758, 759, 763, 754, -650, 524, 765, 891, ! -650, -650, -61, -650 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -503 static const short yytable[] = { ! 25, 177, 456, 33, 153, 445, 463, 87, 365, 332, ! 184, 618, 174, 449, 468, 88, 42, 294, 186, 726, ! 19, 452, 52, 453, 492, 398, 138, 349, 655, 165, ! 19, 19, 19, 3, 127, 589, 349, 80, 697, 87, ! 65, 174, 88, 656, 65, 24, 722, 88, 267, 63, ! 123, 265, 19, 71, 487, 19, 19, 104, 165, 712, ! 92, 188, 65, 147, 110, 504, 167, 65, 372, 66, ! 139, 63, 128, 19, 87, 612, 63, 657, 180, 24, ! 354, 469, 88, 251, 93, 141, 88, 92, 252, 142, ! 143, 493, 92, 257, 255, 167, 259, 697, 399, 135, ! 697, 127, 630, 87, 341, 722, 345, 347, 615, 88, ! 767, 88, 356, 358, 269, 43, 93, 44, 593, 772, ! -154, 53, 419, 54, 285, 335, 65, 92, 350, 29, ! 31, 92, 65, 88, 184, 63, 81, 350, 141, 653, ! 681, 71, 433, 362, 251, 408, -103, 713, 488, 352, ! -103, 160, 676, 360, 92, 181, 92, 653, 430, 189, ! 745, 437, 56, 58, 465, 697, 61, -93, -93, 287, ! 697, 129, 697, 565, 697, 123, 61, -96, 92, -96, ! 160, 415, -96, -96, -96, -96, 253, 745, 338, 338, ! 338, 338, 256, 289, 65, 672, 338, 338, 361, 698, ! -27, 4, 180, 353, 405, 114, 148, 184, 24, 117, ! 88, 418, 567, 487, 424, 49, 467, -292, 594, 685, ! 569, 420, 436, 624, -29, 4, 582, 425, 24, 693, ! -96, 137, 441, 654, 701, -96, -96, -96, -96, 623, ! 88, 434, 652, 285, 710, 5, 677, 123, 114, 117, ! 627, 736, 623, 562, 746, 92, 6, 623, 698, 711, ! 623, 698, 7, 285, 744, 191, 673, -64, 8, 5, ! 761, 68, 566, 445, 416, 180, 9, 638, 50, 181, ! 6, 765, 664, 88, 456, 92, 7, 623, 287, 511, ! 513, 515, 8, 701, 621, 447, 701, 288, 616, 600, ! 10, 149, 191, 447, 427, 447, 601, 584, 454, 499, ! -64, 568, 289, 507, 478, 480, 707, 429, 586, 570, ! 426, 625, 485, 486, 10, 583, 698, 755, 92, 645, ! 65, 698, 181, 698, 640, 698, 73, 35, 553, 71, ! 535, 735, 431, 258, 143, 376, 445, 705, 628, -30, ! 4, 695, 181, 727, 23, 564, 456, 638, 756, 45, ! 285, 701, 35, 764, 674, 572, 701, 574, 701, 769, ! 701, 639, 91, 338, 338, 338, 338, 338, 338, 338, ! 338, 338, 338, 338, 338, 92, 338, 338, 338, 338, ! 338, 338, 338, 614, 5, 97, 421, 428, 597, 91, ! 599, 635, 54, 435, 91, 557, 191, -28, 4, 323, ! 449, 7, 157, 452, 604, 105, 288, 8, -339, -339, ! 122, 78, 46, 288, 157, 75, 133, 97, 641, 289, ! 251, 288, 445, 288, 747, 432, 751, 704, 606, 91, ! 24, 608, -254, 91, -31, 4, 460, 456, 157, 10, ! 758, 766, 5, 481, -155, 646, 456, 191, 649, -33, ! 4, 59, 173, 6, 763, 60, 91, -65, 91, 7, ! -339, 132, 471, -64, -339, 8, 137, 338, 695, 30, ! 324, 286, 338, 751, 50, 758, 508, 763, 46, 5, ! 91, 173, 32, 61, 686, 505, 704, 123, 122, 704, ! 6, 643, 54, 57, 5, 650, 7, 10, 285, 650, ! -65, 285, 8, -32, 4, 415, -64, 184, 144, 20, ! -157, 7, 748, 145, 146, 148, 679, 8, 323, 20, ! 20, 20, 62, 288, 617, 323, 149, 149, -320, 461, ! 730, 70, 102, 323, 10, 323, 482, 24, 323, 728, ! 106, 20, 733, 287, 20, 20, 287, 351, 5, 10, ! 61, 103, 683, 191, 704, 24, 107, 91, 333, 704, ! 325, 704, 20, 704, 334, 7, 254, 289, 24, 509, ! 289, 8, 39, 94, 285, 180, 113, 116, 500, 24, ! -34, 4, 260, 88, 644, 715, 753, 91, 651, 324, ! 286, 723, 734, 159, 261, 41, 324, 82, 737, 285, ! 338, 338, 22, 10, 324, 94, 324, 178, 24, 324, ! 286, 150, 22, 22, 22, 156, 338, 24, 24, 287, ! 159, -320, 159, 447, 152, 5, 24, 439, 92, 84, ! 91, 157, 85, 24, 22, 323, 39, 22, 22, 326, ! 161, 655, 7, 289, 287, 501, 155, 39, 8, 500, ! 502, 5, 181, 40, 503, 22, 656, 82, 285, 41, ! 285, 122, 24, 24, 24, 367, 757, 462, 289, 161, ! 760, 288, -24, -24, 288, 185, 138, 556, 190, 325, ! 10, 534, 447, 334, 331, 447, 325, 91, 375, 84, ! 717, 464, 85, 24, 325, 605, 325, 24, 605, 325, ! 336, 179, 466, 287, 500, 287, 324, 286, 447, 470, ! 24, 5, 374, -24, 585, 440, 501, 82, -24, -24, ! -24, 502, 447, 634, -24, 503, 637, 289, -24, 289, ! 369, 82, 24, 176, 370, 24, 447, 706, 371, 619, ! 157, 194, 195, 348, 406, 61, 205, 288, 149, 84, ! 447, 288, 85, 24, 34, 447, 38, 447, 326, 447, ! 368, 24, 176, 84, 24, 326, 85, 24, 394, 690, ! 24, 501, 288, 326, 24, 326, 502, 24, 326, 55, ! 503, 5, 327, 323, 196, 197, 323, 82, 24, 82, ! 24, 377, 378, 328, 483, 24, 325, 484, 198, 691, ! 607, 367, 609, 395, 199, 387, 388, 389, 390, 373, ! 288, 200, 125, 288, 396, 201, 397, 82, 323, 84, ! 323, 84, 85, 24, 85, 24, 409, 739, 202, 203, ! 740, 288, 204, 288, 205, 620, 288, 121, -501, -501, ! 36, 206, 207, 208, 209, 391, -153, 210, 211, 84, ! 288, 446, 85, 24, 324, 286, 39, 324, 286, 323, ! 622, 36, 82, 323, 288, 36, 623, 442, -341, -341, ! 450, 126, 329, 40, 687, 326, 151, 154, 288, 41, ! 623, 459, 36, 288, 323, 288, 475, 288, 494, 324, ! 729, 324, 323, 732, 84, 770, 623, 85, 24, 623, ! 774, 327, 776, 489, 777, 412, 413, -137, 327, 414, ! 490, 575, 328, 143, 491, 576, 327, 590, 327, 328, ! -341, 327, 323, 592, -341, 323, 602, 328, 626, 328, ! 324, 286, 328, 632, 324, 631, 5, 379, 380, 381, ! 91, 636, 82, 323, 325, 323, 642, 325, 323, -502, ! -502, 83, 652, 7, 662, 324, 286, 382, 383, 8, ! -17, 668, 323, 324, 669, -500, -500, 369, 384, 385, ! 386, 370, 392, 393, 84, 438, 323, 85, 24, 325, ! 670, 325, -368, 323, 527, 529, 531, 533, 86, 711, ! 323, 329, 323, 324, 5, 323, 324, 323, 329, 323, ! 82, 400, 401, -500, -500, 369, 329, 724, 329, 370, ! -366, 329, 680, 371, 324, 286, 324, 286, 327, 324, ! 325, -410, -410, 326, 325, 594, 326, -411, -411, 328, ! 538, 540, 84, 324, 738, 85, 24, 472, 473, 474, ! -500, -500, 369, -205, 403, 325, 370, 324, 145, 146, ! 438, 517, 519, 325, 324, 741, 330, 742, 326, 743, ! 326, 324, 82, 324, 744, 750, 324, -17, 324, 752, ! 324, 198, -500, -500, 369, 761, 762, 199, 370, 521, ! 523, 525, 371, 325, 200, -17, 325, 768, 201, 771, ! -500, -500, 369, 773, 84, 775, 370, 85, 24, 326, ! 633, 202, 203, 326, 325, 204, 325, 536, 329, 325, ! 37, 125, 79, 112, 206, 207, 208, 209, 262, 264, ! 210, 211, 192, 325, 326, 404, 560, 77, 131, 444, ! 411, 455, 326, 458, 718, 719, 647, 325, 648, 479, ! 343, 542, 550, 544, 325, 546, 689, 0, 0, 0, ! 548, 325, 0, 325, 0, 39, 325, 555, 325, 0, ! 325, 82, 326, 0, 0, 326, 327, 0, 0, 327, ! 126, 0, 40, 0, 0, 330, 0, 328, 41, 342, ! 328, 194, 330, 326, 0, 326, 0, 0, 326, 0, ! 330, 0, 330, 84, 0, 330, 85, 24, 0, 0, ! 0, 327, 326, 327, 0, 0, 0, 0, 0, 0, ! 0, 0, 328, 0, 328, 0, 326, 0, 0, 0, ! 0, 0, 0, 326, 196, 197, 0, 0, 0, 82, ! 326, 0, 326, 0, 0, 326, 0, 326, 198, 326, ! 0, 0, 327, 0, 199, 0, 327, 0, 0, 0, ! 0, 200, 0, 328, 0, 201, 329, 328, 0, 329, ! 0, 84, 0, 0, 85, 24, 0, 327, 202, 203, ! 0, 0, 204, 0, 0, 327, 0, 0, 328, 0, ! 0, 206, 207, 208, 209, 0, 328, 210, 211, 0, ! 0, 329, 330, 329, 339, 339, 339, 339, 0, 0, ! 0, 0, 339, 339, 0, 327, 0, 0, 327, 0, ! 0, 0, 5, 0, 0, 0, 328, 0, 82, 328, ! 0, 0, 0, 0, 0, 0, 327, 83, 327, 7, ! 0, 327, 329, 0, 0, 8, 329, 328, 0, 328, ! 0, 0, 328, 0, 0, 327, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 328, 329, 0, 327, ! 0, 0, 0, 157, 158, 329, 327, 10, 0, 0, ! 328, 0, 0, 327, 0, 327, 0, 328, 327, 0, ! 327, 0, 327, 0, 328, 0, 328, 0, 0, 328, ! 5, 328, 0, 328, 0, 329, 82, 0, 329, 0, ! 0, 0, 0, 0, 0, 83, 0, 7, 0, 0, ! 0, 0, 0, 8, 0, 0, 329, 0, 329, 0, ! 0, 329, 0, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 329, 0, 0, 0, 0, ! 330, 157, 263, 330, 0, 10, 0, 0, 0, 329, ! 0, 0, 0, 0, 0, 0, 329, 0, 0, 0, ! 581, 0, 0, 329, 0, 329, 0, 0, 329, 0, ! 329, 0, 329, 0, 0, 330, 0, 330, 0, 339, ! 339, 339, 339, 339, 339, 339, 339, 339, 339, 339, ! 339, 0, 339, 339, 339, 339, 339, 339, 339, 340, ! 340, 340, 340, 0, -287, -287, -287, 340, 340, 0, ! -287, 0, 0, 0, 0, 0, 330, 0, 0, -287, ! 330, 193, 0, 194, 195, -287, 0, 0, 0, 0, ! 0, 0, -287, 0, 0, 0, -287, 0, 0, 0, ! 0, 330, -287, 0, 0, -287, -287, 0, 0, 330, ! 0, 0, 0, -287, 0, 0, 0, 0, 0, -287, ! 0, 0, -287, -287, -287, -287, 196, 197, -287, -287, ! 0, 82, 0, 0, 0, 0, 0, 0, 0, 330, ! 198, 0, 330, 339, 0, 0, 199, 0, 339, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 330, 0, 330, 84, 0, 330, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 0, 205, 0, 0, 330, ! 0, 5, 0, 206, 207, 208, 209, 82, 0, 210, ! 211, 0, 0, 330, 0, 0, 83, 0, 7, 0, ! 330, 0, 0, 0, 8, 0, 0, 330, 0, 330, ! 0, 0, 330, 0, 330, 0, 330, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 130, 0, 270, 0, 0, 0, 0, ! 0, 0, 0, 0, 340, 340, 340, 340, 340, 340, ! 340, 340, 340, 340, 340, 340, 0, 340, 340, 340, ! 340, 340, 340, 340, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 339, 339, 0, 5, ! 196, 197, 655, 271, 272, 82, 273, 0, 0, 274, ! 0, 0, 339, 275, 198, 0, 0, 656, 0, 0, ! 276, 277, 8, 278, 0, 279, 280, 200, 281, 0, ! 270, 282, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 0, 0, 0, 0, 283, 0, ! 157, 720, 0, 0, 10, 0, 0, 206, 207, 208, ! 209, 0, 0, 210, 211, 0, 0, 0, 340, 0, ! 0, 0, 0, 340, 5, 196, 197, 655, 271, 272, ! 82, 273, 0, 0, 274, 0, 0, 0, 275, 198, ! 0, 0, 656, 0, 0, 276, 277, 8, 278, 0, ! 279, 280, 200, 281, 270, 0, 282, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 0, ! 0, 0, 0, 283, 0, 157, 749, 0, 0, 10, ! 0, 0, 206, 207, 208, 209, 0, 0, 210, 211, ! 0, 0, 0, 0, 0, 0, 0, 0, 5, 196, ! 197, -264, 271, 272, 82, 273, 0, 0, 274, 0, ! 0, 0, 275, 198, 0, 0, -264, 0, 0, 276, ! 277, 8, 278, 0, 279, 280, 200, 281, 270, 0, ! 282, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 0, 0, 0, 0, 283, 0, 157, ! -264, 340, 340, 10, 0, 0, 206, 207, 208, 209, ! 0, 0, 210, 211, 0, 0, 0, 340, 0, 0, ! 0, 0, 5, 196, 197, 0, 271, 272, 82, 273, ! 0, 0, 274, 0, 0, 0, 275, 198, 0, 0, ! 0, 0, 0, 276, 277, 8, 278, 270, 279, 280, ! 200, 281, 0, 0, 282, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 0, 0, 0, ! 0, 283, 0, 157, 443, 0, 0, 10, 0, 0, ! 206, 207, 208, 209, 0, 0, 210, 211, 0, 0, ! 0, 5, 196, 197, 0, 271, 272, 82, 273, 0, ! 0, 274, 0, 0, 0, 275, 198, 0, 0, 0, ! 0, 0, 276, 277, 8, 278, 270, 279, 280, 200, ! 281, 0, 0, 282, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 0, 0, 0, 0, ! 283, 0, 157, 0, 0, 0, 10, 0, 0, 206, ! 207, 208, 209, 0, 0, 210, 211, 0, 0, 0, ! 5, 196, 197, 0, 271, 272, 82, 273, 0, 0, ! 274, 0, 0, 0, 275, 198, 0, 0, 0, 0, ! 0, 276, 277, 270, 278, 0, 279, 280, 200, 281, ! 0, 0, 282, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 0, 0, 0, 0, 283, ! 0, 157, 0, 0, 0, 10, 0, 0, 206, 207, ! 208, 209, 0, 0, 210, 211, 0, 5, 196, 197, ! 0, 694, 272, 82, 273, 0, 0, 274, 0, 0, ! 0, 275, 198, 0, 422, 0, 194, 195, 276, 277, ! 0, 278, 0, 279, 280, 200, 281, 0, 0, 282, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 0, 0, 0, 0, 283, 0, 157, 0, ! 0, 0, 10, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 498, 0, 194, 195, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 0, ! 196, 197, 0, 423, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 551, 0, 194, 195, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 0, 201, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 202, 203, 0, 0, 204, 0, ! 0, 0, 0, 148, 0, 0, 0, 206, 207, 208, ! 209, 196, 197, 210, 211, 0, 82, 587, 0, 194, ! 195, 0, 0, 0, 0, 198, 0, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 0, 200, 0, ! 0, 0, 201, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 552, 202, 203, 0, 0, 204, ! 0, 0, 196, 197, 0, 0, 0, 82, 206, 207, ! 208, 209, 0, 0, 210, 211, 198, 0, 595, 0, ! 194, 195, 199, 0, 0, 0, 0, 0, 0, 200, ! 0, 0, 0, 201, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 202, 203, 0, 0, ! 204, 588, 0, 0, 0, 0, 0, 0, 0, 206, ! 207, 208, 209, 196, 197, 210, 211, 0, 82, 603, ! 0, 194, 195, 0, 0, 0, 0, 198, 0, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 0, ! 200, 0, 0, 0, 201, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 202, 203, 0, ! 0, 204, 0, 0, 196, 197, 0, 596, 0, 82, ! 206, 207, 208, 209, 0, 0, 210, 211, 198, 0, ! 610, 0, 194, 195, 199, 0, 0, 0, 0, 0, ! 0, 200, 0, 0, 0, 201, 0, 0, 0, 0, ! 0, 84, 0, 0, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 0, 0, 0, 148, 0, 0, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 587, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 611, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 708, 0, 194, 195, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 692, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 708, 0, 194, 195, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 202, 203, 0, 0, 204, 709, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 595, 0, 194, 195, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 202, 203, 0, 0, 204, 754, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 337, 0, 194, 195, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 0, ! 196, 197, 0, 759, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 344, 0, 194, 195, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 0, 201, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 202, 203, 0, 0, 204, 0, ! 0, 0, 0, 0, 0, 0, 0, 206, 207, 208, ! 209, 196, 197, 210, 211, 0, 82, 346, 0, 194, ! 195, 0, 0, 0, 0, 198, 0, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 0, 200, 0, ! 0, 0, 201, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 202, 203, 0, 0, 204, ! 0, 0, 196, 197, 0, 0, 0, 82, 206, 207, ! 208, 209, 0, 0, 210, 211, 198, 0, 355, 0, ! 194, 195, 199, 0, 0, 0, 0, 0, 0, 200, ! 0, 0, 0, 201, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 202, 203, 0, 0, ! 204, 0, 0, 0, 0, 0, 0, 0, 0, 206, ! 207, 208, 209, 196, 197, 210, 211, 0, 82, 357, ! 0, 194, 195, 0, 0, 0, 0, 198, 0, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 0, ! 200, 0, 0, 0, 201, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 202, 203, 0, ! 0, 204, 0, 0, 196, 197, 0, 0, 0, 82, ! 206, 207, 208, 209, 0, 0, 210, 211, 198, 0, ! 359, 0, 194, 195, 199, 0, 0, 0, 0, 0, ! 0, 200, 0, 0, 0, 201, 0, 0, 0, 0, ! 0, 84, 0, 0, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 417, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 0, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 506, 0, 194, 195, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 0, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 510, 0, 194, 195, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 202, 203, 0, 0, 204, 0, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 512, 0, 194, 195, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 202, 203, 0, 0, 204, 0, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 514, 0, 194, 195, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 0, ! 196, 197, 0, 0, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 516, 0, 194, 195, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 0, 201, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 202, 203, 0, 0, 204, 0, ! 0, 0, 0, 0, 0, 0, 0, 206, 207, 208, ! 209, 196, 197, 210, 211, 0, 82, 518, 0, 194, ! 195, 0, 0, 0, 0, 198, 0, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 0, 200, 0, ! 0, 0, 201, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 202, 203, 0, 0, 204, ! 0, 0, 196, 197, 0, 0, 0, 82, 206, 207, ! 208, 209, 0, 0, 210, 211, 198, 0, 520, 0, ! 194, 195, 199, 0, 0, 0, 0, 0, 0, 200, ! 0, 0, 0, 201, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 202, 203, 0, 0, ! 204, 0, 0, 0, 0, 0, 0, 0, 0, 206, ! 207, 208, 209, 196, 197, 210, 211, 0, 82, 522, ! 0, 194, 195, 0, 0, 0, 0, 198, 0, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 0, ! 200, 0, 0, 0, 201, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 202, 203, 0, ! 0, 204, 0, 0, 196, 197, 0, 0, 0, 82, ! 206, 207, 208, 209, 0, 0, 210, 211, 198, 0, ! 524, 0, 194, 195, 199, 0, 0, 0, 0, 0, ! 0, 200, 0, 0, 0, 201, 0, 0, 0, 0, ! 0, 84, 0, 0, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 526, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 0, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 528, 0, 194, 195, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 0, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 530, 0, 194, 195, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 202, 203, 0, 0, 204, 0, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 532, 0, 194, 195, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 202, 203, 0, 0, 204, 0, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 537, 0, 194, 195, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 0, ! 196, 197, 0, 0, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 539, 0, 194, 195, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 0, 201, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 202, 203, 0, 0, 204, 0, ! 0, 0, 0, 0, 0, 0, 0, 206, 207, 208, ! 209, 196, 197, 210, 211, 0, 82, 541, 0, 194, ! 195, 0, 0, 0, 0, 198, 0, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 0, 200, 0, ! 0, 0, 201, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 202, 203, 0, 0, 204, ! 0, 0, 196, 197, 0, 0, 0, 82, 206, 207, ! 208, 209, 0, 0, 210, 211, 198, 0, 543, 0, ! 194, 195, 199, 0, 0, 0, 0, 0, 0, 200, ! 0, 0, 0, 201, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 202, 203, 0, 0, ! 204, 0, 0, 0, 0, 0, 0, 0, 0, 206, ! 207, 208, 209, 196, 197, 210, 211, 0, 82, 545, ! 0, 194, 195, 0, 0, 0, 0, 198, 0, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 0, ! 200, 0, 0, 0, 201, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 202, 203, 0, ! 0, 204, 0, 0, 196, 197, 0, 0, 0, 82, ! 206, 207, 208, 209, 0, 0, 210, 211, 198, 0, ! 547, 0, 194, 195, 199, 0, 0, 0, 0, 0, ! 0, 200, 0, 0, 0, 201, 0, 0, 0, 0, ! 0, 84, 0, 0, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 549, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 0, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 554, 0, 194, 195, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 0, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 563, 0, 194, 195, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 202, 203, 0, 0, 204, 0, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 571, 0, 194, 195, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 202, 203, 0, 0, 204, 0, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 573, 0, 194, 195, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 0, ! 196, 197, 0, 0, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 598, 0, 194, 195, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 0, 201, 0, 0, 0, 0, 0, 84, 0, 0, ! 85, 24, 0, 0, 202, 203, 0, 0, 204, 0, ! 0, 0, 0, 0, 0, 0, 0, 206, 207, 208, ! 209, 196, 197, 210, 211, 0, 82, 613, 0, 194, ! 195, 0, 0, 0, 0, 198, 0, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 0, 200, 0, ! 0, 0, 201, 0, 0, 0, 0, 0, 84, 0, ! 0, 85, 24, 0, 0, 202, 203, 0, 0, 204, ! 0, 0, 196, 197, 0, 0, 0, 82, 206, 207, ! 208, 209, 0, 0, 210, 211, 198, 0, 678, 0, ! 194, 195, 199, 0, 0, 0, 0, 0, 0, 200, ! 0, 0, 0, 201, 0, 0, 0, 0, 0, 84, ! 0, 0, 85, 24, 0, 0, 202, 203, 0, 0, ! 204, 0, 0, 0, 0, 0, 0, 0, 0, 206, ! 207, 208, 209, 196, 197, 210, 211, 0, 82, 682, ! 0, 194, 195, 0, 0, 0, 0, 198, 0, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 0, ! 200, 0, 0, 0, 201, 0, 0, 0, 0, 0, ! 84, 0, 0, 85, 24, 0, 0, 202, 203, 0, ! 0, 204, 0, 0, 196, 197, 0, 0, 0, 82, ! 206, 207, 208, 209, 0, 0, 210, 211, 198, 0, ! 688, 0, 194, 195, 199, 0, 0, 0, 0, 0, ! 0, 200, 0, 0, 0, 201, 0, 0, 0, 0, ! 0, 84, 0, 0, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 0, 0, 0, 0, 0, 0, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 714, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 0, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 665, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 0, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 725, 0, 0, 0, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 0, 0, 0, 0, 283, -295, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 663, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 194, 195, 0, 0, 0, 283, -295, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 0, 0, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 196, 197, 200, 0, 0, 82, ! 201, 0, 0, 0, 0, 0, 84, 0, 198, 85, ! 24, 0, 194, 195, 199, 0, 0, 283, 0, 0, ! 0, 200, 0, 0, 0, 201, 206, 207, 208, 209, ! 0, 84, 210, 211, 85, 24, 0, 0, 202, 203, ! 0, 0, 204, 0, 205, 363, 0, 0, 0, 364, ! 0, 206, 207, 208, 209, 196, 197, 210, 211, 0, ! 82, 0, 0, 194, 195, 0, 0, 0, 0, 198, ! 0, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 0, 200, 0, 0, 0, 201, 0, 0, 0, ! 0, 0, 84, 0, 0, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 495, 0, 196, 197, 0, 0, ! 0, 82, 206, 207, 208, 209, 0, 0, 210, 211, ! 198, 0, 0, 0, 194, 195, 199, 0, 0, 0, ! 0, 0, 0, 200, 0, 0, 0, 201, 0, 0, ! 0, 0, 0, 84, 0, 0, 85, 24, 0, 0, ! 202, 203, 0, 0, 204, 629, 0, 0, 0, 0, ! 0, 0, 0, 206, 207, 208, 209, 196, 197, 210, ! 211, 0, 82, 0, 0, 194, 195, 0, 0, 0, ! 0, 198, 0, 0, 0, 0, 0, 199, 0, 0, ! 0, 0, 0, 0, 200, 0, 0, 0, 201, 0, ! 0, 0, 0, 0, 84, 0, 0, 85, 24, 0, ! 0, 202, 203, 0, 0, 204, 671, 0, 196, 197, ! 0, 0, 0, 82, 206, 207, 208, 209, 0, 0, ! 210, 211, 198, 0, 0, 0, 194, 195, 199, 0, ! 0, 0, 0, 0, 0, 200, 0, 0, 0, 201, ! 0, 0, 0, 0, 0, 84, 0, 0, 85, 24, ! 0, 0, 202, 203, 0, 0, 204, 684, 0, 0, ! 0, 0, 0, 0, 0, 206, 207, 208, 209, 196, ! 197, 210, 211, 0, 82, 0, 0, 0, 0, 0, ! 0, 0, 0, 198, 0, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 0, 200, 0, 0, 0, ! 201, 0, 0, 0, 0, 0, 84, 0, 0, 85, ! 24, 0, 0, 202, 203, 0, 0, 204, 0, 5, ! 196, 197, 0, 0, 0, 82, 206, 207, 208, 209, ! 0, 0, 210, 211, 198, 0, 0, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 0, 200, 0, 0, ! 82, 201, 0, 0, 0, 0, 0, 84, 0, 198, ! 85, 24, 0, 0, 0, 199, 0, 0, 283, 0, ! 0, 0, 200, 0, 0, 0, 201, 206, 207, 208, ! 209, 0, 84, 210, 211, 85, 24, 0, 0, 202, ! 203, 0, 0, 204, 0, 0, 0, 0, 0, 0, ! 0, 0, 206, 207, 208, 209, 0, 0, 210, 211 }; static const short yycheck[] = { ! 6, 136, 314, 9, 127, 294, 334, 66, 205, 180, ! 137, 488, 133, 301, 1, 66, 1, 175, 138, 668, ! 2, 309, 1, 311, 1, 15, 54, 1, 48, 133, ! 12, 13, 14, 0, 93, 442, 1, 1, 639, 98, ! 46, 162, 93, 63, 50, 87, 660, 98, 169, 46, ! 88, 1, 34, 50, 1, 37, 38, 69, 162, 1, ! 66, 1, 68, 121, 76, 73, 133, 73, 1, 96, ! 98, 68, 1, 55, 133, 482, 73, 97, 137, 87, ! 200, 68, 133, 144, 66, 1, 137, 93, 1, 100, ! 101, 68, 98, 151, 1, 162, 154, 698, 88, 111, ! 701, 160, 509, 162, 194, 719, 196, 197, 1, 160, ! 759, 162, 202, 203, 172, 100, 98, 102, 1, 768, ! 94, 100, 1, 102, 175, 184, 132, 133, 102, 7, ! 8, 137, 138, 184, 261, 132, 100, 102, 1, 1, ! 617, 138, 1, 204, 205, 266, 96, 89, 95, 200, ! 100, 133, 1, 204, 160, 137, 162, 1, 279, 99, ! 1, 284, 40, 41, 335, 766, 44, 100, 101, 175, ! 771, 100, 773, 1, 775, 213, 54, 93, 184, 95, ! 162, 1, 98, 99, 100, 101, 99, 1, 194, 195, ! 196, 197, 99, 175, 200, 602, 202, 203, 204, 639, ! 0, 1, 261, 200, 262, 83, 99, 334, 87, 87, ! 261, 272, 1, 1, 275, 1, 336, 100, 101, 626, ! 1, 100, 283, 1, 0, 1, 1, 1, 87, 636, ! 93, 94, 291, 95, 639, 98, 99, 100, 101, 101, ! 291, 100, 1, 294, 651, 45, 95, 285, 126, 127, ! 1, 95, 101, 411, 95, 261, 56, 101, 698, 1, ! 101, 701, 62, 314, 1, 143, 1, 53, 68, 45, ! 1, 101, 100, 562, 94, 334, 76, 1, 64, 261, ! 56, 95, 594, 334, 596, 291, 62, 101, 294, 379, ! 380, 381, 68, 698, 491, 301, 701, 175, 95, 95, ! 100, 98, 180, 309, 1, 311, 102, 95, 314, 370, ! 96, 100, 294, 374, 352, 353, 644, 1, 441, 100, ! 94, 99, 360, 361, 100, 100, 766, 734, 334, 1, ! 336, 771, 314, 773, 1, 775, 53, 12, 399, 336, ! 391, 100, 1, 100, 101, 223, 635, 1, 99, 0, ! 1, 639, 334, 1, 1, 416, 668, 1, 100, 1, ! 411, 766, 37, 100, 99, 426, 771, 428, 773, 100, ! 775, 95, 66, 379, 380, 381, 382, 383, 384, 385, ! 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, ! 396, 397, 398, 483, 45, 66, 274, 94, 459, 93, ! 461, 559, 102, 281, 98, 411, 284, 0, 1, 175, ! 698, 62, 96, 701, 475, 1, 294, 68, 46, 47, ! 98, 1, 64, 301, 96, 1, 96, 98, 95, 411, ! 491, 309, 721, 311, 1, 94, 724, 639, 476, 133, ! 87, 479, 96, 137, 0, 1, 1, 759, 96, 100, ! 738, 95, 45, 1, 96, 576, 768, 335, 579, 0, ! 1, 1, 133, 56, 752, 5, 160, 53, 162, 62, ! 98, 101, 350, 53, 102, 68, 94, 483, 766, 1, ! 175, 175, 488, 771, 64, 773, 1, 775, 64, 45, ! 184, 162, 1, 371, 629, 373, 698, 535, 98, 701, ! 56, 1, 102, 1, 45, 1, 62, 100, 559, 1, ! 96, 562, 68, 0, 1, 1, 96, 644, 93, 2, ! 96, 62, 89, 98, 99, 99, 616, 68, 294, 12, ! 13, 14, 1, 411, 95, 301, 98, 98, 1, 94, ! 675, 1, 1, 309, 100, 311, 94, 87, 314, 670, ! 1, 34, 687, 559, 37, 38, 562, 1, 45, 100, ! 438, 68, 623, 441, 766, 87, 73, 261, 95, 771, ! 175, 773, 55, 775, 101, 62, 1, 559, 87, 94, ! 562, 68, 45, 66, 635, 644, 1, 1, 1, 87, ! 0, 1, 97, 644, 94, 656, 731, 291, 94, 294, ! 294, 662, 94, 133, 94, 68, 301, 51, 94, 660, ! 616, 617, 2, 100, 309, 98, 311, 1, 87, 314, ! 314, 1, 12, 13, 14, 132, 632, 87, 87, 635, ! 160, 94, 162, 639, 1, 45, 87, 1, 644, 83, ! 334, 96, 86, 87, 34, 411, 45, 37, 38, 175, ! 133, 48, 62, 635, 660, 68, 1, 45, 68, 1, ! 73, 45, 644, 62, 77, 55, 63, 51, 719, 68, ! 721, 98, 87, 87, 87, 102, 737, 1, 660, 162, ! 741, 559, 46, 47, 562, 1, 54, 95, 1, 294, ! 100, 1, 698, 101, 1, 701, 301, 391, 1, 83, ! 97, 1, 86, 87, 309, 476, 311, 87, 479, 314, ! 101, 95, 1, 719, 1, 721, 411, 411, 724, 1, ! 87, 45, 98, 87, 66, 89, 68, 51, 92, 93, ! 94, 73, 738, 559, 98, 77, 562, 719, 102, 721, ! 94, 51, 87, 133, 98, 87, 752, 1, 102, 1, ! 96, 3, 4, 102, 100, 633, 96, 635, 98, 83, ! 766, 639, 86, 87, 12, 771, 14, 773, 294, 775, ! 102, 87, 162, 83, 87, 301, 86, 87, 11, 66, ! 87, 68, 660, 309, 87, 311, 73, 87, 314, 37, ! 77, 45, 175, 559, 46, 47, 562, 51, 87, 51, ! 87, 46, 47, 175, 95, 87, 411, 98, 60, 635, ! 478, 102, 480, 12, 66, 18, 19, 20, 21, 102, ! 698, 73, 1, 701, 13, 77, 14, 51, 594, 83, ! 596, 83, 86, 87, 86, 87, 96, 698, 90, 91, ! 701, 719, 94, 721, 96, 97, 724, 87, 92, 93, ! 13, 103, 104, 105, 106, 58, 94, 109, 110, 83, ! 738, 100, 86, 87, 559, 559, 45, 562, 562, 635, ! 95, 34, 51, 639, 752, 38, 101, 94, 46, 47, ! 100, 60, 175, 62, 95, 411, 126, 127, 766, 68, ! 101, 100, 55, 771, 660, 773, 98, 775, 68, 594, ! 95, 596, 668, 95, 83, 766, 101, 86, 87, 101, ! 771, 294, 773, 97, 775, 96, 97, 96, 301, 100, ! 97, 61, 294, 101, 101, 65, 309, 96, 311, 301, ! 98, 314, 698, 67, 102, 701, 94, 309, 94, 311, ! 635, 635, 314, 89, 639, 1, 45, 5, 6, 7, ! 644, 94, 51, 719, 559, 721, 95, 562, 724, 92, ! 93, 60, 1, 62, 94, 660, 660, 3, 4, 68, ! 87, 100, 738, 668, 95, 92, 93, 94, 8, 9, ! 10, 98, 16, 17, 83, 102, 752, 86, 87, 594, ! 95, 596, 96, 759, 387, 388, 389, 390, 97, 1, ! 766, 294, 768, 698, 45, 771, 701, 773, 301, 775, ! 51, 92, 93, 92, 93, 94, 309, 95, 311, 98, ! 96, 314, 1, 102, 719, 719, 721, 721, 411, 724, ! 635, 46, 47, 559, 639, 101, 562, 46, 47, 411, ! 392, 393, 83, 738, 57, 86, 87, 98, 99, 100, ! 92, 93, 94, 57, 95, 660, 98, 752, 98, 99, ! 102, 382, 383, 668, 759, 100, 175, 95, 594, 95, ! 596, 766, 51, 768, 1, 95, 771, 87, 773, 95, ! 775, 60, 92, 93, 94, 1, 100, 66, 98, 384, ! 385, 386, 102, 698, 73, 87, 701, 100, 77, 95, ! 92, 93, 94, 57, 83, 95, 98, 86, 87, 635, ! 102, 90, 91, 639, 719, 94, 721, 391, 411, 724, ! 14, 1, 58, 79, 103, 104, 105, 106, 160, 162, ! 109, 110, 143, 738, 660, 261, 411, 56, 98, 294, ! 268, 314, 668, 314, 658, 658, 577, 752, 577, 353, ! 195, 394, 398, 395, 759, 396, 632, -1, -1, -1, ! 397, 766, -1, 768, -1, 45, 771, 402, 773, -1, ! 775, 51, 698, -1, -1, 701, 559, -1, -1, 562, ! 60, -1, 62, -1, -1, 294, -1, 559, 68, 1, ! 562, 3, 301, 719, -1, 721, -1, -1, 724, -1, ! 309, -1, 311, 83, -1, 314, 86, 87, -1, -1, ! -1, 594, 738, 596, -1, -1, -1, -1, -1, -1, ! -1, -1, 594, -1, 596, -1, 752, -1, -1, -1, ! -1, -1, -1, 759, 46, 47, -1, -1, -1, 51, ! 766, -1, 768, -1, -1, 771, -1, 773, 60, 775, ! -1, -1, 635, -1, 66, -1, 639, -1, -1, -1, ! -1, 73, -1, 635, -1, 77, 559, 639, -1, 562, ! -1, 83, -1, -1, 86, 87, -1, 660, 90, 91, ! -1, -1, 94, -1, -1, 668, -1, -1, 660, -1, ! -1, 103, 104, 105, 106, -1, 668, 109, 110, -1, ! -1, 594, 411, 596, 194, 195, 196, 197, -1, -1, ! -1, -1, 202, 203, -1, 698, -1, -1, 701, -1, ! -1, -1, 45, -1, -1, -1, 698, -1, 51, 701, ! -1, -1, -1, -1, -1, -1, 719, 60, 721, 62, ! -1, 724, 635, -1, -1, 68, 639, 719, -1, 721, ! -1, -1, 724, -1, -1, 738, -1, -1, -1, -1, ! 83, -1, -1, 86, 87, -1, 738, 660, -1, 752, ! -1, -1, -1, 96, 97, 668, 759, 100, -1, -1, ! 752, -1, -1, 766, -1, 768, -1, 759, 771, -1, ! 773, -1, 775, -1, 766, -1, 768, -1, -1, 771, ! 45, 773, -1, 775, -1, 698, 51, -1, 701, -1, -1, -1, -1, -1, -1, 60, -1, 62, -1, -1, ! -1, -1, -1, 68, -1, -1, 719, -1, 721, -1, ! -1, 724, -1, -1, -1, -1, -1, -1, 83, -1, ! -1, 86, 87, -1, -1, 738, -1, -1, -1, -1, ! 559, 96, 97, 562, -1, 100, -1, -1, -1, 752, ! -1, -1, -1, -1, -1, -1, 759, -1, -1, -1, ! 1, -1, -1, 766, -1, 768, -1, -1, 771, -1, ! 773, -1, 775, -1, -1, 594, -1, 596, -1, 379, ! 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, ! 390, -1, 392, 393, 394, 395, 396, 397, 398, 194, ! 195, 196, 197, -1, 45, 46, 47, 202, 203, -1, ! 51, -1, -1, -1, -1, -1, 635, -1, -1, 60, ! 639, 1, -1, 3, 4, 66, -1, -1, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, -1, ! -1, 660, 83, -1, -1, 86, 87, -1, -1, 668, -1, -1, -1, 94, -1, -1, -1, -1, -1, 100, -1, -1, 103, 104, 105, 106, 46, 47, 109, 110, ! -1, 51, -1, -1, -1, -1, -1, -1, -1, 698, ! 60, -1, 701, 483, -1, -1, 66, -1, 488, -1, -1, -1, -1, 73, -1, -1, -1, 77, -1, -1, ! 719, -1, 721, 83, -1, 724, 86, 87, -1, -1, ! 90, 91, -1, -1, 94, -1, 96, -1, -1, 738, ! -1, 45, -1, 103, 104, 105, 106, 51, -1, 109, ! 110, -1, -1, 752, -1, -1, 60, -1, 62, -1, ! 759, -1, -1, -1, 68, -1, -1, 766, -1, 768, ! -1, -1, 771, -1, 773, -1, 775, -1, -1, 83, ! -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 97, -1, 1, -1, -1, -1, -1, ! -1, -1, -1, -1, 379, 380, 381, 382, 383, 384, ! 385, 386, 387, 388, 389, 390, -1, 392, 393, 394, ! 395, 396, 397, 398, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 616, 617, -1, 45, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, ! -1, -1, 632, 59, 60, -1, -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, -1, 1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, 97, -1, -1, 100, -1, -1, 103, 104, 105, ! 106, -1, -1, 109, 110, -1, -1, -1, 483, -1, ! -1, -1, -1, 488, 45, 46, 47, 48, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, 63, -1, -1, 66, 67, 68, 69, -1, 71, 72, 73, 74, 1, -1, 77, -1, -1, -1, *************** static const short yycheck[] = *** 2034,2041 **** 67, 68, 69, -1, 71, 72, 73, 74, 1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, ! 97, 614, 615, 100, -1, -1, 103, 104, 105, 106, ! -1, -1, 109, 110, -1, -1, -1, 630, -1, -1, -1, -1, 45, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, -1, -1, -1, 66, 67, 68, 69, 1, 71, 72, --- 2356,2363 ---- 67, 68, 69, -1, 71, 72, 73, 74, 1, -1, 77, -1, -1, -1, -1, -1, 83, -1, -1, 86, 87, -1, -1, -1, -1, -1, -1, 94, -1, 96, ! 97, 616, 617, 100, -1, -1, 103, 104, 105, 106, ! -1, -1, 109, 110, -1, -1, -1, 632, -1, -1, -1, -1, 45, 46, 47, -1, 49, 50, 51, 52, -1, -1, 55, -1, -1, -1, 59, 60, -1, -1, -1, -1, -1, 66, 67, 68, 69, 1, 71, 72, *************** static const short yycheck[] = *** 2389,2526 **** 91, -1, -1, 94, -1, -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110 }; - #define YYPURE 1 - - /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ - #line 3 "/usr/share/bison/bison.simple" - - /* Skeleton output parser for bison, - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software - Foundation, Inc. - - This program 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 2, or (at your option) - any later version. - - This program 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 this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - - /* As a special exception, when this file is copied by Bison into a - Bison output file, you may use that output file without restriction. - This special exception was added by the Free Software Foundation - in version 1.24 of Bison. */ - - /* This is the parser code that is written into each bison parser when - the %semantic_parser declaration is not specified in the grammar. - It was written by Richard Stallman by simplifying the hairy parser - used when %semantic_parser is specified. */ - - /* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - - #ifdef __cplusplus - # define YYSTD(x) std::x - #else - # define YYSTD(x) x - #endif - - #ifndef YYPARSE_RETURN_TYPE - #define YYPARSE_RETURN_TYPE int - #endif ! #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 2711,2801 ---- 91, -1, -1, 94, -1, -1, -1, -1, -1, -1, -1, -1, 103, 104, 105, 106, -1, -1, 109, 110 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned short yystos[] = { ! 0, 112, 113, 0, 1, 45, 56, 62, 68, 76, ! 100, 126, 127, 128, 129, 130, 131, 132, 133, 134, ! 135, 170, 193, 1, 87, 122, 123, 124, 125, 125, ! 1, 125, 1, 122, 128, 130, 133, 127, 128, 45, ! 62, 68, 1, 100, 102, 1, 64, 171, 175, 1, ! 64, 138, 1, 100, 102, 128, 125, 1, 125, 1, ! 5, 125, 1, 118, 120, 122, 96, 176, 101, 173, ! 1, 118, 119, 53, 139, 1, 172, 175, 1, 138, ! 1, 100, 51, 60, 83, 86, 97, 115, 116, 117, ! 118, 121, 122, 134, 135, 145, 152, 170, 177, 178, ! 179, 180, 1, 120, 176, 1, 1, 120, 140, 137, ! 176, 174, 139, 1, 125, 153, 1, 125, 146, 147, ! 148, 153, 98, 245, 245, 1, 60, 115, 1, 100, ! 97, 178, 101, 96, 141, 176, 136, 94, 54, 98, ! 157, 1, 100, 101, 93, 98, 99, 157, 99, 98, ! 1, 153, 1, 146, 153, 1, 120, 96, 97, 123, ! 134, 135, 142, 143, 144, 145, 150, 152, 160, 161, ! 162, 164, 165, 170, 183, 184, 193, 141, 1, 95, ! 115, 134, 154, 155, 156, 1, 119, 158, 1, 99, ! 1, 125, 147, 1, 3, 4, 46, 47, 60, 66, ! 73, 77, 90, 91, 94, 96, 103, 104, 105, 106, ! 109, 110, 114, 116, 121, 122, 149, 181, 233, 234, ! 235, 236, 237, 240, 242, 246, 247, 248, 249, 250, ! 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, ! 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, ! 271, 273, 1, 99, 1, 1, 99, 157, 100, 157, ! 97, 94, 165, 97, 143, 1, 151, 183, 163, 157, ! 1, 49, 50, 52, 55, 59, 66, 67, 69, 71, ! 72, 74, 77, 94, 115, 116, 121, 122, 125, 134, ! 135, 156, 169, 183, 186, 187, 188, 189, 190, 192, ! 193, 194, 195, 197, 198, 199, 200, 202, 204, 210, ! 211, 213, 214, 215, 217, 218, 222, 223, 224, 225, ! 226, 227, 228, 236, 247, 249, 250, 251, 254, 255, ! 270, 1, 148, 95, 101, 115, 101, 1, 122, 246, ! 248, 253, 1, 252, 1, 253, 1, 253, 102, 1, ! 102, 1, 116, 118, 119, 1, 253, 1, 253, 1, ! 116, 122, 273, 97, 101, 149, 182, 102, 102, 94, ! 98, 102, 1, 102, 98, 1, 125, 46, 47, 5, ! 6, 7, 3, 4, 8, 9, 10, 18, 19, 20, ! 21, 58, 16, 17, 11, 12, 13, 14, 15, 88, ! 92, 93, 272, 95, 154, 157, 100, 159, 183, 96, ! 166, 184, 96, 97, 100, 1, 94, 1, 273, 1, ! 100, 125, 1, 100, 273, 1, 94, 1, 94, 1, ! 183, 1, 94, 1, 100, 125, 273, 146, 102, 1, ! 89, 115, 94, 97, 185, 187, 100, 122, 134, 190, ! 100, 203, 190, 190, 122, 189, 198, 219, 221, 100, ! 1, 94, 1, 155, 1, 148, 1, 119, 1, 68, ! 1, 125, 98, 99, 100, 98, 243, 244, 245, 243, ! 245, 1, 94, 95, 98, 245, 245, 1, 95, 97, ! 97, 101, 1, 68, 68, 95, 241, 273, 1, 273, ! 1, 68, 73, 77, 73, 125, 1, 273, 1, 94, ! 1, 253, 1, 253, 1, 253, 1, 258, 1, 258, ! 1, 259, 1, 259, 1, 259, 1, 260, 1, 260, ! 1, 260, 1, 260, 1, 116, 117, 1, 261, 1, ! 261, 1, 262, 1, 263, 1, 264, 1, 265, 1, ! 266, 1, 89, 273, 1, 269, 95, 122, 167, 168, ! 169, 185, 186, 1, 273, 1, 100, 1, 100, 1, ! 100, 1, 273, 1, 273, 61, 65, 229, 230, 231, ! 232, 1, 1, 100, 95, 66, 146, 1, 95, 241, ! 96, 205, 67, 1, 101, 1, 100, 273, 1, 273, ! 95, 102, 94, 1, 273, 244, 245, 181, 245, 181, ! 1, 95, 241, 1, 253, 1, 95, 95, 256, 1, ! 97, 149, 95, 101, 1, 99, 94, 1, 99, 95, ! 241, 1, 89, 102, 167, 186, 94, 167, 1, 95, ! 1, 95, 95, 1, 94, 1, 183, 230, 232, 183, ! 1, 94, 1, 1, 95, 48, 63, 97, 206, 207, ! 208, 209, 94, 1, 198, 1, 220, 221, 100, 95, ! 95, 95, 241, 1, 99, 239, 1, 95, 1, 253, ! 1, 256, 1, 273, 95, 241, 141, 95, 1, 268, ! 66, 167, 95, 241, 49, 190, 191, 192, 194, 196, ! 201, 210, 212, 216, 218, 1, 1, 155, 1, 95, ! 241, 1, 1, 89, 1, 273, 274, 97, 207, 208, ! 97, 186, 209, 273, 95, 1, 220, 1, 183, 95, ! 141, 238, 95, 141, 94, 100, 95, 94, 57, 191, ! 191, 100, 95, 95, 1, 1, 95, 1, 89, 97, ! 95, 190, 95, 141, 95, 241, 100, 273, 190, 100, ! 273, 1, 100, 190, 100, 95, 95, 220, 100, 100, ! 191, 95, 220, 57, 191, 95, 191, 191 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 2528,2541 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 2803,2811 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 2544,2572 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 2814,2847 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 2574,2625 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 2849,2879 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! #else ! # define YYLEX yylex (&yylval) ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 2627,2641 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 2881,2973 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 2655,2689 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ ! /* This is the most reliable way to avoid incompatibilities ! in available built-in functions on various systems. */ ! static void ! # if defined (__STDC__) || defined (__cplusplus) ! yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) ! # else ! yymemcpy (yyto, yyfrom, yycount) ! char *yyto; ! const char *yyfrom; ! YYSIZE_T yycount; ! # endif ! { ! register const char *yyf = yyfrom; ! register char *yyt = yyto; ! register YYSIZE_T yyi = yycount; ! ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 2987,2996 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 2733,2810 **** } # endif # endif - #endif - - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); ! # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif ! /* YY_DECL_VARIABLES -- depending whether we use a pure parser, ! variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ ! int yynerrs; ! #if YYLSP_NEEDED ! # define YY_DECL_VARIABLES \ ! YY_DECL_NON_LSP_VARIABLES \ ! \ ! /* Location data for the lookahead symbol. */ \ ! YYLTYPE yylloc; #else ! # define YY_DECL_VARIABLES \ ! YY_DECL_NON_LSP_VARIABLES #endif - /* If nonreentrant, generate the variables here. */ - #if !YYPURE - YY_DECL_VARIABLES - #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ register int yystate; register int yyn; --- 3040,3165 ---- } # endif # endif + #endif /* !YYERROR_VERBOSE */ ! ! #if YYDEBUG ! /*--------------------------------. ! | Print this symbol on YYOUTPUT. | ! `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); # endif + } + else + YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); + + switch (yytype) + { + default: + break; + } + YYFPRINTF (yyoutput, ")"); + } + + #endif /* ! YYDEBUG */ + /*-----------------------------------------------. + | Release the memory associated to this symbol. | + `-----------------------------------------------*/ + + #if defined (__STDC__) || defined (__cplusplus) + static void + yydestruct (int yytype, YYSTYPE *yyvaluep) + #else + static void + yydestruct (yytype, yyvaluep) + int yytype; + YYSTYPE *yyvaluep; #endif + { + /* Pacify ``unused variable'' warnings. */ + (void) yyvaluep; ! switch (yytype) ! { ! default: ! break; ! } ! } ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); ! # else ! int yyparse (); ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void); #else ! int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! ! /*----------. ! | yyparse. | ! `----------*/ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! ! #endif ! #endif { ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ ! int yynerrs; register int yystate; register int yyn; *************** yyparse (YYPARSE_PARAM_ARG) *** 2812,2818 **** /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 3167,3173 ---- /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 2822,2828 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 3177,3183 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 2832,2862 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 3187,3205 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 2873,2881 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 3216,3222 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 2890,2896 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 3231,3237 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 2903,2935 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 3244,3272 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 2938,2964 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 3275,3298 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 2966,2972 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 3300,3305 ---- *************** yybackup: *** 2979,3066 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 3312,3366 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 3091,3132 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { - int yyi; - - YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", - yyn, yyrline[yyn]); - - /* Print the symbols being reduced, and their result. */ - for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) - YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); - YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); - } - #endif - - switch (yyn) { - - case 1: - #line 606 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" - { /* Register static variables with the garbage collector. */ ggc_add_tree_root (&label_id, 1); --- 3391,3410 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) ! { ! case 2: ! #line 606 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" { /* Register static variables with the garbage collector. */ ggc_add_tree_root (&label_id, 1); *************** case 1: *** 3149,3218 **** ggc_add_root (&ctxp_for_generation, 1, sizeof (struct parser_ctxt *), mark_parser_ctxt); ! ; ! break;} ! case 2: ! #line 631 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {; ! break;} ! case 19: ! #line 675 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree t = build_java_array_type ((yyvsp[-1].node), -1); while (--osb) t = build_unresolved_array_type (t); yyval.node = t; ! ; ! break;} ! case 20: ! #line 683 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree t = yyvsp[-1].node; while (osb--) t = build_unresolved_array_type (t); yyval.node = t; ! ; ! break;} ! case 24: ! #line 704 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = make_qualified_name (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ; ! break;} ! case 26: ! #line 713 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = NULL;; ! break;} ! case 34: ! #line 725 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL; ! ; ! break;} ! case 35: ! #line 729 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL; ! ; ! break;} ! case 38: ! #line 741 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->package = EXPR_WFL_NODE (yyvsp[-1].node); register_package (ctxp->package); ! ; ! break;} ! case 39: ! #line 746 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing name"); RECOVER;; ! break;} ! case 40: ! #line 748 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 43: ! #line 758 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree name = EXPR_WFL_NODE (yyvsp[-1].node), last_name; int i = IDENTIFIER_LENGTH (name)-1; const char *last = &IDENTIFIER_POINTER (name)[i]; --- 3427,3507 ---- ggc_add_root (&ctxp_for_generation, 1, sizeof (struct parser_ctxt *), mark_parser_ctxt); ! ;} ! break; ! ! case 3: ! #line 631 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {;} ! break; ! ! case 20: ! #line 675 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree t = build_java_array_type ((yyvsp[-1].node), -1); while (--osb) t = build_unresolved_array_type (t); yyval.node = t; ! ;} ! break; ! ! case 21: ! #line 683 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree t = yyvsp[-1].node; while (osb--) t = build_unresolved_array_type (t); yyval.node = t; ! ;} ! break; ! ! case 25: ! #line 704 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = make_qualified_name (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ;} ! break; ! ! case 27: ! #line 713 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = NULL;;} ! break; ! ! case 35: ! #line 725 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL; ! ;} ! break; ! ! case 36: ! #line 729 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL; ! ;} ! break; ! ! case 39: ! #line 741 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->package = EXPR_WFL_NODE (yyvsp[-1].node); register_package (ctxp->package); ! ;} ! break; ! ! case 40: ! #line 746 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing name"); RECOVER;;} ! break; ! ! case 41: ! #line 748 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 44: ! #line 758 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree name = EXPR_WFL_NODE (yyvsp[-1].node), last_name; int i = IDENTIFIER_LENGTH (name)-1; const char *last = &IDENTIFIER_POINTER (name)[i]; *************** case 43: *** 3236,3254 **** } else REGISTER_IMPORT (yyvsp[-1].node, last_name); ! ; ! break;} ! case 44: ! #line 784 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing name"); RECOVER;; ! break;} ! case 45: ! #line 786 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 46: ! #line 791 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree name = EXPR_WFL_NODE (yyvsp[-3].node); tree it; /* Search for duplicates. */ --- 3525,3546 ---- } else REGISTER_IMPORT (yyvsp[-1].node, last_name); ! ;} ! break; ! ! case 45: ! #line 784 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing name"); RECOVER;;} ! break; ! ! case 46: ! #line 786 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 47: ! #line 791 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree name = EXPR_WFL_NODE (yyvsp[-3].node); tree it; /* Search for duplicates. */ *************** case 46: *** 3264,3303 **** chainon (ctxp->import_demand_list, build_tree_list (yyvsp[-3].node, NULL_TREE)); } ! ; ! break;} ! case 47: ! #line 809 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'*' expected"); RECOVER;; ! break;} ! case 48: ! #line 811 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 49: ! #line 816 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (0); ; ! break;} ! case 50: ! #line 818 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (0); ; ! break;} ! case 52: ! #line 821 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYERROR_NOW; yyerror ("Class or interface declaration expected"); ! ; ! break;} ! case 53: ! #line 832 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.value = (1 << yyvsp[0].value); ! ; ! break;} ! case 54: ! #line 836 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { int acc = (1 << yyvsp[0].value); if (yyval.value & acc) parse_error_context --- 3556,3602 ---- chainon (ctxp->import_demand_list, build_tree_list (yyvsp[-3].node, NULL_TREE)); } ! ;} ! break; ! ! case 48: ! #line 809 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'*' expected"); RECOVER;;} ! break; ! ! case 49: ! #line 811 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 50: ! #line 816 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (0); ;} ! break; ! ! case 51: ! #line 818 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (0); ;} ! break; ! ! case 53: ! #line 821 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYERROR_NOW; yyerror ("Class or interface declaration expected"); ! ;} ! break; ! ! case 54: ! #line 832 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.value = (1 << yyvsp[0].value); ! ;} ! break; ! ! case 55: ! #line 836 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { int acc = (1 << yyvsp[0].value); if (yyval.value & acc) parse_error_context *************** case 54: *** 3307,3498 **** { yyval.value |= acc; } ! ; ! break;} ! case 55: ! #line 852 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_class (yyvsp[-4].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 56: ! #line 854 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {;; ! break;} ! case 57: ! #line 856 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_class (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 58: ! #line 858 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {;; ! break;} ! case 59: ! #line 860 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing class name"); RECOVER;; ! break;} ! case 60: ! #line 862 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing class name"); RECOVER;; ! break;} ! case 61: ! #line 864 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (!ctxp->class_err) yyerror ("'{' expected"); DRECOVER(class1); ! ; ! break;} ! case 62: ! #line 869 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER;; ! break;} ! case 63: ! #line 873 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL; ; ! break;} ! case 64: ! #line 875 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 65: ! #line 877 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); ctxp->class_err=1;; ! break;} ! case 66: ! #line 879 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing super class name"); ctxp->class_err=1;; ! break;} ! case 67: ! #line 883 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 68: ! #line 885 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 69: ! #line 887 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->class_err=1; yyerror ("Missing interface name"); ! ; ! break;} ! case 70: ! #line 895 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ! ; ! break;} ! case 71: ! #line 900 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ! ; ! break;} ! case 72: ! #line 905 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing interface name"); RECOVER;; ! break;} ! case 73: ! #line 910 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (flag_emit_xref) DECL_END_SOURCE_LINE (GET_CPC ()) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = GET_CPC (); ! ; ! break;} ! case 74: ! #line 918 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (flag_emit_xref) DECL_END_SOURCE_LINE (GET_CPC ()) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = GET_CPC (); ! ; ! break;} ! case 80: ! #line 937 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (yyvsp[0].node != empty_stmt_node) { TREE_CHAIN (yyvsp[0].node) = CPC_INSTANCE_INITIALIZER_STMT (ctxp); SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, yyvsp[0].node); } ! ; ! break;} ! case 83: ! #line 950 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (1); ; ! break;} ! case 84: ! #line 952 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (1); ; ! break;} ! case 86: ! #line 959 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { register_fields (0, yyvsp[-2].node, yyvsp[-1].node); ; ! break;} ! case 87: ! #line 961 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s' for field declaration", yyvsp[-3].value, FIELD_MODIFIERS); check_modifiers_consistency (yyvsp[-3].value); register_fields (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node); ! ; ! break;} ! case 89: ! #line 974 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 90: ! #line 976 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 91: ! #line 981 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ; ! break;} ! case 92: ! #line 983 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (java_error_count) yyvsp[0].node = NULL_TREE; yyval.node = build_tree_list (yyvsp[-2].node, build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node)); ! ; ! break;} ! case 93: ! #line 990 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing variable initializer"); yyval.node = build_tree_list (yyvsp[-2].node, NULL_TREE); RECOVER; ! ; ! break;} ! case 94: ! #line 996 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("';' expected"); yyval.node = build_tree_list (yyvsp[-3].node, NULL_TREE); RECOVER; ! ; ! break;} ! case 96: ! #line 1006 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_unresolved_array_type (yyvsp[-2].node); ; ! break;} ! case 97: ! #line 1008 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid declaration"); DRECOVER(vdi);; ! break;} ! case 98: ! #line 1010 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree node = java_lval.node; if (node && (TREE_CODE (node) == INTEGER_CST || TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)) --- 3606,3831 ---- { yyval.value |= acc; } ! ;} ! break; ! ! case 56: ! #line 852 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_class (yyvsp[-4].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 57: ! #line 854 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {;;} ! break; ! ! case 58: ! #line 856 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_class (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 59: ! #line 858 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {;;} ! break; ! ! case 60: ! #line 860 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing class name"); RECOVER;;} ! break; ! ! case 61: ! #line 862 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing class name"); RECOVER;;} ! break; ! ! case 62: ! #line 864 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (!ctxp->class_err) yyerror ("'{' expected"); DRECOVER(class1); ! ;} ! break; ! ! case 63: ! #line 869 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 64: ! #line 873 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL; ;} ! break; ! ! case 65: ! #line 875 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 66: ! #line 877 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); ctxp->class_err=1;;} ! break; ! ! case 67: ! #line 879 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing super class name"); ctxp->class_err=1;;} ! break; ! ! case 68: ! #line 883 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 69: ! #line 885 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 70: ! #line 887 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->class_err=1; yyerror ("Missing interface name"); ! ;} ! break; ! ! case 71: ! #line 895 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ! ;} ! break; ! ! case 72: ! #line 900 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ! ;} ! break; ! ! case 73: ! #line 905 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing interface name"); RECOVER;;} ! break; ! ! case 74: ! #line 910 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (flag_emit_xref) DECL_END_SOURCE_LINE (GET_CPC ()) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = GET_CPC (); ! ;} ! break; ! ! case 75: ! #line 918 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (flag_emit_xref) DECL_END_SOURCE_LINE (GET_CPC ()) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = GET_CPC (); ! ;} ! break; ! ! case 81: ! #line 937 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (yyvsp[0].node != empty_stmt_node) { TREE_CHAIN (yyvsp[0].node) = CPC_INSTANCE_INITIALIZER_STMT (ctxp); SET_CPC_INSTANCE_INITIALIZER_STMT (ctxp, yyvsp[0].node); } ! ;} ! break; ! ! case 84: ! #line 950 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (1); ;} ! break; ! ! case 85: ! #line 952 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (1); ;} ! break; ! ! case 87: ! #line 959 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { register_fields (0, yyvsp[-2].node, yyvsp[-1].node); ;} ! break; ! ! case 88: ! #line 961 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s' for field declaration", yyvsp[-3].value, FIELD_MODIFIERS); check_modifiers_consistency (yyvsp[-3].value); register_fields (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node); ! ;} ! break; ! ! case 90: ! #line 974 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 91: ! #line 976 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 92: ! #line 981 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ;} ! break; ! ! case 93: ! #line 983 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (java_error_count) yyvsp[0].node = NULL_TREE; yyval.node = build_tree_list (yyvsp[-2].node, build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node)); ! ;} ! break; ! ! case 94: ! #line 990 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing variable initializer"); yyval.node = build_tree_list (yyvsp[-2].node, NULL_TREE); RECOVER; ! ;} ! break; ! ! case 95: ! #line 996 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("';' expected"); yyval.node = build_tree_list (yyvsp[-3].node, NULL_TREE); RECOVER; ! ;} ! break; ! ! case 97: ! #line 1006 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_unresolved_array_type (yyvsp[-2].node); ;} ! break; ! ! case 98: ! #line 1008 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid declaration"); DRECOVER(vdi);;} ! break; ! ! case 99: ! #line 1010 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree node = java_lval.node; if (node && (TREE_CODE (node) == INTEGER_CST || TREE_CODE (node) == EXPR_WITH_FILE_LOCATION)) *************** case 98: *** 3500,3694 **** else yyerror ("']' expected"); DRECOVER(vdi); ! ; ! break;} ! case 99: ! #line 1020 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Unbalanced ']'"); DRECOVER(vdi);; ! break;} ! case 102: ! #line 1031 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { current_function_decl = yyvsp[0].node; if (current_function_decl && TREE_CODE (current_function_decl) == FUNCTION_DECL) source_start_java_method (current_function_decl); else current_function_decl = NULL_TREE; ! ; ! break;} ! case 103: ! #line 1040 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { finish_method_declaration (yyvsp[0].node); ; ! break;} ! case 104: ! #line 1042 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;; ! break;} ! case 105: ! #line 1047 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 106: ! #line 1049 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (0, void_type_node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 107: ! #line 1051 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 108: ! #line 1053 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-3].value, void_type_node, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 109: ! #line 1055 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Invalid method declaration, method name required"); RECOVER; ! ; ! break;} ! case 110: ! #line 1060 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {RECOVER;; ! break;} ! case 111: ! #line 1062 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Identifier expected"); RECOVER;; ! break;} ! case 112: ! #line 1064 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Identifier expected"); RECOVER;; ! break;} ! case 113: ! #line 1066 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Invalid method declaration, return type required"); RECOVER; ! ; ! break;} ! case 114: ! #line 1074 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 0; yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ! ; ! break;} ! case 115: ! #line 1079 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 116: ! #line 1081 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { EXPR_WFL_LINECOL (wfl_operator) = yyvsp[-1].operator.location; TREE_PURPOSE (yyvsp[-2].node) = build_unresolved_array_type (TREE_PURPOSE (yyvsp[-2].node)); parse_warning_context (wfl_operator, "Discouraged form of returned type specification"); ! ; ! break;} ! case 117: ! #line 1090 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); DRECOVER(method_declarator);; ! break;} ! case 118: ! #line 1092 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;; ! break;} ! case 119: ! #line 1097 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 1; ! ; ! break;} ! case 120: ! #line 1101 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->formal_parameter_number += 1; yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 121: ! #line 1106 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing formal parameter term"); RECOVER; ; ! break;} ! case 122: ! #line 1111 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node); ! ; ! break;} ! case 123: ! #line 1115 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node); ARG_FINAL_P (yyval.node) = 1; ! ; ! break;} ! case 124: ! #line 1120 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing identifier"); RECOVER; yyval.node = NULL_TREE; ! ; ! break;} ! case 125: ! #line 1125 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing identifier"); RECOVER; yyval.node = NULL_TREE; ! ; ! break;} ! case 126: ! #line 1133 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s'. Only `final' was expected here", yyvsp[0].value, ACC_FINAL); if (yyvsp[0].value != ACC_FINAL) MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE); ! ; ! break;} ! case 127: ! #line 1142 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 128: ! #line 1144 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 129: ! #line 1146 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing class type term"); RECOVER;; ! break;} ! case 130: ! #line 1151 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[0].node); ; ! break;} ! case 131: ! #line 1153 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = tree_cons (yyvsp[0].node, yyvsp[0].node, yyvsp[-2].node); ; ! break;} ! case 132: ! #line 1155 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing class type term"); RECOVER;; ! break;} ! case 134: ! #line 1160 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 135: ! #line 1166 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { TREE_CHAIN (yyvsp[0].node) = CPC_STATIC_INITIALIZER_STMT (ctxp); SET_CPC_STATIC_INITIALIZER_STMT (ctxp, yyvsp[0].node); current_static_block = NULL_TREE; ! ; ! break;} ! case 136: ! #line 1175 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s' for static initializer", yyvsp[0].value, ACC_STATIC); /* Can't have a static initializer in an innerclass */ if (yyvsp[0].value | ACC_STATIC && --- 3833,4062 ---- else yyerror ("']' expected"); DRECOVER(vdi); ! ;} ! break; ! ! case 100: ! #line 1020 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Unbalanced ']'"); DRECOVER(vdi);;} ! break; ! ! case 103: ! #line 1031 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { current_function_decl = yyvsp[0].node; if (current_function_decl && TREE_CODE (current_function_decl) == FUNCTION_DECL) source_start_java_method (current_function_decl); else current_function_decl = NULL_TREE; ! ;} ! break; ! ! case 104: ! #line 1040 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { finish_method_declaration (yyvsp[0].node); ;} ! break; ! ! case 105: ! #line 1042 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 106: ! #line 1047 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 107: ! #line 1049 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (0, void_type_node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 108: ! #line 1051 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 109: ! #line 1053 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-3].value, void_type_node, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 110: ! #line 1055 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Invalid method declaration, method name required"); RECOVER; ! ;} ! break; ! ! case 111: ! #line 1060 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {RECOVER;;} ! break; ! ! case 112: ! #line 1062 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Identifier expected"); RECOVER;;} ! break; ! ! case 113: ! #line 1064 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Identifier expected"); RECOVER;;} ! break; ! ! case 114: ! #line 1066 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Invalid method declaration, return type required"); RECOVER; ! ;} ! break; ! ! case 115: ! #line 1074 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 0; yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ! ;} ! break; ! ! case 116: ! #line 1079 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 117: ! #line 1081 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { EXPR_WFL_LINECOL (wfl_operator) = yyvsp[-1].operator.location; TREE_PURPOSE (yyvsp[-2].node) = build_unresolved_array_type (TREE_PURPOSE (yyvsp[-2].node)); parse_warning_context (wfl_operator, "Discouraged form of returned type specification"); ! ;} ! break; ! ! case 118: ! #line 1090 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); DRECOVER(method_declarator);;} ! break; ! ! case 119: ! #line 1092 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;;} ! break; ! ! case 120: ! #line 1097 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 1; ! ;} ! break; ! ! case 121: ! #line 1101 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->formal_parameter_number += 1; yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 122: ! #line 1106 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing formal parameter term"); RECOVER; ;} ! break; ! ! case 123: ! #line 1111 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node); ! ;} ! break; ! ! case 124: ! #line 1115 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node); ARG_FINAL_P (yyval.node) = 1; ! ;} ! break; ! ! case 125: ! #line 1120 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing identifier"); RECOVER; yyval.node = NULL_TREE; ! ;} ! break; ! ! case 126: ! #line 1125 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing identifier"); RECOVER; yyval.node = NULL_TREE; ! ;} ! break; ! ! case 127: ! #line 1133 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s'. Only `final' was expected here", yyvsp[0].value, ACC_FINAL); if (yyvsp[0].value != ACC_FINAL) MODIFIER_WFL (FINAL_TK) = build_wfl_node (NULL_TREE); ! ;} ! break; ! ! case 128: ! #line 1142 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 129: ! #line 1144 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 130: ! #line 1146 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing class type term"); RECOVER;;} ! break; ! ! case 131: ! #line 1151 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[0].node); ;} ! break; ! ! case 132: ! #line 1153 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = tree_cons (yyvsp[0].node, yyvsp[0].node, yyvsp[-2].node); ;} ! break; ! ! case 133: ! #line 1155 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing class type term"); RECOVER;;} ! break; ! ! case 135: ! #line 1160 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 136: ! #line 1166 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { TREE_CHAIN (yyvsp[0].node) = CPC_STATIC_INITIALIZER_STMT (ctxp); SET_CPC_STATIC_INITIALIZER_STMT (ctxp, yyvsp[0].node); current_static_block = NULL_TREE; ! ;} ! break; ! ! case 137: ! #line 1175 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { check_modifiers ("Illegal modifier `%s' for static initializer", yyvsp[0].value, ACC_STATIC); /* Can't have a static initializer in an innerclass */ if (yyvsp[0].value | ACC_STATIC && *************** case 136: *** 3698,3937 **** "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes", IDENTIFIER_POINTER (DECL_NAME (GET_CPC ()))); SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[0].value)); ! ; ! break;} ! case 137: ! #line 1191 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { current_function_decl = yyvsp[0].node; source_start_java_method (current_function_decl); ! ; ! break;} ! case 138: ! #line 1196 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { finish_method_declaration (yyvsp[0].node); ; ! break;} ! case 139: ! #line 1201 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (0, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 140: ! #line 1203 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-2].value, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 141: ! #line 1208 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 0; yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ! ; ! break;} ! case 142: ! #line 1213 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 143: ! #line 1221 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { BLOCK_EXPR_BODY (yyvsp[0].node) = empty_stmt_node; yyval.node = yyvsp[0].node; ! ; ! break;} ! case 144: ! #line 1226 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 145: ! #line 1228 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 146: ! #line 1230 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 148: ! #line 1240 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-3].node, NULL_TREE); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-3].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ! ; ! break;} ! case 149: ! #line 1246 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-4].node, yyvsp[-2].node); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-4].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ! ; ! break;} ! case 150: ! #line 1254 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ; ! break;} ! case 151: ! #line 1256 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ; ! break;} ! case 152: ! #line 1261 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree wfl = build_wfl_node (this_identifier_node); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ! ; ! break;} ! case 153: ! #line 1267 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree wfl = build_wfl_node (super_identifier_node); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ! ; ! break;} ! case 154: ! #line 1278 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_interface (0, yyvsp[0].node, NULL_TREE); ; ! break;} ! case 155: ! #line 1280 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ; ; ! break;} ! case 156: ! #line 1282 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_interface (yyvsp[-2].value, yyvsp[0].node, NULL_TREE); ; ! break;} ! case 157: ! #line 1284 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ; ; ! break;} ! case 158: ! #line 1286 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_interface (0, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 159: ! #line 1288 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ; ; ! break;} ! case 160: ! #line 1290 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_interface (yyvsp[-3].value, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 161: ! #line 1292 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ; ; ! break;} ! case 162: ! #line 1294 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;; ! break;} ! case 163: ! #line 1296 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;; ! break;} ! case 164: ! #line 1301 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ! ; ! break;} ! case 165: ! #line 1306 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ! ; ! break;} ! case 166: ! #line 1311 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid interface type"); RECOVER;; ! break;} ! case 167: ! #line 1313 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 168: ! #line 1318 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 169: ! #line 1320 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 174: ! #line 1332 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (1); ; ! break;} ! case 175: ! #line 1334 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { end_class_declaration (1); ; ! break;} ! case 177: ! #line 1343 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { check_abstract_method_header (yyvsp[-1].node); current_function_decl = NULL_TREE; /* FIXME ? */ ! ; ! break;} ! case 178: ! #line 1348 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 179: ! #line 1354 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-1].operator.location, NULL_TREE); ; ! break;} ! case 180: ! #line 1356 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-2].operator.location, NULL_TREE); ; ! break;} ! case 181: ! #line 1358 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-2].operator.location, yyvsp[-1].node); ; ! break;} ! case 182: ! #line 1360 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-3].operator.location, yyvsp[-2].node); ; ! break;} ! case 183: ! #line 1365 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = tree_cons (maybe_build_array_element_wfl (yyvsp[0].node), yyvsp[0].node, NULL_TREE); ! ; ! break;} ! case 184: ! #line 1370 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = tree_cons (maybe_build_array_element_wfl (yyvsp[0].node), yyvsp[0].node, yyvsp[-2].node); ! ; ! break;} ! case 185: ! #line 1374 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 186: ! #line 1380 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (current_function_decl && flag_emit_xref) DECL_END_SOURCE_LINE (current_function_decl) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = empty_stmt_node; ! ; ! break;} ! case 187: ! #line 1388 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 188: ! #line 1393 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { enter_block (); ; ! break;} ! case 189: ! #line 1398 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { maybe_absorb_scoping_blocks (); /* Store the location of the `}' when doing xrefs */ if (current_function_decl && flag_emit_xref) --- 4066,4352 ---- "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes", IDENTIFIER_POINTER (DECL_NAME (GET_CPC ()))); SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[0].value)); ! ;} ! break; ! ! case 138: ! #line 1191 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { current_function_decl = yyvsp[0].node; source_start_java_method (current_function_decl); ! ;} ! break; ! ! case 139: ! #line 1196 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { finish_method_declaration (yyvsp[0].node); ;} ! break; ! ! case 140: ! #line 1201 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (0, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 141: ! #line 1203 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_header (yyvsp[-2].value, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 142: ! #line 1208 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->formal_parameter_number = 0; yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ! ;} ! break; ! ! case 143: ! #line 1213 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 144: ! #line 1221 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { BLOCK_EXPR_BODY (yyvsp[0].node) = empty_stmt_node; yyval.node = yyvsp[0].node; ! ;} ! break; ! ! case 145: ! #line 1226 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 146: ! #line 1228 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 147: ! #line 1230 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 149: ! #line 1240 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-3].node, NULL_TREE); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-3].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ! ;} ! break; ! ! case 150: ! #line 1246 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-4].node, yyvsp[-2].node); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-4].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ! ;} ! break; ! ! case 151: ! #line 1254 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ;} ! break; ! ! case 152: ! #line 1256 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ;} ! break; ! ! case 153: ! #line 1261 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree wfl = build_wfl_node (this_identifier_node); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ! ;} ! break; ! ! case 154: ! #line 1267 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree wfl = build_wfl_node (super_identifier_node); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ! ;} ! break; ! ! case 155: ! #line 1278 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_interface (0, yyvsp[0].node, NULL_TREE); ;} ! break; ! ! case 156: ! #line 1280 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ; ;} ! break; ! ! case 157: ! #line 1282 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_interface (yyvsp[-2].value, yyvsp[0].node, NULL_TREE); ;} ! break; ! ! case 158: ! #line 1284 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ; ;} ! break; ! ! case 159: ! #line 1286 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_interface (0, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 160: ! #line 1288 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ; ;} ! break; ! ! case 161: ! #line 1290 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_interface (yyvsp[-3].value, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 162: ! #line 1292 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ; ;} ! break; ! ! case 163: ! #line 1294 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 164: ! #line 1296 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 165: ! #line 1301 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ! ;} ! break; ! ! case 166: ! #line 1306 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ! ;} ! break; ! ! case 167: ! #line 1311 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid interface type"); RECOVER;;} ! break; ! ! case 168: ! #line 1313 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 169: ! #line 1318 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 170: ! #line 1320 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 175: ! #line 1332 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (1); ;} ! break; ! ! case 176: ! #line 1334 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { end_class_declaration (1); ;} ! break; ! ! case 178: ! #line 1343 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { check_abstract_method_header (yyvsp[-1].node); current_function_decl = NULL_TREE; /* FIXME ? */ ! ;} ! break; ! ! case 179: ! #line 1348 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 180: ! #line 1354 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-1].operator.location, NULL_TREE); ;} ! break; ! ! case 181: ! #line 1356 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-2].operator.location, NULL_TREE); ;} ! break; ! ! case 182: ! #line 1358 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-2].operator.location, yyvsp[-1].node); ;} ! break; ! ! case 183: ! #line 1360 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_array_init (yyvsp[-3].operator.location, yyvsp[-2].node); ;} ! break; ! ! case 184: ! #line 1365 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = tree_cons (maybe_build_array_element_wfl (yyvsp[0].node), yyvsp[0].node, NULL_TREE); ! ;} ! break; ! ! case 185: ! #line 1370 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = tree_cons (maybe_build_array_element_wfl (yyvsp[0].node), yyvsp[0].node, yyvsp[-2].node); ! ;} ! break; ! ! case 186: ! #line 1374 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 187: ! #line 1380 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Store the location of the `}' when doing xrefs */ if (current_function_decl && flag_emit_xref) DECL_END_SOURCE_LINE (current_function_decl) = EXPR_WFL_ADD_COL (yyvsp[0].operator.location, 1); yyval.node = empty_stmt_node; ! ;} ! break; ! ! case 188: ! #line 1388 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 189: ! #line 1393 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { enter_block (); ;} ! break; ! ! case 190: ! #line 1398 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { maybe_absorb_scoping_blocks (); /* Store the location of the `}' when doing xrefs */ if (current_function_decl && flag_emit_xref) *************** case 189: *** 3940,3977 **** yyval.node = exit_block (); if (!BLOCK_SUBBLOCKS (yyval.node)) BLOCK_SUBBLOCKS (yyval.node) = empty_stmt_node; ! ; ! break;} ! case 193: ! #line 1418 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { java_method_add_stmt (current_function_decl, yyvsp[0].node); ; ! break;} ! case 194: ! #line 1420 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1; end_class_declaration (1); ! ; ! break;} ! case 196: ! #line 1432 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { declare_local_variables (0, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 197: ! #line 1434 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { declare_local_variables (yyvsp[-2].value, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 203: ! #line 1444 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = exit_block (); ; ! break;} ! case 208: ! #line 1453 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = exit_block (); ; ! break;} ! case 220: ! #line 1472 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (flag_extraneous_semicolon && ! current_static_block && (! current_function_decl || --- 4355,4399 ---- yyval.node = exit_block (); if (!BLOCK_SUBBLOCKS (yyval.node)) BLOCK_SUBBLOCKS (yyval.node) = empty_stmt_node; ! ;} ! break; ! ! case 194: ! #line 1418 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { java_method_add_stmt (current_function_decl, yyvsp[0].node); ;} ! break; ! ! case 195: ! #line 1420 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { LOCAL_CLASS_P (TREE_TYPE (GET_CPC ())) = 1; end_class_declaration (1); ! ;} ! break; ! ! case 197: ! #line 1432 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { declare_local_variables (0, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 198: ! #line 1434 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { declare_local_variables (yyvsp[-2].value, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 204: ! #line 1444 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = exit_block (); ;} ! break; ! ! case 209: ! #line 1453 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = exit_block (); ;} ! break; ! ! case 221: ! #line 1472 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (flag_extraneous_semicolon && ! current_static_block && (! current_function_decl || *************** case 220: *** 3984,4293 **** parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used"); } yyval.node = empty_stmt_node; ! ; ! break;} ! case 221: ! #line 1490 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_labeled_block (EXPR_WFL_LINECOL (yyvsp[-1].node), EXPR_WFL_NODE (yyvsp[-1].node)); pushlevel (2); push_labeled_block (yyval.node); PUSH_LABELED_BLOCK (yyval.node); ! ; ! break;} ! case 222: ! #line 1501 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_labeled_statement (yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 223: ! #line 1503 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;; ! break;} ! case 224: ! #line 1508 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_labeled_statement (yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 225: ! #line 1515 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* We have a statement. Generate a WFL around it so we can debug it */ yyval.node = build_expr_wfl (yyvsp[-1].node, input_filename, lineno, 0); /* We know we have a statement, so set the debug info to be eventually generate here. */ yyval.node = JAVA_MAYBE_GENERATE_DEBUG_INFO (yyval.node); ! ; ! break;} ! case 226: ! #line 1524 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ; ! break;} ! case 227: ! #line 1529 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ; ! break;} ! case 228: ! #line 1534 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ; ! break;} ! case 229: ! #line 1539 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 230: ! #line 1541 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { parse_ctor_invocation_error (); RECOVER; ! ; ! break;} ! case 231: ! #line 1546 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 232: ! #line 1548 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { parse_ctor_invocation_error (); RECOVER; ! ; ! break;} ! case 233: ! #line 1553 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 234: ! #line 1555 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 235: ! #line 1557 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 236: ! #line 1559 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 237: ! #line 1561 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 245: ! #line 1576 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node, NULL_TREE); ! ; ! break;} ! case 246: ! #line 1581 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 247: ! #line 1583 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 248: ! #line 1585 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 249: ! #line 1590 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 250: ! #line 1595 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 251: ! #line 1600 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { enter_block (); ! ; ! break;} ! case 252: ! #line 1604 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Make into "proper list" of COMPOUND_EXPRs. I.e. make the last statement also have its own COMPOUND_EXPR. */ maybe_absorb_scoping_blocks (); TREE_OPERAND (yyvsp[-2].node, 1) = exit_block (); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-2].node), yyvsp[-2].node); ! ; ! break;} ! case 253: ! #line 1616 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build (SWITCH_EXPR, NULL_TREE, yyvsp[-1].node, NULL_TREE); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ! ; ! break;} ! case 254: ! #line 1621 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 255: ! #line 1623 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);; ! break;} ! case 256: ! #line 1625 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;; ! break;} ! case 257: ! #line 1633 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 258: ! #line 1635 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 259: ! #line 1637 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 260: ! #line 1639 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ; ! break;} ! case 266: ! #line 1658 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree lab = build1 (CASE_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (lab) = yyvsp[-2].operator.location; java_method_add_stmt (current_function_decl, lab); ! ; ! break;} ! case 267: ! #line 1664 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree lab = build (DEFAULT_EXPR, NULL_TREE, NULL_TREE); EXPR_WFL_LINECOL (lab) = yyvsp[-1].operator.location; java_method_add_stmt (current_function_decl, lab); ! ; ! break;} ! case 268: ! #line 1670 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing or invalid constant expression"); RECOVER;; ! break;} ! case 269: ! #line 1672 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;; ! break;} ! case 270: ! #line 1674 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;; ! break;} ! case 271: ! #line 1679 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree body = build_loop_body (yyvsp[-2].operator.location, yyvsp[-1].node, 0); yyval.node = build_new_loop (body); ! ; ! break;} ! case 272: ! #line 1687 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ; ! break;} ! case 273: ! #line 1689 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;; ! break;} ! case 274: ! #line 1691 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term and ')' expected"); RECOVER;; ! break;} ! case 275: ! #line 1693 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 276: ! #line 1698 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ; ! break;} ! case 277: ! #line 1703 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree body = build_loop_body (0, NULL_TREE, 1); yyval.node = build_new_loop (body); ! ; ! break;} ! case 278: ! #line 1712 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_loop_body (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-5].node, 1); ; ! break;} ! case 279: ! #line 1717 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (TREE_CODE_CLASS (TREE_CODE (yyvsp[-4].node)) == 'c') yyvsp[-4].node = build_wfl_node (yyvsp[-4].node); yyval.node = finish_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 280: ! #line 1723 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = empty_stmt_node; ! ; ! break;} ! case 281: ! #line 1730 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid control expression"); RECOVER;; ! break;} ! case 282: ! #line 1732 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid update expression"); RECOVER;; ! break;} ! case 283: ! #line 1734 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid update expression"); RECOVER;; ! break;} ! case 284: ! #line 1739 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);; ! break;} ! case 285: ! #line 1741 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = finish_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = empty_stmt_node; ! ; ! break;} ! case 286: ! #line 1751 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* This scope defined for local variable that may be defined within the scope of the for loop */ enter_block (); ! ; ! break;} ! case 287: ! #line 1757 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); DRECOVER(for_1);; ! break;} ! case 288: ! #line 1759 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid init statement"); RECOVER;; ! break;} ! case 289: ! #line 1764 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* We now declare the loop body. The loop is declared as a for loop. */ tree body = build_loop_body (0, NULL_TREE, 0); --- 4406,4772 ---- parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used"); } yyval.node = empty_stmt_node; ! ;} ! break; ! ! case 222: ! #line 1490 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_labeled_block (EXPR_WFL_LINECOL (yyvsp[-1].node), EXPR_WFL_NODE (yyvsp[-1].node)); pushlevel (2); push_labeled_block (yyval.node); PUSH_LABELED_BLOCK (yyval.node); ! ;} ! break; ! ! case 223: ! #line 1501 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_labeled_statement (yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 224: ! #line 1503 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;;} ! break; ! ! case 225: ! #line 1508 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_labeled_statement (yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 226: ! #line 1515 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* We have a statement. Generate a WFL around it so we can debug it */ yyval.node = build_expr_wfl (yyvsp[-1].node, input_filename, lineno, 0); /* We know we have a statement, so set the debug info to be eventually generate here. */ yyval.node = JAVA_MAYBE_GENERATE_DEBUG_INFO (yyval.node); ! ;} ! break; ! ! case 227: ! #line 1524 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ;} ! break; ! ! case 228: ! #line 1529 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ;} ! break; ! ! case 229: ! #line 1534 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ! ;} ! break; ! ! case 230: ! #line 1539 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 231: ! #line 1541 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { parse_ctor_invocation_error (); RECOVER; ! ;} ! break; ! ! case 232: ! #line 1546 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 233: ! #line 1548 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { parse_ctor_invocation_error (); RECOVER; ! ;} ! break; ! ! case 234: ! #line 1553 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 235: ! #line 1555 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 236: ! #line 1557 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 237: ! #line 1559 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 238: ! #line 1561 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 246: ! #line 1576 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node, NULL_TREE); ! ;} ! break; ! ! case 247: ! #line 1581 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 248: ! #line 1583 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 249: ! #line 1585 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 250: ! #line 1590 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 251: ! #line 1595 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 252: ! #line 1600 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { enter_block (); ! ;} ! break; ! ! case 253: ! #line 1604 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Make into "proper list" of COMPOUND_EXPRs. I.e. make the last statement also have its own COMPOUND_EXPR. */ maybe_absorb_scoping_blocks (); TREE_OPERAND (yyvsp[-2].node, 1) = exit_block (); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-2].node), yyvsp[-2].node); ! ;} ! break; ! ! case 254: ! #line 1616 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build (SWITCH_EXPR, NULL_TREE, yyvsp[-1].node, NULL_TREE); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ! ;} ! break; ! ! case 255: ! #line 1621 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 256: ! #line 1623 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);;} ! break; ! ! case 257: ! #line 1625 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 258: ! #line 1633 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 259: ! #line 1635 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 260: ! #line 1637 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 261: ! #line 1639 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = NULL_TREE; ;} ! break; ! ! case 267: ! #line 1658 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree lab = build1 (CASE_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (lab) = yyvsp[-2].operator.location; java_method_add_stmt (current_function_decl, lab); ! ;} ! break; ! ! case 268: ! #line 1664 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree lab = build (DEFAULT_EXPR, NULL_TREE, NULL_TREE); EXPR_WFL_LINECOL (lab) = yyvsp[-1].operator.location; java_method_add_stmt (current_function_decl, lab); ! ;} ! break; ! ! case 269: ! #line 1670 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing or invalid constant expression"); RECOVER;;} ! break; ! ! case 270: ! #line 1672 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;;} ! break; ! ! case 271: ! #line 1674 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("':' expected"); RECOVER;;} ! break; ! ! case 272: ! #line 1679 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree body = build_loop_body (yyvsp[-2].operator.location, yyvsp[-1].node, 0); yyval.node = build_new_loop (body); ! ;} ! break; ! ! case 273: ! #line 1687 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ;} ! break; ! ! case 274: ! #line 1689 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 275: ! #line 1691 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term and ')' expected"); RECOVER;;} ! break; ! ! case 276: ! #line 1693 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 277: ! #line 1698 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ;} ! break; ! ! case 278: ! #line 1703 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree body = build_loop_body (0, NULL_TREE, 1); yyval.node = build_new_loop (body); ! ;} ! break; ! ! case 279: ! #line 1712 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_loop_body (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-5].node, 1); ;} ! break; ! ! case 280: ! #line 1717 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (TREE_CODE_CLASS (TREE_CODE (yyvsp[-4].node)) == 'c') yyvsp[-4].node = build_wfl_node (yyvsp[-4].node); yyval.node = finish_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 281: ! #line 1723 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = empty_stmt_node; ! ;} ! break; ! ! case 282: ! #line 1730 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid control expression"); RECOVER;;} ! break; ! ! case 283: ! #line 1732 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid update expression"); RECOVER;;} ! break; ! ! case 284: ! #line 1734 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid update expression"); RECOVER;;} ! break; ! ! case 285: ! #line 1739 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);;} ! break; ! ! case 286: ! #line 1741 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = finish_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = empty_stmt_node; ! ;} ! break; ! ! case 287: ! #line 1751 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* This scope defined for local variable that may be defined within the scope of the for loop */ enter_block (); ! ;} ! break; ! ! case 288: ! #line 1757 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); DRECOVER(for_1);;} ! break; ! ! case 289: ! #line 1759 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid init statement"); RECOVER;;} ! break; ! ! case 290: ! #line 1764 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* We now declare the loop body. The loop is declared as a for loop. */ tree body = build_loop_body (0, NULL_TREE, 0); *************** case 289: *** 4296,4482 **** /* The loop is added to the current block the for statement is defined within */ java_method_add_stmt (current_function_decl, yyval.node); ! ; ! break;} ! case 290: ! #line 1776 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = empty_stmt_node; ; ! break;} ! case 291: ! #line 1778 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Init statement recorded within the previously defined block scope */ yyval.node = java_method_add_stmt (current_function_decl, yyvsp[0].node); ! ; ! break;} ! case 292: ! #line 1784 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* Local variable are recorded within the previously defined block scope */ yyval.node = NULL_TREE; ! ; ! break;} ! case 293: ! #line 1790 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); DRECOVER(for_init_1);; ! break;} ! case 294: ! #line 1794 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = empty_stmt_node;; ! break;} ! case 295: ! #line 1796 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_debugable_stmt (BUILD_LOCATION (), yyvsp[0].node); ; ! break;} ! case 296: ! #line 1801 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = add_stmt_to_compound (NULL_TREE, NULL_TREE, yyvsp[0].node); ; ! break;} ! case 297: ! #line 1803 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = add_stmt_to_compound (yyvsp[-2].node, NULL_TREE, yyvsp[0].node); ; ! break;} ! case 298: ! #line 1805 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 299: ! #line 1810 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 1, NULL_TREE); ; ! break;} ! case 300: ! #line 1812 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 1, yyvsp[-1].node); ; ! break;} ! case 301: ! #line 1814 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 302: ! #line 1816 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 303: ! #line 1821 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 0, NULL_TREE); ; ! break;} ! case 304: ! #line 1823 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 0, yyvsp[-1].node); ; ! break;} ! case 305: ! #line 1825 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 306: ! #line 1827 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 307: ! #line 1832 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_return (yyvsp[-1].operator.location, NULL_TREE); ; ! break;} ! case 308: ! #line 1834 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_return (yyvsp[-2].operator.location, yyvsp[-1].node); ; ! break;} ! case 309: ! #line 1836 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 310: ! #line 1838 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 311: ! #line 1843 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build1 (THROW_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ! ; ! break;} ! case 312: ! #line 1848 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 313: ! #line 1850 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;; ! break;} ! case 314: ! #line 1855 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build (SYNCHRONIZED_EXPR, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK)); ! ; ! break;} ! case 315: ! #line 1861 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;; ! break;} ! case 316: ! #line 1863 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 317: ! #line 1865 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 318: ! #line 1867 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 319: ! #line 1872 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { check_modifiers ( "Illegal modifier `%s'. Only `synchronized' was expected here", yyvsp[0].value, ACC_SYNCHRONIZED); if (yyvsp[0].value != ACC_SYNCHRONIZED) MODIFIER_WFL (SYNCHRONIZED_TK) = build_wfl_node (NULL_TREE); ! ; ! break;} ! case 320: ! #line 1884 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 321: ! #line 1886 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_try_finally_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node); ; ! break;} ! case 322: ! #line 1888 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_try_finally_statement (yyvsp[-3].operator.location, build_try_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-1].node), yyvsp[0].node); ! ; ! break;} ! case 323: ! #line 1893 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); DRECOVER (try_statement);; ! break;} ! case 325: ! #line 1899 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node; yyval.node = yyvsp[0].node; ! ; ! break;} ! case 326: ! #line 1907 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { java_method_add_stmt (current_function_decl, yyvsp[0].node); exit_block (); yyval.node = yyvsp[-1].node; ! ; ! break;} ! case 327: ! #line 1916 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { /* We add a block to define a scope for formal_parameter (CCBP). The formal parameter is declared initialized by the appropriate function --- 4775,4998 ---- /* The loop is added to the current block the for statement is defined within */ java_method_add_stmt (current_function_decl, yyval.node); ! ;} ! break; ! ! case 291: ! #line 1776 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = empty_stmt_node; ;} ! break; ! ! case 292: ! #line 1778 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Init statement recorded within the previously defined block scope */ yyval.node = java_method_add_stmt (current_function_decl, yyvsp[0].node); ! ;} ! break; ! ! case 293: ! #line 1784 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* Local variable are recorded within the previously defined block scope */ yyval.node = NULL_TREE; ! ;} ! break; ! ! case 294: ! #line 1790 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); DRECOVER(for_init_1);;} ! break; ! ! case 295: ! #line 1794 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = empty_stmt_node;;} ! break; ! ! case 296: ! #line 1796 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_debugable_stmt (BUILD_LOCATION (), yyvsp[0].node); ;} ! break; ! ! case 297: ! #line 1801 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = add_stmt_to_compound (NULL_TREE, NULL_TREE, yyvsp[0].node); ;} ! break; ! ! case 298: ! #line 1803 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = add_stmt_to_compound (yyvsp[-2].node, NULL_TREE, yyvsp[0].node); ;} ! break; ! ! case 299: ! #line 1805 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 300: ! #line 1810 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 1, NULL_TREE); ;} ! break; ! ! case 301: ! #line 1812 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 1, yyvsp[-1].node); ;} ! break; ! ! case 302: ! #line 1814 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 303: ! #line 1816 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 304: ! #line 1821 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 0, NULL_TREE); ;} ! break; ! ! case 305: ! #line 1823 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 0, yyvsp[-1].node); ;} ! break; ! ! case 306: ! #line 1825 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 307: ! #line 1827 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 308: ! #line 1832 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_return (yyvsp[-1].operator.location, NULL_TREE); ;} ! break; ! ! case 309: ! #line 1834 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_return (yyvsp[-2].operator.location, yyvsp[-1].node); ;} ! break; ! ! case 310: ! #line 1836 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 311: ! #line 1838 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 312: ! #line 1843 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build1 (THROW_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ! ;} ! break; ! ! case 313: ! #line 1848 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 314: ! #line 1850 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("';' expected"); RECOVER;;} ! break; ! ! case 315: ! #line 1855 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build (SYNCHRONIZED_EXPR, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK)); ! ;} ! break; ! ! case 316: ! #line 1861 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER;;} ! break; ! ! case 317: ! #line 1863 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 318: ! #line 1865 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 319: ! #line 1867 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 320: ! #line 1872 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { check_modifiers ( "Illegal modifier `%s'. Only `synchronized' was expected here", yyvsp[0].value, ACC_SYNCHRONIZED); if (yyvsp[0].value != ACC_SYNCHRONIZED) MODIFIER_WFL (SYNCHRONIZED_TK) = build_wfl_node (NULL_TREE); ! ;} ! break; ! ! case 321: ! #line 1884 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 322: ! #line 1886 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_try_finally_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node); ;} ! break; ! ! case 323: ! #line 1888 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_try_finally_statement (yyvsp[-3].operator.location, build_try_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-1].node), yyvsp[0].node); ! ;} ! break; ! ! case 324: ! #line 1893 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); DRECOVER (try_statement);;} ! break; ! ! case 326: ! #line 1899 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node; yyval.node = yyvsp[0].node; ! ;} ! break; ! ! case 327: ! #line 1907 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { java_method_add_stmt (current_function_decl, yyvsp[0].node); exit_block (); yyval.node = yyvsp[-1].node; ! ;} ! break; ! ! case 328: ! #line 1916 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { /* We add a block to define a scope for formal_parameter (CCBP). The formal parameter is declared initialized by the appropriate function *************** case 327: *** 4490,4625 **** init)); yyval.node = build1 (CATCH_EXPR, NULL_TREE, ccpb); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ! ; ! break;} ! case 328: ! #line 1932 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER; yyval.node = NULL_TREE;; ! break;} ! case 329: ! #line 1934 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing term or ')' expected"); RECOVER; yyval.node = NULL_TREE; ! ; ! break;} ! case 330: ! #line 1939 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; yyval.node = NULL_TREE;; ! break;} ! case 331: ! #line 1944 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ; ! break;} ! case 332: ! #line 1946 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER; ; ! break;} ! case 336: ! #line 1958 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_this (yyvsp[0].operator.location); ; ! break;} ! case 337: ! #line 1960 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = yyvsp[-1].node;; ! break;} ! case 343: ! #line 1970 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree wfl = build_wfl_node (this_identifier_node); yyval.node = make_qualified_primary (yyvsp[-2].node, wfl, EXPR_WFL_LINECOL (yyvsp[-2].node)); ! ; ! break;} ! case 344: ! #line 1975 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 345: ! #line 1977 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'class' or 'this' expected" ); RECOVER;; ! break;} ! case 346: ! #line 1979 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'class' expected" ); RECOVER;; ! break;} ! case 347: ! #line 1981 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'class' expected" ); RECOVER;; ! break;} ! case 348: ! #line 1986 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ; ! break;} ! case 349: ! #line 1988 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ; ! break;} ! case 350: ! #line 1990 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ; ! break;} ! case 351: ! #line 1992 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, void_type_node); ! ; ! break;} ! case 352: ! #line 2000 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 353: ! #line 2002 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_new_invocation (yyvsp[-2].node, NULL_TREE); ; ! break;} ! case 355: ! #line 2008 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree ctor = build_new_invocation (yyvsp[-2].node, NULL_TREE); yyval.node = make_qualified_primary (yyvsp[-3].node, ctor, EXPR_WFL_LINECOL (yyvsp[-3].node)); ! ; ! break;} ! case 357: ! #line 2015 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree ctor = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); yyval.node = make_qualified_primary (yyvsp[-4].node, ctor, EXPR_WFL_LINECOL (yyvsp[-4].node)); ! ; ! break;} ! case 359: ! #line 2022 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); DRECOVER(new_1);; ! break;} ! case 360: ! #line 2024 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 361: ! #line 2026 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' or term expected"); RECOVER;; ! break;} ! case 362: ! #line 2028 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;; ! break;} ! case 363: ! #line 2030 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;; ! break;} ! case 364: ! #line 2032 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;; ! break;} ! case 365: ! #line 2042 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_anonymous_class (yyvsp[-4].operator.location, yyvsp[-3].node); ; ! break;} ! case 366: ! #line 2044 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree id = build_wfl_node (DECL_NAME (GET_CPC ())); EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (yyvsp[-5].node); --- 5006,5169 ---- init)); yyval.node = build1 (CATCH_EXPR, NULL_TREE, ccpb); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ! ;} ! break; ! ! case 329: ! #line 1932 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER; yyval.node = NULL_TREE;;} ! break; ! ! case 330: ! #line 1934 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing term or ')' expected"); RECOVER; yyval.node = NULL_TREE; ! ;} ! break; ! ! case 331: ! #line 1939 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; yyval.node = NULL_TREE;;} ! break; ! ! case 332: ! #line 1944 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[0].node; ;} ! break; ! ! case 333: ! #line 1946 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'{' expected"); RECOVER; ;} ! break; ! ! case 337: ! #line 1958 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_this (yyvsp[0].operator.location); ;} ! break; ! ! case 338: ! #line 1960 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = yyvsp[-1].node;;} ! break; ! ! case 344: ! #line 1970 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree wfl = build_wfl_node (this_identifier_node); yyval.node = make_qualified_primary (yyvsp[-2].node, wfl, EXPR_WFL_LINECOL (yyvsp[-2].node)); ! ;} ! break; ! ! case 345: ! #line 1975 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 346: ! #line 1977 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'class' or 'this' expected" ); RECOVER;;} ! break; ! ! case 347: ! #line 1979 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'class' expected" ); RECOVER;;} ! break; ! ! case 348: ! #line 1981 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'class' expected" ); RECOVER;;} ! break; ! ! case 349: ! #line 1986 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ;} ! break; ! ! case 350: ! #line 1988 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ;} ! break; ! ! case 351: ! #line 1990 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, yyvsp[-2].node); ;} ! break; ! ! case 352: ! #line 1992 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incomplete_class_ref (yyvsp[-1].operator.location, void_type_node); ! ;} ! break; ! ! case 353: ! #line 2000 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 354: ! #line 2002 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_new_invocation (yyvsp[-2].node, NULL_TREE); ;} ! break; ! ! case 356: ! #line 2008 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree ctor = build_new_invocation (yyvsp[-2].node, NULL_TREE); yyval.node = make_qualified_primary (yyvsp[-3].node, ctor, EXPR_WFL_LINECOL (yyvsp[-3].node)); ! ;} ! break; ! ! case 358: ! #line 2015 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree ctor = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); yyval.node = make_qualified_primary (yyvsp[-4].node, ctor, EXPR_WFL_LINECOL (yyvsp[-4].node)); ! ;} ! break; ! ! case 360: ! #line 2022 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); DRECOVER(new_1);;} ! break; ! ! case 361: ! #line 2024 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 362: ! #line 2026 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' or term expected"); RECOVER;;} ! break; ! ! case 363: ! #line 2028 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("')' expected"); RECOVER;;} ! break; ! ! case 364: ! #line 2030 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;;} ! break; ! ! case 365: ! #line 2032 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'(' expected"); RECOVER;;} ! break; ! ! case 366: ! #line 2042 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_anonymous_class (yyvsp[-4].operator.location, yyvsp[-3].node); ;} ! break; ! ! case 367: ! #line 2044 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree id = build_wfl_node (DECL_NAME (GET_CPC ())); EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (yyvsp[-5].node); *************** case 366: *** 4648,4662 **** be generated for the anonymous class, with the right arguments. */ ! ; ! break;} ! case 367: ! #line 2075 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { create_anonymous_class (yyvsp[-3].operator.location, yyvsp[-2].node); ; ! break;} ! case 368: ! #line 2077 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree id = build_wfl_node (DECL_NAME (GET_CPC ())); EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (yyvsp[-4].node); --- 5192,5208 ---- be generated for the anonymous class, with the right arguments. */ ! ;} ! break; ! ! case 368: ! #line 2075 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { create_anonymous_class (yyvsp[-3].operator.location, yyvsp[-2].node); ;} ! break; ! ! case 369: ! #line 2077 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree id = build_wfl_node (DECL_NAME (GET_CPC ())); EXPR_WFL_LINECOL (id) = EXPR_WFL_LINECOL (yyvsp[-4].node); *************** case 368: *** 4667,4719 **** constructor can be generated, since its signature is already known. */ yyval.node = build_new_invocation (id, NULL_TREE); ! ; ! break;} ! case 369: ! #line 2093 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[-2].node; ; ! break;} ! case 370: ! #line 2095 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = yyvsp[-2].node; ; ! break;} ! case 371: ! #line 2100 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, NULL_TREE); ctxp->formal_parameter_number = 1; ! ; ! break;} ! case 372: ! #line 2105 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { ctxp->formal_parameter_number += 1; yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyvsp[-2].node); ! ; ! break;} ! case 373: ! #line 2110 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 374: ! #line 2115 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ; ! break;} ! case 375: ! #line 2117 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ; ! break;} ! case 376: ! #line 2119 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, pop_current_osb (ctxp));; ! break;} ! case 377: ! #line 2121 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, pop_current_osb (ctxp));; ! break;} ! case 378: ! #line 2125 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { char *sig; int osb = pop_current_osb (ctxp); while (osb--) --- 5213,5275 ---- constructor can be generated, since its signature is already known. */ yyval.node = build_new_invocation (id, NULL_TREE); ! ;} ! break; ! ! case 370: ! #line 2093 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[-2].node; ;} ! break; ! ! case 371: ! #line 2095 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = yyvsp[-2].node; ;} ! break; ! ! case 372: ! #line 2100 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, NULL_TREE); ctxp->formal_parameter_number = 1; ! ;} ! break; ! ! case 373: ! #line 2105 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { ctxp->formal_parameter_number += 1; yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyvsp[-2].node); ! ;} ! break; ! ! case 374: ! #line 2110 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 375: ! #line 2115 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ;} ! break; ! ! case 376: ! #line 2117 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ;} ! break; ! ! case 377: ! #line 2119 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, pop_current_osb (ctxp));;} ! break; ! ! case 378: ! #line 2121 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, pop_current_osb (ctxp));;} ! break; ! ! case 379: ! #line 2125 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { char *sig; int osb = pop_current_osb (ctxp); while (osb--) *************** case 378: *** 4722,4759 **** sig = obstack_finish (&temporary_obstack); yyval.node = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE, yyvsp[-2].node, get_identifier (sig), yyvsp[0].node); ! ; ! break;} ! case 379: ! #line 2136 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree type = yyvsp[-2].node; while (osb--) type = build_java_array_type (type, -1); yyval.node = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE, build_pointer_type (type), NULL_TREE, yyvsp[0].node); ! ; ! break;} ! case 380: ! #line 2145 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("'[' expected"); DRECOVER ("]");; ! break;} ! case 381: ! #line 2147 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;; ! break;} ! case 382: ! #line 2152 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_tree_list (NULL_TREE, yyvsp[0].node); ; ! break;} ! case 383: ! #line 2154 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyval.node); ; ! break;} ! case 384: ! #line 2159 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (JNUMERIC_TYPE_P (TREE_TYPE (yyvsp[-1].node))) { yyvsp[-1].node = build_wfl_node (yyvsp[-1].node); --- 5278,5321 ---- sig = obstack_finish (&temporary_obstack); yyval.node = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE, yyvsp[-2].node, get_identifier (sig), yyvsp[0].node); ! ;} ! break; ! ! case 380: ! #line 2136 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { int osb = pop_current_osb (ctxp); tree type = yyvsp[-2].node; while (osb--) type = build_java_array_type (type, -1); yyval.node = build (NEW_ANONYMOUS_ARRAY_EXPR, NULL_TREE, build_pointer_type (type), NULL_TREE, yyvsp[0].node); ! ;} ! break; ! ! case 381: ! #line 2145 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("'[' expected"); DRECOVER ("]");;} ! break; ! ! case 382: ! #line 2147 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;;} ! break; ! ! case 383: ! #line 2152 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_tree_list (NULL_TREE, yyvsp[0].node); ;} ! break; ! ! case 384: ! #line 2154 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyval.node); ;} ! break; ! ! case 385: ! #line 2159 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (JNUMERIC_TYPE_P (TREE_TYPE (yyvsp[-1].node))) { yyvsp[-1].node = build_wfl_node (yyvsp[-1].node); *************** case 384: *** 4761,4783 **** } EXPR_WFL_LINECOL (yyvsp[-1].node) = yyvsp[-2].operator.location; yyval.node = yyvsp[-1].node; ! ; ! break;} ! case 385: ! #line 2169 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;; ! break;} ! case 386: ! #line 2171 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing term"); yyerror ("']' expected"); RECOVER; ! ; ! break;} ! case 387: ! #line 2180 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { int allocate = 0; /* If not initialized, allocate memory for the osb numbers stack */ --- 5323,5348 ---- } EXPR_WFL_LINECOL (yyvsp[-1].node) = yyvsp[-2].operator.location; yyval.node = yyvsp[-1].node; ! ;} ! break; ! ! case 386: ! #line 2169 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("']' expected"); RECOVER;;} ! break; ! ! case 387: ! #line 2171 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing term"); yyerror ("']' expected"); RECOVER; ! ;} ! break; ! ! case 388: ! #line 2180 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { int allocate = 0; /* If not initialized, allocate memory for the osb numbers stack */ *************** case 387: *** 4801,4843 **** } ctxp->osb_depth++; CURRENT_OSB (ctxp) = 1; ! ; ! break;} ! case 388: ! #line 2206 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { CURRENT_OSB (ctxp)++; ; ! break;} ! case 389: ! #line 2208 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("']' expected"); RECOVER;; ! break;} ! case 390: ! #line 2213 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = make_qualified_primary (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ; ! break;} ! case 391: ! #line 2217 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree super_wfl = build_wfl_node (super_identifier_node); EXPR_WFL_LINECOL (super_wfl) = yyvsp[-2].operator.location; yyval.node = make_qualified_name (super_wfl, yyvsp[0].node, yyvsp[-1].operator.location); ! ; ! break;} ! case 392: ! #line 2223 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Field expected"); DRECOVER (super_field_acces);; ! break;} ! case 393: ! #line 2228 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-2].node, NULL_TREE); ; ! break;} ! case 394: ! #line 2230 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 395: ! #line 2232 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (TREE_CODE (yyvsp[-4].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-2].node, NULL_TREE, 0, yyvsp[-3].operator.location); --- 5366,5416 ---- } ctxp->osb_depth++; CURRENT_OSB (ctxp) = 1; ! ;} ! break; ! ! case 389: ! #line 2206 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { CURRENT_OSB (ctxp)++; ;} ! break; ! ! case 390: ! #line 2208 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("']' expected"); RECOVER;;} ! break; ! ! case 391: ! #line 2213 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = make_qualified_primary (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ;} ! break; ! ! case 392: ! #line 2217 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree super_wfl = build_wfl_node (super_identifier_node); EXPR_WFL_LINECOL (super_wfl) = yyvsp[-2].operator.location; yyval.node = make_qualified_name (super_wfl, yyvsp[0].node, yyvsp[-1].operator.location); ! ;} ! break; ! ! case 393: ! #line 2223 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Field expected"); DRECOVER (super_field_acces);;} ! break; ! ! case 394: ! #line 2228 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-2].node, NULL_TREE); ;} ! break; ! ! case 395: ! #line 2230 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 396: ! #line 2232 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (TREE_CODE (yyvsp[-4].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-2].node, NULL_TREE, 0, yyvsp[-3].operator.location); *************** case 395: *** 4846,4856 **** tree invok = build_method_invocation (yyvsp[-2].node, NULL_TREE); yyval.node = make_qualified_primary (yyvsp[-4].node, invok, yyvsp[-3].operator.location); } ! ; ! break;} ! case 396: ! #line 2243 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { if (TREE_CODE (yyvsp[-5].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-3].node, yyvsp[-1].node, 0, yyvsp[-4].operator.location); --- 5419,5430 ---- tree invok = build_method_invocation (yyvsp[-2].node, NULL_TREE); yyval.node = make_qualified_primary (yyvsp[-4].node, invok, yyvsp[-3].operator.location); } ! ;} ! break; ! ! case 397: ! #line 2243 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { if (TREE_CODE (yyvsp[-5].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-3].node, yyvsp[-1].node, 0, yyvsp[-4].operator.location); *************** case 396: *** 4859,5008 **** tree invok = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); yyval.node = make_qualified_primary (yyvsp[-5].node, invok, yyvsp[-4].operator.location); } ! ; ! break;} ! case 397: ! #line 2254 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-2].node, NULL_TREE, yyvsp[-4].operator.location, yyvsp[-3].operator.location); ! ; ! break;} ! case 398: ! #line 2259 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-3].node, yyvsp[-1].node, yyvsp[-5].operator.location, yyvsp[-4].operator.location); ! ; ! break;} ! case 399: ! #line 2268 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("'(' expected"); DRECOVER (method_invocation); ; ! break;} ! case 400: ! #line 2270 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("'(' expected"); DRECOVER (method_invocation); ; ! break;} ! case 401: ! #line 2275 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 402: ! #line 2277 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ; ! break;} ! case 403: ! #line 2279 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ! ; ! break;} ! case 404: ! #line 2284 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("']' expected"); DRECOVER(array_access); ! ; ! break;} ! case 405: ! #line 2289 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ! ; ! break;} ! case 406: ! #line 2294 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyerror ("']' expected"); DRECOVER(array_access); ! ; ! break;} ! case 411: ! #line 2309 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ; ! break;} ! case 412: ! #line 2314 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ; ! break;} ! case 415: ! #line 2321 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; ! break;} ! case 417: ! #line 2324 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 418: ! #line 2329 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { error_if_numeric_overflow (yyvsp[0].node); yyval.node = yyvsp[0].node; ! ; ! break;} ! case 419: ! #line 2334 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; ! break;} ! case 420: ! #line 2336 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 421: ! #line 2341 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ; ! break;} ! case 422: ! #line 2343 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 423: ! #line 2348 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ; ! break;} ! case 424: ! #line 2350 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 426: ! #line 2356 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; ! break;} ! case 427: ! #line 2358 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; ! break;} ! case 429: ! #line 2361 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 430: ! #line 2363 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER; ! break;} ! case 431: ! #line 2368 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { tree type = yyvsp[-3].node; int osb = pop_current_osb (ctxp); while (osb--) type = build_java_array_type (type, -1); yyval.node = build_cast (yyvsp[-4].operator.location, type, yyvsp[0].node); ! ; ! break;} ! case 432: ! #line 2376 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 433: ! #line 2378 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 434: ! #line 2380 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { const char *ptr; int osb = pop_current_osb (ctxp); obstack_grow (&temporary_obstack, --- 5433,5611 ---- tree invok = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); yyval.node = make_qualified_primary (yyvsp[-5].node, invok, yyvsp[-4].operator.location); } ! ;} ! break; ! ! case 398: ! #line 2254 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-2].node, NULL_TREE, yyvsp[-4].operator.location, yyvsp[-3].operator.location); ! ;} ! break; ! ! case 399: ! #line 2259 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-3].node, yyvsp[-1].node, yyvsp[-5].operator.location, yyvsp[-4].operator.location); ! ;} ! break; ! ! case 400: ! #line 2268 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("'(' expected"); DRECOVER (method_invocation); ;} ! break; ! ! case 401: ! #line 2270 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("'(' expected"); DRECOVER (method_invocation); ;} ! break; ! ! case 402: ! #line 2275 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 403: ! #line 2277 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ;} ! break; ! ! case 404: ! #line 2279 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ! ;} ! break; ! ! case 405: ! #line 2284 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("']' expected"); DRECOVER(array_access); ! ;} ! break; ! ! case 406: ! #line 2289 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ! ;} ! break; ! ! case 407: ! #line 2294 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyerror ("']' expected"); DRECOVER(array_access); ! ;} ! break; ! ! case 412: ! #line 2309 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ;} ! break; ! ! case 413: ! #line 2314 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ;} ! break; ! ! case 416: ! #line 2321 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;} ! break; ! ! case 418: ! #line 2324 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 419: ! #line 2329 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { error_if_numeric_overflow (yyvsp[0].node); yyval.node = yyvsp[0].node; ! ;} ! break; ! ! case 420: ! #line 2334 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;} ! break; ! ! case 421: ! #line 2336 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 422: ! #line 2341 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ;} ! break; ! ! case 423: ! #line 2343 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 424: ! #line 2348 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ;} ! break; ! ! case 425: ! #line 2350 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 427: ! #line 2356 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;} ! break; ! ! case 428: ! #line 2358 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;} ! break; ! ! case 430: ! #line 2361 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 431: ! #line 2363 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;} ! break; ! ! case 432: ! #line 2368 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { tree type = yyvsp[-3].node; int osb = pop_current_osb (ctxp); while (osb--) type = build_java_array_type (type, -1); yyval.node = build_cast (yyvsp[-4].operator.location, type, yyvsp[0].node); ! ;} ! break; ! ! case 433: ! #line 2376 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 434: ! #line 2378 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 435: ! #line 2380 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { const char *ptr; int osb = pop_current_osb (ctxp); obstack_grow (&temporary_obstack, *************** case 434: *** 5014,5321 **** ptr = obstack_finish (&temporary_obstack); EXPR_WFL_NODE (yyvsp[-3].node) = get_identifier (ptr); yyval.node = build_cast (yyvsp[-4].operator.location, yyvsp[-3].node, yyvsp[0].node); ! ; ! break;} ! case 435: ! #line 2394 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("']' expected, invalid type expression");; ! break;} ! case 436: ! #line 2396 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER; RECOVER; ! ; ! break;} ! case 437: ! #line 2401 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 438: ! #line 2403 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 439: ! #line 2405 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 441: ! #line 2411 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 442: ! #line 2416 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 443: ! #line 2421 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 444: ! #line 2426 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 445: ! #line 2428 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 446: ! #line 2430 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 448: ! #line 2436 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 449: ! #line 2441 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 450: ! #line 2446 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 451: ! #line 2448 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 453: ! #line 2454 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 454: ! #line 2459 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 455: ! #line 2464 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 456: ! #line 2469 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 457: ! #line 2471 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 458: ! #line 2473 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 460: ! #line 2479 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 461: ! #line 2484 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 462: ! #line 2489 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 463: ! #line 2494 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 464: ! #line 2499 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (INSTANCEOF_EXPR, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 465: ! #line 2501 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 466: ! #line 2503 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 467: ! #line 2505 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 468: ! #line 2507 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 469: ! #line 2509 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Invalid reference type"); RECOVER;; ! break;} ! case 471: ! #line 2515 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 472: ! #line 2520 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 473: ! #line 2525 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 474: ! #line 2527 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 476: ! #line 2533 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 477: ! #line 2538 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 479: ! #line 2544 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 480: ! #line 2549 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 482: ! #line 2555 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 483: ! #line 2560 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 485: ! #line 2566 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 486: ! #line 2571 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 488: ! #line 2577 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ; ! break;} ! case 489: ! #line 2582 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;; ! break;} ! case 491: ! #line 2588 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build (CONDITIONAL_EXPR, NULL_TREE, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ! ; ! break;} ! case 492: ! #line 2593 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYERROR_NOW; yyerror ("Missing term"); DRECOVER (1); ! ; ! break;} ! case 493: ! #line 2599 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); DRECOVER (2);; ! break;} ! case 494: ! #line 2601 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! {yyerror ("Missing term"); DRECOVER (3);; ! break;} ! case 497: ! #line 2611 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { yyval.node = build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; ! break;} ! case 498: ! #line 2613 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Missing term"); DRECOVER (assign); ! ; ! break;} ! } - #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 5617,5964 ---- ptr = obstack_finish (&temporary_obstack); EXPR_WFL_NODE (yyvsp[-3].node) = get_identifier (ptr); yyval.node = build_cast (yyvsp[-4].operator.location, yyvsp[-3].node, yyvsp[0].node); ! ;} ! break; ! ! case 436: ! #line 2394 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("']' expected, invalid type expression");;} ! break; ! ! case 437: ! #line 2396 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Invalid type expression"); RECOVER; RECOVER; ! ;} ! break; ! ! case 438: ! #line 2401 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 439: ! #line 2403 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 440: ! #line 2405 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 442: ! #line 2411 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 443: ! #line 2416 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 444: ! #line 2421 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 445: ! #line 2426 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 446: ! #line 2428 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 447: ! #line 2430 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 449: ! #line 2436 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 450: ! #line 2441 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 451: ! #line 2446 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 452: ! #line 2448 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 454: ! #line 2454 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 455: ! #line 2459 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 456: ! #line 2464 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 457: ! #line 2469 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 458: ! #line 2471 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 459: ! #line 2473 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 461: ! #line 2479 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 462: ! #line 2484 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 463: ! #line 2489 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 464: ! #line 2494 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 465: ! #line 2499 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (INSTANCEOF_EXPR, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 466: ! #line 2501 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 467: ! #line 2503 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 468: ! #line 2505 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 469: ! #line 2507 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 470: ! #line 2509 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Invalid reference type"); RECOVER;;} ! break; ! ! case 472: ! #line 2515 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 473: ! #line 2520 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 474: ! #line 2525 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 475: ! #line 2527 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 477: ! #line 2533 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 478: ! #line 2538 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 480: ! #line 2544 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 481: ! #line 2549 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 483: ! #line 2555 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 484: ! #line 2560 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 486: ! #line 2566 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 487: ! #line 2571 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 489: ! #line 2577 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ! ;} ! break; ! ! case 490: ! #line 2582 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); RECOVER;;} ! break; ! ! case 492: ! #line 2588 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build (CONDITIONAL_EXPR, NULL_TREE, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ! ;} ! break; ! ! case 493: ! #line 2593 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYERROR_NOW; yyerror ("Missing term"); DRECOVER (1); ! ;} ! break; ! ! case 494: ! #line 2599 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); DRECOVER (2);;} ! break; ! ! case 495: ! #line 2601 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! {yyerror ("Missing term"); DRECOVER (3);;} ! break; ! ! case 498: ! #line 2611 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { yyval.node = build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ;} ! break; ! ! case 499: ! #line 2613 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" ! { YYNOT_TWICE yyerror ("Missing term"); DRECOVER (assign); ! ;} ! break; + } + + /* Line 991 of yacc.c. */ + #line 5952 "p2378.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 498: *** 5323,5333 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 5966,5976 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 5340,5352 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 5983,5995 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 5355,5369 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 5998,6012 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 5371,5377 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 6014,6020 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 5383,5484 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 6026,6117 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 5486,5494 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 6119,6125 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 5508,5520 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 6139,6153 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 5523,5529 **** #endif return yyresult; } ! #line 2638 "/home/gdr/gcc-3.2.2/gcc-3.2.2/gcc/java/parse.y" /* Helper function to retrieve an OSB count. Should be used when the --- 6156,6164 ---- #endif return yyresult; } ! ! ! #line 2638 "/u/molotova/0/galaad/gdosreis/gcc-3.2.3/gcc-3.2.3/gcc/java/parse.y" /* Helper function to retrieve an OSB count. Should be used when the *************** source_end_java_method () *** 10362,10367 **** --- 10997,11004 ---- lineno = DECL_SOURCE_LINE_LAST (fndecl); expand_function_end (input_filename, lineno, 0); + DECL_SOURCE_LINE (fndecl) = DECL_SOURCE_LINE_FIRST (fndecl); + /* Run the optimizers and output assembler code for this function. */ rest_of_compilation (fndecl); } *************** emit_test_initialization (entry, info) *** 18991,18993 **** --- 19628,19632 ---- return true; } + + diff -Nrc3pad gcc-3.2.2/gcc/java/parse.y gcc-3.2.3/gcc/java/parse.y *** gcc-3.2.2/gcc/java/parse.y Mon Oct 21 18:40:12 2002 --- gcc-3.2.3/gcc/java/parse.y Tue Mar 18 00:05:29 2003 *************** source_end_java_method () *** 7473,7478 **** --- 7473,7480 ---- lineno = DECL_SOURCE_LINE_LAST (fndecl); expand_function_end (input_filename, lineno, 0); + DECL_SOURCE_LINE (fndecl) = DECL_SOURCE_LINE_FIRST (fndecl); + /* Run the optimizers and output assembler code for this function. */ rest_of_compilation (fndecl); } diff -Nrc3pad gcc-3.2.2/gcc/java/rmic.1 gcc-3.2.3/gcc/java/rmic.1 *** gcc-3.2.2/gcc/java/rmic.1 Wed Feb 5 03:14:01 2003 --- gcc-3.2.3/gcc/java/rmic.1 Tue Apr 22 07:07:38 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:01 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:38 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "RMIC 1" ! .TH RMIC 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" rmic \- Generate stubs for Remote Method Invocation --- 138,144 ---- .\" ====================================================================== .\" .IX Title "RMIC 1" ! .TH RMIC 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" rmic \- Generate stubs for Remote Method Invocation diff -Nrc3pad gcc-3.2.2/gcc/java/rmiregistry.1 gcc-3.2.3/gcc/java/rmiregistry.1 *** gcc-3.2.2/gcc/java/rmiregistry.1 Wed Feb 5 03:14:01 2003 --- gcc-3.2.3/gcc/java/rmiregistry.1 Tue Apr 22 07:07:39 2003 *************** *** 1,5 **** .\" Automatically generated by Pod::Man version 1.15 ! .\" Wed Feb 5 03:14:01 2003 .\" .\" Standard preamble: .\" ====================================================================== --- 1,5 ---- .\" Automatically generated by Pod::Man version 1.15 ! .\" Tue Apr 22 07:07:39 2003 .\" .\" Standard preamble: .\" ====================================================================== *************** *** 138,144 **** .\" ====================================================================== .\" .IX Title "RMIREGISTRY 1" ! .TH RMIREGISTRY 1 "gcc-3.2.2" "2003-02-05" "GNU" .UC .SH "NAME" rmiregistry \- Remote object registry --- 138,144 ---- .\" ====================================================================== .\" .IX Title "RMIREGISTRY 1" ! .TH RMIREGISTRY 1 "gcc-3.2.3" "2003-04-22" "GNU" .UC .SH "NAME" rmiregistry \- Remote object registry diff -Nrc3pad gcc-3.2.2/gcc/jump.c gcc-3.2.3/gcc/jump.c *** gcc-3.2.2/gcc/jump.c Fri Jan 10 13:46:19 2003 --- gcc-3.2.3/gcc/jump.c Tue Apr 15 16:16:44 2003 *************** delete_for_peephole (from, to) *** 1934,1947 **** is also an unconditional jump in that case. */ } ! /* We have determined that INSN is never reached, and are about to ! delete it. Print a warning if the user asked for one. ! To try to make this warning more useful, this should only be called ! once per basic block not reached, and it only warns when the basic ! block contains more than one line from the current function, and ! contains at least one operation. CSE and inlining can duplicate insns, ! so it's possible to get spurious warnings from this. */ void never_reached_warning (avoided_insn, finish) --- 1934,1947 ---- is also an unconditional jump in that case. */ } ! /* We have determined that AVOIDED_INSN is never reached, and are ! about to delete it. If the insn chain between AVOIDED_INSN and ! FINISH contains more than one line from the current function, and ! contains at least one operation, print a warning if the user asked ! for it. If FINISH is NULL, look between AVOIDED_INSN and a LABEL. ! CSE and inlining can duplicate insns, so it's possible to get ! spurious warnings from this. */ void never_reached_warning (avoided_insn, finish) *************** never_reached_warning (avoided_insn, fin *** 1951,1965 **** rtx a_line_note = NULL; int two_avoided_lines = 0, contains_insn = 0, reached_end = 0; ! if (! warn_notreached) return; ! /* Scan forwards, looking at LINE_NUMBER notes, until ! we hit a LABEL or we run out of insns. */ ! for (insn = avoided_insn; insn != NULL; insn = NEXT_INSN (insn)) { ! if (finish == NULL && GET_CODE (insn) == CODE_LABEL) break; if (GET_CODE (insn) == NOTE /* A line number note? */ --- 1951,1977 ---- rtx a_line_note = NULL; int two_avoided_lines = 0, contains_insn = 0, reached_end = 0; ! if (!warn_notreached) return; ! /* Back up to the first of any NOTEs preceding avoided_insn; flow passes ! us the head of a block, a NOTE_INSN_BASIC_BLOCK, which often follows ! the line note. */ ! for (insn = PREV_INSN (avoided_insn); ; insn = PREV_INSN (insn)) ! if (GET_CODE (insn) != NOTE ! || NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG) ! { ! insn = NEXT_INSN (insn); ! break; ! } ! /* Scan forwards, looking at LINE_NUMBER notes, until we hit a LABEL ! in case FINISH is NULL, otherwise until we run out of insns. */ ! ! for (; insn != NULL; insn = NEXT_INSN (insn)) { ! if ((finish == NULL && GET_CODE (insn) == CODE_LABEL) ! || GET_CODE (insn) == BARRIER) break; if (GET_CODE (insn) == NOTE /* A line number note? */ diff -Nrc3pad gcc-3.2.2/gcc/objc/objc-parse.c gcc-3.2.3/gcc/objc/objc-parse.c *** gcc-3.2.2/gcc/objc/objc-parse.c Wed Feb 5 03:22:19 2003 --- gcc-3.2.3/gcc/objc/objc-parse.c Tue Apr 22 08:19:12 2003 *************** *** 1,75 **** ! /* A Bison parser, made from objc-parse.y ! by GNU bison 1.33. */ ! #define YYBISON 1 /* Identify Bison output. */ ! # define IDENTIFIER 257 ! # define TYPENAME 258 ! # define SCSPEC 259 ! # define TYPESPEC 260 ! # define TYPE_QUAL 261 ! # define CONSTANT 262 ! # define STRING 263 ! # define ELLIPSIS 264 ! # define SIZEOF 265 ! # define ENUM 266 ! # define STRUCT 267 ! # define UNION 268 ! # define IF 269 ! # define ELSE 270 ! # define WHILE 271 ! # define DO 272 ! # define FOR 273 ! # define SWITCH 274 ! # define CASE 275 ! # define DEFAULT 276 ! # define BREAK 277 ! # define CONTINUE 278 ! # define RETURN 279 ! # define GOTO 280 ! # define ASM_KEYWORD 281 ! # define TYPEOF 282 ! # define ALIGNOF 283 ! # define ATTRIBUTE 284 ! # define EXTENSION 285 ! # define LABEL 286 ! # define REALPART 287 ! # define IMAGPART 288 ! # define VA_ARG 289 ! # define CHOOSE_EXPR 290 ! # define TYPES_COMPATIBLE_P 291 ! # define PTR_VALUE 292 ! # define PTR_BASE 293 ! # define PTR_EXTENT 294 ! # define STRING_FUNC_NAME 295 ! # define VAR_FUNC_NAME 296 ! # define ASSIGN 297 ! # define OROR 298 ! # define ANDAND 299 ! # define EQCOMPARE 300 ! # define ARITHCOMPARE 301 ! # define LSHIFT 302 ! # define RSHIFT 303 ! # define UNARY 304 ! # define PLUSPLUS 305 ! # define MINUSMINUS 306 ! # define HYPERUNARY 307 ! # define POINTSAT 308 ! # define INTERFACE 309 ! # define IMPLEMENTATION 310 ! # define END 311 ! # define SELECTOR 312 ! # define DEFS 313 ! # define ENCODE 314 ! # define CLASSNAME 315 ! # define PUBLIC 316 ! # define PRIVATE 317 ! # define PROTECTED 318 ! # define PROTOCOL 319 ! # define OBJECTNAME 320 ! # define CLASS 321 ! # define ALIAS 322 #line 33 "objc-parse.y" #include "config.h" --- 1,197 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 ! ! /* Skeleton name. */ ! #define YYSKELETON_NAME "yacc.c" + /* Pure parsers. */ + #define YYPURE 0 + + /* Using locations. */ + #define YYLSP_NEEDED 0 + + + + /* Tokens. */ + #ifndef YYTOKENTYPE + # define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + IDENTIFIER = 258, + TYPENAME = 259, + SCSPEC = 260, + TYPESPEC = 261, + TYPE_QUAL = 262, + CONSTANT = 263, + STRING = 264, + ELLIPSIS = 265, + SIZEOF = 266, + ENUM = 267, + STRUCT = 268, + UNION = 269, + IF = 270, + ELSE = 271, + WHILE = 272, + DO = 273, + FOR = 274, + SWITCH = 275, + CASE = 276, + DEFAULT = 277, + BREAK = 278, + CONTINUE = 279, + RETURN = 280, + GOTO = 281, + ASM_KEYWORD = 282, + TYPEOF = 283, + ALIGNOF = 284, + ATTRIBUTE = 285, + EXTENSION = 286, + LABEL = 287, + REALPART = 288, + IMAGPART = 289, + VA_ARG = 290, + CHOOSE_EXPR = 291, + TYPES_COMPATIBLE_P = 292, + PTR_VALUE = 293, + PTR_BASE = 294, + PTR_EXTENT = 295, + STRING_FUNC_NAME = 296, + VAR_FUNC_NAME = 297, + ASSIGN = 298, + OROR = 299, + ANDAND = 300, + EQCOMPARE = 301, + ARITHCOMPARE = 302, + RSHIFT = 303, + LSHIFT = 304, + MINUSMINUS = 305, + PLUSPLUS = 306, + UNARY = 307, + HYPERUNARY = 308, + POINTSAT = 309, + INTERFACE = 310, + IMPLEMENTATION = 311, + END = 312, + SELECTOR = 313, + DEFS = 314, + ENCODE = 315, + CLASSNAME = 316, + PUBLIC = 317, + PRIVATE = 318, + PROTECTED = 319, + PROTOCOL = 320, + OBJECTNAME = 321, + CLASS = 322, + ALIAS = 323 + }; + #endif + #define IDENTIFIER 258 + #define TYPENAME 259 + #define SCSPEC 260 + #define TYPESPEC 261 + #define TYPE_QUAL 262 + #define CONSTANT 263 + #define STRING 264 + #define ELLIPSIS 265 + #define SIZEOF 266 + #define ENUM 267 + #define STRUCT 268 + #define UNION 269 + #define IF 270 + #define ELSE 271 + #define WHILE 272 + #define DO 273 + #define FOR 274 + #define SWITCH 275 + #define CASE 276 + #define DEFAULT 277 + #define BREAK 278 + #define CONTINUE 279 + #define RETURN 280 + #define GOTO 281 + #define ASM_KEYWORD 282 + #define TYPEOF 283 + #define ALIGNOF 284 + #define ATTRIBUTE 285 + #define EXTENSION 286 + #define LABEL 287 + #define REALPART 288 + #define IMAGPART 289 + #define VA_ARG 290 + #define CHOOSE_EXPR 291 + #define TYPES_COMPATIBLE_P 292 + #define PTR_VALUE 293 + #define PTR_BASE 294 + #define PTR_EXTENT 295 + #define STRING_FUNC_NAME 296 + #define VAR_FUNC_NAME 297 + #define ASSIGN 298 + #define OROR 299 + #define ANDAND 300 + #define EQCOMPARE 301 + #define ARITHCOMPARE 302 + #define RSHIFT 303 + #define LSHIFT 304 + #define MINUSMINUS 305 + #define PLUSPLUS 306 + #define UNARY 307 + #define HYPERUNARY 308 + #define POINTSAT 309 + #define INTERFACE 310 + #define IMPLEMENTATION 311 + #define END 312 + #define SELECTOR 313 + #define DEFS 314 + #define ENCODE 315 + #define CLASSNAME 316 + #define PUBLIC 317 + #define PRIVATE 318 + #define PROTECTED 319 + #define PROTOCOL 320 + #define OBJECTNAME 321 + #define CLASS 322 + #define ALIAS 323 + + + + + /* Copy the first part of user declarations. */ #line 33 "objc-parse.y" #include "config.h" *************** *** 102,113 **** /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 #line 67 "objc-parse.y" ! #ifndef YYSTYPE ! typedef union {long itype; tree ttype; enum tree_code code; ! const char *filename; int lineno; } yystype; ! # define YYSTYPE yystype #endif #line 211 "objc-parse.y" /* Number of statements (loosely speaking) and compound statements --- 224,257 ---- /* Rename the "yyparse" function so that we can override it elsewhere. */ #define yyparse yyparse_1 + + /* Enabling traces. */ + #ifndef YYDEBUG + # define YYDEBUG 0 + #endif + + /* Enabling verbose error messages. */ + #ifdef YYERROR_VERBOSE + # undef YYERROR_VERBOSE + # define YYERROR_VERBOSE 1 + #else + # define YYERROR_VERBOSE 0 + #endif + + #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) #line 67 "objc-parse.y" ! typedef union YYSTYPE {long itype; tree ttype; enum tree_code code; ! const char *filename; int lineno; } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 246 "op2534.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif + + + + /* Copy the second part of user declarations. */ #line 211 "objc-parse.y" /* Number of statements (loosely speaking) and compound statements *************** c_parse_init () *** 202,233 **** ggc_add_tree_root (&all_prefix_attributes, 1); } ! #ifndef YYDEBUG ! # define YYDEBUG 0 #endif ! #define YYFINAL 1164 ! #define YYFLAG -32768 ! #define YYNTBASE 92 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 322 ? yytranslate[x] : 357) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 87, 2, 2, 2, 60, 51, 2, ! 67, 83, 58, 56, 88, 57, 66, 59, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 46, 84, ! 2, 44, 2, 45, 91, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 68, 2, 90, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 89, 49, 85, 86, 2, 2, 2, --- 346,484 ---- ggc_add_tree_root (&all_prefix_attributes, 1); } ! ! ! /* Line 214 of yacc.c. */ ! #line 352 "op2534.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! #endif + #if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; + #else + typedef short yysigned_char; + #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 4 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 4983 ! /* YYNTOKENS -- Number of terminals. */ ! #define YYNTOKENS 92 ! /* YYNNTS -- Number of nonterminals. */ ! #define YYNNTS 266 ! /* YYNRULES -- Number of rules. */ ! #define YYNRULES 724 ! /* YYNRULES -- Number of states. */ ! #define YYNSTATES 1164 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 323 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 87, 2, 2, 2, 60, 51, 2, ! 66, 83, 58, 56, 88, 57, 65, 59, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 46, 84, ! 2, 43, 2, 45, 91, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 67, 2, 90, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 89, 49, 85, 86, 2, 2, 2, *************** static const char yytranslate[] = *** 243,679 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, ! 36, 37, 38, 39, 40, 41, 42, 43, 47, 48, ! 52, 53, 54, 55, 61, 62, 63, 64, 65, 69, ! 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, ! 80, 81, 82 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 1, 3, 4, 7, 8, 12, 14, 16, ! 18, 24, 27, 31, 36, 41, 44, 47, 50, 52, ! 53, 54, 64, 69, 70, 71, 81, 86, 87, 88, ! 97, 101, 103, 105, 107, 109, 111, 113, 115, 117, ! 119, 121, 123, 125, 126, 128, 130, 134, 136, 139, ! 142, 145, 148, 151, 156, 159, 164, 167, 170, 172, ! 174, 176, 178, 183, 185, 189, 193, 197, 201, 205, ! 209, 213, 217, 221, 225, 229, 233, 234, 239, 240, ! 245, 246, 247, 255, 256, 262, 266, 270, 272, 274, ! 276, 278, 279, 287, 291, 295, 299, 303, 308, 315, ! 324, 331, 336, 340, 344, 347, 350, 352, 354, 356, ! 358, 360, 362, 365, 368, 372, 373, 375, 378, 382, ! 384, 386, 389, 392, 397, 402, 405, 408, 412, 413, ! 415, 420, 425, 429, 433, 436, 439, 441, 444, 447, ! 450, 453, 456, 458, 461, 463, 466, 469, 472, 475, ! 478, 481, 483, 486, 489, 492, 495, 498, 501, 504, ! 507, 510, 513, 516, 519, 522, 525, 528, 531, 533, 536, 539, 542, 545, 548, 551, 554, 557, 560, 563, 566, 569, 572, 575, 578, 581, 584, 587, 590, 593, 596, 599, 602, 605, 608, 611, 614, 617, 620, 623, 626, 629, 632, 635, 638, 641, 644, 647, 650, 653, ! 656, 659, 662, 665, 667, 669, 671, 673, 675, 677, ! 679, 681, 683, 685, 687, 689, 691, 693, 695, 697, ! 699, 701, 703, 705, 707, 709, 711, 713, 715, 717, ! 719, 721, 723, 725, 727, 729, 731, 733, 735, 737, ! 739, 741, 743, 745, 747, 749, 751, 753, 755, 757, ! 759, 761, 763, 765, 767, 769, 771, 773, 775, 777, ! 778, 780, 782, 784, 786, 788, 790, 792, 794, 797, ! 800, 802, 807, 812, 814, 819, 821, 826, 827, 832, ! 833, 840, 844, 845, 852, 856, 857, 859, 861, 864, ! 871, 873, 877, 878, 880, 885, 892, 897, 899, 901, ! 903, 905, 907, 908, 913, 915, 916, 919, 921, 925, ! 929, 932, 933, 938, 940, 941, 946, 948, 950, 952, ! 955, 958, 959, 960, 968, 969, 970, 978, 980, 982, ! 987, 991, 994, 998, 1000, 1002, 1004, 1006, 1010, 1013, ! 1015, 1017, 1021, 1024, 1028, 1032, 1037, 1041, 1046, 1050, ! 1053, 1055, 1057, 1060, 1062, 1065, 1067, 1070, 1071, 1079, ! 1085, 1086, 1094, 1100, 1101, 1110, 1111, 1119, 1122, 1125, ! 1128, 1129, 1131, 1132, 1134, 1136, 1139, 1140, 1144, 1147, ! 1152, 1156, 1161, 1165, 1167, 1169, 1172, 1174, 1179, 1181, ! 1186, 1191, 1198, 1204, 1209, 1216, 1222, 1224, 1228, 1230, ! 1232, 1236, 1237, 1241, 1242, 1244, 1245, 1247, 1250, 1252, ! 1254, 1256, 1260, 1263, 1267, 1272, 1276, 1279, 1282, 1284, ! 1288, 1293, 1296, 1300, 1304, 1309, 1314, 1320, 1326, 1328, ! 1330, 1332, 1334, 1336, 1339, 1342, 1345, 1348, 1350, 1353, ! 1356, 1359, 1361, 1364, 1367, 1370, 1373, 1375, 1378, 1380, ! 1382, 1384, 1386, 1389, 1390, 1391, 1392, 1393, 1394, 1396, ! 1398, 1401, 1405, 1407, 1410, 1412, 1414, 1420, 1422, 1424, ! 1427, 1430, 1433, 1436, 1437, 1443, 1444, 1449, 1450, 1451, ! 1453, 1456, 1460, 1464, 1468, 1469, 1474, 1476, 1480, 1481, ! 1482, 1490, 1496, 1499, 1500, 1501, 1502, 1503, 1516, 1517, ! 1524, 1527, 1529, 1531, 1534, 1538, 1541, 1544, 1547, 1551, ! 1558, 1567, 1578, 1591, 1595, 1600, 1602, 1606, 1612, 1615, ! 1621, 1622, 1624, 1625, 1627, 1628, 1630, 1632, 1636, 1641, ! 1649, 1651, 1655, 1656, 1660, 1663, 1664, 1665, 1672, 1675, ! 1676, 1678, 1680, 1684, 1686, 1690, 1695, 1700, 1704, 1709, ! 1713, 1718, 1723, 1727, 1732, 1736, 1738, 1739, 1743, 1745, ! 1748, 1750, 1754, 1756, 1760, 1762, 1764, 1766, 1768, 1770, ! 1772, 1774, 1776, 1780, 1784, 1789, 1790, 1791, 1802, 1803, ! 1810, 1811, 1812, 1825, 1826, 1835, 1836, 1843, 1846, 1847, ! 1856, 1861, 1862, 1872, 1878, 1879, 1886, 1890, 1891, 1893, ! 1897, 1901, 1903, 1905, 1907, 1909, 1910, 1914, 1917, 1921, ! 1925, 1927, 1928, 1930, 1935, 1937, 1941, 1944, 1946, 1948, ! 1949, 1950, 1951, 1959, 1960, 1961, 1964, 1966, 1968, 1971, ! 1972, 1976, 1978, 1980, 1981, 1982, 1988, 1993, 1995, 2001, ! 2004, 2005, 2008, 2009, 2011, 2013, 2015, 2018, 2021, 2026, ! 2029, 2032, 2034, 2038, 2041, 2044, 2046, 2047, 2050, 2051, ! 2055, 2057, 2059, 2062, 2064, 2066, 2068, 2070, 2072, 2074, ! 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2094, ! 2096, 2098, 2100, 2102, 2104, 2106, 2108, 2110, 2112, 2114, ! 2121, 2125, 2131, 2134, 2136, 2138, 2140, 2143, 2145, 2149, ! 2152, 2154, 2156, 2157, 2158, 2165, 2167, 2169, 2171, 2174, ! 2177, 2179, 2184, 2189 }; static const short yyrhs[] = { ! -1, 93, 0, 0, 94, 96, 0, 0, 93, 95, ! 96, 0, 98, 0, 97, 0, 292, 0, 27, 67, ! 107, 83, 84, 0, 291, 96, 0, 130, 164, 84, ! 0, 150, 130, 164, 84, 0, 149, 130, 163, 84, ! 0, 156, 84, 0, 1, 84, 0, 1, 85, 0, ! 84, 0, 0, 0, 149, 130, 192, 99, 125, 100, ! 252, 253, 241, 0, 149, 130, 192, 1, 0, 0, ! 0, 150, 130, 197, 101, 125, 102, 252, 253, 241, ! 0, 150, 130, 197, 1, 0, 0, 0, 130, 197, ! 103, 125, 104, 252, 253, 241, 0, 130, 197, 1, ! 0, 3, 0, 4, 0, 80, 0, 75, 0, 51, ! 0, 57, 0, 56, 0, 62, 0, 63, 0, 86, ! 0, 87, 0, 109, 0, 0, 109, 0, 115, 0, ! 109, 88, 115, 0, 121, 0, 58, 114, 0, 291, ! 114, 0, 106, 114, 0, 48, 105, 0, 111, 110, ! 0, 111, 67, 218, 83, 0, 112, 110, 0, 112, ! 67, 218, 83, 0, 33, 114, 0, 34, 114, 0, ! 11, 0, 29, 0, 28, 0, 110, 0, 67, 218, ! 83, 114, 0, 114, 0, 115, 56, 115, 0, 115, ! 57, 115, 0, 115, 58, 115, 0, 115, 59, 115, ! 0, 115, 60, 115, 0, 115, 54, 115, 0, 115, ! 55, 115, 0, 115, 53, 115, 0, 115, 52, 115, ! 0, 115, 51, 115, 0, 115, 49, 115, 0, 115, ! 50, 115, 0, 0, 115, 48, 116, 115, 0, 0, ! 115, 47, 117, 115, 0, 0, 0, 115, 45, 118, ! 107, 46, 119, 115, 0, 0, 115, 45, 120, 46, ! 115, 0, 115, 44, 115, 0, 115, 43, 115, 0, ! 3, 0, 8, 0, 123, 0, 42, 0, 0, 67, ! 218, 83, 89, 122, 178, 85, 0, 67, 107, 83, ! 0, 67, 1, 83, 0, 245, 243, 83, 0, 245, ! 1, 83, 0, 121, 67, 108, 83, 0, 35, 67, ! 115, 88, 218, 83, 0, 36, 67, 115, 88, 115, ! 88, 115, 83, 0, 37, 67, 218, 88, 218, 83, ! 0, 121, 68, 107, 90, 0, 121, 66, 105, 0, ! 121, 65, 105, 0, 121, 62, 0, 121, 63, 0, ! 348, 0, 354, 0, 355, 0, 356, 0, 124, 0, ! 9, 0, 123, 9, 0, 91, 9, 0, 124, 91, ! 9, 0, 0, 127, 0, 127, 10, 0, 252, 253, ! 128, 0, 126, 0, 233, 0, 127, 126, 0, 126, ! 233, 0, 151, 130, 163, 84, 0, 152, 130, 164, ! 84, 0, 151, 84, 0, 152, 84, 0, 252, 253, ! 132, 0, 0, 170, 0, 149, 130, 163, 84, 0, ! 150, 130, 164, 84, 0, 149, 130, 186, 0, 150, ! 130, 189, 0, 156, 84, 0, 291, 132, 0, 7, ! 0, 133, 7, 0, 134, 7, 0, 133, 171, 0, ! 135, 7, 0, 136, 7, 0, 171, 0, 135, 171, ! 0, 158, 0, 137, 7, 0, 138, 7, 0, 137, ! 160, 0, 138, 160, 0, 133, 158, 0, 134, 158, ! 0, 159, 0, 137, 171, 0, 137, 161, 0, 138, ! 161, 0, 133, 159, 0, 134, 159, 0, 139, 7, ! 0, 140, 7, 0, 139, 160, 0, 140, 160, 0, ! 135, 158, 0, 136, 158, 0, 139, 171, 0, 139, ! 161, 0, 140, 161, 0, 135, 159, 0, 136, 159, ! 0, 5, 0, 141, 7, 0, 142, 7, 0, 133, ! 5, 0, 134, 5, 0, 141, 5, 0, 142, 5, ! 0, 141, 171, 0, 143, 7, 0, 144, 7, 0, ! 135, 5, 0, 136, 5, 0, 143, 5, 0, 144, ! 5, 0, 143, 171, 0, 145, 7, 0, 146, 7, ! 0, 145, 160, 0, 146, 160, 0, 141, 158, 0, ! 142, 158, 0, 137, 5, 0, 138, 5, 0, 145, ! 5, 0, 146, 5, 0, 145, 171, 0, 145, 161, ! 0, 146, 161, 0, 141, 159, 0, 142, 159, 0, ! 147, 7, 0, 148, 7, 0, 147, 160, 0, 148, ! 160, 0, 143, 158, 0, 144, 158, 0, 139, 5, ! 0, 140, 5, 0, 147, 5, 0, 148, 5, 0, ! 147, 171, 0, 147, 161, 0, 148, 161, 0, 143, ! 159, 0, 144, 159, 0, 137, 0, 138, 0, 139, ! 0, 140, 0, 145, 0, 146, 0, 147, 0, 148, ! 0, 133, 0, 134, 0, 135, 0, 136, 0, 141, ! 0, 142, 0, 143, 0, 144, 0, 137, 0, 138, ! 0, 145, 0, 146, 0, 133, 0, 134, 0, 141, ! 0, 142, 0, 137, 0, 138, 0, 139, 0, 140, ! 0, 133, 0, 134, 0, 135, 0, 136, 0, 137, ! 0, 138, 0, 139, 0, 140, 0, 133, 0, 134, ! 0, 135, 0, 136, 0, 133, 0, 134, 0, 135, ! 0, 136, 0, 137, 0, 138, 0, 139, 0, 140, ! 0, 141, 0, 142, 0, 143, 0, 144, 0, 145, ! 0, 146, 0, 147, 0, 148, 0, 0, 154, 0, ! 160, 0, 162, 0, 161, 0, 6, 0, 206, 0, ! 201, 0, 4, 0, 75, 308, 0, 80, 308, 0, ! 309, 0, 113, 67, 107, 83, 0, 113, 67, 218, ! 83, 0, 166, 0, 163, 88, 131, 166, 0, 168, ! 0, 164, 88, 131, 168, 0, 0, 27, 67, 123, ! 83, 0, 0, 192, 165, 170, 44, 167, 176, 0, ! 192, 165, 170, 0, 0, 197, 165, 170, 44, 169, ! 176, 0, 197, 165, 170, 0, 0, 171, 0, 172, ! 0, 171, 172, 0, 30, 67, 67, 173, 83, 83, ! 0, 174, 0, 173, 88, 174, 0, 0, 175, 0, ! 175, 67, 3, 83, 0, 175, 67, 3, 88, 109, ! 83, 0, 175, 67, 108, 83, 0, 105, 0, 5, ! 0, 6, 0, 7, 0, 115, 0, 0, 89, 177, ! 178, 85, 0, 1, 0, 0, 179, 207, 0, 180, ! 0, 179, 88, 180, 0, 184, 44, 182, 0, 185, ! 182, 0, 0, 105, 46, 181, 182, 0, 182, 0, ! 0, 89, 183, 178, 85, 0, 115, 0, 1, 0, ! 185, 0, 184, 185, 0, 66, 105, 0, 0, 0, ! 192, 187, 125, 188, 252, 253, 246, 0, 0, 0, ! 197, 190, 125, 191, 252, 253, 246, 0, 193, 0, ! 197, 0, 67, 170, 193, 83, 0, 193, 67, 286, ! 0, 193, 226, 0, 58, 157, 193, 0, 4, 0, ! 80, 0, 195, 0, 196, 0, 195, 67, 286, 0, ! 195, 226, 0, 4, 0, 80, 0, 196, 67, 286, ! 0, 196, 226, 0, 58, 157, 195, 0, 58, 157, ! 196, 0, 67, 170, 196, 83, 0, 197, 67, 286, ! 0, 67, 170, 197, 83, 0, 58, 157, 197, 0, ! 197, 226, 0, 3, 0, 13, 0, 13, 171, 0, ! 14, 0, 14, 171, 0, 12, 0, 12, 171, 0, ! 0, 198, 105, 89, 202, 209, 85, 170, 0, 198, ! 89, 209, 85, 170, 0, 0, 199, 105, 89, 203, ! 209, 85, 170, 0, 199, 89, 209, 85, 170, 0, ! 0, 200, 105, 89, 204, 216, 208, 85, 170, 0, ! 0, 200, 89, 205, 216, 208, 85, 170, 0, 198, ! 105, 0, 199, 105, 0, 200, 105, 0, 0, 88, ! 0, 0, 88, 0, 210, 0, 210, 211, 0, 0, ! 210, 211, 84, 0, 210, 84, 0, 73, 67, 75, ! 83, 0, 153, 130, 212, 0, 153, 130, 252, 253, ! 0, 154, 130, 213, 0, 154, 0, 1, 0, 291, ! 211, 0, 214, 0, 212, 88, 131, 214, 0, 215, ! 0, 213, 88, 131, 215, 0, 252, 253, 192, 170, ! 0, 252, 253, 192, 46, 115, 170, 0, 252, 253, ! 46, 115, 170, 0, 252, 253, 197, 170, 0, 252, ! 253, 197, 46, 115, 170, 0, 252, 253, 46, 115, ! 170, 0, 217, 0, 216, 88, 217, 0, 1, 0, ! 105, 0, 105, 44, 115, 0, 0, 155, 219, 220, ! 0, 0, 222, 0, 0, 222, 0, 223, 171, 0, ! 224, 0, 223, 0, 225, 0, 58, 157, 223, 0, ! 58, 157, 0, 58, 157, 224, 0, 67, 170, 222, ! 83, 0, 225, 67, 276, 0, 225, 226, 0, 67, ! 276, 0, 226, 0, 68, 107, 90, 0, 68, 155, ! 107, 90, 0, 68, 90, 0, 68, 155, 90, 0, ! 68, 58, 90, 0, 68, 155, 58, 90, 0, 68, ! 5, 107, 90, 0, 68, 5, 155, 107, 90, 0, ! 68, 155, 5, 107, 90, 0, 228, 0, 229, 0, ! 230, 0, 231, 0, 256, 0, 228, 256, 0, 229, ! 256, 0, 230, 256, 0, 231, 256, 0, 129, 0, ! 228, 129, 0, 229, 129, 0, 231, 129, 0, 257, ! 0, 228, 257, 0, 229, 257, 0, 230, 257, 0, ! 231, 257, 0, 233, 0, 232, 233, 0, 228, 0, ! 229, 0, 230, 0, 231, 0, 1, 84, 0, 0, ! 0, 0, 0, 0, 239, 0, 240, 0, 239, 240, ! 0, 32, 290, 84, 0, 246, 0, 1, 246, 0, ! 89, 0, 85, 0, 234, 238, 244, 85, 235, 0, ! 227, 0, 1, 0, 67, 89, 0, 242, 243, 0, ! 248, 255, 0, 248, 1, 0, 0, 15, 249, 67, ! 107, 83, 0, 0, 18, 251, 255, 17, 0, 0, ! 0, 256, 0, 257, 254, 0, 236, 254, 237, 0, ! 252, 253, 268, 0, 252, 253, 269, 0, 0, 247, ! 16, 259, 255, 0, 247, 0, 247, 16, 1, 0, ! 0, 0, 17, 260, 67, 107, 83, 261, 255, 0, ! 250, 67, 107, 83, 84, 0, 250, 1, 0, 0, ! 0, 0, 0, 19, 262, 67, 267, 263, 271, 84, ! 264, 271, 83, 265, 255, 0, 0, 20, 67, 107, ! 83, 266, 255, 0, 271, 84, 0, 132, 0, 246, ! 0, 107, 84, 0, 236, 258, 237, 0, 23, 84, ! 0, 24, 84, 0, 25, 84, 0, 25, 107, 84, ! 0, 27, 270, 67, 107, 83, 84, 0, 27, 270, ! 67, 107, 46, 272, 83, 84, 0, 27, 270, 67, ! 107, 46, 272, 46, 272, 83, 84, 0, 27, 270, ! 67, 107, 46, 272, 46, 272, 46, 275, 83, 84, ! 0, 26, 105, 84, 0, 26, 58, 107, 84, 0, ! 84, 0, 21, 115, 46, 0, 21, 115, 10, 115, ! 46, 0, 22, 46, 0, 105, 252, 253, 46, 170, ! 0, 0, 7, 0, 0, 107, 0, 0, 273, 0, ! 274, 0, 273, 88, 274, 0, 9, 67, 107, 83, ! 0, 68, 105, 90, 9, 67, 107, 83, 0, 123, ! 0, 275, 88, 123, 0, 0, 170, 277, 278, 0, ! 281, 83, 0, 0, 0, 282, 84, 279, 170, 280, ! 278, 0, 1, 83, 0, 0, 10, 0, 282, 0, ! 282, 88, 10, 0, 284, 0, 282, 88, 283, 0, ! 149, 130, 194, 170, 0, 149, 130, 197, 170, 0, ! 149, 130, 221, 0, 150, 130, 197, 170, 0, 150, ! 130, 221, 0, 151, 285, 194, 170, 0, 151, 285, ! 197, 170, 0, 151, 285, 221, 0, 152, 285, 197, ! 170, 0, 152, 285, 221, 0, 130, 0, 0, 170, ! 287, 288, 0, 278, 0, 289, 83, 0, 3, 0, ! 289, 88, 3, 0, 105, 0, 290, 88, 105, 0, ! 31, 0, 296, 0, 294, 0, 295, 0, 306, 0, ! 317, 0, 71, 0, 105, 0, 293, 88, 105, 0, ! 81, 293, 84, 0, 82, 105, 105, 84, 0, 0, ! 0, 69, 105, 308, 89, 297, 310, 85, 298, 321, ! 71, 0, 0, 69, 105, 308, 299, 321, 71, 0, ! 0, 0, 69, 105, 46, 105, 308, 89, 300, 310, ! 85, 301, 321, 71, 0, 0, 69, 105, 46, 105, ! 308, 302, 321, 71, 0, 0, 70, 105, 89, 303, ! 310, 85, 0, 70, 105, 0, 0, 70, 105, 46, ! 105, 89, 304, 310, 85, 0, 70, 105, 46, 105, ! 0, 0, 69, 105, 67, 105, 83, 308, 305, 321, ! 71, 0, 70, 105, 67, 105, 83, 0, 0, 79, ! 105, 308, 307, 321, 71, 0, 79, 293, 84, 0, ! 0, 309, 0, 53, 293, 53, 0, 310, 311, 312, ! 0, 312, 0, 77, 0, 78, 0, 76, 0, 0, ! 312, 313, 84, 0, 312, 84, 0, 153, 130, 314, ! 0, 154, 130, 314, 0, 1, 0, 0, 315, 0, ! 314, 88, 131, 315, 0, 192, 0, 192, 46, 115, ! 0, 46, 115, 0, 56, 0, 57, 0, 0, 0, ! 0, 316, 318, 329, 319, 330, 320, 241, 0, 0, ! 0, 322, 323, 0, 326, 0, 97, 0, 323, 326, ! 0, 0, 323, 324, 97, 0, 84, 0, 1, 0, ! 0, 0, 316, 327, 329, 328, 325, 0, 67, 218, ! 83, 338, 0, 338, 0, 67, 218, 83, 339, 336, ! 0, 339, 336, 0, 0, 84, 331, 0, 0, 332, ! 0, 333, 0, 233, 0, 332, 333, 0, 333, 233, ! 0, 149, 130, 334, 84, 0, 149, 84, 0, 150, ! 84, 0, 335, 0, 334, 88, 335, 0, 194, 170, ! 0, 197, 170, 0, 221, 0, 0, 88, 10, 0, ! 0, 88, 337, 281, 0, 340, 0, 342, 0, 339, ! 342, 0, 3, 0, 4, 0, 75, 0, 80, 0, ! 341, 0, 12, 0, 13, 0, 14, 0, 15, 0, ! 16, 0, 17, 0, 18, 0, 19, 0, 20, 0, ! 21, 0, 22, 0, 23, 0, 24, 0, 25, 0, ! 26, 0, 27, 0, 11, 0, 28, 0, 29, 0, ! 6, 0, 7, 0, 340, 46, 67, 218, 83, 105, ! 0, 340, 46, 105, 0, 46, 67, 218, 83, 105, ! 0, 46, 105, 0, 340, 0, 344, 0, 346, 0, ! 344, 346, 0, 109, 0, 340, 46, 345, 0, 46, ! 345, 0, 107, 0, 75, 0, 0, 0, 68, 349, ! 347, 350, 343, 90, 0, 340, 0, 352, 0, 353, ! 0, 352, 353, 0, 340, 46, 0, 46, 0, 72, ! 67, 351, 83, 0, 79, 67, 105, 83, 0, 74, ! 67, 218, 83, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 307, 312, 326, 326, 328, 328, 331, 333, 334, ! 335, 343, 347, 355, 357, 359, 361, 362, 363, 368, ! 368, 368, 381, 383, 383, 383, 395, 397, 397, 397, ! 409, 413, 415, 416, 417, 420, 422, 424, 427, 429, ! 431, 433, 437, 441, 444, 447, 450, 454, 456, 459, ! 462, 466, 483, 489, 492, 495, 498, 500, 504, 508, ! 512, 516, 518, 522, 524, 526, 528, 530, 532, 534, ! 536, 538, 540, 542, 544, 546, 548, 548, 554, 554, ! 560, 560, 560, 569, 569, 579, 586, 596, 603, 604, ! 606, 608, 608, 621, 626, 628, 644, 651, 653, 656, ! 666, 676, 678, 685, 694, 696, 698, 700, 702, 704, ! 706, 711, 713, 721, 724, 728, 730, 731, 741, 746, ! 748, 749, 750, 757, 760, 762, 765, 773, 782, 792, ! 797, 800, 802, 804, 806, 808, 864, 868, 871, 876, ! 882, 886, 891, 895, 900, 904, 907, 910, 913, 916, ! 919, 924, 928, 931, 934, 937, 940, 945, 949, 952, ! 955, 958, 961, 966, 970, 973, 976, 979, 984, 988, ! 991, 994, 1000, 1006, 1012, 1020, 1026, 1030, 1033, 1039, ! 1045, 1051, 1059, 1065, 1069, 1072, 1075, 1078, 1081, 1084, ! 1090, 1096, 1102, 1110, 1114, 1117, 1120, 1123, 1128, 1132, ! 1135, 1138, 1141, 1144, 1147, 1153, 1159, 1165, 1173, 1177, ! 1180, 1183, 1186, 1192, 1194, 1195, 1196, 1197, 1198, 1199, ! 1200, 1203, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1214, ! 1216, 1217, 1218, 1221, 1223, 1224, 1225, 1228, 1230, 1231, ! 1232, 1235, 1237, 1238, 1239, 1242, 1244, 1245, 1246, 1247, ! 1248, 1249, 1250, 1253, 1255, 1256, 1257, 1258, 1259, 1260, ! 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1273, ! 1276, 1301, 1303, 1306, 1310, 1313, 1316, 1320, 1325, 1327, ! 1332, 1334, 1336, 1342, 1344, 1347, 1349, 1352, 1355, 1361, ! 1361, 1370, 1377, 1377, 1386, 1393, 1396, 1400, 1403, 1407, ! 1412, 1415, 1419, 1422, 1424, 1426, 1428, 1435, 1437, 1438, ! 1439, 1444, 1446, 1446, 1450, 1455, 1459, 1462, 1464, 1469, ! 1473, 1476, 1476, 1482, 1485, 1485, 1490, 1492, 1495, 1497, ! 1500, 1508, 1508, 1508, 1538, 1538, 1538, 1571, 1573, 1578, ! 1581, 1586, 1588, 1590, 1591, 1598, 1600, 1603, 1609, 1611, ! 1612, 1615, 1621, 1623, 1625, 1627, 1634, 1640, 1642, 1644, ! 1646, 1649, 1652, 1656, 1659, 1663, 1666, 1676, 1676, 1683, ! 1687, 1687, 1691, 1695, 1695, 1700, 1700, 1707, 1710, 1712, ! 1720, 1722, 1725, 1727, 1732, 1735, 1740, 1742, 1744, 1748, ! 1763, 1767, 1777, 1780, 1785, 1787, 1792, 1794, 1798, 1800, ! 1804, 1808, 1812, 1817, 1821, 1825, 1835, 1837, 1842, 1847, ! 1850, 1854, 1854, 1862, 1865, 1868, 1873, 1877, 1883, 1885, ! 1888, 1890, 1894, 1897, 1901, 1904, 1906, 1908, 1910, 1916, ! 1919, 1921, 1923, 1925, 1927, 1929, 1933, 1937, 1949, 1951, ! 1952, 1956, 1959, 1961, 1962, 1963, 1964, 1967, 1969, 1972, ! 1973, 1976, 1978, 1979, 1980, 1981, 1984, 1986, 1989, 1991, ! 1992, 1993, 1996, 1999, 2008, 2013, 2031, 2046, 2048, 2053, ! 2055, 2058, 2072, 2075, 2078, 2082, 2084, 2091, 2093, 2096, ! 2114, 2121, 2127, 2130, 2130, 2152, 2152, 2172, 2178, 2184, ! 2186, 2190, 2196, 2210, 2219, 2219, 2228, 2240, 2250, 2250, ! 2250, 2260, 2263, 2265, 2265, 2265, 2265, 2265, 2279, 2279, ! 2286, 2289, 2294, 2297, 2300, 2304, 2307, 2310, 2313, 2316, ! 2320, 2324, 2329, 2333, 2345, 2351, 2359, 2362, 2365, 2368, ! 2383, 2387, 2391, 2394, 2399, 2401, 2404, 2406, 2410, 2413, ! 2417, 2420, 2429, 2429, 2440, 2442, 2442, 2442, 2455, 2461, ! 2463, 2473, 2475, 2479, 2482, 2488, 2494, 2499, 2502, 2508, ! 2515, 2521, 2526, 2529, 2535, 2540, 2549, 2549, 2560, 2562, ! 2579, 2582, 2587, 2590, 2594, 2604, 2606, 2607, 2608, 2609, ! 2610, 2624, 2627, 2631, 2638, 2645, 2645, 2645, 2663, 2663, ! 2676, 2676, 2676, 2693, 2693, 2706, 2706, 2718, 2726, 2726, ! 2738, 2746, 2746, 2759, 2768, 2768, 2784, 2790, 2795, 2798, ! 2808, 2810, 2813, 2815, 2816, 2819, 2824, 2825, 2842, 2846, ! 2849, 2853, 2856, 2857, 2860, 2868, 2874, 2883, 2886, 2890, ! 2890, 2890, 2890, 2920, 2922, 2922, 2925, 2927, 2928, 2929, ! 2929, 2932, 2934, 2937, 2937, 2937, 2955, 2961, 2966, 2971, ! 2980, 2982, 2988, 2990, 2993, 2995, 2996, 2997, 3000, 3003, ! 3005, 3009, 3012, 3019, 3024, 3028, 3032, 3037, 3042, 3042, ! 3054, 3058, 3061, 3067, 3069, 3070, 3071, 3072, 3075, 3076, ! 3076, 3076, 3076, 3076, 3076, 3076, 3077, 3077, 3077, 3077, ! 3077, 3077, 3078, 3078, 3078, 3078, 3078, 3079, 3079, 3082, ! 3088, 3093, 3098, 3104, 3106, 3109, 3111, 3118, 3130, 3135, ! 3141, 3143, 3149, 3149, 3149, 3160, 3162, 3165, 3167, 3173, ! 3178, 3184, 3191, 3200 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "IDENTIFIER", "TYPENAME", "SCSPEC", "TYPESPEC", "TYPE_QUAL", "CONSTANT", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "STRUCT", "UNION", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", "RETURN", "GOTO", "ASM_KEYWORD", "TYPEOF", "ALIGNOF", "ATTRIBUTE", "EXTENSION", "LABEL", "REALPART", "IMAGPART", "VA_ARG", "CHOOSE_EXPR", "TYPES_COMPATIBLE_P", "PTR_VALUE", ! "PTR_BASE", "PTR_EXTENT", "STRING_FUNC_NAME", "VAR_FUNC_NAME", "ASSIGN", ! "'='", "'?'", "':'", "OROR", "ANDAND", "'|'", "'^'", "'&'", "EQCOMPARE", ! "ARITHCOMPARE", "LSHIFT", "RSHIFT", "'+'", "'-'", "'*'", "'/'", "'%'", ! "UNARY", "PLUSPLUS", "MINUSMINUS", "HYPERUNARY", "POINTSAT", "'.'", ! "'('", "'['", "INTERFACE", "IMPLEMENTATION", "END", "SELECTOR", "DEFS", ! "ENCODE", "CLASSNAME", "PUBLIC", "PRIVATE", "PROTECTED", "PROTOCOL", ! "OBJECTNAME", "CLASS", "ALIAS", "')'", "';'", "'}'", "'~'", "'!'", ! "','", "'{'", "']'", "'@'", "program", "extdefs", "@1", "@2", "extdef", ! "datadef", "fndef", "@3", "@4", "@5", "@6", "@7", "@8", "identifier", ! "unop", "expr", "exprlist", "nonnull_exprlist", "unary_expr", "sizeof", ! "alignof", "typeof", "cast_expr", "expr_no_commas", "@9", "@10", "@11", ! "@12", "@13", "primary", "@14", "string", "objc_string", ! "old_style_parm_decls", "lineno_datadecl", "datadecls", "datadecl", ! "lineno_decl", "setspecs", "maybe_resetattrs", "decl", ! "declspecs_nosc_nots_nosa_noea", "declspecs_nosc_nots_nosa_ea", ! "declspecs_nosc_nots_sa_noea", "declspecs_nosc_nots_sa_ea", ! "declspecs_nosc_ts_nosa_noea", "declspecs_nosc_ts_nosa_ea", ! "declspecs_nosc_ts_sa_noea", "declspecs_nosc_ts_sa_ea", ! "declspecs_sc_nots_nosa_noea", "declspecs_sc_nots_nosa_ea", ! "declspecs_sc_nots_sa_noea", "declspecs_sc_nots_sa_ea", ! "declspecs_sc_ts_nosa_noea", "declspecs_sc_ts_nosa_ea", ! "declspecs_sc_ts_sa_noea", "declspecs_sc_ts_sa_ea", "declspecs_ts", ! "declspecs_nots", "declspecs_ts_nosa", "declspecs_nots_nosa", ! "declspecs_nosc_ts", "declspecs_nosc_nots", "declspecs_nosc", ! "declspecs", "maybe_type_quals_attrs", "typespec_nonattr", ! "typespec_attr", "typespec_reserved_nonattr", "typespec_reserved_attr", "typespec_nonreserved_nonattr", "initdecls", "notype_initdecls", "maybeasm", "initdcl", "@15", "notype_initdcl", "@16", "maybe_attribute", "attributes", "attribute", "attribute_list", --- 494,931 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, 38, 39, 40, 41, 42, 44, 47, ! 48, 52, 53, 54, 55, 61, 62, 63, 64, 68, ! 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, ! 79, 80, 81, 82 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned short yyprhs[] = { ! 0, 0, 3, 4, 6, 7, 10, 11, 15, 17, ! 19, 21, 27, 30, 34, 39, 44, 47, 50, 53, ! 55, 56, 57, 67, 72, 73, 74, 84, 89, 90, ! 91, 100, 104, 106, 108, 110, 112, 114, 116, 118, ! 120, 122, 124, 126, 128, 129, 131, 133, 137, 139, ! 142, 145, 148, 151, 154, 159, 162, 167, 170, 173, ! 175, 177, 179, 181, 186, 188, 192, 196, 200, 204, ! 208, 212, 216, 220, 224, 228, 232, 236, 237, 242, ! 243, 248, 249, 250, 258, 259, 265, 269, 273, 275, ! 277, 279, 281, 282, 290, 294, 298, 302, 306, 311, ! 318, 327, 334, 339, 343, 347, 350, 353, 355, 357, ! 359, 361, 363, 365, 368, 371, 375, 376, 378, 381, ! 385, 387, 389, 392, 395, 400, 405, 408, 411, 415, ! 416, 418, 423, 428, 432, 436, 439, 442, 444, 447, ! 450, 453, 456, 459, 461, 464, 466, 469, 472, 475, ! 478, 481, 484, 486, 489, 492, 495, 498, 501, 504, ! 507, 510, 513, 516, 519, 522, 525, 528, 531, 534, 536, 539, 542, 545, 548, 551, 554, 557, 560, 563, 566, 569, 572, 575, 578, 581, 584, 587, 590, 593, 596, 599, 602, 605, 608, 611, 614, 617, 620, 623, 626, 629, 632, 635, 638, 641, 644, 647, 650, 653, ! 656, 659, 662, 665, 668, 670, 672, 674, 676, 678, ! 680, 682, 684, 686, 688, 690, 692, 694, 696, 698, ! 700, 702, 704, 706, 708, 710, 712, 714, 716, 718, ! 720, 722, 724, 726, 728, 730, 732, 734, 736, 738, ! 740, 742, 744, 746, 748, 750, 752, 754, 756, 758, ! 760, 762, 764, 766, 768, 770, 772, 774, 776, 778, ! 780, 781, 783, 785, 787, 789, 791, 793, 795, 797, ! 800, 803, 805, 810, 815, 817, 822, 824, 829, 830, ! 835, 836, 843, 847, 848, 855, 859, 860, 862, 864, ! 867, 874, 876, 880, 881, 883, 888, 895, 900, 902, ! 904, 906, 908, 910, 911, 916, 918, 919, 922, 924, ! 928, 932, 935, 936, 941, 943, 944, 949, 951, 953, ! 955, 958, 961, 962, 963, 971, 972, 973, 981, 983, ! 985, 990, 994, 997, 1001, 1003, 1005, 1007, 1009, 1013, ! 1016, 1018, 1020, 1024, 1027, 1031, 1035, 1040, 1044, 1049, ! 1053, 1056, 1058, 1060, 1063, 1065, 1068, 1070, 1073, 1074, ! 1082, 1088, 1089, 1097, 1103, 1104, 1113, 1114, 1122, 1125, ! 1128, 1131, 1132, 1134, 1135, 1137, 1139, 1142, 1143, 1147, ! 1150, 1155, 1159, 1164, 1168, 1170, 1172, 1175, 1177, 1182, ! 1184, 1189, 1194, 1201, 1207, 1212, 1219, 1225, 1227, 1231, ! 1233, 1235, 1239, 1240, 1244, 1245, 1247, 1248, 1250, 1253, ! 1255, 1257, 1259, 1263, 1266, 1270, 1275, 1279, 1282, 1285, ! 1287, 1291, 1296, 1299, 1303, 1307, 1312, 1317, 1323, 1329, ! 1331, 1333, 1335, 1337, 1339, 1342, 1345, 1348, 1351, 1353, ! 1356, 1359, 1362, 1364, 1367, 1370, 1373, 1376, 1378, 1381, ! 1383, 1385, 1387, 1389, 1392, 1393, 1394, 1395, 1396, 1397, ! 1399, 1401, 1404, 1408, 1410, 1413, 1415, 1417, 1423, 1425, ! 1427, 1430, 1433, 1436, 1439, 1440, 1446, 1447, 1452, 1453, ! 1454, 1456, 1459, 1463, 1467, 1471, 1472, 1477, 1479, 1483, ! 1484, 1485, 1493, 1499, 1502, 1503, 1504, 1505, 1506, 1519, ! 1520, 1527, 1530, 1532, 1534, 1537, 1541, 1544, 1547, 1550, ! 1554, 1561, 1570, 1581, 1594, 1598, 1603, 1605, 1609, 1615, ! 1618, 1624, 1625, 1627, 1628, 1630, 1631, 1633, 1635, 1639, ! 1644, 1652, 1654, 1658, 1659, 1663, 1666, 1667, 1668, 1675, ! 1678, 1679, 1681, 1683, 1687, 1689, 1693, 1698, 1703, 1707, ! 1712, 1716, 1721, 1726, 1730, 1735, 1739, 1741, 1742, 1746, ! 1748, 1751, 1753, 1757, 1759, 1763, 1765, 1767, 1769, 1771, ! 1773, 1775, 1777, 1779, 1783, 1787, 1792, 1793, 1794, 1805, ! 1806, 1813, 1814, 1815, 1828, 1829, 1838, 1839, 1846, 1849, ! 1850, 1859, 1864, 1865, 1875, 1881, 1882, 1889, 1893, 1894, ! 1896, 1900, 1904, 1906, 1908, 1910, 1912, 1913, 1917, 1920, ! 1924, 1928, 1930, 1931, 1933, 1938, 1940, 1944, 1947, 1949, ! 1951, 1952, 1953, 1954, 1962, 1963, 1964, 1967, 1969, 1971, ! 1974, 1975, 1979, 1981, 1983, 1984, 1985, 1991, 1996, 1998, ! 2004, 2007, 2008, 2011, 2012, 2014, 2016, 2018, 2021, 2024, ! 2029, 2032, 2035, 2037, 2041, 2044, 2047, 2049, 2050, 2053, ! 2054, 2058, 2060, 2062, 2065, 2067, 2069, 2071, 2073, 2075, ! 2077, 2079, 2081, 2083, 2085, 2087, 2089, 2091, 2093, 2095, ! 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2115, ! 2117, 2124, 2128, 2134, 2137, 2139, 2141, 2143, 2146, 2148, ! 2152, 2155, 2157, 2159, 2160, 2161, 2168, 2170, 2172, 2174, ! 2177, 2180, 2182, 2187, 2192 }; + + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const short yyrhs[] = { ! 93, 0, -1, -1, 94, -1, -1, 95, 97, -1, ! -1, 94, 96, 97, -1, 99, -1, 98, -1, 293, ! -1, 27, 66, 108, 83, 84, -1, 292, 97, -1, ! 131, 165, 84, -1, 151, 131, 165, 84, -1, 150, ! 131, 164, 84, -1, 157, 84, -1, 1, 84, -1, ! 1, 85, -1, 84, -1, -1, -1, 150, 131, 193, ! 100, 126, 101, 253, 254, 242, -1, 150, 131, 193, ! 1, -1, -1, -1, 151, 131, 198, 102, 126, 103, ! 253, 254, 242, -1, 151, 131, 198, 1, -1, -1, ! -1, 131, 198, 104, 126, 105, 253, 254, 242, -1, ! 131, 198, 1, -1, 3, -1, 4, -1, 80, -1, ! 75, -1, 51, -1, 57, -1, 56, -1, 62, -1, ! 61, -1, 86, -1, 87, -1, 110, -1, -1, 110, ! -1, 116, -1, 110, 88, 116, -1, 122, -1, 58, ! 115, -1, 292, 115, -1, 107, 115, -1, 48, 106, ! -1, 112, 111, -1, 112, 66, 219, 83, -1, 113, ! 111, -1, 113, 66, 219, 83, -1, 33, 115, -1, ! 34, 115, -1, 11, -1, 29, -1, 28, -1, 111, ! -1, 66, 219, 83, 115, -1, 115, -1, 116, 56, ! 116, -1, 116, 57, 116, -1, 116, 58, 116, -1, ! 116, 59, 116, -1, 116, 60, 116, -1, 116, 55, ! 116, -1, 116, 54, 116, -1, 116, 53, 116, -1, ! 116, 52, 116, -1, 116, 51, 116, -1, 116, 49, ! 116, -1, 116, 50, 116, -1, -1, 116, 48, 117, ! 116, -1, -1, 116, 47, 118, 116, -1, -1, -1, ! 116, 45, 119, 108, 46, 120, 116, -1, -1, 116, ! 45, 121, 46, 116, -1, 116, 43, 116, -1, 116, ! 44, 116, -1, 3, -1, 8, -1, 124, -1, 42, ! -1, -1, 66, 219, 83, 89, 123, 179, 85, -1, ! 66, 108, 83, -1, 66, 1, 83, -1, 246, 244, ! 83, -1, 246, 1, 83, -1, 122, 66, 109, 83, ! -1, 35, 66, 116, 88, 219, 83, -1, 36, 66, ! 116, 88, 116, 88, 116, 83, -1, 37, 66, 219, ! 88, 219, 83, -1, 122, 67, 108, 90, -1, 122, ! 65, 106, -1, 122, 68, 106, -1, 122, 62, -1, ! 122, 61, -1, 349, -1, 355, -1, 356, -1, 357, ! -1, 125, -1, 9, -1, 124, 9, -1, 91, 9, ! -1, 125, 91, 9, -1, -1, 128, -1, 128, 10, ! -1, 253, 254, 129, -1, 127, -1, 234, -1, 128, ! 127, -1, 127, 234, -1, 152, 131, 164, 84, -1, ! 153, 131, 165, 84, -1, 152, 84, -1, 153, 84, ! -1, 253, 254, 133, -1, -1, 171, -1, 150, 131, ! 164, 84, -1, 151, 131, 165, 84, -1, 150, 131, ! 187, -1, 151, 131, 190, -1, 157, 84, -1, 292, ! 133, -1, 7, -1, 134, 7, -1, 135, 7, -1, ! 134, 172, -1, 136, 7, -1, 137, 7, -1, 172, ! -1, 136, 172, -1, 159, -1, 138, 7, -1, 139, ! 7, -1, 138, 161, -1, 139, 161, -1, 134, 159, ! -1, 135, 159, -1, 160, -1, 138, 172, -1, 138, ! 162, -1, 139, 162, -1, 134, 160, -1, 135, 160, ! -1, 140, 7, -1, 141, 7, -1, 140, 161, -1, ! 141, 161, -1, 136, 159, -1, 137, 159, -1, 140, ! 172, -1, 140, 162, -1, 141, 162, -1, 136, 160, ! -1, 137, 160, -1, 5, -1, 142, 7, -1, 143, ! 7, -1, 134, 5, -1, 135, 5, -1, 142, 5, ! -1, 143, 5, -1, 142, 172, -1, 144, 7, -1, ! 145, 7, -1, 136, 5, -1, 137, 5, -1, 144, ! 5, -1, 145, 5, -1, 144, 172, -1, 146, 7, ! -1, 147, 7, -1, 146, 161, -1, 147, 161, -1, ! 142, 159, -1, 143, 159, -1, 138, 5, -1, 139, ! 5, -1, 146, 5, -1, 147, 5, -1, 146, 172, ! -1, 146, 162, -1, 147, 162, -1, 142, 160, -1, ! 143, 160, -1, 148, 7, -1, 149, 7, -1, 148, ! 161, -1, 149, 161, -1, 144, 159, -1, 145, 159, ! -1, 140, 5, -1, 141, 5, -1, 148, 5, -1, ! 149, 5, -1, 148, 172, -1, 148, 162, -1, 149, ! 162, -1, 144, 160, -1, 145, 160, -1, 138, -1, ! 139, -1, 140, -1, 141, -1, 146, -1, 147, -1, ! 148, -1, 149, -1, 134, -1, 135, -1, 136, -1, ! 137, -1, 142, -1, 143, -1, 144, -1, 145, -1, ! 138, -1, 139, -1, 146, -1, 147, -1, 134, -1, ! 135, -1, 142, -1, 143, -1, 138, -1, 139, -1, ! 140, -1, 141, -1, 134, -1, 135, -1, 136, -1, ! 137, -1, 138, -1, 139, -1, 140, -1, 141, -1, ! 134, -1, 135, -1, 136, -1, 137, -1, 134, -1, ! 135, -1, 136, -1, 137, -1, 138, -1, 139, -1, ! 140, -1, 141, -1, 142, -1, 143, -1, 144, -1, ! 145, -1, 146, -1, 147, -1, 148, -1, 149, -1, ! -1, 155, -1, 161, -1, 163, -1, 162, -1, 6, ! -1, 207, -1, 202, -1, 4, -1, 75, 309, -1, ! 80, 309, -1, 310, -1, 114, 66, 108, 83, -1, ! 114, 66, 219, 83, -1, 167, -1, 164, 88, 132, ! 167, -1, 169, -1, 165, 88, 132, 169, -1, -1, ! 27, 66, 124, 83, -1, -1, 193, 166, 171, 43, ! 168, 177, -1, 193, 166, 171, -1, -1, 198, 166, ! 171, 43, 170, 177, -1, 198, 166, 171, -1, -1, ! 172, -1, 173, -1, 172, 173, -1, 30, 66, 66, ! 174, 83, 83, -1, 175, -1, 174, 88, 175, -1, ! -1, 176, -1, 176, 66, 3, 83, -1, 176, 66, ! 3, 88, 110, 83, -1, 176, 66, 109, 83, -1, ! 106, -1, 5, -1, 6, -1, 7, -1, 116, -1, ! -1, 89, 178, 179, 85, -1, 1, -1, -1, 180, ! 208, -1, 181, -1, 180, 88, 181, -1, 185, 43, ! 183, -1, 186, 183, -1, -1, 106, 46, 182, 183, ! -1, 183, -1, -1, 89, 184, 179, 85, -1, 116, ! -1, 1, -1, 186, -1, 185, 186, -1, 65, 106, ! -1, -1, -1, 193, 188, 126, 189, 253, 254, 247, ! -1, -1, -1, 198, 191, 126, 192, 253, 254, 247, ! -1, 194, -1, 198, -1, 66, 171, 194, 83, -1, ! 194, 66, 287, -1, 194, 227, -1, 58, 158, 194, ! -1, 4, -1, 80, -1, 196, -1, 197, -1, 196, ! 66, 287, -1, 196, 227, -1, 4, -1, 80, -1, ! 197, 66, 287, -1, 197, 227, -1, 58, 158, 196, ! -1, 58, 158, 197, -1, 66, 171, 197, 83, -1, ! 198, 66, 287, -1, 66, 171, 198, 83, -1, 58, ! 158, 198, -1, 198, 227, -1, 3, -1, 13, -1, ! 13, 172, -1, 14, -1, 14, 172, -1, 12, -1, ! 12, 172, -1, -1, 199, 106, 89, 203, 210, 85, ! 171, -1, 199, 89, 210, 85, 171, -1, -1, 200, ! 106, 89, 204, 210, 85, 171, -1, 200, 89, 210, ! 85, 171, -1, -1, 201, 106, 89, 205, 217, 209, ! 85, 171, -1, -1, 201, 89, 206, 217, 209, 85, ! 171, -1, 199, 106, -1, 200, 106, -1, 201, 106, ! -1, -1, 88, -1, -1, 88, -1, 211, -1, 211, ! 212, -1, -1, 211, 212, 84, -1, 211, 84, -1, ! 73, 66, 75, 83, -1, 154, 131, 213, -1, 154, ! 131, 253, 254, -1, 155, 131, 214, -1, 155, -1, ! 1, -1, 292, 212, -1, 215, -1, 213, 88, 132, ! 215, -1, 216, -1, 214, 88, 132, 216, -1, 253, ! 254, 193, 171, -1, 253, 254, 193, 46, 116, 171, ! -1, 253, 254, 46, 116, 171, -1, 253, 254, 198, ! 171, -1, 253, 254, 198, 46, 116, 171, -1, 253, ! 254, 46, 116, 171, -1, 218, -1, 217, 88, 218, ! -1, 1, -1, 106, -1, 106, 43, 116, -1, -1, ! 156, 220, 221, -1, -1, 223, -1, -1, 223, -1, ! 224, 172, -1, 225, -1, 224, -1, 226, -1, 58, ! 158, 224, -1, 58, 158, -1, 58, 158, 225, -1, ! 66, 171, 223, 83, -1, 226, 66, 277, -1, 226, ! 227, -1, 66, 277, -1, 227, -1, 67, 108, 90, ! -1, 67, 156, 108, 90, -1, 67, 90, -1, 67, ! 156, 90, -1, 67, 58, 90, -1, 67, 156, 58, ! 90, -1, 67, 5, 108, 90, -1, 67, 5, 156, ! 108, 90, -1, 67, 156, 5, 108, 90, -1, 229, ! -1, 230, -1, 231, -1, 232, -1, 257, -1, 229, ! 257, -1, 230, 257, -1, 231, 257, -1, 232, 257, ! -1, 130, -1, 229, 130, -1, 230, 130, -1, 232, ! 130, -1, 258, -1, 229, 258, -1, 230, 258, -1, ! 231, 258, -1, 232, 258, -1, 234, -1, 233, 234, ! -1, 229, -1, 230, -1, 231, -1, 232, -1, 1, ! 84, -1, -1, -1, -1, -1, -1, 240, -1, 241, ! -1, 240, 241, -1, 32, 291, 84, -1, 247, -1, ! 1, 247, -1, 89, -1, 85, -1, 235, 239, 245, ! 85, 236, -1, 228, -1, 1, -1, 66, 89, -1, ! 243, 244, -1, 249, 256, -1, 249, 1, -1, -1, ! 15, 250, 66, 108, 83, -1, -1, 18, 252, 256, ! 17, -1, -1, -1, 257, -1, 258, 255, -1, 237, ! 255, 238, -1, 253, 254, 269, -1, 253, 254, 270, ! -1, -1, 248, 16, 260, 256, -1, 248, -1, 248, ! 16, 1, -1, -1, -1, 17, 261, 66, 108, 83, ! 262, 256, -1, 251, 66, 108, 83, 84, -1, 251, ! 1, -1, -1, -1, -1, -1, 19, 263, 66, 268, ! 264, 272, 84, 265, 272, 83, 266, 256, -1, -1, ! 20, 66, 108, 83, 267, 256, -1, 272, 84, -1, ! 133, -1, 247, -1, 108, 84, -1, 237, 259, 238, ! -1, 23, 84, -1, 24, 84, -1, 25, 84, -1, ! 25, 108, 84, -1, 27, 271, 66, 108, 83, 84, ! -1, 27, 271, 66, 108, 46, 273, 83, 84, -1, ! 27, 271, 66, 108, 46, 273, 46, 273, 83, 84, ! -1, 27, 271, 66, 108, 46, 273, 46, 273, 46, ! 276, 83, 84, -1, 26, 106, 84, -1, 26, 58, ! 108, 84, -1, 84, -1, 21, 116, 46, -1, 21, ! 116, 10, 116, 46, -1, 22, 46, -1, 106, 253, ! 254, 46, 171, -1, -1, 7, -1, -1, 108, -1, ! -1, 274, -1, 275, -1, 274, 88, 275, -1, 9, ! 66, 108, 83, -1, 67, 106, 90, 9, 66, 108, ! 83, -1, 124, -1, 276, 88, 124, -1, -1, 171, ! 278, 279, -1, 282, 83, -1, -1, -1, 283, 84, ! 280, 171, 281, 279, -1, 1, 83, -1, -1, 10, ! -1, 283, -1, 283, 88, 10, -1, 285, -1, 283, ! 88, 284, -1, 150, 131, 195, 171, -1, 150, 131, ! 198, 171, -1, 150, 131, 222, -1, 151, 131, 198, ! 171, -1, 151, 131, 222, -1, 152, 286, 195, 171, ! -1, 152, 286, 198, 171, -1, 152, 286, 222, -1, ! 153, 286, 198, 171, -1, 153, 286, 222, -1, 131, ! -1, -1, 171, 288, 289, -1, 279, -1, 290, 83, ! -1, 3, -1, 290, 88, 3, -1, 106, -1, 291, ! 88, 106, -1, 31, -1, 297, -1, 295, -1, 296, ! -1, 307, -1, 318, -1, 71, -1, 106, -1, 294, ! 88, 106, -1, 81, 294, 84, -1, 82, 106, 106, ! 84, -1, -1, -1, 69, 106, 309, 89, 298, 311, ! 85, 299, 322, 71, -1, -1, 69, 106, 309, 300, ! 322, 71, -1, -1, -1, 69, 106, 46, 106, 309, ! 89, 301, 311, 85, 302, 322, 71, -1, -1, 69, ! 106, 46, 106, 309, 303, 322, 71, -1, -1, 70, ! 106, 89, 304, 311, 85, -1, 70, 106, -1, -1, ! 70, 106, 46, 106, 89, 305, 311, 85, -1, 70, ! 106, 46, 106, -1, -1, 69, 106, 66, 106, 83, ! 309, 306, 322, 71, -1, 70, 106, 66, 106, 83, ! -1, -1, 79, 106, 309, 308, 322, 71, -1, 79, ! 294, 84, -1, -1, 310, -1, 53, 294, 53, -1, ! 311, 312, 313, -1, 313, -1, 77, -1, 78, -1, ! 76, -1, -1, 313, 314, 84, -1, 313, 84, -1, ! 154, 131, 315, -1, 155, 131, 315, -1, 1, -1, ! -1, 316, -1, 315, 88, 132, 316, -1, 193, -1, ! 193, 46, 116, -1, 46, 116, -1, 56, -1, 57, ! -1, -1, -1, -1, 317, 319, 330, 320, 331, 321, ! 242, -1, -1, -1, 323, 324, -1, 327, -1, 98, ! -1, 324, 327, -1, -1, 324, 325, 98, -1, 84, ! -1, 1, -1, -1, -1, 317, 328, 330, 329, 326, ! -1, 66, 219, 83, 339, -1, 339, -1, 66, 219, ! 83, 340, 337, -1, 340, 337, -1, -1, 84, 332, ! -1, -1, 333, -1, 334, -1, 234, -1, 333, 334, ! -1, 334, 234, -1, 150, 131, 335, 84, -1, 150, ! 84, -1, 151, 84, -1, 336, -1, 335, 88, 336, ! -1, 195, 171, -1, 198, 171, -1, 222, -1, -1, ! 88, 10, -1, -1, 88, 338, 282, -1, 341, -1, ! 343, -1, 340, 343, -1, 3, -1, 4, -1, 75, ! -1, 80, -1, 342, -1, 12, -1, 13, -1, 14, ! -1, 15, -1, 16, -1, 17, -1, 18, -1, 19, ! -1, 20, -1, 21, -1, 22, -1, 23, -1, 24, ! -1, 25, -1, 26, -1, 27, -1, 11, -1, 28, ! -1, 29, -1, 6, -1, 7, -1, 341, 46, 66, ! 219, 83, 106, -1, 341, 46, 106, -1, 46, 66, ! 219, 83, 106, -1, 46, 106, -1, 341, -1, 345, ! -1, 347, -1, 345, 347, -1, 110, -1, 341, 46, ! 346, -1, 46, 346, -1, 108, -1, 75, -1, -1, ! -1, 67, 350, 348, 351, 344, 90, -1, 341, -1, ! 353, -1, 354, -1, 353, 354, -1, 341, 46, -1, ! 46, -1, 72, 66, 352, 83, -1, 79, 66, 106, ! 83, -1, 74, 66, 219, 83, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned short yyrline[] = { ! 0, 308, 308, 312, 327, 327, 328, 328, 332, 333, ! 334, 335, 343, 348, 355, 357, 359, 361, 362, 363, ! 370, 375, 369, 381, 384, 389, 383, 395, 398, 403, ! 397, 409, 414, 415, 416, 417, 420, 422, 424, 427, ! 429, 431, 433, 437, 443, 444, 448, 450, 455, 456, ! 459, 462, 466, 483, 489, 492, 495, 498, 500, 505, ! 509, 513, 517, 518, 523, 524, 526, 528, 530, 532, ! 534, 536, 538, 540, 542, 544, 546, 549, 548, 555, ! 554, 561, 564, 560, 570, 569, 579, 586, 597, 603, ! 604, 606, 609, 608, 621, 626, 628, 644, 651, 653, ! 656, 666, 676, 678, 685, 694, 696, 698, 700, 702, ! 704, 706, 712, 713, 722, 724, 728, 730, 731, 742, ! 747, 748, 749, 750, 758, 760, 762, 765, 774, 783, ! 793, 798, 800, 802, 804, 806, 808, 865, 868, 871, ! 877, 883, 886, 892, 895, 901, 904, 907, 910, 913, ! 916, 919, 925, 928, 931, 934, 937, 940, 946, 949, ! 952, 955, 958, 961, 967, 970, 973, 976, 979, 985, ! 988, 991, 994, 1000, 1006, 1012, 1021, 1027, 1030, 1033, ! 1039, 1045, 1051, 1060, 1066, 1069, 1072, 1075, 1078, 1081, ! 1084, 1090, 1096, 1102, 1111, 1114, 1117, 1120, 1123, 1129, ! 1132, 1135, 1138, 1141, 1144, 1147, 1153, 1159, 1165, 1174, ! 1177, 1180, 1183, 1186, 1193, 1194, 1195, 1196, 1197, 1198, ! 1199, 1200, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, ! 1215, 1216, 1217, 1218, 1222, 1223, 1224, 1225, 1229, 1230, ! 1231, 1232, 1236, 1237, 1238, 1239, 1243, 1244, 1245, 1246, ! 1247, 1248, 1249, 1250, 1254, 1255, 1256, 1257, 1258, 1259, ! 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, ! 1275, 1276, 1302, 1303, 1307, 1311, 1313, 1317, 1321, 1325, ! 1327, 1332, 1334, 1336, 1343, 1344, 1348, 1349, 1354, 1355, ! 1363, 1362, 1370, 1379, 1378, 1386, 1395, 1396, 1401, 1403, ! 1408, 1413, 1415, 1421, 1422, 1424, 1426, 1428, 1436, 1437, ! 1438, 1439, 1445, 1447, 1446, 1450, 1457, 1459, 1463, 1464, ! 1470, 1473, 1477, 1476, 1482, 1487, 1486, 1490, 1492, 1496, ! 1497, 1501, 1510, 1522, 1509, 1540, 1552, 1539, 1572, 1573, ! 1579, 1581, 1586, 1588, 1590, 1591, 1599, 1600, 1604, 1609, ! 1611, 1612, 1616, 1621, 1623, 1625, 1627, 1635, 1640, 1642, ! 1644, 1646, 1650, 1652, 1657, 1659, 1664, 1666, 1678, 1677, ! 1683, 1688, 1687, 1691, 1696, 1695, 1701, 1700, 1708, 1710, ! 1712, 1720, 1722, 1725, 1727, 1733, 1735, 1741, 1742, 1744, ! 1748, 1764, 1767, 1777, 1780, 1785, 1787, 1793, 1794, 1799, ! 1800, 1805, 1808, 1812, 1818, 1821, 1825, 1836, 1837, 1842, ! 1848, 1850, 1856, 1855, 1864, 1865, 1870, 1873, 1877, 1884, ! 1885, 1889, 1890, 1895, 1897, 1902, 1904, 1906, 1908, 1910, ! 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1933, 1937, 1950, ! 1951, 1952, 1956, 1960, 1961, 1962, 1963, 1964, 1968, 1969, ! 1972, 1973, 1977, 1978, 1979, 1980, 1981, 1985, 1986, 1990, ! 1991, 1992, 1993, 1996, 2000, 2009, 2014, 2032, 2046, 2048, ! 2054, 2055, 2059, 2073, 2075, 2078, 2082, 2084, 2092, 2093, ! 2097, 2114, 2122, 2127, 2140, 2139, 2154, 2153, 2173, 2179, ! 2185, 2186, 2191, 2197, 2211, 2221, 2220, 2228, 2240, 2251, ! 2254, 2250, 2260, 2263, 2266, 2270, 2273, 2276, 2265, 2280, ! 2279, 2287, 2289, 2295, 2297, 2300, 2304, 2307, 2310, 2313, ! 2316, 2320, 2324, 2329, 2333, 2345, 2351, 2359, 2362, 2365, ! 2368, 2385, 2387, 2393, 2394, 2400, 2401, 2405, 2406, 2411, ! 2413, 2418, 2420, 2431, 2430, 2441, 2443, 2451, 2442, 2455, ! 2462, 2463, 2473, 2475, 2480, 2482, 2489, 2494, 2499, 2502, ! 2508, 2516, 2521, 2526, 2529, 2535, 2541, 2551, 2550, 2561, ! 2562, 2580, 2582, 2588, 2590, 2595, 2605, 2606, 2607, 2608, ! 2609, 2610, 2625, 2627, 2632, 2639, 2647, 2653, 2646, 2664, ! 2663, 2677, 2683, 2676, 2694, 2693, 2707, 2706, 2718, 2727, ! 2726, 2738, 2747, 2746, 2759, 2770, 2769, 2784, 2792, 2795, ! 2799, 2809, 2810, 2814, 2815, 2816, 2821, 2824, 2825, 2843, ! 2846, 2849, 2855, 2856, 2857, 2861, 2868, 2874, 2884, 2886, ! 2892, 2898, 2907, 2891, 2920, 2922, 2922, 2926, 2927, 2928, ! 2929, 2929, 2933, 2934, 2939, 2944, 2938, 2956, 2961, 2966, ! 2971, 2980, 2982, 2988, 2990, 2994, 2995, 2996, 2997, 3001, ! 3003, 3005, 3010, 3012, 3020, 3024, 3028, 3034, 3037, 3043, ! 3042, 3055, 3059, 3061, 3068, 3069, 3070, 3071, 3072, 3076, ! 3076, 3076, 3076, 3076, 3076, 3076, 3076, 3077, 3077, 3077, ! 3077, 3077, 3077, 3078, 3078, 3078, 3078, 3078, 3079, 3079, ! 3083, 3088, 3093, 3098, 3105, 3106, 3110, 3111, 3119, 3131, ! 3135, 3142, 3143, 3151, 3153, 3150, 3161, 3162, 3166, 3167, ! 3174, 3178, 3185, 3192, 3201 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "IDENTIFIER", "TYPENAME", "SCSPEC", "TYPESPEC", "TYPE_QUAL", "CONSTANT", "STRING", "ELLIPSIS", "SIZEOF", "ENUM", "STRUCT", "UNION", "IF", "ELSE", "WHILE", "DO", "FOR", "SWITCH", "CASE", "DEFAULT", "BREAK", "CONTINUE", "RETURN", "GOTO", "ASM_KEYWORD", "TYPEOF", "ALIGNOF", "ATTRIBUTE", "EXTENSION", "LABEL", "REALPART", "IMAGPART", "VA_ARG", "CHOOSE_EXPR", "TYPES_COMPATIBLE_P", "PTR_VALUE", ! "PTR_BASE", "PTR_EXTENT", "STRING_FUNC_NAME", "VAR_FUNC_NAME", "'='", ! "ASSIGN", "'?'", "':'", "OROR", "ANDAND", "'|'", "'^'", "'&'", ! "EQCOMPARE", "ARITHCOMPARE", "RSHIFT", "LSHIFT", "'+'", "'-'", "'*'", ! "'/'", "'%'", "MINUSMINUS", "PLUSPLUS", "UNARY", "HYPERUNARY", "'.'", ! "'('", "'['", "POINTSAT", "INTERFACE", "IMPLEMENTATION", "END", ! "SELECTOR", "DEFS", "ENCODE", "CLASSNAME", "PUBLIC", "PRIVATE", ! "PROTECTED", "PROTOCOL", "OBJECTNAME", "CLASS", "ALIAS", "')'", "';'", ! "'}'", "'~'", "'!'", "','", "'{'", "']'", "'@'", "$accept", "program", ! "extdefs", "@1", "@2", "extdef", "datadef", "fndef", "@3", "@4", "@5", ! "@6", "@7", "@8", "identifier", "unop", "expr", "exprlist", ! "nonnull_exprlist", "unary_expr", "sizeof", "alignof", "typeof", ! "cast_expr", "expr_no_commas", "@9", "@10", "@11", "@12", "@13", ! "primary", "@14", "string", "objc_string", "old_style_parm_decls", ! "lineno_datadecl", "datadecls", "datadecl", "lineno_decl", "setspecs", ! "maybe_resetattrs", "decl", "declspecs_nosc_nots_nosa_noea", ! "declspecs_nosc_nots_nosa_ea", "declspecs_nosc_nots_sa_noea", ! "declspecs_nosc_nots_sa_ea", "declspecs_nosc_ts_nosa_noea", ! "declspecs_nosc_ts_nosa_ea", "declspecs_nosc_ts_sa_noea", ! "declspecs_nosc_ts_sa_ea", "declspecs_sc_nots_nosa_noea", ! "declspecs_sc_nots_nosa_ea", "declspecs_sc_nots_sa_noea", ! "declspecs_sc_nots_sa_ea", "declspecs_sc_ts_nosa_noea", ! "declspecs_sc_ts_nosa_ea", "declspecs_sc_ts_sa_noea", ! "declspecs_sc_ts_sa_ea", "declspecs_ts", "declspecs_nots", ! "declspecs_ts_nosa", "declspecs_nots_nosa", "declspecs_nosc_ts", ! "declspecs_nosc_nots", "declspecs_nosc", "declspecs", ! "maybe_type_quals_attrs", "typespec_nonattr", "typespec_attr", ! "typespec_reserved_nonattr", "typespec_reserved_attr", "typespec_nonreserved_nonattr", "initdecls", "notype_initdecls", "maybeasm", "initdcl", "@15", "notype_initdcl", "@16", "maybe_attribute", "attributes", "attribute", "attribute_list", *************** static const char *const yytname[] = *** 723,1912 **** }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 92, 92, 94, 93, 95, 93, 96, 96, 96, ! 96, 96, 97, 97, 97, 97, 97, 97, 97, 99, ! 100, 98, 98, 101, 102, 98, 98, 103, 104, 98, ! 98, 105, 105, 105, 105, 106, 106, 106, 106, 106, ! 106, 106, 107, 108, 108, 109, 109, 110, 110, 110, ! 110, 110, 110, 110, 110, 110, 110, 110, 111, 112, ! 113, 114, 114, 115, 115, 115, 115, 115, 115, 115, ! 115, 115, 115, 115, 115, 115, 116, 115, 117, 115, ! 118, 119, 115, 120, 115, 115, 115, 121, 121, 121, ! 121, 122, 121, 121, 121, 121, 121, 121, 121, 121, ! 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, ! 121, 123, 123, 124, 124, 125, 125, 125, 126, 127, ! 127, 127, 127, 128, 128, 128, 128, 129, 130, 131, ! 132, 132, 132, 132, 132, 132, 133, 133, 133, 134, ! 135, 135, 136, 136, 137, 137, 137, 137, 137, 137, ! 137, 138, 138, 138, 138, 138, 138, 139, 139, 139, ! 139, 139, 139, 140, 140, 140, 140, 140, 141, 141, ! 141, 141, 141, 141, 141, 142, 143, 143, 143, 143, ! 143, 143, 144, 145, 145, 145, 145, 145, 145, 145, ! 145, 145, 145, 146, 146, 146, 146, 146, 147, 147, ! 147, 147, 147, 147, 147, 147, 147, 147, 148, 148, ! 148, 148, 148, 149, 149, 149, 149, 149, 149, 149, ! 149, 150, 150, 150, 150, 150, 150, 150, 150, 151, ! 151, 151, 151, 152, 152, 152, 152, 153, 153, 153, ! 153, 154, 154, 154, 154, 155, 155, 155, 155, 155, ! 155, 155, 155, 156, 156, 156, 156, 156, 156, 156, ! 156, 156, 156, 156, 156, 156, 156, 156, 156, 157, ! 157, 158, 158, 159, 160, 160, 161, 162, 162, 162, ! 162, 162, 162, 163, 163, 164, 164, 165, 165, 167, ! 166, 166, 169, 168, 168, 170, 170, 171, 171, 172, ! 173, 173, 174, 174, 174, 174, 174, 175, 175, 175, ! 175, 176, 177, 176, 176, 178, 178, 179, 179, 180, ! 180, 181, 180, 180, 183, 182, 182, 182, 184, 184, ! 185, 187, 188, 186, 190, 191, 189, 192, 192, 193, ! 193, 193, 193, 193, 193, 194, 194, 195, 195, 195, ! 195, 196, 196, 196, 196, 196, 197, 197, 197, 197, ! 197, 198, 198, 199, 199, 200, 200, 202, 201, 201, ! 203, 201, 201, 204, 201, 205, 201, 206, 206, 206, ! 207, 207, 208, 208, 209, 209, 210, 210, 210, 210, ! 211, 211, 211, 211, 211, 211, 212, 212, 213, 213, ! 214, 214, 214, 215, 215, 215, 216, 216, 216, 217, ! 217, 219, 218, 220, 220, 221, 221, 221, 222, 222, ! 223, 223, 224, 224, 225, 225, 225, 225, 225, 226, ! 226, 226, 226, 226, 226, 226, 226, 226, 227, 227, ! 227, 227, 228, 228, 228, 228, 228, 229, 229, 229, ! 229, 230, 230, 230, 230, 230, 231, 231, 232, 232, ! 232, 232, 233, 234, 235, 236, 237, 238, 238, 239, ! 239, 240, 241, 241, 242, 243, 243, 244, 244, 245, ! 246, 247, 247, 249, 248, 251, 250, 252, 253, 254, ! 254, 255, 256, 257, 259, 258, 258, 258, 260, 261, ! 258, 258, 258, 262, 263, 264, 265, 258, 266, 258, ! 267, 267, 268, 268, 268, 268, 268, 268, 268, 268, ! 268, 268, 268, 268, 268, 268, 269, 269, 269, 269, ! 270, 270, 271, 271, 272, 272, 273, 273, 274, 274, ! 275, 275, 277, 276, 278, 279, 280, 278, 278, 281, ! 281, 281, 281, 282, 282, 283, 283, 283, 283, 283, ! 284, 284, 284, 284, 284, 285, 287, 286, 288, 288, ! 289, 289, 290, 290, 291, 292, 292, 292, 292, 292, ! 292, 293, 293, 294, 295, 297, 298, 296, 299, 296, ! 300, 301, 296, 302, 296, 303, 296, 296, 304, 296, ! 296, 305, 296, 296, 307, 306, 306, 308, 308, 309, ! 310, 310, 311, 311, 311, 312, 312, 312, 313, 313, ! 313, 314, 314, 314, 315, 315, 315, 316, 316, 318, ! 319, 320, 317, 321, 322, 321, 323, 323, 323, 324, ! 323, 325, 325, 327, 328, 326, 329, 329, 329, 329, ! 330, 330, 331, 331, 332, 332, 332, 332, 333, 333, ! 333, 334, 334, 335, 335, 335, 336, 336, 337, 336, ! 338, 339, 339, 340, 340, 340, 340, 340, 341, 341, ! 341, 341, 341, 341, 341, 341, 341, 341, 341, 341, ! 341, 341, 341, 341, 341, 341, 341, 341, 341, 342, ! 342, 342, 342, 343, 343, 344, 344, 345, 346, 346, ! 347, 347, 349, 350, 348, 351, 351, 352, 352, 353, ! 353, 354, 355, 356 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 0, 1, 0, 2, 0, 3, 1, 1, 1, ! 5, 2, 3, 4, 4, 2, 2, 2, 1, 0, ! 0, 9, 4, 0, 0, 9, 4, 0, 0, 8, ! 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 0, 1, 1, 3, 1, 2, 2, ! 2, 2, 2, 4, 2, 4, 2, 2, 1, 1, ! 1, 1, 4, 1, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 0, 4, 0, 4, ! 0, 0, 7, 0, 5, 3, 3, 1, 1, 1, ! 1, 0, 7, 3, 3, 3, 3, 4, 6, 8, ! 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, ! 1, 1, 2, 2, 3, 0, 1, 2, 3, 1, ! 1, 2, 2, 4, 4, 2, 2, 3, 0, 1, ! 4, 4, 3, 3, 2, 2, 1, 2, 2, 2, ! 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, ! 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, - 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, - 1, 4, 4, 1, 4, 1, 4, 0, 4, 0, - 6, 3, 0, 6, 3, 0, 1, 1, 2, 6, - 1, 3, 0, 1, 4, 6, 4, 1, 1, 1, - 1, 1, 0, 4, 1, 0, 2, 1, 3, 3, - 2, 0, 4, 1, 0, 4, 1, 1, 1, 2, - 2, 0, 0, 7, 0, 0, 7, 1, 1, 4, - 3, 2, 3, 1, 1, 1, 1, 3, 2, 1, - 1, 3, 2, 3, 3, 4, 3, 4, 3, 2, - 1, 1, 2, 1, 2, 1, 2, 0, 7, 5, - 0, 7, 5, 0, 8, 0, 7, 2, 2, 2, - 0, 1, 0, 1, 1, 2, 0, 3, 2, 4, - 3, 4, 3, 1, 1, 2, 1, 4, 1, 4, - 4, 6, 5, 4, 6, 5, 1, 3, 1, 1, - 3, 0, 3, 0, 1, 0, 1, 2, 1, 1, - 1, 3, 2, 3, 4, 3, 2, 2, 1, 3, - 4, 2, 3, 3, 4, 4, 5, 5, 1, 1, - 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, - 2, 1, 2, 2, 2, 2, 1, 2, 1, 1, - 1, 1, 2, 0, 0, 0, 0, 0, 1, 1, - 2, 3, 1, 2, 1, 1, 5, 1, 1, 2, - 2, 2, 2, 0, 5, 0, 4, 0, 0, 1, - 2, 3, 3, 3, 0, 4, 1, 3, 0, 0, - 7, 5, 2, 0, 0, 0, 0, 12, 0, 6, - 2, 1, 1, 2, 3, 2, 2, 2, 3, 6, - 8, 10, 12, 3, 4, 1, 3, 5, 2, 5, - 0, 1, 0, 1, 0, 1, 1, 3, 4, 7, - 1, 3, 0, 3, 2, 0, 0, 6, 2, 0, - 1, 1, 3, 1, 3, 4, 4, 3, 4, 3, - 4, 4, 3, 4, 3, 1, 0, 3, 1, 2, - 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, - 1, 1, 3, 3, 4, 0, 0, 10, 0, 6, - 0, 0, 12, 0, 8, 0, 6, 2, 0, 8, - 4, 0, 9, 5, 0, 6, 3, 0, 1, 3, - 3, 1, 1, 1, 1, 0, 3, 2, 3, 3, - 1, 0, 1, 4, 1, 3, 2, 1, 1, 0, - 0, 0, 7, 0, 0, 2, 1, 1, 2, 0, - 3, 1, 1, 0, 0, 5, 4, 1, 5, 2, - 0, 2, 0, 1, 1, 1, 2, 2, 4, 2, - 2, 1, 3, 2, 2, 1, 0, 2, 0, 3, - 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, ! 3, 5, 2, 1, 1, 1, 2, 1, 3, 2, ! 1, 1, 0, 0, 6, 1, 1, 1, 2, 2, ! 1, 4, 4, 4 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 3, 5, 0, 0, 0, 277, 168, 274, 136, 365, ! 361, 363, 0, 60, 0, 574, 0, 627, 628, 0, ! 0, 580, 607, 0, 607, 0, 0, 18, 4, 8, ! 7, 0, 0, 221, 222, 223, 224, 213, 214, 215, ! 216, 225, 226, 227, 228, 217, 218, 219, 220, 128, ! 128, 0, 144, 151, 271, 273, 272, 142, 297, 0, ! 0, 0, 276, 275, 0, 9, 576, 577, 575, 578, ! 280, 629, 579, 6, 16, 17, 366, 362, 364, 0, ! 0, 31, 32, 34, 33, 581, 0, 607, 597, 278, ! 608, 607, 0, 279, 0, 0, 0, 360, 269, 295, ! 0, 285, 0, 171, 137, 149, 155, 139, 172, 138, ! 150, 156, 178, 140, 161, 166, 143, 179, 141, 162, ! 167, 189, 145, 147, 153, 152, 190, 146, 148, 154, ! 204, 157, 159, 164, 163, 205, 158, 160, 165, 173, ! 169, 187, 196, 175, 174, 170, 188, 197, 180, 176, ! 202, 211, 182, 181, 177, 203, 212, 191, 183, 185, ! 194, 193, 192, 184, 186, 195, 206, 198, 200, 209, ! 208, 207, 199, 201, 210, 0, 0, 15, 298, 386, ! 377, 386, 378, 375, 379, 11, 0, 87, 88, 111, ! 58, 59, 0, 0, 0, 0, 0, 90, 0, 35, ! 37, 36, 0, 38, 39, 0, 712, 0, 0, 0, ! 40, 41, 0, 0, 0, 42, 61, 0, 0, 63, ! 45, 47, 89, 110, 0, 0, 106, 107, 108, 109, ! 302, 609, 0, 0, 0, 588, 0, 0, 595, 604, ! 606, 583, 0, 0, 249, 250, 251, 252, 245, 246, ! 247, 248, 411, 0, 241, 242, 243, 244, 270, 0, ! 0, 296, 12, 295, 30, 0, 295, 0, 0, 295, ! 359, 343, 269, 295, 344, 0, 283, 0, 337, 338, ! 0, 0, 0, 0, 0, 367, 0, 370, 0, 373, ! 673, 674, 697, 698, 694, 678, 679, 680, 681, 682, ! 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, ! 693, 695, 696, 0, 0, 675, 676, 630, 647, 666, ! 670, 677, 671, 56, 57, 0, 0, 0, 51, 48, ! 0, 479, 0, 0, 0, 0, 0, 0, 113, 50, ! 0, 0, 0, 52, 0, 54, 0, 0, 80, 78, ! 76, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 104, 105, 0, 0, 43, 0, 112, ! 0, 0, 475, 467, 0, 49, 308, 309, 310, 307, ! 0, 300, 303, 582, 607, 0, 585, 634, 600, 0, ! 615, 634, 584, 281, 413, 282, 358, 0, 0, 129, ! 0, 566, 356, 0, 0, 431, 0, 0, 0, 28, ! 0, 487, 120, 488, 294, 0, 0, 14, 295, 22, ! 0, 295, 295, 341, 13, 26, 0, 0, 295, 394, ! 388, 241, 242, 243, 244, 237, 238, 239, 240, 128, ! 128, 385, 0, 386, 295, 386, 408, 409, 382, 406, ! 0, 0, 702, 0, 650, 668, 649, 0, 672, 0, ! 0, 0, 0, 94, 93, 0, 711, 710, 713, 720, ! 715, 0, 716, 717, 0, 0, 10, 46, 0, 0, ! 86, 85, 0, 0, 0, 0, 74, 75, 73, 72, ! 71, 69, 70, 64, 65, 66, 67, 68, 103, 102, ! 0, 44, 0, 114, 96, 0, 0, 468, 469, 95, ! 0, 302, 43, 593, 607, 615, 0, 0, 598, 603, ! 0, 0, 0, 269, 295, 412, 414, 419, 418, 420, ! 428, 357, 286, 287, 0, 0, 0, 0, 433, 429, ! 0, 0, 432, 0, 462, 487, 122, 117, 121, 0, ! 292, 342, 0, 0, 20, 291, 340, 24, 0, 369, ! 487, 487, 387, 395, 0, 372, 0, 0, 383, 0, ! 382, 0, 0, 0, 631, 667, 549, 0, 700, 0, ! 0, 0, 91, 62, 0, 719, 721, 0, 718, 723, ! 722, 53, 55, 0, 0, 79, 77, 97, 101, 572, ! 0, 478, 447, 477, 487, 487, 487, 487, 0, 456, ! 0, 488, 442, 451, 470, 299, 301, 87, 0, 590, ! 634, 601, 0, 589, 637, 0, 128, 128, 643, 639, ! 636, 615, 614, 612, 613, 596, 615, 620, 617, 128, ! 128, 0, 605, 422, 542, 427, 295, 426, 288, 0, ! 570, 550, 233, 234, 229, 230, 235, 236, 231, 232, ! 128, 128, 568, 0, 551, 553, 567, 0, 435, 0, ! 0, 434, 430, 488, 118, 128, 128, 0, 339, 284, ! 287, 487, 289, 487, 389, 390, 396, 488, 392, 398, ! 488, 295, 295, 410, 407, 295, 0, 0, 646, 666, ! 221, 222, 223, 224, 213, 214, 215, 216, 225, 226, ! 227, 228, 217, 218, 219, 220, 128, 0, 655, 651, ! 653, 0, 0, 669, 551, 0, 0, 0, 0, 0, ! 0, 703, 0, 704, 705, 81, 84, 471, 0, 448, ! 443, 452, 449, 444, 453, 488, 445, 454, 450, 446, ! 455, 457, 464, 465, 304, 0, 306, 615, 0, 634, ! 586, 0, 0, 0, 0, 638, 0, 0, 621, 621, ! 616, 421, 423, 0, 0, 542, 425, 548, 565, 415, ! 415, 544, 545, 0, 569, 0, 436, 437, 0, 125, ! 0, 126, 0, 314, 312, 311, 293, 488, 0, 488, ! 295, 391, 295, 0, 368, 371, 376, 295, 701, 648, ! 659, 415, 660, 656, 657, 0, 474, 632, 463, 472, ! 0, 98, 0, 100, 327, 87, 0, 324, 0, 326, ! 0, 380, 317, 323, 0, 0, 707, 709, 0, 714, ! 0, 706, 0, 573, 465, 476, 277, 0, 0, 0, ! 0, 0, 0, 530, 607, 607, 525, 487, 0, 127, ! 128, 128, 0, 0, 512, 492, 493, 0, 0, 0, ! 594, 0, 634, 644, 640, 599, 0, 624, 618, 622, ! 619, 424, 543, 349, 269, 295, 350, 295, 345, 346, ! 295, 562, 416, 419, 269, 295, 295, 564, 295, 552, ! 128, 128, 554, 571, 29, 0, 0, 0, 0, 290, ! 0, 487, 0, 295, 487, 0, 295, 374, 295, 295, ! 665, 0, 661, 473, 480, 699, 0, 330, 0, 321, ! 92, 0, 316, 0, 329, 320, 708, 82, 0, 528, ! 515, 516, 517, 0, 0, 0, 531, 0, 488, 513, ! 0, 0, 134, 483, 498, 485, 503, 0, 496, 0, ! 0, 466, 135, 305, 591, 602, 0, 0, 626, 0, ! 295, 422, 542, 560, 295, 348, 295, 352, 561, 417, ! 422, 542, 563, 546, 415, 415, 123, 124, 0, 21, ! 25, 397, 488, 295, 0, 400, 399, 295, 0, 403, ! 663, 664, 658, 415, 99, 0, 0, 318, 319, 0, ! 526, 518, 0, 523, 0, 0, 0, 132, 331, 0, ! 133, 334, 0, 0, 465, 0, 0, 0, 482, 487, ! 481, 502, 0, 514, 634, 587, 642, 641, 645, 625, ! 0, 353, 354, 0, 347, 351, 0, 295, 295, 557, ! 295, 559, 313, 0, 402, 295, 405, 295, 662, 325, ! 322, 0, 524, 0, 295, 130, 0, 131, 0, 0, ! 0, 0, 532, 0, 497, 465, 466, 489, 487, 0, ! 0, 623, 355, 547, 555, 556, 558, 401, 404, 527, ! 534, 0, 529, 332, 335, 0, 0, 486, 533, 511, ! 504, 0, 508, 495, 491, 490, 0, 592, 0, 0, ! 0, 535, 536, 519, 487, 487, 484, 499, 532, 510, ! 465, 501, 0, 0, 534, 0, 0, 488, 488, 465, ! 0, 509, 0, 0, 0, 520, 537, 0, 0, 500, ! 505, 538, 0, 0, 0, 333, 336, 532, 0, 540, ! 0, 521, 0, 0, 0, 0, 506, 539, 522, 541, ! 465, 507, 0, 0, 0 }; static const short yydefgoto[] = { ! 1162, 1, 2, 3, 28, 29, 30, 420, 681, 426, ! 683, 268, 545, 828, 213, 332, 500, 215, 216, 217, ! 218, 31, 219, 220, 485, 484, 482, 842, 483, 221, ! 729, 222, 223, 409, 410, 411, 674, 602, 32, 398, ! 859, 244, 245, 246, 247, 248, 249, 250, 251, 41, ! 42, 43, 44, 45, 46, 47, 48, 49, 50, 660, ! 661, 439, 258, 252, 51, 259, 52, 53, 54, 55, ! 56, 275, 100, 269, 276, 798, 101, 677, 399, 261, ! 58, 380, 381, 382, 796, 907, 830, 831, 832, 1006, ! 833, 928, 834, 835, 1017, 1066, 1114, 1020, 1068, 1115, ! 680, 278, 918, 888, 889, 279, 59, 60, 61, 62, ! 443, 445, 450, 288, 63, 932, 569, 283, 284, 441, ! 685, 688, 686, 689, 448, 449, 253, 394, 525, 920, ! 892, 893, 528, 529, 270, 603, 604, 605, 606, 607, ! 608, 412, 373, 845, 1029, 1033, 506, 507, 508, 817, ! 818, 374, 610, 224, 819, 958, 959, 1022, 960, 1024, ! 413, 549, 1076, 1030, 1077, 1078, 961, 1075, 1023, 1129, ! 1025, 1118, 1147, 1160, 1120, 1100, 865, 866, 947, 1101, ! 1110, 1111, 1112, 1150, 645, 774, 662, 898, 1046, 663, ! 664, 902, 665, 779, 402, 535, 666, 667, 600, 225, ! 65, 86, 66, 67, 68, 515, 872, 387, 757, 1034, ! 620, 390, 631, 759, 69, 391, 89, 70, 520, 636, ! 521, 641, 878, 879, 71, 72, 186, 454, 722, 516, ! 517, 629, 764, 1038, 630, 763, 967, 317, 574, 719, ! 720, 721, 921, 922, 456, 576, 318, 319, 320, 321, ! 322, 732, 733, 837, 734, 468, 226, 334, 584, 471, ! 472, 473, 227, 228, 229 }; static const short yypact[] = { ! 147, 180, 4042, 4042, 594,-32768,-32768,-32768,-32768, 128, ! 128, 128, 152,-32768, 182,-32768, 356,-32768,-32768, 356, ! 356,-32768, 215, 356, 215, 356, 356,-32768,-32768,-32768, ! -32768, 213, 143, 1192, 1596, 1289, 4217, 768, 478, 925, ! 517, 3020, 4243, 4189, 4254, 959, 1275, 1011, 1398,-32768, ! -32768, 206,-32768,-32768,-32768,-32768,-32768, 128,-32768, 122, ! 350, 438,-32768,-32768, 4042,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 128, 128, 128, 3421, ! 245,-32768,-32768,-32768,-32768,-32768, 197, 398, 252,-32768, ! -32768, 60, 393,-32768, 394, 356, 3007,-32768, 276, 128, ! 432,-32768, 1505,-32768,-32768,-32768,-32768, 128,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 128,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768, 128,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768, 128,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 128,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768, 128,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 128,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 128,-32768,-32768,-32768,-32768, 459, 143,-32768,-32768, 261, ! 229, 261, 263,-32768, 269,-32768, 4345,-32768,-32768,-32768, ! -32768,-32768, 3421, 3421, 300, 324, 330,-32768, 356,-32768, ! -32768,-32768, 3421,-32768,-32768, 2261,-32768, 353, 362, 371, ! -32768,-32768, 446, 3421, 381, 418,-32768, 3488, 3555,-32768, ! 4889, 1203, 471, 378, 1905, 3421,-32768,-32768,-32768,-32768, ! 755,-32768, 356, 356, 356, 439, 356, 356,-32768,-32768, ! -32768,-32768, 441, 452, 1730, 4668, 3166, 4740, 810, 989, ! 1042, 1108,-32768, 455, 313, 536, 338, 539,-32768, 143, ! 143, 128,-32768, 128,-32768, 489, 128, 2759, 3822, 128, ! -32768,-32768, 276, 128,-32768, 460,-32768, 3717, 679, 698, ! 484, 3698, 491, 495, 3957,-32768, 514,-32768, 148,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 257, 4614,-32768,-32768,-32768,-32768, 3901, ! 525,-32768,-32768,-32768,-32768, 3421, 3421, 4614,-32768,-32768, ! 494,-32768, 503, 521, 3080, 4381, 4614, 356,-32768,-32768, ! 523, 3421, 2261,-32768, 2261,-32768, 3421, 3421, 590,-32768, ! -32768, 3421, 3421, 3421, 3421, 3421, 3421, 3421, 3421, 3421, ! 3421, 3421, 3421,-32768,-32768, 356, 356, 3421, 3421,-32768, ! 603, 531,-32768, 607, 564,-32768,-32768,-32768,-32768,-32768, ! 72,-32768, 582,-32768, 215, 584,-32768, 587, 580, 589, ! -32768, 587,-32768,-32768, 492,-32768, 698, 319, 143,-32768, ! 676,-32768,-32768, 3007, 3153,-32768, 602, 1611, 617,-32768, ! 1246, 99,-32768,-32768, 659, 459, 459,-32768, 128,-32768, ! 3822, 128, 128,-32768,-32768,-32768, 3822, 630, 128,-32768, ! -32768, 1730, 4668, 3166, 4740, 810, 989, 1042, 1108,-32768, ! 694, 624, 4302, 261, 128, 261,-32768, 670, 632,-32768, ! 148, 4614,-32768, 641, 642, 718,-32768, 525,-32768, 290, ! 1827, 4774, 644,-32768,-32768, 3220,-32768,-32768,-32768,-32768, ! 684, 653, 4381,-32768, 655, 660,-32768, 4889, 665, 685, ! 4889, 4889, 3421, 704, 3421, 3421, 1740, 2885, 1693, 890, ! 1127, 1342, 1342, 658, 658,-32768,-32768,-32768,-32768,-32768, ! 687, 418, 650,-32768,-32768, 356, 1994, 607,-32768,-32768, ! 709, 755, 3622, 664, 215,-32768, 724, 4074,-32768,-32768, ! 557, 3856, 732, 276, 128,-32768,-32768,-32768,-32768, 722, ! -32768,-32768,-32768, 139, 109, 3991, 715, 3421,-32768,-32768, ! 3421, 3287,-32768, 719,-32768,-32768,-32768,-32768,-32768, 4633, ! -32768, 679, 392, 459,-32768, 769,-32768,-32768, 736,-32768, ! -32768,-32768,-32768,-32768, 744,-32768, 747, 3421, 356, 754, ! 632, 738, 4425, 1726,-32768,-32768, 4489, 4614,-32768, 4614, ! 3421, 4614,-32768,-32768, 4461,-32768,-32768, 684,-32768,-32768, ! -32768, 753, 753, 800, 3421, 2228, 2400,-32768,-32768,-32768, ! 486, 617,-32768,-32768, 85, 98, 102, 123, 852,-32768, ! 772,-32768,-32768,-32768,-32768,-32768,-32768, 155, 781,-32768, ! 587,-32768, 568,-32768,-32768, 143,-32768,-32768,-32768, 416, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, 783,-32768, 492, 492,-32768, 128,-32768,-32768, 785, ! -32768,-32768, 4507, 4645, 1075, 978, 4518, 4698, 1128, 1450, ! -32768,-32768,-32768, 786, 499,-32768,-32768, 158,-32768, 782, ! 784,-32768,-32768,-32768,-32768, 789, 792, 2509,-32768,-32768, ! 853,-32768,-32768,-32768,-32768, 793,-32768,-32768, 794,-32768, ! -32768, 128, 128, 4889,-32768, 128, 798, 356,-32768, 3901, ! 4507, 4645, 4549, 4710, 1075, 978, 1219, 1479, 4518, 4698, ! 4561, 4727, 1128, 1450, 1278, 1517, 801, 803,-32768,-32768, ! 4603, 3803, 97,-32768, 802, 805, 809, 4792, 811, 1386, ! 3421, 850, 807, 4461,-32768,-32768, 2315,-32768, 356,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, 2670,-32768, 3421,-32768,-32768, 829, 587, ! -32768, 459, 143, 4345, 4132,-32768, 606, 3938, 368, 368, ! -32768,-32768,-32768, 818, 4160,-32768,-32768,-32768,-32768, 332, ! 430,-32768,-32768, 2772,-32768, 899,-32768,-32768, 97,-32768, ! 459,-32768, 143,-32768,-32768, 4889,-32768,-32768, 2509,-32768, ! 128, 511, 128, 454,-32768,-32768,-32768, 128,-32768,-32768, ! -32768, 332,-32768,-32768,-32768, 817,-32768,-32768, 824,-32768, ! 356,-32768, 3421,-32768,-32768, 864, 356,-32768, 869, 4889, ! 832, 833,-32768,-32768, 62, 2437, 418,-32768, 3421,-32768, ! 850,-32768, 3421,-32768, 2832,-32768, 874, 3421, 878, 841, ! 843, 3354, 618, 921, 277, 294,-32768,-32768, 845,-32768, ! -32768,-32768, 851, 1348,-32768,-32768,-32768, 2921, 191, 611, ! -32768, 882, 587,-32768,-32768,-32768, 3421, 894, 866,-32768, ! 866,-32768,-32768,-32768, 276, 128,-32768, 128, 733, 758, ! 145,-32768,-32768, 128, 276, 128, 145,-32768, 128,-32768, ! -32768,-32768,-32768,-32768,-32768, 501, 542, 1386, 97,-32768, ! 97,-32768, 3421, 115,-32768, 3421, 259,-32768, 128, 145, ! -32768, 566,-32768,-32768,-32768,-32768, 4816,-32768, 1386,-32768, ! -32768, 2350,-32768, 2581,-32768,-32768,-32768, 2315, 1807,-32768, ! -32768,-32768,-32768, 872, 3421, 876,-32768, 895,-32768,-32768, ! 459, 143,-32768,-32768,-32768,-32768,-32768, 896, 951, 2083, ! 110,-32768,-32768,-32768,-32768,-32768, 897, 101, 4889, 3421, ! 128, 332, 443,-32768, 128,-32768, 128,-32768,-32768, 128, ! 430, 430,-32768,-32768, 332, 430,-32768,-32768, 884,-32768, ! -32768,-32768,-32768, 4853, 3421,-32768,-32768, 4853, 3421,-32768, ! -32768,-32768,-32768, 332,-32768, 889, 2581,-32768,-32768, 3421, ! -32768,-32768, 891,-32768, 3421, 932, 575,-32768, 449, 586, ! -32768, 667, 912, 915,-32768, 930, 3421, 2172,-32768,-32768, ! -32768,-32768, 3421,-32768, 587,-32768,-32768,-32768,-32768, 4889, ! 368, 733, 758, 436,-32768,-32768, 4160, 128, 145,-32768, ! 145,-32768,-32768, 511,-32768, 4853,-32768, 4853,-32768,-32768, ! -32768, 4871,-32768, 81, 128,-32768, 3822,-32768, 3822, 3421, ! 3421, 982, 2921, 922,-32768,-32768,-32768,-32768,-32768, 927, ! 941,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! 111, 929,-32768,-32768,-32768, 937, 938,-32768,-32768,-32768, ! -32768, 942,-32768,-32768,-32768,-32768, 943,-32768, 955, 356, ! 90, 947,-32768,-32768,-32768,-32768,-32768,-32768, 3421,-32768, ! -32768,-32768, 3421, 948, 111, 953, 111,-32768,-32768,-32768, ! 958,-32768, 956, 1035, 116,-32768,-32768, 817, 817,-32768, ! -32768,-32768, 983, 676, 961,-32768,-32768, 3421, 3421, 471, ! 297,-32768, 968, 986, 987, 676,-32768,-32768,-32768, 471, ! -32768,-32768, 1073, 1074,-32768 }; static const short yypgoto[] = { ! -32768,-32768,-32768,-32768, 136, -493,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768, -16,-32768, 14, 565, -336, 620,-32768, ! -32768,-32768, -152, 706,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768, -398,-32768, -406, 674,-32768,-32768, 105, 354, -407, ! -818, 32, 67, 24, 92, 44, 131, 140, 169, -395, ! -382, -505, -491, -351, -346, -481, -472, -469, -454, 527, ! 543, -479, -268, -177, -730, -253, 1067, 1132, 1107, 1190, ! -32768, -713, -137, -269, 541,-32768, 699,-32768, 433, 19, ! -2,-32768, 588,-32768, 308,-32768, -545,-32768, 167,-32768, ! -770,-32768,-32768, 273,-32768,-32768,-32768,-32768,-32768,-32768, ! -174, 428, -722, 141, -109, 208,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, 547, -128,-32768, 677, ! -32768,-32768, 212, 216, 681, 558, 427,-32768,-32768, -708, ! -362, -343, -605,-32768, 390,-32768,-32768,-32768,-32768,-32768, ! -32768, -377,-32768,-32768, -675, 51,-32768,-32768, 622, -676, ! -32768, 320,-32768,-32768, -728,-32768,-32768,-32768,-32768,-32768, ! 657, -552, 59, -702, -349, -199,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -883, ! 25,-32768, 17,-32768, 502,-32768, -737,-32768,-32768, 574, ! 581,-32768,-32768, 490, -410,-32768,-32768,-32768,-32768, 3, ! -32768, 424,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, ! -32768,-32768,-32768,-32768,-32768,-32768, -6, -7, -426,-32768, ! 520,-32768, 391, 132, -420,-32768,-32768,-32768,-32768, -378, ! -32768,-32768,-32768,-32768, 549,-32768,-32768, 408,-32768,-32768, ! -32768, 474,-32768, 192, 508,-32768, 628, 636, -228,-32768, ! -283,-32768,-32768, 372, 476,-32768,-32768,-32768,-32768,-32768, ! -32768, 741,-32768,-32768,-32768 }; ! ! #define YYLAST 4949 ! ! static const short yytable[] = { ! 85, 277, 534, 87, 88, 64, 64, 91, 421, 85, ! 95, 553, 556, 522, 554, 90, 440, 90, 93, 415, ! 557, 57, 57, 862, 624, 864, 35, 35, 76, 77, ! 78, 501, 526, 546, 33, 33, 458, 882, 772, 280, ! 323, 324, 639, 180, 182, 184, 37, 37, 626, 962, ! 329, 527, 107, 286, 116, 178, 125, 887, 134, 753, ! 143, 339, 152, 627, 161, 935, 170, 64, 710, 34, ! 34, 891, 897, 375, 178, 178, 178, 905, 863, 242, ! 90, 235, 711, 57, 90, 239, -458, 923, 35, 622, ! 407, 457, 714, 214, 36, 36, 33, 628, 815, -459, ! -116, 715, 1036, -460, 716, 178, 933, 470, 37, 547, ! 243, 1031, 904, 16, 178, 57, 864, 57, 369, 717, ! 1108, 788, 256, 178, -461, 81, 82, 1090, 826, 609, ! 254, 34, 178, 38, 38, 801, 1124, 862, 803, 73, ! 656, 178, 39, 39, -581, 14, 97, -1, -581, 446, ! 178, 81, 82, 657, 656, 510, 36, 612, 14, 178, ! 511, 994, 1143, 1008, 1091, 255, 265, 657, 178, 863, ! -438, 40, 40, 1125, 440, 14, 501, 1032, 708, 1109, ! -2, 656, 328, -439, 658, 1037, 816, -440, -116, 659, ! 257, 709, 648, 844, 657, 38, 718, 83, 658, 1144, ! 185, 98, 84, 659, 39, 766, 266, 267, -441, 628, ! 99, 179, 266, 267, 379, 710, 383, 384, 385, 79, ! 388, 389, 712, 83, 57, 658, 537, 713, 84, 711, ! 659, 751, 989, 40, 990, 1130, 1060, 1016, 754, 714, ! 102, 784, 758, 755, 587, 908, 785, 910, 715, 80, ! 231, 716, 329, 640, 1099, 740, 743, 746, 749, 178, ! 81, 82, 1047, 107, 1152, 116, 717, 125, 16, 134, ! 643, 874, 447, 107, 963, 116, 1049, 1051, 710, 341, ! 96, 406, 773, 8, 860, 232, 57, 442, 639, 14, ! 177, 57, 711, 81, 82, 626, 256, 452, 236, 861, ! 771, 527, 714, 57, 254, 998, 14, 613, 433, 1083, ! 627, 715, 230, 583, 900, 564, 431, 566, 285, 237, ! 104, 475, 1071, -34, 451, 708, 266, 267, 435, 901, ! 16, 869, 83, 57, 282, 97, 883, 84, 709, 255, ! -33, 238, 862, 14, 814, 113, 57, 16, 467, 498, ! 499, 432, 287, 81, 82, 57, 731, 577, 289, 81, ! 82, 57, 988, 57, 257, 83, 772, 325, 14, 712, ! 84, 97, 271, 1103, 713, 772, 434, 90, 513, 656, ! 1154, 871, 502, 1005, 281, 1155, 266, 267, 708, 329, ! 884, 326, 657, 911, 836, 914, 1015, 327, 860, 885, ! 267, 709, 531, 175, 176, 741, 744, 747, 750, 1145, ! 1146, 421, 886, 861, 876, 436, 458, 536, 1131, 868, ! 335, 543, 57, 658, 437, 83, 272, 1139, 659, 336, ! 84, 83, 712, 97, 447, 273, 84, 713, 337, 181, ! 1053, 81, 82, 578, 233, 442, 97, 92, 274, 94, ! 107, 16, 116, 438, 125, 338, 134, 97, 1161, 422, ! 267, 57, 97, 271, 340, 234, 433, 396, 397, 370, ! 57, 457, 17, 18, 431, 678, 265, 240, 241, -287, ! 369, 232, 232, 126, 7, 127, 435, -635, 894, 599, ! 9, 10, 11, -287, 966, 379, 593, 895, 267, 640, ! 915, 884, 836, 976, 267, 840, 341, 90, 621, 432, ! 885, 267, 98, 83, 97, 271, 262, 272, 84, 1082, ! 263, 99, 135, 7, 136, 392, 273, 183, 386, 9, ! 10, 11, 260, -287, 434, 393, 57, -287, 395, 274, ! 57, 35, 57, 109, 417, 433, 118, 256, 418, 33, ! 523, 669, 447, 431, 670, 254, 400, 912, 427, 524, ! 267, 37, -258, 1040, 1044, 435, 1045, 652, 424, 272, ! 737, 459, 263, 436, 738, 1137, 1138, 463, 273, 654, ! 428, 652, 437, 782, 34, 986, 464, 783, 432, 418, ! 255, 274, 57, 654, 877, 877, 57, 702, 57, 444, ! 57, -260, 653, 860, 465, 700, 533, 476, 652, 36, ! 773, 438, 503, 434, 504, 257, 653, 704, 861, 773, ! 654, 81, 82, 396, 397, 280, 987, 913, 771, 527, ! 263, 971, 333, 632, 633, 634, -83, 771, 527, 505, ! 701, 980, 635, 653, 632, 633, 634, 509, 38, 512, ! 1002, 656, 436, 760, 1003, 906, 1080, 39, -633, 1065, ! 1093, 437, 1094, 418, 657, 703, 655, 514, 423, 518, ! 1067, 107, 519, 125, 263, 143, 944, 161, 74, 75, ! 655, 808, 632, 633, 634, 189, 40, 632, 633, 634, ! 438, 875, 539, 83, 265, 658, 964, -287, 84, 401, ! 659, 544, 414, 550, 705, 558, 416, 655, 562, 739, ! 742, -287, 748, 706, 567, 375, 360, 361, 362, 107, ! 568, 116, 843, 125, 572, 134, 573, 143, 575, 152, ! 585, 161, 581, 170, 266, 267, 586, 857, 589, 57, ! 598, 453, 707, 590, 702, 1149, 422, 267, 591, 421, ! 594, -287, 700, 619, 462, -287, 867, 1159, 81, 82, ! 376, 377, 378, 474, 704, 266, 267, 858, 592, 478, ! 597, 479, 57, 121, 7, 122, 1018, 35, -393, -393, ! 9, 10, 11, 57, 530, 33, 57, 701, 35, 646, ! 267, 433, 615, 560, 561, 623, 33, 37, 14, 431, ! 974, 267, 57, 642, 925, 668, 652, 702, 37, 672, ! 927, 435, 703, 682, 1019, 700, 7, 122, 654, 684, ! 34, 697, 9, 10, 11, 976, 267, 704, 857, 691, ! 83, 34, 692, 533, 432, 84, 945, 343, 345, 695, ! 14, 653, 582, 551, 552, 36, 735, 90, 90, 93, ! 701, 705, -257, 408, 555, 401, 36, 752, 858, 434, ! 706, 559, 1042, 1043, 756, 943, 877, 770, 777, 781, ! 867, 625, 786, 789, 787, 703, 791, 565, 571, 913, ! 265, 800, 802, 807, 38, 810, 57, 812, 820, 707, ! 783, 35, 821, 39, 823, 38, 838, 839, 436, 33, ! 870, 881, 903, 57, 39, 655, 816, 437, 256, 372, ! -31, 37, 979, 57, 705, 929, 254, 930, 256, 647, ! -32, 931, 40, 706, 939, 940, 254, 941, 946, 949, ! 130, 7, 131, 40, 34, 952, 438, 9, 10, 11, ! 969, 423, 423, 355, 356, 357, 358, 359, 360, 361, ! 362, 255, 707, 965, 970, 14, 1011, 644, 1012, 36, ! 1013, 255, 1014, 1026, 157, 7, 158, 1027, 1035, 1052, ! 533, 9, 10, 11, 1059, 1062, 257, 178, 1064, 1069, ! 761, 762, 1070, 126, 7, 127, 257, 890, 896, 14, ! 9, 10, 11, 768, 769, 7, 127, 1072, 38, 1097, ! 533, 9, 10, 11, 725, 1102, 726, 39, 728, -259, ! 1106, 916, 1107, 1113, 778, 778, 166, 7, 167, 919, ! 1116, 1117, 1122, 9, 10, 11, 1119, 1121, 1063, 790, ! 792, 460, 461, 530, 530, 1126, 40, 1135, 1133, 1141, ! 1073, 14, 1140, -265, 1142, 1151, 1079, 477, 7, 131, ! 1148, 1156, 480, 481, 9, 10, 11, 486, 487, 488, ! 489, 490, 491, 492, 493, 494, 495, 496, 497, 1157, ! 811, 1158, 14, 1163, 1164, 867, 675, 618, 652, 775, ! 121, 7, 122, 1095, 1096, 548, 1098, 9, 10, 11, ! 654, 57, 676, 1123, 679, -267, 35, 532, 1007, 616, ! 105, 110, 114, 119, 33, 14, 909, 934, 141, 146, ! 150, 155, 1041, 653, 7, 136, 37, 696, 625, 563, ! 9, 10, 11, 991, 804, 805, 694, 1104, 806, 614, ! 996, 570, 1098, 157, 7, 158, 1132, 1105, 924, 34, ! 9, 10, 11, 1136, 123, 128, 132, 137, 776, 1134, ! 723, 780, 159, 164, 168, 173, 767, 724, 14, 1021, ! 880, 1098, 1153, 611, 36, 106, 111, 115, 120, 530, ! 530, 873, 1081, 142, 147, 151, 156, 655, 765, 396, ! 397, 356, 357, 358, 359, 360, 361, 362, 396, 397, ! 595, 596, 1048, 1050, 813, 1058, 5, 103, 7, 104, ! 698, 530, 673, 38, 9, 10, 11, 809, 699, 841, ! 936, 919, 39, 588, 950, 951, 0, 687, 690, 0, ! 13, 0, 14, 0, 130, 7, 131, 124, 129, 133, ! 138, 9, 10, 11, 0, 160, 165, 169, 174, 0, ! 917, 40, 0, 0, 0, 16, 0, 408, 0, 14, ! -119, -119, -119, -119, 984, 985, -119, 0, -119, -119, ! -119, 611, 611, 745, 611, 363, 364, 22, 365, 366, ! 367, 368, 24, 693, -119, 0, -253, 0, 975, 977, ! 162, 7, 163, 166, 7, 167, 727, 9, 10, 11, ! 9, 10, 11, 5, 112, 7, 113, 0, 0, -119, ! 736, 9, 10, 11, 0, 0, 0, 0, 14, 0, ! 0, 105, 110, 114, 119, 0, 0, 13, 972, 14, ! 973, -119, 0, 978, 0, 0, -119, 0, 981, 982, ! 0, 983, 0, 0, 0, -119, 0, 0, 797, 0, ! 799, 0, 16, 0, 0, 0, 995, 0, 0, 999, ! 0, 1000, 1001, 0, 0, 123, 128, 132, 137, -266, ! 0, 530, 530, 953, 22, 954, 955, 956, 957, 24, ! 530, 530, 0, -255, 530, 530, 106, 111, 115, 120, ! 0, 0, 0, 795, 0, 0, 0, 824, 0, 825, ! 82, 0, 0, 530, 188, 189, 0, 190, 358, 359, ! 360, 361, 362, 171, 7, 172, 0, 401, 0, 401, ! 9, 10, 11, 0, 0, 191, 0, 15, 0, 192, ! 193, 194, 195, 196, 0, 0, 1054, 0, 197, 0, ! 1056, 975, 977, 977, 198, 829, 0, 199, 124, 129, ! 133, 138, 200, 201, 202, 0, 0, 0, 203, 204, ! 0, 0, 826, 205, 206, 162, 7, 163, 207, 0, ! 208, 83, 9, 10, 11, 209, 84, 0, 0, 0, ! 0, -315, 210, 211, 0, 827, 0, 212, 0, 0, ! 1084, 1085, -268, 1086, 135, 7, 136, 0, 1087, 0, ! 1088, 9, 10, 11, 0, 0, 0, 1092, 105, 110, ! 114, 119, 0, 0, 795, 0, 264, 0, 0, -27, ! -27, -27, -27, 0, 948, 0, 0, -27, -27, -27, ! 0, 0, 171, 7, 172, 0, 0, 0, 926, 9, ! 10, 11, 265, -27, 0, -287, 0, 0, 0, 0, ! 0, 829, 123, 128, 132, 137, 0, 0, 937, -287, ! 0, 0, 0, 938, 0, 0, 0, 0, -27, 0, ! 0, 0, 0, 106, 111, 115, 120, 0, 992, 0, ! 0, 690, 266, 267, 0, 0, 0, 0, 0, 0, ! -27, 0, 968, 0, 0, -27, 0, 0, 0, -287, ! 0, 0, 0, -287, -27, 0, 0, 0, 0, 0, ! 5, 108, 7, 109, 0, 0, 0, 0, 9, 10, ! 11, 0, 0, 829, 187, 0, 540, 0, 993, 188, ! 189, 997, 190, 0, 13, 124, 129, 133, 138, 0, ! 0, 0, 0, 0, 829, 0, 0, 829, 0, 829, ! 191, 0, 15, 0, 192, 193, 194, 195, 196, 16, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 198, ! 0, 0, 199, 0, 0, 0, 0, 200, 201, 541, ! 0, 22, 0, 203, 204, 1039, 24, 0, 205, 206, ! -254, 0, 0, 207, 0, 208, 745, 0, 0, 0, ! 209, 0, 0, 0, 0, 0, 0, 210, 211, 0, ! 1055, 542, 212, 0, 1057, 0, 0, 0, 0, 0, ! 0, 0, 829, 0, 0, 1061, 0, 0, 0, 105, ! 110, 0, 0, 141, 146, 0, 0, 408, 0, 0, ! 5, 6, 7, 8, 5, 745, 7, 104, 9, 10, ! 11, 0, 9, 10, 11, 354, 355, 356, 357, 358, ! 359, 360, 361, 362, 13, 0, 14, 0, 13, 0, ! 14, 123, 128, 0, 0, 159, 164, 105, 110, 114, ! 119, 1127, 1128, 0, 0, 141, 146, 150, 155, 16, ! 0, 0, 0, 16, 106, 111, 0, 0, 142, 147, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, ! 362, 22, 0, 0, 0, 22, 24, 0, 0, 0, ! 24, 123, 128, 132, 137, -652, 0, 1009, 0, 159, ! 164, 168, 173, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 106, 111, 115, 120, 0, 0, 0, 0, ! 142, 147, 151, 156, 124, 129, 0, 0, 160, 165, ! 346, 347, 348, 1010, 349, 350, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 0, 0, ! 346, 347, 348, 0, 349, 350, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 0, 0, ! 0, 0, 0, 0, 124, 129, 133, 138, 0, 0, ! 0, 0, 160, 165, 169, 174, 371, 0, -463, -463, ! -463, -463, -463, -463, -463, 579, -463, -463, -463, -463, ! -463, 0, -463, -463, -463, -463, -463, -463, -463, -463, ! -463, -463, -463, -463, -463, -463, -463, -463, -463, -463, ! -463, -463, -463, 0, 0, 0, 0, -463, 0, 0, ! 0, 0, 0, -463, 0, 0, -463, 0, -463, 0, ! 0, -463, -463, -463, 0, 0, 0, -463, -463, 0, ! 0, 0, -463, -463, 0, 0, 0, -463, 0, -463, ! -463, 0, 0, 0, -463, -463, 0, 0, 0, -463, ! 372, -463, -463, 0, -463, 601, -463, -487, -487, -487, ! -487, -487, -487, -487, 0, -487, -487, -487, -487, -487, ! 0, -487, -487, -487, -487, -487, -487, -487, -487, -487, ! -487, -487, -487, -487, -487, -487, 0, -487, -487, -487, ! -487, -487, 0, 0, 0, 0, -487, 0, 0, 0, ! 0, 0, -487, 0, 0, -487, 0, -487, 0, 0, ! -487, -487, -487, 0, 0, 0, -487, -487, 0, 0, ! 0, -487, -487, 0, 0, 0, -487, 0, -487, -487, ! 0, 0, 0, -487, -487, 0, 0, 0, -487, 0, ! -487, -487, 0, -487, 1028, -487, -465, -465, 0, 0, ! 0, -465, -465, 0, -465, 0, 0, 0, -465, 0, ! -465, -465, -465, -465, -465, -465, -465, -465, -465, -465, ! -465, 0, -465, 0, -465, 0, -465, -465, -465, -465, ! -465, 0, 0, 0, 0, -465, 0, 0, 0, 0, ! 0, -465, 0, 0, -465, 0, 0, 0, 0, -465, ! -465, -465, 0, 0, 0, -465, -465, 0, 0, 0, ! -465, -465, 0, 0, 0, -465, 0, -465, -465, 0, ! 0, 0, -465, -465, 0, 0, 0, -465, 0, -465, ! -465, 0, -465, 1074, -465, -494, -494, 0, 0, 0, ! -494, -494, 0, -494, 0, 0, 0, -494, 0, -494, ! -494, -494, -494, -494, -494, -494, -494, -494, -494, -494, ! 0, -494, 0, -494, 0, -494, -494, -494, -494, -494, ! 0, 0, 0, 0, -494, 0, 0, 0, 0, 0, ! -494, 0, 0, -494, 0, 0, 0, 0, -494, -494, ! -494, 0, 0, 0, -494, -494, 0, 0, 0, -494, ! -494, 0, 0, 0, -494, 0, -494, -494, 0, 0, ! 0, -494, -494, 0, 0, 0, -494, 0, -494, -494, ! 0, -494, 330, -494, 187, 5, 0, 7, 8, 188, ! 189, 0, 190, 9, 10, 11, 350, 351, 352, 353, ! 354, 355, 356, 357, 358, 359, 360, 361, 362, 13, ! 191, 14, 15, 0, 192, 193, 194, 195, 196, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 198, ! 0, 0, 199, 0, 16, 0, 0, 200, 201, 202, ! 0, 0, 0, 203, 204, 0, 0, 0, 205, 206, ! 0, 0, 0, 207, 0, 208, 22, 0, 0, 0, ! 209, 24, 0, 0, 0, 0, 0, 210, 211, 0, ! 331, 824, 212, 825, 82, 0, 0, 0, 188, 189, ! 348, 190, 349, 350, 351, 352, 353, 354, 355, 356, ! 357, 358, 359, 360, 361, 362, 0, 0, 0, 191, ! 0, 15, 0, 192, 193, 194, 195, 196, 0, 0, ! 0, 0, 197, 0, 0, 0, 0, 0, 198, 0, ! 0, 199, 0, 0, 0, 0, 200, 201, 202, 0, ! 0, 0, 203, 204, 0, 0, 826, 205, 206, 0, ! 0, 0, 207, 0, 208, 83, 0, 0, 0, 209, ! 84, 0, 0, 0, 0, -381, 210, 211, 824, 827, ! 187, 212, 0, 0, 0, 188, 189, 0, 190, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, ! 362, 0, 0, 0, 0, 0, 191, 0, 15, 0, ! 192, 193, 194, 195, 196, 0, 0, 0, 0, 197, ! 0, -328, 0, 0, 0, 198, 0, 0, 199, 0, ! 0, 0, 0, 200, 201, 202, 0, 0, 0, 203, ! 204, 0, 0, -328, 205, 206, 0, 0, 0, 207, ! 793, 208, 187, 0, 0, 0, 209, 188, 189, 0, ! 190, 0, 0, 210, 211, 0, 827, 0, 212, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 191, 0, ! 15, 0, 192, 193, 194, 195, 196, 0, 0, 0, ! 0, 197, 0, 0, 0, 0, 0, 198, 0, 0, ! 199, 0, 0, 0, 0, 200, 201, 202, 0, 0, ! 0, 203, 204, 0, 0, 0, 205, 206, 0, 0, ! 0, 207, 824, 208, 187, 0, 0, 0, 209, 188, ! 189, 0, 190, 0, 0, 210, 211, 0, 794, 0, ! 212, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 191, 0, 15, 0, 192, 193, 194, 195, 196, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 198, ! 0, 0, 199, 0, 0, 0, 0, 200, 201, 202, ! 0, 0, 0, 203, 204, 0, 0, 0, 205, 206, ! 0, 0, 0, 207, 0, 208, 0, 0, 0, 0, ! 209, 0, 0, 0, 0, 0, 0, 210, 211, 0, ! 827, 0, 212, 825, 846, 6, 7, 8, 188, 189, ! 0, 190, 9, 10, 11, 0, 0, 0, 0, 0, ! 0, 847, 848, 849, 850, 851, 852, 853, 13, 191, ! 14, 15, 0, 192, 193, 194, 195, 196, 0, 0, ! 0, 0, 197, 0, 0, 0, 0, 0, 198, 0, ! 0, 199, 0, 16, 0, 0, 200, 201, 202, 0, ! 0, 0, 203, 204, 0, 0, 0, 205, 206, 0, ! 0, 0, 207, 0, 208, 854, 0, 0, 0, 209, ! 855, 0, 0, 0, 856, 0, 210, 211, 0, 816, ! 0, 212, 187, 5, 403, 7, 8, 188, 189, 0, ! 190, 9, 10, 11, 0, 0, 5, 6, 7, 8, ! 0, 0, 899, 0, 9, 10, 11, 13, 191, 14, ! 15, 0, 192, 193, 194, 195, 196, 0, 0, 0, ! 13, 197, 14, 0, 0, 0, 0, 198, 0, 0, ! 199, 0, 16, 0, 0, 200, 201, 404, 0, 0, ! 0, 203, 204, 0, 0, 16, 205, 206, 0, 0, ! 0, 207, 0, 208, 22, 825, 82, 0, 209, 24, ! 188, 189, 0, 190, 0, 210, 211, 22, 0, 405, ! 212, 0, 24, 847, 848, 849, 850, 851, 852, 853, ! 0, 191, 0, 15, 0, 192, 193, 194, 195, 196, ! 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, ! 198, 0, 0, 199, 0, 0, 0, 0, 200, 201, ! 202, 0, 0, 0, 203, 204, 0, 0, 0, 205, ! 206, 0, 0, 0, 207, 0, 208, 83, 0, 0, ! 0, 209, 84, 0, 0, 0, 856, 0, 210, 211, ! 0, 816, 0, 212, 187, 5, 6, 7, 8, 188, ! 189, 0, 190, 9, 10, 11, 353, 354, 355, 356, ! 357, 358, 359, 360, 361, 362, 0, 0, 0, 13, ! 191, 14, 15, 0, 192, 193, 194, 195, 196, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 198, ! 0, 0, 199, 0, 16, 0, 0, 200, 201, 202, ! 0, 0, 0, 203, 204, 0, 0, 0, 205, 206, ! 0, 0, 0, 207, 0, 208, 22, 0, 0, 0, ! 209, 24, 0, 0, 0, 0, 0, 210, 211, 0, ! 187, 5, 212, 7, 8, 188, 189, 0, 190, 9, ! 10, 11, 0, 0, 5, 139, 7, 140, 0, 0, ! 0, 0, 9, 10, 11, 13, 191, 14, 15, 0, ! 192, 193, 194, 195, 196, 0, 0, 0, 13, 197, ! 14, 0, 0, 0, 0, 198, 0, 0, 199, 0, ! 16, 0, 0, 200, 201, 202, 0, 0, 0, 203, ! 204, 0, 0, 16, 205, 206, 0, 0, 0, 207, ! 0, 208, 22, 187, 0, 0, 209, 24, 188, 189, ! 0, 190, 0, 210, 211, 22, 0, 0, 212, 0, ! 24, 0, 0, 0, -261, 0, 0, 0, 0, 191, ! 0, 15, 0, 192, 193, 194, 195, 196, 0, 0, ! 0, 0, 197, 0, 0, 0, 0, 0, 198, 0, ! 0, 199, 0, 0, 0, 0, 200, 201, 202, 0, ! 0, 0, 203, 204, 0, 0, 0, 205, 206, 0, ! 0, 0, 207, 0, 208, 466, 187, 0, 0, 209, ! 0, 188, 189, 0, 190, 0, 210, 211, 0, 0, ! 5, 212, 7, 113, 0, 0, 0, 0, 9, 10, ! 11, 0, 191, 0, 15, 0, 192, 193, 194, 195, ! 196, 0, 0, 0, 13, 197, 14, 0, 0, 0, ! 0, 198, 0, 0, 199, 0, 0, 0, 0, 200, ! 201, 202, 0, 0, 0, 203, 204, 0, 0, 16, ! 205, 206, 0, 187, 0, 207, 0, 208, 188, 189, ! 0, 190, 209, 0, 0, 0, 0, 0, 0, 210, ! 211, 22, 0, 538, 212, 0, 24, 0, 0, 191, ! 0, 15, 0, 192, 193, 194, 195, 196, 0, 0, ! 0, 0, 197, 0, 0, 0, 0, 0, 198, 0, ! 0, 199, 0, 0, 0, 0, 200, 201, 202, 0, ! 0, 0, 203, 204, 0, 0, 0, 205, 206, 0, ! 187, 0, 207, 0, 208, 188, 189, 0, 190, 209, ! 0, 0, 0, 0, 0, 0, 210, 211, 0, 582, ! 0, 212, 0, 0, 0, 0, 191, 0, 15, 0, ! 192, 193, 194, 195, 196, 0, 0, 0, 0, 197, ! 0, 0, 0, 0, 0, 198, 0, 0, 199, 0, ! 0, 0, 0, 200, 201, 202, 0, 0, 0, 203, ! 204, 0, 0, 0, 205, 206, 0, 187, 0, 207, ! 0, 208, 188, 189, 0, 190, 209, 0, 0, 0, ! 0, 0, 0, 210, 211, 0, 0, 671, 212, 0, ! 0, 0, 0, 191, 0, 15, 0, 192, 193, 194, ! 195, 196, 0, 0, 0, 0, 197, 0, 0, 0, ! 0, 0, 198, 0, 0, 199, 0, 0, 0, 0, ! 200, 201, 202, 0, 0, 0, 203, 204, 0, 0, ! 0, 205, 206, 0, 187, 0, 207, 0, 208, 188, ! 189, 0, 190, 209, 0, 0, 0, 0, 942, 0, ! 210, 211, 0, 0, 0, 212, 0, 0, 0, 0, ! 191, 0, 15, 0, 192, 193, 194, 195, 196, 0, ! 0, 0, 0, 197, 0, 0, 0, 0, 0, 198, ! 0, 0, 199, 0, 0, 0, 0, 200, 201, 202, ! 0, 0, 0, 203, 204, 0, 0, 0, 205, 206, ! 0, 187, 0, 207, 0, 208, 188, 189, 0, 190, ! 209, 0, 0, 0, 0, 0, 0, 210, 211, 0, ! 0, 0, 212, 0, 0, 0, 0, 191, 0, 15, ! 0, 192, 193, 194, 195, 196, 0, 0, 0, 0, ! 197, 0, 0, 0, 0, 0, 198, 0, 0, 199, ! 0, 0, 0, 0, 200, 201, 202, 0, 0, 0, ! 203, 204, 0, 0, 0, 342, 206, 0, 187, 0, ! 207, 0, 208, 188, 189, 0, 190, 209, 0, 0, ! 0, 0, 0, 0, 210, 211, 0, 0, 0, 212, ! 0, 0, 0, 0, 191, 0, 15, 0, 192, 193, ! 194, 195, 196, 0, 0, 0, 0, 197, 0, 0, ! 0, 0, 0, 198, 0, 0, 199, 0, 0, 0, ! 0, 200, 201, 202, 0, 0, 0, 203, 204, 0, ! 0, 0, 344, 206, 0, 617, 0, 207, 0, 208, ! 188, 189, 0, 190, 209, 0, 0, 0, 0, 0, ! 0, 210, 211, 0, 0, 0, 212, 0, 0, 0, ! 0, 191, 0, 15, 0, 192, 193, 194, 195, 196, ! 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, ! 198, 0, 0, 199, 0, 0, 0, 0, 200, 201, ! 202, 0, 0, 0, 203, 204, 0, 0, 0, 205, ! 206, 0, 0, 0, 207, 0, 208, 0, 0, 425, ! 0, 209, -23, -23, -23, -23, 0, 0, 210, 211, ! -23, -23, -23, 212, 0, 0, 0, 0, 419, 0, ! 0, -19, -19, -19, -19, 265, -23, 0, -287, -19, ! -19, -19, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, -287, 0, 265, -19, 0, -287, 0, 0, ! 0, -23, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, -287, 0, 0, 0, 266, 267, 0, 0, 0, ! -19, 0, 0, -23, 0, 0, 0, 0, -23, 0, ! 0, 0, -287, 0, 0, 0, -287, -23, 0, 0, ! 0, 0, -19, 0, 0, 0, 0, -19, 0, 0, ! 0, -287, 0, 0, 408, -287, -19, -654, -654, -654, ! -654, 0, 0, 0, 0, -654, -654, -654, 0, 0, ! 0, 0, 0, 408, 0, 0, -487, -487, -487, -487, ! 0, -654, 0, -654, -487, -487, -487, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! -487, 0, 0, 0, 0, 0, -654, 637, 0, 0, ! 5, 0, 7, 8, 0, 0, 0, 0, 9, 10, ! 11, 0, 0, 0, 0, -487, 0, 0, -654, 0, ! 0, 0, 0, -654, 13, 0, 14, 0, 0, 0, ! 0, 0, -654, 0, 0, 0, 0, -487, 0, 0, ! 0, 0, -487, 0, 290, 291, 0, 292, 293, 16, ! 0, -115, 294, 295, 296, 297, 298, 299, 300, 301, ! 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, ! 312, 22, -611, -611, -611, 0, 24, 0, 0, 637, ! 638, -611, 5, 0, 7, 8, 0, 313, 0, 0, ! 9, 10, 11, 0, 0, 0, 0, 0, 429, 0, ! 0, 5, 0, 7, 8, 0, 13, 0, 14, 9, ! 10, 11, 0, 0, 0, 0, 315, 0, 0, 0, ! 0, 316, 0, 0, 0, 13, 0, 14, 15, 455, ! 0, 16, 649, 0, 650, 5, 6, 7, 8, 0, ! 0, 651, 0, 9, 10, 11, 0, 0, 0, 0, ! 16, 0, 0, 22, -610, -610, -610, 0, 24, 13, ! 0, 0, 638, -610, 0, 0, 0, 0, 0, 0, ! 0, 0, 22, 0, 0, 0, 0, 24, 0, 0, ! 0, 430, -384, 4, 16, -128, 5, 6, 7, 8, ! 0, 0, 0, 0, 9, 10, 11, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 22, 0, 0, 12, ! 13, 24, 14, 15, -549, 4, 0, -128, 5, 6, ! 7, 8, 0, 0, 0, 0, 9, 10, 11, 0, ! 0, 0, 0, 0, 0, 16, 0, 0, 17, 18, ! -128, 0, 13, 0, 14, 0, 0, 0, 0, -128, ! 0, 19, 20, 21, 0, 0, 0, 22, 0, 0, ! 0, 23, 24, 25, 26, 0, 27, 16, 0, 0, ! 17, 18, -128, 4, 0, -128, 5, 6, 7, 8, ! 0, -128, 0, 0, 9, 10, 11, 0, 0, 22, ! 0, 0, 0, 0, 24, 0, 0, 0, 27, 0, ! 13, 649, 14, 0, 5, 6, 7, 8, 0, 0, ! 651, 0, 9, 10, 11, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 16, 0, 0, 13, 0, ! -128, 0, 0, 5, 148, 7, 149, 0, 0, -128, ! 0, 9, 10, 11, 0, 0, 0, 22, 0, 0, ! 0, 0, 24, 16, 0, 0, 27, 13, 0, 14, ! 0, 5, 117, 7, 118, 0, 0, 0, 0, 9, ! 10, 11, 0, 0, 0, 22, 0, 0, 0, 0, ! 24, 0, 16, -549, 0, 13, 0, 5, 144, 7, ! 145, 0, 0, 0, 0, 9, 10, 11, 5, 153, ! 7, 154, 0, 0, 22, 0, 9, 10, 11, 24, ! 16, 13, 0, -263, 0, 0, 0, 0, 0, 0, ! 0, 0, 13, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 22, 0, 0, 0, 16, 24, 0, 0, ! 0, -256, 0, 429, 0, 0, 5, 16, 7, 8, ! 0, 0, 0, 0, 9, 10, 11, 0, 22, 0, ! 0, 0, 0, 24, 0, 0, 0, -262, 0, 22, ! 13, 0, 14, 15, 24, 0, 0, 0, -264, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 290, 291, ! 0, 292, 293, 0, 0, 16, 294, 295, 296, 297, ! 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, ! 308, 309, 310, 311, 312, 0, 0, 22, 0, 0, ! 0, 0, 24, 0, 290, 291, 0, 292, 293, 0, ! 0, 313, 294, 295, 296, 297, 298, 299, 300, 301, ! 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, ! 312, 0, 314, 0, 0, 0, 0, 0, 0, 0, ! 315, 0, 0, 0, 0, 316, 0, 469, 290, 291, ! 0, 292, 293, 0, 0, 0, 294, 295, 296, 297, ! 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, ! 308, 309, 310, 311, 312, 0, 315, 0, 0, 0, ! 0, 316, 0, 0, 290, 291, 0, 292, 293, 0, ! 0, 313, 294, 295, 296, 297, 298, 299, 300, 301, ! 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, ! 312, 0, 0, 5, 6, 7, 8, 0, 0, 651, ! 315, 9, 10, 11, 0, 316, 0, 730, 0, 0, ! 0, 5, 103, 7, 104, 0, 0, 13, 0, 9, ! 10, 11, 5, 139, 7, 140, 0, 0, 0, 0, ! 9, 10, 11, 0, 0, 13, 315, 14, 0, 0, ! 0, 316, 16, 0, 0, 0, 13, 0, 14, 0, ! 0, 0, 0, 5, 112, 7, 113, 0, 0, 0, ! 16, 9, 10, 11, 22, 5, 148, 7, 149, 24, ! 0, 16, 0, 9, 10, 11, 0, 13, 0, 14, ! 0, 0, 22, 0, 0, 0, 0, 24, 0, 13, ! 0, 14, 0, 22, 0, 0, 0, 0, 24, 0, ! 0, 0, 16, 0, 0, 0, 0, 5, 6, 7, ! 8, 0, 0, 0, 16, 9, 10, 11, 5, 0, ! 7, 8, 0, 0, 22, 0, 9, 10, 11, 24, ! 0, 13, 0, 14, 0, 0, 22, 5, 6, 7, ! 8, 24, 13, 0, 14, 9, 10, 11, 0, 5, ! 108, 7, 109, 0, 0, 0, 16, 9, 10, 11, ! 0, 13, 0, 0, 0, 0, 0, 16, 0, 0, ! 0, 0, 5, 13, 7, 109, 0, 0, 22, 0, ! 9, 10, 11, 24, 0, 0, 16, 0, 0, 22, ! 0, 0, 0, 0, 24, 0, 13, 0, 16, 0, ! 0, 0, 5, 144, 7, 145, 0, 0, 22, 0, ! 9, 10, 11, 24, 5, 117, 7, 118, 0, 0, ! 22, 16, 9, 10, 11, 24, 13, 0, 0, 0, ! 0, 5, 153, 7, 154, 0, 0, 0, 13, 9, ! 10, 11, 0, 22, 5, 0, 7, 118, 24, 0, ! 0, 16, 9, 10, 11, 13, 0, 0, 0, 0, ! 0, 0, 0, 16, 0, 0, 0, 0, 13, 0, ! 0, 0, 0, 22, 0, 0, 0, 0, 24, 0, ! 16, 0, 0, 0, 0, 22, 0, 0, 0, 0, ! 24, 0, 0, 16, 0, 0, 0, 0, 0, 0, ! 0, 0, 22, 0, 0, 0, 0, 24, 0, 0, ! 0, 0, 0, 0, 0, 22, 0, 346, 347, 348, ! 24, 349, 350, 351, 352, 353, 354, 355, 356, 357, ! 358, 359, 360, 361, 362, 346, 347, 348, 0, 349, ! 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, ! 360, 361, 362, 0, 0, 0, 0, 0, 0, 346, ! 347, 348, 580, 349, 350, 351, 352, 353, 354, 355, ! 356, 357, 358, 359, 360, 361, 362, 0, 0, 0, ! 822, 0, 0, 14, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 346, 347, 348, 1004, ! 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, ! 359, 360, 361, 362, 346, 347, 348, 1089, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, ! 361, 362, 346, 347, 348, 0, 349, 350, 351, 352, ! 353, 354, 355, 356, 357, 358, 359, 360, 361, 362 }; static const short yycheck[] = { ! 16, 175, 400, 19, 20, 2, 3, 23, 277, 25, ! 26, 418, 422, 391, 420, 22, 284, 24, 24, 272, ! 426, 2, 3, 753, 517, 753, 2, 3, 9, 10, ! 11, 367, 394, 410, 2, 3, 319, 774, 643, 176, ! 192, 193, 521, 59, 60, 61, 2, 3, 517, 867, ! 202, 394, 33, 181, 35, 57, 37, 779, 39, 611, ! 41, 213, 43, 517, 45, 835, 47, 64, 573, 2, ! 3, 779, 780, 225, 76, 77, 78, 790, 753, 95, ! 87, 87, 573, 64, 91, 91, 1, 815, 64, 515, ! 267, 319, 573, 79, 2, 3, 64, 517, 1, 1, ! 1, 573, 1, 1, 573, 107, 44, 335, 64, 10, ! 96, 1, 788, 53, 116, 96, 844, 98, 9, 573, ! 9, 673, 98, 125, 1, 3, 4, 46, 66, 506, ! 98, 64, 134, 2, 3, 687, 46, 867, 690, 3, ! 535, 143, 2, 3, 84, 30, 3, 0, 88, 1, ! 152, 3, 4, 535, 549, 83, 64, 506, 30, 161, ! 88, 46, 46, 933, 83, 98, 27, 549, 170, 844, ! 85, 2, 3, 83, 442, 30, 512, 67, 573, 68, ! 0, 576, 198, 85, 535, 84, 89, 85, 89, 535, ! 98, 573, 83, 745, 576, 64, 573, 75, 549, 83, ! 64, 58, 80, 549, 64, 631, 67, 68, 85, 629, ! 67, 89, 67, 68, 230, 720, 232, 233, 234, 67, ! 236, 237, 573, 75, 205, 576, 403, 573, 80, 720, ! 576, 608, 908, 64, 910, 1118, 1006, 950, 83, 720, ! 32, 83, 620, 88, 472, 797, 88, 799, 720, 67, ! 53, 720, 404, 521, 1072, 604, 605, 606, 607, 261, ! 3, 4, 984, 244, 1147, 246, 720, 248, 53, 250, ! 523, 764, 288, 254, 83, 256, 984, 985, 783, 88, ! 67, 267, 644, 7, 753, 88, 267, 284, 767, 30, ! 84, 272, 783, 3, 4, 764, 272, 313, 46, 753, ! 643, 644, 783, 284, 272, 46, 30, 506, 284, 1046, ! 764, 783, 67, 465, 783, 443, 284, 445, 89, 67, ! 7, 337, 1024, 46, 67, 720, 67, 68, 284, 783, ! 53, 757, 75, 314, 73, 3, 4, 80, 720, 272, ! 46, 89, 1072, 30, 721, 7, 327, 53, 334, 365, ! 366, 284, 89, 3, 4, 336, 584, 67, 89, 3, ! 4, 342, 907, 344, 272, 75, 971, 67, 30, 720, ! 80, 3, 4, 1075, 720, 980, 284, 384, 384, 774, ! 83, 759, 368, 928, 176, 88, 67, 68, 783, 541, ! 58, 67, 774, 800, 730, 802, 948, 67, 867, 67, ! 68, 783, 83, 49, 50, 604, 605, 606, 607, 1137, ! 1138, 680, 80, 867, 46, 284, 699, 403, 1120, 755, ! 67, 407, 403, 774, 284, 75, 58, 1129, 774, 67, ! 80, 75, 783, 3, 450, 67, 80, 783, 67, 89, ! 992, 3, 4, 459, 46, 442, 3, 23, 80, 25, ! 431, 53, 433, 284, 435, 9, 437, 3, 1160, 67, ! 68, 442, 3, 4, 83, 67, 442, 259, 260, 91, ! 451, 699, 56, 57, 442, 83, 27, 84, 84, 30, ! 9, 88, 88, 5, 6, 7, 442, 71, 58, 505, ! 12, 13, 14, 44, 872, 511, 482, 67, 68, 767, ! 46, 58, 838, 67, 68, 733, 88, 514, 514, 442, ! 67, 68, 58, 75, 3, 4, 84, 58, 80, 83, ! 88, 67, 5, 6, 7, 84, 67, 89, 89, 12, ! 13, 14, 99, 84, 442, 83, 517, 88, 83, 80, ! 521, 517, 523, 7, 84, 521, 7, 523, 88, 517, ! 58, 537, 568, 521, 540, 523, 67, 46, 67, 67, ! 68, 517, 84, 970, 974, 521, 976, 535, 84, 58, ! 84, 46, 88, 442, 88, 1127, 1128, 83, 67, 535, ! 85, 549, 442, 84, 517, 84, 83, 88, 521, 88, ! 523, 80, 573, 549, 768, 769, 577, 573, 579, 85, ! 581, 84, 535, 1072, 83, 573, 398, 84, 576, 517, ! 972, 442, 9, 521, 83, 523, 549, 573, 1072, 981, ! 576, 3, 4, 415, 416, 762, 84, 801, 971, 972, ! 88, 884, 205, 76, 77, 78, 46, 980, 981, 32, ! 573, 894, 85, 576, 76, 77, 78, 83, 517, 67, ! 84, 1046, 521, 85, 88, 792, 1034, 517, 71, 84, ! 1066, 521, 1068, 88, 1046, 573, 535, 83, 278, 89, ! 84, 652, 83, 654, 88, 656, 58, 658, 84, 85, ! 549, 697, 76, 77, 78, 9, 517, 76, 77, 78, ! 521, 85, 90, 75, 27, 1046, 85, 30, 80, 266, ! 1046, 84, 269, 44, 573, 75, 273, 576, 84, 604, ! 605, 44, 607, 573, 44, 867, 58, 59, 60, 700, ! 88, 702, 738, 704, 83, 706, 84, 708, 10, 710, ! 46, 712, 88, 714, 67, 68, 83, 753, 83, 720, ! 90, 314, 573, 83, 720, 1143, 67, 68, 83, 1018, ! 46, 84, 720, 89, 327, 88, 753, 1155, 3, 4, ! 5, 6, 7, 336, 720, 67, 68, 753, 83, 342, ! 83, 344, 753, 5, 6, 7, 950, 753, 84, 85, ! 12, 13, 14, 764, 394, 753, 767, 720, 764, 67, ! 68, 767, 83, 439, 440, 71, 764, 753, 30, 767, ! 67, 68, 783, 71, 820, 90, 774, 783, 764, 90, ! 826, 767, 720, 44, 951, 783, 6, 7, 774, 83, ! 753, 83, 12, 13, 14, 67, 68, 783, 844, 85, ! 75, 764, 85, 625, 767, 80, 852, 217, 218, 85, ! 30, 774, 89, 415, 416, 753, 46, 854, 855, 855, ! 783, 720, 84, 1, 421, 422, 764, 85, 844, 767, ! 720, 428, 971, 972, 83, 851, 1040, 84, 83, 83, ! 867, 517, 90, 84, 90, 783, 84, 444, 451, 1053, ! 27, 88, 88, 85, 753, 84, 867, 84, 83, 720, ! 88, 867, 83, 753, 83, 764, 46, 90, 767, 867, ! 71, 83, 3, 884, 764, 774, 89, 767, 884, 85, ! 46, 867, 893, 894, 783, 46, 884, 85, 894, 529, ! 46, 88, 753, 783, 46, 84, 894, 84, 7, 84, ! 5, 6, 7, 764, 867, 84, 767, 12, 13, 14, ! 46, 551, 552, 53, 54, 55, 56, 57, 58, 59, ! 60, 884, 783, 71, 88, 30, 84, 524, 944, 867, ! 84, 894, 67, 67, 5, 6, 7, 16, 71, 85, ! 762, 12, 13, 14, 85, 84, 884, 979, 46, 67, ! 626, 627, 67, 5, 6, 7, 894, 779, 780, 30, ! 12, 13, 14, 639, 640, 6, 7, 67, 867, 17, ! 792, 12, 13, 14, 577, 83, 579, 867, 581, 84, ! 83, 803, 71, 84, 660, 661, 5, 6, 7, 811, ! 83, 83, 67, 12, 13, 14, 84, 84, 1014, 675, ! 676, 325, 326, 643, 644, 88, 867, 84, 90, 83, ! 1026, 30, 84, 84, 9, 84, 1032, 341, 6, 7, ! 67, 83, 346, 347, 12, 13, 14, 351, 352, 353, ! 354, 355, 356, 357, 358, 359, 360, 361, 362, 83, ! 716, 84, 30, 0, 0, 1072, 549, 512, 1046, 646, ! 5, 6, 7, 1069, 1070, 411, 1072, 12, 13, 14, ! 1046, 1072, 549, 1109, 553, 84, 1072, 398, 931, 511, ! 33, 34, 35, 36, 1072, 30, 798, 834, 41, 42, ! 43, 44, 971, 1046, 6, 7, 1072, 570, 764, 442, ! 12, 13, 14, 911, 691, 692, 568, 1076, 695, 507, ! 914, 450, 1118, 5, 6, 7, 1122, 1078, 818, 1072, ! 12, 13, 14, 1126, 37, 38, 39, 40, 646, 1124, ! 576, 661, 45, 46, 47, 48, 636, 576, 30, 951, ! 769, 1147, 1148, 506, 1072, 33, 34, 35, 36, 779, ! 780, 763, 1040, 41, 42, 43, 44, 1046, 629, 971, ! 972, 54, 55, 56, 57, 58, 59, 60, 980, 981, ! 484, 485, 984, 985, 720, 1003, 4, 5, 6, 7, ! 572, 811, 545, 1072, 12, 13, 14, 699, 572, 733, ! 838, 1003, 1072, 472, 860, 861, -1, 560, 561, -1, ! 28, -1, 30, -1, 5, 6, 7, 37, 38, 39, ! 40, 12, 13, 14, -1, 45, 46, 47, 48, -1, ! 807, 1072, -1, -1, -1, 53, -1, 1, -1, 30, ! 4, 5, 6, 7, 900, 901, 10, -1, 12, 13, ! 14, 604, 605, 606, 607, 62, 63, 75, 65, 66, ! 67, 68, 80, 567, 28, -1, 84, -1, 888, 889, ! 5, 6, 7, 5, 6, 7, 580, 12, 13, 14, ! 12, 13, 14, 4, 5, 6, 7, -1, -1, 53, ! 594, 12, 13, 14, -1, -1, -1, -1, 30, -1, ! -1, 244, 245, 246, 247, -1, -1, 28, 885, 30, ! 887, 75, -1, 890, -1, -1, 80, -1, 895, 896, ! -1, 898, -1, -1, -1, 89, -1, -1, 681, -1, ! 683, -1, 53, -1, -1, -1, 913, -1, -1, 916, ! -1, 918, 919, -1, -1, 248, 249, 250, 251, 84, ! -1, 971, 972, 15, 75, 17, 18, 19, 20, 80, ! 980, 981, -1, 84, 984, 985, 244, 245, 246, 247, ! -1, -1, -1, 677, -1, -1, -1, 1, -1, 3, ! 4, -1, -1, 1003, 8, 9, -1, 11, 56, 57, ! 58, 59, 60, 5, 6, 7, -1, 974, -1, 976, ! 12, 13, 14, -1, -1, 29, -1, 31, -1, 33, ! 34, 35, 36, 37, -1, -1, 993, -1, 42, -1, ! 997, 1041, 1042, 1043, 48, 729, -1, 51, 248, 249, ! 250, 251, 56, 57, 58, -1, -1, -1, 62, 63, ! -1, -1, 66, 67, 68, 5, 6, 7, 72, -1, ! 74, 75, 12, 13, 14, 79, 80, -1, -1, -1, ! -1, 85, 86, 87, -1, 89, -1, 91, -1, -1, ! 1047, 1048, 84, 1050, 5, 6, 7, -1, 1055, -1, ! 1057, 12, 13, 14, -1, -1, -1, 1064, 431, 432, ! 433, 434, -1, -1, 798, -1, 1, -1, -1, 4, ! 5, 6, 7, -1, 857, -1, -1, 12, 13, 14, ! -1, -1, 5, 6, 7, -1, -1, -1, 822, 12, ! 13, 14, 27, 28, -1, 30, -1, -1, -1, -1, ! -1, 835, 435, 436, 437, 438, -1, -1, 842, 44, ! -1, -1, -1, 847, -1, -1, -1, -1, 53, -1, ! -1, -1, -1, 431, 432, 433, 434, -1, 911, -1, ! -1, 914, 67, 68, -1, -1, -1, -1, -1, -1, ! 75, -1, 876, -1, -1, 80, -1, -1, -1, 84, ! -1, -1, -1, 88, 89, -1, -1, -1, -1, -1, ! 4, 5, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, -1, 907, 3, -1, 5, -1, 912, 8, ! 9, 915, 11, -1, 28, 435, 436, 437, 438, -1, ! -1, -1, -1, -1, 928, -1, -1, 931, -1, 933, ! 29, -1, 31, -1, 33, 34, 35, 36, 37, 53, ! -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, ! -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, 75, -1, 62, 63, 969, 80, -1, 67, 68, ! 84, -1, -1, 72, -1, 74, 1029, -1, -1, -1, ! 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, ! 994, 90, 91, -1, 998, -1, -1, -1, -1, -1, ! -1, -1, 1006, -1, -1, 1009, -1, -1, -1, 652, ! 653, -1, -1, 656, 657, -1, -1, 1, -1, -1, ! 4, 5, 6, 7, 4, 1078, 6, 7, 12, 13, ! 14, -1, 12, 13, 14, 52, 53, 54, 55, 56, ! 57, 58, 59, 60, 28, -1, 30, -1, 28, -1, ! 30, 654, 655, -1, -1, 658, 659, 700, 701, 702, ! 703, 1114, 1115, -1, -1, 708, 709, 710, 711, 53, ! -1, -1, -1, 53, 652, 653, -1, -1, 656, 657, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, 75, -1, -1, -1, 75, 80, -1, -1, -1, ! 80, 704, 705, 706, 707, 89, -1, 10, -1, 712, ! 713, 714, 715, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 700, 701, 702, 703, -1, -1, -1, -1, ! 708, 709, 710, 711, 654, 655, -1, -1, 658, 659, ! 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, ! 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, ! 43, 44, 45, -1, 47, 48, 49, 50, 51, 52, ! 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, ! -1, -1, -1, -1, 704, 705, 706, 707, -1, -1, ! -1, -1, 712, 713, 714, 715, 1, -1, 3, 4, ! 5, 6, 7, 8, 9, 88, 11, 12, 13, 14, ! 15, -1, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, ! -1, -1, -1, 48, -1, -1, 51, -1, 53, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, 68, -1, -1, -1, 72, -1, 74, ! 75, -1, -1, -1, 79, 80, -1, -1, -1, 84, ! 85, 86, 87, -1, 89, 1, 91, 3, 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, 14, 15, ! -1, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, 53, -1, -1, ! 56, 57, 58, -1, -1, -1, 62, 63, -1, -1, ! -1, 67, 68, -1, -1, -1, 72, -1, 74, 75, ! -1, -1, -1, 79, 80, -1, -1, -1, 84, -1, ! 86, 87, -1, 89, 1, 91, 3, 4, -1, -1, ! -1, 8, 9, -1, 11, -1, -1, -1, 15, -1, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, ! 27, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, ! -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, ! 57, 58, -1, -1, -1, 62, 63, -1, -1, -1, ! 67, 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, -1, -1, -1, 84, -1, 86, 87, -1, 89, 1, 91, 3, 4, -1, -1, -1, 8, 9, -1, 11, -1, -1, -1, 15, -1, 17, --- 975,2188 ---- }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, ! 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, ! 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, ! 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, ! 295, 296, 297, 61, 298, 63, 58, 299, 300, 124, ! 94, 38, 301, 302, 303, 304, 43, 45, 42, 47, ! 37, 305, 306, 307, 308, 46, 40, 91, 309, 310, ! 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, ! 321, 322, 323, 41, 59, 125, 126, 33, 44, 123, ! 93, 64 }; + # endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned short yyr1[] = { ! 0, 92, 93, 93, 95, 94, 96, 94, 97, 97, ! 97, 97, 97, 98, 98, 98, 98, 98, 98, 98, ! 100, 101, 99, 99, 102, 103, 99, 99, 104, 105, ! 99, 99, 106, 106, 106, 106, 107, 107, 107, 107, ! 107, 107, 107, 108, 109, 109, 110, 110, 111, 111, ! 111, 111, 111, 111, 111, 111, 111, 111, 111, 112, ! 113, 114, 115, 115, 116, 116, 116, 116, 116, 116, ! 116, 116, 116, 116, 116, 116, 116, 117, 116, 118, ! 116, 119, 120, 116, 121, 116, 116, 116, 122, 122, ! 122, 122, 123, 122, 122, 122, 122, 122, 122, 122, ! 122, 122, 122, 122, 122, 122, 122, 122, 122, 122, ! 122, 122, 124, 124, 125, 125, 126, 126, 126, 127, ! 128, 128, 128, 128, 129, 129, 129, 129, 130, 131, ! 132, 133, 133, 133, 133, 133, 133, 134, 134, 134, ! 135, 136, 136, 137, 137, 138, 138, 138, 138, 138, ! 138, 138, 139, 139, 139, 139, 139, 139, 140, 140, ! 140, 140, 140, 140, 141, 141, 141, 141, 141, 142, ! 142, 142, 142, 142, 142, 142, 143, 144, 144, 144, ! 144, 144, 144, 145, 146, 146, 146, 146, 146, 146, ! 146, 146, 146, 146, 147, 147, 147, 147, 147, 148, ! 148, 148, 148, 148, 148, 148, 148, 148, 148, 149, ! 149, 149, 149, 149, 150, 150, 150, 150, 150, 150, ! 150, 150, 151, 151, 151, 151, 151, 151, 151, 151, ! 152, 152, 152, 152, 153, 153, 153, 153, 154, 154, ! 154, 154, 155, 155, 155, 155, 156, 156, 156, 156, ! 156, 156, 156, 156, 157, 157, 157, 157, 157, 157, ! 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, ! 158, 158, 159, 159, 160, 161, 161, 162, 163, 163, ! 163, 163, 163, 163, 164, 164, 165, 165, 166, 166, ! 168, 167, 167, 170, 169, 169, 171, 171, 172, 172, ! 173, 174, 174, 175, 175, 175, 175, 175, 176, 176, ! 176, 176, 177, 178, 177, 177, 179, 179, 180, 180, ! 181, 181, 182, 181, 181, 184, 183, 183, 183, 185, ! 185, 186, 188, 189, 187, 191, 192, 190, 193, 193, ! 194, 194, 194, 194, 194, 194, 195, 195, 196, 196, ! 196, 196, 197, 197, 197, 197, 197, 198, 198, 198, ! 198, 198, 199, 199, 200, 200, 201, 201, 203, 202, ! 202, 204, 202, 202, 205, 202, 206, 202, 207, 207, ! 207, 208, 208, 209, 209, 210, 210, 211, 211, 211, ! 211, 212, 212, 212, 212, 212, 212, 213, 213, 214, ! 214, 215, 215, 215, 216, 216, 216, 217, 217, 217, ! 218, 218, 220, 219, 221, 221, 222, 222, 222, 223, ! 223, 224, 224, 225, 225, 226, 226, 226, 226, 226, ! 227, 227, 227, 227, 227, 227, 227, 227, 227, 228, ! 228, 228, 228, 229, 229, 229, 229, 229, 230, 230, ! 230, 230, 231, 231, 231, 231, 231, 232, 232, 233, ! 233, 233, 233, 234, 235, 236, 237, 238, 239, 239, ! 240, 240, 241, 242, 242, 243, 244, 244, 245, 245, ! 246, 247, 248, 248, 250, 249, 252, 251, 253, 254, ! 255, 255, 256, 257, 258, 260, 259, 259, 259, 261, ! 262, 259, 259, 259, 263, 264, 265, 266, 259, 267, ! 259, 268, 268, 269, 269, 269, 269, 269, 269, 269, ! 269, 269, 269, 269, 269, 269, 269, 270, 270, 270, ! 270, 271, 271, 272, 272, 273, 273, 274, 274, 275, ! 275, 276, 276, 278, 277, 279, 280, 281, 279, 279, ! 282, 282, 282, 282, 283, 283, 284, 284, 284, 284, ! 284, 285, 285, 285, 285, 285, 286, 288, 287, 289, ! 289, 290, 290, 291, 291, 292, 293, 293, 293, 293, ! 293, 293, 294, 294, 295, 296, 298, 299, 297, 300, ! 297, 301, 302, 297, 303, 297, 304, 297, 297, 305, ! 297, 297, 306, 297, 297, 308, 307, 307, 309, 309, ! 310, 311, 311, 312, 312, 312, 313, 313, 313, 314, ! 314, 314, 315, 315, 315, 316, 316, 316, 317, 317, ! 319, 320, 321, 318, 322, 323, 322, 324, 324, 324, ! 325, 324, 326, 326, 328, 329, 327, 330, 330, 330, ! 330, 331, 331, 332, 332, 333, 333, 333, 333, 334, ! 334, 334, 335, 335, 336, 336, 336, 337, 337, 338, ! 337, 339, 340, 340, 341, 341, 341, 341, 341, 342, ! 342, 342, 342, 342, 342, 342, 342, 342, 342, 342, ! 342, 342, 342, 342, 342, 342, 342, 342, 342, 342, ! 343, 343, 343, 343, 344, 344, 345, 345, 346, 347, ! 347, 348, 348, 350, 351, 349, 352, 352, 353, 353, ! 354, 354, 355, 356, 357 ! }; ! ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = ! { ! 0, 2, 0, 1, 0, 2, 0, 3, 1, 1, ! 1, 5, 2, 3, 4, 4, 2, 2, 2, 1, ! 0, 0, 9, 4, 0, 0, 9, 4, 0, 0, ! 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 0, 1, 1, 3, 1, 2, ! 2, 2, 2, 2, 4, 2, 4, 2, 2, 1, ! 1, 1, 1, 4, 1, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 3, 0, 4, 0, ! 4, 0, 0, 7, 0, 5, 3, 3, 1, 1, ! 1, 1, 0, 7, 3, 3, 3, 3, 4, 6, ! 8, 6, 4, 3, 3, 2, 2, 1, 1, 1, ! 1, 1, 1, 2, 2, 3, 0, 1, 2, 3, ! 1, 1, 2, 2, 4, 4, 2, 2, 3, 0, ! 1, 4, 4, 3, 3, 2, 2, 1, 2, 2, ! 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, ! 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, ! 2, 1, 4, 4, 1, 4, 1, 4, 0, 4, ! 0, 6, 3, 0, 6, 3, 0, 1, 1, 2, ! 6, 1, 3, 0, 1, 4, 6, 4, 1, 1, ! 1, 1, 1, 0, 4, 1, 0, 2, 1, 3, ! 3, 2, 0, 4, 1, 0, 4, 1, 1, 1, ! 2, 2, 0, 0, 7, 0, 0, 7, 1, 1, ! 4, 3, 2, 3, 1, 1, 1, 1, 3, 2, ! 1, 1, 3, 2, 3, 3, 4, 3, 4, 3, ! 2, 1, 1, 2, 1, 2, 1, 2, 0, 7, ! 5, 0, 7, 5, 0, 8, 0, 7, 2, 2, ! 2, 0, 1, 0, 1, 1, 2, 0, 3, 2, ! 4, 3, 4, 3, 1, 1, 2, 1, 4, 1, ! 4, 4, 6, 5, 4, 6, 5, 1, 3, 1, ! 1, 3, 0, 3, 0, 1, 0, 1, 2, 1, ! 1, 1, 3, 2, 3, 4, 3, 2, 2, 1, ! 3, 4, 2, 3, 3, 4, 4, 5, 5, 1, ! 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, ! 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, ! 1, 1, 1, 2, 0, 0, 0, 0, 0, 1, ! 1, 2, 3, 1, 2, 1, 1, 5, 1, 1, ! 2, 2, 2, 2, 0, 5, 0, 4, 0, 0, ! 1, 2, 3, 3, 3, 0, 4, 1, 3, 0, ! 0, 7, 5, 2, 0, 0, 0, 0, 12, 0, ! 6, 2, 1, 1, 2, 3, 2, 2, 2, 3, ! 6, 8, 10, 12, 3, 4, 1, 3, 5, 2, ! 5, 0, 1, 0, 1, 0, 1, 1, 3, 4, ! 7, 1, 3, 0, 3, 2, 0, 0, 6, 2, ! 0, 1, 1, 3, 1, 3, 4, 4, 3, 4, ! 3, 4, 4, 3, 4, 3, 1, 0, 3, 1, ! 2, 1, 3, 1, 3, 1, 1, 1, 1, 1, ! 1, 1, 1, 3, 3, 4, 0, 0, 10, 0, ! 6, 0, 0, 12, 0, 8, 0, 6, 2, 0, ! 8, 4, 0, 9, 5, 0, 6, 3, 0, 1, ! 3, 3, 1, 1, 1, 1, 0, 3, 2, 3, ! 3, 1, 0, 1, 4, 1, 3, 2, 1, 1, ! 0, 0, 0, 7, 0, 0, 2, 1, 1, 2, ! 0, 3, 1, 1, 0, 0, 5, 4, 1, 5, ! 2, 0, 2, 0, 1, 1, 1, 2, 2, 4, ! 2, 2, 1, 3, 2, 2, 1, 0, 2, 0, ! 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ! 6, 3, 5, 2, 1, 1, 1, 2, 1, 3, ! 2, 1, 1, 0, 0, 6, 1, 1, 1, 2, ! 2, 1, 4, 4, 4 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned short yydefact[] = { ! 4, 0, 6, 0, 1, 0, 0, 278, 169, 275, ! 137, 366, 362, 364, 0, 61, 0, 575, 0, 628, ! 629, 0, 0, 581, 608, 0, 608, 0, 0, 19, ! 5, 9, 8, 0, 0, 222, 223, 224, 225, 214, ! 215, 216, 217, 226, 227, 228, 229, 218, 219, 220, ! 221, 129, 129, 0, 145, 152, 272, 274, 273, 143, ! 298, 0, 0, 0, 277, 276, 0, 10, 577, 578, ! 576, 579, 281, 630, 580, 7, 17, 18, 367, 363, ! 365, 0, 0, 32, 33, 35, 34, 582, 0, 608, ! 598, 279, 609, 608, 0, 280, 0, 0, 0, 361, ! 270, 296, 0, 286, 0, 172, 138, 150, 156, 140, ! 173, 139, 151, 157, 179, 141, 162, 167, 144, 180, ! 142, 163, 168, 190, 146, 148, 154, 153, 191, 147, ! 149, 155, 205, 158, 160, 165, 164, 206, 159, 161, ! 166, 174, 170, 188, 197, 176, 175, 171, 189, 198, ! 181, 177, 203, 212, 183, 182, 178, 204, 213, 192, ! 184, 186, 195, 194, 193, 185, 187, 196, 207, 199, ! 201, 210, 209, 208, 200, 202, 211, 0, 0, 16, ! 299, 387, 378, 387, 379, 376, 380, 12, 0, 88, ! 89, 112, 59, 60, 0, 0, 0, 0, 0, 91, ! 0, 36, 38, 37, 0, 40, 39, 0, 713, 0, ! 0, 0, 41, 42, 0, 0, 0, 43, 62, 0, ! 0, 64, 46, 48, 90, 111, 0, 0, 107, 108, ! 109, 110, 303, 610, 0, 0, 0, 589, 0, 0, ! 596, 605, 607, 584, 0, 0, 250, 251, 252, 253, ! 246, 247, 248, 249, 412, 0, 242, 243, 244, 245, ! 271, 0, 0, 297, 13, 296, 31, 0, 296, 0, ! 0, 296, 360, 344, 270, 296, 345, 0, 284, 0, ! 338, 339, 0, 0, 0, 0, 0, 368, 0, 371, ! 0, 374, 674, 675, 698, 699, 695, 679, 680, 681, ! 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, ! 692, 693, 694, 696, 697, 0, 0, 676, 677, 631, ! 648, 667, 671, 678, 672, 57, 58, 0, 0, 0, ! 52, 49, 0, 480, 0, 0, 0, 0, 0, 0, ! 114, 51, 0, 0, 0, 53, 0, 55, 0, 0, ! 81, 79, 77, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 106, 105, 0, 44, 0, ! 0, 113, 0, 0, 476, 468, 0, 50, 309, 310, ! 311, 308, 0, 301, 304, 583, 608, 0, 586, 635, ! 601, 0, 616, 635, 585, 282, 414, 283, 359, 0, ! 0, 130, 0, 567, 357, 0, 0, 432, 0, 0, ! 0, 29, 0, 488, 121, 489, 295, 0, 0, 15, ! 296, 23, 0, 296, 296, 342, 14, 27, 0, 0, ! 296, 395, 389, 242, 243, 244, 245, 238, 239, 240, ! 241, 129, 129, 386, 0, 387, 296, 387, 409, 410, ! 383, 407, 0, 0, 703, 0, 651, 669, 650, 0, ! 673, 0, 0, 0, 0, 95, 94, 0, 712, 711, ! 714, 721, 716, 0, 717, 718, 0, 0, 11, 47, ! 0, 0, 86, 87, 0, 0, 0, 0, 75, 76, ! 74, 73, 72, 71, 70, 65, 66, 67, 68, 69, ! 103, 0, 45, 0, 104, 115, 97, 0, 0, 469, ! 470, 96, 0, 303, 44, 594, 608, 616, 0, 0, ! 599, 604, 0, 0, 0, 270, 296, 413, 415, 420, ! 419, 421, 429, 358, 287, 288, 0, 0, 0, 0, ! 434, 430, 0, 0, 433, 0, 463, 488, 123, 118, ! 122, 0, 293, 343, 0, 0, 21, 292, 341, 25, ! 0, 370, 488, 488, 388, 396, 0, 373, 0, 0, ! 384, 0, 383, 0, 0, 0, 632, 668, 550, 0, ! 701, 0, 0, 0, 92, 63, 0, 720, 722, 0, ! 719, 724, 723, 54, 56, 0, 0, 80, 78, 98, ! 102, 573, 0, 479, 448, 478, 488, 488, 488, 488, ! 0, 457, 0, 489, 443, 452, 471, 300, 302, 88, ! 0, 591, 635, 602, 0, 590, 638, 0, 129, 129, ! 644, 640, 637, 616, 615, 613, 614, 597, 616, 621, ! 618, 129, 129, 0, 606, 423, 543, 428, 296, 427, ! 289, 0, 571, 551, 234, 235, 230, 231, 236, 237, ! 232, 233, 129, 129, 569, 0, 552, 554, 568, 0, ! 436, 0, 0, 435, 431, 489, 119, 129, 129, 0, ! 340, 285, 288, 488, 290, 488, 390, 391, 397, 489, ! 393, 399, 489, 296, 296, 411, 408, 296, 0, 0, ! 647, 667, 222, 223, 224, 225, 214, 215, 216, 217, ! 226, 227, 228, 229, 218, 219, 220, 221, 129, 0, ! 656, 652, 654, 0, 0, 670, 552, 0, 0, 0, ! 0, 0, 0, 704, 0, 705, 706, 82, 85, 472, ! 0, 449, 444, 453, 450, 445, 454, 489, 446, 455, ! 451, 447, 456, 458, 465, 466, 305, 0, 307, 616, ! 0, 635, 587, 0, 0, 0, 0, 639, 0, 0, ! 622, 622, 617, 422, 424, 0, 0, 543, 426, 549, ! 566, 416, 416, 545, 546, 0, 570, 0, 437, 438, ! 0, 126, 0, 127, 0, 315, 313, 312, 294, 489, ! 0, 489, 296, 392, 296, 0, 369, 372, 377, 296, ! 702, 649, 660, 416, 661, 657, 658, 0, 475, 633, ! 464, 473, 0, 99, 0, 101, 328, 88, 0, 325, ! 0, 327, 0, 381, 318, 324, 0, 0, 708, 710, ! 0, 715, 0, 707, 0, 574, 466, 477, 278, 0, ! 0, 0, 0, 0, 0, 531, 608, 608, 526, 488, ! 0, 128, 129, 129, 0, 0, 513, 493, 494, 0, ! 0, 0, 595, 0, 635, 645, 641, 600, 0, 625, ! 619, 623, 620, 425, 544, 350, 270, 296, 351, 296, ! 346, 347, 296, 563, 417, 420, 270, 296, 296, 565, ! 296, 553, 129, 129, 555, 572, 30, 0, 0, 0, ! 0, 291, 0, 488, 0, 296, 488, 0, 296, 375, ! 296, 296, 666, 0, 662, 474, 481, 700, 0, 331, ! 0, 322, 93, 0, 317, 0, 330, 321, 709, 83, ! 0, 529, 516, 517, 518, 0, 0, 0, 532, 0, ! 489, 514, 0, 0, 135, 484, 499, 486, 504, 0, ! 497, 0, 0, 467, 136, 306, 592, 603, 0, 0, ! 627, 0, 296, 423, 543, 561, 296, 349, 296, 353, ! 562, 418, 423, 543, 564, 547, 416, 416, 124, 125, ! 0, 22, 26, 398, 489, 296, 0, 401, 400, 296, ! 0, 404, 664, 665, 659, 416, 100, 0, 0, 319, ! 320, 0, 527, 519, 0, 524, 0, 0, 0, 133, ! 332, 0, 134, 335, 0, 0, 466, 0, 0, 0, ! 483, 488, 482, 503, 0, 515, 635, 588, 643, 642, ! 646, 626, 0, 354, 355, 0, 348, 352, 0, 296, ! 296, 558, 296, 560, 314, 0, 403, 296, 406, 296, ! 663, 326, 323, 0, 525, 0, 296, 131, 0, 132, ! 0, 0, 0, 0, 533, 0, 498, 466, 467, 490, ! 488, 0, 0, 624, 356, 548, 556, 557, 559, 402, ! 405, 528, 535, 0, 530, 333, 336, 0, 0, 487, ! 534, 512, 505, 0, 509, 496, 492, 491, 0, 593, ! 0, 0, 0, 536, 537, 520, 488, 488, 485, 500, ! 533, 511, 466, 502, 0, 0, 535, 0, 0, 489, ! 489, 466, 0, 510, 0, 0, 0, 521, 538, 0, ! 0, 501, 506, 539, 0, 0, 0, 334, 337, 533, ! 0, 541, 0, 522, 0, 0, 0, 0, 507, 540, ! 523, 542, 466, 508 }; + /* YYDEFGOTO[NTERM-NUM]. */ static const short yydefgoto[] = { ! -1, 1, 2, 3, 5, 30, 31, 32, 422, 683, ! 428, 685, 270, 547, 830, 215, 334, 501, 217, 218, ! 219, 220, 33, 221, 222, 487, 486, 484, 844, 485, ! 223, 731, 224, 225, 411, 412, 413, 676, 604, 34, ! 400, 861, 246, 247, 248, 249, 250, 251, 252, 253, ! 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, ! 662, 663, 441, 260, 254, 53, 261, 54, 55, 56, ! 57, 58, 277, 102, 271, 278, 800, 103, 679, 401, ! 263, 60, 382, 383, 384, 798, 909, 832, 833, 834, ! 1008, 835, 930, 836, 837, 1019, 1068, 1116, 1022, 1070, ! 1117, 682, 280, 920, 890, 891, 281, 61, 62, 63, ! 64, 445, 447, 452, 290, 65, 934, 571, 285, 286, ! 443, 687, 690, 688, 691, 450, 451, 255, 396, 527, ! 922, 894, 895, 530, 531, 272, 605, 606, 607, 608, ! 609, 610, 414, 375, 847, 1031, 1035, 508, 509, 510, ! 819, 820, 376, 612, 226, 821, 960, 961, 1024, 962, ! 1026, 415, 551, 1078, 1032, 1079, 1080, 963, 1077, 1025, ! 1131, 1027, 1120, 1149, 1162, 1122, 1102, 867, 868, 949, ! 1103, 1112, 1113, 1114, 1152, 647, 776, 664, 900, 1048, ! 665, 666, 904, 667, 781, 404, 537, 668, 669, 602, ! 227, 67, 88, 68, 69, 70, 517, 874, 389, 759, ! 1036, 622, 392, 633, 761, 71, 393, 91, 72, 522, ! 638, 523, 643, 880, 881, 73, 74, 188, 456, 724, ! 518, 519, 631, 766, 1040, 632, 765, 969, 319, 576, ! 721, 722, 723, 923, 924, 458, 578, 320, 321, 322, ! 323, 324, 734, 735, 839, 736, 470, 228, 336, 586, ! 473, 474, 475, 229, 230, 231 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -972 static const short yypact[] = { ! 123, 143, 153, 3997, -972, 3997, 453, -972, -972, -972, ! -972, 75, 75, 75, 45, -972, 127, -972, 805, -972, ! -972, 805, 805, -972, 162, 805, 162, 805, 805, -972, ! -972, -972, -972, 185, 216, 2496, 4262, 4170, 4279, 498, ! 121, 687, 557, 4181, 4291, 4234, 4317, 812, 848, 858, ! 1003, -972, -972, 210, -972, -972, -972, -972, -972, 75, ! -972, 337, 382, 402, -972, -972, 3997, -972, -972, -972, ! -972, -972, -972, -972, -972, -972, -972, -972, 75, 75, ! 75, 3527, 236, -972, -972, -972, -972, -972, 110, 322, ! 78, -972, -972, 285, 41, -972, 260, 805, 3046, -972, ! 91, 75, 392, -972, 1290, -972, -972, -972, -972, 75, ! -972, -972, -972, -972, -972, -972, -972, -972, 75, -972, ! -972, -972, -972, -972, -972, -972, -972, 75, -972, -972, ! -972, -972, -972, -972, -972, -972, 75, -972, -972, -972, ! -972, -972, -972, -972, -972, 75, -972, -972, -972, -972, ! -972, -972, -972, -972, 75, -972, -972, -972, -972, -972, ! -972, -972, -972, 75, -972, -972, -972, -972, -972, -972, ! -972, -972, 75, -972, -972, -972, -972, 142, 216, -972, ! -972, 251, 241, 251, 267, -972, 305, -972, 4392, -972, ! -972, -972, -972, -972, 3527, 3527, 239, 331, 341, -972, ! 805, -972, -972, -972, 3527, -972, -972, 1501, -972, 347, ! 349, 357, -972, -972, 416, 3527, 353, 361, -972, 3594, ! 3661, -972, 4329, 1418, 442, 373, 1954, 3527, -972, -972, ! -972, -972, 1096, -972, 805, 805, 805, 384, 805, 805, ! -972, -972, -972, -972, 397, 403, 4682, 1753, 4686, 4830, ! 729, 1067, 999, 1179, -972, 410, 254, 476, 269, 489, ! -972, 216, 216, 75, -972, 75, -972, 433, 75, 2798, ! 3768, 75, -972, -972, 91, 75, -972, 400, -972, 1619, ! 623, 690, 406, 1354, 436, 422, 3977, -972, 435, -972, ! 464, -972, -972, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, -972, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, -972, -972, -972, 315, 4714, -972, -972, -972, ! -972, 3847, 497, -972, -972, -972, -972, 3527, 3527, 4714, ! -972, -972, 465, -972, 473, 478, 3186, 4428, 4714, 805, ! -972, -972, 475, 3527, 1501, -972, 1501, -972, 3527, 3527, ! 526, -972, -972, 3527, 3527, 3527, 3527, 3527, 3527, 3527, ! 3527, 3527, 3527, 3527, 3527, -972, -972, 805, 3527, 3527, ! 805, -972, 574, 502, -972, 559, 521, -972, -972, -972, ! -972, -972, 232, -972, 541, -972, 162, 527, -972, 548, ! 523, 555, -972, 548, -972, -972, 362, -972, 690, 146, ! 216, -972, 616, -972, -972, 3046, 3259, -972, 562, 3119, ! 601, -972, 1464, 70, -972, -972, 644, 142, 142, -972, ! 75, -972, 3768, 75, 75, -972, -972, -972, 3768, 630, ! 75, -972, -972, 4682, 1753, 4686, 4830, 729, 1067, 999, ! 1179, -972, 678, 614, 971, 251, 75, 251, -972, 675, ! 638, -972, 464, 4714, -972, 645, 646, 722, -972, 497, ! -972, 870, 1882, 4812, 652, -972, -972, 3326, -972, -972, ! -972, -972, 699, 670, 4428, -972, 682, 701, -972, 4329, ! 707, 731, 4329, 4329, 3527, 736, 3527, 3527, 1394, 1802, ! 1213, 1358, 1331, 906, 906, 649, 649, -972, -972, -972, ! -972, 755, 361, 721, -972, -972, -972, 805, 2043, 559, ! -972, -972, 756, 1096, 3728, 741, 162, -972, 772, 4030, ! -972, -972, 441, 3876, 775, 91, 75, -972, -972, -972, ! -972, 702, -972, -972, -972, 180, 67, 4116, 757, 3527, ! -972, -972, 3527, 3393, -972, 761, -972, -972, -972, -972, ! -972, 4742, -972, 623, 352, 142, -972, 809, -972, -972, ! 783, -972, -972, -972, -972, -972, 773, -972, 782, 3527, ! 805, 791, 638, 794, 4472, 1708, -972, -972, 4564, 4714, ! -972, 4714, 3527, 4714, -972, -972, 4508, -972, -972, 699, ! -972, -972, -972, 798, 798, 846, 3527, 1675, 1601, -972, ! -972, -972, 443, 601, -972, -972, 73, 85, 93, 96, ! 896, -972, 822, -972, -972, -972, -972, -972, -972, 283, ! 826, -972, 548, -972, 546, -972, -972, 216, -972, -972, ! -972, 509, -972, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, -972, 833, -972, 362, 362, -972, 75, -972, ! -972, 827, -972, -972, 4590, 4746, 1130, 917, 4594, 4772, ! 1276, 1054, -972, -972, -972, 838, 462, -972, -972, 310, ! -972, 837, 845, -972, -972, -972, -972, 855, 857, 2553, ! -972, -972, 916, -972, -972, -972, -972, 860, -972, -972, ! 865, -972, -972, 75, 75, 4329, -972, 75, 861, 805, ! -972, 3847, 4590, 4746, 4622, 4800, 1130, 917, 1317, 1160, ! 4594, 4772, 4650, 4826, 1276, 1054, 1339, 1205, 871, 872, ! -972, -972, 4654, 1812, 83, -972, 866, 877, 884, 4864, ! 886, 2310, 3527, 925, 883, 4508, -972, -972, 2275, -972, ! 805, -972, -972, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, -972, -972, -972, 2709, -972, 3527, -972, -972, ! 903, 548, -972, 142, 216, 4392, 4088, -972, 619, 3895, ! 455, 455, -972, -972, -972, 897, 4152, -972, -972, -972, ! -972, 712, 165, -972, -972, 4536, -972, 976, -972, -972, ! 83, -972, 142, -972, 216, -972, -972, 4329, -972, -972, ! 2553, -972, 75, 747, 75, 111, -972, -972, -972, 75, ! -972, -972, -972, 712, -972, -972, -972, 899, -972, -972, ! 909, -972, 805, -972, 3527, -972, -972, 949, 805, -972, ! 951, 4329, 913, 912, -972, -972, 48, 2486, 361, -972, ! 3527, -972, 925, -972, 3527, -972, 2871, -972, 968, 3527, ! 972, 936, 937, 3460, 680, 1015, 356, 393, -972, -972, ! 939, -972, -972, -972, 946, 627, -972, -972, -972, 2960, ! 359, 817, -972, 963, 548, -972, -972, -972, 3527, 985, ! 947, -972, 947, -972, -972, -972, 91, 75, -972, 75, ! 714, 728, 292, -972, -972, 75, 91, 75, 292, -972, ! 75, -972, -972, -972, -972, -972, -972, 470, 542, 2310, ! 83, -972, 83, -972, 3527, 213, -972, 3527, 247, -972, ! 75, 292, -972, 573, -972, -972, -972, -972, 4882, -972, ! 2310, -972, -972, 2399, -972, 2620, -972, -972, -972, 2275, ! 1550, -972, -972, -972, -972, 957, 3527, 959, -972, 979, ! -972, -972, 142, 216, -972, -972, -972, -972, -972, 981, ! 1033, 2132, 76, -972, -972, -972, -972, -972, 982, 118, ! 4329, 3527, 75, 712, 325, -972, 75, -972, 75, -972, ! -972, 75, 165, 165, -972, -972, 712, 165, -972, -972, ! 965, -972, -972, -972, -972, 3779, 3527, -972, -972, 3779, ! 3527, -972, -972, -972, -972, 712, -972, 969, 2620, -972, ! -972, 3527, -972, -972, 973, -972, 3527, 1010, 586, -972, ! 636, 592, -972, 960, 992, 1005, -972, 1011, 3527, 2221, ! -972, -972, -972, -972, 3527, -972, 548, -972, -972, -972, ! -972, 4329, 455, 714, 728, 449, -972, -972, 4152, 75, ! 292, -972, 292, -972, -972, 747, -972, 3779, -972, 3779, ! -972, -972, -972, 4923, -972, 66, 75, -972, 3768, -972, ! 3768, 3527, 3527, 1052, 2960, 1007, -972, -972, -972, -972, ! -972, 1009, 1023, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, 69, 998, -972, -972, -972, 1012, 1014, -972, ! -972, -972, -972, 1002, -972, -972, -972, -972, 1021, -972, ! 1040, 805, 101, 1020, -972, -972, -972, -972, -972, -972, ! 3527, -972, -972, -972, 3527, 1019, 69, 1026, 69, -972, ! -972, -972, 1028, -972, 1031, 1108, 128, -972, -972, 899, ! 899, -972, -972, -972, 1053, 616, 1034, -972, -972, 3527, ! 3527, 442, 372, -972, 1037, 1038, 1043, 616, -972, -972, ! -972, 442, -972, -972 }; + /* YYPGOTO[NTERM-NUM]. */ static const short yypgoto[] = { ! -972, -972, -972, -972, -972, 82, -487, -972, -972, -972, ! -972, -972, -972, -972, -18, -972, -9, 608, -353, 578, ! -972, -972, -972, -95, 841, -972, -972, -972, -972, -972, ! -972, -972, -396, -972, -417, 715, -972, -972, 105, 597, ! -394, -819, 30, 65, 22, 90, 113, 135, 159, 183, ! -345, -225, -551, -535, -208, -148, -533, -528, -485, -468, ! 579, 587, -484, -240, -202, -732, -257, 1088, 1209, 1174, ! 1237, -972, -743, -177, -266, 593, -972, 751, -972, 343, ! 17, 117, -972, 640, -972, 354, -972, -621, -972, 222, ! -972, -780, -972, -972, 321, -972, -972, -972, -972, -972, ! -972, -136, 383, -722, 197, -152, 176, -972, -972, -972, ! -972, -972, -972, -972, -972, -972, -972, 584, -122, -972, ! 733, -972, -972, 262, 264, 730, 618, 726, -972, -972, ! -680, -388, -314, -608, -972, 102, -972, -972, -972, -972, ! -972, -972, -309, -972, -972, -692, 100, -972, -972, 697, ! -737, -972, 387, -972, -972, -707, -972, -972, -972, -972, ! -972, -84, -509, 140, -971, -367, -272, -972, -972, -972, ! -972, -972, -972, -972, -972, -972, -972, -972, -972, -972, ! -893, 103, -972, 80, -972, 580, -972, -738, -972, -972, ! 653, 656, -972, -972, 564, -403, -972, -972, -972, -972, ! 9, -972, 320, -972, -972, -972, -972, -972, -972, -972, ! -972, -972, -972, -972, -972, -972, -972, -24, -8, -481, ! -972, 598, -972, 466, 200, -446, -972, -972, -972, -972, ! -374, -972, -972, -972, -972, 617, -972, -972, 484, -972, ! -972, -972, 528, -972, 246, 561, -972, 706, 718, -229, ! -972, -290, -972, -972, 458, 558, -972, -972, -972, -972, ! -972, -972, 825, -972, -972, -972 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -656 static const short yytable[] = { ! 87, 282, 95, 89, 90, 556, 536, 93, 528, 87, ! 97, 559, 66, 423, 66, 502, 92, 417, 92, 524, ! 59, 558, 59, 864, 712, 37, 555, 37, 78, 79, ! 80, 460, 626, 35, 628, 35, 624, 774, 884, 641, ! 713, 279, 716, 182, 184, 186, 442, 717, 866, 907, ! 964, 629, 109, 906, 118, 1073, 127, 937, 136, 889, ! 145, 288, 154, 865, 163, 237, 172, 409, 36, 241, ! 36, -117, 216, 630, -459, 66, 371, 1033, 1110, 244, ! 549, 92, 529, 59, 817, 92, -460, 75, 37, 245, ! 718, 935, 459, 38, -461, 38, 35, -462, 10, 325, ! 326, 893, 899, 548, 755, 16, 1105, 719, 472, 331, ! 925, 81, 1092, 828, 99, 59, 39, 59, 39, 1038, ! 341, 16, 258, -2, 238, 242, 128, 9, 129, 234, ! 256, 36, 377, 11, 12, 13, 1111, 864, 40, 866, ! 40, 614, 1034, 4, 239, 99, 273, 1126, 187, 1093, ! 650, 1133, 768, -3, 865, 1010, 38, 917, -439, -117, ! 1141, 502, 41, 233, 41, 257, 790, 240, 99, 100, ! -440, 712, 818, 991, 1145, 992, 180, 101, -441, 39, ! 803, -442, 330, 805, 1127, 630, 42, 713, 42, 716, ! 259, 1163, 658, 82, 717, 180, 180, 180, 234, 611, ! 274, 40, 1039, 539, 442, -259, 658, 267, 275, 1018, ! 104, 1146, 268, 269, 381, 18, 385, 386, 387, 99, ! 390, 391, 276, 896, 59, 41, 180, 1132, 1062, 533, ! 710, 897, 269, 658, 712, 180, 615, 718, 846, 742, ! 745, 748, 751, 16, 180, 589, 268, 269, 760, 42, ! 713, 98, 716, 180, 719, 1101, 1154, 717, 775, 996, ! 408, 106, 180, 109, 1049, 118, 720, 127, 645, 136, ! 862, 180, 449, 109, 100, 118, 115, 16, 871, 876, ! 180, 628, 101, 642, 16, 641, 59, 863, 990, 180, ! 910, 59, 912, 1000, 179, 444, 258, 454, 629, 16, ! 902, 753, 232, 59, 256, 327, 1051, 1053, 435, 1007, ! 1085, 331, 659, 268, 269, 512, 433, 903, 83, 84, ! 513, 477, 16, 566, 284, 568, 659, 469, 99, 660, ! 287, 773, 529, 59, 743, 746, 749, 752, 18, 257, ! 83, 84, 864, 660, 243, 94, 59, 96, 234, 500, ! 711, 434, 504, 659, 283, 59, 289, 733, 268, 269, ! 503, 59, 515, 59, 259, 774, 756, 714, 235, -582, ! 660, 757, 585, -582, 774, 18, 436, 710, 92, 838, ! 180, 453, 425, 886, 862, 83, 84, 873, 236, 661, ! 85, 887, 269, 786, 291, 86, 538, 328, 787, 437, ! 545, 863, -35, 661, 870, 83, 84, 329, 913, 18, ! 916, 460, 85, 337, 816, 338, 423, 86, 424, 269, ! 525, 438, 59, 339, 613, 340, 181, 715, 526, 269, ! 661, 658, 1147, 1148, 449, 680, 342, 398, 399, -34, ! 710, 1017, 965, 580, 262, 439, 18, 343, 331, 343, ! 109, 371, 118, 444, 127, 1156, 136, 85, 99, 273, ! 1157, 59, 86, 675, 372, 448, 435, 83, 84, 440, ! 59, 183, 459, 388, 433, 595, 264, 85, 689, 692, ! 265, 394, 86, 111, 419, 1055, 395, 838, 420, 601, ! 426, 185, 623, 397, 265, 381, 120, 711, 532, 402, ! 968, 878, 429, 123, 9, 124, 842, 430, 92, 434, ! 11, 12, 13, 274, 714, 978, 269, 634, 635, 636, ! 446, 275, 613, 613, 747, 613, 637, 739, 16, 642, ! 671, 740, 1084, 672, 436, 276, 59, 76, 77, 85, ! 59, 37, 59, 461, 86, 435, 784, 258, 465, 35, ! 785, 659, 449, 433, 988, 256, 466, 437, 420, 478, ! 711, 467, 137, 9, 138, 19, 20, 654, 660, 11, ! 12, 13, -84, 1046, 715, 1047, 535, 714, 1042, 438, ! -636, 654, -258, 505, 36, 506, 775, 282, 434, 862, ! 257, 507, 59, 398, 399, 775, 59, 704, 59, 799, ! 59, 801, 655, 439, 511, 702, 863, 514, 654, 38, ! 516, 403, 520, 436, 416, 259, 655, 908, 418, -634, ! 1139, 1140, 634, 635, 636, 191, 989, 440, 661, 973, ! 265, 762, 39, 649, 879, 879, 437, 715, 521, 982, ! 703, -261, 955, 655, 956, 957, 958, 959, 177, 178, ! 656, 1095, 541, 1096, 40, 425, 425, 1004, 438, 773, ! 529, 1005, 1082, 267, 656, 705, -288, 915, 773, 529, ! 1067, 109, 657, 127, 420, 145, 1069, 163, 41, -288, ! 265, 810, 439, 83, 84, 546, 657, 552, 706, 424, ! 269, 656, 132, 9, 133, 634, 635, 636, 564, 11, ! 12, 13, 42, 658, 877, 560, 440, 362, 363, 364, ! 707, 741, 744, 657, 750, 99, 885, 16, 569, 109, ! -288, 118, 845, 127, -288, 136, 570, 145, 574, 154, ! 575, 163, 577, 172, 708, 9, 124, 859, 946, 59, ! 583, 11, 12, 13, 704, 587, 860, 532, 532, 1151, ! 99, 273, 702, 588, 423, 85, 268, 269, 709, 16, ! 86, 1161, -394, -394, 869, 591, 557, 403, 648, 269, ! 886, -260, 59, 561, 377, 950, 1021, 37, 887, 269, ! 976, 269, 596, 59, 592, 35, 59, 703, 37, 567, ! 593, 435, 888, 914, 978, 269, 35, 345, 347, 433, ! 553, 554, 59, 535, 927, 274, 654, 704, 83, 84, ! 929, 600, 705, 275, 594, 702, 1020, 159, 9, 160, ! 36, 1044, 1045, 659, 11, 12, 13, 276, 859, 994, ! 621, 36, 692, 95, 434, 706, 947, 860, 599, 617, ! 660, 655, 16, 625, 945, 38, 644, 670, 92, 92, ! 703, 674, 684, 164, 9, 165, 38, 707, 693, 436, ! 11, 12, 13, 168, 9, 169, 686, 694, 39, 646, ! 11, 12, 13, 83, 84, 705, 697, 699, 869, 39, ! 85, 708, 437, 532, 532, 86, 59, 584, 16, 656, ! 40, 37, 737, 634, 635, 636, -266, 410, 706, 35, ! 661, 40, 966, 59, 438, 709, 879, 754, 258, 758, ! 779, 657, 981, 59, 41, 532, 256, 772, 258, 915, ! 707, 783, 128, 9, 129, 41, 256, 788, 439, 11, ! 12, 13, -267, 335, 36, 789, 579, 1014, 42, 791, ! 535, 793, -268, 267, 708, 85, 809, 747, 802, 42, ! 86, 257, 440, 804, 785, 812, 814, 892, 898, 38, ! 822, 257, 360, 361, 362, 363, 364, 823, 709, 825, ! 535, 840, 431, 841, 872, 7, 259, 9, 10, 905, ! 883, 918, 39, 11, 12, 13, 259, 267, 818, 921, ! -288, 777, 977, 979, 374, -32, 747, 931, 932, 15, ! 933, 16, 17, -288, 40, 9, 133, 1065, 173, 9, ! 174, 11, 12, 13, -33, 11, 12, 13, 941, 1075, ! 942, 943, 948, 951, 18, 1081, 268, 269, 41, 16, ! 954, 971, 1129, 1130, 967, 972, 806, 807, 562, 563, ! 808, 1013, 455, 1015, -288, 1016, 24, 1028, -288, 1029, ! 1054, 26, 42, 1037, 1061, 464, 1066, 1064, 1071, 164, ! 9, 165, 1097, 1098, 476, 1100, 11, 12, 13, 1099, ! 480, 1072, 481, 9, 129, 532, 532, 1074, 654, 11, ! 12, 13, 1115, 869, 532, 532, 1121, -269, 532, 532, ! 1104, 59, 1108, 1125, 1109, 1118, 37, 1119, 180, 83, ! 84, 378, 379, 380, 35, 1123, 1124, 532, 1128, 1135, ! 1137, 1100, 1142, 655, 1143, 1134, 627, 1144, 1153, 1150, ! 1158, 1159, 620, 107, 112, 116, 121, 1160, 550, 1023, ! 677, 143, 148, 152, 157, 123, 9, 124, 678, 36, ! 1100, 1155, 11, 12, 13, 977, 979, 979, 681, 398, ! 399, 534, 919, 618, 911, 1009, 698, 936, 398, 399, ! 16, 656, 1050, 1052, 38, 137, 9, 138, 462, 463, ! 1043, 85, 11, 12, 13, 993, 86, 565, 1106, 573, ! 998, 921, 572, 657, 479, 9, 138, 39, 696, 482, ! 483, 11, 12, 13, 488, 489, 490, 491, 492, 493, ! 494, 495, 496, 497, 498, 499, 616, 926, 1138, 40, ! 173, 9, 174, 125, 130, 134, 139, 11, 12, 13, ! 1107, 161, 166, 170, 175, 763, 764, 782, 778, 1136, ! 974, 725, 975, 41, 726, 980, 769, 882, 770, 771, ! 983, 984, 1083, 985, 108, 113, 117, 122, 767, 875, ! 815, 1060, 144, 149, 153, 158, 0, 42, 997, 780, ! 780, 1001, 811, 1002, 1003, 356, 357, 358, 359, 360, ! 361, 362, 363, 364, 792, 794, 126, 131, 135, 140, ! 700, 159, 9, 160, 162, 167, 171, 176, 11, 12, ! 13, 266, 701, 843, -28, -28, -28, -28, 938, 590, ! 0, 0, -28, -28, -28, 727, 16, 728, 0, 730, ! 0, 0, 0, 0, 0, 813, 0, 267, -28, 403, ! -288, 403, 132, 9, 133, 0, 0, 597, 598, 11, ! 12, 13, 0, -288, 107, 112, 116, 121, 1056, 0, ! 0, 0, 1058, -28, 168, 9, 169, 16, 0, 0, ! 0, 11, 12, 13, 0, 427, 268, 269, -24, -24, ! -24, -24, 0, 627, 0, -28, -24, -24, -24, 16, ! -28, 0, 0, 0, -288, 0, 0, 0, -288, -28, ! 0, 267, -24, 0, -288, 358, 359, 360, 361, 362, ! 363, 364, 1086, 1087, 0, 1088, 0, -288, 0, 0, ! 1089, 0, 1090, 0, 0, 0, 0, -24, 0, 1094, ! 695, 357, 358, 359, 360, 361, 362, 363, 364, 0, ! 268, 269, 0, 729, 125, 130, 134, 139, 0, -24, ! 0, 0, 0, 0, -24, 0, 0, 738, -288, 0, ! 0, 0, -288, -24, 354, 355, 356, 357, 358, 359, ! 360, 361, 362, 363, 364, 108, 113, 117, 122, 952, ! 953, 0, 0, 0, 0, 410, 0, 0, -120, -120, ! -120, -120, 0, 0, -120, 0, -120, -120, -120, 365, ! 366, 0, 0, 367, 368, 369, 370, 126, 131, 135, ! 140, 0, -120, 0, 0, 0, 0, 0, 0, 986, ! 987, 0, 332, 0, 189, 7, 0, 9, 10, 190, ! 191, 0, 192, 11, 12, 13, 0, -120, 0, 0, ! 797, 107, 112, 116, 121, 0, 0, 0, 0, 15, ! 193, 16, 17, 0, 194, 195, 196, 197, 198, -120, ! 0, 0, 0, 199, -120, 0, 0, 0, 0, 200, ! 0, 0, 201, -120, 18, 0, 0, 202, 203, 204, ! 1011, 0, 205, 206, 0, 0, 0, 207, 208, 0, ! 0, 0, 831, 209, 0, 210, 24, 0, 0, 0, ! 211, 26, 0, 0, 0, 0, 0, 212, 213, 0, ! 333, 0, 214, 348, 349, 350, 1012, 351, 352, 353, ! 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, ! 364, 125, 130, 134, 139, 0, 0, 0, 0, 0, ! 421, 0, 0, -20, -20, -20, -20, 0, 0, 0, ! 0, -20, -20, -20, 0, 0, 0, 0, 0, 0, ! 0, 797, 108, 113, 117, 122, 267, -20, 0, -288, ! 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, ! 363, 364, -288, 0, 0, 928, 0, 0, 0, 0, ! 0, 0, -20, 0, 126, 131, 135, 140, 831, 0, ! 0, 0, 0, 0, 0, 939, 0, 0, 0, 0, ! 940, 0, 0, 0, -20, 0, 0, 0, 0, -20, ! 0, 0, 0, -288, 0, 0, 0, -288, -20, 410, ! 0, 0, 7, 8, 9, 10, 0, 0, 0, 970, ! 11, 12, 13, 352, 353, 354, 355, 356, 357, 358, ! 359, 360, 361, 362, 363, 364, 15, 0, 16, 0, ! 0, 0, 107, 112, 0, 0, 143, 148, 0, 0, ! 831, 0, 0, 0, 0, 995, 0, 7, 999, 9, ! 111, 18, 0, 0, 0, 11, 12, 13, 0, 0, ! 0, 831, 0, 0, 831, 0, 831, 0, 0, 0, ! 0, 15, 0, 24, 0, 0, 0, 0, 26, 0, ! 107, 112, 116, 121, 0, 0, 0, -653, 143, 148, ! 152, 157, 0, 0, 0, 0, 18, 0, 0, 0, ! 0, 0, 1041, 410, 0, 0, -655, -655, -655, -655, ! 0, 0, 0, 0, -655, -655, -655, 0, 24, 0, ! 125, 130, 0, 26, 161, 166, 0, 1057, 0, 0, ! -655, 1059, -655, 0, 0, 0, 0, 0, 0, 831, ! 0, 0, 1063, 355, 356, 357, 358, 359, 360, 361, ! 362, 363, 364, 108, 113, -655, 0, 144, 149, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 125, 130, 134, 139, 0, 0, 0, -655, 161, 166, ! 170, 175, -655, 126, 131, 0, 0, 162, 167, 0, ! 0, -655, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 108, 113, 117, 122, 0, 0, 0, 0, 144, ! 149, 153, 158, 0, 0, 348, 349, 350, 0, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, ! 362, 363, 364, 126, 131, 135, 140, 0, 0, 0, ! 0, 162, 167, 171, 176, 373, 0, -464, -464, -464, ! -464, -464, -464, -464, 0, -464, -464, -464, -464, -464, ! 581, -464, -464, -464, -464, -464, -464, -464, -464, -464, ! -464, -464, -464, -464, -464, -464, -464, -464, -464, -464, ! -464, -464, 0, 0, 0, 0, -464, 0, 0, 0, ! 0, 0, -464, 0, 0, -464, 0, -464, 0, 0, ! -464, -464, -464, 0, 0, -464, -464, 0, 0, 0, ! -464, -464, 0, 0, 0, 0, -464, 0, -464, -464, ! 0, 0, 0, -464, -464, 0, 0, 0, -464, 374, ! -464, -464, 0, -464, 603, -464, -488, -488, -488, -488, ! -488, -488, -488, 0, -488, -488, -488, -488, -488, 0, ! -488, -488, -488, -488, -488, -488, -488, -488, -488, -488, ! -488, -488, -488, -488, -488, 0, -488, -488, -488, -488, ! -488, 0, 0, 0, 0, -488, 0, 0, 0, 0, ! 0, -488, 0, 0, -488, 0, -488, 0, 0, -488, ! -488, -488, 0, 0, -488, -488, 0, 0, 0, -488, ! -488, 0, 0, 0, 0, -488, 0, -488, -488, 0, ! 0, 0, -488, -488, 0, 0, 0, -488, 0, -488, ! -488, 0, -488, 1030, -488, -466, -466, 0, 0, 0, ! -466, -466, 0, -466, 0, 0, 0, -466, 0, -466, ! -466, -466, -466, -466, -466, -466, -466, -466, -466, -466, ! 0, -466, 0, -466, 0, -466, -466, -466, -466, -466, ! 0, 0, 0, 0, -466, 0, 0, 0, 0, 0, ! -466, 0, 0, -466, 0, 0, 0, 0, -466, -466, ! -466, 0, 0, -466, -466, 0, 0, 0, -466, -466, ! 0, 0, 0, 0, -466, 0, -466, -466, 0, 0, ! 0, -466, -466, 0, 0, 0, -466, 0, -466, -466, ! 0, -466, 1076, -466, -495, -495, 0, 0, 0, -495, ! -495, 0, -495, 0, 0, 0, -495, 0, -495, -495, ! -495, -495, -495, -495, -495, -495, -495, -495, -495, 0, ! -495, 0, -495, 0, -495, -495, -495, -495, -495, 0, ! 0, 0, 0, -495, 0, 0, 0, 0, 0, -495, ! 0, 0, -495, 0, 0, 0, 0, -495, -495, -495, ! 0, 0, -495, -495, 0, 0, 0, -495, -495, 0, ! 0, 0, 0, -495, 0, -495, -495, 0, 0, 0, ! -495, -495, 0, 0, 0, -495, 0, -495, -495, 0, ! -495, 826, -495, 827, 84, 0, 0, 0, 190, 191, ! 350, 192, 351, 352, 353, 354, 355, 356, 357, 358, ! 359, 360, 361, 362, 363, 364, 0, 0, 0, 193, ! 0, 17, 0, 194, 195, 196, 197, 198, 0, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 200, 0, ! 0, 201, 0, 0, 0, 0, 202, 203, 204, 0, ! 0, 205, 206, 0, 0, 828, 207, 208, 0, 0, ! 0, 0, 209, 0, 210, 85, 0, 0, 0, 211, ! 86, 0, 0, 0, 0, -316, 212, 213, 0, 829, ! 826, 214, 827, 84, 0, 0, 0, 190, 191, 0, ! 192, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 193, 0, ! 17, 0, 194, 195, 196, 197, 198, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 200, 0, 0, ! 201, 0, 0, 0, 0, 202, 203, 204, 0, 0, ! 205, 206, 0, 0, 828, 207, 208, 0, 0, 0, ! 0, 209, 0, 210, 85, 0, 0, 0, 211, 86, ! 0, 0, 0, 0, -382, 212, 213, 826, 829, 189, ! 214, 0, 0, 0, 190, 191, 0, 192, 0, 0, ! 7, 105, 9, 106, 0, 0, 0, 0, 11, 12, ! 13, 0, 0, 0, 0, 193, 0, 17, 0, 194, ! 195, 196, 197, 198, 15, 0, 16, 0, 199, -329, ! 0, 0, 0, 0, 200, 0, 0, 201, 0, 0, ! 0, 0, 202, 203, 204, 0, 0, 205, 206, 18, ! 0, -329, 207, 208, 795, 0, 189, 0, 209, 0, ! 210, 190, 191, 0, 192, 211, 0, 0, 0, 0, ! 0, 24, 212, 213, 0, 829, 26, 214, 0, 0, ! -254, 0, 193, 0, 17, 0, 194, 195, 196, 197, ! 198, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 200, 0, 0, 201, 0, 0, 0, 0, 202, ! 203, 204, 0, 0, 205, 206, 0, 0, 0, 207, ! 208, 826, 0, 189, 0, 209, 0, 210, 190, 191, ! 0, 192, 211, 0, 0, 0, 0, 0, 0, 212, ! 213, 0, 796, 0, 214, 0, 0, 0, 0, 193, ! 0, 17, 0, 194, 195, 196, 197, 198, 0, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 200, 0, ! 0, 201, 0, 0, 0, 0, 202, 203, 204, 0, ! 0, 205, 206, 0, 0, 0, 207, 208, 0, 0, ! 0, 0, 209, 0, 210, 0, 0, 0, 0, 211, ! 0, 0, 0, 0, 0, 0, 212, 213, 0, 829, ! 0, 214, 827, 848, 8, 9, 10, 190, 191, 0, ! 192, 11, 12, 13, 0, 0, 0, 0, 0, 0, ! 849, 850, 851, 852, 853, 854, 855, 15, 193, 16, ! 17, 0, 194, 195, 196, 197, 198, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 200, 0, 0, ! 201, 0, 18, 0, 0, 202, 203, 204, 0, 0, ! 205, 206, 0, 0, 0, 207, 208, 0, 0, 0, ! 0, 209, 0, 210, 856, 0, 0, 0, 211, 857, ! 0, 0, 0, 858, 0, 212, 213, 0, 818, 0, ! 214, 189, 7, 405, 9, 10, 190, 191, 0, 192, ! 11, 12, 13, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 15, 193, 16, 17, ! 0, 194, 195, 196, 197, 198, 0, 0, 0, 0, ! 199, 0, 0, 0, 0, 0, 200, 0, 0, 201, ! 0, 18, 0, 0, 202, 203, 406, 0, 0, 205, ! 206, 0, 0, 0, 207, 208, 0, 0, 0, 0, ! 209, 0, 210, 24, 827, 84, 0, 211, 26, 190, ! 191, 0, 192, 0, 212, 213, 0, 0, 407, 214, ! 0, 0, 849, 850, 851, 852, 853, 854, 855, 0, ! 193, 0, 17, 0, 194, 195, 196, 197, 198, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 200, ! 0, 0, 201, 0, 0, 0, 0, 202, 203, 204, ! 0, 0, 205, 206, 0, 0, 0, 207, 208, 0, ! 0, 0, 0, 209, 0, 210, 85, 0, 0, 0, ! 211, 86, 0, 0, 0, 858, 0, 212, 213, 0, ! 818, 0, 214, 189, 7, 8, 9, 10, 190, 191, ! 0, 192, 11, 12, 13, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 15, 193, ! 16, 17, 0, 194, 195, 196, 197, 198, 0, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 200, 0, ! 0, 201, 0, 18, 0, 0, 202, 203, 204, 0, ! 0, 205, 206, 0, 0, 0, 207, 208, 0, 0, ! 0, 0, 209, 0, 210, 24, 0, 0, 0, 211, ! 26, 0, 0, 0, 0, 0, 212, 213, 0, 189, ! 7, 214, 9, 10, 190, 191, 0, 192, 11, 12, ! 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 15, 193, 16, 17, 0, 194, ! 195, 196, 197, 198, 0, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 200, 0, 0, 201, 0, 18, ! 0, 0, 202, 203, 204, 0, 0, 205, 206, 0, ! 0, 0, 207, 208, 0, 0, 0, 0, 209, 0, ! 210, 24, 189, 0, 542, 211, 26, 190, 191, 0, ! 192, 0, 212, 213, 0, 0, 0, 214, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 193, 0, ! 17, 0, 194, 195, 196, 197, 198, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 200, 0, 0, ! 201, 0, 0, 0, 0, 202, 203, 543, 0, 0, ! 205, 206, 0, 0, 0, 207, 208, 0, 0, 189, ! 0, 209, 0, 210, 190, 191, 0, 192, 211, 0, ! 0, 0, 0, 0, 0, 212, 213, 0, 0, 544, ! 214, 0, 0, 0, 0, 193, 0, 17, 0, 194, ! 195, 196, 197, 198, 0, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 200, 0, 0, 201, 0, 0, ! 0, 0, 202, 203, 204, 0, 0, 205, 206, 0, ! 0, 0, 207, 208, 0, 0, 0, 0, 209, 0, ! 210, 468, 189, 0, 0, 211, 0, 190, 191, 0, ! 192, 0, 212, 213, 0, 0, 0, 214, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 193, 0, ! 17, 0, 194, 195, 196, 197, 198, 0, 0, 0, ! 0, 199, 0, 0, 0, 0, 0, 200, 0, 0, ! 201, 0, 0, 0, 0, 202, 203, 204, 0, 0, ! 205, 206, 0, 0, 0, 207, 208, 0, 0, 189, ! 0, 209, 0, 210, 190, 191, 0, 192, 211, 0, ! 0, 0, 0, 0, 0, 212, 213, 0, 0, 540, ! 214, 0, 0, 0, 0, 193, 0, 17, 0, 194, ! 195, 196, 197, 198, 0, 0, 0, 0, 199, 0, ! 0, 0, 0, 0, 200, 0, 0, 201, 0, 0, ! 0, 0, 202, 203, 204, 0, 0, 205, 206, 0, ! 0, 0, 207, 208, 0, 0, 189, 0, 209, 0, ! 210, 190, 191, 0, 192, 211, 0, 0, 0, 0, ! 0, 0, 212, 213, 0, 584, 0, 214, 0, 0, ! 0, 0, 193, 0, 17, 0, 194, 195, 196, 197, ! 198, 0, 0, 0, 0, 199, 0, 0, 0, 0, ! 0, 200, 0, 0, 201, 0, 0, 0, 0, 202, ! 203, 204, 0, 0, 205, 206, 0, 0, 0, 207, ! 208, 0, 0, 189, 0, 209, 0, 210, 190, 191, ! 0, 192, 211, 0, 0, 0, 0, 0, 0, 212, ! 213, 0, 0, 673, 214, 0, 0, 0, 0, 193, ! 0, 17, 0, 194, 195, 196, 197, 198, 0, 0, ! 0, 0, 199, 0, 0, 0, 0, 0, 200, 0, ! 0, 201, 0, 0, 0, 0, 202, 203, 204, 0, ! 0, 205, 206, 0, 0, 0, 207, 208, 0, 0, ! 189, 0, 209, 0, 210, 190, 191, 0, 192, 211, ! 0, 0, 0, 0, 944, 0, 212, 213, 0, 0, ! 0, 214, 0, 0, 0, 0, 193, 0, 17, 0, ! 194, 195, 196, 197, 198, 0, 0, 0, 0, 199, ! 0, 0, 0, 0, 0, 200, 0, 0, 201, 0, ! 0, 0, 0, 202, 203, 204, 0, 0, 205, 206, ! 0, 0, 0, 207, 208, 0, 0, 189, 0, 209, ! 0, 210, 190, 191, 0, 192, 211, 0, 0, 0, ! 0, 0, 0, 212, 213, 0, 0, 0, 214, 0, ! 0, 0, 0, 193, 0, 17, 0, 194, 195, 196, ! 197, 198, 0, 0, 0, 0, 199, 0, 0, 0, ! 0, 0, 200, 0, 0, 201, 0, 0, 0, 0, ! 202, 203, 204, 0, 0, 205, 206, 0, 0, 0, ! 344, 208, 0, 0, 189, 0, 209, 0, 210, 190, ! 191, 0, 192, 211, 0, 0, 0, 0, 0, 0, ! 212, 213, 0, 0, 0, 214, 0, 0, 0, 0, ! 193, 0, 17, 0, 194, 195, 196, 197, 198, 0, ! 0, 0, 0, 199, 0, 0, 0, 0, 0, 200, ! 0, 0, 201, 0, 0, 0, 0, 202, 203, 204, ! 0, 0, 205, 206, 0, 0, 0, 346, 208, 0, ! 0, 619, 0, 209, 0, 210, 190, 191, 0, 192, ! 211, 0, 0, 0, 0, 0, 0, 212, 213, 0, ! 0, 0, 214, 0, 0, 0, 0, 193, 0, 17, ! 0, 194, 195, 196, 197, 198, 0, 0, 0, 410, ! 199, 0, -488, -488, -488, -488, 200, 0, 0, 201, ! -488, -488, -488, 0, 202, 203, 204, 0, 0, 205, ! 206, 0, 0, 0, 207, 208, -488, 0, 0, 0, ! 209, 0, 210, 0, 0, 0, 0, 211, 0, 16, ! 0, 0, 0, 0, 212, 213, 0, 0, 0, 214, ! 0, -488, 348, 349, 350, 0, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, ! 0, 0, 0, -488, 0, 0, 0, 0, -488, 0, ! 292, 293, 0, 294, 295, 0, 0, -116, 296, 297, ! 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, ! 308, 309, 310, 311, 312, 313, 314, 639, 0, 0, ! 7, 0, 9, 10, 0, 0, 0, 0, 11, 12, ! 13, 0, 0, 315, 0, 0, 639, 0, 0, 7, ! 0, 9, 10, 0, 15, 0, 16, 11, 12, 13, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 317, 15, 0, 16, 0, 318, 0, 18, ! 0, 0, 0, 0, 0, 457, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, ! 0, 24, -612, -612, -612, 0, 26, 0, 0, 0, ! 640, -612, 0, 0, 0, 0, 0, 0, 0, 0, ! 24, -611, -611, -611, 0, 26, 0, 0, 431, 640, ! -611, 7, 0, 9, 10, 0, 0, 0, 0, 11, ! 12, 13, 0, 0, 0, 0, 0, 0, 6, 0, ! -129, 7, 8, 9, 10, 15, 0, 16, 17, 11, ! 12, 13, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 14, 15, 0, 16, 17, 0, ! 18, 6, 0, -129, 7, 8, 9, 10, 0, 0, ! 0, 0, 11, 12, 13, 0, 0, 0, 0, 0, ! 18, 0, 24, 19, 20, -129, 0, 26, 15, 0, ! 16, 432, -385, -129, 0, 0, 21, 22, 23, 0, ! 0, 0, 24, 0, 0, 0, 25, 26, 27, 28, ! 0, 29, 0, 18, 0, 0, 19, 20, -129, 6, ! 0, -129, 7, 8, 9, 10, -129, 0, 0, 0, ! 11, 12, 13, 0, 0, 24, 0, 0, 0, 0, ! 26, 0, 0, 0, 29, 0, 15, 651, 16, 652, ! 7, 8, 9, 10, 0, 0, 653, 0, 11, 12, ! 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 18, 0, 0, 15, 0, -129, 0, 0, 0, ! 0, 0, 0, 651, -129, 0, 7, 8, 9, 10, ! 0, 0, 653, 24, 11, 12, 13, 0, 26, 18, ! 0, 0, 29, 0, 7, 114, 9, 115, 0, 0, ! 15, 0, 11, 12, 13, 7, 141, 9, 142, 0, ! 0, 24, 0, 11, 12, 13, 26, 0, 15, -550, ! 16, 0, 0, 0, 0, 18, 0, 0, 0, 15, ! 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 18, 0, 0, 0, 24, 0, 0, ! 0, 0, 26, 0, 18, -550, 0, 0, 7, 150, ! 9, 151, 0, 0, 0, 24, 11, 12, 13, 0, ! 26, 0, 0, 0, -256, 0, 24, 0, 0, 0, ! 0, 26, 15, 0, 16, -262, 7, 110, 9, 111, ! 0, 0, 0, 0, 11, 12, 13, 0, 0, 0, ! 0, 0, 0, 7, 119, 9, 120, 18, 0, 0, ! 15, 11, 12, 13, 0, 7, 146, 9, 147, 0, ! 0, 0, 0, 11, 12, 13, 0, 15, 0, 24, ! 0, 0, 0, 0, 26, 18, 0, 0, -264, 15, ! 0, 7, 155, 9, 156, 0, 0, 0, 0, 11, ! 12, 13, 18, 0, 0, 0, 0, 24, 0, 0, ! 0, 0, 26, 0, 18, 15, -255, 0, 0, 0, ! 0, 0, 0, 0, 24, 0, 0, 0, 0, 26, ! 0, 0, 0, -257, 0, 0, 24, 0, 0, 0, ! 18, 26, 348, 349, 350, -263, 351, 352, 353, 354, ! 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, ! 0, 0, 24, 0, 0, 292, 293, 26, 294, 295, ! 0, -265, 0, 296, 297, 298, 299, 300, 301, 302, ! 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, ! 313, 314, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 292, 293, 0, 294, 295, 0, 0, 315, 296, ! 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, ! 307, 308, 309, 310, 311, 312, 313, 314, 316, 0, ! 0, 0, 0, 0, 0, 0, 0, 317, 0, 0, ! 0, 0, 318, 0, 471, 292, 293, 0, 294, 295, ! 0, 0, 0, 296, 297, 298, 299, 300, 301, 302, ! 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, ! 313, 314, 0, 317, 0, 0, 0, 0, 318, 0, ! 0, 292, 293, 0, 294, 295, 0, 0, 315, 296, ! 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, ! 307, 308, 309, 310, 311, 312, 313, 314, 0, 0, ! 7, 8, 9, 10, 0, 0, 901, 317, 11, 12, ! 13, 0, 318, 0, 732, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 15, 0, 16, 0, 7, 8, ! 9, 10, 0, 0, 653, 0, 11, 12, 13, 0, ! 0, 0, 0, 317, 0, 0, 0, 0, 318, 18, ! 0, 0, 15, 0, 7, 105, 9, 106, 7, 141, ! 9, 142, 11, 12, 13, 0, 11, 12, 13, 0, ! 0, 24, 0, 0, 0, 0, 26, 18, 15, 0, ! 16, 0, 15, 0, 16, 0, 7, 114, 9, 115, ! 0, 0, 0, 0, 11, 12, 13, 0, 0, 24, ! 0, 0, 0, 18, 26, 0, 0, 18, 0, 0, ! 15, 0, 16, 0, 7, 150, 9, 151, 7, 8, ! 9, 10, 11, 12, 13, 24, 11, 12, 13, 24, ! 26, 0, 0, 0, 26, 18, 0, 0, 15, 0, ! 16, 0, 15, 0, 16, 0, 7, 0, 9, 106, ! 7, 0, 9, 115, 11, 12, 13, 24, 11, 12, ! 13, 0, 26, 18, 0, 0, 0, 18, 0, 0, ! 15, 0, 16, 0, 15, 0, 16, 0, 7, 0, ! 9, 10, 0, 0, 0, 24, 11, 12, 13, 24, ! 26, 0, 0, 0, 26, 18, 0, 0, 0, 18, ! 0, 0, 15, 0, 16, 0, 7, 8, 9, 10, ! 7, 110, 9, 111, 11, 12, 13, 24, 11, 12, ! 13, 24, 26, 0, 0, 0, 26, 18, 0, 0, ! 15, 0, 0, 0, 15, 0, 7, 146, 9, 147, ! 0, 0, 0, 0, 11, 12, 13, 0, 0, 24, ! 0, 0, 0, 0, 26, 18, 0, 0, 0, 18, ! 15, 0, 0, 0, 7, 119, 9, 120, 0, 0, ! 0, 0, 11, 12, 13, 0, 0, 24, 0, 0, ! 0, 24, 26, 0, 0, 18, 26, 0, 15, 0, ! 7, 155, 9, 156, 7, 0, 9, 120, 11, 12, ! 13, 0, 11, 12, 13, 0, 0, 24, 0, 0, ! 0, 0, 26, 18, 15, 348, 349, 350, 15, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, ! 362, 363, 364, 0, 0, 24, 0, 0, 0, 18, ! 26, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 582, 24, 0, 0, 0, 24, 26, 348, 349, 350, ! 26, 351, 352, 353, 354, 355, 356, 357, 358, 359, ! 360, 361, 362, 363, 364, 348, 349, 350, 0, 351, ! 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, ! 362, 363, 364, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 824, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 1006, 348, 349, 350, 1091, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, ! 361, 362, 363, 364 }; static const short yycheck[] = { ! 18, 178, 26, 21, 22, 422, 402, 25, 396, 27, ! 28, 428, 3, 279, 5, 368, 24, 274, 26, 393, ! 3, 424, 5, 755, 575, 3, 420, 5, 11, 12, ! 13, 321, 519, 3, 519, 5, 517, 645, 776, 523, ! 575, 177, 575, 61, 62, 63, 286, 575, 755, 792, ! 869, 519, 35, 790, 37, 1026, 39, 837, 41, 781, ! 43, 183, 45, 755, 47, 89, 49, 269, 3, 93, ! 5, 1, 81, 519, 1, 66, 9, 1, 9, 97, ! 10, 89, 396, 66, 1, 93, 1, 5, 66, 98, ! 575, 43, 321, 3, 1, 5, 66, 1, 7, 194, ! 195, 781, 782, 412, 613, 30, 1077, 575, 337, 204, ! 817, 66, 46, 65, 3, 98, 3, 100, 5, 1, ! 215, 30, 100, 0, 46, 84, 5, 6, 7, 88, ! 100, 66, 227, 12, 13, 14, 67, 869, 3, 846, ! 5, 508, 66, 0, 66, 3, 4, 46, 66, 83, ! 83, 1122, 633, 0, 846, 935, 66, 46, 85, 89, ! 1131, 514, 3, 53, 5, 100, 675, 89, 3, 58, ! 85, 722, 89, 910, 46, 912, 59, 66, 85, 66, ! 689, 85, 200, 692, 83, 631, 3, 722, 5, 722, ! 100, 1162, 537, 66, 722, 78, 79, 80, 88, 508, ! 58, 66, 84, 405, 444, 84, 551, 27, 66, 952, ! 34, 83, 66, 67, 232, 53, 234, 235, 236, 3, ! 238, 239, 80, 58, 207, 66, 109, 1120, 1008, 83, ! 575, 66, 67, 578, 785, 118, 508, 722, 747, 606, ! 607, 608, 609, 30, 127, 474, 66, 67, 622, 66, ! 785, 66, 785, 136, 722, 1074, 1149, 785, 646, 46, ! 269, 7, 145, 246, 986, 248, 575, 250, 525, 252, ! 755, 154, 290, 256, 58, 258, 7, 30, 759, 766, ! 163, 766, 66, 523, 30, 769, 269, 755, 909, 172, ! 799, 274, 801, 46, 84, 286, 274, 315, 766, 30, ! 785, 610, 66, 286, 274, 66, 986, 987, 286, 930, ! 1048, 406, 537, 66, 67, 83, 286, 785, 3, 4, ! 88, 339, 30, 445, 73, 447, 551, 336, 3, 537, ! 89, 645, 646, 316, 606, 607, 608, 609, 53, 274, ! 3, 4, 1074, 551, 84, 25, 329, 27, 88, 367, ! 575, 286, 370, 578, 178, 338, 89, 586, 66, 67, ! 369, 344, 386, 346, 274, 973, 83, 575, 46, 84, ! 578, 88, 467, 88, 982, 53, 286, 722, 386, 732, ! 263, 66, 280, 58, 869, 3, 4, 761, 66, 537, ! 75, 66, 67, 83, 89, 80, 405, 66, 88, 286, ! 409, 869, 46, 551, 757, 3, 4, 66, 802, 53, ! 804, 701, 75, 66, 723, 66, 682, 80, 66, 67, ! 58, 286, 405, 66, 508, 9, 89, 575, 66, 67, ! 578, 776, 1139, 1140, 452, 83, 83, 261, 262, 46, ! 785, 950, 83, 461, 101, 286, 53, 88, 543, 88, ! 433, 9, 435, 444, 437, 83, 439, 75, 3, 4, ! 88, 444, 80, 547, 91, 1, 444, 3, 4, 286, ! 453, 89, 701, 89, 444, 484, 84, 75, 562, 563, ! 88, 84, 80, 7, 84, 994, 83, 840, 88, 507, ! 84, 89, 516, 83, 88, 513, 7, 722, 396, 66, ! 874, 46, 66, 5, 6, 7, 735, 85, 516, 444, ! 12, 13, 14, 58, 722, 66, 67, 76, 77, 78, ! 85, 66, 606, 607, 608, 609, 85, 84, 30, 769, ! 539, 88, 83, 542, 444, 80, 519, 84, 85, 75, ! 523, 519, 525, 46, 80, 523, 84, 525, 83, 519, ! 88, 776, 570, 523, 84, 525, 83, 444, 88, 84, ! 785, 83, 5, 6, 7, 56, 57, 537, 776, 12, ! 13, 14, 46, 976, 722, 978, 400, 785, 972, 444, ! 71, 551, 84, 9, 519, 83, 974, 764, 523, 1074, ! 525, 32, 575, 417, 418, 983, 579, 575, 581, 683, ! 583, 685, 537, 444, 83, 575, 1074, 66, 578, 519, ! 83, 268, 89, 523, 271, 525, 551, 794, 275, 71, ! 1129, 1130, 76, 77, 78, 9, 84, 444, 776, 886, ! 88, 85, 519, 531, 770, 771, 523, 785, 83, 896, ! 575, 84, 15, 578, 17, 18, 19, 20, 51, 52, ! 537, 1068, 90, 1070, 519, 553, 554, 84, 523, 973, ! 974, 88, 1036, 27, 551, 575, 30, 803, 982, 983, ! 84, 654, 537, 656, 88, 658, 84, 660, 519, 43, ! 88, 699, 523, 3, 4, 84, 551, 43, 575, 66, ! 67, 578, 5, 6, 7, 76, 77, 78, 84, 12, ! 13, 14, 519, 1048, 85, 75, 523, 58, 59, 60, ! 575, 606, 607, 578, 609, 3, 4, 30, 43, 702, ! 84, 704, 740, 706, 88, 708, 88, 710, 83, 712, ! 84, 714, 10, 716, 575, 6, 7, 755, 58, 722, ! 88, 12, 13, 14, 722, 46, 755, 645, 646, 1145, ! 3, 4, 722, 83, 1020, 75, 66, 67, 575, 30, ! 80, 1157, 84, 85, 755, 83, 423, 424, 66, 67, ! 58, 84, 755, 430, 869, 859, 953, 755, 66, 67, ! 66, 67, 46, 766, 83, 755, 769, 722, 766, 446, ! 83, 769, 80, 46, 66, 67, 766, 219, 220, 769, ! 417, 418, 785, 627, 822, 58, 776, 785, 3, 4, ! 828, 90, 722, 66, 83, 785, 952, 5, 6, 7, ! 755, 973, 974, 1048, 12, 13, 14, 80, 846, 913, ! 89, 766, 916, 857, 769, 722, 854, 846, 83, 83, ! 1048, 776, 30, 71, 853, 755, 71, 90, 856, 857, ! 785, 90, 43, 5, 6, 7, 766, 722, 85, 769, ! 12, 13, 14, 5, 6, 7, 83, 85, 755, 526, ! 12, 13, 14, 3, 4, 785, 85, 83, 869, 766, ! 75, 722, 769, 781, 782, 80, 869, 89, 30, 776, ! 755, 869, 46, 76, 77, 78, 84, 1, 785, 869, ! 1048, 766, 85, 886, 769, 722, 1042, 85, 886, 83, ! 83, 776, 895, 896, 755, 813, 886, 84, 896, 1055, ! 785, 83, 5, 6, 7, 766, 896, 90, 769, 12, ! 13, 14, 84, 207, 869, 90, 66, 946, 755, 84, ! 764, 84, 84, 27, 785, 75, 85, 1031, 88, 766, ! 80, 886, 769, 88, 88, 84, 84, 781, 782, 869, ! 83, 896, 56, 57, 58, 59, 60, 83, 785, 83, ! 794, 46, 1, 90, 71, 4, 886, 6, 7, 3, ! 83, 805, 869, 12, 13, 14, 896, 27, 89, 813, ! 30, 648, 890, 891, 85, 46, 1080, 46, 85, 28, ! 88, 30, 31, 43, 869, 6, 7, 1016, 5, 6, ! 7, 12, 13, 14, 46, 12, 13, 14, 46, 1028, ! 84, 84, 7, 84, 53, 1034, 66, 67, 869, 30, ! 84, 46, 1116, 1117, 71, 88, 693, 694, 441, 442, ! 697, 84, 316, 84, 84, 66, 75, 66, 88, 16, ! 85, 80, 869, 71, 85, 329, 46, 84, 66, 5, ! 6, 7, 1071, 1072, 338, 1074, 12, 13, 14, 17, ! 344, 66, 346, 6, 7, 973, 974, 66, 1048, 12, ! 13, 14, 84, 1074, 982, 983, 84, 84, 986, 987, ! 83, 1074, 83, 1111, 71, 83, 1074, 83, 981, 3, ! 4, 5, 6, 7, 1074, 84, 66, 1005, 88, 90, ! 84, 1120, 84, 1048, 83, 1124, 519, 9, 84, 66, ! 83, 83, 514, 35, 36, 37, 38, 84, 413, 953, ! 551, 43, 44, 45, 46, 5, 6, 7, 551, 1074, ! 1149, 1150, 12, 13, 14, 1043, 1044, 1045, 555, 973, ! 974, 400, 809, 513, 800, 933, 572, 836, 982, 983, ! 30, 1048, 986, 987, 1074, 5, 6, 7, 327, 328, ! 973, 75, 12, 13, 14, 913, 80, 444, 1078, 453, ! 916, 1005, 452, 1048, 343, 6, 7, 1074, 570, 348, ! 349, 12, 13, 14, 353, 354, 355, 356, 357, 358, ! 359, 360, 361, 362, 363, 364, 509, 820, 1128, 1074, ! 5, 6, 7, 39, 40, 41, 42, 12, 13, 14, ! 1080, 47, 48, 49, 50, 628, 629, 663, 648, 1126, ! 887, 578, 889, 1074, 578, 892, 638, 771, 641, 642, ! 897, 898, 1042, 900, 35, 36, 37, 38, 631, 765, ! 722, 1005, 43, 44, 45, 46, -1, 1074, 915, 662, ! 663, 918, 701, 920, 921, 52, 53, 54, 55, 56, ! 57, 58, 59, 60, 677, 678, 39, 40, 41, 42, ! 574, 5, 6, 7, 47, 48, 49, 50, 12, 13, ! 14, 1, 574, 735, 4, 5, 6, 7, 840, 474, ! -1, -1, 12, 13, 14, 579, 30, 581, -1, 583, ! -1, -1, -1, -1, -1, 718, -1, 27, 28, 976, ! 30, 978, 5, 6, 7, -1, -1, 486, 487, 12, ! 13, 14, -1, 43, 246, 247, 248, 249, 995, -1, ! -1, -1, 999, 53, 5, 6, 7, 30, -1, -1, ! -1, 12, 13, 14, -1, 1, 66, 67, 4, 5, ! 6, 7, -1, 766, -1, 75, 12, 13, 14, 30, ! 80, -1, -1, -1, 84, -1, -1, -1, 88, 89, ! -1, 27, 28, -1, 30, 54, 55, 56, 57, 58, ! 59, 60, 1049, 1050, -1, 1052, -1, 43, -1, -1, ! 1057, -1, 1059, -1, -1, -1, -1, 53, -1, 1066, ! 569, 53, 54, 55, 56, 57, 58, 59, 60, -1, ! 66, 67, -1, 582, 250, 251, 252, 253, -1, 75, ! -1, -1, -1, -1, 80, -1, -1, 596, 84, -1, ! -1, -1, 88, 89, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 246, 247, 248, 249, 862, ! 863, -1, -1, -1, -1, 1, -1, -1, 4, 5, ! 6, 7, -1, -1, 10, -1, 12, 13, 14, 61, ! 62, -1, -1, 65, 66, 67, 68, 250, 251, 252, ! 253, -1, 28, -1, -1, -1, -1, -1, -1, 902, ! 903, -1, 1, -1, 3, 4, -1, 6, 7, 8, ! 9, -1, 11, 12, 13, 14, -1, 53, -1, -1, ! 679, 433, 434, 435, 436, -1, -1, -1, -1, 28, ! 29, 30, 31, -1, 33, 34, 35, 36, 37, 75, ! -1, -1, -1, 42, 80, -1, -1, -1, -1, 48, ! -1, -1, 51, 89, 53, -1, -1, 56, 57, 58, ! 10, -1, 61, 62, -1, -1, -1, 66, 67, -1, ! -1, -1, 731, 72, -1, 74, 75, -1, -1, -1, ! 79, 80, -1, -1, -1, -1, -1, 86, 87, -1, ! 89, -1, 91, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, 437, 438, 439, 440, -1, -1, -1, -1, -1, ! 1, -1, -1, 4, 5, 6, 7, -1, -1, -1, ! -1, 12, 13, 14, -1, -1, -1, -1, -1, -1, ! -1, 800, 433, 434, 435, 436, 27, 28, -1, 30, ! 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, ! 59, 60, 43, -1, -1, 824, -1, -1, -1, -1, ! -1, -1, 53, -1, 437, 438, 439, 440, 837, -1, ! -1, -1, -1, -1, -1, 844, -1, -1, -1, -1, ! 849, -1, -1, -1, 75, -1, -1, -1, -1, 80, ! -1, -1, -1, 84, -1, -1, -1, 88, 89, 1, ! -1, -1, 4, 5, 6, 7, -1, -1, -1, 878, ! 12, 13, 14, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, 28, -1, 30, -1, ! -1, -1, 654, 655, -1, -1, 658, 659, -1, -1, ! 909, -1, -1, -1, -1, 914, -1, 4, 917, 6, ! 7, 53, -1, -1, -1, 12, 13, 14, -1, -1, ! -1, 930, -1, -1, 933, -1, 935, -1, -1, -1, ! -1, 28, -1, 75, -1, -1, -1, -1, 80, -1, ! 702, 703, 704, 705, -1, -1, -1, 89, 710, 711, ! 712, 713, -1, -1, -1, -1, 53, -1, -1, -1, ! -1, -1, 971, 1, -1, -1, 4, 5, 6, 7, ! -1, -1, -1, -1, 12, 13, 14, -1, 75, -1, ! 656, 657, -1, 80, 660, 661, -1, 996, -1, -1, ! 28, 1000, 30, -1, -1, -1, -1, -1, -1, 1008, ! -1, -1, 1011, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, 654, 655, 53, -1, 658, 659, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 706, 707, 708, 709, -1, -1, -1, 75, 714, 715, ! 716, 717, 80, 656, 657, -1, -1, 660, 661, -1, ! -1, 89, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 702, 703, 704, 705, -1, -1, -1, -1, 710, ! 711, 712, 713, -1, -1, 43, 44, 45, -1, 47, ! 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, 706, 707, 708, 709, -1, -1, -1, ! -1, 714, 715, 716, 717, 1, -1, 3, 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, 14, 15, ! 88, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, 53, -1, -1, ! 56, 57, 58, -1, -1, 61, 62, -1, -1, -1, ! 66, 67, -1, -1, -1, -1, 72, -1, 74, 75, ! -1, -1, -1, 79, 80, -1, -1, -1, 84, 85, ! 86, 87, -1, 89, 1, 91, 3, 4, 5, 6, ! 7, 8, 9, -1, 11, 12, 13, 14, 15, -1, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, ! 27, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, ! -1, 48, -1, -1, 51, -1, 53, -1, -1, 56, ! 57, 58, -1, -1, 61, 62, -1, -1, -1, 66, ! 67, -1, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, -1, -1, -1, 84, -1, 86, 87, -1, 89, 1, 91, 3, 4, -1, -1, -1, 8, 9, -1, 11, -1, -1, -1, 15, -1, 17, *************** static const short yycheck[] = *** 1914,2322 **** -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, -1, 67, ! 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, -1, -1, -1, 84, -1, 86, 87, ! -1, 89, 1, 91, 3, 4, -1, 6, 7, 8, ! 9, -1, 11, 12, 13, 14, 48, 49, 50, 51, ! 52, 53, 54, 55, 56, 57, 58, 59, 60, 28, ! 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, ! -1, -1, 51, -1, 53, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, -1, 67, 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, ! 79, 80, -1, -1, -1, -1, -1, 86, 87, -1, 89, 1, 91, 3, 4, -1, -1, -1, 8, 9, 45, 11, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, -1, 66, 67, 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, ! 80, -1, -1, -1, -1, 85, 86, 87, 1, 89, ! 3, 91, -1, -1, -1, 8, 9, -1, 11, 49, ! 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, ! 60, -1, -1, -1, -1, -1, 29, -1, 31, -1, ! 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, ! -1, 44, -1, -1, -1, 48, -1, -1, 51, -1, ! -1, -1, -1, 56, 57, 58, -1, -1, -1, 62, ! 63, -1, -1, 66, 67, 68, -1, -1, -1, 72, ! 1, 74, 3, -1, -1, -1, 79, 8, 9, -1, ! 11, -1, -1, 86, 87, -1, 89, -1, 91, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, -1, ! -1, 62, 63, -1, -1, -1, 67, 68, -1, -1, ! -1, 72, 1, 74, 3, -1, -1, -1, 79, 8, ! 9, -1, 11, -1, -1, 86, 87, -1, 89, -1, ! 91, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, -1, 67, 68, ! -1, -1, -1, 72, -1, 74, -1, -1, -1, -1, ! 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, 89, -1, 91, 3, 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, 14, -1, -1, -1, -1, -1, ! -1, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, 53, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, -1, -1, 67, 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, ! 80, -1, -1, -1, 84, -1, 86, 87, -1, 89, ! -1, 91, 3, 4, 5, 6, 7, 8, 9, -1, ! 11, 12, 13, 14, -1, -1, 4, 5, 6, 7, ! -1, -1, 10, -1, 12, 13, 14, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, ! 28, 42, 30, -1, -1, -1, -1, 48, -1, -1, ! 51, -1, 53, -1, -1, 56, 57, 58, -1, -1, ! -1, 62, 63, -1, -1, 53, 67, 68, -1, -1, ! -1, 72, -1, 74, 75, 3, 4, -1, 79, 80, ! 8, 9, -1, 11, -1, 86, 87, 75, -1, 90, ! 91, -1, 80, 21, 22, 23, 24, 25, 26, 27, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, ! 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, -1, 67, ! 68, -1, -1, -1, 72, -1, 74, 75, -1, -1, ! -1, 79, 80, -1, -1, -1, 84, -1, 86, 87, ! -1, 89, -1, 91, 3, 4, 5, 6, 7, 8, ! 9, -1, 11, 12, 13, 14, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 60, -1, -1, -1, 28, ! 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, ! -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, ! -1, -1, 51, -1, 53, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, -1, 67, 68, ! -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, ! 79, 80, -1, -1, -1, -1, -1, 86, 87, -1, ! 3, 4, 91, 6, 7, 8, 9, -1, 11, 12, ! 13, 14, -1, -1, 4, 5, 6, 7, -1, -1, ! -1, -1, 12, 13, 14, 28, 29, 30, 31, -1, ! 33, 34, 35, 36, 37, -1, -1, -1, 28, 42, ! 30, -1, -1, -1, -1, 48, -1, -1, 51, -1, ! 53, -1, -1, 56, 57, 58, -1, -1, -1, 62, ! 63, -1, -1, 53, 67, 68, -1, -1, -1, 72, ! -1, 74, 75, 3, -1, -1, 79, 80, 8, 9, ! -1, 11, -1, 86, 87, 75, -1, -1, 91, -1, ! 80, -1, -1, -1, 84, -1, -1, -1, -1, 29, ! -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, ! -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, ! -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, -1, -1, 67, 68, -1, ! -1, -1, 72, -1, 74, 75, 3, -1, -1, 79, ! -1, 8, 9, -1, 11, -1, 86, 87, -1, -1, ! 4, 91, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, -1, -1, -1, 28, 42, 30, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, ! 57, 58, -1, -1, -1, 62, 63, -1, -1, 53, ! 67, 68, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, ! 87, 75, -1, 90, 91, -1, 80, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, -1, 62, 63, -1, -1, -1, 67, 68, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, ! -1, -1, -1, -1, -1, -1, 86, 87, -1, 89, -1, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, ! -1, -1, -1, 56, 57, 58, -1, -1, -1, 62, ! 63, -1, -1, -1, 67, 68, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, ! -1, -1, -1, 86, 87, -1, -1, 90, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, ! 56, 57, 58, -1, -1, -1, 62, 63, -1, -1, ! -1, 67, 68, -1, 3, -1, 72, -1, 74, 8, ! 9, -1, 11, 79, -1, -1, -1, -1, 84, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, -1, -1, 62, 63, -1, -1, -1, 67, 68, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, ! -1, -1, -1, -1, 56, 57, 58, -1, -1, -1, ! 62, 63, -1, -1, -1, 67, 68, -1, 3, -1, ! 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, -1, -1, 91, ! -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, ! 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, ! -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, ! -1, 56, 57, 58, -1, -1, -1, 62, 63, -1, ! -1, -1, 67, 68, -1, 3, -1, 72, -1, 74, ! 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, ! -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, ! -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, ! -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, ! 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, -1, 62, 63, -1, -1, -1, 67, ! 68, -1, -1, -1, 72, -1, 74, -1, -1, 1, ! -1, 79, 4, 5, 6, 7, -1, -1, 86, 87, ! 12, 13, 14, 91, -1, -1, -1, -1, 1, -1, ! -1, 4, 5, 6, 7, 27, 28, -1, 30, 12, ! 13, 14, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 44, -1, 27, 28, -1, 30, -1, -1, ! -1, 53, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 44, -1, -1, -1, 67, 68, -1, -1, -1, ! 53, -1, -1, 75, -1, -1, -1, -1, 80, -1, ! -1, -1, 84, -1, -1, -1, 88, 89, -1, -1, ! -1, -1, 75, -1, -1, -1, -1, 80, -1, -1, ! -1, 84, -1, -1, 1, 88, 89, 4, 5, 6, ! 7, -1, -1, -1, -1, 12, 13, 14, -1, -1, ! -1, -1, -1, 1, -1, -1, 4, 5, 6, 7, ! -1, 28, -1, 30, 12, 13, 14, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 28, -1, -1, -1, -1, -1, 53, 1, -1, -1, 4, -1, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, -1, -1, -1, 53, -1, -1, 75, -1, ! -1, -1, -1, 80, 28, -1, 30, -1, -1, -1, ! -1, -1, 89, -1, -1, -1, -1, 75, -1, -1, ! -1, -1, 80, -1, 3, 4, -1, 6, 7, 53, ! -1, 89, 11, 12, 13, 14, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, 75, 76, 77, 78, -1, 80, -1, -1, 1, ! 84, 85, 4, -1, 6, 7, -1, 46, -1, -1, ! 12, 13, 14, -1, -1, -1, -1, -1, 1, -1, ! -1, 4, -1, 6, 7, -1, 28, -1, 30, 12, ! 13, 14, -1, -1, -1, -1, 75, -1, -1, -1, ! -1, 80, -1, -1, -1, 28, -1, 30, 31, 88, ! -1, 53, 1, -1, 3, 4, 5, 6, 7, -1, ! -1, 10, -1, 12, 13, 14, -1, -1, -1, -1, ! 53, -1, -1, 75, 76, 77, 78, -1, 80, 28, ! -1, -1, 84, 85, -1, -1, -1, -1, -1, -1, ! -1, -1, 75, -1, -1, -1, -1, 80, -1, -1, ! -1, 84, 85, 1, 53, 3, 4, 5, 6, 7, -1, -1, -1, -1, 12, 13, 14, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 75, -1, -1, 27, ! 28, 80, 30, 31, 83, 1, -1, 3, 4, 5, ! 6, 7, -1, -1, -1, -1, 12, 13, 14, -1, ! -1, -1, -1, -1, -1, 53, -1, -1, 56, 57, ! 58, -1, 28, -1, 30, -1, -1, -1, -1, 67, ! -1, 69, 70, 71, -1, -1, -1, 75, -1, -1, ! -1, 79, 80, 81, 82, -1, 84, 53, -1, -1, ! 56, 57, 58, 1, -1, 3, 4, 5, 6, 7, ! -1, 67, -1, -1, 12, 13, 14, -1, -1, 75, ! -1, -1, -1, -1, 80, -1, -1, -1, 84, -1, ! 28, 1, 30, -1, 4, 5, 6, 7, -1, -1, ! 10, -1, 12, 13, 14, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 53, -1, -1, 28, -1, ! 58, -1, -1, 4, 5, 6, 7, -1, -1, 67, ! -1, 12, 13, 14, -1, -1, -1, 75, -1, -1, ! -1, -1, 80, 53, -1, -1, 84, 28, -1, 30, -1, 4, 5, 6, 7, -1, -1, -1, -1, 12, ! 13, 14, -1, -1, -1, 75, -1, -1, -1, -1, ! 80, -1, 53, 83, -1, 28, -1, 4, 5, 6, ! 7, -1, -1, -1, -1, 12, 13, 14, 4, 5, ! 6, 7, -1, -1, 75, -1, 12, 13, 14, 80, ! 53, 28, -1, 84, -1, -1, -1, -1, -1, -1, ! -1, -1, 28, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 75, -1, -1, -1, 53, 80, -1, -1, ! -1, 84, -1, 1, -1, -1, 4, 53, 6, 7, ! -1, -1, -1, -1, 12, 13, 14, -1, 75, -1, ! -1, -1, -1, 80, -1, -1, -1, 84, -1, 75, ! 28, -1, 30, 31, 80, -1, -1, -1, 84, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 3, 4, ! -1, 6, 7, -1, -1, 53, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, -1, -1, 75, -1, -1, ! -1, -1, 80, -1, 3, 4, -1, 6, 7, -1, ! -1, 46, 11, 12, 13, 14, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, -1, 67, -1, -1, -1, -1, -1, -1, -1, ! 75, -1, -1, -1, -1, 80, -1, 46, 3, 4, ! -1, 6, 7, -1, -1, -1, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, -1, 75, -1, -1, -1, ! -1, 80, -1, -1, 3, 4, -1, 6, 7, -1, ! -1, 46, 11, 12, 13, 14, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, -1, -1, 4, 5, 6, 7, -1, -1, 10, ! 75, 12, 13, 14, -1, 80, -1, 46, -1, -1, ! -1, 4, 5, 6, 7, -1, -1, 28, -1, 12, ! 13, 14, 4, 5, 6, 7, -1, -1, -1, -1, ! 12, 13, 14, -1, -1, 28, 75, 30, -1, -1, ! -1, 80, 53, -1, -1, -1, 28, -1, 30, -1, ! -1, -1, -1, 4, 5, 6, 7, -1, -1, -1, ! 53, 12, 13, 14, 75, 4, 5, 6, 7, 80, ! -1, 53, -1, 12, 13, 14, -1, 28, -1, 30, ! -1, -1, 75, -1, -1, -1, -1, 80, -1, 28, ! -1, 30, -1, 75, -1, -1, -1, -1, 80, -1, ! -1, -1, 53, -1, -1, -1, -1, 4, 5, 6, ! 7, -1, -1, -1, 53, 12, 13, 14, 4, -1, ! 6, 7, -1, -1, 75, -1, 12, 13, 14, 80, ! -1, 28, -1, 30, -1, -1, 75, 4, 5, 6, ! 7, 80, 28, -1, 30, 12, 13, 14, -1, 4, ! 5, 6, 7, -1, -1, -1, 53, 12, 13, 14, ! -1, 28, -1, -1, -1, -1, -1, 53, -1, -1, ! -1, -1, 4, 28, 6, 7, -1, -1, 75, -1, ! 12, 13, 14, 80, -1, -1, 53, -1, -1, 75, ! -1, -1, -1, -1, 80, -1, 28, -1, 53, -1, ! -1, -1, 4, 5, 6, 7, -1, -1, 75, -1, ! 12, 13, 14, 80, 4, 5, 6, 7, -1, -1, ! 75, 53, 12, 13, 14, 80, 28, -1, -1, -1, ! -1, 4, 5, 6, 7, -1, -1, -1, 28, 12, ! 13, 14, -1, 75, 4, -1, 6, 7, 80, -1, ! -1, 53, 12, 13, 14, 28, -1, -1, -1, -1, ! -1, -1, -1, 53, -1, -1, -1, -1, 28, -1, ! -1, -1, -1, 75, -1, -1, -1, -1, 80, -1, ! 53, -1, -1, -1, -1, 75, -1, -1, -1, -1, 80, -1, -1, 53, -1, -1, -1, -1, -1, -1, ! -1, -1, 75, -1, -1, -1, -1, 80, -1, -1, ! -1, -1, -1, -1, -1, 75, -1, 43, 44, 45, 80, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, -1, -1, -1, -1, -1, -1, 43, ! 44, 45, 88, 47, 48, 49, 50, 51, 52, 53, ! 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, ! 88, -1, -1, 30, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 43, 44, 45, 83, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, ! 57, 58, 59, 60, 43, 44, 45, 46, 47, 48, ! 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, ! 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60 }; - /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ - #line 3 "/usr/share/bison/bison.simple" - - /* Skeleton output parser for bison, - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software - Foundation, Inc. - - This program 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 2, or (at your option) - any later version. - - This program 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 this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - - /* As a special exception, when this file is copied by Bison into a - Bison output file, you may use that output file without restriction. - This special exception was added by the Free Software Foundation - in version 1.24 of Bison. */ - - /* This is the parser code that is written into each bison parser when - the %semantic_parser declaration is not specified in the grammar. - It was written by Richard Stallman by simplifying the hairy parser - used when %semantic_parser is specified. */ - - /* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - - #ifdef __cplusplus - # define YYSTD(x) std::x - #else - # define YYSTD(x) x - #endif - - #ifndef YYPARSE_RETURN_TYPE - #define YYPARSE_RETURN_TYPE int - #endif - - #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) - - /* The parser invokes alloca or malloc; define the necessary symbols. */ - - # if YYSTACK_USE_ALLOCA - # define YYSTACK_ALLOC alloca - # else - # ifndef YYSTACK_USE_ALLOCA - # if defined (alloca) || defined (_ALLOCA_H) - # define YYSTACK_ALLOC alloca - # else - # ifdef __GNUC__ - # define YYSTACK_ALLOC __builtin_alloca - # endif - # endif - # endif - # endif ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 2190,2600 ---- -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, ! 58, -1, -1, 61, 62, -1, -1, -1, 66, 67, ! -1, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, -1, -1, -1, 84, -1, 86, 87, ! -1, 89, 1, 91, 3, 4, -1, -1, -1, 8, ! 9, -1, 11, -1, -1, -1, 15, -1, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, -1, ! 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, ! -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, -1, 61, 62, -1, -1, -1, 66, 67, -1, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, ! 79, 80, -1, -1, -1, 84, -1, 86, 87, -1, 89, 1, 91, 3, 4, -1, -1, -1, 8, 9, 45, 11, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, 61, 62, -1, -1, 65, 66, 67, -1, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, ! 80, -1, -1, -1, -1, 85, 86, 87, -1, 89, ! 1, 91, 3, 4, -1, -1, -1, 8, 9, -1, ! 11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, -1, ! 61, 62, -1, -1, 65, 66, 67, -1, -1, -1, ! -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, ! -1, -1, -1, -1, 85, 86, 87, 1, 89, 3, ! 91, -1, -1, -1, 8, 9, -1, 11, -1, -1, ! 4, 5, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, -1, -1, -1, 29, -1, 31, -1, 33, ! 34, 35, 36, 37, 28, -1, 30, -1, 42, 43, ! -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, 53, ! -1, 65, 66, 67, 1, -1, 3, -1, 72, -1, ! 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, ! -1, 75, 86, 87, -1, 89, 80, 91, -1, -1, ! 84, -1, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, ! -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, ! 57, 58, -1, -1, 61, 62, -1, -1, -1, 66, ! 67, 1, -1, 3, -1, 72, -1, 74, 8, 9, ! -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, ! 87, -1, 89, -1, 91, -1, -1, -1, -1, 29, ! -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, ! -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, ! -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, 61, 62, -1, -1, -1, 66, 67, -1, -1, ! -1, -1, 72, -1, 74, -1, -1, -1, -1, 79, ! -1, -1, -1, -1, -1, -1, 86, 87, -1, 89, ! -1, 91, 3, 4, 5, 6, 7, 8, 9, -1, ! 11, 12, 13, 14, -1, -1, -1, -1, -1, -1, ! 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, ! 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, ! -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, ! 51, -1, 53, -1, -1, 56, 57, 58, -1, -1, ! 61, 62, -1, -1, -1, 66, 67, -1, -1, -1, ! -1, 72, -1, 74, 75, -1, -1, -1, 79, 80, ! -1, -1, -1, 84, -1, 86, 87, -1, 89, -1, ! 91, 3, 4, 5, 6, 7, 8, 9, -1, 11, ! 12, 13, 14, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, 28, 29, 30, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, ! 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, ! -1, 53, -1, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, -1, 66, 67, -1, -1, -1, -1, ! 72, -1, 74, 75, 3, 4, -1, 79, 80, 8, ! 9, -1, 11, -1, 86, 87, -1, -1, 90, 91, ! -1, -1, 21, 22, 23, 24, 25, 26, 27, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, -1, 61, 62, -1, -1, -1, 66, 67, -1, ! -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, ! 79, 80, -1, -1, -1, 84, -1, 86, 87, -1, 89, -1, 91, 3, 4, 5, 6, 7, 8, 9, -1, 11, 12, 13, 14, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 28, 29, 30, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, 53, -1, -1, 56, 57, 58, -1, ! -1, 61, 62, -1, -1, -1, 66, 67, -1, -1, -1, -1, 72, -1, 74, 75, -1, -1, -1, 79, ! 80, -1, -1, -1, -1, -1, 86, 87, -1, 3, ! 4, 91, 6, 7, 8, 9, -1, 11, 12, 13, ! 14, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 28, 29, 30, 31, -1, 33, ! 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, ! -1, -1, -1, -1, 48, -1, -1, 51, -1, 53, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, -1, ! -1, -1, 66, 67, -1, -1, -1, -1, 72, -1, ! 74, 75, 3, -1, 5, 79, 80, 8, 9, -1, ! 11, -1, 86, 87, -1, -1, -1, 91, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, ! -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, ! 51, -1, -1, -1, -1, 56, 57, 58, -1, -1, ! 61, 62, -1, -1, -1, 66, 67, -1, -1, 3, ! -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, ! -1, -1, -1, -1, -1, 86, 87, -1, -1, 90, ! 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, ! 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, ! -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, -1, ! -1, -1, 66, 67, -1, -1, -1, -1, 72, -1, ! 74, 75, 3, -1, -1, 79, -1, 8, 9, -1, ! 11, -1, 86, 87, -1, -1, -1, 91, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 29, -1, ! 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, ! -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, ! 51, -1, -1, -1, -1, 56, 57, 58, -1, -1, ! 61, 62, -1, -1, -1, 66, 67, -1, -1, 3, ! -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, ! -1, -1, -1, -1, -1, 86, 87, -1, -1, 90, ! 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, ! 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, ! -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, ! -1, -1, 56, 57, 58, -1, -1, 61, 62, -1, ! -1, -1, 66, 67, -1, -1, 3, -1, 72, -1, ! 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, ! -1, -1, 86, 87, -1, 89, -1, 91, -1, -1, ! -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, ! 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, ! 57, 58, -1, -1, 61, 62, -1, -1, -1, 66, ! 67, -1, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, ! 87, -1, -1, 90, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, -1, ! -1, 61, 62, -1, -1, -1, 66, 67, -1, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, ! -1, -1, -1, -1, 84, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, ! -1, -1, -1, 56, 57, 58, -1, -1, 61, 62, ! -1, -1, -1, 66, 67, -1, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, ! -1, -1, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, ! 56, 57, 58, -1, -1, 61, 62, -1, -1, -1, ! 66, 67, -1, -1, 3, -1, 72, -1, 74, 8, ! 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, -1, 33, 34, 35, 36, 37, -1, -1, -1, -1, 42, -1, -1, -1, -1, -1, 48, -1, -1, 51, -1, -1, -1, -1, 56, 57, 58, ! -1, -1, 61, 62, -1, -1, -1, 66, 67, -1, -1, 3, -1, 72, -1, 74, 8, 9, -1, 11, 79, -1, -1, -1, -1, -1, -1, 86, 87, -1, -1, -1, 91, -1, -1, -1, -1, 29, -1, 31, ! -1, 33, 34, 35, 36, 37, -1, -1, -1, 1, ! 42, -1, 4, 5, 6, 7, 48, -1, -1, 51, ! 12, 13, 14, -1, 56, 57, 58, -1, -1, 61, ! 62, -1, -1, -1, 66, 67, 28, -1, -1, -1, ! 72, -1, 74, -1, -1, -1, -1, 79, -1, 30, -1, -1, -1, -1, 86, 87, -1, -1, -1, 91, ! -1, 53, 43, 44, 45, -1, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! -1, -1, -1, 75, -1, -1, -1, -1, 80, -1, ! 3, 4, -1, 6, 7, -1, -1, 89, 11, 12, ! 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, ! 23, 24, 25, 26, 27, 28, 29, 1, -1, -1, 4, -1, 6, 7, -1, -1, -1, -1, 12, 13, ! 14, -1, -1, 46, -1, -1, 1, -1, -1, 4, ! -1, 6, 7, -1, 28, -1, 30, 12, 13, 14, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 75, 28, -1, 30, -1, 80, -1, 53, ! -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, 53, -1, ! -1, 75, 76, 77, 78, -1, 80, -1, -1, -1, ! 84, 85, -1, -1, -1, -1, -1, -1, -1, -1, ! 75, 76, 77, 78, -1, 80, -1, -1, 1, 84, ! 85, 4, -1, 6, 7, -1, -1, -1, -1, 12, ! 13, 14, -1, -1, -1, -1, -1, -1, 1, -1, ! 3, 4, 5, 6, 7, 28, -1, 30, 31, 12, ! 13, 14, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 27, 28, -1, 30, 31, -1, ! 53, 1, -1, 3, 4, 5, 6, 7, -1, -1, ! -1, -1, 12, 13, 14, -1, -1, -1, -1, -1, ! 53, -1, 75, 56, 57, 58, -1, 80, 28, -1, ! 30, 84, 85, 66, -1, -1, 69, 70, 71, -1, ! -1, -1, 75, -1, -1, -1, 79, 80, 81, 82, ! -1, 84, -1, 53, -1, -1, 56, 57, 58, 1, ! -1, 3, 4, 5, 6, 7, 66, -1, -1, -1, ! 12, 13, 14, -1, -1, 75, -1, -1, -1, -1, ! 80, -1, -1, -1, 84, -1, 28, 1, 30, 3, ! 4, 5, 6, 7, -1, -1, 10, -1, 12, 13, ! 14, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 53, -1, -1, 28, -1, 58, -1, -1, -1, ! -1, -1, -1, 1, 66, -1, 4, 5, 6, 7, ! -1, -1, 10, 75, 12, 13, 14, -1, 80, 53, ! -1, -1, 84, -1, 4, 5, 6, 7, -1, -1, ! 28, -1, 12, 13, 14, 4, 5, 6, 7, -1, ! -1, 75, -1, 12, 13, 14, 80, -1, 28, 83, ! 30, -1, -1, -1, -1, 53, -1, -1, -1, 28, ! -1, 30, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, 53, -1, -1, -1, 75, -1, -1, ! -1, -1, 80, -1, 53, 83, -1, -1, 4, 5, ! 6, 7, -1, -1, -1, 75, 12, 13, 14, -1, ! 80, -1, -1, -1, 84, -1, 75, -1, -1, -1, ! -1, 80, 28, -1, 30, 84, 4, 5, 6, 7, -1, -1, -1, -1, 12, 13, 14, -1, -1, -1, ! -1, -1, -1, 4, 5, 6, 7, 53, -1, -1, ! 28, 12, 13, 14, -1, 4, 5, 6, 7, -1, ! -1, -1, -1, 12, 13, 14, -1, 28, -1, 75, ! -1, -1, -1, -1, 80, 53, -1, -1, 84, 28, -1, 4, 5, 6, 7, -1, -1, -1, -1, 12, ! 13, 14, 53, -1, -1, -1, -1, 75, -1, -1, ! -1, -1, 80, -1, 53, 28, 84, -1, -1, -1, ! -1, -1, -1, -1, 75, -1, -1, -1, -1, 80, ! -1, -1, -1, 84, -1, -1, 75, -1, -1, -1, ! 53, 80, 43, 44, 45, 84, 47, 48, 49, 50, ! 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, ! -1, -1, 75, -1, -1, 3, 4, 80, 6, 7, ! -1, 84, -1, 11, 12, 13, 14, 15, 16, 17, ! 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, ! 28, 29, -1, -1, -1, -1, -1, -1, -1, -1, ! -1, 3, 4, -1, 6, 7, -1, -1, 46, 11, ! 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 28, 29, 66, -1, ! -1, -1, -1, -1, -1, -1, -1, 75, -1, -1, ! -1, -1, 80, -1, 46, 3, 4, -1, 6, 7, ! -1, -1, -1, 11, 12, 13, 14, 15, 16, 17, ! 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, ! 28, 29, -1, 75, -1, -1, -1, -1, 80, -1, ! -1, 3, 4, -1, 6, 7, -1, -1, 46, 11, ! 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 28, 29, -1, -1, ! 4, 5, 6, 7, -1, -1, 10, 75, 12, 13, ! 14, -1, 80, -1, 46, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, 28, -1, 30, -1, 4, 5, ! 6, 7, -1, -1, 10, -1, 12, 13, 14, -1, ! -1, -1, -1, 75, -1, -1, -1, -1, 80, 53, ! -1, -1, 28, -1, 4, 5, 6, 7, 4, 5, ! 6, 7, 12, 13, 14, -1, 12, 13, 14, -1, ! -1, 75, -1, -1, -1, -1, 80, 53, 28, -1, ! 30, -1, 28, -1, 30, -1, 4, 5, 6, 7, ! -1, -1, -1, -1, 12, 13, 14, -1, -1, 75, ! -1, -1, -1, 53, 80, -1, -1, 53, -1, -1, ! 28, -1, 30, -1, 4, 5, 6, 7, 4, 5, ! 6, 7, 12, 13, 14, 75, 12, 13, 14, 75, ! 80, -1, -1, -1, 80, 53, -1, -1, 28, -1, ! 30, -1, 28, -1, 30, -1, 4, -1, 6, 7, ! 4, -1, 6, 7, 12, 13, 14, 75, 12, 13, ! 14, -1, 80, 53, -1, -1, -1, 53, -1, -1, ! 28, -1, 30, -1, 28, -1, 30, -1, 4, -1, ! 6, 7, -1, -1, -1, 75, 12, 13, 14, 75, ! 80, -1, -1, -1, 80, 53, -1, -1, -1, 53, ! -1, -1, 28, -1, 30, -1, 4, 5, 6, 7, ! 4, 5, 6, 7, 12, 13, 14, 75, 12, 13, ! 14, 75, 80, -1, -1, -1, 80, 53, -1, -1, ! 28, -1, -1, -1, 28, -1, 4, 5, 6, 7, ! -1, -1, -1, -1, 12, 13, 14, -1, -1, 75, ! -1, -1, -1, -1, 80, 53, -1, -1, -1, 53, ! 28, -1, -1, -1, 4, 5, 6, 7, -1, -1, ! -1, -1, 12, 13, 14, -1, -1, 75, -1, -1, ! -1, 75, 80, -1, -1, 53, 80, -1, 28, -1, ! 4, 5, 6, 7, 4, -1, 6, 7, 12, 13, ! 14, -1, 12, 13, 14, -1, -1, 75, -1, -1, ! -1, -1, 80, 53, 28, 43, 44, 45, 28, 47, ! 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, -1, -1, 75, -1, -1, -1, 53, 80, -1, -1, 53, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ! 88, 75, -1, -1, -1, 75, 80, 43, 44, 45, 80, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 43, 44, 45, -1, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, ! 58, 59, 60, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, 88, -1, -1, -1, -1, -1, -1, -1, ! -1, -1, -1, -1, -1, 83, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, ! 57, 58, 59, 60 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned short yystos[] = { ! 0, 93, 94, 95, 0, 96, 1, 4, 5, 6, ! 7, 12, 13, 14, 27, 28, 30, 31, 53, 56, ! 57, 69, 70, 71, 75, 79, 80, 81, 82, 84, ! 97, 98, 99, 114, 131, 134, 135, 136, 137, 138, ! 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, ! 149, 150, 151, 157, 159, 160, 161, 162, 163, 172, ! 173, 199, 200, 201, 202, 207, 292, 293, 295, 296, ! 297, 307, 310, 317, 318, 97, 84, 85, 172, 172, ! 172, 66, 66, 3, 4, 75, 80, 106, 294, 106, ! 106, 309, 310, 106, 294, 309, 294, 106, 66, 3, ! 58, 66, 165, 169, 198, 5, 7, 159, 160, 172, ! 5, 7, 159, 160, 5, 7, 159, 160, 172, 5, ! 7, 159, 160, 5, 7, 161, 162, 172, 5, 7, ! 161, 162, 5, 7, 161, 162, 172, 5, 7, 161, ! 162, 5, 7, 159, 160, 172, 5, 7, 159, 160, ! 5, 7, 159, 160, 172, 5, 7, 159, 160, 5, ! 7, 161, 162, 172, 5, 7, 161, 162, 5, 7, ! 161, 162, 172, 5, 7, 161, 162, 131, 131, 84, ! 173, 89, 106, 89, 106, 89, 106, 97, 319, 3, ! 8, 9, 11, 29, 33, 34, 35, 36, 37, 42, ! 48, 51, 56, 57, 58, 61, 62, 66, 67, 72, ! 74, 79, 86, 87, 91, 107, 108, 110, 111, 112, ! 113, 115, 116, 122, 124, 125, 246, 292, 349, 355, ! 356, 357, 66, 53, 88, 46, 66, 309, 46, 66, ! 89, 309, 84, 84, 106, 108, 134, 135, 136, 137, ! 138, 139, 140, 141, 156, 219, 134, 135, 136, 137, ! 155, 158, 171, 172, 84, 88, 1, 27, 66, 67, ! 104, 166, 227, 4, 58, 66, 80, 164, 167, 193, ! 194, 198, 165, 198, 73, 210, 211, 89, 210, 89, ! 206, 89, 3, 4, 6, 7, 11, 12, 13, 14, ! 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, ! 25, 26, 27, 28, 29, 46, 66, 75, 80, 330, ! 339, 340, 341, 342, 343, 115, 115, 66, 66, 66, ! 106, 115, 1, 89, 108, 219, 350, 66, 66, 66, ! 9, 115, 83, 88, 66, 111, 66, 111, 43, 44, ! 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, ! 56, 57, 58, 59, 60, 61, 62, 65, 66, 67, ! 68, 9, 91, 1, 85, 235, 244, 115, 5, 6, ! 7, 106, 174, 175, 176, 106, 106, 106, 89, 300, ! 106, 106, 304, 308, 84, 83, 220, 83, 198, 198, ! 132, 171, 66, 171, 287, 5, 58, 90, 108, 156, ! 1, 126, 127, 128, 234, 253, 171, 158, 171, 84, ! 88, 1, 100, 166, 66, 227, 84, 1, 102, 66, ! 85, 1, 84, 134, 135, 136, 137, 138, 139, 140, ! 141, 154, 155, 212, 292, 203, 85, 204, 1, 106, ! 217, 218, 205, 66, 106, 219, 320, 88, 337, 341, ! 343, 46, 116, 116, 219, 83, 83, 83, 75, 108, ! 348, 46, 341, 352, 353, 354, 219, 106, 84, 116, ! 219, 219, 116, 116, 119, 121, 118, 117, 116, 116, ! 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, ! 106, 109, 110, 108, 106, 9, 83, 32, 239, 240, ! 241, 83, 83, 88, 66, 309, 83, 298, 322, 323, ! 89, 83, 311, 313, 322, 58, 66, 221, 223, 224, ! 225, 226, 227, 83, 169, 198, 124, 288, 108, 156, ! 90, 90, 5, 58, 90, 108, 84, 105, 234, 10, ! 127, 254, 43, 194, 194, 132, 126, 171, 287, 126, ! 75, 171, 131, 131, 84, 212, 210, 171, 210, 43, ! 88, 209, 217, 219, 83, 84, 331, 10, 338, 66, ! 106, 88, 88, 88, 89, 115, 351, 46, 83, 341, ! 354, 83, 83, 83, 83, 108, 46, 116, 116, 83, ! 90, 106, 291, 1, 130, 228, 229, 230, 231, 232, ! 233, 234, 245, 253, 257, 258, 241, 83, 175, 3, ! 109, 89, 303, 309, 311, 71, 98, 131, 150, 151, ! 317, 324, 327, 305, 76, 77, 78, 85, 312, 1, ! 84, 154, 155, 314, 71, 158, 171, 277, 66, 227, ! 83, 1, 3, 10, 134, 135, 138, 139, 142, 143, ! 146, 147, 152, 153, 279, 282, 283, 285, 289, 290, ! 90, 108, 108, 90, 90, 253, 129, 152, 153, 170, ! 83, 167, 193, 101, 43, 103, 83, 213, 215, 253, ! 214, 216, 253, 85, 85, 116, 218, 85, 209, 83, ! 339, 340, 134, 135, 136, 137, 138, 139, 140, 141, ! 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, ! 234, 332, 333, 334, 321, 282, 283, 219, 219, 116, ! 219, 123, 46, 341, 344, 345, 347, 46, 116, 84, ! 88, 130, 257, 258, 130, 257, 258, 253, 257, 258, ! 130, 257, 258, 234, 85, 254, 83, 88, 83, 301, ! 322, 306, 85, 131, 131, 328, 325, 327, 311, 313, ! 131, 131, 84, 224, 225, 223, 278, 171, 277, 83, ! 131, 286, 286, 83, 84, 88, 83, 88, 90, 90, ! 254, 84, 131, 84, 131, 1, 89, 116, 177, 253, ! 168, 253, 88, 254, 88, 254, 171, 171, 171, 85, ! 106, 337, 84, 131, 84, 334, 234, 1, 89, 242, ! 243, 247, 83, 83, 88, 83, 1, 3, 65, 89, ! 106, 116, 179, 180, 181, 183, 185, 186, 110, 346, ! 46, 90, 341, 347, 120, 106, 254, 236, 4, 21, ! 22, 23, 24, 25, 26, 27, 75, 80, 84, 106, ! 108, 133, 150, 151, 157, 237, 247, 269, 270, 292, ! 110, 311, 71, 322, 299, 330, 98, 85, 46, 193, ! 315, 316, 315, 83, 279, 4, 58, 66, 80, 195, ! 196, 197, 198, 222, 223, 224, 58, 66, 198, 222, ! 280, 10, 150, 151, 284, 3, 242, 164, 165, 178, ! 254, 177, 254, 132, 46, 193, 132, 46, 198, 171, ! 195, 198, 222, 335, 336, 247, 244, 106, 116, 106, ! 184, 46, 85, 88, 208, 43, 186, 183, 346, 116, ! 116, 46, 84, 84, 84, 108, 58, 106, 7, 271, ! 253, 84, 131, 131, 84, 15, 17, 18, 19, 20, ! 248, 249, 251, 259, 133, 83, 85, 71, 322, 329, ! 116, 46, 88, 158, 171, 171, 66, 227, 66, 227, ! 171, 172, 158, 171, 171, 171, 131, 131, 84, 84, ! 179, 242, 242, 215, 253, 116, 46, 171, 216, 116, ! 46, 171, 171, 171, 84, 88, 83, 179, 182, 181, ! 183, 10, 46, 84, 108, 84, 66, 254, 164, 187, ! 193, 165, 190, 198, 250, 261, 252, 263, 66, 16, ! 1, 237, 256, 1, 66, 238, 302, 71, 1, 84, ! 326, 116, 132, 196, 197, 197, 287, 287, 281, 195, ! 198, 222, 198, 222, 85, 254, 171, 116, 171, 116, ! 336, 85, 183, 116, 84, 108, 46, 84, 188, 84, ! 191, 66, 66, 256, 66, 108, 1, 260, 255, 257, ! 258, 108, 322, 316, 83, 279, 171, 171, 171, 171, ! 171, 46, 46, 83, 171, 126, 126, 108, 108, 17, ! 108, 133, 268, 272, 83, 256, 238, 255, 83, 71, ! 9, 67, 273, 274, 275, 84, 189, 192, 83, 83, ! 264, 84, 267, 84, 66, 106, 46, 83, 88, 253, ! 253, 262, 272, 256, 108, 90, 273, 84, 275, 254, ! 254, 256, 84, 83, 9, 46, 83, 247, 247, 265, ! 66, 124, 276, 84, 272, 108, 83, 88, 83, 83, ! 84, 124, 266, 256 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 2324,2337 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 2602,2610 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 2340,2368 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 2613,2646 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 2370,2421 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 2648,2678 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (YYLEX_PARAM) ! #else ! # define YYLEX yylex () ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 2423,2437 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 2680,2772 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 2451,2485 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ - - /* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ - static void - # if defined (__STDC__) || defined (__cplusplus) - yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) - # else - yymemcpy (yyto, yyfrom, yycount) - char *yyto; - const char *yyfrom; - YYSIZE_T yycount; - # endif - { - register const char *yyf = yyfrom; - register char *yyt = yyto; - register YYSIZE_T yyi = yycount; ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 2786,2795 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 2529,2614 **** } # endif # endif ! #endif - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif - /* YY_DECL_VARIABLES -- depending whether we use a pure parser, - variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ int yynerrs; - #if YYLSP_NEEDED - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES \ - \ - /* Location data for the lookahead symbol. */ \ - YYLTYPE yylloc; - #else - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES - #endif ! /* If nonreentrant, generate the variables here. */ ! #if !YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 2839,2972 ---- } # endif # endif ! ! #endif /* !YYERROR_VERBOSE */ ! + #if YYDEBUG + /*--------------------------------. + | Print this symbol on YYOUTPUT. | + `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); ! # endif ! } ! else ! YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); ! switch (yytype) ! { ! default: ! break; ! } ! YYFPRINTF (yyoutput, ")"); ! } ! ! #endif /* ! YYDEBUG */ ! /*-----------------------------------------------. ! | Release the memory associated to this symbol. | ! `-----------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yydestruct (int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yydestruct (yytype, yyvaluep) ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! switch (yytype) ! { ! ! default: ! break; ! } ! } ! ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); # else ! int yyparse (); # endif + #else /* ! YYPARSE_PARAM */ + #if defined (__STDC__) || defined (__cplusplus) + int yyparse (void); + #else + int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ int yynerrs; ! /*----------. ! | yyparse. | ! `----------*/ ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! #endif ! #endif { ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 2618,2624 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 2976,2982 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 2628,2658 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 2986,3004 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 2669,2677 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 3015,3021 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 2686,2692 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 3030,3036 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 2699,2731 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 3043,3071 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 2734,2760 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 3074,3097 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 2762,2768 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 3099,3104 ---- *************** yybackup: *** 2775,2862 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 3111,3165 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 2887,3329 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { ! int yyi; ! ! YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", ! yyn, yyrline[yyn]); ! ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) ! YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); ! YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); ! } ! #endif ! ! switch (yyn) { ! ! case 1: #line 308 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids an empty source file"); finish_file (); ! ; ! break;} ! case 2: #line 313 "objc-parse.y" ! { /* In case there were missing closebraces, get us back to the global binding level. */ while (! global_bindings_p ()) poplevel (0, 0, 0); finish_file (); ! ; ! break;} ! case 3: #line 327 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ; ! break;} ! case 5: #line 328 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ggc_collect(); ; ! break;} ! case 10: #line 336 "objc-parse.y" ! { STRIP_NOPS (yyvsp[-2].ttype); if ((TREE_CODE (yyvsp[-2].ttype) == ADDR_EXPR && TREE_CODE (TREE_OPERAND (yyvsp[-2].ttype, 0)) == STRING_CST) || TREE_CODE (yyvsp[-2].ttype) == STRING_CST) assemble_asm (yyvsp[-2].ttype); else ! error ("argument of `asm' is not a constant string"); ; ! break;} ! case 11: #line 344 "objc-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 12: #line 349 "objc-parse.y" ! { if (pedantic) error ("ISO C forbids data definition with no type or storage class"); else if (!flag_traditional) warning ("data definition has no type or storage class"); ! POP_DECLSPEC_STACK; ; ! break;} ! case 13: #line 356 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 14: #line 358 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 15: #line 360 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ; ! break;} ! case 18: #line 364 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C does not allow extra `;' outside of a function"); ; ! break;} ! case 19: #line 370 "objc-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 20: #line 375 "objc-parse.y" ! { store_parm_decls (); ; ! break;} ! case 21: #line 377 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 22: #line 382 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 23: #line 384 "objc-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 24: #line 389 "objc-parse.y" ! { store_parm_decls (); ; ! break;} ! case 25: #line 391 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 26: #line 396 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 27: #line 398 "objc-parse.y" ! { if (! start_function (NULL_TREE, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ; ! break;} ! case 28: #line 403 "objc-parse.y" ! { store_parm_decls (); ; ! break;} ! case 29: #line 405 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ; ! break;} ! case 30: #line 410 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 35: #line 421 "objc-parse.y" ! { yyval.code = ADDR_EXPR; ; ! break;} ! case 36: #line 423 "objc-parse.y" ! { yyval.code = NEGATE_EXPR; ; ! break;} ! case 37: #line 425 "objc-parse.y" ! { yyval.code = CONVERT_EXPR; ! ; ! break;} ! case 38: #line 428 "objc-parse.y" ! { yyval.code = PREINCREMENT_EXPR; ; ! break;} ! case 39: #line 430 "objc-parse.y" ! { yyval.code = PREDECREMENT_EXPR; ; ! break;} ! case 40: #line 432 "objc-parse.y" ! { yyval.code = BIT_NOT_EXPR; ; ! break;} ! case 41: #line 434 "objc-parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ; ! break;} ! case 42: #line 438 "objc-parse.y" ! { yyval.ttype = build_compound_expr (yyvsp[0].ttype); ; ! break;} ! case 43: #line 443 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 45: #line 449 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 46: #line 451 "objc-parse.y" ! { chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 48: #line 457 "objc-parse.y" ! { yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ; ! break;} ! case 49: #line 460 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 50: #line 463 "objc-parse.y" ! { yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ! overflow_warning (yyval.ttype); ; ! break;} ! case 51: #line 467 "objc-parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ; ! break;} ! case 52: #line 484 "objc-parse.y" ! { skip_evaluation--; if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF && DECL_C_BIT_FIELD (TREE_OPERAND (yyvsp[0].ttype, 1))) error ("`sizeof' applied to a bit-field"); ! yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ; ! break;} ! case 53: #line 490 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 54: #line 493 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof_expr (yyvsp[0].ttype); ; ! break;} ! case 55: #line 496 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 56: #line 499 "objc-parse.y" ! { yyval.ttype = build_unary_op (REALPART_EXPR, yyvsp[0].ttype, 0); ; ! break;} ! case 57: #line 501 "objc-parse.y" ! { yyval.ttype = build_unary_op (IMAGPART_EXPR, yyvsp[0].ttype, 0); ; ! break;} ! case 58: #line 505 "objc-parse.y" ! { skip_evaluation++; ; ! break;} ! case 59: #line 509 "objc-parse.y" ! { skip_evaluation++; ; ! break;} ! case 60: #line 513 "objc-parse.y" ! { skip_evaluation++; ; ! break;} ! case 62: #line 519 "objc-parse.y" ! { yyval.ttype = c_cast_expr (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 64: #line 525 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 65: #line 527 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 66: #line 529 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 67: #line 531 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 68: #line 533 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 69: #line 535 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 70: #line 537 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 71: #line 539 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 72: #line 541 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 73: #line 543 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 74: #line 545 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 75: #line 547 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 76: #line 549 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ; ! break;} ! case 77: #line 552 "objc-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_false_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 78: #line 555 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ; ! break;} ! case 79: #line 558 "objc-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_true_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 80: #line 561 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ; ! break;} ! case 81: #line 564 "objc-parse.y" ! { skip_evaluation += ((yyvsp[-4].ttype == boolean_true_node) ! - (yyvsp[-4].ttype == boolean_false_node)); ; ! break;} ! case 82: #line 567 "objc-parse.y" ! { skip_evaluation -= yyvsp[-6].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 83: #line 570 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids omitting the middle term of a ?: expression"); /* Make sure first operand is calculated only once. */ yyvsp[0].ttype = save_expr (yyvsp[-1].ttype); yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[0].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ; ! break;} ! case 84: #line 577 "objc-parse.y" ! { skip_evaluation -= yyvsp[-4].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 85: #line 580 "objc-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ! ; ! break;} ! case 86: #line 587 "objc-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); /* This inhibits warnings in truthvalue_conversion. */ class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, ERROR_MARK); ! ; ! break;} ! case 87: #line 598 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = build_external_ref (yyvsp[0].ttype, yychar == '('); ! ; ! break;} ! case 89: #line 605 "objc-parse.y" ! { yyval.ttype = combine_strings (yyvsp[0].ttype); ; ! break;} ! case 90: #line 607 "objc-parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); ; ! break;} ! case 91: #line 609 "objc-parse.y" ! { start_init (NULL_TREE, NULL, 0); yyvsp[-2].ttype = groktypename (yyvsp[-2].ttype); ! really_start_incremental_init (yyvsp[-2].ttype); ; ! break;} ! case 92: #line 613 "objc-parse.y" ! { tree constructor = pop_init_level (0); tree type = yyvsp[-5].ttype; finish_init (); if (pedantic && ! flag_isoc99) pedwarn ("ISO C89 forbids compound literals"); yyval.ttype = build_compound_literal (type, constructor); ! ; ! break;} ! case 93: #line 622 "objc-parse.y" ! { char class = TREE_CODE_CLASS (TREE_CODE (yyvsp[-1].ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyvsp[-1].ttype, ERROR_MARK); ! yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 94: #line 627 "objc-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 95: #line 629 "objc-parse.y" ! { tree saved_last_tree; if (pedantic) pedwarn ("ISO C forbids braced-groups within expressions"); --- 3190,3688 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) { ! case 2: #line 308 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids an empty source file"); finish_file (); ! ;} ! break; ! ! case 3: #line 313 "objc-parse.y" ! { /* In case there were missing closebraces, get us back to the global binding level. */ while (! global_bindings_p ()) poplevel (0, 0, 0); finish_file (); ! ;} ! break; ! ! case 4: #line 327 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ;} ! break; ! ! case 6: #line 328 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ggc_collect(); ;} ! break; ! ! case 11: #line 336 "objc-parse.y" ! { STRIP_NOPS (yyvsp[-2].ttype); if ((TREE_CODE (yyvsp[-2].ttype) == ADDR_EXPR && TREE_CODE (TREE_OPERAND (yyvsp[-2].ttype, 0)) == STRING_CST) || TREE_CODE (yyvsp[-2].ttype) == STRING_CST) assemble_asm (yyvsp[-2].ttype); else ! error ("argument of `asm' is not a constant string"); ;} ! break; ! ! case 12: #line 344 "objc-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 13: #line 349 "objc-parse.y" ! { if (pedantic) error ("ISO C forbids data definition with no type or storage class"); else if (!flag_traditional) warning ("data definition has no type or storage class"); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 14: #line 356 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 15: #line 358 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 16: #line 360 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ;} ! break; ! ! case 19: #line 364 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C does not allow extra `;' outside of a function"); ;} ! break; ! ! case 20: #line 370 "objc-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 21: #line 375 "objc-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 22: #line 377 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 23: #line 382 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 24: #line 384 "objc-parse.y" ! { if (! start_function (current_declspecs, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 25: #line 389 "objc-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 26: #line 391 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 27: #line 396 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 28: #line 398 "objc-parse.y" ! { if (! start_function (NULL_TREE, yyvsp[0].ttype, all_prefix_attributes)) YYERROR1; ! ;} ! break; ! ! case 29: #line 403 "objc-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 30: #line 405 "objc-parse.y" ! { DECL_SOURCE_FILE (current_function_decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (current_function_decl) = yyvsp[-1].lineno; finish_function (0, 1); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 31: #line 410 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 36: #line 421 "objc-parse.y" ! { yyval.code = ADDR_EXPR; ;} ! break; ! ! case 37: #line 423 "objc-parse.y" ! { yyval.code = NEGATE_EXPR; ;} ! break; ! ! case 38: #line 425 "objc-parse.y" ! { yyval.code = CONVERT_EXPR; ! ;} ! break; ! ! case 39: #line 428 "objc-parse.y" ! { yyval.code = PREINCREMENT_EXPR; ;} ! break; ! ! case 40: #line 430 "objc-parse.y" ! { yyval.code = PREDECREMENT_EXPR; ;} ! break; ! ! case 41: #line 432 "objc-parse.y" ! { yyval.code = BIT_NOT_EXPR; ;} ! break; ! ! case 42: #line 434 "objc-parse.y" ! { yyval.code = TRUTH_NOT_EXPR; ;} ! break; ! ! case 43: #line 438 "objc-parse.y" ! { yyval.ttype = build_compound_expr (yyvsp[0].ttype); ;} ! break; ! ! case 44: #line 443 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 46: #line 449 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 47: #line 451 "objc-parse.y" ! { chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 49: #line 457 "objc-parse.y" ! { yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ;} ! break; ! ! case 50: #line 460 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 51: #line 463 "objc-parse.y" ! { yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ! overflow_warning (yyval.ttype); ;} ! break; ! ! case 52: #line 467 "objc-parse.y" ! { yyval.ttype = finish_label_address_expr (yyvsp[0].ttype); ;} ! break; ! ! case 53: #line 484 "objc-parse.y" ! { skip_evaluation--; if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF && DECL_C_BIT_FIELD (TREE_OPERAND (yyvsp[0].ttype, 1))) error ("`sizeof' applied to a bit-field"); ! yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ;} ! break; ! ! case 54: #line 490 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 55: #line 493 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof_expr (yyvsp[0].ttype); ;} ! break; ! ! case 56: #line 496 "objc-parse.y" ! { skip_evaluation--; ! yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 57: #line 499 "objc-parse.y" ! { yyval.ttype = build_unary_op (REALPART_EXPR, yyvsp[0].ttype, 0); ;} ! break; ! ! case 58: #line 501 "objc-parse.y" ! { yyval.ttype = build_unary_op (IMAGPART_EXPR, yyvsp[0].ttype, 0); ;} ! break; ! ! case 59: #line 505 "objc-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 60: #line 509 "objc-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 61: #line 513 "objc-parse.y" ! { skip_evaluation++; ;} ! break; ! ! case 63: #line 519 "objc-parse.y" ! { yyval.ttype = c_cast_expr (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 65: #line 525 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 66: #line 527 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 67: #line 529 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 68: #line 531 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 69: #line 533 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 70: #line 535 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 71: #line 537 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 72: #line 539 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 73: #line 541 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 74: #line 543 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 75: #line 545 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 76: #line 547 "objc-parse.y" ! { yyval.ttype = parser_build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 77: #line 549 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ;} ! break; ! ! case 78: #line 552 "objc-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_false_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 79: #line 555 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ;} ! break; ! ! case 80: #line 558 "objc-parse.y" ! { skip_evaluation -= yyvsp[-3].ttype == boolean_true_node; ! yyval.ttype = parser_build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 81: #line 561 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[-1].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_false_node; ;} ! break; ! ! case 82: #line 564 "objc-parse.y" ! { skip_evaluation += ((yyvsp[-4].ttype == boolean_true_node) ! - (yyvsp[-4].ttype == boolean_false_node)); ;} ! break; ! ! case 83: #line 567 "objc-parse.y" ! { skip_evaluation -= yyvsp[-6].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-6].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 84: #line 570 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids omitting the middle term of a ?: expression"); /* Make sure first operand is calculated only once. */ yyvsp[0].ttype = save_expr (yyvsp[-1].ttype); yyvsp[-1].ttype = truthvalue_conversion (default_conversion (yyvsp[0].ttype)); ! skip_evaluation += yyvsp[-1].ttype == boolean_true_node; ;} ! break; ! ! case 85: #line 577 "objc-parse.y" ! { skip_evaluation -= yyvsp[-4].ttype == boolean_true_node; ! yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 86: #line 580 "objc-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, MODIFY_EXPR); ! ;} ! break; ! ! case 87: #line 587 "objc-parse.y" ! { char class; yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); /* This inhibits warnings in truthvalue_conversion. */ class = TREE_CODE_CLASS (TREE_CODE (yyval.ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyval.ttype, ERROR_MARK); ! ;} ! break; ! ! case 88: #line 598 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; yyval.ttype = build_external_ref (yyvsp[0].ttype, yychar == '('); ! ;} ! break; ! ! case 90: #line 605 "objc-parse.y" ! { yyval.ttype = combine_strings (yyvsp[0].ttype); ;} ! break; ! ! case 91: #line 607 "objc-parse.y" ! { yyval.ttype = fname_decl (C_RID_CODE (yyval.ttype), yyval.ttype); ;} ! break; ! ! case 92: #line 609 "objc-parse.y" ! { start_init (NULL_TREE, NULL, 0); yyvsp[-2].ttype = groktypename (yyvsp[-2].ttype); ! really_start_incremental_init (yyvsp[-2].ttype); ;} ! break; ! ! case 93: #line 613 "objc-parse.y" ! { tree constructor = pop_init_level (0); tree type = yyvsp[-5].ttype; finish_init (); if (pedantic && ! flag_isoc99) pedwarn ("ISO C89 forbids compound literals"); yyval.ttype = build_compound_literal (type, constructor); ! ;} ! break; ! ! case 94: #line 622 "objc-parse.y" ! { char class = TREE_CODE_CLASS (TREE_CODE (yyvsp[-1].ttype)); if (IS_EXPR_CODE_CLASS (class)) C_SET_EXP_ORIGINAL_CODE (yyvsp[-1].ttype, ERROR_MARK); ! yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 95: #line 627 "objc-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 96: #line 629 "objc-parse.y" ! { tree saved_last_tree; if (pedantic) pedwarn ("ISO C forbids braced-groups within expressions"); *************** case 95: *** 3337,3364 **** last_expr_type = void_type_node; yyval.ttype = build1 (STMT_EXPR, last_expr_type, yyvsp[-2].ttype); TREE_SIDE_EFFECTS (yyval.ttype) = 1; ! ; ! break;} ! case 96: #line 645 "objc-parse.y" ! { pop_label_level (); last_tree = COMPOUND_BODY (yyvsp[-2].ttype); TREE_CHAIN (last_tree) = NULL_TREE; yyval.ttype = error_mark_node; ! ; ! break;} ! case 97: #line 652 "objc-parse.y" ! { yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 98: #line 654 "objc-parse.y" ! { yyval.ttype = build_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ttype)); ; ! break;} ! case 99: #line 657 "objc-parse.y" ! { tree c; c = fold (yyvsp[-5].ttype); --- 3696,3727 ---- last_expr_type = void_type_node; yyval.ttype = build1 (STMT_EXPR, last_expr_type, yyvsp[-2].ttype); TREE_SIDE_EFFECTS (yyval.ttype) = 1; ! ;} ! break; ! ! case 97: #line 645 "objc-parse.y" ! { pop_label_level (); last_tree = COMPOUND_BODY (yyvsp[-2].ttype); TREE_CHAIN (last_tree) = NULL_TREE; yyval.ttype = error_mark_node; ! ;} ! break; ! ! case 98: #line 652 "objc-parse.y" ! { yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 99: #line 654 "objc-parse.y" ! { yyval.ttype = build_va_arg (yyvsp[-3].ttype, groktypename (yyvsp[-1].ttype)); ;} ! break; ! ! case 100: #line 657 "objc-parse.y" ! { tree c; c = fold (yyvsp[-5].ttype); *************** case 99: *** 3366,3376 **** if (TREE_CODE (c) != INTEGER_CST) error ("first argument to __builtin_choose_expr not a constant"); yyval.ttype = integer_zerop (c) ? yyvsp[-1].ttype : yyvsp[-3].ttype; ! ; ! break;} ! case 100: #line 667 "objc-parse.y" ! { tree e1, e2; e1 = TYPE_MAIN_VARIANT (groktypename (yyvsp[-3].ttype)); --- 3729,3740 ---- if (TREE_CODE (c) != INTEGER_CST) error ("first argument to __builtin_choose_expr not a constant"); yyval.ttype = integer_zerop (c) ? yyvsp[-1].ttype : yyvsp[-3].ttype; ! ;} ! break; ! ! case 101: #line 667 "objc-parse.y" ! { tree e1, e2; e1 = TYPE_MAIN_VARIANT (groktypename (yyvsp[-3].ttype)); *************** case 100: *** 3378,4138 **** yyval.ttype = comptypes (e1, e2) ? build_int_2 (1, 0) : build_int_2 (0, 0); ! ; ! break;} ! case 101: #line 677 "objc-parse.y" ! { yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 102: #line 679 "objc-parse.y" ! { if (!is_public (yyvsp[-2].ttype, yyvsp[0].ttype)) yyval.ttype = error_mark_node; else yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 103: #line 686 "objc-parse.y" ! { tree expr = build_indirect_ref (yyvsp[-2].ttype, "->"); if (!is_public (expr, yyvsp[0].ttype)) yyval.ttype = error_mark_node; else yyval.ttype = build_component_ref (expr, yyvsp[0].ttype); ! ; ! break;} ! case 104: #line 695 "objc-parse.y" ! { yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ; ! break;} ! case 105: #line 697 "objc-parse.y" ! { yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ; ! break;} ! case 106: #line 699 "objc-parse.y" ! { yyval.ttype = build_message_expr (yyvsp[0].ttype); ; ! break;} ! case 107: #line 701 "objc-parse.y" ! { yyval.ttype = build_selector_expr (yyvsp[0].ttype); ; ! break;} ! case 108: #line 703 "objc-parse.y" ! { yyval.ttype = build_protocol_expr (yyvsp[0].ttype); ; ! break;} ! case 109: #line 705 "objc-parse.y" ! { yyval.ttype = build_encode_expr (yyvsp[0].ttype); ; ! break;} ! case 110: #line 707 "objc-parse.y" ! { yyval.ttype = build_objc_string_object (yyvsp[0].ttype); ; ! break;} ! case 112: #line 714 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 113: #line 723 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 114: #line 725 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 117: #line 733 "objc-parse.y" ! { c_mark_varargs (); if (pedantic) ! pedwarn ("ISO C does not permit use of `varargs.h'"); ; ! break;} ! case 118: #line 743 "objc-parse.y" ! { ; ! break;} ! case 123: #line 759 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 124: #line 761 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 125: #line 763 "objc-parse.y" ! { shadow_tag_warned (yyvsp[-1].ttype, 1); ! pedwarn ("empty declaration"); ; ! break;} ! case 126: #line 766 "objc-parse.y" ! { pedwarn ("empty declaration"); ; ! break;} ! case 127: #line 775 "objc-parse.y" ! { ; ! break;} ! case 128: #line 783 "objc-parse.y" ! { pending_xref_error (); PUSH_DECLSPEC_STACK; split_specs_attrs (yyvsp[0].ttype, ¤t_declspecs, &prefix_attributes); ! all_prefix_attributes = prefix_attributes; ; ! break;} ! case 129: #line 794 "objc-parse.y" ! { all_prefix_attributes = chainon (yyvsp[0].ttype, prefix_attributes); ; ! break;} ! case 130: #line 799 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 131: #line 801 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 132: #line 803 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 133: #line 805 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 134: #line 807 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ; ! break;} ! case 135: #line 809 "objc-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 136: #line 866 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 137: #line 869 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 138: #line 872 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 139: #line 878 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 140: #line 884 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 141: #line 887 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 142: #line 893 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ; ! break;} ! case 143: #line 896 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 144: #line 902 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 145: #line 905 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 146: #line 908 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 147: #line 911 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 148: #line 914 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 149: #line 917 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 150: #line 920 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 151: #line 926 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 152: #line 929 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 153: #line 932 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 154: #line 935 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 155: #line 938 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 156: #line 941 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 157: #line 947 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 158: #line 950 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 159: #line 953 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 160: #line 956 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 161: #line 959 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 162: #line 962 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 163: #line 968 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 164: #line 971 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 165: #line 974 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 166: #line 977 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 167: #line 980 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 168: #line 986 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ; ! break;} ! case 169: #line 989 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 170: #line 992 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 171: #line 995 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 172: #line 1001 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 173: #line 1007 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 174: #line 1013 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 175: #line 1022 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 176: #line 1028 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 177: #line 1031 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 178: #line 1034 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 179: #line 1040 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 180: #line 1046 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 181: #line 1052 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 182: #line 1061 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 183: #line 1067 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 184: #line 1070 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 185: #line 1073 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 186: #line 1076 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 187: #line 1079 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 188: #line 1082 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 189: #line 1085 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 190: #line 1091 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 191: #line 1097 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 192: #line 1103 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 193: #line 1112 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 194: #line 1115 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 195: #line 1118 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 196: #line 1121 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 197: #line 1124 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 198: #line 1130 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 199: #line 1133 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 200: #line 1136 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 201: #line 1139 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 202: #line 1142 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 203: #line 1145 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 204: #line 1148 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 205: #line 1154 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 206: #line 1160 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 207: #line 1166 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 208: #line 1175 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ; ! break;} ! case 209: #line 1178 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 210: #line 1181 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 211: #line 1184 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 212: #line 1187 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ; ! break;} ! case 269: #line 1275 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 270: #line 1277 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 274: #line 1312 "objc-parse.y" ! { OBJC_NEED_RAW_IDENTIFIER (1); ; ! break;} ! case 277: #line 1322 "objc-parse.y" ! { /* For a typedef name, record the meaning, not the name. In case of `foo foo, bar;'. */ ! yyval.ttype = lookup_name (yyvsp[0].ttype); ; ! break;} ! case 278: #line 1326 "objc-parse.y" ! { yyval.ttype = get_static_reference (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 279: #line 1328 "objc-parse.y" ! { yyval.ttype = get_object_reference (yyvsp[0].ttype); ; ! break;} ! case 280: #line 1333 "objc-parse.y" ! { yyval.ttype = get_object_reference (yyvsp[0].ttype); ; ! break;} ! case 281: #line 1335 "objc-parse.y" ! { skip_evaluation--; yyval.ttype = TREE_TYPE (yyvsp[-1].ttype); ; ! break;} ! case 282: #line 1337 "objc-parse.y" ! { skip_evaluation--; yyval.ttype = groktypename (yyvsp[-1].ttype); ; ! break;} ! case 287: #line 1354 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 288: #line 1356 "objc-parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ! ; ! break;} ! case 289: #line 1363 "objc-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ; ! break;} ! case 290: #line 1368 "objc-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 291: #line 1371 "objc-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ! ; ! break;} ! case 292: #line 1379 "objc-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ; ! break;} ! case 293: #line 1384 "objc-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ; ! break;} ! case 294: #line 1387 "objc-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); ! finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ; ! break;} ! case 295: #line 1395 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 296: #line 1397 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 297: #line 1402 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 298: #line 1404 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 299: #line 1409 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ; ! break;} ! case 300: #line 1414 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 301: #line 1416 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 302: #line 1421 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 303: #line 1423 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 304: #line 1425 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ; ! break;} ! case 305: #line 1427 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ; ! break;} ! case 306: #line 1429 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 312: #line 1447 "objc-parse.y" ! { really_start_incremental_init (NULL_TREE); ; ! break;} ! case 313: #line 1449 "objc-parse.y" ! { yyval.ttype = pop_init_level (0); ; ! break;} ! case 314: #line 1451 "objc-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 315: #line 1457 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids empty initializer braces"); ; ! break;} ! case 319: #line 1471 "objc-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("ISO C89 forbids specifying subobject to initialize"); ; ! break;} ! case 320: #line 1474 "objc-parse.y" ! { if (pedantic) ! pedwarn ("obsolete use of designated initializer without `='"); ; ! break;} ! case 321: #line 1477 "objc-parse.y" ! { set_init_label (yyvsp[-1].ttype); if (pedantic) ! pedwarn ("obsolete use of designated initializer with `:'"); ; ! break;} ! case 322: #line 1481 "objc-parse.y" ! {; ! break;} ! case 324: #line 1487 "objc-parse.y" ! { push_init_level (0); ; ! break;} ! case 325: #line 1489 "objc-parse.y" ! { process_init_element (pop_init_level (0)); ; ! break;} ! case 326: #line 1491 "objc-parse.y" ! { process_init_element (yyvsp[0].ttype); ; ! break;} ! case 330: #line 1502 "objc-parse.y" ! { set_init_label (yyvsp[0].ttype); ; ! break;} ! case 331: #line 1510 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); --- 3742,4649 ---- yyval.ttype = comptypes (e1, e2) ? build_int_2 (1, 0) : build_int_2 (0, 0); ! ;} ! break; ! ! case 102: #line 677 "objc-parse.y" ! { yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 103: #line 679 "objc-parse.y" ! { if (!is_public (yyvsp[-2].ttype, yyvsp[0].ttype)) yyval.ttype = error_mark_node; else yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 104: #line 686 "objc-parse.y" ! { tree expr = build_indirect_ref (yyvsp[-2].ttype, "->"); if (!is_public (expr, yyvsp[0].ttype)) yyval.ttype = error_mark_node; else yyval.ttype = build_component_ref (expr, yyvsp[0].ttype); ! ;} ! break; ! ! case 105: #line 695 "objc-parse.y" ! { yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 106: #line 697 "objc-parse.y" ! { yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 107: #line 699 "objc-parse.y" ! { yyval.ttype = build_message_expr (yyvsp[0].ttype); ;} ! break; ! ! case 108: #line 701 "objc-parse.y" ! { yyval.ttype = build_selector_expr (yyvsp[0].ttype); ;} ! break; ! ! case 109: #line 703 "objc-parse.y" ! { yyval.ttype = build_protocol_expr (yyvsp[0].ttype); ;} ! break; ! ! case 110: #line 705 "objc-parse.y" ! { yyval.ttype = build_encode_expr (yyvsp[0].ttype); ;} ! break; ! ! case 111: #line 707 "objc-parse.y" ! { yyval.ttype = build_objc_string_object (yyvsp[0].ttype); ;} ! break; ! ! case 113: #line 714 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 114: #line 723 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 115: #line 725 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 118: #line 733 "objc-parse.y" ! { c_mark_varargs (); if (pedantic) ! pedwarn ("ISO C does not permit use of `varargs.h'"); ;} ! break; ! ! case 119: #line 743 "objc-parse.y" ! { ;} ! break; ! ! case 124: #line 759 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 125: #line 761 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 126: #line 763 "objc-parse.y" ! { shadow_tag_warned (yyvsp[-1].ttype, 1); ! pedwarn ("empty declaration"); ;} ! break; ! ! case 127: #line 766 "objc-parse.y" ! { pedwarn ("empty declaration"); ;} ! break; ! ! case 128: #line 775 "objc-parse.y" ! { ;} ! break; ! ! case 129: #line 783 "objc-parse.y" ! { pending_xref_error (); PUSH_DECLSPEC_STACK; split_specs_attrs (yyvsp[0].ttype, ¤t_declspecs, &prefix_attributes); ! all_prefix_attributes = prefix_attributes; ;} ! break; ! ! case 130: #line 794 "objc-parse.y" ! { all_prefix_attributes = chainon (yyvsp[0].ttype, prefix_attributes); ;} ! break; ! ! case 131: #line 799 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 132: #line 801 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 133: #line 803 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 134: #line 805 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 135: #line 807 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ;} ! break; ! ! case 136: #line 809 "objc-parse.y" ! { RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 137: #line 866 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 138: #line 869 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 139: #line 872 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 140: #line 878 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 141: #line 884 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 142: #line 887 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 143: #line 893 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ;} ! break; ! ! case 144: #line 896 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 145: #line 902 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 146: #line 905 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 147: #line 908 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 148: #line 911 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 149: #line 914 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 150: #line 917 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 151: #line 920 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 152: #line 926 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 153: #line 929 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 154: #line 932 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 155: #line 935 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 156: #line 938 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 157: #line 941 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 158: #line 947 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 159: #line 950 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 160: #line 953 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 161: #line 956 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 162: #line 959 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 163: #line 962 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 164: #line 968 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 165: #line 971 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 166: #line 974 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 167: #line 977 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 168: #line 980 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 169: #line 986 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! TREE_STATIC (yyval.ttype) = 0; ;} ! break; ! ! case 170: #line 989 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 171: #line 992 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 172: #line 995 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 173: #line 1001 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 174: #line 1007 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 175: #line 1013 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 176: #line 1022 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 177: #line 1028 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 178: #line 1031 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 179: #line 1034 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 180: #line 1040 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 181: #line 1046 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 182: #line 1052 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 183: #line 1061 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 184: #line 1067 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 185: #line 1070 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 186: #line 1073 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 187: #line 1076 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 188: #line 1079 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 189: #line 1082 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 190: #line 1085 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 191: #line 1091 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 192: #line 1097 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 193: #line 1103 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 194: #line 1112 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 195: #line 1115 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 196: #line 1118 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 197: #line 1121 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 198: #line 1124 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 199: #line 1130 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 200: #line 1133 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 201: #line 1136 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 202: #line 1139 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 203: #line 1142 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 204: #line 1145 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 205: #line 1148 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 206: #line 1154 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 207: #line 1160 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 208: #line 1166 "objc-parse.y" ! { if (extra_warnings && TREE_STATIC (yyvsp[-1].ttype)) warning ("`%s' is not at beginning of declaration", IDENTIFIER_POINTER (yyvsp[0].ttype)); yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 209: #line 1175 "objc-parse.y" ! { yyval.ttype = tree_cons (yyvsp[0].ttype, NULL_TREE, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = TREE_STATIC (yyvsp[-1].ttype); ;} ! break; ! ! case 210: #line 1178 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 211: #line 1181 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 212: #line 1184 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 213: #line 1187 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ! TREE_STATIC (yyval.ttype) = 1; ;} ! break; ! ! case 270: #line 1275 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 271: #line 1277 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 275: #line 1312 "objc-parse.y" ! { OBJC_NEED_RAW_IDENTIFIER (1); ;} ! break; ! ! case 278: #line 1322 "objc-parse.y" ! { /* For a typedef name, record the meaning, not the name. In case of `foo foo, bar;'. */ ! yyval.ttype = lookup_name (yyvsp[0].ttype); ;} ! break; ! ! case 279: #line 1326 "objc-parse.y" ! { yyval.ttype = get_static_reference (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 280: #line 1328 "objc-parse.y" ! { yyval.ttype = get_object_reference (yyvsp[0].ttype); ;} ! break; ! ! case 281: #line 1333 "objc-parse.y" ! { yyval.ttype = get_object_reference (yyvsp[0].ttype); ;} ! break; ! ! case 282: #line 1335 "objc-parse.y" ! { skip_evaluation--; yyval.ttype = TREE_TYPE (yyvsp[-1].ttype); ;} ! break; ! ! case 283: #line 1337 "objc-parse.y" ! { skip_evaluation--; yyval.ttype = groktypename (yyvsp[-1].ttype); ;} ! break; ! ! case 288: #line 1354 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 289: #line 1356 "objc-parse.y" ! { if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype); yyval.ttype = yyvsp[-1].ttype; ! ;} ! break; ! ! case 290: #line 1363 "objc-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ;} ! break; ! ! case 291: #line 1368 "objc-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 292: #line 1371 "objc-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ! ;} ! break; ! ! case 293: #line 1379 "objc-parse.y" ! { yyval.ttype = start_decl (yyvsp[-3].ttype, current_declspecs, 1, chainon (yyvsp[-1].ttype, all_prefix_attributes)); ! start_init (yyval.ttype, yyvsp[-2].ttype, global_bindings_p ()); ;} ! break; ! ! case 294: #line 1384 "objc-parse.y" ! { finish_init (); ! finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-4].ttype); ;} ! break; ! ! case 295: #line 1387 "objc-parse.y" ! { tree d = start_decl (yyvsp[-2].ttype, current_declspecs, 0, chainon (yyvsp[0].ttype, all_prefix_attributes)); ! finish_decl (d, NULL_TREE, yyvsp[-1].ttype); ;} ! break; ! ! case 296: #line 1395 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 297: #line 1397 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 298: #line 1402 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 299: #line 1404 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 300: #line 1409 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ;} ! break; ! ! case 301: #line 1414 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 302: #line 1416 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 303: #line 1421 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 304: #line 1423 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 305: #line 1425 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, build_tree_list (NULL_TREE, yyvsp[-1].ttype)); ;} ! break; ! ! case 306: #line 1427 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-5].ttype, tree_cons (NULL_TREE, yyvsp[-3].ttype, yyvsp[-1].ttype)); ;} ! break; ! ! case 307: #line 1429 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 313: #line 1447 "objc-parse.y" ! { really_start_incremental_init (NULL_TREE); ;} ! break; ! ! case 314: #line 1449 "objc-parse.y" ! { yyval.ttype = pop_init_level (0); ;} ! break; ! ! case 315: #line 1451 "objc-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 316: #line 1457 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids empty initializer braces"); ;} ! break; ! ! case 320: #line 1471 "objc-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("ISO C89 forbids specifying subobject to initialize"); ;} ! break; ! ! case 321: #line 1474 "objc-parse.y" ! { if (pedantic) ! pedwarn ("obsolete use of designated initializer without `='"); ;} ! break; ! ! case 322: #line 1477 "objc-parse.y" ! { set_init_label (yyvsp[-1].ttype); if (pedantic) ! pedwarn ("obsolete use of designated initializer with `:'"); ;} ! break; ! ! case 323: #line 1481 "objc-parse.y" ! {;} ! break; ! ! case 325: #line 1487 "objc-parse.y" ! { push_init_level (0); ;} ! break; ! ! case 326: #line 1489 "objc-parse.y" ! { process_init_element (pop_init_level (0)); ;} ! break; ! ! case 327: #line 1491 "objc-parse.y" ! { process_init_element (yyvsp[0].ttype); ;} ! break; ! ! case 331: #line 1502 "objc-parse.y" ! { set_init_label (yyvsp[0].ttype); ;} ! break; ! ! case 332: #line 1510 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); *************** case 331: *** 4142,4165 **** pop_function_context (); YYERROR1; } ! ; ! break;} ! case 332: #line 1522 "objc-parse.y" ! { store_parm_decls (); ; ! break;} ! case 333: #line 1530 "objc-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ; ! break;} ! case 334: #line 1540 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); --- 4653,4679 ---- pop_function_context (); YYERROR1; } ! ;} ! break; ! ! case 333: #line 1522 "objc-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 334: #line 1530 "objc-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ;} ! break; ! ! case 335: #line 1540 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids nested functions"); push_function_context (); *************** case 334: *** 4169,4367 **** pop_function_context (); YYERROR1; } ! ; ! break;} ! case 335: #line 1552 "objc-parse.y" ! { store_parm_decls (); ; ! break;} ! case 336: #line 1560 "objc-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ; ! break;} ! case 339: #line 1580 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 340: #line 1582 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 341: #line 1587 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 342: #line 1589 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 347: #line 1605 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 348: #line 1610 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 351: #line 1617 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 352: #line 1622 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 353: #line 1624 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 354: #line 1626 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 355: #line 1628 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 356: #line 1636 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 357: #line 1641 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 358: #line 1643 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 359: #line 1645 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ; ! break;} ! case 361: #line 1651 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 362: #line 1653 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 363: #line 1658 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 364: #line 1660 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 365: #line 1665 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 366: #line 1667 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 367: #line 1678 "objc-parse.y" ! { yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype); /* Start scope of tag before parsing components. */ ! ; ! break;} ! case 368: #line 1682 "objc-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 369: #line 1684 "objc-parse.y" ! { yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ; ! break;} ! case 370: #line 1688 "objc-parse.y" ! { yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ; ! break;} ! case 371: #line 1690 "objc-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 372: #line 1692 "objc-parse.y" ! { yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ; ! break;} ! case 373: #line 1696 "objc-parse.y" ! { yyval.ttype = start_enum (yyvsp[-1].ttype); ; ! break;} ! case 374: #line 1698 "objc-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-7].ttype, yyvsp[0].ttype)); ; ! break;} ! case 375: #line 1701 "objc-parse.y" ! { yyval.ttype = start_enum (NULL_TREE); ; ! break;} ! case 376: #line 1703 "objc-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ; ! break;} ! case 377: #line 1709 "objc-parse.y" ! { yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ; ! break;} ! case 378: #line 1711 "objc-parse.y" ! { yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ; ! break;} ! case 379: #line 1713 "objc-parse.y" ! { yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); /* In ISO C, enumerated types can be referred to only if already defined. */ if (pedantic && !COMPLETE_TYPE_P (yyval.ttype)) ! pedwarn ("ISO C forbids forward references to `enum' types"); ; ! break;} ! case 383: #line 1728 "objc-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("comma at end of enumerator list"); ; ! break;} ! case 384: #line 1734 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 385: #line 1736 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! pedwarn ("no semicolon at end of struct or union"); ; ! break;} ! case 386: #line 1741 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 387: #line 1743 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ; ! break;} ! case 388: #line 1745 "objc-parse.y" ! { if (pedantic) ! pedwarn ("extra semicolon in struct or union specified"); ; ! break;} ! case 389: #line 1749 "objc-parse.y" ! { tree interface = lookup_interface (yyvsp[-1].ttype); if (interface) --- 4683,4924 ---- pop_function_context (); YYERROR1; } ! ;} ! break; ! ! case 336: #line 1552 "objc-parse.y" ! { store_parm_decls (); ;} ! break; ! ! case 337: #line 1560 "objc-parse.y" ! { tree decl = current_function_decl; DECL_SOURCE_FILE (decl) = yyvsp[-2].filename; DECL_SOURCE_LINE (decl) = yyvsp[-1].lineno; finish_function (1, 1); pop_function_context (); ! add_decl_stmt (decl); ;} ! break; ! ! case 340: #line 1580 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 341: #line 1582 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 342: #line 1587 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 343: #line 1589 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 348: #line 1605 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 349: #line 1610 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 352: #line 1617 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 353: #line 1622 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 354: #line 1624 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 355: #line 1626 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 356: #line 1628 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 357: #line 1636 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 358: #line 1641 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 359: #line 1643 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 360: #line 1645 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 0); ;} ! break; ! ! case 362: #line 1651 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 363: #line 1653 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 364: #line 1658 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 365: #line 1660 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 366: #line 1665 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 367: #line 1667 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 368: #line 1678 "objc-parse.y" ! { yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype); /* Start scope of tag before parsing components. */ ! ;} ! break; ! ! case 369: #line 1682 "objc-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 370: #line 1684 "objc-parse.y" ! { yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ;} ! break; ! ! case 371: #line 1688 "objc-parse.y" ! { yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ;} ! break; ! ! case 372: #line 1690 "objc-parse.y" ! { yyval.ttype = finish_struct (yyvsp[-3].ttype, yyvsp[-2].ttype, chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 373: #line 1692 "objc-parse.y" ! { yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE), yyvsp[-2].ttype, chainon (yyvsp[-4].ttype, yyvsp[0].ttype)); ! ;} ! break; ! ! case 374: #line 1696 "objc-parse.y" ! { yyval.ttype = start_enum (yyvsp[-1].ttype); ;} ! break; ! ! case 375: #line 1698 "objc-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-7].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 376: #line 1701 "objc-parse.y" ! { yyval.ttype = start_enum (NULL_TREE); ;} ! break; ! ! case 377: #line 1703 "objc-parse.y" ! { yyval.ttype = finish_enum (yyvsp[-4].ttype, nreverse (yyvsp[-3].ttype), ! chainon (yyvsp[-6].ttype, yyvsp[0].ttype)); ;} ! break; ! ! case 378: #line 1709 "objc-parse.y" ! { yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ;} ! break; ! ! case 379: #line 1711 "objc-parse.y" ! { yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ;} ! break; ! ! case 380: #line 1713 "objc-parse.y" ! { yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); /* In ISO C, enumerated types can be referred to only if already defined. */ if (pedantic && !COMPLETE_TYPE_P (yyval.ttype)) ! pedwarn ("ISO C forbids forward references to `enum' types"); ;} ! break; ! ! case 384: #line 1728 "objc-parse.y" ! { if (pedantic && ! flag_isoc99) ! pedwarn ("comma at end of enumerator list"); ;} ! break; ! ! case 385: #line 1734 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 386: #line 1736 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! pedwarn ("no semicolon at end of struct or union"); ;} ! break; ! ! case 387: #line 1741 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 388: #line 1743 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 389: #line 1745 "objc-parse.y" ! { if (pedantic) ! pedwarn ("extra semicolon in struct or union specified"); ;} ! break; ! ! case 390: #line 1749 "objc-parse.y" ! { tree interface = lookup_interface (yyvsp[-1].ttype); if (interface) *************** case 389: *** 4372,4387 **** IDENTIFIER_POINTER (yyvsp[-1].ttype)); yyval.ttype = NULL_TREE; } ! ; ! break;} ! case 390: #line 1765 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 391: #line 1768 "objc-parse.y" ! { /* Support for unnamed structs or unions as members of structs or unions (which is [a] useful and [b] supports MS P-SDK). */ --- 4929,4946 ---- IDENTIFIER_POINTER (yyvsp[-1].ttype)); yyval.ttype = NULL_TREE; } ! ;} ! break; ! ! case 391: #line 1765 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 392: #line 1768 "objc-parse.y" ! { /* Support for unnamed structs or unions as members of structs or unions (which is [a] useful and [b] supports MS P-SDK). */ *************** case 391: *** 4389,4606 **** pedwarn ("ISO C doesn't support unnamed structs/unions"); yyval.ttype = grokfield(yyvsp[-1].filename, yyvsp[0].lineno, NULL, current_declspecs, NULL_TREE); ! POP_DECLSPEC_STACK; ; ! break;} ! case 392: #line 1778 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 393: #line 1781 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids member declarations with no members"); shadow_tag(yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 394: #line 1786 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 395: #line 1788 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ; ! break;} ! case 397: #line 1795 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 399: #line 1801 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ; ! break;} ! case 400: #line 1806 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 401: #line 1810 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 402: #line 1813 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 403: #line 1819 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 404: #line 1823 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 405: #line 1826 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ; ! break;} ! case 407: #line 1838 "objc-parse.y" ! { if (yyvsp[-2].ttype == error_mark_node) yyval.ttype = yyvsp[-2].ttype; else ! yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ; ! break;} ! case 408: #line 1843 "objc-parse.y" ! { yyval.ttype = error_mark_node; ; ! break;} ! case 409: #line 1849 "objc-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 410: #line 1851 "objc-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 411: #line 1856 "objc-parse.y" ! { pending_xref_error (); ! yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 412: #line 1859 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 413: #line 1864 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 415: #line 1870 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, NULL_TREE), ! all_prefix_attributes); ; ! break;} ! case 416: #line 1874 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[0].ttype), ! all_prefix_attributes); ; ! break;} ! case 417: #line 1878 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ; ! break;} ! case 421: #line 1891 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 422: #line 1896 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 423: #line 1898 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ; ! break;} ! case 424: #line 1903 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ; ! break;} ! case 425: #line 1905 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 426: #line 1907 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 1); ; ! break;} ! case 427: #line 1909 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ; ! break;} ! case 428: #line 1911 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, NULL_TREE, 1); ; ! break;} ! case 429: #line 1918 "objc-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 0, 0); ; ! break;} ! case 430: #line 1920 "objc-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 0, 0); ; ! break;} ! case 431: #line 1922 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 0); ; ! break;} ! case 432: #line 1924 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-1].ttype, 0, 0); ; ! break;} ! case 433: #line 1926 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 1); ; ! break;} ! case 434: #line 1928 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-2].ttype, 0, 1); ; ! break;} ! case 435: #line 1930 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 1, 0); ; ! break;} ! case 436: #line 1934 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-3].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 1, 0); ; ! break;} ! case 437: #line 1938 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-3].ttype, 1, 0); ; ! break;} ! case 440: #line 1953 "objc-parse.y" ! { pedwarn ("deprecated use of label at end of compound statement"); ! ; ! break;} ! case 448: #line 1970 "objc-parse.y" ! { if (pedantic && !flag_isoc99) ! pedwarn ("ISO C89 forbids mixed declarations and code"); ; ! break;} ! case 463: #line 2000 "objc-parse.y" ! { pushlevel (0); clear_last_expr (); add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0); if (objc_method_context) add_objc_decls (); ! ; ! break;} ! case 464: #line 2009 "objc-parse.y" ! { yyval.ttype = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); ; ! break;} ! case 465: #line 2014 "objc-parse.y" ! { if (flag_isoc99) { yyval.ttype = c_begin_compound_stmt (); pushlevel (0); --- 4948,5209 ---- pedwarn ("ISO C doesn't support unnamed structs/unions"); yyval.ttype = grokfield(yyvsp[-1].filename, yyvsp[0].lineno, NULL, current_declspecs, NULL_TREE); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 393: #line 1778 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 394: #line 1781 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids member declarations with no members"); shadow_tag(yyvsp[0].ttype); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 395: #line 1786 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 396: #line 1788 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! RESTORE_WARN_FLAGS (yyvsp[-1].ttype); ;} ! break; ! ! case 398: #line 1795 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 400: #line 1801 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-3].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 401: #line 1806 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 402: #line 1810 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 403: #line 1813 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 404: #line 1819 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-1].ttype, current_declspecs, NULL_TREE); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 405: #line 1823 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-5].filename, yyvsp[-4].lineno, yyvsp[-3].ttype, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 406: #line 1826 "objc-parse.y" ! { yyval.ttype = grokfield (yyvsp[-4].filename, yyvsp[-3].lineno, NULL_TREE, current_declspecs, yyvsp[-1].ttype); ! decl_attributes (&yyval.ttype, chainon (yyvsp[0].ttype, all_prefix_attributes), 0); ;} ! break; ! ! case 408: #line 1838 "objc-parse.y" ! { if (yyvsp[-2].ttype == error_mark_node) yyval.ttype = yyvsp[-2].ttype; else ! yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 409: #line 1843 "objc-parse.y" ! { yyval.ttype = error_mark_node; ;} ! break; ! ! case 410: #line 1849 "objc-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 411: #line 1851 "objc-parse.y" ! { yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 412: #line 1856 "objc-parse.y" ! { pending_xref_error (); ! yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 413: #line 1859 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 414: #line 1864 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 416: #line 1870 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, NULL_TREE), ! all_prefix_attributes); ;} ! break; ! ! case 417: #line 1874 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[0].ttype), ! all_prefix_attributes); ;} ! break; ! ! case 418: #line 1878 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ;} ! break; ! ! case 422: #line 1891 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 423: #line 1896 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 424: #line 1898 "objc-parse.y" ! { yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 425: #line 1903 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype ? tree_cons (yyvsp[-2].ttype, yyvsp[-1].ttype, NULL_TREE) : yyvsp[-1].ttype; ;} ! break; ! ! case 426: #line 1905 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 427: #line 1907 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, yyvsp[-1].ttype, 1); ;} ! break; ! ! case 428: #line 1909 "objc-parse.y" ! { yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;} ! break; ! ! case 429: #line 1911 "objc-parse.y" ! { yyval.ttype = set_array_declarator_type (yyvsp[0].ttype, NULL_TREE, 1); ;} ! break; ! ! case 430: #line 1918 "objc-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 0, 0); ;} ! break; ! ! case 431: #line 1920 "objc-parse.y" ! { yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 0, 0); ;} ! break; ! ! case 432: #line 1922 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 0); ;} ! break; ! ! case 433: #line 1924 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-1].ttype, 0, 0); ;} ! break; ! ! case 434: #line 1926 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, NULL_TREE, 0, 1); ;} ! break; ! ! case 435: #line 1928 "objc-parse.y" ! { yyval.ttype = build_array_declarator (NULL_TREE, yyvsp[-2].ttype, 0, 1); ;} ! break; ! ! case 436: #line 1930 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, NULL_TREE, 1, 0); ;} ! break; ! ! case 437: #line 1934 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-3].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-2].ttype, 1, 0); ;} ! break; ! ! case 438: #line 1938 "objc-parse.y" ! { if (C_RID_CODE (yyvsp[-2].ttype) != RID_STATIC) error ("storage class specifier in array declarator"); ! yyval.ttype = build_array_declarator (yyvsp[-1].ttype, yyvsp[-3].ttype, 1, 0); ;} ! break; ! ! case 441: #line 1953 "objc-parse.y" ! { pedwarn ("deprecated use of label at end of compound statement"); ! ;} ! break; ! ! case 449: #line 1970 "objc-parse.y" ! { if (pedantic && !flag_isoc99) ! pedwarn ("ISO C89 forbids mixed declarations and code"); ;} ! break; ! ! case 464: #line 2000 "objc-parse.y" ! { pushlevel (0); clear_last_expr (); add_scope_stmt (/*begin_p=*/1, /*partial_p=*/0); if (objc_method_context) add_objc_decls (); ! ;} ! break; ! ! case 465: #line 2009 "objc-parse.y" ! { yyval.ttype = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); ;} ! break; ! ! case 466: #line 2014 "objc-parse.y" ! { if (flag_isoc99) { yyval.ttype = c_begin_compound_stmt (); pushlevel (0); *************** case 465: *** 4611,4621 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 466: #line 2032 "objc-parse.y" ! { if (flag_isoc99) { tree scope_stmt = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); yyval.ttype = poplevel (kept_level_p (), 0, 0); --- 5214,5225 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 467: #line 2032 "objc-parse.y" ! { if (flag_isoc99) { tree scope_stmt = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/0); yyval.ttype = poplevel (kept_level_p (), 0, 0); *************** case 466: *** 4624,4670 **** = yyval.ttype; } else ! yyval.ttype = NULL_TREE; ; ! break;} ! case 468: #line 2049 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids label declarations"); ; ! break;} ! case 471: #line 2060 "objc-parse.y" ! { tree link; for (link = yyvsp[-1].ttype; link; link = TREE_CHAIN (link)) { tree label = shadow_label (TREE_VALUE (link)); C_DECLARED_LABEL_FLAG (label) = 1; add_decl_stmt (label); } ! ; ! break;} ! case 472: #line 2074 "objc-parse.y" ! {; ! break;} ! case 474: #line 2078 "objc-parse.y" ! { compstmt_count++; ! yyval.ttype = c_begin_compound_stmt (); ; ! break;} ! case 475: #line 2083 "objc-parse.y" ! { yyval.ttype = convert (void_type_node, integer_zero_node); ; ! break;} ! case 476: #line 2085 "objc-parse.y" ! { yyval.ttype = poplevel (kept_level_p (), 1, 0); SCOPE_STMT_BLOCK (TREE_PURPOSE (yyvsp[0].ttype)) = SCOPE_STMT_BLOCK (TREE_VALUE (yyvsp[0].ttype)) ! = yyval.ttype; ; ! break;} ! case 479: #line 2098 "objc-parse.y" ! { if (current_function_decl == 0) { error ("braced-group within expression allowed only inside a function"); YYERROR; --- 5228,5281 ---- = yyval.ttype; } else ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 469: #line 2049 "objc-parse.y" ! { if (pedantic) ! pedwarn ("ISO C forbids label declarations"); ;} ! break; ! ! case 472: #line 2060 "objc-parse.y" ! { tree link; for (link = yyvsp[-1].ttype; link; link = TREE_CHAIN (link)) { tree label = shadow_label (TREE_VALUE (link)); C_DECLARED_LABEL_FLAG (label) = 1; add_decl_stmt (label); } ! ;} ! break; ! ! case 473: #line 2074 "objc-parse.y" ! {;} ! break; ! ! case 475: #line 2078 "objc-parse.y" ! { compstmt_count++; ! yyval.ttype = c_begin_compound_stmt (); ;} ! break; ! ! case 476: #line 2083 "objc-parse.y" ! { yyval.ttype = convert (void_type_node, integer_zero_node); ;} ! break; ! ! case 477: #line 2085 "objc-parse.y" ! { yyval.ttype = poplevel (kept_level_p (), 1, 0); SCOPE_STMT_BLOCK (TREE_PURPOSE (yyvsp[0].ttype)) = SCOPE_STMT_BLOCK (TREE_VALUE (yyvsp[0].ttype)) ! = yyval.ttype; ;} ! break; ! ! case 480: #line 2098 "objc-parse.y" ! { if (current_function_decl == 0) { error ("braced-group within expression allowed only inside a function"); YYERROR; *************** case 479: *** 4677,4709 **** push_label_level (); compstmt_count++; yyval.ttype = add_stmt (build_stmt (COMPOUND_STMT, last_tree)); ! ; ! break;} ! case 480: #line 2115 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, COMPOUND_BODY (yyvsp[-1].ttype)); last_expr_type = NULL_TREE; ! yyval.ttype = yyvsp[-1].ttype; ; ! break;} ! case 481: #line 2123 "objc-parse.y" ! { c_finish_then (); ; ! break;} ! case 483: #line 2140 "objc-parse.y" ! { yyval.ttype = c_begin_if_stmt (); ; ! break;} ! case 484: #line 2142 "objc-parse.y" ! { c_expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), compstmt_count,yyvsp[-3].ttype); yyval.itype = stmt_count; if_stmt_file = yyvsp[-7].filename; ! if_stmt_line = yyvsp[-6].lineno; ; ! break;} ! case 485: #line 2154 "objc-parse.y" ! { stmt_count++; compstmt_count++; yyval.ttype = add_stmt (build_stmt (DO_STMT, NULL_TREE, --- 5288,5325 ---- push_label_level (); compstmt_count++; yyval.ttype = add_stmt (build_stmt (COMPOUND_STMT, last_tree)); ! ;} ! break; ! ! case 481: #line 2115 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, COMPOUND_BODY (yyvsp[-1].ttype)); last_expr_type = NULL_TREE; ! yyval.ttype = yyvsp[-1].ttype; ;} ! break; ! ! case 482: #line 2123 "objc-parse.y" ! { c_finish_then (); ;} ! break; ! ! case 484: #line 2140 "objc-parse.y" ! { yyval.ttype = c_begin_if_stmt (); ;} ! break; ! ! case 485: #line 2142 "objc-parse.y" ! { c_expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), compstmt_count,yyvsp[-3].ttype); yyval.itype = stmt_count; if_stmt_file = yyvsp[-7].filename; ! if_stmt_line = yyvsp[-6].lineno; ;} ! break; ! ! case 486: #line 2154 "objc-parse.y" ! { stmt_count++; compstmt_count++; yyval.ttype = add_stmt (build_stmt (DO_STMT, NULL_TREE, *************** case 485: *** 4712,4744 **** parsing the complete do-statement, set the condition now. Otherwise, we can get crashes at RTL-generation time. */ ! DO_COND (yyval.ttype) = error_mark_node; ; ! break;} ! case 486: #line 2165 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ! RECHAIN_STMTS (yyval.ttype, DO_BODY (yyval.ttype)); ; ! break;} ! case 487: #line 2173 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.filename = input_filename; ; ! break;} ! case 488: #line 2179 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.lineno = lineno; ; ! break;} ! case 491: #line 2192 "objc-parse.y" ! { if (flag_isoc99) ! RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ; ! break;} ! case 492: #line 2198 "objc-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; /* ??? We currently have no way of recording --- 5328,5365 ---- parsing the complete do-statement, set the condition now. Otherwise, we can get crashes at RTL-generation time. */ ! DO_COND (yyval.ttype) = error_mark_node; ;} ! break; ! ! case 487: #line 2165 "objc-parse.y" ! { yyval.ttype = yyvsp[-2].ttype; ! RECHAIN_STMTS (yyval.ttype, DO_BODY (yyval.ttype)); ;} ! break; ! ! case 488: #line 2173 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.filename = input_filename; ;} ! break; ! ! case 489: #line 2179 "objc-parse.y" ! { if (yychar == YYEMPTY) yychar = YYLEX; ! yyval.lineno = lineno; ;} ! break; ! ! case 492: #line 2192 "objc-parse.y" ! { if (flag_isoc99) ! RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ;} ! break; ! ! case 493: #line 2198 "objc-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; /* ??? We currently have no way of recording *************** case 492: *** 4747,4912 **** but I suspect that problems will occur when doing inlining at the tree level. */ } ! ; ! break;} ! case 493: #line 2212 "objc-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; } ! ; ! break;} ! case 494: #line 2221 "objc-parse.y" ! { c_expand_start_else (); ! yyvsp[-1].itype = stmt_count; ; ! break;} ! case 495: #line 2224 "objc-parse.y" ! { c_finish_else (); c_expand_end_cond (); if (extra_warnings && stmt_count == yyvsp[-3].itype) ! warning ("empty body in an else-statement"); ; ! break;} ! case 496: #line 2229 "objc-parse.y" ! { c_expand_end_cond (); /* This warning is here instead of in simple_if, because we do not want a warning if an empty if is followed by an else statement. Increment stmt_count so we don't give a second error if this is a nested `if'. */ if (extra_warnings && stmt_count++ == yyvsp[0].itype) warning_with_file_and_line (if_stmt_file, if_stmt_line, ! "empty body in an if-statement"); ; ! break;} ! case 497: #line 2241 "objc-parse.y" ! { c_expand_end_cond (); ; ! break;} ! case 498: #line 2251 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_begin_while_stmt (); ; ! break;} ! case 499: #line 2254 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (yyvsp[-1].ttype); c_finish_while_stmt_cond (truthvalue_conversion (yyvsp[-1].ttype), yyvsp[-3].ttype); ! yyval.ttype = add_stmt (yyvsp[-3].ttype); ; ! break;} ! case 500: #line 2259 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, WHILE_BODY (yyvsp[-1].ttype)); ; ! break;} ! case 501: #line 2262 "objc-parse.y" ! { DO_COND (yyvsp[-4].ttype) = truthvalue_conversion (yyvsp[-2].ttype); ; ! break;} ! case 502: #line 2264 "objc-parse.y" ! { ; ! break;} ! case 503: #line 2266 "objc-parse.y" ! { yyval.ttype = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE); ! add_stmt (yyval.ttype); ; ! break;} ! case 504: #line 2270 "objc-parse.y" ! { stmt_count++; ! RECHAIN_STMTS (yyvsp[-2].ttype, FOR_INIT_STMT (yyvsp[-2].ttype)); ; ! break;} ! case 505: #line 2273 "objc-parse.y" ! { if (yyvsp[-1].ttype) ! FOR_COND (yyvsp[-5].ttype) = truthvalue_conversion (yyvsp[-1].ttype); ; ! break;} ! case 506: #line 2276 "objc-parse.y" ! { FOR_EXPR (yyvsp[-8].ttype) = yyvsp[-1].ttype; ; ! break;} ! case 507: #line 2278 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-10].ttype, FOR_BODY (yyvsp[-10].ttype)); ; ! break;} ! case 508: #line 2280 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_start_case (yyvsp[-1].ttype); ; ! break;} ! case 509: #line 2283 "objc-parse.y" ! { c_finish_case (); ; ! break;} ! case 510: #line 2288 "objc-parse.y" ! { add_stmt (build_stmt (EXPR_STMT, yyvsp[-1].ttype)); ; ! break;} ! case 511: #line 2290 "objc-parse.y" ! { check_for_loop_decls (); ; ! break;} ! case 512: #line 2296 "objc-parse.y" ! { stmt_count++; yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 513: #line 2298 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_expr_stmt (yyvsp[-1].ttype); ; ! break;} ! case 514: #line 2301 "objc-parse.y" ! { if (flag_isoc99) RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 515: #line 2305 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_break_stmt ()); ; ! break;} ! case 516: #line 2308 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_continue_stmt ()); ; ! break;} ! case 517: #line 2311 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (NULL_TREE); ; ! break;} ! case 518: #line 2314 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (yyvsp[-1].ttype); ; ! break;} ! case 519: #line 2317 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = simple_asm_stmt (yyvsp[-2].ttype); ; ! break;} ! case 520: #line 2321 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ; ! break;} ! case 521: #line 2326 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ; ! break;} ! case 522: #line 2331 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ; ! break;} ! case 523: #line 2334 "objc-parse.y" ! { tree decl; stmt_count++; decl = lookup_label (yyvsp[-1].ttype); if (decl != 0) --- 5368,5564 ---- but I suspect that problems will occur when doing inlining at the tree level. */ } ! ;} ! break; ! ! case 494: #line 2212 "objc-parse.y" ! { if (yyvsp[0].ttype) { STMT_LINENO (yyvsp[0].ttype) = yyvsp[-1].lineno; } ! ;} ! break; ! ! case 495: #line 2221 "objc-parse.y" ! { c_expand_start_else (); ! yyvsp[-1].itype = stmt_count; ;} ! break; ! ! case 496: #line 2224 "objc-parse.y" ! { c_finish_else (); c_expand_end_cond (); if (extra_warnings && stmt_count == yyvsp[-3].itype) ! warning ("empty body in an else-statement"); ;} ! break; ! ! case 497: #line 2229 "objc-parse.y" ! { c_expand_end_cond (); /* This warning is here instead of in simple_if, because we do not want a warning if an empty if is followed by an else statement. Increment stmt_count so we don't give a second error if this is a nested `if'. */ if (extra_warnings && stmt_count++ == yyvsp[0].itype) warning_with_file_and_line (if_stmt_file, if_stmt_line, ! "empty body in an if-statement"); ;} ! break; ! ! case 498: #line 2241 "objc-parse.y" ! { c_expand_end_cond (); ;} ! break; ! ! case 499: #line 2251 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_begin_while_stmt (); ;} ! break; ! ! case 500: #line 2254 "objc-parse.y" ! { yyvsp[-1].ttype = truthvalue_conversion (yyvsp[-1].ttype); c_finish_while_stmt_cond (truthvalue_conversion (yyvsp[-1].ttype), yyvsp[-3].ttype); ! yyval.ttype = add_stmt (yyvsp[-3].ttype); ;} ! break; ! ! case 501: #line 2259 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-1].ttype, WHILE_BODY (yyvsp[-1].ttype)); ;} ! break; ! ! case 502: #line 2262 "objc-parse.y" ! { DO_COND (yyvsp[-4].ttype) = truthvalue_conversion (yyvsp[-2].ttype); ;} ! break; ! ! case 503: #line 2264 "objc-parse.y" ! { ;} ! break; ! ! case 504: #line 2266 "objc-parse.y" ! { yyval.ttype = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE); ! add_stmt (yyval.ttype); ;} ! break; ! ! case 505: #line 2270 "objc-parse.y" ! { stmt_count++; ! RECHAIN_STMTS (yyvsp[-2].ttype, FOR_INIT_STMT (yyvsp[-2].ttype)); ;} ! break; ! ! case 506: #line 2273 "objc-parse.y" ! { if (yyvsp[-1].ttype) ! FOR_COND (yyvsp[-5].ttype) = truthvalue_conversion (yyvsp[-1].ttype); ;} ! break; ! ! case 507: #line 2276 "objc-parse.y" ! { FOR_EXPR (yyvsp[-8].ttype) = yyvsp[-1].ttype; ;} ! break; ! ! case 508: #line 2278 "objc-parse.y" ! { RECHAIN_STMTS (yyvsp[-10].ttype, FOR_BODY (yyvsp[-10].ttype)); ;} ! break; ! ! case 509: #line 2280 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_start_case (yyvsp[-1].ttype); ;} ! break; ! ! case 510: #line 2283 "objc-parse.y" ! { c_finish_case (); ;} ! break; ! ! case 511: #line 2288 "objc-parse.y" ! { add_stmt (build_stmt (EXPR_STMT, yyvsp[-1].ttype)); ;} ! break; ! ! case 512: #line 2290 "objc-parse.y" ! { check_for_loop_decls (); ;} ! break; ! ! case 513: #line 2296 "objc-parse.y" ! { stmt_count++; yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 514: #line 2298 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_expr_stmt (yyvsp[-1].ttype); ;} ! break; ! ! case 515: #line 2301 "objc-parse.y" ! { if (flag_isoc99) RECHAIN_STMTS (yyvsp[-2].ttype, COMPOUND_BODY (yyvsp[-2].ttype)); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 516: #line 2305 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_break_stmt ()); ;} ! break; ! ! case 517: #line 2308 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = add_stmt (build_continue_stmt ()); ;} ! break; ! ! case 518: #line 2311 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (NULL_TREE); ;} ! break; ! ! case 519: #line 2314 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = c_expand_return (yyvsp[-1].ttype); ;} ! break; ! ! case 520: #line 2317 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = simple_asm_stmt (yyvsp[-2].ttype); ;} ! break; ! ! case 521: #line 2321 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 522: #line 2326 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE); ;} ! break; ! ! case 523: #line 2331 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = build_asm_stmt (yyvsp[-10].ttype, yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype); ;} ! break; ! ! case 524: #line 2334 "objc-parse.y" ! { tree decl; stmt_count++; decl = lookup_label (yyvsp[-1].ttype); if (decl != 0) *************** case 523: *** 4916,4953 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 524: #line 2346 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids `goto *expr;'"); stmt_count++; yyvsp[-1].ttype = convert (ptr_type_node, yyvsp[-1].ttype); ! yyval.ttype = add_stmt (build_stmt (GOTO_STMT, yyvsp[-1].ttype)); ; ! break;} ! case 525: #line 2352 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 526: #line 2360 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-1].ttype, NULL_TREE); ; ! break;} ! case 527: #line 2363 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-3].ttype, yyvsp[-1].ttype); ; ! break;} ! case 528: #line 2366 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (NULL_TREE, NULL_TREE); ; ! break;} ! case 529: #line 2369 "objc-parse.y" ! { tree label = define_label (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-4].ttype); stmt_count++; if (label) { --- 5568,5611 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 525: #line 2346 "objc-parse.y" ! { if (pedantic) pedwarn ("ISO C forbids `goto *expr;'"); stmt_count++; yyvsp[-1].ttype = convert (ptr_type_node, yyvsp[-1].ttype); ! yyval.ttype = add_stmt (build_stmt (GOTO_STMT, yyvsp[-1].ttype)); ;} ! break; ! ! case 526: #line 2352 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 527: #line 2360 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-1].ttype, NULL_TREE); ;} ! break; ! ! case 528: #line 2363 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (yyvsp[-3].ttype, yyvsp[-1].ttype); ;} ! break; ! ! case 529: #line 2366 "objc-parse.y" ! { stmt_count++; ! yyval.ttype = do_case (NULL_TREE, NULL_TREE); ;} ! break; ! ! case 530: #line 2369 "objc-parse.y" ! { tree label = define_label (yyvsp[-3].filename, yyvsp[-2].lineno, yyvsp[-4].ttype); stmt_count++; if (label) { *************** case 529: *** 4956,5042 **** } else yyval.ttype = NULL_TREE; ! ; ! break;} ! case 530: #line 2385 "objc-parse.y" ! { emit_line_note (input_filename, lineno); ! yyval.ttype = NULL_TREE; ; ! break;} ! case 531: #line 2388 "objc-parse.y" ! { emit_line_note (input_filename, lineno); ; ! break;} ! case 532: #line 2393 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 534: #line 2400 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 537: #line 2407 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ; ! break;} ! case 538: #line 2412 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 539: #line 2414 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ; ! break;} ! case 540: #line 2419 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE); ; ! break;} ! case 541: #line 2421 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ; ! break;} ! case 542: #line 2431 "objc-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (0); ; ! break;} ! case 543: #line 2435 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ; ! break;} ! case 545: #line 2443 "objc-parse.y" ! { tree parm; if (pedantic) pedwarn ("ISO C forbids forward parameter declarations"); /* Mark the forward decls as such. */ for (parm = getdecls (); parm; parm = TREE_CHAIN (parm)) TREE_ASM_WRITTEN (parm) = 1; ! clear_parm_order (); ; ! break;} ! case 546: #line 2451 "objc-parse.y" ! { /* Dummy action so attributes are in known place ! on parser stack. */ ; ! break;} ! case 547: #line 2454 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 548: #line 2456 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ; ! break;} ! case 549: #line 2462 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); ; ! break;} ! case 550: #line 2464 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); /* Gcc used to allow this as an extension. However, it does not work for all targets, and thus has been disabled. Also, since func (...) and func () are indistinguishable, --- 5614,5717 ---- } else yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 531: #line 2385 "objc-parse.y" ! { emit_line_note (input_filename, lineno); ! yyval.ttype = NULL_TREE; ;} ! break; ! ! case 532: #line 2388 "objc-parse.y" ! { emit_line_note (input_filename, lineno); ;} ! break; ! ! case 533: #line 2393 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 535: #line 2400 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 538: #line 2407 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;} ! break; ! ! case 539: #line 2412 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (NULL_TREE, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 540: #line 2414 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (yyvsp[-5].ttype, yyvsp[-3].ttype), yyvsp[-1].ttype); ;} ! break; ! ! case 541: #line 2419 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), NULL_TREE); ;} ! break; ! ! case 542: #line 2421 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, combine_strings (yyvsp[0].ttype), yyvsp[-2].ttype); ;} ! break; ! ! case 543: #line 2431 "objc-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (0); ;} ! break; ! ! case 544: #line 2435 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ;} ! break; ! ! case 546: #line 2443 "objc-parse.y" ! { tree parm; if (pedantic) pedwarn ("ISO C forbids forward parameter declarations"); /* Mark the forward decls as such. */ for (parm = getdecls (); parm; parm = TREE_CHAIN (parm)) TREE_ASM_WRITTEN (parm) = 1; ! clear_parm_order (); ;} ! break; ! ! case 547: #line 2451 "objc-parse.y" ! { /* Dummy action so attributes are in known place ! on parser stack. */ ;} ! break; ! ! case 548: #line 2454 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 549: #line 2456 "objc-parse.y" ! { yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;} ! break; ! ! case 550: #line 2462 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); ;} ! break; ! ! case 551: #line 2464 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); /* Gcc used to allow this as an extension. However, it does not work for all targets, and thus has been disabled. Also, since func (...) and func () are indistinguishable, *************** case 550: *** 5044,5149 **** tries to verify that BUILT_IN_NEXT_ARG is being used correctly. */ error ("ISO C requires a named argument before `...'"); ! ; ! break;} ! case 551: #line 2474 "objc-parse.y" ! { yyval.ttype = get_parm_info (1); ; ! break;} ! case 552: #line 2476 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); ; ! break;} ! case 553: #line 2481 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 554: #line 2483 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 555: #line 2490 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 556: #line 2495 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 557: #line 2500 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 558: #line 2503 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 559: #line 2509 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 560: #line 2517 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 561: #line 2522 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 562: #line 2527 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 563: #line 2530 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ; ! break;} ! case 564: #line 2536 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 565: #line 2542 "objc-parse.y" ! { prefix_attributes = chainon (prefix_attributes, yyvsp[-3].ttype); ! all_prefix_attributes = prefix_attributes; ; ! break;} ! case 566: #line 2551 "objc-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (1); ; ! break;} ! case 567: #line 2555 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ; ! break;} ! case 569: #line 2563 "objc-parse.y" ! { tree t; for (t = yyvsp[-1].ttype; t; t = TREE_CHAIN (t)) if (TREE_VALUE (t) == NULL_TREE) error ("`...' in old-style identifier list"); --- 5719,5842 ---- tries to verify that BUILT_IN_NEXT_ARG is being used correctly. */ error ("ISO C requires a named argument before `...'"); ! ;} ! break; ! ! case 552: #line 2474 "objc-parse.y" ! { yyval.ttype = get_parm_info (1); ;} ! break; ! ! case 553: #line 2476 "objc-parse.y" ! { yyval.ttype = get_parm_info (0); ;} ! break; ! ! case 554: #line 2481 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 555: #line 2483 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 556: #line 2490 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 557: #line 2495 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 558: #line 2500 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 559: #line 2503 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 560: #line 2509 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 561: #line 2517 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 562: #line 2522 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 563: #line 2527 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 564: #line 2530 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), chainon (yyvsp[0].ttype, all_prefix_attributes)); ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 565: #line 2536 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 566: #line 2542 "objc-parse.y" ! { prefix_attributes = chainon (prefix_attributes, yyvsp[-3].ttype); ! all_prefix_attributes = prefix_attributes; ;} ! break; ! ! case 567: #line 2551 "objc-parse.y" ! { pushlevel (0); clear_parm_order (); ! declare_parm_level (1); ;} ! break; ! ! case 568: #line 2555 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; parmlist_tags_warning (); ! poplevel (0, 0, 0); ;} ! break; ! ! case 570: #line 2563 "objc-parse.y" ! { tree t; for (t = yyvsp[-1].ttype; t; t = TREE_CHAIN (t)) if (TREE_VALUE (t) == NULL_TREE) error ("`...' in old-style identifier list"); *************** case 569: *** 5155,5188 **** || TREE_PURPOSE (yyval.ttype) == 0 || TREE_CODE (TREE_PURPOSE (yyval.ttype)) != PARM_DECL)) YYERROR1; ! ; ! break;} ! case 570: #line 2581 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 571: #line 2583 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 572: #line 2589 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 573: #line 2591 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 574: #line 2596 "objc-parse.y" ! { yyval.ttype = SAVE_WARN_FLAGS(); pedantic = 0; warn_pointer_arith = 0; ! warn_traditional = 0; ; ! break;} ! case 580: #line 2611 "objc-parse.y" ! { if (objc_implementation_context) { finish_class (objc_implementation_context); --- 5848,5887 ---- || TREE_PURPOSE (yyval.ttype) == 0 || TREE_CODE (TREE_PURPOSE (yyval.ttype)) != PARM_DECL)) YYERROR1; ! ;} ! break; ! ! case 571: #line 2581 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 572: #line 2583 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 573: #line 2589 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 574: #line 2591 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 575: #line 2596 "objc-parse.y" ! { yyval.ttype = SAVE_WARN_FLAGS(); pedantic = 0; warn_pointer_arith = 0; ! warn_traditional = 0; ;} ! break; ! ! case 581: #line 2611 "objc-parse.y" ! { if (objc_implementation_context) { finish_class (objc_implementation_context); *************** case 580: *** 5191,5761 **** } else warning ("`@end' must appear in an implementation context"); ! ; ! break;} ! case 581: #line 2626 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ; ! break;} ! case 582: #line 2628 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ; ! break;} ! case 583: #line 2633 "objc-parse.y" ! { objc_declare_class (yyvsp[-1].ttype); ! ; ! break;} ! case 584: #line 2640 "objc-parse.y" ! { objc_declare_alias (yyvsp[-2].ttype, yyvsp[-1].ttype); ! ; ! break;} ! case 585: #line 2647 "objc-parse.y" ! { objc_interface_context = objc_ivar_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-2].ttype, NULL_TREE, yyvsp[-1].ttype); objc_public_flag = 0; ! ; ! break;} ! case 586: #line 2653 "objc-parse.y" ! { continue_class (objc_interface_context); ! ; ! break;} ! case 587: #line 2658 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 588: #line 2664 "objc-parse.y" ! { objc_interface_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-1].ttype, NULL_TREE, yyvsp[0].ttype); continue_class (objc_interface_context); ! ; ! break;} ! case 589: #line 2671 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 590: #line 2677 "objc-parse.y" ! { objc_interface_context = objc_ivar_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); objc_public_flag = 0; ! ; ! break;} ! case 591: #line 2683 "objc-parse.y" ! { continue_class (objc_interface_context); ! ; ! break;} ! case 592: #line 2688 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 593: #line 2694 "objc-parse.y" ! { objc_interface_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); continue_class (objc_interface_context); ! ; ! break;} ! case 594: #line 2701 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 595: #line 2707 "objc-parse.y" ! { objc_implementation_context = objc_ivar_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-1].ttype, NULL_TREE, NULL_TREE); objc_public_flag = 0; ! ; ! break;} ! case 596: #line 2713 "objc-parse.y" ! { objc_ivar_chain = continue_class (objc_implementation_context); ! ; ! break;} ! case 597: #line 2719 "objc-parse.y" ! { objc_implementation_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[0].ttype, NULL_TREE, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ; ! break;} ! case 598: #line 2727 "objc-parse.y" ! { objc_implementation_context = objc_ivar_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, NULL_TREE); objc_public_flag = 0; ! ; ! break;} ! case 599: #line 2733 "objc-parse.y" ! { objc_ivar_chain = continue_class (objc_implementation_context); ! ; ! break;} ! case 600: #line 2739 "objc-parse.y" ! { objc_implementation_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ; ! break;} ! case 601: #line 2747 "objc-parse.y" ! { objc_interface_context = start_class (CATEGORY_INTERFACE_TYPE, yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); continue_class (objc_interface_context); ! ; ! break;} ! case 602: #line 2754 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 603: #line 2760 "objc-parse.y" ! { objc_implementation_context = start_class (CATEGORY_IMPLEMENTATION_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ; ! break;} ! case 604: #line 2770 "objc-parse.y" ! { objc_pq_context = 1; objc_interface_context = start_protocol(PROTOCOL_INTERFACE_TYPE, yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 605: #line 2776 "objc-parse.y" ! { objc_pq_context = 0; finish_protocol(objc_interface_context); objc_interface_context = NULL_TREE; ! ; ! break;} ! case 606: #line 2785 "objc-parse.y" ! { objc_declare_protocols (yyvsp[-1].ttype); ! ; ! break;} ! case 607: #line 2792 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ; ! break;} ! case 609: #line 2800 "objc-parse.y" ! { if (yyvsp[-2].code == LT_EXPR && yyvsp[0].code == GT_EXPR) yyval.ttype = yyvsp[-1].ttype; else YYERROR1; ! ; ! break;} ! case 612: #line 2814 "objc-parse.y" ! { objc_public_flag = 2; ; ! break;} ! case 613: #line 2815 "objc-parse.y" ! { objc_public_flag = 0; ; ! break;} ! case 614: #line 2816 "objc-parse.y" ! { objc_public_flag = 1; ; ! break;} ! case 615: #line 2821 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ; ! break;} ! case 617: #line 2826 "objc-parse.y" ! { if (pedantic) pedwarn ("extra semicolon in struct or union specified"); ! ; ! break;} ! case 618: #line 2844 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 619: #line 2847 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ; ! break;} ! case 620: #line 2850 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 621: #line 2855 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ; ! break;} ! case 624: #line 2862 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, yyvsp[0].ttype, current_declspecs, NULL_TREE); ! ; ! break;} ! case 625: #line 2869 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, yyvsp[-2].ttype, current_declspecs, yyvsp[0].ttype); ! ; ! break;} ! case 626: #line 2875 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, NULL_TREE, current_declspecs, yyvsp[0].ttype); ! ; ! break;} ! case 627: #line 2885 "objc-parse.y" ! { objc_inherit_code = CLASS_METHOD_DECL; ; ! break;} ! case 628: #line 2887 "objc-parse.y" ! { objc_inherit_code = INSTANCE_METHOD_DECL; ; ! break;} ! case 629: #line 2892 "objc-parse.y" ! { objc_pq_context = 1; if (!objc_implementation_context) fatal_error ("method definition not in class context"); ! ; ! break;} ! case 630: #line 2898 "objc-parse.y" ! { objc_pq_context = 0; if (objc_inherit_code == CLASS_METHOD_DECL) add_class_method (objc_implementation_context, yyvsp[0].ttype); else add_instance_method (objc_implementation_context, yyvsp[0].ttype); start_method_def (yyvsp[0].ttype); ! ; ! break;} ! case 631: #line 2907 "objc-parse.y" ! { continue_method_def (); ! ; ! break;} ! case 632: #line 2911 "objc-parse.y" ! { finish_method_def (); ! ; ! break;} ! case 634: #line 2922 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ; ! break;} ! case 639: #line 2929 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ; ! break;} ! case 643: #line 2939 "objc-parse.y" ! { /* Remember protocol qualifiers in prototypes. */ objc_pq_context = 1; ! ; ! break;} ! case 644: #line 2944 "objc-parse.y" ! { /* Forget protocol qualifiers here. */ objc_pq_context = 0; if (objc_inherit_code == CLASS_METHOD_DECL) add_class_method (objc_interface_context, yyvsp[0].ttype); else add_instance_method (objc_interface_context, yyvsp[0].ttype); ! ; ! break;} ! case 646: #line 2957 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 647: #line 2962 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! ; ! break;} ! case 648: #line 2967 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 649: #line 2972 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 658: #line 3002 "objc-parse.y" ! { POP_DECLSPEC_STACK; ; ! break;} ! case 659: #line 3004 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ; ! break;} ! case 660: #line 3006 "objc-parse.y" ! { pedwarn ("empty declaration"); ; ! break;} ! case 661: #line 3011 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 662: #line 3013 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ; ! break;} ! case 663: #line 3021 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ; ! break;} ! case 664: #line 3025 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ; ! break;} ! case 665: #line 3029 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ; ! break;} ! case 666: #line 3034 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ; ! break;} ! case 667: #line 3038 "objc-parse.y" ! { /* oh what a kludge! */ yyval.ttype = objc_ellipsis_node; ! ; ! break;} ! case 668: #line 3043 "objc-parse.y" ! { pushlevel (0); ! ; ! break;} ! case 669: #line 3047 "objc-parse.y" ! { /* returns a tree list node generated by get_parm_info */ yyval.ttype = yyvsp[0].ttype; poplevel (0, 0, 0); ! ; ! break;} ! case 672: #line 3062 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 699: #line 3084 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (yyvsp[-5].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 700: #line 3089 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (yyvsp[-2].ttype, NULL_TREE, yyvsp[0].ttype); ! ; ! break;} ! case 701: #line 3094 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (NULL_TREE, yyvsp[-2].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 702: #line 3099 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (NULL_TREE, NULL_TREE, yyvsp[0].ttype); ! ; ! break;} ! case 706: #line 3112 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 707: #line 3120 "objc-parse.y" ! { if (TREE_CHAIN (yyvsp[0].ttype) == NULL_TREE) /* just return the expr., remove a level of indirection */ yyval.ttype = TREE_VALUE (yyvsp[0].ttype); else /* we have a comma expr., we will collapse later */ yyval.ttype = yyvsp[0].ttype; ! ; ! break;} ! case 708: #line 3132 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-2].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 709: #line 3136 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ! ; ! break;} ! case 711: #line 3144 "objc-parse.y" ! { yyval.ttype = get_class_reference (yyvsp[0].ttype); ! ; ! break;} ! case 712: #line 3151 "objc-parse.y" ! { objc_receiver_context = 1; ; ! break;} ! case 713: #line 3153 "objc-parse.y" ! { objc_receiver_context = 0; ; ! break;} ! case 714: #line 3155 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ! ; ! break;} ! case 718: #line 3168 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ; ! break;} ! case 719: #line 3175 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, NULL_TREE); ! ; ! break;} ! case 720: #line 3179 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, NULL_TREE); ! ; ! break;} ! case 721: #line 3186 "objc-parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ! ; ! break;} ! case 722: #line 3193 "objc-parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ! ; ! break;} ! case 723: #line 3202 "objc-parse.y" ! { yyval.ttype = groktypename (yyvsp[-1].ttype); ! ; ! break;} ! } - #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 5890,6534 ---- } else warning ("`@end' must appear in an implementation context"); ! ;} ! break; ! ! case 582: #line 2626 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;} ! break; ! ! case 583: #line 2628 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;} ! break; ! ! case 584: #line 2633 "objc-parse.y" ! { objc_declare_class (yyvsp[-1].ttype); ! ;} ! break; ! ! case 585: #line 2640 "objc-parse.y" ! { objc_declare_alias (yyvsp[-2].ttype, yyvsp[-1].ttype); ! ;} ! break; ! ! case 586: #line 2647 "objc-parse.y" ! { objc_interface_context = objc_ivar_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-2].ttype, NULL_TREE, yyvsp[-1].ttype); objc_public_flag = 0; ! ;} ! break; ! ! case 587: #line 2653 "objc-parse.y" ! { continue_class (objc_interface_context); ! ;} ! break; ! ! case 588: #line 2658 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 589: #line 2664 "objc-parse.y" ! { objc_interface_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-1].ttype, NULL_TREE, yyvsp[0].ttype); continue_class (objc_interface_context); ! ;} ! break; ! ! case 590: #line 2671 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 591: #line 2677 "objc-parse.y" ! { objc_interface_context = objc_ivar_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[-1].ttype); objc_public_flag = 0; ! ;} ! break; ! ! case 592: #line 2683 "objc-parse.y" ! { continue_class (objc_interface_context); ! ;} ! break; ! ! case 593: #line 2688 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 594: #line 2694 "objc-parse.y" ! { objc_interface_context = start_class (CLASS_INTERFACE_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); continue_class (objc_interface_context); ! ;} ! break; ! ! case 595: #line 2701 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 596: #line 2707 "objc-parse.y" ! { objc_implementation_context = objc_ivar_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-1].ttype, NULL_TREE, NULL_TREE); objc_public_flag = 0; ! ;} ! break; ! ! case 597: #line 2713 "objc-parse.y" ! { objc_ivar_chain = continue_class (objc_implementation_context); ! ;} ! break; ! ! case 598: #line 2719 "objc-parse.y" ! { objc_implementation_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[0].ttype, NULL_TREE, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ;} ! break; ! ! case 599: #line 2727 "objc-parse.y" ! { objc_implementation_context = objc_ivar_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, NULL_TREE); objc_public_flag = 0; ! ;} ! break; ! ! case 600: #line 2733 "objc-parse.y" ! { objc_ivar_chain = continue_class (objc_implementation_context); ! ;} ! break; ! ! case 601: #line 2739 "objc-parse.y" ! { objc_implementation_context = start_class (CLASS_IMPLEMENTATION_TYPE, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ;} ! break; ! ! case 602: #line 2747 "objc-parse.y" ! { objc_interface_context = start_class (CATEGORY_INTERFACE_TYPE, yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); continue_class (objc_interface_context); ! ;} ! break; ! ! case 603: #line 2754 "objc-parse.y" ! { finish_class (objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 604: #line 2760 "objc-parse.y" ! { objc_implementation_context = start_class (CATEGORY_IMPLEMENTATION_TYPE, yyvsp[-3].ttype, yyvsp[-1].ttype, NULL_TREE); objc_ivar_chain = continue_class (objc_implementation_context); ! ;} ! break; ! ! case 605: #line 2770 "objc-parse.y" ! { objc_pq_context = 1; objc_interface_context = start_protocol(PROTOCOL_INTERFACE_TYPE, yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 606: #line 2776 "objc-parse.y" ! { objc_pq_context = 0; finish_protocol(objc_interface_context); objc_interface_context = NULL_TREE; ! ;} ! break; ! ! case 607: #line 2785 "objc-parse.y" ! { objc_declare_protocols (yyvsp[-1].ttype); ! ;} ! break; ! ! case 608: #line 2792 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 610: #line 2800 "objc-parse.y" ! { if (yyvsp[-2].code == LT_EXPR && yyvsp[0].code == GT_EXPR) yyval.ttype = yyvsp[-1].ttype; else YYERROR1; ! ;} ! break; ! ! case 613: #line 2814 "objc-parse.y" ! { objc_public_flag = 2; ;} ! break; ! ! case 614: #line 2815 "objc-parse.y" ! { objc_public_flag = 0; ;} ! break; ! ! case 615: #line 2816 "objc-parse.y" ! { objc_public_flag = 1; ;} ! break; ! ! case 616: #line 2821 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 618: #line 2826 "objc-parse.y" ! { if (pedantic) pedwarn ("extra semicolon in struct or union specified"); ! ;} ! break; ! ! case 619: #line 2844 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 620: #line 2847 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ! POP_DECLSPEC_STACK; ;} ! break; ! ! case 621: #line 2850 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 622: #line 2855 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ;} ! break; ! ! case 625: #line 2862 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, yyvsp[0].ttype, current_declspecs, NULL_TREE); ! ;} ! break; ! ! case 626: #line 2869 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, yyvsp[-2].ttype, current_declspecs, yyvsp[0].ttype); ! ;} ! break; ! ! case 627: #line 2875 "objc-parse.y" ! { yyval.ttype = add_instance_variable (objc_ivar_context, objc_public_flag, NULL_TREE, current_declspecs, yyvsp[0].ttype); ! ;} ! break; ! ! case 628: #line 2885 "objc-parse.y" ! { objc_inherit_code = CLASS_METHOD_DECL; ;} ! break; ! ! case 629: #line 2887 "objc-parse.y" ! { objc_inherit_code = INSTANCE_METHOD_DECL; ;} ! break; ! ! case 630: #line 2892 "objc-parse.y" ! { objc_pq_context = 1; if (!objc_implementation_context) fatal_error ("method definition not in class context"); ! ;} ! break; ! ! case 631: #line 2898 "objc-parse.y" ! { objc_pq_context = 0; if (objc_inherit_code == CLASS_METHOD_DECL) add_class_method (objc_implementation_context, yyvsp[0].ttype); else add_instance_method (objc_implementation_context, yyvsp[0].ttype); start_method_def (yyvsp[0].ttype); ! ;} ! break; ! ! case 632: #line 2907 "objc-parse.y" ! { continue_method_def (); ! ;} ! break; ! ! case 633: #line 2911 "objc-parse.y" ! { finish_method_def (); ! ;} ! break; ! ! case 635: #line 2922 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ;} ! break; ! ! case 640: #line 2929 "objc-parse.y" ! {yyval.ttype = NULL_TREE; ;} ! break; ! ! case 644: #line 2939 "objc-parse.y" ! { /* Remember protocol qualifiers in prototypes. */ objc_pq_context = 1; ! ;} ! break; ! ! case 645: #line 2944 "objc-parse.y" ! { /* Forget protocol qualifiers here. */ objc_pq_context = 0; if (objc_inherit_code == CLASS_METHOD_DECL) add_class_method (objc_interface_context, yyvsp[0].ttype); else add_instance_method (objc_interface_context, yyvsp[0].ttype); ! ;} ! break; ! ! case 647: #line 2957 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 648: #line 2962 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ! ;} ! break; ! ! case 649: #line 2967 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, yyvsp[-3].ttype, yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 650: #line 2972 "objc-parse.y" ! { yyval.ttype = build_method_decl (objc_inherit_code, NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 659: #line 3002 "objc-parse.y" ! { POP_DECLSPEC_STACK; ;} ! break; ! ! case 660: #line 3004 "objc-parse.y" ! { shadow_tag (yyvsp[-1].ttype); ;} ! break; ! ! case 661: #line 3006 "objc-parse.y" ! { pedwarn ("empty declaration"); ;} ! break; ! ! case 662: #line 3011 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 663: #line 3013 "objc-parse.y" ! { push_parm_decl (yyvsp[0].ttype); ;} ! break; ! ! case 664: #line 3021 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ;} ! break; ! ! case 665: #line 3025 "objc-parse.y" ! { yyval.ttype = build_tree_list (build_tree_list (current_declspecs, yyvsp[-1].ttype), ! chainon (yyvsp[0].ttype, all_prefix_attributes)); ;} ! break; ! ! case 666: #line 3029 "objc-parse.y" ! { yyval.ttype = yyvsp[0].ttype; ;} ! break; ! ! case 667: #line 3034 "objc-parse.y" ! { yyval.ttype = NULL_TREE; ! ;} ! break; ! ! case 668: #line 3038 "objc-parse.y" ! { /* oh what a kludge! */ yyval.ttype = objc_ellipsis_node; ! ;} ! break; ! ! case 669: #line 3043 "objc-parse.y" ! { pushlevel (0); ! ;} ! break; ! ! case 670: #line 3047 "objc-parse.y" ! { /* returns a tree list node generated by get_parm_info */ yyval.ttype = yyvsp[0].ttype; poplevel (0, 0, 0); ! ;} ! break; ! ! case 673: #line 3062 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 700: #line 3084 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (yyvsp[-5].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 701: #line 3089 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (yyvsp[-2].ttype, NULL_TREE, yyvsp[0].ttype); ! ;} ! break; ! ! case 702: #line 3094 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (NULL_TREE, yyvsp[-2].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 703: #line 3099 "objc-parse.y" ! { yyval.ttype = build_keyword_decl (NULL_TREE, NULL_TREE, yyvsp[0].ttype); ! ;} ! break; ! ! case 707: #line 3112 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 708: #line 3120 "objc-parse.y" ! { if (TREE_CHAIN (yyvsp[0].ttype) == NULL_TREE) /* just return the expr., remove a level of indirection */ yyval.ttype = TREE_VALUE (yyvsp[0].ttype); else /* we have a comma expr., we will collapse later */ yyval.ttype = yyvsp[0].ttype; ! ;} ! break; ! ! case 709: #line 3132 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-2].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 710: #line 3136 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ! ;} ! break; ! ! case 712: #line 3144 "objc-parse.y" ! { yyval.ttype = get_class_reference (yyvsp[0].ttype); ! ;} ! break; ! ! case 713: #line 3151 "objc-parse.y" ! { objc_receiver_context = 1; ;} ! break; ! ! case 714: #line 3153 "objc-parse.y" ! { objc_receiver_context = 0; ;} ! break; ! ! case 715: #line 3155 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ! ;} ! break; ! ! case 719: #line 3168 "objc-parse.y" ! { yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ! ;} ! break; ! ! case 720: #line 3175 "objc-parse.y" ! { yyval.ttype = build_tree_list (yyvsp[-1].ttype, NULL_TREE); ! ;} ! break; ! ! case 721: #line 3179 "objc-parse.y" ! { yyval.ttype = build_tree_list (NULL_TREE, NULL_TREE); ! ;} ! break; ! ! case 722: #line 3186 "objc-parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ! ;} ! break; ! ! case 723: #line 3193 "objc-parse.y" ! { yyval.ttype = yyvsp[-1].ttype; ! ;} ! break; ! ! case 724: #line 3202 "objc-parse.y" ! { yyval.ttype = groktypename (yyvsp[-1].ttype); ! ;} ! break; + } + + /* Line 991 of yacc.c. */ + #line 6522 "op2534.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 723: *** 5763,5773 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 6536,6546 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 5780,5792 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 6553,6565 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 5795,5809 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 6568,6582 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 5811,5817 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 6584,6590 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 5823,5924 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 6596,6687 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 5926,5934 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 6689,6695 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 5948,5960 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 6709,6723 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 5963,5968 **** --- 6726,6733 ---- #endif return yyresult; } + + #line 3207 "objc-parse.y" *************** make_pointer_declarator (type_quals_attr *** 6581,6583 **** --- 7346,7350 ---- itarget = tree_cons (attrs, target, NULL_TREE); return build1 (INDIRECT_REF, quals, itarget); } + + diff -Nrc3pad gcc-3.2.2/gcc/po/ChangeLog gcc-3.2.3/gcc/po/ChangeLog *** gcc-3.2.2/gcc/po/ChangeLog Wed Feb 5 03:00:22 2003 --- gcc-3.2.3/gcc/po/ChangeLog Tue Apr 22 06:15:11 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/predict.c gcc-3.2.3/gcc/predict.c *** gcc-3.2.2/gcc/predict.c Thu Apr 4 21:37:47 2002 --- gcc-3.2.3/gcc/predict.c Thu Feb 20 20:10:57 2003 *************** dump_prediction (predictor, probability, *** 194,200 **** if (!rtl_dump_file) return; ! while (e->flags & EDGE_FALLTHRU) e = e->succ_next; fprintf (rtl_dump_file, " %s heuristics%s: %.1f%%", --- 194,200 ---- if (!rtl_dump_file) return; ! while (e && (e->flags & EDGE_FALLTHRU)) e = e->succ_next; fprintf (rtl_dump_file, " %s heuristics%s: %.1f%%", *************** dump_prediction (predictor, probability, *** 205,213 **** { fprintf (rtl_dump_file, " exec "); fprintf (rtl_dump_file, HOST_WIDEST_INT_PRINT_DEC, bb->count); ! fprintf (rtl_dump_file, " hit "); ! fprintf (rtl_dump_file, HOST_WIDEST_INT_PRINT_DEC, e->count); ! fprintf (rtl_dump_file, " (%.1f%%)", e->count * 100.0 / bb->count); } fprintf (rtl_dump_file, "\n"); --- 205,216 ---- { fprintf (rtl_dump_file, " exec "); fprintf (rtl_dump_file, HOST_WIDEST_INT_PRINT_DEC, bb->count); ! if (e) ! { ! fprintf (rtl_dump_file, " hit "); ! fprintf (rtl_dump_file, HOST_WIDEST_INT_PRINT_DEC, e->count); ! fprintf (rtl_dump_file, " (%.1f%%)", e->count * 100.0 / bb->count); ! } } fprintf (rtl_dump_file, "\n"); diff -Nrc3pad gcc-3.2.2/gcc/real.c gcc-3.2.3/gcc/real.c *** gcc-3.2.2/gcc/real.c Tue Jan 15 13:37:58 2002 --- gcc-3.2.3/gcc/real.c Tue Feb 18 23:43:54 2003 *************** read_expnt: *** 5417,5423 **** if (lexp > 0x7fff) goto infinite; if (lexp < 0) ! goto zero; yy[E] = lexp; goto expdon; } --- 5417,5428 ---- if (lexp > 0x7fff) goto infinite; if (lexp < 0) ! { ! if (lexp < -NBITS) ! goto zero; ! lost |= eshift (yy, lexp); ! lexp = 0; ! } yy[E] = lexp; goto expdon; } diff -Nrc3pad gcc-3.2.2/gcc/regmove.c gcc-3.2.3/gcc/regmove.c *** gcc-3.2.2/gcc/regmove.c Tue Jul 16 05:43:36 2002 --- gcc-3.2.3/gcc/regmove.c Sun Feb 23 17:06:26 2003 *************** optimize_reg_copy_1 (insn, dest, src) *** 431,436 **** --- 431,446 ---- continue; if (reg_set_p (src, p) || reg_set_p (dest, p) + /* If SRC is an asm-declared register, it must not be replaced + in any asm. Unfortunately, the REG_EXPR tree for the asm + variable may be absent in the SRC rtx, so we can't check the + actual register declaration easily (the asm operand will have + it, though). To avoid complicating the test for a rare case, + we just don't perform register replacement for a hard reg + mentioned in an asm. */ + || (sregno < FIRST_PSEUDO_REGISTER + && asm_noperands (PATTERN (p)) >= 0 + && reg_overlap_mentioned_p (src, PATTERN (p))) /* Don't change a USE of a register. */ || (GET_CODE (PATTERN (p)) == USE && reg_overlap_mentioned_p (src, XEXP (PATTERN (p), 0)))) diff -Nrc3pad gcc-3.2.2/gcc/reload.c gcc-3.2.3/gcc/reload.c *** gcc-3.2.2/gcc/reload.c Thu Oct 24 08:59:49 2002 --- gcc-3.2.3/gcc/reload.c Sat Mar 29 19:30:39 2003 *************** static int alternative_allows_memconst P *** 257,262 **** --- 257,263 ---- static rtx find_reloads_toplev PARAMS ((rtx, int, enum reload_type, int, int, rtx, int *)); static rtx make_memloc PARAMS ((rtx, int)); + static int maybe_memory_address_p PARAMS ((enum machine_mode, rtx, rtx *)); static int find_reloads_address PARAMS ((enum machine_mode, rtx *, rtx, rtx *, int, enum reload_type, int, rtx)); static rtx subst_reg_equivs PARAMS ((rtx, rtx)); *************** make_memloc (ad, regno) *** 4545,4550 **** --- 4546,4572 ---- return tem; } + /* Returns true if AD could be turned into a valid memory reference + to mode MODE by reloading the part pointed to by PART into a + register. */ + + static int + maybe_memory_address_p (mode, ad, part) + enum machine_mode mode; + rtx ad; + rtx *part; + { + int retv; + rtx tem = *part; + rtx reg = gen_rtx_REG (GET_MODE (tem), max_reg_num ()); + + *part = reg; + retv = memory_address_p (mode, ad); + *part = tem; + + return retv; + } + /* Record all reloads needed for handling memory address AD which appears in *LOC in a memory reference to mode MODE which itself is found in location *MEMREFLOC. *************** find_reloads_address (mode, memrefloc, a *** 4825,4850 **** that the index needs a reload and find_reloads_address_1 will take care of it. ! If we decide to do something here, it must be that ! `double_reg_address_ok' is true and that this address rtl was made by ! eliminate_regs. We generate a reload of the fp/sp/ap + constant and rework the sum so that the reload register will be added to the index. This is safe because we know the address isn't shared. ! We check for fp/ap/sp as both the first and second operand of the ! innermost PLUS. */ else if (GET_CODE (ad) == PLUS && GET_CODE (XEXP (ad, 1)) == CONST_INT && GET_CODE (XEXP (ad, 0)) == PLUS ! && (XEXP (XEXP (ad, 0), 0) == frame_pointer_rtx ! #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM ! || XEXP (XEXP (ad, 0), 0) == hard_frame_pointer_rtx ! #endif ! #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM ! || XEXP (XEXP (ad, 0), 0) == arg_pointer_rtx ! #endif ! || XEXP (XEXP (ad, 0), 0) == stack_pointer_rtx) ! && ! memory_address_p (mode, ad)) { *loc = ad = gen_rtx_PLUS (GET_MODE (ad), plus_constant (XEXP (XEXP (ad, 0), 0), --- 4847,4870 ---- that the index needs a reload and find_reloads_address_1 will take care of it. ! Handle all base registers here, not just fp/ap/sp, because on some ! targets (namely Sparc) we can also get invalid addresses from preventive ! subreg big-endian corrections made by find_reloads_toplev. ! ! If we decide to do something, it must be that `double_reg_address_ok' ! is true. We generate a reload of the base register + constant and rework the sum so that the reload register will be added to the index. This is safe because we know the address isn't shared. ! We check for the base register as both the first and second operand of ! the innermost PLUS. */ else if (GET_CODE (ad) == PLUS && GET_CODE (XEXP (ad, 1)) == CONST_INT && GET_CODE (XEXP (ad, 0)) == PLUS ! && GET_CODE (XEXP (XEXP (ad, 0), 0)) == REG ! && REGNO (XEXP (XEXP (ad, 0), 0)) < FIRST_PSEUDO_REGISTER ! && REG_MODE_OK_FOR_BASE_P (XEXP (XEXP (ad, 0), 0), mode) ! && ! maybe_memory_address_p (mode, ad, &XEXP (XEXP (ad, 0), 1))) { *loc = ad = gen_rtx_PLUS (GET_MODE (ad), plus_constant (XEXP (XEXP (ad, 0), 0), *************** find_reloads_address (mode, memrefloc, a *** 4861,4875 **** else if (GET_CODE (ad) == PLUS && GET_CODE (XEXP (ad, 1)) == CONST_INT && GET_CODE (XEXP (ad, 0)) == PLUS ! && (XEXP (XEXP (ad, 0), 1) == frame_pointer_rtx ! #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM ! || XEXP (XEXP (ad, 0), 1) == hard_frame_pointer_rtx ! #endif ! #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM ! || XEXP (XEXP (ad, 0), 1) == arg_pointer_rtx ! #endif ! || XEXP (XEXP (ad, 0), 1) == stack_pointer_rtx) ! && ! memory_address_p (mode, ad)) { *loc = ad = gen_rtx_PLUS (GET_MODE (ad), XEXP (XEXP (ad, 0), 0), --- 4881,4890 ---- else if (GET_CODE (ad) == PLUS && GET_CODE (XEXP (ad, 1)) == CONST_INT && GET_CODE (XEXP (ad, 0)) == PLUS ! && GET_CODE (XEXP (XEXP (ad, 0), 1)) == REG ! && REGNO (XEXP (XEXP (ad, 0), 1)) < FIRST_PSEUDO_REGISTER ! && REG_MODE_OK_FOR_BASE_P (XEXP (XEXP (ad, 0), 1), mode) ! && ! maybe_memory_address_p (mode, ad, &XEXP (XEXP (ad, 0), 0))) { *loc = ad = gen_rtx_PLUS (GET_MODE (ad), XEXP (XEXP (ad, 0), 0), diff -Nrc3pad gcc-3.2.2/gcc/reload1.c gcc-3.2.3/gcc/reload1.c *** gcc-3.2.2/gcc/reload1.c Thu Oct 10 15:40:20 2002 --- gcc-3.2.3/gcc/reload1.c Fri Mar 28 23:23:16 2003 *************** *** 1,6 **** /* Reload pseudo regs into hard regs for insns that require hard regs. Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. --- 1,6 ---- /* Reload pseudo regs into hard regs for insns that require hard regs. Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. This file is part of GCC. *************** reload_as_needed (live_known) *** 3926,3931 **** --- 3926,3932 ---- if (asm_noperands (PATTERN (insn)) >= 0) for (p = NEXT_INSN (prev); p != next; p = NEXT_INSN (p)) if (p != insn && INSN_P (p) + && GET_CODE (PATTERN (p)) != USE && (recog_memoized (p) < 0 || (extract_insn (p), ! constrain_operands (1)))) { *************** reload_cse_simplify_set (set, insn) *** 8277,8283 **** { #ifdef LOAD_EXTEND_OP if (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) < BITS_PER_WORD ! && extend_op != NIL) { rtx wide_dest = gen_rtx_REG (word_mode, REGNO (SET_DEST (set))); ORIGINAL_REGNO (wide_dest) = ORIGINAL_REGNO (SET_DEST (set)); --- 8278,8291 ---- { #ifdef LOAD_EXTEND_OP if (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) < BITS_PER_WORD ! && extend_op != NIL ! #ifdef CLASS_CANNOT_CHANGE_MODE ! && !(REGNO_REG_CLASS (REGNO (SET_DEST (set))) ! == CLASS_CANNOT_CHANGE_MODE ! && CLASS_CANNOT_CHANGE_MODE_P (GET_MODE (SET_DEST (set)), ! word_mode)) ! #endif ! ) { rtx wide_dest = gen_rtx_REG (word_mode, REGNO (SET_DEST (set))); ORIGINAL_REGNO (wide_dest) = ORIGINAL_REGNO (SET_DEST (set)); diff -Nrc3pad gcc-3.2.2/gcc/simplify-rtx.c gcc-3.2.3/gcc/simplify-rtx.c *** gcc-3.2.2/gcc/simplify-rtx.c Wed Mar 6 22:43:21 2002 --- gcc-3.2.3/gcc/simplify-rtx.c Thu Apr 10 22:17:36 2003 *************** simplify_subreg (outermode, op, innermod *** 2484,2489 **** --- 2484,2503 ---- return new; } + if (GET_MODE_CLASS (outermode) != MODE_INT + && GET_MODE_CLASS (outermode) != MODE_CC) + { + enum machine_mode new_mode = int_mode_for_mode (outermode); + + if (new_mode != innermode || byte != 0) + { + op = simplify_subreg (new_mode, op, innermode, byte); + if (! op) + return NULL_RTX; + return simplify_subreg (outermode, op, new_mode, 0); + } + } + offset = byte * BITS_PER_UNIT; switch (GET_CODE (op)) { diff -Nrc3pad gcc-3.2.2/gcc/stmt.c gcc-3.2.3/gcc/stmt.c *** gcc-3.2.2/gcc/stmt.c Thu Jan 9 13:18:42 2003 --- gcc-3.2.3/gcc/stmt.c Mon Mar 24 04:02:23 2003 *************** expand_decl_init (decl) *** 4062,4067 **** --- 4062,4069 ---- /* Compute and store the initial value now. */ + push_temp_slots (); + if (DECL_INITIAL (decl) == error_mark_node) { enum tree_code code = TREE_CODE (TREE_TYPE (decl)); *************** expand_decl_init (decl) *** 4085,4090 **** --- 4087,4093 ---- /* Free any temporaries we made while initializing the decl. */ preserve_temp_slots (NULL_RTX); free_temp_slots (); + pop_temp_slots (); } /* CLEANUP is an expression to be executed at exit from this binding contour; *************** expand_start_case (exit_flag, expr, type *** 4464,4469 **** --- 4467,4473 ---- nesting_stack = thiscase; do_pending_stack_adjust (); + emit_queue (); /* Make sure case_stmt.start points to something that won't need any transformation before expand_end_case. */ diff -Nrc3pad gcc-3.2.2/gcc/system.h gcc-3.2.3/gcc/system.h *** gcc-3.2.2/gcc/system.h Tue May 21 23:44:39 2002 --- gcc-3.2.3/gcc/system.h Mon Mar 31 01:14:02 2003 *************** Software Foundation, 59 Temple Place - S *** 26,32 **** /* This is the location of the online document giving information how to report bugs. If you change this string, also check for strings not under control of the preprocessor. */ ! #define GCCBUGURL "" /* We must include stdarg.h/varargs.h before stdio.h. */ #ifdef ANSI_PROTOTYPES --- 26,32 ---- /* This is the location of the online document giving information how to report bugs. If you change this string, also check for strings not under control of the preprocessor. */ ! #define GCCBUGURL "" /* We must include stdarg.h/varargs.h before stdio.h. */ #ifdef ANSI_PROTOTYPES *************** extern int errno; *** 265,270 **** --- 265,276 ---- #endif #ifndef WSTOPSIG #define WSTOPSIG WEXITSTATUS + #endif + #ifndef WCOREDUMP + #define WCOREDUMP(S) ((S) & WCOREFLG) + #endif + #ifndef WCOREFLG + #define WCOREFLG 0200 #endif /* The HAVE_DECL_* macros are three-state, undefined, 0 or 1. If they diff -Nrc3pad gcc-3.2.2/gcc/testsuite/ChangeLog gcc-3.2.3/gcc/testsuite/ChangeLog *** gcc-3.2.2/gcc/testsuite/ChangeLog Wed Feb 5 03:01:22 2003 --- gcc-3.2.3/gcc/testsuite/ChangeLog Tue Apr 22 06:15:15 2003 *************** *** 1,3 **** --- 1,178 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-04-16 Gabriel Dos Reis + Backport from mainline. + + 2003-03-17 Zack Weinberg + + * objc.dg/naming-1.m: Use "(parse|syntax) error". + * objc.dg/naming-2.m: Likewise. + + 2003-04-14 Hans-Peter Nilsson + + PR target/10377 + * gcc.dg/20030414-1.c: New test. + + 2003-04-12 Eric Botcazou + + * gcc.dg/ultrasp8.c: Fix for 32-bit Sparc. + + 2003-03-29 Kaveh R. Ghazi + + * gcc.c-torture/execute/20020307-2.x: New file, XFAIL mips-irix6. + + 2003-03-29 Arpad Beszedes + + PR middle-end/9967 + * gcc.c-torture/execute/stdio-opt-1.c: Adjust test for change to + builtin fputs. + + 2003-03-29 Mikulas Patocka + + * gcc.dg/20030323-1.c: New test. + + 2003-03-28 Eric Botcazou + + * gcc.dg/ultrasp8.c: New test. + + 2003-03-28 Eric Botcazou + + * gcc.dg/ultrasp7.c: New test. + + 2003-03-28 Eric Botcazou + + * gcc.dg/sparc-dwarf2.c: New test. + + 2003-03-26 Eric Botcazou + + * gcc.dg/ultrasp6.c: New test. + + 2003-03-25 Eric Botcazou + + * gcc.dg/i386-signbit-1.c: Tweak options. + * gcc.dg/i386-signbit-2.c: New test. + * gcc.dg/i386-signbit-3.c: New test. + + 2003-03-24 Jakub Jelinek + + * g++.dg/opt/rtti1.C: New test. + + 2003-03-23 Daniel Jacobowitz + + * gcc.c-torture/execute/20030224-2.c: New test. + + 2003-03-19 Eric Botcazou + + * gcc.dg/i386-signbit-1.c: New test. + + 2003-03-19 Jakub Jelinek + + * gcc.c-torture/execute/20030313-1.c: New test. + + 2003-03-19 Jakub Jelinek + + * gcc.dg/20030309-1.c: New test. + + 2003-03-16 Falk Hueffner + + * gcc.c-torture/execute/20030316-1.c: New test case. + + 2003-03-16 Kriang Lerdsuwanakij + + PR c++/6440 + * g++.dg/template/spec7.C: New test. + * g++.dg/template/spec8.C: Likewise. + + 2003-03-14 Eric Botcazou + + * gcc.c-torture/compile/20030314-1.c: New test. + + 2003-03-12 Eric Botcazou + + * gcc.dg/decl-3.c: New test. + + 2003-03-12 Eric Botcazou + + * gcc.dg/i386-loop-2.c: New test. + + 2003-03-09 Eric Botcazou + + * gcc.dg/i386-loop-1.c: New test. + + 2003-03-08 Hans-Peter Nilsson + + * gcc.dg/old-style-asm-1.c: Tweak to match mmix-knuth-mmixware. + + 2003-03-07 Eric Botcazou + + * gcc.c-torture/execute/20030307-1.c: New test. + + 2003-03-05 Eric Botcazou + + * gcc.c-torture/compile/20030305-1.c: New test. + + 2003-02-25 Franz Sirl + + PR target/9732 + * gcc.dg/20030225-1.c: New test. + + 2003-02-24 Rainer Orth + + * g++.dg/other/pragma-ep-1.C: Test for __PRAGMA_EXTERN_PREFIX. + * gcc.dg/pragma-ep-1.c: Likewise. + + 2003-02-24 Kriang Lerdsuwanakij + + PR c++/9602 + * g++.dg/template/friend16.C: New test. + + 2003-02-23 Hans-Peter Nilsson + + * gcc.dg/asmreg-1.c: New test. + + 2003-02-23 Kriang Lerdsuwanakij + + PR c++/7982 + * g++.dg/warn/implicit-typename1.C: New test. + + 2003-02-21 Glen Nakamura + + * gcc.c-torture/execute/20030221-1.c: New test. + + 2003-02-20 Randolph Chung + + * gcc.c-torture/compile/20030220-1.c: New test. + + 2003-02-19 Kriang Lerdsuwanakij + + PR c++/9459 + * g++.dg/ext/typeof4.C: New test. + + 2003-02-18 Jakub Jelinek + + * gcc.dg/20030217-1.c: New test. + + 2003-02-10 Eric Botcazou + Christian Ehrhardt + + * gcc.dg/decl-2.c: New test. + + 2003-02-06 Kaveh R. Ghazi + + * gcc.dg/20020430-1.c: Fix dg command typos. + * gcc.dg/20020503-1.c: Likewise. + + 2003-02-06 Eric Botcazou + + * gcc.c-torture/compile/20030206-1.c: New test. + + 2003-02-05 Kaveh R. Ghazi + + * gcc.c-torture/execute/20020227-1.x: Update specific XFAIL + conditions for SPARC targets. + 2003-02-05 Release Manager * GCC 3.2.2 Released. *************** Mon Mar 22 14:28:46 1993 Ian Lance Tayl *** 11900,11902 **** --- 12075,12078 ---- correspond to c-torture 1.11. * New file. + diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/ext/typeof4.C gcc-3.2.3/gcc/testsuite/g++.dg/ext/typeof4.C *** gcc-3.2.2/gcc/testsuite/g++.dg/ext/typeof4.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/ext/typeof4.C Wed Feb 19 15:28:31 2003 *************** *** 0 **** --- 1,13 ---- + // { dg-do compile } + // { dg-options "" } + + // Origin: Wolfgang Bangerth + + // PR c++/9459: typeof in return type of template function + + void foo (int) {} + void foo (double) {} + + template + typeof(foo(1)) + bar () { return foo(1); } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/opt/reload2.C gcc-3.2.3/gcc/testsuite/g++.dg/opt/reload2.C *** gcc-3.2.2/gcc/testsuite/g++.dg/opt/reload2.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/opt/reload2.C Thu Apr 10 22:17:36 2003 *************** *** 0 **** --- 1,42 ---- + // PR 10352 + // { dg-do compile } + // { dg-options -O2 } + + extern double fabs(double x); + + typedef struct { float x, y; } S; + typedef struct _T T; + + extern void fT( T *p ); + extern T *h(); + extern S g( ); + + static + int f(void) + { + T *t=0; + int c=0; + S s; + + const S exp_s = {0.,0.}; + + if(!(t = h())) + { + c++; + } + + if(!c) + { + s = g(); + if( (fabs( (s.x) - (exp_s.x) ) > 1 ) + || (fabs( (s.y) - (exp_s.y) ) > 1 ) ) + { + c++; + } + } + + if(t) + fT(t); + + return c; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/opt/rtti1.C gcc-3.2.3/gcc/testsuite/g++.dg/opt/rtti1.C *** gcc-3.2.2/gcc/testsuite/g++.dg/opt/rtti1.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/opt/rtti1.C Mon Mar 24 11:33:50 2003 *************** *** 0 **** --- 1,20 ---- + // Test that typeid sees through references even when optimizing. + // { dg-do run } + // { dg-options "-O2" } + + #include + + struct A + { + virtual ~A() { } + }; + + class B : public A { }; + + int main () + { + B b; + A &aref = b; + + return typeid (aref) != typeid (b); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/other/pragma-ep-1.C gcc-3.2.3/gcc/testsuite/g++.dg/other/pragma-ep-1.C *** gcc-3.2.2/gcc/testsuite/g++.dg/other/pragma-ep-1.C Fri Mar 22 22:49:49 2002 --- gcc-3.2.3/gcc/testsuite/g++.dg/other/pragma-ep-1.C Mon Feb 24 18:46:26 2003 *************** *** 5,11 **** /* { dg-final { scan-assembler "four" } } */ /* { dg-final { scan-assembler-not "_four" } } */ ! #ifndef __EXTERN_PREFIX #error #endif --- 5,11 ---- /* { dg-final { scan-assembler "four" } } */ /* { dg-final { scan-assembler-not "_four" } } */ ! #ifndef __PRAGMA_EXTERN_PREFIX #error #endif diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/template/friend16.C gcc-3.2.3/gcc/testsuite/g++.dg/template/friend16.C *** gcc-3.2.2/gcc/testsuite/g++.dg/template/friend16.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/template/friend16.C Mon Feb 24 15:29:29 2003 *************** *** 0 **** --- 1,16 ---- + // { dg-do compile } + + // Origin: Wolfgang Bangerth + + // PR c++/9602: Inline friend/pure virtual tree data sharing in + // class template. + + template struct X { + void foo (X); + friend void bar () {} + }; + + template + void X::foo (X x) {} + + template struct X; diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/template/spec7.C gcc-3.2.3/gcc/testsuite/g++.dg/template/spec7.C *** gcc-3.2.2/gcc/testsuite/g++.dg/template/spec7.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/template/spec7.C Sun Mar 16 14:28:43 2003 *************** *** 0 **** --- 1,27 ---- + // { dg-do compile } + + // PR c++/6440: Specialization of member class template. + + template struct A + { + template struct B {}; + }; + + template<> template + struct A::B + { + void f(); + template void g(V); + }; + + template<> template<> template void A::B::g(V) + { + } + + A::B b; + + int h() + { + b.f(); + b.g(0); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/template/spec8.C gcc-3.2.3/gcc/testsuite/g++.dg/template/spec8.C *** gcc-3.2.2/gcc/testsuite/g++.dg/template/spec8.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/template/spec8.C Sun Mar 16 14:28:43 2003 *************** *** 0 **** --- 1,11 ---- + // { dg-do compile } + + // Specialization of member class template. + + template struct A + { + template struct B {}; + }; + + template <> template <> struct A::B {}; + template <> template struct A::B {}; // { dg-error "specialization" } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.dg/warn/implicit-typename1.C gcc-3.2.3/gcc/testsuite/g++.dg/warn/implicit-typename1.C *** gcc-3.2.2/gcc/testsuite/g++.dg/warn/implicit-typename1.C Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/g++.dg/warn/implicit-typename1.C Sun Feb 23 14:49:01 2003 *************** *** 0 **** --- 1,17 ---- + // The -pedantic option must be omitted to trigger the crash. + // { dg-do compile } + // { dg-options "" } + + // PR c++/7982: Crash warning about implicit typename. + // The base class refers to another typename, while the + // name lookup finds a template. + + template struct X {}; + + template struct C { + typedef typename T::X X; + }; + + template struct A : public C { + typedef X X; // { dg-warning "lookup|dependent base|typename" } + }; diff -Nrc3pad gcc-3.2.2/gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog gcc-3.2.3/gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog *** gcc-3.2.2/gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog Wed Feb 5 03:01:25 2003 --- gcc-3.2.3/gcc/testsuite/g++.old-deja/g++.oliva/ChangeLog Tue Apr 22 06:15:19 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030206-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030206-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030206-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030206-1.c Thu Feb 6 10:59:21 2003 *************** *** 0 **** --- 1,14 ---- + /* PR c/9530 */ + /* Contributed by Volker Reichelt. */ + + /* Verify that the call to 'foo' is not turned + into a sibling call. */ + + void foo(float d); + + float bar(float d); + + float baz(float d) + { + foo(bar(d)); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030220-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030220-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030220-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030220-1.c Thu Feb 20 20:11:04 2003 *************** *** 0 **** --- 1,20 ---- + /* PR optimization/9768 */ + /* Originator: Randolph Chung */ + + inline int fixfloor (long x) + { + if (x >= 0) + return (x >> 16); + else + return ~((~x) >> 16); + } + + inline int fixtoi (long x) + { + return fixfloor(x) + ((x & 0x8000) >> 15); + } + + int foo(long x, long y) + { + return fixtoi(x*y); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030305-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030305-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030305-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030305-1.c Wed Mar 5 09:00:43 2003 *************** *** 0 **** --- 1,18 ---- + /* PR c/9799 */ + /* Verify that GCC doesn't crash on excess elements + in initializer for a flexible array member. */ + + typedef struct { + int aaa; + } s1_t; + + typedef struct { + int bbb; + s1_t s1_array[]; + } s2_t; + + static s2_t s2_array[]= { + { 1, 4 }, + { 2, 5 }, + { 3, 6 } + }; diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030314-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030314-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/compile/20030314-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/compile/20030314-1.c Fri Mar 14 14:59:34 2003 *************** *** 0 **** --- 1,18 ---- + /* PR optimization/8396 */ + /* Originator: */ + + /* Verify that the tree inliner doesn't mess up the types + when passing the value of read-only constant arguments. */ + + static inline bar(const short int xs, const short int xe) + { + if (xe && (xs < xe)) + ; + } + + void f() + { + short int xe; + + bar(0, xe); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20020227-1.x gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20020227-1.x *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20020227-1.x Thu Apr 25 18:44:37 2002 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20020227-1.x Thu Feb 6 00:39:12 2003 *************** *** 2,21 **** # been observed to fail on at least mips-irix6, alpha, ia64, hppa64, # sparc64/sparcv9 and mmix during April 2002. ! if { [istarget "*64*-*-*"] || [istarget "alpha*-*-*"] || [istarget "mmix-*-*"] ! || [istarget "sparcv9-*-*"] || [istarget "mips*-*-irix6*"] } { ! set torture_execute_xfail [istarget] ! } ! ! # Regular sparc- also fails with -m64. ! set torture_eval_before_execute { ! global compiler_conditional_xfail_data ! set compiler_conditional_xfail_data { ! "This test fails on 64-bit targets, see PR6221." \ ! { "sparc-*-*" } \ ! { "-m64" } \ ! { "" } } } return 0 --- 2,33 ---- # been observed to fail on at least mips-irix6, alpha, ia64, hppa64, # sparc64/sparcv9 and mmix during April 2002. ! if { [istarget "sparc64-*-*"] || [istarget "sparcv9-*-*"] } { ! # On sparc64/sparcv9 it doesn't fail at -O0/-O1, or at all with -m32. ! set torture_eval_before_execute { ! global compiler_conditional_xfail_data ! set compiler_conditional_xfail_data { ! "This test fails on 64-bit targets, see PR6221." \ ! { "*-*-*" } \ ! { "-O2" "-O3" "-Os" } \ ! { "-m32" } ! } } + } elseif { [istarget "sparc-*-*"] } { + # Regular sparc fails with -m64, but not with -O0/-O1. + set torture_eval_before_execute { + global compiler_conditional_xfail_data + set compiler_conditional_xfail_data { + "This test fails on 64-bit targets, see PR6221." \ + { "*-*-*" } \ + { "-m64" } \ + { "-O0" "-O1" } + } + } + } elseif { [istarget "*64*-*-*"] || [istarget "alpha*-*-*"] + || [istarget "mmix-*-*"] || [istarget "mips*-*-irix6*"] } { + # Other 64-bit targets fail at all optimization levels. + set torture_execute_xfail [istarget] } return 0 diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20020307-2.x gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20020307-2.x *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20020307-2.x Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20020307-2.x Sun Mar 30 04:45:07 2003 *************** *** 0 **** --- 1,7 ---- + # This doesn't work on MIPS Irix, see PR6222 + + if { [istarget "mips*-sgi-irix6*"] } { + set torture_execute_xfail [istarget] + } + + return 0 diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030221-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030221-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030221-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030221-1.c Fri Feb 21 08:18:06 2003 *************** *** 0 **** --- 1,17 ---- + /* PR optimization/8613 */ + /* Contributed by Glen Nakamura */ + + extern void abort (void); + + int main (void) + { + char buf[16] = "1234567890"; + char *p = buf; + + *p++ = (char) __builtin_strlen (buf); + + if ((buf[0] != 10) || (p - buf != 1)) + abort (); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030224-2.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030224-2.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030224-2.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030224-2.c Mon Mar 24 04:02:00 2003 *************** *** 0 **** --- 1,28 ---- + /* Make sure that we don't free any temp stack slots associated with + initializing marker before we're finished with them. */ + + extern void abort(); + + typedef struct { short v16; } __attribute__((packed)) jint16_t; + + struct node { + jint16_t magic; + jint16_t nodetype; + int totlen; + } __attribute__((packed)); + + struct node node, *node_p = &node; + + int main() + { + struct node marker = { + .magic = (jint16_t) {0x1985}, + .nodetype = (jint16_t) {0x2003}, + .totlen = node_p->totlen + }; + if (marker.magic.v16 != 0x1985) + abort(); + if (marker.nodetype.v16 != 0x2003) + abort(); + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030307-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030307-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030307-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030307-1.c Fri Mar 7 07:58:39 2003 *************** *** 0 **** --- 1,26 ---- + /* PR optimization/8726 */ + /* Originator: Paul Eggert */ + + /* Verify that GCC doesn't miscompile tail calls on Sparc. */ + + extern void abort(void); + + int fcntl_lock(int fd, int op, long long offset, long long count, int type); + + int vfswrap_lock(char *fsp, int fd, int op, long long offset, long long count, int type) + { + return fcntl_lock(fd, op, offset, count, type); + } + + int fcntl_lock(int fd, int op, long long offset, long long count, int type) + { + return type; + } + + int main(void) + { + if (vfswrap_lock (0, 1, 2, 3, 4, 5) != 5) + abort(); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030313-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030313-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030313-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030313-1.c Wed Mar 19 12:43:02 2003 *************** *** 0 **** --- 1,68 ---- + struct A + { + unsigned long p, q, r, s; + } x = { 13, 14, 15, 16 }; + + extern void abort (void); + extern void exit (int); + + static inline struct A * + bar (void) + { + struct A *r; + + switch (8) + { + case 2: + abort (); + break; + case 8: + r = &x; + break; + default: + abort (); + break; + } + return r; + } + + void + foo (unsigned long *x, int y) + { + if (y != 12) + abort (); + if (x[0] != 1 || x[1] != 11) + abort (); + if (x[2] != 2 || x[3] != 12) + abort (); + if (x[4] != 3 || x[5] != 13) + abort (); + if (x[6] != 4 || x[7] != 14) + abort (); + if (x[8] != 5 || x[9] != 15) + abort (); + if (x[10] != 6 || x[11] != 16) + abort (); + } + + int + main (void) + { + unsigned long a[40]; + int b = 0; + + a[b++] = 1; + a[b++] = 11; + a[b++] = 2; + a[b++] = 12; + a[b++] = 3; + a[b++] = bar()->p; + a[b++] = 4; + a[b++] = bar()->q; + a[b++] = 5; + a[b++] = bar()->r; + a[b++] = 6; + a[b++] = bar()->s; + foo (a, b); + exit (0); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030316-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030316-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/20030316-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/20030316-1.c Sun Mar 16 19:47:36 2003 *************** *** 0 **** --- 1,12 ---- + /* PR target/9164 */ + /* The comparison operand was sign extended erraneously. */ + + int + main (void) + { + long j = 0x40000000; + if ((unsigned int) (0x40000000 + j) < 0L) + abort (); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c *** gcc-3.2.2/gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c Tue Jan 2 02:04:52 2001 --- gcc-3.2.3/gcc/testsuite/gcc.c-torture/execute/stdio-opt-1.c Sun Mar 30 04:42:18 2003 *************** int main() *** 54,60 **** return 0; } ! #ifdef __OPTIMIZE__ /* When optimizing, all the above cases should be transformed into something else. So any remaining calls to the original function should abort. */ --- 54,60 ---- return 0; } ! #if defined (__OPTIMIZE__) && ! defined (__OPTIMIZE_SIZE__) /* When optimizing, all the above cases should be transformed into something else. So any remaining calls to the original function should abort. */ diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20020430-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20020430-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20020430-1.c Fri May 3 14:08:33 2002 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20020430-1.c Fri Feb 7 04:01:18 2003 *************** *** 5,11 **** which left a reference to the deleted ADDR_VEC. */ /* { dg-do compile } */ ! /* { do-options "-O2 -frename-registers -fpic" } */ typedef unsigned long XID; typedef XID Window; --- 5,11 ---- which left a reference to the deleted ADDR_VEC. */ /* { dg-do compile } */ ! /* { dg-options "-O2 -frename-registers -fpic" } */ typedef unsigned long XID; typedef XID Window; diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20020503-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20020503-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20020503-1.c Fri May 3 20:46:23 2002 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20020503-1.c Fri Feb 7 04:01:18 2003 *************** *** 4,11 **** for leaf functions, the function was still leaf, but LEAF_REG_REMAP returned -1 for some registers (like %o0). */ /* { dg-do compile } */ ! /* { do-options "-O2 -g" } */ ! /* { do-options "-O2 -g -mflat" { target sparc*-*-* } } */ void foo (char *a, char *b, char *c, char *d) { --- 4,11 ---- for leaf functions, the function was still leaf, but LEAF_REG_REMAP returned -1 for some registers (like %o0). */ /* { dg-do compile } */ ! /* { dg-options "-O2 -g" } */ ! /* { dg-options "-O2 -g -mflat" { target sparc*-*-* } } */ void foo (char *a, char *b, char *c, char *d) { diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20030217-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20030217-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20030217-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20030217-1.c Tue Feb 18 23:43:55 2003 *************** *** 0 **** --- 1,18 ---- + /* Test whether denormal floating point constants in hexadecimal notation + are parsed correctly. */ + /* { dg-do run { target i?86-*-linux* x86_64-*-* } } */ + /* { dg-options "-std=c99" } */ + + long double d = 0x0.0000003ffffffff00000p-16357L; + long double e = 0x0.0000003ffffffff00000p-16356L; + + extern void abort (void); + extern void exit (int); + + int + main (void) + { + if (d != e / 2.0) + abort (); + exit (0); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20030225-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20030225-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20030225-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20030225-1.c Tue Feb 25 23:24:08 2003 *************** *** 0 **** --- 1,103 ---- + /* PR target/9732 + This testcase segfaulted on PPC because PIC_OFFSET_TABLE_REGNUM was no + fixed register. + Distilled from the xvid sources by Guillaume Morin + and Benjamin Herrenschmidt . */ + /* { dg-do run } */ + /* { dg-options "-O2 -fPIC" } */ + /* { dg-warning "not supported" "PIC unsupported" { target cris-*-elf* mmix-*-* } 0 } */ + + + extern void exit (int); + + #define W1 2841 /* 2048*sqrt(2)*cos(1*pi/16) */ + #define W2 2676 /* 2048*sqrt(2)*cos(2*pi/16) */ + #define W3 2408 /* 2048*sqrt(2)*cos(3*pi/16) */ + #define W5 1609 /* 2048*sqrt(2)*cos(5*pi/16) */ + #define W6 1108 /* 2048*sqrt(2)*cos(6*pi/16) */ + #define W7 565 /* 2048*sqrt(2)*cos(7*pi/16) */ + + + /* private data */ + static short iclip[1024]; /* clipping table */ + static short *iclp; + + void + idct_int32(short *const block) + { + static short *blk; + static long i; + static long X0, X1, X2, X3, X4, X5, X6, X7, X8; + + for (i = 0; i < 8; i++) /* idct columns */ + { + blk = block + i; + /* shortcut */ + if (! ((X1 = (blk[8 * 4] << 8)) | (X2 = blk[8 * 6]) + | (X3 = blk[8 * 2]) | (X4 = blk[8 * 1]) | (X5 = blk[8 * 7]) + | (X6 = blk[8 * 5]) | (X7 = blk[8 * 3]))) + { + blk[8 * 0] = blk[8 * 1] = blk[8 * 2] = + blk[8 * 3] = blk[8 * 4] = + blk[8 * 5] = blk[8 * 6] = blk[8 * 7] = + iclp[(blk[8 * 0] + 32) >> 6]; + continue; + } + X0 = (blk[8 * 0] << 8) + 8192; + + /* first stage */ + X8 = W7 * (X4 + X5) + 4; + X4 = (X8 + (W1 - W7) * X4) >> 3; + X5 = (X8 - (W1 + W7) * X5) >> 3; + X8 = W3 * (X6 + X7) + 4; + X6 = (X8 - (W3 - W5) * X6) >> 3; + X7 = (X8 - (W3 + W5) * X7) >> 3; + + /* second stage */ + X8 = X0 + X1; + X0 -= X1; + X1 = W6 * (X3 + X2) + 4; + X2 = (X1 - (W2 + W6) * X2) >> 3; + X3 = (X1 + (W2 - W6) * X3) >> 3; + X1 = X4 + X6; + X4 -= X6; + X6 = X5 + X7; + X5 -= X7; + + /* third stage */ + X7 = X8 + X3; + X8 -= X3; + X3 = X0 + X2; + X0 -= X2; + X2 = (181 * (X4 + X5) + 128) >> 8; + X4 = (181 * (X4 - X5) + 128) >> 8; + + /* fourth stage */ + blk[8 * 0] = iclp[(X7 + X1) >> 14]; + blk[8 * 1] = iclp[(X3 + X2) >> 14]; + blk[8 * 2] = iclp[(X0 + X4) >> 14]; + blk[8 * 3] = iclp[(X8 + X6) >> 14]; + blk[8 * 4] = iclp[(X8 - X6) >> 14]; + blk[8 * 5] = iclp[(X0 - X4) >> 14]; + blk[8 * 6] = iclp[(X3 - X2) >> 14]; + blk[8 * 7] = iclp[(X7 - X1) >> 14]; + } + } /* end function idct_int32(block) */ + + + int main(void) { + int i; + unsigned short tab[64]; + + for (i = 0 ; i < 64 ; ++i) + { + tab[i] = (1+(int) (65535)*8000/(2147483647+1.0)); + } + + iclp = iclip + 512; + for (i = -512; i < 512; i++) + iclp[i] = (i < -256) ? -256 : ((i > 255) ? 255 : i); + + idct_int32((short *) tab); + exit (0); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20030309-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20030309-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20030309-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20030309-1.c Wed Mar 19 12:38:12 2003 *************** *** 0 **** --- 1,42 ---- + /* { dg-do link } */ + /* { dg-options "-O2" } */ + + struct A0 { int x; }; + struct A1 { int x; int y[1]; }; + struct A2 { int x; int y[2]; }; + struct A3 { int x; int y[3]; }; + struct A4 { int x; int y[4]; }; + + void *s; + int u; + + int + main (void) + { + int x; + void *t = s; + + switch (u) + { + case 0: + x = ((struct A0 *) t)->x; + break; + case 1: + x = ((struct A1 *) t)->x; + break; + case 2: + x = ((struct A2 *) t)->x; + break; + case 3: + x = ((struct A3 *) t)->x; + break; + case 4: + x = ((struct A4 *) t)->x; + break; + default: + x = 0; + break; + } + + return x; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20030323-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20030323-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20030323-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20030323-1.c Sat Mar 29 10:29:33 2003 *************** *** 0 **** --- 1,24 ---- + /* { dg-do run } */ + + /* PR c/8224 */ + /* Contributed by Mikulas Patocka */ + + extern void abort (void); + + unsigned f (int x) + { + return (unsigned) (x / 2) / 2; + } + + unsigned f1 (int x) + { + unsigned xx = x / 2; + return xx / 2; + } + + int main () + { + if (f1 (-5) != f (-5)) + abort (); + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/20030414-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/20030414-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/20030414-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/20030414-1.c Mon Apr 14 14:08:36 2003 *************** *** 0 **** --- 1,39 ---- + /* PR target/10377 + Distilled by Hans-Peter Nilsson from ncurses-5.3 infocmp.c. + Copyright (C) 2003 Free Software Foundation. */ + + /* { dg-do assemble } */ + /* { dg-options "-O2 -fPIC" { target *-*-*gnu* } } */ + + extern int f2 (char *, char *); + extern char *ss[]; + extern char *cc; + void + f1 (char *dd, char *bb) + { + char *sp = bb + 1; + char *ap; + int i; + char *ee = 0; + char *cp; + + for (i = 0, cp = cc; i < 42; i++) + if (cp) + { + if (f2 (dd, "xx") || f2 (ss[i], "xx") || f2 (ss[i], "yy")) + if (bb < cp) + continue; + ee = ss[i]; + break; + } + + if (!ee) + for (ap = cc; *ap; ap++) + if (f2(ap, sp)) + { + ee = ap; + break; + } + + cc = ee; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/asmreg-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/asmreg-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/asmreg-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/asmreg-1.c Sun Feb 23 16:59:11 2003 *************** *** 0 **** --- 1,73 ---- + /* { dg-do compile { target cris-*-* } } */ + /* { dg-options "-O2" } */ + /* { dg-final { scan-assembler "\\\.ifnc \\\$r9-\\\$r10-\\\$r11-\\\$r12" } } */ + + /* Sanity check for asm register operands in syscall failed for + cris-axis-linux-gnu due to regmove bug. + Hans-Peter Nilsson . */ + + extern void lseek64 (int, long long, int); + extern int *__errno_location (void); + struct dirent64 + { + long long d_off; + unsigned short int d_reclen; + char d_name[256]; + }; + struct kernel_dirent64 + { + long long d_off; + unsigned short d_reclen; + char d_name[256]; + }; + + static inline int __attribute__ ((__always_inline__)) + __syscall_getdents64 (int fd, unsigned char * dirp, unsigned count) + { + register unsigned long __sys_res asm ("r10"); + register unsigned long __r10 __asm__ ("r10") = (unsigned long) fd; + register unsigned long __r11 __asm__ ("r11") = (unsigned long) dirp; + register unsigned long __r12 __asm__ ("r12") = (unsigned long) count; + register unsigned long __callno asm ("r9") = (220); + asm volatile (".ifnc %1-%0-%3-%4,$r9-$r10-$r11-$r12\n\t" + ".err\n\t" + ".endif\n\t" + "break 13" + : "=r" (__sys_res) + : "r" (__callno), "0" (__r10), "r" (__r11), "r" (__r12) + : "memory"); + if (__sys_res >= (unsigned long) -4096) + { + (*__errno_location ()) = - __sys_res; + __sys_res = -1; + } + return __sys_res; + } + + int + __getdents64 (int fd, char *buf, unsigned nbytes) + { + struct dirent64 *dp; + long long last_offset = -1; + int retval; + struct kernel_dirent64 *skdp, *kdp; + dp = (struct dirent64 *) buf; + skdp = kdp = __builtin_alloca (nbytes); + retval = __syscall_getdents64(fd, (char *)kdp, nbytes); + if (retval == -1) + return -1; + while ((char *) kdp < (char *) skdp + retval) + { + if ((char *) dp > buf + nbytes) + { + lseek64(fd, last_offset, 0); + break; + } + last_offset = kdp->d_off; + __builtin_memcpy (dp->d_name, kdp->d_name, kdp->d_reclen - 10); + dp = (struct dirent64 *) ((char *) dp + sizeof (*dp)); + kdp = (struct kernel_dirent64 *) (((char *) kdp) + kdp->d_reclen); + } + + return (char *) dp - buf; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/decl-2.c gcc-3.2.3/gcc/testsuite/gcc.dg/decl-2.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/decl-2.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/decl-2.c Mon Feb 10 13:01:50 2003 *************** *** 0 **** --- 1,10 ---- + /* PR c/7411 */ + /* Contributed by Christian Ehrhardt */ + /* { dg-do compile } */ + + void foo(void) + { + char c; /* { dg-error "previous declaration" } */ + int i; + int c = i; /* { dg-error "conflicting types" } */ + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/decl-3.c gcc-3.2.3/gcc/testsuite/gcc.dg/decl-3.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/decl-3.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/decl-3.c Wed Mar 12 10:04:52 2003 *************** *** 0 **** --- 1,5 ---- + /* PR c/9928 */ + /* { dg-do compile } */ + + enum { CODES }; /* { dg-error "previous declaration" } */ + enum { CODES }; /* { dg-error "conflicting types" } */ diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/i386-loop-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/i386-loop-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/i386-loop-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/i386-loop-1.c Sun Mar 9 15:51:41 2003 *************** *** 0 **** --- 1,105 ---- + /* PR optimization/9888 */ + /* { dg-do run { target i?86-*-* } } */ + /* { dg-options "-mcpu=k6 -O3" } */ + + /* Verify that GCC doesn't emit out of range 'loop' instructions. */ + + extern void abort (void); + extern void exit (int); + + + f1 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (--a == -1) + return i; + } + return -1; + } + + f2 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (--a != -1) + return i; + } + return -1; + } + + f3 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (--a == 0) + return i; + } + return -1; + } + + f4 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (--a != 0) + return i; + } + return -1; + } + + f5 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (++a == 0) + return i; + } + return -1; + } + + f6 (a) + long a; + { + int i; + for (i = 0; i < 10; i++) + { + if (++a != 0) + return i; + } + return -1; + } + + + int main() + { + if (f1 (5L) != 5) + abort (); + if (f2 (1L) != 0) + abort (); + if (f2 (0L) != 1) + abort (); + if (f3 (5L) != 4) + abort (); + if (f4 (1L) != 1) + abort (); + if (f4 (0L) != 0) + abort (); + if (f5 (-5L) != 4) + abort (); + if (f6 (-1L) != 1) + abort (); + if (f6 (0L) != 0) + abort (); + exit (0); + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/i386-loop-2.c gcc-3.2.3/gcc/testsuite/gcc.dg/i386-loop-2.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/i386-loop-2.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/i386-loop-2.c Wed Mar 12 09:42:00 2003 *************** *** 0 **** --- 1,80 ---- + /* PR optimization/9888 */ + /* Originator: Jim Bray */ + /* { dg-do run { target i?86-*-* } } */ + /* { dg-options "-mcpu=k6 -Os" } */ + + enum reload_type + { + RELOAD_FOR_INPUT, RELOAD_FOR_OUTPUT, RELOAD_FOR_INSN, + RELOAD_FOR_INPUT_ADDRESS, RELOAD_FOR_INPADDR_ADDRESS, + RELOAD_FOR_OUTPUT_ADDRESS, RELOAD_FOR_OUTADDR_ADDRESS, + RELOAD_FOR_OPERAND_ADDRESS, RELOAD_FOR_OPADDR_ADDR, + RELOAD_OTHER, RELOAD_FOR_OTHER_ADDRESS + }; + + #define FOO_SIZE 3 + + /* My results, varying with FOO_SIZE: + 30: asm error "value of ..fff77 too large: + 3 to 29: ....ff7d... + 1 to 2: no error. */ + + struct reload + { + int foo[FOO_SIZE]; + int opnum; + enum reload_type when_needed; + unsigned int optional:1; + unsigned int secondary_p:1; + }; + + #define N_RELOADS 2 + + struct reload rld[N_RELOADS]; + int n_reloads = N_RELOADS; + + int main(void) + { + int i; + + enum reload_type operand_type[1]; + + enum reload_type address_type[1]; + + int operand_reloadnum[1]; + int goal_alternative_matches[1]; + + for (i = 0; i < n_reloads; i++) + { + if (rld[i].secondary_p + && rld[i].when_needed == operand_type[rld[i].opnum]) + rld[i].when_needed = address_type[rld[i].opnum]; + + if ((rld[i].when_needed == RELOAD_FOR_INPUT_ADDRESS + || rld[i].when_needed == RELOAD_FOR_OUTPUT_ADDRESS + || rld[i].when_needed == RELOAD_FOR_INPADDR_ADDRESS + || rld[i].when_needed == RELOAD_FOR_OUTADDR_ADDRESS) + && (operand_reloadnum[rld[i].opnum] < 0 + || rld[operand_reloadnum[rld[i].opnum]].optional)) + { + + if (rld[i].when_needed == RELOAD_FOR_INPADDR_ADDRESS + || rld[i].when_needed == RELOAD_FOR_OUTADDR_ADDRESS) + rld[i].when_needed = RELOAD_FOR_OPADDR_ADDR; + else + rld[i].when_needed = RELOAD_FOR_OPERAND_ADDRESS; + } + + if ((rld[i].when_needed == RELOAD_FOR_INPUT_ADDRESS + || rld[i].when_needed == RELOAD_FOR_INPADDR_ADDRESS) + && operand_reloadnum[rld[i].opnum] >= 0 + && (rld[operand_reloadnum[rld[i].opnum]].when_needed + == RELOAD_OTHER)) + rld[i].when_needed = RELOAD_FOR_OTHER_ADDRESS; + + if (goal_alternative_matches[rld[i].opnum] >= 0) + rld[i].opnum = goal_alternative_matches[rld[i].opnum]; + } + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-1.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-1.c Tue Mar 25 10:42:14 2003 *************** *** 0 **** --- 1,28 ---- + /* PR optimization/8746 */ + /* { dg-do run { target i?86-*-* } } */ + /* { dg-options "-O1 -mcpu=i586" } */ + + extern void abort (void); + + unsigned char r0; + + int foo(int x) + { + unsigned char r = x&0xf0; + + if (!(r&0x80)) + { + r0 = r; + return 0; + } + else + return 1; + } + + int main(void) + { + if (foo(0x80) != 1) + abort(); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-2.c gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-2.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-2.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-2.c Tue Mar 25 10:42:14 2003 *************** *** 0 **** --- 1,28 ---- + /* PR optimization/8746 */ + /* { dg-do run { target i?86-*-* } } */ + /* { dg-options "-O1 -mcpu=i586" } */ + + extern void abort (void); + + unsigned short r0; + + int foo(int x) + { + unsigned short r = x&0xf000; + + if (!(r&0x8000)) + { + r0 = r; + return 0; + } + else + return 1; + } + + int main(void) + { + if (foo(0x8000) != 1) + abort(); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-3.c gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-3.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/i386-signbit-3.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/i386-signbit-3.c Tue Mar 25 10:42:14 2003 *************** *** 0 **** --- 1,32 ---- + /* PR optimization/8746 */ + /* { dg-do run { target i?86-*-* } } */ + /* { dg-options "-O1 -mcpu=i586" } */ + + extern void abort (void); + + volatile int j; + + void f0() { j=0; } + void f1() { j=1; } + + int foo(int x) + { + if ((short int)(x&0x8000) > (short int)0) + { + f0(); + return 0; + } + else + { + f1(); + return 1; + } + } + + int main(void) + { + if (foo(0x8000) != 1) + abort(); + + return 0; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/old-style-asm-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/old-style-asm-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/old-style-asm-1.c Thu Jan 9 13:18:46 2003 --- gcc-3.2.3/gcc/testsuite/gcc.dg/old-style-asm-1.c Sat Mar 8 14:04:35 2003 *************** void foo(int v) *** 16,19 **** asm ("dummy3"); } ! /* { dg-final { scan-assembler "L2" } } */ --- 16,27 ---- asm ("dummy3"); } ! /* The purpose of the test below is to check that there are two branches ! in the generated code, supposedly corresponding to the if-statements. ! Warning: this is fragile and assumes that one of the generated labels ! for the branches matches the string "L2", or as with ! mmix-knuth-mmixware, "L:2". That assumption is generally invalid, ! because for example it depends on the target macro ! ASM_GENERATE_INTERNAL_LABEL to generate a name matching this regexp (as ! with the default definition). */ ! /* { dg-final { scan-assembler "L(:)?2" } } */ diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/pragma-ep-1.c gcc-3.2.3/gcc/testsuite/gcc.dg/pragma-ep-1.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/pragma-ep-1.c Fri Mar 22 22:49:51 2002 --- gcc-3.2.3/gcc/testsuite/gcc.dg/pragma-ep-1.c Mon Feb 24 18:46:26 2003 *************** *** 5,11 **** /* { dg-final { scan-assembler "four" } } */ /* { dg-final { scan-assembler-not "_four" } } */ ! #ifndef __EXTERN_PREFIX #error #endif --- 5,11 ---- /* { dg-final { scan-assembler "four" } } */ /* { dg-final { scan-assembler-not "_four" } } */ ! #ifndef __PRAGMA_EXTERN_PREFIX #error #endif diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/sparc-dwarf2.c gcc-3.2.3/gcc/testsuite/gcc.dg/sparc-dwarf2.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/sparc-dwarf2.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/sparc-dwarf2.c Fri Mar 28 08:01:33 2003 *************** *** 0 **** --- 1,31 ---- + /* PR target/10114 */ + /* Originator: James Troup */ + /* { dg-do compile { target sparc-*-linux* } } */ + /* { dg-options "-g -O1" } */ + + extern __inline double sqrt (double __x) + { + register double __r; + __asm ("fsqrtd %1,%0" : "=f" (__r) : "f" (__x)); + return __r; + } + + static double our_skew, max_update_skew; + + static double Sqr(double x) + { + return x*x; + } + + void REF_SetReference(double skew) + { + double previous_skew, new_skew; + double old_weight, new_weight, sum_weight; + double delta_freq1, delta_freq2; + double skew1, skew2; + + previous_skew = our_skew; + skew1 = sqrt((Sqr(delta_freq1) * old_weight + Sqr(delta_freq2) * new_weight) / sum_weight); + skew2 = (previous_skew * old_weight + new_skew * new_weight) / sum_weight; + our_skew = skew1 + skew2; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp6.c gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp6.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp6.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp6.c Wed Mar 26 07:58:49 2003 *************** *** 0 **** --- 1,150 ---- + /* PR target/7784 */ + /* Originator: Peter van Hoof */ + /* { dg-do compile { target sparc-*-* } } */ + /* { dg-options "-O2 -mcpu=ultrasparc" } */ + + typedef struct + { + float EnergyErg; + float ots; + } EmLine; + + extern const int ipH_LIKE ; + extern const int ipHYDROGEN ; + extern const int ipH1s; + extern const int ipH2s; + extern const int ipH2p; + + extern EmLine ****EmisLines; + + typedef struct + { + long n; + long s; + long l; + } Elevels; + + extern struct t_iso + { + float ***Pop2Ion; + long int numLevels[2][30L]; + } iso; + + extern struct t_LineSave + { + long int nsum; + long int ndsum; + long int nComment; + long int npxdd; + long int ipass; + char chHoldComments[10][200]; + } LineSave; + + extern struct t_hydro + { + int lgHydEmiss; + float **pestrk ; + } hydro; + + extern struct t_dense + { + double DensityLaw[10]; + float frad[500]; + float fhden[500]; + float den0; + double eden; + } dense; + + extern struct t_abund + { + float xIonFracs[30L +3][30L +1]; + } abund; + + extern struct t_CaseBHS + { + long int nDensity[2][8] , ntemp[2][8] , ncut[2][8] ; + int lgHCaseBOK[2][8]; + } CaseBHS ; + + extern struct t_smbeta + { + float SimHBeta, + cn4861, + cn1216, + sv4861, + sv1216; + } smbeta; + + extern struct t_phycon + { + float te; + } phycon; + + + extern struct t_sphere + { + int lgSphere; + float covgeo; + } sphere; + + void linadd(double xInten, float wavelength, char *chLab, char chInfo); + + extern struct t_radiusVar + { + int lgDrNeg; + double dVeff; + } radius; + + void lines_hydro(void) + { + long int i, nelem, ipHi, ipLo; + double hbetab, em , EmisFac, pump; + char chLabel[5]; + + linadd(abund.xIonFracs[ipHYDROGEN][1]*iso.Pop2Ion[ipH_LIKE][ipHYDROGEN][3]*hydro.pestrk[3][2]*3.025e-12, 6563,"Strk",'i'); + + linadd(abund.xIonFracs[ipHYDROGEN][1]*iso.Pop2Ion[ipH_LIKE][ipHYDROGEN][4]*hydro.pestrk[4][2]*4.084e-12, 4861,"Strk",'i'); + + linadd(abund.xIonFracs[ipHYDROGEN][1]*iso.Pop2Ion[ipH_LIKE][ipHYDROGEN][4]*hydro.pestrk[4][3]*1.059e-12, 18751,"Strk",'i'); + + linadd(abund.xIonFracs[ipHYDROGEN][1]*iso.Pop2Ion[ipH_LIKE][ipHYDROGEN][5]*hydro.pestrk[5][4]*4.900e-13, 40512,"Strk",'i'); + + ((void)((LineSave.ipass <1 || EmisLines[ipH_LIKE][ipHYDROGEN][ipH2p][ipH1s].ots>= 0.) || (__assert("LineSave.ipass <1 || EmisLines[ipH_LIKE][ipHYDROGEN][ipH2p][ipH1s].ots>= 0.", "lines_hydro.c", 118), 0))); + + linadd(EmisLines[ipH_LIKE][ipHYDROGEN][3][ipH2s].ots*EmisLines[ipH_LIKE][ipHYDROGEN][3][ipH2s].EnergyErg, 6563,"Dest",'i'); + + linadd(EmisLines[ipH_LIKE][ipHYDROGEN][5][4].ots*EmisLines[ipH_LIKE][ipHYDROGEN][5][4].EnergyErg,40516, "Dest",'i'); + + smbeta.SimHBeta = smbeta.SimHBeta/(float)radius.dVeff*sphere.covgeo; + + linadd(smbeta.SimHBeta,4861,"Q(H)",'i'); + + smbeta.SimHBeta = smbeta.SimHBeta*(float)radius.dVeff/sphere.covgeo; + + for( nelem=0; nelem < 30L; nelem++ ) + { + int iCase; + for( iCase=0; iCase<2; ++iCase ) + { + char chAB[2]={'A','B'}; + char chLab[5]="Ca "; + + for( ipLo=1+iCase; ipLo<(((6)<(iso.numLevels[ipH_LIKE][nelem])) ? (6) : (5)); ++ipLo ) + { + for( ipHi=ipLo+1; ipHi< (((ipLo+5)<(iso.numLevels[ipH_LIKE][nelem])) ? (ipLo+5) : (iso.numLevels[ipH_LIKE][nelem])); ++ipHi ) + { + float wl; + + hbetab = HSRate( ipHi,ipLo , nelem+1, phycon.te , dense.eden, chAB[iCase] ); + if( hbetab<=0. ) + CaseBHS.lgHCaseBOK[iCase][nelem] = 0; + + if( !hydro.lgHydEmiss ) + hbetab *= abund.xIonFracs[nelem][nelem+1]*dense.eden; + + linadd(hbetab,wl,chLab,'i' ); + } + } + } + } + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp7.c gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp7.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp7.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp7.c Fri Mar 28 08:55:04 2003 *************** *** 0 **** --- 1,49 ---- + /* PR c/8281 */ + /* Originator: TANIGUCHI Yasuaki */ + /* { dg-do compile { target sparc-*-* } } */ + /* { dg-options "-O2 -mcpu=ultrasparc -fPIC" } */ + + static const double bp = 1.0, dp_l[] = { 0.0 }; + + double __ieee754_pow(double x, double y) + { + union { + int lo; + double d; + }uz; + + double y1,t1,p_h,t,z; + double z_h,z_l,p_l; + double t2,r,s,u,v,w; + int i = 0; + + double s_h,t_h; + double s2,s_l,t_l; + + + v = 1.0/(v+bp); + uz.d = s_h = s = u*v; + uz.lo = 0; + s_h = uz.d; + uz.d = t_h; + uz.lo = 3; + t_h = uz.d; + s_l = v*((u-s_h*t_h)-s_h*t_l); + s2 = s*s; + r = s2* s2* (1.1+s2*(1.2+s2*(1.3+s2*(1.4+s2*(1.5+s2*1.6))))); + s2 = s_h*s_h; + uz.lo = 0; + t_h = uz.d; + t_l = r-((t_h-3.0)-s2); + v = s_l*t_h+t_l*s; + p_l = v-(p_h-u); + z_h = bp *p_h; + z_l = bp*p_h+p_l*1.0+dp_l[i]; + t = (double)i; + t1 = (((bp+z_l)+bp)+t); + t2 = z_l-(((t1-t)-bp)-z_h); + p_l = (y-y1)*t1+y*t2; + z = p_l+p_h; + + return s*z; + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp8.c gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp8.c *** gcc-3.2.2/gcc/testsuite/gcc.dg/ultrasp8.c Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/gcc/testsuite/gcc.dg/ultrasp8.c Sat Apr 12 17:50:56 2003 *************** *** 0 **** --- 1,39 ---- + /* PR target/10067 */ + /* Originator: */ + /* { dg-do compile { target sparc*-*-* } } */ + /* { dg-options "-O2 -m64 -mtune=supersparc" { target sparc64-*-* } } */ + + struct _reent; + + extern unsigned long __malloc_trim_threshold; + extern unsigned long __malloc_top_pad; + + int _mallopt_r(struct _reent *reent_ptr, int param_number, int value) + { + __malloc_lock(reent_ptr); + + switch(param_number) + { + case -1: + __malloc_trim_threshold = value; + __malloc_unlock(reent_ptr); + return 1; + + case -2: + __malloc_top_pad = value; + __malloc_unlock(reent_ptr); + return 1; + + case -3: + __malloc_unlock(reent_ptr); + return 1; + + case -4: + __malloc_unlock(reent_ptr); + return value == 0; + + default: + __malloc_unlock(reent_ptr); + return 0; + } + } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/objc.dg/naming-1.m gcc-3.2.3/gcc/testsuite/objc.dg/naming-1.m *** gcc-3.2.2/gcc/testsuite/objc.dg/naming-1.m Wed Aug 1 08:15:11 2001 --- gcc-3.2.3/gcc/testsuite/objc.dg/naming-1.m Wed Apr 16 03:29:58 2003 *************** void foo(void) *** 17,21 **** void bar(void) { View *view; /* ok */ ! View = 1; /* { dg-error "parse error" } */ } --- 17,21 ---- void bar(void) { View *view; /* ok */ ! View = 1; /* { dg-error "(parse|syntax) error" } */ } diff -Nrc3pad gcc-3.2.2/gcc/testsuite/objc.dg/naming-2.m gcc-3.2.3/gcc/testsuite/objc.dg/naming-2.m *** gcc-3.2.2/gcc/testsuite/objc.dg/naming-2.m Wed Aug 1 08:15:11 2001 --- gcc-3.2.3/gcc/testsuite/objc.dg/naming-2.m Wed Apr 16 03:29:58 2003 *************** *** 4,10 **** @interface Foo @end ! float Foo; /* { dg-error "parse error before" } */ double Bar; @interface Bar --- 4,10 ---- @interface Foo @end ! float Foo; /* { dg-error "(parse|syntax) error before" } */ double Bar; @interface Bar diff -Nrc3pad gcc-3.2.2/gcc/toplev.c gcc-3.2.3/gcc/toplev.c *** gcc-3.2.2/gcc/toplev.c Sat Nov 2 00:57:23 2002 --- gcc-3.2.3/gcc/toplev.c Sat Feb 22 05:37:46 2003 *************** *** 1,6 **** /* Top level of GNU C compiler Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002 Free Software Foundation, Inc. This file is part of GCC. --- 1,6 ---- /* Top level of GNU C compiler Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, ! 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc. This file is part of GCC. *************** process_options () *** 4949,4955 **** print_switch_values (stderr, 0, MAX_LINE, "", " ", "\n"); } ! if (! quiet_flag) time_report = 1; if (flag_syntax_only) --- 4949,4955 ---- print_switch_values (stderr, 0, MAX_LINE, "", " ", "\n"); } ! if (! quiet_flag || flag_detailed_statistics) time_report = 1; if (flag_syntax_only) diff -Nrc3pad gcc-3.2.2/gcc/tradcif.c gcc-3.2.3/gcc/tradcif.c *** gcc-3.2.2/gcc/tradcif.c Wed Feb 5 03:12:56 2003 --- gcc-3.2.3/gcc/tradcif.c Tue Apr 22 07:05:22 2003 *************** *** 1,22 **** ! /* A Bison parser, made from tradcif.y ! by GNU bison 1.33. */ - #define YYBISON 1 /* Identify Bison output. */ - # define INT 257 - # define CHAR 258 - # define NAME 259 - # define ERROR 260 - # define OR 261 - # define AND 262 - # define EQUAL 263 - # define NOTEQUAL 264 - # define LEQ 265 - # define GEQ 266 - # define LSH 267 - # define RSH 268 - # define UNARY 269 #line 24 "tradcif.y" #include "config.h" --- 1,91 ---- ! /* A Bison parser, made by GNU Bison 1.875. */ ! ! /* Skeleton parser for Yacc-like parsing with Bison, ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* Written by Richard Stallman by simplifying the original so called ! ``semantic'' parser. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! /* Identify Bison output. */ ! #define YYBISON 1 ! ! /* Skeleton name. */ ! #define YYSKELETON_NAME "yacc.c" ! ! /* Pure parsers. */ ! #define YYPURE 0 ! ! /* Using locations. */ ! #define YYLSP_NEEDED 0 ! ! ! ! /* Tokens. */ ! #ifndef YYTOKENTYPE ! # define YYTOKENTYPE ! /* Put the tokens into the symbol table, so that GDB and other debuggers ! know about them. */ ! enum yytokentype { ! INT = 258, ! CHAR = 259, ! NAME = 260, ! ERROR = 261, ! OR = 262, ! AND = 263, ! NOTEQUAL = 264, ! EQUAL = 265, ! GEQ = 266, ! LEQ = 267, ! RSH = 268, ! LSH = 269, ! UNARY = 270 ! }; ! #endif ! #define INT 258 ! #define CHAR 259 ! #define NAME 260 ! #define ERROR 261 ! #define OR 262 ! #define AND 263 ! #define NOTEQUAL 264 ! #define EQUAL 265 ! #define GEQ 266 ! #define LEQ 267 ! #define RSH 268 ! #define LSH 269 ! #define UNARY 270 + + /* Copy the first part of user declarations. */ #line 24 "tradcif.y" #include "config.h" *************** *** 39,68 **** static const char *lexptr; #line 46 "tradcif.y" ! #ifndef YYSTYPE ! typedef union { struct constant {long value; int unsignedp;} integer; int voidval; char *sval; ! } yystype; ! # define YYSTYPE yystype #endif ! #ifndef YYDEBUG ! # define YYDEBUG 0 #endif ! #define YYFINAL 62 ! #define YYFLAG -32768 ! #define YYNTBASE 34 ! /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ ! #define YYTRANSLATE(x) ((unsigned)(x) <= 269 ? yytranslate[x] : 37) ! /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ ! static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, --- 108,266 ---- static const char *lexptr; + + /* Enabling traces. */ + #ifndef YYDEBUG + # define YYDEBUG 0 + #endif + + /* Enabling verbose error messages. */ + #ifdef YYERROR_VERBOSE + # undef YYERROR_VERBOSE + # define YYERROR_VERBOSE 1 + #else + # define YYERROR_VERBOSE 0 + #endif + + #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) #line 46 "tradcif.y" ! typedef union YYSTYPE { struct constant {long value; int unsignedp;} integer; int voidval; char *sval; ! } YYSTYPE; ! /* Line 191 of yacc.c. */ ! #line 133 "tr11499.c" ! # define yystype YYSTYPE /* obsolescent; will be withdrawn */ ! # define YYSTYPE_IS_DECLARED 1 ! # define YYSTYPE_IS_TRIVIAL 1 #endif ! ! ! ! /* Copy the second part of user declarations. */ ! ! ! /* Line 214 of yacc.c. */ ! #line 145 "tr11499.c" ! ! #if ! defined (yyoverflow) || YYERROR_VERBOSE ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # define YYSTACK_ALLOC malloc ! # define YYSTACK_FREE free ! # endif ! #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ ! ! ! #if (! defined (yyoverflow) \ ! && (! defined (__cplusplus) \ ! || (YYSTYPE_IS_TRIVIAL))) ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc ! { ! short yyss; ! YYSTYPE yyvs; ! }; ! ! /* The size of the maximum gap between one aligned stack and the next. */ ! # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) ! ! /* The size of an array large to enough to hold all stacks, each with ! N elements. */ ! # define YYSTACK_BYTES(N) \ ! ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ ! + YYSTACK_GAP_MAXIMUM) ! ! /* Copy COUNT objects from FROM to TO. The source and destination do ! not overlap. */ ! # ifndef YYCOPY ! # if 1 < __GNUC__ ! # define YYCOPY(To, From, Count) \ ! __builtin_memcpy (To, From, (Count) * sizeof (*(From))) ! # else ! # define YYCOPY(To, From, Count) \ ! do \ ! { \ ! register YYSIZE_T yyi; \ ! for (yyi = 0; yyi < (Count); yyi++) \ ! (To)[yyi] = (From)[yyi]; \ ! } \ ! while (0) ! # endif ! # endif ! ! /* Relocate STACK from its old location to the new one. The ! local variables YYSIZE and YYSTACKSIZE give the old and new number of ! elements in the stack, and YYPTR gives the new location of the ! stack. Advance YYPTR to a properly aligned location for the next ! stack. */ ! # define YYSTACK_RELOCATE(Stack) \ ! do \ ! { \ ! YYSIZE_T yynewbytes; \ ! YYCOPY (&yyptr->Stack, Stack, yysize); \ ! Stack = &yyptr->Stack; \ ! yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ ! yyptr += yynewbytes / sizeof (*yyptr); \ ! } \ ! while (0) ! #endif + #if defined (__STDC__) || defined (__cplusplus) + typedef signed char yysigned_char; + #else + typedef short yysigned_char; + #endif + /* YYFINAL -- State number of the termination state. */ + #define YYFINAL 18 + /* YYLAST -- Last index in YYTABLE. */ + #define YYLAST 184 ! /* YYNTOKENS -- Number of terminals. */ ! #define YYNTOKENS 34 ! /* YYNNTS -- Number of nonterminals. */ ! #define YYNNTS 4 ! /* YYNRULES -- Number of rules. */ ! #define YYNRULES 32 ! /* YYNRULES -- Number of states. */ ! #define YYNSTATES 62 ! /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ ! #define YYUNDEFTOK 2 ! #define YYMAXUTOK 270 ! #define YYTRANSLATE(YYX) \ ! ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) ! ! /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ ! static const unsigned char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, *************** static const char yytranslate[] = *** 89,379 **** 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, ! 6, 10, 11, 15, 16, 19, 20, 21, 22, 28 }; #if YYDEBUG ! static const short yyprhs[] = { ! 0, 0, 2, 4, 8, 11, 14, 17, 20, 24, ! 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, ! 68, 72, 76, 80, 84, 88, 92, 96, 102, 104, ! 106, 108 }; ! static const short yyrhs[] = { ! 35, 0, 36, 0, 35, 9, 36, 0, 24, 36, ! 0, 29, 36, 0, 23, 36, 0, 30, 36, 0, ! 31, 35, 32, 0, 36, 25, 36, 0, 36, 26, ! 36, 0, 36, 27, 36, 0, 36, 23, 36, 0, ! 36, 24, 36, 0, 36, 21, 36, 0, 36, 22, ! 36, 0, 36, 15, 36, 0, 36, 16, 36, 0, ! 36, 19, 36, 0, 36, 20, 36, 0, 36, 17, ! 36, 0, 36, 18, 36, 0, 36, 14, 36, 0, ! 36, 13, 36, 0, 36, 12, 36, 0, 36, 11, ! 36, 0, 36, 10, 36, 0, 36, 7, 36, 8, ! 36, 0, 3, 0, 4, 0, 5, 0, 33, 0 }; ! #endif ! ! #if YYDEBUG ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const short yyrline[] = { ! 0, 75, 80, 81, 86, 89, 92, 94, 97, 102, ! 108, 119, 130, 133, 136, 142, 148, 151, 154, 161, ! 168, 175, 182, 185, 188, 191, 194, 197, 200, 202, ! 204, 207 }; #endif ! ! #if (YYDEBUG) || defined YYERROR_VERBOSE ! ! /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { ! "$", "error", "$undefined.", "INT", "CHAR", "NAME", "ERROR", "'?'", "':'", ! "','", "OR", "AND", "'|'", "'^'", "'&'", "EQUAL", "NOTEQUAL", "'<'", ! "'>'", "LEQ", "GEQ", "LSH", "RSH", "'+'", "'-'", "'*'", "'/'", "'%'", ! "UNARY", "'!'", "'~'", "'('", "')'", "'#'", "start", "exp1", "exp", 0 }; #endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const short yyr1[] = { ! 0, 34, 35, 35, 36, 36, 36, 36, 36, 36, ! 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, ! 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, ! 36, 36 }; ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const short yyr2[] = { ! 0, 1, 1, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 3, 5, 1, 1, ! 1, 1 }; ! /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE ! doesn't specify something else to do. Zero means the default is an ! error. */ ! static const short yydefact[] = { ! 0, 28, 29, 30, 0, 0, 0, 0, 0, 31, ! 1, 2, 6, 4, 5, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 8, 3, 0, ! 26, 25, 24, 23, 22, 16, 17, 20, 21, 18, ! 19, 14, 15, 12, 13, 9, 10, 11, 0, 27, ! 0, 0, 0 }; ! static const short yydefgoto[] = { ! 60, 10, 11 }; static const short yypact[] = { ! 32,-32768,-32768,-32768, 32, 32, 32, 32, 32,-32768, ! 0, 80,-32768,-32768,-32768,-32768, 1, 32, 32, 32, ! 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, ! 32, 32, 32, 32, 32, 32, 32,-32768, 80, 59, ! 97, 26, 112, 126, 139, 150, 150, 157, 157, 157, ! 157, -19, -19, 33, 33,-32768,-32768,-32768, 32, 80, ! 11, 12,-32768 }; ! static const short yypgoto[] = { ! -32768, 49, -4 }; ! ! #define YYLAST 184 ! ! ! static const short yytable[] = { ! 12, 13, 14, 15, 32, 33, 34, 35, 36, 17, ! 17, 61, 62, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 37, 0, 1, 2, 3, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, ! 33, 34, 35, 36, 59, 4, 5, 16, 34, 35, ! 36, 6, 7, 8, 0, 9, 18, 58, 0, 19, ! 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, ! 30, 31, 32, 33, 34, 35, 36, 18, 0, 0, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, 30, 31, 32, 33, 34, 35, 36, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, ! 32, 33, 34, 35, 36, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, ! 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, ! 33, 34, 35, 36, 24, 25, 26, 27, 28, 29, ! 30, 31, 32, 33, 34, 35, 36, 26, 27, 28, ! 29, 30, 31, 32, 33, 34, 35, 36, 30, 31, ! 32, 33, 34, 35, 36 }; ! static const short yycheck[] = { ! 4, 5, 6, 7, 23, 24, 25, 26, 27, 9, ! 9, 0, 0, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, ! 34, 35, 36, 32, -1, 3, 4, 5, 12, 13, ! 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, ! 24, 25, 26, 27, 58, 23, 24, 8, 25, 26, ! 27, 29, 30, 31, -1, 33, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, ! 21, 22, 23, 24, 25, 26, 27, 7, -1, -1, ! 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, ! 20, 21, 22, 23, 24, 25, 26, 27, 11, 12, ! 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, ! 23, 24, 25, 26, 27, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, - 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, - 24, 25, 26, 27, 15, 16, 17, 18, 19, 20, - 21, 22, 23, 24, 25, 26, 27, 17, 18, 19, - 20, 21, 22, 23, 24, 25, 26, 27, 21, 22, 23, 24, 25, 26, 27 }; - /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ - #line 3 "/usr/share/bison/bison.simple" ! /* Skeleton output parser for bison, ! ! Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software ! Foundation, Inc. ! ! This program 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 2, or (at your option) ! any later version. ! ! This program 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 this program; if not, write to the Free Software ! Foundation, Inc., 59 Temple Place - Suite 330, ! Boston, MA 02111-1307, USA. */ ! ! /* As a special exception, when this file is copied by Bison into a ! Bison output file, you may use that output file without restriction. ! This special exception was added by the Free Software Foundation ! in version 1.24 of Bison. */ ! ! /* This is the parser code that is written into each bison parser when ! the %semantic_parser declaration is not specified in the grammar. ! It was written by Richard Stallman by simplifying the hairy parser ! used when %semantic_parser is specified. */ ! ! /* All symbols defined below should begin with yy or YY, to avoid ! infringing on user name space. This should be done even for local ! variables, as they might otherwise be expanded by user macros. ! There are some unavoidable exceptions within include files to ! define necessary library symbols; they are noted "INFRINGES ON ! USER NAME SPACE" below. */ ! ! #ifdef __cplusplus ! # define YYSTD(x) std::x ! #else ! # define YYSTD(x) x ! #endif ! ! #ifndef YYPARSE_RETURN_TYPE ! #define YYPARSE_RETURN_TYPE int ! #endif ! ! #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) ! ! /* The parser invokes alloca or malloc; define the necessary symbols. */ ! ! # if YYSTACK_USE_ALLOCA ! # define YYSTACK_ALLOC alloca ! # else ! # ifndef YYSTACK_USE_ALLOCA ! # if defined (alloca) || defined (_ALLOCA_H) ! # define YYSTACK_ALLOC alloca ! # else ! # ifdef __GNUC__ ! # define YYSTACK_ALLOC __builtin_alloca ! # endif ! # endif ! # endif ! # endif ! ! # ifdef YYSTACK_ALLOC ! /* Pacify GCC's `empty if-body' warning. */ ! # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) ! # else ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif ! # endif ! # define YYSTACK_ALLOC YYSTD (malloc) ! # define YYSTACK_FREE YYSTD (free) ! # endif ! ! /* A type that is properly aligned for any stack member. */ ! union yyalloc { ! short yyss; ! YYSTYPE yyvs; ! # if YYLSP_NEEDED ! YYLTYPE yyls; ! # endif }; - /* The size of the maximum gap between one aligned stack and the next. */ - # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) - - /* The size of an array large to enough to hold all stacks, each with - N elements. */ - # if YYLSP_NEEDED - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ - + 2 * YYSTACK_GAP_MAX) - # else - # define YYSTACK_BYTES(N) \ - ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAX) - # endif - - /* Relocate the TYPE STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ - # define YYSTACK_RELOCATE(Type, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - yymemcpy ((char *) yyptr, (char *) (Stack), \ - yysize * (YYSIZE_T) sizeof (Type)); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (Type) + YYSTACK_GAP_MAX; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - - #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ - - #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif --- 287,482 ---- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ! 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, ! 5, 6, 10, 11, 15, 16, 19, 20, 21, 22, ! 28 }; #if YYDEBUG ! /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in ! YYRHS. */ ! static const unsigned char yyprhs[] = { ! 0, 0, 3, 5, 7, 11, 14, 17, 20, 23, ! 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, ! 67, 71, 75, 79, 83, 87, 91, 95, 99, 105, ! 107, 109, 111 }; ! ! /* YYRHS -- A `-1'-separated list of the rules' RHS. */ ! static const yysigned_char yyrhs[] = { ! 35, 0, -1, 36, -1, 37, -1, 36, 9, 37, ! -1, 24, 37, -1, 29, 37, -1, 23, 37, -1, ! 30, 37, -1, 31, 36, 32, -1, 37, 25, 37, ! -1, 37, 26, 37, -1, 37, 27, 37, -1, 37, ! 23, 37, -1, 37, 24, 37, -1, 37, 22, 37, ! -1, 37, 21, 37, -1, 37, 16, 37, -1, 37, ! 15, 37, -1, 37, 20, 37, -1, 37, 19, 37, ! -1, 37, 17, 37, -1, 37, 18, 37, -1, 37, ! 14, 37, -1, 37, 13, 37, -1, 37, 12, 37, ! -1, 37, 11, 37, -1, 37, 10, 37, -1, 37, ! 7, 37, 8, 37, -1, 3, -1, 4, -1, 5, ! -1, 33, -1 }; ! /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ ! static const unsigned char yyrline[] = { ! 0, 75, 75, 80, 81, 86, 89, 92, 94, 97, ! 102, 108, 119, 130, 133, 136, 142, 148, 151, 154, ! 161, 168, 175, 182, 185, 188, 191, 194, 197, 200, ! 202, 204, 207 }; #endif ! #if YYDEBUG || YYERROR_VERBOSE ! /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. ! First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { ! "$end", "error", "$undefined", "INT", "CHAR", "NAME", "ERROR", "'?'", ! "':'", "','", "OR", "AND", "'|'", "'^'", "'&'", "NOTEQUAL", "EQUAL", ! "'<'", "'>'", "GEQ", "LEQ", "RSH", "LSH", "'+'", "'-'", "'*'", "'/'", ! "'%'", "UNARY", "'!'", "'~'", "'('", "')'", "'#'", "$accept", "start", ! "exp1", "exp", 0 }; #endif ! # ifdef YYPRINT ! /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to ! token YYLEX-NUM. */ ! static const unsigned short yytoknum[] = { ! 0, 256, 257, 258, 259, 260, 261, 63, 58, 44, ! 262, 263, 124, 94, 38, 264, 265, 60, 62, 266, ! 267, 268, 269, 43, 45, 42, 47, 37, 270, 33, ! 126, 40, 41, 35 }; + # endif ! /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ ! static const unsigned char yyr1[] = { ! 0, 34, 35, 36, 36, 37, 37, 37, 37, 37, ! 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, ! 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, ! 37, 37, 37 ! }; ! ! /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ ! static const unsigned char yyr2[] = ! { ! 0, 2, 1, 1, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, ! 3, 3, 3, 3, 3, 3, 3, 3, 5, 1, ! 1, 1, 1 }; ! /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state ! STATE-NUM when YYTABLE doesn't specify something else to do. Zero ! means the default is an error. */ ! static const unsigned char yydefact[] = { ! 0, 29, 30, 31, 0, 0, 0, 0, 0, 32, ! 0, 2, 3, 7, 5, 6, 8, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ! 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, ! 4, 0, 27, 26, 25, 24, 23, 18, 17, 21, ! 22, 20, 19, 16, 15, 13, 14, 10, 11, 12, ! 0, 28 }; ! /* YYDEFGOTO[NTERM-NUM]. */ ! static const yysigned_char yydefgoto[] = { ! -1, 10, 11, 12 }; + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + #define YYPACT_NINF -18 static const short yypact[] = { ! 34, -18, -18, -18, 34, 34, 34, 34, 34, -18, ! 11, 4, 82, -18, -18, -18, -18, 3, -18, 34, ! 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, ! 34, 34, 34, 34, 34, 34, 34, 34, 34, -18, ! 82, 61, 99, 28, 114, 128, 141, 152, 152, -17, ! -17, -17, -17, 157, 157, 35, 35, -18, -18, -18, ! 34, 82 }; ! /* YYPGOTO[NTERM-NUM]. */ ! static const yysigned_char yypgoto[] = { ! -18, -18, 6, -4 }; ! /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If ! positive, shift that token. If negative, reduce the rule which ! number is the opposite. If zero, do what YYDEFACT says. ! If YYTABLE_NINF, syntax error. */ ! #define YYTABLE_NINF -1 ! static const unsigned char yytable[] = { ! 13, 14, 15, 16, 32, 33, 34, 35, 36, 37, ! 38, 18, 19, 19, 17, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, ! 55, 56, 57, 58, 59, 39, 0, 1, 2, 3, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, ! 33, 34, 35, 36, 37, 38, 61, 4, 5, 0, ! 36, 37, 38, 6, 7, 8, 0, 9, 20, 60, ! 0, 21, 22, 23, 24, 25, 26, 27, 28, 29, ! 30, 31, 32, 33, 34, 35, 36, 37, 38, 20, ! 0, 0, 21, 22, 23, 24, 25, 26, 27, 28, ! 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, ! 32, 33, 34, 35, 36, 37, 38, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, ! 37, 38, 25, 26, 27, 28, 29, 30, 31, 32, ! 33, 34, 35, 36, 37, 38, 26, 27, 28, 29, ! 30, 31, 32, 33, 34, 35, 36, 37, 38, 28, ! 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, ! 34, 35, 36, 37, 38 }; ! static const yysigned_char yycheck[] = { ! 4, 5, 6, 7, 21, 22, 23, 24, 25, 26, ! 27, 0, 9, 9, 8, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, ! 34, 35, 36, 37, 38, 32, -1, 3, 4, 5, ! 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 60, 23, 24, -1, ! 25, 26, 27, 29, 30, 31, -1, 33, 7, 8, ! -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 7, ! -1, -1, 10, 11, 12, 13, 14, 15, 16, 17, ! 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, ! 21, 22, 23, 24, 25, 26, 27, 13, 14, 15, ! 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, ! 26, 27, 14, 15, 16, 17, 18, 19, 20, 21, ! 22, 23, 24, 25, 26, 27, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 23, 24, 25, 26, 27 }; ! /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing ! symbol of state STATE-NUM. */ ! static const unsigned char yystos[] = { ! 0, 3, 4, 5, 23, 24, 29, 30, 31, 33, ! 35, 36, 37, 37, 37, 37, 37, 36, 0, 9, ! 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, ! 19, 20, 21, 22, 23, 24, 25, 26, 27, 32, ! 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, ! 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, ! 8, 37 }; #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif *************** union yyalloc *** 381,394 **** # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T std::size_t ! # else ! # ifdef __STDC__ ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t ! # endif # endif #endif #if ! defined (YYSIZE_T) --- 484,492 ---- # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) ! # if defined (__STDC__) || defined (__cplusplus) ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) *************** union yyalloc *** 397,425 **** #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) --- 495,528 ---- #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) ! #define YYEMPTY (-2) #define YYEOF 0 + #define YYACCEPT goto yyacceptlab ! #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 + /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ + #define YYFAIL goto yyerrlab + #define YYRECOVERING() (!!yyerrstatus) + #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ ! yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ ! yyerror ("syntax error: cannot back up");\ YYERROR; \ } \ while (0) *************** while (0) *** 427,478 **** #define YYTERROR 1 #define YYERRCODE 256 - /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). ! ! When YYLLOC_DEFAULT is run, CURRENT is set the location of the ! first token. By default, to implement support for ranges, extend ! its range to the last symbol. */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif - /* YYLEX -- calling `yylex' with the right arguments. */ ! #if YYPURE ! # if YYLSP_NEEDED ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval, &yylloc) ! # endif ! # else /* !YYLSP_NEEDED */ ! # ifdef YYLEX_PARAM ! # define YYLEX yylex (&yylval, YYLEX_PARAM) ! # else ! # define YYLEX yylex (&yylval) ! # endif ! # endif /* !YYLSP_NEEDED */ ! #else /* !YYPURE */ ! # define YYLEX yylex () ! #endif /* !YYPURE */ ! /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # ifdef __cplusplus ! # include /* INFRINGES ON USER NAME SPACE */ ! # else ! # include /* INFRINGES ON USER NAME SPACE */ ! # endif ! # define YYFPRINTF YYSTD (fprintf) # endif # define YYDPRINTF(Args) \ --- 530,560 ---- #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions ! are run). */ #ifndef YYLLOC_DEFAULT ! # define YYLLOC_DEFAULT(Current, Rhs, N) \ ! Current.first_line = Rhs[1].first_line; \ ! Current.first_column = Rhs[1].first_column; \ ! Current.last_line = Rhs[N].last_line; \ ! Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ ! #ifdef YYLEX_PARAM ! # define YYLEX yylex (YYLEX_PARAM) ! #else ! # define YYLEX yylex () ! #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF ! # include /* INFRINGES ON USER NAME SPACE */ ! # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ *************** do { \ *** 480,494 **** if (yydebug) \ YYFPRINTF Args; \ } while (0) ! /* Nonzero means print parse trace. [The following comment makes no ! sense to me. Could someone clarify it? --akim] Since this is ! uninitialized, it does not stop multiple parsers from coexisting. ! */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 --- 562,654 ---- if (yydebug) \ YYFPRINTF Args; \ } while (0) ! ! # define YYDSYMPRINT(Args) \ ! do { \ ! if (yydebug) \ ! yysymprint Args; \ ! } while (0) ! ! # define YYDSYMPRINTF(Title, Token, Value, Location) \ ! do { \ ! if (yydebug) \ ! { \ ! YYFPRINTF (stderr, "%s ", Title); \ ! yysymprint (stderr, \ ! Token, Value); \ ! YYFPRINTF (stderr, "\n"); \ ! } \ ! } while (0) ! ! /*------------------------------------------------------------------. ! | yy_stack_print -- Print the state stack from its BOTTOM up to its | ! | TOP (cinluded). | ! `------------------------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_stack_print (short *bottom, short *top) ! #else ! static void ! yy_stack_print (bottom, top) ! short *bottom; ! short *top; ! #endif ! { ! YYFPRINTF (stderr, "Stack now"); ! for (/* Nothing. */; bottom <= top; ++bottom) ! YYFPRINTF (stderr, " %d", *bottom); ! YYFPRINTF (stderr, "\n"); ! } ! ! # define YY_STACK_PRINT(Bottom, Top) \ ! do { \ ! if (yydebug) \ ! yy_stack_print ((Bottom), (Top)); \ ! } while (0) ! ! ! /*------------------------------------------------. ! | Report that the YYRULE is going to be reduced. | ! `------------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yy_reduce_print (int yyrule) ! #else ! static void ! yy_reduce_print (yyrule) ! int yyrule; ! #endif ! { ! int yyi; ! unsigned int yylineno = yyrline[yyrule]; ! YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", ! yyrule - 1, yylineno); ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) ! YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]); ! YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]); ! } ! ! # define YY_REDUCE_PRINT(Rule) \ ! do { \ ! if (yydebug) \ ! yy_reduce_print (Rule); \ ! } while (0) ! ! /* Nonzero means print parse trace. It is left uninitialized so that ! multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) + # define YYDSYMPRINT(Args) + # define YYDSYMPRINTF(Title, Token, Value, Location) + # define YY_STACK_PRINT(Bottom, Top) + # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ + /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 *************** int yydebug; *** 508,542 **** #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif - - #if ! defined (yyoverflow) && ! defined (yymemcpy) - # if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ - # define yymemcpy __builtin_memcpy - # else /* not GNU C or C++ */ - - /* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ - static void - # if defined (__STDC__) || defined (__cplusplus) - yymemcpy (char *yyto, const char *yyfrom, YYSIZE_T yycount) - # else - yymemcpy (yyto, yyfrom, yycount) - char *yyto; - const char *yyfrom; - YYSIZE_T yycount; - # endif - { - register const char *yyf = yyfrom; - register char *yyt = yyto; - register YYSIZE_T yyi = yycount; ! while (yyi-- != 0) ! *yyt++ = *yyf++; ! } ! # endif ! #endif ! #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) --- 668,677 ---- #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif ! ! #if YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) *************** yystpcpy (yydest, yysrc) *** 586,671 **** } # endif # endif ! #endif - #line 345 "/usr/share/bison/bison.simple" ! /* The user can define YYPARSE_PARAM as the name of an argument to be passed ! into yyparse. The argument should have type void *. ! It should actually point to an object. ! Grammar actions can access the variable by casting it ! to the proper pointer type. */ ! #ifdef YYPARSE_PARAM ! # ifdef __cplusplus ! # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL ! # else /* !__cplusplus */ ! # define YYPARSE_PARAM_ARG YYPARSE_PARAM ! # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; ! # endif /* !__cplusplus */ ! #else /* !YYPARSE_PARAM */ ! # define YYPARSE_PARAM_ARG ! # define YYPARSE_PARAM_DECL ! #endif /* !YYPARSE_PARAM */ ! /* Prevent warning if -Wstrict-prototypes. */ ! #ifdef __GNUC__ ! # ifdef YYPARSE_PARAM ! YYPARSE_RETURN_TYPE yyparse (void *); # else ! YYPARSE_RETURN_TYPE yyparse (void); # endif #endif - /* YY_DECL_VARIABLES -- depending whether we use a pure parser, - variables are global, or local to YYPARSE. */ ! #define YY_DECL_NON_LSP_VARIABLES \ ! /* The lookahead symbol. */ \ ! int yychar; \ ! \ ! /* The semantic value of the lookahead symbol. */ \ ! YYSTYPE yylval; \ ! \ ! /* Number of parse errors so far. */ \ int yynerrs; - #if YYLSP_NEEDED - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES \ - \ - /* Location data for the lookahead symbol. */ \ - YYLTYPE yylloc; - #else - # define YY_DECL_VARIABLES \ - YY_DECL_NON_LSP_VARIABLES - #endif ! /* If nonreentrant, generate the variables here. */ ! #if !YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! YYPARSE_RETURN_TYPE ! yyparse (YYPARSE_PARAM_ARG) ! YYPARSE_PARAM_DECL { ! /* If reentrant, generate the variables here. */ ! #if YYPURE ! YY_DECL_VARIABLES ! #endif /* !YYPURE */ ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, --- 721,854 ---- } # endif # endif ! ! #endif /* !YYERROR_VERBOSE */ ! + #if YYDEBUG + /*--------------------------------. + | Print this symbol on YYOUTPUT. | + `--------------------------------*/ ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yysymprint (yyoutput, yytype, yyvaluep) ! FILE *yyoutput; ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! if (yytype < YYNTOKENS) ! { ! YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); ! # ifdef YYPRINT ! YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); ! # endif ! } ! else ! YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); ! switch (yytype) ! { ! default: ! break; ! } ! YYFPRINTF (yyoutput, ")"); ! } ! ! #endif /* ! YYDEBUG */ ! /*-----------------------------------------------. ! | Release the memory associated to this symbol. | ! `-----------------------------------------------*/ ! ! #if defined (__STDC__) || defined (__cplusplus) ! static void ! yydestruct (int yytype, YYSTYPE *yyvaluep) ! #else ! static void ! yydestruct (yytype, yyvaluep) ! int yytype; ! YYSTYPE *yyvaluep; ! #endif ! { ! /* Pacify ``unused variable'' warnings. */ ! (void) yyvaluep; ! ! switch (yytype) ! { ! ! default: ! break; ! } ! } ! ! ! /* Prevent warnings from -Wmissing-prototypes. */ ! ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM); # else ! int yyparse (); # endif + #else /* ! YYPARSE_PARAM */ + #if defined (__STDC__) || defined (__cplusplus) + int yyparse (void); + #else + int yyparse (); #endif + #endif /* ! YYPARSE_PARAM */ ! ! /* The lookahead symbol. */ ! int yychar; ! ! /* The semantic value of the lookahead symbol. */ ! YYSTYPE yylval; ! ! /* Number of syntax errors so far. */ int yynerrs; ! /*----------. ! | yyparse. | ! `----------*/ ! #ifdef YYPARSE_PARAM ! # if defined (__STDC__) || defined (__cplusplus) ! int yyparse (void *YYPARSE_PARAM) ! # else ! int yyparse (YYPARSE_PARAM) ! void *YYPARSE_PARAM; ! # endif ! #else /* ! YYPARSE_PARAM */ ! #if defined (__STDC__) || defined (__cplusplus) ! int ! yyparse (void) ! #else ! int ! yyparse () ! #endif ! #endif { ! register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ ! int yytoken = 0; /* Three stacks and their tools: `yyss': related to states, *************** yyparse (YYPARSE_PARAM_ARG) *** 675,681 **** Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; --- 858,864 ---- Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ ! /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; *************** yyparse (YYPARSE_PARAM_ARG) *** 685,715 **** YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; - #if YYLSP_NEEDED - /* The location stack. */ - YYLTYPE yylsa[YYINITDEPTH]; - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - #endif - #if YYLSP_NEEDED - # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) - #else - # define YYPOPSTACK (yyvsp--, yyssp--) - #endif ! YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! #if YYLSP_NEEDED ! YYLTYPE yyloc; ! #endif /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); --- 868,886 ---- YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; ! #define YYPOPSTACK (yyvsp--, yyssp--) + YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; ! /* When reducing, the number of symbols on the RHS of the reduced ! rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); *************** yyparse (YYPARSE_PARAM_ARG) *** 726,734 **** yyssp = yyss; yyvsp = yyvs; ! #if YYLSP_NEEDED ! yylsp = yyls; ! #endif goto yysetstate; /*------------------------------------------------------------. --- 897,903 ---- yyssp = yyss; yyvsp = yyvs; ! goto yysetstate; /*------------------------------------------------------------. *************** yyparse (YYPARSE_PARAM_ARG) *** 743,749 **** yysetstate: *yyssp = yystate; ! if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; --- 912,918 ---- yysetstate: *yyssp = yystate; ! if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; *************** yyparse (YYPARSE_PARAM_ARG) *** 756,788 **** YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. */ ! # if YYLSP_NEEDED ! YYLTYPE *yyls1 = yyls; ! /* This used to be a conditional around just the two extra args, ! but that might be undefined if yyoverflow is a macro. */ ! yyoverflow ("parser stack overflow", ! &yyss1, yysize * sizeof (*yyssp), ! &yyvs1, yysize * sizeof (*yyvsp), ! &yyls1, yysize * sizeof (*yylsp), ! &yystacksize); ! yyls = yyls1; ! # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); ! # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ /* Extend the stack our own way. */ ! if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; ! if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { --- 925,953 ---- YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; + /* Each stack pointer address is followed by the size of the ! data in use in that stack, in bytes. This used to be a ! conditional around just the two extra args, but that might ! be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), + &yystacksize); ! yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ + # ifndef YYSTACK_RELOCATE + goto yyoverflowlab; + # else /* Extend the stack our own way. */ ! if (YYMAXDEPTH <= yystacksize) goto yyoverflowlab; yystacksize *= 2; ! if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { *************** yyparse (YYPARSE_PARAM_ARG) *** 791,817 **** (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (short, yyss); ! YYSTACK_RELOCATE (YYSTYPE, yyvs); ! # if YYLSP_NEEDED ! YYSTACK_RELOCATE (YYLTYPE, yyls); ! # endif ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! #if YYLSP_NEEDED ! yylsp = yyls + yysize - 1; ! #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyssp >= yyss + yystacksize - 1) YYABORT; } --- 956,979 ---- (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; ! YYSTACK_RELOCATE (yyss); ! YYSTACK_RELOCATE (yyvs); ! ! # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } + # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; ! YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); ! if (yyss + yystacksize - 1 <= yyssp) YYABORT; } *************** yyparse (YYPARSE_PARAM_ARG) *** 819,825 **** goto yybackup; - /*-----------. | yybackup. | `-----------*/ --- 981,986 ---- *************** yybackup: *** 832,919 **** /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* yychar is either YYEMPTY or YYEOF ! or a valid token in external form. */ ! if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! /* Convert token to internal form (in yychar1) for indexing tables with */ ! ! if (yychar <= 0) /* This means end of input. */ { ! yychar1 = 0; ! yychar = YYEOF; /* Don't call YYLEX any more */ ! YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yychar1 = YYTRANSLATE (yychar); ! ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables ! which are defined only if `YYDEBUG' is set. */ ! if (yydebug) ! { ! YYFPRINTF (stderr, "Next token is %d (%s", ! yychar, yytname[yychar1]); ! /* Give the individual parser a way to print the precise ! meaning of a token, for further debugging info. */ ! # ifdef YYPRINT ! YYPRINT (stderr, yychar, yylval); ! # endif ! YYFPRINTF (stderr, ")\n"); ! } ! #endif } ! yyn += yychar1; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; - yyn = yytable[yyn]; ! ! /* yyn is what to do for this token type in this state. ! Negative => reduce, -yyn is rule number. ! Positive => shift, yyn is new state. ! New state is final state => don't bother to shift, ! just return success. ! 0, or most negative number => error. */ ! ! if (yyn < 0) { ! if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } - else if (yyn == 0) - goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %d (%s), ", ! yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif /* Count tokens shifted since error; after three, turn off error status. */ --- 993,1047 ---- /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; ! if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ ! /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } ! if (yychar <= YYEOF) { ! yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { ! yytoken = YYTRANSLATE (yychar); ! YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc); } ! /* If the proper action on seeing token YYTOKEN is to reduce or to ! detect an error, take that action. */ ! yyn += yytoken; ! if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; ! if (yyn <= 0) { ! if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ ! YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; ! /* Count tokens shifted since error; after three, turn off error status. */ *************** yyreduce: *** 944,1024 **** /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to the semantic value of ! the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; - #if YYLSP_NEEDED - /* Similarly for the default location. Let the user run additional - commands if for instance locations are ranges. */ - yyloc = yylsp[1-yylen]; - YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); - #endif ! #if YYDEBUG ! /* We have to keep this `#if YYDEBUG', since we use variables which ! are defined only if `YYDEBUG' is set. */ ! if (yydebug) { ! int yyi; ! ! YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", ! yyn, yyrline[yyn]); ! ! /* Print the symbols being reduced, and their result. */ ! for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) ! YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); ! YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); ! } ! #endif ! ! switch (yyn) { ! ! case 1: #line 76 "tradcif.y" ! { expression_value = yyvsp[0].integer.value; ; ! break;} ! case 3: #line 82 "tradcif.y" ! { yyval.integer = yyvsp[0].integer; ; ! break;} ! case 4: #line 87 "tradcif.y" ! { yyval.integer.value = - yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[0].integer.unsignedp; ; ! break;} ! case 5: #line 90 "tradcif.y" ! { yyval.integer.value = ! yyvsp[0].integer.value; ! yyval.integer.unsignedp = 0; ; ! break;} ! case 6: #line 93 "tradcif.y" ! { yyval.integer = yyvsp[0].integer; ; ! break;} ! case 7: #line 95 "tradcif.y" ! { yyval.integer.value = ~ yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[0].integer.unsignedp; ; ! break;} ! case 8: #line 98 "tradcif.y" ! { yyval.integer = yyvsp[-1].integer; ; ! break;} ! case 9: #line 103 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value * yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value * yyvsp[0].integer.value; ; ! break;} ! case 10: #line 109 "tradcif.y" ! { if (yyvsp[0].integer.value == 0) { error ("division by zero in #if"); yyvsp[0].integer.value = 1; --- 1072,1138 ---- /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. ! Otherwise, the following line sets YYVAL to garbage. ! This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; ! YY_REDUCE_PRINT (yyn); ! switch (yyn) { ! case 2: #line 76 "tradcif.y" ! { expression_value = yyvsp[0].integer.value; ;} ! break; ! ! case 4: #line 82 "tradcif.y" ! { yyval.integer = yyvsp[0].integer; ;} ! break; ! ! case 5: #line 87 "tradcif.y" ! { yyval.integer.value = - yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 6: #line 90 "tradcif.y" ! { yyval.integer.value = ! yyvsp[0].integer.value; ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 7: #line 93 "tradcif.y" ! { yyval.integer = yyvsp[0].integer; ;} ! break; ! ! case 8: #line 95 "tradcif.y" ! { yyval.integer.value = ~ yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 9: #line 98 "tradcif.y" ! { yyval.integer = yyvsp[-1].integer; ;} ! break; ! ! case 10: #line 103 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value * yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value * yyvsp[0].integer.value; ;} ! break; ! ! case 11: #line 109 "tradcif.y" ! { if (yyvsp[0].integer.value == 0) { error ("division by zero in #if"); yyvsp[0].integer.value = 1; *************** case 10: *** 1027,1037 **** if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value / yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value / yyvsp[0].integer.value; ; ! break;} ! case 11: #line 120 "tradcif.y" ! { if (yyvsp[0].integer.value == 0) { error ("division by zero in #if"); yyvsp[0].integer.value = 1; --- 1141,1152 ---- if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value / yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value / yyvsp[0].integer.value; ;} ! break; ! ! case 12: #line 120 "tradcif.y" ! { if (yyvsp[0].integer.value == 0) { error ("division by zero in #if"); yyvsp[0].integer.value = 1; *************** case 11: *** 1040,1193 **** if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value % yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value % yyvsp[0].integer.value; ; ! break;} ! case 12: #line 131 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value + yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 13: #line 134 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value - yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 14: #line 137 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value << yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value << yyvsp[0].integer.value; ; ! break;} ! case 15: #line 143 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value >> yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value >> yyvsp[0].integer.value; ; ! break;} ! case 16: #line 149 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value == yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ; ! break;} ! case 17: #line 152 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value != yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ; ! break;} ! case 18: #line 155 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value <= (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value <= yyvsp[0].integer.value; ; ! break;} ! case 19: #line 162 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value >= (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value >= yyvsp[0].integer.value; ; ! break;} ! case 20: #line 169 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value < (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value < yyvsp[0].integer.value; ; ! break;} ! case 21: #line 176 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value > (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value > yyvsp[0].integer.value; ; ! break;} ! case 22: #line 183 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value & yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 23: #line 186 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value ^ yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 24: #line 189 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value | yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 25: #line 192 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value && yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ; ! break;} ! case 26: #line 195 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value || yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ; ! break;} ! case 27: #line 198 "tradcif.y" ! { yyval.integer.value = yyvsp[-4].integer.value ? yyvsp[-2].integer.value : yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ; ! break;} ! case 28: #line 201 "tradcif.y" ! { yyval.integer = yylval.integer; ; ! break;} ! case 29: #line 203 "tradcif.y" ! { yyval.integer = yylval.integer; ; ! break;} ! case 30: #line 205 "tradcif.y" ! { yyval.integer.value = 0; ! yyval.integer.unsignedp = 0; ; ! break;} ! case 31: #line 207 "tradcif.y" ! { yyval.integer.value = ! test_assertion ((unsigned char **) &lexptr); ; ! break;} ! } - #line 731 "/usr/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; - #if YYLSP_NEEDED - yylsp -= yylen; - #endif ! #if YYDEBUG ! if (yydebug) ! { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif *++yyvsp = yyval; ! #if YYLSP_NEEDED ! *++yylsp = yyloc; ! #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule --- 1155,1317 ---- if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value % yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value % yyvsp[0].integer.value; ;} ! break; ! ! case 13: #line 131 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value + yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 14: #line 134 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value - yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 15: #line 137 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value << yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value << yyvsp[0].integer.value; ;} ! break; ! ! case 16: #line 143 "tradcif.y" ! { yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp; if (yyval.integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value >> yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value >> yyvsp[0].integer.value; ;} ! break; ! ! case 17: #line 149 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value == yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 18: #line 152 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value != yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 19: #line 155 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value <= (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value <= yyvsp[0].integer.value; ;} ! break; ! ! case 20: #line 162 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value >= (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value >= yyvsp[0].integer.value; ;} ! break; ! ! case 21: #line 169 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value < (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value < yyvsp[0].integer.value; ;} ! break; ! ! case 22: #line 176 "tradcif.y" ! { yyval.integer.unsignedp = 0; if (yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp) yyval.integer.value = (unsigned) yyvsp[-2].integer.value > (unsigned) yyvsp[0].integer.value; else ! yyval.integer.value = yyvsp[-2].integer.value > yyvsp[0].integer.value; ;} ! break; ! ! case 23: #line 183 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value & yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 24: #line 186 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value ^ yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 25: #line 189 "tradcif.y" ! { yyval.integer.value = yyvsp[-2].integer.value | yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 26: #line 192 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value && yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 27: #line 195 "tradcif.y" ! { yyval.integer.value = (yyvsp[-2].integer.value || yyvsp[0].integer.value); ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 28: #line 198 "tradcif.y" ! { yyval.integer.value = yyvsp[-4].integer.value ? yyvsp[-2].integer.value : yyvsp[0].integer.value; ! yyval.integer.unsignedp = yyvsp[-2].integer.unsignedp || yyvsp[0].integer.unsignedp; ;} ! break; ! ! case 29: #line 201 "tradcif.y" ! { yyval.integer = yylval.integer; ;} ! break; ! ! case 30: #line 203 "tradcif.y" ! { yyval.integer = yylval.integer; ;} ! break; ! ! case 31: #line 205 "tradcif.y" ! { yyval.integer.value = 0; ! yyval.integer.unsignedp = 0; ;} ! break; ! ! case 32: #line 207 "tradcif.y" ! { yyval.integer.value = ! test_assertion ((unsigned char **) &lexptr); ;} ! break; + } + + /* Line 991 of yacc.c. */ + #line 1305 "tr11499.c" yyvsp -= yylen; yyssp -= yylen; ! ! YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; ! /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule *************** case 31: *** 1195,1205 **** yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTBASE] + *yyssp; ! if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; --- 1319,1329 ---- yyn = yyr1[yyn]; ! yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; ! if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else ! yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; *************** yyerrlab: *** 1212,1224 **** if (!yyerrstatus) { ++yynerrs; ! ! #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; ! if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; --- 1336,1348 ---- if (!yyerrstatus) { ++yynerrs; ! #if YYERROR_VERBOSE yyn = yypact[yystate]; ! if (YYPACT_NINF < yyn && yyn < YYLAST) { YYSIZE_T yysize = 0; + int yytype = YYTRANSLATE (yychar); char *yymsg; int yyx, yycount; *************** yyerrlab: *** 1227,1241 **** YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("parse error, unexpected ") + 1; ! yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "parse error, unexpected "); ! yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { --- 1351,1365 ---- YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) yysize += yystrlen (yytname[yyx]) + 15, yycount++; ! yysize += yystrlen ("syntax error, unexpected ") + 1; ! yysize += yystrlen (yytname[yytype]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { ! char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); ! yyp = yystpcpy (yyp, yytname[yytype]); if (yycount < 5) { *************** yyerrlab: *** 1243,1249 **** for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); --- 1367,1373 ---- for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) ! if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); *************** yyerrlab: *** 1255,1356 **** YYSTACK_FREE (yymsg); } else ! yyerror ("parse error; also virtual memory exhausted"); } else ! #endif /* defined (YYERROR_VERBOSE) */ ! yyerror ("parse error"); } - goto yyerrlab1; ! /*--------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action | ! `--------------------------------------------------*/ ! yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* return failure if at end of input */ if (yychar == YYEOF) ! YYABORT; ! YYDPRINTF ((stderr, "Discarding token %d (%s).\n", ! yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ - yyerrstatus = 3; /* Each real token shifted decrements this */ ! goto yyerrhandle; - /*-------------------------------------------------------------------. - | yyerrdefault -- current state does not do anything special for the | - | error token. | - `-------------------------------------------------------------------*/ - yyerrdefault: - #if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ ! /* If its default is to accept any token, ok. Otherwise pop it. */ ! yyn = yydefact[yystate]; ! if (yyn) ! goto yydefault; ! #endif /*---------------------------------------------------------------. ! | yyerrpop -- pop the current state because it cannot handle the | ! | error token | `---------------------------------------------------------------*/ ! yyerrpop: ! if (yyssp == yyss) ! YYABORT; ! yyvsp--; ! yystate = *--yyssp; ! #if YYLSP_NEEDED ! yylsp--; ! #endif ! #if YYDEBUG ! if (yydebug) { ! short *yyssp1 = yyss - 1; ! YYFPRINTF (stderr, "Error: state stack now"); ! while (yyssp1 != yyssp) ! YYFPRINTF (stderr, " %d", *++yyssp1); ! YYFPRINTF (stderr, "\n"); ! } ! #endif ! /*--------------. ! | yyerrhandle. | ! `--------------*/ ! yyerrhandle: ! yyn = yypact[yystate]; ! if (yyn == YYFLAG) ! goto yyerrdefault; ! yyn += YYTERROR; ! if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) ! goto yyerrdefault; ! yyn = yytable[yyn]; ! if (yyn < 0) ! { ! if (yyn == YYFLAG) ! goto yyerrpop; ! yyn = -yyn; ! goto yyreduce; } - else if (yyn == 0) - goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; --- 1379,1470 ---- YYSTACK_FREE (yymsg); } else ! yyerror ("syntax error; also virtual memory exhausted"); } else ! #endif /* YYERROR_VERBOSE */ ! yyerror ("syntax error"); } ! if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ ! /* Return failure if at end of input. */ if (yychar == YYEOF) ! { ! /* Pop the error token. */ ! YYPOPSTACK; ! /* Pop the rest of the stack. */ ! while (yyss < yyssp) ! { ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[*yyssp], yyvsp); ! YYPOPSTACK; ! } ! YYABORT; ! } ! ! YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); ! yydestruct (yytoken, &yylval); yychar = YYEMPTY; + } /* Else will try to reuse lookahead token after shifting the error token. */ + goto yyerrlab2; ! /*----------------------------------------------------. ! | yyerrlab1 -- error raised explicitly by an action. | ! `----------------------------------------------------*/ ! yyerrlab1: + /* Suppress GCC warning that yyerrlab1 is unused when no action + invokes YYERROR. */ + #if defined (__GNUC_MINOR__) && 2093 <= (__GNUC__ * 1000 + __GNUC_MINOR__) + __attribute__ ((__unused__)); + #endif ! goto yyerrlab2; /*---------------------------------------------------------------. ! | yyerrlab2 -- pop states until the error token can be shifted. | `---------------------------------------------------------------*/ ! yyerrlab2: ! yyerrstatus = 3; /* Each real token shifted decrements this. */ ! for (;;) { ! yyn = yypact[yystate]; ! if (yyn != YYPACT_NINF) ! { ! yyn += YYTERROR; ! if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) ! { ! yyn = yytable[yyn]; ! if (0 < yyn) ! break; ! } ! } ! /* Pop the current state because it cannot handle the error token. */ ! if (yyssp == yyss) ! YYABORT; ! YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); ! yydestruct (yystos[yystate], yyvsp); ! yyvsp--; ! yystate = *--yyssp; ! YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *************** yyerrhandle: *** 1358,1366 **** YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! #if YYLSP_NEEDED ! *++yylsp = yylloc; ! #endif yystate = yyn; goto yynewstate; --- 1472,1478 ---- YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; ! yystate = yyn; goto yynewstate; *************** yyabortlab: *** 1380,1392 **** yyresult = 1; goto yyreturn; ! /*---------------------------------------------. ! | yyoverflowab -- parser overflow comes here. | ! `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow --- 1492,1506 ---- yyresult = 1; goto yyreturn; ! #ifndef yyoverflow ! /*----------------------------------------------. ! | yyoverflowlab -- parser overflow comes here. | ! `----------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ + #endif yyreturn: #ifndef yyoverflow *************** yyreturn: *** 1395,1400 **** --- 1509,1516 ---- #endif return yyresult; } + + #line 210 "tradcif.y" *************** parse_c_expression (string) *** 1754,1756 **** --- 1870,1874 ---- return expression_value; /* set by yyparse () */ } + + diff -Nrc3pad gcc-3.2.2/gcc/tree-inline.c gcc-3.2.3/gcc/tree-inline.c *** gcc-3.2.2/gcc/tree-inline.c Fri Oct 25 22:11:09 2002 --- gcc-3.2.3/gcc/tree-inline.c Fri Mar 14 14:59:27 2003 *************** initialize_inlined_parameters (id, args, *** 509,514 **** --- 509,518 ---- if (DECL_P (value)) value = build1 (NOP_EXPR, TREE_TYPE (value), value); + /* If this is a constant, make sure it has the right type. */ + else if (TREE_TYPE (value) != TREE_TYPE (p)) + value = fold (build1 (NOP_EXPR, TREE_TYPE (p), value)); + splay_tree_insert (id->decl_map, (splay_tree_key) p, (splay_tree_value) value); diff -Nrc3pad gcc-3.2.2/gcc/tree.c gcc-3.2.3/gcc/tree.c *** gcc-3.2.2/gcc/tree.c Fri Dec 6 00:58:46 2002 --- gcc-3.2.3/gcc/tree.c Sun Mar 16 19:47:34 2003 *************** get_narrower (op, unsignedp_ptr) *** 4236,4245 **** /* See what's inside this conversion. If we decide to strip it, we will set WIN. */ - op = TREE_OPERAND (op, 0); if (bitschange > 0) { /* An extension: the outermost one can be stripped, but remember whether it is zero or sign extension. */ if (first) --- 4236,4245 ---- /* See what's inside this conversion. If we decide to strip it, we will set WIN. */ if (bitschange > 0) { + op = TREE_OPERAND (op, 0); /* An extension: the outermost one can be stripped, but remember whether it is zero or sign extension. */ if (first) *************** get_narrower (op, unsignedp_ptr) *** 4258,4263 **** --- 4258,4264 ---- if (first) uns = TREE_UNSIGNED (TREE_TYPE (op)); first = 0; + op = TREE_OPERAND (op, 0); } win = op; diff -Nrc3pad gcc-3.2.2/gcc/unroll.c gcc-3.2.3/gcc/unroll.c *** gcc-3.2.2/gcc/unroll.c Thu Oct 3 19:40:44 2002 --- gcc-3.2.3/gcc/unroll.c Tue Mar 25 20:23:25 2003 *************** unroll_loop (loop, insn_count, strength_ *** 353,361 **** jump to the loop condition. Make sure to delete the jump insn, otherwise the loop body will never execute. */ rtx ujump = ujump_to_loop_cont (loop->start, loop->cont); - if (ujump) - delete_related_insns (ujump); /* If number of iterations is exactly 1, then eliminate the compare and branch at the end of the loop since they will never be taken. --- 353,363 ---- jump to the loop condition. Make sure to delete the jump insn, otherwise the loop body will never execute. */ + /* FIXME this actually checks for a jump to the continue point, which + is not the same as the condition in a for loop. As a result, this + optimization fails for most for loops. We should really use flow + information rather than instruction pattern matching. */ rtx ujump = ujump_to_loop_cont (loop->start, loop->cont); /* If number of iterations is exactly 1, then eliminate the compare and branch at the end of the loop since they will never be taken. *************** unroll_loop (loop, insn_count, strength_ *** 367,375 **** if (GET_CODE (last_loop_insn) == BARRIER) { /* Delete the jump insn. This will delete the barrier also. */ ! delete_related_insns (PREV_INSN (last_loop_insn)); } ! else if (GET_CODE (last_loop_insn) == JUMP_INSN) { #ifdef HAVE_cc0 rtx prev = PREV_INSN (last_loop_insn); --- 369,378 ---- if (GET_CODE (last_loop_insn) == BARRIER) { /* Delete the jump insn. This will delete the barrier also. */ ! last_loop_insn = PREV_INSN (last_loop_insn); } ! ! if (ujump && GET_CODE (last_loop_insn) == JUMP_INSN) { #ifdef HAVE_cc0 rtx prev = PREV_INSN (last_loop_insn); *************** unroll_loop (loop, insn_count, strength_ *** 381,404 **** if (only_sets_cc0_p (prev)) delete_related_insns (prev); #endif - } ! /* Remove the loop notes since this is no longer a loop. */ ! if (loop->vtop) ! delete_related_insns (loop->vtop); ! if (loop->cont) ! delete_related_insns (loop->cont); ! if (loop_start) ! delete_related_insns (loop_start); ! if (loop_end) ! delete_related_insns (loop_end); ! return; } ! else if (loop_info->n_iterations > 0 ! /* Avoid overflow in the next expression. */ ! && loop_info->n_iterations < MAX_UNROLLED_INSNS ! && loop_info->n_iterations * insn_count < MAX_UNROLLED_INSNS) { unroll_number = loop_info->n_iterations; unroll_type = UNROLL_COMPLETELY; --- 384,410 ---- if (only_sets_cc0_p (prev)) delete_related_insns (prev); #endif ! delete_related_insns (ujump); ! /* Remove the loop notes since this is no longer a loop. */ ! if (loop->vtop) ! delete_related_insns (loop->vtop); ! if (loop->cont) ! delete_related_insns (loop->cont); ! if (loop_start) ! delete_related_insns (loop_start); ! if (loop_end) ! delete_related_insns (loop_end); ! ! return; ! } } ! ! if (loop_info->n_iterations > 0 ! /* Avoid overflow in the next expression. */ ! && loop_info->n_iterations < MAX_UNROLLED_INSNS ! && loop_info->n_iterations * insn_count < MAX_UNROLLED_INSNS) { unroll_number = loop_info->n_iterations; unroll_type = UNROLL_COMPLETELY; *************** calculate_giv_inc (pattern, src_insn, re *** 1636,1646 **** } else if (GET_CODE (increment) == IOR || GET_CODE (increment) == ASHIFT ! || GET_CODE (increment) == PLUS) { /* The rs6000 port loads some constants with IOR. ! The alpha port loads some constants with ASHIFT and PLUS. */ rtx second_part = XEXP (increment, 1); enum rtx_code code = GET_CODE (increment); --- 1642,1654 ---- } else if (GET_CODE (increment) == IOR + || GET_CODE (increment) == PLUS || GET_CODE (increment) == ASHIFT ! || GET_CODE (increment) == LSHIFTRT) { /* The rs6000 port loads some constants with IOR. ! The alpha port loads some constants with ASHIFT and PLUS. ! The sparc64 port loads some constants with LSHIFTRT. */ rtx second_part = XEXP (increment, 1); enum rtx_code code = GET_CODE (increment); *************** calculate_giv_inc (pattern, src_insn, re *** 1657,1664 **** increment = GEN_INT (INTVAL (increment) | INTVAL (second_part)); else if (code == PLUS) increment = GEN_INT (INTVAL (increment) + INTVAL (second_part)); ! else increment = GEN_INT (INTVAL (increment) << INTVAL (second_part)); } if (GET_CODE (increment) != CONST_INT) --- 1665,1674 ---- increment = GEN_INT (INTVAL (increment) | INTVAL (second_part)); else if (code == PLUS) increment = GEN_INT (INTVAL (increment) + INTVAL (second_part)); ! else if (code == ASHIFT) increment = GEN_INT (INTVAL (increment) << INTVAL (second_part)); + else + increment = GEN_INT ((unsigned HOST_WIDE_INT) INTVAL (increment) >> INTVAL (second_part)); } if (GET_CODE (increment) != CONST_INT) diff -Nrc3pad gcc-3.2.2/gcc/version.c gcc-3.2.3/gcc/version.c *** gcc-3.2.2/gcc/version.c Wed Feb 5 03:02:26 2003 --- gcc-3.2.3/gcc/version.c Tue Apr 22 06:16:03 2003 *************** *** 1,4 **** #include "ansidecl.h" #include "version.h" ! const char *const version_string = "3.2.2"; --- 1,4 ---- #include "ansidecl.h" #include "version.h" ! const char *const version_string = "3.2.3"; diff -Nrc3pad gcc-3.2.2/gnats.html gcc-3.2.3/gnats.html *** gcc-3.2.2/gnats.html Wed Feb 5 03:09:26 2003 --- gcc-3.2.3/gnats.html Tue Apr 22 06:56:26 2003 *************** *** 4,12 **** Submitting Bug Reports using GNATS

    Submitting Bug Reports using GNATS

    -

    gnatsweb and gccbug

    GNATS, the GNU bug tracking system, is used to track GCC bug reports. --- 4,12 ---- Submitting Bug Reports using GNATS +

    Submitting Bug Reports using GNATS

    gnatsweb and gccbug

    GNATS, the GNU bug tracking system, is used to track GCC bug reports. diff -Nrc3pad gcc-3.2.2/include/ChangeLog gcc-3.2.3/include/ChangeLog *** gcc-3.2.2/include/ChangeLog Wed Feb 5 03:02:24 2003 --- gcc-3.2.3/include/ChangeLog Tue Apr 22 06:15:22 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libf2c/ChangeLog gcc-3.2.3/libf2c/ChangeLog *** gcc-3.2.2/libf2c/ChangeLog Wed Feb 5 03:02:11 2003 --- gcc-3.2.3/libf2c/ChangeLog Tue Apr 22 06:15:25 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libf2c/libF77/Version.c gcc-3.2.3/libf2c/libF77/Version.c *** gcc-3.2.2/libf2c/libF77/Version.c Wed Feb 5 03:03:05 2003 --- gcc-3.2.3/libf2c/libF77/Version.c Tue Apr 22 00:16:27 2003 *************** static char junk[] = "\n@(#)LIBF77 VERSI *** 3,9 **** /* */ ! char __G77_LIBF77_VERSION__[] = "3.2.2 20030205 (release)"; /* 2.00 11 June 1980. File version.c added to library. --- 3,9 ---- /* */ ! char __G77_LIBF77_VERSION__[] = "3.2.2 20030422 (release)"; /* 2.00 11 June 1980. File version.c added to library. diff -Nrc3pad gcc-3.2.2/libf2c/libI77/Version.c gcc-3.2.3/libf2c/libI77/Version.c *** gcc-3.2.2/libf2c/libI77/Version.c Wed Feb 5 03:03:08 2003 --- gcc-3.2.3/libf2c/libI77/Version.c Tue Apr 22 00:16:27 2003 *************** static char junk[] = "\n@(#) LIBI77 VERS *** 3,9 **** /* */ ! char __G77_LIBI77_VERSION__[] = "3.2.2 20030205 (release)"; /* 2.01 $ format added --- 3,9 ---- /* */ ! char __G77_LIBI77_VERSION__[] = "3.2.2 20030422 (release)"; /* 2.01 $ format added diff -Nrc3pad gcc-3.2.2/libf2c/libU77/Version.c gcc-3.2.3/libf2c/libU77/Version.c *** gcc-3.2.2/libf2c/libU77/Version.c Wed Feb 5 03:03:11 2003 --- gcc-3.2.3/libf2c/libU77/Version.c Tue Apr 22 00:16:27 2003 *************** *** 1,6 **** static char junk[] = "\n@(#) LIBU77 VERSION 19980709\n"; ! char __G77_LIBU77_VERSION__[] = "3.2.2 20030205 (release)"; #include --- 1,6 ---- static char junk[] = "\n@(#) LIBU77 VERSION 19980709\n"; ! char __G77_LIBU77_VERSION__[] = "3.2.2 20030422 (release)"; #include diff -Nrc3pad gcc-3.2.2/libffi/ChangeLog gcc-3.2.3/libffi/ChangeLog *** gcc-3.2.2/libffi/ChangeLog Wed Feb 5 03:02:14 2003 --- gcc-3.2.3/libffi/ChangeLog Tue Apr 22 06:15:28 2003 *************** *** 1,3 **** --- 1,26 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-02-08 Andreas Tobler + + * libffi/src/powerpc/darwin_closure.S: + Fix alignement bug, allocate 8 bytes for the result. + * libffi/src/powerpc/aix_closure.S: + Likewise. + * libffi/src/powerpc/ffi_darwin.c: + Update stackframe description for aix/darwin_closure.S. + + 2003-02-07 Andreas Tobler + + * libffi/src/ffitest.c + add closure testcases + + 2003-02-07 Kevin B. Hendricks + + * libffi/src/powerpc/ffi.c + fix alignment bug for float (4 byte aligned iso 8 byte) + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libffi/src/ffitest.c gcc-3.2.3/libffi/src/ffitest.c *** gcc-3.2.2/libffi/src/ffitest.c Sun Feb 24 17:31:45 2002 --- gcc-3.2.3/libffi/src/ffitest.c Sat Feb 8 07:54:39 2003 *************** *** 1,5 **** /* ----------------------------------------------------------------------- ! ffitest.c - Copyright (c) 1996, 1997, 1998 Cygnus Solutions Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the --- 1,5 ---- /* ----------------------------------------------------------------------- ! ffitest.c - Copyright (c) 1996, 1997, 1998, 2002, 2003 Red Hat, Inc. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the *************** static test_structure_5 struct5(test_str *** 196,209 **** /* Take an int and a float argument, together with int userdata, and */ /* return the sum. */ ! static void closure_test_fn(ffi_cif* cif,void* resp,void** args, void* userdata) { ! *(int*)resp = ! *(int *)args[0] + (int)(*(float *)args[1]) + (int)(long)userdata; } ! typedef int (*closure_test_type)(int, float); int main(/*@unused@*/ int argc, /*@unused@*/ char *argv[]) { ffi_cif cif; --- 196,321 ---- /* Take an int and a float argument, together with int userdata, and */ /* return the sum. */ ! #if FFI_CLOSURES ! static void ! closure_test_fn(ffi_cif* cif,void* resp,void** args, void* userdata) { ! *(ffi_arg*)resp = ! (int)*(unsigned long long *)args[0] + (int)(*(int *)args[1]) + ! (int)(*(unsigned long long *)args[2]) + (int)*(int *)args[3] + ! (int)(*(signed short *)args[4]) + ! (int)(*(unsigned long long *)args[5]) + ! (int)*(int *)args[6] + (int)(*(int *)args[7]) + ! (int)(*(double *)args[8]) + (int)*(int *)args[9] + ! (int)(*(int *)args[10]) + (int)(*(float *)args[11]) + ! (int)*(int *)args[12] + (int)(*(int *)args[13]) + ! (int)(*(int *)args[14]) + *(int *)args[15] + (int)(long)userdata; ! ! printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d: %d\n", ! (int)*(unsigned long long *)args[0], (int)(*(int *)args[1]), ! (int)(*(unsigned long long *)args[2]), ! (int)*(int *)args[3], (int)(*(signed short *)args[4]), ! (int)(*(unsigned long long *)args[5]), ! (int)*(int *)args[6], (int)(*(int *)args[7]), ! (int)(*(double *)args[8]), (int)*(int *)args[9], ! (int)(*(int *)args[10]), (int)(*(float *)args[11]), ! (int)*(int *)args[12], (int)(*(int *)args[13]), ! (int)(*(int *)args[14]),*(int *)args[15], ! (int)(long)userdata, *(int*)resp); } ! typedef int (*closure_test_type)(unsigned long long, int, unsigned long long, ! int, signed short, unsigned long long, int, ! int, double, int, int, float, int, int, ! int, int); + static void closure_test_fn1(ffi_cif* cif,void* resp,void** args, + void* userdata) + { + *(ffi_arg*)resp = + (int)*(float *)args[0] +(int)(*(float *)args[1]) + + (int)(*(float *)args[2]) + (int)*(float *)args[3] + + (int)(*(signed short *)args[4]) + (int)(*(float *)args[5]) + + (int)*(float *)args[6] + (int)(*(int *)args[7]) + + (int)(*(double*)args[8]) + (int)*(int *)args[9] + + (int)(*(int *)args[10]) + (int)(*(float *)args[11]) + + (int)*(int *)args[12] + (int)(*(int *)args[13]) + + (int)(*(int *)args[14]) + *(int *)args[15] + (int)(long)userdata; + + printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d: %d\n", + (int)*(float *)args[0], (int)(*(float *)args[1]), + (int)(*(float *)args[2]), (int)*(float *)args[3], + (int)(*(signed short *)args[4]), (int)(*(float *)args[5]), + (int)*(float *)args[6], (int)(*(int *)args[7]), + (int)(*(double *)args[8]), (int)*(int *)args[9], + (int)(*(int *)args[10]), (int)(*(float *)args[11]), + (int)*(int *)args[12], (int)(*(int *)args[13]), + (int)(*(int *)args[14]), *(int *)args[15], + (int)(long)userdata, *(int*)resp); + } + + typedef int (*closure_test_type1)(float, float, float, float, signed short, + float, float, int, double, int, int, float, + int, int, int, int); + + static void closure_test_fn2(ffi_cif* cif,void* resp,void** args, + void* userdata) + { + *(ffi_arg*)resp = + (int)*(double *)args[0] +(int)(*(double *)args[1]) + + (int)(*(double *)args[2]) + (int)*(double *)args[3] + + (int)(*(signed short *)args[4]) + (int)(*(double *)args[5]) + + (int)*(double *)args[6] + (int)(*(int *)args[7]) + + (int)(*(double *)args[8]) + (int)*(int *)args[9] + + (int)(*(int *)args[10]) + (int)(*(float *)args[11]) + + (int)*(int *)args[12] + (int)(*(float *)args[13]) + + (int)(*(int *)args[14]) + *(int *)args[15] + (int)(long)userdata; + + printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d: %d\n", + (int)*(double *)args[0], (int)(*(double *)args[1]), + (int)(*(double *)args[2]), (int)*(double *)args[3], + (int)(*(signed short *)args[4]), (int)(*(double *)args[5]), + (int)*(double *)args[6], (int)(*(int *)args[7]), + (int)(*(double*)args[8]), (int)*(int *)args[9], + (int)(*(int *)args[10]), (int)(*(float *)args[11]), + (int)*(int *)args[12], (int)(*(float *)args[13]), + (int)(*(int *)args[14]), *(int *)args[15], (int)(long)userdata, + *(int*)resp); + } + + typedef int (*closure_test_type2)(double, double, double, double, signed short, + double, double, int, double, int, int, float, + int, float, int, int); + + static void closure_test_fn3(ffi_cif* cif,void* resp,void** args, + void* userdata) + { + *(ffi_arg*)resp = + (int)*(float *)args[0] +(int)(*(float *)args[1]) + + (int)(*(float *)args[2]) + (int)*(float *)args[3] + + (int)(*(float *)args[4]) + (int)(*(float *)args[5]) + + (int)*(float *)args[6] + (int)(*(float *)args[7]) + + (int)(*(double *)args[8]) + (int)*(int *)args[9] + + (int)(*(float *)args[10]) + (int)(*(float *)args[11]) + + (int)*(int *)args[12] + (int)(*(float *)args[13]) + + (int)(*(float *)args[14]) + *(int *)args[15] + (int)(long)userdata; + + printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d: %d\n", + (int)*(float *)args[0], (int)(*(float *)args[1]), + (int)(*(float *)args[2]), (int)*(float *)args[3], + (int)(*(float *)args[4]), (int)(*(float *)args[5]), + (int)*(float *)args[6], (int)(*(float *)args[7]), + (int)(*(double *)args[8]), (int)*(int *)args[9], + (int)(*(float *)args[10]), (int)(*(float *)args[11]), + (int)*(int *)args[12], (int)(*(float *)args[13]), + (int)(*(float *)args[14]), *(int *)args[15], (int)(long)userdata, + *(int*)resp); + } + + typedef int (*closure_test_type3)(float, float, float, float, float, float, + float, float, double, int, float, float, int, + float, float, int); + #endif int main(/*@unused@*/ int argc, /*@unused@*/ char *argv[]) { ffi_cif cif; *************** int main(/*@unused@*/ int argc, /*@unuse *** 225,230 **** --- 337,350 ---- ffi_arg rint; long long rlonglong; + # if FFI_CLOSURES + /* The closure must not be an automatic variable on + platforms (Solaris) that forbid stack execution by default. */ + static ffi_closure cl; + #endif + + ffi_type * cl_arg_types[17]; + ffi_type ts1_type; ffi_type ts2_type; ffi_type ts3_type; *************** int main(/*@unused@*/ int argc, /*@unuse *** 704,727 **** # if FFI_CLOSURES /* A simple closure test */ { ! ffi_closure cl; ! ffi_type * cl_arg_types[3]; ! cl_arg_types[0] = &ffi_type_sint; cl_arg_types[1] = &ffi_type_float; ! cl_arg_types[2] = NULL; /* Initialize the cif */ ! CHECK(ffi_prep_cif(&cif, FFI_DEFAULT_ABI, 2, ! &ffi_type_sint, cl_arg_types) == FFI_OK); ! CHECK(ffi_prep_closure(&cl, &cif, closure_test_fn, ! (void *) 3 /* userdata */) ! == FFI_OK); ! CHECK((*((closure_test_type)(&cl)))(1, 2.0) == 6); } - # endif /* If we arrived here, all is good */ (void) puts("\nLooks good. No surprises.\n"); --- 824,961 ---- # if FFI_CLOSURES /* A simple closure test */ { ! (void) puts("\nEnter FFI_CLOSURES\n"); ! cl_arg_types[0] = &ffi_type_uint64; ! cl_arg_types[1] = &ffi_type_uint; ! cl_arg_types[2] = &ffi_type_uint64; ! cl_arg_types[3] = &ffi_type_uint; ! cl_arg_types[4] = &ffi_type_sshort; ! cl_arg_types[5] = &ffi_type_uint64; ! cl_arg_types[6] = &ffi_type_uint; ! cl_arg_types[7] = &ffi_type_uint; ! cl_arg_types[8] = &ffi_type_double; ! cl_arg_types[9] = &ffi_type_uint; ! cl_arg_types[10] = &ffi_type_uint; ! cl_arg_types[11] = &ffi_type_float; ! cl_arg_types[12] = &ffi_type_uint; ! cl_arg_types[13] = &ffi_type_uint; ! cl_arg_types[14] = &ffi_type_uint; ! cl_arg_types[15] = &ffi_type_uint; ! cl_arg_types[16] = NULL; ! ! /* Initialize the cif */ ! CHECK(ffi_prep_cif(&cif, FFI_DEFAULT_ABI, 16, ! &ffi_type_sint, cl_arg_types) == FFI_OK); ! ! CHECK(ffi_prep_closure(&cl, &cif, closure_test_fn, ! (void *) 3 /* userdata */) == FFI_OK); ! ! CHECK((*((closure_test_type)(&cl))) ! (1LL, 2, 3LL, 4, 127, 429LL, 7, 8, 9.5, 10, 11, 12, 13, ! 19, 21, 1) == 680); ! } ! ! { ! ! cl_arg_types[0] = &ffi_type_float; cl_arg_types[1] = &ffi_type_float; ! cl_arg_types[2] = &ffi_type_float; ! cl_arg_types[3] = &ffi_type_float; ! cl_arg_types[4] = &ffi_type_sshort; ! cl_arg_types[5] = &ffi_type_float; ! cl_arg_types[6] = &ffi_type_float; ! cl_arg_types[7] = &ffi_type_uint; ! cl_arg_types[8] = &ffi_type_double; ! cl_arg_types[9] = &ffi_type_uint; ! cl_arg_types[10] = &ffi_type_uint; ! cl_arg_types[11] = &ffi_type_float; ! cl_arg_types[12] = &ffi_type_uint; ! cl_arg_types[13] = &ffi_type_uint; ! cl_arg_types[14] = &ffi_type_uint; ! cl_arg_types[15] = &ffi_type_uint; ! cl_arg_types[16] = NULL; /* Initialize the cif */ ! CHECK(ffi_prep_cif(&cif, FFI_DEFAULT_ABI, 16, ! &ffi_type_sint, cl_arg_types) == FFI_OK); ! CHECK(ffi_prep_closure(&cl, &cif, closure_test_fn1, ! (void *) 3 /* userdata */) == FFI_OK); ! ! CHECK((*((closure_test_type1)(&cl))) ! (1.1, 2.2, 3.3, 4.4, 127, 5.5, 6.6, 8, 9, 10, 11, 12.0, 13, ! 19, 21, 1) == 255); } + { + + cl_arg_types[0] = &ffi_type_double; + cl_arg_types[1] = &ffi_type_double; + cl_arg_types[2] = &ffi_type_double; + cl_arg_types[3] = &ffi_type_double; + cl_arg_types[4] = &ffi_type_sshort; + cl_arg_types[5] = &ffi_type_double; + cl_arg_types[6] = &ffi_type_double; + cl_arg_types[7] = &ffi_type_uint; + cl_arg_types[8] = &ffi_type_double; + cl_arg_types[9] = &ffi_type_uint; + cl_arg_types[10] = &ffi_type_uint; + cl_arg_types[11] = &ffi_type_float; + cl_arg_types[12] = &ffi_type_uint; + cl_arg_types[13] = &ffi_type_float; + cl_arg_types[14] = &ffi_type_uint; + cl_arg_types[15] = &ffi_type_uint; + cl_arg_types[16] = NULL; + + /* Initialize the cif */ + CHECK(ffi_prep_cif(&cif, FFI_DEFAULT_ABI, 16, + &ffi_type_sint, cl_arg_types) == FFI_OK); + + CHECK(ffi_prep_closure(&cl, &cif, closure_test_fn2, + (void *) 3 /* userdata */) == FFI_OK); + + CHECK((*((closure_test_type2)(&cl))) + (1, 2, 3, 4, 127, 5, 6, 8, 9, 10, 11, 12.0, 13, + 19.0, 21, 1) == 255); + + } + + { + + cl_arg_types[0] = &ffi_type_float; + cl_arg_types[1] = &ffi_type_float; + cl_arg_types[2] = &ffi_type_float; + cl_arg_types[3] = &ffi_type_float; + cl_arg_types[4] = &ffi_type_float; + cl_arg_types[5] = &ffi_type_float; + cl_arg_types[6] = &ffi_type_float; + cl_arg_types[7] = &ffi_type_float; + cl_arg_types[8] = &ffi_type_double; + cl_arg_types[9] = &ffi_type_uint; + cl_arg_types[10] = &ffi_type_float; + cl_arg_types[11] = &ffi_type_float; + cl_arg_types[12] = &ffi_type_uint; + cl_arg_types[13] = &ffi_type_float; + cl_arg_types[14] = &ffi_type_float; + cl_arg_types[15] = &ffi_type_uint; + cl_arg_types[16] = NULL; + + /* Initialize the cif */ + CHECK(ffi_prep_cif(&cif, FFI_DEFAULT_ABI, 16, + &ffi_type_sint, cl_arg_types) == FFI_OK); + + CHECK(ffi_prep_closure(&cl, &cif, closure_test_fn3, + (void *) 3 /* userdata */) == FFI_OK); + + CHECK((*((closure_test_type3)(&cl))) + (1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7, 8.8, 9, 10, 11.11, 12.0, 13, + 19.19, 21.21, 1) == 135); + } + + (void) puts("\nFinished FFI_CLOSURES\n"); + + # endif /* If we arrived here, all is good */ (void) puts("\nLooks good. No surprises.\n"); diff -Nrc3pad gcc-3.2.2/libffi/src/powerpc/aix_closure.S gcc-3.2.3/libffi/src/powerpc/aix_closure.S *** gcc-3.2.2/libffi/src/powerpc/aix_closure.S Tue Mar 12 22:35:56 2002 --- gcc-3.2.3/libffi/src/powerpc/aix_closure.S Sat Feb 8 08:04:17 2003 *************** *** 1,6 **** /* ----------------------------------------------------------------------- ! aix_closures.S - Copyright (c) 2002 Free Software Foundation, Inc. ! based on darwin_closures.S PowerPC Assembly glue. --- 1,6 ---- /* ----------------------------------------------------------------------- ! aix_closure.S - Copyright (c) 2002 2003 Free Software Foundation, Inc. ! based on darwin_closure.S PowerPC Assembly glue. *************** ffi_closure_ASM: *** 106,129 **** /* 24 Bytes (Linkage Area) */ /* 32 Bytes (params) */ /* 104 Bytes (13*8 from FPR) */ ! /* 4 Bytes (result) ! /* 164 Bytes */ ! stwu r1,-164(r1) /* skip over caller save area */ /* we want to build up an area for the parameters passed */ /* in registers (both floating point and integer) */ ! /* we store gpr 3 to gpr 10 (aligned to 4) */ ! /* in the parents outgoing area */ ! stw r3, 188(r1) ! stw r4, 192(r1) ! stw r5, 196(r1) ! stw r6, 200(r1) ! stw r7, 204(r1) ! stw r8, 208(r1) ! stw r9, 212(r1) ! stw r10, 216(r1) /* next save fpr 1 to fpr 13 (aligned to 8) */ stfd f1, 56(r1) --- 106,130 ---- /* 24 Bytes (Linkage Area) */ /* 32 Bytes (params) */ /* 104 Bytes (13*8 from FPR) */ ! /* 8 Bytes (result) ! /* 168 Bytes */ ! stwu r1,-176(r1) /* skip over caller save area ! keep stack aligned to 16 */ /* we want to build up an area for the parameters passed */ /* in registers (both floating point and integer) */ ! /* we store gpr 3 to gpr 10 (aligned to 4) ! in the parents outgoing area */ ! stw r3, 200(r1) ! stw r4, 204(r1) ! stw r5, 208(r1) ! stw r6, 212(r1) ! stw r7, 216(r1) ! stw r8, 220(r1) ! stw r9, 224(r1) ! stw r10, 228(r1) /* next save fpr 1 to fpr 13 (aligned to 8) */ stfd f1, 56(r1) *************** ffi_closure_ASM: *** 148,161 **** addi r4,r1,160 /* now load up the pointer to the saved gpr registers */ ! addi r5,r1,188 /* now load up the pointer to the saved fpr registers */ addi r6,r1,56 /* now load up the pointer to the outgoing parameter */ /* stack in the previous frame */ ! addi r7,r1,220 /* make the call */ bl .ffi_closure_helper_DARWIN --- 149,162 ---- addi r4,r1,160 /* now load up the pointer to the saved gpr registers */ ! addi r5,r1,200 /* now load up the pointer to the saved fpr registers */ addi r6,r1,56 /* now load up the pointer to the outgoing parameter */ /* stack in the previous frame */ ! addi r7,r1,232 /* make the call */ bl .ffi_closure_helper_DARWIN *************** L..58: *** 243,249 **** /* case void / done */ L..44: ! addi r1,r1,164 /* restore stack pointer */ lwz r0,8(r1) /* get return address */ mtlr r0 /* reset link register */ blr --- 244,250 ---- /* case void / done */ L..44: ! addi r1,r1,176 /* restore stack pointer */ lwz r0,8(r1) /* get return address */ mtlr r0 /* reset link register */ blr diff -Nrc3pad gcc-3.2.2/libffi/src/powerpc/darwin_closure.S gcc-3.2.3/libffi/src/powerpc/darwin_closure.S *** gcc-3.2.2/libffi/src/powerpc/darwin_closure.S Tue Mar 12 22:35:56 2002 --- gcc-3.2.3/libffi/src/powerpc/darwin_closure.S Sat Feb 8 08:04:17 2003 *************** *** 1,6 **** /* ----------------------------------------------------------------------- ! darwin_closures.S - Copyright (c) 2002 Free Software Foundation, Inc. ! based on ppc_closures.S PowerPC Assembly glue. --- 1,6 ---- /* ----------------------------------------------------------------------- ! darwin_closure.S - Copyright (c) 2002 2003 Free Software Foundation, ! Inc. based on ppc_closure.S PowerPC Assembly glue. *************** *** 37,67 **** .text .align 2 _ffi_closure_ASM: ! mflr r0 /* extract return address */ ! stw r0, 8(r1) /* save the return address */ ! ! /* 24 Bytes (Linkage Area) */ ! /* 32 Bytes (outgoing parameter area, always reserved) */ ! /* 104 Bytes (13*8 from FPR) */ ! /* 4 Bytes (result) ! /* 164 Bytes */ ! ! stwu r1,-164(r1) /* skip over caller save area */ ! ! /* we want to build up an area for the parameters passed */ ! /* in registers (both floating point and integer) */ ! /* we store gpr 3 to gpr 10 (aligned to 4) */ ! /* in the parents outgoing area */ ! stw r3, 188(r1) ! stw r4, 192(r1) ! stw r5, 196(r1) ! stw r6, 200(r1) ! stw r7, 204(r1) ! stw r8, 208(r1) ! stw r9, 212(r1) ! stw r10, 216(r1) /* we save fpr 1 to fpr 13 (aligned to 8) */ stfd f1, 56(r1) --- 37,68 ---- .text .align 2 _ffi_closure_ASM: + LFB1: + mflr r0 /* extract return address */ + stw r0, 8(r1) /* save the return address */ + LCFI0: + /* 24 Bytes (Linkage Area) + 32 Bytes (outgoing parameter area, always reserved) + 104 Bytes (13*8 from FPR) + 8 Bytes (result) + 168 Bytes */ ! stwu r1,-176(r1) /* skip over caller save area ! keep stack aligned to 16 */ ! LCFI1: ! /* we want to build up an area for the parameters passed ! in registers (both floating point and integer) */ ! /* we store gpr 3 to gpr 10 (aligned to 4) ! in the parents outgoing area */ ! stw r3, 200(r1) ! stw r4, 204(r1) ! stw r5, 208(r1) ! stw r6, 212(r1) ! stw r7, 216(r1) ! stw r8, 220(r1) ! stw r9, 224(r1) ! stw r10, 228(r1) /* we save fpr 1 to fpr 13 (aligned to 8) */ stfd f1, 56(r1) *************** _ffi_closure_ASM: *** 85,99 **** /* now load up the pointer to the result storage */ addi r4,r1,160 ! /* now load up the pointer to the saved gpr registers */ ! addi r5,r1,188 /* now load up the pointer to the saved fpr registers */ addi r6,r1,56 ! /* now load up the pointer to the outgoing parameter */ ! /* stack in the previous frame */ ! addi r7,r1,220 /* make the call */ bl L(_ffi_closure_helper_DARWIN) --- 86,100 ---- /* now load up the pointer to the result storage */ addi r4,r1,160 ! /* now load up the pointer to the saved gpr registers */ ! addi r5,r1,200 /* now load up the pointer to the saved fpr registers */ addi r6,r1,56 ! /* now load up the pointer to the outgoing parameter ! stack in the previous frame */ ! addi r7,r1,232 /* make the call */ bl L(_ffi_closure_helper_DARWIN) *************** _ffi_closure_ASM: *** 111,117 **** lwzx r3,r4,r3 /* get the contents of that table value */ add r3,r3,r4 /* add contents of table to table address */ mtctr r3 ! bctr /* jump to it */ .L60: .long .L44-.L60 /* FFI_TYPE_VOID */ --- 112,120 ---- lwzx r3,r4,r3 /* get the contents of that table value */ add r3,r3,r4 /* add contents of table to table address */ mtctr r3 ! bctr /* jump to it */ ! LFE1: ! .align 2 .L60: .long .L44-.L60 /* FFI_TYPE_VOID */ *************** _ffi_closure_ASM: *** 180,189 **** /* case void / done */ .L44: ! addi r1,r1,164 /* restore stack pointer */ ! lwz r0,8(r1) /* get return address */ ! mtlr r0 /* reset link register */ blr ! /* END(ffi_closure_ASM) */ ! --- 183,191 ---- /* case void / done */ .L44: ! addi r1,r1,176 /* restore stack pointer */ ! lwz r0,8(r1) /* get return address */ ! mtlr r0 /* reset link register */ blr ! /* END(ffi_closure_ASM) */ diff -Nrc3pad gcc-3.2.2/libffi/src/powerpc/ffi.c gcc-3.2.3/libffi/src/powerpc/ffi.c *** gcc-3.2.2/libffi/src/powerpc/ffi.c Sat Mar 24 03:26:28 2001 --- gcc-3.2.3/libffi/src/powerpc/ffi.c Sat Feb 8 08:04:17 2003 *************** void ffi_prep_args(extended_cif *ecif, u *** 137,147 **** switch ((*ptr)->type) { case FFI_TYPE_FLOAT: ! case FFI_TYPE_DOUBLE: ! if ((*ptr)->type == FFI_TYPE_FLOAT) ! double_tmp = *(float *)*p_argv; else ! double_tmp = *(double *)*p_argv; if (fparg_count >= NUM_FPR_ARG_REGISTERS) { --- 137,156 ---- switch ((*ptr)->type) { case FFI_TYPE_FLOAT: ! double_tmp = *(float *)*p_argv; ! if (fparg_count >= NUM_FPR_ARG_REGISTERS) ! { ! *(float *)next_arg = (float)double_tmp; ! next_arg += 1; ! } else ! *fpr_base++ = double_tmp; ! fparg_count++; ! FFI_ASSERT(flags & FLAG_FP_ARGUMENTS); ! break; ! ! case FFI_TYPE_DOUBLE: ! double_tmp = *(double *)*p_argv; if (fparg_count >= NUM_FPR_ARG_REGISTERS) { *************** ffi_status ffi_prep_cif_machdep(ffi_cif *** 320,325 **** --- 329,338 ---- switch ((*ptr)->type) { case FFI_TYPE_FLOAT: + fparg_count++; + /* floating singles are not 8-aligned on stack */ + break; + case FFI_TYPE_DOUBLE: fparg_count++; /* If this FP arg is going on the stack, it must be *************** ffi_closure_helper_SYSV (ffi_closure* cl *** 612,631 **** case FFI_TYPE_FLOAT: /* unfortunately float values are stored as doubles * in the ffi_closure_SYSV code (since we don't check ! * the type in that routine). This is also true ! * of floats passed on the outgoing parameter stack. ! * Also, on the outgoing stack all values are aligned ! * to 8 ! * ! * Don't you just love the simplicity of this ABI! */ /* there are 8 64bit floating point registers */ if (nf < 8) { ! temp = *(double*)pfr; *(float*)pfr = (float)temp; ! avalue[i] = pfr; nf++; pfr+=2; } else { --- 625,639 ---- case FFI_TYPE_FLOAT: /* unfortunately float values are stored as doubles * in the ffi_closure_SYSV code (since we don't check ! * the type in that routine). */ /* there are 8 64bit floating point registers */ if (nf < 8) { ! temp = *(double*)pfr; *(float*)pfr = (float)temp; ! avalue[i] = pfr; nf++; pfr+=2; } else { *************** ffi_closure_helper_SYSV (ffi_closure* cl *** 634,645 **** * parameter stack. This is probably a really * naughty thing to do but... */ - if (((long)pst) & 4) pst++; - temp = *(double*)pst; - *(float*)pst = (float)temp; avalue[i] = pst; nf++; ! pst+=2; } break; --- 642,650 ---- * parameter stack. This is probably a really * naughty thing to do but... */ avalue[i] = pst; nf++; ! pst+=1; } break; diff -Nrc3pad gcc-3.2.2/libffi/src/powerpc/ffi_darwin.c gcc-3.2.3/libffi/src/powerpc/ffi_darwin.c *** gcc-3.2.2/libffi/src/powerpc/ffi_darwin.c Tue Mar 12 22:35:56 2002 --- gcc-3.2.3/libffi/src/powerpc/ffi_darwin.c Sat Feb 8 08:04:17 2003 *************** *** 6,13 **** Darwin ABI support (c) 2001 John Hornkvist AIX ABI support (c) 2002 Free Software Foundation, Inc. - $Id: ffi_darwin.c,v 1.3.2.1 2002/03/12 22:35:56 tromey Exp $ - Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the ``Software''), to deal in the Software without restriction, including --- 6,11 ---- *************** typedef struct aix_fd_struct { *** 412,449 **** +---------------------------------------+ 20 | saved TOC pointer 4 | +---------------------------------------+ 24 ! | always reserved 8*4=32 (revious GPRs)| | according to the linkage convention | ! | from AIX | +---------------------------------------+ 56 ! | our FPR area 13*8=104 | ! | f1 | ! | . | ! | f13 | +---------------------------------------+ 160 ! | result area 4 | ! SP current --> +---------------------------------------+ 164 <- parent frame ! | back chain to caller 4 | +---------------------------------------+ 168 | saved CR 4 | ! +---------------------------------------+ 172 | saved LR 4 | ! +---------------------------------------+ 176 | reserved for compilers 4 | ! +---------------------------------------+ 180 | reserved for binders 4 | ! +---------------------------------------+ 184 | saved TOC pointer 4 | ! +---------------------------------------+ 188 | always reserved 8*4=32 we store our | ! | GPRs here | ! | r3 | ! | . | ! | r10 | ! +---------------------------------------+ 220 ! | PST area, overflow part | +---------------------------------------+ xxx ! | ???? | +---------------------------------------+ xxx */ --- 410,449 ---- +---------------------------------------+ 20 | saved TOC pointer 4 | +---------------------------------------+ 24 ! | always reserved 8*4=32 (previous GPRs)| | according to the linkage convention | ! | from AIX | +---------------------------------------+ 56 ! | our FPR area 13*8=104 | ! | f1 | ! | . | ! | f13 | +---------------------------------------+ 160 ! | result area 8 | +---------------------------------------+ 168 + | alignement to the next multiple of 16 | + SP current --> +---------------------------------------+ 176 <- parent frame + | back chain to caller 4 | + +---------------------------------------+ 180 | saved CR 4 | ! +---------------------------------------+ 184 | saved LR 4 | ! +---------------------------------------+ 188 | reserved for compilers 4 | ! +---------------------------------------+ 192 | reserved for binders 4 | ! +---------------------------------------+ 196 | saved TOC pointer 4 | ! +---------------------------------------+ 200 | always reserved 8*4=32 we store our | ! | GPRs here | ! | r3 | ! | . | ! | r10 | ! +---------------------------------------+ 232 ! | PST area, overflow part | +---------------------------------------+ xxx ! | ???? | +---------------------------------------+ xxx */ *************** ffi_prep_closure (ffi_closure* closure, *** 455,460 **** --- 455,461 ---- { unsigned int *tramp; struct ffi_aix_trampoline_struct *tramp_aix; + aix_fd *fd; switch (cif->abi) { *************** ffi_prep_closure (ffi_closure* closure, *** 486,492 **** case FFI_AIX: tramp_aix = (struct ffi_aix_trampoline_struct *) (closure->tramp); ! aix_fd *fd = (aix_fd *)(void *)ffi_closure_ASM; FFI_ASSERT (cif->abi == FFI_AIX); --- 487,493 ---- case FFI_AIX: tramp_aix = (struct ffi_aix_trampoline_struct *) (closure->tramp); ! fd = (aix_fd *)(void *)ffi_closure_ASM; FFI_ASSERT (cif->abi == FFI_AIX); diff -Nrc3pad gcc-3.2.2/libiberty/ChangeLog gcc-3.2.3/libiberty/ChangeLog *** gcc-3.2.2/libiberty/ChangeLog Wed Feb 5 03:01:31 2003 --- gcc-3.2.3/libiberty/ChangeLog Tue Apr 22 06:15:31 2003 *************** *** 1,3 **** --- 1,17 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-04-14 Kaveh R. Ghazi + + * configure.in (HAVE_UINTPTR_T): Always define. + * configure: Regenerated. + + 2003-02-13 Kaveh R. Ghazi + + * acconfig.h: New file. Add uintptr_t. + * config.in: Regenerated. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libiberty/acconfig.h gcc-3.2.3/libiberty/acconfig.h *** gcc-3.2.2/libiberty/acconfig.h Thu Jan 1 00:00:00 1970 --- gcc-3.2.3/libiberty/acconfig.h Thu Feb 13 05:01:33 2003 *************** *** 0 **** --- 1,3 ---- + /* Define to `unsigned long' if doesn't define. */ + #undef uintptr_t + diff -Nrc3pad gcc-3.2.2/libiberty/config.in gcc-3.2.3/libiberty/config.in *** gcc-3.2.2/libiberty/config.in Wed Nov 28 01:37:24 2001 --- gcc-3.2.3/libiberty/config.in Thu Feb 13 05:01:33 2003 *************** *** 1,4 **** ! /* config.in. Generated automatically from configure.in by autoheader 2.13. */ /* Define to empty if the keyword does not work. */ #undef const --- 1,4 ---- ! /* config.in. Generated automatically from configure.in by autoheader. */ /* Define to empty if the keyword does not work. */ #undef const *************** *** 29,34 **** --- 29,37 ---- /* Define vfork as fork if vfork does not work. */ #undef vfork + + /* Define to `unsigned long' if doesn't define. */ + #undef uintptr_t /* Define if you have the _doprnt function. */ #undef HAVE__DOPRNT diff -Nrc3pad gcc-3.2.2/libiberty/configure gcc-3.2.3/libiberty/configure *** gcc-3.2.2/libiberty/configure Sun Feb 2 21:15:38 2003 --- gcc-3.2.3/libiberty/configure Mon Apr 14 14:22:13 2003 *************** EOF *** 1571,1584 **** fi ! ! if test $ac_cv_type_uintptr_t = yes ! then ! cat >> confdefs.h <<\EOF #define HAVE_UINTPTR_T 1 EOF - fi # This is the list of functions which libiberty will provide if they # are not available on the host. --- 1571,1583 ---- fi ! # Given the above check, we always have uintptr_t or a fallback ! # definition. So define HAVE_UINTPTR_T in case any imported code ! # relies on it. ! cat >> confdefs.h <<\EOF #define HAVE_UINTPTR_T 1 EOF # This is the list of functions which libiberty will provide if they # are not available on the host. *************** if test "x" = "y"; then *** 1637,1648 **** for ac_func in asprintf atexit basename bcmp bcopy bsearch bzero calloc clock do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1641: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1640: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1664,1670 ---- ; return 0; } EOF ! if { (eval echo configure:1668: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1692,1703 **** for ac_func in getcwd getpagesize index insque mkstemps memchr memcmp memcpy do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1696: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1695: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1719,1725 ---- ; return 0; } EOF ! if { (eval echo configure:1723: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1747,1758 **** for ac_func in memmove memset putenv random rename rindex sigsetmask do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1751: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1750: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1774,1780 ---- ; return 0; } EOF ! if { (eval echo configure:1778: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1802,1813 **** for ac_func in strcasecmp setenv strchr strdup strncasecmp strrchr strstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1806: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1805: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1829,1835 ---- ; return 0; } EOF ! if { (eval echo configure:1833: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1857,1868 **** for ac_func in strtod strtol strtoul tmpnam vasprintf vfprintf vprintf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1861: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1860: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1884,1890 ---- ; return 0; } EOF ! if { (eval echo configure:1888: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1912,1923 **** for ac_func in vsprintf waitpid getrusage on_exit psignal strerror strsignal do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1916: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1915: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1939,1945 ---- ; return 0; } EOF ! if { (eval echo configure:1943: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 1967,1978 **** for ac_func in sysconf times sbrk gettimeofday ffs do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:1971: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:1970: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 1994,2000 ---- ; return 0; } EOF ! if { (eval echo configure:1998: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** if test -z "${setobjs}"; then *** 2199,2205 **** # We haven't set the list of objects yet. Use the standard autoconf # tests. This will only work if the compiler works. echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works""... $ac_c" 1>&6 ! echo "configure:2203: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works" >&5 ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. --- 2198,2204 ---- # We haven't set the list of objects yet. Use the standard autoconf # tests. This will only work if the compiler works. echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works""... $ac_c" 1>&6 ! echo "configure:2202: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works" >&5 ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. *************** cross_compiling=$ac_cv_prog_cc_cross *** 2210,2221 **** cat > conftest.$ac_ext << EOF ! #line 2214 "configure" #include "confdefs.h" main(){return(0);} EOF ! if { (eval echo configure:2219: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then ac_cv_prog_cc_works=yes # If we can't run a trivial program, we are probably using a cross compiler. if (./conftest; exit) 2>/dev/null; then --- 2209,2220 ---- cat > conftest.$ac_ext << EOF ! #line 2213 "configure" #include "confdefs.h" main(){return(0);} EOF ! if { (eval echo configure:2218: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then ac_cv_prog_cc_works=yes # If we can't run a trivial program, we are probably using a cross compiler. if (./conftest; exit) 2>/dev/null; then *************** if test $ac_cv_prog_cc_works = no; then *** 2241,2259 **** { echo "configure: error: installation or configuration problem: C compiler cannot create executables." 1>&2; exit 1; } fi echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler""... $ac_c" 1>&6 ! echo "configure:2245: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler" >&5 echo "$ac_t""$ac_cv_prog_cc_cross" 1>&6 cross_compiling=$ac_cv_prog_cc_cross for ac_func in $funcs do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2252: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&2; exit 1; } fi echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler""... $ac_c" 1>&6 ! echo "configure:2244: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler" >&5 echo "$ac_t""$ac_cv_prog_cc_cross" 1>&6 cross_compiling=$ac_cv_prog_cc_cross for ac_func in $funcs do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2251: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2275,2281 ---- ; return 0; } EOF ! if { (eval echo configure:2279: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 2303,2314 **** echo $ac_n "checking whether alloca needs Cray hooks""... $ac_c" 1>&6 ! echo "configure:2307: checking whether alloca needs Cray hooks" >&5 if eval "test \"`echo '$''{'ac_cv_os_cray'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2306: checking whether alloca needs Cray hooks" >&5 if eval "test \"`echo '$''{'ac_cv_os_cray'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 *** 2333,2344 **** if test $ac_cv_os_cray = yes; then for ac_func in _getb67 GETB67 getb67; do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2337: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2336: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2360,2366 ---- ; return 0; } EOF ! if { (eval echo configure:2364: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** fi *** 2387,2393 **** fi echo $ac_n "checking stack direction for C alloca""... $ac_c" 1>&6 ! echo "configure:2391: checking stack direction for C alloca" >&5 if eval "test \"`echo '$''{'ac_cv_c_stack_direction'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2386,2392 ---- fi echo $ac_n "checking stack direction for C alloca""... $ac_c" 1>&6 ! echo "configure:2390: checking stack direction for C alloca" >&5 if eval "test \"`echo '$''{'ac_cv_c_stack_direction'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** else *** 2395,2401 **** ac_cv_c_stack_direction=0 else cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_c_stack_direction=1 else --- 2413,2419 ---- exit (find_stack_direction() < 0); } EOF ! if { (eval echo configure:2417: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_c_stack_direction=1 else *************** EOF *** 2435,2446 **** echo $ac_n "checking for pid_t""... $ac_c" 1>&6 ! echo "configure:2439: checking for pid_t" >&5 if eval "test \"`echo '$''{'ac_cv_type_pid_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS --- 2434,2445 ---- echo $ac_n "checking for pid_t""... $ac_c" 1>&6 ! echo "configure:2438: checking for pid_t" >&5 if eval "test \"`echo '$''{'ac_cv_type_pid_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS *************** fi *** 2469,2485 **** ac_safe=`echo "vfork.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for vfork.h""... $ac_c" 1>&6 ! echo "configure:2473: checking for vfork.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2483: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 2468,2484 ---- ac_safe=`echo "vfork.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for vfork.h""... $ac_c" 1>&6 ! echo "configure:2472: checking for vfork.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2482: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** else *** 2504,2521 **** fi echo $ac_n "checking for working vfork""... $ac_c" 1>&6 ! echo "configure:2508: checking for working vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then echo $ac_n "checking for vfork""... $ac_c" 1>&6 ! echo "configure:2514: checking for vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2507: checking for working vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then echo $ac_n "checking for vfork""... $ac_c" 1>&6 ! echo "configure:2513: checking for vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_vfork=yes" else --- 2537,2543 ---- ; return 0; } EOF ! if { (eval echo configure:2541: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_vfork=yes" else *************** fi *** 2560,2566 **** ac_cv_func_vfork_works=$ac_cv_func_vfork else cat > conftest.$ac_ext < --- 2559,2565 ---- ac_cv_func_vfork_works=$ac_cv_func_vfork else cat > conftest.$ac_ext < *************** main() { *** 2655,2661 **** } } EOF ! if { (eval echo configure:2659: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_vfork_works=yes else --- 2654,2660 ---- } } EOF ! if { (eval echo configure:2658: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_vfork_works=yes else *************** fi *** 2687,2698 **** for ac_func in _doprnt do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2691: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2690: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2714,2720 ---- ; return 0; } EOF ! if { (eval echo configure:2718: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 2745,2756 **** for ac_func in _doprnt do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2749: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2748: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2772,2778 ---- ; return 0; } EOF ! if { (eval echo configure:2776: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 2801,2819 **** for v in $vars; do echo $ac_n "checking for $v""... $ac_c" 1>&6 ! echo "configure:2805: checking for $v" >&5 if eval "test \"`echo '$''{'libiberty_cv_var_$v'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "libiberty_cv_var_$v=yes" else --- 2800,2818 ---- for v in $vars; do echo $ac_n "checking for $v""... $ac_c" 1>&6 ! echo "configure:2804: checking for $v" >&5 if eval "test \"`echo '$''{'libiberty_cv_var_$v'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "libiberty_cv_var_$v=yes" else *************** EOF *** 2839,2850 **** for ac_func in $checkfuncs do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2843: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2842: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2866,2872 ---- ; return 0; } EOF ! if { (eval echo configure:2870: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** for ac_hdr in unistd.h *** 2897,2913 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:2901: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2911: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 2896,2912 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:2900: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2910: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 2936,2947 **** for ac_func in getpagesize do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:2940: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:2939: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 2963,2969 ---- ; return 0; } EOF ! if { (eval echo configure:2967: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** fi *** 2989,2995 **** done echo $ac_n "checking for working mmap""... $ac_c" 1>&6 ! echo "configure:2993: checking for working mmap" >&5 if eval "test \"`echo '$''{'ac_cv_func_mmap_fixed_mapped'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2988,2994 ---- done echo $ac_n "checking for working mmap""... $ac_c" 1>&6 ! echo "configure:2992: checking for working mmap" >&5 if eval "test \"`echo '$''{'ac_cv_func_mmap_fixed_mapped'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** else *** 2997,3003 **** ac_cv_func_mmap_fixed_mapped=no else cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_mmap_fixed_mapped=yes else --- 3136,3142 ---- } EOF ! if { (eval echo configure:3140: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_mmap_fixed_mapped=yes else *************** fi *** 3161,3167 **** echo $ac_n "checking for working strncmp""... $ac_c" 1>&6 ! echo "configure:3165: checking for working strncmp" >&5 if eval "test \"`echo '$''{'ac_cv_func_strncmp_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 3160,3166 ---- echo $ac_n "checking for working strncmp""... $ac_c" 1>&6 ! echo "configure:3164: checking for working strncmp" >&5 if eval "test \"`echo '$''{'ac_cv_func_strncmp_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** else *** 3169,3175 **** ac_cv_func_strncmp_works=no else cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_strncmp_works=yes else --- 3232,3238 ---- } EOF ! if { (eval echo configure:3236: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_strncmp_works=yes else diff -Nrc3pad gcc-3.2.2/libiberty/configure.in gcc-3.2.3/libiberty/configure.in *** gcc-3.2.2/libiberty/configure.in Sun Feb 2 21:15:38 2003 --- gcc-3.2.3/libiberty/configure.in Mon Apr 14 14:22:13 2003 *************** AC_HEADER_TIME *** 134,144 **** libiberty_AC_DECLARE_ERRNO AC_CHECK_TYPE(uintptr_t, unsigned long) ! ! if test $ac_cv_type_uintptr_t = yes ! then ! AC_DEFINE(HAVE_UINTPTR_T, 1, [Define if you have the \`uintptr_t' type.]) ! fi # This is the list of functions which libiberty will provide if they # are not available on the host. --- 134,143 ---- libiberty_AC_DECLARE_ERRNO AC_CHECK_TYPE(uintptr_t, unsigned long) ! # Given the above check, we always have uintptr_t or a fallback ! # definition. So define HAVE_UINTPTR_T in case any imported code ! # relies on it. ! AC_DEFINE(HAVE_UINTPTR_T, 1, [Define if you have the \`uintptr_t' type.]) # This is the list of functions which libiberty will provide if they # are not available on the host. diff -Nrc3pad gcc-3.2.2/libjava/ChangeLog gcc-3.2.3/libjava/ChangeLog *** gcc-3.2.2/libjava/ChangeLog Wed Feb 5 03:01:45 2003 --- gcc-3.2.3/libjava/ChangeLog Tue Apr 22 06:15:35 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libjava/libltdl/ChangeLog gcc-3.2.3/libjava/libltdl/ChangeLog *** gcc-3.2.2/libjava/libltdl/ChangeLog Wed Feb 5 03:01:42 2003 --- gcc-3.2.3/libjava/libltdl/ChangeLog Tue Apr 22 06:15:39 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libjava/testsuite/ChangeLog gcc-3.2.3/libjava/testsuite/ChangeLog *** gcc-3.2.2/libjava/testsuite/ChangeLog Wed Feb 5 03:01:49 2003 --- gcc-3.2.3/libjava/testsuite/ChangeLog Tue Apr 22 06:15:42 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libobjc/ChangeLog gcc-3.2.3/libobjc/ChangeLog *** gcc-3.2.2/libobjc/ChangeLog Wed Feb 5 03:01:52 2003 --- gcc-3.2.3/libobjc/ChangeLog Tue Apr 22 06:15:46 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libstdc++-v3/ChangeLog gcc-3.2.3/libstdc++-v3/ChangeLog *** gcc-3.2.2/libstdc++-v3/ChangeLog Wed Feb 5 03:02:02 2003 --- gcc-3.2.3/libstdc++-v3/ChangeLog Tue Apr 22 06:15:49 2003 *************** *** 1,3 **** --- 1,55 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + + 2003-03-26 Paolo Carlini + + PR libstdc++/10167 + * config/locale/ieee_1003.1-2001/codecvt_specializations.h + (do_out, do_unshift, do_in): qualify 'ok', 'error', 'partial', + 'noconv' with codecvt_base::. + + 2003-03-22 Loren J. Rittle + + * config/os/hpux/bits/ctype_noninline.h (ctype::classic_table): + Correct return value. + + 2003-02-17 Paolo Carlini + + PR libstdc++/9169 + * include/bits/fstream.tcc (_M_convert_to_external): + Deal correctly with noconv, as prescribed by 27.8.1.4,p8. + * testsuite/27_io/filebuf_virtuals.cc (test09): Add. + + 2003-02-07 Paolo Carlini + + * testsuite/27_io/filebuf_virtuals.cc (test08): Fix for + unsigned char platforms. + + 2003-02-06 Paolo Carlini + + PR libstdc++/9538 + * include/bits/streambuf.tcc (sputbackc): Access + this->gptr()[-1] only if _M_in_beg < _M_in_cur. + * testsuite/27_io/filebuf_virtuals.cc (test08): Add. + + 2003-02-06 Paolo Carlini + + PR libstdc++/9507 + * include/bits/fstream.tcc (open): If the 'ate' repositioning + operation fails, calls close _and_ returns a null pointer + to indicate failure (27.8.1.3,4). + * testsuite/27_io/filebuf_members.cc (test_06): Add. + + 2003-02-06 Petur Runolfsson + + * testsuite/27_io/filebuf_members.cc (test_04): Remove exit(0). + + 2003-02-05 Benjamin Kosnik + + * configure.in (libtool_VERSION): To 5:3:0. + * configure: Regenerated. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libstdc++-v3/aclocal.m4 gcc-3.2.3/libstdc++-v3/aclocal.m4 *** gcc-3.2.2/libstdc++-v3/aclocal.m4 Mon Jan 27 17:30:42 2003 --- gcc-3.2.3/libstdc++-v3/aclocal.m4 Wed Feb 5 16:36:40 2003 *************** *** 1,4 **** ! dnl aclocal.m4 generated automatically by aclocal 1.4-p6 dnl Copyright (C) 1994, 1995-8, 1999, 2001 Free Software Foundation, Inc. dnl This file is free software; the Free Software Foundation --- 1,4 ---- ! dnl aclocal.m4 generated automatically by aclocal 1.4-p5 dnl Copyright (C) 1994, 1995-8, 1999, 2001 Free Software Foundation, Inc. dnl This file is free software; the Free Software Foundation *************** AC_MSG_RESULT($enable_symvers) *** 2275,2281 **** ]) ! # isc-posix.m4 serial 2 (gettext-0.11.2) dnl Copyright (C) 1995-2002 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General --- 2275,2281 ---- ]) ! # isc-posix.m4 serial 1 (gettext-0.10.40) dnl Copyright (C) 1995-2002 Free Software Foundation, Inc. dnl This file is free software, distributed under the terms of the GNU dnl General Public License. As a special exception to the GNU General *************** dnl Public License, this file may be dis *** 2283,2290 **** dnl that contains a configuration script generated by Autoconf, under dnl the same distribution terms as the rest of that program. - # This file is not needed with autoconf-2.53 and newer. Remove it in 2005. - # This test replaces the one in autoconf. # Currently this macro should have the same name as the autoconf macro # because gettext's gettext.m4 (distributed in the automake package) --- 2283,2288 ---- *************** dnl Usage: *** 2345,2352 **** dnl AM_INIT_AUTOMAKE(package,version, [no-define]) AC_DEFUN([AM_INIT_AUTOMAKE], ! [AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl ! AC_REQUIRE([AC_PROG_INSTALL]) PACKAGE=[$1] AC_SUBST(PACKAGE) VERSION=[$2] --- 2343,2349 ---- dnl AM_INIT_AUTOMAKE(package,version, [no-define]) AC_DEFUN([AM_INIT_AUTOMAKE], ! [AC_REQUIRE([AC_PROG_INSTALL]) PACKAGE=[$1] AC_SUBST(PACKAGE) VERSION=[$2] *************** AC_REQUIRE([AM_SANITY_CHECK]) *** 2362,2402 **** AC_REQUIRE([AC_ARG_PROGRAM]) dnl FIXME This is truly gross. missing_dir=`cd $ac_aux_dir && pwd` ! AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}, $missing_dir) AM_MISSING_PROG(AUTOCONF, autoconf, $missing_dir) ! AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}, $missing_dir) AM_MISSING_PROG(AUTOHEADER, autoheader, $missing_dir) AM_MISSING_PROG(MAKEINFO, makeinfo, $missing_dir) AC_REQUIRE([AC_PROG_MAKE_SET])]) - - # Copyright 2002 Free Software Foundation, Inc. - - # This program 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 2, or (at your option) - # any later version. - - # This program 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 this program; if not, write to the Free Software - # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA - - # AM_AUTOMAKE_VERSION(VERSION) - # ---------------------------- - # Automake X.Y traces this macro to ensure aclocal.m4 has been - # generated from the m4 files accompanying Automake X.Y. - AC_DEFUN([AM_AUTOMAKE_VERSION],[am__api_version="1.4"]) - - # AM_SET_CURRENT_AUTOMAKE_VERSION - # ------------------------------- - # Call AM_AUTOMAKE_VERSION so it can be traced. - # This function is AC_REQUIREd by AC_INIT_AUTOMAKE. - AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], - [AM_AUTOMAKE_VERSION([1.4-p6])]) # # Check to make sure that the build environment is sane. --- 2359,2370 ---- AC_REQUIRE([AC_ARG_PROGRAM]) dnl FIXME This is truly gross. missing_dir=`cd $ac_aux_dir && pwd` ! AM_MISSING_PROG(ACLOCAL, aclocal, $missing_dir) AM_MISSING_PROG(AUTOCONF, autoconf, $missing_dir) ! AM_MISSING_PROG(AUTOMAKE, automake, $missing_dir) AM_MISSING_PROG(AUTOHEADER, autoheader, $missing_dir) AM_MISSING_PROG(MAKEINFO, makeinfo, $missing_dir) AC_REQUIRE([AC_PROG_MAKE_SET])]) # # Check to make sure that the build environment is sane. diff -Nrc3pad gcc-3.2.2/libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h gcc-3.2.3/libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h *** gcc-3.2.2/libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h Sun May 26 14:45:43 2002 --- gcc-3.2.3/libstdc++-v3/config/locale/ieee_1003.1-2001/codecvt_specializations.h Wed Mar 26 12:25:46 2003 *************** *** 260,266 **** extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const { ! result __ret = error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; --- 260,266 ---- extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const { ! result __ret = codecvt_base::error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; *************** *** 304,310 **** { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = ok; } else { --- 304,310 ---- { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = codecvt_base::ok; } else { *************** *** 312,321 **** { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = partial; } else ! __ret = error; } } return __ret; --- 312,321 ---- { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = codecvt_base::partial; } else ! __ret = codecvt_base::error; } } return __ret; *************** *** 327,333 **** do_unshift(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const { ! result __ret = error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; --- 327,333 ---- do_unshift(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const { ! result __ret = codecvt_base::error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; *************** *** 345,358 **** { __to_next = reinterpret_cast(__cto); if (__tlen == __tmultiple * (__to_end - __to)) ! __ret = noconv; else if (__tlen == 0) ! __ret = ok; else ! __ret = partial; } else ! __ret = error; } return __ret; } --- 345,358 ---- { __to_next = reinterpret_cast(__cto); if (__tlen == __tmultiple * (__to_end - __to)) ! __ret = codecvt_base::noconv; else if (__tlen == 0) ! __ret = codecvt_base::ok; else ! __ret = codecvt_base::partial; } else ! __ret = codecvt_base::error; } return __ret; } *************** *** 365,371 **** intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const { ! result __ret = error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; --- 365,371 ---- intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const { ! result __ret = codecvt_base::error; if (__state._M_good()) { typedef state_type::__desc_type __desc_type; *************** *** 410,416 **** { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = ok; } else { --- 410,416 ---- { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = codecvt_base::ok; } else { *************** *** 418,427 **** { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = partial; } else ! __ret = error; } } return __ret; --- 418,427 ---- { __from_next = reinterpret_cast(__cfrom); __to_next = reinterpret_cast(__cto); ! __ret = codecvt_base::partial; } else ! __ret = codecvt_base::error; } } return __ret; diff -Nrc3pad gcc-3.2.2/libstdc++-v3/config/os/hpux/bits/ctype_noninline.h gcc-3.2.3/libstdc++-v3/config/os/hpux/bits/ctype_noninline.h *** gcc-3.2.2/libstdc++-v3/config/os/hpux/bits/ctype_noninline.h Mon Jan 21 04:08:49 2002 --- gcc-3.2.3/libstdc++-v3/config/os/hpux/bits/ctype_noninline.h Sun Mar 23 04:27:15 2003 *************** *** 1,6 **** // Locale support -*- C++ -*- ! // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002 // Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free --- 1,6 ---- // Locale support -*- C++ -*- ! // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003 // Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free *************** *** 36,42 **** const ctype_base::mask* ctype::classic_table() throw() ! { return 0; } ctype::ctype(__c_locale, const mask* __table, bool __del, size_t __refs) --- 36,42 ---- const ctype_base::mask* ctype::classic_table() throw() ! { return __SB_masks; } ctype::ctype(__c_locale, const mask* __table, bool __del, size_t __refs) diff -Nrc3pad gcc-3.2.2/libstdc++-v3/configure gcc-3.2.3/libstdc++-v3/configure *** gcc-3.2.2/libstdc++-v3/configure Mon Jan 27 17:30:42 2003 --- gcc-3.2.3/libstdc++-v3/configure Wed Feb 5 16:36:41 2003 *************** ORIGINAL_LD_FOR_MULTILIBS=$LD *** 588,594 **** PACKAGE=libstdc++ # For libtool versioning info, format is CURRENT:REVISION:AGE ! libtool_VERSION=5:2:0 --- 588,594 ---- PACKAGE=libstdc++ # For libtool versioning info, format is CURRENT:REVISION:AGE ! libtool_VERSION=5:3:0 *************** ac_exeext=$EXEEXT *** 1491,1499 **** - am__api_version="1.4" echo $ac_n "checking whether build environment is sane""... $ac_c" 1>&6 ! echo "configure:1497: checking whether build environment is sane" >&5 # Just in case sleep 1 echo timestamp > conftestfile --- 1491,1498 ---- echo $ac_n "checking whether build environment is sane""... $ac_c" 1>&6 ! echo "configure:1496: checking whether build environment is sane" >&5 # Just in case sleep 1 echo timestamp > conftestfile *************** test "$program_suffix" != NONE && *** 1550,1556 **** test "$program_transform_name" = "" && program_transform_name="s,x,x," echo $ac_n "checking whether ${MAKE-make} sets \${MAKE}""... $ac_c" 1>&6 ! echo "configure:1554: checking whether ${MAKE-make} sets \${MAKE}" >&5 set dummy ${MAKE-make}; ac_make=`echo "$2" | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_prog_make_${ac_make}_set'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 1549,1555 ---- test "$program_transform_name" = "" && program_transform_name="s,x,x," echo $ac_n "checking whether ${MAKE-make} sets \${MAKE}""... $ac_c" 1>&6 ! echo "configure:1553: checking whether ${MAKE-make} sets \${MAKE}" >&5 set dummy ${MAKE-make}; ac_make=`echo "$2" | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_prog_make_${ac_make}_set'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** EOF *** 1595,1615 **** missing_dir=`cd $ac_aux_dir && pwd` ! echo $ac_n "checking for working aclocal-${am__api_version}""... $ac_c" 1>&6 ! echo "configure:1600: checking for working aclocal-${am__api_version}" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. ! if (aclocal-${am__api_version} --version) < /dev/null > /dev/null 2>&1; then ! ACLOCAL=aclocal-${am__api_version} echo "$ac_t""found" 1>&6 else ! ACLOCAL="$missing_dir/missing aclocal-${am__api_version}" echo "$ac_t""missing" 1>&6 fi echo $ac_n "checking for working autoconf""... $ac_c" 1>&6 ! echo "configure:1613: checking for working autoconf" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. --- 1594,1614 ---- missing_dir=`cd $ac_aux_dir && pwd` ! echo $ac_n "checking for working aclocal""... $ac_c" 1>&6 ! echo "configure:1599: checking for working aclocal" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. ! if (aclocal --version) < /dev/null > /dev/null 2>&1; then ! ACLOCAL=aclocal echo "$ac_t""found" 1>&6 else ! ACLOCAL="$missing_dir/missing aclocal" echo "$ac_t""missing" 1>&6 fi echo $ac_n "checking for working autoconf""... $ac_c" 1>&6 ! echo "configure:1612: checking for working autoconf" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. *************** else *** 1621,1641 **** echo "$ac_t""missing" 1>&6 fi ! echo $ac_n "checking for working automake-${am__api_version}""... $ac_c" 1>&6 ! echo "configure:1626: checking for working automake-${am__api_version}" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. ! if (automake-${am__api_version} --version) < /dev/null > /dev/null 2>&1; then ! AUTOMAKE=automake-${am__api_version} echo "$ac_t""found" 1>&6 else ! AUTOMAKE="$missing_dir/missing automake-${am__api_version}" echo "$ac_t""missing" 1>&6 fi echo $ac_n "checking for working autoheader""... $ac_c" 1>&6 ! echo "configure:1639: checking for working autoheader" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. --- 1620,1640 ---- echo "$ac_t""missing" 1>&6 fi ! echo $ac_n "checking for working automake""... $ac_c" 1>&6 ! echo "configure:1625: checking for working automake" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. ! if (automake --version) < /dev/null > /dev/null 2>&1; then ! AUTOMAKE=automake echo "$ac_t""found" 1>&6 else ! AUTOMAKE="$missing_dir/missing automake" echo "$ac_t""missing" 1>&6 fi echo $ac_n "checking for working autoheader""... $ac_c" 1>&6 ! echo "configure:1638: checking for working autoheader" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. *************** else *** 1648,1654 **** fi echo $ac_n "checking for working makeinfo""... $ac_c" 1>&6 ! echo "configure:1652: checking for working makeinfo" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. --- 1647,1653 ---- fi echo $ac_n "checking for working makeinfo""... $ac_c" 1>&6 ! echo "configure:1651: checking for working makeinfo" >&5 # Run test in a subshell; some versions of sh will print an error if # an executable is not found, even if stderr is redirected. # Redirect stdin to placate older versions of autoconf. Sigh. *************** ac_prog=ld *** 1747,1753 **** if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. echo $ac_n "checking for ld used by GCC""... $ac_c" 1>&6 ! echo "configure:1751: checking for ld used by GCC" >&5 case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw --- 1746,1752 ---- if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. echo $ac_n "checking for ld used by GCC""... $ac_c" 1>&6 ! echo "configure:1750: checking for ld used by GCC" >&5 case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw *************** echo "configure:1751: checking for ld us *** 1777,1786 **** esac elif test "$with_gnu_ld" = yes; then echo $ac_n "checking for GNU ld""... $ac_c" 1>&6 ! echo "configure:1781: checking for GNU ld" >&5 else echo $ac_n "checking for non-GNU ld""... $ac_c" 1>&6 ! echo "configure:1784: checking for non-GNU ld" >&5 fi if eval "test \"`echo '$''{'lt_cv_path_LD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 1776,1785 ---- esac elif test "$with_gnu_ld" = yes; then echo $ac_n "checking for GNU ld""... $ac_c" 1>&6 ! echo "configure:1780: checking for GNU ld" >&5 else echo $ac_n "checking for non-GNU ld""... $ac_c" 1>&6 ! echo "configure:1783: checking for non-GNU ld" >&5 fi if eval "test \"`echo '$''{'lt_cv_path_LD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 1815,1821 **** fi test -z "$LD" && { echo "configure: error: no acceptable ld found in \$PATH" 1>&2; exit 1; } echo $ac_n "checking if the linker ($LD) is GNU ld""... $ac_c" 1>&6 ! echo "configure:1819: checking if the linker ($LD) is GNU ld" >&5 if eval "test \"`echo '$''{'lt_cv_prog_gnu_ld'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 1814,1820 ---- fi test -z "$LD" && { echo "configure: error: no acceptable ld found in \$PATH" 1>&2; exit 1; } echo $ac_n "checking if the linker ($LD) is GNU ld""... $ac_c" 1>&6 ! echo "configure:1818: checking if the linker ($LD) is GNU ld" >&5 if eval "test \"`echo '$''{'lt_cv_prog_gnu_ld'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** with_gnu_ld=$lt_cv_prog_gnu_ld *** 1832,1838 **** echo $ac_n "checking for $LD option to reload object files""... $ac_c" 1>&6 ! echo "configure:1836: checking for $LD option to reload object files" >&5 if eval "test \"`echo '$''{'lt_cv_ld_reload_flag'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 1831,1837 ---- echo $ac_n "checking for $LD option to reload object files""... $ac_c" 1>&6 ! echo "configure:1835: checking for $LD option to reload object files" >&5 if eval "test \"`echo '$''{'lt_cv_ld_reload_flag'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** reload_flag=$lt_cv_ld_reload_flag *** 1844,1850 **** test -n "$reload_flag" && reload_flag=" $reload_flag" echo $ac_n "checking for BSD-compatible nm""... $ac_c" 1>&6 ! echo "configure:1848: checking for BSD-compatible nm" >&5 if eval "test \"`echo '$''{'lt_cv_path_NM'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 1843,1849 ---- test -n "$reload_flag" && reload_flag=" $reload_flag" echo $ac_n "checking for BSD-compatible nm""... $ac_c" 1>&6 ! echo "configure:1847: checking for BSD-compatible nm" >&5 if eval "test \"`echo '$''{'lt_cv_path_NM'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** NM="$lt_cv_path_NM" *** 1882,1888 **** echo "$ac_t""$NM" 1>&6 echo $ac_n "checking how to recognise dependant libraries""... $ac_c" 1>&6 ! echo "configure:1886: checking how to recognise dependant libraries" >&5 if eval "test \"`echo '$''{'lt_cv_deplibs_check_method'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 1881,1887 ---- echo "$ac_t""$NM" 1>&6 echo $ac_n "checking how to recognise dependant libraries""... $ac_c" 1>&6 ! echo "configure:1885: checking how to recognise dependant libraries" >&5 if eval "test \"`echo '$''{'lt_cv_deplibs_check_method'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** file_magic_cmd=$lt_cv_file_magic_cmd *** 2046,2058 **** deplibs_check_method=$lt_cv_deplibs_check_method echo $ac_n "checking for object suffix""... $ac_c" 1>&6 ! echo "configure:2050: checking for object suffix" >&5 if eval "test \"`echo '$''{'ac_cv_objext'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else rm -f conftest* echo 'int i = 1;' > conftest.$ac_ext ! if { (eval echo configure:2056: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then for ac_file in conftest.*; do case $ac_file in *.c) ;; --- 2045,2057 ---- deplibs_check_method=$lt_cv_deplibs_check_method echo $ac_n "checking for object suffix""... $ac_c" 1>&6 ! echo "configure:2049: checking for object suffix" >&5 if eval "test \"`echo '$''{'ac_cv_objext'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else rm -f conftest* echo 'int i = 1;' > conftest.$ac_ext ! if { (eval echo configure:2055: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then for ac_file in conftest.*; do case $ac_file in *.c) ;; *************** case $deplibs_check_method in *** 2076,2082 **** file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then echo $ac_n "checking for ${ac_tool_prefix}file""... $ac_c" 1>&6 ! echo "configure:2080: checking for ${ac_tool_prefix}file" >&5 if eval "test \"`echo '$''{'lt_cv_path_MAGIC_CMD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2075,2081 ---- file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then echo $ac_n "checking for ${ac_tool_prefix}file""... $ac_c" 1>&6 ! echo "configure:2079: checking for ${ac_tool_prefix}file" >&5 if eval "test \"`echo '$''{'lt_cv_path_MAGIC_CMD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** fi *** 2138,2144 **** if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then echo $ac_n "checking for file""... $ac_c" 1>&6 ! echo "configure:2142: checking for file" >&5 if eval "test \"`echo '$''{'lt_cv_path_MAGIC_CMD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2137,2143 ---- if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then echo $ac_n "checking for file""... $ac_c" 1>&6 ! echo "configure:2141: checking for file" >&5 if eval "test \"`echo '$''{'lt_cv_path_MAGIC_CMD'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** esac *** 2209,2215 **** # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2213: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2208,2214 ---- # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2212: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** if test -n "$ac_tool_prefix"; then *** 2241,2247 **** # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2245: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2240,2246 ---- # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2244: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** fi *** 2276,2282 **** # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2280: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_STRIP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2275,2281 ---- # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2279: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_STRIP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** if test -n "$ac_tool_prefix"; then *** 2308,2314 **** # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2312: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_STRIP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2307,2313 ---- # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:2311: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_STRIP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** test x"$pic_mode" = xno && libtool_flags *** 2375,2382 **** case $host in *-*-irix6*) # Find out which ABI we are using. ! echo '#line 2379 "configure"' > conftest.$ac_ext ! if { (eval echo configure:2380: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" --- 2374,2381 ---- case $host in *-*-irix6*) # Find out which ABI we are using. ! echo '#line 2378 "configure"' > conftest.$ac_ext ! if { (eval echo configure:2379: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" *************** case $host in *** 2397,2403 **** SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" echo $ac_n "checking whether the C compiler needs -belf""... $ac_c" 1>&6 ! echo "configure:2401: checking whether the C compiler needs -belf" >&5 if eval "test \"`echo '$''{'lt_cv_cc_needs_belf'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2396,2402 ---- SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" echo $ac_n "checking whether the C compiler needs -belf""... $ac_c" 1>&6 ! echo "configure:2400: checking whether the C compiler needs -belf" >&5 if eval "test \"`echo '$''{'lt_cv_cc_needs_belf'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CC-cc} -o conftest${ac_exeext *** 2410,2423 **** cross_compiling=$ac_cv_prog_cc_cross cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* lt_cv_cc_needs_belf=yes else --- 2409,2422 ---- cross_compiling=$ac_cv_prog_cc_cross cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* lt_cv_cc_needs_belf=yes else *************** echo "$ac_t""$lt_cv_cc_needs_belf" 1>&6 *** 2447,2453 **** esac echo $ac_n "checking how to run the C++ preprocessor""... $ac_c" 1>&6 ! echo "configure:2451: checking how to run the C++ preprocessor" >&5 if test -z "$CXXCPP"; then if eval "test \"`echo '$''{'ac_cv_prog_CXXCPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 2446,2452 ---- esac echo $ac_n "checking how to run the C++ preprocessor""... $ac_c" 1>&6 ! echo "configure:2450: checking how to run the C++ preprocessor" >&5 if test -z "$CXXCPP"; then if eval "test \"`echo '$''{'ac_cv_prog_CXXCPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 2460,2471 **** cross_compiling=$ac_cv_prog_cxx_cross CXXCPP="${CXX-g++} -E" cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2469: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : --- 2459,2470 ---- cross_compiling=$ac_cv_prog_cxx_cross CXXCPP="${CXX-g++} -E" cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2468: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : *************** exec 5>>./config.log *** 2603,2609 **** # Check for c++ or library specific bits that don't require linking. #GLIBCPP_CHECK_COMPILER_VERSION echo $ac_n "checking for GNU make""... $ac_c" 1>&6 ! echo "configure:2607: checking for GNU make" >&5 if eval "test \"`echo '$''{'_cv_gnu_make_command'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 2602,2608 ---- # Check for c++ or library specific bits that don't require linking. #GLIBCPP_CHECK_COMPILER_VERSION echo $ac_n "checking for GNU make""... $ac_c" 1>&6 ! echo "configure:2606: checking for GNU make" >&5 if eval "test \"`echo '$''{'_cv_gnu_make_command'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** esac *** 2651,2657 **** echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&6 ! echo "configure:2655: checking how to run the C preprocessor" >&5 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= --- 2650,2656 ---- echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&6 ! echo "configure:2654: checking how to run the C preprocessor" >&5 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= *************** else *** 2666,2678 **** # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2676: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : --- 2665,2677 ---- # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2675: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : *************** else *** 2683,2695 **** rm -rf conftest* CPP="${CC-cc} -E -traditional-cpp" cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2693: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : --- 2682,2694 ---- rm -rf conftest* CPP="${CC-cc} -E -traditional-cpp" cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2692: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : *************** else *** 2700,2712 **** rm -rf conftest* CPP="${CC-cc} -nologo -E" cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2710: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : --- 2699,2711 ---- rm -rf conftest* CPP="${CC-cc} -nologo -E" cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2709: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then : *************** echo "$ac_t""$CPP" 1>&6 *** 2732,2738 **** echo $ac_n "checking for cstdio to use""... $ac_c" 1>&6 ! echo "configure:2736: checking for cstdio to use" >&5 # Check whether --enable-cstdio or --disable-cstdio was given. if test "${enable_cstdio+set}" = set; then enableval="$enable_cstdio" --- 2731,2737 ---- echo $ac_n "checking for cstdio to use""... $ac_c" 1>&6 ! echo "configure:2735: checking for cstdio to use" >&5 # Check whether --enable-cstdio or --disable-cstdio was given. if test "${enable_cstdio+set}" = set; then enableval="$enable_cstdio" *************** fi *** 2756,2772 **** # see if we are on a system with libio native (ie, linux) ac_safe=`echo "libio.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for libio.h""... $ac_c" 1>&6 ! echo "configure:2760: checking for libio.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2770: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 2755,2771 ---- # see if we are on a system with libio native (ie, linux) ac_safe=`echo "libio.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for libio.h""... $ac_c" 1>&6 ! echo "configure:2759: checking for libio.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:2769: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 2796,2804 **** case "$target" in *-*-linux*) echo $ac_n "checking for glibc version >= 2.2""... $ac_c" 1>&6 ! echo "configure:2800: checking for glibc version >= 2.2" >&5 cat > conftest.$ac_ext < --- 2795,2803 ---- case "$target" in *-*-linux*) echo $ac_n "checking for glibc version >= 2.2""... $ac_c" 1>&6 ! echo "configure:2799: checking for glibc version >= 2.2" >&5 cat > conftest.$ac_ext < *************** fi *** 2912,2918 **** echo $ac_n "checking for clocale to use""... $ac_c" 1>&6 ! echo "configure:2916: checking for clocale to use" >&5 # Check whether --enable-clocale or --disable-clocale was given. if test "${enable_clocale+set}" = set; then enableval="$enable_clocale" --- 2911,2917 ---- echo $ac_n "checking for clocale to use""... $ac_c" 1>&6 ! echo "configure:2915: checking for clocale to use" >&5 # Check whether --enable-clocale or --disable-clocale was given. if test "${enable_clocale+set}" = set; then enableval="$enable_clocale" *************** fi *** 2930,2936 **** case x${target_os} in xlinux* | xgnu*) cat > conftest.$ac_ext < --- 2929,2935 ---- case x${target_os} in xlinux* | xgnu*) cat > conftest.$ac_ext < *************** rm -f conftest* *** 2956,2962 **** enable_clocale_flag=generic else cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then enable_clocale_flag=gnu else --- 2982,2988 ---- } EOF ! if { (eval echo configure:2986: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then enable_clocale_flag=gnu else *************** fi *** 3045,3051 **** # Extract the first word of "msgfmt", so it can be a program name with args. set dummy msgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:3049: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_check_msgfmt'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 3044,3050 ---- # Extract the first word of "msgfmt", so it can be a program name with args. set dummy msgfmt; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 ! echo "configure:3048: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_check_msgfmt'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** cross_compiling=$ac_cv_prog_cxx_cross *** 3181,3196 **** # Check for the existence of functions used if C99 is enabled. ac_c99_math=yes; echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3185: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { fpclassify(0.0); ; return 0; } EOF ! if { (eval echo configure:3194: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3180,3195 ---- # Check for the existence of functions used if C99 is enabled. ac_c99_math=yes; echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3184: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { fpclassify(0.0); ; return 0; } EOF ! if { (eval echo configure:3193: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3200,3213 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isfinite(0.0); ; return 0; } EOF ! if { (eval echo configure:3211: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3199,3212 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isfinite(0.0); ; return 0; } EOF ! if { (eval echo configure:3210: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3217,3230 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isinf(0.0); ; return 0; } EOF ! if { (eval echo configure:3228: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3216,3229 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isinf(0.0); ; return 0; } EOF ! if { (eval echo configure:3227: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3234,3247 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isnan(0.0); ; return 0; } EOF ! if { (eval echo configure:3245: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3233,3246 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isnan(0.0); ; return 0; } EOF ! if { (eval echo configure:3244: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3251,3264 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isnormal(0.0); ; return 0; } EOF ! if { (eval echo configure:3262: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3250,3263 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isnormal(0.0); ; return 0; } EOF ! if { (eval echo configure:3261: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3268,3281 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { signbit(0.0); ; return 0; } EOF ! if { (eval echo configure:3279: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3267,3280 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { signbit(0.0); ; return 0; } EOF ! if { (eval echo configure:3278: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3285,3298 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isgreater(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3296: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3284,3297 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isgreater(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3295: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3302,3315 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isgreaterequal(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3313: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3301,3314 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isgreaterequal(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3312: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3319,3332 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isless(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3330: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3318,3331 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isless(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3329: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3336,3349 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { islessequal(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3347: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3335,3348 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { islessequal(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3346: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3353,3366 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { islessgreater(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3364: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3352,3365 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { islessgreater(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3363: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3370,3383 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { isunordered(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3381: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3369,3382 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { isunordered(0.0,0.0); ; return 0; } EOF ! if { (eval echo configure:3380: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** rm -f conftest* *** 3391,3406 **** # Check for the existence in of vscanf, et. al. ac_c99_stdio=yes; echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3395: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { snprintf("12", 0, "%i"); ; return 0; } EOF ! if { (eval echo configure:3404: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3390,3405 ---- # Check for the existence in of vscanf, et. al. ac_c99_stdio=yes; echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3394: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { snprintf("12", 0, "%i"); ; return 0; } EOF ! if { (eval echo configure:3403: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3410,3416 **** fi rm -f conftest* cat > conftest.$ac_ext < #include --- 3409,3415 ---- fi rm -f conftest* cat > conftest.$ac_ext < #include *************** int main() { *** 3421,3427 **** ; return 0; } EOF ! if { (eval echo configure:3425: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3420,3426 ---- ; return 0; } EOF ! if { (eval echo configure:3424: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3431,3437 **** fi rm -f conftest* cat > conftest.$ac_ext < #include --- 3430,3436 ---- fi rm -f conftest* cat > conftest.$ac_ext < #include *************** int main() { *** 3442,3448 **** ; return 0; } EOF ! if { (eval echo configure:3446: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3441,3447 ---- ; return 0; } EOF ! if { (eval echo configure:3445: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3452,3458 **** fi rm -f conftest* cat > conftest.$ac_ext < #include --- 3451,3457 ---- fi rm -f conftest* cat > conftest.$ac_ext < #include *************** int main() { *** 3463,3469 **** ; return 0; } EOF ! if { (eval echo configure:3467: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3462,3468 ---- ; return 0; } EOF ! if { (eval echo configure:3466: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3473,3479 **** fi rm -f conftest* cat > conftest.$ac_ext < #include --- 3472,3478 ---- fi rm -f conftest* cat > conftest.$ac_ext < #include *************** int main() { *** 3484,3490 **** ; return 0; } EOF ! if { (eval echo configure:3488: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3483,3489 ---- ; return 0; } EOF ! if { (eval echo configure:3487: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** rm -f conftest* *** 3498,3517 **** # Check for the existence in of lldiv_t, et. al. ac_c99_stdlib=yes; echo $ac_n "checking for lldiv_t declaration""... $ac_c" 1>&6 ! echo "configure:3502: checking for lldiv_t declaration" >&5 if eval "test \"`echo '$''{'ac_c99_lldiv_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { lldiv_t mydivt; ; return 0; } EOF ! if { (eval echo configure:3515: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_c99_lldiv_t=yes else --- 3497,3516 ---- # Check for the existence in of lldiv_t, et. al. ac_c99_stdlib=yes; echo $ac_n "checking for lldiv_t declaration""... $ac_c" 1>&6 ! echo "configure:3501: checking for lldiv_t declaration" >&5 if eval "test \"`echo '$''{'ac_c99_lldiv_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { lldiv_t mydivt; ; return 0; } EOF ! if { (eval echo configure:3514: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_c99_lldiv_t=yes else *************** fi *** 3527,3542 **** echo "$ac_t""$ac_c99_lldiv_t" 1>&6 echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3531: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { char* tmp; strtof("gnu", &tmp); ; return 0; } EOF ! if { (eval echo configure:3540: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3526,3541 ---- echo "$ac_t""$ac_c99_lldiv_t" 1>&6 echo $ac_n "checking for ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3530: checking for ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { char* tmp; strtof("gnu", &tmp); ; return 0; } EOF ! if { (eval echo configure:3539: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3546,3559 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { char* tmp; strtold("gnu", &tmp); ; return 0; } EOF ! if { (eval echo configure:3557: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3545,3558 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { char* tmp; strtold("gnu", &tmp); ; return 0; } EOF ! if { (eval echo configure:3556: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3563,3576 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { llabs(10); ; return 0; } EOF ! if { (eval echo configure:3574: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3562,3575 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { llabs(10); ; return 0; } EOF ! if { (eval echo configure:3573: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3580,3593 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { lldiv(10,1); ; return 0; } EOF ! if { (eval echo configure:3591: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3579,3592 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { lldiv(10,1); ; return 0; } EOF ! if { (eval echo configure:3590: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3597,3610 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { atoll("10"); ; return 0; } EOF ! if { (eval echo configure:3608: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3596,3609 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { atoll("10"); ; return 0; } EOF ! if { (eval echo configure:3607: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3614,3627 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { _Exit(0); ; return 0; } EOF ! if { (eval echo configure:3625: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3613,3626 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { _Exit(0); ; return 0; } EOF ! if { (eval echo configure:3624: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** rm -f conftest* *** 3639,3654 **** # XXX the wchar.h checks should be rolled into the general C99 bits. ac_c99_wchar=yes; echo $ac_n "checking for additional ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3643: checking for additional ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { wcstold(L"10.0", NULL); ; return 0; } EOF ! if { (eval echo configure:3652: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3638,3653 ---- # XXX the wchar.h checks should be rolled into the general C99 bits. ac_c99_wchar=yes; echo $ac_n "checking for additional ISO C99 support in ""... $ac_c" 1>&6 ! echo "configure:3642: checking for additional ISO C99 support in " >&5 cat > conftest.$ac_ext < int main() { wcstold(L"10.0", NULL); ; return 0; } EOF ! if { (eval echo configure:3651: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3658,3671 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { wcstoll(L"10", NULL, 10); ; return 0; } EOF ! if { (eval echo configure:3669: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3657,3670 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { wcstoll(L"10", NULL, 10); ; return 0; } EOF ! if { (eval echo configure:3668: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3675,3688 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { wcstoull(L"10", NULL, 10); ; return 0; } EOF ! if { (eval echo configure:3686: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3674,3687 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { wcstoull(L"10", NULL, 10); ; return 0; } EOF ! if { (eval echo configure:3685: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** rm -f conftest* *** 3694,3700 **** echo "$ac_t""$ac_c99_wchar" 1>&6 echo $ac_n "checking for enabled ISO C99 support""... $ac_c" 1>&6 ! echo "configure:3698: checking for enabled ISO C99 support" >&5 if test x"$ac_c99_math" = x"no" || test x"$ac_c99_stdio" = x"no" || test x"$ac_c99_stdlib" = x"no" || --- 3693,3699 ---- echo "$ac_t""$ac_c99_wchar" 1>&6 echo $ac_n "checking for enabled ISO C99 support""... $ac_c" 1>&6 ! echo "configure:3697: checking for enabled ISO C99 support" >&5 if test x"$ac_c99_math" = x"no" || test x"$ac_c99_stdio" = x"no" || test x"$ac_c99_stdlib" = x"no" || *************** cross_compiling=$ac_cv_prog_cxx_cross *** 3742,3758 **** echo $ac_n "checking for enabled long long I/O support""... $ac_c" 1>&6 ! echo "configure:3746: checking for enabled long long I/O support" >&5 # iostreams require strtoll, strtoull to compile cat > conftest.$ac_ext < int main() { char* tmp; strtoll("gnu", &tmp, 10); ; return 0; } EOF ! if { (eval echo configure:3756: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3741,3757 ---- echo $ac_n "checking for enabled long long I/O support""... $ac_c" 1>&6 ! echo "configure:3745: checking for enabled long long I/O support" >&5 # iostreams require strtoll, strtoull to compile cat > conftest.$ac_ext < int main() { char* tmp; strtoll("gnu", &tmp, 10); ; return 0; } EOF ! if { (eval echo configure:3755: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** else *** 3762,3775 **** fi rm -f conftest* cat > conftest.$ac_ext < int main() { char* tmp; strtoull("gnu", &tmp, 10); ; return 0; } EOF ! if { (eval echo configure:3773: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 --- 3761,3774 ---- fi rm -f conftest* cat > conftest.$ac_ext < int main() { char* tmp; strtoull("gnu", &tmp, 10); ; return 0; } EOF ! if { (eval echo configure:3772: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then : else echo "configure: failed program was:" >&5 *************** cross_compiling=$ac_cv_prog_cc_cross *** 3797,3803 **** echo $ac_n "checking for c header strategy to use""... $ac_c" 1>&6 ! echo "configure:3801: checking for c header strategy to use" >&5 # Check whether --enable-cheaders or --disable-cheaders was given. if test "${enable_cheaders+set}" = set; then enableval="$enable_cheaders" --- 3796,3802 ---- echo $ac_n "checking for c header strategy to use""... $ac_c" 1>&6 ! echo "configure:3800: checking for c header strategy to use" >&5 # Check whether --enable-cheaders or --disable-cheaders was given. if test "${enable_cheaders+set}" = set; then enableval="$enable_cheaders" *************** fi *** 3864,3870 **** echo $ac_n "checking for thread model used by GCC""... $ac_c" 1>&6 ! echo "configure:3868: checking for thread model used by GCC" >&5 target_thread_file=`$CC -v 2>&1 | sed -n 's/^Thread model: //p'` echo "$ac_t""$target_thread_file" 1>&6 --- 3863,3869 ---- echo $ac_n "checking for thread model used by GCC""... $ac_c" 1>&6 ! echo "configure:3867: checking for thread model used by GCC" >&5 target_thread_file=`$CC -v 2>&1 | sed -n 's/^Thread model: //p'` echo "$ac_t""$target_thread_file" 1>&6 *************** EXTRA_CXX_FLAGS="$enable_cxx_flags" *** 3917,3923 **** echo $ac_n "checking for exception model to use""... $ac_c" 1>&6 ! echo "configure:3921: checking for exception model to use" >&5 ac_ext=C # CXXFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. --- 3916,3922 ---- echo $ac_n "checking for exception model to use""... $ac_c" 1>&6 ! echo "configure:3920: checking for exception model to use" >&5 ac_ext=C # CXXFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. *************** if test "${enable_sjlj_exceptions+set}" *** 3932,3938 **** : else cat > conftest.$ac_ext << EOF ! #line 3936 "configure" struct S { ~S(); }; void bar(); void foo() --- 3931,3937 ---- : else cat > conftest.$ac_ext << EOF ! #line 3935 "configure" struct S { ~S(); }; void bar(); void foo() *************** void foo() *** 3943,3949 **** EOF old_CXXFLAGS="$CXXFLAGS" CXXFLAGS="-S -fexceptions" ! if { (eval echo configure:3947: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then if grep _Unwind_SjLj_Resume conftest.s >/dev/null 2>&1 ; then enable_sjlj_exceptions=yes elif grep _Unwind_Resume conftest.s >/dev/null 2>&1 ; then --- 3942,3948 ---- EOF old_CXXFLAGS="$CXXFLAGS" CXXFLAGS="-S -fexceptions" ! if { (eval echo configure:3946: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then if grep _Unwind_SjLj_Resume conftest.s >/dev/null 2>&1 ; then enable_sjlj_exceptions=yes elif grep _Unwind_Resume conftest.s >/dev/null 2>&1 ; then *************** cross_compiling=$ac_cv_prog_cc_cross *** 3976,3982 **** echo $ac_n "checking for use of libunwind""... $ac_c" 1>&6 ! echo "configure:3980: checking for use of libunwind" >&5 # Check whether --enable-libunwind-exceptions or --disable-libunwind-exceptions was given. if test "${enable_libunwind_exceptions+set}" = set; then enableval="$enable_libunwind_exceptions" --- 3975,3981 ---- echo $ac_n "checking for use of libunwind""... $ac_c" 1>&6 ! echo "configure:3979: checking for use of libunwind" >&5 # Check whether --enable-libunwind-exceptions or --disable-libunwind-exceptions was given. if test "${enable_libunwind_exceptions+set}" = set; then enableval="$enable_libunwind_exceptions" *************** for ac_hdr in string.h stdlib.h *** 4017,4033 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4021: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4031: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4016,4032 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4020: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4030: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** if test -n "$with_cross_host" || test x" *** 4094,4110 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4098: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4108: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4093,4109 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4097: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4107: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 4182,4193 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:4186: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:4185: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 4197,4203 ---- } EOF ! if { (eval echo configure:4201: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 4232,4238 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:4236: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 4231,4237 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:4235: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 4240,4253 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 4239,4252 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 4277,4288 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4281: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4280: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4304,4310 ---- ; return 0; } EOF ! if { (eval echo configure:4308: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4334,4345 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4338: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4337: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4361,4367 ---- ; return 0; } EOF ! if { (eval echo configure:4365: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4390,4401 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4394: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4393: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4417,4423 ---- ; return 0; } EOF ! if { (eval echo configure:4421: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4448,4459 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4452: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4451: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4475,4481 ---- ; return 0; } EOF ! if { (eval echo configure:4479: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4508,4523 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:4512: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:4521: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 4507,4522 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:4511: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:4520: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 4539,4555 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4543: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4553: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4538,4554 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4542: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4552: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 4580,4596 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4584: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4594: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4579,4595 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:4583: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4593: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 4623,4638 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:4627: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:4636: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 4622,4637 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:4626: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:4635: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 4645,4653 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:4649: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 4644,4652 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:4648: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 4656,4662 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:4660: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 4655,4661 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:4659: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 4672,4683 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4676: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4675: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4699,4705 ---- ; return 0; } EOF ! if { (eval echo configure:4703: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4735,4746 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4739: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4738: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4762,4768 ---- ; return 0; } EOF ! if { (eval echo configure:4766: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4791,4797 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:4795: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 4790,4796 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:4794: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:4795: checking for ISO C *** 4803,4819 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:4807: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4817: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4802,4818 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:4806: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4816: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 4837,4853 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:4841: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4851: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 4836,4852 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:4840: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:4850: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 4871,4877 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:4875: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 4870,4876 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:4874: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 4879,4885 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 4889,4895 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:4893: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 4916,4927 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:4920: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:4919: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 4943,4949 ---- ; return 0; } EOF ! if { (eval echo configure:4947: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 4974,4980 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:4978: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 4973,4979 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:4977: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:4978: checking for XPG2 *** 4985,4991 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:4989: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 4984,4990 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:4988: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** EOF *** 5044,5060 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5048: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5058: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5043,5059 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5047: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5057: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 5132,5143 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:5136: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:5135: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 5147,5153 ---- } EOF ! if { (eval echo configure:5151: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 5182,5188 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:5186: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 5181,5187 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:5185: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 5190,5203 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 5189,5202 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 5227,5238 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5231: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5230: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5254,5260 ---- ; return 0; } EOF ! if { (eval echo configure:5258: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5284,5295 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5288: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5287: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5311,5317 ---- ; return 0; } EOF ! if { (eval echo configure:5315: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5340,5351 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5344: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5343: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5367,5373 ---- ; return 0; } EOF ! if { (eval echo configure:5371: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5398,5409 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5402: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5401: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5425,5431 ---- ; return 0; } EOF ! if { (eval echo configure:5429: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5458,5473 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:5462: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:5471: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 5457,5472 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:5461: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:5470: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 5489,5505 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5493: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5503: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5488,5504 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5492: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5502: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 5530,5546 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5534: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5544: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5529,5545 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5533: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5543: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 5573,5588 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:5577: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:5586: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 5572,5587 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:5576: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:5585: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 5595,5603 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:5599: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 5594,5602 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:5598: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 5606,5612 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:5610: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 5605,5611 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:5609: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 5622,5633 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5626: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5625: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5649,5655 ---- ; return 0; } EOF ! if { (eval echo configure:5653: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5685,5696 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5689: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5688: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5712,5718 ---- ; return 0; } EOF ! if { (eval echo configure:5716: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5741,5747 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:5745: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 5740,5746 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:5744: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:5745: checking for ISO C *** 5753,5769 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:5757: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5767: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5752,5768 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:5756: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5766: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 5787,5803 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:5791: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5801: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5786,5802 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:5790: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:5800: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 5821,5827 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:5825: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 5820,5826 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:5824: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 5829,5835 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 5839,5845 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:5843: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 5866,5877 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:5870: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:5869: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 5893,5899 ---- ; return 0; } EOF ! if { (eval echo configure:5897: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 5924,5930 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:5928: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 5923,5929 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:5927: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:5928: checking for XPG2 *** 5935,5941 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:5939: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 5934,5940 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:5938: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** EOF *** 5988,6004 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5992: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6002: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 5987,6003 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:5991: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6001: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 6076,6087 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:6080: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:6079: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 6091,6097 ---- } EOF ! if { (eval echo configure:6095: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 6126,6132 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:6130: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 6125,6131 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:6129: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 6134,6147 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 6133,6146 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 6171,6182 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6175: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6174: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6198,6204 ---- ; return 0; } EOF ! if { (eval echo configure:6202: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6228,6239 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6232: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6231: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6255,6261 ---- ; return 0; } EOF ! if { (eval echo configure:6259: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6284,6295 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6288: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6287: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6311,6317 ---- ; return 0; } EOF ! if { (eval echo configure:6315: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6342,6353 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6346: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6345: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6369,6375 ---- ; return 0; } EOF ! if { (eval echo configure:6373: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6402,6417 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:6406: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:6415: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 6401,6416 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:6405: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:6414: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 6433,6449 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6437: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6447: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 6432,6448 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6436: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6446: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 6474,6490 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6478: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6488: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 6473,6489 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6477: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6487: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 6517,6532 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:6521: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:6530: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 6516,6531 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:6520: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:6529: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 6539,6547 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:6543: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 6538,6546 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:6542: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 6550,6556 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:6554: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 6549,6555 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:6553: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 6566,6577 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6570: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6569: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6593,6599 ---- ; return 0; } EOF ! if { (eval echo configure:6597: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6629,6640 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6633: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6632: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6656,6662 ---- ; return 0; } EOF ! if { (eval echo configure:6660: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6685,6691 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:6689: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 6684,6690 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:6688: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:6689: checking for ISO C *** 6697,6713 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:6701: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6711: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 6696,6712 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:6700: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6710: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 6731,6747 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:6735: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6745: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 6730,6746 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:6734: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6744: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 6765,6771 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:6769: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 6764,6770 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:6768: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 6773,6779 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 6783,6789 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:6787: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 6810,6821 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:6814: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:6813: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 6837,6843 ---- ; return 0; } EOF ! if { (eval echo configure:6841: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 6868,6874 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:6872: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 6867,6873 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:6871: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:6872: checking for XPG2 *** 6879,6885 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:6883: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 6878,6884 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:6882: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** EOF *** 6921,6937 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6925: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6935: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 6920,6936 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:6924: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:6934: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 7007,7018 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:7011: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:7010: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 7022,7028 ---- } EOF ! if { (eval echo configure:7026: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 7057,7063 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:7061: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 7056,7062 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:7060: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 7065,7078 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 7064,7077 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 7102,7113 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7106: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7105: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7129,7135 ---- ; return 0; } EOF ! if { (eval echo configure:7133: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7159,7170 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7163: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7162: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7186,7192 ---- ; return 0; } EOF ! if { (eval echo configure:7190: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7215,7226 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7219: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7218: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7242,7248 ---- ; return 0; } EOF ! if { (eval echo configure:7246: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7273,7284 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7277: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7276: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7300,7306 ---- ; return 0; } EOF ! if { (eval echo configure:7304: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7333,7348 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:7337: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:7346: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 7332,7347 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:7336: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:7345: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 7364,7380 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:7368: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7378: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 7363,7379 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:7367: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7377: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 7405,7421 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:7409: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7419: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 7404,7420 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:7408: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7418: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 7448,7463 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:7452: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:7461: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 7447,7462 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:7451: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:7460: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 7470,7478 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:7474: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 7469,7477 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:7473: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 7481,7487 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:7485: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 7480,7486 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:7484: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 7497,7508 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7501: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7500: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7524,7530 ---- ; return 0; } EOF ! if { (eval echo configure:7528: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7560,7571 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7564: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7563: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7587,7593 ---- ; return 0; } EOF ! if { (eval echo configure:7591: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7616,7622 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:7620: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 7615,7621 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:7619: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:7620: checking for ISO C *** 7628,7644 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:7632: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7642: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 7627,7643 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:7631: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7641: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 7662,7678 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:7666: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7676: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 7661,7677 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:7665: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:7675: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 7696,7702 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:7700: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 7695,7701 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:7699: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 7704,7710 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 7714,7720 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:7718: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 7741,7752 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7745: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7744: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 7768,7774 ---- ; return 0; } EOF ! if { (eval echo configure:7772: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 7799,7805 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:7803: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 7798,7804 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:7802: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:7803: checking for XPG2 *** 7810,7816 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:7814: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 7809,7815 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:7813: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** EOF *** 7880,7891 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:7884: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:7883: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 7895,7901 ---- } EOF ! if { (eval echo configure:7899: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 7930,7936 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:7934: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 7929,7935 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:7933: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 7938,7951 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 7937,7950 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 7975,7986 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:7979: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:7978: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8002,8008 ---- ; return 0; } EOF ! if { (eval echo configure:8006: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8032,8043 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8036: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8035: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8059,8065 ---- ; return 0; } EOF ! if { (eval echo configure:8063: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8088,8099 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8092: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8091: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8115,8121 ---- ; return 0; } EOF ! if { (eval echo configure:8119: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8146,8157 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8150: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8149: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8173,8179 ---- ; return 0; } EOF ! if { (eval echo configure:8177: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8206,8221 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:8210: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:8219: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 8205,8220 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:8209: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:8218: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 8237,8253 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:8241: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8251: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 8236,8252 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:8240: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8250: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 8278,8294 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:8282: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8292: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 8277,8293 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:8281: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8291: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 8321,8336 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:8325: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:8334: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 8320,8335 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:8324: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:8333: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 8343,8351 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:8347: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 8342,8350 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:8346: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 8354,8360 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:8358: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 8353,8359 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:8357: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 8370,8381 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8374: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8373: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8397,8403 ---- ; return 0; } EOF ! if { (eval echo configure:8401: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8433,8444 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8437: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8436: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8460,8466 ---- ; return 0; } EOF ! if { (eval echo configure:8464: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8489,8495 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:8493: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 8488,8494 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:8492: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:8493: checking for ISO C *** 8501,8517 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:8505: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8515: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 8500,8516 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:8504: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8514: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 8535,8551 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:8539: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8549: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 8534,8550 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:8538: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:8548: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 8569,8575 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:8573: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 8568,8574 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:8572: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 8577,8583 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 8587,8593 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:8591: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 8614,8625 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:8618: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:8617: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 8641,8647 ---- ; return 0; } EOF ! if { (eval echo configure:8645: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 8672,8678 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:8676: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 8671,8677 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:8675: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:8676: checking for XPG2 *** 8683,8689 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:8687: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 8682,8688 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:8686: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** else *** 9026,9042 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:9030: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:9040: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 9025,9041 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:9029: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:9039: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** cross_compiling=$ac_cv_prog_cxx_cross *** 9087,9096 **** # Check for -ffunction-sections -fdata-sections echo $ac_n "checking for g++ that supports -ffunction-sections -fdata-sections""... $ac_c" 1>&6 ! echo "configure:9091: checking for g++ that supports -ffunction-sections -fdata-sections" >&5 CXXFLAGS='-Werror -ffunction-sections -fdata-sections' cat > conftest.$ac_ext <&6 ! echo "configure:9090: checking for g++ that supports -ffunction-sections -fdata-sections" >&5 CXXFLAGS='-Werror -ffunction-sections -fdata-sections' cat > conftest.$ac_ext <&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_fdsections=yes else --- 9097,9103 ---- ; return 0; } EOF ! if { (eval echo configure:9101: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_fdsections=yes else *************** cross_compiling=$ac_cv_prog_cc_cross *** 9180,9191 **** # used sections, first .eh_frame and now some of the glibc sections for # iconv). Bzzzzt. Thanks for playing, maybe next time. echo $ac_n "checking for ld that supports -Wl,--gc-sections""... $ac_c" 1>&6 ! echo "configure:9184: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&6 ! echo "configure:9183: checking for ld that supports -Wl,--gc-sections" >&5 if test "$cross_compiling" = yes; then ac_sectionLDflags=yes else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else --- 9195,9201 ---- } EOF ! if { (eval echo configure:9199: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_sectionLDflags=yes else *************** fi *** 9231,9237 **** echo $ac_n "checking for __builtin_abs declaration""... $ac_c" 1>&6 ! echo "configure:9235: checking for __builtin_abs declaration" >&5 if test x${glibcpp_cv_func___builtin_abs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_abs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9230,9236 ---- echo $ac_n "checking for __builtin_abs declaration""... $ac_c" 1>&6 ! echo "configure:9234: checking for __builtin_abs declaration" >&5 if test x${glibcpp_cv_func___builtin_abs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_abs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9246,9259 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_abs(0); ; return 0; } EOF ! if { (eval echo configure:9257: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_abs_use=yes else --- 9245,9258 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_abs(0); ; return 0; } EOF ! if { (eval echo configure:9256: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_abs_use=yes else *************** fi *** 9277,9297 **** echo "$ac_t""$glibcpp_cv_func___builtin_abs_use" 1>&6 if test x$glibcpp_cv_func___builtin_abs_use = x"yes"; then echo $ac_n "checking for __builtin_abs linkage""... $ac_c" 1>&6 ! echo "configure:9281: checking for __builtin_abs linkage" >&5 if test x${glibcpp_cv_func___builtin_abs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_abs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_abs(0); ; return 0; } EOF ! if { (eval echo configure:9295: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_abs_link=yes else --- 9276,9296 ---- echo "$ac_t""$glibcpp_cv_func___builtin_abs_use" 1>&6 if test x$glibcpp_cv_func___builtin_abs_use = x"yes"; then echo $ac_n "checking for __builtin_abs linkage""... $ac_c" 1>&6 ! echo "configure:9280: checking for __builtin_abs linkage" >&5 if test x${glibcpp_cv_func___builtin_abs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_abs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_abs(0); ; return 0; } EOF ! if { (eval echo configure:9294: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_abs_link=yes else *************** EOF *** 9317,9323 **** echo $ac_n "checking for __builtin_fabsf declaration""... $ac_c" 1>&6 ! echo "configure:9321: checking for __builtin_fabsf declaration" >&5 if test x${glibcpp_cv_func___builtin_fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9316,9322 ---- echo $ac_n "checking for __builtin_fabsf declaration""... $ac_c" 1>&6 ! echo "configure:9320: checking for __builtin_fabsf declaration" >&5 if test x${glibcpp_cv_func___builtin_fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9332,9345 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabsf(0); ; return 0; } EOF ! if { (eval echo configure:9343: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabsf_use=yes else --- 9331,9344 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabsf(0); ; return 0; } EOF ! if { (eval echo configure:9342: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabsf_use=yes else *************** fi *** 9363,9383 **** echo "$ac_t""$glibcpp_cv_func___builtin_fabsf_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabsf_use = x"yes"; then echo $ac_n "checking for __builtin_fabsf linkage""... $ac_c" 1>&6 ! echo "configure:9367: checking for __builtin_fabsf linkage" >&5 if test x${glibcpp_cv_func___builtin_fabsf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabsf(0); ; return 0; } EOF ! if { (eval echo configure:9381: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabsf_link=yes else --- 9362,9382 ---- echo "$ac_t""$glibcpp_cv_func___builtin_fabsf_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabsf_use = x"yes"; then echo $ac_n "checking for __builtin_fabsf linkage""... $ac_c" 1>&6 ! echo "configure:9366: checking for __builtin_fabsf linkage" >&5 if test x${glibcpp_cv_func___builtin_fabsf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabsf(0); ; return 0; } EOF ! if { (eval echo configure:9380: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabsf_link=yes else *************** EOF *** 9403,9409 **** echo $ac_n "checking for __builtin_fabs declaration""... $ac_c" 1>&6 ! echo "configure:9407: checking for __builtin_fabs declaration" >&5 if test x${glibcpp_cv_func___builtin_fabs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9402,9408 ---- echo $ac_n "checking for __builtin_fabs declaration""... $ac_c" 1>&6 ! echo "configure:9406: checking for __builtin_fabs declaration" >&5 if test x${glibcpp_cv_func___builtin_fabs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9418,9431 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabs(0); ; return 0; } EOF ! if { (eval echo configure:9429: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabs_use=yes else --- 9417,9430 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabs(0); ; return 0; } EOF ! if { (eval echo configure:9428: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabs_use=yes else *************** fi *** 9449,9469 **** echo "$ac_t""$glibcpp_cv_func___builtin_fabs_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabs_use = x"yes"; then echo $ac_n "checking for __builtin_fabs linkage""... $ac_c" 1>&6 ! echo "configure:9453: checking for __builtin_fabs linkage" >&5 if test x${glibcpp_cv_func___builtin_fabs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabs(0); ; return 0; } EOF ! if { (eval echo configure:9467: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabs_link=yes else --- 9448,9468 ---- echo "$ac_t""$glibcpp_cv_func___builtin_fabs_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabs_use = x"yes"; then echo $ac_n "checking for __builtin_fabs linkage""... $ac_c" 1>&6 ! echo "configure:9452: checking for __builtin_fabs linkage" >&5 if test x${glibcpp_cv_func___builtin_fabs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabs(0); ; return 0; } EOF ! if { (eval echo configure:9466: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabs_link=yes else *************** EOF *** 9489,9495 **** echo $ac_n "checking for __builtin_fabsl declaration""... $ac_c" 1>&6 ! echo "configure:9493: checking for __builtin_fabsl declaration" >&5 if test x${glibcpp_cv_func___builtin_fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9488,9494 ---- echo $ac_n "checking for __builtin_fabsl declaration""... $ac_c" 1>&6 ! echo "configure:9492: checking for __builtin_fabsl declaration" >&5 if test x${glibcpp_cv_func___builtin_fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9504,9517 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabsl(0); ; return 0; } EOF ! if { (eval echo configure:9515: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabsl_use=yes else --- 9503,9516 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_fabsl(0); ; return 0; } EOF ! if { (eval echo configure:9514: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_fabsl_use=yes else *************** fi *** 9535,9555 **** echo "$ac_t""$glibcpp_cv_func___builtin_fabsl_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabsl_use = x"yes"; then echo $ac_n "checking for __builtin_fabsl linkage""... $ac_c" 1>&6 ! echo "configure:9539: checking for __builtin_fabsl linkage" >&5 if test x${glibcpp_cv_func___builtin_fabsl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabsl(0); ; return 0; } EOF ! if { (eval echo configure:9553: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabsl_link=yes else --- 9534,9554 ---- echo "$ac_t""$glibcpp_cv_func___builtin_fabsl_use" 1>&6 if test x$glibcpp_cv_func___builtin_fabsl_use = x"yes"; then echo $ac_n "checking for __builtin_fabsl linkage""... $ac_c" 1>&6 ! echo "configure:9538: checking for __builtin_fabsl linkage" >&5 if test x${glibcpp_cv_func___builtin_fabsl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_fabsl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_fabsl(0); ; return 0; } EOF ! if { (eval echo configure:9552: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_fabsl_link=yes else *************** EOF *** 9575,9581 **** echo $ac_n "checking for __builtin_labs declaration""... $ac_c" 1>&6 ! echo "configure:9579: checking for __builtin_labs declaration" >&5 if test x${glibcpp_cv_func___builtin_labs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_labs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9574,9580 ---- echo $ac_n "checking for __builtin_labs declaration""... $ac_c" 1>&6 ! echo "configure:9578: checking for __builtin_labs declaration" >&5 if test x${glibcpp_cv_func___builtin_labs_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_labs_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9590,9603 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_labs(0); ; return 0; } EOF ! if { (eval echo configure:9601: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_labs_use=yes else --- 9589,9602 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_labs(0); ; return 0; } EOF ! if { (eval echo configure:9600: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_labs_use=yes else *************** fi *** 9621,9641 **** echo "$ac_t""$glibcpp_cv_func___builtin_labs_use" 1>&6 if test x$glibcpp_cv_func___builtin_labs_use = x"yes"; then echo $ac_n "checking for __builtin_labs linkage""... $ac_c" 1>&6 ! echo "configure:9625: checking for __builtin_labs linkage" >&5 if test x${glibcpp_cv_func___builtin_labs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_labs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_labs(0); ; return 0; } EOF ! if { (eval echo configure:9639: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_labs_link=yes else --- 9620,9640 ---- echo "$ac_t""$glibcpp_cv_func___builtin_labs_use" 1>&6 if test x$glibcpp_cv_func___builtin_labs_use = x"yes"; then echo $ac_n "checking for __builtin_labs linkage""... $ac_c" 1>&6 ! echo "configure:9624: checking for __builtin_labs linkage" >&5 if test x${glibcpp_cv_func___builtin_labs_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_labs_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_labs(0); ; return 0; } EOF ! if { (eval echo configure:9638: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_labs_link=yes else *************** EOF *** 9662,9668 **** echo $ac_n "checking for __builtin_sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:9666: checking for __builtin_sqrtf declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9661,9667 ---- echo $ac_n "checking for __builtin_sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:9665: checking for __builtin_sqrtf declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9677,9690 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:9688: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtf_use=yes else --- 9676,9689 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:9687: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtf_use=yes else *************** fi *** 9708,9728 **** echo "$ac_t""$glibcpp_cv_func___builtin_sqrtf_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrtf_use = x"yes"; then echo $ac_n "checking for __builtin_sqrtf linkage""... $ac_c" 1>&6 ! echo "configure:9712: checking for __builtin_sqrtf linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrtf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:9726: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtf_link=yes else --- 9707,9727 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sqrtf_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrtf_use = x"yes"; then echo $ac_n "checking for __builtin_sqrtf linkage""... $ac_c" 1>&6 ! echo "configure:9711: checking for __builtin_sqrtf linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrtf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:9725: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtf_link=yes else *************** EOF *** 9748,9754 **** echo $ac_n "checking for __builtin_sqrt declaration""... $ac_c" 1>&6 ! echo "configure:9752: checking for __builtin_sqrt declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrt_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrt_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9747,9753 ---- echo $ac_n "checking for __builtin_sqrt declaration""... $ac_c" 1>&6 ! echo "configure:9751: checking for __builtin_sqrt declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrt_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrt_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9763,9776 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrt(0); ; return 0; } EOF ! if { (eval echo configure:9774: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrt_use=yes else --- 9762,9775 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrt(0); ; return 0; } EOF ! if { (eval echo configure:9773: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrt_use=yes else *************** fi *** 9794,9814 **** echo "$ac_t""$glibcpp_cv_func___builtin_sqrt_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrt_use = x"yes"; then echo $ac_n "checking for __builtin_sqrt linkage""... $ac_c" 1>&6 ! echo "configure:9798: checking for __builtin_sqrt linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrt_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrt_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrt(0); ; return 0; } EOF ! if { (eval echo configure:9812: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrt_link=yes else --- 9793,9813 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sqrt_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrt_use = x"yes"; then echo $ac_n "checking for __builtin_sqrt linkage""... $ac_c" 1>&6 ! echo "configure:9797: checking for __builtin_sqrt linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrt_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrt_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrt(0); ; return 0; } EOF ! if { (eval echo configure:9811: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrt_link=yes else *************** EOF *** 9834,9840 **** echo $ac_n "checking for __builtin_sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:9838: checking for __builtin_sqrtl declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9833,9839 ---- echo $ac_n "checking for __builtin_sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:9837: checking for __builtin_sqrtl declaration" >&5 if test x${glibcpp_cv_func___builtin_sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9849,9862 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:9860: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtl_use=yes else --- 9848,9861 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:9859: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtl_use=yes else *************** fi *** 9880,9900 **** echo "$ac_t""$glibcpp_cv_func___builtin_sqrtl_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrtl_use = x"yes"; then echo $ac_n "checking for __builtin_sqrtl linkage""... $ac_c" 1>&6 ! echo "configure:9884: checking for __builtin_sqrtl linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrtl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:9898: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtl_link=yes else --- 9879,9899 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sqrtl_use" 1>&6 if test x$glibcpp_cv_func___builtin_sqrtl_use = x"yes"; then echo $ac_n "checking for __builtin_sqrtl linkage""... $ac_c" 1>&6 ! echo "configure:9883: checking for __builtin_sqrtl linkage" >&5 if test x${glibcpp_cv_func___builtin_sqrtl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sqrtl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:9897: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sqrtl_link=yes else *************** EOF *** 9921,9927 **** echo $ac_n "checking for __builtin_sinf declaration""... $ac_c" 1>&6 ! echo "configure:9925: checking for __builtin_sinf declaration" >&5 if test x${glibcpp_cv_func___builtin_sinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 9920,9926 ---- echo $ac_n "checking for __builtin_sinf declaration""... $ac_c" 1>&6 ! echo "configure:9924: checking for __builtin_sinf declaration" >&5 if test x${glibcpp_cv_func___builtin_sinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 9936,9949 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sinf(0); ; return 0; } EOF ! if { (eval echo configure:9947: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sinf_use=yes else --- 9935,9948 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sinf(0); ; return 0; } EOF ! if { (eval echo configure:9946: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sinf_use=yes else *************** fi *** 9967,9987 **** echo "$ac_t""$glibcpp_cv_func___builtin_sinf_use" 1>&6 if test x$glibcpp_cv_func___builtin_sinf_use = x"yes"; then echo $ac_n "checking for __builtin_sinf linkage""... $ac_c" 1>&6 ! echo "configure:9971: checking for __builtin_sinf linkage" >&5 if test x${glibcpp_cv_func___builtin_sinf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sinf(0); ; return 0; } EOF ! if { (eval echo configure:9985: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sinf_link=yes else --- 9966,9986 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sinf_use" 1>&6 if test x$glibcpp_cv_func___builtin_sinf_use = x"yes"; then echo $ac_n "checking for __builtin_sinf linkage""... $ac_c" 1>&6 ! echo "configure:9970: checking for __builtin_sinf linkage" >&5 if test x${glibcpp_cv_func___builtin_sinf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sinf(0); ; return 0; } EOF ! if { (eval echo configure:9984: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sinf_link=yes else *************** EOF *** 10007,10013 **** echo $ac_n "checking for __builtin_sin declaration""... $ac_c" 1>&6 ! echo "configure:10011: checking for __builtin_sin declaration" >&5 if test x${glibcpp_cv_func___builtin_sin_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sin_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10006,10012 ---- echo $ac_n "checking for __builtin_sin declaration""... $ac_c" 1>&6 ! echo "configure:10010: checking for __builtin_sin declaration" >&5 if test x${glibcpp_cv_func___builtin_sin_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sin_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10022,10035 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sin(0); ; return 0; } EOF ! if { (eval echo configure:10033: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sin_use=yes else --- 10021,10034 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sin(0); ; return 0; } EOF ! if { (eval echo configure:10032: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sin_use=yes else *************** fi *** 10053,10073 **** echo "$ac_t""$glibcpp_cv_func___builtin_sin_use" 1>&6 if test x$glibcpp_cv_func___builtin_sin_use = x"yes"; then echo $ac_n "checking for __builtin_sin linkage""... $ac_c" 1>&6 ! echo "configure:10057: checking for __builtin_sin linkage" >&5 if test x${glibcpp_cv_func___builtin_sin_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sin_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sin(0); ; return 0; } EOF ! if { (eval echo configure:10071: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sin_link=yes else --- 10052,10072 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sin_use" 1>&6 if test x$glibcpp_cv_func___builtin_sin_use = x"yes"; then echo $ac_n "checking for __builtin_sin linkage""... $ac_c" 1>&6 ! echo "configure:10056: checking for __builtin_sin linkage" >&5 if test x${glibcpp_cv_func___builtin_sin_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sin_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sin(0); ; return 0; } EOF ! if { (eval echo configure:10070: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sin_link=yes else *************** EOF *** 10093,10099 **** echo $ac_n "checking for __builtin_sinl declaration""... $ac_c" 1>&6 ! echo "configure:10097: checking for __builtin_sinl declaration" >&5 if test x${glibcpp_cv_func___builtin_sinl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10092,10098 ---- echo $ac_n "checking for __builtin_sinl declaration""... $ac_c" 1>&6 ! echo "configure:10096: checking for __builtin_sinl declaration" >&5 if test x${glibcpp_cv_func___builtin_sinl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10108,10121 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sinl(0); ; return 0; } EOF ! if { (eval echo configure:10119: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sinl_use=yes else --- 10107,10120 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_sinl(0); ; return 0; } EOF ! if { (eval echo configure:10118: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_sinl_use=yes else *************** fi *** 10139,10159 **** echo "$ac_t""$glibcpp_cv_func___builtin_sinl_use" 1>&6 if test x$glibcpp_cv_func___builtin_sinl_use = x"yes"; then echo $ac_n "checking for __builtin_sinl linkage""... $ac_c" 1>&6 ! echo "configure:10143: checking for __builtin_sinl linkage" >&5 if test x${glibcpp_cv_func___builtin_sinl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sinl(0); ; return 0; } EOF ! if { (eval echo configure:10157: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sinl_link=yes else --- 10138,10158 ---- echo "$ac_t""$glibcpp_cv_func___builtin_sinl_use" 1>&6 if test x$glibcpp_cv_func___builtin_sinl_use = x"yes"; then echo $ac_n "checking for __builtin_sinl linkage""... $ac_c" 1>&6 ! echo "configure:10142: checking for __builtin_sinl linkage" >&5 if test x${glibcpp_cv_func___builtin_sinl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_sinl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_sinl(0); ; return 0; } EOF ! if { (eval echo configure:10156: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_sinl_link=yes else *************** EOF *** 10180,10186 **** echo $ac_n "checking for __builtin_cosf declaration""... $ac_c" 1>&6 ! echo "configure:10184: checking for __builtin_cosf declaration" >&5 if test x${glibcpp_cv_func___builtin_cosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10179,10185 ---- echo $ac_n "checking for __builtin_cosf declaration""... $ac_c" 1>&6 ! echo "configure:10183: checking for __builtin_cosf declaration" >&5 if test x${glibcpp_cv_func___builtin_cosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10195,10208 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cosf(0); ; return 0; } EOF ! if { (eval echo configure:10206: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cosf_use=yes else --- 10194,10207 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cosf(0); ; return 0; } EOF ! if { (eval echo configure:10205: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cosf_use=yes else *************** fi *** 10226,10246 **** echo "$ac_t""$glibcpp_cv_func___builtin_cosf_use" 1>&6 if test x$glibcpp_cv_func___builtin_cosf_use = x"yes"; then echo $ac_n "checking for __builtin_cosf linkage""... $ac_c" 1>&6 ! echo "configure:10230: checking for __builtin_cosf linkage" >&5 if test x${glibcpp_cv_func___builtin_cosf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cosf(0); ; return 0; } EOF ! if { (eval echo configure:10244: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cosf_link=yes else --- 10225,10245 ---- echo "$ac_t""$glibcpp_cv_func___builtin_cosf_use" 1>&6 if test x$glibcpp_cv_func___builtin_cosf_use = x"yes"; then echo $ac_n "checking for __builtin_cosf linkage""... $ac_c" 1>&6 ! echo "configure:10229: checking for __builtin_cosf linkage" >&5 if test x${glibcpp_cv_func___builtin_cosf_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosf_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cosf(0); ; return 0; } EOF ! if { (eval echo configure:10243: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cosf_link=yes else *************** EOF *** 10266,10272 **** echo $ac_n "checking for __builtin_cos declaration""... $ac_c" 1>&6 ! echo "configure:10270: checking for __builtin_cos declaration" >&5 if test x${glibcpp_cv_func___builtin_cos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10265,10271 ---- echo $ac_n "checking for __builtin_cos declaration""... $ac_c" 1>&6 ! echo "configure:10269: checking for __builtin_cos declaration" >&5 if test x${glibcpp_cv_func___builtin_cos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10281,10294 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cos(0); ; return 0; } EOF ! if { (eval echo configure:10292: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cos_use=yes else --- 10280,10293 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cos(0); ; return 0; } EOF ! if { (eval echo configure:10291: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cos_use=yes else *************** fi *** 10312,10332 **** echo "$ac_t""$glibcpp_cv_func___builtin_cos_use" 1>&6 if test x$glibcpp_cv_func___builtin_cos_use = x"yes"; then echo $ac_n "checking for __builtin_cos linkage""... $ac_c" 1>&6 ! echo "configure:10316: checking for __builtin_cos linkage" >&5 if test x${glibcpp_cv_func___builtin_cos_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cos_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cos(0); ; return 0; } EOF ! if { (eval echo configure:10330: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cos_link=yes else --- 10311,10331 ---- echo "$ac_t""$glibcpp_cv_func___builtin_cos_use" 1>&6 if test x$glibcpp_cv_func___builtin_cos_use = x"yes"; then echo $ac_n "checking for __builtin_cos linkage""... $ac_c" 1>&6 ! echo "configure:10315: checking for __builtin_cos linkage" >&5 if test x${glibcpp_cv_func___builtin_cos_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cos_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cos(0); ; return 0; } EOF ! if { (eval echo configure:10329: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cos_link=yes else *************** EOF *** 10352,10358 **** echo $ac_n "checking for __builtin_cosl declaration""... $ac_c" 1>&6 ! echo "configure:10356: checking for __builtin_cosl declaration" >&5 if test x${glibcpp_cv_func___builtin_cosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10351,10357 ---- echo $ac_n "checking for __builtin_cosl declaration""... $ac_c" 1>&6 ! echo "configure:10355: checking for __builtin_cosl declaration" >&5 if test x${glibcpp_cv_func___builtin_cosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10367,10380 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cosl(0); ; return 0; } EOF ! if { (eval echo configure:10378: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cosl_use=yes else --- 10366,10379 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { __builtin_cosl(0); ; return 0; } EOF ! if { (eval echo configure:10377: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func___builtin_cosl_use=yes else *************** fi *** 10398,10418 **** echo "$ac_t""$glibcpp_cv_func___builtin_cosl_use" 1>&6 if test x$glibcpp_cv_func___builtin_cosl_use = x"yes"; then echo $ac_n "checking for __builtin_cosl linkage""... $ac_c" 1>&6 ! echo "configure:10402: checking for __builtin_cosl linkage" >&5 if test x${glibcpp_cv_func___builtin_cosl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cosl(0); ; return 0; } EOF ! if { (eval echo configure:10416: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cosl_link=yes else --- 10397,10417 ---- echo "$ac_t""$glibcpp_cv_func___builtin_cosl_use" 1>&6 if test x$glibcpp_cv_func___builtin_cosl_use = x"yes"; then echo $ac_n "checking for __builtin_cosl linkage""... $ac_c" 1>&6 ! echo "configure:10401: checking for __builtin_cosl linkage" >&5 if test x${glibcpp_cv_func___builtin_cosl_link+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func___builtin_cosl_link'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { __builtin_cosl(0); ; return 0; } EOF ! if { (eval echo configure:10415: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_cv_func___builtin_cosl_link=yes else *************** EOF *** 10503,10509 **** CXXFLAGS='-fno-builtins -D_GNU_SOURCE' echo $ac_n "checking for sin in -lm""... $ac_c" 1>&6 ! echo "configure:10507: checking for sin in -lm" >&5 ac_lib_var=`echo m'_'sin | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10502,10508 ---- CXXFLAGS='-fno-builtins -D_GNU_SOURCE' echo $ac_n "checking for sin in -lm""... $ac_c" 1>&6 ! echo "configure:10506: checking for sin in -lm" >&5 ac_lib_var=`echo m'_'sin | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 10511,10517 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 10521,10527 ---- sin() ; return 0; } EOF ! if { (eval echo configure:10525: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 10548,10554 **** echo $ac_n "checking for isinf declaration""... $ac_c" 1>&6 ! echo "configure:10552: checking for isinf declaration" >&5 if test x${glibcpp_cv_func_isinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10547,10553 ---- echo $ac_n "checking for isinf declaration""... $ac_c" 1>&6 ! echo "configure:10551: checking for isinf declaration" >&5 if test x${glibcpp_cv_func_isinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10563,10569 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 10562,10568 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 10574,10580 **** isinf(0); ; return 0; } EOF ! if { (eval echo configure:10578: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinf_use=yes else --- 10573,10579 ---- isinf(0); ; return 0; } EOF ! if { (eval echo configure:10577: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinf_use=yes else *************** fi *** 10601,10612 **** for ac_func in isinf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:10605: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:10604: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 10628,10634 ---- ; return 0; } EOF ! if { (eval echo configure:10632: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 10656,10662 **** else echo $ac_n "checking for _isinf declaration""... $ac_c" 1>&6 ! echo "configure:10660: checking for _isinf declaration" >&5 if test x${glibcpp_cv_func__isinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10655,10661 ---- else echo $ac_n "checking for _isinf declaration""... $ac_c" 1>&6 ! echo "configure:10659: checking for _isinf declaration" >&5 if test x${glibcpp_cv_func__isinf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10671,10677 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 10670,10676 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 10682,10688 **** _isinf(0); ; return 0; } EOF ! if { (eval echo configure:10686: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinf_use=yes else --- 10681,10687 ---- _isinf(0); ; return 0; } EOF ! if { (eval echo configure:10685: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinf_use=yes else *************** fi *** 10709,10720 **** for ac_func in _isinf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:10713: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:10712: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 10736,10742 ---- ; return 0; } EOF ! if { (eval echo configure:10740: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 10767,10773 **** echo $ac_n "checking for isnan declaration""... $ac_c" 1>&6 ! echo "configure:10771: checking for isnan declaration" >&5 if test x${glibcpp_cv_func_isnan_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnan_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10766,10772 ---- echo $ac_n "checking for isnan declaration""... $ac_c" 1>&6 ! echo "configure:10770: checking for isnan declaration" >&5 if test x${glibcpp_cv_func_isnan_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnan_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10782,10788 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 10781,10787 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 10793,10799 **** isnan(0); ; return 0; } EOF ! if { (eval echo configure:10797: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnan_use=yes else --- 10792,10798 ---- isnan(0); ; return 0; } EOF ! if { (eval echo configure:10796: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnan_use=yes else *************** fi *** 10820,10831 **** for ac_func in isnan do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:10824: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:10823: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 10847,10853 ---- ; return 0; } EOF ! if { (eval echo configure:10851: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 10875,10881 **** else echo $ac_n "checking for _isnan declaration""... $ac_c" 1>&6 ! echo "configure:10879: checking for _isnan declaration" >&5 if test x${glibcpp_cv_func__isnan_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnan_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10874,10880 ---- else echo $ac_n "checking for _isnan declaration""... $ac_c" 1>&6 ! echo "configure:10878: checking for _isnan declaration" >&5 if test x${glibcpp_cv_func__isnan_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnan_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 10890,10896 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 10889,10895 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 10901,10907 **** _isnan(0); ; return 0; } EOF ! if { (eval echo configure:10905: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnan_use=yes else --- 10900,10906 ---- _isnan(0); ; return 0; } EOF ! if { (eval echo configure:10904: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnan_use=yes else *************** fi *** 10928,10939 **** for ac_func in _isnan do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:10932: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:10931: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 10955,10961 ---- ; return 0; } EOF ! if { (eval echo configure:10959: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 10986,10992 **** echo $ac_n "checking for finite declaration""... $ac_c" 1>&6 ! echo "configure:10990: checking for finite declaration" >&5 if test x${glibcpp_cv_func_finite_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finite_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 10985,10991 ---- echo $ac_n "checking for finite declaration""... $ac_c" 1>&6 ! echo "configure:10989: checking for finite declaration" >&5 if test x${glibcpp_cv_func_finite_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finite_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11001,11007 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11000,11006 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11012,11018 **** finite(0); ; return 0; } EOF ! if { (eval echo configure:11016: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finite_use=yes else --- 11011,11017 ---- finite(0); ; return 0; } EOF ! if { (eval echo configure:11015: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finite_use=yes else *************** fi *** 11039,11050 **** for ac_func in finite do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11043: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11042: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11066,11072 ---- ; return 0; } EOF ! if { (eval echo configure:11070: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11094,11100 **** else echo $ac_n "checking for _finite declaration""... $ac_c" 1>&6 ! echo "configure:11098: checking for _finite declaration" >&5 if test x${glibcpp_cv_func__finite_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finite_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11093,11099 ---- else echo $ac_n "checking for _finite declaration""... $ac_c" 1>&6 ! echo "configure:11097: checking for _finite declaration" >&5 if test x${glibcpp_cv_func__finite_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finite_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11109,11115 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11108,11114 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11120,11126 **** _finite(0); ; return 0; } EOF ! if { (eval echo configure:11124: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finite_use=yes else --- 11119,11125 ---- _finite(0); ; return 0; } EOF ! if { (eval echo configure:11123: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finite_use=yes else *************** fi *** 11147,11158 **** for ac_func in _finite do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11151: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11150: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11174,11180 ---- ; return 0; } EOF ! if { (eval echo configure:11178: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11205,11211 **** echo $ac_n "checking for copysign declaration""... $ac_c" 1>&6 ! echo "configure:11209: checking for copysign declaration" >&5 if test x${glibcpp_cv_func_copysign_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_copysign_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11204,11210 ---- echo $ac_n "checking for copysign declaration""... $ac_c" 1>&6 ! echo "configure:11208: checking for copysign declaration" >&5 if test x${glibcpp_cv_func_copysign_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_copysign_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11220,11233 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { copysign(0, 0); ; return 0; } EOF ! if { (eval echo configure:11231: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_copysign_use=yes else --- 11219,11232 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { copysign(0, 0); ; return 0; } EOF ! if { (eval echo configure:11230: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_copysign_use=yes else *************** fi *** 11254,11265 **** for ac_func in copysign do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11258: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11257: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11281,11287 ---- ; return 0; } EOF ! if { (eval echo configure:11285: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11309,11315 **** else echo $ac_n "checking for _copysign declaration""... $ac_c" 1>&6 ! echo "configure:11313: checking for _copysign declaration" >&5 if test x${glibcpp_cv_func__copysign_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__copysign_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11308,11314 ---- else echo $ac_n "checking for _copysign declaration""... $ac_c" 1>&6 ! echo "configure:11312: checking for _copysign declaration" >&5 if test x${glibcpp_cv_func__copysign_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__copysign_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11324,11337 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _copysign(0, 0); ; return 0; } EOF ! if { (eval echo configure:11335: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__copysign_use=yes else --- 11323,11336 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _copysign(0, 0); ; return 0; } EOF ! if { (eval echo configure:11334: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__copysign_use=yes else *************** fi *** 11358,11369 **** for ac_func in _copysign do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11362: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11361: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11385,11391 ---- ; return 0; } EOF ! if { (eval echo configure:11389: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11416,11422 **** echo $ac_n "checking for sincos declaration""... $ac_c" 1>&6 ! echo "configure:11420: checking for sincos declaration" >&5 if test x${glibcpp_cv_func_sincos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11415,11421 ---- echo $ac_n "checking for sincos declaration""... $ac_c" 1>&6 ! echo "configure:11419: checking for sincos declaration" >&5 if test x${glibcpp_cv_func_sincos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11431,11444 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincos(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:11442: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincos_use=yes else --- 11430,11443 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincos(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:11441: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincos_use=yes else *************** fi *** 11465,11476 **** for ac_func in sincos do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11469: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11468: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11492,11498 ---- ; return 0; } EOF ! if { (eval echo configure:11496: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11520,11526 **** else echo $ac_n "checking for _sincos declaration""... $ac_c" 1>&6 ! echo "configure:11524: checking for _sincos declaration" >&5 if test x${glibcpp_cv_func__sincos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11519,11525 ---- else echo $ac_n "checking for _sincos declaration""... $ac_c" 1>&6 ! echo "configure:11523: checking for _sincos declaration" >&5 if test x${glibcpp_cv_func__sincos_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincos_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11535,11548 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincos(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:11546: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincos_use=yes else --- 11534,11547 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincos(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:11545: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincos_use=yes else *************** fi *** 11569,11580 **** for ac_func in _sincos do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11573: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11572: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11596,11602 ---- ; return 0; } EOF ! if { (eval echo configure:11600: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11627,11633 **** echo $ac_n "checking for fpclass declaration""... $ac_c" 1>&6 ! echo "configure:11631: checking for fpclass declaration" >&5 if test x${glibcpp_cv_func_fpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11626,11632 ---- echo $ac_n "checking for fpclass declaration""... $ac_c" 1>&6 ! echo "configure:11630: checking for fpclass declaration" >&5 if test x${glibcpp_cv_func_fpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11642,11648 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11641,11647 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11653,11659 **** fpclass(0); ; return 0; } EOF ! if { (eval echo configure:11657: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fpclass_use=yes else --- 11652,11658 ---- fpclass(0); ; return 0; } EOF ! if { (eval echo configure:11656: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fpclass_use=yes else *************** fi *** 11680,11691 **** for ac_func in fpclass do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11684: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11683: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11707,11713 ---- ; return 0; } EOF ! if { (eval echo configure:11711: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11735,11741 **** else echo $ac_n "checking for _fpclass declaration""... $ac_c" 1>&6 ! echo "configure:11739: checking for _fpclass declaration" >&5 if test x${glibcpp_cv_func__fpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11734,11740 ---- else echo $ac_n "checking for _fpclass declaration""... $ac_c" 1>&6 ! echo "configure:11738: checking for _fpclass declaration" >&5 if test x${glibcpp_cv_func__fpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11750,11756 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11749,11755 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11761,11767 **** _fpclass(0); ; return 0; } EOF ! if { (eval echo configure:11765: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fpclass_use=yes else --- 11760,11766 ---- _fpclass(0); ; return 0; } EOF ! if { (eval echo configure:11764: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fpclass_use=yes else *************** fi *** 11788,11799 **** for ac_func in _fpclass do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11792: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11791: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11815,11821 ---- ; return 0; } EOF ! if { (eval echo configure:11819: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11846,11852 **** echo $ac_n "checking for qfpclass declaration""... $ac_c" 1>&6 ! echo "configure:11850: checking for qfpclass declaration" >&5 if test x${glibcpp_cv_func_qfpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_qfpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11845,11851 ---- echo $ac_n "checking for qfpclass declaration""... $ac_c" 1>&6 ! echo "configure:11849: checking for qfpclass declaration" >&5 if test x${glibcpp_cv_func_qfpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_qfpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11861,11867 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11860,11866 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11872,11878 **** qfpclass(0); ; return 0; } EOF ! if { (eval echo configure:11876: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_qfpclass_use=yes else --- 11871,11877 ---- qfpclass(0); ; return 0; } EOF ! if { (eval echo configure:11875: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_qfpclass_use=yes else *************** fi *** 11899,11910 **** for ac_func in qfpclass do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:11903: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:11902: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 11926,11932 ---- ; return 0; } EOF ! if { (eval echo configure:11930: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 11954,11960 **** else echo $ac_n "checking for _qfpclass declaration""... $ac_c" 1>&6 ! echo "configure:11958: checking for _qfpclass declaration" >&5 if test x${glibcpp_cv_func__qfpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__qfpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 11953,11959 ---- else echo $ac_n "checking for _qfpclass declaration""... $ac_c" 1>&6 ! echo "configure:11957: checking for _qfpclass declaration" >&5 if test x${glibcpp_cv_func__qfpclass_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__qfpclass_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 11969,11975 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 11968,11974 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 11980,11986 **** _qfpclass(0); ; return 0; } EOF ! if { (eval echo configure:11984: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__qfpclass_use=yes else --- 11979,11985 ---- _qfpclass(0); ; return 0; } EOF ! if { (eval echo configure:11983: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__qfpclass_use=yes else *************** fi *** 12007,12018 **** for ac_func in _qfpclass do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12011: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12010: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12034,12040 ---- ; return 0; } EOF ! if { (eval echo configure:12038: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12065,12071 **** echo $ac_n "checking for hypot declaration""... $ac_c" 1>&6 ! echo "configure:12069: checking for hypot declaration" >&5 if test x${glibcpp_cv_func_hypot_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypot_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12064,12070 ---- echo $ac_n "checking for hypot declaration""... $ac_c" 1>&6 ! echo "configure:12068: checking for hypot declaration" >&5 if test x${glibcpp_cv_func_hypot_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypot_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12080,12093 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypot(0, 0); ; return 0; } EOF ! if { (eval echo configure:12091: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypot_use=yes else --- 12079,12092 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypot(0, 0); ; return 0; } EOF ! if { (eval echo configure:12090: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypot_use=yes else *************** fi *** 12114,12125 **** for ac_func in hypot do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12118: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12117: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12141,12147 ---- ; return 0; } EOF ! if { (eval echo configure:12145: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12169,12175 **** else echo $ac_n "checking for _hypot declaration""... $ac_c" 1>&6 ! echo "configure:12173: checking for _hypot declaration" >&5 if test x${glibcpp_cv_func__hypot_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypot_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12168,12174 ---- else echo $ac_n "checking for _hypot declaration""... $ac_c" 1>&6 ! echo "configure:12172: checking for _hypot declaration" >&5 if test x${glibcpp_cv_func__hypot_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypot_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12184,12197 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypot(0, 0); ; return 0; } EOF ! if { (eval echo configure:12195: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypot_use=yes else --- 12183,12196 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypot(0, 0); ; return 0; } EOF ! if { (eval echo configure:12194: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypot_use=yes else *************** fi *** 12218,12229 **** for ac_func in _hypot do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12222: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12221: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12245,12251 ---- ; return 0; } EOF ! if { (eval echo configure:12249: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12276,12282 **** echo $ac_n "checking for float trig functions""... $ac_c" 1>&6 ! echo "configure:12280: checking for float trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_float_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 12275,12281 ---- echo $ac_n "checking for float trig functions""... $ac_c" 1>&6 ! echo "configure:12279: checking for float trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_float_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12290,12296 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { --- 12289,12295 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { *************** int main() { *** 12299,12305 **** coshf sinhf tanhf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:12303: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_float_trig_use=yes else --- 12298,12304 ---- coshf sinhf tanhf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:12302: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_float_trig_use=yes else *************** fi *** 12325,12336 **** coshf sinhf tanhf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12329: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12328: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12352,12358 ---- ; return 0; } EOF ! if { (eval echo configure:12356: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12381,12387 **** echo $ac_n "checking for float round functions""... $ac_c" 1>&6 ! echo "configure:12385: checking for float round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_float_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 12380,12386 ---- echo $ac_n "checking for float round functions""... $ac_c" 1>&6 ! echo "configure:12384: checking for float round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_float_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12395,12408 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in ceilf floorf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:12406: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_float_round_use=yes else --- 12394,12407 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in ceilf floorf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:12405: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_float_round_use=yes else *************** fi *** 12426,12437 **** for ac_func in ceilf floorf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12430: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12429: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12453,12459 ---- ; return 0; } EOF ! if { (eval echo configure:12457: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12483,12489 **** echo $ac_n "checking for expf declaration""... $ac_c" 1>&6 ! echo "configure:12487: checking for expf declaration" >&5 if test x${glibcpp_cv_func_expf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_expf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12482,12488 ---- echo $ac_n "checking for expf declaration""... $ac_c" 1>&6 ! echo "configure:12486: checking for expf declaration" >&5 if test x${glibcpp_cv_func_expf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_expf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12498,12504 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 12497,12503 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 12509,12515 **** expf(0); ; return 0; } EOF ! if { (eval echo configure:12513: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_expf_use=yes else --- 12508,12514 ---- expf(0); ; return 0; } EOF ! if { (eval echo configure:12512: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_expf_use=yes else *************** fi *** 12536,12547 **** for ac_func in expf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12540: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12539: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12563,12569 ---- ; return 0; } EOF ! if { (eval echo configure:12567: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12591,12597 **** else echo $ac_n "checking for _expf declaration""... $ac_c" 1>&6 ! echo "configure:12595: checking for _expf declaration" >&5 if test x${glibcpp_cv_func__expf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__expf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12590,12596 ---- else echo $ac_n "checking for _expf declaration""... $ac_c" 1>&6 ! echo "configure:12594: checking for _expf declaration" >&5 if test x${glibcpp_cv_func__expf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__expf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12606,12612 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 12605,12611 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 12617,12623 **** _expf(0); ; return 0; } EOF ! if { (eval echo configure:12621: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__expf_use=yes else --- 12616,12622 ---- _expf(0); ; return 0; } EOF ! if { (eval echo configure:12620: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__expf_use=yes else *************** fi *** 12644,12655 **** for ac_func in _expf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12648: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12647: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12671,12677 ---- ; return 0; } EOF ! if { (eval echo configure:12675: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12702,12708 **** echo $ac_n "checking for isnanf declaration""... $ac_c" 1>&6 ! echo "configure:12706: checking for isnanf declaration" >&5 if test x${glibcpp_cv_func_isnanf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnanf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12701,12707 ---- echo $ac_n "checking for isnanf declaration""... $ac_c" 1>&6 ! echo "configure:12705: checking for isnanf declaration" >&5 if test x${glibcpp_cv_func_isnanf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnanf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12717,12723 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 12716,12722 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 12728,12734 **** isnanf(0); ; return 0; } EOF ! if { (eval echo configure:12732: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnanf_use=yes else --- 12727,12733 ---- isnanf(0); ; return 0; } EOF ! if { (eval echo configure:12731: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnanf_use=yes else *************** fi *** 12755,12766 **** for ac_func in isnanf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12759: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12758: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12782,12788 ---- ; return 0; } EOF ! if { (eval echo configure:12786: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12810,12816 **** else echo $ac_n "checking for _isnanf declaration""... $ac_c" 1>&6 ! echo "configure:12814: checking for _isnanf declaration" >&5 if test x${glibcpp_cv_func__isnanf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnanf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12809,12815 ---- else echo $ac_n "checking for _isnanf declaration""... $ac_c" 1>&6 ! echo "configure:12813: checking for _isnanf declaration" >&5 if test x${glibcpp_cv_func__isnanf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnanf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12825,12831 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 12824,12830 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 12836,12842 **** _isnanf(0); ; return 0; } EOF ! if { (eval echo configure:12840: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnanf_use=yes else --- 12835,12841 ---- _isnanf(0); ; return 0; } EOF ! if { (eval echo configure:12839: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnanf_use=yes else *************** fi *** 12863,12874 **** for ac_func in _isnanf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12867: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12866: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 12890,12896 ---- ; return 0; } EOF ! if { (eval echo configure:12894: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 12921,12927 **** echo $ac_n "checking for isinff declaration""... $ac_c" 1>&6 ! echo "configure:12925: checking for isinff declaration" >&5 if test x${glibcpp_cv_func_isinff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 12920,12926 ---- echo $ac_n "checking for isinff declaration""... $ac_c" 1>&6 ! echo "configure:12924: checking for isinff declaration" >&5 if test x${glibcpp_cv_func_isinff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 12936,12942 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 12935,12941 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 12947,12953 **** isinff(0); ; return 0; } EOF ! if { (eval echo configure:12951: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinff_use=yes else --- 12946,12952 ---- isinff(0); ; return 0; } EOF ! if { (eval echo configure:12950: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinff_use=yes else *************** fi *** 12974,12985 **** for ac_func in isinff do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:12978: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:12977: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13001,13007 ---- ; return 0; } EOF ! if { (eval echo configure:13005: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13029,13035 **** else echo $ac_n "checking for _isinff declaration""... $ac_c" 1>&6 ! echo "configure:13033: checking for _isinff declaration" >&5 if test x${glibcpp_cv_func__isinff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13028,13034 ---- else echo $ac_n "checking for _isinff declaration""... $ac_c" 1>&6 ! echo "configure:13032: checking for _isinff declaration" >&5 if test x${glibcpp_cv_func__isinff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13044,13050 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 13043,13049 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 13055,13061 **** _isinff(0); ; return 0; } EOF ! if { (eval echo configure:13059: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinff_use=yes else --- 13054,13060 ---- _isinff(0); ; return 0; } EOF ! if { (eval echo configure:13058: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinff_use=yes else *************** fi *** 13082,13093 **** for ac_func in _isinff do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13086: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13085: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13109,13115 ---- ; return 0; } EOF ! if { (eval echo configure:13113: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13140,13146 **** echo $ac_n "checking for atan2f declaration""... $ac_c" 1>&6 ! echo "configure:13144: checking for atan2f declaration" >&5 if test x${glibcpp_cv_func_atan2f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_atan2f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13139,13145 ---- echo $ac_n "checking for atan2f declaration""... $ac_c" 1>&6 ! echo "configure:13143: checking for atan2f declaration" >&5 if test x${glibcpp_cv_func_atan2f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_atan2f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13155,13168 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { atan2f(0, 0); ; return 0; } EOF ! if { (eval echo configure:13166: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_atan2f_use=yes else --- 13154,13167 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { atan2f(0, 0); ; return 0; } EOF ! if { (eval echo configure:13165: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_atan2f_use=yes else *************** fi *** 13189,13200 **** for ac_func in atan2f do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13193: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13192: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13216,13222 ---- ; return 0; } EOF ! if { (eval echo configure:13220: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13244,13250 **** else echo $ac_n "checking for _atan2f declaration""... $ac_c" 1>&6 ! echo "configure:13248: checking for _atan2f declaration" >&5 if test x${glibcpp_cv_func__atan2f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__atan2f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13243,13249 ---- else echo $ac_n "checking for _atan2f declaration""... $ac_c" 1>&6 ! echo "configure:13247: checking for _atan2f declaration" >&5 if test x${glibcpp_cv_func__atan2f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__atan2f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13259,13272 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _atan2f(0, 0); ; return 0; } EOF ! if { (eval echo configure:13270: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__atan2f_use=yes else --- 13258,13271 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _atan2f(0, 0); ; return 0; } EOF ! if { (eval echo configure:13269: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__atan2f_use=yes else *************** fi *** 13293,13304 **** for ac_func in _atan2f do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13297: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13296: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13320,13326 ---- ; return 0; } EOF ! if { (eval echo configure:13324: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13351,13357 **** echo $ac_n "checking for fabsf declaration""... $ac_c" 1>&6 ! echo "configure:13355: checking for fabsf declaration" >&5 if test x${glibcpp_cv_func_fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13350,13356 ---- echo $ac_n "checking for fabsf declaration""... $ac_c" 1>&6 ! echo "configure:13354: checking for fabsf declaration" >&5 if test x${glibcpp_cv_func_fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13366,13372 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 13365,13371 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 13377,13383 **** fabsf(0); ; return 0; } EOF ! if { (eval echo configure:13381: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fabsf_use=yes else --- 13376,13382 ---- fabsf(0); ; return 0; } EOF ! if { (eval echo configure:13380: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fabsf_use=yes else *************** fi *** 13404,13415 **** for ac_func in fabsf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13408: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13407: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13431,13437 ---- ; return 0; } EOF ! if { (eval echo configure:13435: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13459,13465 **** else echo $ac_n "checking for _fabsf declaration""... $ac_c" 1>&6 ! echo "configure:13463: checking for _fabsf declaration" >&5 if test x${glibcpp_cv_func__fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13458,13464 ---- else echo $ac_n "checking for _fabsf declaration""... $ac_c" 1>&6 ! echo "configure:13462: checking for _fabsf declaration" >&5 if test x${glibcpp_cv_func__fabsf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fabsf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13474,13480 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 13473,13479 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 13485,13491 **** _fabsf(0); ; return 0; } EOF ! if { (eval echo configure:13489: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fabsf_use=yes else --- 13484,13490 ---- _fabsf(0); ; return 0; } EOF ! if { (eval echo configure:13488: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fabsf_use=yes else *************** fi *** 13512,13523 **** for ac_func in _fabsf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13516: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13515: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13539,13545 ---- ; return 0; } EOF ! if { (eval echo configure:13543: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13570,13576 **** echo $ac_n "checking for fmodf declaration""... $ac_c" 1>&6 ! echo "configure:13574: checking for fmodf declaration" >&5 if test x${glibcpp_cv_func_fmodf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fmodf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13569,13575 ---- echo $ac_n "checking for fmodf declaration""... $ac_c" 1>&6 ! echo "configure:13573: checking for fmodf declaration" >&5 if test x${glibcpp_cv_func_fmodf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fmodf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13585,13598 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { fmodf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13596: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fmodf_use=yes else --- 13584,13597 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { fmodf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13595: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fmodf_use=yes else *************** fi *** 13619,13630 **** for ac_func in fmodf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13623: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13622: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13646,13652 ---- ; return 0; } EOF ! if { (eval echo configure:13650: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13674,13680 **** else echo $ac_n "checking for _fmodf declaration""... $ac_c" 1>&6 ! echo "configure:13678: checking for _fmodf declaration" >&5 if test x${glibcpp_cv_func__fmodf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fmodf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13673,13679 ---- else echo $ac_n "checking for _fmodf declaration""... $ac_c" 1>&6 ! echo "configure:13677: checking for _fmodf declaration" >&5 if test x${glibcpp_cv_func__fmodf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fmodf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13689,13702 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _fmodf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13700: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fmodf_use=yes else --- 13688,13701 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _fmodf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13699: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fmodf_use=yes else *************** fi *** 13723,13734 **** for ac_func in _fmodf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13727: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13726: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13750,13756 ---- ; return 0; } EOF ! if { (eval echo configure:13754: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13781,13787 **** echo $ac_n "checking for frexpf declaration""... $ac_c" 1>&6 ! echo "configure:13785: checking for frexpf declaration" >&5 if test x${glibcpp_cv_func_frexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_frexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13780,13786 ---- echo $ac_n "checking for frexpf declaration""... $ac_c" 1>&6 ! echo "configure:13784: checking for frexpf declaration" >&5 if test x${glibcpp_cv_func_frexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_frexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13796,13809 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { frexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13807: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_frexpf_use=yes else --- 13795,13808 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { frexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13806: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_frexpf_use=yes else *************** fi *** 13830,13841 **** for ac_func in frexpf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13834: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13833: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13857,13863 ---- ; return 0; } EOF ! if { (eval echo configure:13861: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13885,13891 **** else echo $ac_n "checking for _frexpf declaration""... $ac_c" 1>&6 ! echo "configure:13889: checking for _frexpf declaration" >&5 if test x${glibcpp_cv_func__frexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__frexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13884,13890 ---- else echo $ac_n "checking for _frexpf declaration""... $ac_c" 1>&6 ! echo "configure:13888: checking for _frexpf declaration" >&5 if test x${glibcpp_cv_func__frexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__frexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 13900,13913 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _frexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13911: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__frexpf_use=yes else --- 13899,13912 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _frexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:13910: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__frexpf_use=yes else *************** fi *** 13934,13945 **** for ac_func in _frexpf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:13938: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:13937: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 13961,13967 ---- ; return 0; } EOF ! if { (eval echo configure:13965: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 13992,13998 **** echo $ac_n "checking for hypotf declaration""... $ac_c" 1>&6 ! echo "configure:13996: checking for hypotf declaration" >&5 if test x${glibcpp_cv_func_hypotf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypotf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 13991,13997 ---- echo $ac_n "checking for hypotf declaration""... $ac_c" 1>&6 ! echo "configure:13995: checking for hypotf declaration" >&5 if test x${glibcpp_cv_func_hypotf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypotf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14007,14020 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypotf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14018: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypotf_use=yes else --- 14006,14019 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypotf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14017: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypotf_use=yes else *************** fi *** 14041,14052 **** for ac_func in hypotf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14045: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14044: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14068,14074 ---- ; return 0; } EOF ! if { (eval echo configure:14072: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14096,14102 **** else echo $ac_n "checking for _hypotf declaration""... $ac_c" 1>&6 ! echo "configure:14100: checking for _hypotf declaration" >&5 if test x${glibcpp_cv_func__hypotf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypotf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14095,14101 ---- else echo $ac_n "checking for _hypotf declaration""... $ac_c" 1>&6 ! echo "configure:14099: checking for _hypotf declaration" >&5 if test x${glibcpp_cv_func__hypotf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypotf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14111,14124 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypotf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14122: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypotf_use=yes else --- 14110,14123 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypotf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14121: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypotf_use=yes else *************** fi *** 14145,14156 **** for ac_func in _hypotf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14149: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14148: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14172,14178 ---- ; return 0; } EOF ! if { (eval echo configure:14176: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14203,14209 **** echo $ac_n "checking for ldexpf declaration""... $ac_c" 1>&6 ! echo "configure:14207: checking for ldexpf declaration" >&5 if test x${glibcpp_cv_func_ldexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_ldexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14202,14208 ---- echo $ac_n "checking for ldexpf declaration""... $ac_c" 1>&6 ! echo "configure:14206: checking for ldexpf declaration" >&5 if test x${glibcpp_cv_func_ldexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_ldexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14218,14231 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { ldexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14229: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_ldexpf_use=yes else --- 14217,14230 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { ldexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14228: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_ldexpf_use=yes else *************** fi *** 14252,14263 **** for ac_func in ldexpf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14256: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14255: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14279,14285 ---- ; return 0; } EOF ! if { (eval echo configure:14283: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14307,14313 **** else echo $ac_n "checking for _ldexpf declaration""... $ac_c" 1>&6 ! echo "configure:14311: checking for _ldexpf declaration" >&5 if test x${glibcpp_cv_func__ldexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__ldexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14306,14312 ---- else echo $ac_n "checking for _ldexpf declaration""... $ac_c" 1>&6 ! echo "configure:14310: checking for _ldexpf declaration" >&5 if test x${glibcpp_cv_func__ldexpf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__ldexpf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14322,14335 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _ldexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14333: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__ldexpf_use=yes else --- 14321,14334 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _ldexpf(0, 0); ; return 0; } EOF ! if { (eval echo configure:14332: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__ldexpf_use=yes else *************** fi *** 14356,14367 **** for ac_func in _ldexpf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14360: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14359: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14383,14389 ---- ; return 0; } EOF ! if { (eval echo configure:14387: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14414,14420 **** echo $ac_n "checking for logf declaration""... $ac_c" 1>&6 ! echo "configure:14418: checking for logf declaration" >&5 if test x${glibcpp_cv_func_logf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_logf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14413,14419 ---- echo $ac_n "checking for logf declaration""... $ac_c" 1>&6 ! echo "configure:14417: checking for logf declaration" >&5 if test x${glibcpp_cv_func_logf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_logf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14429,14435 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 14428,14434 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 14440,14446 **** logf(0); ; return 0; } EOF ! if { (eval echo configure:14444: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_logf_use=yes else --- 14439,14445 ---- logf(0); ; return 0; } EOF ! if { (eval echo configure:14443: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_logf_use=yes else *************** fi *** 14467,14478 **** for ac_func in logf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14471: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14470: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14494,14500 ---- ; return 0; } EOF ! if { (eval echo configure:14498: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14522,14528 **** else echo $ac_n "checking for _logf declaration""... $ac_c" 1>&6 ! echo "configure:14526: checking for _logf declaration" >&5 if test x${glibcpp_cv_func__logf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__logf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14521,14527 ---- else echo $ac_n "checking for _logf declaration""... $ac_c" 1>&6 ! echo "configure:14525: checking for _logf declaration" >&5 if test x${glibcpp_cv_func__logf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__logf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14537,14543 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 14536,14542 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 14548,14554 **** _logf(0); ; return 0; } EOF ! if { (eval echo configure:14552: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__logf_use=yes else --- 14547,14553 ---- _logf(0); ; return 0; } EOF ! if { (eval echo configure:14551: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__logf_use=yes else *************** fi *** 14575,14586 **** for ac_func in _logf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14579: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14578: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14602,14608 ---- ; return 0; } EOF ! if { (eval echo configure:14606: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14633,14639 **** echo $ac_n "checking for log10f declaration""... $ac_c" 1>&6 ! echo "configure:14637: checking for log10f declaration" >&5 if test x${glibcpp_cv_func_log10f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_log10f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14632,14638 ---- echo $ac_n "checking for log10f declaration""... $ac_c" 1>&6 ! echo "configure:14636: checking for log10f declaration" >&5 if test x${glibcpp_cv_func_log10f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_log10f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14648,14654 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 14647,14653 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 14659,14665 **** log10f(0); ; return 0; } EOF ! if { (eval echo configure:14663: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_log10f_use=yes else --- 14658,14664 ---- log10f(0); ; return 0; } EOF ! if { (eval echo configure:14662: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_log10f_use=yes else *************** fi *** 14686,14697 **** for ac_func in log10f do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14690: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14689: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14713,14719 ---- ; return 0; } EOF ! if { (eval echo configure:14717: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14741,14747 **** else echo $ac_n "checking for _log10f declaration""... $ac_c" 1>&6 ! echo "configure:14745: checking for _log10f declaration" >&5 if test x${glibcpp_cv_func__log10f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__log10f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14740,14746 ---- else echo $ac_n "checking for _log10f declaration""... $ac_c" 1>&6 ! echo "configure:14744: checking for _log10f declaration" >&5 if test x${glibcpp_cv_func__log10f_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__log10f_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14756,14762 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 14755,14761 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 14767,14773 **** _log10f(0); ; return 0; } EOF ! if { (eval echo configure:14771: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__log10f_use=yes else --- 14766,14772 ---- _log10f(0); ; return 0; } EOF ! if { (eval echo configure:14770: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__log10f_use=yes else *************** fi *** 14794,14805 **** for ac_func in _log10f do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14798: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14797: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14821,14827 ---- ; return 0; } EOF ! if { (eval echo configure:14825: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14852,14858 **** echo $ac_n "checking for modff declaration""... $ac_c" 1>&6 ! echo "configure:14856: checking for modff declaration" >&5 if test x${glibcpp_cv_func_modff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_modff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14851,14857 ---- echo $ac_n "checking for modff declaration""... $ac_c" 1>&6 ! echo "configure:14855: checking for modff declaration" >&5 if test x${glibcpp_cv_func_modff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_modff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14867,14880 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { modff(0, 0); ; return 0; } EOF ! if { (eval echo configure:14878: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_modff_use=yes else --- 14866,14879 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { modff(0, 0); ; return 0; } EOF ! if { (eval echo configure:14877: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_modff_use=yes else *************** fi *** 14901,14912 **** for ac_func in modff do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:14905: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:14904: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 14928,14934 ---- ; return 0; } EOF ! if { (eval echo configure:14932: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 14956,14962 **** else echo $ac_n "checking for _modff declaration""... $ac_c" 1>&6 ! echo "configure:14960: checking for _modff declaration" >&5 if test x${glibcpp_cv_func__modff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__modff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 14955,14961 ---- else echo $ac_n "checking for _modff declaration""... $ac_c" 1>&6 ! echo "configure:14959: checking for _modff declaration" >&5 if test x${glibcpp_cv_func__modff_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__modff_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 14971,14984 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _modff(0, 0); ; return 0; } EOF ! if { (eval echo configure:14982: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__modff_use=yes else --- 14970,14983 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _modff(0, 0); ; return 0; } EOF ! if { (eval echo configure:14981: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__modff_use=yes else *************** fi *** 15005,15016 **** for ac_func in _modff do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15009: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15008: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15032,15038 ---- ; return 0; } EOF ! if { (eval echo configure:15036: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15063,15069 **** echo $ac_n "checking for powf declaration""... $ac_c" 1>&6 ! echo "configure:15067: checking for powf declaration" >&5 if test x${glibcpp_cv_func_powf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_powf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15062,15068 ---- echo $ac_n "checking for powf declaration""... $ac_c" 1>&6 ! echo "configure:15066: checking for powf declaration" >&5 if test x${glibcpp_cv_func_powf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_powf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15078,15091 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { powf(0, 0); ; return 0; } EOF ! if { (eval echo configure:15089: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_powf_use=yes else --- 15077,15090 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { powf(0, 0); ; return 0; } EOF ! if { (eval echo configure:15088: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_powf_use=yes else *************** fi *** 15112,15123 **** for ac_func in powf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15116: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15115: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15139,15145 ---- ; return 0; } EOF ! if { (eval echo configure:15143: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15167,15173 **** else echo $ac_n "checking for _powf declaration""... $ac_c" 1>&6 ! echo "configure:15171: checking for _powf declaration" >&5 if test x${glibcpp_cv_func__powf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__powf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15166,15172 ---- else echo $ac_n "checking for _powf declaration""... $ac_c" 1>&6 ! echo "configure:15170: checking for _powf declaration" >&5 if test x${glibcpp_cv_func__powf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__powf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15182,15195 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _powf(0, 0); ; return 0; } EOF ! if { (eval echo configure:15193: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__powf_use=yes else --- 15181,15194 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _powf(0, 0); ; return 0; } EOF ! if { (eval echo configure:15192: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__powf_use=yes else *************** fi *** 15216,15227 **** for ac_func in _powf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15220: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15219: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15243,15249 ---- ; return 0; } EOF ! if { (eval echo configure:15247: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15274,15280 **** echo $ac_n "checking for sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:15278: checking for sqrtf declaration" >&5 if test x${glibcpp_cv_func_sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15273,15279 ---- echo $ac_n "checking for sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:15277: checking for sqrtf declaration" >&5 if test x${glibcpp_cv_func_sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15289,15295 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 15288,15294 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 15300,15306 **** sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:15304: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sqrtf_use=yes else --- 15299,15305 ---- sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:15303: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sqrtf_use=yes else *************** fi *** 15327,15338 **** for ac_func in sqrtf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15331: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15330: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15354,15360 ---- ; return 0; } EOF ! if { (eval echo configure:15358: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15382,15388 **** else echo $ac_n "checking for _sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:15386: checking for _sqrtf declaration" >&5 if test x${glibcpp_cv_func__sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15381,15387 ---- else echo $ac_n "checking for _sqrtf declaration""... $ac_c" 1>&6 ! echo "configure:15385: checking for _sqrtf declaration" >&5 if test x${glibcpp_cv_func__sqrtf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sqrtf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15397,15403 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 15396,15402 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 15408,15414 **** _sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:15412: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sqrtf_use=yes else --- 15407,15413 ---- _sqrtf(0); ; return 0; } EOF ! if { (eval echo configure:15411: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sqrtf_use=yes else *************** fi *** 15435,15446 **** for ac_func in _sqrtf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15439: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15438: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15462,15468 ---- ; return 0; } EOF ! if { (eval echo configure:15466: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15493,15499 **** echo $ac_n "checking for sincosf declaration""... $ac_c" 1>&6 ! echo "configure:15497: checking for sincosf declaration" >&5 if test x${glibcpp_cv_func_sincosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15492,15498 ---- echo $ac_n "checking for sincosf declaration""... $ac_c" 1>&6 ! echo "configure:15496: checking for sincosf declaration" >&5 if test x${glibcpp_cv_func_sincosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15508,15521 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincosf(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:15519: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincosf_use=yes else --- 15507,15520 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincosf(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:15518: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincosf_use=yes else *************** fi *** 15542,15553 **** for ac_func in sincosf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15546: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15545: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15569,15575 ---- ; return 0; } EOF ! if { (eval echo configure:15573: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15597,15603 **** else echo $ac_n "checking for _sincosf declaration""... $ac_c" 1>&6 ! echo "configure:15601: checking for _sincosf declaration" >&5 if test x${glibcpp_cv_func__sincosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15596,15602 ---- else echo $ac_n "checking for _sincosf declaration""... $ac_c" 1>&6 ! echo "configure:15600: checking for _sincosf declaration" >&5 if test x${glibcpp_cv_func__sincosf_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincosf_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15612,15625 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincosf(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:15623: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincosf_use=yes else --- 15611,15624 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincosf(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:15622: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincosf_use=yes else *************** fi *** 15646,15657 **** for ac_func in _sincosf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15650: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15649: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15673,15679 ---- ; return 0; } EOF ! if { (eval echo configure:15677: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15704,15710 **** echo $ac_n "checking for finitef declaration""... $ac_c" 1>&6 ! echo "configure:15708: checking for finitef declaration" >&5 if test x${glibcpp_cv_func_finitef_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finitef_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15703,15709 ---- echo $ac_n "checking for finitef declaration""... $ac_c" 1>&6 ! echo "configure:15707: checking for finitef declaration" >&5 if test x${glibcpp_cv_func_finitef_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finitef_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15719,15725 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 15718,15724 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 15730,15736 **** finitef(0); ; return 0; } EOF ! if { (eval echo configure:15734: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finitef_use=yes else --- 15729,15735 ---- finitef(0); ; return 0; } EOF ! if { (eval echo configure:15733: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finitef_use=yes else *************** fi *** 15757,15768 **** for ac_func in finitef do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15761: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15760: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15784,15790 ---- ; return 0; } EOF ! if { (eval echo configure:15788: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15812,15818 **** else echo $ac_n "checking for _finitef declaration""... $ac_c" 1>&6 ! echo "configure:15816: checking for _finitef declaration" >&5 if test x${glibcpp_cv_func__finitef_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finitef_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 15811,15817 ---- else echo $ac_n "checking for _finitef declaration""... $ac_c" 1>&6 ! echo "configure:15815: checking for _finitef declaration" >&5 if test x${glibcpp_cv_func__finitef_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finitef_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15827,15833 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 15826,15832 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 15838,15844 **** _finitef(0); ; return 0; } EOF ! if { (eval echo configure:15842: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finitef_use=yes else --- 15837,15843 ---- _finitef(0); ; return 0; } EOF ! if { (eval echo configure:15841: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finitef_use=yes else *************** fi *** 15865,15876 **** for ac_func in _finitef do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15869: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15868: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15892,15898 ---- ; return 0; } EOF ! if { (eval echo configure:15896: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 15923,15929 **** echo $ac_n "checking for long double trig functions""... $ac_c" 1>&6 ! echo "configure:15927: checking for long double trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_long_double_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 15922,15928 ---- echo $ac_n "checking for long double trig functions""... $ac_c" 1>&6 ! echo "configure:15926: checking for long double trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_long_double_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 15937,15943 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { --- 15936,15942 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { *************** int main() { *** 15946,15952 **** coshl sinhl tanhl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:15950: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_long_double_trig_use=yes else --- 15945,15951 ---- coshl sinhl tanhl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:15949: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_long_double_trig_use=yes else *************** fi *** 15972,15983 **** coshl sinhl tanhl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:15976: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:15975: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 15999,16005 ---- ; return 0; } EOF ! if { (eval echo configure:16003: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16028,16034 **** echo $ac_n "checking for long double round functions""... $ac_c" 1>&6 ! echo "configure:16032: checking for long double round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_long_double_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 16027,16033 ---- echo $ac_n "checking for long double round functions""... $ac_c" 1>&6 ! echo "configure:16031: checking for long double round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func_long_double_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16042,16055 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in ceill floorl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:16053: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_long_double_round_use=yes else --- 16041,16054 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in ceill floorl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:16052: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_long_double_round_use=yes else *************** fi *** 16073,16084 **** for ac_func in ceill floorl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16077: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16076: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16100,16106 ---- ; return 0; } EOF ! if { (eval echo configure:16104: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16130,16136 **** echo $ac_n "checking for isnanl declaration""... $ac_c" 1>&6 ! echo "configure:16134: checking for isnanl declaration" >&5 if test x${glibcpp_cv_func_isnanl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnanl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16129,16135 ---- echo $ac_n "checking for isnanl declaration""... $ac_c" 1>&6 ! echo "configure:16133: checking for isnanl declaration" >&5 if test x${glibcpp_cv_func_isnanl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isnanl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16145,16151 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 16144,16150 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 16156,16162 **** isnanl(0); ; return 0; } EOF ! if { (eval echo configure:16160: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnanl_use=yes else --- 16155,16161 ---- isnanl(0); ; return 0; } EOF ! if { (eval echo configure:16159: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isnanl_use=yes else *************** fi *** 16183,16194 **** for ac_func in isnanl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16187: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16186: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16210,16216 ---- ; return 0; } EOF ! if { (eval echo configure:16214: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16238,16244 **** else echo $ac_n "checking for _isnanl declaration""... $ac_c" 1>&6 ! echo "configure:16242: checking for _isnanl declaration" >&5 if test x${glibcpp_cv_func__isnanl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnanl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16237,16243 ---- else echo $ac_n "checking for _isnanl declaration""... $ac_c" 1>&6 ! echo "configure:16241: checking for _isnanl declaration" >&5 if test x${glibcpp_cv_func__isnanl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isnanl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16253,16259 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 16252,16258 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 16264,16270 **** _isnanl(0); ; return 0; } EOF ! if { (eval echo configure:16268: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnanl_use=yes else --- 16263,16269 ---- _isnanl(0); ; return 0; } EOF ! if { (eval echo configure:16267: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isnanl_use=yes else *************** fi *** 16291,16302 **** for ac_func in _isnanl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16295: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16294: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16318,16324 ---- ; return 0; } EOF ! if { (eval echo configure:16322: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16349,16355 **** echo $ac_n "checking for isinfl declaration""... $ac_c" 1>&6 ! echo "configure:16353: checking for isinfl declaration" >&5 if test x${glibcpp_cv_func_isinfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16348,16354 ---- echo $ac_n "checking for isinfl declaration""... $ac_c" 1>&6 ! echo "configure:16352: checking for isinfl declaration" >&5 if test x${glibcpp_cv_func_isinfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isinfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16364,16370 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 16363,16369 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 16375,16381 **** isinfl(0); ; return 0; } EOF ! if { (eval echo configure:16379: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinfl_use=yes else --- 16374,16380 ---- isinfl(0); ; return 0; } EOF ! if { (eval echo configure:16378: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isinfl_use=yes else *************** fi *** 16402,16413 **** for ac_func in isinfl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16406: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16405: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16429,16435 ---- ; return 0; } EOF ! if { (eval echo configure:16433: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16457,16463 **** else echo $ac_n "checking for _isinfl declaration""... $ac_c" 1>&6 ! echo "configure:16461: checking for _isinfl declaration" >&5 if test x${glibcpp_cv_func__isinfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16456,16462 ---- else echo $ac_n "checking for _isinfl declaration""... $ac_c" 1>&6 ! echo "configure:16460: checking for _isinfl declaration" >&5 if test x${glibcpp_cv_func__isinfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__isinfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16472,16478 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 16471,16477 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 16483,16489 **** _isinfl(0); ; return 0; } EOF ! if { (eval echo configure:16487: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinfl_use=yes else --- 16482,16488 ---- _isinfl(0); ; return 0; } EOF ! if { (eval echo configure:16486: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__isinfl_use=yes else *************** fi *** 16510,16521 **** for ac_func in _isinfl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16514: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16513: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16537,16543 ---- ; return 0; } EOF ! if { (eval echo configure:16541: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16568,16574 **** echo $ac_n "checking for copysignl declaration""... $ac_c" 1>&6 ! echo "configure:16572: checking for copysignl declaration" >&5 if test x${glibcpp_cv_func_copysignl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_copysignl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16567,16573 ---- echo $ac_n "checking for copysignl declaration""... $ac_c" 1>&6 ! echo "configure:16571: checking for copysignl declaration" >&5 if test x${glibcpp_cv_func_copysignl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_copysignl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16583,16596 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { copysignl(0, 0); ; return 0; } EOF ! if { (eval echo configure:16594: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_copysignl_use=yes else --- 16582,16595 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { copysignl(0, 0); ; return 0; } EOF ! if { (eval echo configure:16593: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_copysignl_use=yes else *************** fi *** 16617,16628 **** for ac_func in copysignl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16621: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16620: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16644,16650 ---- ; return 0; } EOF ! if { (eval echo configure:16648: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16672,16678 **** else echo $ac_n "checking for _copysignl declaration""... $ac_c" 1>&6 ! echo "configure:16676: checking for _copysignl declaration" >&5 if test x${glibcpp_cv_func__copysignl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__copysignl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16671,16677 ---- else echo $ac_n "checking for _copysignl declaration""... $ac_c" 1>&6 ! echo "configure:16675: checking for _copysignl declaration" >&5 if test x${glibcpp_cv_func__copysignl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__copysignl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16687,16700 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _copysignl(0, 0); ; return 0; } EOF ! if { (eval echo configure:16698: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__copysignl_use=yes else --- 16686,16699 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _copysignl(0, 0); ; return 0; } EOF ! if { (eval echo configure:16697: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__copysignl_use=yes else *************** fi *** 16721,16732 **** for ac_func in _copysignl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16725: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16724: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16748,16754 ---- ; return 0; } EOF ! if { (eval echo configure:16752: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16779,16785 **** echo $ac_n "checking for atan2l declaration""... $ac_c" 1>&6 ! echo "configure:16783: checking for atan2l declaration" >&5 if test x${glibcpp_cv_func_atan2l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_atan2l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16778,16784 ---- echo $ac_n "checking for atan2l declaration""... $ac_c" 1>&6 ! echo "configure:16782: checking for atan2l declaration" >&5 if test x${glibcpp_cv_func_atan2l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_atan2l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16794,16807 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { atan2l(0, 0); ; return 0; } EOF ! if { (eval echo configure:16805: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_atan2l_use=yes else --- 16793,16806 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { atan2l(0, 0); ; return 0; } EOF ! if { (eval echo configure:16804: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_atan2l_use=yes else *************** fi *** 16828,16839 **** for ac_func in atan2l do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16832: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16831: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16855,16861 ---- ; return 0; } EOF ! if { (eval echo configure:16859: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16883,16889 **** else echo $ac_n "checking for _atan2l declaration""... $ac_c" 1>&6 ! echo "configure:16887: checking for _atan2l declaration" >&5 if test x${glibcpp_cv_func__atan2l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__atan2l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16882,16888 ---- else echo $ac_n "checking for _atan2l declaration""... $ac_c" 1>&6 ! echo "configure:16886: checking for _atan2l declaration" >&5 if test x${glibcpp_cv_func__atan2l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__atan2l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 16898,16911 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _atan2l(0, 0); ; return 0; } EOF ! if { (eval echo configure:16909: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__atan2l_use=yes else --- 16897,16910 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _atan2l(0, 0); ; return 0; } EOF ! if { (eval echo configure:16908: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__atan2l_use=yes else *************** fi *** 16932,16943 **** for ac_func in _atan2l do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:16936: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:16935: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 16959,16965 ---- ; return 0; } EOF ! if { (eval echo configure:16963: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 16990,16996 **** echo $ac_n "checking for expl declaration""... $ac_c" 1>&6 ! echo "configure:16994: checking for expl declaration" >&5 if test x${glibcpp_cv_func_expl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_expl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 16989,16995 ---- echo $ac_n "checking for expl declaration""... $ac_c" 1>&6 ! echo "configure:16993: checking for expl declaration" >&5 if test x${glibcpp_cv_func_expl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_expl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17005,17011 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 17004,17010 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 17016,17022 **** expl(0); ; return 0; } EOF ! if { (eval echo configure:17020: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_expl_use=yes else --- 17015,17021 ---- expl(0); ; return 0; } EOF ! if { (eval echo configure:17019: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_expl_use=yes else *************** fi *** 17043,17054 **** for ac_func in expl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17047: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17046: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17070,17076 ---- ; return 0; } EOF ! if { (eval echo configure:17074: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17098,17104 **** else echo $ac_n "checking for _expl declaration""... $ac_c" 1>&6 ! echo "configure:17102: checking for _expl declaration" >&5 if test x${glibcpp_cv_func__expl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__expl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17097,17103 ---- else echo $ac_n "checking for _expl declaration""... $ac_c" 1>&6 ! echo "configure:17101: checking for _expl declaration" >&5 if test x${glibcpp_cv_func__expl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__expl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17113,17119 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 17112,17118 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 17124,17130 **** _expl(0); ; return 0; } EOF ! if { (eval echo configure:17128: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__expl_use=yes else --- 17123,17129 ---- _expl(0); ; return 0; } EOF ! if { (eval echo configure:17127: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__expl_use=yes else *************** fi *** 17151,17162 **** for ac_func in _expl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17155: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17154: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17178,17184 ---- ; return 0; } EOF ! if { (eval echo configure:17182: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17209,17215 **** echo $ac_n "checking for fabsl declaration""... $ac_c" 1>&6 ! echo "configure:17213: checking for fabsl declaration" >&5 if test x${glibcpp_cv_func_fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17208,17214 ---- echo $ac_n "checking for fabsl declaration""... $ac_c" 1>&6 ! echo "configure:17212: checking for fabsl declaration" >&5 if test x${glibcpp_cv_func_fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17224,17230 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 17223,17229 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 17235,17241 **** fabsl(0); ; return 0; } EOF ! if { (eval echo configure:17239: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fabsl_use=yes else --- 17234,17240 ---- fabsl(0); ; return 0; } EOF ! if { (eval echo configure:17238: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fabsl_use=yes else *************** fi *** 17262,17273 **** for ac_func in fabsl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17266: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17265: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17289,17295 ---- ; return 0; } EOF ! if { (eval echo configure:17293: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17317,17323 **** else echo $ac_n "checking for _fabsl declaration""... $ac_c" 1>&6 ! echo "configure:17321: checking for _fabsl declaration" >&5 if test x${glibcpp_cv_func__fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17316,17322 ---- else echo $ac_n "checking for _fabsl declaration""... $ac_c" 1>&6 ! echo "configure:17320: checking for _fabsl declaration" >&5 if test x${glibcpp_cv_func__fabsl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fabsl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17332,17338 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 17331,17337 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 17343,17349 **** _fabsl(0); ; return 0; } EOF ! if { (eval echo configure:17347: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fabsl_use=yes else --- 17342,17348 ---- _fabsl(0); ; return 0; } EOF ! if { (eval echo configure:17346: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fabsl_use=yes else *************** fi *** 17370,17381 **** for ac_func in _fabsl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17374: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17373: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17397,17403 ---- ; return 0; } EOF ! if { (eval echo configure:17401: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17428,17434 **** echo $ac_n "checking for fmodl declaration""... $ac_c" 1>&6 ! echo "configure:17432: checking for fmodl declaration" >&5 if test x${glibcpp_cv_func_fmodl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fmodl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17427,17433 ---- echo $ac_n "checking for fmodl declaration""... $ac_c" 1>&6 ! echo "configure:17431: checking for fmodl declaration" >&5 if test x${glibcpp_cv_func_fmodl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_fmodl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17443,17456 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { fmodl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17454: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fmodl_use=yes else --- 17442,17455 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { fmodl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17453: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_fmodl_use=yes else *************** fi *** 17477,17488 **** for ac_func in fmodl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17481: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17480: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17504,17510 ---- ; return 0; } EOF ! if { (eval echo configure:17508: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17532,17538 **** else echo $ac_n "checking for _fmodl declaration""... $ac_c" 1>&6 ! echo "configure:17536: checking for _fmodl declaration" >&5 if test x${glibcpp_cv_func__fmodl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fmodl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17531,17537 ---- else echo $ac_n "checking for _fmodl declaration""... $ac_c" 1>&6 ! echo "configure:17535: checking for _fmodl declaration" >&5 if test x${glibcpp_cv_func__fmodl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__fmodl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17547,17560 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _fmodl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17558: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fmodl_use=yes else --- 17546,17559 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _fmodl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17557: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__fmodl_use=yes else *************** fi *** 17581,17592 **** for ac_func in _fmodl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17585: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17584: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17608,17614 ---- ; return 0; } EOF ! if { (eval echo configure:17612: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17639,17645 **** echo $ac_n "checking for frexpl declaration""... $ac_c" 1>&6 ! echo "configure:17643: checking for frexpl declaration" >&5 if test x${glibcpp_cv_func_frexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_frexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17638,17644 ---- echo $ac_n "checking for frexpl declaration""... $ac_c" 1>&6 ! echo "configure:17642: checking for frexpl declaration" >&5 if test x${glibcpp_cv_func_frexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_frexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17654,17667 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { frexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17665: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_frexpl_use=yes else --- 17653,17666 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { frexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17664: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_frexpl_use=yes else *************** fi *** 17688,17699 **** for ac_func in frexpl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17692: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17691: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17715,17721 ---- ; return 0; } EOF ! if { (eval echo configure:17719: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17743,17749 **** else echo $ac_n "checking for _frexpl declaration""... $ac_c" 1>&6 ! echo "configure:17747: checking for _frexpl declaration" >&5 if test x${glibcpp_cv_func__frexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__frexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17742,17748 ---- else echo $ac_n "checking for _frexpl declaration""... $ac_c" 1>&6 ! echo "configure:17746: checking for _frexpl declaration" >&5 if test x${glibcpp_cv_func__frexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__frexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17758,17771 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _frexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17769: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__frexpl_use=yes else --- 17757,17770 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _frexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17768: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__frexpl_use=yes else *************** fi *** 17792,17803 **** for ac_func in _frexpl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17796: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17795: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17819,17825 ---- ; return 0; } EOF ! if { (eval echo configure:17823: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17850,17856 **** echo $ac_n "checking for hypotl declaration""... $ac_c" 1>&6 ! echo "configure:17854: checking for hypotl declaration" >&5 if test x${glibcpp_cv_func_hypotl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypotl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17849,17855 ---- echo $ac_n "checking for hypotl declaration""... $ac_c" 1>&6 ! echo "configure:17853: checking for hypotl declaration" >&5 if test x${glibcpp_cv_func_hypotl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_hypotl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17865,17878 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypotl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17876: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypotl_use=yes else --- 17864,17877 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { hypotl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17875: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_hypotl_use=yes else *************** fi *** 17899,17910 **** for ac_func in hypotl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:17903: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:17902: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 17926,17932 ---- ; return 0; } EOF ! if { (eval echo configure:17930: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 17954,17960 **** else echo $ac_n "checking for _hypotl declaration""... $ac_c" 1>&6 ! echo "configure:17958: checking for _hypotl declaration" >&5 if test x${glibcpp_cv_func__hypotl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypotl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 17953,17959 ---- else echo $ac_n "checking for _hypotl declaration""... $ac_c" 1>&6 ! echo "configure:17957: checking for _hypotl declaration" >&5 if test x${glibcpp_cv_func__hypotl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__hypotl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 17969,17982 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypotl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17980: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypotl_use=yes else --- 17968,17981 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _hypotl(0, 0); ; return 0; } EOF ! if { (eval echo configure:17979: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__hypotl_use=yes else *************** fi *** 18003,18014 **** for ac_func in _hypotl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18007: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18006: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18030,18036 ---- ; return 0; } EOF ! if { (eval echo configure:18034: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18061,18067 **** echo $ac_n "checking for ldexpl declaration""... $ac_c" 1>&6 ! echo "configure:18065: checking for ldexpl declaration" >&5 if test x${glibcpp_cv_func_ldexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_ldexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18060,18066 ---- echo $ac_n "checking for ldexpl declaration""... $ac_c" 1>&6 ! echo "configure:18064: checking for ldexpl declaration" >&5 if test x${glibcpp_cv_func_ldexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_ldexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18076,18089 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { ldexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18087: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_ldexpl_use=yes else --- 18075,18088 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { ldexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18086: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_ldexpl_use=yes else *************** fi *** 18110,18121 **** for ac_func in ldexpl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18114: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18113: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18137,18143 ---- ; return 0; } EOF ! if { (eval echo configure:18141: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18165,18171 **** else echo $ac_n "checking for _ldexpl declaration""... $ac_c" 1>&6 ! echo "configure:18169: checking for _ldexpl declaration" >&5 if test x${glibcpp_cv_func__ldexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__ldexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18164,18170 ---- else echo $ac_n "checking for _ldexpl declaration""... $ac_c" 1>&6 ! echo "configure:18168: checking for _ldexpl declaration" >&5 if test x${glibcpp_cv_func__ldexpl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__ldexpl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18180,18193 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _ldexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18191: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__ldexpl_use=yes else --- 18179,18192 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _ldexpl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18190: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__ldexpl_use=yes else *************** fi *** 18214,18225 **** for ac_func in _ldexpl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18218: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18217: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18241,18247 ---- ; return 0; } EOF ! if { (eval echo configure:18245: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18272,18278 **** echo $ac_n "checking for logl declaration""... $ac_c" 1>&6 ! echo "configure:18276: checking for logl declaration" >&5 if test x${glibcpp_cv_func_logl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_logl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18271,18277 ---- echo $ac_n "checking for logl declaration""... $ac_c" 1>&6 ! echo "configure:18275: checking for logl declaration" >&5 if test x${glibcpp_cv_func_logl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_logl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18287,18293 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 18286,18292 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 18298,18304 **** logl(0); ; return 0; } EOF ! if { (eval echo configure:18302: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_logl_use=yes else --- 18297,18303 ---- logl(0); ; return 0; } EOF ! if { (eval echo configure:18301: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_logl_use=yes else *************** fi *** 18325,18336 **** for ac_func in logl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18329: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18328: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18352,18358 ---- ; return 0; } EOF ! if { (eval echo configure:18356: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18380,18386 **** else echo $ac_n "checking for _logl declaration""... $ac_c" 1>&6 ! echo "configure:18384: checking for _logl declaration" >&5 if test x${glibcpp_cv_func__logl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__logl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18379,18385 ---- else echo $ac_n "checking for _logl declaration""... $ac_c" 1>&6 ! echo "configure:18383: checking for _logl declaration" >&5 if test x${glibcpp_cv_func__logl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__logl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18395,18401 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 18394,18400 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 18406,18412 **** _logl(0); ; return 0; } EOF ! if { (eval echo configure:18410: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__logl_use=yes else --- 18405,18411 ---- _logl(0); ; return 0; } EOF ! if { (eval echo configure:18409: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__logl_use=yes else *************** fi *** 18433,18444 **** for ac_func in _logl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18437: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18436: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18460,18466 ---- ; return 0; } EOF ! if { (eval echo configure:18464: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18491,18497 **** echo $ac_n "checking for log10l declaration""... $ac_c" 1>&6 ! echo "configure:18495: checking for log10l declaration" >&5 if test x${glibcpp_cv_func_log10l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_log10l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18490,18496 ---- echo $ac_n "checking for log10l declaration""... $ac_c" 1>&6 ! echo "configure:18494: checking for log10l declaration" >&5 if test x${glibcpp_cv_func_log10l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_log10l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18506,18512 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 18505,18511 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 18517,18523 **** log10l(0); ; return 0; } EOF ! if { (eval echo configure:18521: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_log10l_use=yes else --- 18516,18522 ---- log10l(0); ; return 0; } EOF ! if { (eval echo configure:18520: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_log10l_use=yes else *************** fi *** 18544,18555 **** for ac_func in log10l do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18548: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18547: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18571,18577 ---- ; return 0; } EOF ! if { (eval echo configure:18575: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18599,18605 **** else echo $ac_n "checking for _log10l declaration""... $ac_c" 1>&6 ! echo "configure:18603: checking for _log10l declaration" >&5 if test x${glibcpp_cv_func__log10l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__log10l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18598,18604 ---- else echo $ac_n "checking for _log10l declaration""... $ac_c" 1>&6 ! echo "configure:18602: checking for _log10l declaration" >&5 if test x${glibcpp_cv_func__log10l_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__log10l_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18614,18620 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 18613,18619 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 18625,18631 **** _log10l(0); ; return 0; } EOF ! if { (eval echo configure:18629: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__log10l_use=yes else --- 18624,18630 ---- _log10l(0); ; return 0; } EOF ! if { (eval echo configure:18628: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__log10l_use=yes else *************** fi *** 18652,18663 **** for ac_func in _log10l do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18656: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18655: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18679,18685 ---- ; return 0; } EOF ! if { (eval echo configure:18683: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18710,18716 **** echo $ac_n "checking for modfl declaration""... $ac_c" 1>&6 ! echo "configure:18714: checking for modfl declaration" >&5 if test x${glibcpp_cv_func_modfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_modfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18709,18715 ---- echo $ac_n "checking for modfl declaration""... $ac_c" 1>&6 ! echo "configure:18713: checking for modfl declaration" >&5 if test x${glibcpp_cv_func_modfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_modfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18725,18738 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { modfl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18736: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_modfl_use=yes else --- 18724,18737 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { modfl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18735: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_modfl_use=yes else *************** fi *** 18759,18770 **** for ac_func in modfl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18763: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18762: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18786,18792 ---- ; return 0; } EOF ! if { (eval echo configure:18790: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18814,18820 **** else echo $ac_n "checking for _modfl declaration""... $ac_c" 1>&6 ! echo "configure:18818: checking for _modfl declaration" >&5 if test x${glibcpp_cv_func__modfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__modfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18813,18819 ---- else echo $ac_n "checking for _modfl declaration""... $ac_c" 1>&6 ! echo "configure:18817: checking for _modfl declaration" >&5 if test x${glibcpp_cv_func__modfl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__modfl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18829,18842 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _modfl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18840: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__modfl_use=yes else --- 18828,18841 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _modfl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18839: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__modfl_use=yes else *************** fi *** 18863,18874 **** for ac_func in _modfl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18867: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18866: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18890,18896 ---- ; return 0; } EOF ! if { (eval echo configure:18894: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 18921,18927 **** echo $ac_n "checking for powl declaration""... $ac_c" 1>&6 ! echo "configure:18925: checking for powl declaration" >&5 if test x${glibcpp_cv_func_powl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_powl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 18920,18926 ---- echo $ac_n "checking for powl declaration""... $ac_c" 1>&6 ! echo "configure:18924: checking for powl declaration" >&5 if test x${glibcpp_cv_func_powl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_powl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 18936,18949 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { powl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18947: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_powl_use=yes else --- 18935,18948 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { powl(0, 0); ; return 0; } EOF ! if { (eval echo configure:18946: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_powl_use=yes else *************** fi *** 18970,18981 **** for ac_func in powl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:18974: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:18973: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 18997,19003 ---- ; return 0; } EOF ! if { (eval echo configure:19001: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19025,19031 **** else echo $ac_n "checking for _powl declaration""... $ac_c" 1>&6 ! echo "configure:19029: checking for _powl declaration" >&5 if test x${glibcpp_cv_func__powl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__powl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19024,19030 ---- else echo $ac_n "checking for _powl declaration""... $ac_c" 1>&6 ! echo "configure:19028: checking for _powl declaration" >&5 if test x${glibcpp_cv_func__powl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__powl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19040,19053 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _powl(0, 0); ; return 0; } EOF ! if { (eval echo configure:19051: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__powl_use=yes else --- 19039,19052 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _powl(0, 0); ; return 0; } EOF ! if { (eval echo configure:19050: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__powl_use=yes else *************** fi *** 19074,19085 **** for ac_func in _powl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19078: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19077: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19101,19107 ---- ; return 0; } EOF ! if { (eval echo configure:19105: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19132,19138 **** echo $ac_n "checking for sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:19136: checking for sqrtl declaration" >&5 if test x${glibcpp_cv_func_sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19131,19137 ---- echo $ac_n "checking for sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:19135: checking for sqrtl declaration" >&5 if test x${glibcpp_cv_func_sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19147,19153 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 19146,19152 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 19158,19164 **** sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:19162: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sqrtl_use=yes else --- 19157,19163 ---- sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:19161: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sqrtl_use=yes else *************** fi *** 19185,19196 **** for ac_func in sqrtl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19189: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19188: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19212,19218 ---- ; return 0; } EOF ! if { (eval echo configure:19216: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19240,19246 **** else echo $ac_n "checking for _sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:19244: checking for _sqrtl declaration" >&5 if test x${glibcpp_cv_func__sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19239,19245 ---- else echo $ac_n "checking for _sqrtl declaration""... $ac_c" 1>&6 ! echo "configure:19243: checking for _sqrtl declaration" >&5 if test x${glibcpp_cv_func__sqrtl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sqrtl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19255,19261 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 19254,19260 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 19266,19272 **** _sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:19270: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sqrtl_use=yes else --- 19265,19271 ---- _sqrtl(0); ; return 0; } EOF ! if { (eval echo configure:19269: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sqrtl_use=yes else *************** fi *** 19293,19304 **** for ac_func in _sqrtl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19297: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19296: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19320,19326 ---- ; return 0; } EOF ! if { (eval echo configure:19324: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19351,19357 **** echo $ac_n "checking for sincosl declaration""... $ac_c" 1>&6 ! echo "configure:19355: checking for sincosl declaration" >&5 if test x${glibcpp_cv_func_sincosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19350,19356 ---- echo $ac_n "checking for sincosl declaration""... $ac_c" 1>&6 ! echo "configure:19354: checking for sincosl declaration" >&5 if test x${glibcpp_cv_func_sincosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_sincosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19366,19379 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincosl(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:19377: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincosl_use=yes else --- 19365,19378 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { sincosl(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:19376: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_sincosl_use=yes else *************** fi *** 19400,19411 **** for ac_func in sincosl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19404: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19403: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19427,19433 ---- ; return 0; } EOF ! if { (eval echo configure:19431: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19455,19461 **** else echo $ac_n "checking for _sincosl declaration""... $ac_c" 1>&6 ! echo "configure:19459: checking for _sincosl declaration" >&5 if test x${glibcpp_cv_func__sincosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19454,19460 ---- else echo $ac_n "checking for _sincosl declaration""... $ac_c" 1>&6 ! echo "configure:19458: checking for _sincosl declaration" >&5 if test x${glibcpp_cv_func__sincosl_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__sincosl_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19470,19483 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincosl(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:19481: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincosl_use=yes else --- 19469,19482 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { _sincosl(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:19480: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__sincosl_use=yes else *************** fi *** 19504,19515 **** for ac_func in _sincosl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19508: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19507: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19531,19537 ---- ; return 0; } EOF ! if { (eval echo configure:19535: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19562,19568 **** echo $ac_n "checking for finitel declaration""... $ac_c" 1>&6 ! echo "configure:19566: checking for finitel declaration" >&5 if test x${glibcpp_cv_func_finitel_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finitel_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19561,19567 ---- echo $ac_n "checking for finitel declaration""... $ac_c" 1>&6 ! echo "configure:19565: checking for finitel declaration" >&5 if test x${glibcpp_cv_func_finitel_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_finitel_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19577,19583 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 19576,19582 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 19588,19594 **** finitel(0); ; return 0; } EOF ! if { (eval echo configure:19592: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finitel_use=yes else --- 19587,19593 ---- finitel(0); ; return 0; } EOF ! if { (eval echo configure:19591: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_finitel_use=yes else *************** fi *** 19615,19626 **** for ac_func in finitel do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19619: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19618: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19642,19648 ---- ; return 0; } EOF ! if { (eval echo configure:19646: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19670,19676 **** else echo $ac_n "checking for _finitel declaration""... $ac_c" 1>&6 ! echo "configure:19674: checking for _finitel declaration" >&5 if test x${glibcpp_cv_func__finitel_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finitel_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 19669,19675 ---- else echo $ac_n "checking for _finitel declaration""... $ac_c" 1>&6 ! echo "configure:19673: checking for _finitel declaration" >&5 if test x${glibcpp_cv_func__finitel_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func__finitel_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19685,19691 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H --- 19684,19690 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < #ifdef HAVE_IEEEFP_H *************** int main() { *** 19696,19702 **** _finitel(0); ; return 0; } EOF ! if { (eval echo configure:19700: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finitel_use=yes else --- 19695,19701 ---- _finitel(0); ; return 0; } EOF ! if { (eval echo configure:19699: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__finitel_use=yes else *************** fi *** 19723,19734 **** for ac_func in _finitel do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19727: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19726: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19750,19756 ---- ; return 0; } EOF ! if { (eval echo configure:19754: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19782,19788 **** echo $ac_n "checking for _float trig functions""... $ac_c" 1>&6 ! echo "configure:19786: checking for _float trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__float_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 19781,19787 ---- echo $ac_n "checking for _float trig functions""... $ac_c" 1>&6 ! echo "configure:19785: checking for _float trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__float_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19796,19802 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { --- 19795,19801 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { *************** int main() { *** 19805,19811 **** _coshf _sinhf _tanhf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:19809: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__float_trig_use=yes else --- 19804,19810 ---- _coshf _sinhf _tanhf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:19808: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__float_trig_use=yes else *************** fi *** 19831,19842 **** _coshf _sinhf _tanhf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19835: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19834: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19858,19864 ---- ; return 0; } EOF ! if { (eval echo configure:19862: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19887,19893 **** echo $ac_n "checking for _float round functions""... $ac_c" 1>&6 ! echo "configure:19891: checking for _float round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__float_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 19886,19892 ---- echo $ac_n "checking for _float round functions""... $ac_c" 1>&6 ! echo "configure:19890: checking for _float round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__float_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 19901,19914 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in _ceilf _floorf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:19912: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__float_round_use=yes else --- 19900,19913 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in _ceilf _floorf; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:19911: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__float_round_use=yes else *************** fi *** 19932,19943 **** for ac_func in _ceilf _floorf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:19936: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:19935: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 19959,19965 ---- ; return 0; } EOF ! if { (eval echo configure:19963: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 19989,19995 **** echo $ac_n "checking for _long double trig functions""... $ac_c" 1>&6 ! echo "configure:19993: checking for _long double trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__long_double_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 19988,19994 ---- echo $ac_n "checking for _long double trig functions""... $ac_c" 1>&6 ! echo "configure:19992: checking for _long double trig functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__long_double_trig_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 20003,20009 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { --- 20002,20008 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { *************** int main() { *** 20012,20018 **** _coshl _sinhl _tanhl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:20016: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__long_double_trig_use=yes else --- 20011,20017 ---- _coshl _sinhl _tanhl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:20015: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__long_double_trig_use=yes else *************** fi *** 20038,20049 **** _coshl _sinhl _tanhl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20042: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20041: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20065,20071 ---- ; return 0; } EOF ! if { (eval echo configure:20069: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20094,20100 **** echo $ac_n "checking for _long double round functions""... $ac_c" 1>&6 ! echo "configure:20098: checking for _long double round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__long_double_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 20093,20099 ---- echo $ac_n "checking for _long double round functions""... $ac_c" 1>&6 ! echo "configure:20097: checking for _long double round functions" >&5 if eval "test \"`echo '$''{'glibcpp_cv_func__long_double_round_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 20108,20121 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in _ceill _floorl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:20119: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__long_double_round_use=yes else --- 20107,20120 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { `for x in _ceill _floorl; do echo "$x (0);"; done` ; return 0; } EOF ! if { (eval echo configure:20118: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func__long_double_round_use=yes else *************** fi *** 20139,20150 **** for ac_func in _ceill _floorl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20143: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20142: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20166,20172 ---- ; return 0; } EOF ! if { (eval echo configure:20170: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20199,20205 **** echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:20203: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 20198,20204 ---- echo $ac_n "checking for main in -lm""... $ac_c" 1>&6 ! echo "configure:20202: checking for main in -lm" >&5 ac_lib_var=`echo m'_'main | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 20207,20220 **** ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 20206,20219 ---- ac_save_LIBS="$LIBS" LIBS="-lm $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 20244,20255 **** for ac_func in nan copysignf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20248: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20247: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20271,20277 ---- ; return 0; } EOF ! if { (eval echo configure:20275: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20301,20312 **** for ac_func in __signbit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20305: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20304: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20328,20334 ---- ; return 0; } EOF ! if { (eval echo configure:20332: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20357,20368 **** for ac_func in __signbitf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20361: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20360: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20384,20390 ---- ; return 0; } EOF ! if { (eval echo configure:20388: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20415,20426 **** for ac_func in __signbitl do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20419: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20418: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20442,20448 ---- ; return 0; } EOF ! if { (eval echo configure:20446: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20475,20490 **** echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:20479: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:20488: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else --- 20474,20489 ---- echo $ac_n "checking for mbstate_t""... $ac_c" 1>&6 ! echo "configure:20478: checking for mbstate_t" >&5 cat > conftest.$ac_ext < int main() { mbstate_t teststate; ; return 0; } EOF ! if { (eval echo configure:20487: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* have_mbstate_t=yes else *************** EOF *** 20506,20522 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:20510: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20520: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 20505,20521 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:20509: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20519: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 20547,20563 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:20551: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20561: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 20546,20562 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:20550: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20560: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 20590,20605 **** test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:20594: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:20603: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else --- 20589,20604 ---- test x"$enable_c_mbchar" != xno; then echo $ac_n "checking for WCHAR_MIN and WCHAR_MAX""... $ac_c" 1>&6 ! echo "configure:20593: checking for WCHAR_MIN and WCHAR_MAX" >&5 cat > conftest.$ac_ext < int main() { int i = WCHAR_MIN; int j = WCHAR_MAX; ; return 0; } EOF ! if { (eval echo configure:20602: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_wchar_minmax=yes else *************** rm -f conftest* *** 20612,20620 **** echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:20616: checking for WEOF" >&5 cat > conftest.$ac_ext < --- 20611,20619 ---- echo "$ac_t""$has_wchar_minmax" 1>&6 echo $ac_n "checking for WEOF""... $ac_c" 1>&6 ! echo "configure:20615: checking for WEOF" >&5 cat > conftest.$ac_ext < *************** int main() { *** 20623,20629 **** wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:20627: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else --- 20622,20628 ---- wint_t i = WEOF; ; return 0; } EOF ! if { (eval echo configure:20626: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* has_weof=yes else *************** rm -f conftest* *** 20639,20650 **** for ac_func in wcslen wmemchr wmemcmp wmemcpy wmemmove wmemset do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20643: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20642: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20666,20672 ---- ; return 0; } EOF ! if { (eval echo configure:20670: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20702,20713 **** wcscspn wcsspn wcstok wcsftime wcschr wcspbrk wcsrchr wcsstr do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20706: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20705: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20729,20735 ---- ; return 0; } EOF ! if { (eval echo configure:20733: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20758,20764 **** echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:20762: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then --- 20757,20763 ---- echo $ac_n "checking for ISO C99 wchar_t support""... $ac_c" 1>&6 ! echo "configure:20761: checking for ISO C99 wchar_t support" >&5 if test x"$has_weof" = xyes && test x"$has_wchar_minmax" = xyes && test x"$ac_wfuncs" = xyes; then *************** echo "configure:20762: checking for ISO *** 20770,20786 **** ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:20774: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20784: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 20769,20785 ---- ac_safe=`echo "iconv.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for iconv.h""... $ac_c" 1>&6 ! echo "configure:20773: checking for iconv.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20783: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 20804,20820 **** ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:20808: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20818: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 20803,20819 ---- ac_safe=`echo "langinfo.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for langinfo.h""... $ac_c" 1>&6 ! echo "configure:20807: checking for langinfo.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:20817: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** fi *** 20838,20844 **** echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:20842: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 20837,20843 ---- echo $ac_n "checking for iconv in -liconv""... $ac_c" 1>&6 ! echo "configure:20841: checking for iconv in -liconv" >&5 ac_lib_var=`echo iconv'_'iconv | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** else *** 20846,20852 **** ac_save_LIBS="$LIBS" LIBS="-liconv $LIBS" cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else --- 20856,20862 ---- iconv() ; return 0; } EOF ! if { (eval echo configure:20860: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else *************** fi *** 20883,20894 **** for ac_func in iconv_open iconv_close iconv nl_langinfo do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:20887: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:20886: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 20910,20916 ---- ; return 0; } EOF ! if { (eval echo configure:20914: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 20941,20947 **** LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:20945: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then --- 20940,20946 ---- LIBS="$ac_save_LIBS" echo $ac_n "checking for XPG2 wchar_t support""... $ac_c" 1>&6 ! echo "configure:20944: checking for XPG2 wchar_t support" >&5 if test x"$ac_has_iconv_h" = xyes && test x"$ac_has_langinfo_h" = xyes && test x"$ac_XPG2funcs" = xyes; then *************** echo "configure:20945: checking for XPG2 *** 20952,20958 **** echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:20956: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF --- 20951,20957 ---- echo "$ac_t""$ac_XPG2_wchar_t" 1>&6 echo $ac_n "checking for enabled wchar_t specializations""... $ac_c" 1>&6 ! echo "configure:20955: checking for enabled wchar_t specializations" >&5 if test x"$ac_isoC99_wchar_t" = xyes && test x"$ac_XPG2_wchar_t" = xyes; then cat >> confdefs.h <<\EOF *************** EOF *** 20974,20980 **** echo $ac_n "checking for strtold declaration""... $ac_c" 1>&6 ! echo "configure:20978: checking for strtold declaration" >&5 if test x${glibcpp_cv_func_strtold_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_strtold_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 20973,20979 ---- echo $ac_n "checking for strtold declaration""... $ac_c" 1>&6 ! echo "configure:20977: checking for strtold declaration" >&5 if test x${glibcpp_cv_func_strtold_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_strtold_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 20989,21002 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { strtold(0, 0); ; return 0; } EOF ! if { (eval echo configure:21000: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_strtold_use=yes else --- 20988,21001 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { strtold(0, 0); ; return 0; } EOF ! if { (eval echo configure:20999: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_strtold_use=yes else *************** fi *** 21022,21033 **** for ac_func in strtold do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21026: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21025: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21049,21055 ---- ; return 0; } EOF ! if { (eval echo configure:21053: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 21078,21084 **** echo $ac_n "checking for strtof declaration""... $ac_c" 1>&6 ! echo "configure:21082: checking for strtof declaration" >&5 if test x${glibcpp_cv_func_strtof_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_strtof_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 21077,21083 ---- echo $ac_n "checking for strtof declaration""... $ac_c" 1>&6 ! echo "configure:21081: checking for strtof declaration" >&5 if test x${glibcpp_cv_func_strtof_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_strtof_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 21093,21106 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { strtof(0, 0); ; return 0; } EOF ! if { (eval echo configure:21104: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_strtof_use=yes else --- 21092,21105 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { strtof(0, 0); ; return 0; } EOF ! if { (eval echo configure:21103: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_strtof_use=yes else *************** fi *** 21126,21137 **** for ac_func in strtof do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21130: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21129: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21153,21159 ---- ; return 0; } EOF ! if { (eval echo configure:21157: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 21183,21194 **** for ac_func in drand48 do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21187: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21186: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21210,21216 ---- ; return 0; } EOF ! if { (eval echo configure:21214: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 21245,21251 **** echo $ac_n "checking for isatty declaration""... $ac_c" 1>&6 ! echo "configure:21249: checking for isatty declaration" >&5 if test x${glibcpp_cv_func_isatty_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isatty_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 21244,21250 ---- echo $ac_n "checking for isatty declaration""... $ac_c" 1>&6 ! echo "configure:21248: checking for isatty declaration" >&5 if test x${glibcpp_cv_func_isatty_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_isatty_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 21260,21273 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { isatty(0); ; return 0; } EOF ! if { (eval echo configure:21271: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isatty_use=yes else --- 21259,21272 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { isatty(0); ; return 0; } EOF ! if { (eval echo configure:21270: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_isatty_use=yes else *************** fi *** 21293,21304 **** for ac_func in isatty do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21297: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21296: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21320,21326 ---- ; return 0; } EOF ! if { (eval echo configure:21324: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** done *** 21353,21369 **** ac_safe=`echo "locale.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for locale.h""... $ac_c" 1>&6 ! echo "configure:21357: checking for locale.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21367: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 21352,21368 ---- ac_safe=`echo "locale.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for locale.h""... $ac_c" 1>&6 ! echo "configure:21356: checking for locale.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21366: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** if eval "test \"`echo '$ac_cv_header_'$a *** 21381,21399 **** echo "$ac_t""yes" 1>&6 echo $ac_n "checking for LC_MESSAGES""... $ac_c" 1>&6 ! echo "configure:21385: checking for LC_MESSAGES" >&5 if eval "test \"`echo '$''{'ac_cv_val_LC_MESSAGES'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return LC_MESSAGES ; return 0; } EOF ! if { (eval echo configure:21397: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* ac_cv_val_LC_MESSAGES=yes else --- 21380,21398 ---- echo "$ac_t""yes" 1>&6 echo $ac_n "checking for LC_MESSAGES""... $ac_c" 1>&6 ! echo "configure:21384: checking for LC_MESSAGES" >&5 if eval "test \"`echo '$''{'ac_cv_val_LC_MESSAGES'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { return LC_MESSAGES ; return 0; } EOF ! if { (eval echo configure:21396: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* ac_cv_val_LC_MESSAGES=yes else *************** fi *** 21420,21426 **** cat > conftest.$ac_ext < --- 21419,21425 ---- cat > conftest.$ac_ext < *************** int main() { *** 21429,21435 **** sigjmp_buf env; while (! sigsetjmp (env, 1)) siglongjmp (env, 1); ; return 0; } EOF ! if { (eval echo configure:21433: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* cat >> confdefs.h <<\EOF #define HAVE_SIGSETJMP 1 --- 21428,21434 ---- sigjmp_buf env; while (! sigsetjmp (env, 1)) siglongjmp (env, 1); ; return 0; } EOF ! if { (eval echo configure:21432: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* cat >> confdefs.h <<\EOF #define HAVE_SIGSETJMP 1 *************** rm -f conftest* *** 21446,21462 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:21450: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21460: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 21445,21461 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:21449: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21459: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 21485,21496 **** for ac_func in getpagesize do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21489: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21488: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21512,21518 ---- ; return 0; } EOF ! if { (eval echo configure:21516: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** fi *** 21538,21544 **** done echo $ac_n "checking for working mmap""... $ac_c" 1>&6 ! echo "configure:21542: checking for working mmap" >&5 if eval "test \"`echo '$''{'ac_cv_func_mmap_fixed_mapped'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else --- 21537,21543 ---- done echo $ac_n "checking for working mmap""... $ac_c" 1>&6 ! echo "configure:21541: checking for working mmap" >&5 if eval "test \"`echo '$''{'ac_cv_func_mmap_fixed_mapped'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else *************** else *** 21546,21552 **** ac_cv_func_mmap_fixed_mapped=no else cat > conftest.$ac_ext < conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_mmap_fixed_mapped=yes else --- 21698,21704 ---- } EOF ! if { (eval echo configure:21702: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext} && (./conftest; exit) 2>/dev/null then ac_cv_func_mmap_fixed_mapped=yes else *************** fi *** 21730,21746 **** do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:21734: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21744: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* --- 21729,21745 ---- do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 ! echo "configure:21733: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ! { (eval echo configure:21743: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out | grep -v "^conftest.${ac_ext}\$"` if test -z "$ac_err"; then rm -rf conftest* *************** done *** 21773,21779 **** # Can't do these in a loop, else the resulting syntax is wrong. cat > conftest.$ac_ext < #include --- 21772,21778 ---- # Can't do these in a loop, else the resulting syntax is wrong. cat > conftest.$ac_ext < #include *************** int main() { *** 21782,21788 **** int f = RLIMIT_DATA ; ; return 0; } EOF ! if { (eval echo configure:21786: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else --- 21781,21787 ---- int f = RLIMIT_DATA ; ; return 0; } EOF ! if { (eval echo configure:21785: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else *************** EOF *** 21799,21805 **** cat > conftest.$ac_ext < #include --- 21798,21804 ---- cat > conftest.$ac_ext < #include *************** int main() { *** 21808,21814 **** int f = RLIMIT_RSS ; ; return 0; } EOF ! if { (eval echo configure:21812: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else --- 21807,21813 ---- int f = RLIMIT_RSS ; ; return 0; } EOF ! if { (eval echo configure:21811: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else *************** EOF *** 21825,21831 **** cat > conftest.$ac_ext < #include --- 21824,21830 ---- cat > conftest.$ac_ext < #include *************** int main() { *** 21834,21840 **** int f = RLIMIT_VMEM ; ; return 0; } EOF ! if { (eval echo configure:21838: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else --- 21833,21839 ---- int f = RLIMIT_VMEM ; ; return 0; } EOF ! if { (eval echo configure:21837: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else *************** EOF *** 21851,21857 **** cat > conftest.$ac_ext < #include --- 21850,21856 ---- cat > conftest.$ac_ext < #include *************** int main() { *** 21860,21866 **** int f = RLIMIT_AS ; ; return 0; } EOF ! if { (eval echo configure:21864: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else --- 21859,21865 ---- int f = RLIMIT_AS ; ; return 0; } EOF ! if { (eval echo configure:21863: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_mresult=1 else *************** EOF *** 21882,21888 **** else cat > conftest.$ac_ext < #include --- 21881,21887 ---- else cat > conftest.$ac_ext < #include *************** int main() { *** 21891,21897 **** struct rlimit r; setrlimit(0, &r); ; return 0; } EOF ! if { (eval echo configure:21895: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_setrlimit=yes else --- 21890,21896 ---- struct rlimit r; setrlimit(0, &r); ; return 0; } EOF ! if { (eval echo configure:21894: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_setrlimit=yes else *************** fi *** 21907,21913 **** fi echo $ac_n "checking for testsuite memory limit support""... $ac_c" 1>&6 ! echo "configure:21911: checking for testsuite memory limit support" >&5 if test $setrlimit_have_headers = yes && test $ac_setrlimit = yes; then ac_mem_limits=yes cat >> confdefs.h <<\EOF --- 21906,21912 ---- fi echo $ac_n "checking for testsuite memory limit support""... $ac_c" 1>&6 ! echo "configure:21910: checking for testsuite memory limit support" >&5 if test $setrlimit_have_headers = yes && test $ac_setrlimit = yes; then ac_mem_limits=yes cat >> confdefs.h <<\EOF *************** EOF *** 21923,21929 **** # Look for setenv, so that extended locale tests can be performed. echo $ac_n "checking for setenv declaration""... $ac_c" 1>&6 ! echo "configure:21927: checking for setenv declaration" >&5 if test x${glibcpp_cv_func_setenv_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_setenv_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 --- 21922,21928 ---- # Look for setenv, so that extended locale tests can be performed. echo $ac_n "checking for setenv declaration""... $ac_c" 1>&6 ! echo "configure:21926: checking for setenv declaration" >&5 if test x${glibcpp_cv_func_setenv_use+set} != xset; then if eval "test \"`echo '$''{'glibcpp_cv_func_setenv_use'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 *************** ac_link='${CXX-g++} -o conftest${ac_exee *** 21938,21951 **** cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { setenv(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:21949: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_setenv_use=yes else --- 21937,21950 ---- cross_compiling=$ac_cv_prog_cxx_cross cat > conftest.$ac_ext < int main() { setenv(0, 0, 0); ; return 0; } EOF ! if { (eval echo configure:21948: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* glibcpp_cv_func_setenv_use=yes else *************** fi *** 21971,21982 **** for ac_func in setenv do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 ! echo "configure:21975: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&6 ! echo "configure:21974: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else --- 21998,22004 ---- ; return 0; } EOF ! if { (eval echo configure:22002: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else *************** fi *** 22069,22086 **** # Check to see if libgcc_s exists, indicating that shared libgcc is possible. echo $ac_n "checking for shared libgcc""... $ac_c" 1>&6 ! echo "configure:22073: checking for shared libgcc" >&5 ac_save_CFLAGS="$CFLAGS" CFLAGS=' -lgcc_s' cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_shared_libgcc=yes else --- 22068,22085 ---- # Check to see if libgcc_s exists, indicating that shared libgcc is possible. echo $ac_n "checking for shared libgcc""... $ac_c" 1>&6 ! echo "configure:22072: checking for shared libgcc" >&5 ac_save_CFLAGS="$CFLAGS" CFLAGS=' -lgcc_s' cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* glibcpp_shared_libgcc=yes else *************** if test $enable_symvers = yes ; then *** 22114,22127 **** echo 'FOO { global: f[a-z]o; local: *; };' > conftest.map cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* enable_symvers=gnu else --- 22113,22126 ---- echo 'FOO { global: f[a-z]o; local: *; };' > conftest.map cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest${ac_exeext}; then rm -rf conftest* enable_symvers=gnu else *************** else *** 22167,22173 **** GLIBCPP_BUILD_VERSIONED_SHLIB_FALSE= fi echo $ac_n "checking versioning on shared library symbols""... $ac_c" 1>&6 ! echo "configure:22171: checking versioning on shared library symbols" >&5 echo "$ac_t""$enable_symvers" 1>&6 --- 22166,22172 ---- GLIBCPP_BUILD_VERSIONED_SHLIB_FALSE= fi echo $ac_n "checking versioning on shared library symbols""... $ac_c" 1>&6 ! echo "configure:22170: checking versioning on shared library symbols" >&5 echo "$ac_t""$enable_symvers" 1>&6 *************** glibcpp_prefixdir=${prefix} *** 22255,22261 **** # Process the option --with-gxx-include-dir= echo $ac_n "checking for --with-gxx-include-dir""... $ac_c" 1>&6 ! echo "configure:22259: checking for --with-gxx-include-dir" >&5 # Check whether --with-gxx-include-dir or --without-gxx-include-dir was given. if test "${with_gxx_include_dir+set}" = set; then withval="$with_gxx_include_dir" --- 22254,22260 ---- # Process the option --with-gxx-include-dir= echo $ac_n "checking for --with-gxx-include-dir""... $ac_c" 1>&6 ! echo "configure:22258: checking for --with-gxx-include-dir" >&5 # Check whether --with-gxx-include-dir or --without-gxx-include-dir was given. if test "${with_gxx_include_dir+set}" = set; then withval="$with_gxx_include_dir" *************** echo "$ac_t""$gxx_include_dir" 1>&6 *** 22279,22285 **** # Process the option "--enable-version-specific-runtime-libs" echo $ac_n "checking for --enable-version-specific-runtime-libs""... $ac_c" 1>&6 ! echo "configure:22283: checking for --enable-version-specific-runtime-libs" >&5 # Check whether --enable-version-specific-runtime-libs or --disable-version-specific-runtime-libs was given. if test "${enable_version_specific_runtime_libs+set}" = set; then enableval="$enable_version_specific_runtime_libs" --- 22278,22284 ---- # Process the option "--enable-version-specific-runtime-libs" echo $ac_n "checking for --enable-version-specific-runtime-libs""... $ac_c" 1>&6 ! echo "configure:22282: checking for --enable-version-specific-runtime-libs" >&5 # Check whether --enable-version-specific-runtime-libs or --disable-version-specific-runtime-libs was given. if test "${enable_version_specific_runtime_libs+set}" = set; then enableval="$enable_version_specific_runtime_libs" *************** if test x"$glibcpp_toolexecdir" = x"no"; *** 22326,22332 **** fi echo $ac_n "checking for install location""... $ac_c" 1>&6 ! echo "configure:22330: checking for install location" >&5 echo "$ac_t""$gxx_include_dir" 1>&6 --- 22325,22331 ---- fi echo $ac_n "checking for install location""... $ac_c" 1>&6 ! echo "configure:22329: checking for install location" >&5 echo "$ac_t""$gxx_include_dir" 1>&6 diff -Nrc3pad gcc-3.2.2/libstdc++-v3/configure.in gcc-3.2.3/libstdc++-v3/configure.in *** gcc-3.2.2/libstdc++-v3/configure.in Mon Dec 2 22:04:29 2002 --- gcc-3.2.3/libstdc++-v3/configure.in Wed Feb 5 16:37:00 2003 *************** ORIGINAL_LD_FOR_MULTILIBS=$LD *** 13,19 **** PACKAGE=libstdc++ AC_SUBST(PACKAGE) # For libtool versioning info, format is CURRENT:REVISION:AGE ! libtool_VERSION=5:2:0 AC_SUBST(libtool_VERSION) GLIBCPP_TOPREL_CONFIGURE --- 13,19 ---- PACKAGE=libstdc++ AC_SUBST(PACKAGE) # For libtool versioning info, format is CURRENT:REVISION:AGE ! libtool_VERSION=5:3:0 AC_SUBST(libtool_VERSION) GLIBCPP_TOPREL_CONFIGURE diff -Nrc3pad gcc-3.2.2/libstdc++-v3/include/bits/c++config gcc-3.2.3/libstdc++-v3/include/bits/c++config *** gcc-3.2.2/libstdc++-v3/include/bits/c++config Wed Feb 5 00:16:27 2003 --- gcc-3.2.3/libstdc++-v3/include/bits/c++config Tue Apr 22 00:16:28 2003 *************** *** 34,40 **** #include // The current version of the C++ library in compressed ISO date format. ! #define __GLIBCPP__ 20030205 // This is necessary until GCC supports separate template // compilation. --- 34,40 ---- #include // The current version of the C++ library in compressed ISO date format. ! #define __GLIBCPP__ 20030422 // This is necessary until GCC supports separate template // compilation. diff -Nrc3pad gcc-3.2.2/libstdc++-v3/include/bits/fstream.tcc gcc-3.2.3/libstdc++-v3/include/bits/fstream.tcc *** gcc-3.2.2/libstdc++-v3/include/bits/fstream.tcc Thu Jan 23 23:16:35 2003 --- gcc-3.2.3/libstdc++-v3/include/bits/fstream.tcc Mon Feb 17 21:48:49 2003 *************** namespace std *** 94,100 **** if ((__mode & ios_base::ate) && this->seekoff(0, ios_base::end, __mode) < 0) ! this->close(); __ret = this; } } --- 94,105 ---- if ((__mode & ios_base::ate) && this->seekoff(0, ios_base::end, __mode) < 0) ! { ! // 27.8.1.3,4 ! this->close(); ! return __ret; ! } ! __ret = this; } } *************** namespace std *** 270,278 **** const char_type* __iend; __res_type __r = __cvt.out(_M_state_cur, __ibuf, __ibuf + __ilen, __iend, __buf, __buf + __blen, __bend); ! // Result == ok, partial, noconv ! if (__r != codecvt_base::error) ! __blen = __bend - __buf; // Result == error else __blen = 0; --- 275,289 ---- const char_type* __iend; __res_type __r = __cvt.out(_M_state_cur, __ibuf, __ibuf + __ilen, __iend, __buf, __buf + __blen, __bend); ! ! if (__r == codecvt_base::ok || __r == codecvt_base::partial) ! __blen = __bend - __buf; ! // Similarly to the always_noconv case above. ! else if (__r == codecvt_base::noconv) ! { ! __buf = reinterpret_cast(__ibuf); ! __blen = __ilen; ! } // Result == error else __blen = 0; diff -Nrc3pad gcc-3.2.2/libstdc++-v3/include/bits/streambuf.tcc gcc-3.2.3/libstdc++-v3/include/bits/streambuf.tcc *** gcc-3.2.2/libstdc++-v3/include/bits/streambuf.tcc Tue Dec 3 16:13:03 2002 --- gcc-3.2.3/libstdc++-v3/include/bits/streambuf.tcc Thu Feb 6 13:36:39 2003 *************** namespace std *** 67,74 **** { int_type __ret; bool __testpos = _M_in_cur && _M_in_beg < _M_in_cur; ! bool __testne = _M_in_cur && !traits_type::eq(__c, this->gptr()[-1]); ! if (!__testpos || __testne) __ret = this->pbackfail(traits_type::to_int_type(__c)); else { --- 67,73 ---- { int_type __ret; bool __testpos = _M_in_cur && _M_in_beg < _M_in_cur; ! if (!__testpos || !traits_type::eq(__c, this->gptr()[-1])) __ret = this->pbackfail(traits_type::to_int_type(__c)); else { diff -Nrc3pad gcc-3.2.2/libstdc++-v3/libio/ChangeLog gcc-3.2.3/libstdc++-v3/libio/ChangeLog *** gcc-3.2.2/libstdc++-v3/libio/ChangeLog Wed Feb 5 03:01:58 2003 --- gcc-3.2.3/libstdc++-v3/libio/ChangeLog Tue Apr 22 06:15:53 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/libstdc++-v3/testsuite/27_io/filebuf_members.cc gcc-3.2.3/libstdc++-v3/testsuite/27_io/filebuf_members.cc *** gcc-3.2.2/libstdc++-v3/testsuite/27_io/filebuf_members.cc Tue Apr 30 19:05:47 2002 --- gcc-3.2.3/libstdc++-v3/testsuite/27_io/filebuf_members.cc Thu Feb 6 13:36:39 2003 *************** test_04() *** 172,178 **** } unlink("xxx"); - exit(0); } // Charles Leggett --- 172,177 ---- *************** void test_05() *** 191,196 **** --- 190,222 ---- scratch_file.close(); } + // libstdc++/9507 + void test_06() + { + bool test = true; + + signal(SIGPIPE, SIG_IGN); + + unlink("yyy"); + mkfifo("yyy", S_IRWXU); + + if (!fork()) + { + std::filebuf fbuf; + fbuf.open("yyy", std::ios_base::in); + fbuf.sgetc(); + fbuf.close(); + + exit(0); + } + + std::filebuf fbuf; + std::filebuf* r = + fbuf.open("yyy", std::ios_base::out | std::ios_base::ate); + VERIFY( !fbuf.is_open() ); + VERIFY( r == NULL ); + } + int main() { *************** main() *** 199,204 **** --- 225,231 ---- test_03(); test_04(); test_05(); + test_06(); return 0; } diff -Nrc3pad gcc-3.2.2/libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc gcc-3.2.3/libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc *** gcc-3.2.2/libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc Thu Jan 23 23:16:36 2003 --- gcc-3.2.3/libstdc++-v3/testsuite/27_io/filebuf_virtuals.cc Mon Feb 17 21:48:49 2003 *************** void test07() *** 537,542 **** --- 537,615 ---- VERIFY( ob.getloc() == loc_de ); } + class MyTraits : public std::char_traits + { + public: + static bool eq(char c1, char c2) + { + VERIFY( c1 != 'X' ); + VERIFY( c2 != 'X' ); + return std::char_traits::eq(c1, c2); + } + }; + + class MyBuf : public std::basic_streambuf + { + char buffer[8]; + + public: + MyBuf() + { + std::memset(buffer, 'X', sizeof(buffer)); + std::memset(buffer + 2, 'f', 4); + setg(buffer + 2, buffer + 2, buffer + 6); + } + }; + + // libstdc++/9538 + void test08() + { + bool test = true; + + MyBuf mb; + mb.sputbackc('a'); + } + + class Cvt_to_upper : public std::codecvt + { + bool do_always_noconv() const throw() + { + return false; + } + }; + + // libstdc++/9169 + void test09() + { + using namespace std; + bool test = true; + + locale c_loc; + locale loc(c_loc, new Cvt_to_upper); + + string str("abcdefghijklmnopqrstuvwxyz"); + string tmp; + + { + ofstream out; + out.imbue(loc); + out.open("filebuf_virtuals-4.txt"); + copy(str.begin(), str.end(), + ostreambuf_iterator(out)); + } + + { + ifstream in; + in.open("filebuf_virtuals-4.txt"); + copy(istreambuf_iterator(in), + istreambuf_iterator(), + back_inserter(tmp)); + } + + VERIFY( tmp.size() == str.size() ); + VERIFY( tmp == str ); + } + main() { test01(); *************** main() *** 548,552 **** --- 621,627 ---- test06(); test07(); + test08(); + test09(); return 0; } diff -Nrc3pad gcc-3.2.2/maintainer-scripts/ChangeLog gcc-3.2.3/maintainer-scripts/ChangeLog *** gcc-3.2.2/maintainer-scripts/ChangeLog Wed Feb 5 03:01:40 2003 --- gcc-3.2.3/maintainer-scripts/ChangeLog Tue Apr 22 06:15:56 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. diff -Nrc3pad gcc-3.2.2/zlib/ChangeLog gcc-3.2.3/zlib/ChangeLog *** gcc-3.2.2/zlib/ChangeLog Wed Feb 5 03:01:28 2003 --- gcc-3.2.3/zlib/ChangeLog Tue Apr 22 06:15:59 2003 *************** *** 1,3 **** --- 1,7 ---- + 2003-04-22 Release Manager + + * GCC 3.2.3 Released. + 2003-02-05 Release Manager * GCC 3.2.2 Released. *************** Changes in 1.0.6 (19 Jan 1998) *** 273,279 **** - use _fdopen instead of fdopen for MSC >= 6.0 (Thomas Fanslau) - added makelcc.bat for lcc-win32 (Tom St Denis) - in Makefile.dj2, use copy and del instead of install and rm (Frank Donahoe) ! - Avoid expanded $Id: ChangeLog,v 1.2.16.5.2.6 2003/02/05 03:01:28 gdr Exp $. Use "rcs -kb" or "cvs admin -kb" to avoid Id expansion. - check for unistd.h in configure (for off_t) - remove useless check parameter in inflate_blocks_free - avoid useless assignment of s->check to itself in inflate_blocks_new --- 277,283 ---- - use _fdopen instead of fdopen for MSC >= 6.0 (Thomas Fanslau) - added makelcc.bat for lcc-win32 (Tom St Denis) - in Makefile.dj2, use copy and del instead of install and rm (Frank Donahoe) ! - Avoid expanded $Id: ChangeLog,v 1.2.16.5.2.7 2003/04/22 06:15:59 gdr Exp $. Use "rcs -kb" or "cvs admin -kb" to avoid Id expansion. - check for unistd.h in configure (for off_t) - remove useless check parameter in inflate_blocks_free - avoid useless assignment of s->check to itself in inflate_blocks_new diff -Nrc3pad gcc-3.2.2/zlib/ChangeLog.gcj gcc-3.2.3/zlib/ChangeLog.gcj *** gcc-3.2.2/zlib/ChangeLog.gcj Tue Jan 28 01:44:15 2003 --- gcc-3.2.3/zlib/ChangeLog.gcj Thu Feb 20 02:32:58 2003 *************** *** 1,3 **** --- 1,9 ---- + 2003-02-19 Alexandre Oliva + + * configure.in (multiosdir): Set to nothing if compiler is not GCC + or if it doesn't support -print-multi-os-directory. + * configure: Rebuilt. + 2003-01-27 Alexandre Oliva * configure.in (toolexecdir, toolexeclibdir): Set and AC_SUBST. diff -Nrc3pad gcc-3.2.2/zlib/configure gcc-3.2.3/zlib/configure *** gcc-3.2.2/zlib/configure Tue Jan 28 01:44:15 2003 --- gcc-3.2.3/zlib/configure Thu Feb 20 02:32:58 2003 *************** else *** 2669,2675 **** toolexecdir='$(libdir)/gcc-lib/$(target_alias)' toolexeclibdir='$(libdir)' fi ! toolexeclibdir=$toolexeclibdir/`$CC -print-multi-os-directory 2>/dev/null || echo .` --- 2669,2680 ---- toolexecdir='$(libdir)/gcc-lib/$(target_alias)' toolexeclibdir='$(libdir)' fi ! if test "$GCC" = yes && $CC -print-multi-os-directory > /dev/null 2>&1; then ! multiosdir=/`$CC -print-multi-os-directory` ! else ! multiosdir= ! fi ! toolexeclibdir=${toolexeclibdir}${multiosdir} diff -Nrc3pad gcc-3.2.2/zlib/configure.in gcc-3.2.3/zlib/configure.in *** gcc-3.2.2/zlib/configure.in Tue Jan 28 01:44:15 2003 --- gcc-3.2.3/zlib/configure.in Thu Feb 20 02:32:58 2003 *************** else *** 121,127 **** toolexecdir='$(libdir)/gcc-lib/$(target_alias)' toolexeclibdir='$(libdir)' fi ! toolexeclibdir=$toolexeclibdir/`$CC -print-multi-os-directory 2>/dev/null || echo .` AC_SUBST(toolexecdir) AC_SUBST(toolexeclibdir) --- 121,132 ---- toolexecdir='$(libdir)/gcc-lib/$(target_alias)' toolexeclibdir='$(libdir)' fi ! if test "$GCC" = yes && $CC -print-multi-os-directory > /dev/null 2>&1; then ! multiosdir=/`$CC -print-multi-os-directory` ! else ! multiosdir= ! fi ! toolexeclibdir=${toolexeclibdir}${multiosdir} AC_SUBST(toolexecdir) AC_SUBST(toolexeclibdir)