[insert project logo here (125x200px max)] Navigator Home Downloads Documentation Research News Forums Project Summary CVS repository Mailinglists Help Announcement Developer Please report any errors or ommissions you find to our `Help' mailinglist, or post a message in the Forums. Copyright and Licensing Information Snap is (c) Jonathan T. Moore, 1999-2002 and licensed under the GNU General Public License (GPL). All other parts of Splash are (c) Willem de Bruijn, 2002-2003 and licensed under the BSD Open Source License. All sourcecode is made publicly available. Acknowledgement Splash and the Splash website are hosted by SourceForge.net

Splash - Documentation SNMP Plus a Lightweight API for SNAP Handling             snap-1.1-wjdb/utils/snapparse.c Go to the documentation of this file. /* A Bison parser, made from snapparse.y by GNU bison 1.35. */ #define YYBISON 1 /* Identify Bison output. */ # define T_INTV 257 # define T_ADDRV 258 # define T_STRV 259 # define T_EXCV 260 # define T_FLOATV 261 # define T_MAIN 262 # define T_EXIT 263 # define T_PUSH 264 # define T_POP 265 # define T_POPI 266 # define T_PULL 267 # define T_EQ 268 # define T_EQI 269 # define T_PAJ 270 # define T_TPAJ 271 # define T_BEZ 272 # define T_BNE 273 # define T_STORE 274 # define T_JI 275 # define T_NEQ 276 # define T_NEQI 277 # define T_ADD 278 # define T_ADDI 279 # define T_SUB 280 # define T_SUBI 281 # define T_MULT 282 # define T_MULTI 283 # define T_DIV 284 # define T_DIVI 285 # define T_MOD 286 # define T_MODI 287 # define T_NEG 288 # define T_NOT 289 # define T_LNOT 290 # define T_AND 291 # define T_ANDI 292 # define T_OR 293 # define T_ORI 294 # define T_LSHL 295 # define T_LSHLI 296 # define T_RSHL 297 # define T_RSHLI 298 # define T_RSHA 299 # define T_RSHAI 300 # define T_SNET 301 # define T_SNETI 302 # define T_BCAST 303 # define T_BCASTI 304 # define T_ISX 305 # define T_GETRB 306 # define T_GETSRC 307 # define T_GETDST 308 # define T_GETSPT 309 # define T_HERE 310 # define T_ISHERE 311 # define T_ROUTE 312 # define T_RTDEV 313 # define T_SEND 314 # define T_HOP 315 # define T_FORW 316 # define T_FORWTO 317 # define T_DEMUX 318 # define T_DEMUXI 319 # define T_PRINT 320 # define T_GETLD 321 # define T_SETXH 322 # define T_RAISEX 323 # define T_PLUS 324 # define T_MINUS 325 # define T_LABEL 326 # define T_LABELV 327 # define T_PC 328 # define T_MKTUP 329 # define T_LEN 330 # define T_NTH 331 # define T_ISTUP 332 # define T_LPAREN 333 # define T_RPAREN 334 # define T_COMMA 335 # define T_SVCV 336 # define T_CALLS 337 # define T_GT 338 # define T_GEQ 339 # define T_LT 340 # define T_LEQ 341 # define T_GTI 342 # define T_GEQI 343 # define T_LTI 344 # define T_LEQI 345 # define T_DATA 346 # define T_DFORW 347 # define T_DFORWTO 348 # define T_DSEND 349 # define T_STACKEMPTY 350 # define T_STACKCOUNT 351 # define T_PULLSTACK 352 #line 1 "snapparse.y" /* snap-1.0. Copyright (C) 2000 by Jonathan T. Moore and Michael Hicks. * * snapparse.y : yacc parser for SNAP assembly language * * $Id: snapparse.c,v 1.3 2003/04/16 11:29:35 wdebruij Exp $ */ #include "../lib/config.h" #include <errno.h> #include <string.h> #include <stdio.h> #include <stdlib.h> #include <assert.h> #include <netinet/in.h> #include "../lib/bytecode.h" #include "../lib/dyncheck.h" #include "../lib/packet.h" #include "../lib/io.h" #include "../lib/memalloc.h" #include "labels.h" #include "../lib/d_printf.h" #include "../lib/list.h" extern packet_t *p; #define CHECK_CODE_OVERFLOW(p) \ if ((p)->pc >= (p)->code_max) { \ fprintf(stderr,"%s:%d: code overflow\n", \ __FILE__,__LINE__); \ fflush(stderr); \ exit(1); \ } int newho(buffer_t *b,char *file,int line); int newtup(list_t *vlist, char *file, int line); #ifdef SMALL_INSTRS OPCODE_T refine_op(OPCODE_T op, TAG_T vtag); #endif void yyerror(char *s); /* literal values from the lexer */ extern int value_int; extern uint32 value_addr; extern buffer_t value_str; extern int value_exc; extern float32 value_float; extern int noop; static char *label = NULL; #line 56 "snapparse.y" #ifndef YYSTYPE typedef union { void *ptr; int integer; } yystype; # define YYSTYPE yystype # define YYSTYPE_IS_TRIVIAL 1 #endif #ifndef YYDEBUG # define YYDEBUG 0 #endif #define YYFINAL 117 #define YYFLAG -32768 #define YYNTBASE 99 /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ #define YYTRANSLATE(x) ((unsigned)(x) <= 352 ? yytranslate[x] : 109) /* 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 }; #if YYDEBUG static const short yyprhs[] = { 0, 0, 3, 4, 6, 9, 12, 15, 18, 20, 22, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 201, 205, 207, 211, 215, 217, 219 }; static const short yyrhs[] = { 100, 99, 0, 0, 101, 0, 102, 108, 0, 103, 4, 0, 104, 5, 0, 105, 106, 0, 8, 0, 72, 0, 92, 106, 0, 9, 0, 11, 0, 14, 0, 22, 0, 24, 0, 26, 0, 28, 0, 30, 0, 32, 0, 34, 0, 35, 0, 36, 0, 37, 0, 39, 0, 41, 0, 43, 0, 45, 0, 51, 0, 52, 0, 53, 0, 54, 0, 55, 0, 67, 0, 68, 0, 69, 0, 56, 0, 57, 0, 58, 0, 59, 0, 60, 0, 61, 0, 62, 0, 63, 0, 64, 0, 66, 0, 76, 0, 78, 0, 47, 0, 49, 0, 84, 0, 85, 0, 86, 0, 87, 0, 95, 0, 93, 0, 94, 0, 96, 0, 97, 0, 98, 0, 13, 0, 20, 0, 16, 0, 17, 0, 18, 0, 19, 0, 12, 0, 33, 0, 38, 0, 40, 0, 42, 0, 44, 0, 46, 0, 21, 0, 75, 0, 77, 0, 50, 0, 65, 0, 48, 0, 82, 0, 83, 0, 10, 0, 15, 0, 23, 0, 25, 0, 27, 0, 29, 0, 31, 0, 88, 0, 89, 0, 90, 0, 91, 0, 108, 0, 4, 0, 7, 0, 5, 0, 6, 0, 79, 107, 80, 0, 106, 81, 107, 0, 106, 0, 108, 70, 108, 0, 108, 71, 108, 0, 74, 0, 3, 0, 73, 0 }; #endif #if YYDEBUG /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ static const short yyrline[] = { 0, 87, 88, 91, 96, 112, 127, 134, 152, 153, 154, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 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, 213, 214, 215, 216, 217, 218, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 239, 240, 241, 244, 245, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 261, 273, 288, 303, 311, 324, 335, 337, 340, 341, 342, 343, 344 }; #endif #if (YYDEBUG) || defined YYERROR_VERBOSE /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { "$", "error", "$undefined.", "T_INTV", "T_ADDRV", "T_STRV", "T_EXCV", "T_FLOATV", "T_MAIN", "T_EXIT", "T_PUSH", "T_POP", "T_POPI", "T_PULL", "T_EQ", "T_EQI", "T_PAJ", "T_TPAJ", "T_BEZ", "T_BNE", "T_STORE", "T_JI", "T_NEQ", "T_NEQI", "T_ADD", "T_ADDI", "T_SUB", "T_SUBI", "T_MULT", "T_MULTI", "T_DIV", "T_DIVI", "T_MOD", "T_MODI", "T_NEG", "T_NOT", "T_LNOT", "T_AND", "T_ANDI", "T_OR", "T_ORI", "T_LSHL", "T_LSHLI", "T_RSHL", "T_RSHLI", "T_RSHA", "T_RSHAI", "T_SNET", "T_SNETI", "T_BCAST", "T_BCASTI", "T_ISX", "T_GETRB", "T_GETSRC", "T_GETDST", "T_GETSPT", "T_HERE", "T_ISHERE", "T_ROUTE", "T_RTDEV", "T_SEND", "T_HOP", "T_FORW", "T_FORWTO", "T_DEMUX", "T_DEMUXI", "T_PRINT", "T_GETLD", "T_SETXH", "T_RAISEX", "T_PLUS", "T_MINUS", "T_LABEL", "T_LABELV", "T_PC", "T_MKTUP", "T_LEN", "T_NTH", "T_ISTUP", "T_LPAREN", "T_RPAREN", "T_COMMA", "T_SVCV", "T_CALLS", "T_GT", "T_GEQ", "T_LT", "T_LEQ", "T_GTI", "T_GEQI", "T_LTI", "T_LEQI", "T_DATA", "T_DFORW", "T_DFORWTO", "T_DSEND", "T_STACKEMPTY", "T_STACKCOUNT", "T_PULLSTACK", "instrs", "instr", "op0", "opint", "opaddr", "opstr", "op1", "value", "value_list", "int_expr", 0 }; #endif /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ static const short yyr1[] = { 0, 99, 99, 100, 100, 100, 100, 100, 100, 100, 100, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 103, 103, 103, 104, 104, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 106, 106, 106, 106, 106, 106, 107, 107, 108, 108, 108, 108, 108 }; /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ static const short yyr2[] = { 0, 2, 0, 1, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 3, 3, 1, 3, 3, 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[] = { 2, 8, 11, 81, 12, 66, 60, 13, 82, 62, 63, 64, 65, 61, 73, 14, 83, 15, 84, 16, 85, 17, 86, 18, 87, 19, 67, 20, 21, 22, 23, 68, 24, 69, 25, 70, 26, 71, 27, 72, 48, 78, 49, 76, 28, 29, 30, 31, 32, 36, 37, 38, 39, 40, 41, 42, 43, 44, 77, 45, 33, 34, 35, 9, 74, 46, 75, 47, 79, 80, 50, 51, 52, 53, 88, 89, 90, 91, 0, 55, 56, 54, 57, 58, 59, 2, 3, 0, 0, 0, 0, 103, 93, 95, 96, 94, 104, 102, 0, 10, 92, 1, 4, 5, 6, 7, 99, 0, 0, 0, 0, 97, 100, 101, 98, 0, 0, 0 }; static const short yydefgoto[] = { 101, 85, 86, 87, 88, 89, 90, 106, 107, 100 }; static const short yypact[] = { -8,-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,-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,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 88,-32768, -32768,-32768,-32768,-32768,-32768, -8,-32768, 59, 67, 58, 88,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 88,-32768, -5,-32768, -5,-32768,-32768,-32768, -9, -7, 59, 59, 88,-32768,-32768,-32768,-32768, 98, 99,-32768 }; static const short yypgoto[] = { 100,-32768,-32768,-32768,-32768,-32768,-32768, 19, -6, 9 }; #define YYLAST 167 static const short yytable[] = { 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, 91, 104, 63, 108, 109, 64, 65, 66, 67, 103, 110, 111, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 91, 92, 93, 94, 95, 102, 99, 116, 117, 115, 0, 0, 0, 114, 0, 0, 0, 0, 105, 0, 0, 0, 0, 0, 0, 0, 112, 113, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 96, 97, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 96, 97, 0, 0, 0, 0, 98 }; static const short yycheck[] = { 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, 3, 5, 72, 70, 71, 75, 76, 77, 78, 4, 81, 80, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 3, 4, 5, 6, 7, 87, 78, 0, 0, 0, -1, -1, -1, 110, -1, -1, -1, -1, 90, -1, -1, -1, -1, -1, -1, -1, 108, 109, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 73, 74, -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, 73, 74, -1, -1, -1, -1, 79 }; /* -*-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. */ #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 # if defined (__STDC__) || defined (__cplusplus) # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # endif # define YYSTACK_ALLOC malloc # define YYSTACK_FREE free # endif #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ #if (! defined (yyoverflow) \ && (! defined (__cplusplus) \ || (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) /* 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 /* 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_MAX; \ yyptr += yynewbytes / sizeof (*yyptr); \ } \ while (0) #endif #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif #if ! defined (YYSIZE_T) && defined (size_t) # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) # if defined (__STDC__) || defined (__cplusplus) # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) # define YYSIZE_T unsigned int #endif #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) #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 # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #if YYMAXDEPTH == 0 # undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif  #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) # define yystrlen strlen # else /* Return the length of YYSTR. */ static YYSIZE_T # if defined (__STDC__) || defined (__cplusplus) yystrlen (const char *yystr) # else yystrlen (yystr) const char *yystr; # endif { register const char *yys = yystr; while (*yys++ != '\0') continue; return yys - yystr - 1; } # endif # endif # ifndef yystpcpy # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ static char * # if defined (__STDC__) || defined (__cplusplus) yystpcpy (char *yydest, const char *yysrc) # else yystpcpy (yydest, yysrc) char *yydest; const char *yysrc; # endif { register char *yyd = yydest; register const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif #endif  #line 315 "/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 # if defined (__STDC__) || defined (__cplusplus) # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM # define YYPARSE_PARAM_DECL # else # define YYPARSE_PARAM_ARG YYPARSE_PARAM # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; # endif #else /* !YYPARSE_PARAM */ # define YYPARSE_PARAM_ARG # define YYPARSE_PARAM_DECL #endif /* !YYPARSE_PARAM */ /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ # ifdef YYPARSE_PARAM int yyparse (void *); # else int 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 */ int 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, `yyvs': related to semantic values, `yyls': related to locations. 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; /* The semantic value stack. */ YYSTYPE yyvsa[YYINITDEPTH]; 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")); 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; yyvsp = yyvs; #if YYLSP_NEEDED yylsp = yyls; #endif goto yysetstate; /*------------------------------------------------------------. | yynewstate -- Push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yyssp++; 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; #ifdef yyoverflow { /* 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; /* 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 */ # ifndef YYSTACK_RELOCATE goto yyoverflowlab; # else /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { short *yyss1 = yyss; union yyalloc *yyptr = (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; YYSTACK_RELOCATE (yyss); YYSTACK_RELOCATE (yyvs); # if YYLSP_NEEDED YYSTACK_RELOCATE (yyls); # endif # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif #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; } YYDPRINTF ((stderr, "Entering state %d\n", yystate)); goto yybackup; /*-----------. | 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) { 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. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* 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 87 "snapparse.y" { yyval.integer = yyvsp[0].integer; } break; case 2: #line 88 "snapparse.y" { yyval.integer = 0; } break; case 3: #line 91 "snapparse.y" { CHECK_CODE_OVERFLOW(p); SET_OP(*p->pc,yyvsp[0].integer); p->pc++; noop++; } break; case 4: #line 96 "snapparse.y" { CHECK_CODE_OVERFLOW(p); if ((yyvsp[0].integer > MAX_VINT) || (yyvsp[0].integer < MIN_VINT)) { fprintf(stderr, "%s:%d: int literal %d out of bounds (%d,%d)\n", __FILE__,__LINE__,yyvsp[0].integer,MIN_VINT,MAX_VINT); fflush(stderr); exit(1); } if (label != NULL) { register_label_use(label,p->pc); label = NULL; } SET_OP(*p->pc,yyvsp[-1].integer); SET_LIT(*p->pc,INTV,yyvsp[0].integer); p->pc++; } break; case 5: #line 112 "snapparse.y" { #ifdef ADDR_IN_HEAP buffer_t b = { sizeof(value_addr), (char *)&value_addr }; int offs = newho(&b,__FILE__,__LINE__); #endif CHECK_CODE_OVERFLOW(p); SET_OP(*p->pc,yyvsp[-1].integer); #ifdef ADDR_IN_HEAP SET_LIT(*p->pc,ADDRV,offs); #else SET_LIT(*p->pc,ADDRV,value_addr); #endif p->pc++; } break; case 6: #line 127 "snapparse.y" { int offs = newho(&value_str,__FILE__,__LINE__); free(value_str.s); CHECK_CODE_OVERFLOW(p); SET_OP(*p->pc,yyvsp[-1].integer); SET_LIT(*p->pc,STRV,offs); p->pc++; } break; case 7: #line 134 "snapparse.y" { value_t *v = (value_t *)yyvsp[0].ptr; int lit; CHECK_CODE_OVERFLOW(p); if (label != NULL) { register_label_use(label,p->pc); label = NULL; } #ifndef SMALL_INSTRS SET_OP(*p->pc,yyvsp[-1].integer); #else { OPCODE_T op = refine_op(yyvsp[-1].integer, GET_TAG(*v)); SET_OP(*p->pc,op); } #endif lit = GET_INT(*v); /* assumes the same as GET_* */ SET_LIT(*p->pc,GET_TAG(*v),lit); p->pc++; } break; case 8: #line 152 "snapparse.y" { p->hdr->entry_point = htons(p->pc - p->code_min); } break; case 9: #line 153 "snapparse.y" { register_label_def(value_str.s,p->pc); } break; case 10: #line 154 "snapparse.y" { value_t *v = (value_t *)yyvsp[0].ptr; if (p->sp >= p->stack_max) { fprintf(stderr,"%s:%d: stack overflow\n", __FILE__,__LINE__); fflush(stderr); exit(1); } if (label != NULL) { register_label_use(label,p->sp); label = NULL; } COPY_VAL(*p->sp,*v); p->sp++; } break; case 11: #line 170 "snapparse.y" { yyval.integer = (int)EXIT; } break; case 12: #line 171 "snapparse.y" { yyval.integer = (int)POP; } break; case 13: #line 172 "snapparse.y" { yyval.integer = (int)EQ; } break; case 14: #line 173 "snapparse.y" { yyval.integer = (int)NEQ; } break; case 15: #line 174 "snapparse.y" { yyval.integer = (int)ADD; } break; case 16: #line 175 "snapparse.y" { yyval.integer = (int)SUB; } break; case 17: #line 176 "snapparse.y" { yyval.integer = (int)MULT; } break; case 18: #line 177 "snapparse.y" { yyval.integer = (int)DIV; } break; case 19: #line 178 "snapparse.y" { yyval.integer = (int)MOD; } break; case 20: #line 179 "snapparse.y" { yyval.integer = (int)NEG; } break; case 21: #line 180 "snapparse.y" { yyval.integer = (int)NOT; } break; case 22: #line 181 "snapparse.y" { yyval.integer = (int)LNOT; } break; case 23: #line 182 "snapparse.y" { yyval.integer = (int)AND; } break; case 24: #line 183 "snapparse.y" { yyval.integer = (int)OR; } break; case 25: #line 184 "snapparse.y" { yyval.integer = (int)LSHL; } break; case 26: #line 185 "snapparse.y" { yyval.integer = (int)RSHL; } break; case 27: #line 186 "snapparse.y" { yyval.integer = (int)RSHA; } break; case 28: #line 187 "snapparse.y" { yyval.integer = (int)ISX; } break; case 29: #line 188 "snapparse.y" { yyval.integer = (int)GETRB; } break; case 30: #line 189 "snapparse.y" { yyval.integer = (int)GETSRC; } break; case 31: #line 190 "snapparse.y" { yyval.integer = (int)GETDST; } break; case 32: #line 191 "snapparse.y" { yyval.integer = (int)GETSPT; } break; case 33: #line 192 "snapparse.y" { yyval.integer = (int)GETLD; } break; case 34: #line 193 "snapparse.y" { yyval.integer = (int)SETXH; } break; case 35: #line 194 "snapparse.y" { yyval.integer = (int)RAISEX; } break; case 36: #line 195 "snapparse.y" { yyval.integer = (int)HERE; } break; case 37: #line 196 "snapparse.y" { yyval.integer = (int)ISHERE; } break; case 38: #line 197 "snapparse.y" { yyval.integer = (int)ROUTE; } break; case 39: #line 198 "snapparse.y" { yyval.integer = (int)RTDEV; } break; case 40: #line 199 "snapparse.y" { yyval.integer = (int)SEND; } break; case 41: #line 200 "snapparse.y" { yyval.integer = (int)HOP; } break; case 42: #line 201 "snapparse.y" { yyval.integer = (int)FORW; } break; case 43: #line 202 "snapparse.y" { yyval.integer = (int)FORWTO; } break; case 44: #line 203 "snapparse.y" { yyval.integer = (int)DEMUX; } break; case 45: #line 204 "snapparse.y" { yyval.integer = (int)PRINT; } break; case 46: #line 205 "snapparse.y" { yyval.integer = (int)LEN; } break; case 47: #line 206 "snapparse.y" { yyval.integer = (int)ISTUP; } break; case 48: #line 207 "snapparse.y" { yyval.integer = (int)SNET; } break; case 49: #line 208 "snapparse.y" { yyval.integer = (int)BCAST; } break; case 50: #line 209 "snapparse.y" { yyval.integer = (int)GT; } break; case 51: #line 210 "snapparse.y" { yyval.integer = (int)GEQ; } break; case 52: #line 211 "snapparse.y" { yyval.integer = (int)LT; } break; case 53: #line 212 "snapparse.y" { yyval.integer = (int)LEQ; } break; case 54: #line 213 "snapparse.y" { yyval.integer = (int)DSEND; } break; case 55: #line 214 "snapparse.y" { yyval.integer = (int)DFORW; } break; case 56: #line 215 "snapparse.y" { yyval.integer = (int)DFORWTO; } break; case 57: #line 216 "snapparse.y" { yyval.integer = (int)STACKEMPTY; } break; case 58: #line 217 "snapparse.y" { yyval.integer = (int)STACKCOUNT; } break; case 59: #line 218 "snapparse.y" { yyval.integer = (int)PULLSTACK; } break; case 60: #line 221 "snapparse.y" { yyval.integer = (int)PULL; } break; case 61: #line 222 "snapparse.y" { yyval.integer = (int)STORE; } break; case 62: #line 223 "snapparse.y" { yyval.integer = (int)PAJ; } break; case 63: #line 224 "snapparse.y" { yyval.integer = (int)TPAJ; } break; case 64: #line 225 "snapparse.y" { yyval.integer = (int)BEZ; } break; case 65: #line 226 "snapparse.y" { yyval.integer = (int)BNE; } break; case 66: #line 227 "snapparse.y" { yyval.integer = (int)POPI; } break; case 67: #line 228 "snapparse.y" { yyval.integer = (int)MODI; } break; case 68: #line 229 "snapparse.y" { yyval.integer = (int)ANDI; } break; case 69: #line 230 "snapparse.y" { yyval.integer = (int)ORI; } break; case 70: #line 231 "snapparse.y" { yyval.integer = (int)LSHLI; } break; case 71: #line 232 "snapparse.y" { yyval.integer = (int)RSHLI; } break; case 72: #line 233 "snapparse.y" { yyval.integer = (int)RSHAI; } break; case 73: #line 234 "snapparse.y" { yyval.integer = (int)JI; } break; case 74: #line 235 "snapparse.y" { yyval.integer = (int)MKTUP; } break; case 75: #line 236 "snapparse.y" { yyval.integer = (int)NTH; } break; case 76: #line 239 "snapparse.y" { yyval.integer = (int)BCASTI; } break; case 77: #line 240 "snapparse.y" { yyval.integer = (int)DEMUXI; } break; case 78: #line 241 "snapparse.y" { yyval.integer = (int)SNETI; } break; case 79: #line 244 "snapparse.y" { yyval.integer = (int)SVCV; } break; case 80: #line 245 "snapparse.y" { yyval.integer = (int)CALLS; } break; case 81: #line 248 "snapparse.y" { yyval.integer = (int)PUSH; } break; case 82: #line 249 "snapparse.y" { yyval.integer = (int)EQI; } break; case 83: #line 250 "snapparse.y" { yyval.integer = (int)NEQI; } break; case 84: #line 251 "snapparse.y" { yyval.integer = (int)ADDI; } break; case 85: #line 252 "snapparse.y" { yyval.integer = (int)SUBI; } break; case 86: #line 253 "snapparse.y" { yyval.integer = (int)MULTI; } break; case 87: #line 254 "snapparse.y" { yyval.integer = (int)DIVI; } break; case 88: #line 255 "snapparse.y" { yyval.integer = (int)GTI; } break; case 89: #line 256 "snapparse.y" { yyval.integer = (int)GEQI; } break; case 90: #line 257 "snapparse.y" { yyval.integer = (int)LTI; } break; case 91: #line 258 "snapparse.y" { yyval.integer = (int)LEQI; } break; case 92: #line 261 "snapparse.y" { value_t *_v; memalloc(_v,value_t *,sizeof(value_t)); if ((yyvsp[0].integer > MAX_VINT) || (yyvsp[0].integer < MIN_VINT)) { fprintf(stderr, "%s:%d: int literal %d out of bounds (%d,%d)\n", __FILE__,__LINE__,yyvsp[0].integer,MIN_VINT,MAX_VINT); fflush(stderr); exit(1); } SET_TAG(*_v,INTV); SET_INT(*_v,yyvsp[0].integer); yyval.ptr = (void *)_v; } break; case 93: #line 273 "snapparse.y" { value_t *_v; #ifdef ADDR_IN_HEAP buffer_t b = { sizeof(value_addr), (char *)&value_addr }; int offs = newho(&b,__FILE__,__LINE__); #endif memalloc(_v,value_t *,sizeof(value_t)); SET_TAG(*_v,ADDRV); #ifndef ADDR_IN_HEAP SET_ADDR(*_v,value_addr,0 /* dummy arg */); #else SET_OFFS(*_v,offs); #endif yyval.ptr = (void *)_v; } break; case 94: #line 288 "snapparse.y" { value_t *_v; #ifdef ADDR_IN_HEAP buffer_t b = { sizeof(value_float), (char *)&value_float }; int offs = newho(&b,__FILE__,__LINE__); #endif memalloc(_v,value_t *,sizeof(value_t)); SET_TAG(*_v,FLOATV); #ifndef ADDR_IN_HEAP SET_FLOAT(*_v,value_float,0 /* dummy arg */); #else SET_OFFS(*_v,offs); #endif yyval.ptr = (void *)_v; } break; case 95: #line 303 "snapparse.y" { value_t *_v; int offs = newho(&value_str,__FILE__,__LINE__); /* free(value_str.s); */ memalloc(_v,value_t *,sizeof(value_t)); SET_TAG(*_v,STRV); SET_OFFS(*_v,offs); yyval.ptr = (void *)_v; } break; case 96: #line 311 "snapparse.y" { value_t *_v; if ((value_exc > MAX_VINT) || (value_exc < 0)) { fprintf(stderr, "%s:%d: int literal %d out of bounds (%d,%d)\n", __FILE__,__LINE__,value_exc,0,MAX_VINT); fflush(stderr); exit(1); } memalloc(_v,value_t *,sizeof(value_t)); SET_TAG(*_v,EXCV); SET_INT(*_v,value_exc); yyval.ptr = (void *)_v; } break; case 97: #line 325 "snapparse.y" { value_t *_v; int offs = newtup((list_t *)yyvsp[-1].ptr,__FILE__,__LINE__); free_list(yyvsp[-1].ptr); memalloc(_v,value_t *,sizeof(value_t)); SET_TAG(*_v,TUPLEV); SET_OFFS(*_v,offs); yyval.ptr = (void *)_v; } break; case 98: #line 336 "snapparse.y" { yyval.ptr = (void *)cons(yyvsp[-2].ptr,(list_t *)yyvsp[0].ptr); } break; case 99: #line 337 "snapparse.y" { yyval.ptr = (void *)cons(yyvsp[0].ptr,(list_t *)0); } break; case 100: #line 340 "snapparse.y" { yyval.integer = yyvsp[-2].integer + yyvsp[0].integer; } break; case 101: #line 341 "snapparse.y" { yyval.integer = yyvsp[-2].integer - yyvsp[0].integer; } break; case 102: #line 342 "snapparse.y" { yyval.integer = p->pc - p->code_min; } break; case 103: #line 343 "snapparse.y" { yyval.integer = value_int; } break; case 104: #line 344 "snapparse.y" { yyval.integer = 0; label = value_str.s; } break; } #line 705 "/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 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 | `------------------------------------*/ yyerrlab: /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; yycount = 0; /* Start YYX at -YYN if negative to avoid negative indexes in 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) { yycount = 0; 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); yyp = yystpcpy (yyp, yytname[yyx]); yycount++; } } yyerror (yymsg); 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; YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; #if YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturn; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturn; /*---------------------------------------------. | yyoverflowab -- parser overflow comes here. | `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif return yyresult; } #line 347 "snapparse.y" int newho(buffer_t *b,char *file,int line) { int sizeb = sizeof(heap_obj) + b->lenb; int offs; heap_obj *ho; if ((sizeb & 0x3) != 0) { sizeb = (sizeb & ~0x3) + 4; } if (((p->h_alloc_ptr + sizeb) > p->heap_max) || (b->lenb > MAX_HEAPOBJ_SZ)) { fprintf(stderr,"%s:%d: heap alloc failed\n",file,line); fflush(stderr); exit(1); } ho = (heap_obj *)(p->h_alloc_ptr); offs = p->h_alloc_ptr - p->heap_min; d_printf(150,"%s:%d: alloc %d-string at @%#x, offs = %d\n", __FILE__,__LINE__, b->lenb, p->h_alloc_ptr, offs); p->h_alloc_ptr = p->h_alloc_ptr + sizeb; bzero(ho,sizeb); ho->len = b->lenb; ho->flag = 0; memcpy((char *)(&(ho->s)),b->s,b->lenb); return(offs); } int newtup(list_t *list,char *file,int line) { int len = length_list(list); int lenb = len * sizeof(value_t); int sizeb = sizeof(heap_obj) + lenb; int offs; heap_obj *ho; value_t *varr; list_t *iter; assert ((sizeb & 0x3) == 0); if (((p->h_alloc_ptr + sizeb) > p->heap_max) || (lenb > MAX_HEAPOBJ_SZ)) { fprintf(stderr,"%s:%d: heap alloc failed\n",file,line); fflush(stderr); exit(1); } ho = (heap_obj *)(p->h_alloc_ptr); offs = p->h_alloc_ptr - p->heap_min; d_printf(150,"%s:%d: alloc %d-tuple at @%#x, offs = %d\n", __FILE__,__LINE__, lenb / sizeof(value_t), p->h_alloc_ptr, offs); p->h_alloc_ptr = p->h_alloc_ptr + sizeb; bzero(ho,sizeb); ho->len = lenb; ho->flag = 1; varr = (value_t *)ho->s; for (iter = list; iter != NULL; iter = iter->next, varr++) { *varr = *((value_t *)iter->v); } return(offs); } #ifdef SMALL_INSTRS OPCODE_T refine_op(OPCODE_T op, TAG_T vtag) { switch (op) { case PUSH: switch (vtag) { case INTV: op = PINT; break; case ADDRV: op = PADDR; break; case STRV: op = PSTR; break; case EXCV: op = PEXC; break; case TUPLEV: op = PTUP; break; case FLOATV: op = PFLT; break; default: fprintf(stderr,"%s:%d: invalid tag %d\n",__FILE__,__LINE__,vtag); exit(1); } break; case EQI: switch (vtag) { case INTV: op = EQINT; break; case ADDRV: op = EQADR; break; case STRV: op = EQSTR; break; case EXCV: op = EQEXC; break; case TUPLEV: op = EQTUP; break; case FLOATV: op = EQFLT; break; default: fprintf(stderr,"%s:%d: invalid tag %d\n",__FILE__,__LINE__,vtag); exit(1); } break; case NEQI: switch (vtag) { case INTV: op = NQINT; break; case ADDRV: op = NQADR; break; case STRV: op = NQSTR; break; case EXCV: op = NQEXC; break; case TUPLEV: op = NQTUP; break; case FLOATV: op = NQFLT; break; default: fprintf(stderr,"%s:%d: invalid tag %d\n",__FILE__,__LINE__,vtag); exit(1); } break; case ADDI: switch (vtag) { case INTV: break; case FLOATV: op = FADDI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for ADDI\n", __FILE__,__LINE__,vtag); break; } break; case SUBI: switch (vtag) { case INTV: break; case FLOATV: op = FSUBI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for SUBI\n", __FILE__,__LINE__,vtag); break; } break; case MULTI: switch (vtag) { case INTV: break; case FLOATV: op = FMULI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for MULTI\n", __FILE__,__LINE__,vtag); break; } break; case DIVI: switch (vtag) { case INTV: break; case FLOATV: op = FDIVI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for DIVI\n", __FILE__,__LINE__,vtag); break; } break; case GTI: switch (vtag) { case INTV: break; case FLOATV: op = FGTI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for GTI\n", __FILE__,__LINE__,vtag); break; } break; case GEQI: switch (vtag) { case INTV: break; case FLOATV: op = FGEQI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for GEQI\n", __FILE__,__LINE__,vtag); break; } break; case LTI: switch (vtag) { case INTV: break; case FLOATV: op = FLTI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for LTI\n", __FILE__,__LINE__,vtag); break; } break; case LEQI: switch (vtag) { case INTV: break; case FLOATV: op = FLEQI; break; default: fprintf(stderr,"%s:%d: invalid tag %d for LEQI\n", __FILE__,__LINE__,vtag); break; } break; default: fprintf(stderr,"%s:%d: invalid opcode %d\n",__FILE__,__LINE__,op); exit(1); } return op; } #endif void yyerror(char *s) { fprintf(stderr,s); }