#line 2 "sieve/sieve-lex.c"

#line 4 "sieve/sieve-lex.c"

#define  YY_INT_ALIGNED short int

/* A lexical scanner generated by flex */

#define yy_create_buffer sieve_create_buffer
#define yy_delete_buffer sieve_delete_buffer
#define yy_flex_debug sieve_flex_debug
#define yy_init_buffer sieve_init_buffer
#define yy_flush_buffer sieve_flush_buffer
#define yy_load_buffer_state sieve_load_buffer_state
#define yy_switch_to_buffer sieve_switch_to_buffer
#define yyin sievein
#define yyleng sieveleng
#define yylex sievelex
#define yylineno sievelineno
#define yyout sieveout
#define yyrestart sieverestart
#define yytext sievetext
#define yywrap sievewrap
#define yyalloc sievealloc
#define yyrealloc sieverealloc
#define yyfree sievefree

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 6
#define YY_FLEX_SUBMINOR_VERSION 1
#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 <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>

/* end standard C headers. */

/* flex integer type definitions */

#ifndef FLEXINT_H
#define FLEXINT_H

/* C99 systems have <inttypes.h>. 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 <inttypes.h>
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 */

/* TODO: this is always defined, so inline it */
#define yyconst const

#if defined(__GNUC__) && __GNUC__ >= 3
#define yynoreturn __attribute__((__noreturn__))
#else
#define yynoreturn
#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 sieverestart(sievein  )

#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 int sieveleng;

extern FILE *sievein, *sieveout;

#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2

    /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
     *       access to the local variable yy_act. Since yyless() is a macro, it would break
     *       existing scanners that call yyless() from OUTSIDE sievelex.
     *       One obvious solution it to make yy_act a global. I tried that, and saw
     *       a 5% performance hit in a non-sievelineno scanner, because yy_act is
     *       normally declared as a register variable-- so it is not worth it.
     */
    #define  YY_LESS_LINENO(n) \
            do { \
                int yyl;\
                for ( yyl = n; yyl < sieveleng; ++yyl )\
                    if ( sievetext[yyl] == '\n' )\
                        --sievelineno;\
            }while(0)
    #define YY_LINENO_REWIND_TO(dst) \
            do {\
                const char *p;\
                for ( p = yy_cp-1; p >= (dst); --p)\
                    if ( *p == '\n' )\
                        --sievelineno;\
            }while(0)
    
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
	do \
		{ \
		/* Undo effects of setting up sievetext. */ \
        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 sievetext 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.
	 */
	int yy_buf_size;

	/* Number of characters read into yy_ch_buf, not including EOB
	 * characters.
	 */
	int 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 sieverestart()), so that the user can continue scanning by
	 * just pointing sievein 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 = NULL; /**< 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 sievetext is formed. */
static char yy_hold_char;
static int yy_n_chars;		/* number of characters read into yy_ch_buf */
int sieveleng;

/* Points to current character in buffer. */
static char *yy_c_buf_p = NULL;
static int yy_init = 0;		/* whether we need to initialize */
static int yy_start = 0;	/* start state number */

/* Flag which is used to allow sievewrap()'s to do buffer switches
 * instead of setting up a fresh sievein.  A bit of a hack ...
 */
static int yy_did_buffer_switch_on_eof;

void sieverestart (FILE *input_file  );
void sieve_switch_to_buffer (YY_BUFFER_STATE new_buffer  );
YY_BUFFER_STATE sieve_create_buffer (FILE *file,int size  );
void sieve_delete_buffer (YY_BUFFER_STATE b  );
void sieve_flush_buffer (YY_BUFFER_STATE b  );
void sievepush_buffer_state (YY_BUFFER_STATE new_buffer  );
void sievepop_buffer_state (void );

static void sieveensure_buffer_stack (void );
static void sieve_load_buffer_state (void );
static void sieve_init_buffer (YY_BUFFER_STATE b,FILE *file  );

#define YY_FLUSH_BUFFER sieve_flush_buffer(YY_CURRENT_BUFFER )

YY_BUFFER_STATE sieve_scan_buffer (char *base,yy_size_t size  );
YY_BUFFER_STATE sieve_scan_string (yyconst char *yy_str  );
YY_BUFFER_STATE sieve_scan_bytes (yyconst char *bytes,int len  );

void *sievealloc (yy_size_t  );
void *sieverealloc (void *,yy_size_t  );
void sievefree (void *  );

#define yy_new_buffer sieve_create_buffer

#define yy_set_interactive(is_interactive) \
	{ \
	if ( ! YY_CURRENT_BUFFER ){ \
        sieveensure_buffer_stack (); \
		YY_CURRENT_BUFFER_LVALUE =    \
            sieve_create_buffer(sievein,YY_BUF_SIZE ); \
	} \
	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
	}

