| |
| #line 3 "scripts/genksyms/lex.lex.c_shipped" |
| |
| #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 35 |
| #if YY_FLEX_SUBMINOR_VERSION > 0 |
| #define FLEX_BETA |
| #endif |
| |
| /* First, we deal with platform-specific or compiler-specific issues. */ |
| |
| /* begin standard C headers. */ |
| #include <stdio.h> |
| #include <string.h> |
| #include <errno.h> |
| #include <stdlib.h> |
| |
| /* end standard C headers. */ |
| |
| /* flex integer type definitions */ |
| |
| #ifndef FLEXINT_H |
| #define FLEXINT_H |
| |
| /* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */ |
| |
| #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L |
| |
| /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, |
| * if you want the limit (max/min) macros for int types. |
| */ |
| #ifndef __STDC_LIMIT_MACROS |
| #define __STDC_LIMIT_MACROS 1 |
| #endif |
| |
| #include <inttypes.h> |
| typedef int8_t flex_int8_t; |
| typedef uint8_t flex_uint8_t; |
| typedef int16_t flex_int16_t; |
| typedef uint16_t flex_uint16_t; |
| typedef int32_t flex_int32_t; |
| typedef uint32_t flex_uint32_t; |
| #else |
| typedef signed char flex_int8_t; |
| typedef short int flex_int16_t; |
| typedef int flex_int32_t; |
| typedef unsigned char flex_uint8_t; |
| typedef unsigned short int flex_uint16_t; |
| typedef unsigned int flex_uint32_t; |
| #endif /* ! C99 */ |
| |
| /* Limits of integral types. */ |
| #ifndef INT8_MIN |
| #define INT8_MIN (-128) |
| #endif |
| #ifndef INT16_MIN |
| #define INT16_MIN (-32767-1) |
| #endif |
| #ifndef INT32_MIN |
| #define INT32_MIN (-2147483647-1) |
| #endif |
| #ifndef INT8_MAX |
| #define INT8_MAX (127) |
| #endif |
| #ifndef INT16_MAX |
| #define INT16_MAX (32767) |
| #endif |
| #ifndef INT32_MAX |
| #define INT32_MAX (2147483647) |
| #endif |
| #ifndef UINT8_MAX |
| #define UINT8_MAX (255U) |
| #endif |
| #ifndef UINT16_MAX |
| #define UINT16_MAX (65535U) |
| #endif |
| #ifndef UINT32_MAX |
| #define UINT32_MAX (4294967295U) |
| #endif |
| |
| #endif /* ! FLEXINT_H */ |
| |
| #ifdef __cplusplus |
| |
| /* The "const" storage-class-modifier is valid. */ |
| #define YY_USE_CONST |
| |
| #else /* ! __cplusplus */ |
| |
| /* C99 requires __STDC__ to be defined as 1. */ |
| #if defined (__STDC__) |
| |
| #define YY_USE_CONST |
| |
| #endif /* defined (__STDC__) */ |
| #endif /* ! __cplusplus */ |
| |
| #ifdef YY_USE_CONST |
| #define yyconst const |
| #else |
| #define yyconst |
| #endif |
| |
| /* Returned upon end-of-file. */ |
| #define YY_NULL 0 |
| |
| /* Promotes a possibly negative, possibly signed char to an unsigned |
| * integer for use as an array index. If the signed char is negative, |
| * we want to instead treat it as an 8-bit unsigned char, hence the |
| * double cast. |
| */ |
| #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) |
| |
| /* Enter a start condition. This macro really ought to take a parameter, |
| * but we do it the disgusting crufty way forced on us by the ()-less |
| * definition of BEGIN. |
| */ |
| #define BEGIN (yy_start) = 1 + 2 * |
| |
| /* Translate the current start state into a value that can be later handed |
| * to BEGIN to return to the state. The YYSTATE alias is for lex |
| * compatibility. |
| */ |
| #define YY_START (((yy_start) - 1) / 2) |
| #define YYSTATE YY_START |
| |
| /* Action number for EOF rule of a given start state. */ |
| #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) |
| |
| /* Special action meaning "start processing a new file". */ |
| #define YY_NEW_FILE yyrestart(yyin ) |
| |
| #define YY_END_OF_BUFFER_CHAR 0 |
| |
| /* Size of default input buffer. */ |
| #ifndef YY_BUF_SIZE |
| #define YY_BUF_SIZE 16384 |
| #endif |
| |
| /* The state buf must be large enough to hold one state per character in the main buffer. |
| */ |
| #define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) |
| |
| #ifndef YY_TYPEDEF_YY_BUFFER_STATE |
| #define YY_TYPEDEF_YY_BUFFER_STATE |
| typedef struct yy_buffer_state *YY_BUFFER_STATE; |
| #endif |
| |
| extern int yyleng; |
| |
| extern FILE *yyin, *yyout; |
| |
| #define EOB_ACT_CONTINUE_SCAN 0 |
| #define EOB_ACT_END_OF_FILE 1 |
| #define EOB_ACT_LAST_MATCH 2 |
| |
| #define YY_LESS_LINENO(n) |
| |
| /* Return all but the first "n" matched characters back to the input stream. */ |
| #define yyless(n) \ |
| do \ |
| { \ |
| /* Undo effects of setting up 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) ) |
| |
| #ifndef YY_TYPEDEF_YY_SIZE_T |
| #define YY_TYPEDEF_YY_SIZE_T |
| typedef size_t yy_size_t; |
| #endif |
| |
| #ifndef YY_STRUCT_YY_BUFFER_STATE |
| #define YY_STRUCT_YY_BUFFER_STATE |
| struct yy_buffer_state |
| { |
| FILE *yy_input_file; |
| |
| char *yy_ch_buf; /* input buffer */ |
| char *yy_buf_pos; /* current position in input buffer */ |
| |
| /* Size of input buffer in bytes, not including room for EOB |
| * characters. |
| */ |
| yy_size_t yy_buf_size; |
| |
| /* Number of characters read into yy_ch_buf, not including EOB |
| * characters. |
| */ |
| int yy_n_chars; |
| |
| /* Whether we "own" the buffer - i.e., we know we created it, |
| * and can realloc() it to grow it, and should free() it to |
| * delete it. |
| */ |
| int yy_is_our_buffer; |
| |
| /* Whether this is an "interactive" input source; if so, and |
| * if we're using stdio for input, then we want to use getc() |
| * instead of fread(), to make sure we stop fetching input after |
| * each newline. |
| */ |
| int yy_is_interactive; |
| |
| /* Whether we're considered to be at the beginning of a line. |
| * If so, '^' rules will be active on the next match, otherwise |
| * not. |
| */ |
| int yy_at_bol; |
| |
| int yy_bs_lineno; /**< The line count. */ |
| int yy_bs_column; /**< The column count. */ |
| |
| /* Whether to try to fill the input buffer when we reach the |
| * end of it. |
| */ |
| int yy_fill_buffer; |
| |
| int yy_buffer_status; |
| |
| #define YY_BUFFER_NEW 0 |
| #define YY_BUFFER_NORMAL 1 |
| /* When an EOF's been seen but there's still some text to process |
| * then we mark the buffer as YY_EOF_PENDING, to indicate that we |
| * shouldn't try reading from the input source any more. We might |
| * still have a bunch of tokens to match, though, because of |
| * possible backing-up. |
| * |
| * When we actually see the EOF, we change the status to "new" |
| * (via 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 = 0; /* 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 */ |
| |
| #define yywrap(n) 1 |
| #define YY_SKIP_YYWRAP |
| |
| typedef unsigned char YY_CHAR; |
| |
| FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; |
| |
| typedef int yy_state_type; |
| |
| extern int yylineno; |
| |
| int yylineno = 1; |
| |
| extern char *yytext; |
| #define yytext_ptr 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'; \ |
| (yy_c_buf_p) = yy_cp; |
| |
| #define YY_NUM_RULES 13 |
| #define YY_END_OF_BUFFER 14 |
| /* This struct is not used in this scanner, |
| but its presence is necessary. */ |
| struct yy_trans_info |
| { |
| flex_int32_t yy_verify; |
| flex_int32_t yy_nxt; |
| }; |
| static yyconst flex_int16_t yy_accept[73] = |
| { 0, |
| 0, 0, 14, 12, 4, 3, 12, 7, 12, 12, |
| 12, 12, 12, 9, 9, 12, 12, 7, 12, 12, |
| 4, 0, 5, 0, 7, 8, 0, 6, 0, 0, |
| 10, 10, 9, 0, 0, 9, 9, 0, 9, 0, |
| 0, 0, 0, 2, 0, 0, 11, 0, 10, 0, |
| 10, 9, 9, 0, 0, 0, 10, 10, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 1, 0 |
| } ; |
| |
| static yyconst flex_int32_t yy_ec[256] = |
| { 0, |
| 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, |
| 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 2, 1, 5, 6, 7, 8, 9, 10, 1, |
| 1, 8, 11, 1, 12, 13, 8, 14, 15, 15, |
| 15, 15, 15, 15, 15, 16, 16, 1, 1, 17, |
| 18, 19, 1, 1, 20, 20, 20, 20, 21, 22, |
| 7, 7, 7, 7, 7, 23, 7, 7, 7, 7, |
| 7, 7, 7, 7, 24, 7, 7, 25, 7, 7, |
| 1, 26, 1, 8, 7, 1, 20, 20, 20, 20, |
| |
| 21, 22, 7, 7, 7, 7, 7, 27, 7, 7, |
| 7, 7, 7, 7, 7, 7, 24, 7, 7, 25, |
| 7, 7, 1, 28, 1, 8, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 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, 1, 2, 1, 1, 1, 3, 1, 1, 1, |
| 4, 4, 5, 6, 6, 6, 1, 1, 1, 7, |
| 8, 7, 3, 3, 3, 1, 3, 1 |
| } ; |
| |
| static yyconst flex_int16_t yy_base[85] = |
| { 0, |
| 0, 145, 150, 266, 27, 266, 25, 0, 131, 23, |
| 23, 16, 23, 39, 31, 25, 39, 60, 22, 65, |
| 57, 43, 266, 0, 0, 266, 61, 266, 0, 128, |
| 74, 0, 113, 59, 62, 113, 52, 0, 0, 72, |
| 66, 110, 100, 266, 73, 74, 266, 70, 266, 90, |
| 103, 266, 84, 129, 108, 113, 143, 266, 107, 66, |
| 118, 137, 168, 120, 80, 91, 145, 143, 83, 41, |
| 266, 266, 190, 196, 204, 212, 220, 228, 232, 237, |
| 238, 243, 249, 257 |
| } ; |
| |
| static yyconst flex_int16_t yy_def[85] = |
| { 0, |
| 72, 1, 72, 72, 72, 72, 73, 74, 72, 72, |
| 75, 72, 72, 72, 14, 72, 72, 74, 72, 76, |
| 72, 73, 72, 77, 74, 72, 75, 72, 78, 72, |
| 72, 31, 14, 79, 80, 72, 72, 81, 15, 73, |
| 75, 76, 76, 72, 73, 75, 72, 82, 72, 72, |
| 72, 72, 81, 76, 54, 72, 72, 72, 76, 54, |
| 76, 76, 76, 54, 83, 76, 63, 83, 84, 84, |
| 72, 0, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72 |
| } ; |
| |
| static yyconst flex_int16_t yy_nxt[295] = |
| { 0, |
| 4, 5, 6, 5, 7, 4, 8, 9, 10, 11, |
| 9, 12, 13, 14, 15, 15, 16, 9, 17, 8, |
| 8, 8, 18, 8, 8, 4, 8, 19, 21, 23, |
| 21, 26, 28, 26, 26, 30, 31, 31, 31, 26, |
| 26, 26, 26, 71, 39, 39, 39, 23, 29, 26, |
| 24, 32, 33, 33, 34, 72, 26, 26, 21, 35, |
| 21, 36, 37, 38, 40, 36, 43, 44, 24, 41, |
| 28, 32, 50, 50, 52, 28, 23, 23, 52, 35, |
| 56, 56, 44, 28, 42, 71, 29, 31, 31, 31, |
| 42, 29, 59, 44, 48, 49, 49, 24, 24, 29, |
| |
| 49, 43, 44, 51, 51, 51, 36, 37, 59, 44, |
| 36, 65, 44, 54, 55, 55, 51, 51, 51, 59, |
| 44, 64, 64, 64, 58, 58, 57, 57, 57, 58, |
| 59, 44, 42, 64, 64, 64, 52, 72, 59, 44, |
| 47, 66, 60, 60, 42, 44, 59, 69, 26, 72, |
| 20, 61, 62, 63, 72, 61, 57, 57, 57, 66, |
| 72, 72, 72, 66, 49, 49, 72, 61, 62, 49, |
| 44, 61, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 67, 67, 67, 72, 72, 72, 67, 67, 67, |
| 22, 22, 22, 22, 22, 22, 22, 22, 25, 72, |
| |
| 72, 25, 25, 25, 27, 27, 27, 27, 27, 27, |
| 27, 27, 42, 42, 42, 42, 42, 42, 42, 42, |
| 45, 72, 45, 45, 45, 45, 45, 45, 46, 72, |
| 46, 46, 46, 46, 46, 46, 34, 34, 72, 34, |
| 51, 72, 51, 53, 53, 53, 57, 72, 57, 68, |
| 68, 68, 68, 68, 68, 68, 68, 70, 70, 70, |
| 70, 70, 70, 70, 70, 3, 72, 72, 72, 72, |
| 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72 |
| |
| } ; |
| |
| static yyconst flex_int16_t yy_chk[295] = |
| { 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, 5, 7, |
| 5, 10, 11, 12, 12, 13, 13, 13, 13, 19, |
| 10, 16, 16, 70, 15, 15, 15, 22, 11, 19, |
| 7, 14, 14, 14, 14, 15, 17, 17, 21, 14, |
| 21, 14, 14, 14, 18, 14, 20, 20, 22, 18, |
| 27, 34, 35, 35, 37, 41, 40, 45, 37, 34, |
| 48, 48, 65, 46, 65, 69, 27, 31, 31, 31, |
| 60, 41, 66, 66, 31, 31, 31, 40, 45, 46, |
| |
| 31, 43, 43, 50, 50, 50, 53, 53, 59, 59, |
| 53, 59, 42, 43, 43, 43, 51, 51, 51, 61, |
| 61, 55, 55, 55, 51, 51, 56, 56, 56, 51, |
| 54, 54, 55, 64, 64, 64, 36, 33, 62, 62, |
| 30, 61, 54, 54, 64, 68, 67, 68, 9, 3, |
| 2, 54, 54, 54, 0, 54, 57, 57, 57, 62, |
| 0, 0, 0, 62, 57, 57, 0, 67, 67, 57, |
| 63, 67, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 63, 63, 63, 0, 0, 0, 63, 63, 63, |
| 73, 73, 73, 73, 73, 73, 73, 73, 74, 0, |
| |
| 0, 74, 74, 74, 75, 75, 75, 75, 75, 75, |
| 75, 75, 76, 76, 76, 76, 76, 76, 76, 76, |
| 77, 0, 77, 77, 77, 77, 77, 77, 78, 0, |
| 78, 78, 78, 78, 78, 78, 79, 79, 0, 79, |
| 80, 0, 80, 81, 81, 81, 82, 0, 82, 83, |
| 83, 83, 83, 83, 83, 83, 83, 84, 84, 84, |
| 84, 84, 84, 84, 84, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, |
| 72, 72, 72, 72 |
| |
| } ; |
| |
| static yy_state_type yy_last_accepting_state; |
| static char *yy_last_accepting_cpos; |
| |
| extern int yy_flex_debug; |
| int yy_flex_debug = 0; |
| |
| /* The intent behind this definition is that it'll catch |
| * any uses of REJECT which flex missed. |
| */ |
| #define REJECT reject_used_but_not_detected |
| #define yymore() yymore_used_but_not_detected |
| #define YY_MORE_ADJ 0 |
| #define YY_RESTORE_YY_MORE_OFFSET |
| char *yytext; |
| /* Lexical analysis for genksyms. |
| Copyright 1996, 1997 Linux International. |
| |
| New implementation contributed by Richard Henderson <rth@tamu.edu> |
| Based on original work by Bjorn Ekwall <bj0rn@blox.se> |
| |
| Taken from Linux modutils 2.4.22. |
| |
| This program is free software; you can redistribute it and/or modify it |
| under the terms of the GNU General Public License as published by the |
| Free Software Foundation; either version 2 of the License, or (at your |
| option) any later version. |
| |
| This program is distributed in the hope that it will be useful, but |
| WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program; if not, write to the Free Software Foundation, |
| Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ |
| |
| #include <limits.h> |
| #include <stdlib.h> |
| #include <string.h> |
| #include <ctype.h> |
| |
| #include "genksyms.h" |
| #include "parse.tab.h" |
| |
| /* We've got a two-level lexer here. We let flex do basic tokenization |
| and then we categorize those basic tokens in the second stage. */ |
| #define YY_DECL static int yylex1(void) |
| |
| /* We don't do multiple input files. */ |
| #define YY_NO_INPUT 1 |
| |
| #define INITIAL 0 |
| |
| #ifndef YY_NO_UNISTD_H |
| /* Special case for "unistd.h", since it is non-ANSI. We include it way |
| * down here because we want the user's section 1 to have been scanned first. |
| * The user has a chance to override it with an option. |
| */ |
| #include <unistd.h> |
| #endif |
| |
| #ifndef YY_EXTRA_TYPE |
| #define YY_EXTRA_TYPE void * |
| #endif |
| |
| static int yy_init_globals (void ); |
| |
| /* Accessor methods to globals. |
| These are made visible to non-reentrant scanners for convenience. */ |
| |
| int yylex_destroy (void ); |
| |
| int yyget_debug (void ); |
| |
| void yyset_debug (int debug_flag ); |
| |
| YY_EXTRA_TYPE yyget_extra (void ); |
| |
| void yyset_extra (YY_EXTRA_TYPE user_defined ); |
| |
| FILE *yyget_in (void ); |
| |
| void yyset_in (FILE * in_str ); |
| |
| FILE *yyget_out (void ); |
| |
| void yyset_out (FILE * out_str ); |
| |
| int yyget_leng (void ); |
| |
| char *yyget_text (void ); |
| |
| int yyget_lineno (void ); |
| |
| void yyset_lineno (int line_number ); |
| |
| /* Macros after this point can all be overridden by user definitions in |
| * section 1. |
| */ |
| |
| #ifndef YY_SKIP_YYWRAP |
| #ifdef __cplusplus |
| extern "C" int 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 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 = '*'; \ |
| int 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; |
| |
| /* Keep track of our location in the original source files. */ |
| |
| if ( !(yy_init) ) |
| { |
| (yy_init) = 1; |
| |
| #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 ) { |
| 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_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 >= 73 ) |
| 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] != 266 ); |
| |
| 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: |
| /* rule 1 can match eol */ |
| YY_RULE_SETUP |
| return FILENAME; |
| YY_BREAK |
| case 2: |
| /* rule 2 can match eol */ |
| YY_RULE_SETUP |
| cur_line++; |
| YY_BREAK |
| case 3: |
| /* rule 3 can match eol */ |
| YY_RULE_SETUP |
| cur_line++; |
| YY_BREAK |
| /* Ignore all other whitespace. */ |
| case 4: |
| YY_RULE_SETUP |
| ; |
| YY_BREAK |
| case 5: |
| /* rule 5 can match eol */ |
| YY_RULE_SETUP |
| return STRING; |
| YY_BREAK |
| case 6: |
| /* rule 6 can match eol */ |
| YY_RULE_SETUP |
| return CHAR; |
| YY_BREAK |
| case 7: |
| YY_RULE_SETUP |
| return IDENT; |
| YY_BREAK |
| /* The Pedant requires that the other C multi-character tokens be |
| recognized as tokens. We don't actually use them since we don't |
| parse expressions, but we do want whitespace to be arranged |
| around them properly. */ |
| case 8: |
| YY_RULE_SETUP |
| return OTHER; |
| YY_BREAK |
| case 9: |
| YY_RULE_SETUP |
| return INT; |
| YY_BREAK |
| case 10: |
| YY_RULE_SETUP |
| return REAL; |
| YY_BREAK |
| case 11: |
| YY_RULE_SETUP |
| return DOTS; |
| YY_BREAK |
| /* All other tokens are single characters. */ |
| case 12: |
| YY_RULE_SETUP |
| return yytext[0]; |
| YY_BREAK |
| case 13: |
| YY_RULE_SETUP |
| ECHO; |
| YY_BREAK |
| case YY_STATE_EOF(INITIAL): |
| 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. */ |
| |
| /* 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. */ |
| yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); |
| } |
| else |
| /* Can't grow it, we don't own it. */ |
| b->yy_ch_buf = 0; |
| |
| if ( ! b->yy_ch_buf ) |
| YY_FATAL_ERROR( |
| "fatal error - scanner input buffer overflow" ); |
| |
| (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; |
| |
| num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - |
| number_to_move - 1; |
| |
| } |
| |
| if ( num_to_read > YY_READ_BUF_SIZE ) |
| num_to_read = YY_READ_BUF_SIZE; |
| |
| /* Read in more data. */ |
| YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), |
| (yy_n_chars), (size_t) num_to_read ); |
| |
| YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); |
| } |
| |
| if ( (yy_n_chars) == 0 ) |
| { |
| if ( number_to_move == YY_MORE_ADJ ) |
| { |
| ret_val = EOB_ACT_END_OF_FILE; |
| 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; |
| |
| if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { |
| /* Extend the array by 50%, plus the number we really need. */ |
| yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); |
| YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); |
| if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) |
| YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); |
| } |
| |
| (yy_n_chars) += number_to_move; |
| YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; |
| YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; |
| |
| (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; |
| |
| return ret_val; |
| } |
| |
| /* yy_get_previous_state - get the state just before the EOB char was reached */ |
| |
| static yy_state_type yy_get_previous_state (void) |
| { |
| register yy_state_type yy_current_state; |
| register char *yy_cp; |
| |
| yy_current_state = (yy_start); |
| yy_current_state += YY_AT_BOL(); |
| |
| 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 >= 73 ) |
| yy_c = yy_meta[(unsigned int) yy_c]; |
| } |
| yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; |
| } |
| |
| return yy_current_state; |
| } |
| |
| /* yy_try_NUL_trans - try to make a transition on the NUL character |
| * |
| * synopsis |
| * next_state = yy_try_NUL_trans( current_state ); |
| */ |
| static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) |
| { |
| register int yy_is_jam; |
| register char *yy_cp = (yy_c_buf_p); |
| |
| register YY_CHAR yy_c = 1; |
| if ( yy_accept[yy_current_state] ) |
| { |
| (yy_last_accepting_state) = yy_current_state; |
| (yy_last_accepting_cpos) = yy_cp; |
| } |
| while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) |
| { |
| yy_current_state = (int) yy_def[yy_current_state]; |
| if ( yy_current_state >= 73 ) |
| 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 == 72); |
| |
| 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; |
| |
| (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'); |
| |
| 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*) |
| ); |
| if ( ! (yy_buffer_stack) ) |
| YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); |
| |
| memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); |
| |
| (yy_buffer_stack_max) = num_to_alloc; |
| (yy_buffer_stack_top) = 0; |
| return; |
| } |
| |
| if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ |
| |
| /* Increase the buffer to prepare for a possible push. */ |
| int grow_size = 8 /* arbitrary grow size */; |
| |
| num_to_alloc = (yy_buffer_stack_max) + grow_size; |
| (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc |
| ((yy_buffer_stack), |
| num_to_alloc * sizeof(struct yy_buffer_state*) |
| ); |
| if ( ! (yy_buffer_stack) ) |
| YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); |
| |
| /* zero only the new slots.*/ |
| memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); |
| (yy_buffer_stack_max) = num_to_alloc; |
| } |
| } |
| |
| /** Setup the input buffer state to scan directly from a user-specified character buffer. |
| * @param base the character buffer |
| * @param size the size in bytes of the character buffer |
| * |
| * @return the newly allocated buffer state object. |
| */ |
| YY_BUFFER_STATE 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 yystr a NUL-terminated string to scan |
| * |
| * @return the newly allocated buffer state object. |
| * @note If you want to scan bytes that may contain NUL values, then use |
| * yy_scan_bytes() instead. |
| */ |
| YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) |
| { |
| |
| return yy_scan_bytes(yystr,strlen(yystr) ); |
| } |
| |
| /** 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 * yybytes, int _yybytes_len ) |
| { |
| YY_BUFFER_STATE b; |
| char *buf; |
| yy_size_t n; |
| int i; |
| |
| /* Get memory for full buffer, including space for trailing EOB's. */ |
| n = _yybytes_len + 2; |
| buf = (char *) yyalloc(n ); |
| if ( ! buf ) |
| YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); |
| |
| for ( i = 0; i < _yybytes_len; ++i ) |
| buf[i] = yybytes[i]; |
| |
| buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; |
| |
| b = 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 ; |
| } |
| |
| static int yy_init_globals (void) |
| { |
| /* Initialization is the same as for the non-reentrant scanner. |
| * This function is called from yylex_destroy(), so don't allocate here. |
| */ |
| |
| (yy_buffer_stack) = 0; |
| (yy_buffer_stack_top) = 0; |
| (yy_buffer_stack_max) = 0; |
| (yy_c_buf_p) = (char *) 0; |
| (yy_init) = 0; |
| (yy_start) = 0; |
| |
| /* Defined in main.c */ |
| #ifdef YY_STDINIT |
| yyin = stdin; |
| yyout = stdout; |
| #else |
| yyin = (FILE *) 0; |
| yyout = (FILE *) 0; |
| #endif |
| |
| /* For future reference: Set errno on error, since we are called by |
| * yylex_init() |
| */ |
| return 0; |
| } |
| |
| /* 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; |
| |
| /* Reset the globals. This is important in a non-reentrant scanner so the next time |
| * yylex() is called, initialization will occur. */ |
| yy_init_globals( ); |
| |
| return 0; |
| } |
| |
| /* |
| * Internal utility routines. |
| */ |
| |
| #ifndef yytext_ptr |
| static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) |
| { |
| register int i; |
| for ( i = 0; i < n; ++i ) |
| s1[i] = s2[i]; |
| } |
| #endif |
| |
| #ifdef YY_NEED_STRLEN |
| static int yy_flex_strlen (yyconst char * s ) |
| { |
| register int n; |
| for ( n = 0; s[n]; ++n ) |
| ; |
| |
| return n; |
| } |
| #endif |
| |
| void *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" |
| |
| /* Bring in the keyword recognizer. */ |
| |
| #include "keywords.c" |
| |
| /* Macros to append to our phrase collection list. */ |
| |
| /* |
| * We mark any token, that that equals to a known enumerator, as |
| * SYM_ENUM_CONST. The parser will change this for struct and union tags later, |
| * the only problem is struct and union members: |
| * enum e { a, b }; struct s { int a, b; } |
| * but in this case, the only effect will be, that the ABI checksums become |
| * more volatile, which is acceptable. Also, such collisions are quite rare, |
| * so far it was only observed in include/linux/telephony.h. |
| */ |
| #define _APP(T,L) do { \ |
| cur_node = next_node; \ |
| next_node = xmalloc(sizeof(*next_node)); \ |
| next_node->next = cur_node; \ |
| cur_node->string = memcpy(xmalloc(L+1), T, L+1); \ |
| cur_node->tag = \ |
| find_symbol(cur_node->string, SYM_ENUM_CONST, 1)?\ |
| SYM_ENUM_CONST : SYM_NORMAL ; \ |
| cur_node->in_source_file = in_source_file; \ |
| } while (0) |
| |
| #define APP _APP(yytext, yyleng) |
| |
| /* The second stage lexer. Here we incorporate knowledge of the state |
| of the parser to tailor the tokens that are returned. */ |
| |
| int |
| yylex(void) |
| { |
| static enum { |
| ST_NOTSTARTED, ST_NORMAL, ST_ATTRIBUTE, ST_ASM, ST_TYPEOF, ST_TYPEOF_1, |
| ST_BRACKET, ST_BRACE, ST_EXPRESSION, |
| ST_TABLE_1, ST_TABLE_2, ST_TABLE_3, ST_TABLE_4, |
| ST_TABLE_5, ST_TABLE_6 |
| } lexstate = ST_NOTSTARTED; |
| |
| static int suppress_type_lookup, dont_want_brace_phrase; |
| static struct string_list *next_node; |
| |
| int token, count = 0; |
| struct string_list *cur_node; |
| |
| if (lexstate == ST_NOTSTARTED) |
| { |
| next_node = xmalloc(sizeof(*next_node)); |
| next_node->next = NULL; |
| lexstate = ST_NORMAL; |
| } |
| |
| repeat: |
| token = yylex1(); |
| |
| if (token == 0) |
| return 0; |
| else if (token == FILENAME) |
| { |
| char *file, *e; |
| |
| /* Save the filename and line number for later error messages. */ |
| |
| if (cur_filename) |
| free(cur_filename); |
| |
| file = strchr(yytext, '\"')+1; |
| e = strchr(file, '\"'); |
| *e = '\0'; |
| cur_filename = memcpy(xmalloc(e-file+1), file, e-file+1); |
| cur_line = atoi(yytext+2); |
| |
| if (!source_file) { |
| source_file = xstrdup(cur_filename); |
| in_source_file = 1; |
| } else { |
| in_source_file = (strcmp(cur_filename, source_file) == 0); |
| } |
| |
| goto repeat; |
| } |
| |
| switch (lexstate) |
| { |
| case ST_NORMAL: |
| switch (token) |
| { |
| case IDENT: |
| APP; |
| { |
| int r = is_reserved_word(yytext, yyleng); |
| if (r >= 0) |
| { |
| switch (token = r) |
| { |
| case ATTRIBUTE_KEYW: |
| lexstate = ST_ATTRIBUTE; |
| count = 0; |
| goto repeat; |
| case ASM_KEYW: |
| lexstate = ST_ASM; |
| count = 0; |
| goto repeat; |
| case TYPEOF_KEYW: |
| lexstate = ST_TYPEOF; |
| count = 0; |
| goto repeat; |
| |
| case STRUCT_KEYW: |
| case UNION_KEYW: |
| case ENUM_KEYW: |
| dont_want_brace_phrase = 3; |
| suppress_type_lookup = 2; |
| goto fini; |
| |
| case EXPORT_SYMBOL_KEYW: |
| goto fini; |
| } |
| } |
| if (!suppress_type_lookup) |
| { |
| if (find_symbol(yytext, SYM_TYPEDEF, 1)) |
| token = TYPE; |
| } |
| } |
| break; |
| |
| case '[': |
| APP; |
| lexstate = ST_BRACKET; |
| count = 1; |
| goto repeat; |
| |
| case '{': |
| APP; |
| if (dont_want_brace_phrase) |
| break; |
| lexstate = ST_BRACE; |
| count = 1; |
| goto repeat; |
| |
| case '=': case ':': |
| APP; |
| lexstate = ST_EXPRESSION; |
| break; |
| |
| case DOTS: |
| default: |
| APP; |
| break; |
| } |
| break; |
| |
| case ST_ATTRIBUTE: |
| APP; |
| switch (token) |
| { |
| case '(': |
| ++count; |
| goto repeat; |
| case ')': |
| if (--count == 0) |
| { |
| lexstate = ST_NORMAL; |
| token = ATTRIBUTE_PHRASE; |
| break; |
| } |
| goto repeat; |
| default: |
| goto repeat; |
| } |
| break; |
| |
| case ST_ASM: |
| APP; |
| switch (token) |
| { |
| case '(': |
| ++count; |
| goto repeat; |
| case ')': |
| if (--count == 0) |
| { |
| lexstate = ST_NORMAL; |
| token = ASM_PHRASE; |
| break; |
| } |
| goto repeat; |
| default: |
| goto repeat; |
| } |
| break; |
| |
| case ST_TYPEOF_1: |
| if (token == IDENT) |
| { |
| if (is_reserved_word(yytext, yyleng) |
| || find_symbol(yytext, SYM_TYPEDEF, 1)) |
| { |
| yyless(0); |
| unput('('); |
| lexstate = ST_NORMAL; |
| token = TYPEOF_KEYW; |
| break; |
| } |
| _APP("(", 1); |
| } |
| lexstate = ST_TYPEOF; |
| /* FALLTHRU */ |
| |
| case ST_TYPEOF: |
| switch (token) |
| { |
| case '(': |
| if ( ++count == 1 ) |
| lexstate = ST_TYPEOF_1; |
| else |
| APP; |
| goto repeat; |
| case ')': |
| APP; |
| if (--count == 0) |
| { |
| lexstate = ST_NORMAL; |
| token = TYPEOF_PHRASE; |
| break; |
| } |
| goto repeat; |
| default: |
| APP; |
| goto repeat; |
| } |
| break; |
| |
| case ST_BRACKET: |
| APP; |
| switch (token) |
| { |
| case '[': |
| ++count; |
| goto repeat; |
| case ']': |
| if (--count == 0) |
| { |
| lexstate = ST_NORMAL; |
| token = BRACKET_PHRASE; |
| break; |
| } |
| goto repeat; |
| default: |
| goto repeat; |
| } |
| break; |
| |
| case ST_BRACE: |
| APP; |
| switch (token) |
| { |
| case '{': |
| ++count; |
| goto repeat; |
| case '}': |
| if (--count == 0) |
| { |
| lexstate = ST_NORMAL; |
| token = BRACE_PHRASE; |
| break; |
| } |
| goto repeat; |
| default: |
| goto repeat; |
| } |
| break; |
| |
| case ST_EXPRESSION: |
| switch (token) |
| { |
| case '(': case '[': case '{': |
| ++count; |
| APP; |
| goto repeat; |
| case '}': |
| /* is this the last line of an enum declaration? */ |
| if (count == 0) |
| { |
| /* Put back the token we just read so's we can find it again |
| after registering the expression. */ |
| unput(token); |
| |
| lexstate = ST_NORMAL; |
| token = EXPRESSION_PHRASE; |
| break; |
| } |
| /* FALLTHRU */ |
| case ')': case ']': |
| --count; |
| APP; |
| goto repeat; |
| case ',': case ';': |
| if (count == 0) |
| { |
| /* Put back the token we just read so's we can find it again |
| after registering the expression. */ |
| unput(token); |
| |
| lexstate = ST_NORMAL; |
| token = EXPRESSION_PHRASE; |
| break; |
| } |
| APP; |
| goto repeat; |
| default: |
| APP; |
| goto repeat; |
| } |
| break; |
| |
| case ST_TABLE_1: |
| goto repeat; |
| |
| case ST_TABLE_2: |
| if (token == IDENT && yyleng == 1 && yytext[0] == 'X') |
| { |
| token = EXPORT_SYMBOL_KEYW; |
| lexstate = ST_TABLE_5; |
| APP; |
| break; |
| } |
| lexstate = ST_TABLE_6; |
| /* FALLTHRU */ |
| |
| case ST_TABLE_6: |
| switch (token) |
| { |
| case '{': case '[': case '(': |
| ++count; |
| break; |
| case '}': case ']': case ')': |
| --count; |
| break; |
| case ',': |
| if (count == 0) |
| lexstate = ST_TABLE_2; |
| break; |
| }; |
| goto repeat; |
| |
| case ST_TABLE_3: |
| goto repeat; |
| |
| case ST_TABLE_4: |
| if (token == ';') |
| lexstate = ST_NORMAL; |
| goto repeat; |
| |
| case ST_TABLE_5: |
| switch (token) |
| { |
| case ',': |
| token = ';'; |
| lexstate = ST_TABLE_2; |
| APP; |
| break; |
| default: |
| APP; |
| break; |
| } |
| break; |
| |
| default: |
| exit(1); |
| } |
| fini: |
| |
| if (suppress_type_lookup > 0) |
| --suppress_type_lookup; |
| if (dont_want_brace_phrase > 0) |
| --dont_want_brace_phrase; |
| |
| yylval = &next_node->next; |
| |
| return token; |
| } |
| |