#define yy_create_buffer probeconfscan__create_buffer #define yy_delete_buffer probeconfscan__delete_buffer #define yy_scan_buffer probeconfscan__scan_buffer #define yy_scan_string probeconfscan__scan_string #define yy_scan_bytes probeconfscan__scan_bytes #define yy_flex_debug probeconfscan__flex_debug #define yy_init_buffer probeconfscan__init_buffer #define yy_flush_buffer probeconfscan__flush_buffer #define yy_load_buffer_state probeconfscan__load_buffer_state #define yy_switch_to_buffer probeconfscan__switch_to_buffer #define yyin probeconfscan_in #define yyleng probeconfscan_leng #define yylex probeconfscan_lex #define yyout probeconfscan_out #define yyrestart probeconfscan_restart #define yytext probeconfscan_text #line 19 "probeconfscan.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 #include /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #include /* 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 #include #define YY_USE_CONST #define YY_USE_PROTOS #endif #ifdef YY_USE_CONST #define yyconst const #else #define 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 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 yyrestart( yyin ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #define YY_BUF_SIZE 16384 typedef struct yy_buffer_state *YY_BUFFER_STATE; extern int yyleng; extern FILE *yyin, *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 ) * 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 yyless() call. */ /* Return all but the first 'n' matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ *yy_cp = yy_hold_char; \ YY_RESTORE_YY_MORE_OFFSET \ yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext 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). */ typedef unsigned int yy_size_t; 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; /* 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 yyrestart()), so that the user can continue scanning by * just pointing yyin at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; static YY_BUFFER_STATE 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 yy_current_buffer /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 1; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void yyrestart YY_PROTO(( FILE *input_file )); void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); void yy_load_buffer_state YY_PROTO(( void )); YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); static void *yy_flex_alloc YY_PROTO(( yy_size_t )); static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); static void yy_flex_free YY_PROTO(( void * )); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (yy_current_buffer->yy_at_bol) #define yywrap() 1 #define YY_SKIP_YYWRAP typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern char yytext[]; static yy_state_type yy_get_previous_state YY_PROTO(( void )); static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); static int yy_get_next_buffer YY_PROTO(( void )); static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ yytext_ptr = yy_bp; \ yyleng = (int) (yy_cp - yy_bp); \ yy_hold_char = *yy_cp; \ *yy_cp = '\0'; \ if ( yyleng >= YYLMAX ) \ YY_FATAL_ERROR( "token too large, exceeds YYLMAX" ); \ yy_flex_strncpy( yytext, yytext_ptr, yyleng + 1 ); \ yy_c_buf_p = yy_cp; #define YY_NUM_RULES 34 #define YY_END_OF_BUFFER 35 static yyconst short int yy_accept[235] = { 0, 0, 0, 0, 0, 0, 0, 35, 27, 1, 4, 27, 27, 27, 27, 27, 27, 27, 27, 27, 33, 1, 5, 33, 30, 29, 29, 34, 1, 34, 34, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 29, 29, 32, 1, 32, 31, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 0, 29, 7, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 23, 0, 0, 28, 8, 0, 9, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 22, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 0, 0, 0, 0, 0, 0, 14, 15, 0, 19, 24, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 0, 0, 0, 16, 0 } ; static yyconst int yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 7, 1, 8, 9, 10, 11, 12, 13, 14, 15, 16, 7, 17, 18, 19, 20, 21, 22, 7, 23, 24, 25, 26, 7, 7, 27, 28, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 int yy_meta[29] = { 0, 1, 1, 2, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 } ; static yyconst short int yy_base[244] = { 0, 0, 0, 28, 51, 74, 79, 513, 514, 510, 514, 508, 504, 28, 29, 33, 42, 38, 30, 31, 514, 507, 514, 505, 514, 0, 495, 0, 504, 502, 0, 502, 500, 514, 34, 496, 35, 54, 43, 40, 79, 80, 81, 60, 83, 498, 514, 0, 481, 0, 497, 495, 0, 84, 61, 64, 490, 66, 484, 89, 88, 90, 94, 86, 465, 102, 105, 95, 106, 110, 112, 115, 463, 113, 117, 114, 462, 116, 449, 126, 127, 128, 119, 146, 134, 135, 139, 153, 137, 458, 155, 154, 143, 443, 136, 156, 162, 454, 514, 165, 189, 434, 63, 166, 167, 180, 178, 174, 213, 428, 219, 168, 196, 172, 231, 514, 192, 222, 197, 181, 201, 169, 206, 204, 219, 514, 233, 426, 514, 202, 236, 235, 239, 514, 203, 240, 241, 242, 265, 244, 250, 272, 245, 252, 412, 278, 247, 284, 275, 396, 393, 308, 281, 514, 286, 287, 514, 392, 294, 0, 514, 289, 514, 340, 288, 305, 300, 514, 298, 326, 332, 329, 296, 345, 353, 297, 318, 323, 319, 514, 514, 335, 342, 514, 369, 346, 352, 349, 347, 354, 338, 377, 359, 360, 361, 362, 291, 378, 514, 381, 405, 411, 351, 417, 423, 389, 514, 514, 420, 514, 514, 444, 382, 387, 514, 385, 386, 253, 424, 426, 388, 414, 427, 311, 452, 431, 514, 445, 391, 453, 455, 437, 470, 514, 514, 476, 479, 482, 265, 485, 173, 488, 491, 494 } ; static yyconst short int yy_def[244] = { 0, 234, 1, 235, 235, 236, 236, 234, 234, 234, 234, 237, 238, 238, 238, 238, 238, 238, 238, 238, 234, 234, 234, 239, 234, 240, 240, 241, 241, 242, 243, 234, 237, 234, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 239, 234, 240, 240, 241, 241, 242, 243, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 240, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 240, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 240, 238, 238, 238, 238, 234, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 240, 83, 238, 238, 238, 238, 234, 100, 238, 238, 238, 238, 238, 238, 238, 238, 234, 238, 240, 234, 238, 238, 238, 238, 234, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 240, 238, 238, 238, 238, 238, 238, 238, 238, 234, 238, 238, 234, 238, 238, 240, 234, 238, 234, 147, 238, 238, 238, 234, 238, 238, 238, 238, 238, 147, 238, 238, 238, 238, 238, 234, 234, 238, 238, 234, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 234, 238, 238, 238, 238, 238, 238, 238, 234, 234, 238, 234, 234, 238, 238, 238, 234, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 238, 234, 238, 238, 238, 238, 238, 238, 234, 0, 234, 234, 234, 234, 234, 234, 234, 234, 234 } ; static yyconst short int yy_nxt[543] = { 0, 8, 9, 10, 11, 8, 12, 12, 13, 12, 14, 12, 12, 12, 12, 12, 15, 12, 16, 12, 12, 12, 17, 18, 19, 12, 12, 12, 12, 20, 21, 22, 23, 24, 34, 34, 34, 34, 36, 34, 34, 34, 43, 44, 34, 54, 34, 37, 34, 34, 53, 26, 20, 21, 22, 23, 24, 38, 39, 41, 34, 42, 55, 40, 57, 56, 34, 34, 62, 34, 34, 118, 34, 67, 26, 27, 28, 10, 29, 27, 27, 28, 10, 29, 27, 34, 34, 34, 68, 34, 34, 70, 34, 58, 34, 34, 34, 60, 59, 74, 34, 34, 61, 63, 65, 76, 66, 72, 34, 73, 77, 34, 34, 79, 81, 75, 34, 82, 34, 34, 34, 34, 34, 34, 85, 34, 84, 80, 86, 89, 83, 53, 34, 34, 34, 90, 88, 92, 94, 95, 34, 34, 34, 34, 97, 34, 96, 98, 98, 34, 98, 98, 34, 104, 65, 101, 100, 102, 99, 34, 34, 34, 34, 110, 103, 106, 108, 107, 34, 53, 53, 34, 34, 34, 34, 34, 47, 139, 34, 111, 34, 130, 119, 112, 34, 132, 34, 34, 53, 114, 115, 115, 120, 115, 115, 34, 53, 124, 81, 123, 121, 35, 34, 34, 137, 122, 131, 34, 34, 34, 34, 136, 34, 116, 125, 125, 35, 125, 125, 126, 128, 128, 141, 128, 128, 34, 145, 149, 34, 138, 134, 129, 133, 133, 140, 133, 133, 34, 53, 34, 142, 34, 34, 135, 146, 34, 34, 34, 34, 53, 34, 34, 147, 34, 152, 143, 34, 161, 34, 34, 150, 219, 148, 154, 157, 151, 153, 153, 35, 153, 153, 34, 155, 156, 156, 158, 156, 156, 34, 160, 160, 34, 160, 160, 34, 162, 162, 34, 162, 162, 34, 168, 34, 34, 34, 34, 164, 34, 169, 170, 34, 173, 34, 34, 34, 182, 34, 174, 163, 167, 167, 34, 167, 167, 34, 172, 53, 225, 186, 203, 175, 53, 176, 178, 34, 34, 177, 179, 179, 34, 179, 179, 34, 180, 180, 34, 180, 180, 34, 187, 189, 34, 181, 188, 34, 53, 183, 183, 34, 183, 183, 190, 34, 34, 191, 34, 197, 208, 34, 185, 34, 192, 53, 195, 35, 34, 34, 34, 34, 184, 183, 183, 194, 183, 183, 34, 193, 196, 198, 198, 199, 198, 198, 34, 34, 200, 201, 34, 34, 202, 204, 34, 34, 34, 34, 34, 218, 34, 171, 166, 222, 229, 165, 215, 217, 205, 206, 206, 216, 206, 206, 34, 207, 207, 211, 207, 207, 34, 209, 209, 34, 209, 209, 34, 210, 210, 34, 210, 210, 34, 34, 212, 34, 34, 223, 159, 53, 34, 144, 127, 117, 220, 221, 34, 213, 214, 214, 53, 214, 214, 34, 34, 224, 226, 226, 227, 226, 226, 34, 34, 113, 34, 232, 109, 105, 93, 228, 231, 91, 87, 230, 233, 233, 78, 233, 233, 34, 25, 25, 25, 30, 30, 30, 32, 32, 32, 45, 45, 45, 49, 71, 49, 51, 51, 51, 52, 69, 52, 33, 50, 64, 46, 34, 33, 31, 33, 50, 48, 46, 31, 34, 33, 31, 234, 7, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234 } ; static yyconst short int yy_chk[543] = { 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, 3, 3, 3, 3, 3, 13, 14, 18, 19, 13, 15, 34, 36, 18, 19, 17, 36, 39, 14, 16, 38, 34, 3, 4, 4, 4, 4, 4, 15, 16, 17, 37, 17, 37, 16, 39, 38, 43, 54, 43, 102, 55, 102, 57, 54, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 40, 41, 42, 55, 44, 53, 57, 63, 40, 60, 59, 61, 42, 41, 61, 62, 67, 42, 44, 53, 62, 53, 59, 65, 60, 63, 66, 68, 65, 66, 61, 69, 67, 70, 73, 75, 71, 77, 74, 70, 82, 69, 65, 71, 74, 68, 71, 79, 80, 81, 75, 73, 77, 79, 80, 84, 85, 94, 88, 82, 86, 81, 83, 83, 92, 83, 83, 83, 88, 84, 85, 84, 86, 83, 87, 91, 90, 95, 94, 87, 90, 92, 91, 96, 87, 91, 99, 103, 104, 111, 121, 240, 121, 113, 95, 107, 111, 103, 96, 106, 113, 105, 119, 113, 99, 100, 100, 104, 100, 100, 100, 105, 107, 100, 106, 105, 116, 112, 118, 119, 105, 112, 120, 129, 134, 123, 118, 122, 100, 108, 108, 116, 108, 108, 108, 110, 110, 123, 110, 110, 124, 129, 134, 117, 120, 117, 110, 114, 114, 122, 114, 114, 114, 117, 126, 124, 131, 130, 117, 130, 132, 135, 136, 137, 126, 139, 142, 131, 146, 137, 126, 140, 146, 143, 217, 135, 217, 132, 139, 142, 136, 138, 138, 238, 138, 138, 138, 140, 141, 141, 143, 141, 141, 141, 145, 145, 148, 145, 145, 145, 147, 147, 152, 147, 147, 147, 152, 154, 155, 164, 161, 148, 196, 154, 155, 158, 161, 172, 175, 168, 172, 166, 164, 147, 151, 151, 165, 151, 151, 151, 158, 166, 223, 175, 196, 165, 165, 166, 168, 176, 178, 166, 169, 169, 177, 169, 169, 169, 170, 170, 171, 170, 170, 170, 176, 178, 181, 171, 177, 190, 171, 173, 173, 182, 173, 173, 181, 185, 188, 182, 187, 190, 202, 186, 174, 189, 185, 185, 188, 163, 192, 193, 194, 195, 173, 184, 184, 187, 184, 184, 184, 186, 189, 191, 191, 192, 191, 191, 191, 197, 193, 194, 199, 212, 195, 197, 215, 216, 213, 220, 205, 216, 228, 157, 150, 220, 228, 149, 212, 215, 199, 200, 200, 213, 200, 200, 200, 201, 201, 205, 201, 201, 201, 203, 203, 221, 203, 203, 203, 204, 204, 208, 204, 204, 204, 218, 208, 219, 222, 221, 144, 208, 225, 127, 109, 101, 218, 219, 231, 208, 211, 211, 225, 211, 211, 211, 227, 222, 224, 224, 225, 224, 224, 224, 229, 97, 230, 231, 93, 89, 78, 227, 230, 76, 72, 229, 232, 232, 64, 232, 232, 232, 235, 235, 235, 236, 236, 236, 237, 237, 237, 239, 239, 239, 241, 58, 241, 242, 242, 242, 243, 56, 243, 51, 50, 48, 45, 35, 32, 31, 29, 28, 26, 23, 21, 12, 11, 9, 7, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234, 234 } ; static yy_state_type yy_last_accepting_state; static char *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 yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET #ifndef YYLMAX #define YYLMAX 8192 #endif char yytext[YYLMAX]; char *yytext_ptr; #line 1 "probeconfscan.l" #define INITIAL 0 /* force yytext to be an array; Solaris lex requires this first */ #line 4 "probeconfscan.l" /* ** Copyright (C) 2005-2007 by Carnegie Mellon University. ** ** @OPENSOURCE_HEADER_START@ ** ** Use of the SILK system and related source code is subject to the terms ** of the following licenses: ** ** GNU Public License (GPL) Rights pursuant to Version 2, June 1991 ** Government Purpose License Rights (GPLR) pursuant to DFARS 252.225-7013 ** ** NO WARRANTY ** ** ANY INFORMATION, MATERIALS, SERVICES, INTELLECTUAL PROPERTY OR OTHER ** PROPERTY OR RIGHTS GRANTED OR PROVIDED BY CARNEGIE MELLON UNIVERSITY ** PURSUANT TO THIS LICENSE (HEREINAFTER THE "DELIVERABLES") ARE ON AN ** "AS-IS" BASIS. CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY ** KIND, EITHER EXPRESS OR IMPLIED AS TO ANY MATTER INCLUDING, BUT NOT ** LIMITED TO, WARRANTY OF FITNESS FOR A PARTICULAR PURPOSE, ** MERCHANTABILITY, INFORMATIONAL CONTENT, NONINFRINGEMENT, OR ERROR-FREE ** OPERATION. CARNEGIE MELLON UNIVERSITY SHALL NOT BE LIABLE FOR INDIRECT, ** SPECIAL OR CONSEQUENTIAL DAMAGES, SUCH AS LOSS OF PROFITS OR INABILITY ** TO USE SAID INTELLECTUAL PROPERTY, UNDER THIS LICENSE, REGARDLESS OF ** WHETHER SUCH PARTY WAS AWARE OF THE POSSIBILITY OF SUCH DAMAGES. ** LICENSEE AGREES THAT IT WILL NOT MAKE ANY WARRANTY ON BEHALF OF ** CARNEGIE MELLON UNIVERSITY, EXPRESS OR IMPLIED, TO ANY PERSON ** CONCERNING THE APPLICATION OF OR THE RESULTS TO BE OBTAINED WITH THE ** DELIVERABLES UNDER THIS LICENSE. ** ** Licensee hereby agrees to defend, indemnify, and hold harmless Carnegie ** Mellon University, its trustees, officers, employees, and agents from ** all claims or demands made against them (and any related losses, ** expenses, or attorney's fees) arising out of, or relating to Licensee's ** and/or its sub licensees' negligent use or willful misuse of or ** negligent conduct or willful misconduct regarding the Software, ** facilities, or other rights or assistance granted by Carnegie Mellon ** University under this License, including, but not limited to, any ** claims of product liability, personal injury, death, damage to ** property, or violation of any laws or regulations. ** ** Carnegie Mellon University Software Engineering Institute authored ** documents are sponsored by the U.S. Department of Defense under ** Contract F19628-00-C-0003. Carnegie Mellon University retains ** copyrights in all material produced under this contract. The U.S. ** Government retains a non-exclusive, royalty-free license to publish or ** reproduce these documents, or allow others to do so, for U.S. ** Government purposes only pursuant to the copyright license under the ** contract clause at 252.227.7013. ** ** @OPENSOURCE_HEADER_END@ */ /* ** Tokenizer for probe configuration file. ** */ #include "silk.h" RCSIDENT("$SiLK: probeconfscan.l 7569 2007-06-18 16:08:47Z mthomas $"); #include "probeconfscan.h" #include "probeconfparse.h" /* EXPORTED VARIABLES */ /* current file name */ const char *probescan_filename; /* Global error count for return status of probeConfParse */ int g_probe_err; /* current line number */ int probescan_line; /* keyword we read; for printing messages in the parser. */ char probescan_clause[128]; /* LOCAL FUNCTIONS */ static int stash(int tok); static int ifname_to_tok(void); static void err_bad_line(int is_id); #define YY_NEVER_INTERACTIVE 1 /* create a state that says we have read a keyword and are parsing a * clause */ #define CLAUSE 1 /* create a state for an unrecognized keyword */ #define BADLINE 2 /* basic character classes */ /* an ID must have at least one non-number character; note that this * must also match hostnames and IP addresses */ /* comment; ignore, and increment line count */ /* whitespace; we ignore it */ /* end of line; increment line count */ #line 692 "probeconfscan.c" /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap YY_PROTO(( void )); #else extern int yywrap YY_PROTO(( void )); #endif #endif #ifndef YY_NO_UNPUT static void yyunput YY_PROTO(( int c, char *buf_ptr )); #endif #ifndef yytext_ptr static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen YY_PROTO(( yyconst char * )); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput YY_PROTO(( void )); #else static int input YY_PROTO(( void )); #endif #endif #if YY_STACK_USED static int yy_start_stack_ptr = 0; static int yy_start_stack_depth = 0; static int *yy_start_stack = 0; #ifndef YY_NO_PUSH_STATE static void yy_push_state YY_PROTO(( int new_state )); #endif #ifndef YY_NO_POP_STATE static void yy_pop_state YY_PROTO(( void )); #endif #ifndef YY_NO_TOP_STATE static int 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 #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( yytext, yyleng, 1, 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 ( yy_current_buffer->yy_is_interactive ) \ { \ int c = '*', n; \ for ( n = 0; n < max_size && \ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); #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 /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL int yylex YY_PROTO(( void )) #endif /* Code executed at the beginning of each rule, after yytext and 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 yy_state_type yy_current_state; register char *yy_cp = NULL, *yy_bp = NULL; register int yy_act; #line 129 "probeconfscan.l" #line 846 "probeconfscan.c" if ( yy_init ) { yy_init = 0; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! yy_start ) yy_start = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_load_buffer_state(); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = yy_c_buf_p; /* Support of yytext. */ *yy_cp = yy_hold_char; /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = yy_start; yy_match: do { 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 >= 235 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 514 ); yy_find_action: yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = yy_hold_char; yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; goto yy_find_action; case 1: YY_RULE_SETUP #line 131 "probeconfscan.l" ; YY_BREAK case 2: YY_RULE_SETUP #line 133 "probeconfscan.l" { ++probescan_line; BEGIN(INITIAL); } YY_BREAK case 3: YY_RULE_SETUP #line 135 "probeconfscan.l" { ++probescan_line; BEGIN(INITIAL); return EOL; } YY_BREAK case 4: YY_RULE_SETUP #line 139 "probeconfscan.l" { ++probescan_line; BEGIN(INITIAL); } YY_BREAK case 5: YY_RULE_SETUP #line 141 "probeconfscan.l" { ++probescan_line; BEGIN(INITIAL); return EOL; } YY_BREAK case 6: #line 146 "probeconfscan.l" case 7: #line 147 "probeconfscan.l" case 8: YY_RULE_SETUP #line 147 "probeconfscan.l" { if (ifname_to_tok()) { return INTERFACE; } else { BEGIN(BADLINE); yyless(0); } } YY_BREAK case 9: YY_RULE_SETUP #line 154 "probeconfscan.l" { if (ifname_to_tok()) { return IPBLOCK; } else { BEGIN(BADLINE); yyless(0); } } YY_BREAK case 10: YY_RULE_SETUP #line 161 "probeconfscan.l" { return stash(ACCEPT_FROM_HOST_T); } YY_BREAK case 11: #line 163 "probeconfscan.l" case 12: YY_RULE_SETUP #line 163 "probeconfscan.l" { return stash(CLASS_T); } YY_BREAK case 13: YY_RULE_SETUP #line 164 "probeconfscan.l" { return stash(ISP_IP_T); } YY_BREAK case 14: YY_RULE_SETUP #line 165 "probeconfscan.l" { return stash(LISTEN_AS_HOST_T); } YY_BREAK case 15: YY_RULE_SETUP #line 166 "probeconfscan.l" { return stash(LISTEN_ON_PORT_T); } YY_BREAK case 16: #line 168 "probeconfscan.l" case 17: YY_RULE_SETUP #line 168 "probeconfscan.l" { return stash(LISTEN_ON_USOCKET_T);} YY_BREAK case 18: YY_RULE_SETUP #line 169 "probeconfscan.l" { return stash(LOG_FLAGS_T); } YY_BREAK case 19: YY_RULE_SETUP #line 170 "probeconfscan.l" { return stash(POLL_DIRECTORY_T); } YY_BREAK case 20: YY_RULE_SETUP #line 171 "probeconfscan.l" { return stash(PRIORITY_T); } YY_BREAK case 21: YY_RULE_SETUP #line 172 "probeconfscan.l" { return stash(PROBE_NAME_T); } YY_BREAK case 22: YY_RULE_SETUP #line 173 "probeconfscan.l" { return stash(PROBE_TYPE_T); } YY_BREAK case 23: YY_RULE_SETUP #line 174 "probeconfscan.l" { return stash(PROTOCOL_T); } YY_BREAK case 24: YY_RULE_SETUP #line 175 "probeconfscan.l" { return stash(READ_FROM_FILE_T); } YY_BREAK case 25: YY_RULE_SETUP #line 176 "probeconfscan.l" { return stash(SENSOR_PROBE_T); } YY_BREAK case 26: YY_RULE_SETUP #line 177 "probeconfscan.l" { return stash(SENSOR_T); } YY_BREAK case 27: YY_RULE_SETUP #line 179 "probeconfscan.l" { BEGIN(BADLINE); yyless(0); } YY_BREAK case 28: YY_RULE_SETUP #line 181 "probeconfscan.l" { return REMAINDER_T; } YY_BREAK case 29: YY_RULE_SETUP #line 183 "probeconfscan.l" { yylval.string = yytext; return ID; } YY_BREAK case 30: YY_RULE_SETUP #line 185 "probeconfscan.l" { return COMMA; } YY_BREAK case 31: YY_RULE_SETUP #line 187 "probeconfscan.l" { err_bad_line(1); } YY_BREAK case 32: YY_RULE_SETUP #line 189 "probeconfscan.l" { err_bad_line(0); } YY_BREAK case 33: YY_RULE_SETUP #line 191 "probeconfscan.l" { /* unknown */ return yytext[0]; } YY_BREAK case 34: YY_RULE_SETUP #line 193 "probeconfscan.l" ECHO; YY_BREAK #line 1101 "probeconfscan.c" case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(CLAUSE): case YY_STATE_EOF(BADLINE): 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->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 yyin at a new source and called * yylex(). If so, then we have to assure * consistency between yy_current_buffer and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ yy_n_chars = yy_current_buffer->yy_n_chars; yy_current_buffer->yy_input_file = yyin; yy_current_buffer->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->yy_ch_buf[yy_n_chars] ) { /* This was really a NUL. */ yy_state_type yy_next_state; yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state ); yy_bp = yytext_ptr + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++yy_c_buf_p; yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = yy_c_buf_p; goto yy_find_action; } } else switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { yy_did_buffer_switch_on_eof = 0; if ( yywrap() ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: yy_c_buf_p = &yy_current_buffer->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 yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer() { register char *dest = yy_current_buffer->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->yy_ch_buf[yy_n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( yy_current_buffer->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->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->yy_n_chars = yy_n_chars = 0; else { int num_to_read = yy_current_buffer->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 = 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. */ yy_flex_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->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( (&yy_current_buffer->yy_ch_buf[number_to_move]), yy_n_chars, num_to_read ); yy_current_buffer->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; yyrestart( yyin ); } else { ret_val = EOB_ACT_LAST_MATCH; yy_current_buffer->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; yy_n_chars += number_to_move; yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; yytext_ptr = &yy_current_buffer->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() { 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 >= 235 ) 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 ); */ #ifdef YY_USE_PROTOS static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) #else static yy_state_type yy_try_NUL_trans( yy_current_state ) yy_state_type yy_current_state; #endif { 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 >= 235 ) 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 == 234); return yy_is_jam ? 0 : yy_current_state; } #ifndef YY_NO_UNPUT #ifdef YY_USE_PROTOS static void yyunput( int c, register char *yy_bp ) #else static void yyunput( c, yy_bp ) int c; register char *yy_bp; #endif { register char *yy_cp = yy_c_buf_p; /* undo effects of setting up yytext */ *yy_cp = yy_hold_char; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = yy_n_chars + 2; register char *dest = &yy_current_buffer->yy_ch_buf[ yy_current_buffer->yy_buf_size + 2]; register char *source = &yy_current_buffer->yy_ch_buf[number_to_move]; while ( source > yy_current_buffer->yy_ch_buf ) *--dest = *--source; yy_cp += (int) (dest - source); yy_bp += (int) (dest - source); yy_current_buffer->yy_n_chars = yy_n_chars = yy_current_buffer->yy_buf_size; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--yy_cp = (char) c; yytext_ptr = yy_bp; yy_hold_char = *yy_cp; yy_c_buf_p = yy_cp; } #endif /* ifndef YY_NO_UNPUT */ #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput() #else static int input() #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->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. */ yyrestart( yyin ); /* fall through */ case EOB_ACT_END_OF_FILE: { if ( yywrap() ) return EOF; if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + offset; break; } } } c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ *yy_c_buf_p = '\0'; /* preserve yytext */ yy_hold_char = *++yy_c_buf_p; return c; } #endif /* YY_NO_INPUT */ #ifdef YY_USE_PROTOS void yyrestart( FILE *input_file ) #else void yyrestart( input_file ) FILE *input_file; #endif { if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_init_buffer( yy_current_buffer, input_file ); yy_load_buffer_state(); } #ifdef YY_USE_PROTOS void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) #else void yy_switch_to_buffer( new_buffer ) YY_BUFFER_STATE new_buffer; #endif { 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->yy_buf_pos = yy_c_buf_p; yy_current_buffer->yy_n_chars = yy_n_chars; } yy_current_buffer = new_buffer; yy_load_buffer_state(); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ yy_did_buffer_switch_on_eof = 1; } #ifdef YY_USE_PROTOS void yy_load_buffer_state( void ) #else void yy_load_buffer_state() #endif { yy_n_chars = yy_current_buffer->yy_n_chars; yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; yyin = yy_current_buffer->yy_input_file; yy_hold_char = *yy_c_buf_p; } #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) #else YY_BUFFER_STATE yy_create_buffer( file, size ) FILE *file; int size; #endif { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_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 *) yy_flex_alloc( b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer( b, file ); return b; } #ifdef YY_USE_PROTOS void yy_delete_buffer( YY_BUFFER_STATE b ) #else void yy_delete_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; if ( b == yy_current_buffer ) yy_current_buffer = (YY_BUFFER_STATE) 0; if ( b->yy_is_our_buffer ) yy_flex_free( (void *) b->yy_ch_buf ); yy_flex_free( (void *) b ); } #ifdef YY_USE_PROTOS void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) #else void yy_init_buffer( b, file ) YY_BUFFER_STATE b; FILE *file; #endif { yy_flush_buffer( b ); b->yy_input_file = file; b->yy_fill_buffer = 1; #if YY_ALWAYS_INTERACTIVE b->yy_is_interactive = 1; #else #if YY_NEVER_INTERACTIVE b->yy_is_interactive = 0; #else b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; #endif #endif } #ifdef YY_USE_PROTOS void yy_flush_buffer( YY_BUFFER_STATE b ) #else void yy_flush_buffer( b ) YY_BUFFER_STATE b; #endif { 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 ) yy_load_buffer_state(); } #ifndef YY_NO_SCAN_BUFFER #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) #else YY_BUFFER_STATE yy_scan_buffer( base, size ) char *base; 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) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; yy_switch_to_buffer( b ); return b; } #endif #ifndef YY_NO_SCAN_STRING #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) #else YY_BUFFER_STATE yy_scan_string( yy_str ) yyconst char *yy_str; #endif { int len; for ( len = 0; yy_str[len]; ++len ) ; return yy_scan_bytes( yy_str, len ); } #endif #ifndef YY_NO_SCAN_BYTES #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) #else YY_BUFFER_STATE yy_scan_bytes( bytes, len ) yyconst char *bytes; int len; #endif { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = len + 2; buf = (char *) yy_flex_alloc( n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < len; ++i ) buf[i] = bytes[i]; buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer( buf, n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #endif #ifndef YY_NO_PUSH_STATE #ifdef YY_USE_PROTOS static void yy_push_state( int new_state ) #else static void yy_push_state( new_state ) int new_state; #endif { if ( yy_start_stack_ptr >= yy_start_stack_depth ) { yy_size_t new_size; yy_start_stack_depth += YY_START_STACK_INCR; new_size = yy_start_stack_depth * sizeof( int ); if ( ! yy_start_stack ) yy_start_stack = (int *) yy_flex_alloc( new_size ); else yy_start_stack = (int *) yy_flex_realloc( (void *) yy_start_stack, new_size ); if ( ! yy_start_stack ) YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); } yy_start_stack[yy_start_stack_ptr++] = YY_START; BEGIN(new_state); } #endif #ifndef YY_NO_POP_STATE static void yy_pop_state() { if ( --yy_start_stack_ptr < 0 ) YY_FATAL_ERROR( "start-condition stack underflow" ); BEGIN(yy_start_stack[yy_start_stack_ptr]); } #endif #ifndef YY_NO_TOP_STATE static int yy_top_state() { return yy_start_stack[yy_start_stack_ptr - 1]; } #endif #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif #ifdef YY_USE_PROTOS static void yy_fatal_error( yyconst char msg[] ) #else static void yy_fatal_error( msg ) char msg[]; #endif { (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 yytext. */ \ yytext[yyleng] = yy_hold_char; \ yy_c_buf_p = yytext + n; \ yy_hold_char = *yy_c_buf_p; \ *yy_c_buf_p = '\0'; \ yyleng = n; \ } \ while ( 0 ) /* Internal utility routines. */ #ifndef yytext_ptr #ifdef YY_USE_PROTOS static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) #else static void yy_flex_strncpy( s1, s2, n ) char *s1; 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 yy_flex_strlen( yyconst char *s ) #else static int yy_flex_strlen( s ) yyconst char *s; #endif { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif #ifdef YY_USE_PROTOS static void *yy_flex_alloc( yy_size_t size ) #else static void *yy_flex_alloc( size ) yy_size_t size; #endif { return (void *) malloc( size ); } #ifdef YY_USE_PROTOS static void *yy_flex_realloc( void *ptr, yy_size_t size ) #else static void *yy_flex_realloc( ptr, size ) void *ptr; 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 yy_flex_free( void *ptr ) #else static void yy_flex_free( ptr ) void *ptr; #endif { free( ptr ); } #if YY_MAIN int main() { yylex(); return 0; } #endif #line 193 "probeconfscan.l" /* * stash(int) * * Stash the current keyword (using the yyleng and yytext * globals), put us into a CLAUSE start-state, and return the * value we were passed. */ static int stash(int tok) { /* make certain the keyword fits in our buffer */ assert(yyleng < ((int)sizeof(probescan_clause))); /* copy it in */ strcpy(probescan_clause, yytext); /* remember we got an extra character, so terminate the keyword a * character earlier, and unput that character */ probescan_clause[yyleng-1] = '\0'; unput(yytext[yyleng-1]); /* we're starting a clause */ BEGIN(CLAUSE); /* return whatever we were passed */ return tok; } /* * found_an_id = ifname_to_tok(); * * Called when the scanner reads an -interface, -index, * or -ipblock line. This function checks if is a known * ifmap_group_id_name. If it is, yylval is set to the * ifmap_group_id and 1 is returned. When not found, 0 is * returned. * * When called, 'yytext' contains the entire -index phrase. */ static int ifname_to_tok(void) { static int len[NUM_IFMAPS]; size_t i; int found_it = 0; /* Keep a static structure of string lengths since we use this * often. */ if (!len[0]) { for (i = 0; i < NUM_IFMAPS; ++i) { len[i] = (int)strlen(ifmap_group_id_name[i]); } } /* Compare the names */ for (i = 0; i < NUM_IFMAPS; ++i) { if ((yyleng > len[i]) && (yytext[(len[i])] == '-') && (0 == strncmp(ifmap_group_id_name[i], yytext, len[i]))) { yylval.u32 = i; found_it = 1; break; } } /* Return if not found */ if ( !found_it) { goto END; } /* make certain the keyword fits in our buffer */ assert(yyleng < ((int)sizeof(probescan_clause))); /* copy it in */ strcpy(probescan_clause, yytext); /* remember we got an extra character, so terminate the keyword a * character earlier, and unput that character */ probescan_clause[yyleng-1] = '\0'; unput(yytext[yyleng-1]); /* we're starting a clause */ BEGIN(CLAUSE); /* return result of looking for token */ END: return found_it; } /* * err_bad_line(is_id); * * Called when the scanner reads a bad line of input. This * function prints an error and increases the global error count. * * If 'is_id' is 0, we have a single uknown character; otherwise we * have a bad keyword. At this point yytext holds the entire bad * line. */ static void err_bad_line(int is_id) { size_t i; /* Make sure the parser lets the application know that things failed. */ ++g_probe_err; /* Handle a bad character; this is easy */ if (is_id == 0) { skAppPrintErr((PARSE_MSG_ERROR "\tUnexpected character '%c'"), probescan_filename, probescan_line, yytext[0]); return; } /* Handle a bad keyword. Copy the first keyword into * probescan_clause[] so we can print it. */ for (i = 0; i < sizeof(probescan_clause)-1; ++i) { /* This switch has the same character classes as our {idchar}. */ switch (yytext[i]) { case '\0': goto END_WORD; case '-': case '.': case '_': case '/': probescan_clause[i] = yytext[i]; break; default: if (isalnum((int)yytext[i])) { probescan_clause[i] = yytext[i]; } else { goto END_WORD; } break; } } END_WORD: probescan_clause[i] = '\0'; skAppPrintErr((PARSE_MSG_ERROR "\tUnrecognized keyword '%s'"), probescan_filename, probescan_line, probescan_clause); } int probeConfParse(const char *filename) { YY_BUFFER_STATE yybuf = ((YY_BUFFER_STATE)0); if (filename == NULL) { return -1; } /* clear the error count */ g_probe_err = 0; /* open the file */ probescan_filename = filename; if (0 == strcmp(probescan_filename, "stdin")) { yyin = stdin; } else if (!fileExists(probescan_filename)) { skAppPrintErr("'%s' does not exist or is not a regular file", probescan_filename); return -1; } else { yyin = fopen(probescan_filename, "r"); if (!yyin) { skAppPrintErr("Cannot open file '%s'", probescan_filename); return -1; } } /* set line number */ probescan_line = 1; /* set up scanner */ yybuf = yy_create_buffer(yyin, YY_BUF_SIZE); yy_switch_to_buffer(yybuf); BEGIN(INITIAL); /* setup the probe */ probe_start(); /* parse */ while (!feof(yyin)) { yyparse(); } /* force output of last probe */ probe_end(); /* close */ if (yyin != stdin) { fclose(yyin); } yy_delete_buffer(yybuf); /* return non-zero if we had errors */ if (g_probe_err > 0) { return -1; } return 0; } /* ** Local Variables: ** mode:c ** indent-tabs-mode:nil ** c-basic-offset:4 ** End: */