Logo Search packages:      
Sourcecode: mailutils version File versions

sieve-lex.c

/* A lexical scanner generated by flex */

/* Scanner skeleton version:
 * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $
 */

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5

#include <stdio.h>


/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif


#ifdef __cplusplus

#include <stdlib.h>
#include <unistd.h>

/* Use prototypes in function declarations. */
#define YY_USE_PROTOS

/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST

#else /* ! __cplusplus */

#if __STDC__

#define YY_USE_PROTOS
#define YY_USE_CONST

#endif      /* __STDC__ */
#endif      /* ! __cplusplus */

#ifdef __TURBOC__
 #pragma warn -rch
 #pragma warn -use
#include <io.h>
#include <stdlib.h>
#define YY_USE_CONST
#define YY_USE_PROTOS
#endif

#ifdef YY_USE_CONST
#define sieve_yyconst const
#else
#define sieve_yyconst
#endif


#ifdef YY_USE_PROTOS
#define YY_PROTO(proto) proto
#else
#define YY_PROTO(proto) ()
#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 sieve_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 ((sieve_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 sieve_yyrestart( sieve_yyin )

#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#define YY_BUF_SIZE 16384

typedef struct sieve_yy_buffer_state *YY_BUFFER_STATE;

extern int sieve_yyleng;
extern FILE *sieve_yyin, *sieve_yyout;

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

/* The funky do-while in the following #define is used to turn the definition
 * int a single C statement (which needs a semi-colon terminator).  This
 * avoids problems with code like:
 *
 *    if ( condition_holds )
 *          sieve_yyless( 5 );
 *    else
 *          do_something_else();
 *
 * Prior to using the do-while the compiler would get upset at the
 * "else" because it interpreted the "if" statement as being all
 * done when it reached the ';' after the sieve_yyless() call.
 */

/* Return all but the first 'n' matched characters back to the input stream. */

#define sieve_yyless(n) \
      do \
            { \
            /* Undo effects of setting up sieve_yytext. */ \
            *sieve_yy_cp = sieve_yy_hold_char; \
            YY_RESTORE_YY_MORE_OFFSET \
            sieve_yy_c_buf_p = sieve_yy_cp = sieve_yy_bp + n - YY_MORE_ADJ; \
            YY_DO_BEFORE_ACTION; /* set up sieve_yytext again */ \
            } \
      while ( 0 )

#define unput(c) sieve_yyunput( c, sieve_yytext_ptr )

/* The following is because we cannot portably get our hands on size_t
 * (without autoconf's help, which isn't available because we want
 * flex-generated scanners to compile on their own).
 */
typedef unsigned int sieve_yy_size_t;


struct sieve_yy_buffer_state
      {
      FILE *sieve_yy_input_file;

      char *sieve_yy_ch_buf;        /* input buffer */
      char *sieve_yy_buf_pos;       /* current position in input buffer */

      /* Size of input buffer in bytes, not including room for EOB
       * characters.
       */
      sieve_yy_size_t sieve_yy_buf_size;

      /* Number of characters read into sieve_yy_ch_buf, not including EOB
       * characters.
       */
      int sieve_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 sieve_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 sieve_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 sieve_yy_at_bol;

      /* Whether to try to fill the input buffer when we reach the
       * end of it.
       */
      int sieve_yy_fill_buffer;

      int sieve_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 sieve_yyrestart()), so that the user can continue scanning by
       * just pointing sieve_yyin at a new input file.
       */
#define YY_BUFFER_EOF_PENDING 2
      };

static YY_BUFFER_STATE sieve_yy_current_buffer = 0;

/* 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".
 */
#define YY_CURRENT_BUFFER sieve_yy_current_buffer


/* sieve_yy_hold_char holds the character lost when sieve_yytext is formed. */
static char sieve_yy_hold_char;

static int sieve_yy_n_chars;        /* number of characters read into sieve_yy_ch_buf */


int sieve_yyleng;

/* Points to current character in buffer. */
static char *sieve_yy_c_buf_p = (char *) 0;
static int sieve_yy_init = 1;       /* whether we need to initialize */
static int sieve_yy_start = 0;      /* start state number */

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

void sieve_yyrestart YY_PROTO(( FILE *input_file ));

void sieve_yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
void sieve_yy_load_buffer_state YY_PROTO(( void ));
YY_BUFFER_STATE sieve_yy_create_buffer YY_PROTO(( FILE *file, int size ));
void sieve_yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
void sieve_yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
void sieve_yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
#define YY_FLUSH_BUFFER sieve_yy_flush_buffer( sieve_yy_current_buffer )

YY_BUFFER_STATE sieve_yy_scan_buffer YY_PROTO(( char *base, sieve_yy_size_t size ));
YY_BUFFER_STATE sieve_yy_scan_string YY_PROTO(( sieve_yyconst char *sieve_yy_str ));
YY_BUFFER_STATE sieve_yy_scan_bytes YY_PROTO(( sieve_yyconst char *bytes, int len ));

static void *sieve_yy_flex_alloc YY_PROTO(( sieve_yy_size_t ));
static void *sieve_yy_flex_realloc YY_PROTO(( void *, sieve_yy_size_t ));
static void sieve_yy_flex_free YY_PROTO(( void * ));

#define sieve_yy_new_buffer sieve_yy_create_buffer

#define sieve_yy_set_interactive(is_interactive) \
      { \
      if ( ! sieve_yy_current_buffer ) \
            sieve_yy_current_buffer = sieve_yy_create_buffer( sieve_yyin, YY_BUF_SIZE ); \
      sieve_yy_current_buffer->sieve_yy_is_interactive = is_interactive; \
      }

#define sieve_yy_set_bol(at_bol) \
      { \
      if ( ! sieve_yy_current_buffer ) \
            sieve_yy_current_buffer = sieve_yy_create_buffer( sieve_yyin, YY_BUF_SIZE ); \
      sieve_yy_current_buffer->sieve_yy_at_bol = at_bol; \
      }

#define YY_AT_BOL() (sieve_yy_current_buffer->sieve_yy_at_bol)

typedef unsigned char YY_CHAR;
FILE *sieve_yyin = (FILE *) 0, *sieve_yyout = (FILE *) 0;
typedef int sieve_yy_state_type;
extern char *sieve_yytext;
#define sieve_yytext_ptr sieve_yytext

static sieve_yy_state_type sieve_yy_get_previous_state YY_PROTO(( void ));
static sieve_yy_state_type sieve_yy_try_NUL_trans YY_PROTO(( sieve_yy_state_type current_state ));
static int sieve_yy_get_next_buffer YY_PROTO(( void ));
static void sieve_yy_fatal_error YY_PROTO(( sieve_yyconst char msg[] ));

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up sieve_yytext.
 */
#define YY_DO_BEFORE_ACTION \
      sieve_yytext_ptr = sieve_yy_bp; \
      sieve_yyleng = (int) (sieve_yy_cp - sieve_yy_bp); \
      sieve_yy_hold_char = *sieve_yy_cp; \
      *sieve_yy_cp = '\0'; \
      sieve_yy_c_buf_p = sieve_yy_cp;

#define YY_NUM_RULES 35
#define YY_END_OF_BUFFER 36
static sieve_yyconst short int sieve_yy_accept[138] =
    {   0,
        0,    0,    2,    2,    0,    0,    0,    0,   36,   34,
       32,   33,   34,    9,   34,   19,   21,   34,   34,   34,
       34,   34,   34,   34,   34,    2,    4,    3,   35,   31,
       35,   35,   35,   25,   35,   32,    0,   22,    0,    9,
        9,    8,    9,    9,    1,   19,   19,    0,   21,   21,
        0,   17,   17,   17,   17,   11,   17,   17,   17,    2,
        3,    3,    5,    0,   31,    0,    0,    0,   25,    0,
       24,   23,    9,    9,    0,   18,   17,   17,   17,   16,
       17,   17,    0,    9,    9,   20,   17,   17,   13,   17,
       17,   17,    0,    9,    9,   20,   15,   14,   12,   17,

        0,    0,    9,    9,   17,    0,   27,    0,    0,    0,
        0,    0,    9,    9,   10,    0,   26,    0,    0,    9,
        9,    0,   29,    0,    0,    9,    6,    9,    0,   28,
        0,   30,    9,    9,    9,    7,    0
    } ;

static sieve_yyconst int sieve_yy_ec[256] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    2,    1,    4,    5,    1,    1,    1,    1,    1,
        1,    6,    1,    1,    7,    1,    8,    9,   10,   10,
       10,   10,   10,   10,   10,   11,   11,   12,    1,    1,
        1,    1,    1,    1,   13,   13,   13,   13,   13,   13,
       14,   15,   15,   15,   14,   15,   14,   15,   15,   15,
       15,   15,   15,   15,   15,   15,   15,   15,   15,   15,
        1,   16,    1,    1,   15,    1,   17,   13,   18,   19,

       20,   21,   14,   22,   23,   15,   14,   24,   14,   25,
       26,   27,   28,   29,   30,   31,   32,   15,   15,   33,
       34,   15,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1
    } ;

