2711 lines
74 KiB
C
2711 lines
74 KiB
C
/* A Bison parser, made by GNU Bison 3.7. */
|
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 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 <http://www.gnu.org/licenses/>. */
|
|
|
|
/* 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. */
|
|
|
|
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
|
|
especially those whose name start with YY_ or yy_. They are
|
|
private implementation details that can be changed or removed. */
|
|
|
|
/* 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.7"
|
|
|
|
/* Skeleton name. */
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
/* Pure parsers. */
|
|
#define YYPURE 0
|
|
|
|
/* Push parsers. */
|
|
#define YYPUSH 0
|
|
|
|
/* Pull parsers. */
|
|
#define YYPULL 1
|
|
|
|
|
|
|
|
|
|
/* First part of user prologue. */
|
|
#line 1 "vcc.y"
|
|
|
|
|
|
/***************************************************************************
|
|
(C) Copyright 1996 Apple Computer, Inc., AT&T Corp., International
|
|
Business Machines Corporation and Siemens Rolm Communications Inc.
|
|
|
|
modified 2000 by Thomas Schulz:
|
|
$Id: vcc.y,v 1.7 2001/02/10 03:09:24 tsch Rel $
|
|
|
|
For purposes of this license notice, the term Licensors shall mean,
|
|
collectively, Apple Computer, Inc., AT&T Corp., International
|
|
Business Machines Corporation and Siemens Rolm Communications Inc.
|
|
The term Licensor shall mean any of the Licensors.
|
|
|
|
Subject to acceptance of the following conditions, permission is hereby
|
|
granted by Licensors without the need for written agreement and without
|
|
license or royalty fees, to use, copy, modify and distribute this
|
|
software for any purpose.
|
|
|
|
The above copyright notice and the following four paragraphs must be
|
|
reproduced in all copies of this software and any software including
|
|
this software.
|
|
|
|
THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS AND NO LICENSOR SHALL HAVE
|
|
ANY OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS OR
|
|
MODIFICATIONS.
|
|
|
|
IN NO EVENT SHALL ANY LICENSOR BE LIABLE TO ANY PARTY FOR DIRECT,
|
|
INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES OR LOST PROFITS ARISING OUT
|
|
OF THE USE OF THIS SOFTWARE EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
|
|
DAMAGE.
|
|
|
|
EACH LICENSOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED,
|
|
INCLUDING BUT NOT LIMITED TO ANY WARRANTY OF NONINFRINGEMENT OR THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
PURPOSE.
|
|
|
|
The software is provided with RESTRICTED RIGHTS. Use, duplication, or
|
|
disclosure by the government are subject to restrictions set forth in
|
|
DFARS 252.227-7013 or 48 CFR 52.227-19, as applicable.
|
|
|
|
***************************************************************************/
|
|
|
|
/*
|
|
* src: vcc.c
|
|
* doc: Parser for vCard and vCalendar. Note that this code is
|
|
* generated by a yacc parser generator. Generally it should not
|
|
* be edited by hand. The real source is vcc.y. The #line directives
|
|
* can be commented out here to make it easier to trace through
|
|
* in a debugger. However, if a bug is found it should
|
|
* be fixed in vcc.y and this file regenerated.
|
|
*/
|
|
|
|
|
|
/* debugging utilities */
|
|
#if __DEBUG
|
|
#define DBG_(x) printf x
|
|
#else
|
|
#define DBG_(x)
|
|
#endif
|
|
|
|
/**** External Functions ****/
|
|
|
|
/* assign local name to parser variables and functions so that
|
|
we can use more than one yacc based parser.
|
|
*/
|
|
|
|
#define yyparse mime_parse
|
|
#define yylex mime_lex
|
|
#define yyerror mime_error
|
|
#define yychar mime_char
|
|
/* #define p_yyval p_mime_val */
|
|
#undef yyval
|
|
#define yyval mime_yyval
|
|
/* #define p_yylval p_mime_lval */
|
|
#undef yylval
|
|
#define yylval mime_yylval
|
|
#define yydebug mime_debug
|
|
#define yynerrs mime_nerrs
|
|
#define yyerrflag mime_errflag
|
|
#define yyss mime_ss
|
|
#define yyssp mime_ssp
|
|
#define yyvs mime_vs
|
|
#define yyvsp mime_vsp
|
|
#define yylhs mime_lhs
|
|
#define yylen mime_len
|
|
#define yydefred mime_defred
|
|
#define yydgoto mime_dgoto
|
|
#define yysindex mime_sindex
|
|
#define yyrindex mime_rindex
|
|
#define yygindex mime_gindex
|
|
#define yytable mime_table
|
|
#define yycheck mime_check
|
|
#define yyname mime_name
|
|
#define yyrule mime_rule
|
|
#define YYPREFIX "mime_"
|
|
|
|
|
|
#ifndef _NO_LINE_FOLDING
|
|
#define _SUPPORT_LINE_FOLDING 1
|
|
#endif
|
|
|
|
/* undef below if compile with MFC */
|
|
/* #define INCLUDEMFC 1 */
|
|
|
|
#if defined(WIN32) || defined(_WIN32)
|
|
#ifdef INCLUDEMFC
|
|
#include <afx.h>
|
|
#endif
|
|
#endif
|
|
|
|
#include <string.h>
|
|
#ifndef __MWERKS__
|
|
#include <malloc.h>
|
|
#endif
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <ctype.h>
|
|
#include "vcc.h"
|
|
|
|
/**** Types, Constants ****/
|
|
|
|
#define YYDEBUG 0 /* 1 to compile in some debugging code */
|
|
#define YYERROR_VERBOSE 1 /* verbose parse error reports */
|
|
#define MAXTOKEN 256 /* maximum token (line) length */
|
|
#define YYSTACKSIZE 50 /* ~unref ? */
|
|
#define MAXLEVEL 10 /* max # of nested objects parseable */
|
|
/* (includes outermost) */
|
|
|
|
|
|
/**** Global Variables ****/
|
|
int mime_lineNum, mime_numErrors; /* yyerror() can use these */
|
|
static VObject* vObjList;
|
|
static VObject *curProp;
|
|
static VObject *curObj;
|
|
static VObject* ObjStack[MAXLEVEL];
|
|
static int ObjStackTop;
|
|
|
|
|
|
/* A helpful utility for the rest of the app. */
|
|
#if __CPLUSPLUS__
|
|
extern "C" {
|
|
#endif
|
|
|
|
extern void Parse_Debug(const char *s);
|
|
static void yyerror(char *s);
|
|
|
|
#if __CPLUSPLUS__
|
|
};
|
|
#endif
|
|
|
|
int yyparse(void);
|
|
static int yylex(void);
|
|
|
|
enum LexMode {
|
|
L_NORMAL,
|
|
L_VCARD,
|
|
L_VCAL,
|
|
L_VEVENT,
|
|
L_VTODO,
|
|
L_VALUES,
|
|
L_BASE64,
|
|
L_QUOTED_PRINTABLE
|
|
};
|
|
|
|
/**** Private Forward Declarations ****/
|
|
static int pushVObject(const char *prop);
|
|
static VObject* popVObject(void);
|
|
static char* lexGetDataFromBase64(void);
|
|
static void lexPopMode(int top);
|
|
static int lexWithinMode(enum LexMode mode);
|
|
static void lexPushMode(enum LexMode mode);
|
|
static void enterProps(const char *s);
|
|
static void enterAttr(const char *s1, const char *s2);
|
|
static void appendValue(const char *value);
|
|
static void mime_error_(char *s);
|
|
|
|
|
|
#line 250 "vcc.c"
|
|
|
|
# ifndef YY_CAST
|
|
# ifdef __cplusplus
|
|
# define YY_CAST(Type, Val) static_cast<Type> (Val)
|
|
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
|
|
# else
|
|
# define YY_CAST(Type, Val) ((Type) (Val))
|
|
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
|
|
# endif
|
|
# endif
|
|
# ifndef YY_NULLPTR
|
|
# if defined __cplusplus
|
|
# if 201103L <= __cplusplus
|
|
# define YY_NULLPTR nullptr
|
|
# else
|
|
# define YY_NULLPTR 0
|
|
# endif
|
|
# else
|
|
# define YY_NULLPTR ((void*)0)
|
|
# endif
|
|
# endif
|
|
|
|
|
|
/* Debug traces. */
|
|
#ifndef YYDEBUG
|
|
# define YYDEBUG 0
|
|
#endif
|
|
#if YYDEBUG
|
|
extern int yydebug;
|
|
#endif
|
|
|
|
/* Token kinds. */
|
|
#ifndef YYTOKENTYPE
|
|
# define YYTOKENTYPE
|
|
enum yytokentype
|
|
{
|
|
YYEMPTY = -2,
|
|
YYEOF = 0, /* "end of file" */
|
|
YYerror = 256, /* error */
|
|
YYUNDEF = 257, /* "invalid token" */
|
|
EQ = 258, /* EQ */
|
|
COLON = 259, /* COLON */
|
|
DOT = 260, /* DOT */
|
|
SEMICOLON = 261, /* SEMICOLON */
|
|
SPACE = 262, /* SPACE */
|
|
HTAB = 263, /* HTAB */
|
|
LINESEP = 264, /* LINESEP */
|
|
NEWLINE = 265, /* NEWLINE */
|
|
BEGIN_VCARD = 266, /* BEGIN_VCARD */
|
|
END_VCARD = 267, /* END_VCARD */
|
|
BEGIN_VCAL = 268, /* BEGIN_VCAL */
|
|
END_VCAL = 269, /* END_VCAL */
|
|
BEGIN_VEVENT = 270, /* BEGIN_VEVENT */
|
|
END_VEVENT = 271, /* END_VEVENT */
|
|
BEGIN_VTODO = 272, /* BEGIN_VTODO */
|
|
END_VTODO = 273, /* END_VTODO */
|
|
BEGIN_VMEMO = 274, /* BEGIN_VMEMO */
|
|
END_VMEMO = 275, /* END_VMEMO */
|
|
ID = 276, /* ID */
|
|
STRING = 277 /* STRING */
|
|
};
|
|
typedef enum yytokentype yytoken_kind_t;
|
|
#endif
|
|
/* Token kinds. */
|
|
#define YYEOF 0
|
|
#define YYerror 256
|
|
#define YYUNDEF 257
|
|
#define EQ 258
|
|
#define COLON 259
|
|
#define DOT 260
|
|
#define SEMICOLON 261
|
|
#define SPACE 262
|
|
#define HTAB 263
|
|
#define LINESEP 264
|
|
#define NEWLINE 265
|
|
#define BEGIN_VCARD 266
|
|
#define END_VCARD 267
|
|
#define BEGIN_VCAL 268
|
|
#define END_VCAL 269
|
|
#define BEGIN_VEVENT 270
|
|
#define END_VEVENT 271
|
|
#define BEGIN_VTODO 272
|
|
#define END_VTODO 273
|
|
#define BEGIN_VMEMO 274
|
|
#define END_VMEMO 275
|
|
#define ID 276
|
|
#define STRING 277
|
|
|
|
/* Value type. */
|
|
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
|
union YYSTYPE
|
|
{
|
|
#line 184 "vcc.y"
|
|
|
|
char *str;
|
|
VObject *vobj;
|
|
|
|
|
|
#line 349 "vcc.c"
|
|
|
|
};
|
|
typedef union YYSTYPE YYSTYPE;
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
# define YYSTYPE_IS_DECLARED 1
|
|
#endif
|
|
|
|
|
|
extern YYSTYPE yylval;
|
|
|
|
int yyparse (void);
|
|
|
|
|
|
/* Symbol kind. */
|
|
enum yysymbol_kind_t
|
|
{
|
|
YYSYMBOL_YYEMPTY = -2,
|
|
YYSYMBOL_YYEOF = 0, /* "end of file" */
|
|
YYSYMBOL_YYerror = 1, /* error */
|
|
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
|
|
YYSYMBOL_EQ = 3, /* EQ */
|
|
YYSYMBOL_COLON = 4, /* COLON */
|
|
YYSYMBOL_DOT = 5, /* DOT */
|
|
YYSYMBOL_SEMICOLON = 6, /* SEMICOLON */
|
|
YYSYMBOL_SPACE = 7, /* SPACE */
|
|
YYSYMBOL_HTAB = 8, /* HTAB */
|
|
YYSYMBOL_LINESEP = 9, /* LINESEP */
|
|
YYSYMBOL_NEWLINE = 10, /* NEWLINE */
|
|
YYSYMBOL_BEGIN_VCARD = 11, /* BEGIN_VCARD */
|
|
YYSYMBOL_END_VCARD = 12, /* END_VCARD */
|
|
YYSYMBOL_BEGIN_VCAL = 13, /* BEGIN_VCAL */
|
|
YYSYMBOL_END_VCAL = 14, /* END_VCAL */
|
|
YYSYMBOL_BEGIN_VEVENT = 15, /* BEGIN_VEVENT */
|
|
YYSYMBOL_END_VEVENT = 16, /* END_VEVENT */
|
|
YYSYMBOL_BEGIN_VTODO = 17, /* BEGIN_VTODO */
|
|
YYSYMBOL_END_VTODO = 18, /* END_VTODO */
|
|
YYSYMBOL_BEGIN_VMEMO = 19, /* BEGIN_VMEMO */
|
|
YYSYMBOL_END_VMEMO = 20, /* END_VMEMO */
|
|
YYSYMBOL_ID = 21, /* ID */
|
|
YYSYMBOL_STRING = 22, /* STRING */
|
|
YYSYMBOL_YYACCEPT = 23, /* $accept */
|
|
YYSYMBOL_mime = 24, /* mime */
|
|
YYSYMBOL_vobjects = 25, /* vobjects */
|
|
YYSYMBOL_26_1 = 26, /* $@1 */
|
|
YYSYMBOL_vobject = 27, /* vobject */
|
|
YYSYMBOL_vcard = 28, /* vcard */
|
|
YYSYMBOL_29_2 = 29, /* $@2 */
|
|
YYSYMBOL_30_3 = 30, /* $@3 */
|
|
YYSYMBOL_items = 31, /* items */
|
|
YYSYMBOL_item = 32, /* item */
|
|
YYSYMBOL_33_4 = 33, /* $@4 */
|
|
YYSYMBOL_prop = 34, /* prop */
|
|
YYSYMBOL_35_5 = 35, /* $@5 */
|
|
YYSYMBOL_attr_params = 36, /* attr_params */
|
|
YYSYMBOL_attr_param = 37, /* attr_param */
|
|
YYSYMBOL_attr = 38, /* attr */
|
|
YYSYMBOL_name = 39, /* name */
|
|
YYSYMBOL_values = 40, /* values */
|
|
YYSYMBOL_41_6 = 41, /* $@6 */
|
|
YYSYMBOL_value = 42, /* value */
|
|
YYSYMBOL_vmemo = 43, /* vmemo */
|
|
YYSYMBOL_44_7 = 44, /* $@7 */
|
|
YYSYMBOL_45_8 = 45, /* $@8 */
|
|
YYSYMBOL_vcal = 46, /* vcal */
|
|
YYSYMBOL_47_9 = 47, /* $@9 */
|
|
YYSYMBOL_48_10 = 48, /* $@10 */
|
|
YYSYMBOL_calitems = 49, /* calitems */
|
|
YYSYMBOL_calitem = 50, /* calitem */
|
|
YYSYMBOL_eventitem = 51, /* eventitem */
|
|
YYSYMBOL_52_11 = 52, /* $@11 */
|
|
YYSYMBOL_53_12 = 53, /* $@12 */
|
|
YYSYMBOL_todoitem = 54, /* todoitem */
|
|
YYSYMBOL_55_13 = 55, /* $@13 */
|
|
YYSYMBOL_56_14 = 56 /* $@14 */
|
|
};
|
|
typedef enum yysymbol_kind_t yysymbol_kind_t;
|
|
|
|
|
|
|
|
|
|
#ifdef short
|
|
# undef short
|
|
#endif
|
|
|
|
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
|
|
<limits.h> and (if available) <stdint.h> are included
|
|
so that the code can choose integer types of a good width. */
|
|
|
|
#ifndef __PTRDIFF_MAX__
|
|
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
|
|
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
|
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
|
|
# define YY_STDINT_H
|
|
# endif
|
|
#endif
|
|
|
|
/* Narrow types that promote to a signed type and that can represent a
|
|
signed or unsigned integer of at least N bits. In tables they can
|
|
save space and decrease cache pressure. Promoting to a signed type
|
|
helps avoid bugs in integer arithmetic. */
|
|
|
|
#ifdef __INT_LEAST8_MAX__
|
|
typedef __INT_LEAST8_TYPE__ yytype_int8;
|
|
#elif defined YY_STDINT_H
|
|
typedef int_least8_t yytype_int8;
|
|
#else
|
|
typedef signed char yytype_int8;
|
|
#endif
|
|
|
|
#ifdef __INT_LEAST16_MAX__
|
|
typedef __INT_LEAST16_TYPE__ yytype_int16;
|
|
#elif defined YY_STDINT_H
|
|
typedef int_least16_t yytype_int16;
|
|
#else
|
|
typedef short yytype_int16;
|
|
#endif
|
|
|
|
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
|
|
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
|
|
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
|
|
&& UINT_LEAST8_MAX <= INT_MAX)
|
|
typedef uint_least8_t yytype_uint8;
|
|
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
|
|
typedef unsigned char yytype_uint8;
|
|
#else
|
|
typedef short yytype_uint8;
|
|
#endif
|
|
|
|
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
|
|
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
|
|
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
|
|
&& UINT_LEAST16_MAX <= INT_MAX)
|
|
typedef uint_least16_t yytype_uint16;
|
|
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
|
|
typedef unsigned short yytype_uint16;
|
|
#else
|
|
typedef int yytype_uint16;
|
|
#endif
|
|
|
|
#ifndef YYPTRDIFF_T
|
|
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
|
|
# define YYPTRDIFF_T __PTRDIFF_TYPE__
|
|
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
|
|
# elif defined PTRDIFF_MAX
|
|
# ifndef ptrdiff_t
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
# endif
|
|
# define YYPTRDIFF_T ptrdiff_t
|
|
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
|
|
# else
|
|
# define YYPTRDIFF_T long
|
|
# define YYPTRDIFF_MAXIMUM LONG_MAX
|
|
# endif
|
|
#endif
|
|
|
|
#ifndef YYSIZE_T
|
|
# ifdef __SIZE_TYPE__
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
# elif defined size_t
|
|
# define YYSIZE_T size_t
|
|
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
# define YYSIZE_T size_t
|
|
# else
|
|
# define YYSIZE_T unsigned
|
|
# endif
|
|
#endif
|
|
|
|
#define YYSIZE_MAXIMUM \
|
|
YY_CAST (YYPTRDIFF_T, \
|
|
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
|
|
? YYPTRDIFF_MAXIMUM \
|
|
: YY_CAST (YYSIZE_T, -1)))
|
|
|
|
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
|
|
|
|
|
|
/* Stored state numbers (used for stacks). */
|
|
typedef yytype_int8 yy_state_t;
|
|
|
|
/* State numbers in computations. */
|
|
typedef int yy_state_fast_t;
|
|
|
|
#ifndef YY_
|
|
# if defined YYENABLE_NLS && YYENABLE_NLS
|
|
# if ENABLE_NLS
|
|
# include <libintl.h> /* 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_PURE
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
|
|
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
|
|
# else
|
|
# define YY_ATTRIBUTE_PURE
|
|
# endif
|
|
#endif
|
|
|
|
#ifndef YY_ATTRIBUTE_UNUSED
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
|
|
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
|
|
# else
|
|
# define YY_ATTRIBUTE_UNUSED
|
|
# 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__ && ! defined __ICC && 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 __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN \
|
|
_Pragma ("GCC diagnostic push") \
|
|
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
|
|
# define YY_IGNORE_USELESS_CAST_END \
|
|
_Pragma ("GCC diagnostic pop")
|
|
#endif
|
|
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN
|
|
# define YY_IGNORE_USELESS_CAST_END
|
|
#endif
|
|
|
|
|
|
#define YY_ASSERT(E) ((void) (0 && (E)))
|
|
|
|
#if !defined yyoverflow
|
|
|
|
/* 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 <alloca.h> /* INFRINGES ON USER NAME SPACE */
|
|
# elif defined _AIX
|
|
# define YYSTACK_ALLOC __alloca
|
|
# elif defined _MSC_VER
|
|
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
|
|
# define alloca _alloca
|
|
# else
|
|
# define YYSTACK_ALLOC alloca
|
|
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
|
|
# include <stdlib.h> /* 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 <stdlib.h> /* 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 */
|
|
|
|
#if (! defined yyoverflow \
|
|
&& (! defined __cplusplus \
|
|
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
union yyalloc
|
|
{
|
|
yy_state_t yyss_alloc;
|
|
YYSTYPE yyvs_alloc;
|
|
};
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
|
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
|
|
|
|
/* The size of an array large to enough to hold all stacks, each with
|
|
N elements. */
|
|
# define YYSTACK_BYTES(N) \
|
|
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (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 \
|
|
{ \
|
|
YYPTRDIFF_T yynewbytes; \
|
|
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
|
|
Stack = &yyptr->Stack_alloc; \
|
|
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
|
yyptr += yynewbytes / YYSIZEOF (*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, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
|
|
# else
|
|
# define YYCOPY(Dst, Src, Count) \
|
|
do \
|
|
{ \
|
|
YYPTRDIFF_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 16
|
|
/* YYLAST -- Last index in YYTABLE. */
|
|
#define YYLAST 61
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
#define YYNTOKENS 23
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
#define YYNNTS 34
|
|
/* YYNRULES -- Number of rules. */
|
|
#define YYNRULES 52
|
|
/* YYNSTATES -- Number of states. */
|
|
#define YYNSTATES 69
|
|
|
|
/* YYMAXUTOK -- Last valid token kind. */
|
|
#define YYMAXUTOK 277
|
|
|
|
|
|
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
|
|
as returned by yylex, with out-of-bounds checking. */
|
|
#define YYTRANSLATE(YYX) \
|
|
(0 <= (YYX) && (YYX) <= YYMAXUTOK \
|
|
? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
|
|
: YYSYMBOL_YYUNDEF)
|
|
|
|
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
|
|
as returned by yylex. */
|
|
static const yytype_int8 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, 2, 3, 4,
|
|
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
15, 16, 17, 18, 19, 20, 21, 22
|
|
};
|
|
|
|
#if YYDEBUG
|
|
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
|
|
static const yytype_int16 yyrline[] =
|
|
{
|
|
0, 215, 215, 219, 218, 221, 225, 226, 227, 232,
|
|
231, 242, 241, 253, 254, 258, 257, 267, 271, 270,
|
|
275, 281, 282, 285, 288, 292, 299, 302, 302, 303,
|
|
307, 308, 313, 312, 318, 317, 325, 324, 330, 329,
|
|
335, 336, 340, 341, 342, 347, 346, 358, 357, 371,
|
|
370, 382, 381
|
|
};
|
|
#endif
|
|
|
|
/** Accessing symbol of state STATE. */
|
|
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
|
|
|
|
#if YYDEBUG || 0
|
|
/* The user-facing name of the symbol whose (internal) number is
|
|
YYSYMBOL. No bounds checking. */
|
|
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
|
|
|
|
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
|
static const char *const yytname[] =
|
|
{
|
|
"\"end of file\"", "error", "\"invalid token\"", "EQ", "COLON", "DOT",
|
|
"SEMICOLON", "SPACE", "HTAB", "LINESEP", "NEWLINE", "BEGIN_VCARD",
|
|
"END_VCARD", "BEGIN_VCAL", "END_VCAL", "BEGIN_VEVENT", "END_VEVENT",
|
|
"BEGIN_VTODO", "END_VTODO", "BEGIN_VMEMO", "END_VMEMO", "ID", "STRING",
|
|
"$accept", "mime", "vobjects", "$@1", "vobject", "vcard", "$@2", "$@3",
|
|
"items", "item", "$@4", "prop", "$@5", "attr_params", "attr_param",
|
|
"attr", "name", "values", "$@6", "value", "vmemo", "$@7", "$@8", "vcal",
|
|
"$@9", "$@10", "calitems", "calitem", "eventitem", "$@11", "$@12",
|
|
"todoitem", "$@13", "$@14", YY_NULLPTR
|
|
};
|
|
|
|
static const char *
|
|
yysymbol_name (yysymbol_kind_t yysymbol)
|
|
{
|
|
return yytname[yysymbol];
|
|
}
|
|
#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_int16 yytoknum[] =
|
|
{
|
|
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
|
|
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
|
|
275, 276, 277
|
|
};
|
|
#endif
|
|
|
|
#define YYPACT_NINF (-42)
|
|
|
|
#define yypact_value_is_default(Yyn) \
|
|
((Yyn) == YYPACT_NINF)
|
|
|
|
#define YYTABLE_NINF (-52)
|
|
|
|
#define yytable_value_is_error(Yyn) \
|
|
0
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
STATE-NUM. */
|
|
static const yytype_int8 yypact[] =
|
|
{
|
|
23, -9, -12, -15, 10, -42, 13, -42, -42, -42,
|
|
5, -4, 18, 14, 5, 7, -42, 23, -42, -42,
|
|
19, 0, 33, 34, -42, 24, 25, -42, 27, 8,
|
|
-42, -42, -42, 26, -42, -42, -42, -42, -42, 38,
|
|
5, 29, 5, 30, -42, -42, -42, 28, 31, -42,
|
|
38, 35, -42, 36, -42, -42, 40, 41, -42, 50,
|
|
-42, -42, -42, -42, -42, 31, 28, -42, -42
|
|
};
|
|
|
|
/* 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_int8 yydefact[] =
|
|
{
|
|
0, 9, 36, 32, 0, 2, 3, 6, 8, 7,
|
|
0, 0, 0, 0, 0, 0, 1, 0, 17, 26,
|
|
0, 0, 0, 18, 12, 45, 49, 44, 0, 0,
|
|
42, 43, 39, 0, 35, 4, 10, 13, 15, 0,
|
|
0, 0, 0, 0, 37, 40, 33, 31, 0, 19,
|
|
22, 0, 48, 0, 52, 30, 0, 29, 23, 24,
|
|
21, 46, 50, 16, 27, 0, 31, 25, 28
|
|
};
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
static const yytype_int8 yypgoto[] =
|
|
{
|
|
-42, -42, 39, -42, -42, -42, -42, -42, -10, -42,
|
|
-42, -42, -42, 9, -42, -42, -41, -11, -42, -42,
|
|
-42, -42, -42, -42, -42, -42, 32, -42, -42, -42,
|
|
-42, -42, -42, -42
|
|
};
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
static const yytype_int8 yydefgoto[] =
|
|
{
|
|
-1, 4, 5, 17, 6, 7, 10, 11, 27, 21,
|
|
47, 22, 39, 49, 50, 58, 23, 56, 66, 57,
|
|
8, 14, 15, 9, 12, 13, 28, 29, 30, 40,
|
|
41, 31, 42, 43
|
|
};
|
|
|
|
/* 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_int8 yytable[] =
|
|
{
|
|
20, 18, -38, -11, 33, -34, 18, 59, 24, 18,
|
|
16, 37, -14, -5, -14, -14, -14, -14, -14, 18,
|
|
-14, 19, -41, 25, 67, 26, 19, 34, 32, 19,
|
|
51, 36, 53, 25, 1, 26, 2, 38, -20, 19,
|
|
-47, 44, 3, -51, 48, 52, 46, 64, 54, 63,
|
|
55, 61, 19, 65, 62, 68, 35, 0, 0, 60,
|
|
0, 45
|
|
};
|
|
|
|
static const yytype_int8 yycheck[] =
|
|
{
|
|
10, 1, 14, 12, 14, 20, 1, 48, 12, 1,
|
|
0, 21, 12, 0, 14, 15, 16, 17, 18, 1,
|
|
20, 21, 14, 15, 65, 17, 21, 20, 14, 21,
|
|
40, 12, 42, 15, 11, 17, 13, 4, 4, 21,
|
|
16, 14, 19, 18, 6, 16, 20, 6, 18, 9,
|
|
22, 16, 21, 3, 18, 66, 17, -1, -1, 50,
|
|
-1, 29
|
|
};
|
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
symbol of state STATE-NUM. */
|
|
static const yytype_int8 yystos[] =
|
|
{
|
|
0, 11, 13, 19, 24, 25, 27, 28, 43, 46,
|
|
29, 30, 47, 48, 44, 45, 0, 26, 1, 21,
|
|
31, 32, 34, 39, 12, 15, 17, 31, 49, 50,
|
|
51, 54, 14, 31, 20, 25, 12, 31, 4, 35,
|
|
52, 53, 55, 56, 14, 49, 20, 33, 6, 36,
|
|
37, 31, 16, 31, 18, 22, 40, 42, 38, 39,
|
|
36, 16, 18, 9, 6, 3, 41, 39, 40
|
|
};
|
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
|
static const yytype_int8 yyr1[] =
|
|
{
|
|
0, 23, 24, 26, 25, 25, 27, 27, 27, 29,
|
|
28, 30, 28, 31, 31, 33, 32, 32, 35, 34,
|
|
34, 36, 36, 37, 38, 38, 39, 41, 40, 40,
|
|
42, 42, 44, 43, 45, 43, 47, 46, 48, 46,
|
|
49, 49, 50, 50, 50, 52, 51, 53, 51, 55,
|
|
54, 56, 54
|
|
};
|
|
|
|
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
|
|
static const yytype_int8 yyr2[] =
|
|
{
|
|
0, 2, 1, 0, 3, 1, 1, 1, 1, 0,
|
|
4, 0, 3, 2, 1, 0, 5, 1, 0, 3,
|
|
1, 2, 1, 2, 1, 3, 1, 0, 4, 1,
|
|
1, 0, 0, 4, 0, 3, 0, 4, 0, 3,
|
|
2, 1, 1, 1, 1, 0, 4, 0, 3, 0,
|
|
4, 0, 3
|
|
};
|
|
|
|
|
|
enum { YYENOMEM = -2 };
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
#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)
|
|
|
|
/* Backward compatibility with an undocumented macro.
|
|
Use YYerror or YYUNDEF. */
|
|
#define YYERRCODE YYUNDEF
|
|
|
|
|
|
/* 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)
|
|
|
|
/* 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, Kind, Value, Location) \
|
|
do { \
|
|
if (yydebug) \
|
|
{ \
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
yy_symbol_print (stderr, \
|
|
Kind, Value); \
|
|
YYFPRINTF (stderr, "\n"); \
|
|
} \
|
|
} while (0)
|
|
|
|
|
|
/*-----------------------------------.
|
|
| Print this symbol's value on YYO. |
|
|
`-----------------------------------*/
|
|
|
|
static void
|
|
yy_symbol_value_print (FILE *yyo,
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
|
{
|
|
FILE *yyoutput = yyo;
|
|
YYUSE (yyoutput);
|
|
if (!yyvaluep)
|
|
return;
|
|
# ifdef YYPRINT
|
|
if (yykind < YYNTOKENS)
|
|
YYPRINT (yyo, yytoknum[yykind], *yyvaluep);
|
|
# endif
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
YYUSE (yykind);
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
}
|
|
|
|
|
|
/*---------------------------.
|
|
| Print this symbol on YYO. |
|
|
`---------------------------*/
|
|
|
|
static void
|
|
yy_symbol_print (FILE *yyo,
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
|
{
|
|
YYFPRINTF (yyo, "%s %s (",
|
|
yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
|
|
|
|
yy_symbol_value_print (yyo, yykind, yyvaluep);
|
|
YYFPRINTF (yyo, ")");
|
|
}
|
|
|
|
/*------------------------------------------------------------------.
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
| TOP (included). |
|
|
`------------------------------------------------------------------*/
|
|
|
|
static void
|
|
yy_stack_print (yy_state_t *yybottom, yy_state_t *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 (yy_state_t *yyssp, YYSTYPE *yyvsp,
|
|
int yyrule)
|
|
{
|
|
int yylno = yyrline[yyrule];
|
|
int yynrhs = yyr2[yyrule];
|
|
int yyi;
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
|
|
yyrule - 1, yylno);
|
|
/* The symbols being reduced. */
|
|
for (yyi = 0; yyi < yynrhs; yyi++)
|
|
{
|
|
YYFPRINTF (stderr, " $%d = ", yyi + 1);
|
|
yy_symbol_print (stderr,
|
|
YY_ACCESSING_SYMBOL (+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) ((void) 0)
|
|
# define YY_SYMBOL_PRINT(Title, Kind, 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
| Release the memory associated to this symbol. |
|
|
`-----------------------------------------------*/
|
|
|
|
static void
|
|
yydestruct (const char *yymsg,
|
|
yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
|
|
{
|
|
YYUSE (yyvaluep);
|
|
if (!yymsg)
|
|
yymsg = "Deleting";
|
|
YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
YYUSE (yykind);
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
}
|
|
|
|
|
|
/* Lookahead token kind. */
|
|
int yychar;
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
YYSTYPE yylval;
|
|
/* Number of syntax errors so far. */
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
|
/*----------.
|
|
| yyparse. |
|
|
`----------*/
|
|
|
|
int
|
|
yyparse (void)
|
|
{
|
|
yy_state_fast_t yystate = 0;
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
int yyerrstatus = 0;
|
|
|
|
/* Refer to the stacks through separate pointers, to allow yyoverflow
|
|
to reallocate them elsewhere. */
|
|
|
|
/* Their size. */
|
|
YYPTRDIFF_T yystacksize = YYINITDEPTH;
|
|
|
|
/* The state stack: array, bottom, top. */
|
|
yy_state_t yyssa[YYINITDEPTH];
|
|
yy_state_t *yyss = yyssa;
|
|
yy_state_t *yyssp = yyss;
|
|
|
|
/* The semantic value stack: array, bottom, top. */
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
YYSTYPE *yyvs = yyvsa;
|
|
YYSTYPE *yyvsp = yyvs;
|
|
|
|
int yyn;
|
|
/* The return value of yyparse. */
|
|
int yyresult;
|
|
/* Lookahead symbol kind. */
|
|
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
|
|
/* The variables used to return semantic value and location from the
|
|
action routines. */
|
|
YYSTYPE yyval;
|
|
|
|
|
|
|
|
#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;
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
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 -- set current state (the top of the stack) to yystate. |
|
|
`--------------------------------------------------------------------*/
|
|
yysetstate:
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
|
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
*yyssp = YY_CAST (yy_state_t, yystate);
|
|
YY_IGNORE_USELESS_CAST_END
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
|
|
goto yyexhaustedlab;
|
|
#else
|
|
{
|
|
/* Get the current used size of the three stacks, in elements. */
|
|
YYPTRDIFF_T yysize = yyssp - yyss + 1;
|
|
|
|
# if defined 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. */
|
|
yy_state_t *yyss1 = yyss;
|
|
YYSTYPE *yyvs1 = yyvs;
|
|
|
|
/* 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 * YYSIZEOF (*yyssp),
|
|
&yyvs1, yysize * YYSIZEOF (*yyvsp),
|
|
&yystacksize);
|
|
yyss = yyss1;
|
|
yyvs = yyvs1;
|
|
}
|
|
# else /* defined YYSTACK_RELOCATE */
|
|
/* Extend the stack our own way. */
|
|
if (YYMAXDEPTH <= yystacksize)
|
|
goto yyexhaustedlab;
|
|
yystacksize *= 2;
|
|
if (YYMAXDEPTH < yystacksize)
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
{
|
|
yy_state_t *yyss1 = yyss;
|
|
union yyalloc *yyptr =
|
|
YY_CAST (union yyalloc *,
|
|
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, 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
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
yyvsp = yyvs + yysize - 1;
|
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
|
|
YY_CAST (long, yystacksize)));
|
|
YY_IGNORE_USELESS_CAST_END
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
YYABORT;
|
|
}
|
|
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
|
|
|
|
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 empty, or end-of-input, or a valid lookahead. */
|
|
if (yychar == YYEMPTY)
|
|
{
|
|
YYDPRINTF ((stderr, "Reading a token\n"));
|
|
yychar = yylex ();
|
|
}
|
|
|
|
if (yychar <= YYEOF)
|
|
{
|
|
yychar = YYEOF;
|
|
yytoken = YYSYMBOL_YYEOF;
|
|
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
|
}
|
|
else if (yychar == YYerror)
|
|
{
|
|
/* The scanner already issued an error message, process directly
|
|
to error recovery. But do not keep the error token as
|
|
lookahead, it is too special and may lead us to an endless
|
|
loop in error recovery. */
|
|
yychar = YYUNDEF;
|
|
yytoken = YYSYMBOL_YYerror;
|
|
goto yyerrlab1;
|
|
}
|
|
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);
|
|
yystate = yyn;
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
*++yyvsp = yylval;
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
/* Discard the shifted token. */
|
|
yychar = YYEMPTY;
|
|
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 3: /* $@1: %empty */
|
|
#line 219 "vcc.y"
|
|
{ addList(&vObjList, (yyvsp[0].vobj)); curObj = 0; }
|
|
#line 1425 "vcc.c"
|
|
break;
|
|
|
|
case 5: /* vobjects: vobject */
|
|
#line 222 "vcc.y"
|
|
{ addList(&vObjList, (yyvsp[0].vobj)); curObj = 0; }
|
|
#line 1431 "vcc.c"
|
|
break;
|
|
|
|
case 9: /* $@2: %empty */
|
|
#line 232 "vcc.y"
|
|
{
|
|
lexPushMode(L_VCARD);
|
|
if (!pushVObject(VCCardProp)) YYERROR;
|
|
}
|
|
#line 1440 "vcc.c"
|
|
break;
|
|
|
|
case 10: /* vcard: BEGIN_VCARD $@2 items END_VCARD */
|
|
#line 237 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
(yyval.vobj) = popVObject();
|
|
}
|
|
#line 1449 "vcc.c"
|
|
break;
|
|
|
|
case 11: /* $@3: %empty */
|
|
#line 242 "vcc.y"
|
|
{
|
|
lexPushMode(L_VCARD);
|
|
if (!pushVObject(VCCardProp)) YYERROR;
|
|
}
|
|
#line 1458 "vcc.c"
|
|
break;
|
|
|
|
case 12: /* vcard: BEGIN_VCARD $@3 END_VCARD */
|
|
#line 247 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
(yyval.vobj) = popVObject();
|
|
}
|
|
#line 1467 "vcc.c"
|
|
break;
|
|
|
|
case 15: /* $@4: %empty */
|
|
#line 258 "vcc.y"
|
|
{
|
|
lexPushMode(L_VALUES);
|
|
}
|
|
#line 1475 "vcc.c"
|
|
break;
|
|
|
|
case 16: /* item: prop COLON $@4 values LINESEP */
|
|
#line 262 "vcc.y"
|
|
{
|
|
if (lexWithinMode(L_BASE64) || lexWithinMode(L_QUOTED_PRINTABLE))
|
|
lexPopMode(0);
|
|
lexPopMode(0);
|
|
}
|
|
#line 1485 "vcc.c"
|
|
break;
|
|
|
|
case 18: /* $@5: %empty */
|
|
#line 271 "vcc.y"
|
|
{
|
|
enterProps((yyvsp[0].str));
|
|
}
|
|
#line 1493 "vcc.c"
|
|
break;
|
|
|
|
case 20: /* prop: name */
|
|
#line 276 "vcc.y"
|
|
{
|
|
enterProps((yyvsp[0].str));
|
|
}
|
|
#line 1501 "vcc.c"
|
|
break;
|
|
|
|
case 24: /* attr: name */
|
|
#line 289 "vcc.y"
|
|
{
|
|
enterAttr((yyvsp[0].str),0);
|
|
}
|
|
#line 1509 "vcc.c"
|
|
break;
|
|
|
|
case 25: /* attr: name EQ name */
|
|
#line 293 "vcc.y"
|
|
{
|
|
enterAttr((yyvsp[-2].str),(yyvsp[0].str));
|
|
|
|
}
|
|
#line 1518 "vcc.c"
|
|
break;
|
|
|
|
case 27: /* $@6: %empty */
|
|
#line 302 "vcc.y"
|
|
{ appendValue((yyvsp[-1].str)); }
|
|
#line 1524 "vcc.c"
|
|
break;
|
|
|
|
case 29: /* values: value */
|
|
#line 304 "vcc.y"
|
|
{ appendValue((yyvsp[0].str)); }
|
|
#line 1530 "vcc.c"
|
|
break;
|
|
|
|
case 31: /* value: %empty */
|
|
#line 308 "vcc.y"
|
|
{ (yyval.str) = 0; }
|
|
#line 1536 "vcc.c"
|
|
break;
|
|
|
|
case 32: /* $@7: %empty */
|
|
#line 313 "vcc.y"
|
|
{ if (!pushVObject(VCMemoProp)) YYERROR; }
|
|
#line 1542 "vcc.c"
|
|
break;
|
|
|
|
case 33: /* vmemo: BEGIN_VMEMO $@7 items END_VMEMO */
|
|
#line 316 "vcc.y"
|
|
{ (yyval.vobj) = popVObject(); }
|
|
#line 1548 "vcc.c"
|
|
break;
|
|
|
|
case 34: /* $@8: %empty */
|
|
#line 318 "vcc.y"
|
|
{ if (!pushVObject(VCMemoProp)) YYERROR; }
|
|
#line 1554 "vcc.c"
|
|
break;
|
|
|
|
case 35: /* vmemo: BEGIN_VMEMO $@8 END_VMEMO */
|
|
#line 320 "vcc.y"
|
|
{ (yyval.vobj) = popVObject(); }
|
|
#line 1560 "vcc.c"
|
|
break;
|
|
|
|
case 36: /* $@9: %empty */
|
|
#line 325 "vcc.y"
|
|
{ if (!pushVObject(VCCalProp)) YYERROR; }
|
|
#line 1566 "vcc.c"
|
|
break;
|
|
|
|
case 37: /* vcal: BEGIN_VCAL $@9 calitems END_VCAL */
|
|
#line 328 "vcc.y"
|
|
{ (yyval.vobj) = popVObject(); }
|
|
#line 1572 "vcc.c"
|
|
break;
|
|
|
|
case 38: /* $@10: %empty */
|
|
#line 330 "vcc.y"
|
|
{ if (!pushVObject(VCCalProp)) YYERROR; }
|
|
#line 1578 "vcc.c"
|
|
break;
|
|
|
|
case 39: /* vcal: BEGIN_VCAL $@10 END_VCAL */
|
|
#line 332 "vcc.y"
|
|
{ (yyval.vobj) = popVObject(); }
|
|
#line 1584 "vcc.c"
|
|
break;
|
|
|
|
case 45: /* $@11: %empty */
|
|
#line 347 "vcc.y"
|
|
{
|
|
lexPushMode(L_VEVENT);
|
|
if (!pushVObject(VCEventProp)) YYERROR;
|
|
}
|
|
#line 1593 "vcc.c"
|
|
break;
|
|
|
|
case 46: /* eventitem: BEGIN_VEVENT $@11 items END_VEVENT */
|
|
#line 353 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
popVObject();
|
|
}
|
|
#line 1602 "vcc.c"
|
|
break;
|
|
|
|
case 47: /* $@12: %empty */
|
|
#line 358 "vcc.y"
|
|
{
|
|
lexPushMode(L_VEVENT);
|
|
if (!pushVObject(VCEventProp)) YYERROR;
|
|
}
|
|
#line 1611 "vcc.c"
|
|
break;
|
|
|
|
case 48: /* eventitem: BEGIN_VEVENT $@12 END_VEVENT */
|
|
#line 363 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
popVObject();
|
|
}
|
|
#line 1620 "vcc.c"
|
|
break;
|
|
|
|
case 49: /* $@13: %empty */
|
|
#line 371 "vcc.y"
|
|
{
|
|
lexPushMode(L_VTODO);
|
|
if (!pushVObject(VCTodoProp)) YYERROR;
|
|
}
|
|
#line 1629 "vcc.c"
|
|
break;
|
|
|
|
case 50: /* todoitem: BEGIN_VTODO $@13 items END_VTODO */
|
|
#line 377 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
popVObject();
|
|
}
|
|
#line 1638 "vcc.c"
|
|
break;
|
|
|
|
case 51: /* $@14: %empty */
|
|
#line 382 "vcc.y"
|
|
{
|
|
lexPushMode(L_VTODO);
|
|
if (!pushVObject(VCTodoProp)) YYERROR;
|
|
}
|
|
#line 1647 "vcc.c"
|
|
break;
|
|
|
|
case 52: /* todoitem: BEGIN_VTODO $@14 END_VTODO */
|
|
#line 387 "vcc.y"
|
|
{
|
|
lexPopMode(0);
|
|
popVObject();
|
|
}
|
|
#line 1656 "vcc.c"
|
|
break;
|
|
|
|
|
|
#line 1660 "vcc.c"
|
|
|
|
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 ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
|
|
|
|
YYPOPSTACK (yylen);
|
|
yylen = 0;
|
|
|
|
*++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. */
|
|
{
|
|
const int yylhs = yyr1[yyn] - YYNTOKENS;
|
|
const int yyi = yypgoto[yylhs] + *yyssp;
|
|
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
|
|
? yytable[yyi]
|
|
: yydefgoto[yylhs]);
|
|
}
|
|
|
|
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 ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
|
|
/* If not already recovering from an error, report this error. */
|
|
if (!yyerrstatus)
|
|
{
|
|
++yynerrs;
|
|
yyerror (YY_("syntax error"));
|
|
}
|
|
|
|
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 when the user code never invokes YYERROR and the
|
|
label yyerrorlab therefore never appears in user code. */
|
|
if (0)
|
|
YYERROR;
|
|
|
|
/* 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. */
|
|
|
|
/* Pop stack until we find a state that shifts the error token. */
|
|
for (;;)
|
|
{
|
|
yyn = yypact[yystate];
|
|
if (!yypact_value_is_default (yyn))
|
|
{
|
|
yyn += YYSYMBOL_YYerror;
|
|
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
|
|
{
|
|
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",
|
|
YY_ACCESSING_SYMBOL (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", YY_ACCESSING_SYMBOL (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
|
|
/*-------------------------------------------------.
|
|
| yyexhaustedlab -- memory exhaustion comes here. |
|
|
`-------------------------------------------------*/
|
|
yyexhaustedlab:
|
|
yyerror (YY_("memory exhausted"));
|
|
yyresult = 2;
|
|
goto yyreturn;
|
|
#endif
|
|
|
|
|
|
/*-------------------------------------------------------.
|
|
| yyreturn -- parsing is finished, clean up and return. |
|
|
`-------------------------------------------------------*/
|
|
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",
|
|
YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
|
|
YYPOPSTACK (1);
|
|
}
|
|
#ifndef yyoverflow
|
|
if (yyss != yyssa)
|
|
YYSTACK_FREE (yyss);
|
|
#endif
|
|
|
|
return yyresult;
|
|
}
|
|
|
|
#line 393 "vcc.y"
|
|
|
|
/***************************************************************************/
|
|
static int pushVObject(const char *prop)
|
|
{
|
|
VObject *newObj;
|
|
if (ObjStackTop == MAXLEVEL)
|
|
return FALSE;
|
|
|
|
ObjStack[++ObjStackTop] = curObj;
|
|
|
|
if (curObj) {
|
|
newObj = addProp(curObj,prop);
|
|
curObj = newObj;
|
|
}
|
|
else
|
|
curObj = newVObject(prop);
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
/***************************************************************************/
|
|
/* This pops the recently built vCard off the stack and returns it. */
|
|
static VObject* popVObject(void)
|
|
{
|
|
VObject *oldObj;
|
|
if (ObjStackTop < 0) {
|
|
yyerror("pop on empty Object Stack\n");
|
|
return 0;
|
|
}
|
|
oldObj = curObj;
|
|
curObj = ObjStack[ObjStackTop--];
|
|
|
|
return oldObj;
|
|
}
|
|
|
|
static void appendValue(const char *value)
|
|
{
|
|
char *p1, *p2;
|
|
wchar_t *p3;
|
|
int i;
|
|
|
|
if (fieldedProp && *fieldedProp) {
|
|
if (value) {
|
|
addPropValue(curProp, *fieldedProp, value);
|
|
}
|
|
/* else this field is empty, advance to next field */
|
|
fieldedProp++;
|
|
} else {
|
|
if (value) {
|
|
if (vObjectUStringZValue(curProp)) {
|
|
p1 = fakeCString(vObjectUStringZValue(curProp));
|
|
p2 = malloc(sizeof(char *) * (strlen(p1)+strlen(value)+1));
|
|
strcpy(p2, p1);
|
|
deleteStr(p1);
|
|
|
|
i = strlen(p2);
|
|
p2[i] = ';';
|
|
p2[i+1] = '\0';
|
|
p2 = strcat(p2, value);
|
|
p3 = (wchar_t *) vObjectUStringZValue(curProp);
|
|
free(p3);
|
|
setVObjectUStringZValue_(curProp,fakeUnicode(p2,0));
|
|
deleteStr(p2);
|
|
} else {
|
|
setVObjectUStringZValue_(curProp,fakeUnicode(value,0));
|
|
}
|
|
}
|
|
}
|
|
deleteStr(value);
|
|
}
|
|
|
|
static void enterProps(const char *s)
|
|
{
|
|
curProp = addGroup(curObj,s);
|
|
deleteStr(s);
|
|
}
|
|
|
|
static void enterAttr(const char *s1, const char *s2)
|
|
{
|
|
const char *p1, *p2;
|
|
p1 = lookupProp_(s1);
|
|
if (s2) {
|
|
VObject *a;
|
|
p2 = lookupProp_(s2);
|
|
a = addProp(curProp,p1);
|
|
setVObjectStringZValue(a,p2);
|
|
}
|
|
else {
|
|
p2 = NULL;
|
|
addProp(curProp,p1);
|
|
}
|
|
if (stricmp(p1,VCBase64Prop) == 0 || (s2 && stricmp(p2,VCBase64Prop)==0))
|
|
lexPushMode(L_BASE64);
|
|
else if (stricmp(p1,VCQuotedPrintableProp) == 0
|
|
|| (s2 && stricmp(p2,VCQuotedPrintableProp)==0))
|
|
lexPushMode(L_QUOTED_PRINTABLE);
|
|
deleteStr(s1); deleteStr(s2);
|
|
}
|
|
|
|
|
|
#define MAX_LEX_LOOKAHEAD_0 32
|
|
#define MAX_LEX_LOOKAHEAD 64
|
|
#define MAX_LEX_MODE_STACK_SIZE 10
|
|
#define LEXMODE() (lexBuf.lexModeStack[lexBuf.lexModeStackTop])
|
|
|
|
struct LexBuf {
|
|
/* input */
|
|
#ifdef INCLUDEMFC
|
|
CFile *inputFile;
|
|
#else
|
|
FILE *inputFile;
|
|
#endif
|
|
char *inputString;
|
|
unsigned long curPos;
|
|
unsigned long inputLen;
|
|
/* lookahead buffer */
|
|
/* -- lookahead buffer is short instead of char so that EOF
|
|
/ can be represented correctly.
|
|
*/
|
|
unsigned long len;
|
|
short buf[MAX_LEX_LOOKAHEAD];
|
|
unsigned long getPtr;
|
|
/* context stack */
|
|
unsigned long lexModeStackTop;
|
|
enum LexMode lexModeStack[MAX_LEX_MODE_STACK_SIZE];
|
|
/* token buffer */
|
|
unsigned long maxToken;
|
|
char *strs;
|
|
unsigned long strsLen;
|
|
} lexBuf;
|
|
|
|
static void lexPushMode(enum LexMode mode)
|
|
{
|
|
if (lexBuf.lexModeStackTop == (MAX_LEX_MODE_STACK_SIZE-1))
|
|
yyerror("lexical context stack overflow");
|
|
else {
|
|
lexBuf.lexModeStack[++lexBuf.lexModeStackTop] = mode;
|
|
}
|
|
}
|
|
|
|
static void lexPopMode(int top)
|
|
{
|
|
/* special case of pop for ease of error recovery -- this
|
|
version will never underflow */
|
|
if (top)
|
|
lexBuf.lexModeStackTop = 0;
|
|
else
|
|
if (lexBuf.lexModeStackTop > 0) lexBuf.lexModeStackTop--;
|
|
}
|
|
|
|
static int lexWithinMode(enum LexMode mode) {
|
|
unsigned long i;
|
|
for (i=0;i<lexBuf.lexModeStackTop;i++)
|
|
if (mode == lexBuf.lexModeStack[i]) return 1;
|
|
return 0;
|
|
}
|
|
|
|
static char lexGetc_(void)
|
|
{
|
|
/* get next char from input, no buffering. */
|
|
if (lexBuf.curPos == lexBuf.inputLen)
|
|
return EOF;
|
|
else if (lexBuf.inputString)
|
|
return *(lexBuf.inputString + lexBuf.curPos++);
|
|
else {
|
|
#ifdef INCLUDEMFC
|
|
char result;
|
|
return lexBuf.inputFile->Read(&result, 1) == 1 ? result : EOF;
|
|
#else
|
|
return fgetc(lexBuf.inputFile);
|
|
#endif
|
|
}
|
|
}
|
|
|
|
static int lexGeta(void)
|
|
{
|
|
++lexBuf.len;
|
|
return (lexBuf.buf[lexBuf.getPtr] = lexGetc_());
|
|
}
|
|
|
|
static int lexGeta_(int i)
|
|
{
|
|
++lexBuf.len;
|
|
return (lexBuf.buf[(lexBuf.getPtr+i)%MAX_LEX_LOOKAHEAD] = lexGetc_());
|
|
}
|
|
|
|
static void lexSkipLookahead(void) {
|
|
if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
|
|
/* don't skip EOF. */
|
|
lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
|
|
lexBuf.len--;
|
|
}
|
|
}
|
|
|
|
static int lexLookahead(void) {
|
|
int c = (lexBuf.len)?
|
|
lexBuf.buf[lexBuf.getPtr]:
|
|
lexGeta();
|
|
/* do the \r\n -> \n or \r -> \n translation here */
|
|
if (c == '\r') {
|
|
int a = (lexBuf.len>1)?
|
|
lexBuf.buf[(lexBuf.getPtr+1)%MAX_LEX_LOOKAHEAD]:
|
|
lexGeta_(1);
|
|
if (a == '\n') {
|
|
lexSkipLookahead();
|
|
}
|
|
lexBuf.buf[lexBuf.getPtr] = c = '\n';
|
|
setCRLFmode( 1 ); /* note CRLF found on input */
|
|
}
|
|
else if (c == '\n') {
|
|
int a = (lexBuf.len>1)?
|
|
lexBuf.buf[lexBuf.getPtr+1]:
|
|
lexGeta_(1);
|
|
if (a == '\r') {
|
|
lexSkipLookahead();
|
|
}
|
|
lexBuf.buf[lexBuf.getPtr] = '\n';
|
|
}
|
|
return c;
|
|
}
|
|
|
|
static int lexGetc(void) {
|
|
int c = lexLookahead();
|
|
if (lexBuf.len > 0 && lexBuf.buf[lexBuf.getPtr]!=EOF) {
|
|
/* EOF will remain in lookahead buffer */
|
|
lexBuf.getPtr = (lexBuf.getPtr + 1) % MAX_LEX_LOOKAHEAD;
|
|
lexBuf.len--;
|
|
}
|
|
return c;
|
|
}
|
|
|
|
static void lexSkipLookaheadWord(void) {
|
|
if (lexBuf.strsLen <= lexBuf.len) {
|
|
lexBuf.len -= lexBuf.strsLen;
|
|
lexBuf.getPtr = (lexBuf.getPtr + lexBuf.strsLen) % MAX_LEX_LOOKAHEAD;
|
|
}
|
|
}
|
|
|
|
static void lexClearToken(void)
|
|
{
|
|
lexBuf.strsLen = 0;
|
|
}
|
|
|
|
static void lexAppendc(int c)
|
|
{
|
|
lexBuf.strs[lexBuf.strsLen] = c;
|
|
/* append up to zero termination */
|
|
if (c == 0) return;
|
|
lexBuf.strsLen++;
|
|
if (lexBuf.strsLen >= lexBuf.maxToken) {
|
|
/* double the token string size */
|
|
lexBuf.maxToken <<= 1;
|
|
lexBuf.strs = (char*) realloc(lexBuf.strs,(size_t)lexBuf.maxToken);
|
|
}
|
|
}
|
|
|
|
static char* lexStr(void) {
|
|
return dupStr(lexBuf.strs,(size_t)lexBuf.strsLen+1);
|
|
}
|
|
|
|
static void lexSkipWhite(void) {
|
|
int c = lexLookahead();
|
|
while (c == ' ' || c == '\t') {
|
|
lexSkipLookahead();
|
|
c = lexLookahead();
|
|
}
|
|
}
|
|
|
|
static char* lexGetWord(void) {
|
|
int c;
|
|
lexSkipWhite();
|
|
lexClearToken();
|
|
c = lexLookahead();
|
|
while (c != EOF && !strchr("\t\n ;:=",c)) {
|
|
lexAppendc(c);
|
|
lexSkipLookahead();
|
|
c = lexLookahead();
|
|
}
|
|
lexAppendc(0);
|
|
return lexStr();
|
|
}
|
|
|
|
static void lexPushLookaheadc(int c) {
|
|
int putptr;
|
|
/* can't putback EOF, because it never leaves lookahead buffer */
|
|
if (c == EOF) return;
|
|
putptr = (int)lexBuf.getPtr - 1;
|
|
if (putptr < 0) putptr += MAX_LEX_LOOKAHEAD;
|
|
lexBuf.getPtr = putptr;
|
|
lexBuf.buf[putptr] = c;
|
|
lexBuf.len += 1;
|
|
}
|
|
|
|
static char* lexLookaheadWord(void) {
|
|
/* this function can lookahead word with max size of MAX_LEX_LOOKAHEAD_0
|
|
/ and thing bigger than that will stop the lookahead and return 0;
|
|
/ leading white spaces are not recoverable.
|
|
*/
|
|
int c;
|
|
int len = 0;
|
|
int curgetptr = 0;
|
|
lexSkipWhite();
|
|
lexClearToken();
|
|
curgetptr = (int)lexBuf.getPtr; /* remember! */
|
|
while (len < (MAX_LEX_LOOKAHEAD_0)) {
|
|
c = lexGetc();
|
|
len++;
|
|
if (c == EOF || strchr("\t\n ;:=", c)) {
|
|
lexAppendc(0);
|
|
/* restore lookahead buf. */
|
|
lexBuf.len += len;
|
|
lexBuf.getPtr = curgetptr;
|
|
return lexStr();
|
|
}
|
|
else
|
|
lexAppendc(c);
|
|
}
|
|
lexBuf.len += len; /* char that has been moved to lookahead buffer */
|
|
lexBuf.getPtr = curgetptr;
|
|
return 0;
|
|
}
|
|
|
|
#ifdef _SUPPORT_LINE_FOLDING
|
|
static void handleMoreRFC822LineBreak(int c) {
|
|
/* suport RFC 822 line break in cases like
|
|
* ADR: foo;
|
|
* morefoo;
|
|
* more foo;
|
|
*/
|
|
if (c == ';') {
|
|
int a;
|
|
lexSkipLookahead();
|
|
/* skip white spaces */
|
|
a = lexLookahead();
|
|
while (a == ' ' || a == '\t') {
|
|
lexSkipLookahead();
|
|
a = lexLookahead();
|
|
}
|
|
if (a == '\n') {
|
|
lexSkipLookahead();
|
|
a = lexLookahead();
|
|
if (a == ' ' || a == '\t') {
|
|
/* continuation, throw away all the \n and spaces read so
|
|
* far
|
|
*/
|
|
lexSkipWhite();
|
|
lexPushLookaheadc(';');
|
|
}
|
|
else {
|
|
lexPushLookaheadc('\n');
|
|
lexPushLookaheadc(';');
|
|
}
|
|
}
|
|
else {
|
|
lexPushLookaheadc(';');
|
|
}
|
|
}
|
|
}
|
|
|
|
static char* lexGet1Value(void) {
|
|
int c;
|
|
lexSkipWhite();
|
|
c = lexLookahead();
|
|
lexClearToken();
|
|
while (c != EOF && c != ';') {
|
|
if (c == '\n') {
|
|
int a;
|
|
lexSkipLookahead();
|
|
a = lexLookahead();
|
|
if (a == ' ' || a == '\t') {
|
|
lexAppendc(' ');
|
|
lexSkipLookahead();
|
|
}
|
|
else {
|
|
lexPushLookaheadc('\n');
|
|
break;
|
|
}
|
|
}
|
|
else {
|
|
lexAppendc(c);
|
|
lexSkipLookahead();
|
|
}
|
|
c = lexLookahead();
|
|
}
|
|
lexAppendc(0);
|
|
handleMoreRFC822LineBreak(c);
|
|
return c==EOF?0:lexStr();
|
|
}
|
|
#endif
|
|
|
|
#ifndef _SUPPORT_LINE_FOLDING
|
|
static char* lexGetStrUntil(char *termset) {
|
|
int c = lexLookahead();
|
|
lexClearToken();
|
|
while (c != EOF && !strchr(termset,c)) {
|
|
lexAppendc(c);
|
|
lexSkipLookahead();
|
|
c = lexLookahead();
|
|
}
|
|
lexAppendc(0);
|
|
return c==EOF?0:lexStr();
|
|
}
|
|
#endif
|
|
|
|
static int match_begin_name(int end) {
|
|
char *n = lexLookaheadWord();
|
|
int token = ID;
|
|
if (n) {
|
|
if (!stricmp(n,"vcard")) token = end?END_VCARD:BEGIN_VCARD;
|
|
else if (!stricmp(n,"vcalendar")) token = end?END_VCAL:BEGIN_VCAL;
|
|
else if (!stricmp(n,"vevent")) token = end?END_VEVENT:BEGIN_VEVENT;
|
|
else if (!stricmp(n,"vtodo")) token = end?END_VTODO:BEGIN_VTODO;
|
|
else if (!stricmp(n,"vmemo")) token = end?END_VMEMO:BEGIN_VMEMO;
|
|
deleteStr(n);
|
|
return token;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
#ifdef INCLUDEMFC
|
|
void initLex(const char *inputstring, unsigned long inputlen, CFile *inputfile)
|
|
#else
|
|
static void initLex(const char *inputstring, unsigned long inputlen, FILE *inputfile)
|
|
#endif
|
|
{
|
|
/* initialize lex mode stack */
|
|
lexBuf.lexModeStack[lexBuf.lexModeStackTop=0] = L_NORMAL;
|
|
|
|
/* iniatialize lex buffer. */
|
|
lexBuf.inputString = (char*) inputstring;
|
|
lexBuf.inputLen = inputlen;
|
|
lexBuf.curPos = 0;
|
|
lexBuf.inputFile = inputfile;
|
|
|
|
lexBuf.len = 0;
|
|
lexBuf.getPtr = 0;
|
|
|
|
lexBuf.maxToken = MAXTOKEN;
|
|
lexBuf.strs = (char*)malloc(MAXTOKEN);
|
|
lexBuf.strsLen = 0;
|
|
|
|
}
|
|
|
|
static void finiLex(void) {
|
|
free(lexBuf.strs);
|
|
}
|
|
|
|
|
|
/***************************************************************************/
|
|
/* This parses and converts the base64 format for binary encoding into
|
|
* a decoded buffer (allocated with new). See RFC 1521.
|
|
*/
|
|
static char * lexGetDataFromBase64(void)
|
|
{
|
|
unsigned long bytesLen = 0, bytesMax = 0;
|
|
int quadIx = 0, pad = 0;
|
|
unsigned long trip = 0;
|
|
unsigned char b;
|
|
int c;
|
|
unsigned char *bytes = NULL;
|
|
unsigned char *oldBytes = NULL;
|
|
|
|
DBG_(("db: lexGetDataFromBase64\n"));
|
|
while (1) {
|
|
c = lexGetc();
|
|
if (c == '\n') {
|
|
++mime_lineNum;
|
|
if (lexLookahead() == '\n') {
|
|
/* a '\n' character by itself means end of data */
|
|
break;
|
|
}
|
|
else continue; /* ignore '\n' */
|
|
}
|
|
else {
|
|
if ((c >= 'A') && (c <= 'Z'))
|
|
b = (unsigned char)(c - 'A');
|
|
else if ((c >= 'a') && (c <= 'z'))
|
|
b = (unsigned char)(c - 'a') + 26;
|
|
else if ((c >= '0') && (c <= '9'))
|
|
b = (unsigned char)(c - '0') + 52;
|
|
else if (c == '+')
|
|
b = 62;
|
|
else if (c == '/')
|
|
b = 63;
|
|
else if (c == '=') {
|
|
b = 0;
|
|
pad++;
|
|
} else if ((c == ' ') || (c == '\t')) {
|
|
continue;
|
|
} else { /* error condition */
|
|
if (bytes) free(bytes);
|
|
else if (oldBytes) free(oldBytes);
|
|
/* error recovery: skip until 2 adjacent newlines. */
|
|
DBG_(("db: invalid character 0x%x '%c'\n", c,c));
|
|
if (c != EOF) {
|
|
c = lexGetc();
|
|
while (c != EOF) {
|
|
if (c == '\n' && lexLookahead() == '\n') {
|
|
++mime_lineNum;
|
|
break;
|
|
}
|
|
c = lexGetc();
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
trip = (trip << 6) | b;
|
|
if (++quadIx == 4) {
|
|
unsigned char outBytes[3];
|
|
int numOut;
|
|
int i;
|
|
for (i = 0; i < 3; i++) {
|
|
outBytes[2-i] = (unsigned char)(trip & 0xFF);
|
|
trip >>= 8;
|
|
}
|
|
numOut = 3 - pad;
|
|
if (bytesLen + numOut > bytesMax) {
|
|
if (!bytes) {
|
|
bytesMax = 1024;
|
|
bytes = (unsigned char*)malloc((size_t)bytesMax);
|
|
}
|
|
else {
|
|
bytesMax <<= 2;
|
|
oldBytes = bytes;
|
|
bytes = (unsigned char*)realloc(bytes,(size_t)bytesMax);
|
|
}
|
|
if (bytes == 0) {
|
|
mime_error("out of memory while processing BASE64 data\n");
|
|
}
|
|
}
|
|
if (bytes) {
|
|
memcpy(bytes + bytesLen, outBytes, numOut);
|
|
bytesLen += numOut;
|
|
}
|
|
trip = 0;
|
|
quadIx = 0;
|
|
}
|
|
}
|
|
} /* while */
|
|
DBG_(("db: bytesLen = %d\n", bytesLen));
|
|
/* kludge: all this won't be necessary if we have tree form
|
|
representation */
|
|
if (bytes) {
|
|
setValueWithSize(curProp,bytes,(unsigned int)bytesLen);
|
|
free(bytes);
|
|
}
|
|
else if (oldBytes) {
|
|
setValueWithSize(curProp,oldBytes,(unsigned int)bytesLen);
|
|
free(oldBytes);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int match_begin_end_name(int end) {
|
|
int token;
|
|
lexSkipWhite();
|
|
if (lexLookahead() != ':') return ID;
|
|
lexSkipLookahead();
|
|
lexSkipWhite();
|
|
token = match_begin_name(end);
|
|
if (token == ID) {
|
|
lexPushLookaheadc(':');
|
|
DBG_(("db: ID '%s'\n", yylval.str));
|
|
return ID;
|
|
}
|
|
else if (token != 0) {
|
|
lexSkipLookaheadWord();
|
|
deleteStr(yylval.str);
|
|
DBG_(("db: begin/end %d\n", token));
|
|
return token;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static char* lexGetQuotedPrintable(void)
|
|
{
|
|
char cur;
|
|
|
|
lexClearToken();
|
|
do {
|
|
cur = lexGetc();
|
|
switch (cur) {
|
|
case '=': {
|
|
int c = 0;
|
|
int next[2];
|
|
int i;
|
|
for (i = 0; i < 2; i++) {
|
|
next[i] = lexGetc();
|
|
if (next[i] >= '0' && next[i] <= '9')
|
|
c = c * 16 + next[i] - '0';
|
|
else if (next[i] >= 'A' && next[i] <= 'F')
|
|
c = c * 16 + next[i] - 'A' + 10;
|
|
else
|
|
break;
|
|
}
|
|
if (i == 0) {
|
|
/* single '=' follow by LINESEP is continuation sign? */
|
|
if (next[0] == '\n') {
|
|
++mime_lineNum;
|
|
}
|
|
else {
|
|
lexPushLookaheadc('=');
|
|
goto EndString;
|
|
}
|
|
}
|
|
else if (i == 1) {
|
|
lexPushLookaheadc(next[1]);
|
|
lexPushLookaheadc(next[0]);
|
|
lexAppendc('=');
|
|
} else {
|
|
lexAppendc(c);
|
|
}
|
|
break;
|
|
} /* '=' */
|
|
case '\n': {
|
|
lexPushLookaheadc('\n');
|
|
goto EndString;
|
|
}
|
|
case (char)EOF:
|
|
break;
|
|
default:
|
|
lexAppendc(cur);
|
|
break;
|
|
} /* switch */
|
|
} while (cur != (char)EOF);
|
|
|
|
EndString:
|
|
lexAppendc(0);
|
|
return lexStr();
|
|
} /* LexQuotedPrintable */
|
|
|
|
static int yylex(void) {
|
|
int lexmode = LEXMODE();
|
|
|
|
if (lexmode == L_VALUES) {
|
|
int c = lexGetc();
|
|
if (c == ';') {
|
|
DBG_(("db: SEMICOLON\n"));
|
|
lexPushLookaheadc(c);
|
|
#ifdef _SUPPORT_LINE_FOLDING
|
|
handleMoreRFC822LineBreak(c);
|
|
#endif
|
|
lexSkipLookahead();
|
|
return SEMICOLON;
|
|
}
|
|
else if (strchr("\n",c)) {
|
|
++mime_lineNum;
|
|
/* consume all line separator(s) adjacent to each other */
|
|
c = lexLookahead();
|
|
while (strchr("\n",c)) {
|
|
lexSkipLookahead();
|
|
c = lexLookahead();
|
|
++mime_lineNum;
|
|
}
|
|
DBG_(("db: LINESEP\n"));
|
|
return LINESEP;
|
|
}
|
|
else {
|
|
char *p = 0;
|
|
lexPushLookaheadc(c);
|
|
if (lexWithinMode(L_BASE64)) {
|
|
/* get each char and convert to bin on the fly... */
|
|
p = lexGetDataFromBase64();
|
|
yylval.str = p;
|
|
return STRING;
|
|
}
|
|
else if (lexWithinMode(L_QUOTED_PRINTABLE)) {
|
|
p = lexGetQuotedPrintable();
|
|
}
|
|
else {
|
|
#ifdef _SUPPORT_LINE_FOLDING
|
|
p = lexGet1Value();
|
|
#else
|
|
p = lexGetStrUntil(";\n");
|
|
#endif
|
|
}
|
|
if (p) {
|
|
DBG_(("db: STRING: '%s'\n", p));
|
|
yylval.str = p;
|
|
return STRING;
|
|
}
|
|
else return 0;
|
|
}
|
|
}
|
|
else {
|
|
/* normal mode */
|
|
while (1) {
|
|
int c = lexGetc();
|
|
switch(c) {
|
|
case ':': {
|
|
/* consume all line separator(s) adjacent to each other */
|
|
/* ignoring linesep immediately after colon. */
|
|
/* c = lexLookahead();
|
|
while (strchr("\n",c)) {
|
|
lexSkipLookahead();
|
|
c = lexLookahead();
|
|
++mime_lineNum;
|
|
}*/
|
|
DBG_(("db: COLON\n"));
|
|
return COLON;
|
|
}
|
|
case ';':
|
|
DBG_(("db: SEMICOLON\n"));
|
|
return SEMICOLON;
|
|
case '=':
|
|
DBG_(("db: EQ\n"));
|
|
return EQ;
|
|
/* ignore whitespace in this mode */
|
|
case '\t':
|
|
case ' ': continue;
|
|
case '\n': {
|
|
++mime_lineNum;
|
|
continue;
|
|
}
|
|
case EOF: return 0;
|
|
break;
|
|
default: {
|
|
lexPushLookaheadc(c);
|
|
if (isalpha(c)) {
|
|
char *t = lexGetWord();
|
|
yylval.str = t;
|
|
if (!stricmp(t, "begin")) {
|
|
return match_begin_end_name(0);
|
|
}
|
|
else if (!stricmp(t,"end")) {
|
|
return match_begin_end_name(1);
|
|
}
|
|
else {
|
|
DBG_(("db: ID '%s'\n", t));
|
|
return ID;
|
|
}
|
|
}
|
|
else {
|
|
/* unknow token */
|
|
return 0;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
/***************************************************************************/
|
|
/*** Public Functions ****/
|
|
/***************************************************************************/
|
|
|
|
static VObject* Parse_MIMEHelper(void)
|
|
{
|
|
ObjStackTop = -1;
|
|
mime_numErrors = 0;
|
|
mime_lineNum = 1;
|
|
vObjList = 0;
|
|
curObj = 0;
|
|
|
|
if (yyparse() != 0) {
|
|
finiLex();
|
|
return 0;
|
|
}
|
|
|
|
finiLex();
|
|
return vObjList;
|
|
}
|
|
|
|
/***************************************************************************/
|
|
DLLEXPORT(VObject*) Parse_MIME(const char *input, unsigned long len)
|
|
{
|
|
initLex(input, len, 0);
|
|
return Parse_MIMEHelper();
|
|
}
|
|
|
|
|
|
#if INCLUDEMFC
|
|
|
|
DLLEXPORT(VObject*) Parse_MIME_FromFile(CFile *file)
|
|
{
|
|
unsigned long startPos;
|
|
VObject *result;
|
|
|
|
initLex(0,-1,file);
|
|
startPos = file->GetPosition();
|
|
if (!(result = Parse_MIMEHelper()))
|
|
file->Seek(startPos, CFile::begin);
|
|
return result;
|
|
}
|
|
|
|
#else
|
|
|
|
VObject* Parse_MIME_FromFile(FILE *file)
|
|
{
|
|
VObject *result;
|
|
long startPos;
|
|
|
|
initLex(0,(unsigned long)-1,file);
|
|
startPos = ftell(file);
|
|
setCRLFmode( 0 ); /* lexLookahead() will detect CRLF/NL input */
|
|
if (!(result = Parse_MIMEHelper())) {
|
|
fseek(file,startPos,SEEK_SET);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
DLLEXPORT(VObject*) Parse_MIME_FromFileName(char *fname)
|
|
{
|
|
FILE *fp = fopen(fname,"r");
|
|
if (fp) {
|
|
VObject* o = Parse_MIME_FromFile(fp);
|
|
fclose(fp);
|
|
return o;
|
|
}
|
|
else {
|
|
char msg[17+256+14+1];
|
|
sprintf(msg, "can't open file '%.256s' for reading\n", fname);
|
|
mime_error_(msg);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
/***************************************************************************/
|
|
#if 0
|
|
static void YYDebug(const char *s)
|
|
{
|
|
Parse_Debug(s);
|
|
}
|
|
#endif
|
|
|
|
|
|
static MimeErrorHandler mimeErrorHandler;
|
|
|
|
DLLEXPORT(void) registerMimeErrorHandler(MimeErrorHandler me)
|
|
{
|
|
mimeErrorHandler = me;
|
|
}
|
|
|
|
static void mime_error(char *s)
|
|
{
|
|
char msg[256];
|
|
if (mimeErrorHandler) {
|
|
sprintf(msg,"%s at line %d", s, mime_lineNum);
|
|
mimeErrorHandler(msg);
|
|
}
|
|
}
|
|
|
|
static void mime_error_(char *s)
|
|
{
|
|
if (mimeErrorHandler) {
|
|
mimeErrorHandler(s);
|
|
}
|
|
}
|
|
|
|
|