#define yy_set_bol(at_bol) \
	{ \
	if ( ! YY_CURRENT_BUFFER ){\
        sieveensure_buffer_stack (); \
		YY_CURRENT_BUFFER_LVALUE =    \
            sieve_create_buffer(sievein,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 */

#define sievewrap() (/*CONSTCOND*/1)
#define YY_SKIP_YYWRAP

typedef unsigned char YY_CHAR;

FILE *sievein = NULL, *sieveout = NULL;

typedef int yy_state_type;

extern int sievelineno;

int sievelineno = 1;

extern char *sievetext;
#ifdef yytext_ptr
#undef yytext_ptr
#endif
#define yytext_ptr sievetext

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 );
static void yynoreturn yy_fatal_error (yyconst char* msg  );

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up sievetext.
 */
#define YY_DO_BEFORE_ACTION \
	(yytext_ptr) = yy_bp; \
	sieveleng = (int) (yy_cp - yy_bp); \
	(yy_hold_char) = *yy_cp; \
	*yy_cp = '\0'; \
	(yy_c_buf_p) = yy_cp;

#define YY_NUM_RULES 155
#define YY_END_OF_BUFFER 156
/* 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[816] =
    {   0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,  156,  154,  153,  153,    7,  152,  154,    8,
      154,  154,  154,  154,  154,  154,  154,  154,  154,  154,
      154,  154,  154,  154,  154,  154,  154,  154,  154,    5,
        5,    5,    3,    5,   32,   32,  154,   72,   72,  154,
      104,  104,  154,  152,    0,    8,    8,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    9,    0,    0,    0,

        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    2,    2,    1,    4,    0,
       36,    0,    0,   79,    0,    0,    0,    0,    0,  108,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,  111,    0,    0,   37,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,

        0,    0,    0,    0,    0,  143,    0,    0,    0,   19,
        0,    0,    0,    0,    0,    0,   55,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,  105,  106,  107,    0,  151,    0,
       44,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,  140,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,  112,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,   50,
        0,    0,  128,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,

       49,    0,   87,    0,    0,    0,    0,   11,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,   27,    0,   85,    0,    0,    0,    0,    0,    0,
        0,    0,    0,   23,    0,    0,   13,    0,    0,   18,
        0,    0,    0,    0,    0,   73,   76,   75,   78,   77,
       74,  151,    0,    0,    0,    0,    0,    0,    0,   30,
        0,    0,   63,    0,    0,    0,    0,   66,    0,    0,
        0,  114,    0,    0,   92,    0,   42,    0,    0,    0,
        0,    0,    0,   68,    0,    0,  133,    0,    0,   24,
        0,    0,    0,    0,    0,    0,    0,   51,  150,    0,

        0,    0,   47,    0,    0,   89,    0,    0,    0,   15,
       14,    0,    0,    0,    0,    0,   10,    0,    0,    0,
      116,    0,   17,    0,    0,    0,  115,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,   70,    0,    0,    0,
        0,   84,    0,    0,    0,    0,   91,    0,    0,   56,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
       40,    0,    0,    0,    0,   25,    0,   57,   71,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,

        0,   16,    0,    0,   20,    0,    0,    0,    0,   99,
        0,   95,    0,    0,  134,    0,    0,  145,    0,   54,
        0,    6,    6,    0,   86,    0,    0,    0,    0,    0,
        0,  125,    0,    0,    0,    0,    0,  118,   48,   46,
        0,  131,   67,  136,    0,   61,    0,    0,    0,    0,
        0,  110,  113,  127,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,   81,    0,   21,    0,
        0,    0,   26,    0,    0,    0,   96,    0,   83,  129,
        0,    0,    0,    0,    0,    0,   12,    0,   80,    0,
        0,    6,    0,    0,    0,    0,    0,    0,    0,    0,

        0,  126,    0,    0,   52,    0,    0,    0,    0,  146,
       39,  101,    0,  100,    0,    0,    0,    0,    0,   69,
        0,   65,    0,    0,    0,    0,    0,    0,  109,    0,
       22,    0,   28,    0,    0,    0,  119,    0,   29,    0,
        0,    0,    6,   62,    0,    0,    0,    0,  147,    0,
        0,    0,    0,   38,    0,    0,    0,    0,    0,  132,
        0,  130,    0,    0,    0,    0,  137,    0,  149,   93,
        0,    0,  135,    0,  144,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,   33,   64,    0,    0,    0,
      102,    0,   45,    0,  142,    0,    0,    0,    0,    0,

        0,    0,    0,    0,    0,    0,    0,    0,   82,    0,
        0,    0,    0,    0,    0,    0,    0,   31,  103,   58,
        0,   41,    0,    0,  139,   59,   90,    0,   53,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,  148,   94,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,   88,    0,  117,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,   60,    0,  120,    0,  121,    0,   43,    0,    0,
        0,  124,  123,  141,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,  138,    0,

       34,   35,    0,    0,    0,    0,    0,   98,    0,  122,
        0,    0,    0,   97,    0
    } ;

static yyconst YY_CHAR yy_ec[256] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
        1,    1,    4,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    2,    1,    5,    6,    1,    1,    1,    1,    1,
        1,    7,    1,    1,    8,    9,   10,   11,   12,   13,
       14,   11,   11,   11,   11,   11,   11,   15,   16,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
       17,    1,    1,    1,   17,    1,   17,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,   18,    1,    1,   19,    1,   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,    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[46] =
    {   0,
        1,    1,    2,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1
    } ;

static yyconst flex_uint16_t yy_base[825] =
    {   0,
        0,    0,  896,   43,   44,   45,   51,   55,   62,   66,
       70,   74,  898,  900,  900,  900,  900,    0,  890,   69,
       82,   61,  862,  855,  105,   54,   68,   69,  101,  862,
      869,  858,  111,  857,  866,  108,   74,  856,  868,  900,
      900,  135,  900,    0,  900,  900,  125,  900,  900,  132,
      900,  900,  137,    0,  880,    0,  900,  117,  842,  118,
      137,  852,  137,  853,  142,  144,  155,  160,  849,  157,
      858,  841,  140,  161,  148,  162,  860,  855,  844,  854,
      845,  831,  851,  836,  833,  171,  833,  835,  831,  827,
      149,  839,  835,  834,  826,  843,  900,  842,  839,  840,

      835,  832,  141,  818,  817,  176,  170,  810,  820,  829,
      169,  809,  811,  818,  188,  900,  846,  900,  900,  843,
      900,  206,  842,  900,  182,  208,  209,  211,  841,  900,
      840,  839,  838,  835,  210,  818,  809,  189,  191,  815,
      794,  798,  804,  813,  812,  813,  798,  797,  797,  809,
      802,  900,  792,  803,  900,  787,  791,  785,  203,  199,
      191,  790,  197,  799,  781,  791,  794,  780,  782,  773,
      211,  792,  789,  791,  768,  782,  216,  774,  784,  776,
      782,  772,  215,  770,  769,  758,  764,  776,  775,  764,
      775,  765,  225,  227,  766,  760,  755,  754,  767,  765,

      766,  747,  756,  751,  750,  900,  753,  753,  762,  753,
      752,  755,  744,  737,  736,  734,  749,  749,  738,  749,
      735,  741,  729,  743,  746,  745,  736,  236,  758,  757,
      756,  755,  754,  753,  900,  900,  900,  247,  900,   75,
      900,  723,  230,  721,  716,  710,  720,  732,  713,  730,
      729,  714,  900,  721,  714,  724,  721,  720,  715,  707,
      716,  700,  712,  698,  716,  711,  703,  711,  694,  704,
      706,  697,  700,  703,  698,  699,  687,  685,  683,  900,
      697,  686,  900,  685,  696,  688,  677,  692,  690,  677,
      688,  674,  670,  679,  684,  676,  682,  681,  679,  678,

      900,  678,  900,  662,  661,  679,  670,  900,  672,  665,
      658,  670,  656,  653,  667,  662,  658,  664,  663,  646,
      649,  900,  663,  900,  660,  657,  644,  658,  638,  650,
      640,  652,  644,  900,  629,  645,  900,  639,  656,  900,
      633,  630,  645,  241,  254,  900,  900,  900,  900,  900,
      900,  660,  635,  641,  641,  631,  642,  641,  240,  900,
      621,  620,  900,  630,  629,  633,  617,  900,  634,  622,
      628,  900,  614,  607,  900,  610,  900,  617,  610,  625,
      618,  624,  609,  900,  622,  616,  900,  606,  611,  900,
      604,  613,  593,  594,  601,  605,  608,  900,  900,  594,

      590,  592,  900,  604,  604,  900,  606,  605,  586,  900,
      900,  590,  598,  593,  583,  597,  900,  584,  583,  594,
      900,  577,  900,  581,  593,  575,  900,  588,  570,  575,
      588,  563,  582,  566,  580,  566,  569,  564,  580,  575,
      578,  571,  259,  566,  567,  575,  261,  263,  573,  554,
      567,  566,  567,  551,  559,  553,  900,  561,  553,  550,
      558,  900,  550,  556,  542,  539,  900,  550,  541,  550,
      540,  549,  546,  548,  539,  525,  535,  534,  533,  232,
      900,  541,  541,  543,  540,  900,  537,  535,  900,  539,
      532,  534,  518,  516,  527,  528,  529,  531,  515,  516,

      509,  900,  508,  520,  900,  521,  520,  500,  503,  522,
      518,  900,  514,  514,  900,  505,  510,  900,  504,  900,
      269,  900,  531,  274,  900,  499,  256,  276,  277,  506,
      493,  900,  266,  506,  509,  495,  488,  900,  900,  900,
      486,  900,  900,  900,  505,  900,  504,  495,  479,  483,
      496,  900,  900,  900,  267,  499,  498,  493,  488,  490,
      476,  482,  473,  483,  482,  465,  900,  484,  900,  484,
      482,  461,  900,  465,  479,  470,  900,  467,  900,  900,
      463,  260,  479,  466,  458,  465,  900,  471,  900,  454,
      287,  289,  460,  449,  457,  280,  289,  452,  465,  467,

      463,  900,  447,  447,  900,  447,  450,  445,  444,  452,
      900,  900,  448,  900,  447,  446,  450,  444,  443,  900,
      433,  900,  449,  434,  432,  432,  448,  447,  900,  442,
      900,  441,  900,  420,  420,  439,  437,  436,  900,  439,
      419,  419,  900,  900,  417,  416,  290,  449,  900,  415,
      414,  420,  416,  900,  418,  426,  408,  408,  422,  900,
      399,  900,  419,  419,  421,  402,  900,  401,  900,  900,
      399,  414,  900,  403,  900,  407,  410,  390,  393,  405,
      410,  405,  409,  399,  291,  900,  900,  392,  405,  387,
      900,  399,  900,  383,  900,  387,  377,  397,  392,  393,

      377,  391,  390,  374,  374,  368,  382,  382,  900,  385,
      388,  375,  380,  292,  141,  373,  349,  900,  900,  900,
      354,  900,  366,   13,  900,  900,  900,   24,  900,   51,
      126,  153,  265,  280,  282,  279,  265,  305,  306,  274,
      287,  292,  280,  900,  900,  280,  281,  281,  298,  283,
      280,  287,  307,  322,  324,  291,  290,  900,  309,  900,
      294,  296,  316,  316,  309,  300,  308,  336,  337,  320,
      321,  900,  309,  900,  327,  326,  313,  900,  328,  349,
      348,  900,  900,  900,  335,  313,  318,  319,  354,  355,
      326,  334,  325,  337,  360,  361,  347,  332,  900,  337,

      900,  900,  351,  334,  352,  350,  341,  900,  349,  900,
      353,  343,  339,  900,  900,  389,  391,  383,  384,  393,
      395,  397,  399,  401
    } ;

static yyconst flex_int16_t yy_def[825] =
    {   0,
      815,    1,  816,  816,  816,  816,  817,  817,  817,  817,
      817,  817,  815,  815,  815,  815,  815,  818,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  819,  815,  815,  820,  815,  815,  821,
      815,  815,  822,  818,  823,   20,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  820,
      815,  820,  821,  815,  821,  821,  821,  821,  822,  815,
      822,  822,  822,  823,  823,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  820,  821,  821,
      821,  821,  821,  821,  815,  815,  815,  823,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  820,  820,  815,  815,  815,  815,  815,
      815,  823,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  820,  820,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  824,  815,  815,  815,  820,  820,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      824,  824,  815,  815,  815,  820,  820,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  820,  820,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  820,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  820,  820,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  820,  820,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  820,  820,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  820,  820,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  820,
      820,  815,  815,  815,  815,  815,  815,  815,  820,  820,
      815,  815,  815,  815,  820,  820,  815,  815,  815,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,    0,  815,  815,  815,  815,  815,
      815,  815,  815,  815
    } ;

static yyconst flex_uint16_t yy_nxt[946] =
    {   0,
       14,   15,   16,   15,   17,   18,   14,   14,   14,   19,
       20,   20,   20,   20,   21,   14,   14,   14,   14,   22,
       23,   24,   25,   26,   27,   14,   28,   29,   30,   31,
       32,   33,   34,   14,   14,   14,   35,   36,   37,   38,
       39,   14,   14,   14,   14,   41,   41,   41,   43,   43,
      744,   42,   45,   46,   45,   47,   45,   46,   45,   47,
      745,   44,   44,   48,   49,   48,   50,   48,   49,   48,
       50,   51,   52,   51,   53,   51,   52,   51,   53,   56,
       56,   56,   56,   80,   89,   57,   90,   93,   95,  746,
       91,   81,   96,   82,   57,   94,   92,  112,   57,  353,

       57,   58,   59,   60,   61,   62,   63,   64,   65,   66,
      113,  354,   67,   68,   69,   70,   71,   72,   73,   74,
       75,   76,   77,   78,   85,   97,   79,   98,   86,  121,
      103,  107,   87,   99,  104,  108,  124,  116,  117,  136,
      109,  130,  110,  118,   88,  121,  111,  137,  131,  132,
      133,  139,  122,  747,  140,  125,  141,  126,  145,  170,
      142,  149,  127,  171,  128,  150,  152,  146,  207,  151,
      143,  175,  195,  147,  156,  153,  154,  208,  157,  160,
      739,  155,  158,  161,  172,  196,  124,  162,  159,  164,
      748,  165,  176,  166,  177,  173,  178,  167,  211,  179,

      174,  189,  221,  190,  212,  222,  216,  213,  217,  226,
      121,  214,  124,  124,  215,  124,  238,  229,  227,  239,
      242,  228,  244,  245,  265,  246,  267,  243,  269,  270,
      247,  230,  232,  272,  234,  273,  281,  268,  289,  296,
      121,  297,  282,  290,  266,  121,  231,  233,  308,  283,
      310,  298,  309,  135,  311,  344,  352,  356,  121,  455,
      521,  522,  523,  456,  524,  121,  357,  121,  558,  345,
      521,  522,  523,  559,  524,  448,  522,  592,  447,  594,
      121,  121,  528,  635,  121,  600,  613,  636,  595,  522,
      592,  643,  592,  121,  121,  121,  121,  685,  749,  750,

      597,  529,  601,  596,  614,  751,  752,  647,  753,  121,
      121,  738,  714,  756,  757,  758,  759,  760,  761,  762,
      763,  764,  765,  715,  766,  767,  121,  648,  121,  770,
      771,  772,  773,  774,  775,  776,  777,  755,  778,  779,
      121,  121,  754,  782,  783,  768,  784,  769,  785,  786,
      787,  788,  121,  121,  791,  792,  793,  794,  121,  121,
      797,  798,  799,  800,  801,  802,  803,  780,  789,  804,
      805,  806,  807,  781,  808,  790,  796,  809,  810,  811,
      812,  813,  814,   54,  119,  743,  742,  741,  795,   40,
       40,   14,   14,  120,  120,  123,  123,  129,  129,  134,

      134,  591,  591,  740,  737,  736,  735,  734,  733,  732,
      731,  730,  729,  728,  727,  726,  725,  724,  723,  722,
      721,  720,  719,  718,  717,  716,  713,  712,  711,  710,
      709,  708,  707,  706,  705,  704,  703,  702,  701,  700,
      699,  698,  697,  696,  695,  694,  693,  692,  691,  690,
      689,  688,  687,  686,  684,  683,  682,  681,  680,  679,
      678,  677,  676,  675,  674,  673,  672,  671,  670,  669,
      668,  667,  666,  665,  664,  663,  662,  661,  660,  659,
      658,  657,  656,  655,  654,  653,  652,  651,  650,  649,
      646,  645,  644,  642,  641,  640,  639,  638,  637,  634,

      633,  632,  631,  630,  629,  628,  627,  626,  625,  624,
      623,  622,  621,  620,  619,  618,  617,  616,  615,  612,
      611,  610,  609,  608,  607,  606,  605,  604,  603,  602,
      599,  598,  593,  522,  590,  589,  588,  587,  586,  585,
      584,  583,  582,  581,  580,  579,  578,  577,  576,  575,
      574,  573,  572,  571,  570,  569,  568,  567,  566,  565,
      564,  563,  562,  561,  560,  557,  556,  555,  554,  553,
      552,  551,  550,  549,  548,  547,  546,  545,  544,  543,
      542,  541,  540,  539,  538,  537,  536,  535,  534,  533,
      532,  531,  530,  527,  526,  525,  520,  519,  518,  517,

      516,  515,  514,  513,  512,  511,  510,  509,  508,  507,
      506,  505,  504,  503,  502,  501,  500,  499,  498,  497,
      496,  495,  494,  493,  492,  491,  490,  489,  488,  487,
      486,  485,  484,  483,  482,  481,  480,  479,  478,  477,
      476,  475,  474,  473,  472,  471,  470,  469,  468,  467,
      466,  465,  464,  463,  462,  461,  460,  459,  458,  457,
      454,  453,  452,  451,  450,  449,  135,  446,  445,  444,
      443,  442,  441,  440,  439,  438,  437,  436,  435,  434,
      433,  432,  431,  430,  429,  428,  427,  426,  425,  424,
      423,  422,  421,  420,  419,  418,  417,  416,  415,  414,

      413,  412,  411,  410,  409,  408,  407,  406,  405,  404,
      403,  402,  401,  400,  399,  398,  397,  396,  395,  394,
      393,  392,  391,  390,  389,  388,  387,  386,  385,  384,
      383,  382,  381,  380,  379,  378,  377,  376,  375,  374,
      373,  372,  371,  370,  369,  368,  367,  366,  365,  364,
      363,  362,  361,  360,  359,  358,  355,  351,  350,  349,
      348,  347,  346,  343,  342,  341,  340,  339,  338,  337,
      336,  335,  334,  333,  332,  331,  330,  329,  328,  327,
      326,  325,  324,  323,  322,  321,  320,  319,  318,  317,
      316,  315,  314,  313,  312,  307,  306,  305,  304,  303,

      302,  301,  300,  299,  295,  294,  293,  292,  291,  288,
      287,  286,  285,  284,  280,  279,  278,  277,  276,  275,
      274,  271,  264,  263,  262,  261,  260,  259,  258,  257,
      256,  255,  254,  253,  252,  251,  250,  249,  248,  241,
      240,  135,  237,  236,  235,  130,  124,  121,  116,  225,
      224,  223,  220,  219,  218,  210,  209,  206,  205,  204,
      203,  202,  201,  200,  199,  198,  197,  194,  193,  192,
      191,  188,  187,  186,  185,  184,  183,  182,  181,  180,
      169,  168,  163,  148,  144,  138,  135,  115,  114,  106,
      105,  102,  101,  100,   84,   83,   55,  815,   41,   13,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815
    } ;

static yyconst flex_int16_t yy_chk[946] =
    {   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,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    4,    5,    6,    5,    6,
      724,    4,    7,    7,    7,    7,    8,    8,    8,    8,
      728,    5,    6,    9,    9,    9,    9,   10,   10,   10,
       10,   11,   11,   11,   11,   12,   12,   12,   12,   20,
       20,   20,   20,   22,   26,   20,   26,   27,   28,  730,
       26,   22,   28,   22,   20,   27,   26,   37,   20,  240,

       20,   21,   21,   21,   21,   21,   21,   21,   21,   21,
       37,  240,   21,   21,   21,   21,   21,   21,   21,   21,
       21,   21,   21,   21,   25,   29,   21,   29,   25,   47,
       33,   36,   25,   29,   33,   36,   50,   42,   42,   58,
       36,   53,   36,   42,   25,  715,   36,   58,   53,   53,
       53,   60,   47,  731,   60,   50,   61,   50,   63,   73,
       61,   65,   50,   73,   50,   65,   66,   63,  103,   65,
       61,   75,   91,   63,   67,   66,   66,  103,   67,   68,
      715,   66,   67,   68,   74,   91,  125,   68,   67,   70,
      732,   70,   75,   70,   76,   74,   76,   70,  106,   76,

       74,   86,  111,   86,  106,  111,  107,  106,  107,  115,
      122,  106,  126,  127,  106,  128,  135,  125,  115,  135,
      138,  122,  139,  139,  159,  139,  160,  138,  161,  161,
      139,  126,  127,  163,  128,  163,  171,  160,  177,  183,
      228,  183,  171,  177,  159,  344,  126,  127,  193,  171,
      194,  183,  193,  238,  194,  228,  238,  243,  345,  359,
      443,  443,  443,  359,  443,  447,  243,  448,  480,  228,
      521,  521,  521,  480,  521,  345,  524,  524,  344,  527,
      528,  529,  447,  582,  596,  533,  555,  582,  527,  591,
      591,  592,  592,  597,  647,  685,  714,  647,  733,  734,

      529,  448,  533,  528,  555,  735,  736,  596,  737,  738,
      739,  714,  685,  740,  741,  742,  743,  746,  747,  748,
      749,  750,  751,  685,  752,  753,  754,  597,  755,  756,
      757,  759,  761,  762,  763,  764,  765,  739,  766,  767,
      768,  769,  738,  770,  771,  754,  773,  755,  775,  776,
      777,  779,  781,  780,  785,  786,  787,  788,  789,  790,
      791,  792,  793,  794,  795,  796,  797,  768,  780,  798,
      800,  803,  804,  769,  805,  781,  790,  806,  807,  809,
      811,  812,  813,  818,  819,  723,  721,  717,  789,  816,
      816,  817,  817,  820,  820,  821,  821,  822,  822,  823,

      823,  824,  824,  716,  713,  712,  711,  710,  708,  707,
      706,  705,  704,  703,  702,  701,  700,  699,  698,  697,
      696,  694,  692,  690,  689,  688,  684,  683,  682,  681,
      680,  679,  678,  677,  676,  674,  672,  671,  668,  666,
      665,  664,  663,  661,  659,  658,  657,  656,  655,  653,
      652,  651,  650,  648,  646,  645,  642,  641,  640,  638,
      637,  636,  635,  634,  632,  630,  628,  627,  626,  625,
      624,  623,  621,  619,  618,  617,  616,  615,  613,  610,
      609,  608,  607,  606,  604,  603,  601,  600,  599,  598,
      595,  594,  593,  590,  588,  586,  585,  584,  583,  581,

      578,  576,  575,  574,  572,  571,  570,  568,  566,  565,
      564,  563,  562,  561,  560,  559,  558,  557,  556,  551,
      550,  549,  548,  547,  545,  541,  537,  536,  535,  534,
      531,  530,  526,  523,  519,  517,  516,  514,  513,  511,
      510,  509,  508,  507,  506,  504,  503,  501,  500,  499,
      498,  497,  496,  495,  494,  493,  492,  491,  490,  488,
      487,  485,  484,  483,  482,  479,  478,  477,  476,  475,
      474,  473,  472,  471,  470,  469,  468,  466,  465,  464,
      463,  461,  460,  459,  458,  456,  455,  454,  453,  452,
      451,  450,  449,  446,  445,  444,  442,  441,  440,  439,

      438,  437,  436,  435,  434,  433,  432,  431,  430,  429,
      428,  426,  425,  424,  422,  420,  419,  418,  416,  415,
      414,  413,  412,  409,  408,  407,  405,  404,  402,  401,
      400,  397,  396,  395,  394,  393,  392,  391,  389,  388,
      386,  385,  383,  382,  381,  380,  379,  378,  376,  374,
      373,  371,  370,  369,  367,  366,  365,  364,  362,  361,
      358,  357,  356,  355,  354,  353,  352,  343,  342,  341,
      339,  338,  336,  335,  333,  332,  331,  330,  329,  328,
      327,  326,  325,  323,  321,  320,  319,  318,  317,  316,
      315,  314,  313,  312,  311,  310,  309,  307,  306,  305,

      304,  302,  300,  299,  298,  297,  296,  295,  294,  293,
      292,  291,  290,  289,  288,  287,  286,  285,  284,  282,
      281,  279,  278,  277,  276,  275,  274,  273,  272,  271,
      270,  269,  268,  267,  266,  265,  264,  263,  262,  261,
      260,  259,  258,  257,  256,  255,  254,  252,  251,  250,
      249,  248,  247,  246,  245,  244,  242,  234,  233,  232,
      231,  230,  229,  227,  226,  225,  224,  223,  222,  221,
      220,  219,  218,  217,  216,  215,  214,  213,  212,  211,
      210,  209,  208,  207,  205,  204,  203,  202,  201,  200,
      199,  198,  197,  196,  195,  192,  191,  190,  189,  188,

      187,  186,  185,  184,  182,  181,  180,  179,  178,  176,
      175,  174,  173,  172,  170,  169,  168,  167,  166,  165,
      164,  162,  158,  157,  156,  154,  153,  151,  150,  149,
      148,  147,  146,  145,  144,  143,  142,  141,  140,  137,
      136,  134,  133,  132,  131,  129,  123,  120,  117,  114,
      113,  112,  110,  109,  108,  105,  104,  102,  101,  100,
       99,   98,   96,   95,   94,   93,   92,   90,   89,   88,
       87,   85,   84,   83,   82,   81,   80,   79,   78,   77,
       72,   71,   69,   64,   62,   59,   55,   39,   38,   35,
       34,   32,   31,   30,   24,   23,   19,   13,    3,  815,

      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815,  815,  815,  815,  815,  815,
      815,  815,  815,  815,  815
    } ;

/* Table of booleans, true if rule could match eol. */
static yyconst flex_int32_t yy_rule_can_match_eol[156] =
    {   0,
0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
    0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0,     };

static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;

extern int sieve_flex_debug;
int sieve_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 *sievetext;
#line 1 "sieve/sieve-lex.l"
#line 2 "sieve/sieve-lex.l"
/* sieve.l -- sieve lexer
 * Larry Greenfield
 * Ken Murchison
 *
 * Copyright (c) 1994-2017 Carnegie Mellon University.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * 3. The name "Carnegie Mellon University" must not be used to
 *    endorse or promote products derived from this software without
 *    prior written permission. For permission or any legal
 *    details, please contact
 *      Carnegie Mellon University
 *      Center for Technology Transfer and Enterprise Creation
 *      4615 Forbes Avenue
 *      Suite 302
 *      Pittsburgh, PA  15213
 *      (412) 268-7393, fax: (412) 268-7395
 *      innovation@andrew.cmu.edu
 *
 * 4. Redistributions of any form whatsoever must retain the following
 *    acknowledgment:
 *    "This product includes software developed by Computing Services
 *     at Carnegie Mellon University (http://www.cmu.edu/computing/)."
 *
 * 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 <config.h>
#endif

#include "util.h"

#include "sieve/tree.h"
#include "sieve/sieve_interface.h"
#include "sieve/sieve.h"

#define YY_NO_INPUT
#define YY_DECL int sievelex(YYSTYPE *yylval,sieve_script_t *sscript)

static struct buf buf;   /* buffer for multi-line text and quoted strings */
extern int encoded_char; /* used to receive encoded-char feedback from parser */

static unsigned long long tonum(const char *str);
static int decode_string(struct buf *buf);
extern void sieveerror(sieve_script_t *, char *);
extern void sieveerror_f(sieve_script_t *, char *fmt, ...);
/* linebreak */
/* non-linebreaking whitespace */





#line 1055 "sieve/sieve-lex.c"

#define INITIAL 0
#define MULTILINE 1
#define QSTRING 2
#define QCOLLATION 3
#define QRELATION 4
#define QIMPORTANCE 5

#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 <unistd.h>
#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 sievelex_destroy (void );

int sieveget_debug (void );

void sieveset_debug (int debug_flag  );

YY_EXTRA_TYPE sieveget_extra (void );

void sieveset_extra (YY_EXTRA_TYPE user_defined  );

FILE *sieveget_in (void );

void sieveset_in  (FILE * _in_str  );

FILE *sieveget_out (void );

void sieveset_out  (FILE * _out_str  );

			int sieveget_leng (void );

char *sieveget_text (void );

int sieveget_lineno (void );

void sieveset_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 sievewrap (void );
#else
extern int sievewrap (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( sievetext, (size_t) sieveleng, 1, sieveout )) {} } 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( sievein )) != EOF && c != '\n'; ++n ) \
			buf[n] = (char) c; \
		if ( c == '\n' ) \
			buf[n++] = (char) c; \
		if ( c == EOF && ferror( sievein ) ) \
			YY_FATAL_ERROR( "input in flex scanner failed" ); \
		result = n; \
		} \
	else \
		{ \
		errno=0; \
		while ( (result = (int) fread(buf, 1, max_size, sievein))==0 && ferror(sievein)) \
			{ \
			if( errno != EINTR) \
				{ \
				YY_FATAL_ERROR( "input in flex scanner failed" ); \
				break; \
				} \
			errno=0; \
			clearerr(sievein); \
			} \
		}\
