#line 2 "sieve-lex.l"
/* GNU Mailutils -- a suite of utilities for electronic mail
Copyright (C) 1999-2021 Free Software Foundation, Inc.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General
Public License along with this library. If not, see
. */
#ifdef HAVE_CONFIG_H
# include
#endif
#line 26 "sieve-lex.c"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 6
#define YY_FLEX_SUBMINOR_VERSION 0
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include
#include
#include
#include
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have . Non-C99 systems may or may not. */
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
* if you want the limit (max/min) macros for int types.
*/
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif
#include
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#endif /* ! C99 */
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)
#define YY_USE_CONST
#endif /* defined (__STDC__) */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE mu_sieve_yyrestart(mu_sieve_yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
* Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
* Ditto for the __ia64__ case accordingly.
*/
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
extern yy_size_t mu_sieve_yyleng;
extern FILE *mu_sieve_yyin, *mu_sieve_yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
#define YY_LESS_LINENO(n)
#define YY_LINENO_REWIND_TO(ptr)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up mu_sieve_yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up mu_sieve_yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
yy_size_t yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via mu_sieve_yyrestart()), so that the user can continue scanning by
* just pointing mu_sieve_yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when mu_sieve_yytext is formed. */
static char yy_hold_char;
static yy_size_t yy_n_chars; /* number of characters read into yy_ch_buf */
yy_size_t mu_sieve_yyleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow mu_sieve_yywrap()'s to do buffer switches
* instead of setting up a fresh mu_sieve_yyin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void mu_sieve_yyrestart (FILE *input_file );
void mu_sieve_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE mu_sieve_yy_create_buffer (FILE *file,int size );
void mu_sieve_yy_delete_buffer (YY_BUFFER_STATE b );
void mu_sieve_yy_flush_buffer (YY_BUFFER_STATE b );
void mu_sieve_yypush_buffer_state (YY_BUFFER_STATE new_buffer );
void mu_sieve_yypop_buffer_state (void );
static void yyensure_buffer_stack (void );
static void mu_sieve_yy_load_buffer_state (void );
static void mu_sieve_yy_init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER mu_sieve_yy_flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE mu_sieve_yy_scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE mu_sieve_yy_scan_string (yyconst char *yy_str );
YY_BUFFER_STATE mu_sieve_yy_scan_bytes (yyconst char *bytes,yy_size_t len );
void *mu_sieve_yyalloc (yy_size_t );
void *mu_sieve_yyrealloc (void *,yy_size_t );
void mu_sieve_yyfree (void * );
#define yy_new_buffer mu_sieve_yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
mu_sieve_yy_create_buffer(mu_sieve_yyin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
mu_sieve_yy_create_buffer(mu_sieve_yyin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
typedef unsigned char YY_CHAR;
FILE *mu_sieve_yyin = (FILE *) 0, *mu_sieve_yyout = (FILE *) 0;
typedef int yy_state_type;
extern int mu_sieve_yylineno;
int mu_sieve_yylineno = 1;
extern char *mu_sieve_yytext;
#ifdef yytext_ptr
#undef yytext_ptr
#endif
#define yytext_ptr mu_sieve_yytext
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
#if defined(__GNUC__) && __GNUC__ >= 3
__attribute__((__noreturn__))
#endif
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up mu_sieve_yytext.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
mu_sieve_yyleng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 37
#define YY_END_OF_BUFFER 38
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static yyconst flex_int16_t yy_accept[145] =
{ 0,
0, 0, 2, 2, 0, 0, 0, 0, 38, 36,
34, 35, 36, 9, 36, 21, 23, 36, 36, 36,
36, 36, 36, 36, 36, 36, 2, 4, 3, 37,
33, 37, 37, 27, 37, 34, 0, 24, 0, 9,
9, 8, 9, 9, 1, 21, 21, 0, 23, 23,
0, 19, 19, 19, 19, 19, 11, 19, 19, 19,
19, 2, 3, 3, 5, 0, 33, 0, 0, 0,
27, 0, 26, 25, 9, 9, 0, 20, 19, 19,
19, 19, 16, 19, 19, 19, 0, 9, 9, 22,
19, 19, 13, 19, 19, 19, 19, 18, 0, 9,
9, 22, 15, 14, 12, 17, 19, 0, 0, 9,
9, 19, 0, 29, 0, 0, 0, 0, 0, 9,
9, 10, 0, 28, 0, 0, 9, 9, 0, 31,
0, 0, 9, 6, 9, 0, 30, 0, 32, 9,
9, 9, 7, 0
} ;
static yyconst YY_CHAR yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 1, 4, 5, 1, 1, 1, 1, 1,
1, 6, 1, 1, 7, 1, 8, 9, 10, 10,
10, 10, 10, 10, 10, 11, 11, 12, 1, 1,
1, 1, 1, 1, 13, 13, 13, 13, 13, 13,
14, 15, 15, 15, 14, 15, 14, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
1, 16, 1, 1, 15, 1, 17, 13, 18, 19,
20, 21, 14, 22, 23, 15, 14, 24, 14, 25,
26, 27, 28, 29, 30, 31, 32, 15, 15, 33,
34, 15, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst YY_CHAR yy_meta[35] =
{ 0,
1, 2, 3, 1, 2, 4, 2, 1, 5, 5,
5, 1, 6, 7, 7, 2, 6, 6, 6, 6,
6, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7
} ;
static yyconst flex_uint16_t yy_base[168] =
{ 0,
0, 0, 32, 33, 37, 38, 33, 40, 334, 335,
331, 335, 41, 44, 326, 44, 41, 0, 0, 35,
307, 313, 308, 302, 307, 41, 0, 335, 56, 323,
335, 63, 59, 335, 0, 323, 64, 335, 0, 321,
69, 335, 66, 70, 335, 69, 309, 0, 84, 308,
0, 0, 297, 286, 289, 294, 0, 286, 288, 282,
282, 0, 76, 79, 335, 310, 335, 86, 78, 92,
335, 0, 335, 335, 94, 97, 0, 0, 286, 285,
81, 280, 0, 277, 277, 287, 99, 102, 103, 292,
284, 283, 0, 282, 282, 238, 248, 0, 104, 107,
112, 232, 0, 0, 0, 0, 210, 117, 108, 110,
113, 198, 139, 335, 209, 143, 0, 149, 115, 118,
120, 0, 208, 335, 153, 133, 164, 140, 158, 335,
163, 161, 159, 335, 45, 134, 335, 128, 335, 146,
124, 122, 335, 335, 168, 175, 182, 189, 196, 198,
201, 208, 215, 222, 229, 236, 243, 246, 248, 251,
256, 263, 266, 273, 280, 287, 294
} ;
static yyconst flex_int16_t yy_def[168] =
{ 0,
144, 1, 145, 145, 146, 146, 147, 147, 144, 144,
144, 144, 148, 149, 144, 144, 144, 150, 151, 151,
151, 151, 151, 151, 151, 151, 152, 144, 153, 154,
144, 154, 155, 144, 156, 144, 148, 144, 157, 149,
149, 144, 149, 149, 144, 144, 144, 158, 144, 144,
159, 151, 151, 151, 151, 151, 151, 151, 151, 151,
151, 152, 153, 153, 144, 154, 144, 154, 154, 155,
144, 156, 144, 144, 149, 149, 160, 159, 151, 151,
151, 151, 151, 151, 151, 151, 154, 149, 149, 160,
151, 151, 151, 151, 151, 151, 151, 151, 154, 149,
149, 144, 151, 151, 151, 151, 151, 161, 154, 149,
149, 151, 144, 144, 162, 161, 163, 116, 154, 149,
149, 151, 162, 144, 163, 154, 164, 149, 144, 144,
165, 166, 164, 144, 149, 165, 144, 166, 144, 149,
167, 167, 144, 0, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144
} ;
static yyconst flex_uint16_t yy_nxt[370] =
{ 0,
10, 11, 12, 13, 14, 10, 10, 15, 16, 17,
17, 18, 19, 19, 19, 10, 20, 19, 19, 21,
22, 19, 23, 19, 24, 19, 19, 19, 25, 19,
26, 19, 19, 19, 28, 28, 34, 29, 29, 31,
31, 32, 32, 34, 38, 41, 42, 42, 35, 49,
49, 49, 46, 46, 50, 35, 39, 47, 53, 54,
60, 64, 71, 65, 68, 67, 43, 38, 42, 61,
41, 42, 42, 44, 72, 140, 48, 46, 46, 39,
67, 144, 47, 144, 64, 69, 65, 68, 67, 76,
75, 43, 49, 49, 49, 71, 42, 50, 44, 42,
93, 67, 87, 94, 42, 42, 67, 72, 69, 42,
67, 88, 42, 89, 42, 42, 99, 67, 113, 114,
42, 115, 42, 116, 143, 100, 143, 109, 120, 111,
139, 101, 118, 126, 121, 67, 137, 127, 110, 119,
113, 114, 42, 115, 113, 114, 128, 115, 42, 144,
144, 144, 132, 144, 129, 130, 135, 131, 118, 129,
130, 134, 131, 139, 144, 137, 134, 141, 27, 27,
27, 27, 27, 27, 27, 30, 30, 30, 30, 30,
30, 30, 33, 33, 33, 33, 33, 33, 33, 37,
37, 37, 37, 37, 37, 37, 40, 40, 40, 40,
40, 40, 40, 51, 51, 52, 52, 52, 62, 62,
124, 124, 62, 62, 62, 63, 63, 122, 63, 63,
63, 63, 66, 66, 66, 66, 66, 66, 66, 70,
70, 70, 70, 70, 70, 70, 73, 73, 112, 73,
73, 73, 73, 74, 74, 102, 74, 74, 74, 74,
77, 77, 78, 78, 78, 90, 90, 117, 117, 108,
107, 117, 117, 123, 123, 123, 123, 123, 123, 123,
125, 125, 125, 133, 133, 133, 133, 133, 133, 133,
136, 136, 136, 136, 136, 136, 136, 138, 138, 138,
138, 138, 138, 138, 142, 142, 142, 142, 142, 142,
142, 106, 105, 104, 103, 102, 98, 97, 96, 95,
92, 91, 67, 86, 85, 84, 83, 82, 81, 80,
79, 50, 47, 42, 36, 67, 59, 58, 57, 56,
55, 45, 36, 144, 9, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144
} ;
static yyconst flex_int16_t yy_chk[370] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 3, 4, 7, 3, 4, 5,
6, 5, 6, 8, 13, 14, 14, 135, 7, 17,
17, 17, 16, 16, 17, 8, 13, 16, 20, 20,
26, 29, 33, 29, 32, 32, 14, 37, 43, 26,
41, 41, 44, 14, 33, 135, 16, 46, 46, 37,
69, 63, 46, 63, 64, 32, 64, 68, 68, 44,
43, 41, 49, 49, 49, 70, 75, 49, 41, 76,
81, 87, 69, 81, 88, 89, 99, 70, 68, 100,
109, 75, 110, 76, 101, 111, 87, 119, 108, 108,
120, 108, 121, 108, 142, 88, 141, 99, 110, 101,
138, 89, 108, 119, 111, 126, 136, 120, 100, 109,
113, 113, 128, 113, 116, 116, 121, 116, 140, 116,
118, 118, 126, 118, 125, 125, 128, 125, 116, 129,
129, 133, 129, 132, 118, 131, 127, 140, 145, 145,
145, 145, 145, 145, 145, 146, 146, 146, 146, 146,
146, 146, 147, 147, 147, 147, 147, 147, 147, 148,
148, 148, 148, 148, 148, 148, 149, 149, 149, 149,
149, 149, 149, 150, 150, 151, 151, 151, 152, 152,
123, 115, 152, 152, 152, 153, 153, 112, 153, 153,
153, 153, 154, 154, 154, 154, 154, 154, 154, 155,
155, 155, 155, 155, 155, 155, 156, 156, 107, 156,
156, 156, 156, 157, 157, 102, 157, 157, 157, 157,
158, 158, 159, 159, 159, 160, 160, 161, 161, 97,
96, 161, 161, 162, 162, 162, 162, 162, 162, 162,
163, 163, 163, 164, 164, 164, 164, 164, 164, 164,
165, 165, 165, 165, 165, 165, 165, 166, 166, 166,
166, 166, 166, 166, 167, 167, 167, 167, 167, 167,
167, 95, 94, 92, 91, 90, 86, 85, 84, 82,
80, 79, 66, 61, 60, 59, 58, 56, 55, 54,
53, 50, 47, 40, 36, 30, 25, 24, 23, 22,
21, 15, 11, 9, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144, 144,
144, 144, 144, 144, 144, 144, 144, 144, 144
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int mu_sieve_yy_flex_debug;
int mu_sieve_yy_flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *mu_sieve_yytext;
#line 1 "sieve-lex.l"
#line 25 "sieve-lex.l"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
static char *multiline_delimiter;
static int strip_tabs;
static int number (void);
static int string (void);
static void line_begin (void);
static void line_add (char const *text, size_t len);
static void line_finish (void);
static void multiline_begin (void);
static void multiline_add (void);
static void multiline_finish (void);
static char *multiline_strip_tabs (char *text);
static void ident (const char *text);
static void sieve_include (void);
static void sieve_searchpath (void);
static int isemptystr (char *text);
static mu_linetrack_t trk;
static ino_t sieve_source_inode;
static mu_stream_t input_stream;
static int
fillbuf (char *buf, size_t max_size)
{
int rc;
if (!input_stream)
return 0;
rc = mu_stream_read (input_stream, buf, max_size, &max_size);
if (rc)
{
struct mu_locus_point pt;
mu_linetrack_locus (trk, &pt);
mu_diag_funcall (MU_DIAG_ERROR, "mu_stream_read", pt.mu_file, rc);
mu_locus_point_deinit (&pt);
return 0;
}
return max_size;
}
#undef YY_INPUT
#define YY_INPUT(buf,result,max_size) result = fillbuf (buf, max_size)
#define LEX_BUFFER_STATE YY_BUFFER_STATE
#define SET_BUFFER_STATE(s) do { \
(s) = YY_CURRENT_BUFFER; \
mu_sieve_yy_switch_to_buffer(mu_sieve_yy_create_buffer (mu_sieve_yyin, YY_BUF_SIZE)); \
} while (0)
#define RESTORE_BUFFER_STATE(s) do { \
mu_sieve_yy_delete_buffer (YY_CURRENT_BUFFER); \
mu_sieve_yy_switch_to_buffer (s); \
} while (0)
#define YY_USER_ACTION \
do \
{ \
mu_linetrack_advance (trk, &mu_sieve_yylloc, mu_sieve_yytext, mu_sieve_yyleng); \
mu_stream_ioctl (mu_strerr, MU_IOCTL_LOGSTREAM, \
MU_IOCTL_LOGSTREAM_SET_LOCUS_RANGE, &mu_sieve_yylloc); \
} \
while (0);
static void
init_locus (char const *name, ino_t ino)
{
if (name)
{
MU_ASSERT (mu_linetrack_create (&trk, name, 2));
}
else
mu_linetrack_destroy (&trk);
sieve_source_inode = ino;
}
struct buffer_ctx
{
struct buffer_ctx *prev;
mu_linetrack_t trk;
struct mu_locus_range incl_range;
ino_t i_node;
mu_stream_t input;
LEX_BUFFER_STATE state;
};
static struct buffer_ctx *context_stack;
static struct buffer_ctx *ctx_lookup (ino_t ino);
static int push_source (const char *name);
static int pop_source (void);
struct buffer_ctx *
ctx_lookup (ino_t ino)
{
struct buffer_ctx *ctx;
for (ctx = context_stack; ctx; ctx = ctx->prev)
if (ctx->i_node == ino)
break;
return ctx;
}
int
push_source (const char *name)
{
int rc;
mu_stream_t stream;
struct buffer_ctx *ctx;
struct stat st;
if (stat (name, &st))
{
mu_error (_("cannot stat `%s': %s"), name, strerror (errno));
mu_i_sv_error (mu_sieve_machine);
return 1;
}
if (mu_sieve_yylloc.beg.mu_file && st.st_ino == sieve_source_inode)
{
mu_sieve_yyerror (_("recursive inclusion"));
return 1;
}
if ((ctx = ctx_lookup (st.st_ino)))
{
mu_sieve_yyerror (_("recursive inclusion"));
if (ctx->prev)
{
mu_diag_at_locus_range (MU_LOG_ERROR, &ctx->incl_range,
_("`%s' already included here"),
name);
mu_i_sv_error (mu_sieve_machine);
}
else
{
mu_error (_("`%s' already included at top level"), name);
mu_i_sv_error (mu_sieve_machine);
}
return 1;
}
rc = mu_file_stream_create (&stream, name, MU_STREAM_READ);
if (rc)
{
mu_error (_("cannot open file `%s': %s"), name, mu_strerror (rc));
mu_i_sv_error (mu_sieve_machine);
return 1;
}
/* Push current context */
if (trk)
{
ctx = mu_sieve_malloc (mu_sieve_machine, sizeof (*ctx));
ctx->trk = trk;
mu_locus_range_init (&ctx->incl_range);
mu_locus_range_copy (&ctx->incl_range, &mu_sieve_yylloc);
ctx->i_node = sieve_source_inode;
ctx->input = input_stream;
ctx->prev = context_stack;
context_stack = ctx;
/* Switch to the new context */
SET_BUFFER_STATE (ctx->state);
}
input_stream = stream;
init_locus (name, st.st_ino);
return 0;
}
int
pop_source ()
{
struct buffer_ctx *ctx;
mu_stream_destroy (&input_stream);
if (!context_stack)
{
input_stream = NULL;
init_locus (NULL, 0);
return 1;
}
/* Restore previous context */
input_stream = context_stack->input;
mu_linetrack_destroy (&trk);
trk = context_stack->trk;
mu_locus_range_deinit (&context_stack->incl_range);
sieve_source_inode = context_stack->i_node;
RESTORE_BUFFER_STATE (context_stack->state);
ctx = context_stack->prev;
mu_sieve_free (mu_sieve_machine, context_stack);
context_stack = ctx;
return 0;
}
#define YY_NO_INPUT 1
#line 830 "sieve-lex.c"
#define INITIAL 0
#define COMMENT 1
#define ML 2
#define STR 3
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
static int yy_init_globals (void );
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int mu_sieve_yylex_destroy (void );
int mu_sieve_yyget_debug (void );
void mu_sieve_yyset_debug (int debug_flag );
YY_EXTRA_TYPE yyget_extra (void );
void yyset_extra (YY_EXTRA_TYPE user_defined );
FILE *mu_sieve_yyget_in (void );
void mu_sieve_yyset_in (FILE * _in_str );
FILE *mu_sieve_yyget_out (void );
void mu_sieve_yyset_out (FILE * _out_str );
yy_size_t mu_sieve_yyget_leng (void );
char *mu_sieve_yyget_text (void );
int mu_sieve_yyget_lineno (void );
void mu_sieve_yyset_lineno (int _line_number );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int mu_sieve_yywrap (void );
#else
extern int mu_sieve_yywrap (void );
#endif
#endif
#ifndef YY_NO_UNPUT
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO do { if (fwrite( mu_sieve_yytext, mu_sieve_yyleng, 1, mu_sieve_yyout )) {} } while (0)
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
size_t n; \
for ( n = 0; n < max_size && \
(c = getc( mu_sieve_yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( mu_sieve_yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, mu_sieve_yyin))==0 && ferror(mu_sieve_yyin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(mu_sieve_yyin); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int mu_sieve_yylex (void);
#define YY_DECL int mu_sieve_yylex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after mu_sieve_yytext and mu_sieve_yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK /*LINTED*/break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
yy_state_type yy_current_state;
char *yy_cp, *yy_bp;
int yy_act;
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! mu_sieve_yyin )
mu_sieve_yyin = stdin;
if ( ! mu_sieve_yyout )
mu_sieve_yyout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
mu_sieve_yy_create_buffer(mu_sieve_yyin,YY_BUF_SIZE );
}
mu_sieve_yy_load_buffer_state( );
}
{
#line 244 "sieve-lex.l"
/* C-style comments */
#line 1052 "sieve-lex.c"
while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of mu_sieve_yytext. */
*yy_cp = (yy_hold_char);
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = (yy_start);
yy_match:
do
{
YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 145 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_base[yy_current_state] != 335 );
yy_find_action:
yy_act = yy_accept[yy_current_state];
if ( yy_act == 0 )
{ /* have to back up */
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
yy_act = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
*yy_cp = (yy_hold_char);
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
YY_RULE_SETUP
#line 246 "sieve-lex.l"
{ BEGIN(COMMENT); }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 247 "sieve-lex.l"
/* eat anything that's not a '*' */
YY_BREAK
case 3:
YY_RULE_SETUP
#line 248 "sieve-lex.l"
/* eat up '*'s not followed by '/'s */
YY_BREAK
case 4:
/* rule 4 can match eol */
YY_RULE_SETUP
#line 249 "sieve-lex.l"
;
YY_BREAK
case 5:
YY_RULE_SETUP
#line 250 "sieve-lex.l"
{ BEGIN (INITIAL); }
YY_BREAK
/* Preprocessor directives (an extension) */
case 6:
/* rule 6 can match eol */
YY_RULE_SETUP
#line 252 "sieve-lex.l"
{ sieve_include (); }
YY_BREAK
case 7:
/* rule 7 can match eol */
YY_RULE_SETUP
#line 253 "sieve-lex.l"
{ sieve_searchpath (); }
YY_BREAK
/* End-of-line comments */
case 8:
/* rule 8 can match eol */
YY_RULE_SETUP
#line 255 "sieve-lex.l"
;
YY_BREAK
case 9:
YY_RULE_SETUP
#line 256 "sieve-lex.l"
/* end-of-file comment */;
YY_BREAK
/* Reserved words */
case 10:
YY_RULE_SETUP
#line 258 "sieve-lex.l"
return REQUIRE;
YY_BREAK
case 11:
YY_RULE_SETUP
#line 259 "sieve-lex.l"
return IF;
YY_BREAK
case 12:
YY_RULE_SETUP
#line 260 "sieve-lex.l"
return ELSIF;
YY_BREAK
case 13:
YY_RULE_SETUP
#line 261 "sieve-lex.l"
return ELSE;
YY_BREAK
case 14:
YY_RULE_SETUP
#line 262 "sieve-lex.l"
return ANYOF;
YY_BREAK
case 15:
YY_RULE_SETUP
#line 263 "sieve-lex.l"
return ALLOF;
YY_BREAK
case 16:
YY_RULE_SETUP
#line 264 "sieve-lex.l"
return NOT;
YY_BREAK
case 17:
YY_RULE_SETUP
#line 265 "sieve-lex.l"
return FALSE;
YY_BREAK
case 18:
YY_RULE_SETUP
#line 266 "sieve-lex.l"
return TRUE;
YY_BREAK
/* Identifiers */
case 19:
YY_RULE_SETUP
#line 268 "sieve-lex.l"
{ ident (mu_sieve_yytext); return IDENT; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 269 "sieve-lex.l"
{ ident (mu_sieve_yytext + 1); return TAG; }
YY_BREAK
/* Numbers */
case 21:
YY_RULE_SETUP
#line 271 "sieve-lex.l"
{ return number (); }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 272 "sieve-lex.l"
{ return number (); }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 273 "sieve-lex.l"
{ return number (); }
YY_BREAK
/* Quoted strings */
case 24:
/* rule 24 can match eol */
YY_RULE_SETUP
#line 275 "sieve-lex.l"
{ return string (); }
YY_BREAK
case 25:
/* rule 25 can match eol */
YY_RULE_SETUP
#line 276 "sieve-lex.l"
{ BEGIN(STR);
line_begin ();
line_add (mu_sieve_yytext + 1, mu_sieve_yyleng - 3);
line_add (mu_sieve_yytext + mu_sieve_yyleng - 1, 1); }
YY_BREAK
case 26:
/* rule 26 can match eol */
YY_RULE_SETUP
#line 280 "sieve-lex.l"
{ line_add (mu_sieve_yytext, mu_sieve_yyleng - 2);
line_add (mu_sieve_yytext + mu_sieve_yyleng - 1, 1); }
YY_BREAK
case 27:
/* rule 27 can match eol */
YY_RULE_SETUP
#line 282 "sieve-lex.l"
{ BEGIN(INITIAL);
if (mu_sieve_yyleng > 1)
line_add (mu_sieve_yytext, mu_sieve_yyleng - 1);
line_finish ();
return STRING; }
YY_BREAK
/* Multiline strings */
case 28:
/* rule 28 can match eol */
YY_RULE_SETUP
#line 288 "sieve-lex.l"
{ BEGIN(ML);
multiline_begin (); }
YY_BREAK
case 29:
/* rule 29 can match eol */
YY_RULE_SETUP
#line 290 "sieve-lex.l"
{ BEGIN(ML);
multiline_begin (); }
YY_BREAK
case 30:
/* rule 30 can match eol */
YY_RULE_SETUP
#line 292 "sieve-lex.l"
{ BEGIN(ML);
multiline_begin (); }
YY_BREAK
case 31:
/* rule 31 can match eol */
YY_RULE_SETUP
#line 294 "sieve-lex.l"
{ BEGIN(ML);
multiline_begin (); }
YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 296 "sieve-lex.l"
{ if (multiline_delimiter[0] == '\\')
multiline_add ();
else
sieve_include (); }
YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 300 "sieve-lex.l"
{ char *p = multiline_strip_tabs (mu_sieve_yytext);
if (strncmp (p, multiline_delimiter, strlen (multiline_delimiter))
== 0
&& isemptystr (p + strlen (multiline_delimiter)))
{
free (multiline_delimiter);
multiline_delimiter = NULL;
BEGIN(INITIAL);
multiline_finish ();
return MULTILINE;
}
multiline_add (); }
YY_BREAK
case 34:
YY_RULE_SETUP
#line 313 "sieve-lex.l"
;
YY_BREAK
/* Other tokens */
case 35:
/* rule 35 can match eol */
YY_RULE_SETUP
#line 315 "sieve-lex.l"
;
YY_BREAK
case 36:
YY_RULE_SETUP
#line 316 "sieve-lex.l"
return mu_sieve_yytext[0];
YY_BREAK
case 37:
YY_RULE_SETUP
#line 318 "sieve-lex.l"
ECHO;
YY_BREAK
#line 1344 "sieve-lex.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(COMMENT):
case YY_STATE_EOF(ML):
case YY_STATE_EOF(STR):
yyterminate();
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = (yy_hold_char);
YY_RESTORE_YY_MORE_OFFSET
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed mu_sieve_yyin at a new source and called
* mu_sieve_yylex(). If so, then we have to assure
* consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = mu_sieve_yyin;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
(yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = (yy_c_buf_p);
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
(yy_did_buffer_switch_on_eof) = 0;
if ( mu_sieve_yywrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* mu_sieve_yytext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
(yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of user's declarations */
} /* end of mu_sieve_yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer (void)
{
char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
char *source = (yytext_ptr);
yy_size_t number_to_move, i;
int ret_val;
if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (yy_size_t) ((yy_c_buf_p) - (yytext_ptr)) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
yy_size_t num_to_read =
YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
int yy_c_buf_p_offset =
(int) ((yy_c_buf_p) - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
yy_size_t new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
mu_sieve_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = 0;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
(yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
number_to_move - 1;
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
(yy_n_chars), num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
mu_sieve_yyrestart(mu_sieve_yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
/* Extend the array by 50%, plus the number we really need. */
yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) mu_sieve_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
}
(yy_n_chars) += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
(yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state (void)
{
yy_state_type yy_current_state;
char *yy_cp;
yy_current_state = (yy_start);
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 145 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
int yy_is_jam;
char *yy_cp = (yy_c_buf_p);
YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 145 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 144);
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_UNPUT
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
int c;
*(yy_c_buf_p) = (yy_hold_char);
if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
yy_size_t offset = (yy_c_buf_p) - (yytext_ptr);
++(yy_c_buf_p);
switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
mu_sieve_yyrestart(mu_sieve_yyin );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( mu_sieve_yywrap( ) )
return EOF;
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) = (yytext_ptr) + offset;
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
*(yy_c_buf_p) = '\0'; /* preserve mu_sieve_yytext */
(yy_hold_char) = *++(yy_c_buf_p);
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
*
* @note This function does not reset the start condition to @c INITIAL .
*/
void mu_sieve_yyrestart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
mu_sieve_yy_create_buffer(mu_sieve_yyin,YY_BUF_SIZE );
}
mu_sieve_yy_init_buffer(YY_CURRENT_BUFFER,input_file );
mu_sieve_yy_load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void mu_sieve_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* mu_sieve_yypop_buffer_state();
* mu_sieve_yypush_buffer_state(new_buffer);
*/
yyensure_buffer_stack ();
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
mu_sieve_yy_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (mu_sieve_yywrap()) processing, but the only time this flag
* is looked at is after mu_sieve_yywrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void mu_sieve_yy_load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
mu_sieve_yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
(yy_hold_char) = *(yy_c_buf_p);
}
/** Allocate and initialize an input buffer state.
* @param file A readable stream.
* @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
*
* @return the allocated buffer state.
*/
YY_BUFFER_STATE mu_sieve_yy_create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) mu_sieve_yyalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in mu_sieve_yy_create_buffer()" );
b->yy_buf_size = (yy_size_t)size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
b->yy_ch_buf = (char *) mu_sieve_yyalloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in mu_sieve_yy_create_buffer()" );
b->yy_is_our_buffer = 1;
mu_sieve_yy_init_buffer(b,file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with mu_sieve_yy_create_buffer()
*
*/
void mu_sieve_yy_delete_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
mu_sieve_yyfree((void *) b->yy_ch_buf );
mu_sieve_yyfree((void *) b );
}
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a mu_sieve_yyrestart() or at EOF.
*/
static void mu_sieve_yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
mu_sieve_yy_flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then mu_sieve_yy_init_buffer was _probably_
* called from mu_sieve_yyrestart() or through yy_get_next_buffer.
* In that case, we don't want to reset the lineno or column.
*/
if (b != YY_CURRENT_BUFFER){
b->yy_bs_lineno = 1;
b->yy_bs_column = 0;
}
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
errno = oerrno;
}
/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
* @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
*
*/
void mu_sieve_yy_flush_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == YY_CURRENT_BUFFER )
mu_sieve_yy_load_buffer_state( );
}
/** Pushes the new state onto the stack. The new state becomes
* the current state. This function will allocate the stack
* if necessary.
* @param new_buffer The new state.
*
*/
void mu_sieve_yypush_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
yyensure_buffer_stack();
/* This block is copied from mu_sieve_yy_switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from mu_sieve_yy_switch_to_buffer. */
mu_sieve_yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
*
*/
void mu_sieve_yypop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
mu_sieve_yy_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
mu_sieve_yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void yyensure_buffer_stack (void)
{
yy_size_t num_to_alloc;
if (!(yy_buffer_stack)) {
/* First allocation is just for 2 elements, since we don't know if this
* scanner will even need a stack. We use 2 instead of 1 to avoid an
* immediate realloc on the next call.
*/
num_to_alloc = 1; // After all that talk, this was set to 1 anyways...
(yy_buffer_stack) = (struct yy_buffer_state**)mu_sieve_yyalloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
(yy_buffer_stack_top) = 0;
return;
}
if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
/* Increase the buffer to prepare for a possible push. */
yy_size_t grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)mu_sieve_yyrealloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
/* zero only the new slots.*/
memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE mu_sieve_yy_scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) mu_sieve_yyalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in mu_sieve_yy_scan_buffer()" );
b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
b->yy_buf_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
mu_sieve_yy_switch_to_buffer(b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to mu_sieve_yylex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* mu_sieve_yy_scan_bytes() instead.
*/
YY_BUFFER_STATE mu_sieve_yy_scan_string (yyconst char * yystr )
{
return mu_sieve_yy_scan_bytes(yystr,strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to mu_sieve_yylex() will
* scan from a @e copy of @a bytes.
* @param yybytes the byte buffer to scan
* @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE mu_sieve_yy_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
yy_size_t i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) mu_sieve_yyalloc(n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in mu_sieve_yy_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = mu_sieve_yy_scan_buffer(buf,n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in mu_sieve_yy_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yy_fatal_error (yyconst char* msg )
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up mu_sieve_yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
mu_sieve_yytext[mu_sieve_yyleng] = (yy_hold_char); \
(yy_c_buf_p) = mu_sieve_yytext + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
mu_sieve_yyleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int mu_sieve_yyget_lineno (void)
{
return mu_sieve_yylineno;
}
/** Get the input stream.
*
*/
FILE *mu_sieve_yyget_in (void)
{
return mu_sieve_yyin;
}
/** Get the output stream.
*
*/
FILE *mu_sieve_yyget_out (void)
{
return mu_sieve_yyout;
}
/** Get the length of the current token.
*
*/
yy_size_t mu_sieve_yyget_leng (void)
{
return mu_sieve_yyleng;
}
/** Get the current token.
*
*/
char *mu_sieve_yyget_text (void)
{
return mu_sieve_yytext;
}
/** Set the current line number.
* @param _line_number line number
*
*/
void mu_sieve_yyset_lineno (int _line_number )
{
mu_sieve_yylineno = _line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param _in_str A readable stream.
*
* @see mu_sieve_yy_switch_to_buffer
*/
void mu_sieve_yyset_in (FILE * _in_str )
{
mu_sieve_yyin = _in_str ;
}
void mu_sieve_yyset_out (FILE * _out_str )
{
mu_sieve_yyout = _out_str ;
}
int mu_sieve_yyget_debug (void)
{
return mu_sieve_yy_flex_debug;
}
void mu_sieve_yyset_debug (int _bdebug )
{
mu_sieve_yy_flex_debug = _bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from mu_sieve_yylex_destroy(), so don't allocate here.
*/
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
mu_sieve_yyin = stdin;
mu_sieve_yyout = stdout;
#else
mu_sieve_yyin = (FILE *) 0;
mu_sieve_yyout = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* yylex_init()
*/
return 0;
}
/* mu_sieve_yylex_destroy is for both reentrant and non-reentrant scanners. */
int mu_sieve_yylex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
mu_sieve_yy_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
mu_sieve_yypop_buffer_state();
}
/* Destroy the stack itself. */
mu_sieve_yyfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* mu_sieve_yylex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *mu_sieve_yyalloc (yy_size_t size )
{
return (void *) malloc( size );
}
void *mu_sieve_yyrealloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
void mu_sieve_yyfree (void * ptr )
{
free( (char *) ptr ); /* see mu_sieve_yyrealloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 318 "sieve-lex.l"
int
mu_sieve_yywrap ()
{
return pop_source();
}
static char *
get_file_name (char *p, char *endp, int *usepath)
{
char exp, *name, *startp;
int n;
if (usepath)
*usepath = 0;
switch (*p)
{
case '"':
exp = '"';
break;
case '<':
exp = '>';
if (usepath)
*usepath = 1;
break;
default:
mu_sieve_yyerror (_("preprocessor syntax"));
return NULL;
}
for (startp = ++p; p < endp && *p != exp; p++)
;
if (*p != exp)
{
mu_sieve_yyerror (_("missing closing quote in preprocessor statement"));
return NULL;
}
n = p - startp;
name = mu_sieve_malloc (mu_sieve_machine, n + 1);
memcpy (name, startp, n);
name[n] = 0;
return name;
}
static int
_try_include (void *item, void *data)
{
char **dir = data;
char *name = mu_make_file_name ((char*) item, *dir);
if (!name)
{
mu_diag_funcall (MU_DIAG_ERROR, "mu_make_file_name", NULL, ENOMEM);
return 0;
}
if (access (name, R_OK) == 0)
{
*(char**) data = name;
return MU_ERR_USER0;
}
free (name);
return 0;
}
static void
sieve_include (void)
{
char *p, *endp = mu_sieve_yytext + mu_sieve_yyleng, *name;
int usepath;
p = strstr (mu_sieve_yytext, "include");
for (p += 7; p < endp && mu_isspace (*p); p++)
;
name = get_file_name (p, endp, &usepath);
if (!name)
return;
if (usepath && name[0] != '/' && memcmp (name, "..", 2))
{
char *p = name;
if (mu_sieve_include_path
&& mu_list_foreach (mu_sieve_include_path, _try_include, &p))
{
push_source (p);
mu_sieve_free (mu_sieve_machine, name);
free (p);
return;
}
}
push_source (name);
mu_sieve_free (mu_sieve_machine, name);
}
static void
sieve_searchpath (void)
{
char *p, *endp = mu_sieve_yytext + mu_sieve_yyleng, *name;
p = strstr (mu_sieve_yytext, "searchpath");
for (p += 10; p < endp && mu_isspace (*p); p++)
;
name = get_file_name (p, endp, NULL);
if (name)
{
mu_i_sv_load_add_dir (mu_sieve_machine, name);
mu_sieve_free (mu_sieve_machine, name);
}
}
int
mu_i_sv_lex_begin (const char *name)
{
return push_source (name);
}
int
mu_i_sv_lex_begin_string (const char *buf, int bufsize,
struct mu_locus_point const *pt)
{
int rc;
mu_sieve_yyrestart (NULL);
rc = mu_static_memory_stream_create (&input_stream, buf, bufsize);
if (rc)
{
mu_diag_funcall (MU_DIAG_ERROR, "mu_static_memory_stream_create",
NULL, rc);
return 1;
}
init_locus (pt->mu_file, 0);
mu_linetrack_rebase (trk, pt);
return 0;
}
void
mu_i_sv_lex_finish (void)
{
while (pop_source () == 0)
;
}
static int
number ()
{
char *p;
mu_sieve_yylval.number = strtoul (mu_sieve_yytext, &p, 0);
switch (*p)
{
case 'k':
case 'K':
mu_sieve_yylval.number *= 1024L;
break;
case 'm':
case 'M':
mu_sieve_yylval.number *= 1024*1024L;
break;
case 'g':
case 'G':
mu_sieve_yylval.number *= 1024*1024*1024L;
}
return NUMBER;
}
static int
string (void)
{
line_begin ();
line_add (mu_sieve_yytext + 1, mu_sieve_yyleng - 2);
line_finish ();
return STRING;
}
static int
isemptystr (char *text)
{
for (; *text && mu_isspace (*text); text++)
;
return *text == 0;
}
static char *
multiline_strip_tabs (char *text)
{
if (strip_tabs)
for (; *text == '\t'; text++)
;
return text;
}
static void
line_add (char const *text, size_t len)
{
mu_opool_append (mu_sieve_machine->string_pool, text, len);
}
static void
multiline_add (void)
{
mu_opool_appendz (mu_sieve_machine->string_pool,
multiline_strip_tabs (mu_sieve_yytext));
}
static void
line_begin (void)
{
/* nothing */
}
static void
multiline_begin (void)
{
char *p = mu_sieve_yytext + 5; /* past the text: keyword */
if (*p == '-')
{
strip_tabs = 1;
p++;
}
else
strip_tabs = 0;
if (!mu_isspace (*p))
{
char *endp;
int len;
for (endp = p; *endp; endp++)
if (mu_isspace (*endp))
break;
len = endp - p;
multiline_delimiter = mu_sieve_malloc (mu_sieve_machine, len + 1);
memcpy (multiline_delimiter, p, len);
multiline_delimiter[len] = 0;
}
else
{
multiline_delimiter = strdup (".");
if (!multiline_delimiter)
{
mu_sieve_yyerror (_("not enough memory"));
exit (1);
}
}
line_begin ();
}
static void
multiline_finish (void)
{
line_finish ();
}
static void
ident (const char *text)
{
mu_sieve_yylval.string = strdup (text);
if (!mu_sieve_yylval.string)
{
mu_sieve_yyerror (_("not enough memory"));
exit (1);
}
}
static mu_i_sv_interp_t string_interpreter;
static void
line_finish (void)
{
char *str;
mu_opool_append_char (mu_sieve_machine->string_pool, 0);
str = mu_opool_finish (mu_sieve_machine->string_pool, NULL);
if (string_interpreter)
{
char *exp;
int rc = mu_i_sv_string_expand (str, string_interpreter, NULL, &exp);
if (rc == 0)
{
mu_opool_free (mu_sieve_machine->string_pool, str);
mu_opool_appendz (mu_sieve_machine->string_pool, exp);
mu_opool_append_char (mu_sieve_machine->string_pool, 0);
free (exp);
str = mu_opool_finish (mu_sieve_machine->string_pool, NULL);
}
else if (rc != MU_ERR_CANCELED)
{
mu_error (_("error expandind string: %s"), mu_strerror (rc));
}
}
mu_sieve_yylval.string = str;
}
int
mu_sieve_require_encoded_character (mu_sieve_machine_t mach,
const char *name)
{
string_interpreter = mu_i_sv_expand_encoded_char;
return 0;
}