From fca74d4bc3569506a6659880a89aa009dc11f552 Mon Sep 17 00:00:00 2001 From: wukong Date: Mon, 23 Nov 2015 17:48:48 +0100 Subject: moon-abe cleanup Change-Id: Ie1259856db03f0b9e80de3e967ec6bd1f03191b3 --- moon-abe/cpabe-0.11/policy_lang.c | 2164 ------------------------------------- 1 file changed, 2164 deletions(-) delete mode 100644 moon-abe/cpabe-0.11/policy_lang.c (limited to 'moon-abe/cpabe-0.11/policy_lang.c') diff --git a/moon-abe/cpabe-0.11/policy_lang.c b/moon-abe/cpabe-0.11/policy_lang.c deleted file mode 100644 index 9bc646d8..00000000 --- a/moon-abe/cpabe-0.11/policy_lang.c +++ /dev/null @@ -1,2164 +0,0 @@ -/* A Bison parser, made by GNU Bison 3.0.2. */ - -/* Bison implementation for Yacc-like parsers in C - - Copyright (C) 1984, 1989-1990, 2000-2013 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 3 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, see . */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - -/* C LALR(1) parser skeleton 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 - -/* Bison version. */ -#define YYBISON_VERSION "3.0.2" - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 0 - -/* Push parsers. */ -#define YYPUSH 0 - -/* Pull parsers. */ -#define YYPULL 1 - - - - -/* Copy the first part of user declarations. */ -#line 1 "policy_lang.y" /* yacc.c:339 */ - -#include -#include -#include -#include -#include -#include -#include - -#include "common.h" -#include "policy_lang.h" - -typedef struct -{ - uint64_t value; - int bits; /* zero if this is a flexint */ -} -sized_integer_t; - -typedef struct -{ - int k; /* one if leaf, otherwise threshold */ - char* attr; /* attribute string if leaf, otherwise null */ - GPtrArray* children; /* pointers to bswabe_policy_t's, len == 0 for leaves */ -} -cpabe_policy_t; - -cpabe_policy_t* final_policy = 0; - -int yylex(); -void yyerror( const char* s ); -sized_integer_t* expint( uint64_t value, uint64_t bits ); -sized_integer_t* flexint( uint64_t value ); -cpabe_policy_t* leaf_policy( char* attr ); -cpabe_policy_t* kof2_policy( int k, cpabe_policy_t* l, cpabe_policy_t* r ); -cpabe_policy_t* kof_policy( int k, GPtrArray* list ); -cpabe_policy_t* eq_policy( sized_integer_t* n, char* attr ); -cpabe_policy_t* lt_policy( sized_integer_t* n, char* attr ); -cpabe_policy_t* gt_policy( sized_integer_t* n, char* attr ); -cpabe_policy_t* le_policy( sized_integer_t* n, char* attr ); -cpabe_policy_t* ge_policy( sized_integer_t* n, char* attr ); - -#line 109 "policy_lang.c" /* yacc.c:339 */ - -# ifndef YY_NULLPTR -# if defined __cplusplus && 201103L <= __cplusplus -# define YY_NULLPTR nullptr -# else -# define YY_NULLPTR 0 -# endif -# endif - -/* Enabling verbose error messages. */ -#ifdef YYERROR_VERBOSE -# undef YYERROR_VERBOSE -# define YYERROR_VERBOSE 1 -#else -# define YYERROR_VERBOSE 0 -#endif - - -/* Debug traces. */ -#ifndef YYDEBUG -# define YYDEBUG 0 -#endif -#if YYDEBUG -extern int yydebug; -#endif - -/* Token type. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - enum yytokentype - { - TAG = 258, - INTLIT = 259, - OR = 260, - AND = 261, - OF = 262, - LEQ = 263, - GEQ = 264 - }; -#endif - -/* Value type. */ -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE YYSTYPE; -union YYSTYPE -{ -#line 45 "policy_lang.y" /* yacc.c:355 */ - - char* str; - uint64_t nat; - sized_integer_t* sint; - cpabe_policy_t* tree; - GPtrArray* list; - -#line 164 "policy_lang.c" /* yacc.c:355 */ -}; -# define YYSTYPE_IS_TRIVIAL 1 -# define YYSTYPE_IS_DECLARED 1 -#endif - - -extern YYSTYPE yylval; - -int yyparse (void); - - - -/* Copy the second part of user declarations. */ - -#line 179 "policy_lang.c" /* yacc.c:358 */ - -#ifdef short -# undef short -#endif - -#ifdef YYTYPE_UINT8 -typedef YYTYPE_UINT8 yytype_uint8; -#else -typedef unsigned char yytype_uint8; -#endif - -#ifdef YYTYPE_INT8 -typedef YYTYPE_INT8 yytype_int8; -#else -typedef signed char yytype_int8; -#endif - -#ifdef YYTYPE_UINT16 -typedef YYTYPE_UINT16 yytype_uint16; -#else -typedef unsigned short int yytype_uint16; -#endif - -#ifdef YYTYPE_INT16 -typedef YYTYPE_INT16 yytype_int16; -#else -typedef short int yytype_int16; -#endif - -#ifndef YYSIZE_T -# ifdef __SIZE_TYPE__ -# define YYSIZE_T __SIZE_TYPE__ -# elif defined size_t -# define YYSIZE_T size_t -# elif ! defined YYSIZE_T -# include /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# else -# define YYSIZE_T unsigned int -# endif -#endif - -#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) - -#ifndef YY_ -# if defined YYENABLE_NLS && YYENABLE_NLS -# if ENABLE_NLS -# include /* INFRINGES ON USER NAME SPACE */ -# define YY_(Msgid) dgettext ("bison-runtime", Msgid) -# endif -# endif -# ifndef YY_ -# define YY_(Msgid) Msgid -# endif -#endif - -#ifndef YY_ATTRIBUTE -# if (defined __GNUC__ \ - && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ - || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C -# define YY_ATTRIBUTE(Spec) __attribute__(Spec) -# else -# define YY_ATTRIBUTE(Spec) /* empty */ -# endif -#endif - -#ifndef YY_ATTRIBUTE_PURE -# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) -#endif - -#ifndef YY_ATTRIBUTE_UNUSED -# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) -#endif - -#if !defined _Noreturn \ - && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112) -# if defined _MSC_VER && 1200 <= _MSC_VER -# define _Noreturn __declspec (noreturn) -# else -# define _Noreturn YY_ATTRIBUTE ((__noreturn__)) -# endif -#endif - -/* Suppress unused-variable warnings by "using" E. */ -#if ! defined lint || defined __GNUC__ -# define YYUSE(E) ((void) (E)) -#else -# define YYUSE(E) /* empty */ -#endif - -#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ -/* Suppress an incorrect diagnostic about yylval being uninitialized. */ -# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ - _Pragma ("GCC diagnostic push") \ - _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ - _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") -# define YY_IGNORE_MAYBE_UNINITIALIZED_END \ - _Pragma ("GCC diagnostic pop") -#else -# define YY_INITIAL_VALUE(Value) Value -#endif -#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN -# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN -# define YY_IGNORE_MAYBE_UNINITIALIZED_END -#endif -#ifndef YY_INITIAL_VALUE -# define YY_INITIAL_VALUE(Value) /* Nothing. */ -#endif - - -#if ! defined yyoverflow || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# ifdef YYSTACK_USE_ALLOCA -# if YYSTACK_USE_ALLOCA -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# elif defined __BUILTIN_VA_ARG_INCR -# include /* INFRINGES ON USER NAME SPACE */ -# elif defined _AIX -# define YYSTACK_ALLOC __alloca -# elif defined _MSC_VER -# include /* INFRINGES ON USER NAME SPACE */ -# define alloca _alloca -# else -# define YYSTACK_ALLOC alloca -# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS -# include /* INFRINGES ON USER NAME SPACE */ - /* Use EXIT_SUCCESS as a witness for stdlib.h. */ -# ifndef EXIT_SUCCESS -# define EXIT_SUCCESS 0 -# endif -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's 'empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) -# ifndef YYSTACK_ALLOC_MAXIMUM - /* The OS might guarantee only one guard page at the bottom of the stack, - and a page size can be as small as 4096 bytes. So we cannot safely - invoke alloca (N) if N exceeds 4096. Use a slightly smaller number - to allow for a few compiler-allocated temporary stack slots. */ -# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ -# endif -# else -# define YYSTACK_ALLOC YYMALLOC -# define YYSTACK_FREE YYFREE -# ifndef YYSTACK_ALLOC_MAXIMUM -# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM -# endif -# if (defined __cplusplus && ! defined EXIT_SUCCESS \ - && ! ((defined YYMALLOC || defined malloc) \ - && (defined YYFREE || defined free))) -# include /* INFRINGES ON USER NAME SPACE */ -# ifndef EXIT_SUCCESS -# define EXIT_SUCCESS 0 -# endif -# endif -# ifndef YYMALLOC -# define YYMALLOC malloc -# if ! defined malloc && ! defined EXIT_SUCCESS -void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifndef YYFREE -# define YYFREE free -# if ! defined free && ! defined EXIT_SUCCESS -void free (void *); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# endif -#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ - - -#if (! defined yyoverflow \ - && (! defined __cplusplus \ - || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) - -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - yytype_int16 yyss_alloc; - YYSTYPE yyvs_alloc; -}; - -/* 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 (yytype_int16) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAXIMUM) - -# define YYCOPY_NEEDED 1 - -/* 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_alloc, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ - Stack = &yyptr->Stack_alloc; \ - yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (0) - -#endif - -#if defined YYCOPY_NEEDED && YYCOPY_NEEDED -/* Copy COUNT objects from SRC to DST. The source and destination do - not overlap. */ -# ifndef YYCOPY -# if defined __GNUC__ && 1 < __GNUC__ -# define YYCOPY(Dst, Src, Count) \ - __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) -# else -# define YYCOPY(Dst, Src, Count) \ - do \ - { \ - YYSIZE_T yyi; \ - for (yyi = 0; yyi < (Count); yyi++) \ - (Dst)[yyi] = (Src)[yyi]; \ - } \ - while (0) -# endif -# endif -#endif /* !YYCOPY_NEEDED */ - -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 15 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 45 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 17 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 5 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 21 -/* YYNSTATES -- Number of states. */ -#define YYNSTATES 44 - -/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned - by yylex, with out-of-bounds checking. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 264 - -#define YYTRANSLATE(YYX) \ - ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) - -/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM - as returned by yylex, without out-of-bounds checking. */ -static const yytype_uint8 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, 10, 2, 2, 2, 2, - 11, 12, 2, 2, 16, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 14, 13, 15, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 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 -}; - -#if YYDEBUG - /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ -static const yytype_uint8 yyrline[] = -{ - 0, 67, 67, 69, 70, 72, 73, 74, 75, 76, - 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, - 88, 90 -}; -#endif - -#if YYDEBUG || YYERROR_VERBOSE || 0 -/* YYTNAME[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", "TAG", "INTLIT", "OR", "AND", "OF", - "LEQ", "GEQ", "'#'", "'('", "')'", "'='", "'<'", "'>'", "','", "$accept", - "result", "number", "policy", "arg_list", YY_NULLPTR -}; -#endif - -# ifdef YYPRINT -/* YYTOKNUM[NUM] -- (External) token number corresponding to the - (internal) symbol number NUM (which must be that of a token). */ -static const yytype_uint16 yytoknum[] = -{ - 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, - 35, 40, 41, 61, 60, 62, 44 -}; -# endif - -#define YYPACT_NINF -5 - -#define yypact_value_is_default(Yystate) \ - (!!((Yystate) == (-5))) - -#define YYTABLE_NINF -1 - -#define yytable_value_is_error(Yytable_value) \ - 0 - - /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -static const yytype_int8 yypact[] = -{ - -2, -1, -4, -2, 4, 2, 17, 1, 1, 1, - 1, 1, 13, 29, 15, -5, 32, 33, 34, 37, - 38, -2, -2, 35, -5, -5, -5, -5, -5, -2, - -5, -5, -5, -5, -5, -5, -5, 19, -5, 17, - 22, -5, -2, 17 -}; - - /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. - Performed when YYTABLE does not specify something else to do. Zero - means the default is an error. */ -static const yytype_uint8 yydefact[] = -{ - 0, 5, 4, 0, 0, 0, 2, 0, 0, 0, - 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, - 0, 0, 0, 4, 12, 13, 9, 10, 11, 0, - 3, 19, 17, 18, 14, 15, 16, 6, 7, 20, - 0, 8, 0, 21 -}; - - /* YYPGOTO[NTERM-NUM]. */ -static const yytype_int8 yypgoto[] = -{ - -5, -5, 21, -3, -5 -}; - - /* YYDEFGOTO[NTERM-NUM]. */ -static const yytype_int8 yydefgoto[] = -{ - -1, 4, 5, 6, 40 -}; - - /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule whose - number is the opposite. If YYTABLE_NINF, syntax error. */ -static const yytype_uint8 yytable[] = -{ - 14, 1, 2, 12, 15, 23, 13, 7, 8, 3, - 16, 17, 9, 10, 11, 18, 19, 20, 37, 38, - 21, 22, 21, 22, 29, 22, 39, 31, 24, 25, - 26, 27, 28, 30, 41, 32, 33, 34, 42, 43, - 35, 36, 0, 0, 0, 13 -}; - -static const yytype_int8 yycheck[] = -{ - 3, 3, 4, 7, 0, 4, 10, 8, 9, 11, - 8, 9, 13, 14, 15, 13, 14, 15, 21, 22, - 5, 6, 5, 6, 11, 6, 29, 12, 7, 8, - 9, 10, 11, 4, 12, 3, 3, 3, 16, 42, - 3, 3, -1, -1, -1, 10 -}; - - /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const yytype_uint8 yystos[] = -{ - 0, 3, 4, 11, 18, 19, 20, 8, 9, 13, - 14, 15, 7, 10, 20, 0, 8, 9, 13, 14, - 15, 5, 6, 4, 19, 19, 19, 19, 19, 11, - 4, 12, 3, 3, 3, 3, 3, 20, 20, 20, - 21, 12, 16, 20 -}; - - /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const yytype_uint8 yyr1[] = -{ - 0, 17, 18, 19, 19, 20, 20, 20, 20, 20, - 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, - 21, 21 -}; - - /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ -static const yytype_uint8 yyr2[] = -{ - 0, 2, 1, 3, 1, 1, 3, 3, 5, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 1, 3 -}; - - -#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 yyerrorlab - - -#define YYRECOVERING() (!!yyerrstatus) - -#define YYBACKUP(Token, Value) \ -do \ - if (yychar == YYEMPTY) \ - { \ - yychar = (Token); \ - yylval = (Value); \ - YYPOPSTACK (yylen); \ - yystate = *yyssp; \ - goto yybackup; \ - } \ - else \ - { \ - yyerror (YY_("syntax error: cannot back up")); \ - YYERROR; \ - } \ -while (0) - -/* Error token number */ -#define YYTERROR 1 -#define YYERRCODE 256 - - - -/* Enable debugging if requested. */ -#if YYDEBUG - -# ifndef YYFPRINTF -# include /* INFRINGES ON USER NAME SPACE */ -# define YYFPRINTF fprintf -# endif - -# define YYDPRINTF(Args) \ -do { \ - if (yydebug) \ - YYFPRINTF Args; \ -} while (0) - -/* This macro is provided for backward compatibility. */ -#ifndef YY_LOCATION_PRINT -# define YY_LOCATION_PRINT(File, Loc) ((void) 0) -#endif - - -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yy_symbol_print (stderr, \ - Type, Value); \ - YYFPRINTF (stderr, "\n"); \ - } \ -} while (0) - - -/*----------------------------------------. -| Print this symbol's value on YYOUTPUT. | -`----------------------------------------*/ - -static void -yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -{ - FILE *yyo = yyoutput; - YYUSE (yyo); - if (!yyvaluep) - return; -# ifdef YYPRINT - if (yytype < YYNTOKENS) - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# endif - YYUSE (yytype); -} - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -static void -yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -{ - YYFPRINTF (yyoutput, "%s %s (", - yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); - - yy_symbol_value_print (yyoutput, yytype, yyvaluep); - YYFPRINTF (yyoutput, ")"); -} - -/*------------------------------------------------------------------. -| yy_stack_print -- Print the state stack from its BOTTOM up to its | -| TOP (included). | -`------------------------------------------------------------------*/ - -static void -yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) -{ - YYFPRINTF (stderr, "Stack now"); - for (; yybottom <= yytop; yybottom++) - { - int yybot = *yybottom; - YYFPRINTF (stderr, " %d", yybot); - } - 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. | -`------------------------------------------------*/ - -static void -yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule) -{ - unsigned long int yylno = yyrline[yyrule]; - int yynrhs = yyr2[yyrule]; - int yyi; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", - yyrule - 1, yylno); - /* The symbols being reduced. */ - for (yyi = 0; yyi < yynrhs; yyi++) - { - YYFPRINTF (stderr, " $%d = ", yyi + 1); - yy_symbol_print (stderr, - yystos[yyssp[yyi + 1 - yynrhs]], - &(yyvsp[(yyi + 1) - (yynrhs)]) - ); - YYFPRINTF (stderr, "\n"); - } -} - -# define YY_REDUCE_PRINT(Rule) \ -do { \ - if (yydebug) \ - yy_reduce_print (yyssp, yyvsp, 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 YY_SYMBOL_PRINT(Title, Type, 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 -#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 - YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ - -#ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 -#endif - - -#if YYERROR_VERBOSE - -# ifndef yystrlen -# if defined __GLIBC__ && defined _STRING_H -# define yystrlen strlen -# else -/* Return the length of YYSTR. */ -static YYSIZE_T -yystrlen (const char *yystr) -{ - YYSIZE_T yylen; - for (yylen = 0; yystr[yylen]; yylen++) - continue; - return yylen; -} -# 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 * -yystpcpy (char *yydest, const char *yysrc) -{ - char *yyd = yydest; - const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; -} -# endif -# endif - -# ifndef yytnamerr -/* Copy to YYRES the contents of YYSTR after stripping away unnecessary - quotes and backslashes, so that it's suitable for yyerror. The - heuristic is that double-quoting is unnecessary unless the string - contains an apostrophe, a comma, or backslash (other than - backslash-backslash). YYSTR is taken from yytname. If YYRES is - null, do not copy; instead, return the length of what the result - would have been. */ -static YYSIZE_T -yytnamerr (char *yyres, const char *yystr) -{ - if (*yystr == '"') - { - YYSIZE_T yyn = 0; - char const *yyp = yystr; - - for (;;) - switch (*++yyp) - { - case '\'': - case ',': - goto do_not_strip_quotes; - - case '\\': - if (*++yyp != '\\') - goto do_not_strip_quotes; - /* Fall through. */ - default: - if (yyres) - yyres[yyn] = *yyp; - yyn++; - break; - - case '"': - if (yyres) - yyres[yyn] = '\0'; - return yyn; - } - do_not_strip_quotes: ; - } - - if (! yyres) - return yystrlen (yystr); - - return yystpcpy (yyres, yystr) - yyres; -} -# endif - -/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message - about the unexpected token YYTOKEN for the state stack whose top is - YYSSP. - - Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is - not large enough to hold the message. In that case, also set - *YYMSG_ALLOC to the required number of bytes. Return 2 if the - required number of bytes is too large to store. */ -static int -yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, - yytype_int16 *yyssp, int yytoken) -{ - YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); - YYSIZE_T yysize = yysize0; - enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; - /* Internationalized format string. */ - const char *yyformat = YY_NULLPTR; - /* Arguments of yyformat. */ - char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; - /* Number of reported tokens (one for the "unexpected", one per - "expected"). */ - int yycount = 0; - - /* There are many possibilities here to consider: - - If this state is a consistent state with a default action, then - the only way this function was invoked is if the default action - is an error action. In that case, don't check for expected - tokens because there are none. - - The only way there can be no lookahead present (in yychar) is if - this state is a consistent state with a default action. Thus, - detecting the absence of a lookahead is sufficient to determine - that there is no unexpected or expected token to report. In that - case, just report a simple "syntax error". - - Don't assume there isn't a lookahead just because this state is a - consistent state with a default action. There might have been a - previous inconsistent state, consistent state with a non-default - action, or user semantic action that manipulated yychar. - - Of course, the expected token list depends on states to have - correct lookahead information, and it depends on the parser not - to perform extra reductions after fetching a lookahead from the - scanner and before detecting a syntax error. Thus, state merging - (from LALR or IELR) and default reductions corrupt the expected - token list. However, the list is correct for canonical LR with - one exception: it will still contain any token that will not be - accepted due to an error action in a later state. - */ - if (yytoken != YYEMPTY) - { - int yyn = yypact[*yyssp]; - yyarg[yycount++] = yytname[yytoken]; - if (!yypact_value_is_default (yyn)) - { - /* Start YYX at -YYN if negative to avoid negative indexes in - YYCHECK. In other words, skip the first -YYN actions for - this state because they are default actions. */ - int yyxbegin = yyn < 0 ? -yyn : 0; - /* Stay within bounds of both yycheck and yytname. */ - int yychecklim = YYLAST - yyn + 1; - int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; - int yyx; - - for (yyx = yyxbegin; yyx < yyxend; ++yyx) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR - && !yytable_value_is_error (yytable[yyx + yyn])) - { - if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) - { - yycount = 1; - yysize = yysize0; - break; - } - yyarg[yycount++] = yytname[yyx]; - { - YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); - if (! (yysize <= yysize1 - && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) - return 2; - yysize = yysize1; - } - } - } - } - - switch (yycount) - { -# define YYCASE_(N, S) \ - case N: \ - yyformat = S; \ - break - YYCASE_(0, YY_("syntax error")); - YYCASE_(1, YY_("syntax error, unexpected %s")); - YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); - YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); - YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); - YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); -# undef YYCASE_ - } - - { - YYSIZE_T yysize1 = yysize + yystrlen (yyformat); - if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) - return 2; - yysize = yysize1; - } - - if (*yymsg_alloc < yysize) - { - *yymsg_alloc = 2 * yysize; - if (! (yysize <= *yymsg_alloc - && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) - *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; - return 1; - } - - /* Avoid sprintf, as that infringes on the user's name space. - Don't have undefined behavior even if the translation - produced a string with the wrong number of "%s"s. */ - { - char *yyp = *yymsg; - int yyi = 0; - while ((*yyp = *yyformat) != '\0') - if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) - { - yyp += yytnamerr (yyp, yyarg[yyi++]); - yyformat += 2; - } - else - { - yyp++; - yyformat++; - } - } - return 0; -} -#endif /* YYERROR_VERBOSE */ - -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -static void -yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) -{ - YYUSE (yyvaluep); - if (!yymsg) - yymsg = "Deleting"; - YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); - - YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN - YYUSE (yytype); - YY_IGNORE_MAYBE_UNINITIALIZED_END -} - - - - -/* The lookahead symbol. */ -int yychar; - -/* The semantic value of the lookahead symbol. */ -YYSTYPE yylval; -/* Number of syntax errors so far. */ -int yynerrs; - - -/*----------. -| yyparse. | -`----------*/ - -int -yyparse (void) -{ - int yystate; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - - /* The stacks and their tools: - 'yyss': related to states. - 'yyvs': related to semantic values. - - Refer to the stacks through separate pointers, to allow yyoverflow - to reallocate them elsewhere. */ - - /* The state stack. */ - yytype_int16 yyssa[YYINITDEPTH]; - yytype_int16 *yyss; - yytype_int16 *yyssp; - - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs; - YYSTYPE *yyvsp; - - YYSIZE_T yystacksize; - - int yyn; - int yyresult; - /* Lookahead token as an internal (translated) token number. */ - int yytoken = 0; - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; - -#if YYERROR_VERBOSE - /* Buffer for error messages, and its allocated size. */ - char yymsgbuf[128]; - char *yymsg = yymsgbuf; - YYSIZE_T yymsg_alloc = sizeof yymsgbuf; -#endif - -#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) - - /* The number of symbols on the RHS of the reduced rule. - Keep to zero when no symbol should be popped. */ - int yylen = 0; - - yyssp = yyss = yyssa; - yyvsp = yyvs = yyvsa; - yystacksize = YYINITDEPTH; - - YYDPRINTF ((stderr, "Starting parse\n")); - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - 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 (yyss + yystacksize - 1 <= yyssp) - { - /* 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; - yytype_int16 *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 (YY_("memory exhausted"), - &yyss1, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - &yystacksize); - - yyss = yyss1; - yyvs = yyvs1; - } -#else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyexhaustedlab; -# else - /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyexhaustedlab; - yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) - yystacksize = YYMAXDEPTH; - - { - yytype_int16 *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyexhaustedlab; - YYSTACK_RELOCATE (yyss_alloc, yyss); - YYSTACK_RELOCATE (yyvs_alloc, 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; - } - - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); - - if (yystate == YYFINAL) - YYACCEPT; - - 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. */ - - /* First try to decide what to do without reference to lookahead token. */ - yyn = yypact[yystate]; - if (yypact_value_is_default (yyn)) - 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); - YY_SYMBOL_PRINT ("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 (yytable_value_is_error (yyn)) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; - - /* Shift the lookahead token. */ - YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); - - /* Discard the shifted token. */ - yychar = YYEMPTY; - - yystate = yyn; - YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN - *++yyvsp = yylval; - YY_IGNORE_MAYBE_UNINITIALIZED_END - - 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 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 67 "policy_lang.y" /* yacc.c:1646 */ - { final_policy = (yyvsp[0].tree); } -#line 1273 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 3: -#line 69 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.sint) = expint((yyvsp[-2].nat), (yyvsp[0].nat)); } -#line 1279 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 4: -#line 70 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.sint) = flexint((yyvsp[0].nat)); } -#line 1285 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 5: -#line 72 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = leaf_policy((yyvsp[0].str)); } -#line 1291 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 6: -#line 73 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = kof2_policy(1, (yyvsp[-2].tree), (yyvsp[0].tree)); } -#line 1297 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 7: -#line 74 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = kof2_policy(2, (yyvsp[-2].tree), (yyvsp[0].tree)); } -#line 1303 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 8: -#line 75 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = kof_policy((yyvsp[-4].nat), (yyvsp[-1].list)); } -#line 1309 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 9: -#line 76 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = eq_policy((yyvsp[0].sint), (yyvsp[-2].str)); } -#line 1315 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 10: -#line 77 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = lt_policy((yyvsp[0].sint), (yyvsp[-2].str)); } -#line 1321 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 11: -#line 78 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = gt_policy((yyvsp[0].sint), (yyvsp[-2].str)); } -#line 1327 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 12: -#line 79 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = le_policy((yyvsp[0].sint), (yyvsp[-2].str)); } -#line 1333 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 13: -#line 80 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = ge_policy((yyvsp[0].sint), (yyvsp[-2].str)); } -#line 1339 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 14: -#line 81 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = eq_policy((yyvsp[-2].sint), (yyvsp[0].str)); } -#line 1345 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 15: -#line 82 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = gt_policy((yyvsp[-2].sint), (yyvsp[0].str)); } -#line 1351 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 16: -#line 83 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = lt_policy((yyvsp[-2].sint), (yyvsp[0].str)); } -#line 1357 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 17: -#line 84 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = ge_policy((yyvsp[-2].sint), (yyvsp[0].str)); } -#line 1363 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 18: -#line 85 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = le_policy((yyvsp[-2].sint), (yyvsp[0].str)); } -#line 1369 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 19: -#line 86 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.tree) = (yyvsp[-1].tree); } -#line 1375 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 20: -#line 88 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.list) = g_ptr_array_new(); - g_ptr_array_add((yyval.list), (yyvsp[0].tree)); } -#line 1382 "policy_lang.c" /* yacc.c:1646 */ - break; - - case 21: -#line 90 "policy_lang.y" /* yacc.c:1646 */ - { (yyval.list) = (yyvsp[-2].list); - g_ptr_array_add((yyval.list), (yyvsp[0].tree)); } -#line 1389 "policy_lang.c" /* yacc.c:1646 */ - break; - - -#line 1393 "policy_lang.c" /* yacc.c:1646 */ - default: break; - } - /* User semantic actions sometimes alter yychar, and that requires - that yytoken be updated with the new translation. We take the - approach of translating immediately before every use of yytoken. - One alternative is translating here after every semantic action, - but that translation would be missed if the semantic action invokes - YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or - if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an - incorrect destructor might then be invoked immediately. In the - case of YYERROR or YYBACKUP, subsequent parser actions might lead - to an incorrect destructor call or verbose syntax error message - before the lookahead is translated. */ - YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); - - YYPOPSTACK (yylen); - yylen = 0; - 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 - number reduced by. */ - - 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 -- here on detecting error. | -`--------------------------------------*/ -yyerrlab: - /* Make sure we have latest lookahead translation. See comments at - user semantic actions for why this is necessary. */ - yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); - - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) - { - ++yynerrs; -#if ! YYERROR_VERBOSE - yyerror (YY_("syntax error")); -#else -# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ - yyssp, yytoken) - { - char const *yymsgp = YY_("syntax error"); - int yysyntax_error_status; - yysyntax_error_status = YYSYNTAX_ERROR; - if (yysyntax_error_status == 0) - yymsgp = yymsg; - else if (yysyntax_error_status == 1) - { - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); - yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); - if (!yymsg) - { - yymsg = yymsgbuf; - yymsg_alloc = sizeof yymsgbuf; - yysyntax_error_status = 2; - } - else - { - yysyntax_error_status = YYSYNTAX_ERROR; - yymsgp = yymsg; - } - } - yyerror (yymsgp); - if (yysyntax_error_status == 2) - goto yyexhaustedlab; - } -# undef YYSYNTAX_ERROR -#endif - } - - - - if (yyerrstatus == 3) - { - /* If just tried and failed to reuse lookahead token after an - error, discard it. */ - - if (yychar <= YYEOF) - { - /* Return failure if at end of input. */ - if (yychar == YYEOF) - YYABORT; - } - else - { - yydestruct ("Error: discarding", - yytoken, &yylval); - yychar = YYEMPTY; - } - } - - /* Else will try to reuse lookahead token after shifting the error - token. */ - goto yyerrlab1; - - -/*---------------------------------------------------. -| yyerrorlab -- error raised explicitly by YYERROR. | -`---------------------------------------------------*/ -yyerrorlab: - - /* Pacify compilers like GCC when the user code never invokes - YYERROR and the label yyerrorlab therefore never appears in user - code. */ - if (/*CONSTCOND*/ 0) - goto yyerrorlab; - - /* Do not reclaim the symbols of the rule whose action triggered - this YYERROR. */ - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - yystate = *yyssp; - goto yyerrlab1; - - -/*-------------------------------------------------------------. -| yyerrlab1 -- common code for both syntax error and YYERROR. | -`-------------------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ - - for (;;) - { - yyn = yypact[yystate]; - if (!yypact_value_is_default (yyn)) - { - 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; - - - yydestruct ("Error: popping", - yystos[yystate], yyvsp); - YYPOPSTACK (1); - yystate = *yyssp; - YY_STACK_PRINT (yyss, yyssp); - } - - YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN - *++yyvsp = yylval; - YY_IGNORE_MAYBE_UNINITIALIZED_END - - - /* Shift the error token. */ - YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); - - yystate = yyn; - goto yynewstate; - - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#if !defined yyoverflow || YYERROR_VERBOSE -/*-------------------------------------------------. -| yyexhaustedlab -- memory exhaustion comes here. | -`-------------------------------------------------*/ -yyexhaustedlab: - yyerror (YY_("memory exhausted")); - yyresult = 2; - /* Fall through. */ -#endif - -yyreturn: - if (yychar != YYEMPTY) - { - /* Make sure we have latest lookahead translation. See comments at - user semantic actions for why this is necessary. */ - yytoken = YYTRANSLATE (yychar); - yydestruct ("Cleanup: discarding lookahead", - yytoken, &yylval); - } - /* Do not reclaim the symbols of the rule whose action triggered - this YYABORT or YYACCEPT. */ - YYPOPSTACK (yylen); - YY_STACK_PRINT (yyss, yyssp); - while (yyssp != yyss) - { - yydestruct ("Cleanup: popping", - yystos[*yyssp], yyvsp); - YYPOPSTACK (1); - } -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); -#endif -#if YYERROR_VERBOSE - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); -#endif - return yyresult; -} -#line 94 "policy_lang.y" /* yacc.c:1906 */ - - -sized_integer_t* -expint( uint64_t value, uint64_t bits ) -{ - sized_integer_t* s; - - if( bits == 0 ) - die("error parsing policy: zero-length integer \"%llub%llu\"\n", - value, bits); - else if( bits > 64 ) - die("error parsing policy: no more than 64 bits allowed \"%llub%llu\"\n", - value, bits); - - s = malloc(sizeof(sized_integer_t)); - s->value = value; - s->bits = bits; - - return s; -} - -sized_integer_t* -flexint( uint64_t value ) -{ - sized_integer_t* s; - - s = malloc(sizeof(sized_integer_t)); - s->value = value; - s->bits = 0; - - return s; -} - -void -policy_free( cpabe_policy_t* p ) -{ - int i; - - if( p->attr ) - free(p->attr); - - for( i = 0; i < p->children->len; i++ ) - policy_free(g_ptr_array_index(p->children, i)); - g_ptr_array_free(p->children, 1); - - free(p); -} - -cpabe_policy_t* -leaf_policy( char* attr ) -{ - cpabe_policy_t* p; - - p = (cpabe_policy_t*) malloc(sizeof(cpabe_policy_t)); - p->k = 1; - p->attr = attr; - p->children = g_ptr_array_new(); - - return p; -} - -cpabe_policy_t* -kof2_policy( int k, cpabe_policy_t* l, cpabe_policy_t* r ) -{ - cpabe_policy_t* p; - - p = (cpabe_policy_t*) malloc(sizeof(cpabe_policy_t)); - p->k = k; - p->attr = 0; - p->children = g_ptr_array_new(); - g_ptr_array_add(p->children, l); - g_ptr_array_add(p->children, r); - - return p; -} - -cpabe_policy_t* -kof_policy( int k, GPtrArray* list ) -{ - cpabe_policy_t* p; - - if( k < 1 ) - die("error parsing policy: trivially satisfied operator \"%dof\"\n", k); - else if( k > list->len ) - die("error parsing policy: unsatisfiable operator \"%dof\" (only %d operands)\n", - k, list->len); - else if( list->len == 1 ) - die("error parsing policy: identity operator \"%dof\" (only one operand)\n", k); - - p = (cpabe_policy_t*) malloc(sizeof(cpabe_policy_t)); - p->k = k; - p->attr = 0; - p->children = list; - - return p; -} - -char* -bit_marker( char* base, char* tplate, int bit, char val ) -{ - char* lx; - char* rx; - char* s; - - lx = g_strnfill(64 - bit - 1, 'x'); - rx = g_strnfill(bit, 'x'); - s = g_strdup_printf(tplate, base, lx, !!val, rx); - free(lx); - free(rx); - - return s; -} - -cpabe_policy_t* -eq_policy( sized_integer_t* n, char* attr ) -{ - if( n->bits == 0 ) - return leaf_policy - (g_strdup_printf("%s_flexint_%llu", attr, n->value)); - else - return leaf_policy - (g_strdup_printf("%s_expint%02d_%llu", attr, n->bits, n->value)); - - return 0; -} - -cpabe_policy_t* -bit_marker_list( int gt, char* attr, char* tplate, int bits, uint64_t value ) -{ - cpabe_policy_t* p; - int i; - - i = 0; - while( gt ? (((uint64_t)1)<attr = 0; - p->children = g_ptr_array_new(); - - for( k = 2; k <= 32; k *= 2 ) - if( ( gt && ((uint64_t)1< value) || - (!gt && ((uint64_t)1<= value) ) - g_ptr_array_add - (p->children, leaf_policy - (g_strdup_printf(gt ? "%s_ge_2^%02d" : "%s_lt_2^%02d", attr, k))); - - p->k = gt ? 1 : p->children->len; - - if( p->children->len == 0 ) - { - policy_free(p); - p = 0; - } - else if( p->children->len == 1 ) - { - cpabe_policy_t* t; - - t = g_ptr_array_remove_index(p->children, 0); - policy_free(p); - p = t; - } - - return p; -} - -cpabe_policy_t* -cmp_policy( sized_integer_t* n, int gt, char* attr ) -{ - cpabe_policy_t* p; - char* tplate; - - /* some error checking */ - - if( gt && n->value >= ((uint64_t)1<<(n->bits ? n->bits : 64)) - 1 ) - die("error parsing policy: unsatisfiable integer comparison %s > %llu\n" - "(%d-bits are insufficient to satisfy)\n", attr, n->value, - n->bits ? n->bits : 64); - else if( !gt && n->value == 0 ) - die("error parsing policy: unsatisfiable integer comparison %s < 0\n" - "(all numerical attributes are unsigned)\n", attr); - else if( !gt && n->value > ((uint64_t)1<<(n->bits ? n->bits : 64)) - 1 ) - die("error parsing policy: trivially satisfied integer comparison %s < %llu\n" - "(any %d-bit number will satisfy)\n", attr, n->value, - n->bits ? n->bits : 64); - - /* create it */ - - /* horrible */ - tplate = n->bits ? - g_strdup_printf("%%s_expint%02d_%%s%%d%%s", n->bits) : - strdup("%s_flexint_%s%d%s"); - p = bit_marker_list(gt, attr, tplate, n->bits ? n->bits : - (n->value >= ((uint64_t)1<<32) ? 64 : - n->value >= ((uint64_t)1<<16) ? 32 : - n->value >= ((uint64_t)1<< 8) ? 16 : - n->value >= ((uint64_t)1<< 4) ? 8 : - n->value >= ((uint64_t)1<< 2) ? 4 : 2), n->value); - free(tplate); - - if( !n->bits ) - { - cpabe_policy_t* l; - - l = flexint_leader(gt, attr, n->value); - if( l ) - p = kof2_policy(gt ? 1 : 2, l, p); - } - - return p; -} - -cpabe_policy_t* -lt_policy( sized_integer_t* n, char* attr ) -{ - return cmp_policy(n, 0, attr); -} - -cpabe_policy_t* -gt_policy( sized_integer_t* n, char* attr ) -{ - return cmp_policy(n, 1, attr); -} - -cpabe_policy_t* -le_policy( sized_integer_t* n, char* attr ) -{ - n->value++; - return cmp_policy(n, 0, attr); -} - -cpabe_policy_t* -ge_policy( sized_integer_t* n, char* attr ) -{ - n->value--; - return cmp_policy(n, 1, attr); -} - -char* cur_string = 0; - -#define PEEK_CHAR ( *cur_string ? *cur_string : EOF ) -#define NEXT_CHAR ( *cur_string ? *(cur_string++) : EOF ) - -int -yylex() -{ - int c; - int r; - - while( isspace(c = NEXT_CHAR) ); - - r = 0; - if( c == EOF ) - r = 0; - else if( c == '&' ) - r = AND; - else if( c == '|' ) - r = OR; - else if( strchr("(),=#", c) || (strchr("<>", c) && PEEK_CHAR != '=') ) - r = c; - else if( c == '<' && PEEK_CHAR == '=' ) - { - NEXT_CHAR; - r = LEQ; - } - else if( c == '>' && PEEK_CHAR == '=' ) - { - NEXT_CHAR; - r = GEQ; - } - else if( isdigit(c) ) - { - GString* s; - - s = g_string_new(""); - g_string_append_c(s, c); - while( isdigit(PEEK_CHAR) ) - g_string_append_c(s, NEXT_CHAR); - - sscanf(s->str, "%llu", &(yylval.nat)); - - g_string_free(s, 1); - r = INTLIT; - } - else if( isalpha(c) ) - { - GString* s; - - s = g_string_new(""); - g_string_append_c(s, c); - - while( isalnum(PEEK_CHAR) || PEEK_CHAR == '_' ) - g_string_append_c(s, NEXT_CHAR); - - if( !strcmp(s->str, "and") ) - { - g_string_free(s, 1); - r = AND; - } - else if( !strcmp(s->str, "or") ) - { - g_string_free(s, 1); - r = OR; - } - else if( !strcmp(s->str, "of") ) - { - g_string_free(s, 1); - r = OF; - } - else - { - yylval.str = s->str; - g_string_free(s, 0); - r = TAG; - } - } - else - die("syntax error at \"%c%s\"\n", c, cur_string); - - return r; -} - -void -yyerror( const char* s ) -{ - die("error parsing policy: %s\n", s); -} - -#define POLICY_IS_OR(p) (((cpabe_policy_t*)(p))->k == 1 && ((cpabe_policy_t*)(p))->children->len) -#define POLICY_IS_AND(p) (((cpabe_policy_t*)(p))->k == ((cpabe_policy_t*)(p))->children->len) - -void -merge_child( cpabe_policy_t* p, int i ) -{ - int j; - cpabe_policy_t* c; - - c = g_ptr_array_index(p->children, i); - if( POLICY_IS_AND(p) ) - { - p->k += c->k; - p->k--; - } - - g_ptr_array_remove_index_fast(p->children, i); - for( j = 0; j < c->children->len; j++ ) - g_ptr_array_add(p->children, g_ptr_array_index(c->children, j)); - - g_ptr_array_free(c->children, 0); - free(c); -} - -void -simplify( cpabe_policy_t* p ) -{ - int i; - - for( i = 0; i < p->children->len; i++ ) - simplify(g_ptr_array_index(p->children, i)); - - if( POLICY_IS_OR(p) ) - for( i = 0; i < p->children->len; i++ ) - if( POLICY_IS_OR(g_ptr_array_index(p->children, i)) ) - merge_child(p, i); - - if( POLICY_IS_AND(p) ) - for( i = 0; i < p->children->len; i++ ) - if( POLICY_IS_AND(g_ptr_array_index(p->children, i)) ) - merge_child(p, i); -} - -int -cmp_tidy( const void* a, const void* b ) -{ - cpabe_policy_t* pa; - cpabe_policy_t* pb; - - pa = *((cpabe_policy_t**) a); - pb = *((cpabe_policy_t**) b); - - if( pa->children->len > 0 && pb->children->len == 0 ) - return -1; - else if( pa->children->len == 0 && pb->children->len > 0 ) - return 1; - else if( pa->children->len == 0 && pb->children->len == 0 ) - return strcmp(pa->attr, pb->attr); - else - return 0; -} - -void -tidy( cpabe_policy_t* p ) -{ - int i; - - for( i = 0; i < p->children->len; i++ ) - tidy(g_ptr_array_index(p->children, i)); - - if( p->children->len > 0 ) - qsort(p->children->pdata, p->children->len, - sizeof(cpabe_policy_t*), cmp_tidy); -} - -char* -format_policy_postfix( cpabe_policy_t* p ) -{ - int i; - char* r; - char* s; - char* t; - - if( p->children->len == 0 ) - return strdup(p->attr); - - r = format_policy_postfix(g_ptr_array_index(p->children, 0)); - for( i = 1; i < p->children->len; i++ ) - { - s = format_policy_postfix(g_ptr_array_index(p->children, i)); - t = g_strjoin(" ", r, s, (char*) 0); - free(r); - free(s); - r = t; - } - - t = g_strdup_printf("%s %dof%d", r, p->k, p->children->len); - free(r); - - return t; -} - -/* - Crufty. -*/ -int -actual_bits( uint64_t value ) -{ - int i; - - for( i = 32; i >= 1; i /= 2 ) - if( value >= ((uint64_t)1<