\

#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 sievelex (void);

#define YY_DECL int sievelex (void)
#endif /* !YY_DECL */

/* Code executed at the beginning of each rule, after sievetext and sieveleng
 * 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 \
	if ( sieveleng > 0 ) \
		YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
				(sievetext[sieveleng - 1] == '\n'); \
	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 ( ! sievein )
			sievein = stdin;

		if ( ! sieveout )
			sieveout = stdout;

		if ( ! YY_CURRENT_BUFFER ) {
			sieveensure_buffer_stack ();
			YY_CURRENT_BUFFER_LVALUE =
				sieve_create_buffer(sievein,YY_BUF_SIZE );
		}

		sieve_load_buffer_state( );
		}

	{
#line 85 "sieve/sieve-lex.l"

    /* dot stuffing */
#line 1282 "sieve/sieve-lex.c"

	while ( /*CONSTCOND*/1 )		/* loops until end-of-file is reached */
		{
		yy_cp = (yy_c_buf_p);

		/* Support of sievetext. */
		*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_current_state += YY_AT_BOL();
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 >= 816 )
					yy_c = yy_meta[(unsigned int) yy_c];
				}
			yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) yy_c];
			++yy_cp;
			}
		while ( yy_base[yy_current_state] != 900 );

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;

		if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
			{
			int yyl;
			for ( yyl = 0; yyl < sieveleng; ++yyl )
				if ( sievetext[yyl] == '\n' )
					
    sievelineno++;
;
			}

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 87 "sieve/sieve-lex.l"
buf_putc(&buf, sievetext[1]);
	YY_BREAK