static sieve_yyconst int sieve_yy_meta[35] =
    {   0,
        1,    2,    3,    1,    2,    4,    2,    1,    5,    5,
        5,    1,    6,    7,    7,    2,    6,    6,    6,    6,
        6,    7,    7,    7,    7,    7,    7,    7,    7,    7,
        7,    7,    7,    7
    } ;

static sieve_yyconst short int sieve_yy_base[161] =
    {   0,
        0,    0,   32,   33,   37,   38,   41,   43,  327,  328,
      324,  328,   33,   48,  319,   44,   51,    0,    0,   31,
      300,  302,  296,  301,  300,    0,  328,   58,  316,  328,
       65,   59,  328,  328,    0,  316,   65,  328,    0,  314,
       70,  328,   45,   71,  328,   70,  302,    0,   76,  301,
        0,    0,  290,  279,  282,    0,  280,  282,  276,    0,
       86,   89,  328,  305,  328,   80,   73,   85,  328,    0,
      328,  328,   93,   96,    0,    0,  281,  280,   82,    0,
      273,  273,  101,  103,  104,  289,  241,  240,    0,  226,
      217,  221,  105,  106,  107,  205,    0,    0,    0,  184,

      115,  109,  111,  112,  192,  121,  328,  190,  137,    0,
      143,  113,  132,  133,    0,  165,  328,  152,  144,  164,
      134,  160,  328,  163,  158,  155,  328,  118,  153,  328,
      140,  328,  147,  125,   49,  328,  328,  169,  176,  183,
      190,  197,  199,  202,  209,  216,  223,  230,  237,  244,
      247,  249,  252,  257,  264,  267,  274,  281,  288,  295
    } ;

static sieve_yyconst short int sieve_yy_def[161] =
    {   0,
      137,    1,  138,  138,  139,  139,  140,  140,  137,  137,
      137,  137,  141,  142,  137,  137,  137,  143,  144,  144,
      144,  144,  144,  144,  144,  145,  137,  146,  147,  137,
      147,  148,  137,  137,  149,  137,  141,  137,  150,  142,
      142,  137,  142,  142,  137,  137,  137,  151,  137,  137,
      152,  144,  144,  144,  144,  144,  144,  144,  144,  145,
      146,  146,  137,  147,  137,  147,  147,  148,  137,  149,
      137,  137,  142,  142,  153,  152,  144,  144,  144,  144,
      144,  144,  147,  142,  142,  153,  144,  144,  144,  144,
      144,  144,  147,  142,  142,  137,  144,  144,  144,  144,

      154,  147,  142,  142,  144,  137,  137,  155,  154,  156,
      109,  147,  142,  142,  144,  155,  137,  156,  147,  157,
      142,  137,  137,  158,  159,  157,  137,  142,  158,  137,
      159,  137,  142,  160,  160,  137,    0,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137
    } ;

static sieve_yyconst short int sieve_yy_nxt[363] =
    {   0,
       10,   11,   12,   13,   14,   10,   10,   15,   16,   17,
       17,   18,   19,   19,   19,   10,   20,   19,   19,   21,
       19,   19,   22,   19,   23,   19,   19,   19,   24,   19,
       25,   19,   19,   19,   27,   27,   38,   28,   28,   30,
       30,   31,   31,   33,   34,   33,   34,   42,   39,   41,
       42,  136,   46,   46,   53,   54,   35,   47,   35,   49,
       49,   49,   69,   62,   50,   63,   66,   65,   38,   73,
       43,   41,   42,   42,   70,   65,   48,   44,   46,   46,
       39,   66,   65,   47,   49,   49,   49,   67,   69,   50,
       74,  137,   43,  137,   62,   42,   63,   83,   42,   44,

       70,   89,   67,   65,   90,   42,   42,   65,   42,   42,
       84,   65,   85,   42,   42,   65,  106,  107,   93,  108,
       42,  109,  106,  107,  104,  108,   94,  136,  102,  113,
      111,  119,   95,  114,   42,   42,   42,  103,  106,  107,
      112,  108,  132,  137,  137,  137,   65,  137,  133,   42,
      128,  120,  111,  122,  123,  130,  124,  127,  137,  121,
      132,  122,  123,  125,  124,  130,  127,  117,  134,   26,
       26,   26,   26,   26,   26,   26,   29,   29,   29,   29,
       29,   29,   29,   32,   32,   32,   32,   32,   32,   32,
       37,   37,  117,   37,   37,   37,   37,   40,   40,   40,

       40,   40,   40,   40,   51,   51,   52,   52,   52,   60,
       60,  115,  105,   60,   60,   60,   61,   61,   96,   61,
       61,   61,   61,   64,   64,   64,   64,   64,   64,   64,
       68,   68,  101,   68,   68,   68,   68,   71,   71,  100,
       71,   71,   71,   71,   72,   72,   99,   72,   72,   72,
       72,   75,   75,   76,   76,   76,   86,   86,  110,  110,
       98,   97,  110,  110,  116,  116,  116,  116,  116,  116,
      116,  118,  118,  118,  126,  126,  126,  126,  126,  126,
      126,  129,  129,  129,  129,  129,  129,  129,  131,  131,
      131,  131,  131,  131,  131,  135,  135,  135,  135,  135,

      135,  135,   96,   92,   91,   88,   87,   65,   82,   81,
       80,   79,   78,   77,   50,   47,   42,   36,   65,   59,
       58,   57,   56,   55,   45,   36,  137,    9,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137
    } ;

static sieve_yyconst short int sieve_yy_chk[363] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    3,    4,   13,    3,    4,    5,
        6,    5,    6,    7,    7,    8,    8,   43,   13,   14,
       14,  135,   16,   16,   20,   20,    7,   16,    8,   17,
       17,   17,   32,   28,   17,   28,   31,   31,   37,   43,
       14,   41,   41,   44,   32,   67,   16,   14,   46,   46,
       37,   66,   66,   46,   49,   49,   49,   31,   68,   49,
       44,   61,   41,   61,   62,   73,   62,   67,   74,   41,

       68,   79,   66,   83,   79,   84,   85,   93,   94,   95,
       73,  102,   74,  103,  104,  112,  101,  101,   83,  101,
      128,  101,  106,  106,   95,  106,   84,  134,   93,  103,
      101,  112,   85,  104,  113,  114,  121,   94,  109,  109,
      102,  109,  131,  109,  111,  111,  119,  111,  128,  133,
      121,  113,  109,  118,  118,  129,  118,  126,  111,  114,
      125,  122,  122,  119,  122,  124,  120,  116,  133,  138,
      138,  138,  138,  138,  138,  138,  139,  139,  139,  139,
      139,  139,  139,  140,  140,  140,  140,  140,  140,  140,
      141,  141,  108,  141,  141,  141,  141,  142,  142,  142,

      142,  142,  142,  142,  143,  143,  144,  144,  144,  145,
      145,  105,  100,  145,  145,  145,  146,  146,   96,  146,
      146,  146,  146,  147,  147,  147,  147,  147,  147,  147,
      148,  148,   92,  148,  148,  148,  148,  149,  149,   91,
      149,  149,  149,  149,  150,  150,   90,  150,  150,  150,
      150,  151,  151,  152,  152,  152,  153,  153,  154,  154,
       88,   87,  154,  154,  155,  155,  155,  155,  155,  155,
      155,  156,  156,  156,  157,  157,  157,  157,  157,  157,
      157,  158,  158,  158,  158,  158,  158,  158,  159,  159,
      159,  159,  159,  159,  159,  160,  160,  160,  160,  160,

      160,  160,   86,   82,   81,   78,   77,   64,   59,   58,
       57,   55,   54,   53,   50,   47,   40,   36,   29,   25,
       24,   23,   22,   21,   15,   11,    9,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137,  137,  137,  137,  137,  137,  137,  137,  137,
      137,  137
    } ;

static sieve_yy_state_type sieve_yy_last_accepting_state;
static char *sieve_yy_last_accepting_cpos;

/* 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 sieve_yymore() sieve_yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *sieve_yytext;
#line 1 "sieve.l"
#define INITIAL 0
#line 2 "sieve.l"
/* GNU Mailutils -- a suite of utilities for electronic mail
   Copyright (C) 1999, 2000, 2001, 2002, 2004 Free Software Foundation, Inc.

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2 of the License, or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA  */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif  

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>  
#include <sys/file.h>
#include <sys/stat.h>
#include <errno.h>
#include <string.h>
#include <mailutils/argcv.h>
#include <sieve.h>
#include <sieve-gram.h>
  
char *sieve_filename;  
int sieve_line_num;  
ino_t sieve_source_inode;

static list_t string_list;
static char *multiline_delimiter;
static int strip_tabs; 

