| #line 2 "scripts/genksyms/lex.c" | |
| /* A lexical scanner generated by flex */ | |
| /* Scanner skeleton version: | |
| * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $ | |
| */ | |
| #define FLEX_SCANNER | |
| #define YY_FLEX_MAJOR_VERSION 2 | |
| #define YY_FLEX_MINOR_VERSION 5 | |
| #include <stdio.h> | |
| #include <unistd.h> | |
| /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ | |
| #ifdef c_plusplus | |
| #ifndef __cplusplus | |
| #define __cplusplus | |
| #endif | |
| #endif | |
| #ifdef __cplusplus | |
| #include <stdlib.h> | |
| /* Use prototypes in function declarations. */ | |
| #define YY_USE_PROTOS | |
| /* The "const" storage-class-modifier is valid. */ | |
| #define YY_USE_CONST | |
| #else /* ! __cplusplus */ | |
| #if __STDC__ | |
| #define YY_USE_PROTOS | |
| #define YY_USE_CONST | |
| #endif /* __STDC__ */ | |
| #endif /* ! __cplusplus */ | |
| #ifdef __TURBOC__ | |
| #pragma warn -rch | |
| #pragma warn -use | |
| #include <io.h> | |
| #include <stdlib.h> | |
| #define YY_USE_CONST | |
| #define YY_USE_PROTOS | |
| #endif | |
| #ifdef YY_USE_CONST | |
| #define yyconst const | |
| #else | |
| #define yyconst | |
| #endif | |
| #ifdef YY_USE_PROTOS | |
| #define YY_PROTO(proto) proto | |
| #else | |
| #define YY_PROTO(proto) () | |
| #endif | |
| /* Returned upon end-of-file. */ | |
| #define YY_NULL 0 | |
| /* Promotes a possibly negative, possibly signed char to an unsigned | |
| * integer for use as an array index. If the signed char is negative, | |
| * we want to instead treat it as an 8-bit unsigned char, hence the | |
| * double cast. | |
| */ | |
| #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) | |
| /* Enter a start condition. This macro really ought to take a parameter, | |
| * but we do it the disgusting crufty way forced on us by the ()-less | |
| * definition of BEGIN. | |
| */ | |
| #define BEGIN yy_start = 1 + 2 * | |
| /* Translate the current start state into a value that can be later handed | |
| * to BEGIN to return to the state. The YYSTATE alias is for lex | |
| * compatibility. | |
| */ | |
| #define YY_START ((yy_start - 1) / 2) | |
| #define YYSTATE YY_START | |
| /* Action number for EOF rule of a given start state. */ | |
| #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) | |
| /* Special action meaning "start processing a new file". */ | |
| #define YY_NEW_FILE yyrestart( yyin ) | |
| #define YY_END_OF_BUFFER_CHAR 0 | |
| /* Size of default input buffer. */ | |
| #define YY_BUF_SIZE 16384 | |
| typedef struct yy_buffer_state *YY_BUFFER_STATE; | |
| extern int yyleng; | |
| extern FILE *yyin, *yyout; | |
| #define EOB_ACT_CONTINUE_SCAN 0 | |
| #define EOB_ACT_END_OF_FILE 1 | |
| #define EOB_ACT_LAST_MATCH 2 | |
| /* The funky do-while in the following #define is used to turn the definition | |
| * int a single C statement (which needs a semi-colon terminator). This | |
| * avoids problems with code like: | |
| * | |
| * if ( condition_holds ) | |
| * yyless( 5 ); | |
| * else | |
| * do_something_else(); | |
| * | |
| * Prior to using the do-while the compiler would get upset at the | |
| * "else" because it interpreted the "if" statement as being all | |
| * done when it reached the ';' after the yyless() call. | |
| */ | |
| /* Return all but the first 'n' matched characters back to the input stream. */ | |
| #define yyless(n) \ | |
| do \ | |
| { \ | |
| /* Undo effects of setting up yytext. */ \ | |
| *yy_cp = yy_hold_char; \ | |
| YY_RESTORE_YY_MORE_OFFSET \ | |
| yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ | |
| YY_DO_BEFORE_ACTION; /* set up yytext again */ \ | |
| } \ | |
| while ( 0 ) | |
| #define unput(c) yyunput( c, yytext_ptr ) | |
| /* The following is because we cannot portably get our hands on size_t | |
| * (without autoconf's help, which isn't available because we want | |
| * flex-generated scanners to compile on their own). | |
| */ | |
| typedef unsigned int yy_size_t; | |
| struct yy_buffer_state | |
| { | |
| FILE *yy_input_file; | |
| char *yy_ch_buf; /* input buffer */ | |
| char *yy_buf_pos; /* current position in input buffer */ | |
| /* Size of input buffer in bytes, not including room for EOB | |
| * characters. | |
| */ | |
| yy_size_t yy_buf_size; | |
| /* Number of characters read into yy_ch_buf, not including EOB | |
| * characters. | |
| */ | |
| int yy_n_chars; | |
| /* Whether we "own" the buffer - i.e., we know we created it, | |
| * and can realloc() it to grow it, and should free() it to | |
| * delete it. | |
| */ | |
| int yy_is_our_buffer; | |
| /* Whether this is an "interactive" input source; if so, and | |
| * if we're using stdio for input, then we want to use getc() | |
| * instead of fread(), to make sure we stop fetching input after | |
| * each newline. | |
| */ | |
| int yy_is_interactive; | |
| /* Whether we're considered to be at the beginning of a line. | |
| * If so, '^' rules will be active on the next match, otherwise | |
| * not. | |
| */ | |
| int yy_at_bol; | |
| /* Whether to try to fill the input buffer when we reach the | |
| * end of it. | |
| */ | |
| int yy_fill_buffer; | |
| int yy_buffer_status; | |
| #define YY_BUFFER_NEW 0 | |
| #define YY_BUFFER_NORMAL 1 | |
| /* When an EOF's been seen but there's still some text to process | |
| * then we mark the buffer as YY_EOF_PENDING, to indicate that we | |
| * shouldn't try reading from the input source any more. We might | |
| * still have a bunch of tokens to match, though, because of | |
| * possible backing-up. | |
| * | |
| * When we actually see the EOF, we change the status to "new" | |
| * (via yyrestart()), so that the user can continue scanning by | |
| * just pointing yyin at a new input file. | |
| */ | |
| #define YY_BUFFER_EOF_PENDING 2 | |
| }; | |
| static YY_BUFFER_STATE yy_current_buffer = 0; | |
| /* We provide macros for accessing buffer states in case in the | |
| * future we want to put the buffer states in a more general | |
| * "scanner state". | |
| */ | |
| #define YY_CURRENT_BUFFER yy_current_buffer | |
| /* yy_hold_char holds the character lost when yytext is formed. */ | |
| static char yy_hold_char; | |
| static int yy_n_chars; /* number of characters read into yy_ch_buf */ | |
| int yyleng; | |
| /* Points to current character in buffer. */ | |
| static char *yy_c_buf_p = (char *) 0; | |
| static int yy_init = 1; /* whether we need to initialize */ | |
| static int yy_start = 0; /* start state number */ | |
| /* Flag which is used to allow yywrap()'s to do buffer switches | |
| * instead of setting up a fresh yyin. A bit of a hack ... | |
| */ | |
| static int yy_did_buffer_switch_on_eof; | |
| void yyrestart YY_PROTO(( FILE *input_file )); | |
| void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); | |
| void yy_load_buffer_state YY_PROTO(( void )); | |
| YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); | |
| void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); | |
| void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); | |
| void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); | |
| #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) | |
| YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); | |
| YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); | |
| YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); | |
| static void *yy_flex_alloc YY_PROTO(( yy_size_t )); | |
| static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); | |
| static void yy_flex_free YY_PROTO(( void * )); | |
| #define yy_new_buffer yy_create_buffer | |
| #define yy_set_interactive(is_interactive) \ | |
| { \ | |
| if ( ! yy_current_buffer ) \ | |
| yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ | |
| yy_current_buffer->yy_is_interactive = is_interactive; \ | |
| } | |
| #define yy_set_bol(at_bol) \ | |
| { \ | |
| if ( ! yy_current_buffer ) \ | |
| yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ | |
| yy_current_buffer->yy_at_bol = at_bol; \ | |
| } | |
| #define YY_AT_BOL() (yy_current_buffer->yy_at_bol) | |
| #define yywrap() 1 | |
| #define YY_SKIP_YYWRAP | |
| #define FLEX_DEBUG | |
| typedef unsigned char YY_CHAR; | |
| FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; | |
| typedef int yy_state_type; | |
| #define FLEX_DEBUG | |
| extern char *yytext; | |
| #define yytext_ptr yytext | |
| static yy_state_type yy_get_previous_state YY_PROTO(( void )); | |
| static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); | |
| static int yy_get_next_buffer YY_PROTO(( void )); | |
| static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); | |
| /* Done after the current pattern has been matched and before the | |
| * corresponding action - sets up yytext. | |
| */ | |
| #define YY_DO_BEFORE_ACTION \ | |
| yytext_ptr = yy_bp; \ | |
| yyleng = (int) (yy_cp - yy_bp); \ | |
| yy_hold_char = *yy_cp; \ | |
| *yy_cp = '\0'; \ | |
| yy_c_buf_p = yy_cp; | |
| #define YY_NUM_RULES 13 | |
| #define YY_END_OF_BUFFER 14 | |
| static yyconst short int yy_accept[76] = | |
| { 0, | |
| 0, 0, 0, 0, 14, 12, 4, 3, 12, 7, | |
| 12, 12, 7, 12, 12, 12, 12, 12, 9, 9, | |
| 12, 12, 12, 4, 0, 5, 0, 7, 0, 6, | |
| 0, 0, 0, 0, 0, 0, 2, 8, 10, 10, | |
| 9, 0, 0, 9, 9, 0, 9, 0, 0, 11, | |
| 0, 0, 0, 10, 0, 10, 9, 9, 0, 0, | |
| 0, 0, 0, 0, 0, 10, 10, 0, 0, 0, | |
| 0, 0, 0, 1, 0 | |
| } ; | |
| static yyconst int 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 int 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 short int yy_base[88] = | |
| { 0, | |
| 0, 147, 21, 140, 145, 284, 39, 284, 26, 0, | |
| 32, 126, 40, 44, 115, 35, 36, 46, 50, 53, | |
| 39, 61, 54, 79, 65, 284, 0, 0, 66, 284, | |
| 0, 119, 79, 75, 123, 104, 284, 284, 107, 0, | |
| 79, 73, 76, 76, 66, 0, 0, 85, 86, 284, | |
| 133, 83, 91, 284, 99, 147, 284, 114, 122, 70, | |
| 107, 141, 172, 151, 135, 181, 284, 137, 114, 157, | |
| 149, 48, 45, 284, 284, 208, 214, 222, 230, 238, | |
| 246, 250, 255, 256, 261, 267, 275 | |
| } ; | |
| static yyconst short int yy_def[88] = | |
| { 0, | |
| 75, 1, 1, 3, 75, 75, 75, 75, 76, 77, | |
| 78, 75, 77, 79, 75, 75, 75, 75, 75, 19, | |
| 75, 75, 75, 75, 76, 75, 80, 77, 78, 75, | |
| 81, 75, 76, 78, 79, 79, 75, 75, 75, 39, | |
| 19, 82, 83, 75, 75, 84, 20, 76, 78, 75, | |
| 79, 51, 85, 75, 75, 75, 75, 84, 79, 51, | |
| 79, 79, 79, 51, 75, 75, 75, 86, 79, 63, | |
| 86, 87, 87, 75, 0, 75, 75, 75, 75, 75, | |
| 75, 75, 75, 75, 75, 75, 75 | |
| } ; | |
| static yyconst short int yy_nxt[313] = | |
| { 0, | |
| 6, 7, 8, 7, 9, 6, 10, 6, 6, 11, | |
| 6, 6, 12, 6, 6, 6, 6, 6, 6, 10, | |
| 10, 10, 13, 10, 10, 6, 10, 6, 15, 16, | |
| 26, 15, 17, 18, 19, 20, 20, 21, 15, 22, | |
| 24, 30, 24, 38, 33, 36, 37, 74, 23, 34, | |
| 74, 27, 38, 38, 38, 38, 38, 31, 32, 39, | |
| 39, 39, 40, 41, 41, 42, 47, 47, 47, 26, | |
| 43, 38, 44, 45, 46, 30, 44, 75, 38, 38, | |
| 24, 38, 24, 26, 30, 40, 55, 55, 57, 26, | |
| 27, 31, 57, 43, 35, 30, 64, 64, 64, 57, | |
| 31, 65, 65, 75, 27, 36, 37, 35, 59, 37, | |
| 27, 31, 56, 56, 56, 59, 37, 51, 52, 52, | |
| 39, 39, 39, 59, 37, 37, 68, 53, 54, 54, | |
| 69, 50, 38, 54, 59, 37, 44, 45, 32, 37, | |
| 44, 35, 59, 37, 75, 14, 60, 60, 66, 66, | |
| 66, 37, 14, 72, 75, 61, 62, 63, 59, 61, | |
| 56, 56, 56, 69, 64, 64, 64, 69, 67, 67, | |
| 75, 75, 75, 67, 37, 35, 75, 75, 75, 61, | |
| 62, 75, 75, 61, 75, 70, 70, 70, 75, 75, | |
| 75, 70, 70, 70, 66, 66, 66, 75, 75, 75, | |
| 75, 75, 54, 54, 75, 75, 75, 54, 25, 25, | |
| 25, 25, 25, 25, 25, 25, 28, 75, 75, 28, | |
| 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, | |
| 35, 35, 35, 35, 35, 35, 35, 35, 48, 75, | |
| 48, 48, 48, 48, 48, 48, 49, 75, 49, 49, | |
| 49, 49, 49, 49, 42, 42, 75, 42, 56, 75, | |
| 56, 58, 58, 58, 66, 75, 66, 71, 71, 71, | |
| 71, 71, 71, 71, 71, 73, 73, 73, 73, 73, | |
| 73, 73, 73, 5, 75, 75, 75, 75, 75, 75, | |
| 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, | |
| 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, | |
| 75, 75 | |
| } ; | |
| static yyconst short int yy_chk[313] = | |
| { 0, | |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
| 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, | |
| 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, | |
| 7, 11, 7, 16, 13, 14, 14, 73, 3, 13, | |
| 72, 9, 16, 17, 17, 21, 21, 11, 18, 18, | |
| 18, 18, 19, 19, 19, 19, 20, 20, 20, 25, | |
| 19, 23, 19, 19, 19, 29, 19, 20, 22, 22, | |
| 24, 23, 24, 33, 34, 42, 43, 43, 45, 48, | |
| 25, 29, 45, 42, 60, 49, 52, 52, 52, 44, | |
| 34, 53, 53, 41, 33, 36, 36, 52, 61, 61, | |
| 48, 49, 55, 55, 55, 69, 69, 36, 36, 36, | |
| 39, 39, 39, 59, 59, 35, 59, 39, 39, 39, | |
| 61, 32, 15, 39, 51, 51, 58, 58, 12, 68, | |
| 58, 68, 62, 62, 5, 4, 51, 51, 65, 65, | |
| 65, 71, 2, 71, 0, 51, 51, 51, 70, 51, | |
| 56, 56, 56, 62, 64, 64, 64, 62, 56, 56, | |
| 0, 0, 0, 56, 63, 64, 0, 0, 0, 70, | |
| 70, 0, 0, 70, 0, 63, 63, 63, 0, 0, | |
| 0, 63, 63, 63, 66, 66, 66, 0, 0, 0, | |
| 0, 0, 66, 66, 0, 0, 0, 66, 76, 76, | |
| 76, 76, 76, 76, 76, 76, 77, 0, 0, 77, | |
| 77, 77, 78, 78, 78, 78, 78, 78, 78, 78, | |
| 79, 79, 79, 79, 79, 79, 79, 79, 80, 0, | |
| 80, 80, 80, 80, 80, 80, 81, 0, 81, 81, | |
| 81, 81, 81, 81, 82, 82, 0, 82, 83, 0, | |
| 83, 84, 84, 84, 85, 0, 85, 86, 86, 86, | |
| 86, 86, 86, 86, 86, 87, 87, 87, 87, 87, | |
| 87, 87, 87, 75, 75, 75, 75, 75, 75, 75, | |
| 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, | |
| 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, | |
| 75, 75 | |
| } ; | |
| static yy_state_type yy_last_accepting_state; | |
| static char *yy_last_accepting_cpos; | |
| extern int yy_flex_debug; | |
| int yy_flex_debug = 1; | |
| static yyconst short int yy_rule_linenum[13] = | |
| { 0, | |
| 69, 70, 71, 74, 77, 78, 79, 85, 86, 87, | |
| 89, 92 | |
| } ; | |
| /* 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; | |
| #line 1 "scripts/genksyms/lex.l" | |
| #define INITIAL 0 | |
| /* 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. */ | |
| #line 25 "scripts/genksyms/lex.l" | |
| #include <limits.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <ctype.h> | |
| #include "genksyms.h" | |
| #include "parse.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) | |
| /* Version 2 checksumming does proper tokenization; version 1 wasn't | |
| quite so pedantic. */ | |
| #define V2_TOKENS 1 | |
| /* We don't do multiple input files. */ | |
| #line 513 "scripts/genksyms/lex.c" | |
| /* Macros after this point can all be overridden by user definitions in | |
| * section 1. | |
| */ | |
| #ifndef YY_SKIP_YYWRAP | |
| #ifdef __cplusplus | |
| extern "C" int yywrap YY_PROTO(( void )); | |
| #else | |
| extern int yywrap YY_PROTO(( void )); | |
| #endif | |
| #endif | |
| #ifndef YY_NO_UNPUT | |
| static void yyunput YY_PROTO(( int c, char *buf_ptr )); | |
| #endif | |
| #ifndef yytext_ptr | |
| static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); | |
| #endif | |
| #ifdef YY_NEED_STRLEN | |
| static int yy_flex_strlen YY_PROTO(( yyconst char * )); | |
| #endif | |
| #ifndef YY_NO_INPUT | |
| #ifdef __cplusplus | |
| static int yyinput YY_PROTO(( void )); | |
| #else | |
| static int input YY_PROTO(( void )); | |
| #endif | |
| #endif | |
| #if YY_STACK_USED | |
| static int yy_start_stack_ptr = 0; | |
| static int yy_start_stack_depth = 0; | |
| static int *yy_start_stack = 0; | |
| #ifndef YY_NO_PUSH_STATE | |
| static void yy_push_state YY_PROTO(( int new_state )); | |
| #endif | |
| #ifndef YY_NO_POP_STATE | |
| static void yy_pop_state YY_PROTO(( void )); | |
| #endif | |
| #ifndef YY_NO_TOP_STATE | |
| static int yy_top_state YY_PROTO(( void )); | |
| #endif | |
| #else | |
| #define YY_NO_PUSH_STATE 1 | |
| #define YY_NO_POP_STATE 1 | |
| #define YY_NO_TOP_STATE 1 | |
| #endif | |
| #ifdef YY_MALLOC_DECL | |
| YY_MALLOC_DECL | |
| #else | |
| #if __STDC__ | |
| #ifndef __cplusplus | |
| #include <stdlib.h> | |
| #endif | |
| #else | |
| /* Just try to get by without declaring the routines. This will fail | |
| * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) | |
| * or sizeof(void*) != sizeof(int). | |
| */ | |
| #endif | |
| #endif | |
| /* Amount of stuff to slurp up with each read. */ | |
| #ifndef YY_READ_BUF_SIZE | |
| #define YY_READ_BUF_SIZE 8192 | |
| #endif | |
| /* Copy whatever the last rule matched to the standard output. */ | |
| #ifndef ECHO | |
| /* This used to be an fputs(), but since the string might contain NUL's, | |
| * we now use fwrite(). | |
| */ | |
| #define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) | |
| #endif | |
| /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, | |
| * is returned in "result". | |
| */ | |
| #ifndef YY_INPUT | |
| #define YY_INPUT(buf,result,max_size) \ | |
| if ( yy_current_buffer->yy_is_interactive ) \ | |
| { \ | |
| int c = '*', n; \ | |
| for ( n = 0; n < max_size && \ | |
| (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ | |
| buf[n] = (char) c; \ | |
| if ( c == '\n' ) \ | |
| buf[n++] = (char) c; \ | |
| if ( c == EOF && ferror( yyin ) ) \ | |
| YY_FATAL_ERROR( "input in flex scanner failed" ); \ | |
| result = n; \ | |
| } \ | |
| else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ | |
| && ferror( yyin ) ) \ | |
| YY_FATAL_ERROR( "input in flex scanner failed" ); | |
| #endif | |
| /* No semi-colon after return; correct usage is to write "yyterminate();" - | |
| * we don't want an extra ';' after the "return" because that will cause | |
| * some compilers to complain about unreachable statements. | |
| */ | |
| #ifndef yyterminate | |
| #define yyterminate() return YY_NULL | |
| #endif | |
| /* Number of entries by which start-condition stack grows. */ | |
| #ifndef YY_START_STACK_INCR | |
| #define YY_START_STACK_INCR 25 | |
| #endif | |
| /* Report a fatal error. */ | |
| #ifndef YY_FATAL_ERROR | |
| #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) | |
| #endif | |
| /* Default declaration of generated scanner - a define so the user can | |
| * easily add parameters. | |
| */ | |
| #ifndef YY_DECL | |
| #define YY_DECL int yylex YY_PROTO(( void )) | |
| #endif | |
| /* Code executed at the beginning of each rule, after yytext and yyleng | |
| * have been set up. | |
| */ | |
| #ifndef YY_USER_ACTION | |
| #define YY_USER_ACTION | |
| #endif | |
| /* Code executed at the end of each rule. */ | |
| #ifndef YY_BREAK | |
| #define YY_BREAK break; | |
| #endif | |
| #define YY_RULE_SETUP \ | |
| if ( yyleng > 0 ) \ | |
| yy_current_buffer->yy_at_bol = \ | |
| (yytext[yyleng - 1] == '\n'); \ | |
| YY_USER_ACTION | |
| YY_DECL | |
| { | |
| register yy_state_type yy_current_state; | |
| register char *yy_cp = NULL, *yy_bp = NULL; | |
| register int yy_act; | |
| #line 65 "scripts/genksyms/lex.l" | |
| /* Keep track of our location in the original source files. */ | |
| #line 672 "scripts/genksyms/lex.c" | |
| if ( yy_init ) | |
| { | |
| yy_init = 0; | |
| #ifdef YY_USER_INIT | |
| YY_USER_INIT; | |
| #endif | |
| if ( ! yy_start ) | |
| yy_start = 1; /* first start state */ | |
| if ( ! yyin ) | |
| yyin = stdin; | |
| if ( ! yyout ) | |
| yyout = stdout; | |
| if ( ! yy_current_buffer ) | |
| yy_current_buffer = | |
| yy_create_buffer( yyin, YY_BUF_SIZE ); | |
| yy_load_buffer_state(); | |
| } | |
| while ( 1 ) /* loops until end-of-file is reached */ | |
| { | |
| yy_cp = yy_c_buf_p; | |
| /* Support of yytext. */ | |
| *yy_cp = yy_hold_char; | |
| /* yy_bp points to the position in yy_ch_buf of the start of | |
| * the current run. | |
| */ | |
| yy_bp = yy_cp; | |
| yy_current_state = yy_start; | |
| yy_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 >= 76 ) | |
| 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] != 284 ); | |
| 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. */ | |
| if ( yy_flex_debug ) | |
| { | |
| if ( yy_act == 0 ) | |
| fprintf( stderr, "--scanner backing up\n" ); | |
| else if ( yy_act < 13 ) | |
| fprintf( stderr, "--accepting rule at line %d (\"%s\")\n", | |
| yy_rule_linenum[yy_act], yytext ); | |
| else if ( yy_act == 13 ) | |
| fprintf( stderr, "--accepting default rule (\"%s\")\n", | |
| yytext ); | |
| else if ( yy_act == 14 ) | |
| fprintf( stderr, "--(end of buffer or a NUL)\n" ); | |
| else | |
| fprintf( stderr, "--EOF (start condition %d)\n", YY_START ); | |
| } | |
| switch ( yy_act ) | |
| { /* beginning of action switch */ | |
| case 0: /* must back up */ | |
| /* undo the effects of YY_DO_BEFORE_ACTION */ | |
| *yy_cp = yy_hold_char; | |
| yy_cp = yy_last_accepting_cpos; | |
| yy_current_state = yy_last_accepting_state; | |
| goto yy_find_action; | |
| case 1: | |
| YY_RULE_SETUP | |
| #line 69 "scripts/genksyms/lex.l" | |
| return FILENAME; | |
| YY_BREAK | |
| case 2: | |
| YY_RULE_SETUP | |
| #line 70 "scripts/genksyms/lex.l" | |
| cur_line++; | |
| YY_BREAK | |
| case 3: | |
| YY_RULE_SETUP | |
| #line 71 "scripts/genksyms/lex.l" | |
| cur_line++; | |
| YY_BREAK | |
| /* Ignore all other whitespace. */ | |
| case 4: | |
| YY_RULE_SETUP | |
| #line 74 "scripts/genksyms/lex.l" | |
| ; | |
| YY_BREAK | |
| case 5: | |
| YY_RULE_SETUP | |
| #line 77 "scripts/genksyms/lex.l" | |
| return STRING; | |
| YY_BREAK | |
| case 6: | |
| YY_RULE_SETUP | |
| #line 78 "scripts/genksyms/lex.l" | |
| return CHAR; | |
| YY_BREAK | |
| case 7: | |
| YY_RULE_SETUP | |
| #line 79 "scripts/genksyms/lex.l" | |
| 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 | |
| #line 85 "scripts/genksyms/lex.l" | |
| return OTHER; | |
| YY_BREAK | |
| case 9: | |
| YY_RULE_SETUP | |
| #line 86 "scripts/genksyms/lex.l" | |
| return INT; | |
| YY_BREAK | |
| case 10: | |
| YY_RULE_SETUP | |
| #line 87 "scripts/genksyms/lex.l" | |
| return REAL; | |
| YY_BREAK | |
| case 11: | |
| YY_RULE_SETUP | |
| #line 89 "scripts/genksyms/lex.l" | |
| return DOTS; | |
| YY_BREAK | |
| /* All other tokens are single characters. */ | |
| case 12: | |
| YY_RULE_SETUP | |
| #line 92 "scripts/genksyms/lex.l" | |
| return yytext[0]; | |
| YY_BREAK | |
| case 13: | |
| YY_RULE_SETUP | |
| #line 95 "scripts/genksyms/lex.l" | |
| ECHO; | |
| YY_BREAK | |
| #line 842 "scripts/genksyms/lex.c" | |
| case YY_STATE_EOF(INITIAL): | |
| case YY_STATE_EOF(V2_TOKENS): | |
| yyterminate(); | |
| case YY_END_OF_BUFFER: | |
| { | |
| /* Amount of text matched not including the EOB char. */ | |
| int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; | |
| /* Undo the effects of YY_DO_BEFORE_ACTION. */ | |
| *yy_cp = yy_hold_char; | |
| YY_RESTORE_YY_MORE_OFFSET | |
| if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) | |
| { | |
| /* We're scanning a new file or input source. It's | |
| * possible that this happened because the user | |
| * just pointed yyin at a new source and called | |
| * yylex(). If so, then we have to assure | |
| * consistency between yy_current_buffer and our | |
| * globals. Here is the right place to do so, because | |
| * this is the first action (other than possibly a | |
| * back-up) that will match for the new input source. | |
| */ | |
| yy_n_chars = yy_current_buffer->yy_n_chars; | |
| yy_current_buffer->yy_input_file = yyin; | |
| yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; | |
| } | |
| /* Note that here we test for yy_c_buf_p "<=" to the position | |
| * of the first EOB in the buffer, since yy_c_buf_p will | |
| * already have been incremented past the NUL character | |
| * (since all states make transitions on EOB to the | |
| * end-of-buffer state). Contrast this with the test | |
| * in input(). | |
| */ | |
| if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) | |
| { /* This was really a NUL. */ | |
| yy_state_type yy_next_state; | |
| yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; | |
| yy_current_state = yy_get_previous_state(); | |
| /* Okay, we're now positioned to make the NUL | |
| * transition. We couldn't have | |
| * yy_get_previous_state() go ahead and do it | |
| * for us because it doesn't know how to deal | |
| * with the possibility of jamming (and we don't | |
| * want to build jamming into it because then it | |
| * will run more slowly). | |
| */ | |
| yy_next_state = yy_try_NUL_trans( yy_current_state ); | |
| yy_bp = yytext_ptr + YY_MORE_ADJ; | |
| if ( yy_next_state ) | |
| { | |
| /* Consume the NUL. */ | |
| yy_cp = ++yy_c_buf_p; | |
| yy_current_state = yy_next_state; | |
| goto yy_match; | |
| } | |
| else | |
| { | |
| yy_cp = yy_c_buf_p; | |
| goto yy_find_action; | |
| } | |
| } | |
| else switch ( yy_get_next_buffer() ) | |
| { | |
| case EOB_ACT_END_OF_FILE: | |
| { | |
| yy_did_buffer_switch_on_eof = 0; | |
| if ( yywrap() ) | |
| { | |
| /* Note: because we've taken care in | |
| * yy_get_next_buffer() to have set up | |
| * yytext, we can now set up | |
| * yy_c_buf_p so that if some total | |
| * hoser (like flex itself) wants to | |
| * call the scanner after we return the | |
| * YY_NULL, it'll still work - another | |
| * YY_NULL will get returned. | |
| */ | |
| yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; | |
| yy_act = YY_STATE_EOF(YY_START); | |
| goto do_action; | |
| } | |
| else | |
| { | |
| if ( ! yy_did_buffer_switch_on_eof ) | |
| YY_NEW_FILE; | |
| } | |
| break; | |
| } | |
| case EOB_ACT_CONTINUE_SCAN: | |
| yy_c_buf_p = | |
| yytext_ptr + yy_amount_of_matched_text; | |
| yy_current_state = yy_get_previous_state(); | |
| yy_cp = yy_c_buf_p; | |
| yy_bp = yytext_ptr + YY_MORE_ADJ; | |
| goto yy_match; | |
| case EOB_ACT_LAST_MATCH: | |
| yy_c_buf_p = | |
| &yy_current_buffer->yy_ch_buf[yy_n_chars]; | |
| yy_current_state = yy_get_previous_state(); | |
| yy_cp = yy_c_buf_p; | |
| yy_bp = yytext_ptr + YY_MORE_ADJ; | |
| goto yy_find_action; | |
| } | |
| break; | |
| } | |
| default: | |
| YY_FATAL_ERROR( | |
| "fatal flex scanner internal error--no action found" ); | |
| } /* end of action switch */ | |
| } /* end of scanning one token */ | |
| } /* end of yylex */ | |
| /* yy_get_next_buffer - try to read in a new buffer | |
| * | |
| * Returns a code representing an action: | |
| * EOB_ACT_LAST_MATCH - | |
| * EOB_ACT_CONTINUE_SCAN - continue scanning from current position | |
| * EOB_ACT_END_OF_FILE - end of file | |
| */ | |
| static int yy_get_next_buffer() | |
| { | |
| register char *dest = yy_current_buffer->yy_ch_buf; | |
| register char *source = yytext_ptr; | |
| register int number_to_move, i; | |
| int ret_val; | |
| if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) | |
| YY_FATAL_ERROR( | |
| "fatal flex scanner internal error--end of buffer missed" ); | |
| if ( yy_current_buffer->yy_fill_buffer == 0 ) | |
| { /* Don't try to fill the buffer, so this is an EOF. */ | |
| if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) | |
| { | |
| /* We matched a single character, the EOB, so | |
| * treat this as a final EOF. | |
| */ | |
| return EOB_ACT_END_OF_FILE; | |
| } | |
| else | |
| { | |
| /* We matched some text prior to the EOB, first | |
| * process it. | |
| */ | |
| return EOB_ACT_LAST_MATCH; | |
| } | |
| } | |
| /* Try to read more data. */ | |
| /* First move last chars to start of buffer. */ | |
| number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; | |
| for ( i = 0; i < number_to_move; ++i ) | |
| *(dest++) = *(source++); | |
| if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) | |
| /* don't do the read, it's not guaranteed to return an EOF, | |
| * just force an EOF | |
| */ | |
| yy_current_buffer->yy_n_chars = yy_n_chars = 0; | |
| else | |
| { | |
| int num_to_read = | |
| yy_current_buffer->yy_buf_size - number_to_move - 1; | |
| while ( num_to_read <= 0 ) | |
| { /* Not enough room in the buffer - grow it. */ | |
| #ifdef YY_USES_REJECT | |
| YY_FATAL_ERROR( | |
| "input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); | |
| #else | |
| /* just a shorter name for the current buffer */ | |
| YY_BUFFER_STATE b = yy_current_buffer; | |
| int yy_c_buf_p_offset = | |
| (int) (yy_c_buf_p - b->yy_ch_buf); | |
| if ( b->yy_is_our_buffer ) | |
| { | |
| int new_size = b->yy_buf_size * 2; | |
| if ( new_size <= 0 ) | |
| b->yy_buf_size += b->yy_buf_size / 8; | |
| else | |
| b->yy_buf_size *= 2; | |
| b->yy_ch_buf = (char *) | |
| /* Include room in for 2 EOB chars. */ | |
| yy_flex_realloc( (void *) b->yy_ch_buf, | |
| b->yy_buf_size + 2 ); | |
| } | |
| else | |
| /* Can't grow it, we don't own it. */ | |
| b->yy_ch_buf = 0; | |
| if ( ! b->yy_ch_buf ) | |
| YY_FATAL_ERROR( | |
| "fatal error - scanner input buffer overflow" ); | |
| yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; | |
| num_to_read = yy_current_buffer->yy_buf_size - | |
| number_to_move - 1; | |
| #endif | |
| } | |
| if ( num_to_read > YY_READ_BUF_SIZE ) | |
| num_to_read = YY_READ_BUF_SIZE; | |
| /* Read in more data. */ | |
| YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), | |
| yy_n_chars, num_to_read ); | |
| yy_current_buffer->yy_n_chars = yy_n_chars; | |
| } | |
| if ( yy_n_chars == 0 ) | |
| { | |
| if ( number_to_move == YY_MORE_ADJ ) | |
| { | |
| ret_val = EOB_ACT_END_OF_FILE; | |
| yyrestart( yyin ); | |
| } | |
| else | |
| { | |
| ret_val = EOB_ACT_LAST_MATCH; | |
| yy_current_buffer->yy_buffer_status = | |
| YY_BUFFER_EOF_PENDING; | |
| } | |
| } | |
| else | |
| ret_val = EOB_ACT_CONTINUE_SCAN; | |
| yy_n_chars += number_to_move; | |
| yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; | |
| yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; | |
| yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; | |
| return ret_val; | |
| } | |
| /* yy_get_previous_state - get the state just before the EOB char was reached */ | |
| static yy_state_type yy_get_previous_state() | |
| { | |
| register yy_state_type yy_current_state; | |
| register char *yy_cp; | |
| yy_current_state = yy_start; | |
| 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 >= 76 ) | |
| yy_c = yy_meta[(unsigned int) yy_c]; | |
| } | |
| yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; | |
| } | |
| return yy_current_state; | |
| } | |
| /* yy_try_NUL_trans - try to make a transition on the NUL character | |
| * | |
| * synopsis | |
| * next_state = yy_try_NUL_trans( current_state ); | |
| */ | |
| #ifdef YY_USE_PROTOS | |
| static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) | |
| #else | |
| static yy_state_type yy_try_NUL_trans( yy_current_state ) | |
| yy_state_type yy_current_state; | |
| #endif | |
| { | |
| register int yy_is_jam; | |
| register char *yy_cp = yy_c_buf_p; | |
| register YY_CHAR yy_c = 1; | |
| if ( yy_accept[yy_current_state] ) | |
| { | |
| yy_last_accepting_state = yy_current_state; | |
| yy_last_accepting_cpos = yy_cp; | |
| } | |
| while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) | |
| { | |
| yy_current_state = (int) yy_def[yy_current_state]; | |
| if ( yy_current_state >= 76 ) | |
| 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 == 75); | |
| return yy_is_jam ? 0 : yy_current_state; | |
| } | |
| #ifndef YY_NO_UNPUT | |
| #ifdef YY_USE_PROTOS | |
| static void yyunput( int c, register char *yy_bp ) | |
| #else | |
| static void yyunput( c, yy_bp ) | |
| int c; | |
| register char *yy_bp; | |
| #endif | |
| { | |
| register char *yy_cp = yy_c_buf_p; | |
| /* undo effects of setting up yytext */ | |
| *yy_cp = yy_hold_char; | |
| if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) | |
| { /* need to shift things up to make room */ | |
| /* +2 for EOB chars. */ | |
| register int number_to_move = yy_n_chars + 2; | |
| register char *dest = &yy_current_buffer->yy_ch_buf[ | |
| yy_current_buffer->yy_buf_size + 2]; | |
| register char *source = | |
| &yy_current_buffer->yy_ch_buf[number_to_move]; | |
| while ( source > yy_current_buffer->yy_ch_buf ) | |
| *--dest = *--source; | |
| yy_cp += (int) (dest - source); | |
| yy_bp += (int) (dest - source); | |
| yy_current_buffer->yy_n_chars = | |
| yy_n_chars = yy_current_buffer->yy_buf_size; | |
| if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) | |
| YY_FATAL_ERROR( "flex scanner push-back overflow" ); | |
| } | |
| *--yy_cp = (char) c; | |
| yytext_ptr = yy_bp; | |
| yy_hold_char = *yy_cp; | |
| yy_c_buf_p = yy_cp; | |
| } | |
| #endif /* ifndef YY_NO_UNPUT */ | |
| #ifdef __cplusplus | |
| static int yyinput() | |
| #else | |
| static int input() | |
| #endif | |
| { | |
| int c; | |
| *yy_c_buf_p = yy_hold_char; | |
| if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) | |
| { | |
| /* yy_c_buf_p now points to the character we want to return. | |
| * If this occurs *before* the EOB characters, then it's a | |
| * valid NUL; if not, then we've hit the end of the buffer. | |
| */ | |
| if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) | |
| /* This was really a NUL. */ | |
| *yy_c_buf_p = '\0'; | |
| else | |
| { /* need more input */ | |
| int offset = yy_c_buf_p - yytext_ptr; | |
| ++yy_c_buf_p; | |
| switch ( yy_get_next_buffer() ) | |
| { | |
| case EOB_ACT_LAST_MATCH: | |
| /* This happens because yy_g_n_b() | |
| * sees that we've accumulated a | |
| * token and flags that we need to | |
| * try matching the token before | |
| * proceeding. But for input(), | |
| * there's no matching to consider. | |
| * So convert the EOB_ACT_LAST_MATCH | |
| * to EOB_ACT_END_OF_FILE. | |
| */ | |
| /* Reset buffer status. */ | |
| yyrestart( yyin ); | |
| /* fall through */ | |
| case EOB_ACT_END_OF_FILE: | |
| { | |
| if ( yywrap() ) | |
| return EOF; | |
| if ( ! yy_did_buffer_switch_on_eof ) | |
| YY_NEW_FILE; | |
| #ifdef __cplusplus | |
| return yyinput(); | |
| #else | |
| return input(); | |
| #endif | |
| } | |
| case EOB_ACT_CONTINUE_SCAN: | |
| yy_c_buf_p = yytext_ptr + offset; | |
| break; | |
| } | |
| } | |
| } | |
| c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ | |
| *yy_c_buf_p = '\0'; /* preserve yytext */ | |
| yy_hold_char = *++yy_c_buf_p; | |
| yy_current_buffer->yy_at_bol = (c == '\n'); | |
| return c; | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yyrestart( FILE *input_file ) | |
| #else | |
| void yyrestart( input_file ) | |
| FILE *input_file; | |
| #endif | |
| { | |
| if ( ! yy_current_buffer ) | |
| yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); | |
| yy_init_buffer( yy_current_buffer, input_file ); | |
| yy_load_buffer_state(); | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) | |
| #else | |
| void yy_switch_to_buffer( new_buffer ) | |
| YY_BUFFER_STATE new_buffer; | |
| #endif | |
| { | |
| if ( yy_current_buffer == new_buffer ) | |
| return; | |
| if ( yy_current_buffer ) | |
| { | |
| /* Flush out information for old buffer. */ | |
| *yy_c_buf_p = yy_hold_char; | |
| yy_current_buffer->yy_buf_pos = yy_c_buf_p; | |
| yy_current_buffer->yy_n_chars = yy_n_chars; | |
| } | |
| yy_current_buffer = new_buffer; | |
| yy_load_buffer_state(); | |
| /* We don't actually know whether we did this switch during | |
| * EOF (yywrap()) processing, but the only time this flag | |
| * is looked at is after yywrap() is called, so it's safe | |
| * to go ahead and always set it. | |
| */ | |
| yy_did_buffer_switch_on_eof = 1; | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yy_load_buffer_state( void ) | |
| #else | |
| void yy_load_buffer_state() | |
| #endif | |
| { | |
| yy_n_chars = yy_current_buffer->yy_n_chars; | |
| yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; | |
| yyin = yy_current_buffer->yy_input_file; | |
| yy_hold_char = *yy_c_buf_p; | |
| } | |
| #ifdef YY_USE_PROTOS | |
| YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) | |
| #else | |
| YY_BUFFER_STATE yy_create_buffer( file, size ) | |
| FILE *file; | |
| int size; | |
| #endif | |
| { | |
| YY_BUFFER_STATE b; | |
| b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); | |
| if ( ! b ) | |
| YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); | |
| b->yy_buf_size = size; | |
| /* yy_ch_buf has to be 2 characters longer than the size given because | |
| * we need to put in 2 end-of-buffer characters. | |
| */ | |
| b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); | |
| if ( ! b->yy_ch_buf ) | |
| YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); | |
| b->yy_is_our_buffer = 1; | |
| yy_init_buffer( b, file ); | |
| return b; | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yy_delete_buffer( YY_BUFFER_STATE b ) | |
| #else | |
| void yy_delete_buffer( b ) | |
| YY_BUFFER_STATE b; | |
| #endif | |
| { | |
| if ( ! b ) | |
| return; | |
| if ( b == yy_current_buffer ) | |
| yy_current_buffer = (YY_BUFFER_STATE) 0; | |
| if ( b->yy_is_our_buffer ) | |
| yy_flex_free( (void *) b->yy_ch_buf ); | |
| yy_flex_free( (void *) b ); | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) | |
| #else | |
| void yy_init_buffer( b, file ) | |
| YY_BUFFER_STATE b; | |
| FILE *file; | |
| #endif | |
| { | |
| yy_flush_buffer( b ); | |
| b->yy_input_file = file; | |
| b->yy_fill_buffer = 1; | |
| #if YY_ALWAYS_INTERACTIVE | |
| b->yy_is_interactive = 1; | |
| #else | |
| #if YY_NEVER_INTERACTIVE | |
| b->yy_is_interactive = 0; | |
| #else | |
| b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; | |
| #endif | |
| #endif | |
| } | |
| #ifdef YY_USE_PROTOS | |
| void yy_flush_buffer( YY_BUFFER_STATE b ) | |
| #else | |
| void yy_flush_buffer( b ) | |
| YY_BUFFER_STATE b; | |
| #endif | |
| { | |
| if ( ! b ) | |
| return; | |
| b->yy_n_chars = 0; | |
| /* We always need two end-of-buffer characters. The first causes | |
| * a transition to the end-of-buffer state. The second causes | |
| * a jam in that state. | |
| */ | |
| b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; | |
| b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; | |
| b->yy_buf_pos = &b->yy_ch_buf[0]; | |
| b->yy_at_bol = 1; | |
| b->yy_buffer_status = YY_BUFFER_NEW; | |
| if ( b == yy_current_buffer ) | |
| yy_load_buffer_state(); | |
| } | |
| #ifndef YY_NO_SCAN_BUFFER | |
| #ifdef YY_USE_PROTOS | |
| YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) | |
| #else | |
| YY_BUFFER_STATE yy_scan_buffer( base, size ) | |
| char *base; | |
| yy_size_t size; | |
| #endif | |
| { | |
| YY_BUFFER_STATE b; | |
| if ( size < 2 || | |
| base[size-2] != YY_END_OF_BUFFER_CHAR || | |
| base[size-1] != YY_END_OF_BUFFER_CHAR ) | |
| /* They forgot to leave room for the EOB's. */ | |
| return 0; | |
| b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); | |
| if ( ! b ) | |
| YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); | |
| b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ | |
| b->yy_buf_pos = b->yy_ch_buf = base; | |
| b->yy_is_our_buffer = 0; | |
| b->yy_input_file = 0; | |
| b->yy_n_chars = b->yy_buf_size; | |
| b->yy_is_interactive = 0; | |
| b->yy_at_bol = 1; | |
| b->yy_fill_buffer = 0; | |
| b->yy_buffer_status = YY_BUFFER_NEW; | |
| yy_switch_to_buffer( b ); | |
| return b; | |
| } | |
| #endif | |
| #ifndef YY_NO_SCAN_STRING | |
| #ifdef YY_USE_PROTOS | |
| YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) | |
| #else | |
| YY_BUFFER_STATE yy_scan_string( yy_str ) | |
| yyconst char *yy_str; | |
| #endif | |
| { | |
| int len; | |
| for ( len = 0; yy_str[len]; ++len ) | |
| ; | |
| return yy_scan_bytes( yy_str, len ); | |
| } | |
| #endif | |
| #ifndef YY_NO_SCAN_BYTES | |
| #ifdef YY_USE_PROTOS | |
| YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) | |
| #else | |
| YY_BUFFER_STATE yy_scan_bytes( bytes, len ) | |
| yyconst char *bytes; | |
| int len; | |
| #endif | |
| { | |
| YY_BUFFER_STATE b; | |
| char *buf; | |
| yy_size_t n; | |
| int i; | |
| /* Get memory for full buffer, including space for trailing EOB's. */ | |
| n = len + 2; | |
| buf = (char *) yy_flex_alloc( n ); | |
| if ( ! buf ) | |
| YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); | |
| for ( i = 0; i < len; ++i ) | |
| buf[i] = bytes[i]; | |
| buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; | |
| b = yy_scan_buffer( buf, n ); | |
| if ( ! b ) | |
| YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); | |
| /* It's okay to grow etc. this buffer, and we should throw it | |
| * away when we're done. | |
| */ | |
| b->yy_is_our_buffer = 1; | |
| return b; | |
| } | |
| #endif | |
| #ifndef YY_NO_PUSH_STATE | |
| #ifdef YY_USE_PROTOS | |
| static void yy_push_state( int new_state ) | |
| #else | |
| static void yy_push_state( new_state ) | |
| int new_state; | |
| #endif | |
| { | |
| if ( yy_start_stack_ptr >= yy_start_stack_depth ) | |
| { | |
| yy_size_t new_size; | |
| yy_start_stack_depth += YY_START_STACK_INCR; | |
| new_size = yy_start_stack_depth * sizeof( int ); | |
| if ( ! yy_start_stack ) | |
| yy_start_stack = (int *) yy_flex_alloc( new_size ); | |
| else | |
| yy_start_stack = (int *) yy_flex_realloc( | |
| (void *) yy_start_stack, new_size ); | |
| if ( ! yy_start_stack ) | |
| YY_FATAL_ERROR( | |
| "out of memory expanding start-condition stack" ); | |
| } | |
| yy_start_stack[yy_start_stack_ptr++] = YY_START; | |
| BEGIN(new_state); | |
| } | |
| #endif | |
| #ifndef YY_NO_POP_STATE | |
| static void yy_pop_state() | |
| { | |
| if ( --yy_start_stack_ptr < 0 ) | |
| YY_FATAL_ERROR( "start-condition stack underflow" ); | |
| BEGIN(yy_start_stack[yy_start_stack_ptr]); | |
| } | |
| #endif | |
| #ifndef YY_NO_TOP_STATE | |
| static int yy_top_state() | |
| { | |
| return yy_start_stack[yy_start_stack_ptr - 1]; | |
| } | |
| #endif | |
| #ifndef YY_EXIT_FAILURE | |
| #define YY_EXIT_FAILURE 2 | |
| #endif | |
| #ifdef YY_USE_PROTOS | |
| static void yy_fatal_error( yyconst char msg[] ) | |
| #else | |
| static void yy_fatal_error( msg ) | |
| char msg[]; | |
| #endif | |
| { | |
| (void) fprintf( stderr, "%s\n", msg ); | |
| exit( YY_EXIT_FAILURE ); | |
| } | |
| /* Redefine yyless() so it works in section 3 code. */ | |
| #undef yyless | |
| #define yyless(n) \ | |
| do \ | |
| { \ | |
| /* Undo effects of setting up yytext. */ \ | |
| yytext[yyleng] = yy_hold_char; \ | |
| yy_c_buf_p = yytext + n; \ | |
| yy_hold_char = *yy_c_buf_p; \ | |
| *yy_c_buf_p = '\0'; \ | |
| yyleng = n; \ | |
| } \ | |
| while ( 0 ) | |
| /* Internal utility routines. */ | |
| #ifndef yytext_ptr | |
| #ifdef YY_USE_PROTOS | |
| static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) | |
| #else | |
| static void yy_flex_strncpy( s1, s2, n ) | |
| char *s1; | |
| yyconst char *s2; | |
| int n; | |
| #endif | |
| { | |
| register int i; | |
| for ( i = 0; i < n; ++i ) | |
| s1[i] = s2[i]; | |
| } | |
| #endif | |
| #ifdef YY_NEED_STRLEN | |
| #ifdef YY_USE_PROTOS | |
| static int yy_flex_strlen( yyconst char *s ) | |
| #else | |
| static int yy_flex_strlen( s ) | |
| yyconst char *s; | |
| #endif | |
| { | |
| register int n; | |
| for ( n = 0; s[n]; ++n ) | |
| ; | |
| return n; | |
| } | |
| #endif | |
| #ifdef YY_USE_PROTOS | |
| static void *yy_flex_alloc( yy_size_t size ) | |
| #else | |
| static void *yy_flex_alloc( size ) | |
| yy_size_t size; | |
| #endif | |
| { | |
| return (void *) malloc( size ); | |
| } | |
| #ifdef YY_USE_PROTOS | |
| static void *yy_flex_realloc( void *ptr, yy_size_t size ) | |
| #else | |
| static void *yy_flex_realloc( ptr, size ) | |
| void *ptr; | |
| yy_size_t size; | |
| #endif | |
| { | |
| /* The cast to (char *) in the following accommodates both | |
| * implementations that use char* generic pointers, and those | |
| * that use void* generic pointers. It works with the latter | |
| * because both ANSI C and C++ allow castless assignment from | |
| * any pointer type to void*, and deal with argument conversions | |
| * as though doing an assignment. | |
| */ | |
| return (void *) realloc( (char *) ptr, size ); | |
| } | |
| #ifdef YY_USE_PROTOS | |
| static void yy_flex_free( void *ptr ) | |
| #else | |
| static void yy_flex_free( ptr ) | |
| void *ptr; | |
| #endif | |
| { | |
| free( ptr ); | |
| } | |
| #if YY_MAIN | |
| int main() | |
| { | |
| yylex(); | |
| return 0; | |
| } | |
| #endif | |
| #line 95 "scripts/genksyms/lex.l" | |
| /* Bring in the keyword recognizer. */ | |
| #include "keywords.c" | |
| /* Macros to append to our phrase collection list. */ | |
| #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 = SYM_NORMAL; \ | |
| } 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_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) | |
| { | |
| BEGIN(V2_TOKENS); | |
| 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); | |
| goto repeat; | |
| } | |
| switch (lexstate) | |
| { | |
| case ST_NORMAL: | |
| switch (token) | |
| { | |
| case IDENT: | |
| APP; | |
| { | |
| const struct resword *r = is_reserved_word(yytext, yyleng); | |
| if (r) | |
| { | |
| switch (token = r->token) | |
| { | |
| case ATTRIBUTE_KEYW: | |
| lexstate = ST_ATTRIBUTE; | |
| count = 0; | |
| goto repeat; | |
| case ASM_KEYW: | |
| lexstate = ST_ASM; | |
| count = 0; | |
| goto repeat; | |
| case STRUCT_KEYW: | |
| case UNION_KEYW: | |
| dont_want_brace_phrase = 3; | |
| case ENUM_KEYW: | |
| suppress_type_lookup = 2; | |
| goto fini; | |
| case EXPORT_SYMBOL_KEYW: | |
| goto fini; | |
| } | |
| } | |
| if (!suppress_type_lookup) | |
| { | |
| struct symbol *sym = find_symbol(yytext, SYM_TYPEDEF); | |
| if (sym && sym->type == SYM_TYPEDEF) | |
| 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_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 ')': 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: | |
| abort(); | |
| } | |
| 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; | |
| } | |
| #ifndef YYSTYPE | |
| #define YYSTYPE int | |
| #endif | |
| #define ASM_KEYW 257 | |
| #define ATTRIBUTE_KEYW 258 | |
| #define AUTO_KEYW 259 | |
| #define BOOL_KEYW 260 | |
| #define CHAR_KEYW 261 | |
| #define CONST_KEYW 262 | |
| #define DOUBLE_KEYW 263 | |
| #define ENUM_KEYW 264 | |
| #define EXTERN_KEYW 265 | |
| #define FLOAT_KEYW 266 | |
| #define INLINE_KEYW 267 | |
| #define INT_KEYW 268 | |
| #define LONG_KEYW 269 | |
| #define REGISTER_KEYW 270 | |
| #define RESTRICT_KEYW 271 | |
| #define SHORT_KEYW 272 | |
| #define SIGNED_KEYW 273 | |
| #define STATIC_KEYW 274 | |
| #define STRUCT_KEYW 275 | |
| #define TYPEDEF_KEYW 276 | |
| #define UNION_KEYW 277 | |
| #define UNSIGNED_KEYW 278 | |
| #define VOID_KEYW 279 | |
| #define VOLATILE_KEYW 280 | |
| #define TYPEOF_KEYW 281 | |
| #define EXPORT_SYMBOL_KEYW 282 | |
| #define ASM_PHRASE 283 | |
| #define ATTRIBUTE_PHRASE 284 | |
| #define BRACE_PHRASE 285 | |
| #define BRACKET_PHRASE 286 | |
| #define EXPRESSION_PHRASE 287 | |
| #define CHAR 288 | |
| #define DOTS 289 | |
| #define IDENT 290 | |
| #define INT 291 | |
| #define REAL 292 | |
| #define STRING 293 | |
| #define TYPE 294 | |
| #define OTHER 295 | |
| #define FILENAME 296 | |
| extern YYSTYPE yylval; |