/* end of multi-line text */
case 2:
/* rule 2 can match eol */
#line 91 "sieve/sieve-lex.l"
/* end of quoted string */
case 3:
YY_RULE_SETUP
#line 93 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  if (encoded_char && !decode_string(&buf)) {
                                      sieveerror_f(sscript,
                                                   "invalid unicode encoding: %s",
                                                   buf_cstring(&buf));
                                  }
                                  yylval->sval = buf_release(&buf);
                                  return STRING;
                              }
	YY_BREAK
/* escaped character */
case 4:
YY_RULE_SETUP
#line 105 "sieve/sieve-lex.l"
buf_putc(&buf, sievetext[1]);
	YY_BREAK
/* any character (including LF) */
case 5:
/* rule 5 can match eol */
YY_RULE_SETUP
#line 108 "sieve/sieve-lex.l"
buf_putc(&buf, sievetext[0]);
	YY_BREAK
/* premature EOF */
case YY_STATE_EOF(QSTRING):
case YY_STATE_EOF(MULTILINE):
#line 111 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  sieveerror(sscript,
                                             "unexpected end of file in string");
                                  buf_free(&buf);
                                  yyterminate();
                              }
	YY_BREAK
/* beginning of multi-line text */
case 6:
/* rule 6 can match eol */
YY_RULE_SETUP
#line 120 "sieve/sieve-lex.l"
{
                                  BEGIN MULTILINE;
                                  buf_reset(&buf);
                              }
	YY_BREAK
/* beginning of quoted string */
case 7:
YY_RULE_SETUP
#line 126 "sieve/sieve-lex.l"
{
                                  BEGIN QSTRING;
                                  buf_reset(&buf);
                              }
	YY_BREAK
