/* A lexical scanner generated by flex */ /* Target: C/C++ */ /* START of m4 controls */ /* M4_YY_TABLES_VERIFY = 0 */ /* M4_MODE_NO_DO_STDINIT */ /* M4_MODE_NO_YYTEXT_IS_ARRAY */ /* M4_MODE_NO_YYMORE_USED */ /* M4_MODE_NO_REAL_FULLSPD */ /* M4_MODE_NO_REAL_FULLTBL */ /* M4_MODE_NO_CPP_USE_READ */ /* M4_MODE_NO_VARIABLE_TRAILING_CONTEXT_RULES */ /* M4_MODE_FIND_ACTION_REJECT_REALLY_USED */ /* M4_MODE_NO_USES_REJECT */ /* M4_MODE_USEMECS */ /* M4_MODE_FIND_ACTION_COMPRESSED */ /* M4_MODE_NO_FULLSPD */ /* M4_MODE_NO_BOL_NEEDED */ /* M4_MODE_USEECS */ /* M4_MODE_GENTABLES */ /* M4_MODE_INTERACTIVE */ /* M4_MODE_NO_FULLSPD_OR_FULLTBL */ /* M4_MODE_FIND_ACTION_REJECT_OR_INTERACTIVE */ /* M4_MODE_YYWRAP */ /* M4_MODE_INTERACTIVE */ /* M4_MODE_C_ONLY */ /* M4_MODE_PREFIX = yy */ /* M4_MODE_NO_REWRITE */ /* END of m4 controls */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 6 #define YY_FLEX_SUBMINOR_VERSION 4 #if YY_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ /* Feature test macros. Flex uses functions that require a minimum set of * macros defined. As defining some macros may hide function declarations that * user code might use, be conservative and respect user's definitions as much * as possible. In glibc, feature test macros may not be all set up until one * of the libc header (that includes ) is included. This creates * a circular dependency when we check the macros. is the safest * header we can include and does not declare too many functions we don't need. */ #if !defined(__GNU_LIBRARY__) && defined(__STDC__) #include #endif #if !(defined(_POSIX_C_SOURCE) || defined(_XOPEN_SOURCE) || \ defined(_POSIX_SOURCE)) # define _POSIX_C_SOURCE 1 /* Required for fileno() */ # define _POSIX_SOURCE 1 #endif #include #include #include #include /* end standard C headers. */ /* begin standard C++ headers. */ /* flex integer type definitions */ #ifndef YYFLEX_INTTYPES_DEFINED #define YYFLEX_INTTYPES_DEFINED /* Prefer C99 integer types if available. */ # if defined(__cplusplus) && __cplusplus >= 201103L #include # define YYFLEX_USE_STDINT # endif # if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* Include and not because Solaris 2.6 has the former * and not the latter. */ #include # define YYFLEX_USE_STDINT # else # if defined(_MSC_VER) && _MSC_VER >= 1600 /* Visual C++ 2010 does not define __STDC_VERSION__ and has but not * . */ #include # define YYFLEX_USE_STDINT # endif # endif # ifdef YYFLEX_USE_STDINT 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 unsigned char flex_uint8_t; typedef short int flex_int16_t; typedef unsigned short int flex_uint16_t; # ifdef __STDC__ typedef signed char flex_int8_t; /* ISO C only requires at least 16 bits for int. */ # ifdef __cplusplus #include # else #include # endif # if UINT_MAX >= 4294967295 # define YYFLEX_INT32_DEFINED typedef int flex_int32_t; typedef unsigned int flex_uint32_t; # endif # else typedef char flex_int8_t; # endif # ifndef YYFLEX_INT32_DEFINED typedef long int flex_int32_t; typedef unsigned long int flex_uint32_t; # endif # endif #endif /* YYFLEX_INTTYPES_DEFINED */ /* TODO: this is always defined, so inline it */ #define yyconst const #if defined(__GNUC__) && __GNUC__ >= 3 #define yynoreturn __attribute__((__noreturn__)) #else #define yynoreturn #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an * integer in range [0..255] for use as an array index. */ #define YY_SC_TO_UI(c) ((YY_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 yybegin(s) (yy_start) = 1 + 2 * (s) /* Legacy interface */ #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 yystart() (((yy_start) - 1) / 2) /* Legacy interfaces */ #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 /* The state buf must be large enough to hold one state per character in the main buffer, * plus the start state, plus the two end-of-buffer byte states. */ #define YY_STATE_BUF_EXTRA_SPACE 3 #define YY_STATE_BUF_SIZE (YY_BUF_SIZE + YY_STATE_BUF_EXTRA_SPACE) #ifndef YY_TYPEDEF_YY_BUFFER_STATE #define YY_TYPEDEF_YY_BUFFER_STATE typedef struct yy_buffer_state *yybuffer; /* Legacy interface */ typedef struct yy_buffer_state *YY_BUFFER_STATE; #endif #ifndef YY_TYPEDEF_YY_SIZE_T #define YY_TYPEDEF_YY_SIZE_T typedef size_t yy_size_t; #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) #define YY_LINENO_REWIND_TO(ptr) /* 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 yyunput(c) yyunput_r( c, (yytext_ptr) ) /* Legacy interface */ #define unput(c) yyunput_r( c, (yytext_ptr) ) #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. */ int 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 yyatbol; 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 yybuffer * yy_buffer_stack = NULL; /**< 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) /* Legacy interface */ #define YY_CURRENT_BUFFER yy_current_buffer() /* 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 = NULL; 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 ( yybuffer new_buffer ); yybuffer yy_create_buffer ( FILE *file, int size ); void yy_delete_buffer ( yybuffer b ); void yy_flush_buffer ( yybuffer b ); void yypush_buffer_state ( yybuffer 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 ( yybuffer b, FILE *file ); #define yy_flush_current_buffer() yy_flush_buffer( yy_current_buffer() ) #define YY_FLUSH_BUFFER yy_flush_current_buffer() yybuffer yy_scan_buffer ( char *base, yy_size_t size ); yybuffer yy_scan_string ( const char *yy_str ); yybuffer yy_scan_bytes ( const 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() == NULL ) { \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer( yyin, YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yysetbol(at_bol) \ { \ if ( yy_current_buffer() == NULL ) { \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer( yyin, YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yyatbol = at_bol; \ } #define yyatbol() (YY_CURRENT_BUFFER_LVALUE->yyatbol) /* Legacy interface */ #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yyatbol) #define yy_set_bol(at_bol) \ { \ if ( yy_current_buffer() == NULL ) { \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer( yyin, YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yyatbol = at_bol; \ } /* Begin user sect3 */ typedef flex_uint8_t YY_CHAR; FILE *yyin = NULL, *yyout = NULL; typedef int yy_state_type; extern int yylineno; int yylineno = 1; /* Watch out: yytext_ptr is a variable when yytext is an array, * but it's a macro when yytext is a pointer. */ extern char *yytext; #ifdef yytext_ptr #undef yytext_ptr #endif #define yytext_ptr yytext /* %% [1.5] DFA */ /* START of m4 controls */ /* M4_MODE_NO_NULTRANS */ /* M4_MODE_NO_NULTRANS_FULLTBL */ /* M4_MODE_NO_NULTRANS_FULLSPD */ /* END of m4 controls */ /* START of Flex-generated definitions */ #define YY_NUM_RULES 107 #define YY_END_OF_BUFFER 108 #define YY_JAMBASE 615 #define YY_JAMSTATE 283 #define YY_NUL_EC 1 #define YY_OFFSET_TYPE flex_int16_t /* END of Flex-generated definitions */ 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 yynoreturn yypanic ( const char* msg ); struct yy_trans_info { /* We require that yy_verify and yy_nxt must be of the same size int. */ /* We generate a bogus 'struct yy_trans_info' data type * so we can guarantee that it is always declared in the skel. * This is so we can compile "sizeof(struct yy_trans_info)" * in any scanner. */ flex_int32_t yy_verify; flex_int32_t yy_nxt; }; /* 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; extern int yyflexdebug; int yyflexdebug = 0; /* Legacy interface */ #ifndef yy_flex_debug #define yy_flex_debug yyflexdebug #endif /* %% [2.0] data tables for the DFA are inserted here */ /* footprint: 36292 bytes */ /* m4 controls begin */ /* M4_MODE_HAS_BACKING_UP */ /* M4_MODE_NEED_YY_CP */ /* m4 controls end */ static const flex_int16_t yy_accept[284] = { 0, 0, 0, 0, 0, 90, 90, 108, 107, 105, 106, 72, 76, 12, 38, 107, 2, 3, 9, 13, 8, 14, 7, 11, 96, 96, 73, 42, 17, 24, 19, 74, 10, 75, 75, 4, 5, 39, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 70, 37, 71, 15, 88, 78, 77, 107, 90, 92, 91, 23, 27, 36, 32, 0, 0, 25, 40, 28, 41, 29, 1, 0, 103, 89, 94, 26, 104, 96, 0, 96, 96, 0, 0, 96, 0, 20, 16, 22, 18, 21, 75, 0, 33, 75, 75, 75, 47, 75, 75, 75, 75, 75, 75, 43, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 34, 35, 88, 87, 80, 81, 85, 86, 82, 84, 83, 87, 90, 91, 91, 93, 95, 0, 0, 6, 0, 103, 94, 103, 0, 104, 0, 102, 96, 96, 96, 96, 0, 0, 98, 97, 30, 31, 75, 75, 75, 75, 75, 75, 75, 75, 45, 75, 51, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 80, 81, 79, 0, 0, 0, 103, 0, 103, 0, 104, 102, 96, 0, 0, 0, 98, 98, 98, 97, 97, 97, 75, 53, 75, 75, 75, 44, 67, 75, 75, 63, 52, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 57, 75, 80, 0, 0, 0, 103, 0, 0, 0, 99, 98, 98, 98, 98, 97, 97, 97, 97, 62, 64, 75, 75, 75, 55, 75, 50, 75, 75, 75, 75, 75, 75, 68, 75, 46, 0, 100, 0, 101, 99, 98, 97, 75, 56, 59, 69, 49, 65, 58, 54, 66, 75, 75, 100, 101, 75, 60, 75, 61, 48, 0 }; /* Character equivalence-class mapping */ static const YY_CHAR yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 1, 1, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, 19, 19, 19, 19, 20, 20, 21, 22, 23, 24, 25, 26, 27, 28, 28, 28, 28, 29, 30, 31, 31, 31, 31, 31, 32, 31, 31, 31, 33, 31, 31, 31, 31, 34, 31, 31, 35, 31, 31, 36, 37, 38, 39, 31, 1, 40, 41, 42, 43, 44, 45, 46, 47, 48, 31, 49, 50, 51, 52, 53, 54, 31, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }; /* Character meta-equivalence-class mappings */ static const YY_CHAR yy_meta[68] = { 0, 1, 1, 2, 1, 3, 1, 1, 4, 1, 1, 5, 1, 1, 1, 6, 1, 7, 7, 7, 8, 1, 1, 1, 1, 1, 9, 1, 8, 8, 8, 10, 10, 10, 10, 10, 1, 3, 1, 1, 7, 7, 8, 8, 8, 7, 10, 10, 10, 10, 10, 10, 11, 10, 10, 11, 10, 11, 10, 11, 10, 11, 10, 10, 1, 1, 1, 1 }; static const flex_int16_t yy_base[299] = { 0, 0, 0, 65, 66, 69, 70, 614, 615, 615, 615, 589, 615, 588, 67, 574, 615, 615, 586, 63, 615, 64, 75, 85, 95, 44, 615, 615, 53, 585, 58, 615, 615, 0, 600, 615, 615, 583, 551, 51, 552, 47, 66, 551, 55, 550, 558, 74, 539, 76, 547, 552, 615, 82, 615, 615, 0, 615, 615, 123, 0, 615, 107, 615, 615, 615, 615, 109, 115, 615, 615, 615, 615, 615, 615, 583, 141, 615, 0, 615, 170, 0, 189, 116, 88, 582, 108, 147, 560, 548, 615, 615, 615, 546, 0, 531, 615, 523, 515, 495, 486, 467, 464, 461, 455, 451, 424, 0, 423, 427, 421, 423, 89, 111, 421, 101, 426, 425, 615, 615, 0, 615, 175, 193, 615, 615, 615, 615, 615, 0, 0, 151, 161, 615, 615, 208, 0, 615, 216, 615, 0, 220, 239, 615, 204, 243, 121, 615, 440, 421, 0, 150, 237, 251, 615, 615, 430, 414, 161, 427, 423, 414, 419, 420, 0, 406, 0, 411, 398, 400, 402, 403, 388, 96, 395, 384, 370, 373, 364, 224, 259, 0, 273, 303, 279, 307, 341, 615, 295, 345, 615, 615, 165, 213, 354, 248, 197, 284, 270, 236, 320, 364, 0, 355, 359, 352, 0, 0, 346, 343, 0, 0, 334, 331, 343, 323, 321, 315, 314, 308, 298, 303, 0, 294, 362, 266, 0, 366, 374, 391, 403, 379, 408, 214, 615, 304, 285, 283, 615, 298, 279, 0, 0, 267, 272, 256, 0, 255, 0, 257, 249, 247, 186, 174, 152, 0, 130, 0, 412, 416, 424, 432, 615, 615, 615, 111, 0, 0, 0, 0, 0, 0, 0, 0, 118, 93, 615, 615, 67, 0, 43, 0, 0, 615, 482, 493, 504, 509, 520, 531, 542, 553, 562, 573, 579, 582, 584, 586, 588 }; static const flex_int16_t yy_def[299] = { 0, 283, 1, 284, 284, 285, 285, 283, 283, 283, 283, 283, 283, 283, 283, 286, 283, 283, 283, 283, 283, 283, 283, 283, 283, 24, 283, 283, 283, 283, 283, 283, 283, 287, 287, 283, 283, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 283, 283, 283, 288, 283, 283, 289, 290, 283, 291, 283, 283, 283, 283, 286, 292, 283, 283, 283, 283, 283, 283, 283, 283, 283, 293, 283, 283, 25, 283, 283, 283, 294, 283, 283, 295, 283, 283, 283, 283, 283, 287, 286, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 283, 288, 283, 283, 283, 283, 283, 283, 283, 283, 296, 290, 291, 291, 283, 283, 286, 297, 283, 283, 283, 293, 283, 283, 283, 283, 283, 283, 283, 283, 283, 298, 294, 283, 295, 283, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 283, 296, 286, 286, 283, 283, 283, 283, 283, 283, 283, 283, 298, 298, 283, 283, 283, 283, 283, 283, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 286, 183, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 283, 283, 283, 283, 283, 283, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 287, 283, 283, 287, 287, 287, 287, 287, 0, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283 }; static const flex_int16_t yy_nxt[683] = { 0, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 25, 25, 26, 27, 28, 29, 30, 31, 32, 33, 33, 33, 33, 34, 33, 34, 33, 35, 8, 36, 37, 33, 38, 39, 40, 41, 42, 43, 33, 44, 33, 45, 33, 33, 33, 33, 46, 47, 48, 49, 50, 51, 33, 33, 33, 52, 53, 54, 55, 57, 57, 58, 58, 61, 61, 65, 70, 89, 90, 72, 283, 62, 62, 92, 93, 95, 283, 282, 71, 73, 74, 75, 66, 76, 76, 76, 76, 77, 101, 98, 102, 107, 78, 59, 59, 99, 283, 118, 108, 103, 79, 80, 281, 81, 81, 81, 81, 104, 134, 132, 105, 148, 111, 112, 133, 82, 152, 152, 83, 115, 84, 85, 113, 135, 135, 135, 170, 86, 280, 149, 82, 122, 122, 122, 123, 217, 87, 68, 119, 146, 175, 147, 172, 171, 84, 218, 147, 88, 176, 76, 76, 76, 76, 283, 279, 124, 193, 173, 283, 125, 278, 138, 139, 132, 139, 147, 126, 136, 133, 127, 147, 128, 147, 275, 194, 129, 138, 139, 141, 141, 141, 141, 139, 179, 179, 179, 180, 274, 146, 229, 142, 143, 144, 143, 144, 194, 147, 145, 145, 145, 145, 180, 180, 180, 180, 142, 143, 134, 203, 204, 229, 143, 145, 145, 145, 145, 182, 182, 182, 184, 235, 184, 273, 272, 185, 185, 185, 185, 141, 141, 141, 141, 224, 224, 224, 180, 68, 230, 236, 234, 186, 187, 188, 187, 188, 152, 152, 189, 189, 189, 189, 145, 145, 145, 145, 186, 187, 193, 230, 239, 195, 187, 196, 234, 190, 134, 190, 180, 180, 180, 180, 233, 134, 234, 198, 194, 199, 240, 197, 190, 271, 225, 225, 225, 190, 270, 196, 185, 185, 185, 185, 269, 200, 237, 68, 238, 194, 234, 268, 267, 199, 68, 134, 189, 189, 189, 189, 266, 238, 234, 265, 226, 226, 226, 226, 185, 185, 185, 185, 238, 264, 264, 226, 226, 226, 233, 263, 263, 139, 257, 139, 68, 238, 234, 226, 226, 226, 226, 226, 226, 256, 255, 254, 139, 227, 238, 227, 253, 139, 228, 228, 228, 228, 189, 189, 189, 189, 231, 252, 231, 251, 237, 232, 232, 232, 232, 143, 250, 143, 238, 180, 180, 180, 180, 228, 228, 228, 228, 249, 248, 247, 143, 228, 228, 228, 228, 143, 232, 232, 232, 232, 246, 245, 244, 258, 187, 258, 187, 243, 259, 259, 259, 259, 242, 241, 223, 260, 222, 260, 221, 187, 261, 261, 261, 261, 187, 232, 232, 232, 232, 259, 259, 259, 259, 259, 259, 259, 259, 220, 262, 219, 262, 261, 261, 261, 261, 216, 276, 215, 276, 261, 261, 261, 261, 262, 214, 213, 212, 211, 262, 210, 209, 276, 277, 208, 277, 207, 276, 206, 205, 202, 201, 191, 191, 178, 177, 174, 169, 277, 168, 167, 166, 165, 277, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 67, 164, 67, 163, 67, 67, 67, 67, 67, 67, 67, 94, 94, 162, 94, 94, 120, 161, 160, 120, 120, 120, 120, 120, 120, 120, 120, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 121, 130, 159, 130, 130, 158, 130, 130, 130, 130, 130, 130, 131, 157, 131, 131, 131, 131, 131, 131, 131, 131, 131, 67, 67, 156, 68, 67, 155, 67, 154, 67, 140, 150, 140, 140, 140, 140, 140, 140, 140, 140, 140, 151, 151, 151, 153, 153, 153, 181, 181, 183, 183, 192, 192, 150, 137, 117, 116, 114, 110, 109, 106, 100, 97, 96, 95, 91, 69, 68, 64, 63, 283, 7, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283 }; static const flex_int16_t yy_chk[683] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 3, 4, 5, 6, 14, 19, 28, 28, 21, 25, 5, 6, 30, 30, 49, 25, 280, 19, 21, 21, 22, 14, 22, 22, 22, 22, 23, 41, 39, 41, 44, 23, 3, 4, 39, 25, 53, 44, 41, 23, 24, 278, 24, 24, 24, 24, 42, 67, 62, 42, 84, 47, 47, 62, 24, 86, 86, 24, 49, 24, 24, 47, 68, 68, 68, 112, 24, 275, 84, 24, 59, 59, 59, 59, 173, 24, 67, 53, 83, 115, 83, 113, 112, 24, 173, 146, 24, 115, 76, 76, 76, 76, 131, 274, 59, 151, 113, 131, 59, 265, 76, 76, 132, 76, 83, 59, 68, 132, 59, 146, 59, 87, 256, 151, 59, 76, 76, 80, 80, 80, 80, 76, 122, 122, 122, 122, 254, 87, 192, 80, 80, 82, 80, 82, 151, 87, 82, 82, 82, 82, 123, 123, 123, 123, 80, 80, 135, 158, 158, 192, 80, 144, 144, 144, 144, 135, 135, 135, 138, 196, 138, 253, 252, 138, 138, 138, 138, 141, 141, 141, 141, 179, 179, 179, 179, 135, 193, 196, 233, 141, 141, 142, 141, 142, 152, 152, 142, 142, 142, 142, 145, 145, 145, 145, 141, 141, 153, 193, 199, 152, 141, 152, 233, 145, 225, 145, 180, 180, 180, 180, 195, 182, 195, 153, 153, 153, 199, 152, 145, 251, 182, 182, 182, 145, 250, 152, 184, 184, 184, 184, 249, 153, 198, 225, 198, 153, 195, 247, 245, 153, 182, 183, 188, 188, 188, 188, 244, 237, 197, 243, 183, 183, 183, 183, 185, 185, 185, 185, 198, 240, 239, 183, 183, 183, 197, 236, 235, 185, 223, 185, 183, 237, 197, 183, 183, 183, 183, 183, 183, 221, 220, 219, 185, 186, 200, 186, 218, 185, 186, 186, 186, 186, 189, 189, 189, 189, 194, 217, 194, 216, 200, 194, 194, 194, 194, 189, 215, 189, 200, 224, 224, 224, 224, 227, 227, 227, 227, 214, 213, 212, 189, 228, 228, 228, 228, 189, 231, 231, 231, 231, 209, 208, 205, 229, 228, 229, 228, 204, 229, 229, 229, 229, 203, 201, 178, 230, 177, 230, 176, 228, 230, 230, 230, 230, 228, 232, 232, 232, 232, 258, 258, 258, 258, 259, 259, 259, 259, 175, 232, 174, 232, 260, 260, 260, 260, 172, 259, 171, 259, 261, 261, 261, 261, 232, 170, 169, 168, 167, 232, 165, 163, 259, 261, 162, 261, 161, 259, 160, 159, 157, 156, 149, 148, 117, 116, 114, 111, 261, 110, 109, 108, 106, 261, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 285, 285, 285, 285, 285, 285, 285, 285, 285, 285, 285, 286, 105, 286, 104, 286, 286, 286, 286, 286, 286, 286, 287, 287, 103, 287, 287, 288, 102, 101, 288, 288, 288, 288, 288, 288, 288, 288, 289, 289, 289, 289, 289, 289, 289, 289, 289, 289, 289, 290, 100, 290, 290, 99, 290, 290, 290, 290, 290, 290, 291, 98, 291, 291, 291, 291, 291, 291, 291, 291, 291, 292, 292, 97, 95, 292, 93, 292, 89, 292, 293, 88, 293, 293, 293, 293, 293, 293, 293, 293, 293, 294, 294, 294, 295, 295, 295, 296, 296, 297, 297, 298, 298, 85, 75, 51, 50, 48, 46, 45, 43, 40, 38, 37, 34, 29, 18, 15, 13, 11, 7, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283 }; /* Definitions for backing up. We don't need them if yyreject() * is being used because then we use an alternative backing-up * technique instead. */ static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; /* The intent behind this definition is that it'll catch * any uses of yyreject() which flex missed. */ #define yyreject() reject_used_but_not_detected #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; /* %% [3.0] static declarations conditional on mode switches go here */ #line 1 "cod/cod.l" #line 18 "cod/cod.l" static int lex_offset = 1; static int line_count = 1; static char *create_string_from_yytext(); #define RETURN(val) {yylval.info.lx_srcpos.line = line_count; yylval.info.lx_srcpos.character = lex_offset; lex_offset +=yyleng; return(val);} static int type_count; static char**types; static char**enums; #ifdef input /* lex, not flex */ static char *saved_input_str = NULL; static void terminate_string_parse() { if (saved_input_str) { free(saved_input_str); saved_input_str = NULL; } } static char *input_str = NULL; static void setup_for_string_parse(string, defined_types, enum_constants) const char *string; char **defined_types; char **enum_constants; { int len = strlen(string); types = defined_types; enums = enum_constants; if (saved_input_str != NULL) free(input_str); input_str = malloc(len + 2); saved_input_str = input_str; strcpy(input_str, string); input_str[len] = 0; input_str[len + 1] = 0; lex_offset = 1; line_count = 1; } #undef input #define input() (((yytchar=*input_str)==0)?0:(input_str++,yytchar==10?(yylineno++,yytchar):yytchar)) #undef unput #define unput(c) (input_str--,c==10?yylineno--:yylineno) #else /* flex */ #ifdef YY_INPUT #undef YY_INPUT extern int my_yy_input(); #define YY_INPUT(buf,x,y) x=my_yy_input(buf,x,y) #endif /* end of lex ifdef */ #endif static int is_defined_type(id) char *id; { int i = 0; while(types && types[i]) { if (strcmp(id, types[i]) == 0) return 1; i++; } return 0; } static int is_enumeration_constant(id) char *id; { int i = 0; while(enums && enums[i]) { if (strcmp(id, enums[i]) == 0) return 1; i++; } return 0; } static void check_strbuf(); static int buffer_len; static char *string_buffer; static char *string_buf_ptr; #line 864 "/beegfs/apps/openfoam-v2306/OpenFOAM-v2306/ThirdParty/build/linux64Gcc/ADIOS2-2.8.3/thirdparty/ffs/ffs/lex.yy.c" #line 866 "/beegfs/apps/openfoam-v2306/OpenFOAM-v2306/ThirdParty/build/linux64Gcc/ADIOS2-2.8.3/thirdparty/ffs/ffs/lex.yy.c" #define INITIAL 0 #define string_cond 1 #define comment 2 #ifndef YY_NO_UNISTD_H /* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */ #include #endif #ifndef YY_EXTRA_TYPE #define YY_EXTRA_TYPE void * #endif /* 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 #ifndef YY_NO_YYUNPUT static void yyunput_r ( int c, char *buf_ptr ); #endif #ifndef yytext_ptr static void yy_flex_strncpy ( char *, const char *, int ); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen ( const char * ); #endif #ifndef YY_NO_YYINPUT static int yyinput ( void ); #ifndef __cplusplus #define input yyinput #endif #endif /* * Amount of stuff to slurp up with each read. * We assume the stdio library has already * chosen a fit size foe whatever platform * we're running on. */ #define YY_READ_BUF_SIZE BUFSIZ /* Size of default input buffer. We want to be able to fit two * OS-level reads, but efficiency gains as the buffer size * increases fall off after that */ #ifndef YY_BUF_SIZE #define YY_BUF_SIZE (2 * YY_READ_BUF_SIZE) #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef yyecho /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define yyecho() do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0) #endif /* Legacy interface */ #define ECHO yyecho() #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif static void yynoreturn yypanic (const char* msg ) { fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Report a fatal error. Legacy interface. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yypanic( msg ) #endif /* Legacy interface */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) do {result = yyread(buf, max_size );} while (0) /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ static int yyread(char *buf, size_t max_size ) { int result; 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 = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) { if( errno != EINTR) { YY_FATAL_ERROR( "input in flex scanner failed" ); break; } errno=0; clearerr(yyin); } } return result; } #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 /* 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 #define YY_RULE_SETUP \ YY_USER_ACTION /** The main scanner function which does all the work. */ YY_DECL { yy_state_type yy_current_state; char *yy_cp, *yy_bp; int yy_act; 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() == NULL ) { yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer( yyin, YY_BUF_SIZE ); } yy_load_buffer_state( ); } /* open scope of user declarationns */ { /* %% [4.0] user's declarations go here */ #line 103 "cod/cod.l" #line 1114 "/beegfs/apps/openfoam-v2306/OpenFOAM-v2306/ThirdParty/build/linux64Gcc/ADIOS2-2.8.3/thirdparty/ffs/ffs/lex.yy.c" while ( /*CONSTCOND*/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; /* Generate the code to find the start state. */ yy_current_state = (yy_start); /* Set up for storing up states. */ yy_match: /* Generate the code to find the next match. */ do { int yy_c = *(yy_ec+YY_SC_TO_UI(*yy_cp)); /* Save the backing-up info \before/ computing the next state * because we always compute one more state than needed - we * always proceed until we reach a jam state */ /* Generate code to keep backing-up information. */ 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]; /* We've arranged it so that templates are never chained * to one another. This means we can afford to make a * very simple test to see if we need to convert to * yy_c's meta-equivalence class without worrying * about erroneously looking up the meta-equivalence * class twice */ /* lastdfa + 2 == YY_JAMSTATE + 1 is the beginning of the templates */ if (yy_current_state >= YY_JAMSTATE + 1) { yy_c = yy_meta[yy_c]; } } yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != YY_JAMBASE ); yy_find_action: /* code to find the action number goes here */ 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); /* Backing-up info for compressed tables is taken \after/ */ /* yy_cp has been incremented for the next state. */ yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; /* %% [5.0] user actions get inserted here */ case 1: YY_RULE_SETUP #line 106 "cod/cod.l" {RETURN(ARROW);} /*LINTED*/break; case 2: YY_RULE_SETUP #line 107 "cod/cod.l" {RETURN(LPAREN);} /*LINTED*/break; case 3: YY_RULE_SETUP #line 108 "cod/cod.l" {RETURN(RPAREN);} /*LINTED*/break; case 4: YY_RULE_SETUP #line 109 "cod/cod.l" {RETURN(LBRACKET);} /*LINTED*/break; case 5: YY_RULE_SETUP #line 110 "cod/cod.l" {RETURN(RBRACKET);} /*LINTED*/break; case 6: YY_RULE_SETUP #line 111 "cod/cod.l" {RETURN(DOTDOTDOT);} /*LINTED*/break; case 7: YY_RULE_SETUP #line 112 "cod/cod.l" {RETURN(DOT);} /*LINTED*/break; case 8: YY_RULE_SETUP #line 113 "cod/cod.l" {RETURN(COMMA);} /*LINTED*/break; case 9: YY_RULE_SETUP #line 114 "cod/cod.l" {RETURN(STAR);} /*LINTED*/break; case 10: YY_RULE_SETUP #line 115 "cod/cod.l" {RETURN(AT);} /*LINTED*/break; case 11: YY_RULE_SETUP #line 116 "cod/cod.l" {RETURN(SLASH);} /*LINTED*/break; case 12: YY_RULE_SETUP #line 117 "cod/cod.l" {RETURN(MODULUS);} /*LINTED*/break; case 13: YY_RULE_SETUP #line 118 "cod/cod.l" {RETURN(PLUS);} /*LINTED*/break; case 14: YY_RULE_SETUP #line 119 "cod/cod.l" {RETURN(MINUS);} /*LINTED*/break; case 15: YY_RULE_SETUP #line 120 "cod/cod.l" {RETURN(TILDE);} /*LINTED*/break; case 16: YY_RULE_SETUP #line 121 "cod/cod.l" {RETURN(LEQ);} /*LINTED*/break; case 17: YY_RULE_SETUP #line 122 "cod/cod.l" {RETURN(LT);} /*LINTED*/break; case 18: YY_RULE_SETUP #line 123 "cod/cod.l" {RETURN(GEQ);} /*LINTED*/break; case 19: YY_RULE_SETUP #line 124 "cod/cod.l" {RETURN(GT);} /*LINTED*/break; case 20: YY_RULE_SETUP #line 125 "cod/cod.l" {RETURN(LEFT_SHIFT);} /*LINTED*/break; case 21: YY_RULE_SETUP #line 126 "cod/cod.l" {RETURN(RIGHT_SHIFT);} /*LINTED*/break; case 22: YY_RULE_SETUP #line 127 "cod/cod.l" {RETURN(EQ);} /*LINTED*/break; case 23: YY_RULE_SETUP #line 128 "cod/cod.l" {RETURN(NEQ);} /*LINTED*/break; case 24: YY_RULE_SETUP #line 129 "cod/cod.l" {RETURN(ASSIGN);} /*LINTED*/break; case 25: YY_RULE_SETUP #line 130 "cod/cod.l" {RETURN(MUL_ASSIGN);} /*LINTED*/break; case 26: YY_RULE_SETUP #line 131 "cod/cod.l" {RETURN(DIV_ASSIGN);} /*LINTED*/break; case 27: YY_RULE_SETUP #line 132 "cod/cod.l" {RETURN(MOD_ASSIGN);} /*LINTED*/break; case 28: YY_RULE_SETUP #line 133 "cod/cod.l" {RETURN(ADD_ASSIGN);} /*LINTED*/break; case 29: YY_RULE_SETUP #line 134 "cod/cod.l" {RETURN(SUB_ASSIGN);} /*LINTED*/break; case 30: YY_RULE_SETUP #line 135 "cod/cod.l" {RETURN(LEFT_ASSIGN);} /*LINTED*/break; case 31: YY_RULE_SETUP #line 136 "cod/cod.l" {RETURN(RIGHT_ASSIGN);} /*LINTED*/break; case 32: YY_RULE_SETUP #line 137 "cod/cod.l" {RETURN(AND_ASSIGN);} /*LINTED*/break; case 33: YY_RULE_SETUP #line 138 "cod/cod.l" {RETURN(XOR_ASSIGN);} /*LINTED*/break; case 34: YY_RULE_SETUP #line 139 "cod/cod.l" {RETURN(OR_ASSIGN);} /*LINTED*/break; case 35: YY_RULE_SETUP #line 140 "cod/cod.l" {RETURN(LOG_OR);} /*LINTED*/break; case 36: YY_RULE_SETUP #line 141 "cod/cod.l" {RETURN(LOG_AND);} /*LINTED*/break; case 37: YY_RULE_SETUP #line 142 "cod/cod.l" {RETURN(ARITH_OR);} /*LINTED*/break; case 38: YY_RULE_SETUP #line 143 "cod/cod.l" {RETURN(ARITH_AND);} /*LINTED*/break; case 39: YY_RULE_SETUP #line 144 "cod/cod.l" {RETURN(ARITH_XOR);} /*LINTED*/break; case 40: YY_RULE_SETUP #line 145 "cod/cod.l" {RETURN(INC_OP);} /*LINTED*/break; case 41: YY_RULE_SETUP #line 146 "cod/cod.l" {RETURN(DEC_OP);} /*LINTED*/break; case 42: YY_RULE_SETUP #line 147 "cod/cod.l" {RETURN(SEMI);} /*LINTED*/break; case 43: YY_RULE_SETUP #line 148 "cod/cod.l" {RETURN(IF);} /*LINTED*/break; case 44: YY_RULE_SETUP #line 149 "cod/cod.l" {RETURN(ELSE);} /*LINTED*/break; case 45: YY_RULE_SETUP #line 150 "cod/cod.l" {RETURN(FOR);} /*LINTED*/break; case 46: YY_RULE_SETUP #line 151 "cod/cod.l" {RETURN(WHILE);} /*LINTED*/break; case 47: YY_RULE_SETUP #line 152 "cod/cod.l" {RETURN(DO);} /*LINTED*/break; case 48: YY_RULE_SETUP #line 153 "cod/cod.l" {RETURN(UNSIGNED);} /*LINTED*/break; case 49: YY_RULE_SETUP #line 154 "cod/cod.l" {RETURN(SIGNED);} /*LINTED*/break; case 50: YY_RULE_SETUP #line 155 "cod/cod.l" {RETURN(SHORT);} /*LINTED*/break; case 51: YY_RULE_SETUP #line 156 "cod/cod.l" {RETURN(INT);} /*LINTED*/break; case 52: YY_RULE_SETUP #line 157 "cod/cod.l" {RETURN(LONG);} /*LINTED*/break; case 53: YY_RULE_SETUP #line 158 "cod/cod.l" {RETURN(CHAR);} /*LINTED*/break; case 54: YY_RULE_SETUP #line 159 "cod/cod.l" {RETURN(STRING);} /*LINTED*/break; case 55: YY_RULE_SETUP #line 160 "cod/cod.l" {RETURN(FLOAT);} /*LINTED*/break; case 56: YY_RULE_SETUP #line 161 "cod/cod.l" {RETURN(DOUBLE);} /*LINTED*/break; case 57: YY_RULE_SETUP #line 162 "cod/cod.l" {RETURN(VOID);} /*LINTED*/break; case 58: YY_RULE_SETUP #line 163 "cod/cod.l" {RETURN(STATIC);} /*LINTED*/break; case 59: YY_RULE_SETUP #line 164 "cod/cod.l" {RETURN(EXTERN_TOKEN);} /*LINTED*/break; case 60: YY_RULE_SETUP #line 165 "cod/cod.l" {RETURN(TYPEDEF);} /*LINTED*/break; case 61: YY_RULE_SETUP #line 166 "cod/cod.l" {RETURN(CONTINUE);} /*LINTED*/break; case 62: YY_RULE_SETUP #line 167 "cod/cod.l" {RETURN(BREAK);} /*LINTED*/break; case 63: YY_RULE_SETUP #line 168 "cod/cod.l" {RETURN(GOTO);} /*LINTED*/break; case 64: YY_RULE_SETUP #line 169 "cod/cod.l" {RETURN(CONST);} /*LINTED*/break; case 65: YY_RULE_SETUP #line 170 "cod/cod.l" {RETURN(SIZEOF);} /*LINTED*/break; case 66: YY_RULE_SETUP #line 171 "cod/cod.l" {RETURN(STRUCT);} /*LINTED*/break; case 67: YY_RULE_SETUP #line 172 "cod/cod.l" {RETURN(ENUM);} /*LINTED*/break; case 68: YY_RULE_SETUP #line 173 "cod/cod.l" {RETURN(UNION);} /*LINTED*/break; case 69: YY_RULE_SETUP #line 174 "cod/cod.l" {RETURN(RETURN_TOKEN);} /*LINTED*/break; case 70: YY_RULE_SETUP #line 175 "cod/cod.l" { int count = 0; while(types && types[count]) count++; yylval.info.type_stack_count = count; RETURN(LCURLY); } /*LINTED*/break; case 71: YY_RULE_SETUP #line 181 "cod/cod.l" {RETURN(RCURLY);} /*LINTED*/break; case 72: YY_RULE_SETUP #line 182 "cod/cod.l" {RETURN(BANG);} /*LINTED*/break; case 73: YY_RULE_SETUP #line 183 "cod/cod.l" {RETURN(COLON);} /*LINTED*/break; case 74: YY_RULE_SETUP #line 184 "cod/cod.l" {RETURN(QUESTION);} /*LINTED*/break; case 75: YY_RULE_SETUP #line 185 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); if (is_defined_type(yylval.info.string)) { RETURN(type_id); } else if (is_enumeration_constant(yylval.info.string)) { RETURN(enumeration_constant); } else { RETURN(identifier_ref); } } /*LINTED*/break; case 76: YY_RULE_SETUP #line 196 "cod/cod.l" { buffer_len = 20; string_buffer = malloc(20 + 1); string_buf_ptr = string_buffer; BEGIN(string_cond); } /*LINTED*/break; case 77: YY_RULE_SETUP #line 202 "cod/cod.l" { /* saw closing quote - all done */ BEGIN(INITIAL); *string_buf_ptr = '\0'; /* return string constant token type and * value to parser */ yylval.info.string = string_buffer; RETURN(string_constant); } /*LINTED*/break; case 78: /* rule 78 can match eol */ YY_RULE_SETUP #line 212 "cod/cod.l" { yyerror("Unterminated string constant"); } /*LINTED*/break; case 79: YY_RULE_SETUP #line 216 "cod/cod.l" { /* hex escape sequence */ int result; (void) sscanf( yytext + 2, "%x", &result ); if ( result > 0xff ) { yyerror("bad hex escape character"); } check_strbuf(); *string_buf_ptr++ = result; } /*LINTED*/break; case 80: YY_RULE_SETUP #line 230 "cod/cod.l" { /* octal escape sequence */ int result; (void) sscanf( yytext + 1, "%o", &result ); if ( result > 0xff ) { yyerror("bad octal escape character"); } check_strbuf(); *string_buf_ptr++ = result; } /*LINTED*/break; case 81: YY_RULE_SETUP #line 244 "cod/cod.l" { yyerror("bad character escape"); } /*LINTED*/break; case 82: YY_RULE_SETUP #line 248 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = '\n';} /*LINTED*/break; case 83: YY_RULE_SETUP #line 249 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = '\t';} /*LINTED*/break; case 84: YY_RULE_SETUP #line 250 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = '\r';} /*LINTED*/break; case 85: YY_RULE_SETUP #line 251 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = '\b';} /*LINTED*/break; case 86: YY_RULE_SETUP #line 252 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = '\f';} /*LINTED*/break; case 87: /* rule 87 can match eol */ YY_RULE_SETUP #line 254 "cod/cod.l" {check_strbuf();*string_buf_ptr++ = yytext[1];} /*LINTED*/break; case 88: YY_RULE_SETUP #line 256 "cod/cod.l" { char *yptr = yytext; while ( *yptr ) { check_strbuf(); *string_buf_ptr++ = *yptr++; } } /*LINTED*/break; case 89: YY_RULE_SETUP #line 267 "cod/cod.l" BEGIN(comment); /*LINTED*/break; case 90: YY_RULE_SETUP #line 269 "cod/cod.l" {lex_offset += yyleng;} /* eat anything that's not a '*' */ /*LINTED*/break; case 91: YY_RULE_SETUP #line 270 "cod/cod.l" {lex_offset += yyleng;} /* eat up '*'s not followed by '/'s */ /*LINTED*/break; case 92: /* rule 92 can match eol */ YY_RULE_SETUP #line 271 "cod/cod.l" {++line_count;lex_offset = 1;} /*LINTED*/break; case 93: YY_RULE_SETUP #line 272 "cod/cod.l" {lex_offset += yyleng;BEGIN(INITIAL);} /*LINTED*/break; case 94: YY_RULE_SETUP #line 273 "cod/cod.l" { /* consume //-comment */ } /*LINTED*/break; case 95: YY_RULE_SETUP #line 275 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(character_constant); } /*LINTED*/break; case 96: YY_RULE_SETUP #line 279 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(integer_constant); } /*LINTED*/break; case 97: YY_RULE_SETUP #line 283 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(integer_constant); } /*LINTED*/break; case 98: YY_RULE_SETUP #line 288 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(integer_constant); } /*LINTED*/break; case 99: YY_RULE_SETUP #line 293 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 100: YY_RULE_SETUP #line 297 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 101: YY_RULE_SETUP #line 301 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 102: YY_RULE_SETUP #line 305 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 103: YY_RULE_SETUP #line 310 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 104: YY_RULE_SETUP #line 315 "cod/cod.l" { yylval.info.string = create_string_from_yytext(); RETURN(floating_constant); } /*LINTED*/break; case 105: YY_RULE_SETUP #line 320 "cod/cod.l" {lex_offset += yyleng;} /*LINTED*/break; case 106: /* rule 106 can match eol */ YY_RULE_SETUP #line 321 "cod/cod.l" {lex_offset = 1; line_count++;} /*LINTED*/break; case 107: YY_RULE_SETUP #line 322 "cod/cod.l" yyecho(); /*LINTED*/break; #line 1942 "/beegfs/apps/openfoam-v2306/OpenFOAM-v2306/ThirdParty/build/linux64Gcc/ADIOS2-2.8.3/thirdparty/ffs/ffs/lex.yy.c" #line 1943 "/beegfs/apps/openfoam-v2306/OpenFOAM-v2306/ThirdParty/build/linux64Gcc/ADIOS2-2.8.3/thirdparty/ffs/ffs/lex.yy.c" case YY_STATE_EOF(INITIAL): /* FALLTHROUGH */ case YY_STATE_EOF(string_cond): /* FALLTHROUGH */ case YY_STATE_EOF(comment): /* FALLTHROUGH */ 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 { /* Still need to initialize yy_cp, though * yy_current_state was set up by * yy_get_previous_state(). */ yy_cp = (yy_c_buf_p); goto yy_find_action; } } else { /* not a NUL */ 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(yystart()); 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; } /* end EOB inner switch */ } /* end if */ break; } /* case YY_END_OF_BUFFER */ default: YY_FATAL_ERROR("fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of user's declarations */ } /* 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) { char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; char *source = (yytext_ptr); 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 */ yybuffer b = YY_CURRENT_BUFFER_LVALUE; 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, (yy_size_t) (b->yy_buf_size + 2) ); } else { /* Can't grow it, we don't own it. */ b->yy_ch_buf = NULL; } 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), 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_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { /* Extend the array by 50%, plus the number we really need. */ int 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, (yy_size_t) new_size ); if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) { YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); } /* "- 2" to take care of EOB's */ YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2); } (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) { yy_state_type yy_current_state; char *yy_cp; /* Generate the code to find the start state. */ yy_current_state = (yy_start); /* Set up for storing up states. */ for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) { /* Generate the code to find the next state. */ int yy_c = (*yy_cp ? *(yy_ec+YY_SC_TO_UI(*yy_cp)) : YY_NUL_EC); /* Save the backing-up info \before/ computing the next state * because we always compute one more state than needed - we * always proceed until we reach a jam state */ /* Generate code to keep backing-up information. */ 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]; /* We've arranged it so that templates are never chained * to one another. This means we can afford to make a * very simple test to see if we need to convert to * yy_c's meta-equivalence class without worrying * about erroneously looking up the meta-equivalence * class twice */ /* lastdfa + 2 == YY_JAMSTATE + 1 is the beginning of the templates */ if (yy_current_state >= YY_JAMSTATE + 1) { yy_c = yy_meta[yy_c]; } } yy_current_state = yy_nxt[yy_base[yy_current_state] + 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 ) { int yy_is_jam; /* Generate code for handling NUL's, if needed. */ /* First, deal with backing up and setting up yy_cp if the scanner * finds that it should JAM on the NUL. * * Only generate a definition for "yy_cp" if we'll generate code * that uses it. Otherwise lint and the like complain. */ char *yy_cp = (yy_c_buf_p); int yy_c = YY_NUL_EC; /* Save the backing-up info \before/ computing the next state * because we always compute one more state than needed - we * always proceed until we reach a jam state */ /* Generate code to keep backing-up information. */ 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]; /* We've arranged it so that templates are never chained * to one another. This means we can afford to make a * very simple test to see if we need to convert to * yy_c's meta-equivalence class without worrying * about erroneously looking up the meta-equivalence * class twice */ /* lastdfa + 2 == YY_JAMSTATE + 1 is the beginning of the templates */ if (yy_current_state >= YY_JAMSTATE + 1) { yy_c = yy_meta[yy_c]; } } yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; yy_is_jam = (yy_current_state == YY_JAMSTATE); return yy_is_jam ? 0 : yy_current_state; } static void yyunput_r (int c, char * yy_bp ) { 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. */ int number_to_move = (yy_n_chars) + 2; char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; 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) = (int) 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_YYINPUT int yyinput (void) { 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 = (int) ((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 0; } if ( ! (yy_did_buffer_switch_on_eof) ) { YY_NEW_FILE; } return yyinput(); case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + offset; break; } } } c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ *(yy_c_buf_p) = '\0'; /* preserve yytext */ (yy_hold_char) = *++(yy_c_buf_p); return c; } #endif /* ifndef YY_NO_YYINPUT */ /** 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 ) { size_t new_size = 0; yy_state_type *new_state_buf = 0; if ( yy_current_buffer() == NULL ) { yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer( yyin, YY_BUF_SIZE ); } yy_init_buffer( YY_CURRENT_BUFFER_LVALUE, input_file ); 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; } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ void yy_switch_to_buffer (yybuffer new_buffer ) { size_t new_size = 0; yy_state_type *new_state_buf = 0; /* 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. */ yybuffer yy_create_buffer (FILE * file, int size ) { yybuffer b; b = (yybuffer) yyalloc( sizeof( struct yy_buffer_state ) ); if ( b == NULL ) { 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( (yy_size_t) (b->yy_buf_size + 2) ); if ( b->yy_ch_buf == NULL ) { 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 (yybuffer b ) { if ( b == NULL ) { return; } if ( b == yy_current_buffer() ) { /* Not sure if we should pop here. */ YY_CURRENT_BUFFER_LVALUE = (yybuffer) 0; } if ( b->yy_is_our_buffer ) { yyfree( (void *) b->yy_ch_buf ); } yyfree( (void *) b ); } /* 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 (yybuffer b, FILE * file ) { int oerrno = errno; yy_flush_buffer( b ); b->yy_input_file = file; /* b->yy_input_file should never by NULL but we'll handle it cleanly * on the off chance. */ if (b->yy_input_file == NULL){ b->yy_fill_buffer = 0; } else { 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 (yybuffer b ) { if ( b == NULL ) { 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->yyatbol = 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 (yybuffer new_buffer ) { if (new_buffer == NULL) { return; } yyensure_buffer_stack(); /* This block is copied from yy_switch_to_buffer. */ if ( yy_current_buffer() != NULL ) { /* 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() == NULL) { 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() != NULL) { 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) { yy_size_t num_to_alloc; if ((yy_buffer_stack) == NULL) { /* 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; /* After all that talk, this was set to 1 anyways... */ (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc (num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( (yy_buffer_stack == NULL) ) { 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. */ yy_size_t 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) == NULL) { 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. */ yybuffer yy_scan_buffer (char * base, yy_size_t size ) { yybuffer 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 NULL; } b = (yybuffer) yyalloc( sizeof( struct yy_buffer_state ) ); if ( b == NULL ) { YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); } b->yy_buf_size = (int) (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 = NULL; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yyatbol = 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. */ yybuffer yy_scan_string (const char * yystr ) { return yy_scan_bytes( yystr, (int) 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 yybytes the byte buffer to scan * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. * * @return the newly allocated buffer state object. */ yybuffer yy_scan_bytes (const char * yybytes, int _yybytes_len ) { yybuffer b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = (yy_size_t) (_yybytes_len + 2); buf = (char *) yyalloc( n ); if ( buf == 0 ) { 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 == NULL ) { 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; } /* 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 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 yyflexdebug; } void yyset_debug (int _bdebug ) { yyflexdebug = _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) = NULL; (yy_buffer_stack_top) = 0; (yy_buffer_stack_max) = 0; (yy_c_buf_p) = NULL; (yy_init) = 0; (yy_start) = 0; /* Defined in main.c */ #ifdef YY_STDINIT yyin = stdin; yyout = stdout; #else yyin = NULL; yyout = NULL; #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, const char * s2, int n ) { int i; for ( i = 0; i < n; ++i ) { s1[i] = s2[i]; } } #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (const char * s ) { int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *yyalloc (yy_size_t size ) { return 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 realloc(ptr, size); } void yyfree (void * ptr ) { free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ } #line 322 "cod/cod.l" static char *create_string_from_yytext() { char *st = (char *) malloc((yyleng+1)*sizeof(char)); strcpy (st, yytext); return(st); } static void check_strbuf() { int cur_len = string_buf_ptr - string_buffer; if ((cur_len + 1) == buffer_len) { buffer_len += 20; string_buffer = realloc(string_buffer, buffer_len + 1); string_buf_ptr = string_buffer + cur_len; } } #define yy_size_t int #ifndef yyconst #define yyconst #endif #if defined(__STDC__) || defined(__cplusplus) || defined(c_plusplus) #define YY_USE_PROTOS #endif #ifndef YY_PROTO #ifdef YY_USE_PROTOS #define YY_PROTO(proto) proto #else #define YY_PROTO(proto) () #endif #endif extern int yywrap YY_PROTO(( void )) { return 1; } #ifndef input /* flex, not lex */ void yy_delete_buffer YY_PROTO((YY_BUFFER_STATE b)); #ifdef WINNT /* old Windows code for MKS Toolkit version of flex */ static void terminate_string_parse() { yyrestart(NULL); } #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 ); } static char* current_input_string; int my_yy_input(buf,result,max_size) { if (current_input_string == NULL) { result = 0; } else if (max_size < strlen(current_input_string)) { memcpy((void*)buf, current_input_string, max_size); current_input_string += max_size; result = max_size; } else { int n = strlen(current_input_string); memcpy((void*)buf, current_input_string, n+1); current_input_string = NULL; result = n; } /* printf("my_yy_input buf[%s],result[%d]\n",buf,result);*/ return result; } static void setup_for_string_parse(string, defined_types, enum_constants) const char *string; char **defined_types; char **enum_constants; { type_count = defined_type_count; types = defined_types; enums = enum_constants; current_input_string = string; lex_offset = 1; line_count = 1; } #else static YY_BUFFER_STATE bb = NULL; static void reset_types_table(defined_types, enumerated_constants) char **defined_types; char **enumerated_constants; { types = defined_types; enums = enumerated_constants; } static void setup_for_string_parse(string, defined_types, enum_constants) const char *string; char **defined_types; char **enum_constants; { types = defined_types; enums = enum_constants; if ((bb = yy_scan_string(string)) == NULL) { fprintf(stderr, "yyscan_buffer_failed\n"); } lex_offset = 1; line_count = 1; } static void terminate_string_parse() { if (bb) { yy_delete_buffer(bb); bb = NULL; } } #endif #endif