/* A Bison parser, made from sieve.y by GNU bison 1.35. */ #define YYBISON 1 /* Identify Bison output. */ # define NUMBER 257 # define STRING 258 # define IF 259 # define ELSIF 260 # define ELSE 261 # define REJCT 262 # define FILEINTO 263 # define REDIRECT 264 # define KEEP 265 # define STOP 266 # define DISCARD 267 # define VACATION 268 # define REQUIRE 269 # define SETFLAG 270 # define ADDFLAG 271 # define REMOVEFLAG 272 # define MARK 273 # define UNMARK 274 # define NOTIFY 275 # define DENOTIFY 276 # define ANYOF 277 # define ALLOF 278 # define EXISTS 279 # define SFALSE 280 # define STRUE 281 # define HEADER 282 # define NOT 283 # define SIZE 284 # define ADDRESS 285 # define ENVELOPE 286 # define COMPARATOR 287 # define IS 288 # define CONTAINS 289 # define MATCHES 290 # define REGEX 291 # define COUNT 292 # define VALUE 293 # define OVER 294 # define UNDER 295 # define GT 296 # define GE 297 # define LT 298 # define LE 299 # define EQ 300 # define NE 301 # define ALL 302 # define LOCALPART 303 # define DOMAIN 304 # define USER 305 # define DETAIL 306 # define DAYS 307 # define ADDRESSES 308 # define SUBJECT 309 # define MIME 310 # define METHOD 311 # define ID 312 # define OPTIONS 313 # define LOW 314 # define NORMAL 315 # define HIGH 316 # define ANY 317 # define MESSAGE 318 #line 1 "sieve.y" /* sieve.y -- sieve parser * Larry Greenfield * $Id: sieve.c,v 1.4 2005/03/05 00:37:38 dasenbro Exp $ */ /*********************************************************** Copyright 1999 by Carnegie Mellon University All Rights Reserved Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Carnegie Mellon University not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ******************************************************************/ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #include #include "xmalloc.h" #include "comparator.h" #include "interp.h" #include "script.h" #include "tree.h" #include "../lib/util.h" #include "../lib/imparse.h" #include "../lib/libconfig.h" /* definitions */ extern int addrparse(void); struct vtags { int days; stringlist_t *addresses; char *subject; int mime; }; struct htags { char *comparator; int comptag; int relation; }; struct aetags { int addrtag; char *comparator; int comptag; int relation; }; struct ntags { char *method; char *id; stringlist_t *options; int priority; char *message; }; struct dtags { int comptag; int relation; void *pattern; int priority; }; static commandlist_t *ret; static sieve_script_t *parse_script; static int check_reqs(stringlist_t *sl); static test_t *build_address(int t, struct aetags *ae, stringlist_t *sl, stringlist_t *pl); static test_t *build_header(int t, struct htags *h, stringlist_t *sl, stringlist_t *pl); static commandlist_t *build_vacation(int t, struct vtags *h, char *s); static commandlist_t *build_notify(int t, struct ntags *n); static commandlist_t *build_denotify(int t, struct dtags *n); static struct aetags *new_aetags(void); static struct aetags *canon_aetags(struct aetags *ae); static void free_aetags(struct aetags *ae); static struct htags *new_htags(void); static struct htags *canon_htags(struct htags *h); static void free_htags(struct htags *h); static struct vtags *new_vtags(void); static struct vtags *canon_vtags(struct vtags *v); static void free_vtags(struct vtags *v); static struct ntags *new_ntags(void); static struct ntags *canon_ntags(struct ntags *n); static void free_ntags(struct ntags *n); static struct dtags *new_dtags(void); static struct dtags *canon_dtags(struct dtags *d); static void free_dtags(struct dtags *d); static int verify_stringlist(stringlist_t *sl, int (*verify)(char *)); static int verify_mailbox(char *s); static int verify_address(char *s); static int verify_header(char *s); static int verify_addrheader(char *s); static int verify_envelope(char *s); static int verify_flag(char *s); static int verify_relat(char *s); #ifdef ENABLE_REGEX static int verify_regex(char *s, int cflags); static int verify_regexs(stringlist_t *sl, char *comp); #endif static int verify_utf8(char *s); int yyerror(char *msg); extern int yylex(void); extern void yyrestart(FILE *f); #define YYERROR_VERBOSE /* i want better error messages! */ #line 132 "sieve.y" #ifndef YYSTYPE typedef union { int nval; char *sval; stringlist_t *sl; test_t *test; testlist_t *testl; commandlist_t *cl; struct vtags *vtag; struct aetags *aetag; struct htags *htag; struct ntags *ntag; struct dtags *dtag; } yystype; # define YYSTYPE yystype # define YYSTYPE_IS_TRIVIAL 1 #endif #ifndef YYDEBUG # define YYDEBUG 0 #endif #define YYFINAL 139 #define YYFLAG -32768 #define YYNTBASE 73 /* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */ #define YYTRANSLATE(x) ((unsigned)(x) <= 318 ? yytranslate[x] : 97) /* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */ static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 71, 72, 2, 2, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 65, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 66, 2, 67, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 69, 2, 70, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64 }; #if YYDEBUG static const short yyprhs[] = { 0, 0, 2, 5, 6, 9, 13, 15, 18, 21, 26, 29, 30, 35, 38, 41, 44, 47, 49, 51, 53, 57, 60, 63, 66, 68, 70, 73, 76, 77, 81, 85, 89, 92, 96, 97, 100, 104, 108, 110, 112, 114, 115, 119, 123, 127, 130, 134, 136, 138, 142, 146, 149, 152, 155, 158, 160, 162, 167, 172, 175, 179, 181, 183, 185, 186, 189, 192, 196, 200, 201, 204, 208, 212, 214, 216, 218, 220, 222, 224, 226, 228, 230, 232, 234, 236, 238, 242, 244 }; static const short yyrhs[] = { 74, 0, 74, 76, 0, 0, 75, 74, 0, 15, 84, 65, 0, 77, 0, 77, 76, 0, 79, 65, 0, 5, 87, 86, 78, 0, 1, 65, 0, 0, 6, 87, 86, 78, 0, 7, 86, 0, 8, 4, 0, 9, 4, 0, 10, 4, 0, 11, 0, 12, 0, 13, 0, 14, 83, 4, 0, 16, 84, 0, 17, 84, 0, 18, 84, 0, 19, 0, 20, 0, 21, 80, 0, 22, 81, 0, 0, 80, 58, 4, 0, 80, 57, 4, 0, 80, 59, 84, 0, 80, 82, 0, 80, 64, 4, 0, 0, 81, 82, 0, 81, 92, 4, 0, 81, 93, 4, 0, 60, 0, 61, 0, 62, 0, 0, 83, 53, 3, 0, 83, 54, 84, 0, 83, 55, 4, 0, 83, 56, 0, 66, 85, 67, 0, 4, 0, 4, 0, 4, 68, 85, 0, 69, 76, 70, 0, 69, 70, 0, 23, 95, 0, 24, 95, 0, 25, 84, 0, 26, 0, 27, 0, 28, 90, 84, 84, 0, 88, 89, 84, 84, 0, 29, 87, 0, 30, 94, 3, 0, 1, 0, 31, 0, 32, 0, 0, 89, 91, 0, 89, 92, 0, 89, 93, 4, 0, 89, 33, 4, 0, 0, 90, 92, 0, 90, 93, 4, 0, 90, 33, 4, 0, 48, 0, 49, 0, 50, 0, 51, 0, 52, 0, 34, 0, 35, 0, 36, 0, 37, 0, 38, 0, 39, 0, 40, 0, 41, 0, 71, 96, 72, 0, 87, 0, 87, 68, 96, 0 }; #endif #if YYDEBUG /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ static const short yyrline[] = { 0, 173, 174, 177, 178, 181, 187, 188, 191, 192, 193, 196, 197, 198, 201, 210, 219, 224, 225, 226, 227, 236, 245, 254, 263, 268, 274, 282, 293, 294, 297, 300, 303, 306, 311, 312, 315, 330, 340, 341, 342, 345, 346, 349, 357, 363, 369, 370, 373, 374, 377, 378, 381, 382, 383, 384, 385, 386, 410, 432, 433, 435, 438, 439, 446, 447, 452, 456, 464, 474, 475, 479, 487, 498, 499, 500, 501, 506, 512, 513, 514, 515, 522, 527, 535, 536, 539, 542, 543 }; #endif #if (YYDEBUG) || defined YYERROR_VERBOSE /* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */ static const char *const yytname[] = { "$", "error", "$undefined.", "NUMBER", "STRING", "IF", "ELSIF", "ELSE", "REJCT", "FILEINTO", "REDIRECT", "KEEP", "STOP", "DISCARD", "VACATION", "REQUIRE", "SETFLAG", "ADDFLAG", "REMOVEFLAG", "MARK", "UNMARK", "NOTIFY", "DENOTIFY", "ANYOF", "ALLOF", "EXISTS", "SFALSE", "STRUE", "HEADER", "NOT", "SIZE", "ADDRESS", "ENVELOPE", "COMPARATOR", "IS", "CONTAINS", "MATCHES", "REGEX", "COUNT", "VALUE", "OVER", "UNDER", "GT", "GE", "LT", "LE", "EQ", "NE", "ALL", "LOCALPART", "DOMAIN", "USER", "DETAIL", "DAYS", "ADDRESSES", "SUBJECT", "MIME", "METHOD", "ID", "OPTIONS", "LOW", "NORMAL", "HIGH", "ANY", "MESSAGE", "';'", "'['", "']'", "','", "'{'", "'}'", "'('", "')'", "start", "reqs", "require", "commands", "command", "elsif", "action", "ntags", "dtags", "priority", "vtags", "stringlist", "strings", "block", "test", "addrorenv", "aetags", "htags", "addrparttag", "comptag", "relcomp", "sizetag", "testlist", "tests", 0 }; #endif /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ static const short yyr1[] = { 0, 73, 73, 74, 74, 75, 76, 76, 77, 77, 77, 78, 78, 78, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 80, 80, 80, 80, 80, 80, 81, 81, 81, 81, 82, 82, 82, 83, 83, 83, 83, 83, 84, 84, 85, 85, 86, 86, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 88, 88, 89, 89, 89, 89, 89, 90, 90, 90, 90, 91, 91, 91, 91, 91, 92, 92, 92, 92, 93, 93, 94, 94, 95, 96, 96 }; /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ static const short yyr2[] = { 0, 1, 2, 0, 2, 3, 1, 2, 2, 4, 2, 0, 4, 2, 2, 2, 2, 1, 1, 1, 3, 2, 2, 2, 1, 1, 2, 2, 0, 3, 3, 3, 2, 3, 0, 2, 3, 3, 1, 1, 1, 0, 3, 3, 3, 2, 3, 1, 1, 3, 3, 2, 2, 2, 2, 1, 1, 4, 4, 2, 3, 1, 1, 1, 0, 2, 2, 3, 3, 0, 2, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3 }; /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE doesn't specify something else to do. Zero means the default is an error. */ static const short yydefact[] = { 3, 0, 0, 3, 47, 0, 0, 0, 0, 0, 0, 0, 17, 18, 19, 41, 0, 0, 0, 24, 25, 28, 34, 2, 0, 0, 4, 48, 0, 5, 10, 61, 0, 0, 0, 55, 56, 69, 0, 0, 62, 63, 0, 64, 14, 15, 16, 0, 21, 22, 23, 26, 27, 7, 8, 0, 46, 0, 52, 53, 54, 0, 59, 84, 85, 0, 0, 11, 0, 20, 0, 0, 0, 45, 0, 0, 0, 38, 39, 40, 0, 32, 78, 79, 80, 81, 82, 83, 35, 0, 0, 49, 87, 0, 0, 0, 70, 0, 60, 51, 0, 0, 0, 9, 0, 73, 74, 75, 76, 77, 0, 65, 66, 0, 42, 43, 44, 30, 29, 31, 33, 36, 37, 0, 86, 72, 57, 71, 50, 0, 13, 68, 58, 67, 88, 11, 12, 0, 0, 0 }; static const short yydefgoto[] = { 137, 2, 3, 23, 24, 103, 25, 51, 52, 81, 47, 6, 28, 67, 92, 43, 68, 61, 111, 89, 90, 65, 58, 93 }; static const short yypact[] = { -4, 11, 153, -4,-32768, 13, -43, -41, 116, 21, 38, 40,-32768,-32768,-32768,-32768, 11, 11, 11,-32768, -32768,-32768,-32768,-32768, 53, -14,-32768, -12, -10,-32768, -32768,-32768, 9, 9, 11,-32768,-32768,-32768, 116, 7, -32768,-32768, 12,-32768,-32768,-32768,-32768, 37,-32768,-32768, -32768, -52, 90,-32768,-32768, 13,-32768, 116,-32768,-32768, -32768, 72,-32768,-32768,-32768, 56, 18, 43, 64,-32768, 75, 11, 78,-32768, 79, 80, 11,-32768,-32768,-32768, 81,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 82, 83,-32768, 27, 17, 100, 11,-32768, 114,-32768,-32768, 49, 116, 12,-32768, 117,-32768,-32768,-32768,-32768,-32768, 11,-32768,-32768, 118,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768, 116,-32768,-32768,-32768,-32768,-32768, 12, -32768,-32768,-32768,-32768,-32768, 43,-32768, 120, 131,-32768 }; static const short yypgoto[] = { -32768, 129,-32768, -20,-32768, -2,-32768,-32768,-32768, 84, -32768, -16, 94, -86, -5,-32768,-32768,-32768,-32768, -48, -47,-32768, 101, 14 }; #define YYLAST 175 static const short yytable[] = { 48, 49, 50, 42, 53, 74, 75, 76, 77, 78, 79, 1, 80, 96, 97, 4, 130, 27, 60, 7, 112, 113, 29, 8, 30, 44, 9, 10, 11, 12, 13, 14, 15, 62, 16, 17, 18, 19, 20, 21, 22, 69, 45, 135, 46, 95, 100, 63, 64, 101, 102, 54, 110, -6, 7, 115, 55, 56, 8, 98, 119, 9, 10, 11, 12, 13, 14, 15, 4, 16, 17, 18, 19, 20, 21, 22, 4, 5, 114, 126, 57, 66, 116, 117, 118, 120, 121, 122, 99, 124, 70, 71, 72, 73, 132, 123, 129, 104, 82, 83, 84, 85, 86, 87, 125, 94, 82, 83, 84, 85, 86, 87, 105, 106, 107, 108, 109, 31, 127, 128, 138, 131, 133, -6, 82, 83, 84, 85, 86, 87, 5, 139, 26, 136, 59, 0, 88, 134, 5, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 91, 77, 78, 79, -1, 7, 0, 0, 0, 8, 0, 0, 9, 10, 11, 12, 13, 14, 15, 0, 16, 17, 18, 19, 20, 21, 22 }; static const short yycheck[] = { 16, 17, 18, 8, 24, 57, 58, 59, 60, 61, 62, 15, 64, 61, 61, 4, 102, 4, 34, 1, 68, 68, 65, 5, 65, 4, 8, 9, 10, 11, 12, 13, 14, 38, 16, 17, 18, 19, 20, 21, 22, 4, 4, 129, 4, 61, 66, 40, 41, 6, 7, 65, 68, 0, 1, 71, 68, 67, 5, 3, 76, 8, 9, 10, 11, 12, 13, 14, 4, 16, 17, 18, 19, 20, 21, 22, 4, 66, 3, 95, 71, 69, 4, 4, 4, 4, 4, 4, 70, 72, 53, 54, 55, 56, 110, 68, 101, 33, 34, 35, 36, 37, 38, 39, 4, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, 51, 52, 1, 4, 70, 0, 4, 4, 70, 34, 35, 36, 37, 38, 39, 66, 0, 3, 135, 33, -1, 52, 123, 66, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 55, 60, 61, 62, 0, 1, -1, -1, -1, 5, -1, -1, 8, 9, 10, 11, 12, 13, 14, -1, 16, 17, 18, 19, 20, 21, 22 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/local/share/bison/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* All symbols defined below should begin with yy or YY, to avoid infringing on user name space. This should be done even for local variables, as they might otherwise be expanded by user macros. There are some unavoidable exceptions within include files to define necessary library symbols; they are noted "INFRINGES ON USER NAME SPACE" below. */ #if ! defined (yyoverflow) || defined (YYERROR_VERBOSE) /* The parser invokes alloca or malloc; define the necessary symbols. */ # if YYSTACK_USE_ALLOCA # define YYSTACK_ALLOC alloca # else # ifndef YYSTACK_USE_ALLOCA # if defined (alloca) || defined (_ALLOCA_H) # define YYSTACK_ALLOC alloca # else # ifdef __GNUC__ # define YYSTACK_ALLOC __builtin_alloca # endif # endif # endif # endif # ifdef YYSTACK_ALLOC /* Pacify GCC's `empty if-body' warning. */ # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) # else # if defined (__STDC__) || defined (__cplusplus) # include /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # endif # define YYSTACK_ALLOC malloc # define YYSTACK_FREE free # endif #endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */ #if (! defined (yyoverflow) \ && (! defined (__cplusplus) \ || (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union yyalloc { short yyss; YYSTYPE yyvs; # if YYLSP_NEEDED YYLTYPE yyls; # endif }; /* The size of the maximum gap between one aligned stack and the next. */ # define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ # if YYLSP_NEEDED # define YYSTACK_BYTES(N) \ ((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ + 2 * YYSTACK_GAP_MAX) # else # define YYSTACK_BYTES(N) \ ((N) * (sizeof (short) + sizeof (YYSTYPE)) \ + YYSTACK_GAP_MAX) # endif /* Copy COUNT objects from FROM to TO. The source and destination do not overlap. */ # ifndef YYCOPY # if 1 < __GNUC__ # define YYCOPY(To, From, Count) \ __builtin_memcpy (To, From, (Count) * sizeof (*(From))) # else # define YYCOPY(To, From, Count) \ do \ { \ register YYSIZE_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (To)[yyi] = (From)[yyi]; \ } \ while (0) # endif # endif /* Relocate STACK from its old location to the new one. The local variables YYSIZE and YYSTACKSIZE give the old and new number of elements in the stack, and YYPTR gives the new location of the stack. Advance YYPTR to a properly aligned location for the next stack. */ # define YYSTACK_RELOCATE(Stack) \ do \ { \ YYSIZE_T yynewbytes; \ YYCOPY (&yyptr->Stack, Stack, yysize); \ Stack = &yyptr->Stack; \ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \ yyptr += yynewbytes / sizeof (*yyptr); \ } \ while (0) #endif #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) # define YYSIZE_T __SIZE_TYPE__ #endif #if ! defined (YYSIZE_T) && defined (size_t) # define YYSIZE_T size_t #endif #if ! defined (YYSIZE_T) # if defined (__STDC__) || defined (__cplusplus) # include /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # endif #endif #if ! defined (YYSIZE_T) # define YYSIZE_T unsigned int #endif #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { \ yyerror ("syntax error: cannot back up"); \ YYERROR; \ } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Compute the default location (before the actions are run). When YYLLOC_DEFAULT is run, CURRENT is set the location of the first token. By default, to implement support for ranges, extend its range to the last symbol. */ #ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ Current.last_line = Rhs[N].last_line; \ Current.last_column = Rhs[N].last_column; #endif /* YYLEX -- calling `yylex' with the right arguments. */ #if YYPURE # if YYLSP_NEEDED # ifdef YYLEX_PARAM # define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) # else # define YYLEX yylex (&yylval, &yylloc) # endif # else /* !YYLSP_NEEDED */ # ifdef YYLEX_PARAM # define YYLEX yylex (&yylval, YYLEX_PARAM) # else # define YYLEX yylex (&yylval) # endif # endif /* !YYLSP_NEEDED */ #else /* !YYPURE */ # define YYLEX yylex () #endif /* !YYPURE */ /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF # include /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #if YYMAXDEPTH == 0 # undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif #ifdef YYERROR_VERBOSE # ifndef yystrlen # if defined (__GLIBC__) && defined (_STRING_H) # define yystrlen strlen # else /* Return the length of YYSTR. */ static YYSIZE_T # if defined (__STDC__) || defined (__cplusplus) yystrlen (const char *yystr) # else yystrlen (yystr) const char *yystr; # endif { register const char *yys = yystr; while (*yys++ != '\0') continue; return yys - yystr - 1; } # endif # endif # ifndef yystpcpy # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ static char * # if defined (__STDC__) || defined (__cplusplus) yystpcpy (char *yydest, const char *yysrc) # else yystpcpy (yydest, yysrc) char *yydest; const char *yysrc; # endif { register char *yyd = yydest; register const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif #endif #line 315 "/usr/local/share/bison/bison.simple" /* The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef YYPARSE_PARAM # if defined (__STDC__) || defined (__cplusplus) # define YYPARSE_PARAM_ARG void *YYPARSE_PARAM # define YYPARSE_PARAM_DECL # else # define YYPARSE_PARAM_ARG YYPARSE_PARAM # define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; # endif #else /* !YYPARSE_PARAM */ # define YYPARSE_PARAM_ARG # define YYPARSE_PARAM_DECL #endif /* !YYPARSE_PARAM */ /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ # ifdef YYPARSE_PARAM int yyparse (void *); # else int yyparse (void); # endif #endif /* YY_DECL_VARIABLES -- depending whether we use a pure parser, variables are global, or local to YYPARSE. */ #define YY_DECL_NON_LSP_VARIABLES \ /* The lookahead symbol. */ \ int yychar; \ \ /* The semantic value of the lookahead symbol. */ \ YYSTYPE yylval; \ \ /* Number of parse errors so far. */ \ int yynerrs; #if YYLSP_NEEDED # define YY_DECL_VARIABLES \ YY_DECL_NON_LSP_VARIABLES \ \ /* Location data for the lookahead symbol. */ \ YYLTYPE yylloc; #else # define YY_DECL_VARIABLES \ YY_DECL_NON_LSP_VARIABLES #endif /* If nonreentrant, generate the variables here. */ #if !YYPURE YY_DECL_VARIABLES #endif /* !YYPURE */ int yyparse (YYPARSE_PARAM_ARG) YYPARSE_PARAM_DECL { /* If reentrant, generate the variables here. */ #if YYPURE YY_DECL_VARIABLES #endif /* !YYPURE */ register int yystate; register int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Lookahead token as an internal (translated) token number. */ int yychar1 = 0; /* Three stacks and their tools: `yyss': related to states, `yyvs': related to semantic values, `yyls': related to locations. Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ /* The state stack. */ short yyssa[YYINITDEPTH]; short *yyss = yyssa; register short *yyssp; /* The semantic value stack. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs = yyvsa; register YYSTYPE *yyvsp; #if YYLSP_NEEDED /* The location stack. */ YYLTYPE yylsa[YYINITDEPTH]; YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #endif #if YYLSP_NEEDED # define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else # define YYPOPSTACK (yyvsp--, yyssp--) #endif YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; #if YYLSP_NEEDED YYLTYPE yyloc; #endif /* When reducing, the number of symbols on the RHS of the reduced rule. */ int yylen; YYDPRINTF ((stderr, "Starting parse\n")); yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss; yyvsp = yyvs; #if YYLSP_NEEDED yylsp = yyls; #endif goto yysetstate; /*------------------------------------------------------------. | yynewstate -- Push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yyssp++; yysetstate: *yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; #ifdef yyoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ # if YYLSP_NEEDED YYLTYPE *yyls1 = yyls; /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yyls1, yysize * sizeof (*yylsp), &yystacksize); yyls = yyls1; # else yyoverflow ("parser stack overflow", &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); # endif yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ # ifndef YYSTACK_RELOCATE goto yyoverflowlab; # else /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) goto yyoverflowlab; yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; { short *yyss1 = yyss; union yyalloc *yyptr = (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyoverflowlab; YYSTACK_RELOCATE (yyss); YYSTACK_RELOCATE (yyvs); # if YYLSP_NEEDED YYSTACK_RELOCATE (yyls); # endif # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; #if YYLSP_NEEDED yylsp = yyls + yysize - 1; #endif YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); if (yyssp >= yyss + yystacksize - 1) YYABORT; } YYDPRINTF ((stderr, "Entering state %d\n", yystate)); goto yybackup; /*-----------. | yybackup. | `-----------*/ yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yychar1 = YYTRANSLATE (yychar); #if YYDEBUG /* We have to keep this `#if YYDEBUG', since we use variables which are defined only if `YYDEBUG' is set. */ if (yydebug) { YYFPRINTF (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ # ifdef YYPRINT YYPRINT (stderr, yychar, yylval); # endif YYFPRINTF (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ YYDPRINTF ((stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1])); /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #if YYLSP_NEEDED *++yylsp = yylloc; #endif /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. Otherwise, the following line sets YYVAL to the semantic value of the lookahead token. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; #if YYLSP_NEEDED /* Similarly for the default location. Let the user run additional commands if for instance locations are ranges. */ yyloc = yylsp[1-yylen]; YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); #endif #if YYDEBUG /* We have to keep this `#if YYDEBUG', since we use variables which are defined only if `YYDEBUG' is set. */ if (yydebug) { int yyi; YYFPRINTF (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++) YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: #line 173 "sieve.y" { ret = NULL; } break; case 2: #line 174 "sieve.y" { ret = yyvsp[0].cl; } break; case 5: #line 181 "sieve.y" { if (!check_reqs(yyvsp[-1].sl)) { yyerror("unsupported feature"); YYERROR; } } break; case 6: #line 187 "sieve.y" { yyval.cl = yyvsp[0].cl; } break; case 7: #line 188 "sieve.y" { yyvsp[-1].cl->next = yyvsp[0].cl; yyval.cl = yyvsp[-1].cl; } break; case 8: #line 191 "sieve.y" { yyval.cl = yyvsp[-1].cl; } break; case 9: #line 192 "sieve.y" { yyval.cl = new_if(yyvsp[-2].test, yyvsp[-1].cl, yyvsp[0].cl); } break; case 10: #line 193 "sieve.y" { yyval.cl = new_command(STOP); } break; case 11: #line 196 "sieve.y" { yyval.cl = NULL; } break; case 12: #line 197 "sieve.y" { yyval.cl = new_if(yyvsp[-2].test, yyvsp[-1].cl, yyvsp[0].cl); } break; case 13: #line 198 "sieve.y" { yyval.cl = yyvsp[0].cl; } break; case 14: #line 201 "sieve.y" { if (!parse_script->support.reject) { yyerror("reject not required"); YYERROR; } if (!verify_utf8(yyvsp[0].sval)) { YYERROR; /* vu should call yyerror() */ } yyval.cl = new_command(REJCT); yyval.cl->u.str = yyvsp[0].sval; } break; case 15: #line 210 "sieve.y" { if (!parse_script->support.fileinto) { yyerror("fileinto not required"); YYERROR; } if (!verify_mailbox(yyvsp[0].sval)) { YYERROR; /* vm should call yyerror() */ } yyval.cl = new_command(FILEINTO); yyval.cl->u.str = yyvsp[0].sval; } break; case 16: #line 219 "sieve.y" { yyval.cl = new_command(REDIRECT); if (!verify_address(yyvsp[0].sval)) { YYERROR; /* va should call yyerror() */ } yyval.cl->u.str = yyvsp[0].sval; } break; case 17: #line 224 "sieve.y" { yyval.cl = new_command(KEEP); } break; case 18: #line 225 "sieve.y" { yyval.cl = new_command(STOP); } break; case 19: #line 226 "sieve.y" { yyval.cl = new_command(DISCARD); } break; case 20: #line 227 "sieve.y" { if (!parse_script->support.vacation) { yyerror("vacation not required"); YYERROR; } if ((yyvsp[-1].vtag->mime == -1) && !verify_utf8(yyvsp[0].sval)) { YYERROR; /* vu should call yyerror() */ } yyval.cl = build_vacation(VACATION, canon_vtags(yyvsp[-1].vtag), yyvsp[0].sval); } break; case 21: #line 236 "sieve.y" { if (!parse_script->support.imapflags) { yyerror("imapflags not required"); YYERROR; } if (!verify_stringlist(yyvsp[0].sl, verify_flag)) { YYERROR; /* vf should call yyerror() */ } yyval.cl = new_command(SETFLAG); yyval.cl->u.sl = yyvsp[0].sl; } break; case 22: #line 245 "sieve.y" { if (!parse_script->support.imapflags) { yyerror("imapflags not required"); YYERROR; } if (!verify_stringlist(yyvsp[0].sl, verify_flag)) { YYERROR; /* vf should call yyerror() */ } yyval.cl = new_command(ADDFLAG); yyval.cl->u.sl = yyvsp[0].sl; } break; case 23: #line 254 "sieve.y" { if (!parse_script->support.imapflags) { yyerror("imapflags not required"); YYERROR; } if (!verify_stringlist(yyvsp[0].sl, verify_flag)) { YYERROR; /* vf should call yyerror() */ } yyval.cl = new_command(REMOVEFLAG); yyval.cl->u.sl = yyvsp[0].sl; } break; case 24: #line 263 "sieve.y" { if (!parse_script->support.imapflags) { yyerror("imapflags not required"); YYERROR; } yyval.cl = new_command(MARK); } break; case 25: #line 268 "sieve.y" { if (!parse_script->support.imapflags) { yyerror("imapflags not required"); YYERROR; } yyval.cl = new_command(UNMARK); } break; case 26: #line 274 "sieve.y" { if (!parse_script->support.notify) { yyerror("notify not required"); yyval.cl = new_command(NOTIFY); YYERROR; } else { yyval.cl = build_notify(NOTIFY, canon_ntags(yyvsp[0].ntag)); } } break; case 27: #line 282 "sieve.y" { if (!parse_script->support.notify) { yyerror("notify not required"); yyval.cl = new_command(DENOTIFY); YYERROR; } else { yyval.cl = build_denotify(DENOTIFY, canon_dtags(yyvsp[0].dtag)); if (yyval.cl == NULL) { yyerror("unable to find a compatible comparator"); YYERROR; } } } break; case 28: #line 293 "sieve.y" { yyval.ntag = new_ntags(); } break; case 29: #line 294 "sieve.y" { if (yyval.ntag->id != NULL) { yyerror("duplicate :method"); YYERROR; } else { yyval.ntag->id = yyvsp[0].sval; } } break; case 30: #line 297 "sieve.y" { if (yyval.ntag->method != NULL) { yyerror("duplicate :method"); YYERROR; } else { yyval.ntag->method = yyvsp[0].sval; } } break; case 31: #line 300 "sieve.y" { if (yyval.ntag->options != NULL) { yyerror("duplicate :options"); YYERROR; } else { yyval.ntag->options = yyvsp[0].sl; } } break; case 32: #line 303 "sieve.y" { if (yyval.ntag->priority != -1) { yyerror("duplicate :priority"); YYERROR; } else { yyval.ntag->priority = yyvsp[0].nval; } } break; case 33: #line 306 "sieve.y" { if (yyval.ntag->message != NULL) { yyerror("duplicate :message"); YYERROR; } else { yyval.ntag->message = yyvsp[0].sval; } } break; case 34: #line 311 "sieve.y" { yyval.dtag = new_dtags(); } break; case 35: #line 312 "sieve.y" { if (yyval.dtag->priority != -1) { yyerror("duplicate priority level"); YYERROR; } else { yyval.dtag->priority = yyvsp[0].nval; } } break; case 36: #line 315 "sieve.y" { if (yyval.dtag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } yyval.dtag->comptag = yyvsp[-1].nval; #ifdef ENABLE_REGEX if (yyval.dtag->comptag == REGEX) { int cflags = REG_EXTENDED | REG_NOSUB | REG_ICASE; if (!verify_regex(yyvsp[0].sval, cflags)) { YYERROR; } } #endif yyval.dtag->pattern = yyvsp[0].sval; } break; case 37: #line 330 "sieve.y" { yyval.dtag = yyvsp[-2].dtag; if (yyval.dtag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } else { yyval.dtag->comptag = yyvsp[-1].nval; yyval.dtag->relation = verify_relat(yyvsp[0].sval); if (yyval.dtag->relation==-1) {YYERROR; /*vr called yyerror()*/ } } } break; case 38: #line 340 "sieve.y" { yyval.nval = LOW; } break; case 39: #line 341 "sieve.y" { yyval.nval = NORMAL; } break; case 40: #line 342 "sieve.y" { yyval.nval = HIGH; } break; case 41: #line 345 "sieve.y" { yyval.vtag = new_vtags(); } break; case 42: #line 346 "sieve.y" { if (yyval.vtag->days != -1) { yyerror("duplicate :days"); YYERROR; } else { yyval.vtag->days = yyvsp[0].nval; } } break; case 43: #line 349 "sieve.y" { if (yyval.vtag->addresses != NULL) { yyerror("duplicate :addresses"); YYERROR; } else if (!verify_stringlist(yyvsp[0].sl, verify_address)) { YYERROR; } else { yyval.vtag->addresses = yyvsp[0].sl; } } break; case 44: #line 357 "sieve.y" { if (yyval.vtag->subject != NULL) { yyerror("duplicate :subject"); YYERROR; } else if (!verify_utf8(yyvsp[0].sval)) { YYERROR; /* vu should call yyerror() */ } else { yyval.vtag->subject = yyvsp[0].sval; } } break; case 45: #line 363 "sieve.y" { if (yyval.vtag->mime != -1) { yyerror("duplicate :mime"); YYERROR; } else { yyval.vtag->mime = MIME; } } break; case 46: #line 369 "sieve.y" { yyval.sl = yyvsp[-1].sl; } break; case 47: #line 370 "sieve.y" { yyval.sl = new_sl(yyvsp[0].sval, NULL); } break; case 48: #line 373 "sieve.y" { yyval.sl = new_sl(yyvsp[0].sval, NULL); } break; case 49: #line 374 "sieve.y" { yyval.sl = new_sl(yyvsp[-2].sval, yyvsp[0].sl); } break; case 50: #line 377 "sieve.y" { yyval.cl = yyvsp[-1].cl; } break; case 51: #line 378 "sieve.y" { yyval.cl = NULL; } break; case 52: #line 381 "sieve.y" { yyval.test = new_test(ANYOF); yyval.test->u.tl = yyvsp[0].testl; } break; case 53: #line 382 "sieve.y" { yyval.test = new_test(ALLOF); yyval.test->u.tl = yyvsp[0].testl; } break; case 54: #line 383 "sieve.y" { yyval.test = new_test(EXISTS); yyval.test->u.sl = yyvsp[0].sl; } break; case 55: #line 384 "sieve.y" { yyval.test = new_test(SFALSE); } break; case 56: #line 385 "sieve.y" { yyval.test = new_test(STRUE); } break; case 57: #line 387 "sieve.y" { if (!verify_stringlist(yyvsp[-1].sl, verify_header)) { YYERROR; /* vh should call yyerror() */ } if (!verify_stringlist(yyvsp[0].sl, verify_utf8)) { YYERROR; /* vu should call yyerror() */ } yyvsp[-2].htag = canon_htags(yyvsp[-2].htag); #ifdef ENABLE_REGEX if (yyvsp[-2].htag->comptag == REGEX) { if (!(verify_regexs(yyvsp[0].sl, yyvsp[-2].htag->comparator))) { YYERROR; } } #endif yyval.test = build_header(HEADER, yyvsp[-2].htag, yyvsp[-1].sl, yyvsp[0].sl); if (yyval.test == NULL) { yyerror("unable to find a compatible comparator"); YYERROR; } } break; case 58: #line 411 "sieve.y" { if ((yyvsp[-3].nval == ADDRESS) && !verify_stringlist(yyvsp[-1].sl, verify_addrheader)) { YYERROR; } else if ((yyvsp[-3].nval == ENVELOPE) && !verify_stringlist(yyvsp[-1].sl, verify_envelope)) { YYERROR; } yyvsp[-2].aetag = canon_aetags(yyvsp[-2].aetag); #ifdef ENABLE_REGEX if (yyvsp[-2].aetag->comptag == REGEX) { if (!( verify_regexs(yyvsp[0].sl, yyvsp[-2].aetag->comparator))) { YYERROR; } } #endif yyval.test = build_address(yyvsp[-3].nval, yyvsp[-2].aetag, yyvsp[-1].sl, yyvsp[0].sl); if (yyval.test == NULL) { yyerror("unable to find a compatible comparator"); YYERROR; } } break; case 59: #line 432 "sieve.y" { yyval.test = new_test(NOT); yyval.test->u.t = yyvsp[0].test; } break; case 60: #line 433 "sieve.y" { yyval.test = new_test(SIZE); yyval.test->u.sz.t = yyvsp[-1].nval; yyval.test->u.sz.n = yyvsp[0].nval; } break; case 61: #line 435 "sieve.y" { yyval.test = NULL; } break; case 62: #line 438 "sieve.y" { yyval.nval = ADDRESS; } break; case 63: #line 439 "sieve.y" {if (!parse_script->support.envelope) {yyerror("envelope not required"); YYERROR;} else{yyval.nval = ENVELOPE; } } break; case 64: #line 446 "sieve.y" { yyval.aetag = new_aetags(); } break; case 65: #line 447 "sieve.y" { yyval.aetag = yyvsp[-1].aetag; if (yyval.aetag->addrtag != -1) { yyerror("duplicate or conflicting address part tag"); YYERROR; } else { yyval.aetag->addrtag = yyvsp[0].nval; } } break; case 66: #line 452 "sieve.y" { yyval.aetag = yyvsp[-1].aetag; if (yyval.aetag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } else { yyval.aetag->comptag = yyvsp[0].nval; } } break; case 67: #line 456 "sieve.y" { yyval.aetag = yyvsp[-2].aetag; if (yyval.aetag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } else { yyval.aetag->comptag = yyvsp[-1].nval; yyval.aetag->relation = verify_relat(yyvsp[0].sval); if (yyval.aetag->relation==-1) {YYERROR; /*vr called yyerror()*/ } } } break; case 68: #line 464 "sieve.y" { yyval.aetag = yyvsp[-2].aetag; if (yyval.aetag->comparator != NULL) { yyerror("duplicate comparator tag"); YYERROR; } else if (!strcmp(yyvsp[0].sval, "i;ascii-numeric") && !parse_script->support.i_ascii_numeric) { yyerror("comparator-i;ascii-numeric not required"); YYERROR; } else { yyval.aetag->comparator = yyvsp[0].sval; } } break; case 69: #line 474 "sieve.y" { yyval.htag = new_htags(); } break; case 70: #line 475 "sieve.y" { yyval.htag = yyvsp[-1].htag; if (yyval.htag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } else { yyval.htag->comptag = yyvsp[0].nval; } } break; case 71: #line 479 "sieve.y" { yyval.htag = yyvsp[-2].htag; if (yyval.htag->comptag != -1) { yyerror("duplicate comparator type tag"); YYERROR; } else { yyval.htag->comptag = yyvsp[-1].nval; yyval.htag->relation = verify_relat(yyvsp[0].sval); if (yyval.htag->relation==-1) {YYERROR; /*vr called yyerror()*/ } } } break; case 72: #line 487 "sieve.y" { yyval.htag = yyvsp[-2].htag; if (yyval.htag->comparator != NULL) { yyerror("duplicate comparator tag"); YYERROR; } else if (!strcmp(yyvsp[0].sval, "i;ascii-numeric") && !parse_script->support.i_ascii_numeric) { yyerror("comparator-i;ascii-numeric not required"); YYERROR; } else { yyval.htag->comparator = yyvsp[0].sval; } } break; case 73: #line 498 "sieve.y" { yyval.nval = ALL; } break; case 74: #line 499 "sieve.y" { yyval.nval = LOCALPART; } break; case 75: #line 500 "sieve.y" { yyval.nval = DOMAIN; } break; case 76: #line 501 "sieve.y" { if (!parse_script->support.subaddress) { yyerror("subaddress not required"); YYERROR; } yyval.nval = USER; } break; case 77: #line 506 "sieve.y" { if (!parse_script->support.subaddress) { yyerror("subaddress not required"); YYERROR; } yyval.nval = DETAIL; } break; case 78: #line 512 "sieve.y" { yyval.nval = IS; } break; case 79: #line 513 "sieve.y" { yyval.nval = CONTAINS; } break; case 80: #line 514 "sieve.y" { yyval.nval = MATCHES; } break; case 81: #line 515 "sieve.y" { if (!parse_script->support.regex) { yyerror("regex not required"); YYERROR; } yyval.nval = REGEX; } break; case 82: #line 522 "sieve.y" { if (!parse_script->support.relational) { yyerror("relational not required"); YYERROR; } yyval.nval = COUNT; } break; case 83: #line 527 "sieve.y" { if (!parse_script->support.relational) { yyerror("relational not required"); YYERROR; } yyval.nval = VALUE; } break; case 84: #line 535 "sieve.y" { yyval.nval = OVER; } break; case 85: #line 536 "sieve.y" { yyval.nval = UNDER; } break; case 86: #line 539 "sieve.y" { yyval.testl = yyvsp[-1].testl; } break; case 87: #line 542 "sieve.y" { yyval.testl = new_testlist(yyvsp[0].test, NULL); } break; case 88: #line 543 "sieve.y" { yyval.testl = new_testlist(yyvsp[-2].test, yyvsp[0].testl); } break; } #line 705 "/usr/local/share/bison/bison.simple" yyvsp -= yylen; yyssp -= yylen; #if YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG if (yydebug) { short *yyssp1 = yyss - 1; YYFPRINTF (stderr, "state stack now"); while (yyssp1 != yyssp) YYFPRINTF (stderr, " %d", *++yyssp1); YYFPRINTF (stderr, "\n"); } #endif *++yyvsp = yyval; #if YYLSP_NEEDED *++yylsp = yyloc; #endif /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; /*------------------------------------. | yyerrlab -- here on detecting error | `------------------------------------*/ yyerrlab: /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { YYSIZE_T yysize = 0; char *yymsg; int yyx, yycount; yycount = 0; /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. */ for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) if (yycheck[yyx + yyn] == yyx) yysize += yystrlen (yytname[yyx]) + 15, yycount++; yysize += yystrlen ("parse error, unexpected ") + 1; yysize += yystrlen (yytname[YYTRANSLATE (yychar)]); yymsg = (char *) YYSTACK_ALLOC (yysize); if (yymsg != 0) { char *yyp = yystpcpy (yymsg, "parse error, unexpected "); yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]); if (yycount < 5) { yycount = 0; for (yyx = yyn < 0 ? -yyn : 0; yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++) if (yycheck[yyx + yyn] == yyx) { const char *yyq = ! yycount ? ", expecting " : " or "; yyp = yystpcpy (yyp, yyq); yyp = yystpcpy (yyp, yytname[yyx]); yycount++; } } yyerror (yymsg); YYSTACK_FREE (yymsg); } else yyerror ("parse error; also virtual memory exhausted"); } else #endif /* defined (YYERROR_VERBOSE) */ yyerror ("parse error"); } goto yyerrlab1; /*--------------------------------------------------. | yyerrlab1 -- error raised explicitly by an action | `--------------------------------------------------*/ yyerrlab1: if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; YYDPRINTF ((stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1])); yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; /*-------------------------------------------------------------------. | yyerrdefault -- current state does not do anything special for the | | error token. | `-------------------------------------------------------------------*/ yyerrdefault: #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ /* If its default is to accept any token, ok. Otherwise pop it. */ yyn = yydefact[yystate]; if (yyn) goto yydefault; #endif /*---------------------------------------------------------------. | yyerrpop -- pop the current state because it cannot handle the | | error token | `---------------------------------------------------------------*/ yyerrpop: if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #if YYLSP_NEEDED yylsp--; #endif #if YYDEBUG if (yydebug) { short *yyssp1 = yyss - 1; YYFPRINTF (stderr, "Error: state stack now"); while (yyssp1 != yyssp) YYFPRINTF (stderr, " %d", *++yyssp1); YYFPRINTF (stderr, "\n"); } #endif /*--------------. | yyerrhandle. | `--------------*/ yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; YYDPRINTF ((stderr, "Shifting error token, ")); *++yyvsp = yylval; #if YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturn; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturn; /*---------------------------------------------. | yyoverflowab -- parser overflow comes here. | `---------------------------------------------*/ yyoverflowlab: yyerror ("parser stack overflow"); yyresult = 2; /* Fall through. */ yyreturn: #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif return yyresult; } #line 546 "sieve.y" commandlist_t *sieve_parse(sieve_script_t *script, FILE *f) { commandlist_t *t; parse_script = script; yyrestart(f); if (yyparse()) { t = NULL; } else { t = ret; } ret = NULL; return t; } int yyerror(char *msg) { extern int yylineno; int ret; parse_script->err++; if (parse_script->interp.err) { ret = parse_script->interp.err(yylineno, msg, parse_script->interp.interp_context, parse_script->script_context); } return 0; } static int check_reqs(stringlist_t *sl) { int i = 1; stringlist_t *s; while (sl != NULL) { s = sl; sl = sl->next; i &= script_require(parse_script, s->s); if (s->s) free(s->s); free(s); } return i; } static test_t *build_address(int t, struct aetags *ae, stringlist_t *sl, stringlist_t *pl) { test_t *ret = new_test(t); /* can be either ADDRESS or ENVELOPE */ assert((t == ADDRESS) || (t == ENVELOPE)); if (ret) { ret->u.ae.comptag = ae->comptag; ret->u.ae.relation=ae->relation; ret->u.ae.comparator=strdup(ae->comparator); ret->u.ae.sl = sl; ret->u.ae.pl = pl; ret->u.ae.addrpart = ae->addrtag; free_aetags(ae); } return ret; } static test_t *build_header(int t, struct htags *h, stringlist_t *sl, stringlist_t *pl) { test_t *ret = new_test(t); /* can be HEADER */ assert(t == HEADER); if (ret) { ret->u.h.comptag = h->comptag; ret->u.h.relation=h->relation; ret->u.h.comparator=strdup(h->comparator); ret->u.h.sl = sl; ret->u.h.pl = pl; free_htags(h); } return ret; } static commandlist_t *build_vacation(int t, struct vtags *v, char *reason) { commandlist_t *ret = new_command(t); assert(t == VACATION); if (ret) { ret->u.v.subject = v->subject; v->subject = NULL; ret->u.v.days = v->days; ret->u.v.mime = v->mime; ret->u.v.addresses = v->addresses; v->addresses = NULL; free_vtags(v); ret->u.v.message = reason; } return ret; } static commandlist_t *build_notify(int t, struct ntags *n) { commandlist_t *ret = new_command(t); assert(t == NOTIFY); if (ret) { ret->u.n.method = n->method; n->method = NULL; ret->u.n.id = n->id; n->id = NULL; ret->u.n.options = n->options; n->options = NULL; ret->u.n.priority = n->priority; ret->u.n.message = n->message; n->message = NULL; free_ntags(n); } return ret; } static commandlist_t *build_denotify(int t, struct dtags *d) { commandlist_t *ret = new_command(t); assert(t == DENOTIFY); if (ret) { ret->u.d.comptag = d->comptag; ret->u.d.relation=d->relation; ret->u.d.pattern = d->pattern; d->pattern = NULL; ret->u.d.priority = d->priority; free_dtags(d); } return ret; } static struct aetags *new_aetags(void) { struct aetags *r = (struct aetags *) xmalloc(sizeof(struct aetags)); r->addrtag = r->comptag = r->relation=-1; r->comparator=NULL; return r; } static struct aetags *canon_aetags(struct aetags *ae) { if (ae->addrtag == -1) { ae->addrtag = ALL; } if (ae->comparator == NULL) { ae->comparator = xstrdup("i;ascii-casemap"); } if (ae->comptag == -1) { ae->comptag = IS; } return ae; } static void free_aetags(struct aetags *ae) { free(ae->comparator); free(ae); } static struct htags *new_htags(void) { struct htags *r = (struct htags *) xmalloc(sizeof(struct htags)); r->comptag = r->relation= -1; r->comparator = NULL; return r; } static struct htags *canon_htags(struct htags *h) { if (h->comparator == NULL) { h->comparator = xstrdup("i;ascii-casemap"); } if (h->comptag == -1) { h->comptag = IS; } return h; } static void free_htags(struct htags *h) { free(h->comparator); free(h); } static struct vtags *new_vtags(void) { struct vtags *r = (struct vtags *) xmalloc(sizeof(struct vtags)); r->days = -1; r->addresses = NULL; r->subject = NULL; r->mime = -1; return r; } static struct vtags *canon_vtags(struct vtags *v) { assert(parse_script->interp.vacation != NULL); if (v->days == -1) { v->days = 7; } if (v->days < parse_script->interp.vacation->min_response) { v->days = parse_script->interp.vacation->min_response; } if (v->days > parse_script->interp.vacation->max_response) { v->days = parse_script->interp.vacation->max_response; } if (v->mime == -1) { v->mime = 0; } return v; } static void free_vtags(struct vtags *v) { if (v->addresses) { free_sl(v->addresses); } if (v->subject) { free(v->subject); } free(v); } static struct ntags *new_ntags(void) { struct ntags *r = (struct ntags *) xmalloc(sizeof(struct ntags)); r->method = NULL; r->id = NULL; r->options = NULL; r->priority = -1; r->message = NULL; return r; } static struct ntags *canon_ntags(struct ntags *n) { if (n->priority == -1) { n->priority = NORMAL; } if (n->message == NULL) { n->message = strdup("$from$: $subject$"); } if (n->method == NULL) { n->method = strdup("default"); } return n; } static struct dtags *canon_dtags(struct dtags *d) { if (d->priority == -1) { d->priority = ANY; } if (d->comptag == -1) { d->comptag = ANY; } return d; } static void free_ntags(struct ntags *n) { if (n->method) { free(n->method); } if (n->id) { free(n->id); } if (n->options) { free_sl(n->options); } if (n->message) { free(n->message); } free(n); } static struct dtags *new_dtags(void) { struct dtags *r = (struct dtags *) xmalloc(sizeof(struct dtags)); r->comptag = r->priority= r->relation = -1; r->pattern = NULL; return r; } static void free_dtags(struct dtags *d) { if (d->pattern) free(d->pattern); free(d); } static int verify_stringlist(stringlist_t *sl, int (*verify)(char *)) { for (; sl != NULL && verify(sl->s); sl = sl->next) ; return (sl == NULL); } char *addrptr; /* pointer to address string for address lexer */ char addrerr[500]; /* buffer for address parser error messages */ static int verify_address(char *s) { char errbuf[500]; addrptr = s; addrerr[0] = '\0'; /* paranoia */ if (addrparse()) { snprintf(errbuf, sizeof(errbuf), "address '%s': %s", s, addrerr); yyerror(errbuf); return 0; } return 1; } static int verify_mailbox(char *s) { if (!verify_utf8(s)) return 0; /* xxx if not a mailbox, call yyerror */ return 1; } static int verify_header(char *hdr) { char *h = hdr; char errbuf[100]; while (*h) { /* field-name = 1*ftext ftext = %d33-57 / %d59-126 ; Any character except ; controls, SP, and ; ":". */ if (!((*h >= 33 && *h <= 57) || (*h >= 59 && *h <= 126))) { snprintf(errbuf, sizeof(errbuf), "header '%s': not a valid header", hdr); yyerror(errbuf); return 0; } h++; } return 1; } static int verify_addrheader(char *hdr) { const char **h, *hdrs[] = { "from", "sender", "reply-to", /* RFC2822 originator fields */ "to", "cc", "bcc", /* RFC2822 destination fields */ "resent-from", "resent-sender", /* RFC2822 resent fields */ "resent-to", "resent-cc", "resent-bcc", "return-path", /* RFC2822 trace fields */ "disposition-notification-to", /* RFC2298 MDN request fields */ "delivered-to", /* non-standard (loop detection) */ "approved", /* RFC1036 moderator/control fields */ NULL }; char errbuf[100]; if (!config_getswitch(IMAPOPT_RFC3028_STRICT)) return verify_header(hdr); for (lcase(hdr), h = hdrs; *h; h++) { if (!strcmp(*h, hdr)) return 1; } snprintf(errbuf, sizeof(errbuf), "header '%s': not a valid header for an address test", hdr); yyerror(errbuf); return 0; } static int verify_envelope(char *env) { char errbuf[100]; lcase(env); if (!config_getswitch(IMAPOPT_RFC3028_STRICT) || !strcmp(env, "from") || !strcmp(env, "to") || !strcmp(env, "auth")) { return 1; } snprintf(errbuf, sizeof(errbuf), "env-part '%s': not a valid part for an envelope test", env); yyerror(errbuf); return 0; } static int verify_relat(char *r) {/* this really should have been a token to begin with.*/ char errbuf[100]; lcase(r); if (!strcmp(r, "gt")) {return GT;} else if (!strcmp(r, "ge")) {return GE;} else if (!strcmp(r, "lt")) {return LT;} else if (!strcmp(r, "le")) {return LE;} else if (!strcmp(r, "ne")) {return NE;} else if (!strcmp(r, "eq")) {return EQ;} else{ sprintf(errbuf, "flag '%s': not a valid relational operation", r); yyerror(errbuf); return -1; } } static int verify_flag(char *f) { char errbuf[100]; if (f[0] == '\\') { lcase(f); if (strcmp(f, "\\seen") && strcmp(f, "\\answered") && strcmp(f, "\\flagged") && strcmp(f, "\\draft") && strcmp(f, "\\deleted")) { snprintf(errbuf, sizeof(errbuf), "flag '%s': not a system flag", f); yyerror(errbuf); return 0; } return 1; } if (!imparse_isatom(f)) { snprintf(errbuf, sizeof(errbuf), "flag '%s': not a valid keyword", f); yyerror(errbuf); return 0; } return 1; } #ifdef ENABLE_REGEX static int verify_regex(char *s, int cflags) { int ret; char errbuf[100]; regex_t *reg = (regex_t *) xmalloc(sizeof(regex_t)); if ((ret = regcomp(reg, s, cflags)) != 0) { (void) regerror(ret, reg, errbuf, sizeof(errbuf)); yyerror(errbuf); free(reg); return 0; } free(reg); return 1; } static int verify_regexs(stringlist_t *sl, char *comp) { stringlist_t *sl2; int cflags = REG_EXTENDED | REG_NOSUB; if (!strcmp(comp, "i;ascii-casemap")) { cflags |= REG_ICASE; } for (sl2 = sl; sl2 != NULL; sl2 = sl2->next) { if ((verify_regex(sl2->s, cflags)) == 0) { break; } } if (sl2 == NULL) { return 1; } return 0; } #endif /* * Valid UTF-8 check (from RFC 2640 Annex B.1) * * The following routine checks if a byte sequence is valid UTF-8. This * is done by checking for the proper tagging of the first and following * bytes to make sure they conform to the UTF-8 format. It then checks * to assure that the data part of the UTF-8 sequence conforms to the * proper range allowed by the encoding. Note: This routine will not * detect characters that have not been assigned and therefore do not * exist. */ static int verify_utf8(char *s) { const unsigned char *buf = s; const unsigned char *endbuf = s + strlen(s); unsigned char byte2mask = 0x00, c; int trailing = 0; /* trailing (continuation) bytes to follow */ while (buf != endbuf) { c = *buf++; if (trailing) { if ((c & 0xC0) == 0x80) { /* Does trailing byte follow UTF-8 format? */ if (byte2mask) { /* Need to check 2nd byte for proper range? */ if (c & byte2mask) /* Are appropriate bits set? */ byte2mask = 0x00; else break; } trailing--; } else break; } else { if ((c & 0x80) == 0x00) /* valid 1 byte UTF-8 */ continue; else if ((c & 0xE0) == 0xC0) /* valid 2 byte UTF-8 */ if (c & 0x1E) { /* Is UTF-8 byte in proper range? */ trailing = 1; } else break; else if ((c & 0xF0) == 0xE0) { /* valid 3 byte UTF-8 */ if (!(c & 0x0F)) { /* Is UTF-8 byte in proper range? */ byte2mask = 0x20; /* If not, set mask to check next byte */ } trailing = 2; } else if ((c & 0xF8) == 0xF0) { /* valid 4 byte UTF-8 */ if (!(c & 0x07)) { /* Is UTF-8 byte in proper range? */ byte2mask = 0x30; /* If not, set mask to check next byte */ } trailing = 3; } else if ((c & 0xFC) == 0xF8) { /* valid 5 byte UTF-8 */ if (!(c & 0x03)) { /* Is UTF-8 byte in proper range? */ byte2mask = 0x38; /* If not, set mask to check next byte */ } trailing = 4; } else if ((c & 0xFE) == 0xFC) { /* valid 6 byte UTF-8 */ if (!(c & 0x01)) { /* Is UTF-8 byte in proper range? */ byte2mask = 0x3C; /* If not, set mask to check next byte */ } trailing = 5; } else break; } } if ((buf != endbuf) || trailing) { char errbuf[100]; snprintf(errbuf, sizeof(errbuf), "string '%s': not valid utf8", s); yyerror(errbuf); return 0; } return 1; }