/* number with optional power of 2 suffix */
case 8:
YY_RULE_SETUP
#line 132 "sieve/sieve-lex.l"
{
                                  unsigned long long val = tonum(sievetext);
                                  if (val > INT_MAX) {
                                      sieveerror_f(sscript,
                                                   "number too large %s",
                                                   sievetext);
                                  }
                                  yylval->nval = val;
                                  return NUMBER;
                              }
	YY_BREAK
/* standard control commands - RFC 5228 */
case 9:
YY_RULE_SETUP
#line 144 "sieve/sieve-lex.l"
return IF;
	YY_BREAK
case 10:
YY_RULE_SETUP
#line 145 "sieve/sieve-lex.l"
return ELSIF;
	YY_BREAK
case 11:
YY_RULE_SETUP
#line 146 "sieve/sieve-lex.l"
return ELSE;
	YY_BREAK
case 12:
YY_RULE_SETUP
#line 147 "sieve/sieve-lex.l"
return REQUIRE;
	YY_BREAK
case 13:
YY_RULE_SETUP
#line 148 "sieve/sieve-lex.l"
return STOP;
	YY_BREAK
/* standard tests - RFC 5228 */
case 14:
YY_RULE_SETUP
#line 151 "sieve/sieve-lex.l"
return ANYOF;
	YY_BREAK
case 15:
YY_RULE_SETUP
#line 152 "sieve/sieve-lex.l"
return ALLOF;
	YY_BREAK
case 16:
YY_RULE_SETUP
#line 153 "sieve/sieve-lex.l"
return EXISTS;
	YY_BREAK
case 17:
YY_RULE_SETUP
#line 154 "sieve/sieve-lex.l"
return SFALSE;
	YY_BREAK
case 18:
YY_RULE_SETUP
#line 155 "sieve/sieve-lex.l"
return STRUE;
	YY_BREAK
case 19:
YY_RULE_SETUP
#line 156 "sieve/sieve-lex.l"
return NOT;
	YY_BREAK
case 20:
YY_RULE_SETUP
#line 157 "sieve/sieve-lex.l"
return HEADERT;
	YY_BREAK
case 21:
YY_RULE_SETUP
#line 158 "sieve/sieve-lex.l"
return ADDRESS;
	YY_BREAK
case 22:
YY_RULE_SETUP
#line 159 "sieve/sieve-lex.l"
return ENVELOPE;
	YY_BREAK
case 23:
YY_RULE_SETUP
#line 160 "sieve/sieve-lex.l"
return SIZE;
	YY_BREAK
case 24:
YY_RULE_SETUP
#line 161 "sieve/sieve-lex.l"
return yylval->nval = OVER;
	YY_BREAK
case 25:
YY_RULE_SETUP
#line 162 "sieve/sieve-lex.l"
return yylval->nval = UNDER;
	YY_BREAK
/* standard action commands - RFC 5228 */
case 26:
YY_RULE_SETUP
#line 165 "sieve/sieve-lex.l"
return DISCARD;
	YY_BREAK
case 27:
YY_RULE_SETUP
#line 166 "sieve/sieve-lex.l"
return KEEP;
	YY_BREAK
case 28:
YY_RULE_SETUP
#line 167 "sieve/sieve-lex.l"
return FILEINTO;
	YY_BREAK
case 29:
YY_RULE_SETUP
#line 168 "sieve/sieve-lex.l"
return REDIRECT;
	YY_BREAK
/* copy - RFC 3894 */
case 30:
YY_RULE_SETUP
#line 171 "sieve/sieve-lex.l"
return COPY;
	YY_BREAK
/* comparator-types - RFC 5228 */
case 31:
YY_RULE_SETUP
#line 174 "sieve/sieve-lex.l"
{ BEGIN QCOLLATION; return COMPARATOR; }
	YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 176 "sieve/sieve-lex.l"
;       /* ignore whitespace */
	YY_BREAK
case 33:
YY_RULE_SETUP
#line 177 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  return yylval->nval = OCTET;
                              }
	YY_BREAK
case 34:
YY_RULE_SETUP
#line 181 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  return yylval->nval = ASCIICASEMAP;
                              }
	YY_BREAK
case 35:
YY_RULE_SETUP
#line 185 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  return yylval->nval = ASCIINUMERIC;
                              }
	YY_BREAK
case 36:
/* rule 36 can match eol */
YY_RULE_SETUP
#line 189 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  sieveerror_f(sscript,
                                               "unknown comparator-name %s",
                                               sievetext);
                              }
	YY_BREAK
/* match-types - RFC 5228 */
case 37:
YY_RULE_SETUP
#line 197 "sieve/sieve-lex.l"
return yylval->nval = IS;
	YY_BREAK
case 38:
YY_RULE_SETUP
#line 198 "sieve/sieve-lex.l"
return yylval->nval = CONTAINS;
	YY_BREAK
case 39:
YY_RULE_SETUP
#line 199 "sieve/sieve-lex.l"
return yylval->nval = MATCHES;
	YY_BREAK
/* regex - draft-ietf-sieve-regex */
case 40:
YY_RULE_SETUP
#line 202 "sieve/sieve-lex.l"
return yylval->nval = REGEX;
	YY_BREAK
case 41:
YY_RULE_SETUP
#line 203 "sieve/sieve-lex.l"
return yylval->nval = QUOTEREGEX;
	YY_BREAK
/* extlists - RFC 6134 */
case 42:
YY_RULE_SETUP
#line 206 "sieve/sieve-lex.l"
return yylval->nval = LIST;
	YY_BREAK
case 43:
YY_RULE_SETUP
#line 207 "sieve/sieve-lex.l"
return VALIDEXTLIST;
	YY_BREAK
/* address-parts - RFC 5228 */
case 44:
YY_RULE_SETUP
#line 210 "sieve/sieve-lex.l"
return yylval->nval = ALL;
	YY_BREAK
case 45:
YY_RULE_SETUP
#line 211 "sieve/sieve-lex.l"
return yylval->nval = LOCALPART;
	YY_BREAK
case 46:
YY_RULE_SETUP
#line 212 "sieve/sieve-lex.l"
return yylval->nval = DOMAIN;
	YY_BREAK
/* subaddress - RFC 5233 */
case 47:
YY_RULE_SETUP
#line 215 "sieve/sieve-lex.l"
return yylval->nval = USER;
	YY_BREAK
case 48:
YY_RULE_SETUP
#line 216 "sieve/sieve-lex.l"
return yylval->nval = DETAIL;
	YY_BREAK
/* body - RFC 5173 */
case 49:
YY_RULE_SETUP
#line 219 "sieve/sieve-lex.l"
return BODY;
	YY_BREAK
case 50:
YY_RULE_SETUP
#line 220 "sieve/sieve-lex.l"
return yylval->nval = RAW;
	YY_BREAK
case 51:
YY_RULE_SETUP
#line 221 "sieve/sieve-lex.l"
return yylval->nval = TEXT;
	YY_BREAK
case 52:
YY_RULE_SETUP
#line 222 "sieve/sieve-lex.l"
return yylval->nval = CONTENT;
	YY_BREAK
/* environment - RFC 5183 */
case 53:
YY_RULE_SETUP
#line 225 "sieve/sieve-lex.l"
return ENVIRONMENT;
	YY_BREAK
/* variables - RFC 5229 */
case 54:
YY_RULE_SETUP
#line 228 "sieve/sieve-lex.l"
return STRINGT;
	YY_BREAK
case 55:
YY_RULE_SETUP
#line 229 "sieve/sieve-lex.l"
return SET;
	YY_BREAK
case 56:
YY_RULE_SETUP
#line 230 "sieve/sieve-lex.l"
return yylval->nval = LOWER;
	YY_BREAK
case 57:
YY_RULE_SETUP
#line 231 "sieve/sieve-lex.l"
return yylval->nval = UPPER;
	YY_BREAK
case 58:
YY_RULE_SETUP
#line 232 "sieve/sieve-lex.l"
return yylval->nval = LOWERFIRST;
	YY_BREAK
case 59:
YY_RULE_SETUP
#line 233 "sieve/sieve-lex.l"
return yylval->nval = UPPERFIRST;
	YY_BREAK
case 60:
YY_RULE_SETUP
#line 234 "sieve/sieve-lex.l"
return yylval->nval = QUOTEWILDCARD;
	YY_BREAK
case 61:
YY_RULE_SETUP
#line 235 "sieve/sieve-lex.l"
return yylval->nval = LENGTH;
	YY_BREAK
/* vacation - RFC 5230 */
case 62:
YY_RULE_SETUP
#line 238 "sieve/sieve-lex.l"
return VACATION;
	YY_BREAK
case 63:
YY_RULE_SETUP
#line 239 "sieve/sieve-lex.l"
return DAYS;
	YY_BREAK
case 64:
YY_RULE_SETUP
#line 240 "sieve/sieve-lex.l"
return ADDRESSES;
	YY_BREAK
case 65:
YY_RULE_SETUP
#line 241 "sieve/sieve-lex.l"
return SUBJECT;
	YY_BREAK
case 66:
YY_RULE_SETUP
#line 242 "sieve/sieve-lex.l"
return FROM;
	YY_BREAK
case 67:
YY_RULE_SETUP
#line 243 "sieve/sieve-lex.l"
return HANDLE;
	YY_BREAK
case 68:
YY_RULE_SETUP
#line 244 "sieve/sieve-lex.l"
return MIME;
	YY_BREAK
/* vacation-seconds - RFC 6131 */
case 69:
YY_RULE_SETUP
#line 247 "sieve/sieve-lex.l"
return SECONDS;
	YY_BREAK
