| |
| #line 3 "<stdout>" |
| |
| #define YY_INT_ALIGNED short int |
| |
| /* A lexical scanner generated by flex */ |
| |
| #define FLEX_SCANNER |
| #define YY_FLEX_MAJOR_VERSION 2 |
| #define YY_FLEX_MINOR_VERSION 5 |
| #define YY_FLEX_SUBMINOR_VERSION 31 |
| #if YY_FLEX_SUBMINOR_VERSION > 0 |
| #define FLEX_BETA |
| #endif |
| |
| /* First, we deal with platform-specific or compiler-specific issues. */ |
| |
| /* begin standard C headers. */ |
| #include <stdio.h> |
| #include <string.h> |
| #include <errno.h> |
| #include <stdlib.h> |
| |
| /* end standard C headers. */ |
| |
| /* flex integer type definitions */ |
| |
| #ifndef FLEXINT_H |
| #define FLEXINT_H |
| |
| /* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */ |
| |
| #if defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L |
| #include <inttypes.h> |
| typedef int8_t flex_int8_t; |
| typedef uint8_t flex_uint8_t; |
| typedef int16_t flex_int16_t; |
| typedef uint16_t flex_uint16_t; |
| typedef int32_t flex_int32_t; |
| typedef uint32_t flex_uint32_t; |
| #else |
| typedef signed char flex_int8_t; |
| typedef short int flex_int16_t; |
| typedef int flex_int32_t; |
| typedef unsigned char flex_uint8_t; |
| typedef unsigned short int flex_uint16_t; |
| typedef unsigned int flex_uint32_t; |
| #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 */ |
| |
| #if __STDC__ |
| |
| #define YY_USE_CONST |
| |
| #endif /* __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 yyrestart(yyin ) |
| |
| #define YY_END_OF_BUFFER_CHAR 0 |
| |
| /* Size of default input buffer. */ |
| #ifndef YY_BUF_SIZE |
| #define YY_BUF_SIZE 16384 |
| #endif |
| |
| #ifndef YY_TYPEDEF_YY_BUFFER_STATE |
| #define YY_TYPEDEF_YY_BUFFER_STATE |
| typedef struct yy_buffer_state *YY_BUFFER_STATE; |
| #endif |
| |
| 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 |
| |
| /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires |
| * access to the local variable yy_act. Since yyless() is a macro, it would break |
| * existing scanners that call yyless() from OUTSIDE yylex. |
| * One obvious solution it to make yy_act a global. I tried that, and saw |
| * a 5% performance hit in a non-yylineno scanner, because yy_act is |
| * normally declared as a register variable-- so it is not worth it. |
| */ |
| #define YY_LESS_LINENO(n) \ |
| do { \ |
| int yyl;\ |
| for ( yyl = n; yyl < yyleng; ++yyl )\ |
| if ( yytext[yyl] == '\n' )\ |
| --yylineno;\ |
| }while(0) |
| |
| /* Return all but the first "n" matched characters back to the input stream. */ |
| #define yyless(n) \ |
| do \ |
| { \ |
| /* Undo effects of setting up yytext. */ \ |
| int yyless_macro_arg = (n); \ |
| YY_LESS_LINENO(yyless_macro_arg);\ |
| *yy_cp = (yy_hold_char); \ |
| YY_RESTORE_YY_MORE_OFFSET \ |
| (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ |
| YY_DO_BEFORE_ACTION; /* set up 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). |
| */ |
| |
| #ifndef YY_TYPEDEF_YY_SIZE_T |
| #define YY_TYPEDEF_YY_SIZE_T |
| typedef unsigned int 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 yyrestart()), so that the user can continue scanning by |
| * just pointing yyin at a new input file. |
| */ |
| #define YY_BUFFER_EOF_PENDING 2 |
| |
| }; |
| #endif /* !YY_STRUCT_YY_BUFFER_STATE */ |
| |
| /* Stack of input buffers. */ |
| static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ |
| static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ |
| static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ |
| |
| /* We provide macros for accessing buffer states in case in the |
| * future we want to put the buffer states in a more general |
| * "scanner state". |
| * |
| * Returns the top of the stack, or NULL. |
| */ |
| #define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ |
| ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ |
| : NULL) |
| |
| /* Same as previous macro, but useful when we know that the buffer stack is not |
| * NULL or when we need an lvalue. For internal use only. |
| */ |
| #define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] |
| |
| /* yy_hold_char holds the character lost when 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 (FILE *input_file ); |
| void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); |
| YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); |
| void yy_delete_buffer (YY_BUFFER_STATE b ); |
| void yy_flush_buffer (YY_BUFFER_STATE b ); |
| void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); |
| void yypop_buffer_state (void ); |
| |
| static void yyensure_buffer_stack (void ); |
| static void yy_load_buffer_state (void ); |
| static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); |
| |
| #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) |
| |
| YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); |
| YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); |
| YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len ); |
| |
| void *yyalloc (yy_size_t ); |
| void *yyrealloc (void *,yy_size_t ); |
| void yyfree (void * ); |
| |
| #define yy_new_buffer yy_create_buffer |
| |
| #define yy_set_interactive(is_interactive) \ |
| { \ |
| if ( ! YY_CURRENT_BUFFER ){ \ |
| yyensure_buffer_stack (); \ |
| YY_CURRENT_BUFFER_LVALUE = \ |
| yy_create_buffer(yyin,YY_BUF_SIZE ); \ |
| } \ |
| YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ |
| } |
| |
| #define yy_set_bol(at_bol) \ |
| { \ |
| if ( ! YY_CURRENT_BUFFER ){\ |
| yyensure_buffer_stack (); \ |
| YY_CURRENT_BUFFER_LVALUE = \ |
| yy_create_buffer(yyin,YY_BUF_SIZE ); \ |
| } \ |
| YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ |
| } |
| |
| #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) |
| |
| /* Begin user sect3 */ |
| |
| typedef unsigned char YY_CHAR; |
| |
| FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; |
| |
| typedef int yy_state_type; |
| |
| #define YY_FLEX_LEX_COMPAT |
| extern int yylineno; |
| |
| int yylineno = 1; |
| |
| extern char yytext[]; |
| |
| static yy_state_type yy_get_previous_state (void ); |
| static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); |
| static int yy_get_next_buffer (void ); |
| static void yy_fatal_error (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 = (size_t) (yy_cp - yy_bp); \ |
| (yy_hold_char) = *yy_cp; \ |
| *yy_cp = '\0'; \ |
| if ( yyleng + (yy_more_offset) >= YYLMAX ) \ |
| YY_FATAL_ERROR( "token too large, exceeds YYLMAX" ); \ |
| yy_flex_strncpy( &yytext[(yy_more_offset)], (yytext_ptr), yyleng + 1 ); \ |
| yyleng += (yy_more_offset); \ |
| (yy_prev_more_offset) = (yy_more_offset); \ |
| (yy_more_offset) = 0; \ |
| (yy_c_buf_p) = yy_cp; |
| |
| #define YY_NUM_RULES 15 |
| #define YY_END_OF_BUFFER 16 |
| /* 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_acclist[142] = |
| { 0, |
| 9, 9, 16, 13, 15, 14, 15, 13, 15, 9, |
| 13, 15, 9, 14, 15, 13, 15, 13, 15,16394, |
| 13, 15,16394, 13, 15, 9,16394, 8202,16394, 8, |
| 8,16394, 8,16394,16394,16394, 7, 8, 7,16394, |
| 16394,16394,16394,16394,16394,16394,16394,16394, 11,16394, |
| 16394,16394,16394,16394,16394,16394,16394, 12,16394,16394, |
| 16394,16394,16394,16394,16394,16394,16394,16394,16394,16394, |
| 16394,16394,16394,16394,16394,16394,16394,16394,16390,16394, |
| 16394,16390,16394,16394,16394, 8198,16394,16394, 8198, 8202, |
| 16394,16394,16387,16394,16394,16394,16394,16387,16394,16388, |
| |
| 8195,16394,16394,16394,16388,16394, 8195, 8202, 8196,16394, |
| 16394,16394, 8196, 8202,16394,16394,16394,16394,16394,16394, |
| 16386,16394,16386,16394,16394,16389, 8194,16389,16394, 8194, |
| 8202,16394, 8197,16385, 8197, 8202,16385,16394, 8193, 8193, |
| 8202 |
| } ; |
| |
| static yyconst flex_int16_t yy_accept[207] = |
| { 0, |
| 1, 1, 1, 2, 3, 3, 3, 3, 3, 4, |
| 6, 8, 10, 13, 16, 18, 21, 24, 26, 26, |
| 27, 27, 27, 28, 29, 30, 30, 30, 30, 31, |
| 32, 33, 33, 33, 33, 33, 34, 34, 35, 36, |
| 37, 37, 37, 37, 37, 37, 39, 40, 41, 42, |
| 43, 43, 43, 43, 43, 43, 44, 45, 46, 46, |
| 46, 46, 46, 46, 47, 48, 49, 50, 50, 50, |
| 50, 50, 51, 52, 53, 53, 53, 53, 53, 53, |
| 53, 54, 55, 56, 57, 58, 59, 59, 59, 59, |
| 59, 59, 60, 61, 62, 63, 64, 64, 64, 64, |
| |
| 64, 64, 65, 66, 67, 68, 69, 69, 69, 69, |
| 69, 69, 70, 71, 72, 73, 74, 74, 74, 74, |
| 74, 74, 75, 76, 77, 78, 79, 79, 79, 80, |
| 80, 80, 81, 82, 84, 85, 86, 86, 86, 87, |
| 87, 87, 88, 89, 91, 92, 93, 93, 93, 93, |
| 93, 94, 95, 96, 97, 98, 100, 100, 100, 100, |
| 101, 102, 103, 104, 105, 107, 109, 109, 109, 109, |
| 110, 111, 112, 113, 115, 115, 115, 115, 116, 117, |
| 118, 118, 118, 118, 119, 120, 121, 121, 122, 122, |
| 123, 125, 126, 127, 128, 128, 130, 132, 133, 134, |
| |
| 135, 137, 139, 140, 142, 142 |
| } ; |
| |
| 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, 1, 4, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 5, 1, 1, 6, 6, 6, |
| 6, 6, 6, 6, 6, 6, 6, 7, 1, 8, |
| 9, 10, 1, 1, 11, 11, 11, 11, 11, 11, |
| 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, |
| 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, |
| 1, 1, 1, 1, 12, 1, 13, 11, 14, 15, |
| |
| 16, 11, 11, 11, 17, 11, 18, 11, 11, 19, |
| 20, 21, 11, 22, 23, 24, 25, 11, 26, 27, |
| 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 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[29] = |
| { 0, |
| 1, 2, 3, 1, 4, 5, 1, 1, 6, 1, |
| 7, 4, 7, 7, 7, 7, 7, 7, 7, 7, |
| 7, 7, 7, 7, 7, 7, 7, 7 |
| } ; |
| |
| static yyconst flex_int16_t yy_base[218] = |
| { 0, |
| 362, 0, 8, 18, 361, 26, 360, 34, 362, 366, |
| 366, 353, 2, 4, 351, 356, 37, 356, 349, 28, |
| 347, 351, 351, 366, 43, 46, 351, 31, 0, 52, |
| 46, 55, 325, 327, 334, 61, 345, 47, 55, 56, |
| 346, 341, 330, 322, 321, 0, 366, 61, 10, 63, |
| 341, 65, 328, 329, 316, 66, 20, 70, 74, 337, |
| 313, 319, 324, 72, 75, 79, 366, 333, 310, 317, |
| 67, 81, 82, 86, 93, 315, 303, 311, 304, 304, |
| 93, 85, 89, 96, 98, 366, 307, 300, 310, 300, |
| 310, 100, 101, 104, 108, 111, 303, 301, 310, 298, |
| |
| 296, 109, 113, 115, 114, 112, 305, 294, 305, 289, |
| 289, 126, 120, 127, 123, 128, 289, 296, 300, 285, |
| 298, 133, 136, 137, 138, 140, 283, 294, 302, 294, |
| 293, 141, 142, 299, 143, 154, 288, 143, 366, 290, |
| 289, 155, 157, 366, 160, 164, 274, 278, 272, 285, |
| 291, 152, 158, 166, 168, 289, 266, 275, 276, 283, |
| 366, 169, 172, 176, 282, 366, 261, 273, 255, 366, |
| 178, 181, 180, 366, 260, 253, 238, 182, 183, 179, |
| 249, 246, 235, 185, 194, 195, 204, 210, 202, 196, |
| 208, 197, 207, 366, 199, 193, 366, 205, 366, 146, |
| |
| 366, 36, 366, 366, 366, 215, 222, 229, 236, 240, |
| 247, 253, 260, 267, 274, 280, 286 |
| } ; |
| |
| static yyconst flex_int16_t yy_def[218] = |
| { 0, |
| 206, 206, 207, 207, 206, 208, 206, 209, 205, 205, |
| 205, 205, 205, 205, 210, 211, 211, 212, 205, 205, |
| 210, 213, 211, 205, 211, 205, 212, 205, 213, 214, |
| 211, 205, 205, 205, 205, 214, 215, 211, 211, 211, |
| 216, 205, 205, 205, 205, 213, 205, 211, 211, 211, |
| 216, 205, 205, 205, 205, 211, 211, 211, 205, 217, |
| 205, 205, 205, 211, 211, 211, 205, 217, 205, 205, |
| 205, 211, 211, 211, 205, 205, 205, 205, 205, 205, |
| 211, 211, 211, 211, 211, 205, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 205, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 211, 205, 205, 205, 205, |
| 205, 211, 211, 211, 211, 205, 205, 205, 205, 205, |
| 211, 211, 211, 205, 205, 205, 205, 211, 211, 211, |
| 205, 205, 205, 211, 211, 211, 205, 205, 205, 211, |
| 211, 211, 205, 205, 205, 211, 205, 211, 205, 205, |
| |
| 205, 211, 205, 205, 0, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205, 205, 205, 205 |
| } ; |
| |
| static yyconst flex_int16_t yy_nxt[395] = |
| { 0, |
| 205, 205, 11, 20, 20, 20, 20, 12, 10, 13, |
| 14, 10, 24, 10, 10, 10, 10, 10, 10, 13, |
| 14, 10, 24, 10, 10, 12, 10, 10, 11, 20, |
| 20, 65, 57, 17, 10, 10, 11, 10, 204, 24, |
| 10, 12, 10, 10, 25, 24, 33, 26, 24, 24, |
| 31, 32, 34, 37, 35, 29, 41, 24, 24, 42, |
| 32, 38, 37, 24, 46, 24, 60, 39, 24, 40, |
| 52, 50, 24, 48, 24, 59, 56, 24, 49, 64, |
| 67, 24, 78, 24, 24, 58, 79, 24, 24, 80, |
| 74, 24, 73, 66, 75, 24, 72, 82, 24, 86, |
| |
| 24, 83, 24, 24, 81, 84, 24, 94, 85, 92, |
| 24, 24, 93, 24, 24, 24, 24, 24, 104, 102, |
| 95, 96, 24, 106, 114, 24, 103, 112, 24, 24, |
| 24, 105, 113, 116, 115, 24, 124, 122, 24, 24, |
| 24, 123, 24, 24, 24, 24, 134, 125, 203, 136, |
| 133, 126, 145, 143, 24, 132, 24, 24, 148, 24, |
| 24, 135, 24, 146, 142, 149, 24, 152, 24, 155, |
| 24, 24, 153, 156, 24, 162, 163, 165, 24, 154, |
| 24, 24, 24, 24, 24, 24, 172, 24, 173, 164, |
| 179, 184, 185, 171, 190, 201, 24, 24, 24, 24, |
| |
| 178, 180, 186, 191, 192, 196, 198, 24, 200, 199, |
| 197, 195, 194, 193, 202, 10, 10, 10, 10, 10, |
| 10, 10, 15, 15, 15, 15, 15, 15, 15, 16, |
| 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, |
| 18, 18, 18, 21, 189, 21, 21, 23, 23, 23, |
| 23, 23, 23, 23, 27, 188, 27, 27, 187, 27, |
| 29, 183, 182, 29, 29, 29, 29, 36, 36, 181, |
| 36, 36, 36, 36, 37, 37, 177, 37, 37, 37, |
| 37, 51, 176, 175, 174, 170, 51, 68, 169, 168, |
| 167, 166, 68, 161, 160, 159, 158, 157, 151, 150, |
| |
| 147, 144, 141, 140, 139, 138, 137, 131, 130, 129, |
| 128, 127, 121, 120, 119, 118, 117, 111, 110, 109, |
| 108, 107, 101, 100, 99, 98, 97, 91, 90, 89, |
| 88, 87, 77, 76, 75, 71, 70, 69, 60, 63, |
| 62, 61, 59, 55, 54, 53, 52, 41, 47, 45, |
| 44, 43, 26, 24, 30, 22, 28, 26, 24, 22, |
| 19, 205, 11, 11, 11, 9, 205, 205, 205, 205, |
| 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205 |
| |
| } ; |
| |
| static yyconst flex_int16_t yy_chk[395] = |
| { 0, |
| 0, 0, 2, 13, 13, 14, 14, 2, 3, 3, |
| 3, 3, 49, 3, 3, 3, 3, 3, 4, 4, |
| 4, 4, 57, 4, 4, 4, 4, 4, 6, 20, |
| 20, 57, 49, 6, 8, 8, 8, 8, 202, 17, |
| 8, 8, 8, 8, 17, 25, 28, 26, 31, 38, |
| 25, 26, 28, 30, 28, 30, 32, 39, 40, 32, |
| 32, 31, 36, 48, 36, 50, 52, 31, 56, 31, |
| 52, 40, 58, 38, 64, 59, 48, 65, 39, 56, |
| 59, 66, 71, 72, 73, 50, 71, 82, 74, 71, |
| 66, 83, 65, 58, 75, 81, 64, 73, 84, 75, |
| |
| 85, 74, 92, 93, 72, 74, 94, 83, 74, 81, |
| 95, 102, 82, 96, 106, 103, 105, 104, 94, 92, |
| 84, 85, 113, 96, 104, 115, 93, 102, 112, 114, |
| 116, 95, 103, 106, 105, 122, 114, 112, 123, 124, |
| 125, 113, 126, 132, 133, 135, 124, 115, 200, 126, |
| 123, 116, 135, 133, 152, 122, 136, 142, 138, 143, |
| 153, 125, 145, 136, 132, 138, 146, 142, 154, 145, |
| 155, 162, 143, 146, 163, 152, 153, 155, 164, 143, |
| 171, 180, 173, 172, 178, 179, 163, 184, 164, 154, |
| 172, 178, 179, 162, 184, 196, 185, 186, 190, 192, |
| |
| 171, 173, 180, 185, 186, 190, 192, 198, 195, 193, |
| 191, 189, 188, 187, 198, 206, 206, 206, 206, 206, |
| 206, 206, 207, 207, 207, 207, 207, 207, 207, 208, |
| 208, 208, 208, 208, 208, 208, 209, 209, 209, 209, |
| 209, 209, 209, 210, 183, 210, 210, 211, 211, 211, |
| 211, 211, 211, 211, 212, 182, 212, 212, 181, 212, |
| 213, 177, 176, 213, 213, 213, 213, 214, 214, 175, |
| 214, 214, 214, 214, 215, 215, 169, 215, 215, 215, |
| 215, 216, 168, 167, 165, 160, 216, 217, 159, 158, |
| 157, 156, 217, 151, 150, 149, 148, 147, 141, 140, |
| |
| 137, 134, 131, 130, 129, 128, 127, 121, 120, 119, |
| 118, 117, 111, 110, 109, 108, 107, 101, 100, 99, |
| 98, 97, 91, 90, 89, 88, 87, 80, 79, 78, |
| 77, 76, 70, 69, 68, 63, 62, 61, 60, 55, |
| 54, 53, 51, 45, 44, 43, 42, 41, 37, 35, |
| 34, 33, 27, 23, 22, 21, 19, 18, 16, 15, |
| 12, 9, 7, 5, 1, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, |
| 205, 205, 205, 205 |
| |
| } ; |
| |
| /* Table of booleans, true if rule could match eol. */ |
| static yyconst flex_int32_t yy_rule_can_match_eol[16] = |
| { 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, }; |
| |
| extern int yy_flex_debug; |
| int yy_flex_debug = 0; |
| |
| static yy_state_type *yy_state_buf=0, *yy_state_ptr=0; |
| static char *yy_full_match; |
| static int yy_lp; |
| static int yy_looking_for_trail_begin = 0; |
| static int yy_full_lp; |
| static int *yy_full_state; |
| #define YY_TRAILING_MASK 0x2000 |
| #define YY_TRAILING_HEAD_MASK 0x4000 |
| #define REJECT \ |
| { \ |
| *yy_cp = (yy_hold_char); /* undo effects of setting up yytext */ \ |
| yy_cp = (yy_full_match); /* restore poss. backed-over text */ \ |
| (yy_lp) = yy_full_lp; /* restore orig. accepting pos. */ \ |
| (yy_state_ptr) = yy_full_state; /* restore orig. state */ \ |
| yy_current_state = *(yy_state_ptr); /* restore curr. state */ \ |
| ++(yy_lp); \ |
| goto find_rule; \ |
| } |
| |
| static int yy_more_offset = 0; |
| static int yy_prev_more_offset = 0; |
| #define yymore() ((yy_more_offset) = yy_flex_strlen( yytext )) |
| #define YY_NEED_STRLEN |
| #define YY_MORE_ADJ 0 |
| #define YY_RESTORE_YY_MORE_OFFSET \ |
| { \ |
| (yy_more_offset) = (yy_prev_more_offset); \ |
| yyleng -= (yy_more_offset); \ |
| } |
| #ifndef YYLMAX |
| #define YYLMAX 8192 |
| #endif |
| |
| char yytext[YYLMAX]; |
| char *yytext_ptr; |
| #line 1 "scan.l" |
| #line 2 "scan.l" |
| /* |
| * Copyright (c) 2000 Silicon Graphics, Inc. All Rights Reserved. |
| * |
| * This program is free software; you can redistribute it and/or modify it |
| * under the terms of version 2 of the GNU General Public License as |
| * published by the Free Software Foundation. |
| * |
| * This program is distributed in the hope that it would be useful, but |
| * WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. |
| * |
| * Further, this software is distributed without any warranty that it is |
| * free of the rightful claim of any third person regarding infringement |
| * or the like. Any license provided herein, whether implied or |
| * otherwise, applies only to this software file. Patent licenses, if |
| * any, provided herein do not apply to combinations of this program with |
| * other software, or any other product whatsoever. |
| * |
| * You should have received a copy of the GNU General Public License along |
| * with this program; if not, write the Free Software Foundation, Inc., 59 |
| * Temple Place - Suite 330, Boston MA 02111-1307, USA. |
| * |
| * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, |
| * Mountain View, CA 94043, or: |
| * |
| * http://www.sgi.com |
| * |
| * For further information regarding this notice, see: |
| * |
| * http://oss.sgi.com/projects/GenInfo/NoticeExplan/ |
| * |
| */ |
| /* $Id: scan.l,v 1.1 2000/09/21 21:35:06 alaffin Exp $ */ |
| /* |
| * Lex rules for input processing. |
| * |
| * This handles all of the input parsing. The rules liste here properly |
| * store or process the pertenant input data in the proper ways. The rules |
| * for the various patterns maintains a "state" to determine if corrupted |
| * input is seen (%Start keys + internal ones that only flag errors). |
| * |
| * See scanner.c for routines called from the actions. |
| * |
| * States: |
| * SCAN_OUTSIDE |
| * start-up state, inbetween tests |
| * SCAN_RTSKEY valid from SCAN_OUTSIDE |
| * from rts_keyword_start to _end |
| * accompanied by lex KEY state. |
| * SCAN_TSTKEY valid from SCAN_OUTSIDE |
| * test_start to test_output or test_end, |
| * execution_status to test_end |
| * accompanied by lex KEY state. |
| * SCAN_OUTPUT |
| * test_output to execution_status. |
| * accompanied by lex OUT or CUTS states. |
| */ |
| |
| #include <stdio.h> |
| #include <stdlib.h> |
| #include <string.h> |
| #include <malloc.h> /* malloc / realloc */ |
| #include <stdarg.h> |
| |
| #include "scan.h" |
| #include "reporter.h" |
| #include "symbol.h" |
| #include "tag_report.h" |
| |
| int scan_mode = SCAN_OUTSIDE; /* current mode */ |
| char *key, *cont; /* keyword pieces */ |
| SYM keys=NULL; /* stored keywords */ |
| SYM ctag=NULL; /* temporary - for storing current tag's info */ |
| SYM alltags; /* entire tag database. set to scanner 'tags' param.*/ |
| SYM k; /* temporary sym pointer -- for key removal */ |
| char info[KEYSIZE]; /* tmp string for inserting line numbers */ |
| static int test_output( SYM, SYM); |
| static int check_mode(int, int, ...); |
| |
| /* |
| * Lex Definitions: |
| * UI Unsigned Integer |
| * A Alphabetic |
| * W "Word" characters (Alpha, Numeric, Hyphens, Underscores) |
| * S Space characters |
| */ |
| |
| #line 753 "<stdout>" |
| |
| #define INITIAL 0 |
| #define KEY 1 |
| #define OUT 2 |
| #define CUTS 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 <unistd.h> |
| #endif |
| |
| #ifndef YY_EXTRA_TYPE |
| #define YY_EXTRA_TYPE void * |
| #endif |
| |
| /* Macros after this point can all be overridden by user definitions in |
| * section 1. |
| */ |
| |
| #ifndef YY_SKIP_YYWRAP |
| #ifdef __cplusplus |
| extern "C" int yywrap (void ); |
| #else |
| extern int yywrap (void ); |
| #endif |
| #endif |
| |
| static void yyunput (int c,char *buf_ptr ); |
| |
| #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 (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_LVALUE->yy_is_interactive ) \ |
| { \ |
| int c = '*'; \ |
| size_t 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 \ |
| { \ |
| errno=0; \ |
| while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ |
| { \ |
| if( errno != EINTR) \ |
| { \ |
| YY_FATAL_ERROR( "input in flex scanner failed" ); \ |
| break; \ |
| } \ |
| errno=0; \ |
| clearerr(yyin); \ |
| } \ |
| }\ |
| \ |
| |
| #endif |
| |
| /* No semi-colon after return; correct usage is to write "yyterminate();" - |
| * we don't want an extra ';' after the "return" because that will cause |
| * some compilers to complain about unreachable statements. |
| */ |
| #ifndef yyterminate |
| #define yyterminate() return YY_NULL |
| #endif |
| |
| /* Number of entries by which start-condition stack grows. */ |
| #ifndef YY_START_STACK_INCR |
| #define YY_START_STACK_INCR 25 |
| #endif |
| |
| /* Report a fatal error. */ |
| #ifndef YY_FATAL_ERROR |
| #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) |
| #endif |
| |
| /* end tables serialization structures and prototypes */ |
| |
| /* Default declaration of generated scanner - a define so the user can |
| * easily add parameters. |
| */ |
| #ifndef YY_DECL |
| #define YY_DECL_IS_OURS 1 |
| |
| extern int yylex (void); |
| |
| #define YY_DECL int yylex (void) |
| #endif /* !YY_DECL */ |
| |
| /* 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 \ |
| if ( yyleng > 0 ) \ |
| YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \ |
| (yytext[yyleng - 1] == '\n'); \ |
| 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 96 "scan.l" |
| |
| #line 912 "<stdout>" |
| |
| if ( (yy_init) ) |
| { |
| (yy_init) = 0; |
| |
| #ifdef YY_USER_INIT |
| YY_USER_INIT; |
| #endif |
| |
| /* Create the reject buffer large enough to save one state per allowed character. */ |
| if ( ! (yy_state_buf) ) |
| (yy_state_buf) = (yy_state_type *)yyalloc(((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) ); |
| |
| if ( ! (yy_start) ) |
| (yy_start) = 1; /* first start state */ |
| |
| if ( ! yyin ) |
| yyin = stdin; |
| |
| if ( ! yyout ) |
| yyout = stdout; |
| |
| if ( ! YY_CURRENT_BUFFER ) { |
| yyensure_buffer_stack (); |
| YY_CURRENT_BUFFER_LVALUE = |
| 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_current_state += YY_AT_BOL(); |
| |
| (yy_state_ptr) = (yy_state_buf); |
| *(yy_state_ptr)++ = yy_current_state; |
| |
| yy_match: |
| do |
| { |
| register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*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 >= 206 ) |
| yy_c = yy_meta[(unsigned int) yy_c]; |
| } |
| yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; |
| *(yy_state_ptr)++ = yy_current_state; |
| ++yy_cp; |
| } |
| while ( yy_base[yy_current_state] != 366 ); |
| |
| yy_find_action: |
| yy_current_state = *--(yy_state_ptr); |
| (yy_lp) = yy_accept[yy_current_state]; |
| find_rule: /* we branch to this label when backing up */ |
| for ( ; ; ) /* until we find what rule we matched */ |
| { |
| if ( (yy_lp) && (yy_lp) < yy_accept[yy_current_state + 1] ) |
| { |
| yy_act = yy_acclist[(yy_lp)]; |
| if ( yy_act & YY_TRAILING_HEAD_MASK || |
| yy_looking_for_trail_begin ) |
| { |
| if ( yy_act == yy_looking_for_trail_begin ) |
| { |
| yy_looking_for_trail_begin = 0; |
| yy_act &= ~YY_TRAILING_HEAD_MASK; |
| break; |
| } |
| } |
| else if ( yy_act & YY_TRAILING_MASK ) |
| { |
| yy_looking_for_trail_begin = yy_act & ~YY_TRAILING_MASK; |
| yy_looking_for_trail_begin |= YY_TRAILING_HEAD_MASK; |
| (yy_full_match) = yy_cp; |
| yy_full_state = (yy_state_ptr); |
| yy_full_lp = (yy_lp); |
| } |
| else |
| { |
| (yy_full_match) = yy_cp; |
| yy_full_state = (yy_state_ptr); |
| yy_full_lp = (yy_lp); |
| break; |
| } |
| ++(yy_lp); |
| goto find_rule; |
| } |
| --yy_cp; |
| yy_current_state = *--(yy_state_ptr); |
| (yy_lp) = yy_accept[yy_current_state]; |
| } |
| |
| YY_DO_BEFORE_ACTION; |
| |
| if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] ) |
| { |
| int yyl; |
| for ( yyl = (yy_prev_more_offset); yyl < yyleng; ++yyl ) |
| if ( yytext[yyl] == '\n' ) |
| |
| yylineno++; |
| ; |
| } |
| |
| do_action: /* This label is used only to access EOF actions. */ |
| |
| switch ( yy_act ) |
| { /* beginning of action switch */ |
| case 1: |
| YY_RULE_SETUP |
| #line 97 "scan.l" |
| { |
| BEGIN KEY; |
| check_mode(scan_mode, SCAN_OUTSIDE, 0); |
| scan_mode = SCAN_RTSKEY; |
| |
| /* remove any keys that exist right now */ |
| if(keys != NULL) |
| sym_rm(keys, RM_KEY | RM_DATA); |
| /* start a new table of keys */ |
| keys = sym_open(0, 0, 0); |
| return(KW_START); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 2: |
| YY_RULE_SETUP |
| #line 111 "scan.l" |
| { |
| BEGIN 0; |
| check_mode(scan_mode, SCAN_RTSKEY, 0); |
| scan_mode = SCAN_OUTSIDE; |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 10) { |
| printf("RTS Keywords:\n"); |
| sym_dump_s(keys, 0); |
| } |
| #endif |
| /* remove _RTS key, if it exists, before replacing it */ |
| if( (k=(SYM)sym_get(alltags, "_RTS")) != NULL) { |
| sym_rm(k, RM_KEY | RM_DATA); |
| } |
| |
| sym_put(alltags, "_RTS", (void *)keys, PUT_REPLACE); |
| keys = NULL; |
| |
| return(KW_END); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 3: |
| YY_RULE_SETUP |
| #line 133 "scan.l" |
| { |
| BEGIN KEY; |
| check_mode(scan_mode, SCAN_OUTSIDE, 0); |
| scan_mode = SCAN_TSTKEY; |
| |
| /* |
| * set up new "tag" and "keys" tables |
| * to put the new data into. |
| */ |
| |
| /* remove any keys that exist right now */ |
| if(keys != NULL) |
| sym_rm(keys, RM_KEY | RM_DATA); |
| keys = sym_open(0, 0, 0); |
| |
| sprintf(info, "%d", yylineno); |
| sym_put(keys, "_Start_line", strdup(info), 0); |
| |
| /* remove any tag info that exists right now */ |
| if(ctag != NULL) |
| sym_rm(ctag, RM_KEY | RM_DATA); |
| ctag = sym_open(0, 0, 0); |
| |
| return(TEST_START); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 4: |
| YY_RULE_SETUP |
| #line 160 "scan.l" |
| { |
| BEGIN OUT; |
| check_mode(scan_mode, SCAN_TSTKEY, 0); |
| scan_mode = SCAN_OUTPUT; |
| |
| test_output(ctag, keys); |
| |
| return(TEST_OUTPUT); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 5: |
| YY_RULE_SETUP |
| #line 171 "scan.l" |
| { |
| BEGIN KEY; |
| check_mode(scan_mode, SCAN_TSTKEY, SCAN_OUTPUT, 0); |
| scan_mode = SCAN_TSTKEY; |
| return(EXEC_STATUS); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 6: |
| YY_RULE_SETUP |
| #line 179 "scan.l" |
| { |
| BEGIN 0; |
| check_mode(scan_mode, SCAN_TSTKEY, 0); |
| scan_mode = SCAN_OUTSIDE; |
| |
| sprintf(info, "%d", yylineno); |
| |
| sym_put(keys, "_End_line", strdup(info), 0); |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 10) { |
| printf("Tag's Keywords:\n"); |
| sym_dump_s(keys, 0); |
| } |
| #endif |
| test_end(alltags, ctag, keys); |
| ctag = keys = NULL; |
| |
| return(TEST_END); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 7: |
| YY_RULE_SETUP |
| #line 200 "scan.l" |
| { |
| key = yytext; |
| cont = strchr(yytext, '='); |
| *cont++ = '\0'; |
| if(*cont == '"') cont++; |
| if(yytext[yyleng-1] == '"') |
| yytext[yyleng-1] = '\0'; |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 5) |
| printf("A quoted keyword: %s = %s\n", key, cont); |
| #endif |
| sym_put(keys, key, strdup(cont), 0); |
| |
| return(KEYWORD_QUOTED); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 8: |
| YY_RULE_SETUP |
| #line 217 "scan.l" |
| { |
| key = yytext; |
| cont = strchr(yytext, '='); |
| *cont++ = '\0'; |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 5) |
| printf("A keyword: %s = %s\n", key, cont); |
| #endif |
| sym_put(keys, key, strdup(cont), 0); |
| |
| return(KEYWORD); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 9: |
| /* rule 9 can match eol */ |
| YY_RULE_SETUP |
| #line 231 "scan.l" |
| { |
| return(SPACE); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 10: |
| YY_RULE_SETUP |
| #line 236 "scan.l" |
| { |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 5) |
| printf("TEXT_LINE: %s\n", yytext); |
| #endif |
| |
| return(TEXT_LINE); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 11: |
| YY_RULE_SETUP |
| #line 246 "scan.l" |
| { |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 5) |
| printf("CUTS Result: %s\n", yytext); |
| #endif |
| cuts_testcase(ctag, keys); |
| |
| return(CUTS_RESULT); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 12: |
| YY_RULE_SETUP |
| #line 257 "scan.l" |
| { |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN_LEX, 5) |
| printf("CUTS Result: %s\n", yytext); |
| #endif |
| cuts_testcase(ctag, keys); |
| |
| return(CUTS_RESULT_R); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 13: |
| YY_RULE_SETUP |
| #line 268 "scan.l" |
| { |
| return(SPACE); |
| /* NOTREACHED */ |
| |
| } |
| YY_BREAK |
| case 14: |
| /* rule 14 can match eol */ |
| YY_RULE_SETUP |
| #line 273 "scan.l" |
| { |
| return(SPACE); |
| /* NOTREACHED */ |
| } |
| YY_BREAK |
| case 15: |
| YY_RULE_SETUP |
| #line 277 "scan.l" |
| ECHO; |
| YY_BREAK |
| #line 1267 "<stdout>" |
| case YY_STATE_EOF(INITIAL): |
| case YY_STATE_EOF(KEY): |
| case YY_STATE_EOF(OUT): |
| case YY_STATE_EOF(CUTS): |
| 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 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_LVALUE->yy_n_chars; |
| YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; |
| YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; |
| } |
| |
| /* Note that here we test for yy_c_buf_p "<=" to the position |
| * of the first EOB in the buffer, since yy_c_buf_p will |
| * already have been incremented past the NUL character |
| * (since all states make transitions on EOB to the |
| * end-of-buffer state). Contrast this with the test |
| * in input(). |
| */ |
| if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) |
| { /* This was really a NUL. */ |
| yy_state_type yy_next_state; |
| |
| (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; |
| |
| yy_current_state = yy_get_previous_state( ); |
| |
| /* Okay, we're now positioned to make the NUL |
| * transition. We couldn't have |
| * yy_get_previous_state() go ahead and do it |
| * for us because it doesn't know how to deal |
| * with the possibility of jamming (and we don't |
| * want to build jamming into it because then it |
| * will run more slowly). |
| */ |
| |
| yy_next_state = yy_try_NUL_trans( yy_current_state ); |
| |
| yy_bp = (yytext_ptr) + YY_MORE_ADJ; |
| |
| if ( yy_next_state ) |
| { |
| /* Consume the NUL. */ |
| yy_cp = ++(yy_c_buf_p); |
| yy_current_state = yy_next_state; |
| goto yy_match; |
| } |
| |
| else |
| { |
| yy_cp = (yy_c_buf_p); |
| goto yy_find_action; |
| } |
| } |
| |
| else switch ( yy_get_next_buffer( ) ) |
| { |
| case EOB_ACT_END_OF_FILE: |
| { |
| (yy_did_buffer_switch_on_eof) = 0; |
| |
| if ( 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_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 yylex */ |
| |
| /* yy_get_next_buffer - try to read in a new buffer |
| * |
| * Returns a code representing an action: |
| * EOB_ACT_LAST_MATCH - |
| * EOB_ACT_CONTINUE_SCAN - continue scanning from current position |
| * EOB_ACT_END_OF_FILE - end of file |
| */ |
| static int yy_get_next_buffer (void) |
| { |
| 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. */ |
| |
| YY_FATAL_ERROR( |
| "input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); |
| |
| } |
| |
| if ( num_to_read > YY_READ_BUF_SIZE ) |
| num_to_read = YY_READ_BUF_SIZE; |
| |
| /* Read in more data. */ |
| YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), |
| (yy_n_chars), num_to_read ); |
| |
| YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); |
| } |
| |
| if ( (yy_n_chars) == 0 ) |
| { |
| if ( number_to_move == YY_MORE_ADJ ) |
| { |
| ret_val = EOB_ACT_END_OF_FILE; |
| yyrestart(yyin ); |
| } |
| |
| else |
| { |
| ret_val = EOB_ACT_LAST_MATCH; |
| YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = |
| YY_BUFFER_EOF_PENDING; |
| } |
| } |
| |
| else |
| ret_val = EOB_ACT_CONTINUE_SCAN; |
| |
| (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); |
| yy_current_state += YY_AT_BOL(); |
| |
| (yy_state_ptr) = (yy_state_buf); |
| *(yy_state_ptr)++ = yy_current_state; |
| |
| 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); |
| 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 >= 206 ) |
| yy_c = yy_meta[(unsigned int) yy_c]; |
| } |
| yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; |
| *(yy_state_ptr)++ = yy_current_state; |
| } |
| |
| 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 YY_CHAR yy_c = 1; |
| 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 >= 206 ) |
| 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 == 205); |
| if ( ! yy_is_jam ) |
| *(yy_state_ptr)++ = yy_current_state; |
| |
| return yy_is_jam ? 0 : yy_current_state; |
| } |
| |
| static void yyunput (int c, register char * yy_bp ) |
| { |
| register char *yy_cp; |
| |
| yy_cp = (yy_c_buf_p); |
| |
| /* undo effects of setting up yytext */ |
| *yy_cp = (yy_hold_char); |
| |
| if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->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_LVALUE->yy_ch_buf[ |
| YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; |
| register char *source = |
| &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; |
| |
| while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) |
| *--dest = *--source; |
| |
| yy_cp += (int) (dest - source); |
| yy_bp += (int) (dest - source); |
| YY_CURRENT_BUFFER_LVALUE->yy_n_chars = |
| (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; |
| |
| if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) |
| YY_FATAL_ERROR( "flex scanner push-back overflow" ); |
| } |
| |
| *--yy_cp = (char) c; |
| |
| if ( c == '\n' ){ |
| --yylineno; |
| } |
| |
| (yytext_ptr) = yy_bp; |
| (yy_hold_char) = *yy_cp; |
| (yy_c_buf_p) = yy_cp; |
| } |
| |
| #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. */ |
| yyrestart(yyin ); |
| |
| /*FALLTHROUGH*/ |
| |
| 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); |
| |
| YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n'); |
| if ( YY_CURRENT_BUFFER_LVALUE->yy_at_bol ) |
| |
| yylineno++; |
| ; |
| |
| 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 yyrestart (FILE * input_file ) |
| { |
| |
| if ( ! YY_CURRENT_BUFFER ){ |
| yyensure_buffer_stack (); |
| YY_CURRENT_BUFFER_LVALUE = |
| yy_create_buffer(yyin,YY_BUF_SIZE ); |
| } |
| |
| yy_init_buffer(YY_CURRENT_BUFFER,input_file ); |
| yy_load_buffer_state( ); |
| } |
| |
| /** Switch to a different input buffer. |
| * @param new_buffer The new input buffer. |
| * |
| */ |
| void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) |
| { |
| |
| /* TODO. We should be able to replace this entire function body |
| * with |
| * yypop_buffer_state(); |
| * yypush_buffer_state(new_buffer); |
| */ |
| yyensure_buffer_stack (); |
| if ( YY_CURRENT_BUFFER == new_buffer ) |
| return; |
| |
| if ( YY_CURRENT_BUFFER ) |
| { |
| /* Flush out information for old buffer. */ |
| *(yy_c_buf_p) = (yy_hold_char); |
| YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); |
| YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); |
| } |
| |
| YY_CURRENT_BUFFER_LVALUE = new_buffer; |
| 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; |
| } |
| |
| static void yy_load_buffer_state (void) |
| { |
| (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; |
| (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; |
| yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; |
| (yy_hold_char) = *(yy_c_buf_p); |
| } |
| |
| /** Allocate and initialize an input buffer state. |
| * @param file A readable stream. |
| * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. |
| * |
| * @return the allocated buffer state. |
| */ |
| YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) |
| { |
| YY_BUFFER_STATE b; |
| |
| b = (YY_BUFFER_STATE) yyalloc(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 *) yyalloc(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; |
| } |
| |
| /** Destroy the buffer. |
| * @param b a buffer created with yy_create_buffer() |
| * |
| */ |
| void yy_delete_buffer (YY_BUFFER_STATE b ) |
| { |
| |
| if ( ! b ) |
| return; |
| |
| if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ |
| YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; |
| |
| if ( b->yy_is_our_buffer ) |
| yyfree((void *) b->yy_ch_buf ); |
| |
| yyfree((void *) b ); |
| } |
| |
| #ifndef __cplusplus |
| extern int isatty (int ); |
| #endif /* __cplusplus */ |
| |
| /* Initializes or reinitializes a buffer. |
| * This function is sometimes called more than once on the same buffer, |
| * such as during a yyrestart() or at EOF. |
| */ |
| static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) |
| |
| { |
| int oerrno = errno; |
| |
| yy_flush_buffer(b ); |
| |
| b->yy_input_file = file; |
| b->yy_fill_buffer = 1; |
| |
| /* If b is the current buffer, then yy_init_buffer was _probably_ |
| * called from yyrestart() or through yy_get_next_buffer. |
| * In that case, we don't want to reset the lineno or column. |
| */ |
| if (b != YY_CURRENT_BUFFER){ |
| b->yy_bs_lineno = 1; |
| b->yy_bs_column = 0; |
| } |
| |
| b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; |
| |
| errno = oerrno; |
| } |
| |
| /** Discard all buffered characters. On the next scan, YY_INPUT will be called. |
| * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. |
| * |
| */ |
| void yy_flush_buffer (YY_BUFFER_STATE b ) |
| { |
| if ( ! b ) |
| return; |
| |
| b->yy_n_chars = 0; |
| |
| /* We always need two end-of-buffer characters. The first causes |
| * a transition to the end-of-buffer state. The second causes |
| * a jam in that state. |
| */ |
| b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; |
| b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; |
| |
| b->yy_buf_pos = &b->yy_ch_buf[0]; |
| |
| b->yy_at_bol = 1; |
| b->yy_buffer_status = YY_BUFFER_NEW; |
| |
| if ( b == YY_CURRENT_BUFFER ) |
| yy_load_buffer_state( ); |
| } |
| |
| /** Pushes the new state onto the stack. The new state becomes |
| * the current state. This function will allocate the stack |
| * if necessary. |
| * @param new_buffer The new state. |
| * |
| */ |
| void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) |
| { |
| if (new_buffer == NULL) |
| return; |
| |
| yyensure_buffer_stack(); |
| |
| /* This block is copied from yy_switch_to_buffer. */ |
| if ( YY_CURRENT_BUFFER ) |
| { |
| /* Flush out information for old buffer. */ |
| *(yy_c_buf_p) = (yy_hold_char); |
| YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); |
| YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); |
| } |
| |
| /* Only push if top exists. Otherwise, replace top. */ |
| if (YY_CURRENT_BUFFER) |
| (yy_buffer_stack_top)++; |
| YY_CURRENT_BUFFER_LVALUE = new_buffer; |
| |
| /* copied from yy_switch_to_buffer. */ |
| yy_load_buffer_state( ); |
| (yy_did_buffer_switch_on_eof) = 1; |
| } |
| |
| /** Removes and deletes the top of the stack, if present. |
| * The next element becomes the new top. |
| * |
| */ |
| void yypop_buffer_state (void) |
| { |
| if (!YY_CURRENT_BUFFER) |
| return; |
| |
| yy_delete_buffer(YY_CURRENT_BUFFER ); |
| YY_CURRENT_BUFFER_LVALUE = NULL; |
| if ((yy_buffer_stack_top) > 0) |
| --(yy_buffer_stack_top); |
| |
| if (YY_CURRENT_BUFFER) { |
| yy_load_buffer_state( ); |
| (yy_did_buffer_switch_on_eof) = 1; |
| } |
| } |
| |
| /* Allocates the stack if it does not exist. |
| * Guarantees space for at least one push. |
| */ |
| static void yyensure_buffer_stack (void) |
| { |
| 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**)yyalloc |
| (num_to_alloc * sizeof(struct yy_buffer_state*) |
| ); |
| |
| 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**)yyrealloc |
| ((yy_buffer_stack), |
| num_to_alloc * sizeof(struct yy_buffer_state*) |
| ); |
| |
| /* 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 yy_scan_buffer (char * base, yy_size_t size ) |
| { |
| YY_BUFFER_STATE b; |
| |
| if ( size < 2 || |
| base[size-2] != YY_END_OF_BUFFER_CHAR || |
| base[size-1] != YY_END_OF_BUFFER_CHAR ) |
| /* They forgot to leave room for the EOB's. */ |
| return 0; |
| |
| b = (YY_BUFFER_STATE) yyalloc(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; |
| } |
| |
| /** Setup the input buffer state to scan a string. The next call to yylex() will |
| * scan from a @e copy of @a str. |
| * @param str 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 |
| * yy_scan_bytes() instead. |
| */ |
| YY_BUFFER_STATE yy_scan_string (yyconst char * yy_str ) |
| { |
| |
| return yy_scan_bytes(yy_str,strlen(yy_str) ); |
| } |
| |
| /** Setup the input buffer state to scan the given bytes. The next call to yylex() 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 yy_scan_bytes (yyconst char * bytes, int 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 = len + 2; |
| buf = (char *) yyalloc(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; |
| } |
| |
| #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 yytext. */ \ |
| int yyless_macro_arg = (n); \ |
| YY_LESS_LINENO(yyless_macro_arg);\ |
| yytext[yyleng] = (yy_hold_char); \ |
| (yy_c_buf_p) = yytext + yyless_macro_arg; \ |
| (yy_hold_char) = *(yy_c_buf_p); \ |
| *(yy_c_buf_p) = '\0'; \ |
| yyleng = yyless_macro_arg; \ |
| } \ |
| while ( 0 ) |
| |
| /* Accessor methods (get/set functions) to struct members. */ |
| |
| /** Get the current line number. |
| * |
| */ |
| int yyget_lineno (void) |
| { |
| |
| return yylineno; |
| } |
| |
| /** Get the input stream. |
| * |
| */ |
| FILE *yyget_in (void) |
| { |
| return yyin; |
| } |
| |
| /** Get the output stream. |
| * |
| */ |
| FILE *yyget_out (void) |
| { |
| return yyout; |
| } |
| |
| /** Get the length of the current token. |
| * |
| */ |
| int yyget_leng (void) |
| { |
| return yyleng; |
| } |
| |
| /** Get the current token. |
| * |
| */ |
| |
| char *yyget_text (void) |
| { |
| return yytext; |
| } |
| |
| /** Set the current line number. |
| * @param line_number |
| * |
| */ |
| void yyset_lineno (int line_number ) |
| { |
| |
| yylineno = line_number; |
| } |
| |
| /** Set the input stream. This does not discard the current |
| * input buffer. |
| * @param in_str A readable stream. |
| * |
| * @see yy_switch_to_buffer |
| */ |
| void yyset_in (FILE * in_str ) |
| { |
| yyin = in_str ; |
| } |
| |
| void yyset_out (FILE * out_str ) |
| { |
| yyout = out_str ; |
| } |
| |
| int yyget_debug (void) |
| { |
| return yy_flex_debug; |
| } |
| |
| void yyset_debug (int bdebug ) |
| { |
| yy_flex_debug = bdebug ; |
| } |
| |
| /* yylex_destroy is for both reentrant and non-reentrant scanners. */ |
| int yylex_destroy (void) |
| { |
| |
| /* Pop the buffer stack, destroying each element. */ |
| while(YY_CURRENT_BUFFER){ |
| yy_delete_buffer(YY_CURRENT_BUFFER ); |
| YY_CURRENT_BUFFER_LVALUE = NULL; |
| yypop_buffer_state(); |
| } |
| |
| /* Destroy the stack itself. */ |
| yyfree((yy_buffer_stack) ); |
| (yy_buffer_stack) = NULL; |
| |
| yyfree ( (yy_state_buf) ); |
| |
| 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 *yyalloc (yy_size_t size ) |
| { |
| return (void *) malloc( size ); |
| } |
| |
| void *yyrealloc (void * ptr, yy_size_t size ) |
| { |
| /* The cast to (char *) in the following accommodates both |
| * implementations that use char* generic pointers, and those |
| * that use void* generic pointers. It works with the latter |
| * because both ANSI C and C++ allow castless assignment from |
| * any pointer type to void*, and deal with argument conversions |
| * as though doing an assignment. |
| */ |
| return (void *) realloc( (char *) ptr, size ); |
| } |
| |
| void yyfree (void * ptr ) |
| { |
| free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ |
| } |
| |
| #define YYTABLES_NAME "yytables" |
| |
| #undef YY_NEW_FILE |
| #undef YY_FLUSH_BUFFER |
| #undef yy_set_bol |
| #undef yy_new_buffer |
| #undef yy_set_interactive |
| #undef yytext_ptr |
| #undef YY_DO_BEFORE_ACTION |
| |
| #ifdef YY_DECL_IS_OURS |
| #undef YY_DECL_IS_OURS |
| #undef YY_DECL |
| #endif |
| #line 277 "scan.l" |
| |
| |
| /* |
| * the BEGIN macro only exists in the lex file, so define a routine to |
| * BEGIN the CUTS state. |
| */ |
| int |
| begin_cuts() |
| { |
| BEGIN CUTS; |
| return 0; |
| } |
| |
| /* |
| * Calls lex repeatedly until all input is seen. |
| */ |
| int |
| scanner(tags) |
| SYM tags; |
| { |
| alltags = tags; /* move into global scope for lex actions */ |
| |
| while(yylex()) |
| ; |
| |
| return 0; |
| } |
| |
| /* |
| * Test-Output record |
| * check if this is a CUTS test; if so, enter the lex "cuts" state; |
| * otherwise do nothing and lex will be in a "data" mode that will just |
| * toss all the output. |
| */ |
| static int |
| test_output(tag, keys) |
| SYM tag, keys; |
| { |
| char *at; |
| |
| if((at=(char *)sym_get(keys, "analysis")) != NULL) { |
| /* CUTS:number_of_testcases || CUTS-1:number_of_testcases */ |
| if(strncasecmp("cuts", at, 4) == 0) { |
| begin_cuts(); |
| /*printf("CUTS output expected\n");*/ |
| } |
| } |
| return 0; |
| } |
| |
| /* Input Data State Check |
| * RTS driver output goes thru specific |
| * phases; this is used to verify that the new state is a legal state |
| * to change to from the current state. |
| * This accepts a variable number of arguments (valid states to be |
| * in). The last argument MUST be zero |
| */ |
| struct parse_states { |
| char *name; |
| int bits; |
| } parse_states[] = { |
| { "outside", SCAN_OUTSIDE }, |
| { "rts_keyword_start", SCAN_RTSKEY }, |
| { "test_start | execution_status", SCAN_TSTKEY }, |
| { "test_output", SCAN_OUTPUT }, |
| { "unknown", 0 }, /*end sentinel: bits = 0 */ |
| }; |
| |
| static int |
| check_mode(int scan_mode, int fst, ...) |
| { |
| va_list ap; /* used for variable argument functions*/ |
| int found=0; /* set to true if a valid state was found */ |
| int ckm; /* Check Mode: the mode to look for */ |
| register struct parse_states *ps; /* for looking thru parse_states */ |
| char exp_mode[KEYSIZE]; /* expected mode list (for error message) */ |
| |
| extern int yylineno; /* Line number from Lex */ |
| |
| /* look thru parse_states; end sentinel is "bits" = 0 */ |
| for(ps=parse_states; ps->bits && (ps->bits != fst);ps++) |
| ; |
| strcpy(exp_mode, ps->name); |
| |
| /* look at first variable argument */ |
| if(fst == scan_mode) |
| found++; |
| else { |
| /* not first... look at variable args */ |
| va_start(ap, fst); |
| while(((ckm = va_arg(ap, int)) != 0) && (ckm != scan_mode)) { |
| for(ps=parse_states; ps->bits && (ps->bits != ckm);ps++) |
| ; |
| strcat(exp_mode, ", "); |
| strcat(exp_mode, ps->name); |
| } |
| va_end(ap); |
| |
| if(ckm == scan_mode) |
| found++; |
| } |
| |
| if(!found) { |
| for(ps=parse_states; ps->bits && (ps->bits != scan_mode);ps++) |
| ; |
| |
| fprintf(stderr, "PARSE ERROR -- Line %d found %s in mode %s[%d] expected { %s }\n", |
| yylineno, yytext, ps->name, scan_mode, exp_mode); |
| } |
| |
| return 0; |
| } |
| |
| /* |
| * This part of the file contains subroutines called by a lex scanner which |
| * is parsing rts-driver-format input and putting it into a multi-level |
| * symbol table. |
| */ |
| |
| /* |
| * References to lex variables |
| */ |
| /*extern char yytext[]; / * text matched by last pattern */ |
| /*extern long yyleng; / * length of above */ |
| |
| char **filenames; |
| |
| int |
| lex_files(char **names) |
| { |
| /* lex */ |
| extern FILE *yyin; |
| |
| filenames = names; |
| |
| if(*filenames != NULL) { |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN, 1) |
| printf("lex_files: first file is %s\n", *filenames); |
| #endif |
| if((yyin = fopen(*filenames, "r")) == NULL) { |
| printf("Error opening %s for reading\n", *filenames); |
| exit(1); |
| } |
| } |
| |
| return 0; |
| } |
| |
| /* |
| * Called by lex's end-of-file processing. |
| * Open the next file on the command line. If there is no next file, |
| * return "-1" and lex will end. |
| */ |
| int |
| yywrap() |
| { |
| extern FILE *yyin; |
| extern int yylineno; /* Line number from Lex */ |
| |
| if(*filenames != NULL) |
| if(*++filenames != NULL) { |
| #ifdef DEBUGGING |
| DEBUG(D_SCAN, 1) |
| printf("yywrap: next file is %s\n", *filenames); |
| #endif |
| yylineno=1; |
| if((yyin = fopen(*filenames, "r")) != NULL) |
| return(0); |
| else { |
| printf("Error opening %s for reading\n", *filenames); |
| return(1); |
| } |
| } |
| |
| return(-1); |
| } |
| |
| |