static int number __P ((void));
static int string __P ((void));
static void line_begin __P ((void));
static void line_add __P((char *text, size_t len));
static void line_finish __P ((void));
static void multiline_begin __P ((void));
static void multiline_add __P ((char *));
static void multiline_finish __P ((void));
static char *multiline_strip_tabs __P((char *text));
static void ident __P((const char *text));
static void sieve_include __P((void));
static void sieve_searchpath __P((void));
static char *str_unescape __P((char *text, size_t len));
static int isemptystr __P((char *text));
 
#ifdef FLEX_SCANNER
#define xinput() (sieve_yyin ? getc(sieve_yyin) : EOF)
#undef YY_INPUT
#define YY_INPUT(buf,result,max_size)  do { \
        int i;                                  \
        for (i = 0; i < max_size; i++) {        \
                int ch = xinput();              \
                if (ch == EOF)                  \
                        break;                  \
                buf[i] = ch;                    \
        }                                       \
        result = i;                             \
} while (0) 
#define LEX_BUFFER_STATE YY_BUFFER_STATE
#define SET_BUFFER_STATE(s) do { \
        (s) = YY_CURRENT_BUFFER; \
        sieve_yy_switch_to_buffer(sieve_yy_create_buffer(sieve_yyin, YY_BUF_SIZE)); \
} while (0)
#define RESTORE_BUFFER_STATE(s) do { \
        sieve_yy_delete_buffer(YY_CURRENT_BUFFER); \
        sieve_yy_switch_to_buffer(s); \
} while (0)

#else
/* AT&T Lex */
                                               
static void lex_set_buffer __P((FILE *fp));
static void lex_delete_buffer __P((LEX_BUFFER_STATE buf));
static int xinput __P((void)); 
static int xunput __P((void));
        
#undef unput
#define unput(c) xunput(c)
#undef input
#define input() xinput()

#define LEX_BUF_SIZE 16384
#define LEX_PUTBACK_SIZE 32
                                               
typedef struct {
  FILE *sieve_yyin;
  char *buffer;
  size_t bufsize;
  size_t level;
  char *ptr;
  char *putback;
  size_t pb_size;
  size_t pb_level;
} LEX_BUFFER_STATE;
LEX_BUFFER_STATE current_buffer;
 
#define SET_BUFFER_STATE(s) do { \
        (s) = current_buffer;    \
        lex_set_buffer(sieve_yyin);    \
} while (0)
#define RESTORE_BUFFER_STATE(s) do { \
        lex_delete_buffer(current_buffer); \
        current_buffer = (s); \
        sieve_yyin = current_buffer.sieve_yyin;  \
} while (0)
                                    
void
lex_set_buffer (FILE *fp)
{
  char *buf;
  size_t size;
        
  for (size = LEX_BUF_SIZE; size > 1; size /= 2)
    if (buf = malloc (size))
      break;
  
  if (!buf)
    {
      sieve_compile_error (sieve_filename, sieve_line_num, _("Not enough memory"));
      abort ();
    }

  current_buffer.sieve_yyin = sieve_yyin;
  current_buffer.buffer = buf;
  current_buffer.bufsize = size;
  current_buffer.level = 0;
  current_buffer.ptr = current_buffer.buffer;
  current_buffer.pb_size = current_buffer.pb_level = 0;
  current_buffer.putback = NULL;
}
                
void
lex_delete_buffer (LEX_BUFFER_STATE buf)
{
  free (buf.buffer);
  if (buf.putback)
    free (buf.putback);
}

int
xinput ()
{
  if (!sieve_yyin)
    return EOF;
  
  if (current_buffer.pb_level) 
    return current_buffer.putback[--current_buffer.pb_level];

  if (current_buffer.level <= 0)
    {
      int n;

      if (feof (sieve_yyin))
      return 0;
      n = fread (current_buffer.buffer, 1,
             current_buffer.bufsize, sieve_yyin);
      if (n <= 0)
      return 0;
      current_buffer.level = n;
      current_buffer.ptr = current_buffer.buffer;
    }
  current_buffer.level--;
  return *current_buffer.ptr++;
}

int
xunput (int c)
{
  if (current_buffer.pb_level == current_buffer.pb_size)
    {
      char *putback;
      current_buffer.pb_size += LEX_PUTBACK_SIZE;
      putback = sieve_alloc (current_buffer.pb_size);
      memcpy (putback, current_buffer.putback,
            current_buffer.pb_level);
      free (current_buffer.putback);
      current_buffer.putback = putback;
    }
  current_buffer.putback[current_buffer.pb_level++] = c;
  return c;
}
                
#endif                                         

struct buffer_ctx {
  struct buffer_ctx *prev;
  char *filename;
  int line;
  ino_t i_node;
  FILE *sieve_yyin;
  LEX_BUFFER_STATE state;
};

static struct buffer_ctx *context_stack;

static struct buffer_ctx *ctx_lookup __P((ino_t ino));
static int push_source __P((const char *name));
static int pop_source __P((void));

struct buffer_ctx *
ctx_lookup (ino_t ino)
{
  struct buffer_ctx *ctx;

  for (ctx = context_stack; ctx; ctx = ctx->prev)
    if (ctx->i_node == ino)
      break;
  return ctx;
}
        
int
push_source (const char *name)
{
  FILE *fp;
  struct buffer_ctx *ctx;
  struct stat st;
        
  if (stat (name, &st))
    {
      sieve_compile_error (sieve_filename, sieve_line_num,
                           _("cannot stat `%s': %s"), name, strerror (errno));
      return 1;
    }

  if (sieve_filename && st.st_ino == sieve_source_inode)
    {
      sieve_yyerror (_("recursive inclusion"));
      return 1;
    }
  if (ctx = ctx_lookup (st.st_ino))
    {
      sieve_yyerror (_("recursive inclusion"));
      if (ctx->prev)
      sieve_compile_error (ctx->prev->filename, ctx->prev->line,
                             _("`%s' already included here"),
                             name);
      else
      sieve_compile_error (sieve_filename, sieve_line_num, 
                             _("`%s' already included at top level"),
                         name);
      return 1;
    }
                
  fp = fopen (name, "r");
  if (!fp)
    {
      sieve_compile_error (sieve_filename, sieve_line_num, 
                           _("cannot open `%s': %s"), name, strerror (errno));
      return 1;
    }

  /* Push current context */
  if (sieve_filename)
    {
      ctx = sieve_alloc (sizeof (*ctx));
      ctx->filename = sieve_filename;
      ctx->line = sieve_line_num;
      ctx->i_node = sieve_source_inode;
      ctx->sieve_yyin = sieve_yyin;
      ctx->prev = context_stack;
      context_stack = ctx;
      
      /* Switch to the new context */
      sieve_yyin = fp;
      SET_BUFFER_STATE (ctx->state);
    }
  else
    {
#ifdef FLEX_SCANNER
      sieve_yyrestart (fp);
#else           
      sieve_yyin = fp;
      lex_set_buffer (sieve_yyin);
#endif
    }
  sieve_filename = strdup (name);
  sieve_line_num = 1;
  sieve_source_inode = st.st_ino;

  sieve_code_source (sieve_filename);
  sieve_code_line (sieve_line_num);
  
  return 0;
}

int
pop_source ()
{
  struct buffer_ctx *ctx;

  if (sieve_yyin)
    fclose (sieve_yyin);
#ifndef FLEX_SCANNER
  lex_delete_buffer (current_buffer);
#endif
  if (!context_stack)
    {
      sieve_yyin = NULL;
      return 1;
    }
  if (sieve_filename)
    free (sieve_filename);
  /* Restore previous context */
  sieve_filename = context_stack->filename;
  sieve_line_num = context_stack->line + 1; /* #include rule did not increment
                                     it */
  sieve_source_inode = context_stack->i_node;
  RESTORE_BUFFER_STATE (context_stack->state);
  ctx = context_stack->prev;
  free (context_stack);
  context_stack = ctx;

  sieve_code_source (sieve_filename);
  sieve_code_line (sieve_line_num);

  return 0;
}
#define COMMENT 1
#define ML 2
#define STR 3

#line 822 "lex.sieve_yy.c"

/* Macros after this point can all be overridden by user definitions in
 * section 1.
 */

#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int sieve_yywrap YY_PROTO(( void ));
#else
extern int sieve_yywrap YY_PROTO(( void ));
#endif
#endif

#ifndef YY_NO_UNPUT
static void sieve_yyunput YY_PROTO(( int c, char *buf_ptr ));
#endif

#ifndef sieve_yytext_ptr
static void sieve_yy_flex_strncpy YY_PROTO(( char *, sieve_yyconst char *, int ));
#endif

#ifdef YY_NEED_STRLEN
static int sieve_yy_flex_strlen YY_PROTO(( sieve_yyconst char * ));
#endif

#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int sieve_yyinput YY_PROTO(( void ));
#else
static int input YY_PROTO(( void ));
#endif
#endif