/* relational - RFC 5231 */
case 70:
YY_RULE_SETUP
#line 250 "sieve/sieve-lex.l"
{ BEGIN QRELATION; return yylval->nval = COUNT; }
	YY_BREAK
case 71:
YY_RULE_SETUP
#line 251 "sieve/sieve-lex.l"
{ BEGIN QRELATION; return yylval->nval = VALUE; }
	YY_BREAK
case 72:
/* rule 72 can match eol */
YY_RULE_SETUP
#line 253 "sieve/sieve-lex.l"
;        /* ignore whitespace */
	YY_BREAK
case 73:
YY_RULE_SETUP
#line 254 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = EQ; }
	YY_BREAK
case 74:
YY_RULE_SETUP
#line 255 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = NE; }
	YY_BREAK
case 75:
YY_RULE_SETUP
#line 256 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = GT; }
	YY_BREAK
case 76:
YY_RULE_SETUP
#line 257 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = GE; }
	YY_BREAK
case 77:
YY_RULE_SETUP
#line 258 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = LT; }
	YY_BREAK
case 78:
YY_RULE_SETUP
#line 259 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = LE; }
	YY_BREAK
case 79:
/* rule 79 can match eol */
YY_RULE_SETUP
#line 260 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  sieveerror_f(sscript,
                                               "invalid relational-match %s",
                                               sievetext);
                              }
	YY_BREAK
/* imap4flags - RFC 5232 */
case 80:
YY_RULE_SETUP
#line 268 "sieve/sieve-lex.l"
return yylval->nval = SETFLAG;
	YY_BREAK
case 81:
YY_RULE_SETUP
#line 269 "sieve/sieve-lex.l"
return yylval->nval = ADDFLAG;
	YY_BREAK
case 82:
YY_RULE_SETUP
#line 270 "sieve/sieve-lex.l"
return yylval->nval = REMOVEFLAG;
	YY_BREAK
case 83:
YY_RULE_SETUP
#line 271 "sieve/sieve-lex.l"
return yylval->nval = HASFLAG;
	YY_BREAK
case 84:
YY_RULE_SETUP
#line 272 "sieve/sieve-lex.l"
return FLAGS;
	YY_BREAK
/* imapflags - draft-melnikov-sieve-imapflags-04 */
case 85:
YY_RULE_SETUP
#line 275 "sieve/sieve-lex.l"
return yylval->nval = MARK;
	YY_BREAK
case 86:
YY_RULE_SETUP
#line 276 "sieve/sieve-lex.l"
return yylval->nval = UNMARK;
	YY_BREAK
/* date - RFC 5260 */
case 87:
YY_RULE_SETUP
#line 279 "sieve/sieve-lex.l"
return DATE;
	YY_BREAK
case 88:
YY_RULE_SETUP
#line 280 "sieve/sieve-lex.l"
return ORIGINALZONE;
	YY_BREAK
case 89:
YY_RULE_SETUP
#line 281 "sieve/sieve-lex.l"
return ZONE;
	YY_BREAK
case 90:
YY_RULE_SETUP
#line 282 "sieve/sieve-lex.l"
return CURRENTDATE;
	YY_BREAK
/* index - RFC 5260 */
case 91:
YY_RULE_SETUP
#line 285 "sieve/sieve-lex.l"
return INDEX;
	YY_BREAK
case 92:
YY_RULE_SETUP
#line 286 "sieve/sieve-lex.l"
return LAST;
	YY_BREAK
/* editheader - RFC 5293 */
case 93:
YY_RULE_SETUP
#line 289 "sieve/sieve-lex.l"
return ADDHEADER;
	YY_BREAK
case 94:
YY_RULE_SETUP
#line 290 "sieve/sieve-lex.l"
return DELETEHEADER;
	YY_BREAK
/*   :index               defined in 'index' */
/*   :last                defined in 'index' */
/* [e]reject - RFC 5429 */
case 95:
YY_RULE_SETUP
#line 295 "sieve/sieve-lex.l"
return yylval->nval = REJCT;
	YY_BREAK
case 96:
YY_RULE_SETUP
#line 296 "sieve/sieve-lex.l"
return yylval->nval = EREJECT;
	YY_BREAK
/* enotify - RFC 5435 */
case 97:
YY_RULE_SETUP
#line 299 "sieve/sieve-lex.l"
return NOTIFYMETHODCAPABILITY;
	YY_BREAK
case 98:
YY_RULE_SETUP
#line 300 "sieve/sieve-lex.l"
return VALIDNOTIFYMETHOD;
	YY_BREAK
case 99:
YY_RULE_SETUP
#line 301 "sieve/sieve-lex.l"
return NOTIFY;
	YY_BREAK
case 100:
YY_RULE_SETUP
#line 302 "sieve/sieve-lex.l"
return OPTIONS;
	YY_BREAK
case 101:
YY_RULE_SETUP
#line 303 "sieve/sieve-lex.l"
return MESSAGE;
	YY_BREAK
case 102:
YY_RULE_SETUP
#line 304 "sieve/sieve-lex.l"
return yylval->nval = ENCODEURL;
	YY_BREAK
case 103:
YY_RULE_SETUP
#line 305 "sieve/sieve-lex.l"
{ BEGIN QIMPORTANCE; return IMPORTANCE; }
	YY_BREAK
case 104:
/* rule 104 can match eol */
YY_RULE_SETUP
#line 307 "sieve/sieve-lex.l"
;      /* ignore whitespace */
	YY_BREAK
case 105:
YY_RULE_SETUP
#line 308 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = HIGH;   }
	YY_BREAK
case 106:
YY_RULE_SETUP
#line 309 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = NORMAL; }
	YY_BREAK
case 107:
YY_RULE_SETUP
#line 310 "sieve/sieve-lex.l"
{ BEGIN INITIAL; return yylval->nval = LOW;    }
	YY_BREAK
case 108:
/* rule 108 can match eol */
YY_RULE_SETUP
#line 311 "sieve/sieve-lex.l"
{
                                  BEGIN INITIAL;
                                  sieveerror_f(sscript,
                                               "invalid importance %s", sievetext);
                              }
	YY_BREAK
/* notify - draft-martin-sieve-notify-01 */
case 109:
YY_RULE_SETUP
#line 318 "sieve/sieve-lex.l"
return DENOTIFY;
	YY_BREAK
case 110:
YY_RULE_SETUP
#line 319 "sieve/sieve-lex.l"
return METHOD;
	YY_BREAK
case 111:
YY_RULE_SETUP
#line 320 "sieve/sieve-lex.l"
return ID;
	YY_BREAK
case 112:
YY_RULE_SETUP
#line 321 "sieve/sieve-lex.l"
return yylval->nval = LOW;
	YY_BREAK
case 113:
YY_RULE_SETUP
#line 322 "sieve/sieve-lex.l"
return yylval->nval = NORMAL;
	YY_BREAK
case 114:
YY_RULE_SETUP
#line 323 "sieve/sieve-lex.l"
return yylval->nval = HIGH;
	YY_BREAK
/* ihave - RFC 5463 */
case 115:
YY_RULE_SETUP
#line 326 "sieve/sieve-lex.l"
return IHAVE;
	YY_BREAK
case 116:
YY_RULE_SETUP
#line 327 "sieve/sieve-lex.l"
return ERROR;
	YY_BREAK
/* mailbox - RFC 5490 */
case 117:
YY_RULE_SETUP
#line 330 "sieve/sieve-lex.l"
return MAILBOXEXISTS;
	YY_BREAK
case 118:
YY_RULE_SETUP
#line 331 "sieve/sieve-lex.l"
return CREATE;
	YY_BREAK
/* mboxmetadata - RFC 5490 */
case 119:
YY_RULE_SETUP
#line 334 "sieve/sieve-lex.l"
return yylval->nval = METADATA;
	YY_BREAK
case 120:
YY_RULE_SETUP
#line 335 "sieve/sieve-lex.l"
return METADATAEXISTS;
	YY_BREAK
/* servermetadata - RFC 5490 */
case 121:
YY_RULE_SETUP
#line 338 "sieve/sieve-lex.l"
return yylval->nval = SERVERMETADATA;
	YY_BREAK
case 122:
YY_RULE_SETUP
#line 339 "sieve/sieve-lex.l"
return SERVERMETADATAEXISTS;
	YY_BREAK
/* redirect-deliverby - RFC 6009 */
case 123:
YY_RULE_SETUP
#line 342 "sieve/sieve-lex.l"
return BYTIMEREL;
	YY_BREAK
case 124:
YY_RULE_SETUP
#line 343 "sieve/sieve-lex.l"
return BYTIMEABS;
	YY_BREAK
case 125:
YY_RULE_SETUP
#line 344 "sieve/sieve-lex.l"
return BYMODE;
	YY_BREAK
case 126:
YY_RULE_SETUP
#line 345 "sieve/sieve-lex.l"
return BYTRACE;
	YY_BREAK
/* redirect-dsn - RFC 6009 */
case 127:
YY_RULE_SETUP
#line 348 "sieve/sieve-lex.l"
return DSNNOTIFY;
	YY_BREAK
case 128:
YY_RULE_SETUP
#line 349 "sieve/sieve-lex.l"
return DSNRET;
	YY_BREAK
/* include - RFC 6609 */
case 129:
YY_RULE_SETUP
#line 352 "sieve/sieve-lex.l"
return INCLUDE;
	YY_BREAK
case 130:
YY_RULE_SETUP
#line 353 "sieve/sieve-lex.l"
return yylval->nval = PERSONAL;
	YY_BREAK
