/* A Bison parser, made from parse.yy with Bison version GNU/Andrew Bison version A2.2 */ #define YYBISON 1 /* Identify Bison output. */ #define T_ID 258 #define T_NUM 259 #define T_CONST 260 #define T_STRUCT 261 #define T_UNION 262 #define T_ENUM 263 #define T_TYPEDEF 264 #define T_PROGRAM 265 #define T_UNSIGNED 266 #define T_INT 267 #define T_HYPER 268 #define T_DOUBLE 269 #define T_QUADRUPLE 270 #define T_VOID 271 #define T_VERSION 272 #define T_SWITCH 273 #define T_CASE 274 #define T_DEFAULT 275 #define T_OPAQUE 276 #define T_STRING 277 #line 24 "parse.yy" #include "rpcc.h" static int proc_compare (const void *, const void *); static int vers_compare (const void *, const void *); static str getnewid (str); static str getid (str); #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 154 #define YYFLAG -32768 #define YYNTBASE 36 #define YYTRANSLATE(x) ((unsigned)(x) <= 277 ? yytranslate[x] : 73) 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, 2, 2, 2, 2, 2, 2, 2, 28, 29, 31, 2, 27, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 30, 24, 34, 23, 35, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 32, 2, 33, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 25, 2, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 1, 2, 6, 8, 10, 12, 14, 16, 18, 21, 25, 31, 32, 41, 42, 44, 45, 53, 54, 67, 68, 78, 80, 83, 84, 94, 96, 99, 108, 110, 113, 116, 118, 121, 125, 128, 130, 133, 135, 138, 140, 142, 146, 148, 152, 154, 158, 162, 167, 174, 181, 188, 195, 202, 208, 214, 220, 222, 224, 226, 228, 230, 232, 235, 237, 240, 242, 244, 246, 248, 250, 252 }; static const short yyrhs[] = { -1, 0, 36, 37, 38, 0, 40, 0, 41, 0, 44, 0, 39, 0, 46, 0, 48, 0, 9, 65, 0, 9, 6, 65, 0, 5, 71, 23, 69, 24, 0, 0, 8, 71, 25, 42, 62, 43, 26, 24, 0, 0, 27, 0, 0, 6, 71, 25, 45, 60, 26, 24, 0, 0, 7, 71, 18, 28, 67, 3, 29, 25, 47, 55, 26, 24, 0, 0, 10, 71, 25, 49, 50, 26, 23, 70, 24, 0, 51, 0, 50, 51, 0, 0, 17, 71, 25, 52, 53, 26, 23, 70, 24, 0, 54, 0, 53, 54, 0, 66, 71, 28, 66, 29, 23, 70, 24, 0, 56, 0, 55, 56, 0, 57, 59, 0, 58, 0, 57, 58, 0, 19, 69, 30, 0, 20, 30, 0, 65, 0, 16, 24, 0, 61, 0, 60, 61, 0, 65, 0, 63, 0, 62, 27, 63, 0, 64, 0, 71, 23, 69, 0, 71, 0, 67, 3, 24, 0, 22, 3, 24, 0, 67, 31, 3, 24, 0, 67, 3, 32, 69, 33, 24, 0, 21, 3, 32, 69, 33, 24, 0, 67, 3, 34, 69, 35, 24, 0, 22, 3, 34, 69, 35, 24, 0, 21, 3, 34, 69, 35, 24, 0, 67, 3, 34, 35, 24, 0, 22, 3, 34, 35, 24, 0, 21, 3, 34, 35, 24, 0, 67, 0, 16, 0, 68, 0, 72, 0, 11, 0, 12, 0, 11, 12, 0, 13, 0, 11, 13, 0, 14, 0, 15, 0, 72, 0, 4, 0, 4, 0, 3, 0, 3, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 64, 65, 65, 68, 69, 70, 71, 72, 73, 76, 83, 93, 101, 107, 110, 111, 114, 120, 123, 131, 133, 139, 147, 147, 150, 156, 166, 166, 169, 181, 181, 184, 187, 187, 190, 197, 205, 212, 222, 222, 225, 228, 229, 231, 234, 235, 237, 239, 244, 246, 249, 252, 254, 256, 258, 261, 264, 269, 269, 272, 272, 275, 276, 277, 278, 279, 280, 281, 284, 284, 287, 290, 293 }; #endif #if YYDEBUG != 0 static const char * const yytname[] = { "$","error","$illegal.","T_ID","T_NUM", "T_CONST","T_STRUCT","T_UNION","T_ENUM","T_TYPEDEF","T_PROGRAM","T_UNSIGNED", "T_INT","T_HYPER","T_DOUBLE","T_QUADRUPLE","T_VOID","T_VERSION","T_SWITCH","T_CASE", "T_DEFAULT","T_OPAQUE","T_STRING","'='","';'","'{'","'}'","','","'('","')'", "':'","'*'","'['","']'","'<'","'>'","file","@1","definition","def_type","def_const", "def_enum","@2","comma_warn","def_struct","@3","def_union","@4","def_program", "@5","version_list","version_decl","@6","proc_list","proc_decl","union_taglist", "union_tag","union_caselist","union_case","union_decl","struct_decllist","struct_decl", "enum_taglist","enum_tag","enum_cnstag","declaration","type_or_void","type", "base_type","value","number","newid","id", NULL }; #endif static const short yyr1[] = { 0, 36, 37, 36, 38, 38, 38, 38, 38, 38, 39, 39, 40, 42, 41, 43, 43, 45, 44, 47, 46, 49, 48, 50, 50, 52, 51, 53, 53, 54, 55, 55, 56, 57, 57, 58, 58, 59, 59, 60, 60, 61, 62, 62, 63, 64, 64, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 66, 66, 67, 67, 68, 68, 68, 68, 68, 68, 68, 69, 69, 70, 71, 72 }; static const short yyr2[] = { 0, 0, 0, 3, 1, 1, 1, 1, 1, 1, 2, 3, 5, 0, 8, 0, 1, 0, 7, 0, 12, 0, 9, 1, 2, 0, 9, 1, 2, 8, 1, 2, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 1, 3, 1, 3, 1, 3, 3, 4, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1 }; static const short yydefact[] = { 1, 2, 0, 0, 0, 0, 0, 0, 0, 3, 7, 4, 5, 6, 8, 9, 72, 0, 0, 0, 0, 73, 0, 62, 63, 65, 67, 68, 0, 0, 10, 0, 60, 61, 0, 0, 17, 0, 13, 11, 64, 66, 0, 0, 0, 0, 21, 70, 0, 69, 0, 0, 0, 0, 0, 48, 0, 47, 0, 0, 0, 0, 12, 0, 39, 41, 0, 15, 42, 44, 46, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 23, 0, 40, 0, 16, 0, 0, 0, 57, 0, 56, 0, 0, 55, 0, 0, 0, 24, 18, 0, 43, 0, 45, 51, 54, 53, 50, 52, 25, 0, 19, 14, 0, 71, 0, 0, 59, 0, 27, 0, 58, 22, 0, 0, 0, 30, 0, 33, 0, 28, 0, 0, 36, 0, 31, 0, 34, 32, 37, 0, 0, 35, 20, 38, 0, 0, 26, 0, 0, 0, 29, 0, 0 }; static const short yydefgoto[] = { 1, 2, 9, 10, 11, 12, 52, 87, 13, 50, 14, 117, 15, 61, 81, 82, 114, 119, 120, 126, 127, 128, 129, 139, 63, 64, 67, 68, 69, 65, 121, 31, 32, 48, 116, 70, 33 }; static const short yypact[] = {-32768, 22, 149, 27, 27, 27, 27, 111, 27,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 2, 18, 42, 39, -32768, 124, 36,-32768,-32768,-32768,-32768, 64, 71,-32768, 4,-32768,-32768, 54, 68,-32768, 52,-32768,-32768,-32768, -32768, 19, -11, 10, 78,-32768,-32768, 65,-32768, 124, 25, 27, 68, 6,-32768, 15,-32768, 68, 17, 66, 75,-32768, 44,-32768,-32768, 90, 67,-32768,-32768, 82, 62, 87, 77, 89, 80, 73, 92, 83,-32768, 27, 7,-32768, 96,-32768, 99, 27, 103, 68, 106,-32768, 107,-32768, 110, 117,-32768, 118, 119, 120,-32768,-32768, 122,-32768, 136,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 157,-32768,-32768, 137,-32768, 138, 57,-32768, 72,-32768, 27,-32768,-32768, 68, 133, 43,-32768, 88,-32768, 141, -32768, 139, 135,-32768, 142,-32768, 144,-32768,-32768,-32768, 157, 137,-32768,-32768,-32768, 145, 143,-32768, 147, 157, 150,-32768, 171,-32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768, 94,-32768,-32768, 58,-32768, 47, -32768, 48,-32768,-32768, 115,-32768, 93,-32768, -7, 38, -46,-32768, -42, -96, -2, -27 }; #define YYLAST 180 static const short yytable[] = { 30, 17, 18, 19, 20, 66, 34, 44, 49, 21, 47, 71, 73, 55, 75, 39, 76, 78, 21, 47, 21, 47, 153, 56, 80, 35, 49, 49, 21, 49, 16, 49, 49, 98, 57, 45, 23, 24, 25, 26, 27, 72, 58, 36, 59, 146, 104, 21, 40, 41, 74, 53, 77, 54, 151, 23, 24, 25, 26, 27, 37, 49, 124, 125, 38, 28, 29, 42, 122, 135, 83, 21, 47, 122, 43, 21, 124, 125, 97, 46, 51, 60, 133, 23, 24, 25, 26, 27, 118, 62, 79, 21, 80, 85, 86, 89, 122, 49, 130, 23, 24, 25, 26, 27, 137, 88, 94, 124, 125, 28, 29, 90, 91, 92, 21, 93, 95, 22, 96, 132, 100, 140, 23, 24, 25, 26, 27, 21, 101, 103, 105, 106, 28, 29, 107, 23, 24, 25, 26, 27, 21, 108, 109, 111, 110, 28, 29, 112, 23, 24, 25, 26, 27, 118, 3, 4, 5, 6, 7, 8, 113, 115, 123, 134, 141, 143, 144, 142, 145, 148, 150, 154, 149, 136, 152, 99, 138, 131, 84, 102, 147 }; static const short yycheck[] = { 7, 3, 4, 5, 6, 51, 8, 3, 35, 3, 4, 53, 54, 24, 56, 22, 58, 59, 3, 4, 3, 4, 0, 34, 17, 23, 53, 54, 3, 56, 3, 58, 59, 26, 24, 31, 11, 12, 13, 14, 15, 35, 32, 25, 34, 141, 88, 3, 12, 13, 35, 32, 35, 34, 150, 11, 12, 13, 14, 15, 18, 88, 19, 20, 25, 21, 22, 3, 114, 26, 26, 3, 4, 119, 3, 3, 19, 20, 80, 25, 28, 3, 124, 11, 12, 13, 14, 15, 16, 24, 24, 3, 17, 3, 27, 33, 142, 124, 26, 11, 12, 13, 14, 15, 16, 23, 33, 19, 20, 21, 22, 24, 35, 24, 3, 35, 24, 6, 35, 121, 24, 128, 11, 12, 13, 14, 15, 3, 29, 26, 24, 24, 21, 22, 24, 11, 12, 13, 14, 15, 3, 24, 24, 23, 25, 21, 22, 25, 11, 12, 13, 14, 15, 16, 5, 6, 7, 8, 9, 10, 24, 4, 24, 30, 23, 30, 24, 28, 24, 24, 23, 0, 29, 126, 24, 81, 128, 119, 63, 86, 142 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/mit/andydevo/texport/6.3/sun4/etc/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* 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. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #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) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (from, to, count) char *from; char *to; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 184 "/mit/andydevo/texport/6.3/sun4/etc/bison.simple" int yyparse() { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* 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, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* 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) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif 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 */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (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 fprintf (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. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: #line 64 "parse.yy" { checkliterals (); ; break;} case 2: #line 65 "parse.yy" { checkliterals (); ; break;} case 3: #line 65 "parse.yy" { checkliterals (); ; break;} case 10: #line 77 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::TYPEDEF); *s->stypedef = yyvsp[0].decl; s->stypedef->id = getnewid (s->stypedef->id); ; break;} case 11: #line 84 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::TYPEDEF); *s->stypedef = yyvsp[0].decl; s->stypedef->type = strbuf ("struct ") << yyvsp[0].decl.type; s->stypedef->id = getnewid (s->stypedef->id); ; break;} case 12: #line 94 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::CONST); s->sconst->id = yyvsp[-3].str; s->sconst->val = yyvsp[-1].str; ; break;} case 13: #line 102 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::ENUM); s->senum->id = yyvsp[-1].str; ; break;} case 16: #line 111 "parse.yy" { yywarn ("comma not allowed at end of enum"); ; break;} case 17: #line 115 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::STRUCT); s->sstruct->id = yyvsp[-1].str; ; break;} case 19: #line 124 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::UNION); s->sunion->id = yyvsp[-6].str; s->sunion->tagtype = yyvsp[-3].str; s->sunion->tagid = yyvsp[-2].str; ; break;} case 21: #line 134 "parse.yy" { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::PROGRAM); s->sprogram->id = yyvsp[-1].str; ; break;} case 22: #line 140 "parse.yy" { rpc_sym *s = &symlist.back (); s->sprogram->val = yyvsp[-1].num; qsort (s->sprogram->vers.base (), s->sprogram->vers.size (), sizeof (rpc_vers), vers_compare); ; break;} case 25: #line 151 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_vers *rv = &s->sprogram->vers.push_back (); rv->id = yyvsp[-1].str; ; break;} case 26: #line 157 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_vers *rv = &s->sprogram->vers.back (); rv->val = yyvsp[-1].num; qsort (rv->procs.base (), rv->procs.size (), sizeof (rpc_proc), proc_compare); ; break;} case 29: #line 170 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_vers *rv = &s->sprogram->vers.back (); rpc_proc *rp = &rv->procs.push_back (); rp->id = yyvsp[-6].str; rp->val = yyvsp[-1].num; rp->arg = yyvsp[-4].str; rp->res = yyvsp[-7].str; ; break;} case 35: #line 191 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_utag *ut = &s->sunion->cases.push_back (); ut->tagvalid = false; ut->swval = yyvsp[-1].str; ; break;} case 36: #line 198 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_utag *ut = &s->sunion->cases.push_back (); ut->tagvalid = false; ; break;} case 37: #line 206 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_utag *ut = &s->sunion->cases.back (); ut->tagvalid = true; ut->tag = yyvsp[0].decl; ; break;} case 38: #line 213 "parse.yy" { rpc_sym *s = &symlist.back (); rpc_utag *ut = &s->sunion->cases.back (); ut->tagvalid = true; ut->tag.type = "void"; ut->tag.qual = rpc_decl::SCALAR; ; break;} case 41: #line 226 "parse.yy" { symlist.back ().sstruct->decls.push_back (yyvsp[0].decl); ; break;} case 42: #line 228 "parse.yy" {; break;} case 43: #line 229 "parse.yy" {; break;} case 44: #line 232 "parse.yy" { symlist.back ().senum->tags.push_back (yyvsp[0].cnst); ; break;} case 45: #line 234 "parse.yy" { yyval.cnst.id = yyvsp[-2].str; yyval.cnst.val = yyvsp[0].str; ; break;} case 46: #line 235 "parse.yy" { yyval.cnst.id = yyvsp[0].str; ; break;} case 47: #line 238 "parse.yy" { yyval.decl.id = yyvsp[-1].str; yyval.decl.type = yyvsp[-2].str; yyval.decl.qual = rpc_decl::SCALAR; ; break;} case 48: #line 240 "parse.yy" { yyval.decl.id = yyvsp[-1].str; yyval.decl.type = yyvsp[-2].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = "RPC_INFINITY"; yywarn ("strings require variable-length array declarations"); ; break;} case 49: #line 245 "parse.yy" { yyval.decl.id = yyvsp[-1].str; yyval.decl.type = yyvsp[-3].str; yyval.decl.qual = rpc_decl::PTR; ; break;} case 50: #line 247 "parse.yy" { yyval.decl.id = yyvsp[-4].str; yyval.decl.type = yyvsp[-5].str; yyval.decl.qual = rpc_decl::ARRAY; yyval.decl.bound = yyvsp[-2].str; ; break;} case 51: #line 250 "parse.yy" { yyval.decl.id = yyvsp[-4].str; yyval.decl.type = yyvsp[-5].str; yyval.decl.qual = rpc_decl::ARRAY; yyval.decl.bound = yyvsp[-2].str; ; break;} case 52: #line 253 "parse.yy" { yyval.decl.id = yyvsp[-4].str; yyval.decl.type = yyvsp[-5].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = yyvsp[-2].str; ; break;} case 53: #line 255 "parse.yy" { yyval.decl.id = yyvsp[-4].str; yyval.decl.type = yyvsp[-5].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = yyvsp[-2].str; ; break;} case 54: #line 257 "parse.yy" { yyval.decl.id = yyvsp[-4].str; yyval.decl.type = yyvsp[-5].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = yyvsp[-2].str; ; break;} case 55: #line 259 "parse.yy" { yyval.decl.id = yyvsp[-3].str; yyval.decl.type = yyvsp[-4].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = "RPC_INFINITY"; ; break;} case 56: #line 262 "parse.yy" { yyval.decl.id = yyvsp[-3].str; yyval.decl.type = yyvsp[-4].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = "RPC_INFINITY"; ; break;} case 57: #line 265 "parse.yy" { yyval.decl.id = yyvsp[-3].str; yyval.decl.type = yyvsp[-4].str; yyval.decl.qual = rpc_decl::VEC; yyval.decl.bound = "RPC_INFINITY"; ; break;} case 59: #line 269 "parse.yy" { yyval.str = "void"; ; break;} case 62: #line 275 "parse.yy" { yyval.str = "u_int32_t"; ; break;} case 63: #line 276 "parse.yy" { yyval.str = "int32_t"; ; break;} case 64: #line 277 "parse.yy" { yyval.str = "u_int32_t"; ; break;} case 65: #line 278 "parse.yy" { yyval.str = "int64_t"; ; break;} case 66: #line 279 "parse.yy" { yyval.str = "u_int64_t"; ; break;} case 67: #line 280 "parse.yy" { yyval.str = "double"; ; break;} case 68: #line 281 "parse.yy" { yyval.str = "quadruple"; ; break;} case 71: #line 287 "parse.yy" { yyval.num = strtoul (yyvsp[0].str, NULL, 0); ; break;} case 72: #line 290 "parse.yy" { yyval.str = getnewid (yyvsp[0].str); ; break;} case 73: #line 293 "parse.yy" { yyval.str = getid (yyvsp[0].str); ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 465 "/mit/andydevo/texport/6.3/sun4/etc/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #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 number reduced by. */ 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; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ 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; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif 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. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif 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; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 296 "parse.yy" symlist_t symlist; static int proc_compare (const void *_a, const void *_b) { rpc_proc *a = (rpc_proc *) _a; rpc_proc *b = (rpc_proc *) _b; return a->val < b->val ? -1 : a->val != b->val; } static int vers_compare (const void *_a, const void *_b) { rpc_vers *a = (rpc_vers *) _a; rpc_vers *b = (rpc_vers *) _b; return a->val < b->val ? -1 : a->val != b->val; } void checkliterals () { for (size_t i = 0; i < litq.size (); i++) { rpc_sym *s = &symlist.push_back (); s->settype (rpc_sym::LITERAL); *s->sliteral = litq[i]; } litq.clear (); } static str getnewid (str id) { if (ids[id]) yywarn ("redefinition of symbol " << id); else ids.insert (id); if (idprefix) id = idprefix << id; return id; } static str getid (str id) { if (idprefix && ids[id]) id = idprefix << id; return id; }