#if YY_STACK_USED
static int sieve_yy_start_stack_ptr = 0;
static int sieve_yy_start_stack_depth = 0;
static int *sieve_yy_start_stack = 0;
#ifndef YY_NO_PUSH_STATE
static void sieve_yy_push_state YY_PROTO(( int new_state ));
#endif
#ifndef YY_NO_POP_STATE
static void sieve_yy_pop_state YY_PROTO(( void ));
#endif
#ifndef YY_NO_TOP_STATE
static int sieve_yy_top_state YY_PROTO(( void ));
#endif

#else
#define YY_NO_PUSH_STATE 1
#define YY_NO_POP_STATE 1
#define YY_NO_TOP_STATE 1
#endif

#ifdef YY_MALLOC_DECL
YY_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include <stdlib.h>
#endif
#else
/* Just try to get by without declaring the routines.  This will fail
 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
 * or sizeof(void*) != sizeof(int).
 */
#endif
#endif

/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#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 (void) fwrite( sieve_yytext, sieve_yyleng, 1, sieve_yyout )
#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 ( sieve_yy_current_buffer->sieve_yy_is_interactive ) \
            { \
            int c = '*', n; \
            for ( n = 0; n < max_size && \
                       (c = getc( sieve_yyin )) != EOF && c != '\n'; ++n ) \
                  buf[n] = (char) c; \
            if ( c == '\n' ) \
                  buf[n++] = (char) c; \
            if ( c == EOF && ferror( sieve_yyin ) ) \
                  YY_FATAL_ERROR( "input in flex scanner failed" ); \
            result = n; \
            } \
      else if ( ((result = fread( buf, 1, max_size, sieve_yyin )) == 0) \
              && ferror( sieve_yyin ) ) \
            YY_FATAL_ERROR( "input in flex scanner failed" );
#endif

/* No semi-colon after return; correct usage is to write "sieve_yyterminate();" -
 * we don't want an extra ';' after the "return" because that will cause
 * some compilers to complain about unreachable statements.
 */
#ifndef sieve_yyterminate
#define sieve_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) sieve_yy_fatal_error( msg )
#endif

/* Default declaration of generated scanner - a define so the user can
 * easily add parameters.
 */
#ifndef YY_DECL
#define YY_DECL int sieve_yylex YY_PROTO(( void ))
#endif

/* Code executed at the beginning of each rule, after sieve_yytext and sieve_yyleng
 * have been set up.
 */
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif

/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif

#define YY_RULE_SETUP \
      YY_USER_ACTION