case 131:
YY_RULE_SETUP
#line 354 "sieve/sieve-lex.l"
return yylval->nval = GLOBAL;
	YY_BREAK
case 132:
YY_RULE_SETUP
#line 355 "sieve/sieve-lex.l"
return OPTIONAL;
	YY_BREAK
case 133:
YY_RULE_SETUP
#line 356 "sieve/sieve-lex.l"
return ONCE;
	YY_BREAK
case 134:
YY_RULE_SETUP
#line 357 "sieve/sieve-lex.l"
return RETURN;
	YY_BREAK
/* duplicate - RFC 7352 */
case 135:
YY_RULE_SETUP
#line 360 "sieve/sieve-lex.l"
return DUPLICATE;
	YY_BREAK
case 136:
YY_RULE_SETUP
#line 361 "sieve/sieve-lex.l"
return yylval->nval = HEADER;
	YY_BREAK
case 137:
YY_RULE_SETUP
#line 362 "sieve/sieve-lex.l"
return yylval->nval = UNIQUEID;
	YY_BREAK
/*   :handle              defined in 'vacation'         */
/*   :seconds             defined in 'vacation-seconds' */
/*   :last                defined in 'index'            */
/* special-use - RFC 8579 */
case 138:
YY_RULE_SETUP
#line 368 "sieve/sieve-lex.l"
return SPECIALUSEEXISTS;
	YY_BREAK
case 139:
YY_RULE_SETUP
#line 369 "sieve/sieve-lex.l"
return SPECIALUSE;
	YY_BREAK
/* fcc - RFC 8580 */
case 140:
YY_RULE_SETUP
#line 372 "sieve/sieve-lex.l"
return FCC;
	YY_BREAK
/* draft-gondwana-sieve-mailboxid */
case 141:
YY_RULE_SETUP
#line 375 "sieve/sieve-lex.l"
return MAILBOXIDEXISTS;
	YY_BREAK
case 142:
YY_RULE_SETUP
#line 376 "sieve/sieve-lex.l"
return MAILBOXID;
	YY_BREAK
/* vnd.cyrus.log */
case 143:
YY_RULE_SETUP
#line 379 "sieve/sieve-lex.l"
return LOG;
	YY_BREAK
/* vnd.cyrus.jmapquery */
case 144:
YY_RULE_SETUP
#line 382 "sieve/sieve-lex.l"
return JMAPQUERY;
	YY_BREAK
/* vnd.cyrus.snooze */
case 145:
YY_RULE_SETUP
#line 385 "sieve/sieve-lex.l"
return SNOOZE;
	YY_BREAK
case 146:
YY_RULE_SETUP
#line 386 "sieve/sieve-lex.l"
return MAILBOX;
	YY_BREAK
case 147:
YY_RULE_SETUP
#line 387 "sieve/sieve-lex.l"
return ADDFLAGS;
	YY_BREAK
case 148:
YY_RULE_SETUP
#line 388 "sieve/sieve-lex.l"
return REMOVEFLAGS;
	YY_BREAK
case 149:
YY_RULE_SETUP
#line 389 "sieve/sieve-lex.l"
return WEEKDAYS;
	YY_BREAK
case 150:
YY_RULE_SETUP
#line 390 "sieve/sieve-lex.l"
return TZID;
	YY_BREAK
/*   :create               defined in 'mailbox'     */
/*   :mailboxid            defined in 'mailboxid'   */
/*   :specialuse           defined in 'special-use' */
case 151:
/* rule 151 can match eol */
YY_RULE_SETUP
#line 395 "sieve/sieve-lex.l"
;  /* ignore bracketed comments */
	YY_BREAK
case 152:
YY_RULE_SETUP
#line 396 "sieve/sieve-lex.l"
;                /* ignore hash comments */
	YY_BREAK
case 153:
/* rule 153 can match eol */
YY_RULE_SETUP
#line 397 "sieve/sieve-lex.l"
;          /* ignore whitespace */
	YY_BREAK
case 154:
YY_RULE_SETUP
#line 398 "sieve/sieve-lex.l"
return sievetext[0];
	YY_BREAK
case 155:
YY_RULE_SETUP
#line 400 "sieve/sieve-lex.l"
ECHO;
	YY_BREAK
#line 2245 "sieve/sieve-lex.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(QCOLLATION):
case YY_STATE_EOF(QRELATION):
case YY_STATE_EOF(QIMPORTANCE):
	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 sievein at a new source and called
			 * sievelex().  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 = sievein;
			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 ( sievewrap( ) )
					{
					/* Note: because we've taken care in
					 * yy_get_next_buffer() to have set up
					 * sievetext, 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 sievelex */

/* 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);
	int 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 = (int) ((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
		{
			int 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 )
				{
				int 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. */
					sieverealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2  );
				}
			else
				/* Can't grow it, we don't own it. */
				b->yy_ch_buf = NULL;

			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;
			sieverestart(sievein  );
			}

		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_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
		/* Extend the array by 50%, plus the number we really need. */
		int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) sieverealloc((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);
	yy_current_state += YY_AT_BOL();

	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 >= 816 )
				yy_c = yy_meta[(unsigned int) yy_c];
			}
		yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) 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 >= 816 )
			yy_c = yy_meta[(unsigned int) yy_c];
		}
	yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) yy_c];
	yy_is_jam = (yy_current_state == 815);

		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 */
			int 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. */
					sieverestart(sievein );

					/*FALLTHROUGH*/

				case EOB_ACT_END_OF_FILE:
					{
					if ( sievewrap( ) )
						return 0;

					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 sievetext */
	(yy_hold_char) = *++(yy_c_buf_p);

	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n');
	if ( YY_CURRENT_BUFFER_LVALUE->yy_at_bol )
		
    sievelineno++;
;

	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 sieverestart  (FILE * input_file )
{
    
	if ( ! YY_CURRENT_BUFFER ){
        sieveensure_buffer_stack ();
		YY_CURRENT_BUFFER_LVALUE =
            sieve_create_buffer(sievein,YY_BUF_SIZE );
	}

	sieve_init_buffer(YY_CURRENT_BUFFER,input_file );
	sieve_load_buffer_state( );
}

/** Switch to a different input buffer.
 * @param new_buffer The new input buffer.
 * 
 */
    void sieve_switch_to_buffer  (YY_BUFFER_STATE  new_buffer )
{
    
	/* TODO. We should be able to replace this entire function body
	 * with
	 *		sievepop_buffer_state();
	 *		sievepush_buffer_state(new_buffer);
     */
	sieveensure_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;
	sieve_load_buffer_state( );

	/* We don't actually know whether we did this switch during
	 * EOF (sievewrap()) processing, but the only time this flag
	 * is looked at is after sievewrap() is called, so it's safe
	 * to go ahead and always set it.
	 */
	(yy_did_buffer_switch_on_eof) = 1;
}

static void sieve_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;
	sievein = 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 sieve_create_buffer  (FILE * file, int  size )
{
	YY_BUFFER_STATE b;
    
	b = (YY_BUFFER_STATE) sievealloc(sizeof( struct yy_buffer_state )  );
	if ( ! b )
		YY_FATAL_ERROR( "out of dynamic memory in sieve_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 *) sievealloc(b->yy_buf_size + 2  );
	if ( ! b->yy_ch_buf )
		YY_FATAL_ERROR( "out of dynamic memory in sieve_create_buffer()" );

	b->yy_is_our_buffer = 1;

	sieve_init_buffer(b,file );

	return b;
}

/** Destroy the buffer.
 * @param b a buffer created with sieve_create_buffer()
 * 
 */
    void sieve_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 )
		sievefree((void *) b->yy_ch_buf  );

	sievefree((void *) b  );
}

/* Initializes or reinitializes a buffer.
 * This function is sometimes called more than once on the same buffer,
 * such as during a sieverestart() or at EOF.
 */
    static void sieve_init_buffer  (YY_BUFFER_STATE  b, FILE * file )

