#line 2 "scanner.c" #line 4 "scanner.c" #define YY_INT_ALIGNED short int /* A lexical scanner generated by flex */ #define yy_create_buffer df__create_buffer #define yy_delete_buffer df__delete_buffer #define yy_flex_debug df__flex_debug #define yy_init_buffer df__init_buffer #define yy_flush_buffer df__flush_buffer #define yy_load_buffer_state df__load_buffer_state #define yy_switch_to_buffer df__switch_to_buffer #define yyin df_in #define yyleng df_leng #define yylex df_lex #define yylineno df_lineno #define yyout df_out #define yyrestart df_restart #define yytext df_text #define yywrap df_wrap #define yyalloc df_alloc #define yyrealloc df_realloc #define yyfree df_free #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #define YY_FLEX_SUBMINOR_VERSION 34 #if YY_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ #include #include #include #include /* end standard C headers. */ /* flex integer type definitions */ #ifndef FLEXINT_H #define FLEXINT_H /* C99 systems have . Non-C99 systems may or may not. */ #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, * if you want the limit (max/min) macros for int types. */ #ifndef __STDC_LIMIT_MACROS #define __STDC_LIMIT_MACROS 1 #endif #include typedef int8_t flex_int8_t; typedef uint8_t flex_uint8_t; typedef int16_t flex_int16_t; typedef uint16_t flex_uint16_t; typedef int32_t flex_int32_t; typedef uint32_t flex_uint32_t; #else typedef signed char flex_int8_t; typedef short int flex_int16_t; typedef int flex_int32_t; typedef unsigned char flex_uint8_t; typedef unsigned short int flex_uint16_t; typedef unsigned int flex_uint32_t; #endif /* ! C99 */ /* 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 /* ! FLEXINT_H */ #ifdef __cplusplus /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ /* C99 requires __STDC__ to be defined as 1. */ #if defined (__STDC__) #define YY_USE_CONST #endif /* defined (__STDC__) */ #endif /* ! __cplusplus */ #ifdef YY_USE_CONST #define yyconst const #else #define yyconst #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN (yy_start) = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The YYSTATE alias is for lex * compatibility. */ #define YY_START (((yy_start) - 1) / 2) #define YYSTATE YY_START /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define YY_NEW_FILE df_restart(df_in ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #ifndef YY_BUF_SIZE #define YY_BUF_SIZE 16384 #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 extern int df_leng; extern FILE *df_in, *df_out; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 #define YY_LESS_LINENO(n) /* Return all but the first "n" matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up df_text. */ \ 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 df_text again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, (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). * Given that the standard has decreed that size_t exists since 1989, * I guess we can afford to depend on it. Manoj. */ #ifndef YY_TYPEDEF_YY_SIZE_T #define YY_TYPEDEF_YY_SIZE_T typedef size_t yy_size_t; #endif #ifndef YY_STRUCT_YY_BUFFER_STATE #define YY_STRUCT_YY_BUFFER_STATE struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ yy_size_t yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ 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 df_restart()), so that the user can continue scanning by * just pointing df_in at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; #endif /* !YY_STRUCT_YY_BUFFER_STATE */ /* Stack of input buffers. */ static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". * * Returns the top of the stack, or NULL. */ #define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ : NULL) /* Same as previous macro, but useful when we know that the buffer stack is not * NULL or when we need an lvalue. For internal use only. */ #define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] /* yy_hold_char holds the character lost when df_text is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int df_leng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 0; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow df_wrap()'s to do buffer switches * instead of setting up a fresh df_in. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void df_restart (FILE *input_file ); void df__switch_to_buffer (YY_BUFFER_STATE new_buffer ); YY_BUFFER_STATE df__create_buffer (FILE *file,int size ); void df__delete_buffer (YY_BUFFER_STATE b ); void df__flush_buffer (YY_BUFFER_STATE b ); void df_push_buffer_state (YY_BUFFER_STATE new_buffer ); void df_pop_buffer_state (void ); static void df_ensure_buffer_stack (void ); static void df__load_buffer_state (void ); static void df__init_buffer (YY_BUFFER_STATE b,FILE *file ); #define YY_FLUSH_BUFFER df__flush_buffer(YY_CURRENT_BUFFER ) YY_BUFFER_STATE df__scan_buffer (char *base,yy_size_t size ); YY_BUFFER_STATE df__scan_string (yyconst char *yy_str ); YY_BUFFER_STATE df__scan_bytes (yyconst char *bytes,int len ); void *df_alloc (yy_size_t ); void *df_realloc (void *,yy_size_t ); void df_free (void * ); #define yy_new_buffer df__create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! YY_CURRENT_BUFFER ){ \ df_ensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ df__create_buffer(df_in,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! YY_CURRENT_BUFFER ){\ df_ensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ df__create_buffer(df_in,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) /* Begin user sect3 */ typedef unsigned char YY_CHAR; FILE *df_in = (FILE *) 0, *df_out = (FILE *) 0; typedef int yy_state_type; extern int df_lineno; int df_lineno = 1; extern char *df_text; #define yytext_ptr df_text 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 yy_fatal_error (yyconst char msg[] ); /* Done after the current pattern has been matched and before the * corresponding action - sets up df_text. */ #define YY_DO_BEFORE_ACTION \ (yytext_ptr) = yy_bp; \ df_leng = (size_t) (yy_cp - yy_bp); \ (yy_hold_char) = *yy_cp; \ *yy_cp = '\0'; \ (yy_c_buf_p) = yy_cp; #define YY_NUM_RULES 46 #define YY_END_OF_BUFFER 47 /* 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[111] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 45, 1, 1, 22, 37, 18, 2, 3, 44, 4, 44, 13, 45, 9, 28, 44, 44, 44, 44, 44, 44, 44, 44, 44, 45, 20, 36, 46, 36, 33, 29, 29, 31, 34, 35, 33, 32, 31, 34, 42, 38, 46, 1, 7, 24, 44, 44, 0, 15, 5, 11, 44, 44, 44, 6, 12, 10, 16, 14, 44, 8, 44, 27, 26, 29, 29, 0, 35, 42, 41, 39, 41, 43, 25, 44, 44, 44, 23, 30, 39, 40, 44, 44, 44, 39, 40, 44, 44, 44, 44, 44, 44, 44, 44, 21, 44, 19, 44, 44, 17, 0 } ; static yyconst flex_int32_t 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, 4, 5, 1, 1, 1, 6, 1, 7, 8, 1, 9, 10, 11, 12, 13, 14, 15, 15, 15, 15, 15, 15, 15, 16, 16, 17, 1, 18, 19, 20, 1, 1, 21, 21, 21, 21, 21, 21, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 22, 23, 24, 1, 25, 1, 26, 27, 28, 29, 30, 21, 31, 32, 33, 12, 12, 34, 35, 36, 37, 12, 38, 39, 40, 41, 12, 12, 42, 43, 12, 12, 1, 44, 1, 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 } ; static yyconst flex_int32_t yy_meta[46] = { 0, 1, 1, 2, 1, 3, 1, 1, 1, 4, 5, 6, 4, 7, 8, 8, 8, 6, 1, 1, 1, 8, 1, 3, 5, 4, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1 } ; static yyconst flex_int16_t yy_base[122] = { 0, 0, 0, 43, 65, 38, 53, 42, 46, 118, 392, 69, 81, 97, 392, 104, 392, 392, 0, 392, 77, 66, 59, 54, 392, 78, 79, 84, 89, 90, 96, 91, 102, 116, 22, 392, 392, 392, 108, 392, 120, 126, 392, 392, 0, 392, 392, 392, 392, 0, 392, 129, 143, 392, 392, 0, 139, 135, 392, 392, 392, 144, 145, 151, 157, 158, 167, 168, 179, 180, 181, 182, 191, 392, 187, 191, 0, 0, 0, 392, 164, 0, 195, 203, 205, 215, 216, 218, 0, 168, 0, 225, 228, 240, 392, 392, 242, 251, 253, 256, 254, 268, 278, 279, 280, 285, 292, 297, 303, 304, 392, 333, 341, 349, 354, 359, 367, 375, 383, 53, 48, 42 } ; static yyconst flex_int16_t yy_def[122] = { 0, 110, 1, 111, 111, 112, 112, 113, 113, 110, 110, 110, 110, 110, 110, 110, 110, 110, 114, 110, 115, 110, 110, 110, 110, 115, 115, 115, 115, 115, 115, 115, 115, 115, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 116, 110, 110, 110, 110, 117, 110, 118, 110, 110, 110, 114, 115, 110, 110, 110, 110, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 110, 110, 110, 119, 116, 117, 110, 110, 120, 110, 115, 115, 115, 115, 115, 119, 110, 121, 115, 115, 115, 110, 110, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 115, 0, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110 } ; static yyconst flex_int16_t yy_nxt[438] = { 0, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 20, 10, 20, 20, 20, 18, 21, 22, 23, 20, 24, 10, 10, 20, 25, 26, 27, 20, 28, 29, 20, 20, 30, 31, 32, 33, 20, 20, 20, 20, 20, 20, 34, 35, 37, 50, 45, 46, 95, 50, 38, 39, 38, 47, 90, 40, 41, 41, 42, 88, 48, 45, 46, 51, 73, 43, 37, 51, 47, 52, 52, 60, 38, 39, 38, 48, 59, 40, 41, 41, 42, 52, 52, 58, 55, 55, 55, 43, 57, 57, 57, 55, 55, 55, 55, 57, 55, 55, 55, 55, 57, 57, 57, 55, 55, 55, 55, 57, 54, 55, 62, 55, 61, 57, 53, 69, 110, 55, 65, 63, 74, 75, 75, 55, 67, 64, 110, 57, 110, 66, 70, 55, 75, 75, 75, 68, 110, 71, 75, 75, 75, 80, 80, 52, 52, 110, 55, 82, 82, 82, 57, 55, 55, 72, 55, 57, 57, 110, 55, 55, 55, 76, 57, 110, 55, 55, 55, 110, 57, 57, 81, 83, 55, 55, 55, 55, 89, 89, 57, 57, 94, 94, 55, 55, 84, 85, 55, 55, 55, 55, 57, 57, 57, 57, 55, 55, 55, 55, 55, 75, 75, 75, 57, 75, 75, 75, 55, 82, 82, 82, 55, 110, 55, 110, 57, 110, 57, 110, 55, 86, 55, 87, 55, 55, 110, 55, 57, 57, 76, 57, 55, 55, 55, 55, 110, 55, 57, 110, 110, 57, 55, 110, 93, 55, 110, 91, 110, 55, 110, 55, 110, 57, 97, 57, 92, 55, 96, 55, 55, 110, 55, 55, 57, 55, 57, 57, 55, 57, 55, 55, 98, 55, 110, 110, 110, 55, 110, 110, 110, 57, 99, 101, 100, 55, 102, 55, 55, 55, 103, 57, 57, 57, 55, 55, 55, 55, 57, 110, 110, 55, 55, 105, 110, 57, 55, 110, 104, 55, 57, 107, 55, 55, 55, 110, 57, 57, 110, 106, 55, 55, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 109, 108, 36, 36, 36, 36, 36, 36, 36, 36, 44, 44, 44, 44, 44, 44, 44, 44, 49, 49, 49, 49, 49, 49, 49, 49, 55, 110, 55, 110, 55, 56, 110, 56, 56, 56, 77, 77, 77, 77, 110, 110, 77, 77, 78, 78, 110, 78, 78, 78, 78, 78, 79, 110, 79, 79, 79, 79, 79, 79, 9, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110 } ; static yyconst flex_int16_t yy_chk[438] = { 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, 3, 7, 5, 5, 121, 8, 3, 3, 3, 5, 120, 3, 3, 3, 3, 119, 5, 6, 6, 7, 34, 3, 4, 8, 6, 11, 11, 23, 4, 4, 4, 6, 22, 4, 4, 4, 4, 12, 12, 21, 20, 25, 26, 4, 20, 25, 26, 27, 20, 25, 26, 27, 28, 29, 31, 27, 28, 29, 31, 30, 28, 29, 31, 30, 15, 32, 26, 30, 25, 32, 13, 31, 9, 32, 29, 27, 38, 38, 38, 33, 30, 28, 0, 33, 0, 29, 32, 33, 40, 40, 40, 30, 0, 32, 41, 41, 41, 51, 51, 52, 52, 0, 56, 57, 57, 57, 56, 61, 62, 33, 56, 61, 62, 0, 63, 61, 62, 40, 63, 0, 64, 65, 63, 0, 64, 65, 51, 61, 64, 65, 66, 67, 80, 80, 66, 67, 89, 89, 66, 67, 62, 63, 68, 69, 70, 71, 68, 69, 70, 71, 68, 69, 70, 71, 72, 74, 74, 74, 72, 75, 75, 75, 72, 82, 82, 82, 83, 0, 84, 0, 83, 0, 84, 0, 83, 69, 84, 71, 85, 86, 0, 87, 85, 86, 74, 87, 85, 86, 91, 87, 0, 92, 91, 0, 0, 92, 91, 0, 86, 92, 0, 84, 0, 93, 0, 96, 0, 93, 92, 96, 85, 93, 91, 96, 97, 0, 98, 100, 97, 99, 98, 100, 97, 99, 98, 100, 93, 99, 0, 0, 0, 101, 0, 0, 0, 101, 96, 98, 97, 101, 99, 102, 103, 104, 100, 102, 103, 104, 105, 102, 103, 104, 105, 0, 0, 106, 105, 102, 0, 106, 107, 0, 101, 106, 107, 105, 108, 109, 107, 0, 108, 109, 0, 103, 108, 109, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 108, 107, 111, 111, 111, 111, 111, 111, 111, 111, 112, 112, 112, 112, 112, 112, 112, 112, 113, 113, 113, 113, 113, 113, 113, 113, 114, 0, 114, 0, 114, 115, 0, 115, 115, 115, 116, 116, 116, 116, 0, 0, 116, 116, 117, 117, 0, 117, 117, 117, 117, 117, 118, 0, 118, 118, 118, 118, 118, 118, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; extern int df__flex_debug; int df__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 *df_text; #line 1 "scanner.l" /* * We don't use unput, so don't generate code for it. */ /* * We don't read from the terminal. */ /* * Prefix scanner routines with "df_" rather than "yy", so this scanner * can coexist with other scanners. */ #line 18 "scanner.l" /* * $Id: scanner.l 27740 2009-03-16 16:49:47Z guy $ * * Wireshark - Network traffic analyzer * By Gerald Combs * Copyright 2001 Gerald Combs * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "dfilter-int.h" #include "syntax-tree.h" #include "grammar.h" #include "dfunctions.h" #include "scanner_lex.h" #ifdef _WIN32 /* disable Windows VC compiler warning "signed/unsigned mismatch" associated */ /* with YY_INPUT code generated by flex versions such as 2.5.35. */ #pragma warning (disable:4018) #endif #define LVAL df_lval #define LVAL_TYPE stnode_t* #define LVAL_INIT_VAL NULL #define MODNAME df #define FLEX_YY_PREFIX df_ #include /*#undef YY_NO_UNPUT*/ static int set_lval(int token, gpointer data); static int set_lval_int(int token, char *s); static int simple(int token); static gboolean str_to_gint32(char *s, gint32* pint); GString* quoted_string = NULL; static void mark_lval_deprecated(const char *s); #line 683 "scanner.c" #define INITIAL 0 #define RANGE_INT 1 #define RANGE_PUNCT 2 #define DQUOTE 3 #ifndef YY_NO_UNISTD_H /* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */ #include #endif #ifndef YY_EXTRA_TYPE #define YY_EXTRA_TYPE void * #endif static int yy_init_globals (void ); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int df_wrap (void ); #else extern int df_wrap (void ); #endif #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 #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 fwrite( df_text, df_leng, 1, df_out ) #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 = '*'; \ int n; \ for ( n = 0; n < max_size && \ (c = getc( df_in )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( df_in ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else \ { \ errno=0; \ while ( (result = fread(buf, 1, max_size, df_in))==0 && ferror(df_in)) \ { \ if( errno != EINTR) \ { \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ break; \ } \ errno=0; \ clearerr(df_in); \ } \ }\ \ #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 df_lex (void); #define YY_DECL int df_lex (void) #endif /* !YY_DECL */ /* Code executed at the beginning of each rule, after df_text and df_leng * 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 /** The main scanner function which does all the work. */ YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; #line 82 "scanner.l" #line 840 "scanner.c" if ( !(yy_init) ) { (yy_init) = 1; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! (yy_start) ) (yy_start) = 1; /* first start state */ if ( ! df_in ) df_in = stdin; if ( ! df_out ) df_out = stdout; if ( ! YY_CURRENT_BUFFER ) { df_ensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = df__create_buffer(df_in,YY_BUF_SIZE ); } df__load_buffer_state( ); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = (yy_c_buf_p); /* Support of df_text. */ *yy_cp = (yy_hold_char); /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = (yy_start); yy_match: do { register 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 >= 111 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_current_state != 110 ); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); yy_find_action: yy_act = yy_accept[yy_current_state]; YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = (yy_hold_char); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; case 1: /* rule 1 can match eol */ YY_RULE_SETUP #line 84 "scanner.l" /* ignore whitespace */ YY_BREAK case 2: YY_RULE_SETUP #line 88 "scanner.l" return simple(TOKEN_LPAREN); YY_BREAK case 3: YY_RULE_SETUP #line 89 "scanner.l" return simple(TOKEN_RPAREN); YY_BREAK case 4: YY_RULE_SETUP #line 90 "scanner.l" return simple(TOKEN_COMMA); YY_BREAK case 5: YY_RULE_SETUP #line 92 "scanner.l" return simple(TOKEN_TEST_EQ); YY_BREAK case 6: YY_RULE_SETUP #line 93 "scanner.l" return simple(TOKEN_TEST_EQ); YY_BREAK case 7: YY_RULE_SETUP #line 94 "scanner.l" { mark_lval_deprecated("!="); return simple(TOKEN_TEST_NE); } YY_BREAK case 8: YY_RULE_SETUP #line 98 "scanner.l" { mark_lval_deprecated("ne"); return simple(TOKEN_TEST_NE); } YY_BREAK case 9: YY_RULE_SETUP #line 102 "scanner.l" return simple(TOKEN_TEST_GT); YY_BREAK case 10: YY_RULE_SETUP #line 103 "scanner.l" return simple(TOKEN_TEST_GT); YY_BREAK case 11: YY_RULE_SETUP #line 104 "scanner.l" return simple(TOKEN_TEST_GE); YY_BREAK case 12: YY_RULE_SETUP #line 105 "scanner.l" return simple(TOKEN_TEST_GE); YY_BREAK case 13: YY_RULE_SETUP #line 106 "scanner.l" return simple(TOKEN_TEST_LT); YY_BREAK case 14: YY_RULE_SETUP #line 107 "scanner.l" return simple(TOKEN_TEST_LT); YY_BREAK case 15: YY_RULE_SETUP #line 108 "scanner.l" return simple(TOKEN_TEST_LE); YY_BREAK case 16: YY_RULE_SETUP #line 109 "scanner.l" return simple(TOKEN_TEST_LE); YY_BREAK case 17: YY_RULE_SETUP #line 110 "scanner.l" return simple(TOKEN_TEST_BITWISE_AND); YY_BREAK case 18: YY_RULE_SETUP #line 111 "scanner.l" return simple(TOKEN_TEST_BITWISE_AND); YY_BREAK case 19: YY_RULE_SETUP #line 112 "scanner.l" return simple(TOKEN_TEST_CONTAINS); YY_BREAK case 20: YY_RULE_SETUP #line 113 "scanner.l" return simple(TOKEN_TEST_MATCHES); YY_BREAK case 21: YY_RULE_SETUP #line 114 "scanner.l" return simple(TOKEN_TEST_MATCHES); YY_BREAK case 22: YY_RULE_SETUP #line 115 "scanner.l" return simple(TOKEN_TEST_NOT); YY_BREAK case 23: YY_RULE_SETUP #line 116 "scanner.l" return simple(TOKEN_TEST_NOT); YY_BREAK case 24: YY_RULE_SETUP #line 117 "scanner.l" return simple(TOKEN_TEST_AND); YY_BREAK case 25: YY_RULE_SETUP #line 118 "scanner.l" return simple(TOKEN_TEST_AND); YY_BREAK case 26: YY_RULE_SETUP #line 119 "scanner.l" return simple(TOKEN_TEST_OR); YY_BREAK case 27: YY_RULE_SETUP #line 120 "scanner.l" return simple(TOKEN_TEST_OR); YY_BREAK case 28: YY_RULE_SETUP #line 123 "scanner.l" { BEGIN(RANGE_INT); return simple(TOKEN_LBRACKET); } YY_BREAK case 29: YY_RULE_SETUP #line 128 "scanner.l" { BEGIN(RANGE_PUNCT); return set_lval_int(TOKEN_INTEGER, df_text); } YY_BREAK case 30: YY_RULE_SETUP #line 133 "scanner.l" { BEGIN(RANGE_PUNCT); return set_lval_int(TOKEN_INTEGER, df_text); } YY_BREAK case 31: YY_RULE_SETUP #line 138 "scanner.l" { BEGIN(RANGE_INT); return simple(TOKEN_COLON); } YY_BREAK case 32: YY_RULE_SETUP #line 143 "scanner.l" { BEGIN(RANGE_INT); return simple(TOKEN_HYPHEN); } YY_BREAK case 33: YY_RULE_SETUP #line 148 "scanner.l" { BEGIN(RANGE_INT); return simple(TOKEN_COMMA); } YY_BREAK case 34: YY_RULE_SETUP #line 153 "scanner.l" { BEGIN(INITIAL); return simple(TOKEN_RBRACKET); } YY_BREAK /* Error if none of the above while scanning a range (slice) */ case 35: /* rule 35 can match eol */ YY_RULE_SETUP #line 160 "scanner.l" { dfilter_fail("Invalid string \"%s\" found while scanning slice.", df_text); return SCAN_FAILED; } YY_BREAK /* XXX It would be nice to be able to match an entire non-integer string, * but beware of Flex's "match the most text" rule. */ case 36: YY_RULE_SETUP #line 169 "scanner.l" { dfilter_fail("Invalid character \"%s\" found while scanning slice; expected integer.", df_text); return SCAN_FAILED; } YY_BREAK case 37: YY_RULE_SETUP #line 174 "scanner.l" { /* start quote */ /* The example of how to scan for strings was taken from the flex 2.5.4 manual, from the section "Start Conditions". See: http://www.gnu.org/software/flex/manual/html_node/flex_11.html */ BEGIN(DQUOTE); /* A previous filter that failed to compile due to a missing end quote will have left quoted_string set to something. Clear it now that we are starting a new quoted string. */ if (quoted_string) { g_string_free(quoted_string, TRUE); /* Don't set quoted_string to NULL, as we do in other quoted_string-cleanup code, as we're about to set it in the next line. */ } quoted_string = g_string_new(""); } YY_BREAK case YY_STATE_EOF(DQUOTE): #line 195 "scanner.l" { /* unterminated string */ /* The example of how to handle unclosed strings was taken from the flex 2.5.4 manual, from the section "End-of-file rules". See: http://www.gnu.org/software/flex/manual/html_node/flex_13.html */ dfilter_fail("The final quote was missing from a quoted string."); return SCAN_FAILED; } YY_BREAK case 38: YY_RULE_SETUP #line 206 "scanner.l" { /* end quote */ int token; BEGIN(INITIAL); token = set_lval(TOKEN_STRING, quoted_string->str); g_string_free(quoted_string, TRUE); quoted_string = NULL; return token; } YY_BREAK case 39: YY_RULE_SETUP #line 216 "scanner.l" { /* octal sequence */ unsigned int result; sscanf(df_text + 1, "%o", &result); if (result > 0xff) { g_string_free(quoted_string, TRUE); quoted_string = NULL; dfilter_fail("%s is larger than 255.", df_text); return SCAN_FAILED; } g_string_append_c(quoted_string, (gchar) result); } YY_BREAK case 40: YY_RULE_SETUP #line 229 "scanner.l" { /* hex sequence */ unsigned int result; sscanf(df_text + 2, "%x", &result); g_string_append_c(quoted_string, (gchar) result); } YY_BREAK case 41: YY_RULE_SETUP #line 237 "scanner.l" { /* escaped character */ g_string_append_c(quoted_string, df_text[1]); } YY_BREAK case 42: /* rule 42 can match eol */ YY_RULE_SETUP #line 242 "scanner.l" { /* non-escaped string */ g_string_append(quoted_string, df_text); } YY_BREAK case 43: YY_RULE_SETUP #line 249 "scanner.l" { /* CIDR */ return set_lval(TOKEN_UNPARSED, df_text); } YY_BREAK case 44: YY_RULE_SETUP #line 254 "scanner.l" { /* Is it a field name? */ header_field_info *hfinfo; df_func_def_t *df_func_def; hfinfo = proto_registrar_get_byname(df_text); if (hfinfo) { /* Yes, it's a field name */ return set_lval(TOKEN_FIELD, hfinfo); } else { /* Is it a function name? */ df_func_def = df_func_lookup(df_text); if (df_func_def) { /* yes, it's a dfilter function */ return set_lval(TOKEN_FUNCTION, df_func_def); } else { /* No, so treat it as an unparsed string */ return set_lval(TOKEN_UNPARSED, df_text); } } } YY_BREAK case 45: YY_RULE_SETUP #line 278 "scanner.l" { /* Default */ return set_lval(TOKEN_UNPARSED, df_text); } YY_BREAK case 46: YY_RULE_SETUP #line 284 "scanner.l" ECHO; YY_BREAK #line 1279 "scanner.c" case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(RANGE_INT): case YY_STATE_EOF(RANGE_PUNCT): 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 df_in at a new source and called * df_lex(). 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 = df_in; 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_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; } } else switch ( yy_get_next_buffer( ) ) { case EOB_ACT_END_OF_FILE: { (yy_did_buffer_switch_on_eof) = 0; if ( df_wrap( ) ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * df_text, 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 df_lex */ /* 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) { register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; register char *source = (yytext_ptr); register 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; 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. */ df_realloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->yy_ch_buf = 0; if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), (yy_n_chars), (size_t) 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; df_restart(df_in ); } else { ret_val = EOB_ACT_LAST_MATCH; YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { /* Extend the array by 50%, plus the number we really need. */ yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) df_realloc((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) { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = (yy_start); for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) { register 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 >= 111 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) { register int yy_is_jam; register char *yy_cp = (yy_c_buf_p); register 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 >= 111 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 110); return yy_is_jam ? 0 : yy_current_state; } #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. */ df_restart(df_in ); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( df_wrap( ) ) return EOF; if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + offset; break; } } } c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ *(yy_c_buf_p) = '\0'; /* preserve df_text */ (yy_hold_char) = *++(yy_c_buf_p); return c; } #endif /* ifndef YY_NO_INPUT */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * * @note This function does not reset the start condition to @c INITIAL . */ void df_restart (FILE * input_file ) { if ( ! YY_CURRENT_BUFFER ){ df_ensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = df__create_buffer(df_in,YY_BUF_SIZE ); } df__init_buffer(YY_CURRENT_BUFFER,input_file ); df__load_buffer_state( ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ void df__switch_to_buffer (YY_BUFFER_STATE new_buffer ) { /* TODO. We should be able to replace this entire function body * with * df_pop_buffer_state(); * df_push_buffer_state(new_buffer); */ df_ensure_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; df__load_buffer_state( ); /* We don't actually know whether we did this switch during * EOF (df_wrap()) processing, but the only time this flag * is looked at is after df_wrap() is called, so it's safe * to go ahead and always set it. */ (yy_did_buffer_switch_on_eof) = 1; } static void df__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; df_in = 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 df__create_buffer (FILE * file, int size ) { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) df_alloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in df__create_buffer()" ); b->yy_buf_size = 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 *) df_alloc(b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in df__create_buffer()" ); b->yy_is_our_buffer = 1; df__init_buffer(b,file ); return b; } /** Destroy the buffer. * @param b a buffer created with df__create_buffer() * */ void df__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 ) df_free((void *) b->yy_ch_buf ); df_free((void *) b ); } /* Initializes or reinitializes a buffer. * This function is sometimes called more than once on the same buffer, * such as during a df_restart() or at EOF. */ static void df__init_buffer (YY_BUFFER_STATE b, FILE * file ) { int oerrno = errno; df__flush_buffer(b ); b->yy_input_file = file; b->yy_fill_buffer = 1; /* If b is the current buffer, then df__init_buffer was _probably_ * called from df_restart() 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 = 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 df__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 ) df__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 df_push_buffer_state (YY_BUFFER_STATE new_buffer ) { if (new_buffer == NULL) return; df_ensure_buffer_stack(); /* This block is copied from df__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 df__switch_to_buffer. */ df__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 df_pop_buffer_state (void) { if (!YY_CURRENT_BUFFER) return; df__delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; if ((yy_buffer_stack_top) > 0) --(yy_buffer_stack_top); if (YY_CURRENT_BUFFER) { df__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 df_ensure_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; (yy_buffer_stack) = (struct yy_buffer_state**)df_alloc (num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in df_ensure_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. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = (yy_buffer_stack_max) + grow_size; (yy_buffer_stack) = (struct yy_buffer_state**)df_realloc ((yy_buffer_stack), num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in df_ensure_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 df__scan_buffer (char * base, yy_size_t size ) { YY_BUFFER_STATE b; if ( size < 2 || base[size-2] != YY_END_OF_BUFFER_CHAR || base[size-1] != YY_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (YY_BUFFER_STATE) df_alloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in df__scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; df__switch_to_buffer(b ); return b; } /** Setup the input buffer state to scan a string. The next call to df_lex() 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 * df__scan_bytes() instead. */ YY_BUFFER_STATE df__scan_string (yyconst char * yystr ) { return df__scan_bytes(yystr,strlen(yystr) ); } /** Setup the input buffer state to scan the given bytes. The next call to df_lex() will * scan from a @e copy of @a bytes. * @param bytes the byte buffer to scan * @param len the number of bytes in the buffer pointed to by @a bytes. * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE df__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 = _yybytes_len + 2; buf = (char *) df_alloc(n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in df__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 = df__scan_buffer(buf,n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in df__scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif static void yy_fatal_error (yyconst char* msg ) { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up df_text. */ \ int yyless_macro_arg = (n); \ YY_LESS_LINENO(yyless_macro_arg);\ df_text[df_leng] = (yy_hold_char); \ (yy_c_buf_p) = df_text + yyless_macro_arg; \ (yy_hold_char) = *(yy_c_buf_p); \ *(yy_c_buf_p) = '\0'; \ df_leng = yyless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /** Get the current line number. * */ int df_get_lineno (void) { return df_lineno; } /** Get the input stream. * */ FILE *df_get_in (void) { return df_in; } /** Get the output stream. * */ FILE *df_get_out (void) { return df_out; } /** Get the length of the current token. * */ int df_get_leng (void) { return df_leng; } /** Get the current token. * */ char *df_get_text (void) { return df_text; } /** Set the current line number. * @param line_number * */ void df_set_lineno (int line_number ) { df_lineno = line_number; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * * @see df__switch_to_buffer */ void df_set_in (FILE * in_str ) { df_in = in_str ; } void df_set_out (FILE * out_str ) { df_out = out_str ; } int df_get_debug (void) { return df__flex_debug; } void df_set_debug (int bdebug ) { df__flex_debug = bdebug ; } static int yy_init_globals (void) { /* Initialization is the same as for the non-reentrant scanner. * This function is called from df_lex_destroy(), so don't allocate here. */ (yy_buffer_stack) = 0; (yy_buffer_stack_top) = 0; (yy_buffer_stack_max) = 0; (yy_c_buf_p) = (char *) 0; (yy_init) = 0; (yy_start) = 0; /* Defined in main.c */ #ifdef YY_STDINIT df_in = stdin; df_out = stdout; #else df_in = (FILE *) 0; df_out = (FILE *) 0; #endif /* For future reference: Set errno on error, since we are called by * df_lex_init() */ return 0; } /* df_lex_destroy is for both reentrant and non-reentrant scanners. */ int df_lex_destroy (void) { /* Pop the buffer stack, destroying each element. */ while(YY_CURRENT_BUFFER){ df__delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; df_pop_buffer_state(); } /* Destroy the stack itself. */ df_free((yy_buffer_stack) ); (yy_buffer_stack) = NULL; /* Reset the globals. This is important in a non-reentrant scanner so the next time * df_lex() 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 ) { register 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 ) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *df_alloc (yy_size_t size ) { return (void *) malloc( size ); } void *df_realloc (void * ptr, yy_size_t size ) { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } void df_free (void * ptr ) { free( (char *) ptr ); /* see df_realloc() for (char *) cast */ } #define YYTABLES_NAME "yytables" #line 284 "scanner.l" static int simple(int token) { switch (token) { case TOKEN_LPAREN: case TOKEN_RPAREN: case TOKEN_LBRACKET: case TOKEN_RBRACKET: case TOKEN_COLON: case TOKEN_COMMA: case TOKEN_HYPHEN: case TOKEN_TEST_EQ: case TOKEN_TEST_NE: case TOKEN_TEST_GT: case TOKEN_TEST_GE: case TOKEN_TEST_LT: case TOKEN_TEST_LE: case TOKEN_TEST_BITWISE_AND: case TOKEN_TEST_CONTAINS: case TOKEN_TEST_MATCHES: case TOKEN_TEST_NOT: case TOKEN_TEST_AND: case TOKEN_TEST_OR: break; default: g_assert_not_reached(); } return token; } static int set_lval(int token, gpointer data) { sttype_id_t type_id = STTYPE_UNINITIALIZED; switch (token) { case TOKEN_STRING: type_id = STTYPE_STRING; break; case TOKEN_FIELD: type_id = STTYPE_FIELD; break; case TOKEN_UNPARSED: type_id = STTYPE_UNPARSED; break; case TOKEN_FUNCTION: type_id = STTYPE_FUNCTION; break; default: g_assert_not_reached(); } stnode_init(df_lval, type_id, data); return token; } static int set_lval_int(int token, char *s) { sttype_id_t type_id = STTYPE_UNINITIALIZED; gint32 val; if (!str_to_gint32(s, &val)) { return SCAN_FAILED; } switch (token) { case TOKEN_INTEGER: type_id = STTYPE_INTEGER; break; default: g_assert_not_reached(); } stnode_init_int(df_lval, type_id, val); return token; } static gboolean str_to_gint32(char *s, gint32* pint) { char *endptr; long integer; errno = 0; integer = strtol(s, &endptr, 0); if (errno == EINVAL || endptr == s || *endptr != '\0') { /* This isn't a valid number. */ dfilter_fail("\"%s\" is not a valid number.", s); return FALSE; } if (errno == ERANGE) { if (integer == LONG_MAX) { dfilter_fail("\"%s\" causes an integer overflow.", s); } else if (integer == LONG_MIN) { dfilter_fail("\"%s\" causes an integer underflow.", s); } else { /* * XXX - can "strtol()" set errno to ERANGE without * returning LONG_MAX or LONG_MIN? */ dfilter_fail("\"%s\" is not an integer.", s); } return FALSE; } if (integer > G_MAXINT32) { /* * Fits in a long, but not in a gint32 (a long might be * 64 bits). */ dfilter_fail("\"%s\" causes an integer overflow.", s); return FALSE; } if (integer < G_MININT32) { /* * Fits in a long, but not in a gint32 (a long might be * 64 bits). */ dfilter_fail("\"%s\" causes an integer underflow.", s); return FALSE; } *pint = integer; return TRUE; } static void mark_lval_deprecated(const char *s) { df_lval->deprecated_token = s; } #include