YY_DECL
      {
      register sieve_yy_state_type sieve_yy_current_state;
      register char *sieve_yy_cp, *sieve_yy_bp;
      register int sieve_yy_act;

#line 336 "sieve.l"

         /* C-style comments */
#line 976 "lex.sieve_yy.c"

      if ( sieve_yy_init )
            {
            sieve_yy_init = 0;

#ifdef YY_USER_INIT
            YY_USER_INIT;
#endif

            if ( ! sieve_yy_start )
                  sieve_yy_start = 1;     /* first start state */

            if ( ! sieve_yyin )
                  sieve_yyin = stdin;

            if ( ! sieve_yyout )
                  sieve_yyout = stdout;

            if ( ! sieve_yy_current_buffer )
                  sieve_yy_current_buffer =
                        sieve_yy_create_buffer( sieve_yyin, YY_BUF_SIZE );

            sieve_yy_load_buffer_state();
            }

      while ( 1 )       /* loops until end-of-file is reached */
            {
            sieve_yy_cp = sieve_yy_c_buf_p;

            /* Support of sieve_yytext. */
            *sieve_yy_cp = sieve_yy_hold_char;

            /* sieve_yy_bp points to the position in sieve_yy_ch_buf of the start of
             * the current run.
             */
            sieve_yy_bp = sieve_yy_cp;

            sieve_yy_current_state = sieve_yy_start;
sieve_yy_match:
            do
                  {
                  register YY_CHAR sieve_yy_c = sieve_yy_ec[YY_SC_TO_UI(*sieve_yy_cp)];
                  if ( sieve_yy_accept[sieve_yy_current_state] )
                        {
                        sieve_yy_last_accepting_state = sieve_yy_current_state;
                        sieve_yy_last_accepting_cpos = sieve_yy_cp;
                        }
                  while ( sieve_yy_chk[sieve_yy_base[sieve_yy_current_state] + sieve_yy_c] != sieve_yy_current_state )
                        {
                        sieve_yy_current_state = (int) sieve_yy_def[sieve_yy_current_state];
                        if ( sieve_yy_current_state >= 138 )
                              sieve_yy_c = sieve_yy_meta[(unsigned int) sieve_yy_c];
                        }
                  sieve_yy_current_state = sieve_yy_nxt[sieve_yy_base[sieve_yy_current_state] + (unsigned int) sieve_yy_c];
                  ++sieve_yy_cp;
                  }
            while ( sieve_yy_base[sieve_yy_current_state] != 328 );

sieve_yy_find_action:
            sieve_yy_act = sieve_yy_accept[sieve_yy_current_state];
            if ( sieve_yy_act == 0 )
                  { /* have to back up */
                  sieve_yy_cp = sieve_yy_last_accepting_cpos;
                  sieve_yy_current_state = sieve_yy_last_accepting_state;
                  sieve_yy_act = sieve_yy_accept[sieve_yy_current_state];
                  }

            YY_DO_BEFORE_ACTION;


do_action:  /* This label is used only to access EOF actions. */


            switch ( sieve_yy_act )
      { /* beginning of action switch */
                  case 0: /* must back up */
                  /* undo the effects of YY_DO_BEFORE_ACTION */
                  *sieve_yy_cp = sieve_yy_hold_char;
                  sieve_yy_cp = sieve_yy_last_accepting_cpos;
                  sieve_yy_current_state = sieve_yy_last_accepting_state;
                  goto sieve_yy_find_action;

case 1:
YY_RULE_SETUP
#line 338 "sieve.l"
BEGIN(COMMENT);
      YY_BREAK
case 2:
YY_RULE_SETUP
#line 339 "sieve.l"
/* eat anything that's not a '*' */
      YY_BREAK
case 3:
YY_RULE_SETUP
#line 340 "sieve.l"
/* eat up '*'s not followed by '/'s */
      YY_BREAK
case 4:
YY_RULE_SETUP
#line 341 "sieve.l"
++sieve_line_num;
      YY_BREAK
case 5:
YY_RULE_SETUP
#line 342 "sieve.l"
BEGIN(INITIAL);
      YY_BREAK
/* Preprocessor directives (an extension) */
case 6:
YY_RULE_SETUP
#line 344 "sieve.l"
{ sieve_include (); }
      YY_BREAK
case 7:
YY_RULE_SETUP
#line 345 "sieve.l"
{ sieve_searchpath (); } 
      YY_BREAK
/* End-of-line comments */
case 8:
YY_RULE_SETUP
#line 347 "sieve.l"
{ sieve_line_num++; }
      YY_BREAK
case 9:
YY_RULE_SETUP
#line 348 "sieve.l"
/* end-of-file comment */;
      YY_BREAK
/* Reserved words */
case 10:
YY_RULE_SETUP
#line 350 "sieve.l"
return REQUIRE; 
      YY_BREAK
case 11:
YY_RULE_SETUP
#line 351 "sieve.l"
return IF;      
      YY_BREAK
case 12:
YY_RULE_SETUP
#line 352 "sieve.l"
return ELSIF;  
      YY_BREAK
case 13:
YY_RULE_SETUP
#line 353 "sieve.l"
return ELSE;    
      YY_BREAK
case 14:
YY_RULE_SETUP
#line 354 "sieve.l"
return ANYOF;   
      YY_BREAK
case 15:
YY_RULE_SETUP
#line 355 "sieve.l"
return ALLOF;   
      YY_BREAK
case 16:
YY_RULE_SETUP
#line 356 "sieve.l"
return NOT;
      YY_BREAK
/* Identifiers */
case 17:
YY_RULE_SETUP
#line 358 "sieve.l"
{ ident (sieve_yytext); return IDENT; } 
      YY_BREAK
case 18:
YY_RULE_SETUP
#line 359 "sieve.l"
{ ident (sieve_yytext + 1); return TAG; }
      YY_BREAK
/* Numbers */
case 19:
YY_RULE_SETUP
#line 361 "sieve.l"
{ return number (); }
      YY_BREAK
case 20:
YY_RULE_SETUP
#line 362 "sieve.l"
{ return number (); }
      YY_BREAK
case 21:
YY_RULE_SETUP
#line 363 "sieve.l"
{ return number (); }
      YY_BREAK
/* Quoted strings */
case 22:
YY_RULE_SETUP
#line 365 "sieve.l"
{ return string (); }
      YY_BREAK
case 23:
YY_RULE_SETUP
#line 366 "sieve.l"
{ BEGIN(STR);
                   line_begin ();
               line_add (str_unescape (sieve_yytext + 1, sieve_yyleng - 1), 0); }
      YY_BREAK
case 24:
YY_RULE_SETUP
#line 369 "sieve.l"
{ line_add (str_unescape (sieve_yytext, sieve_yyleng), 0); }
      YY_BREAK
case 25:
YY_RULE_SETUP
#line 370 "sieve.l"
{ BEGIN(INITIAL);
                   if (sieve_yyleng > 1) 
                     line_add (sieve_yytext, sieve_yyleng - 1); 
                   line_finish ();
               return STRING; }
      YY_BREAK
/* Multiline strings */
case 26:
YY_RULE_SETUP
#line 376 "sieve.l"
{ BEGIN(ML); multiline_begin (); sieve_line_num++; }
      YY_BREAK
case 27:
YY_RULE_SETUP
#line 377 "sieve.l"
{ BEGIN(ML); multiline_begin (); sieve_line_num++; }
      YY_BREAK
case 28:
YY_RULE_SETUP
#line 378 "sieve.l"
{ BEGIN(ML); multiline_begin ();
                               sieve_line_num++; }
      YY_BREAK
case 29:
YY_RULE_SETUP
#line 380 "sieve.l"
{ BEGIN(ML); multiline_begin ();
                               sieve_line_num++; }
      YY_BREAK
case 30:
YY_RULE_SETUP
#line 382 "sieve.l"
{ if (multiline_delimiter[0] == '\\')
                              {
                        sieve_line_num++;
                                multiline_add (NULL);
                        }
                            else
                              sieve_include (); }
      YY_BREAK
case 31:
YY_RULE_SETUP
#line 389 "sieve.l"
{ char *p = multiline_strip_tabs (sieve_yytext);
           sieve_line_num++;
         
           if (strncmp (p, multiline_delimiter, strlen (multiline_delimiter))
              == 0
             && isemptystr (p + strlen (multiline_delimiter)))
           {
             free (multiline_delimiter);
             multiline_delimiter = NULL;
             BEGIN(INITIAL);
             multiline_finish ();
             return MULTILINE;
           }
          multiline_add (NULL); } 
      YY_BREAK
case 32:
YY_RULE_SETUP
#line 403 "sieve.l"
;
      YY_BREAK
/* Other tokens */
case 33:
YY_RULE_SETUP
#line 405 "sieve.l"
{ sieve_line_num++; } 
      YY_BREAK
case 34:
YY_RULE_SETUP
#line 406 "sieve.l"
return sieve_yytext[0];
      YY_BREAK
case 35:
YY_RULE_SETUP
#line 408 "sieve.l"
ECHO;
      YY_BREAK
#line 1269 "lex.sieve_yy.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(COMMENT):
case YY_STATE_EOF(ML):
case YY_STATE_EOF(STR):
      sieve_yyterminate();

      case YY_END_OF_BUFFER:
            {
            /* Amount of text matched not including the EOB char. */
            int sieve_yy_amount_of_matched_text = (int) (sieve_yy_cp - sieve_yytext_ptr) - 1;

            /* Undo the effects of YY_DO_BEFORE_ACTION. */
            *sieve_yy_cp = sieve_yy_hold_char;
            YY_RESTORE_YY_MORE_OFFSET

            if ( sieve_yy_current_buffer->sieve_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 sieve_yyin at a new source and called
                   * sieve_yylex().  If so, then we have to assure
                   * consistency between sieve_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.
                   */
                  sieve_yy_n_chars = sieve_yy_current_buffer->sieve_yy_n_chars;
                  sieve_yy_current_buffer->sieve_yy_input_file = sieve_yyin;
                  sieve_yy_current_buffer->sieve_yy_buffer_status = YY_BUFFER_NORMAL;
                  }

            /* Note that here we test for sieve_yy_c_buf_p "<=" to the position
             * of the first EOB in the buffer, since sieve_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 ( sieve_yy_c_buf_p <= &sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars] )
                  { /* This was really a NUL. */
                  sieve_yy_state_type sieve_yy_next_state;

                  sieve_yy_c_buf_p = sieve_yytext_ptr + sieve_yy_amount_of_matched_text;

                  sieve_yy_current_state = sieve_yy_get_previous_state();

                  /* Okay, we're now positioned to make the NUL
                   * transition.  We couldn't have
                   * sieve_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).
                   */

                  sieve_yy_next_state = sieve_yy_try_NUL_trans( sieve_yy_current_state );

                  sieve_yy_bp = sieve_yytext_ptr + YY_MORE_ADJ;

                  if ( sieve_yy_next_state )
                        {
                        /* Consume the NUL. */
                        sieve_yy_cp = ++sieve_yy_c_buf_p;
                        sieve_yy_current_state = sieve_yy_next_state;
                        goto sieve_yy_match;
                        }

                  else
                        {
                        sieve_yy_cp = sieve_yy_c_buf_p;
                        goto sieve_yy_find_action;
                        }
                  }

            else switch ( sieve_yy_get_next_buffer() )
                  {
                  case EOB_ACT_END_OF_FILE:
                        {
                        sieve_yy_did_buffer_switch_on_eof = 0;

                        if ( sieve_yywrap() )
                              {
                              /* Note: because we've taken care in
                               * sieve_yy_get_next_buffer() to have set up
                               * sieve_yytext, we can now set up
                               * sieve_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.
                               */
                              sieve_yy_c_buf_p = sieve_yytext_ptr + YY_MORE_ADJ;

                              sieve_yy_act = YY_STATE_EOF(YY_START);
                              goto do_action;
                              }

                        else
                              {
                              if ( ! sieve_yy_did_buffer_switch_on_eof )
                                    YY_NEW_FILE;
                              }
                        break;
                        }

                  case EOB_ACT_CONTINUE_SCAN:
                        sieve_yy_c_buf_p =
                              sieve_yytext_ptr + sieve_yy_amount_of_matched_text;

                        sieve_yy_current_state = sieve_yy_get_previous_state();

                        sieve_yy_cp = sieve_yy_c_buf_p;
                        sieve_yy_bp = sieve_yytext_ptr + YY_MORE_ADJ;
                        goto sieve_yy_match;

                  case EOB_ACT_LAST_MATCH:
                        sieve_yy_c_buf_p =
                        &sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars];

                        sieve_yy_current_state = sieve_yy_get_previous_state();

                        sieve_yy_cp = sieve_yy_c_buf_p;
                        sieve_yy_bp = sieve_yytext_ptr + YY_MORE_ADJ;
                        goto sieve_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 sieve_yylex */


/* sieve_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 sieve_yy_get_next_buffer()
      {
      register char *dest = sieve_yy_current_buffer->sieve_yy_ch_buf;
      register char *source = sieve_yytext_ptr;
      register int number_to_move, i;
      int ret_val;

      if ( sieve_yy_c_buf_p > &sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars + 1] )
            YY_FATAL_ERROR(
            "fatal flex scanner internal error--end of buffer missed" );

      if ( sieve_yy_current_buffer->sieve_yy_fill_buffer == 0 )
            { /* Don't try to fill the buffer, so this is an EOF. */
            if ( sieve_yy_c_buf_p - sieve_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) (sieve_yy_c_buf_p - sieve_yytext_ptr) - 1;

      for ( i = 0; i < number_to_move; ++i )
            *(dest++) = *(source++);

      if ( sieve_yy_current_buffer->sieve_yy_buffer_status == YY_BUFFER_EOF_PENDING )
            /* don't do the read, it's not guaranteed to return an EOF,
             * just force an EOF
             */
            sieve_yy_current_buffer->sieve_yy_n_chars = sieve_yy_n_chars = 0;

      else
            {
            int num_to_read =
                  sieve_yy_current_buffer->sieve_yy_buf_size - number_to_move - 1;

            while ( num_to_read <= 0 )
                  { /* Not enough room in the buffer - grow it. */
#ifdef YY_USES_REJECT
                  YY_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else

                  /* just a shorter name for the current buffer */
                  YY_BUFFER_STATE b = sieve_yy_current_buffer;

                  int sieve_yy_c_buf_p_offset =
                        (int) (sieve_yy_c_buf_p - b->sieve_yy_ch_buf);

                  if ( b->sieve_yy_is_our_buffer )
                        {
                        int new_size = b->sieve_yy_buf_size * 2;

                        if ( new_size <= 0 )
                              b->sieve_yy_buf_size += b->sieve_yy_buf_size / 8;
                        else
                              b->sieve_yy_buf_size *= 2;

                        b->sieve_yy_ch_buf = (char *)
                              /* Include room in for 2 EOB chars. */
                              sieve_yy_flex_realloc( (void *) b->sieve_yy_ch_buf,
                                           b->sieve_yy_buf_size + 2 );
                        }
                  else
                        /* Can't grow it, we don't own it. */
                        b->sieve_yy_ch_buf = 0;

                  if ( ! b->sieve_yy_ch_buf )
                        YY_FATAL_ERROR(
                        "fatal error - scanner input buffer overflow" );

                  sieve_yy_c_buf_p = &b->sieve_yy_ch_buf[sieve_yy_c_buf_p_offset];

                  num_to_read = sieve_yy_current_buffer->sieve_yy_buf_size -
                                    number_to_move - 1;
#endif
                  }

            if ( num_to_read > YY_READ_BUF_SIZE )
                  num_to_read = YY_READ_BUF_SIZE;

            /* Read in more data. */
            YY_INPUT( (&sieve_yy_current_buffer->sieve_yy_ch_buf[number_to_move]),
                  sieve_yy_n_chars, num_to_read );

            sieve_yy_current_buffer->sieve_yy_n_chars = sieve_yy_n_chars;
            }

      if ( sieve_yy_n_chars == 0 )
            {
            if ( number_to_move == YY_MORE_ADJ )
                  {
                  ret_val = EOB_ACT_END_OF_FILE;
                  sieve_yyrestart( sieve_yyin );
                  }

            else
                  {
                  ret_val = EOB_ACT_LAST_MATCH;
                  sieve_yy_current_buffer->sieve_yy_buffer_status =
                        YY_BUFFER_EOF_PENDING;
                  }
            }

      else
            ret_val = EOB_ACT_CONTINUE_SCAN;

      sieve_yy_n_chars += number_to_move;
      sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars] = YY_END_OF_BUFFER_CHAR;
      sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;

      sieve_yytext_ptr = &sieve_yy_current_buffer->sieve_yy_ch_buf[0];

      return ret_val;
      }


/* sieve_yy_get_previous_state - get the state just before the EOB char was reached */

static sieve_yy_state_type sieve_yy_get_previous_state()
      {
      register sieve_yy_state_type sieve_yy_current_state;
      register char *sieve_yy_cp;

      sieve_yy_current_state = sieve_yy_start;

      for ( sieve_yy_cp = sieve_yytext_ptr + YY_MORE_ADJ; sieve_yy_cp < sieve_yy_c_buf_p; ++sieve_yy_cp )
            {
            register YY_CHAR sieve_yy_c = (*sieve_yy_cp ? sieve_yy_ec[YY_SC_TO_UI(*sieve_yy_cp)] : 1);
            if ( sieve_yy_accept[sieve_yy_current_state] )
                  {
                  sieve_yy_last_accepting_state = sieve_yy_current_state;
                  sieve_yy_last_accepting_cpos = sieve_yy_cp;
                  }
            while ( sieve_yy_chk[sieve_yy_base[sieve_yy_current_state] + sieve_yy_c] != sieve_yy_current_state )
                  {
                  sieve_yy_current_state = (int) sieve_yy_def[sieve_yy_current_state];
                  if ( sieve_yy_current_state >= 138 )
                        sieve_yy_c = sieve_yy_meta[(unsigned int) sieve_yy_c];
                  }
            sieve_yy_current_state = sieve_yy_nxt[sieve_yy_base[sieve_yy_current_state] + (unsigned int) sieve_yy_c];
            }

      return sieve_yy_current_state;
      }


/* sieve_yy_try_NUL_trans - try to make a transition on the NUL character
 *
 * synopsis
 *    next_state = sieve_yy_try_NUL_trans( current_state );
 */

#ifdef YY_USE_PROTOS
static sieve_yy_state_type sieve_yy_try_NUL_trans( sieve_yy_state_type sieve_yy_current_state )
#else
static sieve_yy_state_type sieve_yy_try_NUL_trans( sieve_yy_current_state )
sieve_yy_state_type sieve_yy_current_state;
#endif
      {
      register int sieve_yy_is_jam;
      register char *sieve_yy_cp = sieve_yy_c_buf_p;

      register YY_CHAR sieve_yy_c = 1;
      if ( sieve_yy_accept[sieve_yy_current_state] )
            {
            sieve_yy_last_accepting_state = sieve_yy_current_state;
            sieve_yy_last_accepting_cpos = sieve_yy_cp;
            }
      while ( sieve_yy_chk[sieve_yy_base[sieve_yy_current_state] + sieve_yy_c] != sieve_yy_current_state )
            {
            sieve_yy_current_state = (int) sieve_yy_def[sieve_yy_current_state];
            if ( sieve_yy_current_state >= 138 )
                  sieve_yy_c = sieve_yy_meta[(unsigned int) sieve_yy_c];
            }
      sieve_yy_current_state = sieve_yy_nxt[sieve_yy_base[sieve_yy_current_state] + (unsigned int) sieve_yy_c];
      sieve_yy_is_jam = (sieve_yy_current_state == 137);

      return sieve_yy_is_jam ? 0 : sieve_yy_current_state;
      }


#ifndef YY_NO_UNPUT
#ifdef YY_USE_PROTOS
static void sieve_yyunput( int c, register char *sieve_yy_bp )
#else
static void sieve_yyunput( c, sieve_yy_bp )
int c;
register char *sieve_yy_bp;
#endif
      {
      register char *sieve_yy_cp = sieve_yy_c_buf_p;

      /* undo effects of setting up sieve_yytext */
      *sieve_yy_cp = sieve_yy_hold_char;

      if ( sieve_yy_cp < sieve_yy_current_buffer->sieve_yy_ch_buf + 2 )
            { /* need to shift things up to make room */
            /* +2 for EOB chars. */
            register int number_to_move = sieve_yy_n_chars + 2;
            register char *dest = &sieve_yy_current_buffer->sieve_yy_ch_buf[
                              sieve_yy_current_buffer->sieve_yy_buf_size + 2];
            register char *source =
                        &sieve_yy_current_buffer->sieve_yy_ch_buf[number_to_move];

            while ( source > sieve_yy_current_buffer->sieve_yy_ch_buf )
                  *--dest = *--source;

            sieve_yy_cp += (int) (dest - source);
            sieve_yy_bp += (int) (dest - source);
            sieve_yy_current_buffer->sieve_yy_n_chars =
                  sieve_yy_n_chars = sieve_yy_current_buffer->sieve_yy_buf_size;

            if ( sieve_yy_cp < sieve_yy_current_buffer->sieve_yy_ch_buf + 2 )
                  YY_FATAL_ERROR( "flex scanner push-back overflow" );
            }

      *--sieve_yy_cp = (char) c;


      sieve_yytext_ptr = sieve_yy_bp;
      sieve_yy_hold_char = *sieve_yy_cp;
      sieve_yy_c_buf_p = sieve_yy_cp;
      }
#endif      /* ifndef YY_NO_UNPUT */


#ifdef __cplusplus
static int sieve_yyinput()
#else
static int input()
#endif
      {
      int c;

      *sieve_yy_c_buf_p = sieve_yy_hold_char;

      if ( *sieve_yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
            {
            /* sieve_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 ( sieve_yy_c_buf_p < &sieve_yy_current_buffer->sieve_yy_ch_buf[sieve_yy_n_chars] )
                  /* This was really a NUL. */
                  *sieve_yy_c_buf_p = '\0';

            else
                  { /* need more input */
                  int offset = sieve_yy_c_buf_p - sieve_yytext_ptr;
                  ++sieve_yy_c_buf_p;

                  switch ( sieve_yy_get_next_buffer() )
                        {
                        case EOB_ACT_LAST_MATCH:
                              /* This happens because sieve_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. */
                              sieve_yyrestart( sieve_yyin );

                              /* fall through */

                        case EOB_ACT_END_OF_FILE:
                              {
                              if ( sieve_yywrap() )
                                    return EOF;

                              if ( ! sieve_yy_did_buffer_switch_on_eof )
                                    YY_NEW_FILE;
#ifdef __cplusplus
                              return sieve_yyinput();
#else
                              return input();
#endif
                              }

                        case EOB_ACT_CONTINUE_SCAN:
                              sieve_yy_c_buf_p = sieve_yytext_ptr + offset;
                              break;
                        }
                  }
            }

      c = *(unsigned char *) sieve_yy_c_buf_p;  /* cast for 8-bit char's */
      *sieve_yy_c_buf_p = '\0';     /* preserve sieve_yytext */
      sieve_yy_hold_char = *++sieve_yy_c_buf_p;


      return c;
      }


#ifdef YY_USE_PROTOS
void sieve_yyrestart( FILE *input_file )
#else
void sieve_yyrestart( input_file )
FILE *input_file;
#endif
      {
      if ( ! sieve_yy_current_buffer )
            sieve_yy_current_buffer = sieve_yy_create_buffer( sieve_yyin, YY_BUF_SIZE );

      sieve_yy_init_buffer( sieve_yy_current_buffer, input_file );
      sieve_yy_load_buffer_state();
      }


#ifdef YY_USE_PROTOS
void sieve_yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
#else
void sieve_yy_switch_to_buffer( new_buffer )
YY_BUFFER_STATE new_buffer;
#endif
      {
      if ( sieve_yy_current_buffer == new_buffer )
            return;

      if ( sieve_yy_current_buffer )
            {
            /* Flush out information for old buffer. */
            *sieve_yy_c_buf_p = sieve_yy_hold_char;
            sieve_yy_current_buffer->sieve_yy_buf_pos = sieve_yy_c_buf_p;
            sieve_yy_current_buffer->sieve_yy_n_chars = sieve_yy_n_chars;
            }

      sieve_yy_current_buffer = new_buffer;
      sieve_yy_load_buffer_state();

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


#ifdef YY_USE_PROTOS
void sieve_yy_load_buffer_state( void )
#else
void sieve_yy_load_buffer_state()
#endif
      {
      sieve_yy_n_chars = sieve_yy_current_buffer->sieve_yy_n_chars;
      sieve_yytext_ptr = sieve_yy_c_buf_p = sieve_yy_current_buffer->sieve_yy_buf_pos;
      sieve_yyin = sieve_yy_current_buffer->sieve_yy_input_file;
      sieve_yy_hold_char = *sieve_yy_c_buf_p;
      }


#ifdef YY_USE_PROTOS
YY_BUFFER_STATE sieve_yy_create_buffer( FILE *file, int size )
#else
YY_BUFFER_STATE sieve_yy_create_buffer( file, size )
FILE *file;
int size;
#endif
      {
      YY_BUFFER_STATE b;

      b = (YY_BUFFER_STATE) sieve_yy_flex_alloc( sizeof( struct sieve_yy_buffer_state ) );
      if ( ! b )
            YY_FATAL_ERROR( "out of dynamic memory in sieve_yy_create_buffer()" );

      b->sieve_yy_buf_size = size;

      /* sieve_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->sieve_yy_ch_buf = (char *) sieve_yy_flex_alloc( b->sieve_yy_buf_size + 2 );
      if ( ! b->sieve_yy_ch_buf )
            YY_FATAL_ERROR( "out of dynamic memory in sieve_yy_create_buffer()" );

      b->sieve_yy_is_our_buffer = 1;

      sieve_yy_init_buffer( b, file );

      return b;
      }


#ifdef YY_USE_PROTOS
void sieve_yy_delete_buffer( YY_BUFFER_STATE b )
#else
void sieve_yy_delete_buffer( b )
YY_BUFFER_STATE b;
#endif
      {
      if ( ! b )
            return;

      if ( b == sieve_yy_current_buffer )
            sieve_yy_current_buffer = (YY_BUFFER_STATE) 0;

      if ( b->sieve_yy_is_our_buffer )
            sieve_yy_flex_free( (void *) b->sieve_yy_ch_buf );

      sieve_yy_flex_free( (void *) b );
      }


#ifndef YY_ALWAYS_INTERACTIVE
#ifndef YY_NEVER_INTERACTIVE
extern int isatty YY_PROTO(( int ));
#endif
#endif

#ifdef YY_USE_PROTOS
void sieve_yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
#else
void sieve_yy_init_buffer( b, file )
YY_BUFFER_STATE b;
FILE *file;
#endif


      {
      sieve_yy_flush_buffer( b );

      b->sieve_yy_input_file = file;
      b->sieve_yy_fill_buffer = 1;

#if YY_ALWAYS_INTERACTIVE
      b->sieve_yy_is_interactive = 1;
#else
#if YY_NEVER_INTERACTIVE
      b->sieve_yy_is_interactive = 0;
#else
      b->sieve_yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
      }


#ifdef YY_USE_PROTOS
void sieve_yy_flush_buffer( YY_BUFFER_STATE b )
#else
void sieve_yy_flush_buffer( b )
YY_BUFFER_STATE b;
#endif

      {
      if ( ! b )
            return;

      b->sieve_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->sieve_yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
      b->sieve_yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;

      b->sieve_yy_buf_pos = &b->sieve_yy_ch_buf[0];

      b->sieve_yy_at_bol = 1;
      b->sieve_yy_buffer_status = YY_BUFFER_NEW;

      if ( b == sieve_yy_current_buffer )
            sieve_yy_load_buffer_state();
      }


#ifndef YY_NO_SCAN_BUFFER
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE sieve_yy_scan_buffer( char *base, sieve_yy_size_t size )
#else
YY_BUFFER_STATE sieve_yy_scan_buffer( base, size )
char *base;
sieve_yy_size_t size;
#endif
      {
      YY_BUFFER_STATE b;

      if ( size < 2 ||
           base[size-2] != YY_END_OF_BUFFER_CHAR ||
           base[size-1] != YY_END_OF_BUFFER_CHAR )
            /* They forgot to leave room for the EOB's. */
            return 0;

      b = (YY_BUFFER_STATE) sieve_yy_flex_alloc( sizeof( struct sieve_yy_buffer_state ) );
      if ( ! b )
            YY_FATAL_ERROR( "out of dynamic memory in sieve_yy_scan_buffer()" );

      b->sieve_yy_buf_size = size - 2;    /* "- 2" to take care of EOB's */
      b->sieve_yy_buf_pos = b->sieve_yy_ch_buf = base;
      b->sieve_yy_is_our_buffer = 0;
      b->sieve_yy_input_file = 0;
      b->sieve_yy_n_chars = b->sieve_yy_buf_size;
      b->sieve_yy_is_interactive = 0;
      b->sieve_yy_at_bol = 1;
      b->sieve_yy_fill_buffer = 0;
      b->sieve_yy_buffer_status = YY_BUFFER_NEW;

      sieve_yy_switch_to_buffer( b );

      return b;
      }
#endif


#ifndef YY_NO_SCAN_STRING
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE sieve_yy_scan_string( sieve_yyconst char *sieve_yy_str )
#else
YY_BUFFER_STATE sieve_yy_scan_string( sieve_yy_str )
sieve_yyconst char *sieve_yy_str;
#endif
      {
      int len;
      for ( len = 0; sieve_yy_str[len]; ++len )
            ;

      return sieve_yy_scan_bytes( sieve_yy_str, len );
      }
#endif


#ifndef YY_NO_SCAN_BYTES
#ifdef YY_USE_PROTOS
YY_BUFFER_STATE sieve_yy_scan_bytes( sieve_yyconst char *bytes, int len )
#else
YY_BUFFER_STATE sieve_yy_scan_bytes( bytes, len )
sieve_yyconst char *bytes;
int len;
#endif
      {
      YY_BUFFER_STATE b;
      char *buf;
      sieve_yy_size_t n;
      int i;

      /* Get memory for full buffer, including space for trailing EOB's. */
      n = len + 2;
      buf = (char *) sieve_yy_flex_alloc( n );
      if ( ! buf )
            YY_FATAL_ERROR( "out of dynamic memory in sieve_yy_scan_bytes()" );

      for ( i = 0; i < len; ++i )
            buf[i] = bytes[i];

      buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;

      b = sieve_yy_scan_buffer( buf, n );
      if ( ! b )
            YY_FATAL_ERROR( "bad buffer in sieve_yy_scan_bytes()" );

      /* It's okay to grow etc. this buffer, and we should throw it
       * away when we're done.
       */
      b->sieve_yy_is_our_buffer = 1;

      return b;
      }
#endif


#ifndef YY_NO_PUSH_STATE
#ifdef YY_USE_PROTOS
static void sieve_yy_push_state( int new_state )
#else
static void sieve_yy_push_state( new_state )
int new_state;
#endif
      {
      if ( sieve_yy_start_stack_ptr >= sieve_yy_start_stack_depth )
            {
            sieve_yy_size_t new_size;

            sieve_yy_start_stack_depth += YY_START_STACK_INCR;
            new_size = sieve_yy_start_stack_depth * sizeof( int );

            if ( ! sieve_yy_start_stack )
                  sieve_yy_start_stack = (int *) sieve_yy_flex_alloc( new_size );

            else
                  sieve_yy_start_stack = (int *) sieve_yy_flex_realloc(
                              (void *) sieve_yy_start_stack, new_size );

            if ( ! sieve_yy_start_stack )
                  YY_FATAL_ERROR(
                  "out of memory expanding start-condition stack" );
            }

      sieve_yy_start_stack[sieve_yy_start_stack_ptr++] = YY_START;

      BEGIN(new_state);
      }
#endif


#ifndef YY_NO_POP_STATE
static void sieve_yy_pop_state()
      {
      if ( --sieve_yy_start_stack_ptr < 0 )
            YY_FATAL_ERROR( "start-condition stack underflow" );

      BEGIN(sieve_yy_start_stack[sieve_yy_start_stack_ptr]);
      }
#endif


#ifndef YY_NO_TOP_STATE
static int sieve_yy_top_state()
      {
      return sieve_yy_start_stack[sieve_yy_start_stack_ptr - 1];
      }
#endif

#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif

#ifdef YY_USE_PROTOS
static void sieve_yy_fatal_error( sieve_yyconst char msg[] )
#else
static void sieve_yy_fatal_error( msg )
char msg[];
#endif
      {
      (void) fprintf( stderr, "%s\n", msg );
      exit( YY_EXIT_FAILURE );
      }



/* Redefine sieve_yyless() so it works in section 3 code. */

#undef sieve_yyless
#define sieve_yyless(n) \
      do \
            { \
            /* Undo effects of setting up sieve_yytext. */ \
            sieve_yytext[sieve_yyleng] = sieve_yy_hold_char; \
            sieve_yy_c_buf_p = sieve_yytext + n; \
            sieve_yy_hold_char = *sieve_yy_c_buf_p; \
            *sieve_yy_c_buf_p = '\0'; \
            sieve_yyleng = n; \
            } \
      while ( 0 )


/* Internal utility routines. */

#ifndef sieve_yytext_ptr
#ifdef YY_USE_PROTOS
static void sieve_yy_flex_strncpy( char *s1, sieve_yyconst char *s2, int n )
#else
static void sieve_yy_flex_strncpy( s1, s2, n )
char *s1;
sieve_yyconst char *s2;
int n;
#endif
      {
      register int i;
      for ( i = 0; i < n; ++i )
            s1[i] = s2[i];
      }
#endif

#ifdef YY_NEED_STRLEN
#ifdef YY_USE_PROTOS
static int sieve_yy_flex_strlen( sieve_yyconst char *s )
#else
static int sieve_yy_flex_strlen( s )
sieve_yyconst char *s;
#endif
      {
      register int n;
      for ( n = 0; s[n]; ++n )
            ;

      return n;
      }
#endif


#ifdef YY_USE_PROTOS
static void *sieve_yy_flex_alloc( sieve_yy_size_t size )
#else
static void *sieve_yy_flex_alloc( size )
sieve_yy_size_t size;
#endif
      {
      return (void *) malloc( size );
      }

#ifdef YY_USE_PROTOS
static void *sieve_yy_flex_realloc( void *ptr, sieve_yy_size_t size )
#else
static void *sieve_yy_flex_realloc( ptr, size )
void *ptr;
sieve_yy_size_t size;
#endif
      {
      /* The cast to (char *) in the following accommodates both
       * implementations that use char* generic pointers, and those
       * that use void* generic pointers.  It works with the latter
       * because both ANSI C and C++ allow castless assignment from
       * any pointer type to void*, and deal with argument conversions
       * as though doing an assignment.
       */
      return (void *) realloc( (char *) ptr, size );
      }

#ifdef YY_USE_PROTOS
static void sieve_yy_flex_free( void *ptr )
#else
static void sieve_yy_flex_free( ptr )
void *ptr;
#endif
      {
      free( ptr );
      }

#if YY_MAIN
int main()
      {
      sieve_yylex();
      return 0;
      }
#endif
#line 408 "sieve.l"


int
sieve_yywrap ()
{
  return pop_source();
}

static char *
get_file_name (char *p, char *endp, int *usepath)
{
  char exp, *name, *startp;
  int n;
  
  if (usepath)
    *usepath = 0;
  switch (*p)
    {
    case '"':
      exp = '"';
      break;

    case '<':
      exp = '>';
      if (usepath)
      *usepath = 1;
      break;

    default:
      sieve_yyerror (_("preprocessor syntax"));
      return NULL;
    }

  for (startp = ++p; p < endp && *p != exp; p++)
    ;

  if (*p != exp)
    {
      sieve_yyerror (_("missing closing quote in preprocessor statement"));
      return NULL;
    }
  
  n = p - startp;
  name = sieve_alloc (n + 1);
  memcpy (name, startp, n);
  name[n] = 0;
  return name;
}

static int
_try_include (void *item, void *data)
{
  char **dir = data;
  char *name = malloc (strlen (item) + 1 + strlen (*dir) + 1);

  if (!name)
    return 0;
  sprintf (name, "%s/%s", (char*) item, *dir);
  if (access (name, R_OK) == 0)
    {
      *(char**) data = name;
      return 1;
    }
  free (name);
  return 0;
}

void
sieve_include ()
{
  char *p, *endp = sieve_yytext + sieve_yyleng, *name;
  int usepath;
  
  p = strstr (sieve_yytext, "include");
  for (p += 7; p < endp && isspace (*p); p++)
    ;

  name = get_file_name (p, endp, &usepath);
  if (!name)
    return;
  
  if (usepath && name[0] != '/' && memcmp (name, "..", 2))
    {
      char *p = name;
      if (sieve_include_path && list_do (sieve_include_path, _try_include, &p))
      {
        push_source (p);
        free (name);
        free (p);
        return;
      }
    }

  push_source (name);
  free (name);
}

void
sieve_searchpath ()
{
  int append = 0;
  char *p, *endp = sieve_yytext + sieve_yyleng, *name;
  
  p = strstr (sieve_yytext, "searchpath");
  for (p += 10; p < endp && isspace (*p); p++)
    ;
  if (strcmp (p, "add") == 0)
    {
      append = 1;
      for (p += 3; p < endp && isspace (*p); p++)
      ;
    }
  name = get_file_name (p, endp, NULL);
  if (name)
    {
      sieve_load_add_dir (sieve_machine, name);
      free (name);
    }
}

int
sieve_lex_begin (const char *name)
{
  return push_source (name);
}

void
sieve_lex_finish ()
{
  while (pop_source () == 0)
    ;
}
  
int
number ()
{
  char *p;
  sieve_yylval.number = strtoul (sieve_yytext, &p, 0);
  switch (*p)
    {
    case 'k':
    case 'K':
      sieve_yylval.number *= 1024L;
      break;
      
    case 'm':
    case 'M':
      sieve_yylval.number *= 1024*1024L;
      break;
      
    case 'g':
    case 'G':
      sieve_yylval.number *= 1024*1024*1024L;
    }
  return NUMBER;
}

int
string ()
{
  sieve_yylval.string = sieve_malloc (sieve_machine, sieve_yyleng - 1);
  memcpy (sieve_yylval.string, sieve_yytext + 1, sieve_yyleng - 2);
  sieve_yylval.string[sieve_yyleng - 2] = 0;
  return STRING; 
}

int
isemptystr (char *text)
{
  for (; *text && isspace (*text); text++)
    ;
  return *text == 0;
}

char *
multiline_strip_tabs (char *text)
{
  if (strip_tabs)
    for (; *text == '\t'; text++)
      ;
  return text;
}

void
line_add (char *text, size_t len)
{
  char *s;
  
  if (len == 0)
    len = strlen (text);
  s = malloc (len + 1);
  if (!s)
    {
      sieve_yyerror (_("Not enough memory"));
      exit (1);
    }
  memcpy (s, text, len);
  s[len] = 0;
  list_append (string_list, s);
}

void
multiline_add (char *s)
{
  if (!s)
    s = multiline_strip_tabs (sieve_yytext);
  line_add (s, 0);
}

void
line_begin ()
{
  int status;

  if (string_list)
    sieve_slist_destroy (&string_list);
  status = list_create (&string_list);
  if (status)
    {
      sieve_compile_error (sieve_filename, sieve_line_num,
                           "list_create: %s", mu_strerror (status));
      exit (1);
    }
}

void
multiline_begin ()
{
  char *p = sieve_yytext + 5; /* past the text: keyword */

  if (*p == '-')
    {
      strip_tabs = 1;
      p++;
    }
  else
    strip_tabs = 0;

  if (!isspace (*p))
    {
      char *endp;
      int len;
      
      for (endp = p; *endp; endp++)
      if (isspace (*endp))
        break;

      len = endp - p;
      multiline_delimiter = sieve_alloc (len + 1);
      memcpy (multiline_delimiter, p, len);
      multiline_delimiter[len] = 0;
    }
  else
    {
      multiline_delimiter = strdup (".");
      if (!multiline_delimiter)
      {
        sieve_yyerror (_("Not enough memory"));
        exit (1);
      }
    }

  line_begin ();
}

void
line_finish ()
{
  iterator_t itr;
  int length = 0;
  char *p;
  
  if (!string_list || list_get_iterator (string_list, &itr))
    return;

  /* Count number of characters in the multiline */
  for (iterator_first (itr); !iterator_is_done (itr); iterator_next (itr))
    {
      char *s;
      iterator_current (itr, (void **)&s);
      length += strlen (s);
    }

  /* Copy the contents */
  sieve_yylval.string = sieve_malloc (sieve_machine, length + 1);
  p = sieve_yylval.string;
  for (iterator_first (itr); !iterator_is_done (itr); iterator_next (itr))
    {
      char *s;
      iterator_current (itr, (void **)&s);
      strcpy (p, s);
      p += strlen (s);
      free (s);
    }
  *p = 0;
  iterator_destroy (&itr);
  list_destroy (&string_list);
}

void
multiline_finish ()
{
  line_finish ();
}

void
ident (const char *text)
{
  sieve_yylval.string = strdup (text);
  if (!sieve_yylval.string)
    {
      sieve_yyerror (_("Not enough memory"));
      exit (1);
    }
}

/* Escapes the last character from sieve_yytext */
char *
str_unescape (char *text, size_t len)
{
  char *str = sieve_alloc (len);
  memcpy (str, text, len - 2);
  str[len - 2] = argcv_unescape_char (text[len - 1]);
  str[len - 1] = 0;
  return str;
}

Generated by  Doxygen 1.6.0   Back to index