{
	int oerrno = errno;
    
	sieve_flush_buffer(b );

	b->yy_input_file = file;
	b->yy_fill_buffer = 1;

    /* If b is the current buffer, then sieve_init_buffer was _probably_
     * called from sieverestart() 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 sieve_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 )
		sieve_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 sievepush_buffer_state (YY_BUFFER_STATE new_buffer )
{
    	if (new_buffer == NULL)
		return;

	sieveensure_buffer_stack();

	/* This block is copied from sieve_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 sieve_switch_to_buffer. */
	sieve_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 sievepop_buffer_state (void)
{
    	if (!YY_CURRENT_BUFFER)
		return;

	sieve_delete_buffer(YY_CURRENT_BUFFER );
	YY_CURRENT_BUFFER_LVALUE = NULL;
	if ((yy_buffer_stack_top) > 0)
		--(yy_buffer_stack_top);

	if (YY_CURRENT_BUFFER) {
		sieve_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 sieveensure_buffer_stack (void)
{
	int 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**)sievealloc
								(num_to_alloc * sizeof(struct yy_buffer_state*)
								);
		if ( ! (yy_buffer_stack) )
			YY_FATAL_ERROR( "out of dynamic memory in sieveensure_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**)sieverealloc
								((yy_buffer_stack),
								num_to_alloc * sizeof(struct yy_buffer_state*)
								);
		if ( ! (yy_buffer_stack) )
			YY_FATAL_ERROR( "out of dynamic memory in sieveensure_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 sieve_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 NULL;

	b = (YY_BUFFER_STATE) sievealloc(sizeof( struct yy_buffer_state )  );
	if ( ! b )
		YY_FATAL_ERROR( "out of dynamic memory in sieve_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 = NULL;
	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;

	sieve_switch_to_buffer(b  );

	return b;
}

/** Setup the input buffer state to scan a string. The next call to sievelex() 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
 *       sieve_scan_bytes() instead.
 */
YY_BUFFER_STATE sieve_scan_string (yyconst char * yystr )
{
    
	return sieve_scan_bytes(yystr,(int) strlen(yystr) );
}

/** Setup the input buffer state to scan the given bytes. The next call to sievelex() 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 sieve_scan_bytes  (yyconst char * yybytes, int  _yybytes_len )
{
	YY_BUFFER_STATE b;
	char *buf;
	yy_size_t n;
	int i;
    
	/* Get memory for full buffer, including space for trailing EOB's. */
	n = (yy_size_t) (_yybytes_len + 2);
	buf = (char *) sievealloc(n  );
	if ( ! buf )
		YY_FATAL_ERROR( "out of dynamic memory in sieve_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 = sieve_scan_buffer(buf,n );
	if ( ! b )
		YY_FATAL_ERROR( "bad buffer in sieve_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 yynoreturn 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 sievetext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
		sievetext[sieveleng] = (yy_hold_char); \
		(yy_c_buf_p) = sievetext + yyless_macro_arg; \
		(yy_hold_char) = *(yy_c_buf_p); \
		*(yy_c_buf_p) = '\0'; \
		sieveleng = yyless_macro_arg; \
		} \
	while ( 0 )

/* Accessor  methods (get/set functions) to struct members. */

/** Get the current line number.
 * 
 */
int sieveget_lineno  (void)
{
    
    return sievelineno;
}

/** Get the input stream.
 * 
 */
FILE *sieveget_in  (void)
{
        return sievein;
}

/** Get the output stream.
 * 
 */
FILE *sieveget_out  (void)
{
        return sieveout;
}

/** Get the length of the current token.
 * 
 */
int sieveget_leng  (void)
{
        return sieveleng;
}

/** Get the current token.
 * 
 */

char *sieveget_text  (void)
{
        return sievetext;
}

/** Set the current line number.
 * @param _line_number line number
 * 
 */
void sieveset_lineno (int  _line_number )
{
    
    sievelineno = _line_number;
}

/** Set the input stream. This does not discard the current
 * input buffer.
 * @param _in_str A readable stream.
 * 
 * @see sieve_switch_to_buffer
 */
void sieveset_in (FILE *  _in_str )
{
        sievein = _in_str ;
}

void sieveset_out (FILE *  _out_str )
{
        sieveout = _out_str ;
}

int sieveget_debug  (void)
{
        return sieve_flex_debug;
}

void sieveset_debug (int  _bdebug )
{
        sieve_flex_debug = _bdebug ;
}

static int yy_init_globals (void)
{
        /* Initialization is the same as for the non-reentrant scanner.
     * This function is called from sievelex_destroy(), so don't allocate here.
     */

    /* We do not touch sievelineno unless the option is enabled. */
    sievelineno =  1;
    
    (yy_buffer_stack) = NULL;
    (yy_buffer_stack_top) = 0;
    (yy_buffer_stack_max) = 0;
    (yy_c_buf_p) = NULL;
    (yy_init) = 0;
    (yy_start) = 0;

/* Defined in main.c */
#ifdef YY_STDINIT
    sievein = stdin;
    sieveout = stdout;
#else
    sievein = NULL;
    sieveout = NULL;
#endif

    /* For future reference: Set errno on error, since we are called by
     * sievelex_init()
     */
    return 0;
}

/* sievelex_destroy is for both reentrant and non-reentrant scanners. */
int sievelex_destroy  (void)
{
    
    /* Pop the buffer stack, destroying each element. */
	while(YY_CURRENT_BUFFER){
		sieve_delete_buffer(YY_CURRENT_BUFFER  );
		YY_CURRENT_BUFFER_LVALUE = NULL;
		sievepop_buffer_state();
	}

	/* Destroy the stack itself. */
	sievefree((yy_buffer_stack) );
	(yy_buffer_stack) = NULL;

    /* Reset the globals. This is important in a non-reentrant scanner so the next time
     * sievelex() 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 *sievealloc (yy_size_t  size )
{
			return malloc(size);
}

void *sieverealloc  (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 realloc(ptr, size);
}

void sievefree (void * ptr )
{
			free( (char *) ptr );	/* see sieverealloc() for (char *) cast */
}

#define YYTABLES_NAME "yytables"

#line 400 "sieve/sieve-lex.l"



/* convert numerical string w/units to unsigned long */
static unsigned long long tonum(const char *str)
{
    char *units;
    unsigned long long val = strtoull(str, &units, 10);

    if (*units && errno != ERANGE) {
        switch (toupper(*units)) {
        case 'K': val *= (1ULL << 10); break;
        case 'M': val *= (1ULL << 20); break;
        case 'G': val *= (1ULL << 30); break;
            /* for future use */
        case 'T': val *= (1ULL << 40); break;
        case 'P': val *= (1ULL << 50); break;
        case 'E': val *= (1ULL << 60); break;
        default: break;
        }
    }

    return val;
}

/* convert unicode to sequence of UTF-8 characters */
static size_t unicode_to_utf8(unsigned char buf[], unsigned int code)
{
    if (code <= 0x7F) {
        buf[0] = code;
        return 1;
    }
    if (code <= 0x7FF) {
        buf[0] = 0xC0 | (code >> 6);            /* 110xxxxx */
        buf[1] = 0x80 | (code & 0x3F);          /* 10xxxxxx */
        return 2;
    }
    if (code < 0xE000 && code > 0xD7FF) return 0;
    if (code <= 0xFFFF) {
        buf[0] = 0xE0 | (code >> 12);           /* 1110xxxx */
        buf[1] = 0x80 | ((code >> 6) & 0x3F);   /* 10xxxxxx */
        buf[2] = 0x80 | (code & 0x3F);          /* 10xxxxxx */
        return 3;
    }
    if (code <= 0x10FFFF) {
        buf[0] = 0xF0 | (code >> 18);           /* 11110xxx */
        buf[1] = 0x80 | ((code >> 12) & 0x3F);  /* 10xxxxxx */
        buf[2] = 0x80 | ((code >> 6) & 0x3F);   /* 10xxxxxx */
        buf[3] = 0x80 | (code & 0x3F);          /* 10xxxxxx */
        return 4;
    }
    return 0;
}

/*
  Decode "encoded-character" strings having one of the following two forms:

  encoded-arb-octets   =  "${hex:" hex-pair-seq "}"
  hex-pair-seq         =  *blank hex-pair *(1*blank hex-pair) *blank
  hex-pair             =  1*2HEXDIG

  encoded-unicode-char =  "${unicode:" unicode-hex-seq "}"
  unicode-hex-seq      =  *blank unicode-hex *(1*blank unicode-hex) *blank
  unicode-hex          =  1*HEXDIG
   
  blank                =  WSP / CRLF
  WSP                  =  SP / HTAB 
  HEXDIG               =  DIGIT / "A" / "B" / "C" / "D" / "E" / "F"
*/
static int decode_string(struct buf *buf)
{
    static struct buf decode_buf = BUF_INITIALIZER;
    const char *cp, *enc_start;

    for (cp = buf_cstring(buf); (enc_start = strstr(cp, "${")); ) {
        unsigned is_unicode = 0;
        size_t len;

        cp = enc_start + 2;

        if (!strncasecmp(cp, "hex:", 4)) {
            cp += 4;
        }
        else if (!strncasecmp(cp, "unicode:", 8)) {
            is_unicode = 1;
            cp += 8;
        }
        else {
            /* not coded */
            continue;
        }

        /* eat leading whitespace */
        while (isspace(*cp)) cp++;

        /* sanity check "encoded" data (being liberal in accepting 'a' - 'f') */
        len = strspn(cp, "0123456789ABCDEFabcdef \t\r\n");
        if (!isxdigit(*cp) || cp[len] != '}') continue;

        /* decode characters */
        buf_reset(&decode_buf);
        do {
            unsigned int ndigits, code;

            for (ndigits = 0, code = 0; isxdigit(*cp); ndigits++, cp++) {
                unsigned int digit = 
                    (*cp > '9') ? 10 + toupper(*cp) - 'A' : *cp - '0';

                code = (code << 4) + digit;
            }

            if (is_unicode) {
                unsigned char utf8[4];

                len = unicode_to_utf8(utf8, code);
                if (!len) {
                    /* invalid UTF-8 encoding - error */
                    return 0;
                }

                /* append decoded unicode char(s) to buffer */
                buf_appendmap(&decode_buf, (char *) utf8, len);
            }
            else if (ndigits > 2) {
                /* too many hex digits - treat as not coded */
                buf_reset(&decode_buf);
                cp += len + 1;
                break;
            }
            else {
                /* append decoded hex char to buffer */
                buf_putc(&decode_buf, code);
            }

            /* eat trailing whitespace */
            while (isspace(*cp)) cp++;

        } while (*cp != '}');

        if ((len = buf_len(&decode_buf))) {
            /* replace the encoded string with its decoded value */
            size_t offset = enc_start - buf_base(buf);

            buf_remove(buf, offset, cp - enc_start + 1);
            buf_insert(buf, offset, &decode_buf);

            /* buffer may have been reallocated - reposition our pointer */
            cp = buf_cstring(buf) + offset + len;
        }
    }

    return 1;
}

